| Safe Haskell | Safe-Inferred |
|---|---|
| Language | Haskell2010 |
Indigo.Backend.Prelude
Description
This module is intended to be imported instead of morley-prelude by
Backend Indigo modules.
This only serves the purpose of listing hiding rules once and avoid boilerplate.
Synopsis
- (++) :: [a] -> [a] -> [a]
- seq :: forall {r :: RuntimeRep} a (b :: TYPE r). a -> b -> b
- filter :: (a -> Bool) -> [a] -> [a]
- zip :: [a] -> [b] -> [(a, b)]
- fst :: (a, b) -> a
- snd :: (a, b) -> b
- otherwise :: Bool
- ($) :: forall (r :: RuntimeRep) a (b :: TYPE r). (a -> 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 where
- class Fractional a => Floating a where
- class Num a => Fractional a where
- (/) :: a -> a -> a
- recip :: a -> a
- fromRational :: Rational -> a
- class (Real a, Enum a) => Integral a where
- class Applicative m => Monad (m :: Type -> Type) where
- class Functor (f :: Type -> Type) where
- class Num a where
- class Eq a => Ord a where
- class Read a
- 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
- type String = [Char]
- 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
- type Type = Type
- data Constraint
- type family CmpNat (a :: Nat) (b :: Nat) :: Ordering where ...
- class a ~R# b => Coercible (a :: k) (b :: k)
- data CallStack
- data ByteString
- byteSwap16 :: Word16 -> Word16
- byteSwap32 :: Word32 -> Word32
- byteSwap64 :: Word64 -> Word64
- data MVar a
- deepseq :: NFData a => a -> b -> b
- force :: NFData a => a -> a
- class NFData a where
- rnf :: a -> ()
- data Set a
- data Map k a
- data SomeException = Exception e => SomeException e
- (.) :: (b -> c) -> (a -> b) -> a -> c
- (=<<) :: Monad m => (a -> m b) -> m a -> m b
- ap :: Monad m => m (a -> b) -> m a -> m b
- asTypeOf :: a -> a -> a
- const :: a -> b -> a
- flip :: (a -> b -> c) -> b -> a -> c
- id :: a -> a
- liftM2 :: Monad m => (a1 -> a2 -> r) -> m a1 -> m a2 -> m r
- ord :: Char -> Int
- when :: Applicative f => Bool -> f () -> f ()
- class Applicative f => Alternative (f :: Type -> Type) where
- class (Alternative m, Monad m) => MonadPlus (m :: Type -> Type) where
- data NonEmpty a = a :| [a]
- subtract :: Num a => a -> a -> a
- curry :: ((a, b) -> c) -> a -> b -> c
- uncurry :: (a -> b -> c) -> (a, b) -> c
- (<$>) :: Functor f => (a -> b) -> f a -> f b
- void :: Functor f => f a -> f ()
- on :: (b -> b -> c) -> (a -> b) -> a -> a -> c
- catMaybes :: [Maybe a] -> [a]
- fromMaybe :: a -> Maybe a -> a
- isJust :: Maybe a -> Bool
- isNothing :: Maybe a -> Bool
- listToMaybe :: [a] -> Maybe a
- mapMaybe :: (a -> Maybe b) -> [a] -> [b]
- maybe :: b -> (a -> b) -> Maybe a -> b
- maybeToList :: Maybe a -> [a]
- break :: (a -> Bool) -> [a] -> ([a], [a])
- cycle :: [a] -> [a]
- drop :: Int -> [a] -> [a]
- dropWhile :: (a -> Bool) -> [a] -> [a]
- iterate :: (a -> a) -> a -> [a]
- repeat :: a -> [a]
- replicate :: Int -> a -> [a]
- reverse :: [a] -> [a]
- scanl :: (b -> a -> b) -> b -> [a] -> [b]
- scanr :: (a -> b -> b) -> b -> [a] -> [b]
- splitAt :: Int -> [a] -> ([a], [a])
- take :: Int -> [a] -> [a]
- takeWhile :: (a -> Bool) -> [a] -> [a]
- unzip :: [(a, b)] -> ([a], [b])
- unzip3 :: [(a, b, c)] -> ([a], [b], [c])
- zip3 :: [a] -> [b] -> [c] -> [(a, b, c)]
- zipWith :: (a -> b -> c) -> [a] -> [b] -> [c]
- chr :: Int -> Char
- (^) :: (Num a, Integral b) => a -> b -> a
- (^^) :: (Fractional a, Integral b) => a -> b -> a
- even :: Integral a => a -> Bool
- gcd :: Integral a => a -> a -> a
- lcm :: Integral a => a -> a -> a
- odd :: Integral a => a -> Bool
- data Proxy (t :: k) = Proxy
- either :: (a -> c) -> (b -> c) -> Either a b -> c
- partitionEithers :: [Either a b] -> ([a], [b])
- readMaybe :: Read a => String -> Maybe a
- reads :: Read a => ReadS a
- comparing :: Ord a => (b -> a) -> b -> b -> Ordering
- intercalate :: [a] -> [[a]] -> [a]
- intersperse :: a -> [a] -> [a]
- isPrefixOf :: Eq a => [a] -> [a] -> Bool
- sort :: Ord a => [a] -> [a]
- sortBy :: (a -> a -> Ordering) -> [a] -> [a]
- unfoldr :: (b -> Maybe (a, b)) -> b -> [a]
- concat :: Foldable t => t [a] -> [a]
- concatMap :: Foldable t => (a -> [b]) -> t a -> [b]
- newtype Const a (b :: k) = Const {
- getConst :: a
- class (Typeable e, Show e) => Exception e where
- toException :: e -> SomeException
- fromException :: SomeException -> Maybe e
- displayException :: e -> String
- prettyCallStack :: CallStack -> String
- type FilePath = String
- callStack :: HasCallStack => CallStack
- withFrozenCallStack :: HasCallStack => (HasCallStack => a) -> a
- newtype Identity a = Identity {
- runIdentity :: a
- optional :: Alternative f => f a -> f (Maybe a)
- for :: (Traversable t, Applicative f) => t a -> (a -> f b) -> f (t b)
- filterM :: Applicative m => (a -> m Bool) -> [a] -> m [a]
- foldM :: (Foldable t, Monad m) => (b -> a -> m b) -> b -> t a -> m b
- unless :: Applicative f => Bool -> f () -> f ()
- head :: NonEmpty a -> a
- init :: NonEmpty a -> [a]
- last :: NonEmpty a -> a
- tail :: NonEmpty a -> [a]
- absurd :: Void -> a
- vacuous :: Functor f => f Void -> f a
- data Void
- class MonadTrans (t :: (Type -> Type) -> Type -> Type) where
- liftM3 :: Monad m => (a1 -> a2 -> a3 -> r) -> m a1 -> m a2 -> m a3 -> m r
- liftM4 :: Monad m => (a1 -> a2 -> a3 -> a4 -> r) -> m a1 -> m a2 -> m a3 -> m a4 -> m r
- liftM5 :: Monad m => (a1 -> a2 -> a3 -> a4 -> a5 -> r) -> m a1 -> m a2 -> m a3 -> m a4 -> m a5 -> m r
- fix :: (a -> a) -> a
- forM :: (Traversable t, Monad m) => t a -> (a -> m b) -> m (t b)
- (<$!>) :: Monad m => (a -> b) -> m a -> m b
- (<=<) :: Monad m => (b -> m c) -> (a -> m b) -> a -> m c
- (>=>) :: Monad m => (a -> m b) -> (b -> m c) -> a -> m c
- foldM_ :: (Foldable t, Monad m) => (b -> a -> m b) -> b -> t a -> m ()
- forever :: Applicative f => f a -> f b
- mapAndUnzipM :: Applicative m => (a -> m (b, c)) -> [a] -> m ([b], [c])
- mfilter :: MonadPlus m => (a -> Bool) -> m a -> m a
- replicateM :: Applicative m => Int -> m a -> m [a]
- replicateM_ :: Applicative m => Int -> m a -> m ()
- zipWithM :: Applicative m => (a -> b -> m c) -> [a] -> [b] -> m [c]
- zipWithM_ :: Applicative m => (a -> b -> m c) -> [a] -> [b] -> m ()
- class Monad m => MonadIO (m :: Type -> Type) where
- modify :: MonadState s m => (s -> s) -> m ()
- type Word62 = OddWord Word64 (One (One (One (One (One (Zero ()))))))
- type Word63 = OddWord Word64 (One (One (One (One (One (One ()))))))
- class Monad m => MonadReader r (m :: Type -> Type) | m -> r where
- class Monad m => MonadState s (m :: Type -> Type) | m -> s where
- class Hashable a where
- hashWithSalt :: Int -> a -> Int
- data Text
- data HashMap k v
- stdout :: Handle
- data Handle
- class Bifunctor (p :: Type -> Type -> Type) where
- newtype Compose (f :: k -> Type) (g :: k1 -> k) (a :: k1) = Compose {
- getCompose :: f (g a)
- data WrappedMonoid m
- newtype Option a = Option {}
- mtimesDefault :: (Integral b, Monoid a) => b -> a -> a
- cycle1 :: Semigroup m => m -> m
- sortWith :: Ord b => (a -> b) -> [a] -> [a]
- nonEmpty :: [a] -> Maybe (NonEmpty a)
- showStackTrace :: IO (Maybe String)
- getStackTrace :: IO (Maybe [Location])
- mapAccumR :: Traversable t => (s -> a -> (s, b)) -> s -> t a -> (s, t b)
- mapAccumL :: Traversable t => (s -> a -> (s, b)) -> s -> t a -> (s, t b)
- foldMapDefault :: (Traversable t, Monoid m) => (a -> m) -> t a -> m
- fmapDefault :: Traversable t => (a -> b) -> t a -> t b
- newtype ZipList a = ZipList {
- getZipList :: [a]
- (&&&) :: Arrow a => a b c -> a b c' -> a b (c, c')
- stdin :: Handle
- stderr :: Handle
- data TVar a
- data STM a
- writeTVar :: TVar a -> a -> STM ()
- readTVar :: TVar a -> STM a
- newTVar :: a -> STM (TVar a)
- data IORef a
- prettySrcLoc :: SrcLoc -> String
- foldrM :: (Foldable t, Monad m) => (a -> b -> m b) -> b -> t a -> m b
- foldlM :: (Foldable t, Monad m) => (b -> a -> m b) -> b -> t a -> m b
- transpose :: [[a]] -> [[a]]
- tails :: [a] -> [[a]]
- subsequences :: [a] -> [[a]]
- sortOn :: Ord b => (a -> b) -> [a] -> [a]
- permutations :: [a] -> [[a]]
- inits :: [a] -> [[a]]
- group :: Eq a => [a] -> [[a]]
- genericTake :: Integral i => i -> [a] -> [a]
- genericSplitAt :: Integral i => i -> [a] -> ([a], [a])
- genericReplicate :: Integral i => i -> a -> [a]
- genericLength :: Num i => [a] -> i
- genericDrop :: Integral i => i -> [a] -> [a]
- newtype Last a = Last {}
- newtype First a = First {}
- newtype Sum a = Sum {
- getSum :: a
- newtype Product a = Product {
- getProduct :: a
- newtype Endo a = Endo {
- appEndo :: a -> a
- newtype Dual a = Dual {
- getDual :: a
- newtype Alt (f :: k -> Type) (a :: k) = Alt {
- getAlt :: f a
- stimesMonoid :: (Integral b, Monoid a) => b -> a -> a
- stimesIdempotent :: Integral b => b -> a -> a
- newtype Down a = Down {
- getDown :: a
- data SomeNat = KnownNat n => SomeNat (Proxy n)
- someNatVal :: Natural -> SomeNat
- natVal :: forall (n :: Nat) proxy. KnownNat n => proxy n -> Natural
- rights :: [Either a b] -> [b]
- lefts :: [Either a b] -> [a]
- isRight :: Either a b -> Bool
- isLeft :: Either a b -> Bool
- data IOMode
- xor :: Bits a => a -> a -> a
- underflowError :: a
- reduce :: Integral a => a -> a -> Ratio a
- ratioZeroDenominatorError :: a
- ratioPrec1 :: Int
- ratioPrec :: Int
- overflowError :: a
- numericEnumFromTo :: (Ord a, Fractional a) => a -> a -> [a]
- numericEnumFromThenTo :: (Ord a, Fractional a) => a -> a -> a -> [a]
- numericEnumFromThen :: Fractional a => a -> a -> [a]
- numericEnumFrom :: Fractional a => a -> [a]
- numerator :: Ratio a -> a
- notANumber :: Rational
- naturalFromInt :: Int -> Natural
- integralEnumFromTo :: Integral a => a -> a -> [a]
- integralEnumFromThenTo :: Integral a => a -> a -> a -> [a]
- integralEnumFromThen :: (Integral a, Bounded a) => a -> a -> [a]
- integralEnumFrom :: (Integral a, Bounded a) => a -> [a]
- infinity :: Rational
- divZeroError :: a
- denominator :: Ratio a -> a
- (^^%^^) :: Integral a => Rational -> a -> Rational
- (^%^) :: Integral a => Rational -> a -> Rational
- boundedEnumFromThen :: (Enum a, Bounded a) => a -> a -> [a]
- boundedEnumFrom :: (Enum a, Bounded a) => a -> [a]
- bool :: a -> a -> Bool -> a
- (&) :: a -> (a -> b) -> b
- (<&>) :: Functor f => f a -> (a -> b) -> f b
- ($>) :: Functor f => f a -> b -> f b
- swap :: (a, b) -> (b, a)
- currentCallStack :: IO [String]
- minInt :: Int
- maxInt :: Int
- liftA3 :: Applicative f => (a -> b -> c -> d) -> f a -> f b -> f c -> f d
- (<**>) :: Applicative f => f a -> f (a -> b) -> f b
- type HasCallStack = ?callStack :: CallStack
- getCallStack :: CallStack -> [([Char], SrcLoc)]
- stimesIdempotentMonoid :: (Integral b, Monoid a) => b -> a -> a
- data IdentityT (f :: k -> Type) (a :: k)
- data IntMap a
- data IntSet
- data Seq a
- ($!!) :: NFData a => (a -> b) -> a -> b
- runExceptT :: ExceptT e m a -> m (Either e a)
- newtype ExceptT e (m :: Type -> Type) a = ExceptT (m (Either e a))
- newtype MaybeT (m :: Type -> Type) a = MaybeT {}
- class Monad m => MonadThrow (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)
- class MonadThrow m => MonadCatch (m :: Type -> Type)
- type family IntBaseType a :: IntBaseTypeK
- 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
- preuse :: MonadState s m => Getting (First a) s a -> m (Maybe a)
- preview :: MonadReader s m => Getting (First a) s a -> m (Maybe a)
- (^?) :: s -> Getting (First a) s a -> Maybe a
- (^..) :: s -> Getting (Endo [a]) s a -> [a]
- use :: MonadState s m => Getting a s a -> m a
- (^.) :: s -> Getting a s a -> a
- view :: MonadReader s m => Getting a s a -> m a
- _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
- (.~) :: ASetter s t a b -> b -> s -> t
- (%~) :: ASetter s t a b -> (a -> b) -> s -> t
- set :: ASetter s t a b -> b -> s -> t
- over :: ASetter s t a b -> (a -> b) -> s -> t
- 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
- type ($) (f :: k1 -> k) (a :: k1) = f a
- undefined :: forall (r :: RuntimeRep) (a :: TYPE r). HasCallStack => a
- fromInteger :: (HasCallStack, Integral a) => Integer -> a
- error :: forall (r :: RuntimeRep) (a :: TYPE r). HasCallStack => Text -> a
- asks :: MonadReader r m => (r -> a) -> m a
- newtype ReaderT r (m :: Type -> Type) a = ReaderT {
- runReaderT :: r -> m a
- type family Each (c :: [k -> Constraint]) (as :: [k]) where ...
- fromIntegral :: (Integral a, Integral b, CheckIntSubType a b) => a -> b
- unsafeM :: (MonadFail m, Buildable a) => Either a b -> m b
- unsafe :: (HasCallStack, Buildable a) => Either a b -> b
- show :: forall b a. (PrettyShow a, Show a, IsString b) => a -> b
- type family PrettyShow a
- fromIntegralNoOverflow :: (Integral a, Integral b) => a -> Either ArithException b
- fromIntegralOverflowing :: (Integral a, Num b) => a -> b
- fromIntegralToRealFrac :: (Integral a, RealFrac b, CheckIntSubType a Integer) => a -> b
- fromIntegralMaybe :: (Integral a, Integral b, Bits a, Bits b) => a -> Maybe b
- type CheckIntSubType a b = (CheckIntSubTypeErrors a b (IsIntSubType a b), IsIntSubType a b ~ 'True)
- all1 :: Boolean b => (a -> b) -> NonEmpty a -> b
- any1 :: Boolean b => (a -> b) -> NonEmpty a -> b
- all :: (Container c, BooleanMonoid b) => (Element c -> b) -> c -> b
- any :: (Container c, BooleanMonoid b) => (Element c -> b) -> c -> b
- and1 :: Boolean a => NonEmpty a -> a
- or1 :: Boolean a => NonEmpty a -> a
- and :: (Container c, BooleanMonoid (Element c)) => c -> Element c
- or :: (Container c, BooleanMonoid (Element c)) => c -> Element c
- class Boolean a where
- class Boolean a => BooleanMonoid a where
- newtype All a = All {
- getAll :: a
- newtype Any a = Any {
- getAny :: a
- newtype ApplicativeBoolean (f :: k -> Type) (bool :: k) = ApplicativeBoolean (f bool)
- pass :: Applicative f => f ()
- someNE :: Alternative f => f a -> f (NonEmpty a)
- ($!) :: (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
- updateMVar' :: MonadIO m => MVar s -> StateT s IO a -> m a
- updateTVar' :: TVar s -> StateT s STM a -> STM 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 ()
- (?:) :: Maybe a -> a -> a
- 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
- whenLeft :: Applicative f => Either l r -> (l -> f ()) -> f ()
- whenLeftM :: Monad m => m (Either l r) -> (l -> m ()) -> m ()
- whenRight :: Applicative f => Either l r -> (r -> f ()) -> f ()
- 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
- hoistMaybe :: forall (m :: Type -> Type) a. Applicative m => Maybe a -> MaybeT m a
- hoistEither :: forall (m :: Type -> Type) e a. Applicative m => Either e a -> ExceptT e m a
- 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
- foldMap :: Monoid m => (Element t -> m) -> t -> m
- fold :: t -> Element t
- foldr' :: (Element t -> b -> b) -> b -> t -> b
- notElem :: Element t -> t -> Bool
- find :: (Element t -> Bool) -> t -> Maybe (Element t)
- safeHead :: t -> Maybe (Element t)
- safeMaximum :: t -> Maybe (Element t)
- safeMinimum :: t -> Maybe (Element t)
- safeFoldr1 :: (Element t -> Element t -> Element t) -> t -> Maybe (Element t)
- safeFoldl1 :: (Element t -> Element t -> Element t) -> t -> Maybe (Element t)
- type family Element t
- class FromList l where
- type ListElement l
- type FromListC l
- fromList :: [ListElement l] -> l
- type family ListElement l
- type family FromListC l
- 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 ()
- foldl1 :: (a -> a -> a) -> NonEmpty a -> a
- foldr1 :: (a -> a -> a) -> NonEmpty a -> a
- minimumBy :: (a -> a -> Ordering) -> NonEmpty a -> a
- minimum :: Ord a => NonEmpty a -> a
- maximumBy :: (a -> a -> Ordering) -> NonEmpty a -> a
- maximum :: Ord a => NonEmpty a -> a
- 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
- exceptToMaybeT :: forall (m :: Type -> Type) e a. Functor m => ExceptT e m a -> MaybeT m a
- maybeToExceptT :: forall (m :: Type -> Type) e a. Functor m => e -> MaybeT m a -> ExceptT e m a
- lenientDecode :: OnDecodeError
- strictDecode :: OnDecodeError
- type OnDecodeError = OnError Word8 Char
- type OnError a b = String -> Maybe a -> Maybe b
- data UnicodeException
- decodeUtf8' :: ByteString -> Either UnicodeException Text
- decodeUtf8With :: OnDecodeError -> ByteString -> Text
- lines :: Text -> [Text]
- unlines :: [Text] -> Text
- unwords :: [Text] -> Text
- words :: 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
- withState :: (s -> s) -> State s a -> State s a
- runState :: State s a -> s -> (a, s)
- execStateT :: Monad m => StateT s m a -> s -> m s
- execState :: State s a -> s -> s
- evalStateT :: Monad m => StateT s m a -> s -> m a
- evalState :: State s a -> s -> a
- runReader :: Reader r a -> r -> a
- modify' :: MonadState s m => (s -> s) -> m ()
Documentation
(++) :: [a] -> [a] -> [a] infixr 5 #
Append two lists, i.e.,
[x1, ..., xm] ++ [y1, ..., yn] == [x1, ..., xm, y1, ..., yn] [x1, ..., xm] ++ [y1, ...] == [x1, ..., xm, y1, ...]
If the first list is not finite, the result is the first list.
seq :: forall {r :: RuntimeRep} a (b :: TYPE r). a -> b -> b infixr 0 #
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] #
\(\mathcal{O}(n)\). filter, applied to a predicate and a list, returns
the list of those elements that satisfy the predicate; i.e.,
filter p xs = [ x | x <- xs, p x]
>>>filter odd [1, 2, 3][1,3]
zip :: [a] -> [b] -> [(a, b)] #
\(\mathcal{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 shorter than the other, excess elements of the longer list are discarded, even if one of the lists is infinite:
>>>zip [1] ['a', 'b'][(1, 'a')]>>>zip [1, 2] ['a'][(1, 'a')]>>>zip [] [1..][]>>>zip [1..] [][]
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.
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.
'join bssdo expression
do bs <- bss bs
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
Class Enum defines operations on sequentially ordered types.
The enumFrom... methods are used in Haskell's translation of
arithmetic sequences.
Instances of Enum may be derived for any enumeration type (types
whose constructors have no fields). The nullary constructors are
assumed to be numbered left-to-right by fromEnum from 0 through n-1.
See Chapter 10 of the Haskell Report for more details.
For any type that is an instance of class Bounded as well as Enum,
the following should hold:
- The calls
succmaxBoundpredminBound fromEnumandtoEnumshould give a runtime error if the result value is not representable in the result type. For example,toEnum7 ::BoolenumFromandenumFromThenshould be defined with an implicit bound, thus:
enumFrom x = enumFromTo x maxBound
enumFromThen x y = enumFromThenTo x y bound
where
bound | fromEnum y >= fromEnum x = maxBound
| otherwise = minBoundMethods
the successor of a value. For numeric types, succ adds 1.
the predecessor of a value. For numeric types, pred subtracts 1.
Convert from an Int.
Convert to an Int.
It is implementation-dependent what fromEnum returns when
applied to a value that is too large to fit in an Int.
Used in Haskell's translation of [n..] with [n..] = enumFrom n,
a possible implementation being enumFrom n = n : enumFrom (succ n).
For example:
enumFrom 4 :: [Integer] = [4,5,6,7,...]
enumFrom 6 :: [Int] = [6,7,8,9,...,maxBound :: Int]
enumFromThen :: a -> a -> [a] #
Used in Haskell's translation of [n,n'..]
with [n,n'..] = enumFromThen n n', a possible implementation being
enumFromThen n n' = n : n' : worker (f x) (f x n'),
worker s v = v : worker s (s v), x = fromEnum n' - fromEnum n and
f n y
| n > 0 = f (n - 1) (succ y)
| n < 0 = f (n + 1) (pred y)
| otherwise = y
For example:
enumFromThen 4 6 :: [Integer] = [4,6,8,10...]
enumFromThen 6 2 :: [Int] = [6,2,-2,-6,...,minBound :: Int]
enumFromTo :: a -> a -> [a] #
Used in Haskell's translation of [n..m] with
[n..m] = enumFromTo n m, a possible implementation being
enumFromTo n m
| n <= m = n : enumFromTo (succ n) m
| otherwise = [].
For example:
enumFromTo 6 10 :: [Int] = [6,7,8,9,10]
enumFromTo 42 1 :: [Integer] = []
enumFromThenTo :: a -> a -> a -> [a] #
Used in Haskell's translation of [n,n'..m] with
[n,n'..m] = enumFromThenTo n n' m, a possible implementation
being enumFromThenTo n n' m = worker (f x) (c x) n m,
x = fromEnum n' - fromEnum n, c x = bool (>=) ((x 0)
f n y
| n > 0 = f (n - 1) (succ y)
| n < 0 = f (n + 1) (pred y)
| otherwise = y and
worker s c v m
| c v m = v : worker s c (s v) m
| otherwise = []
For example:
enumFromThenTo 4 2 -6 :: [Integer] = [4,2,0,-2,-4,-6]
enumFromThenTo 6 8 2 :: [Int] = []
Instances
The Eq class defines equality (==) and inequality (/=).
All the basic datatypes exported by the Prelude are instances of Eq,
and Eq may be derived for any datatype whose constituents are also
instances of Eq.
The Haskell Report defines no laws for Eq. However, == is customarily
expected to implement an equivalence relationship where two values comparing
equal are indistinguishable by "public" functions, with a "public" function
being one not allowing to see implementation details. For example, for a
type representing non-normalised natural numbers modulo 100, a "public"
function doesn't make the difference between 1 and 201. It is expected to
have the following properties:
Instances
class Fractional a => Floating a where #
Trigonometric and hyperbolic functions and related functions.
The Haskell Report defines no laws for Floating. However, (, +)(
and *)exp are customarily expected to define an exponential field and have
the following properties:
exp (a + b)=exp a * exp bexp (fromInteger 0)=fromInteger 1
Minimal complete definition
pi, exp, log, sin, cos, asin, acos, atan, sinh, cosh, asinh, acosh, atanh
Instances
class Num a => Fractional a where #
Fractional numbers, supporting real division.
The Haskell Report defines no laws for Fractional. However, ( and
+)( are customarily expected to define a division ring and have the
following properties:*)
recipgives the multiplicative inversex * recip x=recip x * x=fromInteger 1
Note that it isn't customarily expected that a type instance of
Fractional implement a field. However, all instances in base do.
Minimal complete definition
fromRational, (recip | (/))
Methods
Fractional division.
Reciprocal fraction.
fromRational :: Rational -> a #
Conversion from a Rational (that is Ratio IntegerfromRational
to a value of type Rational, so such literals have type
(.Fractional a) => a
Instances
class (Real a, Enum a) => Integral a where #
Integral numbers, supporting integer division.
The Haskell Report defines no laws for Integral. However, Integral
instances are customarily expected to define a Euclidean domain and have the
following properties for the div/mod and quot/rem pairs, given
suitable Euclidean functions f and g:
x=y * quot x y + rem x ywithrem x y=fromInteger 0org (rem x y)<g yx=y * div x y + mod x ywithmod x y=fromInteger 0orf (mod x y)<f y
An example of a suitable Euclidean function, for Integer's instance, is
abs.
Methods
quot :: a -> a -> a infixl 7 #
integer division truncated toward zero
integer remainder, satisfying
(x `quot` y)*y + (x `rem` y) == x
integer division truncated toward negative infinity
integer modulus, satisfying
(x `div` y)*y + (x `mod` y) == x
conversion to Integer
Instances
class Applicative m => Monad (m :: Type -> Type) where #
The Monad class defines the basic operations over a monad,
a concept from a branch of mathematics known as category theory.
From the perspective of a Haskell programmer, however, it is best to
think of a monad as an abstract datatype of actions.
Haskell's do expressions provide a convenient syntax for writing
monadic expressions.
Instances of Monad should satisfy the following:
- 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.
'as ' can be understood as the >>= bsdo expression
do a <- as bs a
Inject a value into the monadic type.
Instances
| Monad IResult | |
| Monad Parser | |
| Monad Result | |
| Monad Complex | Since: base-4.9.0.0 |
| Monad Identity | Since: base-4.8.0.0 |
| Monad First | Since: base-4.8.0.0 |
| Monad Last | Since: base-4.8.0.0 |
| Monad Down | Since: base-4.11.0.0 |
| Monad First | Since: base-4.9.0.0 |
| Monad Last | Since: base-4.9.0.0 |
| Monad Max | Since: base-4.9.0.0 |
| Monad Min | Since: base-4.9.0.0 |
| Monad Option | Since: base-4.9.0.0 |
| Monad Dual | Since: base-4.8.0.0 |
| Monad Product | Since: base-4.8.0.0 |
| Monad Sum | Since: base-4.8.0.0 |
| Monad NonEmpty | Since: base-4.9.0.0 |
| Monad STM | Since: base-4.3.0.0 |
| Monad Par1 | Since: base-4.9.0.0 |
| Monad P | Since: base-2.1 |
| Monad ReadP | Since: base-2.1 |
| Monad Put | |
| Monad Identifier | |
Defined in Text.Casing Methods (>>=) :: Identifier a -> (a -> Identifier b) -> Identifier b # (>>) :: Identifier a -> Identifier b -> Identifier b # return :: a -> Identifier a # | |
| Monad Seq | |
| Monad Tree | |
| 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 DNonEmpty | |
| Monad DList | |
| Monad IO | Since: base-2.1 |
| Monad IndigoM Source # | |
| Monad WithFinalizedDoc | |
Defined in Morley.Michelson.Doc Methods (>>=) :: WithFinalizedDoc a -> (a -> WithFinalizedDoc b) -> WithFinalizedDoc b # (>>) :: WithFinalizedDoc a -> WithFinalizedDoc b -> WithFinalizedDoc b # return :: a -> WithFinalizedDoc a # | |
| Monad EvalOp | |
| Monad Array | |
| 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 PprM | |
| Monad Q | |
| Monad Vector | |
| Monad Identity | |
| Monad Thunk | |
| Monad Maybe | Since: base-2.1 |
| Monad Solo | Since: base-4.15 |
| Monad [] | Since: base-2.1 |
| () :=> (Monad (Either a)) | |
| () :=> (Monad Identity) | |
| () :=> (Monad IO) | |
| () :=> (Monad ((->) a)) | |
Defined in Data.Constraint | |
| () :=> (Monad []) | |
Defined in Data.Constraint | |
| 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 (Either e) | Since: base-4.4.0.0 |
| Monad (Proxy :: Type -> Type) | Since: base-4.7.0.0 |
| Monad (U1 :: Type -> Type) | Since: base-4.9.0.0 |
| Monad (ST s) | Since: base-2.1 |
| Monad (SetM s) | |
| DRG gen => Monad (MonadPseudoRandom gen) | |
Defined in Crypto.Random.Types Methods (>>=) :: MonadPseudoRandom gen a -> (a -> MonadPseudoRandom gen b) -> MonadPseudoRandom gen b # (>>) :: MonadPseudoRandom gen a -> MonadPseudoRandom gen b -> MonadPseudoRandom gen b # return :: a -> MonadPseudoRandom gen a # | |
| Alternative f => Monad (Cofree f) | |
| Functor f => Monad (Free f) | |
| Monad (Program instr) Source # | |
| Monad m => Monad (Yoneda m) | |
| 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 (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 # | |
| SingI n => Monad (SizedList' n) | |
Defined in Morley.Util.SizedList Methods (>>=) :: SizedList' n a -> (a -> SizedList' n b) -> SizedList' n b # (>>) :: SizedList' n a -> SizedList' n b -> SizedList' n b # return :: a -> SizedList' n a # | |
| Semigroup a => Monad (These a) | |
| Semigroup a => Monad (These a) | |
| Monad m => Monad (MaybeT m) | |
| Monoid a => Monad ((,) a) | Since: base-4.9.0.0 |
| (Monad m) :=> (Applicative (WrappedMonad m)) | |
Defined in Data.Constraint Methods ins :: Monad m :- Applicative (WrappedMonad m) # | |
| (Monad m) :=> (Functor (WrappedMonad m)) | |
Defined in Data.Constraint | |
| Class (Applicative f) (Monad f) | |
Defined in Data.Constraint Methods cls :: Monad f :- Applicative f # | |
| Monad m => Monad (RandT g m) | |
| Monad m => Monad (RandT g m) | |
| Monad m => Monad (Kleisli m a) | Since: base-4.14.0.0 |
| Monad f => Monad (Ap f) | Since: base-4.12.0.0 |
| Monad f => Monad (Alt f) | Since: base-4.8.0.0 |
| Monad f => Monad (Rec1 f) | Since: base-4.9.0.0 |
| (Applicative f, Monad f) => Monad (WhenMissing f x) | Equivalent to Since: containers-0.5.9 |
Defined in Data.IntMap.Internal Methods (>>=) :: WhenMissing f x a -> (a -> WhenMissing f x b) -> WhenMissing f x b # (>>) :: WhenMissing f x a -> WhenMissing f x b -> WhenMissing f x b # return :: a -> WhenMissing f x a # | |
| (Alternative f, Monad w) => Monad (CofreeT f w) | |
| (Functor f, Monad m) => Monad (FreeT f m) | |
| Monad (Indexed i a) | |
| (Monad (Rep p), Representable p) => Monad (Prep p) | |
| Monad (Tagged s) | |
| (Monad m, Error e) => Monad (ErrorT e m) | |
| Monad m => Monad (ExceptT e m) | |
| Monad m => Monad (IdentityT m) | |
| Monad m => Monad (ReaderT r m) | |
| Monad m => Monad (StateT s m) | |
| Monad m => Monad (StateT s m) | |
| (Monoid a, Monoid b) => Monad ((,,) a b) | Since: base-4.14.0.0 |
| Class (Monad f, Alternative f) (MonadPlus f) | |
Defined in Data.Constraint | |
| (Monad f, Monad g) => Monad (Product f g) | Since: base-4.9.0.0 |
| (Monad f, Monad g) => Monad (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 # | |
| (Monoid a, Monoid b, Monoid c) => Monad ((,,,) a b c) | Since: base-4.14.0.0 |
| Monad ((->) r) | Since: base-2.1 |
| 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
Methods
fmap :: (a -> b) -> f a -> f b #
fmap is used to apply a function of type (a -> b) to a value of type f a,
where f is a functor, to produce a value of type f b.
Note that for any type constructor with more than one parameter (e.g., Either),
only the last type parameter can be modified with fmap (e.g., b in `Either a b`).
Some type constructors with two parameters or more have a Bifunctor
Convert from a Maybe IntMaybe String
using show:
>>>fmap show NothingNothing>>>fmap show (Just 3)Just "3"
Convert from an Either Int IntEither Int String using show:
>>>fmap show (Left 17)Left 17>>>fmap show (Right 17)Right "17"
Double each element of a list:
>>>fmap (*2) [1,2,3][2,4,6]
Apply even to the second element of a pair:
>>>fmap even (2,2)(2,True)
It may seem surprising that the function is only applied to the last element of the tuple
compared to the list example above which applies it to every element in the list.
To understand, remember that tuples are type constructors with multiple type parameters:
a tuple of 3 elements `(a,b,c)` can also be written `(,,) a b c` and its Functor instance
is defined for `Functor ((,,) a b)` (i.e., only the third parameter is free to be mapped over
with fmap).
It explains why fmap can be used with tuples containing values of different types as in the
following example:
>>>fmap even ("hello", 1.0, 4)("hello",1.0,True)
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.
Absolute value.
Instances
The Ord class is used for totally ordered datatypes.
Instances of Ord can be derived for any user-defined datatype whose
constituent types are in Ord. The declared order of the constructors in
the data declaration determines the ordering in derived Ord instances. The
Ordering datatype allows a single comparison to determine the precise
ordering of two objects.
The Haskell Report defines no laws for Ord. However, <= is customarily
expected to implement a non-strict partial order and have the following
properties:
- Transitivity
- if
x <= y && y <= z=True, thenx <= z=True - Reflexivity
x <= x=True- Antisymmetry
- if
x <= y && y <= x=True, thenx == y=True
Note that the following operator interactions are expected to hold:
x >= y=y <= xx < y=x <= y && x /= yx > y=y < xx < y=compare x y == LTx > y=compare x y == GTx == y=compare x y == EQmin x y == if x <= y then x else y=Truemax x y == if x >= y then x else y=True
Note that (7.) and (8.) do not require min and max to return either of
their arguments. The result is merely required to equal one of the
arguments in terms of (==).
Minimal complete definition: either compare or <=.
Using compare can be more efficient for complex types.
Methods
compare :: a -> a -> Ordering #
(<) :: a -> a -> Bool infix 4 #
(<=) :: a -> a -> Bool infix 4 #
(>) :: a -> a -> Bool infix 4 #
Instances
Parsing of Strings, producing values.
Derived instances of Read make the following assumptions, which
derived instances of Show obey:
- If the constructor is defined to be an infix operator, then the
derived
Readinstance will parse only infix applications of the constructor (not the prefix form). - Associativity is not used to reduce the occurrence of parentheses, although precedence may be.
- If the constructor is defined using record syntax, the derived
Readwill parse only the record-syntax form, and furthermore, the fields must be given in the same order as the original declaration. - The derived
Readinstance allows arbitrary Haskell whitespace between tokens of the input string. Extra parentheses are also allowed.
For example, given the declarations
infixr 5 :^: data Tree a = Leaf a | Tree a :^: Tree a
the derived instance of Read in Haskell 2010 is equivalent to
instance (Read a) => Read (Tree a) where
readsPrec d r = readParen (d > app_prec)
(\r -> [(Leaf m,t) |
("Leaf",s) <- lex r,
(m,t) <- readsPrec (app_prec+1) s]) r
++ readParen (d > up_prec)
(\r -> [(u:^:v,w) |
(u,s) <- readsPrec (up_prec+1) r,
(":^:",t) <- lex s,
(v,w) <- readsPrec (up_prec+1) t]) r
where app_prec = 10
up_prec = 5Note that right-associativity of :^: is unused.
The derived instance in GHC is equivalent to
instance (Read a) => Read (Tree a) where
readPrec = parens $ (prec app_prec $ do
Ident "Leaf" <- lexP
m <- step readPrec
return (Leaf m))
+++ (prec up_prec $ do
u <- step readPrec
Symbol ":^:" <- lexP
v <- step readPrec
return (u :^: v))
where app_prec = 10
up_prec = 5
readListPrec = readListPrecDefaultWhy do both readsPrec and readPrec exist, and why does GHC opt to
implement readPrec in derived Read instances instead of readsPrec?
The reason is that readsPrec is based on the ReadS type, and although
ReadS is mentioned in the Haskell 2010 Report, it is not a very efficient
parser data structure.
readPrec, on the other hand, is based on a much more efficient ReadPrec
datatype (a.k.a "new-style parsers"), but its definition relies on the use
of the RankNTypes language extension. Therefore, readPrec (and its
cousin, readListPrec) are marked as GHC-only. Nevertheless, it is
recommended to use readPrec instead of readsPrec whenever possible
for the efficiency improvements it brings.
As mentioned above, derived Read instances in GHC will implement
readPrec instead of readsPrec. The default implementations of
readsPrec (and its cousin, readList) will simply use readPrec under
the hood. If you are writing a Read instance by hand, it is recommended
to write it like so:
instanceReadT wherereadPrec= ...readListPrec=readListPrecDefault
Instances
| Read CabalSpecVersion | |
Defined in Distribution.CabalSpecVersion Methods readsPrec :: Int -> ReadS CabalSpecVersion # readList :: ReadS [CabalSpecVersion] # | |
| Read Extension | |
| Read KnownExtension | |
Defined in Language.Haskell.Extension Methods readsPrec :: Int -> ReadS KnownExtension # readList :: ReadS [KnownExtension] # | |
| Read Language | |
| Read DotNetTime | |
Defined in Data.Aeson.Types.Internal Methods readsPrec :: Int -> ReadS DotNetTime # readList :: ReadS [DotNetTime] # readPrec :: ReadPrec DotNetTime # readListPrec :: ReadPrec [DotNetTime] # | |
| Read Value | |
| Read All | Since: base-2.1 |
| Read Any | Since: base-2.1 |
| Read Version | Since: base-2.1 |
| Read Void | Reading a Since: base-4.8.0.0 |
| Read Associativity | Since: base-4.6.0.0 |
Defined in GHC.Generics Methods readsPrec :: Int -> ReadS Associativity # readList :: ReadS [Associativity] # | |
| Read DecidedStrictness | Since: base-4.9.0.0 |
Defined in GHC.Generics Methods readsPrec :: Int -> ReadS DecidedStrictness # readList :: ReadS [DecidedStrictness] # | |
| Read Fixity | Since: base-4.6.0.0 |
| Read SourceStrictness | Since: base-4.9.0.0 |
Defined in GHC.Generics Methods readsPrec :: Int -> ReadS SourceStrictness # readList :: ReadS [SourceStrictness] # | |
| Read SourceUnpackedness | Since: base-4.9.0.0 |
Defined in GHC.Generics Methods readsPrec :: Int -> ReadS SourceUnpackedness # readList :: ReadS [SourceUnpackedness] # | |
| 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 IOMode | Since: base-4.2.0.0 |
| Read Int16 | Since: base-2.1 |
| Read Int32 | Since: base-2.1 |
| Read Int64 | Since: base-2.1 |
| Read Int8 | Since: base-2.1 |
| Read GCDetails | Since: base-4.10.0.0 |
| Read RTSStats | Since: base-4.10.0.0 |
| 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 GeneralCategory | Since: base-2.1 |
Defined in GHC.Read Methods readsPrec :: Int -> ReadS GeneralCategory # readList :: ReadS [GeneralCategory] # | |
| Read Word16 | Since: base-2.1 |
| Read Word32 | Since: base-2.1 |
| Read Word64 | Since: base-2.1 |
| Read Lexeme | Since: base-2.1 |
| Read Bit | |
| 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 ShortByteString | |
Defined in Data.ByteString.Short.Internal Methods readsPrec :: Int -> ReadS ShortByteString # readList :: ReadS [ShortByteString] # | |
| Read Clock | |
| Read TimeSpec | |
| Read IntSet | |
| Read KeyPair | |
| 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 Signature | |
| Read Ordering | Since: base-2.1 |
| Read Pos | |
| Read SourcePos | |
| 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 Mod2 | |
| Read ShortText | |
| Read DatatypeVariant | |
Defined in Language.Haskell.TH.Datatype Methods readsPrec :: Int -> ReadS DatatypeVariant # readList :: ReadS [DatatypeVariant] # | |
| Read Undefined | |
| Read UUID | |
| Read UnpackedUUID | |
| Read Word8 | Since: base-2.1 |
| Read Integer | Since: base-2.1 |
| Read Natural | Since: base-4.8.0.0 |
| Read () | Since: base-2.1 |
| 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 Word | Since: base-4.5.0.0 |
| () :=> (Read Ordering) | |
| () :=> (Read Natural) | |
| () :=> (Read ()) | |
Defined in Data.Constraint | |
| () :=> (Read Bool) | |
| () :=> (Read Char) | |
| () :=> (Read Int) | |
| () :=> (Read Word) | |
| a :=> (Read (Dict a)) | |
| Class () (Read a) | |
Defined in Data.Constraint | |
| Read a => Read (Last' a) | |
| Read a => Read (Option' a) | |
| Read v => Read (KeyMap v) | |
| Read a => Read (ZipList a) | Since: base-4.7.0.0 |
| Read a => Read (Complex a) | Since: base-2.1 |
| 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 (Down a) | This instance would be equivalent to the derived instances of the
Since: base-4.7.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 a => Read (Max a) | Since: base-4.9.0.0 |
| Read a => Read (Min a) | Since: base-4.9.0.0 |
| Read a => Read (Option 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 (Dual a) | Since: base-2.1 |
| Read a => Read (Product a) | Since: base-2.1 |
| Read a => Read (Sum a) | Since: base-2.1 |
| Read a => Read (NonEmpty a) | Since: base-4.11.0.0 |
| Read p => Read (Par1 p) | Since: base-4.7.0.0 |
| (Integral a, Read a) => Read (Ratio a) | Since: base-2.1 |
| a => Read (Dict a) | |
| Read vertex => Read (SCC vertex) | Since: containers-0.5.9 |
| Read e => Read (IntMap e) | |
| 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 (Tree a) | |
| Read1 f => Read (Fix f) | |
| (Functor f, Read1 f) => Read (Mu f) | |
| (Functor f, Read1 f) => Read (Nu f) | |
| Read a => Read (DNonEmpty a) | |
| Read a => Read (DList a) | |
| 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 t => Read (ErrorItem t) | |
| Read a => Read (StringEncode a) | |
Defined in Morley.Micheline.Json Methods readsPrec :: Int -> ReadS (StringEncode a) # readList :: ReadS [StringEncode a] # readPrec :: ReadPrec (StringEncode a) # readListPrec :: ReadPrec [StringEncode a] # | |
| Read a => Read (All a) | |
| Read a => Read (Any a) | |
| Read a => Read (Array a) | |
| Read a => Read (SmallArray a) | |
Defined in Data.Primitive.SmallArray Methods readsPrec :: Int -> ReadS (SmallArray a) # readList :: ReadS [SmallArray a] # readPrec :: ReadPrec (SmallArray a) # readListPrec :: ReadPrec [SmallArray a] # | |
| Read a => Read (Add a) | |
| Read (IntSetOf a) | |
| Read a => Read (Mul a) | |
| Read a => Read (WrappedNum a) | |
Defined in Data.Semiring Methods readsPrec :: Int -> ReadS (WrappedNum a) # readList :: ReadS [WrappedNum a] # readPrec :: ReadPrec (WrappedNum a) # readListPrec :: ReadPrec [WrappedNum a] # | |
| Read a => Read (Maybe a) | |
| (Eq a, Hashable a, Read a) => Read (HashSet a) | |
| Read a => Read (Vector a) | |
| (Read a, Prim a) => Read (Vector a) | |
| (Read a, Storable a) => Read (Vector a) | |
| Read a => Read (Maybe a) | Since: base-2.1 |
| Read a => Read (a) | Since: base-4.15 |
| Read a => Read [a] | Since: base-2.1 |
| (Read a) :=> (Read (Complex a)) | |
| (Read a) :=> (Read (Const a b)) | |
| (Read a) :=> (Read (Identity a)) | |
| (Read a) :=> (Read (Maybe a)) | |
| (Read a) :=> (Read [a]) | |
| (Read a, Num a, Bits a, TypeNum n) => Read (OddWord a n) | |
| (Read a, Read b) => Read (Either a b) | Since: base-3.0 |
| HasResolution a => Read (Fixed a) | Since: base-4.3.0.0 |
| Read (Proxy t) | Since: base-4.7.0.0 |
| (Read a, Read b) => Read (Arg a b) | Since: base-4.9.0.0 |
| (Ix a, Read a, Read b) => Read (Array a b) | Since: base-2.1 |
| Read (U1 p) | Since: base-4.9.0.0 |
| Read (V1 p) | Since: base-4.9.0.0 |
| (Ord k, Read k, Read e) => Read (Map k e) | |
| (Read1 f, Read a) => Read (Cofree f a) | |
| (Read1 f, Read a) => Read (Free f a) | |
| (Functor f, Read (f a)) => Read (Yoneda f a) | |
| Read v => Read (IntMapOf k v) | |
| (Read a, Read b) => Read (Either a b) | |
| (Read a, Read b) => Read (These a b) | |
| (Read a, Read b) => Read (Pair a b) | |
| (Read a, Read b) => Read (These a b) | |
| (Read1 m, Read a) => Read (MaybeT m a) | |
| (Eq k, Hashable k, Read k, Read e) => Read (HashMap k e) | |
| (Read a, Read b) => Read (a, b) | Since: base-2.1 |
| (Read a, Read b) :=> (Read (Either a b)) | |
| (Read a, Read b) :=> (Read (a, b)) | |
| (Integral a, Read a) :=> (Read (Ratio a)) | |
| 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 (f p) => Read (Rec1 f p) | Since: base-4.7.0.0 |
| Read (p (Fix p a) a) => Read (Fix p a) | |
| Read (p a a) => Read (Join p 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 a, Read (f b)) => Read (FreeF f a b) | |
| (Read1 f, Read1 m, Read a) => Read (FreeT f m a) | |
| Read b => Read (Tagged s b) | |
| (Read1 f, Read1 g, Read a) => Read (These1 f g a) | |
| (Read e, Read1 m, Read a) => Read (ErrorT e m a) | |
| (Read e, Read1 m, Read a) => Read (ExceptT e m a) | |
| (Read1 f, Read a) => Read (IdentityT f a) | |
| (Read a, Read b, Read c) => Read (a, b, c) | 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 (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 c => Read (K1 i c 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 (Compose f g a) | Since: base-4.9.0.0 |
| Read (f (g p)) => Read ((f :.: g) p) | Since: base-4.7.0.0 |
| Read (f p) => Read (M1 i c f p) | Since: base-4.7.0.0 |
| Read (f a) => Read (Clown f a b) | |
| Read (p b a) => Read (Flip p a b) | |
| Read (g b) => Read (Joker g a b) | |
| 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 a, Read b, Read c, Read d, Read e) => Read (a, b, c, d, e) | Since: base-2.1 |
| (Read (f a b), Read (g a b)) => Read (Product f g a b) | |
| (Read (p a b), Read (q a b)) => Read (Sum p q 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 (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 (a, b, c, d, e, f, g) | Since: base-2.1 |
| (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 (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 (a, b, c, d, e, f, g, h, i) | 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 (a, b, c, d, e, f, g, h, i, j) | Since: base-2.1 |
| (Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h, Read i, Read j, Read k) => Read (a, b, c, d, e, f, g, h, i, j, k) | Since: base-2.1 |
| (Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h, Read i, Read j, Read k, Read l) => Read (a, b, c, d, e, f, g, h, i, j, k, l) | Since: base-2.1 |
| (Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h, Read i, Read j, Read k, Read l, Read m) => Read (a, b, c, d, e, f, g, h, i, j, k, l, m) | Since: base-2.1 |
| (Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h, Read i, Read j, Read k, Read l, Read m, Read n) => Read (a, b, c, d, e, f, g, h, i, j, k, l, m, n) | Since: base-2.1 |
| (Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h, Read i, Read j, Read k, Read l, Read m, Read n, Read o) => Read (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) | Since: base-2.1 |
Defined in GHC.Read | |
class (Num a, Ord a) => Real a where #
Methods
toRational :: a -> Rational #
the rational equivalent of its real argument with full precision
Instances
class (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
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.
Example
Used in combination with (, <$>)( can be used to build a record.<*>)
>>>data MyState = MyState {arg1 :: Foo, arg2 :: Bar, arg3 :: Baz}
>>>produceFoo :: Applicative f => f Foo
>>>produceBar :: Applicative f => f Bar>>>produceBaz :: Applicative f => f Baz
>>>mkState :: Applicative f => f MyState>>>mkState = MyState <$> produceFoo <*> produceBar <*> produceBaz
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 <*>.
This became a typeclass method in 4.10.0.0. Prior to that, it was
a function defined in terms of <*> and fmap.
Example
>>>liftA2 (,) (Just 3) (Just 5)Just (3,5)
(*>) :: f a -> f b -> f b infixl 4 #
Sequence actions, discarding the value of the first argument.
Examples
If used in conjunction with the Applicative instance for Maybe,
you can chain Maybe computations, with a possible "early return"
in case of Nothing.
>>>Just 2 *> Just 3Just 3
>>>Nothing *> Just 3Nothing
Of course a more interesting use case would be to have effectful computations instead of just returning pure values.
>>>import Data.Char>>>import Text.ParserCombinators.ReadP>>>let p = string "my name is " *> munch1 isAlpha <* eof>>>readP_to_S p "my name is Simon"[("Simon","")]
(<*) :: f a -> f b -> f a infixl 4 #
Sequence actions, discarding the value of the second argument.
Instances
class Foldable (t :: Type -> Type) #
The Foldable class represents data structures that can be reduced to a summary value one element at a time. Strict left-associative folds are a good fit for space-efficient reduction, while lazy right-associative folds are a good fit for corecursive iteration, or for folds that short-circuit after processing an initial subsequence of the structure's elements.
Instances can be derived automatically by enabling the DeriveFoldable
extension. For example, a derived instance for a binary tree might be:
{-# LANGUAGE DeriveFoldable #-}
data Tree a = Empty
| Leaf a
| Node (Tree a) a (Tree a)
deriving FoldableA more detailed description can be found in the Overview section of Data.Foldable.
For the class laws see the Laws section of Data.Foldable.
Instances
| Foldable KeyMap | |
Defined in Data.Aeson.KeyMap Methods fold :: Monoid m => KeyMap m -> m # foldMap :: Monoid m => (a -> m) -> KeyMap a -> m # foldMap' :: Monoid m => (a -> m) -> KeyMap a -> m # foldr :: (a -> b -> b) -> b -> KeyMap a -> b # foldr' :: (a -> b -> b) -> b -> KeyMap a -> b # foldl :: (b -> a -> b) -> b -> KeyMap a -> b # foldl' :: (b -> a -> b) -> b -> KeyMap a -> b # foldr1 :: (a -> a -> a) -> KeyMap a -> a # foldl1 :: (a -> a -> a) -> KeyMap a -> a # elem :: Eq a => a -> KeyMap a -> Bool # maximum :: Ord a => KeyMap a -> a # minimum :: Ord a => KeyMap 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 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 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 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 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 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 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 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 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 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 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 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 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 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 Identifier | |
Defined in Text.Casing Methods fold :: Monoid m => Identifier m -> m # foldMap :: Monoid m => (a -> m) -> Identifier a -> m # foldMap' :: Monoid m => (a -> m) -> Identifier a -> m # foldr :: (a -> b -> b) -> b -> Identifier a -> b # foldr' :: (a -> b -> b) -> b -> Identifier a -> b # foldl :: (b -> a -> b) -> b -> Identifier a -> b # foldl' :: (b -> a -> b) -> b -> Identifier a -> b # foldr1 :: (a -> a -> a) -> Identifier a -> a # foldl1 :: (a -> a -> a) -> Identifier a -> a # toList :: Identifier a -> [a] # null :: Identifier a -> Bool # length :: Identifier a -> Int # elem :: Eq a => a -> Identifier a -> Bool # maximum :: Ord a => Identifier a -> a # minimum :: Ord a => Identifier a -> a # sum :: Num a => Identifier a -> a # product :: Num a => Identifier a -> a # | |
| Foldable SCC | Since: containers-0.5.9 |
Defined in Data.Graph Methods fold :: Monoid m => SCC m -> m # foldMap :: Monoid m => (a -> m) -> SCC a -> m # foldMap' :: Monoid m => (a -> m) -> SCC a -> m # foldr :: (a -> b -> b) -> b -> SCC a -> b # foldr' :: (a -> b -> b) -> b -> SCC a -> b # foldl :: (b -> a -> b) -> b -> SCC a -> b # foldl' :: (b -> a -> b) -> b -> SCC a -> b # foldr1 :: (a -> a -> a) -> SCC a -> a # foldl1 :: (a -> a -> a) -> SCC a -> a # elem :: Eq a => a -> SCC a -> Bool # maximum :: Ord a => SCC a -> a # | |
| Foldable 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 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 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 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 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 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 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 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 DNonEmpty | |
Defined in Data.DList.DNonEmpty.Internal Methods fold :: Monoid m => DNonEmpty m -> m # foldMap :: Monoid m => (a -> m) -> DNonEmpty a -> m # foldMap' :: Monoid m => (a -> m) -> DNonEmpty a -> m # foldr :: (a -> b -> b) -> b -> DNonEmpty a -> b # foldr' :: (a -> b -> b) -> b -> DNonEmpty a -> b # foldl :: (b -> a -> b) -> b -> DNonEmpty a -> b # foldl' :: (b -> a -> b) -> b -> DNonEmpty a -> b # foldr1 :: (a -> a -> a) -> DNonEmpty a -> a # foldl1 :: (a -> a -> a) -> DNonEmpty a -> a # toList :: DNonEmpty a -> [a] # length :: DNonEmpty a -> Int # elem :: Eq a => a -> DNonEmpty a -> Bool # maximum :: Ord a => DNonEmpty a -> a # minimum :: Ord a => DNonEmpty a -> a # | |
| Foldable DList | |
Defined in Data.DList.Internal 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 ResultStateLogs | |
Defined in Morley.Michelson.Interpret Methods fold :: Monoid m => ResultStateLogs m -> m # foldMap :: Monoid m => (a -> m) -> ResultStateLogs a -> m # foldMap' :: Monoid m => (a -> m) -> ResultStateLogs a -> m # foldr :: (a -> b -> b) -> b -> ResultStateLogs a -> b # foldr' :: (a -> b -> b) -> b -> ResultStateLogs a -> b # foldl :: (b -> a -> b) -> b -> ResultStateLogs a -> b # foldl' :: (b -> a -> b) -> b -> ResultStateLogs a -> b # foldr1 :: (a -> a -> a) -> ResultStateLogs a -> a # foldl1 :: (a -> a -> a) -> ResultStateLogs a -> a # toList :: ResultStateLogs a -> [a] # null :: ResultStateLogs a -> Bool # length :: ResultStateLogs a -> Int # elem :: Eq a => a -> ResultStateLogs a -> Bool # maximum :: Ord a => ResultStateLogs a -> a # minimum :: Ord a => ResultStateLogs a -> a # sum :: Num a => ResultStateLogs a -> a # product :: Num a => ResultStateLogs a -> a # | |
| Foldable MismatchError | |
Defined in Morley.Util.MismatchError Methods fold :: Monoid m => MismatchError m -> m # foldMap :: Monoid m => (a -> m) -> MismatchError a -> m # foldMap' :: Monoid m => (a -> m) -> MismatchError a -> m # foldr :: (a -> b -> b) -> b -> MismatchError a -> b # foldr' :: (a -> b -> b) -> b -> MismatchError a -> b # foldl :: (b -> a -> b) -> b -> MismatchError a -> b # foldl' :: (b -> a -> b) -> b -> MismatchError a -> b # foldr1 :: (a -> a -> a) -> MismatchError a -> a # foldl1 :: (a -> a -> a) -> MismatchError a -> a # toList :: MismatchError a -> [a] # null :: MismatchError a -> Bool # length :: MismatchError a -> Int # elem :: Eq a => a -> MismatchError a -> Bool # maximum :: Ord a => MismatchError a -> a # minimum :: Ord a => MismatchError a -> a # sum :: Num a => MismatchError a -> a # product :: Num a => MismatchError a -> a # | |
| Foldable SomeSizedList | |
Defined in Morley.Util.SizedList Methods fold :: Monoid m => SomeSizedList m -> m # foldMap :: Monoid m => (a -> m) -> SomeSizedList a -> m # foldMap' :: Monoid m => (a -> m) -> SomeSizedList a -> m # foldr :: (a -> b -> b) -> b -> SomeSizedList a -> b # foldr' :: (a -> b -> b) -> b -> SomeSizedList a -> b # foldl :: (b -> a -> b) -> b -> SomeSizedList a -> b # foldl' :: (b -> a -> b) -> b -> SomeSizedList a -> b # foldr1 :: (a -> a -> a) -> SomeSizedList a -> a # foldl1 :: (a -> a -> a) -> SomeSizedList a -> a # toList :: SomeSizedList a -> [a] # null :: SomeSizedList a -> Bool # length :: SomeSizedList a -> Int # elem :: Eq a => a -> SomeSizedList a -> Bool # maximum :: Ord a => SomeSizedList a -> a # minimum :: Ord a => SomeSizedList a -> a # sum :: Num a => SomeSizedList a -> a # product :: Num a => SomeSizedList 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 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 Add | |
Defined in Data.Semiring Methods fold :: Monoid m => Add m -> m # foldMap :: Monoid m => (a -> m) -> Add a -> m # foldMap' :: Monoid m => (a -> m) -> Add a -> m # foldr :: (a -> b -> b) -> b -> Add a -> b # foldr' :: (a -> b -> b) -> b -> Add a -> b # foldl :: (b -> a -> b) -> b -> Add a -> b # foldl' :: (b -> a -> b) -> b -> Add a -> b # foldr1 :: (a -> a -> a) -> Add a -> a # foldl1 :: (a -> a -> a) -> Add a -> a # elem :: Eq a => a -> Add a -> Bool # maximum :: Ord a => Add a -> a # | |
| Foldable Mul | |
Defined in Data.Semiring Methods fold :: Monoid m => Mul m -> m # foldMap :: Monoid m => (a -> m) -> Mul a -> m # foldMap' :: Monoid m => (a -> m) -> Mul a -> m # foldr :: (a -> b -> b) -> b -> Mul a -> b # foldr' :: (a -> b -> b) -> b -> Mul a -> b # foldl :: (b -> a -> b) -> b -> Mul a -> b # foldl' :: (b -> a -> b) -> b -> Mul a -> b # foldr1 :: (a -> a -> a) -> Mul a -> a # foldl1 :: (a -> a -> a) -> Mul a -> a # elem :: Eq a => a -> Mul a -> Bool # maximum :: Ord a => Mul a -> a # | |
| Foldable WrappedNum | |
Defined in Data.Semiring Methods fold :: Monoid m => WrappedNum m -> m # foldMap :: Monoid m => (a -> m) -> WrappedNum a -> m # foldMap' :: Monoid m => (a -> m) -> WrappedNum a -> m # foldr :: (a -> b -> b) -> b -> WrappedNum a -> b # foldr' :: (a -> b -> b) -> b -> WrappedNum a -> b # foldl :: (b -> a -> b) -> b -> WrappedNum a -> b # foldl' :: (b -> a -> b) -> b -> WrappedNum a -> b # foldr1 :: (a -> a -> a) -> WrappedNum a -> a # foldl1 :: (a -> a -> a) -> WrappedNum a -> a # toList :: WrappedNum a -> [a] # null :: WrappedNum a -> Bool # length :: WrappedNum a -> Int # elem :: Eq a => a -> WrappedNum a -> Bool # maximum :: Ord a => WrappedNum a -> a # minimum :: Ord a => WrappedNum a -> a # sum :: Num a => WrappedNum a -> a # product :: Num a => WrappedNum a -> a # | |
| Foldable Maybe | |
Defined in Data.Strict.Maybe 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 HashSet | |
Defined in Data.HashSet.Internal 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 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 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 Solo | Since: base-4.15 |
Defined in Data.Foldable Methods fold :: Monoid m => Solo m -> m # foldMap :: Monoid m => (a -> m) -> Solo a -> m # foldMap' :: Monoid m => (a -> m) -> Solo a -> m # foldr :: (a -> b -> b) -> b -> Solo a -> b # foldr' :: (a -> b -> b) -> b -> Solo a -> b # foldl :: (b -> a -> b) -> b -> Solo a -> b # foldl' :: (b -> a -> b) -> b -> Solo a -> b # foldr1 :: (a -> a -> a) -> Solo a -> a # foldl1 :: (a -> a -> a) -> Solo a -> a # elem :: Eq a => a -> Solo a -> Bool # maximum :: Ord a => Solo a -> a # | |
| 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 (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 (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 (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 (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 (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 (UAddr :: Type -> Type) | Since: base-4.9.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => UAddr m -> m # foldMap :: Monoid m => (a -> m) -> UAddr a -> m # foldMap' :: Monoid m => (a -> m) -> UAddr a -> m # foldr :: (a -> b -> b) -> b -> UAddr a -> b # foldr' :: (a -> b -> b) -> b -> UAddr a -> b # foldl :: (b -> a -> b) -> b -> UAddr a -> b # foldl' :: (b -> a -> b) -> b -> UAddr a -> b # foldr1 :: (a -> a -> a) -> UAddr a -> a # foldl1 :: (a -> a -> a) -> UAddr a -> a # elem :: Eq a => a -> UAddr a -> Bool # maximum :: Ord a => UAddr a -> a # minimum :: Ord a => UAddr a -> a # | |
| Foldable (UChar :: Type -> Type) | Since: base-4.9.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => UChar m -> m # foldMap :: Monoid m => (a -> m) -> UChar a -> m # foldMap' :: Monoid m => (a -> m) -> UChar a -> m # foldr :: (a -> b -> b) -> b -> UChar a -> b # foldr' :: (a -> b -> b) -> b -> UChar a -> b # foldl :: (b -> a -> b) -> b -> UChar a -> b # foldl' :: (b -> a -> b) -> b -> UChar a -> b # foldr1 :: (a -> a -> a) -> UChar a -> a # foldl1 :: (a -> a -> a) -> UChar a -> a # elem :: Eq a => a -> UChar a -> Bool # maximum :: Ord a => UChar a -> a # minimum :: Ord a => UChar a -> a # | |
| Foldable (UDouble :: Type -> Type) | Since: base-4.9.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => UDouble m -> m # foldMap :: Monoid m => (a -> m) -> UDouble a -> m # foldMap' :: Monoid m => (a -> m) -> UDouble a -> m # foldr :: (a -> b -> b) -> b -> UDouble a -> b # foldr' :: (a -> b -> b) -> b -> UDouble a -> b # foldl :: (b -> a -> b) -> b -> UDouble a -> b # foldl' :: (b -> a -> b) -> b -> UDouble a -> b # foldr1 :: (a -> a -> a) -> UDouble a -> a # foldl1 :: (a -> a -> a) -> UDouble a -> a # elem :: Eq a => a -> UDouble a -> Bool # maximum :: Ord a => UDouble a -> a # minimum :: Ord a => UDouble a -> a # | |
| Foldable (UFloat :: Type -> Type) | Since: base-4.9.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => UFloat m -> m # foldMap :: Monoid m => (a -> m) -> UFloat a -> m # foldMap' :: Monoid m => (a -> m) -> UFloat a -> m # foldr :: (a -> b -> b) -> b -> UFloat a -> b # foldr' :: (a -> b -> b) -> b -> UFloat a -> b # foldl :: (b -> a -> b) -> b -> UFloat a -> b # foldl' :: (b -> a -> b) -> b -> UFloat a -> b # foldr1 :: (a -> a -> a) -> UFloat a -> a # foldl1 :: (a -> a -> a) -> UFloat a -> a # elem :: Eq a => a -> UFloat a -> Bool # maximum :: Ord a => UFloat a -> a # minimum :: Ord a => UFloat a -> a # | |
| Foldable (UInt :: Type -> Type) | Since: base-4.9.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => UInt m -> m # foldMap :: Monoid m => (a -> m) -> UInt a -> m # foldMap' :: Monoid m => (a -> m) -> UInt a -> m # foldr :: (a -> b -> b) -> b -> UInt a -> b # foldr' :: (a -> b -> b) -> b -> UInt a -> b # foldl :: (b -> a -> b) -> b -> UInt a -> b # foldl' :: (b -> a -> b) -> b -> UInt a -> b # foldr1 :: (a -> a -> a) -> UInt a -> a # foldl1 :: (a -> a -> a) -> UInt a -> a # elem :: Eq a => a -> UInt a -> Bool # maximum :: Ord a => UInt a -> a # | |
| Foldable (UWord :: Type -> Type) | Since: base-4.9.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => UWord m -> m # foldMap :: Monoid m => (a -> m) -> UWord a -> m # foldMap' :: Monoid m => (a -> m) -> UWord a -> m # foldr :: (a -> b -> b) -> b -> UWord a -> b # foldr' :: (a -> b -> b) -> b -> UWord a -> b # foldl :: (b -> a -> b) -> b -> UWord a -> b # foldl' :: (b -> a -> b) -> b -> UWord a -> b # foldr1 :: (a -> a -> a) -> UWord a -> a # foldl1 :: (a -> a -> a) -> UWord a -> a # elem :: Eq a => a -> UWord a -> Bool # maximum :: Ord a => UWord a -> a # minimum :: Ord a => UWord a -> a # | |
| 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 (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 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 (BigMap k) | |
Defined in Morley.Michelson.Typed.Haskell.Value Methods fold :: Monoid m => BigMap k m -> m # foldMap :: Monoid m => (a -> m) -> BigMap k a -> m # foldMap' :: Monoid m => (a -> m) -> BigMap k a -> m # foldr :: (a -> b -> b) -> b -> BigMap k a -> b # foldr' :: (a -> b -> b) -> b -> BigMap k a -> b # foldl :: (b -> a -> b) -> b -> BigMap k a -> b # foldl' :: (b -> a -> b) -> b -> BigMap k a -> b # foldr1 :: (a -> a -> a) -> BigMap k a -> a # foldl1 :: (a -> a -> a) -> BigMap k a -> a # elem :: Eq a => a -> BigMap k a -> Bool # maximum :: Ord a => BigMap k a -> a # minimum :: Ord a => BigMap k a -> a # | |
| Foldable (SizedList' n) | |
Defined in Morley.Util.SizedList Methods fold :: Monoid m => SizedList' n m -> m # foldMap :: Monoid m => (a -> m) -> SizedList' n a -> m # foldMap' :: Monoid m => (a -> m) -> SizedList' n a -> m # foldr :: (a -> b -> b) -> b -> SizedList' n a -> b # foldr' :: (a -> b -> b) -> b -> SizedList' n a -> b # foldl :: (b -> a -> b) -> b -> SizedList' n a -> b # foldl' :: (b -> a -> b) -> b -> SizedList' n a -> b # foldr1 :: (a -> a -> a) -> SizedList' n a -> a # foldl1 :: (a -> a -> a) -> SizedList' n a -> a # toList :: SizedList' n a -> [a] # null :: SizedList' n a -> Bool # length :: SizedList' n a -> Int # elem :: Eq a => a -> SizedList' n a -> Bool # maximum :: Ord a => SizedList' n a -> a # minimum :: Ord a => SizedList' n a -> a # sum :: Num a => SizedList' n a -> a # product :: Num a => SizedList' n a -> a # | |
| Foldable (Either e) | |
Defined in Data.Strict.Either Methods fold :: Monoid m => Either e m -> m # foldMap :: Monoid m => (a -> m) -> Either e a -> m # foldMap' :: Monoid m => (a -> m) -> Either e a -> m # foldr :: (a -> b -> b) -> b -> Either e a -> b # foldr' :: (a -> b -> b) -> b -> Either e a -> b # foldl :: (b -> a -> b) -> b -> Either e a -> b # foldl' :: (b -> a -> b) -> b -> Either e a -> b # foldr1 :: (a -> a -> a) -> Either e a -> a # foldl1 :: (a -> a -> a) -> Either e a -> a # elem :: Eq a => a -> Either e a -> Bool # maximum :: Ord a => Either e a -> a # minimum :: Ord a => Either e a -> a # | |
| Foldable (These a) | |
Defined in Data.Strict.These Methods fold :: Monoid m => These a m -> m # foldMap :: Monoid m => (a0 -> m) -> These a a0 -> m # foldMap' :: Monoid m => (a0 -> m) -> These a a0 -> m # foldr :: (a0 -> b -> b) -> b -> These a a0 -> b # foldr' :: (a0 -> b -> b) -> b -> These a a0 -> b # foldl :: (b -> a0 -> b) -> b -> These a a0 -> b # foldl' :: (b -> a0 -> b) -> b -> These a a0 -> b # foldr1 :: (a0 -> a0 -> a0) -> These a a0 -> a0 # foldl1 :: (a0 -> a0 -> a0) -> These a a0 -> a0 # toList :: These a a0 -> [a0] # elem :: Eq a0 => a0 -> These a a0 -> Bool # maximum :: Ord a0 => These a a0 -> a0 # minimum :: Ord a0 => These a a0 -> a0 # | |
| Foldable (Pair e) | |
Defined in Data.Strict.Tuple Methods fold :: Monoid m => Pair e m -> m # foldMap :: Monoid m => (a -> m) -> Pair e a -> m # foldMap' :: Monoid m => (a -> m) -> Pair e a -> m # foldr :: (a -> b -> b) -> b -> Pair e a -> b # foldr' :: (a -> b -> b) -> b -> Pair e a -> b # foldl :: (b -> a -> b) -> b -> Pair e a -> b # foldl' :: (b -> a -> b) -> b -> Pair e a -> b # foldr1 :: (a -> a -> a) -> Pair e a -> a # foldl1 :: (a -> a -> a) -> Pair e a -> a # elem :: Eq a => a -> Pair e a -> Bool # maximum :: Ord a => Pair e a -> a # minimum :: Ord a => Pair e a -> a # | |
| Foldable (These a) | |
Defined in Data.These Methods fold :: Monoid m => These a m -> m # foldMap :: Monoid m => (a0 -> m) -> These a a0 -> m # foldMap' :: Monoid m => (a0 -> m) -> These a a0 -> m # foldr :: (a0 -> b -> b) -> b -> These a a0 -> b # foldr' :: (a0 -> b -> b) -> b -> These a a0 -> b # foldl :: (b -> a0 -> b) -> b -> These a a0 -> b # foldl' :: (b -> a0 -> b) -> b -> These a a0 -> b # foldr1 :: (a0 -> a0 -> a0) -> These a a0 -> a0 # foldl1 :: (a0 -> a0 -> a0) -> These a a0 -> a0 # toList :: These a a0 -> [a0] # elem :: Eq a0 => a0 -> These a a0 -> Bool # maximum :: Ord a0 => These a a0 -> a0 # minimum :: Ord a0 => These a a0 -> a0 # | |
| 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 (HashMap k) | |
Defined in Data.HashMap.Internal 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 ((,) 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 (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 # | |
| 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 # | |
| 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 # | |
| 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 # | |
| 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 (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 (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 f, Foldable g) => Foldable (These1 f g) | |
Defined in Data.Functor.These Methods fold :: Monoid m => These1 f g m -> m # foldMap :: Monoid m => (a -> m) -> These1 f g a -> m # foldMap' :: Monoid m => (a -> m) -> These1 f g a -> m # foldr :: (a -> b -> b) -> b -> These1 f g a -> b # foldr' :: (a -> b -> b) -> b -> These1 f g a -> b # foldl :: (b -> a -> b) -> b -> These1 f g a -> b # foldl' :: (b -> a -> b) -> b -> These1 f g a -> b # foldr1 :: (a -> a -> a) -> These1 f g a -> a # foldl1 :: (a -> a -> a) -> These1 f g a -> a # toList :: These1 f g a -> [a] # null :: These1 f g a -> Bool # length :: These1 f g a -> Int # elem :: Eq a => a -> These1 f g a -> Bool # maximum :: Ord a => These1 f g a -> a # minimum :: Ord a => These1 f g 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 f => Foldable (ExceptT e f) | |
Defined in Control.Monad.Trans.Except Methods fold :: Monoid m => ExceptT e f m -> m # foldMap :: Monoid m => (a -> m) -> ExceptT e f a -> m # foldMap' :: Monoid m => (a -> m) -> ExceptT e f a -> m # foldr :: (a -> b -> b) -> b -> ExceptT e f a -> b # foldr' :: (a -> b -> b) -> b -> ExceptT e f a -> b # foldl :: (b -> a -> b) -> b -> ExceptT e f a -> b # foldl' :: (b -> a -> b) -> b -> ExceptT e f a -> b # foldr1 :: (a -> a -> a) -> ExceptT e f a -> a # foldl1 :: (a -> a -> a) -> ExceptT e f a -> a # toList :: ExceptT e f a -> [a] # null :: ExceptT e f a -> Bool # length :: ExceptT e f a -> Int # elem :: Eq a => a -> ExceptT e f a -> Bool # maximum :: Ord a => ExceptT e f a -> a # minimum :: Ord a => ExceptT e f a -> a # | |
| Foldable f => Foldable (IdentityT f) | |
Defined in Control.Monad.Trans.Identity Methods fold :: Monoid m => IdentityT f m -> m # foldMap :: Monoid m => (a -> m) -> IdentityT f a -> m # foldMap' :: Monoid m => (a -> m) -> IdentityT f a -> m # foldr :: (a -> b -> b) -> b -> IdentityT f a -> b # foldr' :: (a -> b -> b) -> b -> IdentityT f a -> b # foldl :: (b -> a -> b) -> b -> IdentityT f a -> b # foldl' :: (b -> a -> b) -> b -> IdentityT f a -> b # foldr1 :: (a -> a -> a) -> IdentityT f a -> a # foldl1 :: (a -> a -> a) -> IdentityT f a -> a # toList :: IdentityT f a -> [a] # null :: IdentityT f a -> Bool # length :: IdentityT f a -> Int # elem :: Eq a => a -> IdentityT f a -> Bool # maximum :: Ord a => IdentityT f a -> a # minimum :: Ord a => IdentityT f a -> a # | |
| Foldable (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 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 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 (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 (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 # | |
| (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 (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 (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 # | |
| 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 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 (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 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 transformed to
structures of the same shape by performing an Applicative (or,
therefore, Monad) action on each element from left to right.
A more detailed description of what same shape means, the various methods, how traversals are constructed, and example advanced use-cases can be found in the Overview section of Data.Traversable.
For the class laws see the Laws section of Data.Traversable.
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_.
Examples
Basic usage:
In the first two examples we show each evaluated action mapping to the output structure.
>>>traverse Just [1,2,3,4]Just [1,2,3,4]
>>>traverse id [Right 1, Right 2, Right 3, Right 4]Right [1,2,3,4]
In the next examples, we show that Nothing and Left values short
circuit the created structure.
>>>traverse (const Nothing) [1,2,3,4]Nothing
>>>traverse (\x -> if odd x then Just x else Nothing) [1,2,3,4]Nothing
>>>traverse id [Right 1, Right 2, Right 3, Right 4, Left 0]Left 0
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_.
Examples
Basic usage:
For the first two examples we show sequenceA fully evaluating a a structure and collecting the results.
>>>sequenceA [Just 1, Just 2, Just 3]Just [1,2,3]
>>>sequenceA [Right 1, Right 2, Right 3]Right [1,2,3]
The next two example show Nothing and Just will short circuit
the resulting structure if present in the input. For more context,
check the Traversable instances for Either and Maybe.
>>>sequenceA [Just 1, Just 2, Just 3, Nothing]Nothing
>>>sequenceA [Right 1, Right 2, Right 3, Left 4]Left 4
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_.
Examples
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_.
Examples
Basic usage:
The first two examples are instances where the input and
and output of sequence are isomorphic.
>>>sequence $ Right [1,2,3,4][Right 1,Right 2,Right 3,Right 4]
>>>sequence $ [Right 1,Right 2,Right 3,Right 4]Right [1,2,3,4]
The following examples demonstrate short circuit behavior
for sequence.
>>>sequence $ Left [1,2,3,4]Left [1,2,3,4]
>>>sequence $ [Left 0, Right 1,Right 2,Right 3,Right 4]Left 0
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
| name ~ name' => IsLabel name' (Name name) | |
Defined in Named.Internal | |
| (KnownSymbol name, s ~ name) => IsLabel s (Label name) | |
Defined in Morley.Util.Label | |
| (name ~ name', a ~ a', InjValue f) => IsLabel name (a -> NamedF f a' name') | |
Defined in Named.Internal | |
| (p ~ NamedF f a name, InjValue f) => IsLabel name (a -> Param p) | |
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
(<>) :: a -> a -> a infixr 6 #
An associative operation.
>>>[1,2,3] <> [4,5,6][1,2,3,4,5,6]
Reduce a non-empty list with <>
The default definition should be sufficient, but this can be overridden for efficiency.
>>>import Data.List.NonEmpty (NonEmpty (..))>>>sconcat $ "Hello" :| [" ", "Haskell", "!"]"Hello Haskell!"
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 \(\mathcal{O}(1)\) by
picking stimes = or stimesIdempotentstimes =
respectively.stimesIdempotentMonoid
>>>stimes 4 [1][1,1,1,1]
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
>>>"Hello world" <> mempty"Hello world"
An associative operation
NOTE: This method is redundant and has the default
implementation mappend = (<>)mappend is a synonym for
(<>), it is expected that the two functions are defined the same
way. In a future GHC release mappend will be removed from Monoid.
Fold a list using the monoid.
For most types, the default definition for mconcat will be
used, but the function is included in the class definition so
that an optimized version can be provided for specific types.
>>>mconcat ["Hello", " ", "Haskell", "!"]"Hello Haskell!"
Instances
Instances
| Structured Bool | |
Defined in Distribution.Utils.Structured | |
| 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 # | |
| Storable Bool | Since: base-2.1 |
Defined in Foreign.Storable | |
| Bounded Bool | Since: base-2.1 |
| Enum Bool | Since: base-2.1 |
| Generic Bool | |
| SingKind Bool | Since: base-4.9.0.0 |
Defined in GHC.Generics Associated Types type DemoteRep Bool | |
| Read Bool | Since: base-2.1 |
| Show Bool | Since: base-2.1 |
| BitOps Bool | |
| FiniteBitsOps Bool | |
| NFData Bool | |
Defined in Control.DeepSeq | |
| Buildable Bool | |
Defined in Formatting.Buildable | |
| Eq Bool | |
| Ord Bool | |
| Hashable Bool | |
Defined in Data.Hashable.Class | |
| HasAnnotation Bool | |
Defined in Lorentz.Annotation | |
| HasRPCRepr Bool | |
Defined in Morley.AsRPC | |
| TypeHasDoc Bool | |
Defined in Morley.Michelson.Typed.Haskell.Doc Associated Types Methods typeDocName :: Proxy Bool -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy Bool -> WithinParens -> Markdown # typeDocDependencies :: Proxy Bool -> [SomeDocDefinitionItem] # | |
| IsoValue Bool | |
| Boolean Bool | |
| BooleanMonoid Bool | |
| Uniform Bool | |
Defined in System.Random.Internal Methods uniformM :: StatefulGen g m => g -> m Bool # | |
| UniformRange Bool | |
Defined in System.Random.Internal | |
| Semiring Bool | |
| PEq Bool | |
| SEq Bool | |
| POrd Bool | |
| SOrd Bool | |
Defined in Data.Ord.Singletons 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) # | |
| PBounded Bool | |
Defined in Data.Singletons.Base.Enum | |
| PEnum Bool | |
Defined in Data.Singletons.Base.Enum | |
| SBounded Bool | |
Defined in Data.Singletons.Base.Enum | |
| SEnum Bool | |
Defined in Data.Singletons.Base.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) # | |
| PShow Bool | |
| SShow Bool | |
Defined in Text.Show.Singletons 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) # | |
| Unbox Bool | |
Defined in Data.Vector.Unboxed.Base | |
| TestCoercion SBool | |
Defined in Data.Singletons.Base.Instances | |
| TestEquality SBool | |
Defined in Data.Singletons.Base.Instances | |
| SingI 'False | Since: base-4.9.0.0 |
Defined in GHC.Generics | |
| SingI 'True | Since: base-4.9.0.0 |
Defined in GHC.Generics | |
| UnaryArithOpHs Not Bool | |
Defined in Lorentz.Arith Associated Types type UnaryArithResHs Not Bool # Methods evalUnaryArithOpHs :: forall (s :: [Type]). (Bool ': s) :-> (UnaryArithResHs Not Bool ': s) # | |
| Lift Bool | |
| Vector Vector Bool | |
Defined in Data.Vector.Unboxed.Base Methods basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) Bool -> m (Vector Bool) # basicUnsafeThaw :: PrimMonad m => Vector Bool -> m (Mutable Vector (PrimState m) Bool) # basicLength :: Vector Bool -> Int # basicUnsafeSlice :: Int -> Int -> Vector Bool -> Vector Bool # basicUnsafeIndexM :: Monad m => Vector Bool -> Int -> m Bool # basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) Bool -> Vector Bool -> m () # | |
| MVector MVector Bool | |
Defined in Data.Vector.Unboxed.Base Methods basicLength :: MVector s Bool -> Int # basicUnsafeSlice :: Int -> Int -> MVector s Bool -> MVector s Bool # basicOverlaps :: MVector s Bool -> MVector s Bool -> Bool # basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) Bool) # basicInitialize :: PrimMonad m => MVector (PrimState m) Bool -> m () # basicUnsafeReplicate :: PrimMonad m => Int -> Bool -> m (MVector (PrimState m) Bool) # basicUnsafeRead :: PrimMonad m => MVector (PrimState m) Bool -> Int -> m Bool # basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) Bool -> Int -> Bool -> m () # basicClear :: PrimMonad m => MVector (PrimState m) Bool -> m () # basicSet :: PrimMonad m => MVector (PrimState m) Bool -> Bool -> m () # basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) Bool -> MVector (PrimState m) Bool -> m () # basicUnsafeMove :: PrimMonad m => MVector (PrimState m) Bool -> MVector (PrimState m) Bool -> m () # basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) Bool -> Int -> m (MVector (PrimState m) Bool) # | |
| r ~ Bool => ArithOpHs And Bool Bool r | |
Defined in Lorentz.Arith | |
| r ~ Bool => ArithOpHs Or Bool Bool r | |
Defined in Lorentz.Arith | |
| r ~ Bool => ArithOpHs Xor Bool Bool r | |
Defined in Lorentz.Arith | |
| () :=> (Bits Bool) | |
| () :=> (Bounded Bool) | |
| () :=> (Enum Bool) | |
| () :=> (Read Bool) | |
| () :=> (Show Bool) | |
| () :=> (Eq Bool) | |
| () :=> (Ord Bool) | |
| SingI GetAllSym0 | |
Defined in Data.Semigroup.Singletons.Internal Methods sing :: Sing GetAllSym0 # | |
| SingI GetAnySym0 | |
Defined in Data.Semigroup.Singletons.Internal Methods sing :: Sing GetAnySym0 # | |
| SingI AllSym0 | |
Defined in Data.Semigroup.Singletons.Internal | |
| SingI All_Sym0 | |
| SingI AnySym0 | |
Defined in Data.Semigroup.Singletons.Internal | |
| SingI Any_Sym0 | |
| SingI ShowParenSym0 | |
Defined in Text.Show.Singletons Methods sing :: Sing ShowParenSym0 # | |
| SingI AndSym0 | |
Defined in Data.List.Singletons.Internal | |
| SingI OrSym0 | |
Defined in Data.List.Singletons.Internal | |
| SingI ContainsBigMapSym | |
Defined in Morley.Michelson.Typed.Scope | |
| SingI ContainsContractSym | |
Defined in Morley.Michelson.Typed.Scope | |
| SingI ContainsNestedBigMapsSym | |
Defined in Morley.Michelson.Typed.Scope | |
| SingI ContainsOpSym | |
Defined in Morley.Michelson.Typed.Scope | |
| SingI ContainsTicketSym | |
Defined in Morley.Michelson.Typed.Scope | |
| SingI (&&@#@$) | |
Defined in Data.Bool.Singletons | |
| SingI (||@#@$) | |
Defined in Data.Bool.Singletons | |
| SingI NotSym0 | |
Defined in Data.Bool.Singletons | |
| SingI (<=?@#@$) | |
Defined in GHC.TypeLits.Singletons.Internal | |
| SuppressUnusedWarnings TFHelper_6989586621679606123Sym0 | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings GetAllSym0 | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings TFHelper_6989586621679606140Sym0 | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings GetAnySym0 | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings TFHelper_6989586621679130639Sym0 | |
Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings TFHelper_6989586621679131028Sym0 | |
Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings TFHelper_6989586621679131037Sym0 | |
Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings AllSym0 | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings All_Sym0 | |
Defined in Data.Semigroup.Singletons.Internal.Disambiguation Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings AnySym0 | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings Any_Sym0 | |
Defined in Data.Semigroup.Singletons.Internal.Disambiguation Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings ShowParenSym0 | |
Defined in Text.Show.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings Compare_6989586621679181840Sym0 | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (&&@#@$) | |
Defined in Data.Bool.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (||@#@$) | |
Defined in Data.Bool.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings TFHelper_6989586621679131019Sym0 | |
Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings NotSym0 | |
Defined in Data.Bool.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings FromEnum_6989586621679544301Sym0 | |
Defined in Data.Singletons.Base.Enum Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings ShowsPrec_6989586621680071834Sym0 | |
Defined in Text.Show.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (<=?@#@$) | |
Defined in GHC.TypeLits.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings ToEnum_6989586621679544288Sym0 | |
Defined in Data.Singletons.Base.Enum Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings AndSym0 | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings OrSym0 | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SingI (DeleteFirstsBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> ([a] ~> [a])) -> Type) | |
Defined in Data.List.Singletons.Internal Methods | |
| SingI (IntersectBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> ([a] ~> [a])) -> Type) | |
Defined in Data.List.Singletons.Internal Methods sing :: Sing IntersectBySym0 # | |
| SingI (UnionBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> ([a] ~> [a])) -> Type) | |
Defined in Data.List.Singletons.Internal Methods sing :: Sing UnionBySym0 # | |
| SingI (GroupBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> [[a]]) -> Type) | |
Defined in Data.List.Singletons.Internal Methods sing :: Sing GroupBySym0 # | |
| SingI (NubBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> [a]) -> Type) | |
Defined in Data.List.Singletons.Internal | |
| SingI (ListnubBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> [a]) -> Type) | |
Defined in Data.List.Singletons.Internal.Disambiguation | |
| SingI (Elem_bySym0 :: TyFun (a ~> (a ~> Bool)) (a ~> ([a] ~> Bool)) -> Type) | |
Defined in Data.List.Singletons.Internal | |
| SingI (DeleteBySym0 :: TyFun (a ~> (a ~> Bool)) (a ~> ([a] ~> [a])) -> Type) | |
Defined in Data.List.Singletons.Internal Methods sing :: Sing DeleteBySym0 # | |
| SingI (UntilSym0 :: TyFun (a ~> Bool) ((a ~> a) ~> (a ~> a)) -> Type) | |
Defined in GHC.Base.Singletons | |
| SingI (FindIndexSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe Nat) -> Type) | |
Defined in Data.List.Singletons.Internal Methods sing :: Sing FindIndexSym0 # | |
| SingI (FindSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe a) -> Type) | |
Defined in Data.List.Singletons.Internal | |
| SingI (BreakSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) | |
Defined in Data.List.Singletons.Internal | |
| SingI (PartitionSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) | |
Defined in Data.List.Singletons.Internal Methods sing :: Sing PartitionSym0 # | |
| SingI (SpanSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) | |
Defined in Data.List.Singletons.Internal | |
| SingI (ListpartitionSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) | |
Defined in Data.List.Singletons.Internal.Disambiguation | |
| SingI (ListspanSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) | |
Defined in Data.List.Singletons.Internal.Disambiguation | |
| SingI (AllSym0 :: TyFun (a ~> Bool) ([a] ~> Bool) -> Type) | |
Defined in Data.List.Singletons.Internal | |
| SingI (AnySym0 :: TyFun (a ~> Bool) ([a] ~> Bool) -> Type) | |
Defined in Data.List.Singletons.Internal | |
| SingI (FindIndicesSym0 :: TyFun (a ~> Bool) ([a] ~> [Nat]) -> Type) | |
Defined in Data.List.Singletons.Internal Methods sing :: Sing FindIndicesSym0 # | |
| SingI (DropWhileEndSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) | |
Defined in Data.List.Singletons.Internal Methods | |
| SingI (DropWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) | |
Defined in Data.List.Singletons.Internal Methods sing :: Sing DropWhileSym0 # | |
| SingI (FilterSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) | |
Defined in Data.List.Singletons.Internal Methods sing :: Sing FilterSym0 # | |
| SingI (TakeWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) | |
Defined in Data.List.Singletons.Internal Methods sing :: Sing TakeWhileSym0 # | |
| SingI (ListdropWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) | |
Defined in Data.List.Singletons.Internal.Disambiguation | |
| SingI (ListfilterSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) | |
Defined in Data.List.Singletons.Internal.Disambiguation | |
| SingI (ListtakeWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) | |
Defined in Data.List.Singletons.Internal.Disambiguation | |
| SingI (SelectSym0 :: TyFun (a ~> Bool) (a ~> (([a], [a]) ~> ([a], [a]))) -> Type) | |
Defined in Data.List.Singletons.Internal | |
| SingI (IsJustSym0 :: TyFun (Maybe a) Bool -> Type) | |
Defined in Data.Maybe.Singletons Methods sing :: Sing IsJustSym0 # | |
| SingI (IsNothingSym0 :: TyFun (Maybe a) Bool -> Type) | |
Defined in Data.Maybe.Singletons Methods sing :: Sing IsNothingSym0 # | |
| SApplicative f => SingI (UnlessSym0 :: TyFun Bool (f () ~> f ()) -> Type) | |
Defined in Control.Monad.Singletons Methods sing :: Sing UnlessSym0 # | |
| SApplicative f => SingI (WhenSym0 :: TyFun Bool (f () ~> f ()) -> Type) | |
Defined in Control.Monad.Singletons.Internal | |
| SAlternative f => SingI (GuardSym0 :: TyFun Bool (f ()) -> Type) | |
Defined in Control.Monad.Singletons.Internal | |
| SEq a => SingI (IsInfixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type) | |
Defined in Data.List.Singletons.Internal Methods sing :: Sing IsInfixOfSym0 # | |
| SEq a => SingI (IsPrefixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type) | |
Defined in Data.List.Singletons.Internal Methods sing :: Sing IsPrefixOfSym0 # | |
| SEq a => SingI (IsSuffixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type) | |
Defined in Data.List.Singletons.Internal Methods sing :: Sing IsSuffixOfSym0 # | |
| SEq a => SingI (ListisPrefixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type) | |
Defined in Data.List.Singletons.Internal.Disambiguation | |
| SingI (NullSym0 :: TyFun [a] Bool -> Type) | |
Defined in Data.List.Singletons.Internal | |
| SingI (ListnullSym0 :: TyFun [a] Bool -> Type) | |
Defined in Data.List.Singletons.Internal.Disambiguation | |
| SEq a => SingI (ElemSym0 :: TyFun a ([a] ~> Bool) -> Type) | |
Defined in Data.List.Singletons.Internal | |
| SEq a => SingI (NotElemSym0 :: TyFun a ([a] ~> Bool) -> Type) | |
Defined in Data.List.Singletons.Internal | |
| SEq a => SingI (ListelemSym0 :: TyFun a ([a] ~> Bool) -> Type) | |
Defined in Data.List.Singletons.Internal.Disambiguation | |
| SingI (Bool_Sym0 :: TyFun a (a ~> (Bool ~> a)) -> Type) | |
Defined in Data.Bool.Singletons | |
| SEq a => SingI ((/=@#@$) :: TyFun a (a ~> Bool) -> Type) | |
Defined in Data.Eq.Singletons | |
| SEq a => SingI ((==@#@$) :: TyFun a (a ~> Bool) -> Type) | |
Defined in Data.Eq.Singletons | |
| SOrd a => SingI ((<=@#@$) :: TyFun a (a ~> Bool) -> Type) | |
Defined in Data.Ord.Singletons | |
| SOrd a => SingI ((<@#@$) :: TyFun a (a ~> Bool) -> Type) | |
Defined in Data.Ord.Singletons | |
| SOrd a => SingI ((>=@#@$) :: TyFun a (a ~> Bool) -> Type) | |
Defined in Data.Ord.Singletons | |
| SOrd a => SingI ((>@#@$) :: TyFun a (a ~> Bool) -> Type) | |
Defined in Data.Ord.Singletons | |
| SFoldable t => SingI (AndSym0 :: TyFun (t Bool) Bool -> Type) | |
Defined in Data.Foldable.Singletons | |
| SFoldable t => SingI (OrSym0 :: TyFun (t Bool) Bool -> Type) | |
Defined in Data.Foldable.Singletons | |
| SingI (IfSym0 :: TyFun Bool (k ~> (k ~> k)) -> Type) | |
Defined in Data.Bool.Singletons | |
| SingI x => SingI ((&&@#@$$) x :: TyFun Bool Bool -> Type) | |
Defined in Data.Bool.Singletons | |
| SingI x => SingI ((||@#@$$) x :: TyFun Bool Bool -> Type) | |
Defined in Data.Bool.Singletons | |
| SingI x => SingI ((<=?@#@$$) x :: TyFun Nat Bool -> Type) | |
Defined in GHC.TypeLits.Singletons.Internal Methods sing :: Sing ((<=?@#@$$) x) # | |
| SuppressUnusedWarnings (TFHelper_6989586621679131006Sym0 :: TyFun (Identity a) (Identity a ~> Bool) -> Type) | |
Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Null_6989586621680392273Sym0 :: TyFun (Identity a) Bool -> Type) | |
Defined in Data.Functor.Identity.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680109664Sym0 :: TyFun (First a) (First a ~> Bool) -> Type) | |
Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680109684Sym0 :: TyFun (Last a) (Last a ~> Bool) -> Type) | |
Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679179231Sym0 :: TyFun (Down a) (Down a ~> Bool) -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679606240Sym0 :: TyFun (First a) (First a ~> Bool) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679606260Sym0 :: TyFun (Last a) (Last a ~> Bool) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679606220Sym0 :: TyFun (Max a) (Max a ~> Bool) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679606200Sym0 :: TyFun (Min a) (Min a ~> Bool) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679606280Sym0 :: TyFun (WrappedMonoid m) (WrappedMonoid m ~> Bool) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679606123Sym1 a6989586621679606128 :: TyFun All Bool -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679606140Sym1 a6989586621679606145 :: TyFun Any Bool -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679606106Sym0 :: TyFun (Dual a) (Dual a ~> Bool) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Null_6989586621680194400Sym0 :: TyFun (Dual a) Bool -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679606180Sym0 :: TyFun (Product a) (Product a ~> Bool) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Null_6989586621680194750Sym0 :: TyFun (Product a) Bool -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679606160Sym0 :: TyFun (Sum a) (Sum a ~> Bool) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Null_6989586621680194575Sym0 :: TyFun (Sum a) Bool -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679130639Sym1 a6989586621679130644 :: TyFun Void Bool -> Type) | |
Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679130622Sym0 :: TyFun (NonEmpty a) (NonEmpty a ~> Bool) -> Type) | |
Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679131028Sym1 a6989586621679131033 :: TyFun Ordering Bool -> Type) | |
Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (DeleteFirstsBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> ([a] ~> [a])) -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (IntersectBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> ([a] ~> [a])) -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (UnionBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> ([a] ~> [a])) -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (GroupBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> [[a]]) -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (NubBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> [a]) -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ListnubBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> [a]) -> Type) | |
Defined in Data.List.Singletons.Internal.Disambiguation Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Elem_bySym0 :: TyFun (a ~> (a ~> Bool)) (a ~> ([a] ~> Bool)) -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (DeleteBySym0 :: TyFun (a ~> (a ~> Bool)) (a ~> ([a] ~> [a])) -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (UntilSym0 :: TyFun (a ~> Bool) ((a ~> a) ~> (a ~> a)) -> Type) | |
Defined in GHC.Base.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FindIndexSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe Nat) -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FindSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe a) -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (BreakSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (PartitionSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (SpanSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ListpartitionSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) | |
Defined in Data.List.Singletons.Internal.Disambiguation Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ListspanSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) | |
Defined in Data.List.Singletons.Internal.Disambiguation Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (AllSym0 :: TyFun (a ~> Bool) ([a] ~> Bool) -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (AnySym0 :: TyFun (a ~> Bool) ([a] ~> Bool) -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FindIndicesSym0 :: TyFun (a ~> Bool) ([a] ~> [Nat]) -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (DropWhileEndSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (DropWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FilterSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TakeWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ListdropWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) | |
Defined in Data.List.Singletons.Internal.Disambiguation Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ListfilterSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) | |
Defined in Data.List.Singletons.Internal.Disambiguation Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ListtakeWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) | |
Defined in Data.List.Singletons.Internal.Disambiguation Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (SelectSym0 :: TyFun (a ~> Bool) (a ~> (([a], [a]) ~> ([a], [a]))) -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679731296X_6989586621679731297Sym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] ([k], [k]) -> Type) -> Type) -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679731331X_6989586621679731332Sym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] ([k], [k]) -> Type) -> Type) -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679731296YsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679731296ZsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679731331YsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679731331ZsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679130516Sym0 :: TyFun (Maybe a) (Maybe a ~> Bool) -> Type) | |
Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (IsJustSym0 :: TyFun (Maybe a) Bool -> Type) | |
Defined in Data.Maybe.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (IsNothingSym0 :: TyFun (Maybe a) Bool -> Type) | |
Defined in Data.Maybe.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679131037Sym1 a6989586621679131042 :: TyFun () Bool -> Type) | |
Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679181840Sym1 a6989586621679181845 :: TyFun Bool Ordering -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621680071834Sym1 a6989586621680071844 :: TyFun Bool (Symbol ~> Symbol) -> Type) | |
Defined in Text.Show.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (UnlessSym0 :: TyFun Bool (f () ~> f ()) -> Type) | |
Defined in Control.Monad.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (WhenSym0 :: TyFun Bool (f () ~> f ()) -> Type) | |
Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (IfSym0 :: TyFun Bool (k ~> (k ~> k)) -> Type) | |
Defined in Data.Bool.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings ((&&@#@$$) a6989586621679122836 :: TyFun Bool Bool -> Type) | |
Defined in Data.Bool.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings ((||@#@$$) a6989586621679123482 :: TyFun Bool Bool -> Type) | |
Defined in Data.Bool.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679131019Sym1 a6989586621679131024 :: TyFun Bool Bool -> Type) | |
Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (GuardSym0 :: TyFun Bool (f ()) -> Type) | |
Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings ((<=?@#@$$) a6989586621679462422 :: TyFun Nat Bool -> Type) | |
Defined in GHC.TypeLits.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679130547Sym0 :: TyFun [a] ([a] ~> Bool) -> Type) | |
Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (IsInfixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (IsPrefixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (IsSuffixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ListisPrefixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type) | |
Defined in Data.List.Singletons.Internal.Disambiguation Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Null_6989586621680193994Sym0 :: TyFun [a] Bool -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (NullSym0 :: TyFun [a] Bool -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ListnullSym0 :: TyFun [a] Bool -> Type) | |
Defined in Data.List.Singletons.Internal.Disambiguation Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Elem_6989586621680392157Sym0 :: TyFun a (Identity a ~> Bool) -> Type) | |
Defined in Data.Functor.Identity.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Elem_6989586621680194236Sym0 :: TyFun a (Proxy a ~> Bool) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Elem_6989586621680194268Sym0 :: TyFun a (Dual a ~> Bool) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Elem_6989586621680194618Sym0 :: TyFun a (Product a ~> Bool) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Elem_6989586621680194443Sym0 :: TyFun a (Sum a ~> Bool) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Elem_6989586621680193860Sym0 :: TyFun a ([a] ~> Bool) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ElemSym0 :: TyFun a ([a] ~> Bool) -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (NotElemSym0 :: TyFun a ([a] ~> Bool) -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ListelemSym0 :: TyFun a ([a] ~> Bool) -> Type) | |
Defined in Data.List.Singletons.Internal.Disambiguation Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Bool_Sym0 :: TyFun a (a ~> (Bool ~> a)) -> Type) | |
Defined in Data.Bool.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings ((/=@#@$) :: TyFun a (a ~> Bool) -> Type) | |
Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings ((==@#@$) :: TyFun a (a ~> Bool) -> Type) | |
Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679127817Sym0 :: TyFun a (a ~> Bool) -> Type) | |
Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679127828Sym0 :: TyFun a (a ~> Bool) -> Type) | |
Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings ((<=@#@$) :: TyFun a (a ~> Bool) -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings ((<@#@$) :: TyFun a (a ~> Bool) -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings ((>=@#@$) :: TyFun a (a ~> Bool) -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings ((>@#@$) :: TyFun a (a ~> Bool) -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679166153Sym0 :: TyFun a (a ~> Bool) -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679166169Sym0 :: TyFun a (a ~> Bool) -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679166185Sym0 :: TyFun a (a ~> Bool) -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679166201Sym0 :: TyFun a (a ~> Bool) -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (DefaultEqSym0 :: TyFun k (k ~> Bool) -> Type) | |
Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680184051Scrutinee_6989586621680184015Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680184075Scrutinee_6989586621680184017Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679166141Scrutinee_6989586621679163721Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679166145Scrutinee_6989586621679163723Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679166226Scrutinee_6989586621679163733Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679166242Scrutinee_6989586621679163735Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680163560Scrutinee_6989586621680162757Sym0 :: TyFun k1 Bool -> Type) | |
Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (AndSym0 :: TyFun (t Bool) Bool -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (OrSym0 :: TyFun (t Bool) Bool -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SingI (IsLeftSym0 :: TyFun (Either a b) Bool -> Type) | |
Defined in Data.Either.Singletons Methods sing :: Sing IsLeftSym0 # | |
| SingI (IsRightSym0 :: TyFun (Either a b) Bool -> Type) | |
Defined in Data.Either.Singletons Methods sing :: Sing IsRightSym0 # | |
| SMonadPlus m => SingI (MfilterSym0 :: TyFun (a ~> Bool) (m a ~> m a) -> Type) | |
Defined in Control.Monad.Singletons Methods sing :: Sing MfilterSym0 # | |
| SFoldable t => SingI (FindSym0 :: TyFun (a ~> Bool) (t a ~> Maybe a) -> Type) | |
Defined in Data.Foldable.Singletons | |
| SFoldable t => SingI (AllSym0 :: TyFun (a ~> Bool) (t a ~> Bool) -> Type) | |
Defined in Data.Foldable.Singletons | |
| SFoldable t => SingI (AnySym0 :: TyFun (a ~> Bool) (t a ~> Bool) -> Type) | |
Defined in Data.Foldable.Singletons | |
| SApplicative m => SingI (FilterMSym0 :: TyFun (a ~> m Bool) ([a] ~> m [a]) -> Type) | |
Defined in Control.Monad.Singletons Methods sing :: Sing FilterMSym0 # | |
| SingI d => SingI (AllSym1 d :: TyFun [a] Bool -> Type) | |
Defined in Data.List.Singletons.Internal | |
| SingI d => SingI (AnySym1 d :: TyFun [a] Bool -> Type) | |
Defined in Data.List.Singletons.Internal | |
| (SEq a, SingI d) => SingI (ElemSym1 d :: TyFun [a] Bool -> Type) | |
Defined in Data.List.Singletons.Internal | |
| (SEq a, SingI d) => SingI (IsInfixOfSym1 d :: TyFun [a] Bool -> Type) | |
Defined in Data.List.Singletons.Internal Methods sing :: Sing (IsInfixOfSym1 d) # | |
| (SEq a, SingI d) => SingI (IsPrefixOfSym1 d :: TyFun [a] Bool -> Type) | |
Defined in Data.List.Singletons.Internal Methods sing :: Sing (IsPrefixOfSym1 d) # | |
| (SEq a, SingI d) => SingI (IsSuffixOfSym1 d :: TyFun [a] Bool -> Type) | |
Defined in Data.List.Singletons.Internal Methods sing :: Sing (IsSuffixOfSym1 d) # | |
| (SEq a, SingI d) => SingI (NotElemSym1 d :: TyFun [a] Bool -> Type) | |
Defined in Data.List.Singletons.Internal | |
| (SEq a, SingI d) => SingI (ListelemSym1 d :: TyFun [a] Bool -> Type) | |
Defined in Data.List.Singletons.Internal.Disambiguation | |
| (SEq a, SingI d) => SingI (ListisPrefixOfSym1 d :: TyFun [a] Bool -> Type) | |
Defined in Data.List.Singletons.Internal.Disambiguation | |
| SingI d => SingI (Bool_Sym1 d :: TyFun a (Bool ~> a) -> Type) | |
Defined in Data.Bool.Singletons | |
| SingI d => SingI (Elem_bySym1 d :: TyFun a ([a] ~> Bool) -> Type) | |
Defined in Data.List.Singletons.Internal | |
| (SFoldable t, SEq a) => SingI (ElemSym0 :: TyFun a (t a ~> Bool) -> Type) | |
Defined in Data.Foldable.Singletons | |
| (SFoldable t, SEq a) => SingI (NotElemSym0 :: TyFun a (t a ~> Bool) -> Type) | |
Defined in Data.Foldable.Singletons Methods sing :: Sing NotElemSym0 # | |
| (SEq a, SingI d) => SingI ((/=@#@$$) d :: TyFun a Bool -> Type) | |
Defined in Data.Eq.Singletons | |
| (SEq a, SingI d) => SingI ((==@#@$$) d :: TyFun a Bool -> Type) | |
Defined in Data.Eq.Singletons | |
| (SOrd a, SingI d) => SingI ((<=@#@$$) d :: TyFun a Bool -> Type) | |
Defined in Data.Ord.Singletons | |
| (SOrd a, SingI d) => SingI ((<@#@$$) d :: TyFun a Bool -> Type) | |
Defined in Data.Ord.Singletons | |
| (SOrd a, SingI d) => SingI ((>=@#@$$) d :: TyFun a Bool -> Type) | |
Defined in Data.Ord.Singletons | |
| (SOrd a, SingI d) => SingI ((>@#@$$) d :: TyFun a Bool -> Type) | |
Defined in Data.Ord.Singletons | |
| SuppressUnusedWarnings (TFHelper_6989586621679130594Sym0 :: TyFun (Either a b) (Either a b ~> Bool) -> Type) | |
Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (IsLeftSym0 :: TyFun (Either a b) Bool -> Type) | |
Defined in Data.Either.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (IsRightSym0 :: TyFun (Either a b) Bool -> Type) | |
Defined in Data.Either.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Null_6989586621680194155Sym0 :: TyFun (Either a1 a2) Bool -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679131006Sym1 a6989586621679131011 :: TyFun (Identity a) Bool -> Type) | |
Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Elem_6989586621680392157Sym1 a6989586621680392162 :: TyFun (Identity a) Bool -> Type) | |
Defined in Data.Functor.Identity.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680109664Sym1 a6989586621680109669 :: TyFun (First a) Bool -> Type) | |
Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680109684Sym1 a6989586621680109689 :: TyFun (Last a) Bool -> Type) | |
Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679179231Sym1 a6989586621679179236 :: TyFun (Down a) Bool -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Elem_6989586621680194236Sym1 a6989586621680194241 :: TyFun (Proxy a) Bool -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Null_6989586621680194229Sym0 :: TyFun (Proxy a) Bool -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680163384Sym0 :: TyFun (Proxy s) (Proxy s ~> Bool) -> Type) | |
Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680605296Sym0 :: TyFun (Arg a b) (Arg a b ~> Bool) -> Type) | |
Defined in Data.Semigroup.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679606240Sym1 a6989586621679606245 :: TyFun (First a) Bool -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679606260Sym1 a6989586621679606265 :: TyFun (Last a) Bool -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679606220Sym1 a6989586621679606225 :: TyFun (Max a) Bool -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679606200Sym1 a6989586621679606205 :: TyFun (Min a) Bool -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679606280Sym1 a6989586621679606285 :: TyFun (WrappedMonoid m) Bool -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Elem_6989586621680194268Sym1 a6989586621680194277 :: TyFun (Dual a) Bool -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679606106Sym1 a6989586621679606111 :: TyFun (Dual a) Bool -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Elem_6989586621680194618Sym1 a6989586621680194627 :: TyFun (Product a) Bool -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679606180Sym1 a6989586621679606185 :: TyFun (Product a) Bool -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Elem_6989586621680194443Sym1 a6989586621680194452 :: TyFun (Sum a) Bool -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679606160Sym1 a6989586621679606165 :: TyFun (Sum a) Bool -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679130622Sym1 a6989586621679130627 :: TyFun (NonEmpty a) Bool -> Type) | |
Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (MfilterSym0 :: TyFun (a ~> Bool) (m a ~> m a) -> Type) | |
Defined in Control.Monad.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FindSym0 :: TyFun (a ~> Bool) (t a ~> Maybe a) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (AllSym0 :: TyFun (a ~> Bool) (t a ~> Bool) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (AnySym0 :: TyFun (a ~> Bool) (t a ~> Bool) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680193283Sym0 :: TyFun (a ~> Bool) (TyFun k (TyFun a (First a) -> Type) -> Type) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621679731359Sym0 :: TyFun (a ~> Bool) (TyFun k (TyFun a (TyFun [a] [a] -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FilterMSym0 :: TyFun (a ~> m Bool) ([a] ~> m [a]) -> Type) | |
Defined in Control.Monad.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679731198X_6989586621679731199Sym0 :: TyFun (k1 ~> (a ~> Bool)) (TyFun k1 (TyFun [a] ([a], [a]) -> Type) -> Type) -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679731198YsSym0 :: TyFun (k1 ~> (a ~> Bool)) (TyFun k1 (TyFun [a] [a] -> Type) -> Type) -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679731198ZsSym0 :: TyFun (k1 ~> (a ~> Bool)) (TyFun k1 (TyFun [a] [a] -> Type) -> Type) -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679731064NubBy'Sym0 :: TyFun (k1 ~> (k1 ~> Bool)) (TyFun k (TyFun [k1] ([k1] ~> [k1]) -> Type) -> Type) -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679248372GoSym0 :: TyFun (k1 ~> Bool) (TyFun (k1 ~> k1) (TyFun k2 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type) | |
Defined in GHC.Base.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679130516Sym1 a6989586621679130521 :: TyFun (Maybe a) Bool -> Type) | |
Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679130662Sym0 :: TyFun (a, b) ((a, b) ~> Bool) -> Type) | |
Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679130547Sym1 a6989586621679130552 :: TyFun [a] Bool -> Type) | |
Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Elem_6989586621680193860Sym1 a6989586621680193869 :: TyFun [a] Bool -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (AllSym1 a6989586621679732047 :: TyFun [a] Bool -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (AnySym1 a6989586621679732039 :: TyFun [a] Bool -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ElemSym1 a6989586621679731822 :: TyFun [a] Bool -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (IsInfixOfSym1 a6989586621679731830 :: TyFun [a] Bool -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (IsPrefixOfSym1 a6989586621679731844 :: TyFun [a] Bool -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (IsSuffixOfSym1 a6989586621679731837 :: TyFun [a] Bool -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (NotElemSym1 a6989586621679731814 :: TyFun [a] Bool -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ListelemSym1 a6989586621680002068 :: TyFun [a] Bool -> Type) | |
Defined in Data.List.Singletons.Internal.Disambiguation Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ListisPrefixOfSym1 a6989586621680002140 :: TyFun [a] Bool -> Type) | |
Defined in Data.List.Singletons.Internal.Disambiguation Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Bool_Sym1 a6989586621679120954 :: TyFun a (Bool ~> a) -> Type) | |
Defined in Data.Bool.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Elem_bySym1 a6989586621679731050 :: TyFun a ([a] ~> Bool) -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ElemSym0 :: TyFun a (t a ~> Bool) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Elem_6989586621680193750Sym0 :: TyFun a (t a ~> Bool) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (NotElemSym0 :: TyFun a (t a ~> Bool) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings ((/=@#@$$) a6989586621679127813 :: TyFun a Bool -> Type) | |
Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings ((==@#@$$) a6989586621679127808 :: TyFun a Bool -> Type) | |
Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679127817Sym1 a6989586621679127822 :: TyFun a Bool -> Type) | |
Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679127828Sym1 a6989586621679127833 :: TyFun a Bool -> Type) | |
Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings ((<=@#@$$) a6989586621679166108 :: TyFun a Bool -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings ((<@#@$$) a6989586621679166103 :: TyFun a Bool -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings ((>=@#@$$) a6989586621679166118 :: TyFun a Bool -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings ((>@#@$$) a6989586621679166113 :: TyFun a Bool -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679166153Sym1 a6989586621679166158 :: TyFun a Bool -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679166169Sym1 a6989586621679166174 :: TyFun a Bool -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679166185Sym1 a6989586621679166190 :: TyFun a Bool -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679166201Sym1 a6989586621679166206 :: TyFun a Bool -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (DefaultEqSym1 a6989586621679130155 :: TyFun k Bool -> Type) | |
Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679731119Scrutinee_6989586621679727564Sym0 :: TyFun k1 (TyFun k Bool -> Type) -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680184051Scrutinee_6989586621680184015Sym1 x6989586621680184046 :: TyFun k1 Bool -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680184075Scrutinee_6989586621680184017Sym1 x6989586621680184070 :: TyFun k1 Bool -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679166141Scrutinee_6989586621679163721Sym1 x6989586621679166139 :: TyFun k1 Bool -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679166145Scrutinee_6989586621679163723Sym1 x6989586621679166139 :: TyFun k1 Bool -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679166226Scrutinee_6989586621679163733Sym1 x6989586621679166224 :: TyFun k1 Bool -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679166242Scrutinee_6989586621679163735Sym1 x6989586621679166240 :: TyFun k1 Bool -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| (SingI d1, SingI d2) => SingI (Bool_Sym2 d1 d2 :: TyFun Bool a -> Type) | |
Defined in Data.Bool.Singletons | |
| (SingI d1, SingI d2) => SingI (Elem_bySym2 d1 d2 :: TyFun [a] Bool -> Type) | |
Defined in Data.List.Singletons.Internal | |
| (SFoldable t, SingI d) => SingI (AllSym1 d :: TyFun (t a) Bool -> Type) | |
Defined in Data.Foldable.Singletons | |
| (SFoldable t, SingI d) => SingI (AnySym1 d :: TyFun (t a) Bool -> Type) | |
Defined in Data.Foldable.Singletons | |
| (SFoldable t, SEq a, SingI d) => SingI (ElemSym1 d :: TyFun (t a) Bool -> Type) | |
Defined in Data.Foldable.Singletons | |
| (SFoldable t, SEq a, SingI d) => SingI (NotElemSym1 d :: TyFun (t a) Bool -> Type) | |
Defined in Data.Foldable.Singletons Methods sing :: Sing (NotElemSym1 d) # | |
| SFoldable t => SingI (NullSym0 :: TyFun (t a) Bool -> Type) | |
Defined in Data.Foldable.Singletons | |
| SuppressUnusedWarnings (TFHelper_6989586621679130594Sym1 a6989586621679130599 :: TyFun (Either a b) Bool -> Type) | |
Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680428549Sym0 :: TyFun (Const a b) (Const a b ~> Bool) -> Type) | |
Defined in Data.Functor.Const.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680163384Sym1 a6989586621680163389 :: TyFun (Proxy s) Bool -> Type) | |
Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680605296Sym1 a6989586621680605301 :: TyFun (Arg a b) Bool -> Type) | |
Defined in Data.Semigroup.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680892564Sym0 :: TyFun (k1 ~> Bool) (TyFun k (TyFun k1 (m k1) -> Type) -> Type) -> Type) | |
Defined in Control.Monad.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680892726Sym0 :: TyFun (k2 ~> f Bool) (TyFun k3 (TyFun k2 (f [k2] ~> f [k2]) -> Type) -> Type) -> Type) | |
Defined in Control.Monad.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679130662Sym1 a6989586621679130667 :: TyFun (a, b) Bool -> Type) | |
Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679130700Sym0 :: TyFun (a, b, c) ((a, b, c) ~> Bool) -> Type) | |
Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Bool_Sym2 a6989586621679120954 a6989586621679120955 :: TyFun Bool a -> Type) | |
Defined in Data.Bool.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Elem_bySym2 a6989586621679731050 a6989586621679731051 :: TyFun [a] Bool -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679731119Scrutinee_6989586621679727564Sym1 n6989586621679731117 :: TyFun k Bool -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679731363Scrutinee_6989586621679727542Sym0 :: TyFun k1 (TyFun [a] (TyFun (k1 ~> Bool) (TyFun k Bool -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679731185Scrutinee_6989586621679727560Sym0 :: TyFun k1 (TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679731071Scrutinee_6989586621679727570Sym0 :: TyFun k1 (TyFun k2 (TyFun [k1] (TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679731087Scrutinee_6989586621679727568Sym0 :: TyFun k1 (TyFun k2 (TyFun [k1] (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680892729Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 (TyFun Bool ([k1] ~> [k1]) -> Type) -> Type) -> Type) -> Type) | |
Defined in Control.Monad.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680193722Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679731100Scrutinee_6989586621679727566Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679731262Scrutinee_6989586621679727550Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679731275Scrutinee_6989586621679727548Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (AllSym1 a6989586621680193346 :: TyFun (t a) Bool -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (AnySym1 a6989586621680193355 :: TyFun (t a) Bool -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ElemSym1 a6989586621680193550 :: TyFun (t a) Bool -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Elem_6989586621680193750Sym1 a6989586621680193759 :: TyFun (t a) Bool -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (NotElemSym1 a6989586621680193297 :: TyFun (t a) Bool -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (NullSym0 :: TyFun (t a) Bool -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Null_6989586621680193714Sym0 :: TyFun (t a) Bool -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680428549Sym1 a6989586621680428554 :: TyFun (Const a b) Bool -> Type) | |
Defined in Data.Functor.Const.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679130700Sym1 a6989586621679130705 :: TyFun (a, b, c) Bool -> Type) | |
Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679130749Sym0 :: TyFun (a, b, c, d) ((a, b, c, d) ~> Bool) -> Type) | |
Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679731363Scrutinee_6989586621679727542Sym1 x6989586621679731361 :: TyFun [a] (TyFun (k1 ~> Bool) (TyFun k Bool -> Type) -> Type) -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679516447Scrutinee_6989586621679516255Sym0 :: TyFun k1 (TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Base.Enum Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679731185Scrutinee_6989586621679727560Sym1 key6989586621679731181 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679731071Scrutinee_6989586621679727570Sym1 y6989586621679731068 :: TyFun k2 (TyFun [k1] (TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679731087Scrutinee_6989586621679727568Sym1 x6989586621679731084 :: TyFun k2 (TyFun [k1] (TyFun k3 Bool -> Type) -> Type) -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680892729Sym1 x6989586621680892728 :: TyFun k2 (TyFun k3 (TyFun Bool ([k1] ~> [k1]) -> Type) -> Type) -> Type) | |
Defined in Control.Monad.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680193722Sym1 a_69895866216801937166989586621680193721 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679731100Scrutinee_6989586621679727566Sym1 x6989586621679731097 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679731262Scrutinee_6989586621679727550Sym1 n6989586621679731259 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679731275Scrutinee_6989586621679727548Sym1 n6989586621679731272 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621679731412Sym0 :: TyFun (b ~> (a ~> Bool)) (TyFun k1 (TyFun k2 (TyFun a (TyFun [a] (TyFun b (m b) -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679731363Scrutinee_6989586621679727542Sym2 x6989586621679731361 xs6989586621679731362 :: TyFun (k1 ~> Bool) (TyFun k Bool -> Type) -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679130749Sym1 a6989586621679130754 :: TyFun (a, b, c, d) Bool -> Type) | |
Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679130809Sym0 :: TyFun (a, b, c, d, e) ((a, b, c, d, e) ~> Bool) -> Type) | |
Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679731071Scrutinee_6989586621679727570Sym2 y6989586621679731068 ys6989586621679731069 :: TyFun [k1] (TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679731087Scrutinee_6989586621679727568Sym2 x6989586621679731084 xs6989586621679731085 :: TyFun [k1] (TyFun k3 Bool -> Type) -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679516356Scrutinee_6989586621679516279Sym0 :: TyFun k1 (TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Base.Enum Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679516393Scrutinee_6989586621679516269Sym0 :: TyFun k1 (TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Base.Enum Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679516447Scrutinee_6989586621679516255Sym1 x6989586621679516446 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Base.Enum Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679731185Scrutinee_6989586621679727560Sym2 key6989586621679731181 x6989586621679731182 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680892729Sym2 x6989586621680892728 p6989586621680892724 :: TyFun k3 (TyFun Bool ([k1] ~> [k1]) -> Type) -> Type) | |
Defined in Control.Monad.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680193722Sym2 a_69895866216801937166989586621680193721 arg_69895866216801931086989586621680193724 :: TyFun k3 Bool -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679731100Scrutinee_6989586621679727566Sym2 x6989586621679731097 xs6989586621679731098 :: TyFun k3 Bool -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679731262Scrutinee_6989586621679727550Sym2 n6989586621679731259 x6989586621679731260 :: TyFun k3 Bool -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679731275Scrutinee_6989586621679727548Sym2 n6989586621679731272 x6989586621679731273 :: TyFun k3 Bool -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679731071Scrutinee_6989586621679727570Sym3 y6989586621679731068 ys6989586621679731069 xs6989586621679731070 :: TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679130809Sym1 a6989586621679130814 :: TyFun (a, b, c, d, e) Bool -> Type) | |
Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679130880Sym0 :: TyFun (a, b, c, d, e, f) ((a, b, c, d, e, f) ~> Bool) -> Type) | |
Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680892729Sym3 x6989586621680892728 p6989586621680892724 a_69895866216808927176989586621680892725 :: TyFun Bool ([k1] ~> [k1]) -> Type) | |
Defined in Control.Monad.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679731363Scrutinee_6989586621679727542Sym3 x6989586621679731361 xs6989586621679731362 p6989586621679731357 :: TyFun k Bool -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679516447Scrutinee_6989586621679516255Sym2 x6989586621679516446 x06989586621679516441 :: TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Base.Enum Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679516356Scrutinee_6989586621679516279Sym1 x16989586621679516351 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Base.Enum Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679516393Scrutinee_6989586621679516269Sym1 x16989586621679516388 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Base.Enum Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679731087Scrutinee_6989586621679727568Sym3 x6989586621679731084 xs6989586621679731085 ls6989586621679731086 :: TyFun k3 Bool -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679731185Scrutinee_6989586621679727560Sym3 key6989586621679731181 x6989586621679731182 y6989586621679731183 :: TyFun k3 Bool -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679130880Sym1 a6989586621679130885 :: TyFun (a, b, c, d, e, f) Bool -> Type) | |
Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679130962Sym0 :: TyFun (a, b, c, d, e, f, g) ((a, b, c, d, e, f, g) ~> Bool) -> Type) | |
Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679516356Scrutinee_6989586621679516279Sym2 x16989586621679516351 x26989586621679516352 :: TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Base.Enum Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679516393Scrutinee_6989586621679516269Sym2 x16989586621679516388 x26989586621679516389 :: TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Base.Enum Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679516447Scrutinee_6989586621679516255Sym3 x6989586621679516446 x06989586621679516441 y6989586621679516442 :: TyFun k3 (TyFun k4 Bool -> Type) -> Type) | |
Defined in Data.Singletons.Base.Enum Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679731071Scrutinee_6989586621679727570Sym4 y6989586621679731068 ys6989586621679731069 xs6989586621679731070 eq6989586621679731062 :: TyFun k3 Bool -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679130962Sym1 a6989586621679130967 :: TyFun (a, b, c, d, e, f, g) Bool -> Type) | |
Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679516356Scrutinee_6989586621679516279Sym3 x16989586621679516351 x26989586621679516352 y6989586621679516353 :: TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Base.Enum Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679516393Scrutinee_6989586621679516269Sym3 x16989586621679516388 x26989586621679516389 y6989586621679516390 :: TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Base.Enum Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679516447Scrutinee_6989586621679516255Sym4 x6989586621679516446 x06989586621679516441 y6989586621679516442 arg_69895866216795162516989586621679516437 :: TyFun k4 Bool -> Type) | |
Defined in Data.Singletons.Base.Enum Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679516356Scrutinee_6989586621679516279Sym4 x16989586621679516351 x26989586621679516352 y6989586621679516353 arg_69895866216795162736989586621679516346 :: TyFun k4 (TyFun k5 Bool -> Type) -> Type) | |
Defined in Data.Singletons.Base.Enum Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679516393Scrutinee_6989586621679516269Sym4 x16989586621679516388 x26989586621679516389 y6989586621679516390 arg_69895866216795162636989586621679516383 :: TyFun k4 (TyFun k5 Bool -> Type) -> Type) | |
Defined in Data.Singletons.Base.Enum Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679516356Scrutinee_6989586621679516279Sym5 x16989586621679516351 x26989586621679516352 y6989586621679516353 arg_69895866216795162736989586621679516346 arg_69895866216795162756989586621679516347 :: TyFun k5 Bool -> Type) | |
Defined in Data.Singletons.Base.Enum Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679516393Scrutinee_6989586621679516269Sym5 x16989586621679516388 x26989586621679516389 y6989586621679516390 arg_69895866216795162636989586621679516383 arg_69895866216795162656989586621679516384 :: TyFun k5 Bool -> Type) | |
Defined in Data.Singletons.Base.Enum Methods suppressUnusedWarnings :: () # | |
| type DemoteRep Bool | |
Defined in GHC.Generics | |
| type Rep Bool | Since: base-4.6.0.0 |
| data Sing (a :: Bool) | |
| type AsRPC Bool | |
Defined in Morley.AsRPC | |
| type TypeDocFieldDescriptions Bool | |
Defined in Morley.Michelson.Typed.Haskell.Doc | |
| type ToT Bool | |
Defined in Morley.Michelson.Typed.Haskell.Value | |
| type Demote Bool | |
Defined in Data.Singletons.Base.Instances | |
| type Sing | |
Defined in Data.Singletons.Base.Instances | |
| type MaxBound | |
Defined in Data.Singletons.Base.Enum type MaxBound = MaxBound_6989586621679509887Sym0 | |
| type MinBound | |
Defined in Data.Singletons.Base.Enum type MinBound = MinBound_6989586621679509884Sym0 | |
| newtype Vector Bool | |
| type UnaryArithResHs Not Bool | |
Defined in Lorentz.Arith | |
| type FromEnum (a :: Bool) | |
Defined in Data.Singletons.Base.Enum | |
| type Pred (arg :: Bool) | |
| type Succ (arg :: Bool) | |
| type ToEnum a | |
Defined in Data.Singletons.Base.Enum | |
| type Show_ (arg :: Bool) | |
| newtype MVector s Bool | |
| type (arg1 :: Bool) /= (arg2 :: Bool) | |
| type (a1 :: Bool) == (a2 :: 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 Max (arg1 :: Bool) (arg2 :: Bool) | |
| type Min (arg1 :: Bool) (arg2 :: Bool) | |
| type EnumFromTo (arg1 :: Bool) (arg2 :: Bool) | |
| type ShowList (arg1 :: [Bool]) arg2 | |
| type Apply GetAllSym0 (a6989586621679596382 :: All) | |
Defined in Data.Semigroup.Singletons.Internal | |
| type Apply GetAnySym0 (a6989586621679596398 :: Any) | |
Defined in Data.Semigroup.Singletons.Internal | |
| type Apply ContainsBigMapSym (x :: T) | |
Defined in Morley.Michelson.Typed.Scope | |
| type Apply ContainsContractSym (x :: T) | |
Defined in Morley.Michelson.Typed.Scope | |
| type Apply ContainsNestedBigMapsSym (x :: T) | |
Defined in Morley.Michelson.Typed.Scope | |
| type Apply ContainsOpSym (x :: T) | |
Defined in Morley.Michelson.Typed.Scope | |
| type Apply ContainsTicketSym (x :: T) | |
Defined in Morley.Michelson.Typed.Scope | |
| type Apply AllSym0 (a6989586621679596379 :: Bool) | |
Defined in Data.Semigroup.Singletons.Internal | |
| type Apply All_Sym0 (a6989586621679713097 :: Bool) | |
| type Apply AnySym0 (a6989586621679596395 :: Bool) | |
Defined in Data.Semigroup.Singletons.Internal | |
| type Apply Any_Sym0 (a6989586621679713091 :: Bool) | |
| type Apply NotSym0 (a6989586621679123820 :: Bool) | |
Defined in Data.Bool.Singletons | |
| type Apply FromEnum_6989586621679544301Sym0 (a6989586621679544305 :: Bool) | |
Defined in Data.Singletons.Base.Enum | |
| type Apply ToEnum_6989586621679544288Sym0 (a6989586621679544292 :: Nat) | |
Defined in Data.Singletons.Base.Enum | |
| type EnumFromThenTo (arg1 :: Bool) (arg2 :: Bool) (arg3 :: Bool) | |
| type ShowsPrec a1 (a2 :: Bool) a3 | |
| type Apply (TFHelper_6989586621679606123Sym1 a6989586621679606128 :: TyFun All Bool -> Type) (a6989586621679606129 :: All) | |
| type Apply (TFHelper_6989586621679606140Sym1 a6989586621679606145 :: TyFun Any Bool -> Type) (a6989586621679606146 :: Any) | |
| type Apply (TFHelper_6989586621679130639Sym1 a6989586621679130644 :: TyFun Void Bool -> Type) (a6989586621679130645 :: Void) | |
| type Apply (TFHelper_6989586621679131028Sym1 a6989586621679131033 :: TyFun Ordering Bool -> Type) (a6989586621679131034 :: Ordering) | |
| type Apply (TFHelper_6989586621679131037Sym1 a6989586621679131042 :: TyFun () Bool -> Type) (a6989586621679131043 :: ()) | |
Defined in Data.Eq.Singletons | |
| type Apply (Compare_6989586621679181840Sym1 a6989586621679181845 :: TyFun Bool Ordering -> Type) (a6989586621679181846 :: Bool) | |
| type Apply ((&&@#@$$) a6989586621679122836 :: TyFun Bool Bool -> Type) (a6989586621679122837 :: Bool) | |
| type Apply ((||@#@$$) a6989586621679123482 :: TyFun Bool Bool -> Type) (a6989586621679123483 :: Bool) | |
| type Apply (TFHelper_6989586621679131019Sym1 a6989586621679131024 :: TyFun Bool Bool -> Type) (a6989586621679131025 :: Bool) | |
| type Apply ((<=?@#@$$) a6989586621679462422 :: TyFun Nat Bool -> Type) (a6989586621679462423 :: Nat) | |
Defined in GHC.TypeLits.Singletons.Internal | |
| type Apply (Let6989586621680163560Scrutinee_6989586621680162757Sym0 :: TyFun k1 Bool -> Type) (n6989586621680163559 :: k1) | |
Defined in Data.Proxy.Singletons | |
| type Apply ((/=@#@$$) a6989586621679127813 :: TyFun a Bool -> Type) (a6989586621679127814 :: a) | |
| type Apply ((==@#@$$) a6989586621679127808 :: TyFun a Bool -> Type) (a6989586621679127809 :: a) | |
| type Apply (TFHelper_6989586621679127817Sym1 a6989586621679127822 :: TyFun a Bool -> Type) (a6989586621679127823 :: a) | |
Defined in Data.Eq.Singletons | |
| type Apply (TFHelper_6989586621679127828Sym1 a6989586621679127833 :: TyFun a Bool -> Type) (a6989586621679127834 :: a) | |
Defined in Data.Eq.Singletons | |
| type Apply ((<=@#@$$) a6989586621679166108 :: TyFun a Bool -> Type) (a6989586621679166109 :: a) | |
| type Apply ((<@#@$$) a6989586621679166103 :: TyFun a Bool -> Type) (a6989586621679166104 :: a) | |
| type Apply ((>=@#@$$) a6989586621679166118 :: TyFun a Bool -> Type) (a6989586621679166119 :: a) | |
| type Apply ((>@#@$$) a6989586621679166113 :: TyFun a Bool -> Type) (a6989586621679166114 :: a) | |
| type Apply (TFHelper_6989586621679166153Sym1 a6989586621679166158 :: TyFun a Bool -> Type) (a6989586621679166159 :: a) | |
Defined in Data.Ord.Singletons | |
| type Apply (TFHelper_6989586621679166169Sym1 a6989586621679166174 :: TyFun a Bool -> Type) (a6989586621679166175 :: a) | |
Defined in Data.Ord.Singletons | |
| type Apply (TFHelper_6989586621679166185Sym1 a6989586621679166190 :: TyFun a Bool -> Type) (a6989586621679166191 :: a) | |
Defined in Data.Ord.Singletons | |
| type Apply (TFHelper_6989586621679166201Sym1 a6989586621679166206 :: TyFun a Bool -> Type) (a6989586621679166207 :: a) | |
Defined in Data.Ord.Singletons | |
| type Apply (DefaultEqSym1 a6989586621679130155 :: TyFun k Bool -> Type) (a6989586621679130156 :: k) | |
Defined in Data.Eq.Singletons | |
| type Apply (Let6989586621680184051Scrutinee_6989586621680184015Sym1 x6989586621680184046 :: TyFun k1 Bool -> Type) (y6989586621680184047 :: k1) | |
Defined in Data.Foldable.Singletons | |
| type Apply (Let6989586621680184075Scrutinee_6989586621680184017Sym1 x6989586621680184070 :: TyFun k1 Bool -> Type) (y6989586621680184071 :: k1) | |
Defined in Data.Foldable.Singletons | |
| type Apply (Let6989586621679166141Scrutinee_6989586621679163721Sym1 x6989586621679166139 :: TyFun k1 Bool -> Type) (y6989586621679166140 :: k1) | |
Defined in Data.Ord.Singletons | |
| type Apply (Let6989586621679166145Scrutinee_6989586621679163723Sym1 x6989586621679166139 :: TyFun k1 Bool -> Type) (y6989586621679166140 :: k1) | |
Defined in Data.Ord.Singletons | |
| type Apply (Let6989586621679166226Scrutinee_6989586621679163733Sym1 x6989586621679166224 :: TyFun k1 Bool -> Type) (y6989586621679166225 :: k1) | |
Defined in Data.Ord.Singletons | |
| type Apply (Let6989586621679166242Scrutinee_6989586621679163735Sym1 x6989586621679166240 :: TyFun k1 Bool -> Type) (y6989586621679166241 :: k1) | |
Defined in Data.Ord.Singletons | |
| type Apply (Bool_Sym2 a6989586621679120954 a6989586621679120955 :: TyFun Bool a -> Type) (a6989586621679120956 :: Bool) | |
| type Apply (Let6989586621679731119Scrutinee_6989586621679727564Sym1 n6989586621679731117 :: TyFun k Bool -> Type) (x6989586621679731118 :: k) | |
Defined in Data.List.Singletons.Internal | |
| type Apply (Lambda_6989586621680193722Sym2 a_69895866216801937166989586621680193721 arg_69895866216801931086989586621680193724 :: TyFun k3 Bool -> Type) (arg_69895866216801931106989586621680193725 :: k3) | |
Defined in Data.Foldable.Singletons type Apply (Lambda_6989586621680193722Sym2 a_69895866216801937166989586621680193721 arg_69895866216801931086989586621680193724 :: TyFun k3 Bool -> Type) (arg_69895866216801931106989586621680193725 :: k3) = Lambda_6989586621680193722 a_69895866216801937166989586621680193721 arg_69895866216801931086989586621680193724 arg_69895866216801931106989586621680193725 | |
| type Apply (Let6989586621679731100Scrutinee_6989586621679727566Sym2 x6989586621679731097 xs6989586621679731098 :: TyFun k3 Bool -> Type) (n6989586621679731099 :: k3) | |
Defined in Data.List.Singletons.Internal | |
| type Apply (Let6989586621679731262Scrutinee_6989586621679727550Sym2 n6989586621679731259 x6989586621679731260 :: TyFun k3 Bool -> Type) (xs6989586621679731261 :: k3) | |
Defined in Data.List.Singletons.Internal | |
| type Apply (Let6989586621679731275Scrutinee_6989586621679727548Sym2 n6989586621679731272 x6989586621679731273 :: TyFun k3 Bool -> Type) (xs6989586621679731274 :: k3) | |
Defined in Data.List.Singletons.Internal | |
| type Apply (Let6989586621679731363Scrutinee_6989586621679727542Sym3 x6989586621679731361 xs6989586621679731362 p6989586621679731357 :: TyFun k Bool -> Type) (a_69895866216797313506989586621679731358 :: k) | |
Defined in Data.List.Singletons.Internal type Apply (Let6989586621679731363Scrutinee_6989586621679727542Sym3 x6989586621679731361 xs6989586621679731362 p6989586621679731357 :: TyFun k Bool -> Type) (a_69895866216797313506989586621679731358 :: k) = Let6989586621679731363Scrutinee_6989586621679727542 x6989586621679731361 xs6989586621679731362 p6989586621679731357 a_69895866216797313506989586621679731358 | |
| type Apply (Let6989586621679731087Scrutinee_6989586621679727568Sym3 x6989586621679731084 xs6989586621679731085 ls6989586621679731086 :: TyFun k3 Bool -> Type) (l6989586621679731079 :: k3) | |
Defined in Data.List.Singletons.Internal type Apply (Let6989586621679731087Scrutinee_6989586621679727568Sym3 x6989586621679731084 xs6989586621679731085 ls6989586621679731086 :: TyFun k3 Bool -> Type) (l6989586621679731079 :: k3) = Let6989586621679731087Scrutinee_6989586621679727568 x6989586621679731084 xs6989586621679731085 ls6989586621679731086 l6989586621679731079 | |
| type Apply (Let6989586621679731185Scrutinee_6989586621679727560Sym3 key6989586621679731181 x6989586621679731182 y6989586621679731183 :: TyFun k3 Bool -> Type) (xys6989586621679731184 :: k3) | |
Defined in Data.List.Singletons.Internal type Apply (Let6989586621679731185Scrutinee_6989586621679727560Sym3 key6989586621679731181 x6989586621679731182 y6989586621679731183 :: TyFun k3 Bool -> Type) (xys6989586621679731184 :: k3) = Let6989586621679731185Scrutinee_6989586621679727560 key6989586621679731181 x6989586621679731182 y6989586621679731183 xys6989586621679731184 | |
| type Apply (Let6989586621679731071Scrutinee_6989586621679727570Sym4 y6989586621679731068 ys6989586621679731069 xs6989586621679731070 eq6989586621679731062 :: TyFun k3 Bool -> Type) (l6989586621679731063 :: k3) | |
Defined in Data.List.Singletons.Internal type Apply (Let6989586621679731071Scrutinee_6989586621679727570Sym4 y6989586621679731068 ys6989586621679731069 xs6989586621679731070 eq6989586621679731062 :: TyFun k3 Bool -> Type) (l6989586621679731063 :: k3) = Let6989586621679731071Scrutinee_6989586621679727570 y6989586621679731068 ys6989586621679731069 xs6989586621679731070 eq6989586621679731062 l6989586621679731063 | |
| type Apply (Let6989586621679516447Scrutinee_6989586621679516255Sym4 x6989586621679516446 x06989586621679516441 y6989586621679516442 arg_69895866216795162516989586621679516437 :: TyFun k4 Bool -> Type) (arg_69895866216795162536989586621679516438 :: k4) | |
Defined in Data.Singletons.Base.Enum type Apply (Let6989586621679516447Scrutinee_6989586621679516255Sym4 x6989586621679516446 x06989586621679516441 y6989586621679516442 arg_69895866216795162516989586621679516437 :: TyFun k4 Bool -> Type) (arg_69895866216795162536989586621679516438 :: k4) = Let6989586621679516447Scrutinee_6989586621679516255 x6989586621679516446 x06989586621679516441 y6989586621679516442 arg_69895866216795162516989586621679516437 arg_69895866216795162536989586621679516438 | |
| type Apply (Let6989586621679516356Scrutinee_6989586621679516279Sym5 x16989586621679516351 x26989586621679516352 y6989586621679516353 arg_69895866216795162736989586621679516346 arg_69895866216795162756989586621679516347 :: TyFun k5 Bool -> Type) (arg_69895866216795162776989586621679516348 :: k5) | |
Defined in Data.Singletons.Base.Enum type Apply (Let6989586621679516356Scrutinee_6989586621679516279Sym5 x16989586621679516351 x26989586621679516352 y6989586621679516353 arg_69895866216795162736989586621679516346 arg_69895866216795162756989586621679516347 :: TyFun k5 Bool -> Type) (arg_69895866216795162776989586621679516348 :: k5) = Let6989586621679516356Scrutinee_6989586621679516279 x16989586621679516351 x26989586621679516352 y6989586621679516353 arg_69895866216795162736989586621679516346 arg_69895866216795162756989586621679516347 arg_69895866216795162776989586621679516348 | |
| type Apply (Let6989586621679516393Scrutinee_6989586621679516269Sym5 x16989586621679516388 x26989586621679516389 y6989586621679516390 arg_69895866216795162636989586621679516383 arg_69895866216795162656989586621679516384 :: TyFun k5 Bool -> Type) (arg_69895866216795162676989586621679516385 :: k5) | |
Defined in Data.Singletons.Base.Enum type Apply (Let6989586621679516393Scrutinee_6989586621679516269Sym5 x16989586621679516388 x26989586621679516389 y6989586621679516390 arg_69895866216795162636989586621679516383 arg_69895866216795162656989586621679516384 :: TyFun k5 Bool -> Type) (arg_69895866216795162676989586621679516385 :: k5) = Let6989586621679516393Scrutinee_6989586621679516269 x16989586621679516388 x26989586621679516389 y6989586621679516390 arg_69895866216795162636989586621679516383 arg_69895866216795162656989586621679516384 arg_69895866216795162676989586621679516385 | |
| type Eval (Not 'False) | |
Defined in Fcf.Data.Bool | |
| type Eval (Not 'True) | |
Defined in Fcf.Data.Bool | |
| type Apply (GuardSym0 :: TyFun Bool (f ()) -> Type) (a6989586621679286827 :: Bool) | |
| type Eval (And lst :: Bool -> Type) | |
| type Eval (Or lst :: 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 || 'False :: Bool -> Type) | |
| type Eval (a || 'True :: Bool -> Type) | |
| type Eval (IsJust ('Just _a) :: Bool -> Type) | |
| type Eval (IsJust ('Nothing :: Maybe a) :: Bool -> Type) | |
| type Eval (IsNothing ('Just _a) :: Bool -> Type) | |
| type Eval (IsNothing ('Nothing :: Maybe a) :: Bool -> Type) | |
| type Eval (Null ('[] :: [a]) :: Bool -> Type) | |
| type Eval (Null (a2 ': as) :: 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 Apply TFHelper_6989586621679606123Sym0 (a6989586621679606128 :: All) | |
Defined in Data.Semigroup.Singletons.Internal | |
| type Apply TFHelper_6989586621679606140Sym0 (a6989586621679606145 :: Any) | |
Defined in Data.Semigroup.Singletons.Internal | |
| type Apply TFHelper_6989586621679130639Sym0 (a6989586621679130644 :: Void) | |
Defined in Data.Eq.Singletons | |
| type Apply TFHelper_6989586621679131028Sym0 (a6989586621679131033 :: Ordering) | |
Defined in Data.Eq.Singletons | |
| type Apply TFHelper_6989586621679131037Sym0 (a6989586621679131042 :: ()) | |
Defined in Data.Eq.Singletons type Apply TFHelper_6989586621679131037Sym0 (a6989586621679131042 :: ()) = TFHelper_6989586621679131037Sym1 a6989586621679131042 | |
| type Apply ShowParenSym0 (a6989586621680047463 :: Bool) | |
Defined in Text.Show.Singletons | |
| type Apply Compare_6989586621679181840Sym0 (a6989586621679181845 :: Bool) | |
Defined in Data.Ord.Singletons | |
| type Apply (&&@#@$) (a6989586621679122836 :: Bool) | |
Defined in Data.Bool.Singletons | |
| type Apply (||@#@$) (a6989586621679123482 :: Bool) | |
Defined in Data.Bool.Singletons | |
| type Apply TFHelper_6989586621679131019Sym0 (a6989586621679131024 :: Bool) | |
Defined in Data.Eq.Singletons | |
| type Apply ShowsPrec_6989586621680071834Sym0 (a6989586621680071844 :: Nat) | |
Defined in Text.Show.Singletons | |
| type Apply (<=?@#@$) (a6989586621679462422 :: Nat) | |
Defined in GHC.TypeLits.Singletons.Internal | |
| type Apply (ShowsPrec_6989586621680071834Sym1 a6989586621680071844 :: TyFun Bool (Symbol ~> Symbol) -> Type) (a6989586621680071845 :: Bool) | |
| type Apply (UnlessSym0 :: TyFun Bool (f () ~> f ()) -> Type) (a6989586621680892589 :: Bool) | |
Defined in Control.Monad.Singletons type Apply (UnlessSym0 :: TyFun Bool (f () ~> f ()) -> Type) (a6989586621680892589 :: Bool) = UnlessSym1 a6989586621680892589 :: TyFun (f ()) (f ()) -> Type | |
| type Apply (WhenSym0 :: TyFun Bool (f () ~> f ()) -> Type) (a6989586621679286971 :: Bool) | |
| type Apply (IfSym0 :: TyFun Bool (k ~> (k ~> k)) -> Type) (a6989586621679124049 :: Bool) | |
| type Apply (Elem_6989586621680392157Sym0 :: TyFun a (Identity a ~> Bool) -> Type) (a6989586621680392162 :: a) | |
| type Apply (Elem_6989586621680194236Sym0 :: TyFun a (Proxy a ~> Bool) -> Type) (a6989586621680194241 :: a) | |
| type Apply (Elem_6989586621680194268Sym0 :: TyFun a (Dual a ~> Bool) -> Type) (a6989586621680194277 :: a) | |
| type Apply (Elem_6989586621680194618Sym0 :: TyFun a (Product a ~> Bool) -> Type) (a6989586621680194627 :: a) | |
| type Apply (Elem_6989586621680194443Sym0 :: TyFun a (Sum a ~> Bool) -> Type) (a6989586621680194452 :: a) | |
| type Apply (Elem_6989586621680193860Sym0 :: TyFun a ([a] ~> Bool) -> Type) (a6989586621680193869 :: a) | |
| type Apply (ElemSym0 :: TyFun a ([a] ~> Bool) -> Type) (a6989586621679731822 :: a) | |
| type Apply (NotElemSym0 :: TyFun a ([a] ~> Bool) -> Type) (a6989586621679731814 :: a) | |
| type Apply (ListelemSym0 :: TyFun a ([a] ~> Bool) -> Type) (a6989586621680002068 :: a) | |
| type Apply (Bool_Sym0 :: TyFun a (a ~> (Bool ~> a)) -> Type) (a6989586621679120954 :: a) | |
| type Apply ((/=@#@$) :: TyFun a (a ~> Bool) -> Type) (a6989586621679127813 :: a) | |
| type Apply ((==@#@$) :: TyFun a (a ~> Bool) -> Type) (a6989586621679127808 :: a) | |
| type Apply (TFHelper_6989586621679127817Sym0 :: TyFun a (a ~> Bool) -> Type) (a6989586621679127822 :: a) | |
| type Apply (TFHelper_6989586621679127828Sym0 :: TyFun a (a ~> Bool) -> Type) (a6989586621679127833 :: a) | |
| type Apply ((<=@#@$) :: TyFun a (a ~> Bool) -> Type) (a6989586621679166108 :: a) | |
| type Apply ((<@#@$) :: TyFun a (a ~> Bool) -> Type) (a6989586621679166103 :: a) | |
| type Apply ((>=@#@$) :: TyFun a (a ~> Bool) -> Type) (a6989586621679166118 :: a) | |
| type Apply ((>@#@$) :: TyFun a (a ~> Bool) -> Type) (a6989586621679166113 :: a) | |
| type Apply (TFHelper_6989586621679166153Sym0 :: TyFun a (a ~> Bool) -> Type) (a6989586621679166158 :: a) | |
| type Apply (TFHelper_6989586621679166169Sym0 :: TyFun a (a ~> Bool) -> Type) (a6989586621679166174 :: a) | |
| type Apply (TFHelper_6989586621679166185Sym0 :: TyFun a (a ~> Bool) -> Type) (a6989586621679166190 :: a) | |
| type Apply (TFHelper_6989586621679166201Sym0 :: TyFun a (a ~> Bool) -> Type) (a6989586621679166206 :: a) | |
| type Apply (DefaultEqSym0 :: TyFun k (k ~> Bool) -> Type) (a6989586621679130155 :: k) | |
Defined in Data.Eq.Singletons type Apply (DefaultEqSym0 :: TyFun k (k ~> Bool) -> Type) (a6989586621679130155 :: k) = DefaultEqSym1 a6989586621679130155 | |
| type Apply (Let6989586621680184051Scrutinee_6989586621680184015Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621680184046 :: k1) | |
| type Apply (Let6989586621680184075Scrutinee_6989586621680184017Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621680184070 :: k1) | |
| type Apply (Let6989586621679166141Scrutinee_6989586621679163721Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621679166139 :: k1) | |
| type Apply (Let6989586621679166145Scrutinee_6989586621679163723Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621679166139 :: k1) | |
| type Apply (Let6989586621679166226Scrutinee_6989586621679163733Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621679166224 :: k1) | |
| type Apply (Let6989586621679166242Scrutinee_6989586621679163735Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621679166240 :: k1) | |
| type Apply (Bool_Sym1 a6989586621679120954 :: TyFun a (Bool ~> a) -> Type) (a6989586621679120955 :: a) | |
| type Apply (Elem_bySym1 a6989586621679731050 :: TyFun a ([a] ~> Bool) -> Type) (a6989586621679731051 :: a) | |
| type Apply (ElemSym0 :: TyFun a (t a ~> Bool) -> Type) (a6989586621680193550 :: a) | |
| type Apply (Elem_6989586621680193750Sym0 :: TyFun a (t a ~> Bool) -> Type) (a6989586621680193759 :: a) | |
| type Apply (NotElemSym0 :: TyFun a (t a ~> Bool) -> Type) (a6989586621680193297 :: a) | |
Defined in Data.Foldable.Singletons type Apply (NotElemSym0 :: TyFun a (t a ~> Bool) -> Type) (a6989586621680193297 :: a) = NotElemSym1 a6989586621680193297 :: TyFun (t a) Bool -> Type | |
| type Apply (Let6989586621679731119Scrutinee_6989586621679727564Sym0 :: TyFun k1 (TyFun k Bool -> Type) -> Type) (n6989586621679731117 :: k1) | |
| type Apply (Let6989586621679731363Scrutinee_6989586621679727542Sym0 :: TyFun k1 (TyFun [a] (TyFun (k1 ~> Bool) (TyFun k Bool -> Type) -> Type) -> Type) -> Type) (x6989586621679731361 :: k1) | |
Defined in Data.List.Singletons.Internal type Apply (Let6989586621679731363Scrutinee_6989586621679727542Sym0 :: TyFun k1 (TyFun [a] (TyFun (k1 ~> Bool) (TyFun k Bool -> Type) -> Type) -> Type) -> Type) (x6989586621679731361 :: k1) = Let6989586621679731363Scrutinee_6989586621679727542Sym1 x6989586621679731361 :: TyFun [a] (TyFun (k1 ~> Bool) (TyFun k Bool -> Type) -> Type) -> Type | |
| type Apply (Let6989586621679731185Scrutinee_6989586621679727560Sym0 :: TyFun k1 (TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) (key6989586621679731181 :: k1) | |
Defined in Data.List.Singletons.Internal type Apply (Let6989586621679731185Scrutinee_6989586621679727560Sym0 :: TyFun k1 (TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) (key6989586621679731181 :: k1) = Let6989586621679731185Scrutinee_6989586621679727560Sym1 key6989586621679731181 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type | |
| type Apply (Let6989586621679731071Scrutinee_6989586621679727570Sym0 :: TyFun k1 (TyFun k2 (TyFun [k1] (TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) -> Type) (y6989586621679731068 :: k1) | |
Defined in Data.List.Singletons.Internal type Apply (Let6989586621679731071Scrutinee_6989586621679727570Sym0 :: TyFun k1 (TyFun k2 (TyFun [k1] (TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) -> Type) (y6989586621679731068 :: k1) = Let6989586621679731071Scrutinee_6989586621679727570Sym1 y6989586621679731068 :: TyFun k2 (TyFun [k1] (TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type | |
| type Apply (Let6989586621679731087Scrutinee_6989586621679727568Sym0 :: TyFun k1 (TyFun k2 (TyFun [k1] (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) (x6989586621679731084 :: k1) | |
Defined in Data.List.Singletons.Internal type Apply (Let6989586621679731087Scrutinee_6989586621679727568Sym0 :: TyFun k1 (TyFun k2 (TyFun [k1] (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) (x6989586621679731084 :: k1) = Let6989586621679731087Scrutinee_6989586621679727568Sym1 x6989586621679731084 :: TyFun k2 (TyFun [k1] (TyFun k3 Bool -> Type) -> Type) -> Type | |
| type Apply (Lambda_6989586621680892729Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 (TyFun Bool ([k1] ~> [k1]) -> Type) -> Type) -> Type) -> Type) (x6989586621680892728 :: k1) | |
Defined in Control.Monad.Singletons | |
| type Apply (Lambda_6989586621680193722Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) (a_69895866216801937166989586621680193721 :: k1) | |
Defined in Data.Foldable.Singletons | |
| type Apply (Let6989586621679731100Scrutinee_6989586621679727566Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) (x6989586621679731097 :: k1) | |
Defined in Data.List.Singletons.Internal | |
| type Apply (Let6989586621679731262Scrutinee_6989586621679727550Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) (n6989586621679731259 :: k1) | |
Defined in Data.List.Singletons.Internal | |
| type Apply (Let6989586621679731275Scrutinee_6989586621679727548Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) (n6989586621679731272 :: k1) | |
Defined in Data.List.Singletons.Internal | |
| type Apply (Let6989586621679516447Scrutinee_6989586621679516255Sym0 :: TyFun k1 (TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) -> Type) -> Type) (x6989586621679516446 :: k1) | |
Defined in Data.Singletons.Base.Enum type Apply (Let6989586621679516447Scrutinee_6989586621679516255Sym0 :: TyFun k1 (TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) -> Type) -> Type) (x6989586621679516446 :: k1) = Let6989586621679516447Scrutinee_6989586621679516255Sym1 x6989586621679516446 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) -> Type | |
| type Apply (Let6989586621679731185Scrutinee_6989586621679727560Sym1 key6989586621679731181 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) (x6989586621679731182 :: k1) | |
Defined in Data.List.Singletons.Internal type Apply (Let6989586621679731185Scrutinee_6989586621679727560Sym1 key6989586621679731181 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) (x6989586621679731182 :: k1) = Let6989586621679731185Scrutinee_6989586621679727560Sym2 key6989586621679731181 x6989586621679731182 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type | |
| type Apply (Let6989586621679731071Scrutinee_6989586621679727570Sym1 y6989586621679731068 :: TyFun k2 (TyFun [k1] (TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) (ys6989586621679731069 :: k2) | |
Defined in Data.List.Singletons.Internal type Apply (Let6989586621679731071Scrutinee_6989586621679727570Sym1 y6989586621679731068 :: TyFun k2 (TyFun [k1] (TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) (ys6989586621679731069 :: k2) = Let6989586621679731071Scrutinee_6989586621679727570Sym2 y6989586621679731068 ys6989586621679731069 :: TyFun [k1] (TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) -> Type | |
| type Apply (Let6989586621679731087Scrutinee_6989586621679727568Sym1 x6989586621679731084 :: TyFun k2 (TyFun [k1] (TyFun k3 Bool -> Type) -> Type) -> Type) (xs6989586621679731085 :: k2) | |
Defined in Data.List.Singletons.Internal type Apply (Let6989586621679731087Scrutinee_6989586621679727568Sym1 x6989586621679731084 :: TyFun k2 (TyFun [k1] (TyFun k3 Bool -> Type) -> Type) -> Type) (xs6989586621679731085 :: k2) = Let6989586621679731087Scrutinee_6989586621679727568Sym2 x6989586621679731084 xs6989586621679731085 :: TyFun [k1] (TyFun k3 Bool -> Type) -> Type | |
| type Apply (Lambda_6989586621680892729Sym1 x6989586621680892728 :: TyFun k2 (TyFun k3 (TyFun Bool ([k1] ~> [k1]) -> Type) -> Type) -> Type) (p6989586621680892724 :: k2) | |
Defined in Control.Monad.Singletons | |
| type Apply (Lambda_6989586621680193722Sym1 a_69895866216801937166989586621680193721 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type) (arg_69895866216801931086989586621680193724 :: k2) | |
Defined in Data.Foldable.Singletons type Apply (Lambda_6989586621680193722Sym1 a_69895866216801937166989586621680193721 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type) (arg_69895866216801931086989586621680193724 :: k2) = Lambda_6989586621680193722Sym2 a_69895866216801937166989586621680193721 arg_69895866216801931086989586621680193724 :: TyFun k3 Bool -> Type | |
| type Apply (Let6989586621679731100Scrutinee_6989586621679727566Sym1 x6989586621679731097 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type) (xs6989586621679731098 :: k2) | |
Defined in Data.List.Singletons.Internal | |
| type Apply (Let6989586621679731262Scrutinee_6989586621679727550Sym1 n6989586621679731259 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type) (x6989586621679731260 :: k2) | |
Defined in Data.List.Singletons.Internal | |
| type Apply (Let6989586621679731275Scrutinee_6989586621679727548Sym1 n6989586621679731272 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type) (x6989586621679731273 :: k2) | |
Defined in Data.List.Singletons.Internal | |
| type Apply (Let6989586621679516356Scrutinee_6989586621679516279Sym0 :: TyFun k1 (TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) (x16989586621679516351 :: k1) | |
Defined in Data.Singletons.Base.Enum type Apply (Let6989586621679516356Scrutinee_6989586621679516279Sym0 :: TyFun k1 (TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) (x16989586621679516351 :: k1) = Let6989586621679516356Scrutinee_6989586621679516279Sym1 x16989586621679516351 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type | |
| type Apply (Let6989586621679516393Scrutinee_6989586621679516269Sym0 :: TyFun k1 (TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) (x16989586621679516388 :: k1) | |
Defined in Data.Singletons.Base.Enum type Apply (Let6989586621679516393Scrutinee_6989586621679516269Sym0 :: TyFun k1 (TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) (x16989586621679516388 :: k1) = Let6989586621679516393Scrutinee_6989586621679516269Sym1 x16989586621679516388 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type | |
| type Apply (Let6989586621679516447Scrutinee_6989586621679516255Sym1 x6989586621679516446 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) -> Type) (x06989586621679516441 :: k2) | |
Defined in Data.Singletons.Base.Enum type Apply (Let6989586621679516447Scrutinee_6989586621679516255Sym1 x6989586621679516446 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) -> Type) (x06989586621679516441 :: k2) = Let6989586621679516447Scrutinee_6989586621679516255Sym2 x6989586621679516446 x06989586621679516441 :: TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type | |
| type Apply (Let6989586621679731185Scrutinee_6989586621679727560Sym2 key6989586621679731181 x6989586621679731182 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type) (y6989586621679731183 :: k2) | |
Defined in Data.List.Singletons.Internal type Apply (Let6989586621679731185Scrutinee_6989586621679727560Sym2 key6989586621679731181 x6989586621679731182 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type) (y6989586621679731183 :: k2) = Let6989586621679731185Scrutinee_6989586621679727560Sym3 key6989586621679731181 x6989586621679731182 y6989586621679731183 :: TyFun k3 Bool -> Type | |
| type Apply (Lambda_6989586621680892729Sym2 x6989586621680892728 p6989586621680892724 :: TyFun k3 (TyFun Bool ([k1] ~> [k1]) -> Type) -> Type) (a_69895866216808927176989586621680892725 :: k3) | |
Defined in Control.Monad.Singletons type Apply (Lambda_6989586621680892729Sym2 x6989586621680892728 p6989586621680892724 :: TyFun k3 (TyFun Bool ([k1] ~> [k1]) -> Type) -> Type) (a_69895866216808927176989586621680892725 :: k3) = Lambda_6989586621680892729Sym3 x6989586621680892728 p6989586621680892724 a_69895866216808927176989586621680892725 | |
| type Apply (Lambda_6989586621680892729Sym3 x6989586621680892728 p6989586621680892724 a_69895866216808927176989586621680892725 :: TyFun Bool ([k1] ~> [k1]) -> Type) (flg6989586621680892731 :: Bool) | |
Defined in Control.Monad.Singletons type Apply (Lambda_6989586621680892729Sym3 x6989586621680892728 p6989586621680892724 a_69895866216808927176989586621680892725 :: TyFun Bool ([k1] ~> [k1]) -> Type) (flg6989586621680892731 :: Bool) = Lambda_6989586621680892729 x6989586621680892728 p6989586621680892724 a_69895866216808927176989586621680892725 flg6989586621680892731 | |
| type Apply (Let6989586621679516447Scrutinee_6989586621679516255Sym2 x6989586621679516446 x06989586621679516441 :: TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) (y6989586621679516442 :: k1) | |
Defined in Data.Singletons.Base.Enum type Apply (Let6989586621679516447Scrutinee_6989586621679516255Sym2 x6989586621679516446 x06989586621679516441 :: TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) (y6989586621679516442 :: k1) = Let6989586621679516447Scrutinee_6989586621679516255Sym3 x6989586621679516446 x06989586621679516441 y6989586621679516442 :: TyFun k3 (TyFun k4 Bool -> Type) -> Type | |
| type Apply (Let6989586621679516356Scrutinee_6989586621679516279Sym1 x16989586621679516351 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) (x26989586621679516352 :: k2) | |
Defined in Data.Singletons.Base.Enum type Apply (Let6989586621679516356Scrutinee_6989586621679516279Sym1 x16989586621679516351 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) (x26989586621679516352 :: k2) = Let6989586621679516356Scrutinee_6989586621679516279Sym2 x16989586621679516351 x26989586621679516352 :: TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type | |
| type Apply (Let6989586621679516393Scrutinee_6989586621679516269Sym1 x16989586621679516388 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) (x26989586621679516389 :: k2) | |
Defined in Data.Singletons.Base.Enum type Apply (Let6989586621679516393Scrutinee_6989586621679516269Sym1 x16989586621679516388 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) (x26989586621679516389 :: k2) = Let6989586621679516393Scrutinee_6989586621679516269Sym2 x16989586621679516388 x26989586621679516389 :: TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type | |
| type Apply (Let6989586621679516356Scrutinee_6989586621679516279Sym2 x16989586621679516351 x26989586621679516352 :: TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) (y6989586621679516353 :: k1) | |
Defined in Data.Singletons.Base.Enum type Apply (Let6989586621679516356Scrutinee_6989586621679516279Sym2 x16989586621679516351 x26989586621679516352 :: TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) (y6989586621679516353 :: k1) = Let6989586621679516356Scrutinee_6989586621679516279Sym3 x16989586621679516351 x26989586621679516352 y6989586621679516353 :: TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type | |
| type Apply (Let6989586621679516393Scrutinee_6989586621679516269Sym2 x16989586621679516388 x26989586621679516389 :: TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) (y6989586621679516390 :: k1) | |
Defined in Data.Singletons.Base.Enum type Apply (Let6989586621679516393Scrutinee_6989586621679516269Sym2 x16989586621679516388 x26989586621679516389 :: TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) (y6989586621679516390 :: k1) = Let6989586621679516393Scrutinee_6989586621679516269Sym3 x16989586621679516388 x26989586621679516389 y6989586621679516390 :: TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type | |
| type Apply (Let6989586621679516447Scrutinee_6989586621679516255Sym3 x6989586621679516446 x06989586621679516441 y6989586621679516442 :: TyFun k3 (TyFun k4 Bool -> Type) -> Type) (arg_69895866216795162516989586621679516437 :: k3) | |
Defined in Data.Singletons.Base.Enum type Apply (Let6989586621679516447Scrutinee_6989586621679516255Sym3 x6989586621679516446 x06989586621679516441 y6989586621679516442 :: TyFun k3 (TyFun k4 Bool -> Type) -> Type) (arg_69895866216795162516989586621679516437 :: k3) = Let6989586621679516447Scrutinee_6989586621679516255Sym4 x6989586621679516446 x06989586621679516441 y6989586621679516442 arg_69895866216795162516989586621679516437 :: TyFun k4 Bool -> Type | |
| type Apply (Let6989586621679516356Scrutinee_6989586621679516279Sym3 x16989586621679516351 x26989586621679516352 y6989586621679516353 :: TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) (arg_69895866216795162736989586621679516346 :: k3) | |
Defined in Data.Singletons.Base.Enum type Apply (Let6989586621679516356Scrutinee_6989586621679516279Sym3 x16989586621679516351 x26989586621679516352 y6989586621679516353 :: TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) (arg_69895866216795162736989586621679516346 :: k3) = Let6989586621679516356Scrutinee_6989586621679516279Sym4 x16989586621679516351 x26989586621679516352 y6989586621679516353 arg_69895866216795162736989586621679516346 :: TyFun k4 (TyFun k5 Bool -> Type) -> Type | |
| type Apply (Let6989586621679516393Scrutinee_6989586621679516269Sym3 x16989586621679516388 x26989586621679516389 y6989586621679516390 :: TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) (arg_69895866216795162636989586621679516383 :: k3) | |
Defined in Data.Singletons.Base.Enum type Apply (Let6989586621679516393Scrutinee_6989586621679516269Sym3 x16989586621679516388 x26989586621679516389 y6989586621679516390 :: TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) (arg_69895866216795162636989586621679516383 :: k3) = Let6989586621679516393Scrutinee_6989586621679516269Sym4 x16989586621679516388 x26989586621679516389 y6989586621679516390 arg_69895866216795162636989586621679516383 :: TyFun k4 (TyFun k5 Bool -> Type) -> Type | |
| type Apply (Let6989586621679516356Scrutinee_6989586621679516279Sym4 x16989586621679516351 x26989586621679516352 y6989586621679516353 arg_69895866216795162736989586621679516346 :: TyFun k4 (TyFun k5 Bool -> Type) -> Type) (arg_69895866216795162756989586621679516347 :: k4) | |
Defined in Data.Singletons.Base.Enum type Apply (Let6989586621679516356Scrutinee_6989586621679516279Sym4 x16989586621679516351 x26989586621679516352 y6989586621679516353 arg_69895866216795162736989586621679516346 :: TyFun k4 (TyFun k5 Bool -> Type) -> Type) (arg_69895866216795162756989586621679516347 :: k4) = Let6989586621679516356Scrutinee_6989586621679516279Sym5 x16989586621679516351 x26989586621679516352 y6989586621679516353 arg_69895866216795162736989586621679516346 arg_69895866216795162756989586621679516347 :: TyFun k5 Bool -> Type | |
| type Apply (Let6989586621679516393Scrutinee_6989586621679516269Sym4 x16989586621679516388 x26989586621679516389 y6989586621679516390 arg_69895866216795162636989586621679516383 :: TyFun k4 (TyFun k5 Bool -> Type) -> Type) (arg_69895866216795162656989586621679516384 :: k4) | |
Defined in Data.Singletons.Base.Enum type Apply (Let6989586621679516393Scrutinee_6989586621679516269Sym4 x16989586621679516388 x26989586621679516389 y6989586621679516390 arg_69895866216795162636989586621679516383 :: TyFun k4 (TyFun k5 Bool -> Type) -> Type) (arg_69895866216795162656989586621679516384 :: k4) = Let6989586621679516393Scrutinee_6989586621679516269Sym5 x16989586621679516388 x26989586621679516389 y6989586621679516390 arg_69895866216795162636989586621679516383 arg_69895866216795162656989586621679516384 :: TyFun k5 Bool -> Type | |
| type Eval (IsLeft ('Left _a :: Either a b) :: Bool -> Type) | |
| type Eval (IsLeft ('Right _a :: Either a b) :: Bool -> Type) | |
| type Eval (IsRight ('Left _a :: Either a b) :: Bool -> Type) | |
| type Eval (IsRight ('Right _a :: Either a b) :: Bool -> Type) | |
| type Eval (Elem a2 as :: Bool -> Type) | |
| type Eval (IsInfixOf xs ys :: Bool -> Type) | |
| type Eval (IsPrefixOf xs ys :: Bool -> Type) | |
Defined in Fcf.Data.List | |
| type Eval (IsSuffixOf xs ys :: Bool -> Type) | |
Defined in Fcf.Data.List | |
| type Eval (All p lst :: Bool -> Type) | |
| type Eval (Any p lst :: Bool -> Type) | |
| type Eval (TyEq a b :: Bool -> Type) | |
| type Eval (TyEqSing a b :: Bool -> Type) | |
| type Apply AndSym0 (a6989586621679732059 :: [Bool]) | |
Defined in Data.List.Singletons.Internal | |
| type Apply OrSym0 (a6989586621679732054 :: [Bool]) | |
Defined in Data.List.Singletons.Internal | |
| type Apply (Null_6989586621680392273Sym0 :: TyFun (Identity a) Bool -> Type) (a6989586621680392277 :: Identity a) | |
| type Apply (Null_6989586621680194400Sym0 :: TyFun (Dual a) Bool -> Type) (a6989586621680194404 :: Dual a) | |
| type Apply (Null_6989586621680194750Sym0 :: TyFun (Product a) Bool -> Type) (a6989586621680194754 :: Product a) | |
| type Apply (Null_6989586621680194575Sym0 :: TyFun (Sum a) Bool -> Type) (a6989586621680194579 :: Sum a) | |
| type Apply (IsJustSym0 :: TyFun (Maybe a) Bool -> Type) (a6989586621679486210 :: Maybe a) | |
Defined in Data.Maybe.Singletons | |
| type Apply (IsNothingSym0 :: TyFun (Maybe a) Bool -> Type) (a6989586621679486207 :: Maybe a) | |
Defined in Data.Maybe.Singletons | |
| type Apply (Null_6989586621680193994Sym0 :: TyFun [a] Bool -> Type) (a6989586621680194000 :: [a]) | |
Defined in Data.Foldable.Singletons | |
| type Apply (NullSym0 :: TyFun [a] Bool -> Type) (a6989586621679732232 :: [a]) | |
Defined in Data.List.Singletons.Internal | |
| type Apply (ListnullSym0 :: TyFun [a] Bool -> Type) (a6989586621680001977 :: [a]) | |
Defined in Data.List.Singletons.Internal.Disambiguation | |
| type Apply (AndSym0 :: TyFun (t Bool) Bool -> Type) (a6989586621680193369 :: t Bool) | |
| type Apply (OrSym0 :: TyFun (t Bool) Bool -> Type) (a6989586621680193363 :: t Bool) | |
| type Apply (TFHelper_6989586621679131006Sym1 a6989586621679131011 :: TyFun (Identity a) Bool -> Type) (a6989586621679131012 :: Identity a) | |
| type Apply (Elem_6989586621680392157Sym1 a6989586621680392162 :: TyFun (Identity a) Bool -> Type) (a6989586621680392163 :: Identity a) | |
| type Apply (TFHelper_6989586621680109664Sym1 a6989586621680109669 :: TyFun (First a) Bool -> Type) (a6989586621680109670 :: First a) | |
| type Apply (TFHelper_6989586621680109684Sym1 a6989586621680109689 :: TyFun (Last a) Bool -> Type) (a6989586621680109690 :: Last a) | |
| type Apply (TFHelper_6989586621679179231Sym1 a6989586621679179236 :: TyFun (Down a) Bool -> Type) (a6989586621679179237 :: Down a) | |
| type Apply (TFHelper_6989586621679606240Sym1 a6989586621679606245 :: TyFun (First a) Bool -> Type) (a6989586621679606246 :: First a) | |
| type Apply (TFHelper_6989586621679606260Sym1 a6989586621679606265 :: TyFun (Last a) Bool -> Type) (a6989586621679606266 :: Last a) | |
| type Apply (TFHelper_6989586621679606220Sym1 a6989586621679606225 :: TyFun (Max a) Bool -> Type) (a6989586621679606226 :: Max a) | |
| type Apply (TFHelper_6989586621679606200Sym1 a6989586621679606205 :: TyFun (Min a) Bool -> Type) (a6989586621679606206 :: Min a) | |
| type Apply (TFHelper_6989586621679606280Sym1 a6989586621679606285 :: TyFun (WrappedMonoid m) Bool -> Type) (a6989586621679606286 :: WrappedMonoid m) | |
Defined in Data.Semigroup.Singletons.Internal type Apply (TFHelper_6989586621679606280Sym1 a6989586621679606285 :: TyFun (WrappedMonoid m) Bool -> Type) (a6989586621679606286 :: WrappedMonoid m) = TFHelper_6989586621679606280 a6989586621679606285 a6989586621679606286 | |
| type Apply (Elem_6989586621680194268Sym1 a6989586621680194277 :: TyFun (Dual a) Bool -> Type) (a6989586621680194278 :: Dual a) | |
| type Apply (TFHelper_6989586621679606106Sym1 a6989586621679606111 :: TyFun (Dual a) Bool -> Type) (a6989586621679606112 :: Dual a) | |
| type Apply (Elem_6989586621680194618Sym1 a6989586621680194627 :: TyFun (Product a) Bool -> Type) (a6989586621680194628 :: Product a) | |
| type Apply (TFHelper_6989586621679606180Sym1 a6989586621679606185 :: TyFun (Product a) Bool -> Type) (a6989586621679606186 :: Product a) | |
| type Apply (Elem_6989586621680194443Sym1 a6989586621680194452 :: TyFun (Sum a) Bool -> Type) (a6989586621680194453 :: Sum a) | |
| type Apply (TFHelper_6989586621679606160Sym1 a6989586621679606165 :: TyFun (Sum a) Bool -> Type) (a6989586621679606166 :: Sum a) | |
| type Apply (TFHelper_6989586621679130622Sym1 a6989586621679130627 :: TyFun (NonEmpty a) Bool -> Type) (a6989586621679130628 :: NonEmpty a) | |
| type Apply (TFHelper_6989586621679130516Sym1 a6989586621679130521 :: TyFun (Maybe a) Bool -> Type) (a6989586621679130522 :: Maybe a) | |
| type Apply (TFHelper_6989586621679130547Sym1 a6989586621679130552 :: TyFun [a] Bool -> Type) (a6989586621679130553 :: [a]) | |
Defined in Data.Eq.Singletons | |
| type Apply (Elem_6989586621680193860Sym1 a6989586621680193869 :: TyFun [a] Bool -> Type) (a6989586621680193870 :: [a]) | |
Defined in Data.Foldable.Singletons | |
| type Apply (AllSym1 a6989586621679732047 :: TyFun [a] Bool -> Type) (a6989586621679732048 :: [a]) | |
Defined in Data.List.Singletons.Internal | |
| type Apply (AnySym1 a6989586621679732039 :: TyFun [a] Bool -> Type) (a6989586621679732040 :: [a]) | |
Defined in Data.List.Singletons.Internal | |
| type Apply (ElemSym1 a6989586621679731822 :: TyFun [a] Bool -> Type) (a6989586621679731823 :: [a]) | |
Defined in Data.List.Singletons.Internal | |
| type Apply (IsInfixOfSym1 a6989586621679731830 :: TyFun [a] Bool -> Type) (a6989586621679731831 :: [a]) | |
Defined in Data.List.Singletons.Internal | |
| type Apply (IsPrefixOfSym1 a6989586621679731844 :: TyFun [a] Bool -> Type) (a6989586621679731845 :: [a]) | |
Defined in Data.List.Singletons.Internal type Apply (IsPrefixOfSym1 a6989586621679731844 :: TyFun [a] Bool -> Type) (a6989586621679731845 :: [a]) = IsPrefixOf a6989586621679731844 a6989586621679731845 | |
| type Apply (IsSuffixOfSym1 a6989586621679731837 :: TyFun [a] Bool -> Type) (a6989586621679731838 :: [a]) | |
Defined in Data.List.Singletons.Internal type Apply (IsSuffixOfSym1 a6989586621679731837 :: TyFun [a] Bool -> Type) (a6989586621679731838 :: [a]) = IsSuffixOf a6989586621679731837 a6989586621679731838 | |
| type Apply (NotElemSym1 a6989586621679731814 :: TyFun [a] Bool -> Type) (a6989586621679731815 :: [a]) | |
Defined in Data.List.Singletons.Internal | |
| type Apply (ListelemSym1 a6989586621680002068 :: TyFun [a] Bool -> Type) (a6989586621680002069 :: [a]) | |
Defined in Data.List.Singletons.Internal.Disambiguation | |
| type Apply (ListisPrefixOfSym1 a6989586621680002140 :: TyFun [a] Bool -> Type) (a6989586621680002141 :: [a]) | |
Defined in Data.List.Singletons.Internal.Disambiguation | |
| type Apply (Elem_bySym2 a6989586621679731050 a6989586621679731051 :: TyFun [a] Bool -> Type) (a6989586621679731052 :: [a]) | |
Defined in Data.List.Singletons.Internal | |
| type Apply (AllSym1 a6989586621680193346 :: TyFun (t a) Bool -> Type) (a6989586621680193347 :: t a) | |
| type Apply (AnySym1 a6989586621680193355 :: TyFun (t a) Bool -> Type) (a6989586621680193356 :: t a) | |
| type Apply (ElemSym1 a6989586621680193550 :: TyFun (t a) Bool -> Type) (a6989586621680193551 :: t a) | |
| type Apply (Elem_6989586621680193750Sym1 a6989586621680193759 :: TyFun (t a) Bool -> Type) (a6989586621680193760 :: t a) | |
Defined in Data.Foldable.Singletons | |
| type Apply (NotElemSym1 a6989586621680193297 :: TyFun (t a) Bool -> Type) (a6989586621680193298 :: t a) | |
Defined in Data.Foldable.Singletons | |
| type Apply (NullSym0 :: TyFun (t a) Bool -> Type) (a6989586621680193543 :: t a) | |
| type Apply (Null_6989586621680193714Sym0 :: TyFun (t a) Bool -> Type) (a6989586621680193720 :: t a) | |
Defined in Data.Foldable.Singletons | |
| type Apply (TFHelper_6989586621679131006Sym0 :: TyFun (Identity a) (Identity a ~> Bool) -> Type) (a6989586621679131011 :: Identity a) | |
| type Apply (TFHelper_6989586621680109664Sym0 :: TyFun (First a) (First a ~> Bool) -> Type) (a6989586621680109669 :: First a) | |
| type Apply (TFHelper_6989586621680109684Sym0 :: TyFun (Last a) (Last a ~> Bool) -> Type) (a6989586621680109689 :: Last a) | |
| type Apply (TFHelper_6989586621679179231Sym0 :: TyFun (Down a) (Down a ~> Bool) -> Type) (a6989586621679179236 :: Down a) | |
| type Apply (TFHelper_6989586621679606240Sym0 :: TyFun (First a) (First a ~> Bool) -> Type) (a6989586621679606245 :: First a) | |
| type Apply (TFHelper_6989586621679606260Sym0 :: TyFun (Last a) (Last a ~> Bool) -> Type) (a6989586621679606265 :: Last a) | |
| type Apply (TFHelper_6989586621679606220Sym0 :: TyFun (Max a) (Max a ~> Bool) -> Type) (a6989586621679606225 :: Max a) | |
| type Apply (TFHelper_6989586621679606200Sym0 :: TyFun (Min a) (Min a ~> Bool) -> Type) (a6989586621679606205 :: Min a) | |
| type Apply (TFHelper_6989586621679606280Sym0 :: TyFun (WrappedMonoid m) (WrappedMonoid m ~> Bool) -> Type) (a6989586621679606285 :: WrappedMonoid m) | |
Defined in Data.Semigroup.Singletons.Internal type Apply (TFHelper_6989586621679606280Sym0 :: TyFun (WrappedMonoid m) (WrappedMonoid m ~> Bool) -> Type) (a6989586621679606285 :: WrappedMonoid m) = TFHelper_6989586621679606280Sym1 a6989586621679606285 | |
| type Apply (TFHelper_6989586621679606106Sym0 :: TyFun (Dual a) (Dual a ~> Bool) -> Type) (a6989586621679606111 :: Dual a) | |
| type Apply (TFHelper_6989586621679606180Sym0 :: TyFun (Product a) (Product a ~> Bool) -> Type) (a6989586621679606185 :: Product a) | |
| type Apply (TFHelper_6989586621679606160Sym0 :: TyFun (Sum a) (Sum a ~> Bool) -> Type) (a6989586621679606165 :: Sum a) | |
| type Apply (TFHelper_6989586621679130622Sym0 :: TyFun (NonEmpty a) (NonEmpty a ~> Bool) -> Type) (a6989586621679130627 :: NonEmpty a) | |
| type Apply (TFHelper_6989586621679130516Sym0 :: TyFun (Maybe a) (Maybe a ~> Bool) -> Type) (a6989586621679130521 :: Maybe a) | |
| type Apply (TFHelper_6989586621679130547Sym0 :: TyFun [a] ([a] ~> Bool) -> Type) (a6989586621679130552 :: [a]) | |
| type Apply (IsInfixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type) (a6989586621679731830 :: [a]) | |
Defined in Data.List.Singletons.Internal type Apply (IsInfixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type) (a6989586621679731830 :: [a]) = IsInfixOfSym1 a6989586621679731830 | |
| type Apply (IsPrefixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type) (a6989586621679731844 :: [a]) | |
Defined in Data.List.Singletons.Internal type Apply (IsPrefixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type) (a6989586621679731844 :: [a]) = IsPrefixOfSym1 a6989586621679731844 | |
| type Apply (IsSuffixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type) (a6989586621679731837 :: [a]) | |
Defined in Data.List.Singletons.Internal type Apply (IsSuffixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type) (a6989586621679731837 :: [a]) = IsSuffixOfSym1 a6989586621679731837 | |
| type Apply (ListisPrefixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type) (a6989586621680002140 :: [a]) | |
| type Apply (Let6989586621679731363Scrutinee_6989586621679727542Sym1 x6989586621679731361 :: TyFun [a] (TyFun (k1 ~> Bool) (TyFun k Bool -> Type) -> Type) -> Type) (xs6989586621679731362 :: [a]) | |
Defined in Data.List.Singletons.Internal type Apply (Let6989586621679731363Scrutinee_6989586621679727542Sym1 x6989586621679731361 :: TyFun [a] (TyFun (k1 ~> Bool) (TyFun k Bool -> Type) -> Type) -> Type) (xs6989586621679731362 :: [a]) = Let6989586621679731363Scrutinee_6989586621679727542Sym2 x6989586621679731361 xs6989586621679731362 :: TyFun (k1 ~> Bool) (TyFun k Bool -> Type) -> Type | |
| type Apply (Let6989586621679731071Scrutinee_6989586621679727570Sym2 y6989586621679731068 ys6989586621679731069 :: TyFun [k1] (TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) -> Type) (xs6989586621679731070 :: [k1]) | |
Defined in Data.List.Singletons.Internal type Apply (Let6989586621679731071Scrutinee_6989586621679727570Sym2 y6989586621679731068 ys6989586621679731069 :: TyFun [k1] (TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) -> Type) (xs6989586621679731070 :: [k1]) = Let6989586621679731071Scrutinee_6989586621679727570Sym3 y6989586621679731068 ys6989586621679731069 xs6989586621679731070 :: TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type | |
| type Apply (Let6989586621679731087Scrutinee_6989586621679727568Sym2 x6989586621679731084 xs6989586621679731085 :: TyFun [k1] (TyFun k3 Bool -> Type) -> Type) (ls6989586621679731086 :: [k1]) | |
Defined in Data.List.Singletons.Internal type Apply (Let6989586621679731087Scrutinee_6989586621679727568Sym2 x6989586621679731084 xs6989586621679731085 :: TyFun [k1] (TyFun k3 Bool -> Type) -> Type) (ls6989586621679731086 :: [k1]) = Let6989586621679731087Scrutinee_6989586621679727568Sym3 x6989586621679731084 xs6989586621679731085 ls6989586621679731086 :: TyFun k3 Bool -> Type | |
| type Apply (IsLeftSym0 :: TyFun (Either a b) Bool -> Type) (a6989586621679277095 :: Either a b) | |
Defined in Data.Either.Singletons | |
| type Apply (IsRightSym0 :: TyFun (Either a b) Bool -> Type) (a6989586621679277092 :: Either a b) | |
Defined in Data.Either.Singletons | |
| type Apply (Null_6989586621680194155Sym0 :: TyFun (Either a1 a2) Bool -> Type) (a6989586621680194161 :: Either a1 a2) | |
| type Apply (Elem_6989586621680194236Sym1 a6989586621680194241 :: TyFun (Proxy a) Bool -> Type) (a6989586621680194242 :: Proxy a) | |
| type Apply (Null_6989586621680194229Sym0 :: TyFun (Proxy a) Bool -> Type) (a6989586621680194233 :: Proxy a) | |
| type Apply (TFHelper_6989586621679130594Sym1 a6989586621679130599 :: TyFun (Either a b) Bool -> Type) (a6989586621679130600 :: Either a b) | |
| type Apply (TFHelper_6989586621680163384Sym1 a6989586621680163389 :: TyFun (Proxy s) Bool -> Type) (a6989586621680163390 :: Proxy s) | |
| type Apply (TFHelper_6989586621680605296Sym1 a6989586621680605301 :: TyFun (Arg a b) Bool -> Type) (a6989586621680605302 :: Arg a b) | |
| type Apply (TFHelper_6989586621679130662Sym1 a6989586621679130667 :: TyFun (a, b) Bool -> Type) (a6989586621679130668 :: (a, b)) | |
Defined in Data.Eq.Singletons | |
| type Apply (DeleteFirstsBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> ([a] ~> [a])) -> Type) (a6989586621679731576 :: a ~> (a ~> Bool)) | |
Defined in Data.List.Singletons.Internal | |
| type Apply (IntersectBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> ([a] ~> [a])) -> Type) (a6989586621679731401 :: a ~> (a ~> Bool)) | |
Defined in Data.List.Singletons.Internal | |
| type Apply (UnionBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> ([a] ~> [a])) -> Type) (a6989586621679731040 :: a ~> (a ~> Bool)) | |
Defined in Data.List.Singletons.Internal | |
| type Apply (GroupBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> [[a]]) -> Type) (a6989586621679731193 :: a ~> (a ~> Bool)) | |
Defined in Data.List.Singletons.Internal | |
| type Apply (NubBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> [a]) -> Type) (a6989586621679731060 :: a ~> (a ~> Bool)) | |
| type Apply (ListnubBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> [a]) -> Type) (a6989586621680002102 :: a ~> (a ~> Bool)) | |
| type Apply (Elem_bySym0 :: TyFun (a ~> (a ~> Bool)) (a ~> ([a] ~> Bool)) -> Type) (a6989586621679731050 :: a ~> (a ~> Bool)) | |
| type Apply (DeleteBySym0 :: TyFun (a ~> (a ~> Bool)) (a ~> ([a] ~> [a])) -> Type) (a6989586621679731586 :: a ~> (a ~> Bool)) | |
Defined in Data.List.Singletons.Internal | |
| type Apply (UntilSym0 :: TyFun (a ~> Bool) ((a ~> a) ~> (a ~> a)) -> Type) (a6989586621679248366 :: a ~> Bool) | |
| type Apply (FindIndexSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe Nat) -> Type) (a6989586621679731453 :: a ~> Bool) | |
Defined in Data.List.Singletons.Internal | |
| type Apply (FindSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe a) -> Type) (a6989586621679731480 :: a ~> Bool) | |
| type Apply (BreakSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) (a6989586621679731283 :: a ~> Bool) | |
| type Apply (PartitionSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) (a6989586621679731171 :: a ~> Bool) | |
Defined in Data.List.Singletons.Internal type Apply (PartitionSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) (a6989586621679731171 :: a ~> Bool) = PartitionSym1 a6989586621679731171 | |
| type Apply (SpanSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) (a6989586621679731318 :: a ~> Bool) | |
| type Apply (ListpartitionSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) (a6989586621680002162 :: a ~> Bool) | |
| type Apply (ListspanSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) (a6989586621680002184 :: a ~> Bool) | |
| type Apply (AllSym0 :: TyFun (a ~> Bool) ([a] ~> Bool) -> Type) (a6989586621679732047 :: a ~> Bool) | |
| type Apply (AnySym0 :: TyFun (a ~> Bool) ([a] ~> Bool) -> Type) (a6989586621679732039 :: a ~> Bool) | |
| type Apply (FindIndicesSym0 :: TyFun (a ~> Bool) ([a] ~> [Nat]) -> Type) (a6989586621679731430 :: a ~> Bool) | |
Defined in Data.List.Singletons.Internal | |
| type Apply (DropWhileEndSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) (a6989586621679731355 :: a ~> Bool) | |
Defined in Data.List.Singletons.Internal type Apply (DropWhileEndSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) (a6989586621679731355 :: a ~> Bool) = DropWhileEndSym1 a6989586621679731355 | |
| type Apply (DropWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) (a6989586621679731372 :: a ~> Bool) | |
Defined in Data.List.Singletons.Internal type Apply (DropWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) (a6989586621679731372 :: a ~> Bool) = DropWhileSym1 a6989586621679731372 | |
| type Apply (FilterSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) (a6989586621679731487 :: a ~> Bool) | |
Defined in Data.List.Singletons.Internal type Apply (FilterSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) (a6989586621679731487 :: a ~> Bool) = FilterSym1 a6989586621679731487 | |
| type Apply (TakeWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) (a6989586621679731387 :: a ~> Bool) | |
Defined in Data.List.Singletons.Internal type Apply (TakeWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) (a6989586621679731387 :: a ~> Bool) = TakeWhileSym1 a6989586621679731387 | |
| type Apply (ListdropWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) (a6989586621680002195 :: a ~> Bool) | |
| type Apply (ListfilterSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) (a6989586621680002173 :: a ~> Bool) | |
| type Apply (ListtakeWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) (a6989586621680002206 :: a ~> Bool) | |
| type Apply (SelectSym0 :: TyFun (a ~> Bool) (a ~> (([a], [a]) ~> ([a], [a]))) -> Type) (a6989586621679731156 :: a ~> Bool) | |
| type Apply (Let6989586621679731296X_6989586621679731297Sym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] ([k], [k]) -> Type) -> Type) -> Type) (p6989586621679731287 :: k ~> Bool) | |
| type Apply (Let6989586621679731331X_6989586621679731332Sym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] ([k], [k]) -> Type) -> Type) -> Type) (p6989586621679731322 :: k ~> Bool) | |
| type Apply (Let6989586621679731296YsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) (p6989586621679731287 :: k ~> Bool) | |
| type Apply (Let6989586621679731296ZsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) (p6989586621679731287 :: k ~> Bool) | |
| type Apply (Let6989586621679731331YsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) (p6989586621679731322 :: k ~> Bool) | |
| type Apply (Let6989586621679731331ZsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) (p6989586621679731322 :: k ~> Bool) | |
| type Apply (TFHelper_6989586621679130594Sym0 :: TyFun (Either a b) (Either a b ~> Bool) -> Type) (a6989586621679130599 :: Either a b) | |
| type Apply (TFHelper_6989586621680163384Sym0 :: TyFun (Proxy s) (Proxy s ~> Bool) -> Type) (a6989586621680163389 :: Proxy s) | |
| type Apply (TFHelper_6989586621680605296Sym0 :: TyFun (Arg a b) (Arg a b ~> Bool) -> Type) (a6989586621680605301 :: Arg a b) | |
| type Apply (MfilterSym0 :: TyFun (a ~> Bool) (m a ~> m a) -> Type) (a6989586621680892560 :: a ~> Bool) | |
Defined in Control.Monad.Singletons | |
| type Apply (FindSym0 :: TyFun (a ~> Bool) (t a ~> Maybe a) -> Type) (a6989586621680193279 :: a ~> Bool) | |
| type Apply (AllSym0 :: TyFun (a ~> Bool) (t a ~> Bool) -> Type) (a6989586621680193346 :: a ~> Bool) | |
| type Apply (AnySym0 :: TyFun (a ~> Bool) (t a ~> Bool) -> Type) (a6989586621680193355 :: a ~> Bool) | |
| type Apply (Lambda_6989586621680193283Sym0 :: TyFun (a ~> Bool) (TyFun k (TyFun a (First a) -> Type) -> Type) -> Type) (p6989586621680193281 :: a ~> Bool) | |
| type Apply (Lambda_6989586621679731359Sym0 :: TyFun (a ~> Bool) (TyFun k (TyFun a (TyFun [a] [a] -> Type) -> Type) -> Type) -> Type) (p6989586621679731357 :: a ~> Bool) | |
Defined in Data.List.Singletons.Internal | |
| type Apply (FilterMSym0 :: TyFun (a ~> m Bool) ([a] ~> m [a]) -> Type) (a6989586621680892722 :: a ~> m Bool) | |
Defined in Control.Monad.Singletons type Apply (FilterMSym0 :: TyFun (a ~> m Bool) ([a] ~> m [a]) -> Type) (a6989586621680892722 :: a ~> m Bool) = FilterMSym1 a6989586621680892722 | |
| type Apply (Let6989586621679731198X_6989586621679731199Sym0 :: TyFun (k1 ~> (a ~> Bool)) (TyFun k1 (TyFun [a] ([a], [a]) -> Type) -> Type) -> Type) (eq6989586621679731195 :: k1 ~> (a ~> Bool)) | |
Defined in Data.List.Singletons.Internal | |
| type Apply (Let6989586621679731198YsSym0 :: TyFun (k1 ~> (a ~> Bool)) (TyFun k1 (TyFun [a] [a] -> Type) -> Type) -> Type) (eq6989586621679731195 :: k1 ~> (a ~> Bool)) | |
| type Apply (Let6989586621679731198ZsSym0 :: TyFun (k1 ~> (a ~> Bool)) (TyFun k1 (TyFun [a] [a] -> Type) -> Type) -> Type) (eq6989586621679731195 :: k1 ~> (a ~> Bool)) | |
| type Apply (Let6989586621679731064NubBy'Sym0 :: TyFun (k1 ~> (k1 ~> Bool)) (TyFun k (TyFun [k1] ([k1] ~> [k1]) -> Type) -> Type) -> Type) (eq6989586621679731062 :: k1 ~> (k1 ~> Bool)) | |
Defined in Data.List.Singletons.Internal | |
| type Apply (Let6989586621679248372GoSym0 :: TyFun (k1 ~> Bool) (TyFun (k1 ~> k1) (TyFun k2 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type) (p6989586621679248369 :: k1 ~> Bool) | |
Defined in GHC.Base.Singletons | |
| type Apply (TFHelper_6989586621679130662Sym0 :: TyFun (a, b) ((a, b) ~> Bool) -> Type) (a6989586621679130667 :: (a, b)) | |
| type Apply (Lambda_6989586621680892564Sym0 :: TyFun (k1 ~> Bool) (TyFun k (TyFun k1 (m k1) -> Type) -> Type) -> Type) (p6989586621680892562 :: k1 ~> Bool) | |
| type Apply (Lambda_6989586621680892726Sym0 :: TyFun (k2 ~> f Bool) (TyFun k3 (TyFun k2 (f [k2] ~> f [k2]) -> Type) -> Type) -> Type) (p6989586621680892724 :: k2 ~> f Bool) | |
Defined in Control.Monad.Singletons | |
| type Apply (Lambda_6989586621679731412Sym0 :: TyFun (b ~> (a ~> Bool)) (TyFun k1 (TyFun k2 (TyFun a (TyFun [a] (TyFun b (m b) -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) (eq6989586621679731404 :: b ~> (a ~> Bool)) | |
Defined in Data.List.Singletons.Internal type Apply (Lambda_6989586621679731412Sym0 :: TyFun (b ~> (a ~> Bool)) (TyFun k1 (TyFun k2 (TyFun a (TyFun [a] (TyFun b (m b) -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) (eq6989586621679731404 :: b ~> (a ~> Bool)) = Lambda_6989586621679731412Sym1 eq6989586621679731404 :: TyFun k1 (TyFun k2 (TyFun a (TyFun [a] (TyFun b (m b) -> Type) -> Type) -> Type) -> Type) -> Type | |
| type Apply (Let6989586621679731363Scrutinee_6989586621679727542Sym2 x6989586621679731361 xs6989586621679731362 :: TyFun (k1 ~> Bool) (TyFun k Bool -> Type) -> Type) (p6989586621679731357 :: k1 ~> Bool) | |
Defined in Data.List.Singletons.Internal type Apply (Let6989586621679731363Scrutinee_6989586621679727542Sym2 x6989586621679731361 xs6989586621679731362 :: TyFun (k1 ~> Bool) (TyFun k Bool -> Type) -> Type) (p6989586621679731357 :: k1 ~> Bool) = Let6989586621679731363Scrutinee_6989586621679727542Sym3 x6989586621679731361 xs6989586621679731362 p6989586621679731357 :: TyFun k Bool -> Type | |
| type Apply (Let6989586621679731071Scrutinee_6989586621679727570Sym3 y6989586621679731068 ys6989586621679731069 xs6989586621679731070 :: TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) (eq6989586621679731062 :: k1 ~> (k1 ~> Bool)) | |
Defined in Data.List.Singletons.Internal type Apply (Let6989586621679731071Scrutinee_6989586621679727570Sym3 y6989586621679731068 ys6989586621679731069 xs6989586621679731070 :: TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) (eq6989586621679731062 :: k1 ~> (k1 ~> Bool)) = Let6989586621679731071Scrutinee_6989586621679727570Sym4 y6989586621679731068 ys6989586621679731069 xs6989586621679731070 eq6989586621679731062 :: TyFun k3 Bool -> Type | |
| type Apply (TFHelper_6989586621680428549Sym1 a6989586621680428554 :: TyFun (Const a b) Bool -> Type) (a6989586621680428555 :: Const a b) | |
| type Apply (TFHelper_6989586621679130700Sym1 a6989586621679130705 :: TyFun (a, b, c) Bool -> Type) (a6989586621679130706 :: (a, b, c)) | |
Defined in Data.Eq.Singletons | |
| type Apply (TFHelper_6989586621680428549Sym0 :: TyFun (Const a b) (Const a b ~> Bool) -> Type) (a6989586621680428554 :: Const a b) | |
| type Apply (TFHelper_6989586621679130700Sym0 :: TyFun (a, b, c) ((a, b, c) ~> Bool) -> Type) (a6989586621679130705 :: (a, b, c)) | |
| type Apply (TFHelper_6989586621679130749Sym1 a6989586621679130754 :: TyFun (a, b, c, d) Bool -> Type) (a6989586621679130755 :: (a, b, c, d)) | |
Defined in Data.Eq.Singletons | |
| type Apply (TFHelper_6989586621679130749Sym0 :: TyFun (a, b, c, d) ((a, b, c, d) ~> Bool) -> Type) (a6989586621679130754 :: (a, b, c, d)) | |
| type Apply (TFHelper_6989586621679130809Sym1 a6989586621679130814 :: TyFun (a, b, c, d, e) Bool -> Type) (a6989586621679130815 :: (a, b, c, d, e)) | |
Defined in Data.Eq.Singletons | |
| type Apply (TFHelper_6989586621679130809Sym0 :: TyFun (a, b, c, d, e) ((a, b, c, d, e) ~> Bool) -> Type) (a6989586621679130814 :: (a, b, c, d, e)) | |
| type Apply (TFHelper_6989586621679130880Sym1 a6989586621679130885 :: TyFun (a, b, c, d, e, f) Bool -> Type) (a6989586621679130886 :: (a, b, c, d, e, f)) | |
Defined in Data.Eq.Singletons | |
| type Apply (TFHelper_6989586621679130880Sym0 :: TyFun (a, b, c, d, e, f) ((a, b, c, d, e, f) ~> Bool) -> Type) (a6989586621679130885 :: (a, b, c, d, e, f)) | |
| type Apply (TFHelper_6989586621679130962Sym1 a6989586621679130967 :: TyFun (a, b, c, d, e, f, g) Bool -> Type) (a6989586621679130968 :: (a, b, c, d, e, f, g)) | |
Defined in Data.Eq.Singletons | |
| type Apply (TFHelper_6989586621679130962Sym0 :: TyFun (a, b, c, d, e, f, g) ((a, b, c, d, e, f, g) ~> Bool) -> Type) (a6989586621679130967 :: (a, b, c, d, e, f, g)) | |
The character type Char is an enumeration whose values represent
Unicode (or equivalently ISO/IEC 10646) code points (i.e. characters, see
http://www.unicode.org/ for details). This set extends the ISO 8859-1
(Latin-1) character set (the first 256 characters), which is itself an extension
of the ASCII character set (the first 128 characters). A character literal in
Haskell has type Char.
To convert a Char to or from the corresponding Int value defined
by Unicode, use toEnum and fromEnum from the
Enum class respectively (or equivalently ord and
chr).
Instances
Double-precision floating point numbers. It is desirable that this type be at least equal in range and precision to the IEEE double-precision type.
Instances
Single-precision floating point numbers. It is desirable that this type be at least equal in range and precision to the IEEE single-precision type.
Instances
A fixed-precision integer type with at least the range [-2^29 .. 2^29-1].
The exact range for a given implementation can be determined by using
minBound and maxBound from the Bounded class.
Instances
8-bit signed integer type
Instances
16-bit signed integer type
Instances
32-bit signed integer type
Instances
64-bit signed integer type
Instances
Arbitrary precision integers. In contrast with fixed-size integral types
such as Int, the Integer type represents the entire infinite range of
integers.
Integers are stored in a kind of sign-magnitude form, hence do not expect two's complement form when using bit operations.
If the value is small (fit into an Int), IS constructor is used.
Otherwise IP and IN constructors are used to store a BigNat
representing respectively the positive or the negative value magnitude.
Instances
Natural number
Invariant: numbers <= 0xffffffffffffffff use the NS constructor
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
| MonadFail Maybe | Since: base-4.9.0.0 |
Defined in Control.Monad.Fail | |
| 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 |
| Applicative Maybe | Since: base-2.1 |
| Functor Maybe | Since: base-2.1 |
| Monad 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 | |
| KnownNamedFunctor Maybe | |
Defined in Morley.Util.Named | |
| InjValue Maybe | |
Defined in Named.Internal | |
| SMonadFail Maybe | |
| PApplicative Maybe | |
| PFunctor Maybe | |
Defined in Control.Monad.Singletons.Internal | |
| PMonad Maybe | |
| SAlternative Maybe | |
| SApplicative Maybe | |
Defined in Control.Monad.Singletons.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) # | |
| SFunctor Maybe | |
| SMonad Maybe | |
Defined in Control.Monad.Singletons.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) # | |
| SMonadPlus Maybe | |
| PFoldable Maybe | |
| SFoldable Maybe | |
Defined in Data.Foldable.Singletons Methods sFold :: forall m (t1 :: Maybe m). SMonoid m => Sing t1 -> Sing (Apply FoldSym0 t1) # 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 (t1 :: Maybe a). Sing t1 -> Sing (Apply ToListSym0 t1) # sNull :: forall a (t1 :: Maybe a). Sing t1 -> Sing (Apply NullSym0 t1) # sLength :: forall a (t1 :: Maybe a). Sing t1 -> Sing (Apply LengthSym0 t1) # sElem :: forall a (t1 :: a) (t2 :: Maybe a). SEq a => Sing t1 -> Sing t2 -> Sing (Apply (Apply ElemSym0 t1) t2) # sMaximum :: forall a (t1 :: Maybe a). SOrd a => Sing t1 -> Sing (Apply MaximumSym0 t1) # sMinimum :: forall a (t1 :: Maybe a). SOrd a => Sing t1 -> Sing (Apply MinimumSym0 t1) # sSum :: forall a (t1 :: Maybe a). SNum a => Sing t1 -> Sing (Apply SumSym0 t1) # sProduct :: forall a (t1 :: Maybe a). SNum a => Sing t1 -> Sing (Apply ProductSym0 t1) # | |
| PTraversable Maybe | |
| STraversable Maybe | |
Defined in Data.Traversable.Singletons 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 (t1 :: Maybe (f a)). SApplicative f => Sing t1 -> Sing (Apply SequenceASym0 t1) # 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 (t1 :: Maybe (m a)). SMonad m => Sing t1 -> Sing (Apply SequenceSym0 t1) # | |
| MonadError () Maybe | Since: mtl-2.2.2 |
Defined in Control.Monad.Error.Class | |
| LorentzFunctor Maybe a b | |
Defined in Lorentz.Instr | |
| () :=> (Alternative Maybe) | |
Defined in Data.Constraint Methods ins :: () :- Alternative Maybe # | |
| () :=> (Applicative Maybe) | |
Defined in Data.Constraint Methods ins :: () :- Applicative Maybe # | |
| () :=> (Functor Maybe) | |
| () :=> (MonadPlus Maybe) | |
| Lift a => Lift (Maybe a :: Type) | |
| Structured a => Structured (Maybe a) | |
Defined in Distribution.Utils.Structured | |
| Semigroup a => Monoid (Maybe a) | Lift a semigroup into Since 4.11.0: constraint on inner Since: base-2.1 |
| Semigroup a => Semigroup (Maybe a) | Since: base-4.9.0.0 |
| Generic (Maybe a) | |
| SingKind a => SingKind (Maybe a) | Since: base-4.9.0.0 |
Defined in GHC.Generics Associated Types type DemoteRep (Maybe a) | |
| Read a => Read (Maybe a) | Since: base-2.1 |
| Show a => Show (Maybe a) | Since: base-2.1 |
| Default (Maybe a) | |
Defined in Data.Default.Class | |
| NFData a => NFData (Maybe a) | |
Defined in Control.DeepSeq | |
| Buildable a => Buildable (Maybe a) | |
Defined in Formatting.Buildable | |
| Eq a => Eq (Maybe a) | Since: base-2.1 |
| Ord a => Ord (Maybe a) | Since: base-2.1 |
| Hashable a => Hashable (Maybe a) | |
Defined in Data.Hashable.Class | |
| At (Maybe a) | |
| Ixed (Maybe a) | |
Defined in Control.Lens.At | |
| HasAnnotation a => HasAnnotation (Maybe a) | |
Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (Maybe a)) # | |
| MapOpHs (Maybe e) | |
Defined in Lorentz.Polymorphic | |
| HasRPCRepr a => HasRPCRepr (Maybe a) | |
Defined in Morley.AsRPC | |
| PolyTypeHasDocC '[a] => TypeHasDoc (Maybe a) | |
Defined in Morley.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) # | |
| IsoValue a => IsoValue (Maybe a) | |
| Semiring a => Semiring (Maybe a) | |
| PEq (Maybe a) | |
| SEq a => SEq (Maybe a) | |
| PMonoid (Maybe a) | |
| SSemigroup a => SMonoid (Maybe a) | |
| POrd (Maybe a) | |
| SOrd a => SOrd (Maybe a) | |
Defined in Data.Ord.Singletons 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) # | |
| PSemigroup (Maybe a) | |
Defined in Data.Semigroup.Singletons.Internal | |
| SSemigroup a => SSemigroup (Maybe a) | |
| PShow (Maybe a) | |
| SShow a => SShow (Maybe a) | |
Defined in Text.Show.Singletons 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) # | |
| (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 # 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 # 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)) # safeHead :: Maybe a -> Maybe (Element (Maybe a)) # safeMaximum :: Maybe a -> Maybe (Element (Maybe a)) # safeMinimum :: Maybe a -> Maybe (Element (Maybe a)) # safeFoldr1 :: (Element (Maybe a) -> Element (Maybe a) -> Element (Maybe a)) -> Maybe a -> Maybe (Element (Maybe a)) # safeFoldl1 :: (Element (Maybe a) -> Element (Maybe a) -> Element (Maybe a)) -> Maybe a -> Maybe (Element (Maybe a)) # | |
| Generic1 Maybe | |
| PMonadFail Maybe | |
Defined in Control.Monad.Fail.Singletons | |
| PAlternative Maybe | |
Defined in Control.Monad.Singletons.Internal | |
| PMonadPlus Maybe | |
Defined in Control.Monad.Singletons.Internal | |
| IsoHKD Maybe (a :: Type) | |
| SDecide a => TestCoercion (SMaybe :: Maybe a -> Type) | |
Defined in Data.Singletons.Base.Instances | |
| SDecide a => TestEquality (SMaybe :: Maybe a -> Type) | |
Defined in Data.Singletons.Base.Instances | |
| SingI ('Nothing :: Maybe a) | Since: base-4.9.0.0 |
Defined in GHC.Generics | |
| (Monoid a) :=> (Monoid (Maybe a)) | |
| (Semigroup a) :=> (Semigroup (Maybe a)) | |
| (Read a) :=> (Read (Maybe a)) | |
| (Show a) :=> (Show (Maybe a)) | |
| (Eq a) :=> (Eq (Maybe a)) | |
| (Ord a) :=> (Ord (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 (GetFirstSym0 :: TyFun (First a) (Maybe a) -> Type) | |
Defined in Data.Monoid.Singletons Methods sing :: Sing GetFirstSym0 # | |
| SingI (GetLastSym0 :: TyFun (Last a) (Maybe a) -> Type) | |
Defined in Data.Monoid.Singletons Methods sing :: Sing GetLastSym0 # | |
| SingI (FindIndexSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe Nat) -> Type) | |
Defined in Data.List.Singletons.Internal Methods sing :: Sing FindIndexSym0 # | |
| SingI (FindSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe a) -> Type) | |
Defined in Data.List.Singletons.Internal | |
| SingI (GetMaxInternalSym0 :: TyFun (MaxInternal a) (Maybe a) -> Type) | |
Defined in Data.Foldable.Singletons | |
| SingI (GetMinInternalSym0 :: TyFun (MinInternal a) (Maybe a) -> Type) | |
Defined in Data.Foldable.Singletons | |
| SingI (FirstSym0 :: TyFun (Maybe a) (First a) -> Type) | |
Defined in Data.Monoid.Singletons | |
| SingI (LastSym0 :: TyFun (Maybe a) (Last a) -> Type) | |
Defined in Data.Monoid.Singletons | |
| SingI (MaxInternalSym0 :: TyFun (Maybe a) (MaxInternal a) -> Type) | |
Defined in Data.Foldable.Singletons | |
| SingI (MinInternalSym0 :: TyFun (Maybe a) (MinInternal a) -> Type) | |
Defined in Data.Foldable.Singletons | |
| SingI (IsJustSym0 :: TyFun (Maybe a) Bool -> Type) | |
Defined in Data.Maybe.Singletons Methods sing :: Sing IsJustSym0 # | |
| SingI (IsNothingSym0 :: TyFun (Maybe a) Bool -> Type) | |
Defined in Data.Maybe.Singletons Methods sing :: Sing IsNothingSym0 # | |
| SingI (MaybeToListSym0 :: TyFun (Maybe a) [a] -> Type) | |
Defined in Data.Maybe.Singletons Methods sing :: Sing MaybeToListSym0 # | |
| SingI (FromJustSym0 :: TyFun (Maybe a) a -> Type) | |
Defined in Data.Maybe.Singletons Methods sing :: Sing FromJustSym0 # | |
| SingI (CatMaybesSym0 :: TyFun [Maybe a] [a] -> Type) | |
Defined in Data.Maybe.Singletons Methods sing :: Sing CatMaybesSym0 # | |
| SingI (ListToMaybeSym0 :: TyFun [a] (Maybe a) -> Type) | |
Defined in Data.Maybe.Singletons Methods sing :: Sing ListToMaybeSym0 # | |
| SingI (FromMaybeSym0 :: TyFun a (Maybe a ~> a) -> Type) | |
Defined in Data.Maybe.Singletons Methods sing :: Sing FromMaybeSym0 # | |
| SEq a => SingI (ElemIndexSym0 :: TyFun a ([a] ~> Maybe Nat) -> Type) | |
Defined in Data.List.Singletons.Internal Methods sing :: Sing ElemIndexSym0 # | |
| SingI (JustSym0 :: TyFun a (Maybe a) -> Type) | |
Defined in Data.Singletons.Base.Instances | |
| SuppressUnusedWarnings (GetFirstSym0 :: TyFun (First a) (Maybe a) -> Type) | |
Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (GetLastSym0 :: TyFun (Last a) (Maybe a) -> Type) | |
Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FindIndexSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe Nat) -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FindSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe a) -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (GetMaxInternalSym0 :: TyFun (MaxInternal a) (Maybe a) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (GetMinInternalSym0 :: TyFun (MinInternal a) (Maybe a) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FirstSym0 :: TyFun (Maybe a) (First a) -> Type) | |
Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (LastSym0 :: TyFun (Maybe a) (Last a) -> Type) | |
Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679180719Sym0 :: TyFun (Maybe a) (Maybe a ~> Ordering) -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679357720Sym0 :: TyFun (Maybe a) (Maybe a ~> Maybe a) -> Type) | |
Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679584139Sym0 :: TyFun (Maybe a) (Maybe a ~> Maybe a) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679130516Sym0 :: TyFun (Maybe a) (Maybe a ~> Bool) -> Type) | |
Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (MaxInternalSym0 :: TyFun (Maybe a) (MaxInternal a) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (MinInternalSym0 :: TyFun (Maybe a) (MinInternal a) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (IsJustSym0 :: TyFun (Maybe a) Bool -> Type) | |
Defined in Data.Maybe.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (IsNothingSym0 :: TyFun (Maybe a) Bool -> Type) | |
Defined in Data.Maybe.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (MaybeToListSym0 :: TyFun (Maybe a) [a] -> Type) | |
Defined in Data.Maybe.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FromJustSym0 :: TyFun (Maybe a) a -> Type) | |
Defined in Data.Maybe.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621680071724Sym0 :: TyFun Nat (Maybe a ~> (Symbol ~> Symbol)) -> Type) | |
Defined in Text.Show.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (CatMaybesSym0 :: TyFun [Maybe a] [a] -> Type) | |
Defined in Data.Maybe.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Fail_6989586621679456264Sym0 :: TyFun [Char] (Maybe a) -> Type) | |
Defined in Control.Monad.Fail.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (StripPrefixSym0 :: TyFun [a] ([a] ~> Maybe [a]) -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ListToMaybeSym0 :: TyFun [a] (Maybe a) -> Type) | |
Defined in Data.Maybe.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FromMaybeSym0 :: TyFun a (Maybe a ~> a) -> Type) | |
Defined in Data.Maybe.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ElemIndexSym0 :: TyFun a ([a] ~> Maybe Nat) -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Pure_6989586621679357459Sym0 :: TyFun a (Maybe a) -> Type) | |
Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (JustSym0 :: TyFun a (Maybe a) -> Type) | |
Defined in Data.Singletons.Base.Instances Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679357729LSym0 :: TyFun k1 (Maybe k1) -> Type) | |
Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SingI (MapMaybeSym0 :: TyFun (a ~> Maybe b) ([a] ~> [b]) -> Type) | |
Defined in Data.Maybe.Singletons Methods sing :: Sing MapMaybeSym0 # | |
| SFoldable t => SingI (FindSym0 :: TyFun (a ~> Bool) (t a ~> Maybe a) -> Type) | |
Defined in Data.Foldable.Singletons | |
| SingI (UnfoldrSym0 :: TyFun (b ~> Maybe (a, b)) (b ~> [a]) -> Type) | |
Defined in Data.List.Singletons.Internal Methods sing :: Sing UnfoldrSym0 # | |
| SingI d => SingI (FromMaybeSym1 d :: TyFun (Maybe a) a -> Type) | |
Defined in Data.Maybe.Singletons Methods sing :: Sing (FromMaybeSym1 d) # | |
| (SEq a, SingI d) => SingI (ElemIndexSym1 d :: TyFun [a] (Maybe Nat) -> Type) | |
Defined in Data.List.Singletons.Internal Methods sing :: Sing (ElemIndexSym1 d) # | |
| SingI d => SingI (FindIndexSym1 d :: TyFun [a] (Maybe Nat) -> Type) | |
Defined in Data.List.Singletons.Internal Methods sing :: Sing (FindIndexSym1 d) # | |
| SingI d => SingI (FindSym1 d :: TyFun [a] (Maybe a) -> Type) | |
Defined in Data.List.Singletons.Internal | |
| SEq a => SingI (LookupSym0 :: TyFun a ([(a, b)] ~> Maybe b) -> Type) | |
Defined in Data.List.Singletons.Internal Methods sing :: Sing LookupSym0 # | |
| SingI (Maybe_Sym0 :: TyFun b ((a ~> b) ~> (Maybe a ~> b)) -> Type) | |
Defined in Data.Maybe.Singletons Methods sing :: Sing Maybe_Sym0 # | |
| SAlternative f => SingI (OptionalSym0 :: TyFun (f a) (f (Maybe a)) -> Type) | |
Defined in Control.Applicative.Singletons Methods sing :: Sing OptionalSym0 # | |
| SuppressUnusedWarnings (Foldr_6989586621680193829Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (Maybe a ~> b)) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (MapMaybeSym0 :: TyFun (a ~> Maybe b) ([a] ~> [b]) -> Type) | |
Defined in Data.Maybe.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FindSym0 :: TyFun (a ~> Bool) (t a ~> Maybe a) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Fmap_6989586621679357336Sym0 :: TyFun (a ~> b) (Maybe a ~> Maybe b) -> Type) | |
Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FoldMap_6989586621680193813Sym0 :: TyFun (a ~> m) (Maybe a ~> m) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldl_6989586621680193845Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (Maybe a ~> b)) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (UnfoldrSym0 :: TyFun (b ~> Maybe (a, b)) (b ~> [a]) -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679357469Sym0 :: TyFun (Maybe (a ~> b)) (Maybe a ~> Maybe b) -> Type) | |
Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679180719Sym1 a6989586621679180724 :: TyFun (Maybe a) Ordering -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679357633Sym0 :: TyFun (Maybe a) ((a ~> Maybe b) ~> Maybe b) -> Type) | |
Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679357496Sym0 :: TyFun (Maybe a) (Maybe b ~> Maybe b) -> Type) | |
Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679357644Sym0 :: TyFun (Maybe a) (Maybe b ~> Maybe b) -> Type) | |
Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621680071724Sym1 a6989586621680071734 :: TyFun (Maybe a) (Symbol ~> Symbol) -> Type) | |
Defined in Text.Show.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679357720Sym1 a6989586621679357725 :: TyFun (Maybe a) (Maybe a) -> Type) | |
Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679584139Sym1 a6989586621679584144 :: TyFun (Maybe a) (Maybe a) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679130516Sym1 a6989586621679130521 :: TyFun (Maybe a) Bool -> Type) | |
Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FromMaybeSym1 a6989586621679486193 :: TyFun (Maybe a) a -> Type) | |
Defined in Data.Maybe.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ElemIndexSym1 a6989586621679731471 :: TyFun [a] (Maybe Nat) -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FindIndexSym1 a6989586621679731453 :: TyFun [a] (Maybe Nat) -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (StripPrefixSym1 a6989586621679880880 :: TyFun [a] (Maybe [a]) -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FindSym1 a6989586621679731480 :: TyFun [a] (Maybe a) -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679357348Sym0 :: TyFun a (Maybe b ~> Maybe a) -> Type) | |
Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (LookupSym0 :: TyFun a ([(a, b)] ~> Maybe b) -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Maybe_Sym0 :: TyFun b ((a ~> b) ~> (Maybe a ~> b)) -> Type) | |
Defined in Data.Maybe.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (OptionalSym0 :: TyFun (f a) (f (Maybe a)) -> Type) | |
Defined in Control.Applicative.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680193772MkJustSym0 :: TyFun k (TyFun a6989586621680192944 (Maybe a6989586621680192944) -> Type) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680193787MkJustSym0 :: TyFun k (TyFun a6989586621680192945 (Maybe a6989586621680192945) -> Type) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680184048NSym0 :: TyFun k (TyFun k1 (Maybe k1) -> Type) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680184072NSym0 :: TyFun k (TyFun k1 (Maybe k1) -> Type) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680184048MSym0 :: TyFun k1 (TyFun k (Maybe k1) -> Type) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680184072MSym0 :: TyFun k1 (TyFun k (Maybe k1) -> Type) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SingI d => SingI (Maybe_Sym1 d :: TyFun (a ~> b) (Maybe a ~> b) -> Type) | |
Defined in Data.Maybe.Singletons Methods sing :: Sing (Maybe_Sym1 d) # | |
| (SEq a, SingI d) => SingI (LookupSym1 d :: TyFun [(a, b)] (Maybe b) -> Type) | |
Defined in Data.List.Singletons.Internal Methods sing :: Sing (LookupSym1 d) # | |
| (SFoldable t, SingI d) => SingI (FindSym1 d :: TyFun (t a) (Maybe a) -> Type) | |
Defined in Data.Foldable.Singletons | |
| SuppressUnusedWarnings (LiftA2_6989586621679357482Sym0 :: TyFun (a ~> (b ~> c)) (Maybe a ~> (Maybe b ~> Maybe c)) -> Type) | |
Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679357633Sym1 a6989586621679357638 :: TyFun (a ~> Maybe b) (Maybe b) -> Type) | |
Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679486168RsSym0 :: TyFun (a ~> Maybe k1) (TyFun k (TyFun [a] [k1] -> Type) -> Type) -> Type) | |
Defined in Data.Maybe.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Maybe_Sym1 a6989586621679484326 :: TyFun (a ~> b) (Maybe a ~> b) -> Type) | |
Defined in Data.Maybe.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Traverse_6989586621680478666Sym0 :: TyFun (a ~> f b) (Maybe a ~> f (Maybe b)) -> Type) | |
Defined in Data.Traversable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680193673MfSym0 :: TyFun (k2 ~> (k3 ~> k2)) (TyFun k (TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680193694MfSym0 :: TyFun (k2 ~> (k3 ~> k3)) (TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Fmap_6989586621679357336Sym1 a6989586621679357341 :: TyFun (Maybe a) (Maybe b) -> Type) | |
Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679357469Sym1 a6989586621679357474 :: TyFun (Maybe a) (Maybe b) -> Type) | |
Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FoldMap_6989586621680193813Sym1 a6989586621680193822 :: TyFun (Maybe a) m -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679357348Sym1 a6989586621679357353 :: TyFun (Maybe b) (Maybe a) -> Type) | |
Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679357496Sym1 a6989586621679357501 :: TyFun (Maybe b) (Maybe b) -> Type) | |
Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679357644Sym1 a6989586621679357653 :: TyFun (Maybe b) (Maybe b) -> Type) | |
Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (LookupSym1 a6989586621679731178 :: TyFun [(a, b)] (Maybe b) -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680193772MkJustSym1 a_69895866216801937666989586621680193771 :: TyFun a6989586621680192944 (Maybe a6989586621680192944) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680193787MkJustSym1 a_69895866216801937816989586621680193786 :: TyFun a6989586621680192945 (Maybe a6989586621680192945) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldl_6989586621680193845Sym1 a6989586621680193851 :: TyFun b (Maybe a ~> b) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr_6989586621680193829Sym1 a6989586621680193835 :: TyFun b (Maybe a ~> b) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680184048MSym1 x6989586621680184046 :: TyFun k (Maybe k1) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680184072MSym1 x6989586621680184070 :: TyFun k (Maybe k1) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680118497Sym0 :: TyFun k (TyFun (k1 ~> First a) (TyFun k1 (Maybe a) -> Type) -> Type) -> Type) | |
Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680118708Sym0 :: TyFun k (TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type) -> Type) | |
Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680184048NSym1 x6989586621680184046 :: TyFun k1 (Maybe k1) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680184072NSym1 x6989586621680184070 :: TyFun k1 (Maybe k1) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FindSym1 a6989586621680193279 :: TyFun (t a) (Maybe a) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| (SingI d1, SingI d2) => SingI (Maybe_Sym2 d1 d2 :: TyFun (Maybe a) b -> Type) | |
Defined in Data.Maybe.Singletons Methods sing :: Sing (Maybe_Sym2 d1 d2) # | |
| SuppressUnusedWarnings (Lambda_6989586621680118497Sym1 a6989586621680118495 :: TyFun (k1 ~> First a) (TyFun k1 (Maybe a) -> Type) -> Type) | |
Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680118708Sym1 a6989586621680118706 :: TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type) | |
Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (LiftA2_6989586621679357482Sym1 a6989586621679357488 :: TyFun (Maybe a) (Maybe b ~> Maybe c) -> Type) | |
Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldl_6989586621680193845Sym2 a6989586621680193851 a6989586621680193852 :: TyFun (Maybe a) b -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr_6989586621680193829Sym2 a6989586621680193835 a6989586621680193836 :: TyFun (Maybe a) b -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Maybe_Sym2 a6989586621679484326 a6989586621679484327 :: TyFun (Maybe a) b -> Type) | |
Defined in Data.Maybe.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Traverse_6989586621680478666Sym1 a6989586621680478671 :: TyFun (Maybe a) (f (Maybe b)) -> Type) | |
Defined in Data.Traversable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680193694MfSym1 f6989586621680193692 :: TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680193673MfSym1 f6989586621680193671 :: TyFun k (TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (LiftA2_6989586621679357482Sym2 a6989586621679357488 a6989586621679357489 :: TyFun (Maybe b) (Maybe c) -> Type) | |
Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680193694MfSym2 f6989586621680193692 xs6989586621680193693 :: TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680118497Sym2 a6989586621680118495 k6989586621680118496 :: TyFun k1 (Maybe a) -> Type) | |
Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680118708Sym2 a6989586621680118706 k6989586621680118707 :: TyFun k1 (Maybe a) -> Type) | |
Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680193673MfSym2 f6989586621680193671 xs6989586621680193672 :: TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680193673MfSym3 f6989586621680193671 xs6989586621680193672 a6989586621680193674 :: TyFun (Maybe k3) (Maybe k2) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680193694MfSym3 f6989586621680193692 xs6989586621680193693 a6989586621680193695 :: TyFun k3 (Maybe k3) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| (HasAnnotation (Maybe a), KnownSymbol name) => HasAnnotation (NamedF Maybe a name) | |
Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (NamedF Maybe a name)) # | |
| Unwrappable (NamedF Maybe a name) | |
Defined in Lorentz.Wrappable Associated Types type Unwrappabled (NamedF Maybe a name) # | |
| Wrappable (NamedF Maybe a name) | |
Defined in Lorentz.Wrappable | |
| HasRPCRepr a => HasRPCRepr (NamedF Maybe a name) | |
Defined in Morley.AsRPC | |
| IsoValue a => IsoValue (NamedF Maybe a name) | |
| type Failure Maybe | |
Defined in Basement.Monad | |
| type Pure (a :: k1) | |
| type Return (arg :: a) | |
| type Fold (arg :: Maybe m) | |
| type Length (arg :: Maybe a) | |
| type Maximum (arg :: Maybe a) | |
| type Minimum (arg :: Maybe a) | |
| type Null (arg :: Maybe a) | |
| type Product (arg :: Maybe a) | |
| type Sum (arg :: Maybe a) | |
| type ToList (arg :: Maybe a) | |
| type Elem (arg1 :: a) (arg2 :: Maybe a) | |
| type Foldl1 (arg1 :: a ~> (a ~> a)) (arg2 :: Maybe a) | |
| type Foldr1 (arg1 :: a ~> (a ~> a)) (arg2 :: Maybe a) | |
| type Sequence (arg :: Maybe (m a)) | |
| type SequenceA (arg :: Maybe (f a)) | |
| type (a2 :: Maybe a1) *> (a3 :: Maybe b) | |
| type (a1 :: k1) <$ (a2 :: Maybe b) | |
| type (arg1 :: Maybe a) <* (arg2 :: Maybe b) | |
| type (a2 :: Maybe (a1 ~> b)) <*> (a3 :: Maybe a1) | |
| type (a2 :: Maybe a1) >> (a3 :: Maybe b) | |
| type (a2 :: Maybe a1) >>= (a3 :: a1 ~> Maybe b) | |
| type Fmap (a2 :: a1 ~> b) (a3 :: Maybe a1) | |
| type FoldMap (a2 :: a1 ~> k2) (a3 :: Maybe a1) | |
| type Foldl (a2 :: k2 ~> (a1 ~> k2)) (a3 :: k2) (a4 :: Maybe a1) | |
| type Foldl' (arg1 :: b ~> (a ~> b)) (arg2 :: b) (arg3 :: Maybe a) | |
| type Foldr (a2 :: a1 ~> (k2 ~> k2)) (a3 :: k2) (a4 :: Maybe a1) | |
| type Foldr' (arg1 :: a ~> (b ~> b)) (arg2 :: b) (arg3 :: Maybe a) | |
| type MapM (arg1 :: a ~> m b) (arg2 :: Maybe a) | |
| type Traverse (a2 :: a1 ~> f b) (a3 :: Maybe a1) | |
| type LiftA2 (a2 :: a1 ~> (b ~> c)) (a3 :: Maybe a1) (a4 :: Maybe b) | |
| type Apply (Pure_6989586621679357459Sym0 :: TyFun a (Maybe a) -> Type) (a6989586621679357465 :: a) | |
Defined in Control.Monad.Singletons.Internal | |
| type Apply (JustSym0 :: TyFun a (Maybe a) -> Type) (a6989586621679028273 :: a) | |
| type Apply (Let6989586621679357729LSym0 :: TyFun k1 (Maybe k1) -> Type) (wild_69895866216793565086989586621679357728 :: k1) | |
Defined in Control.Monad.Singletons.Internal | |
| type Apply (Let6989586621680193772MkJustSym1 a_69895866216801937666989586621680193771 :: TyFun a (Maybe a) -> Type) (a6989586621680193775 :: a) | |
Defined in Data.Foldable.Singletons | |
| type Apply (Let6989586621680193787MkJustSym1 a_69895866216801937816989586621680193786 :: TyFun a (Maybe a) -> Type) (a6989586621680193790 :: a) | |
Defined in Data.Foldable.Singletons | |
| type Apply (Let6989586621680184048MSym1 x6989586621680184046 :: TyFun k (Maybe k1) -> Type) (y6989586621680184047 :: k) | |
Defined in Data.Foldable.Singletons | |
| type Apply (Let6989586621680184072MSym1 x6989586621680184070 :: TyFun k (Maybe k1) -> Type) (y6989586621680184071 :: k) | |
Defined in Data.Foldable.Singletons | |
| type Apply (Let6989586621680184048NSym1 x6989586621680184046 :: TyFun k1 (Maybe k1) -> Type) (y6989586621680184047 :: k1) | |
Defined in Data.Foldable.Singletons | |
| type Apply (Let6989586621680184072NSym1 x6989586621680184070 :: TyFun k1 (Maybe k1) -> Type) (y6989586621680184071 :: k1) | |
Defined in Data.Foldable.Singletons | |
| type Apply (Lambda_6989586621680118497Sym2 a6989586621680118495 k6989586621680118496 :: TyFun k1 (Maybe a) -> Type) (x6989586621680118499 :: k1) | |
Defined in Data.Monoid.Singletons | |
| type Apply (Lambda_6989586621680118708Sym2 a6989586621680118706 k6989586621680118707 :: TyFun k1 (Maybe a) -> Type) (x6989586621680118710 :: k1) | |
Defined in Data.Monoid.Singletons | |
| type Apply (Let6989586621680193694MfSym3 f6989586621680193692 xs6989586621680193693 a6989586621680193695 :: TyFun k3 (Maybe k3) -> Type) (a6989586621680193696 :: k3) | |
Defined in Data.Foldable.Singletons | |
| type Apply (ShowsPrec_6989586621680071724Sym0 :: TyFun Nat (Maybe a ~> (Symbol ~> Symbol)) -> Type) (a6989586621680071734 :: Nat) | |
| type Apply (FromMaybeSym0 :: TyFun a (Maybe a ~> a) -> Type) (a6989586621679486193 :: a) | |
Defined in Data.Maybe.Singletons type Apply (FromMaybeSym0 :: TyFun a (Maybe a ~> a) -> Type) (a6989586621679486193 :: a) = FromMaybeSym1 a6989586621679486193 | |
| type Apply (ElemIndexSym0 :: TyFun a ([a] ~> Maybe Nat) -> Type) (a6989586621679731471 :: a) | |
Defined in Data.List.Singletons.Internal type Apply (ElemIndexSym0 :: TyFun a ([a] ~> Maybe Nat) -> Type) (a6989586621679731471 :: a) = ElemIndexSym1 a6989586621679731471 | |
| type Apply (TFHelper_6989586621679357348Sym0 :: TyFun a (Maybe b ~> Maybe a) -> Type) (a6989586621679357353 :: a) | |
| type Apply (LookupSym0 :: TyFun a ([(a, b)] ~> Maybe b) -> Type) (a6989586621679731178 :: a) | |
Defined in Data.List.Singletons.Internal type Apply (LookupSym0 :: TyFun a ([(a, b)] ~> Maybe b) -> Type) (a6989586621679731178 :: a) = LookupSym1 a6989586621679731178 :: TyFun [(a, b)] (Maybe b) -> Type | |
| type Apply (Maybe_Sym0 :: TyFun b ((a ~> b) ~> (Maybe a ~> b)) -> Type) (a6989586621679484326 :: b) | |
Defined in Data.Maybe.Singletons | |
| type Apply (Let6989586621680193772MkJustSym0 :: TyFun k (TyFun a6989586621680192944 (Maybe a6989586621680192944) -> Type) -> Type) (a_69895866216801937666989586621680193771 :: k) | |
Defined in Data.Foldable.Singletons type Apply (Let6989586621680193772MkJustSym0 :: TyFun k (TyFun a6989586621680192944 (Maybe a6989586621680192944) -> Type) -> Type) (a_69895866216801937666989586621680193771 :: k) = Let6989586621680193772MkJustSym1 a_69895866216801937666989586621680193771 :: TyFun a6989586621680192944 (Maybe a6989586621680192944) -> Type | |
| type Apply (Let6989586621680193787MkJustSym0 :: TyFun k (TyFun a6989586621680192945 (Maybe a6989586621680192945) -> Type) -> Type) (a_69895866216801937816989586621680193786 :: k) | |
Defined in Data.Foldable.Singletons type Apply (Let6989586621680193787MkJustSym0 :: TyFun k (TyFun a6989586621680192945 (Maybe a6989586621680192945) -> Type) -> Type) (a_69895866216801937816989586621680193786 :: k) = Let6989586621680193787MkJustSym1 a_69895866216801937816989586621680193786 :: TyFun a6989586621680192945 (Maybe a6989586621680192945) -> Type | |
| type Apply (Let6989586621680184048NSym0 :: TyFun k (TyFun k1 (Maybe k1) -> Type) -> Type) (x6989586621680184046 :: k) | |
| type Apply (Let6989586621680184072NSym0 :: TyFun k (TyFun k1 (Maybe k1) -> Type) -> Type) (x6989586621680184070 :: k) | |
| type Apply (Let6989586621680184048MSym0 :: TyFun k1 (TyFun k (Maybe k1) -> Type) -> Type) (x6989586621680184046 :: k1) | |
| type Apply (Let6989586621680184072MSym0 :: TyFun k1 (TyFun k (Maybe k1) -> Type) -> Type) (x6989586621680184070 :: k1) | |
| type Apply (Foldl_6989586621680193845Sym1 a6989586621680193851 :: TyFun b (Maybe a ~> b) -> Type) (a6989586621680193852 :: b) | |
| type Apply (Foldr_6989586621680193829Sym1 a6989586621680193835 :: TyFun b (Maybe a ~> b) -> Type) (a6989586621680193836 :: b) | |
| type Apply (Lambda_6989586621680118497Sym0 :: TyFun k (TyFun (k1 ~> First a) (TyFun k1 (Maybe a) -> Type) -> Type) -> Type) (a6989586621680118495 :: k) | |
Defined in Data.Monoid.Singletons | |
| type Apply (Lambda_6989586621680118708Sym0 :: TyFun k (TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type) -> Type) (a6989586621680118706 :: k) | |
| type Apply (Let6989586621680193694MfSym1 f6989586621680193692 :: TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type) (xs6989586621680193693 :: k) | |
| type Apply (Let6989586621680193673MfSym1 f6989586621680193671 :: TyFun k (TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type) -> Type) (xs6989586621680193672 :: k) | |
| type Apply (Let6989586621680193673MfSym2 f6989586621680193671 xs6989586621680193672 :: TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type) (a6989586621680193674 :: k2) | |
Defined in Data.Foldable.Singletons | |
| type Eval (FoldMap f ('Just x) :: a2 -> Type) | |
| type Eval (FoldMap f ('Nothing :: Maybe a1) :: a2 -> Type) | |
| type Eval (Foldr f y ('Just x) :: a2 -> Type) | |
| type Eval (Foldr f y ('Nothing :: Maybe a1) :: a2 -> Type) | |
| type DemoteRep (Maybe a) | |
Defined in GHC.Generics | |
| type Rep (Maybe a) | Since: base-4.6.0.0 |
Defined in GHC.Generics | |
| data Sing (b :: Maybe a) | |
| type MEmpty | |
Defined in Fcf.Class.Monoid | |
| type Index (Maybe a) | |
Defined in Control.Lens.At | |
| type IxValue (Maybe a) | |
Defined in Control.Lens.At | |
| type MapOpInpHs (Maybe e) | |
Defined in Lorentz.Polymorphic | |
| type MapOpResHs (Maybe e) | |
Defined in Lorentz.Polymorphic | |
| type AsRPC (Maybe a) | |
Defined in Morley.AsRPC | |
| type TypeDocFieldDescriptions (Maybe a) | |
Defined in Morley.Michelson.Typed.Haskell.Doc | |
| type ToT (Maybe a) | |
Defined in Morley.Michelson.Typed.Haskell.Value | |
| type Demote (Maybe a) | |
Defined in Data.Singletons.Base.Instances | |
| type Sing | |
Defined in Data.Singletons.Base.Instances | |
| type Mempty | |
Defined in Data.Monoid.Singletons | |
| type Element (Maybe a) | |
Defined in Universum.Container.Class | |
| type Rep1 Maybe | Since: base-4.6.0.0 |
| type Mconcat (arg :: [Maybe a]) | |
| type Sconcat (arg :: NonEmpty (Maybe a)) | |
| type Show_ (arg :: Maybe a) | |
| type Empty | |
Defined in Control.Monad.Singletons.Internal | |
| type Mzero | |
Defined in Control.Monad.Singletons.Internal | |
| type (arg1 :: Maybe a) /= (arg2 :: Maybe a) | |
| type (a2 :: Maybe a1) == (a3 :: Maybe a1) | |
| type Mappend (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 Max (arg1 :: Maybe a) (arg2 :: Maybe a) | |
| type Min (arg1 :: Maybe a) (arg2 :: Maybe a) | |
| type (a2 :: Maybe a1) <> (a3 :: Maybe a1) | |
| type ShowList (arg1 :: [Maybe a]) arg2 | |
| type HKD Maybe (a :: Type) | |
Defined in Data.Vinyl.XRec | |
| type Fail a2 | |
| type ShowsPrec a2 (a3 :: Maybe a1) a4 | |
| type (a2 :: Maybe a1) <|> (a3 :: Maybe a1) | |
| type Mplus (arg1 :: Maybe a) (arg2 :: Maybe a) | |
| type (a2 :: Maybe a1) <> ('Nothing :: Maybe a1) | |
Defined in Fcf.Class.Monoid | |
| type Apply (IsJustSym0 :: TyFun (Maybe a) Bool -> Type) (a6989586621679486210 :: Maybe a) | |
Defined in Data.Maybe.Singletons | |
| type Apply (IsNothingSym0 :: TyFun (Maybe a) Bool -> Type) (a6989586621679486207 :: Maybe a) | |
Defined in Data.Maybe.Singletons | |
| type Apply (FromJustSym0 :: TyFun (Maybe a) a -> Type) (a6989586621679486203 :: Maybe a) | |
Defined in Data.Maybe.Singletons | |
| type Apply (Compare_6989586621679180719Sym1 a6989586621679180724 :: TyFun (Maybe a) Ordering -> Type) (a6989586621679180725 :: Maybe a) | |
| type Apply (TFHelper_6989586621679130516Sym1 a6989586621679130521 :: TyFun (Maybe a) Bool -> Type) (a6989586621679130522 :: Maybe a) | |
| type Apply (FromMaybeSym1 a6989586621679486193 :: TyFun (Maybe a) a -> Type) (a6989586621679486194 :: Maybe a) | |
Defined in Data.Maybe.Singletons | |
| type Apply (FoldMap_6989586621680193813Sym1 a6989586621680193822 :: TyFun (Maybe a) m -> Type) (a6989586621680193823 :: Maybe a) | |
| type Apply (Foldl_6989586621680193845Sym2 a6989586621680193851 a6989586621680193852 :: TyFun (Maybe a) b -> Type) (a6989586621680193853 :: Maybe a) | |
| type Apply (Foldr_6989586621680193829Sym2 a6989586621680193835 a6989586621680193836 :: TyFun (Maybe a) b -> Type) (a6989586621680193837 :: Maybe a) | |
| type Apply (Maybe_Sym2 a6989586621679484326 a6989586621679484327 :: TyFun (Maybe a) b -> Type) (a6989586621679484328 :: Maybe a) | |
Defined in Data.Maybe.Singletons | |
| type ('Nothing :: Maybe a) <> (b :: Maybe a) | |
Defined in Fcf.Class.Monoid | |
| type Apply (GetFirstSym0 :: TyFun (First a) (Maybe a) -> Type) (a6989586621680107980 :: First a) | |
Defined in Data.Monoid.Singletons | |
| type Apply (GetLastSym0 :: TyFun (Last a) (Maybe a) -> Type) (a6989586621680108004 :: Last a) | |
Defined in Data.Monoid.Singletons | |
| type Apply (GetMaxInternalSym0 :: TyFun (MaxInternal a) (Maybe a) -> Type) (a6989586621680182210 :: MaxInternal a) | |
Defined in Data.Foldable.Singletons | |
| type Apply (GetMinInternalSym0 :: TyFun (MinInternal a) (Maybe a) -> Type) (a6989586621680182206 :: MinInternal a) | |
Defined in Data.Foldable.Singletons | |
| type Apply (FirstSym0 :: TyFun (Maybe a) (First a) -> Type) (a6989586621680107977 :: Maybe a) | |
| type Apply (LastSym0 :: TyFun (Maybe a) (Last a) -> Type) (a6989586621680108001 :: Maybe a) | |
| type Apply (MaxInternalSym0 :: TyFun (Maybe a) (MaxInternal a) -> Type) (a6989586621680182200 :: Maybe a) | |
| type Apply (MinInternalSym0 :: TyFun (Maybe a) (MinInternal a) -> Type) (a6989586621680182203 :: Maybe a) | |
| type Apply (MaybeToListSym0 :: TyFun (Maybe a) [a] -> Type) (a6989586621679486188 :: Maybe a) | |
Defined in Data.Maybe.Singletons type Apply (MaybeToListSym0 :: TyFun (Maybe a) [a] -> Type) (a6989586621679486188 :: Maybe a) = MaybeToList a6989586621679486188 | |
| type Apply (CatMaybesSym0 :: TyFun [Maybe a] [a] -> Type) (a6989586621679486178 :: [Maybe a]) | |
Defined in Data.Maybe.Singletons | |
| type Apply (Fail_6989586621679456264Sym0 :: TyFun [Char] (Maybe a) -> Type) (a6989586621679456268 :: [Char]) | |
| type Apply (ListToMaybeSym0 :: TyFun [a] (Maybe a) -> Type) (a6989586621679486184 :: [a]) | |
Defined in Data.Maybe.Singletons type Apply (ListToMaybeSym0 :: TyFun [a] (Maybe a) -> Type) (a6989586621679486184 :: [a]) = ListToMaybe a6989586621679486184 | |
| type Apply (TFHelper_6989586621679357720Sym1 a6989586621679357725 :: TyFun (Maybe a) (Maybe a) -> Type) (a6989586621679357726 :: Maybe a) | |
| type Apply (TFHelper_6989586621679584139Sym1 a6989586621679584144 :: TyFun (Maybe a) (Maybe a) -> Type) (a6989586621679584145 :: Maybe a) | |
| type Apply (ElemIndexSym1 a6989586621679731471 :: TyFun [a] (Maybe Nat) -> Type) (a6989586621679731472 :: [a]) | |
Defined in Data.List.Singletons.Internal | |
| type Apply (FindIndexSym1 a6989586621679731453 :: TyFun [a] (Maybe Nat) -> Type) (a6989586621679731454 :: [a]) | |
Defined in Data.List.Singletons.Internal | |
| type Apply (StripPrefixSym1 a6989586621679880880 :: TyFun [a] (Maybe [a]) -> Type) (a6989586621679880881 :: [a]) | |
Defined in Data.List.Singletons.Internal type Apply (StripPrefixSym1 a6989586621679880880 :: TyFun [a] (Maybe [a]) -> Type) (a6989586621679880881 :: [a]) = StripPrefix a6989586621679880880 a6989586621679880881 | |
| type Apply (FindSym1 a6989586621679731480 :: TyFun [a] (Maybe a) -> Type) (a6989586621679731481 :: [a]) | |
Defined in Data.List.Singletons.Internal | |
| type Apply (OptionalSym0 :: TyFun (f a) (f (Maybe a)) -> Type) (a6989586621680883106 :: f a) | |
Defined in Control.Applicative.Singletons | |
| type Apply (Fmap_6989586621679357336Sym1 a6989586621679357341 :: TyFun (Maybe a) (Maybe b) -> Type) (a6989586621679357342 :: Maybe a) | |
| type Apply (TFHelper_6989586621679357469Sym1 a6989586621679357474 :: TyFun (Maybe a) (Maybe b) -> Type) (a6989586621679357475 :: Maybe a) | |
| type Apply (TFHelper_6989586621679357348Sym1 a6989586621679357353 :: TyFun (Maybe b) (Maybe a) -> Type) (a6989586621679357354 :: Maybe b) | |
| type Apply (TFHelper_6989586621679357496Sym1 a6989586621679357501 :: TyFun (Maybe b) (Maybe b) -> Type) (a6989586621679357502 :: Maybe b) | |
| type Apply (TFHelper_6989586621679357644Sym1 a6989586621679357653 :: TyFun (Maybe b) (Maybe b) -> Type) (a6989586621679357654 :: Maybe b) | |
| type Apply (LookupSym1 a6989586621679731178 :: TyFun [(a, b)] (Maybe b) -> Type) (a6989586621679731179 :: [(a, b)]) | |
Defined in Data.List.Singletons.Internal | |
| type Apply (FindSym1 a6989586621680193279 :: TyFun (t a) (Maybe a) -> Type) (a6989586621680193280 :: t a) | |
| type Apply (Traverse_6989586621680478666Sym1 a6989586621680478671 :: TyFun (Maybe a) (f (Maybe b)) -> Type) (a6989586621680478672 :: Maybe a) | |
| type Apply (LiftA2_6989586621679357482Sym2 a6989586621679357488 a6989586621679357489 :: TyFun (Maybe b) (Maybe c) -> Type) (a6989586621679357490 :: Maybe b) | |
| type Apply (Let6989586621680193673MfSym3 f6989586621680193671 xs6989586621680193672 a6989586621680193674 :: TyFun (Maybe k3) (Maybe k2) -> Type) (a6989586621680193675 :: Maybe k3) | |
Defined in Data.Foldable.Singletons | |
| type Eval (Init ('[] :: [a]) :: Maybe [a] -> Type) | |
| type Eval (Tail (_a ': as) :: Maybe [a] -> Type) | |
| type Eval (Tail ('[] :: [a]) :: Maybe [a] -> Type) | |
| type Eval (Init (a2 ': (b ': as)) :: Maybe [a1] -> Type) | |
| type Eval (Init '[a2] :: Maybe [a1] -> Type) | |
| type Eval (Head ('[] :: [a]) :: Maybe a -> Type) | |
| type Eval (Last ('[] :: [a]) :: Maybe a -> Type) | |
| type Eval (Head (a2 ': _as) :: Maybe a1 -> Type) | |
| type Eval (Last (a2 ': (b ': as)) :: Maybe a1 -> Type) | |
| type Eval (Last '[a2] :: Maybe a1 -> Type) | |
| type Apply (Compare_6989586621679180719Sym0 :: TyFun (Maybe a) (Maybe a ~> Ordering) -> Type) (a6989586621679180724 :: Maybe a) | |
| type Apply (TFHelper_6989586621679357720Sym0 :: TyFun (Maybe a) (Maybe a ~> Maybe a) -> Type) (a6989586621679357725 :: Maybe a) | |
| type Apply (TFHelper_6989586621679584139Sym0 :: TyFun (Maybe a) (Maybe a ~> Maybe a) -> Type) (a6989586621679584144 :: Maybe a) | |
| type Apply (TFHelper_6989586621679130516Sym0 :: TyFun (Maybe a) (Maybe a ~> Bool) -> Type) (a6989586621679130521 :: Maybe a) | |
| type Apply (StripPrefixSym0 :: TyFun [a] ([a] ~> Maybe [a]) -> Type) (a6989586621679880880 :: [a]) | |
Defined in Data.List.Singletons.Internal type Apply (StripPrefixSym0 :: TyFun [a] ([a] ~> Maybe [a]) -> Type) (a6989586621679880880 :: [a]) = StripPrefixSym1 a6989586621679880880 | |
| type ('Just a2 :: Maybe a1) <> ('Just b :: Maybe a1) | |
| type Apply (TFHelper_6989586621679357469Sym0 :: TyFun (Maybe (a ~> b)) (Maybe a ~> Maybe b) -> Type) (a6989586621679357474 :: Maybe (a ~> b)) | |
| type Apply (TFHelper_6989586621679357633Sym0 :: TyFun (Maybe a) ((a ~> Maybe b) ~> Maybe b) -> Type) (a6989586621679357638 :: Maybe a) | |
| type Apply (TFHelper_6989586621679357496Sym0 :: TyFun (Maybe a) (Maybe b ~> Maybe b) -> Type) (a6989586621679357501 :: Maybe a) | |
| type Apply (TFHelper_6989586621679357644Sym0 :: TyFun (Maybe a) (Maybe b ~> Maybe b) -> Type) (a6989586621679357653 :: Maybe a) | |
| type Apply (ShowsPrec_6989586621680071724Sym1 a6989586621680071734 :: TyFun (Maybe a) (Symbol ~> Symbol) -> Type) (a6989586621680071735 :: Maybe a) | |
| type Apply (LiftA2_6989586621679357482Sym1 a6989586621679357488 :: TyFun (Maybe a) (Maybe b ~> Maybe c) -> Type) (a6989586621679357489 :: Maybe a) | |
| type Apply (Let6989586621680193694MfSym2 f6989586621680193692 xs6989586621680193693 :: TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) (a6989586621680193695 :: Maybe k2) | |
Defined in Data.Foldable.Singletons | |
| type Eval (NumIter a s :: Maybe (k, Nat) -> Type) | |
| type Eval (FindIndex _p ('[] :: [a]) :: Maybe Nat -> Type) | |
| type Eval (FindIndex p (a2 ': as) :: Maybe Nat -> Type) | |
| type Eval (Find _p ('[] :: [a]) :: Maybe a -> Type) | |
| type Eval (Find p (a2 ': as) :: Maybe a1 -> Type) | |
| type Eval (Lookup a as :: Maybe b -> Type) | |
| type Eval ('Just x <|> _1 :: Maybe a -> Type) | |
| type Eval (('Nothing :: Maybe a) <|> m :: Maybe a -> Type) | |
| type Eval (Map f ('Just a3) :: Maybe a2 -> Type) | |
| type Eval (Map f ('Nothing :: Maybe a) :: Maybe b -> Type) | |
| type Apply (TFHelper_6989586621679357633Sym1 a6989586621679357638 :: TyFun (a ~> Maybe b) (Maybe b) -> Type) (a6989586621679357639 :: a ~> Maybe b) | |
| type Apply (FindIndexSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe Nat) -> Type) (a6989586621679731453 :: a ~> Bool) | |
Defined in Data.List.Singletons.Internal | |
| type Apply (FindSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe a) -> Type) (a6989586621679731480 :: a ~> Bool) | |
| type Apply (Foldr_6989586621680193829Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (Maybe a ~> b)) -> Type) (a6989586621680193835 :: a ~> (b ~> b)) | |
| type Apply (MapMaybeSym0 :: TyFun (a ~> Maybe b) ([a] ~> [b]) -> Type) (a6989586621679486163 :: a ~> Maybe b) | |
Defined in Data.Maybe.Singletons type Apply (MapMaybeSym0 :: TyFun (a ~> Maybe b) ([a] ~> [b]) -> Type) (a6989586621679486163 :: a ~> Maybe b) = MapMaybeSym1 a6989586621679486163 | |
| type Apply (FindSym0 :: TyFun (a ~> Bool) (t a ~> Maybe a) -> Type) (a6989586621680193279 :: a ~> Bool) | |
| type Apply (Fmap_6989586621679357336Sym0 :: TyFun (a ~> b) (Maybe a ~> Maybe b) -> Type) (a6989586621679357341 :: a ~> b) | |
| type Apply (FoldMap_6989586621680193813Sym0 :: TyFun (a ~> m) (Maybe a ~> m) -> Type) (a6989586621680193822 :: a ~> m) | |
| type Apply (Foldl_6989586621680193845Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (Maybe a ~> b)) -> Type) (a6989586621680193851 :: b ~> (a ~> b)) | |
| type Apply (UnfoldrSym0 :: TyFun (b ~> Maybe (a, b)) (b ~> [a]) -> Type) (a6989586621679731870 :: b ~> Maybe (a, b)) | |
Defined in Data.List.Singletons.Internal type Apply (UnfoldrSym0 :: TyFun (b ~> Maybe (a, b)) (b ~> [a]) -> Type) (a6989586621679731870 :: b ~> Maybe (a, b)) = UnfoldrSym1 a6989586621679731870 | |
| type Apply (LiftA2_6989586621679357482Sym0 :: TyFun (a ~> (b ~> c)) (Maybe a ~> (Maybe b ~> Maybe c)) -> Type) (a6989586621679357488 :: a ~> (b ~> c)) | |
| type Apply (Let6989586621679486168RsSym0 :: TyFun (a ~> Maybe k1) (TyFun k (TyFun [a] [k1] -> Type) -> Type) -> Type) (f6989586621679486165 :: a ~> Maybe k1) | |
| type Apply (Maybe_Sym1 a6989586621679484326 :: TyFun (a ~> b) (Maybe a ~> b) -> Type) (a6989586621679484327 :: a ~> b) | |
Defined in Data.Maybe.Singletons type Apply (Maybe_Sym1 a6989586621679484326 :: TyFun (a ~> b) (Maybe a ~> b) -> Type) (a6989586621679484327 :: a ~> b) = Maybe_Sym2 a6989586621679484326 a6989586621679484327 | |
| type Apply (Traverse_6989586621680478666Sym0 :: TyFun (a ~> f b) (Maybe a ~> f (Maybe b)) -> Type) (a6989586621680478671 :: a ~> f b) | |
| type Apply (Let6989586621680193673MfSym0 :: TyFun (k2 ~> (k3 ~> k2)) (TyFun k (TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type) -> Type) -> Type) (f6989586621680193671 :: k2 ~> (k3 ~> k2)) | |
Defined in Data.Foldable.Singletons type Apply (Let6989586621680193673MfSym0 :: TyFun (k2 ~> (k3 ~> k2)) (TyFun k (TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type) -> Type) -> Type) (f6989586621680193671 :: k2 ~> (k3 ~> k2)) = Let6989586621680193673MfSym1 f6989586621680193671 :: TyFun k (TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type) -> Type | |
| type Apply (Let6989586621680193694MfSym0 :: TyFun (k2 ~> (k3 ~> k3)) (TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type) -> Type) (f6989586621680193692 :: k2 ~> (k3 ~> k3)) | |
Defined in Data.Foldable.Singletons type Apply (Let6989586621680193694MfSym0 :: TyFun (k2 ~> (k3 ~> k3)) (TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type) -> Type) (f6989586621680193692 :: k2 ~> (k3 ~> k3)) = Let6989586621680193694MfSym1 f6989586621680193692 :: TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type | |
| type Apply (Lambda_6989586621680118497Sym1 a6989586621680118495 :: TyFun (k1 ~> First a) (TyFun k1 (Maybe a) -> Type) -> Type) (k6989586621680118496 :: k1 ~> First a) | |
| type Apply (Lambda_6989586621680118708Sym1 a6989586621680118706 :: TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type) (k6989586621680118707 :: k1 ~> Last a) | |
| type Unwrappabled (NamedF Maybe a name) | |
Defined in Lorentz.Wrappable | |
| type AsRPC (NamedF Maybe a name) | |
| type ToT (NamedF Maybe a name) | |
Instances
| Structured Ordering | |
Defined in Distribution.Utils.Structured | |
| Monoid Ordering | Since: base-2.1 |
| Semigroup Ordering | Since: base-4.9.0.0 |
| Bounded Ordering | Since: base-2.1 |
| Enum Ordering | Since: base-2.1 |
| Generic Ordering | |
| Read Ordering | Since: base-2.1 |
| Show Ordering | Since: base-2.1 |
| Default Ordering | |
Defined in Data.Default.Class | |
| NFData Ordering | |
Defined in Control.DeepSeq | |
| Eq Ordering | |
| Ord Ordering | |
Defined in GHC.Classes | |
| Hashable Ordering | |
Defined in Data.Hashable.Class | |
| PEq Ordering | |
| SEq Ordering | |
| PMonoid Ordering | |
| SMonoid Ordering | |
| POrd Ordering | |
| SOrd Ordering | |
Defined in Data.Ord.Singletons 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) # | |
| PSemigroup Ordering | |
Defined in Data.Semigroup.Singletons.Internal | |
| SSemigroup Ordering | |
| PBounded Ordering | |
Defined in Data.Singletons.Base.Enum | |
| PEnum Ordering | |
Defined in Data.Singletons.Base.Enum | |
| SBounded Ordering | |
Defined in Data.Singletons.Base.Enum | |
| SEnum Ordering | |
Defined in Data.Singletons.Base.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) # | |
| PShow Ordering | |
| SShow Ordering | |
Defined in Text.Show.Singletons 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) # | |
| TestCoercion SOrdering | |
Defined in Data.Singletons.Base.Instances | |
| TestEquality SOrdering | |
Defined in Data.Singletons.Base.Instances | |
| () :=> (Monoid Ordering) | |
| () :=> (Semigroup Ordering) | |
| () :=> (Bounded Ordering) | |
| () :=> (Enum Ordering) | |
| () :=> (Read Ordering) | |
| () :=> (Show Ordering) | |
| SingI ThenCmpSym0 | |
Defined in Data.Ord.Singletons Methods sing :: Sing ThenCmpSym0 # | |
| SuppressUnusedWarnings Compare_6989586621679613584Sym0 | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings Compare_6989586621679613601Sym0 | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings Compare_6989586621679181460Sym0 | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings Compare_6989586621679181849Sym0 | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings ThenCmpSym0 | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings TFHelper_6989586621679584129Sym0 | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings TFHelper_6989586621679131028Sym0 | |
Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings FromEnum_6989586621679544325Sym0 | |
Defined in Data.Singletons.Base.Enum Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings Compare_6989586621679181858Sym0 | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings Compare_6989586621679181840Sym0 | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings ToEnum_6989586621679544309Sym0 | |
Defined in Data.Singletons.Base.Enum Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings ShowsPrec_6989586621680071856Sym0 | |
Defined in Text.Show.Singletons Methods suppressUnusedWarnings :: () # | |
| SingI d => SingI (ThenCmpSym1 d :: TyFun Ordering Ordering -> Type) | |
Defined in Data.Ord.Singletons Methods sing :: Sing (ThenCmpSym1 d) # | |
| SingI (SortBySym0 :: TyFun (a ~> (a ~> Ordering)) ([a] ~> [a]) -> Type) | |
Defined in Data.List.Singletons.Internal Methods sing :: Sing SortBySym0 # | |
| SingI (ListsortBySym0 :: TyFun (a ~> (a ~> Ordering)) ([a] ~> [a]) -> Type) | |
Defined in Data.List.Singletons.Internal.Disambiguation | |
| SingI (MaximumBySym0 :: TyFun (a ~> (a ~> Ordering)) ([a] ~> a) -> Type) | |
Defined in Data.List.Singletons.Internal | |
| SingI (MinimumBySym0 :: TyFun (a ~> (a ~> Ordering)) ([a] ~> a) -> Type) | |
Defined in Data.List.Singletons.Internal | |
| SingI (InsertBySym0 :: TyFun (a ~> (a ~> Ordering)) (a ~> ([a] ~> [a])) -> Type) | |
Defined in Data.List.Singletons.Internal Methods sing :: Sing InsertBySym0 # | |
| SOrd a => SingI (CompareSym0 :: TyFun a (a ~> Ordering) -> Type) | |
Defined in Data.Ord.Singletons Methods sing :: Sing CompareSym0 # | |
| SuppressUnusedWarnings (Compare_6989586621679181827Sym0 :: TyFun (Identity a) (Identity a ~> Ordering) -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680111321Sym0 :: TyFun (First a) (First a ~> Ordering) -> Type) | |
Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680111341Sym0 :: TyFun (Last a) (Last a ~> Ordering) -> Type) | |
Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679179242Sym0 :: TyFun (Down a) (Down a ~> Ordering) -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679613701Sym0 :: TyFun (First a) (First a ~> Ordering) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679613721Sym0 :: TyFun (Last a) (Last a ~> Ordering) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679613681Sym0 :: TyFun (Max a) (Max a ~> Ordering) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679613661Sym0 :: TyFun (Min a) (Min a ~> Ordering) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679613741Sym0 :: TyFun (WrappedMonoid m) (WrappedMonoid m ~> Ordering) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679613584Sym1 a6989586621679613589 :: TyFun All Ordering -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679613601Sym1 a6989586621679613606 :: TyFun Any Ordering -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679613565Sym0 :: TyFun (Dual a) (Dual a ~> Ordering) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679613641Sym0 :: TyFun (Product a) (Product a ~> Ordering) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679613621Sym0 :: TyFun (Sum a) (Sum a ~> Ordering) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679181460Sym1 a6989586621679181465 :: TyFun Void Ordering -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679181443Sym0 :: TyFun (NonEmpty a) (NonEmpty a ~> Ordering) -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679181849Sym1 a6989586621679181854 :: TyFun Ordering Ordering -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ThenCmpSym1 a6989586621679166082 :: TyFun Ordering Ordering -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679584129Sym1 a6989586621679584134 :: TyFun Ordering Ordering -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621680071856Sym1 a6989586621680071868 :: TyFun Ordering (Symbol ~> Symbol) -> Type) | |
Defined in Text.Show.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679131028Sym1 a6989586621679131033 :: TyFun Ordering Bool -> Type) | |
Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (SortBySym0 :: TyFun (a ~> (a ~> Ordering)) ([a] ~> [a]) -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ListsortBySym0 :: TyFun (a ~> (a ~> Ordering)) ([a] ~> [a]) -> Type) | |
Defined in Data.List.Singletons.Internal.Disambiguation Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (MaximumBySym0 :: TyFun (a ~> (a ~> Ordering)) ([a] ~> a) -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (MinimumBySym0 :: TyFun (a ~> (a ~> Ordering)) ([a] ~> a) -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (InsertBySym0 :: TyFun (a ~> (a ~> Ordering)) (a ~> ([a] ~> [a])) -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679180719Sym0 :: TyFun (Maybe a) (Maybe a ~> Ordering) -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679181858Sym1 a6989586621679181863 :: TyFun () Ordering -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679181840Sym1 a6989586621679181845 :: TyFun Bool Ordering -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679181370Sym0 :: TyFun [a] ([a] ~> Ordering) -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (CompareSym0 :: TyFun a (a ~> Ordering) -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679166132Sym0 :: TyFun a (a ~> Ordering) -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679166162Scrutinee_6989586621679163725Sym0 :: TyFun k1 (TyFun k1 Ordering -> Type) -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679166178Scrutinee_6989586621679163727Sym0 :: TyFun k1 (TyFun k1 Ordering -> Type) -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679166194Scrutinee_6989586621679163729Sym0 :: TyFun k1 (TyFun k1 Ordering -> Type) -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679166210Scrutinee_6989586621679163731Sym0 :: TyFun k1 (TyFun k1 Ordering -> Type) -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SFoldable t => SingI (MaximumBySym0 :: TyFun (a ~> (a ~> Ordering)) (t a ~> a) -> Type) | |
Defined in Data.Foldable.Singletons Methods sing :: Sing MaximumBySym0 # | |
| SFoldable t => SingI (MinimumBySym0 :: TyFun (a ~> (a ~> Ordering)) (t a ~> a) -> Type) | |
Defined in Data.Foldable.Singletons Methods sing :: Sing MinimumBySym0 # | |
| SOrd a => SingI (ComparingSym0 :: TyFun (b ~> a) (b ~> (b ~> Ordering)) -> Type) | |
Defined in Data.Ord.Singletons Methods sing :: Sing ComparingSym0 # | |
| (SOrd a, SingI d) => SingI (CompareSym1 d :: TyFun a Ordering -> Type) | |
Defined in Data.Ord.Singletons Methods sing :: Sing (CompareSym1 d) # | |
| SuppressUnusedWarnings (Compare_6989586621679181415Sym0 :: TyFun (Either a b) (Either a b ~> Ordering) -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679181827Sym1 a6989586621679181832 :: TyFun (Identity a) Ordering -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680111321Sym1 a6989586621680111326 :: TyFun (First a) Ordering -> Type) | |
Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680111341Sym1 a6989586621680111346 :: TyFun (Last a) Ordering -> Type) | |
Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679179242Sym1 a6989586621679179247 :: TyFun (Down a) Ordering -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680163447Sym0 :: TyFun (Proxy s) (Proxy s ~> Ordering) -> Type) | |
Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680605396Sym0 :: TyFun (Arg a b) (Arg a b ~> Ordering) -> Type) | |
Defined in Data.Semigroup.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679613701Sym1 a6989586621679613706 :: TyFun (First a) Ordering -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679613721Sym1 a6989586621679613726 :: TyFun (Last a) Ordering -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679613681Sym1 a6989586621679613686 :: TyFun (Max a) Ordering -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679613661Sym1 a6989586621679613666 :: TyFun (Min a) Ordering -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679613741Sym1 a6989586621679613746 :: TyFun (WrappedMonoid m) Ordering -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679613565Sym1 a6989586621679613570 :: TyFun (Dual a) Ordering -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679613641Sym1 a6989586621679613646 :: TyFun (Product a) Ordering -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679613621Sym1 a6989586621679613626 :: TyFun (Sum a) Ordering -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679181443Sym1 a6989586621679181448 :: TyFun (NonEmpty a) Ordering -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (MaximumBySym0 :: TyFun (a ~> (a ~> Ordering)) (t a ~> a) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (MinimumBySym0 :: TyFun (a ~> (a ~> Ordering)) (t a ~> a) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ComparingSym0 :: TyFun (b ~> a) (b ~> (b ~> Ordering)) -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680193310Min'Sym0 :: TyFun (k1 ~> (k1 ~> Ordering)) (TyFun k2 (TyFun k1 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680193330Max'Sym0 :: TyFun (k1 ~> (k1 ~> Ordering)) (TyFun k2 (TyFun k1 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679180719Sym1 a6989586621679180724 :: TyFun (Maybe a) Ordering -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679181483Sym0 :: TyFun (a, b) ((a, b) ~> Ordering) -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679181370Sym1 a6989586621679181375 :: TyFun [a] Ordering -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (CompareSym1 a6989586621679166098 :: TyFun a Ordering -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679166132Sym1 a6989586621679166137 :: TyFun a Ordering -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679166162Scrutinee_6989586621679163725Sym1 x6989586621679166160 :: TyFun k1 Ordering -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679166178Scrutinee_6989586621679163727Sym1 x6989586621679166176 :: TyFun k1 Ordering -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679166194Scrutinee_6989586621679163729Sym1 x6989586621679166192 :: TyFun k1 Ordering -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679166210Scrutinee_6989586621679163731Sym1 x6989586621679166208 :: TyFun k1 Ordering -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| (SOrd a, SingI d) => SingI (ComparingSym1 d :: TyFun b (b ~> Ordering) -> Type) | |
Defined in Data.Ord.Singletons Methods sing :: Sing (ComparingSym1 d) # | |
| SuppressUnusedWarnings (Compare_6989586621679181415Sym1 a6989586621679181420 :: TyFun (Either a b) Ordering -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680428560Sym0 :: TyFun (Const a b) (Const a b ~> Ordering) -> Type) | |
Defined in Data.Functor.Const.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680163447Sym1 a6989586621680163452 :: TyFun (Proxy s) Ordering -> Type) | |
Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680605396Sym1 a6989586621680605401 :: TyFun (Arg a b) Ordering -> Type) | |
Defined in Data.Semigroup.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679731508MinBySym0 :: TyFun (k1 ~> (k1 ~> Ordering)) (TyFun k2 (TyFun k3 (TyFun k1 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679731529MaxBySym0 :: TyFun (k1 ~> (k1 ~> Ordering)) (TyFun k2 (TyFun k3 (TyFun k1 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.List.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679181483Sym1 a6989586621679181488 :: TyFun (a, b) Ordering -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679181521Sym0 :: TyFun (a, b, c) ((a, b, c) ~> Ordering) -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ComparingSym1 a6989586621679166089 :: TyFun b (b ~> Ordering) -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| (SOrd a, SingI d1, SingI d2) => SingI (ComparingSym2 d1 d2 :: TyFun b Ordering -> Type) | |
Defined in Data.Ord.Singletons Methods sing :: Sing (ComparingSym2 d1 d2) # | |
| SuppressUnusedWarnings (Compare_6989586621680428560Sym1 a6989586621680428565 :: TyFun (Const a b) Ordering -> Type) | |
Defined in Data.Functor.Const.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679181521Sym1 a6989586621679181526 :: TyFun (a, b, c) Ordering -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679181570Sym0 :: TyFun (a, b, c, d) ((a, b, c, d) ~> Ordering) -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ComparingSym2 a6989586621679166089 a6989586621679166090 :: TyFun b Ordering -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679181570Sym1 a6989586621679181575 :: TyFun (a, b, c, d) Ordering -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679181630Sym0 :: TyFun (a, b, c, d, e) ((a, b, c, d, e) ~> Ordering) -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679181630Sym1 a6989586621679181635 :: TyFun (a, b, c, d, e) Ordering -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679181701Sym0 :: TyFun (a, b, c, d, e, f) ((a, b, c, d, e, f) ~> Ordering) -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679181701Sym1 a6989586621679181706 :: TyFun (a, b, c, d, e, f) Ordering -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679181783Sym0 :: TyFun (a, b, c, d, e, f, g) ((a, b, c, d, e, f, g) ~> Ordering) -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679181783Sym1 a6989586621679181788 :: TyFun (a, b, c, d, e, f, g) Ordering -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| type Rep Ordering | Since: base-4.6.0.0 |
| type MEmpty | |
Defined in Fcf.Class.Monoid | |
| type Demote Ordering | |
Defined in Data.Singletons.Base.Instances | |
| type Sing | |
Defined in Data.Singletons.Base.Instances | |
| type Mempty | |
Defined in Data.Monoid.Singletons type Mempty = Mempty_6989586621680102640Sym0 | |
| type MaxBound | |
Defined in Data.Singletons.Base.Enum type MaxBound = MaxBound_6989586621679509893Sym0 | |
| type MinBound | |
Defined in Data.Singletons.Base.Enum type MinBound = MinBound_6989586621679509890Sym0 | |
| type Mconcat (arg :: [Ordering]) | |
| type Sconcat (arg :: NonEmpty Ordering) | |
| type FromEnum (a :: Ordering) | |
Defined in Data.Singletons.Base.Enum | |
| type Pred (arg :: Ordering) | |
| type Succ (arg :: Ordering) | |
| type ToEnum a | |
Defined in Data.Singletons.Base.Enum | |
| type Show_ (arg :: Ordering) | |
| type 'EQ <> (b :: Ordering) | |
Defined in Fcf.Class.Monoid | |
| type 'GT <> (_b :: Ordering) | |
Defined in Fcf.Class.Monoid | |
| type 'LT <> (_b :: Ordering) | |
Defined in Fcf.Class.Monoid | |
| type (a :: Ordering) <> 'EQ | |
Defined in Fcf.Class.Monoid | |
| type (arg1 :: Ordering) /= (arg2 :: Ordering) | |
| type (a1 :: Ordering) == (a2 :: Ordering) | |
| type Mappend (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 Max (arg1 :: Ordering) (arg2 :: Ordering) | |
| type Min (arg1 :: Ordering) (arg2 :: Ordering) | |
| type (a1 :: Ordering) <> (a2 :: Ordering) | |
| type EnumFromTo (arg1 :: Ordering) (arg2 :: Ordering) | |
| type ShowList (arg1 :: [Ordering]) arg2 | |
| type Apply FromEnum_6989586621679544325Sym0 (a6989586621679544329 :: Ordering) | |
Defined in Data.Singletons.Base.Enum | |
| type Apply ToEnum_6989586621679544309Sym0 (a6989586621679544313 :: Nat) | |
Defined in Data.Singletons.Base.Enum | |
| type EnumFromThenTo (arg1 :: Ordering) (arg2 :: Ordering) (arg3 :: Ordering) | |
| type ShowsPrec a1 (a2 :: Ordering) a3 | |
| type Apply (Compare_6989586621679613584Sym1 a6989586621679613589 :: TyFun All Ordering -> Type) (a6989586621679613590 :: All) | |
| type Apply (Compare_6989586621679613601Sym1 a6989586621679613606 :: TyFun Any Ordering -> Type) (a6989586621679613607 :: Any) | |
| type Apply (Compare_6989586621679181460Sym1 a6989586621679181465 :: TyFun Void Ordering -> Type) (a6989586621679181466 :: Void) | |
| type Apply (Compare_6989586621679181849Sym1 a6989586621679181854 :: TyFun Ordering Ordering -> Type) (a6989586621679181855 :: Ordering) | |
| type Apply (ThenCmpSym1 a6989586621679166082 :: TyFun Ordering Ordering -> Type) (a6989586621679166083 :: Ordering) | |
Defined in Data.Ord.Singletons | |
| type Apply (TFHelper_6989586621679584129Sym1 a6989586621679584134 :: TyFun Ordering Ordering -> Type) (a6989586621679584135 :: Ordering) | |
| type Apply (TFHelper_6989586621679131028Sym1 a6989586621679131033 :: TyFun Ordering Bool -> Type) (a6989586621679131034 :: Ordering) | |
| type Apply (Compare_6989586621679181858Sym1 a6989586621679181863 :: TyFun () Ordering -> Type) (a6989586621679181864 :: ()) | |
Defined in Data.Ord.Singletons | |
| type Apply (Compare_6989586621679181840Sym1 a6989586621679181845 :: TyFun Bool Ordering -> Type) (a6989586621679181846 :: Bool) | |
| type Apply (CompareSym1 a6989586621679166098 :: TyFun a Ordering -> Type) (a6989586621679166099 :: a) | |
Defined in Data.Ord.Singletons | |
| type Apply (Compare_6989586621679166132Sym1 a6989586621679166137 :: TyFun a Ordering -> Type) (a6989586621679166138 :: a) | |
Defined in Data.Ord.Singletons | |
| type Apply (Let6989586621679166162Scrutinee_6989586621679163725Sym1 x6989586621679166160 :: TyFun k1 Ordering -> Type) (y6989586621679166161 :: k1) | |
Defined in Data.Ord.Singletons | |
| type Apply (Let6989586621679166178Scrutinee_6989586621679163727Sym1 x6989586621679166176 :: TyFun k1 Ordering -> Type) (y6989586621679166177 :: k1) | |
Defined in Data.Ord.Singletons | |
| type Apply (Let6989586621679166194Scrutinee_6989586621679163729Sym1 x6989586621679166192 :: TyFun k1 Ordering -> Type) (y6989586621679166193 :: k1) | |
Defined in Data.Ord.Singletons | |
| type Apply (Let6989586621679166210Scrutinee_6989586621679163731Sym1 x6989586621679166208 :: TyFun k1 Ordering -> Type) (y6989586621679166209 :: k1) | |
Defined in Data.Ord.Singletons | |
| type Apply (ComparingSym2 a6989586621679166089 a6989586621679166090 :: TyFun b Ordering -> Type) (a6989586621679166091 :: b) | |
Defined in Data.Ord.Singletons | |
| type Apply Compare_6989586621679613584Sym0 (a6989586621679613589 :: All) | |
Defined in Data.Semigroup.Singletons.Internal | |
| type Apply Compare_6989586621679613601Sym0 (a6989586621679613606 :: Any) | |
Defined in Data.Semigroup.Singletons.Internal | |
| type Apply Compare_6989586621679181460Sym0 (a6989586621679181465 :: Void) | |
Defined in Data.Ord.Singletons | |
| type Apply Compare_6989586621679181849Sym0 (a6989586621679181854 :: Ordering) | |
Defined in Data.Ord.Singletons | |
| type Apply ThenCmpSym0 (a6989586621679166082 :: Ordering) | |
Defined in Data.Ord.Singletons | |
| type Apply TFHelper_6989586621679584129Sym0 (a6989586621679584134 :: Ordering) | |
Defined in Data.Semigroup.Singletons.Internal | |
| type Apply TFHelper_6989586621679131028Sym0 (a6989586621679131033 :: Ordering) | |
Defined in Data.Eq.Singletons | |
| type Apply Compare_6989586621679181858Sym0 (a6989586621679181863 :: ()) | |
Defined in Data.Ord.Singletons type Apply Compare_6989586621679181858Sym0 (a6989586621679181863 :: ()) = Compare_6989586621679181858Sym1 a6989586621679181863 | |
| type Apply Compare_6989586621679181840Sym0 (a6989586621679181845 :: Bool) | |
Defined in Data.Ord.Singletons | |
| type Apply ShowsPrec_6989586621680071856Sym0 (a6989586621680071868 :: Nat) | |
Defined in Text.Show.Singletons | |
| type Apply (ShowsPrec_6989586621680071856Sym1 a6989586621680071868 :: TyFun Ordering (Symbol ~> Symbol) -> Type) (a6989586621680071869 :: Ordering) | |
| type Apply (CompareSym0 :: TyFun a (a ~> Ordering) -> Type) (a6989586621679166098 :: a) | |
Defined in Data.Ord.Singletons type Apply (CompareSym0 :: TyFun a (a ~> Ordering) -> Type) (a6989586621679166098 :: a) = CompareSym1 a6989586621679166098 | |
| type Apply (Compare_6989586621679166132Sym0 :: TyFun a (a ~> Ordering) -> Type) (a6989586621679166137 :: a) | |
| type Apply (Let6989586621679166162Scrutinee_6989586621679163725Sym0 :: TyFun k1 (TyFun k1 Ordering -> Type) -> Type) (x6989586621679166160 :: k1) | |
| type Apply (Let6989586621679166178Scrutinee_6989586621679163727Sym0 :: TyFun k1 (TyFun k1 Ordering -> Type) -> Type) (x6989586621679166176 :: k1) | |
| type Apply (Let6989586621679166194Scrutinee_6989586621679163729Sym0 :: TyFun k1 (TyFun k1 Ordering -> Type) -> Type) (x6989586621679166192 :: k1) | |
| type Apply (Let6989586621679166210Scrutinee_6989586621679163731Sym0 :: TyFun k1 (TyFun k1 Ordering -> Type) -> Type) (x6989586621679166208 :: k1) | |
| type Apply (ComparingSym1 a6989586621679166089 :: TyFun b (b ~> Ordering) -> Type) (a6989586621679166090 :: b) | |
Defined in Data.Ord.Singletons type Apply (ComparingSym1 a6989586621679166089 :: TyFun b (b ~> Ordering) -> Type) (a6989586621679166090 :: b) = ComparingSym2 a6989586621679166089 a6989586621679166090 | |
| type Apply (Compare_6989586621679181827Sym1 a6989586621679181832 :: TyFun (Identity a) Ordering -> Type) (a6989586621679181833 :: Identity a) | |
| type Apply (Compare_6989586621680111321Sym1 a6989586621680111326 :: TyFun (First a) Ordering -> Type) (a6989586621680111327 :: First a) | |
| type Apply (Compare_6989586621680111341Sym1 a6989586621680111346 :: TyFun (Last a) Ordering -> Type) (a6989586621680111347 :: Last a) | |
| type Apply (Compare_6989586621679179242Sym1 a6989586621679179247 :: TyFun (Down a) Ordering -> Type) (a6989586621679179248 :: Down a) | |
| type Apply (Compare_6989586621679613701Sym1 a6989586621679613706 :: TyFun (First a) Ordering -> Type) (a6989586621679613707 :: First a) | |
| type Apply (Compare_6989586621679613721Sym1 a6989586621679613726 :: TyFun (Last a) Ordering -> Type) (a6989586621679613727 :: Last a) | |
| type Apply (Compare_6989586621679613681Sym1 a6989586621679613686 :: TyFun (Max a) Ordering -> Type) (a6989586621679613687 :: Max a) | |
| type Apply (Compare_6989586621679613661Sym1 a6989586621679613666 :: TyFun (Min a) Ordering -> Type) (a6989586621679613667 :: Min a) | |
| type Apply (Compare_6989586621679613741Sym1 a6989586621679613746 :: TyFun (WrappedMonoid m) Ordering -> Type) (a6989586621679613747 :: WrappedMonoid m) | |
Defined in Data.Semigroup.Singletons.Internal type Apply (Compare_6989586621679613741Sym1 a6989586621679613746 :: TyFun (WrappedMonoid m) Ordering -> Type) (a6989586621679613747 :: WrappedMonoid m) = Compare_6989586621679613741 a6989586621679613746 a6989586621679613747 | |
| type Apply (Compare_6989586621679613565Sym1 a6989586621679613570 :: TyFun (Dual a) Ordering -> Type) (a6989586621679613571 :: Dual a) | |
| type Apply (Compare_6989586621679613641Sym1 a6989586621679613646 :: TyFun (Product a) Ordering -> Type) (a6989586621679613647 :: Product a) | |
| type Apply (Compare_6989586621679613621Sym1 a6989586621679613626 :: TyFun (Sum a) Ordering -> Type) (a6989586621679613627 :: Sum a) | |
| type Apply (Compare_6989586621679181443Sym1 a6989586621679181448 :: TyFun (NonEmpty a) Ordering -> Type) (a6989586621679181449 :: NonEmpty a) | |
| type Apply (Compare_6989586621679180719Sym1 a6989586621679180724 :: TyFun (Maybe a) Ordering -> Type) (a6989586621679180725 :: Maybe a) | |
| type Apply (Compare_6989586621679181370Sym1 a6989586621679181375 :: TyFun [a] Ordering -> Type) (a6989586621679181376 :: [a]) | |
Defined in Data.Ord.Singletons | |
| type Apply (Compare_6989586621679181827Sym0 :: TyFun (Identity a) (Identity a ~> Ordering) -> Type) (a6989586621679181832 :: Identity a) | |
| type Apply (Compare_6989586621680111321Sym0 :: TyFun (First a) (First a ~> Ordering) -> Type) (a6989586621680111326 :: First a) | |
| type Apply (Compare_6989586621680111341Sym0 :: TyFun (Last a) (Last a ~> Ordering) -> Type) (a6989586621680111346 :: Last a) | |
| type Apply (Compare_6989586621679179242Sym0 :: TyFun (Down a) (Down a ~> Ordering) -> Type) (a6989586621679179247 :: Down a) | |
| type Apply (Compare_6989586621679613701Sym0 :: TyFun (First a) (First a ~> Ordering) -> Type) (a6989586621679613706 :: First a) | |
| type Apply (Compare_6989586621679613721Sym0 :: TyFun (Last a) (Last a ~> Ordering) -> Type) (a6989586621679613726 :: Last a) | |
| type Apply (Compare_6989586621679613681Sym0 :: TyFun (Max a) (Max a ~> Ordering) -> Type) (a6989586621679613686 :: Max a) | |
| type Apply (Compare_6989586621679613661Sym0 :: TyFun (Min a) (Min a ~> Ordering) -> Type) (a6989586621679613666 :: Min a) | |
| type Apply (Compare_6989586621679613741Sym0 :: TyFun (WrappedMonoid m) (WrappedMonoid m ~> Ordering) -> Type) (a6989586621679613746 :: WrappedMonoid m) | |
Defined in Data.Semigroup.Singletons.Internal type Apply (Compare_6989586621679613741Sym0 :: TyFun (WrappedMonoid m) (WrappedMonoid m ~> Ordering) -> Type) (a6989586621679613746 :: WrappedMonoid m) = Compare_6989586621679613741Sym1 a6989586621679613746 | |
| type Apply (Compare_6989586621679613565Sym0 :: TyFun (Dual a) (Dual a ~> Ordering) -> Type) (a6989586621679613570 :: Dual a) | |
| type Apply (Compare_6989586621679613641Sym0 :: TyFun (Product a) (Product a ~> Ordering) -> Type) (a6989586621679613646 :: Product a) | |
| type Apply (Compare_6989586621679613621Sym0 :: TyFun (Sum a) (Sum a ~> Ordering) -> Type) (a6989586621679613626 :: Sum a) | |
| type Apply (Compare_6989586621679181443Sym0 :: TyFun (NonEmpty a) (NonEmpty a ~> Ordering) -> Type) (a6989586621679181448 :: NonEmpty a) | |
| type Apply (Compare_6989586621679180719Sym0 :: TyFun (Maybe a) (Maybe a ~> Ordering) -> Type) (a6989586621679180724 :: Maybe a) | |
| type Apply (Compare_6989586621679181370Sym0 :: TyFun [a] ([a] ~> Ordering) -> Type) (a6989586621679181375 :: [a]) | |
| type Apply (Compare_6989586621679181415Sym1 a6989586621679181420 :: TyFun (Either a b) Ordering -> Type) (a6989586621679181421 :: Either a b) | |
| type Apply (Compare_6989586621680163447Sym1 a6989586621680163452 :: TyFun (Proxy s) Ordering -> Type) (a6989586621680163453 :: Proxy s) | |
| type Apply (Compare_6989586621680605396Sym1 a6989586621680605401 :: TyFun (Arg a b) Ordering -> Type) (a6989586621680605402 :: Arg a b) | |
| type Apply (Compare_6989586621679181483Sym1 a6989586621679181488 :: TyFun (a, b) Ordering -> Type) (a6989586621679181489 :: (a, b)) | |
Defined in Data.Ord.Singletons | |
| type Apply (SortBySym0 :: TyFun (a ~> (a ~> Ordering)) ([a] ~> [a]) -> Type) (a6989586621679731564 :: a ~> (a ~> Ordering)) | |
Defined in Data.List.Singletons.Internal | |
| type Apply (ListsortBySym0 :: TyFun (a ~> (a ~> Ordering)) ([a] ~> [a]) -> Type) (a6989586621680002151 :: a ~> (a ~> Ordering)) | |
| type Apply (MaximumBySym0 :: TyFun (a ~> (a ~> Ordering)) ([a] ~> a) -> Type) (a6989586621679731522 :: a ~> (a ~> Ordering)) | |
| type Apply (MinimumBySym0 :: TyFun (a ~> (a ~> Ordering)) ([a] ~> a) -> Type) (a6989586621679731501 :: a ~> (a ~> Ordering)) | |
| type Apply (InsertBySym0 :: TyFun (a ~> (a ~> Ordering)) (a ~> ([a] ~> [a])) -> Type) (a6989586621679731544 :: a ~> (a ~> Ordering)) | |
Defined in Data.List.Singletons.Internal | |
| type Apply (Compare_6989586621679181415Sym0 :: TyFun (Either a b) (Either a b ~> Ordering) -> Type) (a6989586621679181420 :: Either a b) | |
| type Apply (Compare_6989586621680163447Sym0 :: TyFun (Proxy s) (Proxy s ~> Ordering) -> Type) (a6989586621680163452 :: Proxy s) | |
| type Apply (Compare_6989586621680605396Sym0 :: TyFun (Arg a b) (Arg a b ~> Ordering) -> Type) (a6989586621680605401 :: Arg a b) | |
| type Apply (MaximumBySym0 :: TyFun (a ~> (a ~> Ordering)) (t a ~> a) -> Type) (a6989586621680193326 :: a ~> (a ~> Ordering)) | |
Defined in Data.Foldable.Singletons | |
| type Apply (MinimumBySym0 :: TyFun (a ~> (a ~> Ordering)) (t a ~> a) -> Type) (a6989586621680193306 :: a ~> (a ~> Ordering)) | |
Defined in Data.Foldable.Singletons | |
| type Apply (ComparingSym0 :: TyFun (b ~> a) (b ~> (b ~> Ordering)) -> Type) (a6989586621679166089 :: b ~> a) | |
Defined in Data.Ord.Singletons type Apply (ComparingSym0 :: TyFun (b ~> a) (b ~> (b ~> Ordering)) -> Type) (a6989586621679166089 :: b ~> a) = ComparingSym1 a6989586621679166089 | |
| type Apply (Let6989586621680193310Min'Sym0 :: TyFun (k1 ~> (k1 ~> Ordering)) (TyFun k2 (TyFun k1 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type) (cmp6989586621680193308 :: k1 ~> (k1 ~> Ordering)) | |
Defined in Data.Foldable.Singletons type Apply (Let6989586621680193310Min'Sym0 :: TyFun (k1 ~> (k1 ~> Ordering)) (TyFun k2 (TyFun k1 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type) (cmp6989586621680193308 :: k1 ~> (k1 ~> Ordering)) = Let6989586621680193310Min'Sym1 cmp6989586621680193308 :: TyFun k2 (TyFun k1 (TyFun k1 k1 -> Type) -> Type) -> Type | |
| type Apply (Let6989586621680193330Max'Sym0 :: TyFun (k1 ~> (k1 ~> Ordering)) (TyFun k2 (TyFun k1 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type) (cmp6989586621680193328 :: k1 ~> (k1 ~> Ordering)) | |
Defined in Data.Foldable.Singletons type Apply (Let6989586621680193330Max'Sym0 :: TyFun (k1 ~> (k1 ~> Ordering)) (TyFun k2 (TyFun k1 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type) (cmp6989586621680193328 :: k1 ~> (k1 ~> Ordering)) = Let6989586621680193330Max'Sym1 cmp6989586621680193328 :: TyFun k2 (TyFun k1 (TyFun k1 k1 -> Type) -> Type) -> Type | |
| type Apply (Compare_6989586621679181483Sym0 :: TyFun (a, b) ((a, b) ~> Ordering) -> Type) (a6989586621679181488 :: (a, b)) | |
| type Apply (Let6989586621679731508MinBySym0 :: TyFun (k1 ~> (k1 ~> Ordering)) (TyFun k2 (TyFun k3 (TyFun k1 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type) -> Type) (cmp6989586621679731503 :: k1 ~> (k1 ~> Ordering)) | |
Defined in Data.List.Singletons.Internal type Apply (Let6989586621679731508MinBySym0 :: TyFun (k1 ~> (k1 ~> Ordering)) (TyFun k2 (TyFun k3 (TyFun k1 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type) -> Type) (cmp6989586621679731503 :: k1 ~> (k1 ~> Ordering)) = Let6989586621679731508MinBySym1 cmp6989586621679731503 :: TyFun k2 (TyFun k3 (TyFun k1 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type | |
| type Apply (Let6989586621679731529MaxBySym0 :: TyFun (k1 ~> (k1 ~> Ordering)) (TyFun k2 (TyFun k3 (TyFun k1 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type) -> Type) (cmp6989586621679731524 :: k1 ~> (k1 ~> Ordering)) | |
Defined in Data.List.Singletons.Internal type Apply (Let6989586621679731529MaxBySym0 :: TyFun (k1 ~> (k1 ~> Ordering)) (TyFun k2 (TyFun k3 (TyFun k1 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type) -> Type) (cmp6989586621679731524 :: k1 ~> (k1 ~> Ordering)) = Let6989586621679731529MaxBySym1 cmp6989586621679731524 :: TyFun k2 (TyFun k3 (TyFun k1 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type | |
| type Apply (Compare_6989586621680428560Sym1 a6989586621680428565 :: TyFun (Const a b) Ordering -> Type) (a6989586621680428566 :: Const a b) | |
| type Apply (Compare_6989586621679181521Sym1 a6989586621679181526 :: TyFun (a, b, c) Ordering -> Type) (a6989586621679181527 :: (a, b, c)) | |
Defined in Data.Ord.Singletons | |
| type Apply (Compare_6989586621680428560Sym0 :: TyFun (Const a b) (Const a b ~> Ordering) -> Type) (a6989586621680428565 :: Const a b) | |
| type Apply (Compare_6989586621679181521Sym0 :: TyFun (a, b, c) ((a, b, c) ~> Ordering) -> Type) (a6989586621679181526 :: (a, b, c)) | |
| type Apply (Compare_6989586621679181570Sym1 a6989586621679181575 :: TyFun (a, b, c, d) Ordering -> Type) (a6989586621679181576 :: (a, b, c, d)) | |
Defined in Data.Ord.Singletons | |
| type Apply (Compare_6989586621679181570Sym0 :: TyFun (a, b, c, d) ((a, b, c, d) ~> Ordering) -> Type) (a6989586621679181575 :: (a, b, c, d)) | |
| type Apply (Compare_6989586621679181630Sym1 a6989586621679181635 :: TyFun (a, b, c, d, e) Ordering -> Type) (a6989586621679181636 :: (a, b, c, d, e)) | |
Defined in Data.Ord.Singletons | |
| type Apply (Compare_6989586621679181630Sym0 :: TyFun (a, b, c, d, e) ((a, b, c, d, e) ~> Ordering) -> Type) (a6989586621679181635 :: (a, b, c, d, e)) | |
| type Apply (Compare_6989586621679181701Sym1 a6989586621679181706 :: TyFun (a, b, c, d, e, f) Ordering -> Type) (a6989586621679181707 :: (a, b, c, d, e, f)) | |
Defined in Data.Ord.Singletons | |
| type Apply (Compare_6989586621679181701Sym0 :: TyFun (a, b, c, d, e, f) ((a, b, c, d, e, f) ~> Ordering) -> Type) (a6989586621679181706 :: (a, b, c, d, e, f)) | |
| type Apply (Compare_6989586621679181783Sym1 a6989586621679181788 :: TyFun (a, b, c, d, e, f, g) Ordering -> Type) (a6989586621679181789 :: (a, b, c, d, e, f, g)) | |
Defined in Data.Ord.Singletons | |
| type Apply (Compare_6989586621679181783Sym0 :: TyFun (a, b, c, d, e, f, g) ((a, b, c, d, e, f, g) ~> Ordering) -> Type) (a6989586621679181788 :: (a, b, c, d, e, f, g)) | |
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
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) | |
| Foldable (UAddr :: Type -> Type) | Since: base-4.9.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => UAddr m -> m # foldMap :: Monoid m => (a -> m) -> UAddr a -> m # foldMap' :: Monoid m => (a -> m) -> UAddr a -> m # foldr :: (a -> b -> b) -> b -> UAddr a -> b # foldr' :: (a -> b -> b) -> b -> UAddr a -> b # foldl :: (b -> a -> b) -> b -> UAddr a -> b # foldl' :: (b -> a -> b) -> b -> UAddr a -> b # foldr1 :: (a -> a -> a) -> UAddr a -> a # foldl1 :: (a -> a -> a) -> UAddr a -> a # elem :: Eq a => a -> UAddr a -> Bool # maximum :: Ord a => UAddr a -> a # minimum :: Ord a => UAddr a -> a # | |
| Traversable (UAddr :: Type -> Type) | Since: base-4.9.0.0 |
| Storable (Ptr a) | Since: base-2.1 |
| Show (Ptr a) | Since: base-2.1 |
| NFData (Ptr a) | Since: deepseq-1.4.2.0 |
Defined in Control.DeepSeq | |
| Buildable (Ptr a) | |
Defined in Formatting.Buildable | |
| Eq (Ptr a) | Since: base-2.1 |
| Ord (Ptr a) | Since: base-2.1 |
| Hashable (Ptr a) | |
Defined in Data.Hashable.Class | |
| Functor (URec (Ptr ()) :: Type -> Type) | Since: base-4.9.0.0 |
| Generic (URec (Ptr ()) p) | |
| 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 # | |
| data URec (Ptr ()) (p :: k) | Used for marking occurrences of Since: base-4.9.0.0 |
| type Rep1 (URec (Ptr ()) :: k -> Type) | Since: base-4.9.0.0 |
Defined in GHC.Generics | |
| type Rep (URec (Ptr ()) p) | Since: base-4.9.0.0 |
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 | |
| Storable (FunPtr a) | Since: base-2.1 |
Defined in Foreign.Storable | |
| Show (FunPtr a) | Since: base-2.1 |
| NFData (FunPtr a) | Since: deepseq-1.4.2.0 |
Defined in Control.DeepSeq | |
| Eq (FunPtr a) | |
| Ord (FunPtr a) | |
Defined in GHC.Ptr | |
| Hashable (FunPtr a) | |
Defined in Data.Hashable.Class | |
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 | |
| () :=> (Applicative (Either a)) | |
Defined in Data.Constraint Methods ins :: () :- Applicative (Either a) # | |
| () :=> (Functor (Either a)) | |
| () :=> (Monad (Either a)) | |
| MonadError e (Either e) | |
Defined in Control.Monad.Error.Class | |
| (Lift a, Lift b) => Lift (Either a b :: Type) | |
| 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 | |
| Applicative (Either e) | Since: base-3.0 |
| Functor (Either a) | Since: base-3.0 |
| Monad (Either e) | Since: base-4.4.0.0 |
| MonadFailure (Either a) | |
| NFData a => NFData1 (Either a) | Since: deepseq-1.4.3.0 |
Defined in Control.DeepSeq | |
| 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 | |
| e ~ SomeException => MonadThrow (Either e) | |
Defined in Control.Monad.Catch | |
| Hashable a => Hashable1 (Either a) | |
Defined in Data.Hashable.Class | |
| PApplicative (Either e) | |
| PFunctor (Either a) | |
Defined in Control.Monad.Singletons.Internal | |
| PMonad (Either e) | |
| SApplicative (Either e) | |
Defined in Control.Monad.Singletons.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) # | |
| SFunctor (Either a) | |
| SMonad (Either e) | |
Defined in Control.Monad.Singletons.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) # | |
| PFoldable (Either a) | |
| SFoldable (Either a) | |
Defined in Data.Foldable.Singletons Methods sFold :: forall m (t1 :: Either a m). SMonoid m => Sing t1 -> Sing (Apply FoldSym0 t1) # 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 (t1 :: Either a a0). Sing t1 -> Sing (Apply ToListSym0 t1) # sNull :: forall a0 (t1 :: Either a a0). Sing t1 -> Sing (Apply NullSym0 t1) # sLength :: forall a0 (t1 :: Either a a0). Sing t1 -> Sing (Apply LengthSym0 t1) # sElem :: forall a0 (t1 :: a0) (t2 :: Either a a0). SEq a0 => Sing t1 -> Sing t2 -> Sing (Apply (Apply ElemSym0 t1) t2) # sMaximum :: forall a0 (t1 :: Either a a0). SOrd a0 => Sing t1 -> Sing (Apply MaximumSym0 t1) # sMinimum :: forall a0 (t1 :: Either a a0). SOrd a0 => Sing t1 -> Sing (Apply MinimumSym0 t1) # sSum :: forall a0 (t1 :: Either a a0). SNum a0 => Sing t1 -> Sing (Apply SumSym0 t1) # sProduct :: forall a0 (t1 :: Either a a0). SNum a0 => Sing t1 -> Sing (Apply ProductSym0 t1) # | |
| PTraversable (Either a) | |
| STraversable (Either a) | |
Defined in Data.Traversable.Singletons 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 (t1 :: Either a (f a0)). SApplicative f => Sing t1 -> Sing (Apply SequenceASym0 t1) # 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 (t1 :: Either a (m a0)). SMonad m => Sing t1 -> Sing (Apply SequenceSym0 t1) # | |
| KnownValue a => LorentzFunctor (Either a) a b | |
Defined in Lorentz.Instr | |
| Generic1 (Either a :: Type -> Type) | |
| IsoHKD (Either a :: Type -> Type) (b :: Type) | |
| (CanCastTo l1 l2, CanCastTo r1 r2) => CanCastTo (Either l1 r1 :: Type) (Either l2 r2 :: Type) | |
| (Structured a, Structured b) => Structured (Either a b) | |
Defined in Distribution.Utils.Structured | |
| Semigroup (Either a b) | Since: base-4.9.0.0 |
| Generic (Either a b) | |
| (Read a, Read b) => Read (Either a b) | Since: base-3.0 |
| (Show a, Show b) => Show (Either a b) | Since: base-3.0 |
| (NFData a, NFData b) => NFData (Either a b) | |
Defined in Control.DeepSeq | |
| (Eq a, Eq b) => Eq (Either a b) | Since: base-2.1 |
| (Ord a, Ord b) => Ord (Either a b) | Since: base-2.1 |
| (Hashable a, Hashable b) => Hashable (Either a b) | |
Defined in Data.Hashable.Class | |
| (HasAnnotation a, HasAnnotation b) => HasAnnotation (Either a b) | |
Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (Either a b)) # | |
| (HasRPCRepr l, HasRPCRepr r) => HasRPCRepr (Either l r) | |
Defined in Morley.AsRPC | |
| PolyTypeHasDocC '[l, r] => TypeHasDoc (Either l r) | |
Defined in Morley.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) # | |
| (IsoValue l, IsoValue r) => IsoValue (Either l r) | |
| PEq (Either a b) | |
| (SEq a, SEq b) => SEq (Either a b) | |
| POrd (Either a b) | |
| (SOrd a, SOrd b) => SOrd (Either a b) | |
Defined in Data.Ord.Singletons 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) # | |
| PSemigroup (Either a b) | |
Defined in Data.Semigroup.Singletons.Internal | |
| SSemigroup (Either a b) | |
| PShow (Either a b) | |
| (SShow a, SShow b) => SShow (Either a b) | |
Defined in Text.Show.Singletons 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) # | |
| (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 # 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 # 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)) # safeHead :: Either a b -> Maybe (Element (Either a b)) # safeMaximum :: Either a b -> Maybe (Element (Either a b)) # safeMinimum :: Either a b -> Maybe (Element (Either a b)) # safeFoldr1 :: (Element (Either a b) -> Element (Either a b) -> Element (Either a b)) -> Either a b -> Maybe (Element (Either a b)) # safeFoldl1 :: (Element (Either a b) -> Element (Either a b) -> Element (Either a b)) -> Either a b -> Maybe (Element (Either a b)) # | |
| (Read a, Read b) :=> (Read (Either a b)) | |
| (Show a, Show b) :=> (Show (Either a b)) | |
| (Eq a, Eq b) :=> (Eq (Either a b)) | |
| (Ord a, Ord b) :=> (Ord (Either a b)) | |
| (SDecide a, SDecide b) => TestCoercion (SEither :: Either a b -> Type) | |
Defined in Data.Singletons.Base.Instances | |
| (SDecide a, SDecide b) => TestEquality (SEither :: Either a b -> Type) | |
Defined in Data.Singletons.Base.Instances | |
| SingI (IsLeftSym0 :: TyFun (Either a b) Bool -> Type) | |
Defined in Data.Either.Singletons Methods sing :: Sing IsLeftSym0 # | |
| SingI (IsRightSym0 :: TyFun (Either a b) Bool -> Type) | |
Defined in Data.Either.Singletons Methods sing :: Sing IsRightSym0 # | |
| SingI (PartitionEithersSym0 :: TyFun [Either a b] ([a], [b]) -> Type) | |
Defined in Data.Either.Singletons | |
| SingI (LeftsSym0 :: TyFun [Either a b] [a] -> Type) | |
Defined in Data.Either.Singletons | |
| SingI (RightsSym0 :: TyFun [Either a b] [b] -> Type) | |
Defined in Data.Either.Singletons Methods sing :: Sing RightsSym0 # | |
| SingI (LeftSym0 :: TyFun a (Either a b) -> Type) | |
Defined in Data.Singletons.Base.Instances | |
| SingI (RightSym0 :: TyFun b (Either a b) -> Type) | |
Defined in Data.Singletons.Base.Instances | |
| SuppressUnusedWarnings (TFHelper_6989586621679584152Sym0 :: TyFun (Either a b) (Either a b ~> Either a b) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679181415Sym0 :: TyFun (Either a b) (Either a b ~> Ordering) -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679130594Sym0 :: TyFun (Either a b) (Either a b ~> Bool) -> Type) | |
Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (IsLeftSym0 :: TyFun (Either a b) Bool -> Type) | |
Defined in Data.Either.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (IsRightSym0 :: TyFun (Either a b) Bool -> Type) | |
Defined in Data.Either.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Null_6989586621680194155Sym0 :: TyFun (Either a1 a2) Bool -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Length_6989586621680194149Sym0 :: TyFun (Either a1 a2) Nat -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621680071774Sym0 :: TyFun Nat (Either a b ~> (Symbol ~> Symbol)) -> Type) | |
Defined in Text.Show.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (PartitionEithersSym0 :: TyFun [Either a b] ([a], [b]) -> Type) | |
Defined in Data.Either.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (LeftsSym0 :: TyFun [Either a b] [a] -> Type) | |
Defined in Data.Either.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (RightsSym0 :: TyFun [Either a b] [b] -> Type) | |
Defined in Data.Either.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (LeftSym0 :: TyFun a (Either a b) -> Type) | |
Defined in Data.Singletons.Base.Instances Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Pure_6989586621679357611Sym0 :: TyFun a (Either e a) -> Type) | |
Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (RightSym0 :: TyFun b (Either a b) -> Type) | |
Defined in Data.Singletons.Base.Instances Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679584161ASym0 :: TyFun k1 (Either a k1) -> Type) | |
Defined in Data.Semigroup.Singletons.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.Either.Singletons Methods sing :: Sing Either_Sym0 # | |
| SuppressUnusedWarnings (TFHelper_6989586621679584152Sym1 a6989586621679584157 :: TyFun (Either a b) (Either a b) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679181415Sym1 a6989586621679181420 :: TyFun (Either a b) Ordering -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621680071774Sym1 a6989586621680071784 :: TyFun (Either a b) (Symbol ~> Symbol) -> Type) | |
Defined in Text.Show.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679130594Sym1 a6989586621679130599 :: TyFun (Either a b) Bool -> Type) | |
Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679357621Sym0 :: TyFun (Either e (a ~> b)) (Either e a ~> Either e b) -> Type) | |
Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679357705Sym0 :: TyFun (Either e a) ((a ~> Either e b) ~> Either e b) -> Type) | |
Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Either_Sym0 :: TyFun (a ~> c) ((b ~> c) ~> (Either a b ~> c)) -> Type) | |
Defined in Data.Either.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr_6989586621680194135Sym0 :: TyFun (a1 ~> (b ~> b)) (b ~> (Either a2 a1 ~> b)) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Fmap_6989586621679357422Sym0 :: TyFun (a1 ~> b) (Either a2 a1 ~> Either a2 b) -> Type) | |
Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FoldMap_6989586621680194123Sym0 :: TyFun (a1 ~> m) (Either a2 a1 ~> m) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679357439Sym0 :: TyFun a1 (Either a2 b ~> Either a2 a1) -> Type) | |
Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SingI d => SingI (Either_Sym1 d :: TyFun (b ~> c) (Either a b ~> c) -> Type) | |
Defined in Data.Either.Singletons Methods sing :: Sing (Either_Sym1 d) # | |
| SuppressUnusedWarnings (Fmap_6989586621679357422Sym1 a6989586621679357427 :: TyFun (Either a2 a1) (Either a2 b) -> Type) | |
Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FoldMap_6989586621680194123Sym1 a6989586621680194128 :: TyFun (Either a2 a1) m -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679357439Sym1 a6989586621679357444 :: TyFun (Either a2 b) (Either a2 a1) -> Type) | |
Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679357621Sym1 a6989586621679357626 :: TyFun (Either e a) (Either e b) -> Type) | |
Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679357705Sym1 a6989586621679357710 :: TyFun (a ~> Either e b) (Either e b) -> Type) | |
Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Traverse_6989586621680478703Sym0 :: TyFun (a1 ~> f b) (Either a2 a1 ~> f (Either a2 b)) -> Type) | |
Defined in Data.Traversable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Either_Sym1 a6989586621679275170 :: TyFun (b ~> c) (Either a b ~> c) -> Type) | |
Defined in Data.Either.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr_6989586621680194135Sym1 a6989586621680194141 :: TyFun b (Either a2 a1 ~> b) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| (SingI d1, SingI d2) => SingI (Either_Sym2 d1 d2 :: TyFun (Either a b) c -> Type) | |
Defined in Data.Either.Singletons Methods sing :: Sing (Either_Sym2 d1 d2) # | |
| SuppressUnusedWarnings (Either_Sym2 a6989586621679275170 a6989586621679275171 :: TyFun (Either a b) c -> Type) | |
Defined in Data.Either.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr_6989586621680194135Sym2 a6989586621680194141 a6989586621680194142 :: TyFun (Either a2 a1) b -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Traverse_6989586621680478703Sym1 a6989586621680478708 :: TyFun (Either a2 a1) (f (Either a2 b)) -> Type) | |
Defined in Data.Traversable.Singletons Methods suppressUnusedWarnings :: () # | |
| (Functor f, Functor g) => Functor (Lift Either f g) | |
| type MapM (arg1 :: a1 ~> m b) (arg2 :: Either a2 a1) | |
| type Traverse (a3 :: a1 ~> f b) (a4 :: Either a2 a1) | |
| type LiftA2 (arg1 :: a ~> (b ~> c)) (arg2 :: Either e a) (arg3 :: Either e b) | |
| type Fmap (a3 :: a1 ~> b) (a4 :: Either a2 a1) | |
| type FoldMap (a3 :: a1 ~> k2) (a4 :: Either a2 a1) | |
| type Foldl (arg1 :: b ~> (a1 ~> b)) (arg2 :: b) (arg3 :: Either a2 a1) | |
| type Foldl' (arg1 :: b ~> (a1 ~> b)) (arg2 :: b) (arg3 :: Either a2 a1) | |
| type Foldr (a3 :: a1 ~> (k2 ~> k2)) (a4 :: k2) (a5 :: Either a2 a1) | |
| type Foldr' (arg1 :: a1 ~> (b ~> b)) (arg2 :: b) (arg3 :: Either a2 a1) | |
| type Pure (a :: k1) | |
| type Return (arg :: a) | |
| type Elem (arg1 :: a1) (arg2 :: Either a2 a1) | |
| type Foldl1 (arg1 :: a1 ~> (a1 ~> a1)) (arg2 :: Either a2 a1) | |
| type Foldr1 (arg1 :: a1 ~> (a1 ~> a1)) (arg2 :: Either a2 a1) | |
| type (a2 :: k1) <$ (a3 :: Either a1 b) | |
| type Apply (ShowsPrec_6989586621680071774Sym0 :: TyFun Nat (Either a b ~> (Symbol ~> Symbol)) -> Type) (a6989586621680071784 :: Nat) | |
| type Apply (LeftSym0 :: TyFun a (Either a b) -> Type) (a6989586621679028344 :: a) | |
| type Apply (Pure_6989586621679357611Sym0 :: TyFun a (Either e a) -> Type) (a6989586621679357617 :: a) | |
| type Apply (RightSym0 :: TyFun b (Either a b) -> Type) (a6989586621679028346 :: b) | |
| type Apply (Let6989586621679584161ASym0 :: TyFun k1 (Either a k1) -> Type) (wild_69895866216795838256989586621679584160 :: k1) | |
| type Apply (TFHelper_6989586621679357439Sym0 :: TyFun a1 (Either a2 b ~> Either a2 a1) -> Type) (a6989586621679357444 :: a1) | |
| type Apply (Foldr_6989586621680194135Sym1 a6989586621680194141 :: TyFun b (Either a2 a1 ~> b) -> Type) (a6989586621680194142 :: b) | |
| type Eval (FoldMap f ('Left _a :: Either a3 a1) :: a2 -> Type) | |
| type Eval (FoldMap f ('Right x :: Either a3 a1) :: a2 -> Type) | |
| type Eval (Foldr f y ('Left _a :: Either a3 a1) :: a2 -> Type) | |
| type Eval (Foldr f y ('Right x :: Either a3 a1) :: a2 -> Type) | |
| type Failure (Either a) | |
Defined in Basement.Monad | |
| type Fold (arg :: Either a m) | |
| type Length (a3 :: Either a1 a2) | |
| type Maximum (arg :: Either a1 a2) | |
| type Minimum (arg :: Either a1 a2) | |
| type Null (a3 :: Either a1 a2) | |
| type Product (arg :: Either a1 a2) | |
| type Sum (arg :: Either a1 a2) | |
| type ToList (arg :: Either a1 a2) | |
| type Sequence (arg :: Either a1 (m a2)) | |
| type SequenceA (arg :: Either a1 (f a2)) | |
| type (arg1 :: Either e a) *> (arg2 :: Either e b) | |
| type (arg1 :: Either e a) <* (arg2 :: Either e b) | |
| type (a2 :: Either e (a1 ~> b)) <*> (a3 :: Either e a1) | |
| type (arg1 :: Either e a) >> (arg2 :: Either e b) | |
| type (a2 :: Either e a1) >>= (a3 :: a1 ~> Either e b) | |
| type Rep1 (Either a :: Type -> Type) | Since: base-4.6.0.0 |
Defined in GHC.Generics type Rep1 (Either a :: Type -> Type) = D1 ('MetaData "Either" "Data.Either" "base" 'False) (C1 ('MetaCons "Left" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a)) :+: C1 ('MetaCons "Right" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1)) | |
| type HKD (Either a :: Type -> Type) (b :: Type) | |
| type Apply (LeftsSym0 :: TyFun [Either a b] [a] -> Type) (a6989586621679277123 :: [Either a b]) | |
| type Apply (RightsSym0 :: TyFun [Either a b] [b] -> Type) (a6989586621679277117 :: [Either a b]) | |
Defined in Data.Either.Singletons | |
| type Apply (PartitionEithersSym0 :: TyFun [Either a b] ([a], [b]) -> Type) (a6989586621679277100 :: [Either a b]) | |
Defined in Data.Either.Singletons | |
| type Rep (Either a b) | Since: base-4.6.0.0 |
Defined in GHC.Generics type Rep (Either a b) = D1 ('MetaData "Either" "Data.Either" "base" 'False) (C1 ('MetaCons "Left" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a)) :+: C1 ('MetaCons "Right" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 b))) | |
| type AsRPC (Either l r) | |
| type TypeDocFieldDescriptions (Either l r) | |
Defined in Morley.Michelson.Typed.Haskell.Doc | |
| type ToT (Either l r) | |
Defined in Morley.Michelson.Typed.Haskell.Value | |
| type Demote (Either a b) | |
| type Sing | |
Defined in Data.Singletons.Base.Instances | |
| type Element (Either a b) | |
Defined in Universum.Container.Class | |
| type Sconcat (arg :: NonEmpty (Either a b)) | |
| type Show_ (arg :: Either a b) | |
| type (arg1 :: Either a b) /= (arg2 :: Either a b) | |
| type (a2 :: Either a1 b) == (a3 :: Either a1 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 Max (arg1 :: Either a b) (arg2 :: Either a b) | |
| type Min (arg1 :: Either a b) (arg2 :: Either a b) | |
| type (a2 :: Either a1 b) <> (a3 :: Either a1 b) | |
| type ShowList (arg1 :: [Either a b]) arg2 | |
| type ShowsPrec a2 (a3 :: Either a1 b) a4 | |
| type Apply (IsLeftSym0 :: TyFun (Either a b) Bool -> Type) (a6989586621679277095 :: Either a b) | |
Defined in Data.Either.Singletons | |
| type Apply (IsRightSym0 :: TyFun (Either a b) Bool -> Type) (a6989586621679277092 :: Either a b) | |
Defined in Data.Either.Singletons | |
| type Apply (Null_6989586621680194155Sym0 :: TyFun (Either a1 a2) Bool -> Type) (a6989586621680194161 :: Either a1 a2) | |
| type Apply (Length_6989586621680194149Sym0 :: TyFun (Either a1 a2) Nat -> Type) (a6989586621680194153 :: Either a1 a2) | |
| type Apply (Compare_6989586621679181415Sym1 a6989586621679181420 :: TyFun (Either a b) Ordering -> Type) (a6989586621679181421 :: Either a b) | |
| type Apply (TFHelper_6989586621679130594Sym1 a6989586621679130599 :: TyFun (Either a b) Bool -> Type) (a6989586621679130600 :: Either a b) | |
| type Apply (FoldMap_6989586621680194123Sym1 a6989586621680194128 :: TyFun (Either a2 a1) m -> Type) (a6989586621680194129 :: Either a2 a1) | |
| type Apply (Either_Sym2 a6989586621679275170 a6989586621679275171 :: TyFun (Either a b) c -> Type) (a6989586621679275172 :: Either a b) | |
Defined in Data.Either.Singletons | |
| type Apply (Foldr_6989586621680194135Sym2 a6989586621680194141 a6989586621680194142 :: TyFun (Either a2 a1) b -> Type) (a6989586621680194143 :: Either a2 a1) | |
| type Apply (Traverse_6989586621680478703Sym1 a6989586621680478708 :: TyFun (Either a2 a1) (f (Either a2 b)) -> Type) (a6989586621680478709 :: Either a2 a1) | |
| type Apply (TFHelper_6989586621679584152Sym0 :: TyFun (Either a b) (Either a b ~> Either a b) -> Type) (a6989586621679584157 :: Either a b) | |
| type Apply (Compare_6989586621679181415Sym0 :: TyFun (Either a b) (Either a b ~> Ordering) -> Type) (a6989586621679181420 :: Either a b) | |
| type Apply (TFHelper_6989586621679130594Sym0 :: TyFun (Either a b) (Either a b ~> Bool) -> Type) (a6989586621679130599 :: Either a b) | |
| type Apply (TFHelper_6989586621679584152Sym1 a6989586621679584157 :: TyFun (Either a b) (Either a b) -> Type) (a6989586621679584158 :: Either a b) | |
| type Apply (ShowsPrec_6989586621680071774Sym1 a6989586621680071784 :: TyFun (Either a b) (Symbol ~> Symbol) -> Type) (a6989586621680071785 :: Either a b) | |
| type Apply (TFHelper_6989586621679357621Sym0 :: TyFun (Either e (a ~> b)) (Either e a ~> Either e b) -> Type) (a6989586621679357626 :: Either e (a ~> b)) | |
| type Apply (TFHelper_6989586621679357705Sym0 :: TyFun (Either e a) ((a ~> Either e b) ~> Either e b) -> Type) (a6989586621679357710 :: Either e a) | |
| type Apply (Either_Sym0 :: TyFun (a ~> c) ((b ~> c) ~> (Either a b ~> c)) -> Type) (a6989586621679275170 :: a ~> c) | |
| type Apply (Foldr_6989586621680194135Sym0 :: TyFun (a1 ~> (b ~> b)) (b ~> (Either a2 a1 ~> b)) -> Type) (a6989586621680194141 :: a1 ~> (b ~> b)) | |
| type Apply (Fmap_6989586621679357422Sym0 :: TyFun (a1 ~> b) (Either a2 a1 ~> Either a2 b) -> Type) (a6989586621679357427 :: a1 ~> b) | |
| type Apply (FoldMap_6989586621680194123Sym0 :: TyFun (a1 ~> m) (Either a2 a1 ~> m) -> Type) (a6989586621680194128 :: a1 ~> m) | |
| type Apply (Fmap_6989586621679357422Sym1 a6989586621679357427 :: TyFun (Either a2 a1) (Either a2 b) -> Type) (a6989586621679357428 :: Either a2 a1) | |
| type Apply (TFHelper_6989586621679357439Sym1 a6989586621679357444 :: TyFun (Either a2 b) (Either a2 a1) -> Type) (a6989586621679357445 :: Either a2 b) | |
| type Apply (TFHelper_6989586621679357621Sym1 a6989586621679357626 :: TyFun (Either e a) (Either e b) -> Type) (a6989586621679357627 :: Either e a) | |
| type Apply (TFHelper_6989586621679357705Sym1 a6989586621679357710 :: TyFun (a ~> Either e b) (Either e b) -> Type) (a6989586621679357711 :: a ~> Either e b) | |
| type Apply (Traverse_6989586621680478703Sym0 :: TyFun (a1 ~> f b) (Either a2 a1 ~> f (Either a2 b)) -> Type) (a6989586621680478708 :: a1 ~> f b) | |
| type Apply (Either_Sym1 a6989586621679275170 :: TyFun (b ~> c) (Either a b ~> c) -> Type) (a6989586621679275171 :: b ~> c) | |
Defined in Data.Either.Singletons type Apply (Either_Sym1 a6989586621679275170 :: TyFun (b ~> c) (Either a b ~> c) -> Type) (a6989586621679275171 :: b ~> c) = Either_Sym2 a6989586621679275170 a6989586621679275171 | |
| type Eval (Map f ('Left x :: Either a2 a1) :: Either a2 b -> Type) | |
| type Eval (Map f ('Right a3 :: 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
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
byteSwap16 :: Word16 -> Word16 #
Reverse order of bytes in Word16.
Since: base-4.7.0.0
byteSwap32 :: Word32 -> Word32 #
Reverse order of bytes in Word32.
Since: base-4.7.0.0
byteSwap64 :: Word64 -> Word64 #
Reverse order of bytes in Word64.
Since: base-4.7.0.0
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 | |
| NFData (MVar a) | NOTE: Only strict in the reference and not the referenced value. Since: deepseq-1.4.2.0 |
Defined in Control.DeepSeq | |
| Eq (MVar a) | Since: base-4.1.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
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
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 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 |
| Hashable1 Set | Since: hashable-1.3.4.0 |
Defined in Data.Hashable.Class | |
| (NiceComparable a, NiceComparable b) => LorentzFunctor Set a b | |
Defined in Lorentz.Instr | |
| Structured k => Structured (Set k) | |
Defined in Distribution.Utils.Structured | |
| (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 => Monoid (Set a) | |
| Ord a => Semigroup (Set a) | Since: containers-0.5.7 |
| Ord a => IsList (Set a) | Since: containers-0.5.6.2 |
| (Read a, Ord a) => Read (Set a) | |
| Show a => Show (Set a) | |
| NFData a => NFData (Set a) | |
Defined in Data.Set.Internal | |
| Eq a => Eq (Set a) | |
| Ord a => Ord (Set a) | |
| Hashable v => Hashable (Set v) | Since: hashable-1.3.4.0 |
Defined in Data.Hashable.Class | |
| Ord k => At (Set k) | |
| Ord a => Contains (Set a) | |
| Ord k => Ixed (Set k) | |
Defined in Control.Lens.At | |
| Ord a => Wrapped (Set a) | |
| KnownIsoT v => HasAnnotation (Set v) | |
Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (Set v)) # | |
| NiceComparable e => IterOpHs (Set e) | |
Defined in Lorentz.Polymorphic Associated Types type IterOpElHs (Set e) # | |
| NiceComparable e => MemOpHs (Set e) | |
Defined in Lorentz.Polymorphic Associated Types type MemOpKeyHs (Set e) # | |
| SizeOpHs (Set a) | |
Defined in Lorentz.Polymorphic | |
| NiceComparable a => UpdOpHs (Set a) | |
Defined in Lorentz.Polymorphic | |
| HasRPCRepr (Set a) | |
Defined in Morley.AsRPC | |
| PolyCTypeHasDocC '[a] => TypeHasDoc (Set a) | |
Defined in Morley.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) # | |
| (Comparable (ToT c), Ord c, IsoValue c) => IsoValue (Set c) | |
| (Ord a, Monoid a) => Semiring (Set a) | The multiplication laws are satisfied for
any underlying |
| 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 # 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 # 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)) # safeHead :: Set v -> Maybe (Element (Set v)) # safeMaximum :: Set v -> Maybe (Element (Set v)) # safeMinimum :: Set v -> Maybe (Element (Set v)) # safeFoldr1 :: (Element (Set v) -> Element (Set v) -> Element (Set v)) -> Set v -> Maybe (Element (Set v)) # safeFoldl1 :: (Element (Set v) -> Element (Set v) -> Element (Set v)) -> Set v -> Maybe (Element (Set v)) # | |
| Ord a => FromList (Set a) | |
Defined in Universum.Container.Class Methods fromList :: [ListElement (Set a)] -> Set a # | |
| One (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) | |
| (NiceComparable key, Ord key, Dupable key) => StoreHasSubmap (Set key) SelfRef key () | |
Defined in Lorentz.StoreClass Methods storeSubmapOps :: StoreSubmapOps (Set key) SelfRef key () # | |
| 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 IterOpElHs (Set e) | |
Defined in Lorentz.Polymorphic | |
| type MemOpKeyHs (Set e) | |
Defined in Lorentz.Polymorphic | |
| type UpdOpKeyHs (Set a) | |
Defined in Lorentz.Polymorphic | |
| type UpdOpParamsHs (Set a) | |
Defined in Lorentz.Polymorphic | |
| type AsRPC (Set a) | |
Defined in Morley.AsRPC | |
| type TypeDocFieldDescriptions (Set a) | |
Defined in Morley.Michelson.Typed.Haskell.Doc | |
| type ToT (Set c) | |
Defined in Morley.Michelson.Typed.Haskell.Value | |
| type Element (Set v) | |
Defined in Universum.Container.Class | |
| type FromListC (Set a) | |
Defined in Universum.Container.Class | |
| type ListElement (Set a) | |
Defined in Universum.Container.Class | |
| type OneItem (Set 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
| Bifoldable Map | Since: containers-0.6.3.1 |
| 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 |
| Hashable2 Map | Since: hashable-1.3.4.0 |
Defined in Data.Hashable.Class | |
| 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 v e (s :: [Type]). (IsoValue (Map k v), NiceComparable k, NiceConstant e, Dupable k, KnownValue v) => (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) # | |
| 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 # | |
| 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 |
| Traversable (Map k) | Traverses in order of increasing key. |
| Functor (Map k) | |
| Hashable k => Hashable1 (Map k) | Since: hashable-1.3.4.0 |
Defined in Data.Hashable.Class | |
| NiceComparable k => LorentzFunctor (Map k) a b | |
Defined in Lorentz.Instr | |
| (CanCastTo k1 k2, CanCastTo v1 v2) => CanCastTo (Map k1 v1 :: Type) (Map k2 v2 :: Type) | |
| (Structured k, Structured v) => Structured (Map k v) | |
Defined in Distribution.Utils.Structured | |
| (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 => Monoid (Map k v) | |
| Ord k => Semigroup (Map k v) | |
| Ord k => IsList (Map k v) | Since: containers-0.5.6.2 |
| (Ord k, Read k, Read e) => Read (Map k e) | |
| (Show k, Show a) => Show (Map k a) | |
| (NFData k, NFData a) => NFData (Map k a) | |
Defined in Data.Map.Internal | |
| (Eq k, Eq a) => Eq (Map k a) | |
| (Ord k, Ord v) => Ord (Map k v) | |
| (Hashable k, Hashable v) => Hashable (Map k v) | Since: hashable-1.3.4.0 |
Defined in Data.Hashable.Class | |
| Ord k => At (Map k a) | |
| Ord k => Ixed (Map k a) | |
Defined in Control.Lens.At | |
| Ord k => Wrapped (Map k a) | |
| (HasAnnotation k, HasAnnotation v) => HasAnnotation (Map k v) | |
Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (Map k v)) # | |
| NiceComparable k => GetOpHs (Map k v) | |
Defined in Lorentz.Polymorphic | |
| NiceComparable k => IterOpHs (Map k v) | |
Defined in Lorentz.Polymorphic Associated Types type IterOpElHs (Map k v) # | |
| NiceComparable k => MapOpHs (Map k v) | |
Defined in Lorentz.Polymorphic | |
| NiceComparable k => MemOpHs (Map k v) | |
Defined in Lorentz.Polymorphic Associated Types type MemOpKeyHs (Map k v) # | |
| SizeOpHs (Map k v) | |
Defined in Lorentz.Polymorphic | |
| NiceComparable k => UpdOpHs (Map k v) | |
Defined in Lorentz.Polymorphic | |
| HasRPCRepr v => HasRPCRepr (Map k v) | |
Defined in Morley.AsRPC | |
| (PolyCTypeHasDocC '[k], PolyTypeHasDocC '[v], Ord k) => TypeHasDoc (Map k v) | |
Defined in Morley.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) # | |
| (Comparable (ToT k), Ord k, IsoValue k, IsoValue v) => IsoValue (Map k v) | |
| ToBigMap (Map k v) | |
Defined in Morley.Michelson.Typed.Haskell.Value Methods mkBigMap :: Map k v -> BigMap (ToBigMapKey (Map k v)) (ToBigMapValue (Map k v)) # | |
| (Ord k, Monoid k, Semiring v) => Semiring (Map k v) | The multiplication laws are satisfied for
any underlying |
| 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 # 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 # 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)) # safeHead :: Map k v -> Maybe (Element (Map k v)) # safeMaximum :: Map k v -> Maybe (Element (Map k v)) # safeMinimum :: Map k v -> Maybe (Element (Map k v)) # safeFoldr1 :: (Element (Map k v) -> Element (Map k v) -> Element (Map k v)) -> Map k v -> Maybe (Element (Map k v)) # safeFoldl1 :: (Element (Map k v) -> Element (Map k v) -> Element (Map k v)) -> Map k v -> Maybe (Element (Map k v)) # | |
| Ord k => FromList (Map k v) | |
Defined in Universum.Container.Class Methods fromList :: [ListElement (Map k v)] -> Map k v # | |
| One (Map k v) | |
| ToPairs (Map k v) | |
| (t ~ Map k' a', Ord k) => Rewrapped (Map k a) t | Use |
Defined in Control.Lens.Wrapped | |
| (NiceComparable key, KnownValue value) => StoreHasSubmap (Map key value) SelfRef key value | |
Defined in Lorentz.StoreClass Methods storeSubmapOps :: StoreSubmapOps (Map key value) SelfRef 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 GetOpKeyHs (Map k v) | |
Defined in Lorentz.Polymorphic | |
| type GetOpValHs (Map k v) | |
Defined in Lorentz.Polymorphic | |
| type IterOpElHs (Map k v) | |
Defined in Lorentz.Polymorphic | |
| type MapOpInpHs (Map k v) | |
Defined in Lorentz.Polymorphic | |
| type MapOpResHs (Map k v) | |
Defined in Lorentz.Polymorphic | |
| type MemOpKeyHs (Map k v) | |
Defined in Lorentz.Polymorphic | |
| type UpdOpKeyHs (Map k v) | |
Defined in Lorentz.Polymorphic | |
| type UpdOpParamsHs (Map k v) | |
Defined in Lorentz.Polymorphic | |
| type AsRPC (Map k v) | |
Defined in Morley.AsRPC | |
| type TypeDocFieldDescriptions (Map k v) | |
Defined in Morley.Michelson.Typed.Haskell.Doc | |
| type ToBigMapKey (Map k v) | |
Defined in Morley.Michelson.Typed.Haskell.Value | |
| type ToBigMapValue (Map k v) | |
Defined in Morley.Michelson.Typed.Haskell.Value | |
| type ToT (Map k v) | |
| type Element (Map k v) | |
Defined in Universum.Container.Class | |
| type FromListC (Map k v) | |
Defined in Universum.Container.Class | |
| type Key (Map k v) | |
Defined in Universum.Container.Class | |
| type ListElement (Map k v) | |
Defined in Universum.Container.Class | |
| type OneItem (Map k v) | |
Defined in Universum.Container.Class | |
| type Val (Map k v) | |
Defined in Universum.Container.Class | |
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
| Exception SomeException | Since: base-3.0 |
Defined in GHC.Exception.Type Methods toException :: SomeException -> SomeException # fromException :: SomeException -> Maybe SomeException # displayException :: SomeException -> String # | |
| Show SomeException | Since: base-3.0 |
Defined in GHC.Exception.Type Methods showsPrec :: Int -> SomeException -> ShowS # show :: SomeException -> String # showList :: [SomeException] -> ShowS # | |
(=<<) :: Monad m => (a -> m b) -> m a -> m b infixr 1 #
Same as >>=, but with the arguments interchanged.
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]
flip :: (a -> b -> c) -> b -> a -> c #
flip ff.
>>>flip (++) "hello" "world""worldhello"
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
when :: Applicative f => Bool -> f () -> f () #
Conditional execution of Applicative expressions. For example,
when debug (putStrLn "Debugging")
will output the string Debugging if the Boolean value debug
is True, and otherwise do nothing.
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:
Methods
The identity of <|>
(<|>) :: f a -> f a -> f a infixl 3 #
An associative binary operation
One or more.
Zero or more.
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
Non-empty (and non-strict) list type.
Since: base-4.9.0.0
Constructors
| a :| [a] infixr 5 |
Instances
| 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 |
| Applicative NonEmpty | Since: base-4.9.0.0 |
| Functor NonEmpty | Since: base-4.9.0.0 |
| Monad NonEmpty | Since: base-4.9.0.0 |
| NFData1 NonEmpty | Since: deepseq-1.4.3.0 |
Defined in Control.DeepSeq | |
| Hashable1 NonEmpty | Since: hashable-1.3.1.0 |
Defined in Data.Hashable.Class | |
| PApplicative NonEmpty | |
| PFunctor NonEmpty | |
Defined in Control.Monad.Singletons.Internal | |
| PMonad NonEmpty | |
| SApplicative NonEmpty | |
Defined in Control.Monad.Singletons.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) # | |
| SFunctor NonEmpty | |
| SMonad NonEmpty | |
Defined in Control.Monad.Singletons.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) # | |
| PFoldable NonEmpty | |
| SFoldable NonEmpty | |
Defined in Data.Foldable.Singletons Methods sFold :: forall m (t1 :: NonEmpty m). SMonoid m => Sing t1 -> Sing (Apply FoldSym0 t1) # 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 (t1 :: NonEmpty a). Sing t1 -> Sing (Apply ToListSym0 t1) # sNull :: forall a (t1 :: NonEmpty a). Sing t1 -> Sing (Apply NullSym0 t1) # sLength :: forall a (t1 :: NonEmpty a). Sing t1 -> Sing (Apply LengthSym0 t1) # sElem :: forall a (t1 :: a) (t2 :: NonEmpty a). SEq a => Sing t1 -> Sing t2 -> Sing (Apply (Apply ElemSym0 t1) t2) # sMaximum :: forall a (t1 :: NonEmpty a). SOrd a => Sing t1 -> Sing (Apply MaximumSym0 t1) # sMinimum :: forall a (t1 :: NonEmpty a). SOrd a => Sing t1 -> Sing (Apply MinimumSym0 t1) # sSum :: forall a (t1 :: NonEmpty a). SNum a => Sing t1 -> Sing (Apply SumSym0 t1) # sProduct :: forall a (t1 :: NonEmpty a). SNum a => Sing t1 -> Sing (Apply ProductSym0 t1) # | |
| PTraversable NonEmpty | |
| STraversable NonEmpty | |
Defined in Data.Traversable.Singletons 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 (t1 :: NonEmpty (f a)). SApplicative f => Sing t1 -> Sing (Apply SequenceASym0 t1) # 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 (t1 :: NonEmpty (m a)). SMonad m => Sing t1 -> Sing (Apply SequenceSym0 t1) # | |
| Lift a => Lift (NonEmpty a :: Type) | Since: template-haskell-2.15.0.0 |
| Structured a => Structured (NonEmpty a) | |
Defined in Distribution.Utils.Structured | |
| Semigroup (NonEmpty a) | Since: base-4.9.0.0 |
| IsList (NonEmpty a) | Since: base-4.9.0.0 |
| Generic (NonEmpty a) | |
| Read a => Read (NonEmpty a) | Since: base-4.11.0.0 |
| Show a => Show (NonEmpty a) | Since: base-4.11.0.0 |
| NFData a => NFData (NonEmpty a) | Since: deepseq-1.4.2.0 |
Defined in Control.DeepSeq | |
| Eq a => Eq (NonEmpty a) | Since: base-4.9.0.0 |
| Ord a => Ord (NonEmpty a) | Since: base-4.9.0.0 |
| Hashable a => Hashable (NonEmpty a) | |
Defined in Data.Hashable.Class | |
| Ixed (NonEmpty a) | |
Defined in Control.Lens.At | |
| Wrapped (NonEmpty a) | |
| Ixed (NonEmpty a) | |
Defined in Lens.Micro.Internal | |
| Ord k => ToBigMap (NonEmpty (k, v)) | |
Defined in Morley.Michelson.Typed.Haskell.Value Methods mkBigMap :: NonEmpty (k, v) -> BigMap (ToBigMapKey (NonEmpty (k, v))) (ToBigMapValue (NonEmpty (k, v))) # | |
| PEq (NonEmpty a) | |
| (SEq a, SEq [a]) => SEq (NonEmpty a) | |
| POrd (NonEmpty a) | |
| (SOrd a, SOrd [a]) => SOrd (NonEmpty a) | |
Defined in Data.Ord.Singletons 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) # | |
| PSemigroup (NonEmpty a) | |
Defined in Data.Semigroup.Singletons.Internal | |
| SSemigroup (NonEmpty a) | |
| PShow (NonEmpty a) | |
| (SShow a, SShow [a]) => SShow (NonEmpty a) | |
Defined in Text.Show.Singletons 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) # | |
| 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 # 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 # 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)) # safeHead :: NonEmpty a -> Maybe (Element (NonEmpty a)) # safeMaximum :: NonEmpty a -> Maybe (Element (NonEmpty a)) # safeMinimum :: NonEmpty a -> Maybe (Element (NonEmpty a)) # safeFoldr1 :: (Element (NonEmpty a) -> Element (NonEmpty a) -> Element (NonEmpty a)) -> NonEmpty a -> Maybe (Element (NonEmpty a)) # safeFoldl1 :: (Element (NonEmpty a) -> Element (NonEmpty a) -> Element (NonEmpty a)) -> NonEmpty a -> Maybe (Element (NonEmpty a)) # | |
| FromList (NonEmpty a) | |
Defined in Universum.Container.Class Methods fromList :: [ListElement (NonEmpty a)] -> NonEmpty a # | |
| One (NonEmpty a) | |
| ToPairs (NonEmpty (k, v)) | |
Defined in Universum.Container.Class | |
| Generic1 NonEmpty | |
| 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.Base.Instances | |
| (SDecide a, SDecide [a]) => TestEquality (SNonEmpty :: NonEmpty a -> Type) | |
Defined in Data.Singletons.Base.Instances | |
| Each (NonEmpty a) (NonEmpty b) a b | |
| SuppressUnusedWarnings Sconcat_6989586621679584058Sym0 | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SSemigroup a => SingI (SconcatSym0 :: TyFun (NonEmpty a) a -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods sing :: Sing SconcatSym0 # | |
| SingI ((:|@#@$) :: TyFun a ([a] ~> NonEmpty a) -> Type) | |
Defined in Data.Singletons.Base.Instances | |
| SuppressUnusedWarnings (TFHelper_6989586621679584022Sym0 :: TyFun (NonEmpty a) (NonEmpty a ~> NonEmpty a) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679181443Sym0 :: TyFun (NonEmpty a) (NonEmpty a ~> Ordering) -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679130622Sym0 :: TyFun (NonEmpty a) (NonEmpty a ~> Bool) -> Type) | |
Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ToList_6989586621680194114Sym0 :: TyFun (NonEmpty a) [a] -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (SconcatSym0 :: TyFun (NonEmpty a) a -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Sconcat_6989586621679583990Sym0 :: TyFun (NonEmpty a) a -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Fold_6989586621680194106Sym0 :: TyFun (NonEmpty m) m -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldl1_6989586621680194063Sym0 :: TyFun (a ~> (a ~> a)) (NonEmpty a ~> a) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr1_6989586621680194075Sym0 :: TyFun (a ~> (a ~> a)) (NonEmpty a ~> a) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621680071810Sym0 :: TyFun Nat (NonEmpty a ~> (Symbol ~> Symbol)) -> Type) | |
Defined in Text.Show.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Pure_6989586621679357507Sym0 :: TyFun a (NonEmpty a) -> Type) | |
Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings ((:|@#@$) :: TyFun a ([a] ~> NonEmpty a) -> Type) | |
Defined in Data.Singletons.Base.Instances Methods suppressUnusedWarnings :: () # | |
| SingI d => SingI ((:|@#@$$) d :: TyFun [a] (NonEmpty a) -> Type) | |
Defined in Data.Singletons.Base.Instances | |
| SuppressUnusedWarnings (Sconcat_6989586621680163618Sym0 :: TyFun (NonEmpty (Proxy s)) (Proxy s) -> Type) | |
Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679357515Sym0 :: TyFun (NonEmpty (a ~> b)) (NonEmpty a ~> NonEmpty b) -> Type) | |
Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679584022Sym1 a6989586621679584027 :: TyFun (NonEmpty a) (NonEmpty a) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679181443Sym1 a6989586621679181448 :: TyFun (NonEmpty a) Ordering -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679357659Sym0 :: TyFun (NonEmpty a) ((a ~> NonEmpty b) ~> NonEmpty b) -> Type) | |
Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621680071810Sym1 a6989586621680071818 :: TyFun (NonEmpty a) (Symbol ~> Symbol) -> Type) | |
Defined in Text.Show.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679130622Sym1 a6989586621679130627 :: TyFun (NonEmpty a) Bool -> Type) | |
Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldl1_6989586621680194063Sym1 a6989586621680194068 :: TyFun (NonEmpty a) a -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr1_6989586621680194075Sym1 a6989586621680194080 :: TyFun (NonEmpty a) a -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr_6989586621680194032Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (NonEmpty a ~> b)) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Fmap_6989586621679357364Sym0 :: TyFun (a ~> b) (NonEmpty a ~> NonEmpty b) -> Type) | |
Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FoldMap_6989586621680194095Sym0 :: TyFun (a ~> m) (NonEmpty a ~> m) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldl_6989586621680194048Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (NonEmpty a ~> b)) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings ((:|@#@$$) a6989586621679028369 :: TyFun [a] (NonEmpty a) -> Type) | |
Defined in Data.Singletons.Base.Instances Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679357376Sym0 :: TyFun a (NonEmpty b ~> NonEmpty a) -> Type) | |
Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Fmap_6989586621679357364Sym1 a6989586621679357369 :: TyFun (NonEmpty a) (NonEmpty b) -> Type) | |
Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679357515Sym1 a6989586621679357524 :: TyFun (NonEmpty a) (NonEmpty b) -> Type) | |
Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FoldMap_6989586621680194095Sym1 a6989586621680194100 :: TyFun (NonEmpty a) m -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679357376Sym1 a6989586621679357381 :: TyFun (NonEmpty b) (NonEmpty a) -> Type) | |
Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679357659Sym1 a6989586621679357664 :: TyFun (a ~> NonEmpty b) (NonEmpty b) -> Type) | |
Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (LiftA2_6989586621679357531Sym0 :: TyFun (a ~> (b ~> c)) (NonEmpty a ~> (NonEmpty b ~> NonEmpty c)) -> Type) | |
Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Traverse_6989586621680478691Sym0 :: TyFun (a ~> f b) (NonEmpty a ~> f (NonEmpty b)) -> Type) | |
Defined in Data.Traversable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldl_6989586621680194048Sym1 a6989586621680194054 :: TyFun b (NonEmpty a ~> b) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr_6989586621680194032Sym1 a6989586621680194038 :: TyFun b (NonEmpty a ~> b) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679357669Bs'Sym0 :: TyFun k (TyFun [a] (TyFun (a ~> NonEmpty b) [b] -> Type) -> Type) -> Type) | |
Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679357669BsSym0 :: TyFun k1 (TyFun k (TyFun (k1 ~> NonEmpty a) [a] -> Type) -> Type) -> Type) | |
Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679357669BSym0 :: TyFun k1 (TyFun k2 (TyFun (k1 ~> NonEmpty k3) k3 -> Type) -> Type) -> Type) | |
Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (LiftA2_6989586621679357531Sym1 a6989586621679357543 :: TyFun (NonEmpty a) (NonEmpty b ~> NonEmpty c) -> Type) | |
Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldl_6989586621680194048Sym2 a6989586621680194054 a6989586621680194055 :: TyFun (NonEmpty a) b -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr_6989586621680194032Sym2 a6989586621680194038 a6989586621680194039 :: TyFun (NonEmpty a) b -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Traverse_6989586621680478691Sym1 a6989586621680478696 :: TyFun (NonEmpty a) (f (NonEmpty b)) -> Type) | |
Defined in Data.Traversable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679357669Bs'Sym1 a6989586621679357666 :: TyFun [a] (TyFun (a ~> NonEmpty b) [b] -> Type) -> Type) | |
Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679357669BsSym1 a6989586621679357666 :: TyFun k (TyFun (k1 ~> NonEmpty a) [a] -> Type) -> Type) | |
Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679357669ToListSym0 :: TyFun k1 (TyFun k2 (TyFun k3 (TyFun (NonEmpty k4) [k4] -> Type) -> Type) -> Type) -> Type) | |
Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679357669BSym1 a6989586621679357666 :: TyFun k2 (TyFun (k1 ~> NonEmpty k3) k3 -> Type) -> Type) | |
Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (LiftA2_6989586621679357531Sym2 a6989586621679357543 a6989586621679357544 :: TyFun (NonEmpty b) (NonEmpty c) -> Type) | |
Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679357669Bs'Sym2 a6989586621679357666 as6989586621679357667 :: TyFun (a ~> NonEmpty b) [b] -> Type) | |
Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679357669BsSym2 a6989586621679357666 as6989586621679357667 :: TyFun (k1 ~> NonEmpty a) [a] -> Type) | |
Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679357669BSym2 a6989586621679357666 as6989586621679357667 :: TyFun (k1 ~> NonEmpty k3) k3 -> Type) | |
Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679357669ToListSym1 a6989586621679357666 :: TyFun k2 (TyFun k3 (TyFun (NonEmpty k4) [k4] -> Type) -> Type) -> Type) | |
Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679357669ToListSym2 a6989586621679357666 as6989586621679357667 :: TyFun k3 (TyFun (NonEmpty k4) [k4] -> Type) -> Type) | |
Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679357669ToListSym3 a6989586621679357666 as6989586621679357667 f6989586621679357668 :: TyFun (NonEmpty k4) [k4] -> Type) | |
Defined in Control.Monad.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| type Pure (a :: k1) | |
| type Return (arg :: a) | |
| type Fold (a :: NonEmpty k2) | |
| type Length (arg :: NonEmpty a) | |
| type Maximum (arg :: NonEmpty a) | |
| type Minimum (arg :: NonEmpty a) | |
| type Null (arg :: NonEmpty a) | |
| type Product (arg :: NonEmpty a) | |
| type Sum (arg :: NonEmpty a) | |
| type ToList (a2 :: NonEmpty a1) | |
| type Elem (arg1 :: a) (arg2 :: NonEmpty a) | |
| type Foldl1 (a1 :: k2 ~> (k2 ~> k2)) (a2 :: NonEmpty k2) | |
| type Foldr1 (a1 :: k2 ~> (k2 ~> k2)) (a2 :: NonEmpty k2) | |
| type Sequence (arg :: NonEmpty (m a)) | |
| type SequenceA (arg :: NonEmpty (f a)) | |
| type (arg1 :: NonEmpty a) *> (arg2 :: NonEmpty b) | |
| type (a1 :: k1) <$ (a2 :: NonEmpty b) | |
| type (arg1 :: NonEmpty a) <* (arg2 :: NonEmpty b) | |
| type (a2 :: NonEmpty (a1 ~> b)) <*> (a3 :: NonEmpty a1) | |
| type (arg1 :: NonEmpty a) >> (arg2 :: NonEmpty b) | |
| type (a2 :: NonEmpty a1) >>= (a3 :: a1 ~> NonEmpty b) | |
| type Fmap (a2 :: a1 ~> b) (a3 :: NonEmpty a1) | |
| type FoldMap (a2 :: a1 ~> k2) (a3 :: NonEmpty a1) | |
| type Foldl (a2 :: k2 ~> (a1 ~> k2)) (a3 :: k2) (a4 :: NonEmpty a1) | |
| type Foldl' (arg1 :: b ~> (a ~> b)) (arg2 :: b) (arg3 :: NonEmpty a) | |
| type Foldr (a2 :: a1 ~> (k2 ~> k2)) (a3 :: k2) (a4 :: NonEmpty a1) | |
| type Foldr' (arg1 :: a ~> (b ~> b)) (arg2 :: b) (arg3 :: NonEmpty a) | |
| type MapM (arg1 :: a ~> m b) (arg2 :: NonEmpty a) | |
| type Traverse (a2 :: a1 ~> f b) (a3 :: NonEmpty a1) | |
| type LiftA2 (a2 :: a1 ~> (b ~> c)) (a3 :: NonEmpty a1) (a4 :: NonEmpty b) | |
| type Apply (Pure_6989586621679357507Sym0 :: TyFun a (NonEmpty a) -> Type) (a6989586621679357511 :: a) | |
Defined in Control.Monad.Singletons.Internal | |
| type Apply (ShowsPrec_6989586621680071810Sym0 :: TyFun Nat (NonEmpty a ~> (Symbol ~> Symbol)) -> Type) (a6989586621680071818 :: Nat) | |
| type Apply ((:|@#@$) :: TyFun a ([a] ~> NonEmpty a) -> Type) (a6989586621679028369 :: a) | |
| type Apply (TFHelper_6989586621679357376Sym0 :: TyFun a (NonEmpty b ~> NonEmpty a) -> Type) (a6989586621679357381 :: a) | |
| type Apply (Foldl_6989586621680194048Sym1 a6989586621680194054 :: TyFun b (NonEmpty a ~> b) -> Type) (a6989586621680194055 :: b) | |
| type Apply (Foldr_6989586621680194032Sym1 a6989586621680194038 :: TyFun b (NonEmpty a ~> b) -> Type) (a6989586621680194039 :: b) | |
| type Apply (Let6989586621679357669Bs'Sym0 :: TyFun k (TyFun [a] (TyFun (a ~> NonEmpty b) [b] -> Type) -> Type) -> Type) (a6989586621679357666 :: k) | |
Defined in Control.Monad.Singletons.Internal | |
| type Apply (Let6989586621679357669BsSym0 :: TyFun k1 (TyFun k (TyFun (k1 ~> NonEmpty a) [a] -> Type) -> Type) -> Type) (a6989586621679357666 :: k1) | |
Defined in Control.Monad.Singletons.Internal | |
| type Apply (Let6989586621679357669BSym0 :: TyFun k1 (TyFun k2 (TyFun (k1 ~> NonEmpty k3) k3 -> Type) -> Type) -> Type) (a6989586621679357666 :: k1) | |
Defined in Control.Monad.Singletons.Internal | |
| type Apply (Let6989586621679357669BsSym1 a6989586621679357666 :: TyFun k (TyFun (k1 ~> NonEmpty a) [a] -> Type) -> Type) (as6989586621679357667 :: k) | |
Defined in Control.Monad.Singletons.Internal | |
| type Apply (Let6989586621679357669ToListSym0 :: TyFun k1 (TyFun k2 (TyFun k3 (TyFun (NonEmpty k4) [k4] -> Type) -> Type) -> Type) -> Type) (a6989586621679357666 :: k1) | |
Defined in Control.Monad.Singletons.Internal | |
| type Apply (Let6989586621679357669BSym1 a6989586621679357666 :: TyFun k2 (TyFun (k1 ~> NonEmpty k3) k3 -> Type) -> Type) (as6989586621679357667 :: k2) | |
Defined in Control.Monad.Singletons.Internal | |
| type Apply (Let6989586621679357669ToListSym1 a6989586621679357666 :: TyFun k2 (TyFun k3 (TyFun (NonEmpty k4) [k4] -> Type) -> Type) -> Type) (as6989586621679357667 :: k2) | |
Defined in Control.Monad.Singletons.Internal type Apply (Let6989586621679357669ToListSym1 a6989586621679357666 :: TyFun k2 (TyFun k3 (TyFun (NonEmpty k4) [k4] -> Type) -> Type) -> Type) (as6989586621679357667 :: k2) = Let6989586621679357669ToListSym2 a6989586621679357666 as6989586621679357667 :: TyFun k3 (TyFun (NonEmpty k4) [k4] -> Type) -> Type | |
| type Apply (Let6989586621679357669ToListSym2 a6989586621679357666 as6989586621679357667 :: TyFun k3 (TyFun (NonEmpty k4) [k4] -> Type) -> Type) (f6989586621679357668 :: k3) | |
Defined in Control.Monad.Singletons.Internal type Apply (Let6989586621679357669ToListSym2 a6989586621679357666 as6989586621679357667 :: TyFun k3 (TyFun (NonEmpty k4) [k4] -> Type) -> Type) (f6989586621679357668 :: k3) = Let6989586621679357669ToListSym3 a6989586621679357666 as6989586621679357667 f6989586621679357668 :: TyFun (NonEmpty k4) [k4] -> Type | |
| type Item (NonEmpty a) | |
| type Rep (NonEmpty a) | Since: base-4.6.0.0 |
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 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 Index (NonEmpty a) | |
Defined in Lens.Micro.Internal | |
| type IxValue (NonEmpty a) | |
Defined in Lens.Micro.Internal | |
| type ToBigMapKey (NonEmpty (k, v)) | |
Defined in Morley.Michelson.Typed.Haskell.Value | |
| type ToBigMapValue (NonEmpty (k, v)) | |
Defined in Morley.Michelson.Typed.Haskell.Value | |
| type Demote (NonEmpty a) | |
Defined in Data.Singletons.Base.Instances | |
| type Sing | |
Defined in Data.Singletons.Base.Instances | |
| type Element (NonEmpty a) | |
Defined in Universum.Container.Class | |
| type FromListC (NonEmpty a) | |
Defined in Universum.Container.Class | |
| type Key (NonEmpty (k, v)) | |
Defined in Universum.Container.Class | |
| type ListElement (NonEmpty a) | |
Defined in Universum.Container.Class | |
| type OneItem (NonEmpty a) | |
Defined in Universum.Container.Class | |
| type Val (NonEmpty (k, v)) | |
Defined in Universum.Container.Class | |
| type Rep1 NonEmpty | Since: base-4.6.0.0 |
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 Sconcat (arg :: NonEmpty (NonEmpty a)) | |
| type Show_ (arg :: NonEmpty a) | |
| type (arg1 :: NonEmpty a) /= (arg2 :: NonEmpty a) | |
| type (a2 :: NonEmpty a1) == (a3 :: NonEmpty a1) | |
| 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 Max (arg1 :: NonEmpty a) (arg2 :: NonEmpty a) | |
| type Min (arg1 :: NonEmpty a) (arg2 :: NonEmpty a) | |
| type (a2 :: NonEmpty a1) <> (a3 :: NonEmpty a1) | |
| type ShowList (arg1 :: [NonEmpty a]) arg2 | |
| type Apply Sconcat_6989586621679584058Sym0 (a6989586621679584062 :: NonEmpty ()) | |
Defined in Data.Semigroup.Singletons.Internal | |
| type ShowsPrec a2 (a3 :: NonEmpty a1) a4 | |
| type Apply (SconcatSym0 :: TyFun (NonEmpty a) a -> Type) (a6989586621679583988 :: NonEmpty a) | |
Defined in Data.Semigroup.Singletons.Internal | |
| type Apply (Sconcat_6989586621679583990Sym0 :: TyFun (NonEmpty a) a -> Type) (a6989586621679583994 :: NonEmpty a) | |
| type Apply (Fold_6989586621680194106Sym0 :: TyFun (NonEmpty m) m -> Type) (a6989586621680194110 :: NonEmpty m) | |
| type Apply (Compare_6989586621679181443Sym1 a6989586621679181448 :: TyFun (NonEmpty a) Ordering -> Type) (a6989586621679181449 :: NonEmpty a) | |
| type Apply (TFHelper_6989586621679130622Sym1 a6989586621679130627 :: TyFun (NonEmpty a) Bool -> Type) (a6989586621679130628 :: NonEmpty a) | |
| type Apply (Foldl1_6989586621680194063Sym1 a6989586621680194068 :: TyFun (NonEmpty a) a -> Type) (a6989586621680194069 :: NonEmpty a) | |
| type Apply (Foldr1_6989586621680194075Sym1 a6989586621680194080 :: TyFun (NonEmpty a) a -> Type) (a6989586621680194081 :: NonEmpty a) | |
| type Apply (FoldMap_6989586621680194095Sym1 a6989586621680194100 :: TyFun (NonEmpty a) m -> Type) (a6989586621680194101 :: NonEmpty a) | |
| type Apply (Foldl_6989586621680194048Sym2 a6989586621680194054 a6989586621680194055 :: TyFun (NonEmpty a) b -> Type) (a6989586621680194056 :: NonEmpty a) | |
| type Apply (Foldr_6989586621680194032Sym2 a6989586621680194038 a6989586621680194039 :: TyFun (NonEmpty a) b -> Type) (a6989586621680194040 :: NonEmpty a) | |
| type Apply (ToList_6989586621680194114Sym0 :: TyFun (NonEmpty a) [a] -> Type) (a6989586621680194118 :: NonEmpty a) | |
| type Apply (TFHelper_6989586621679584022Sym1 a6989586621679584027 :: TyFun (NonEmpty a) (NonEmpty a) -> Type) (a6989586621679584028 :: NonEmpty a) | |
| type Apply ((:|@#@$$) a6989586621679028369 :: TyFun [a] (NonEmpty a) -> Type) (a6989586621679028370 :: [a]) | |
| type Apply (Fmap_6989586621679357364Sym1 a6989586621679357369 :: TyFun (NonEmpty a) (NonEmpty b) -> Type) (a6989586621679357370 :: NonEmpty a) | |
| type Apply (TFHelper_6989586621679357515Sym1 a6989586621679357524 :: TyFun (NonEmpty a) (NonEmpty b) -> Type) (a6989586621679357525 :: NonEmpty a) | |
| type Apply (TFHelper_6989586621679357376Sym1 a6989586621679357381 :: TyFun (NonEmpty b) (NonEmpty a) -> Type) (a6989586621679357382 :: NonEmpty b) | |
| type Apply (Traverse_6989586621680478691Sym1 a6989586621680478696 :: TyFun (NonEmpty a) (f (NonEmpty b)) -> Type) (a6989586621680478697 :: NonEmpty a) | |
| type Apply (LiftA2_6989586621679357531Sym2 a6989586621679357543 a6989586621679357544 :: TyFun (NonEmpty b) (NonEmpty c) -> Type) (a6989586621679357545 :: NonEmpty b) | |
Defined in Control.Monad.Singletons.Internal | |
| type Apply (Let6989586621679357669ToListSym3 a6989586621679357666 as6989586621679357667 f6989586621679357668 :: TyFun (NonEmpty k4) [k4] -> Type) (a6989586621679357676 :: NonEmpty k4) | |
Defined in Control.Monad.Singletons.Internal | |
| type Apply (TFHelper_6989586621679584022Sym0 :: TyFun (NonEmpty a) (NonEmpty a ~> NonEmpty a) -> Type) (a6989586621679584027 :: NonEmpty a) | |
| type Apply (Compare_6989586621679181443Sym0 :: TyFun (NonEmpty a) (NonEmpty a ~> Ordering) -> Type) (a6989586621679181448 :: NonEmpty a) | |
| type Apply (TFHelper_6989586621679130622Sym0 :: TyFun (NonEmpty a) (NonEmpty a ~> Bool) -> Type) (a6989586621679130627 :: NonEmpty a) | |
| type Apply (Sconcat_6989586621680163618Sym0 :: TyFun (NonEmpty (Proxy s)) (Proxy s) -> Type) (a6989586621680163622 :: NonEmpty (Proxy s)) | |
| type Apply (TFHelper_6989586621679357515Sym0 :: TyFun (NonEmpty (a ~> b)) (NonEmpty a ~> NonEmpty b) -> Type) (a6989586621679357524 :: NonEmpty (a ~> b)) | |
| type Apply (TFHelper_6989586621679357659Sym0 :: TyFun (NonEmpty a) ((a ~> NonEmpty b) ~> NonEmpty b) -> Type) (a6989586621679357664 :: NonEmpty a) | |
| type Apply (ShowsPrec_6989586621680071810Sym1 a6989586621680071818 :: TyFun (NonEmpty a) (Symbol ~> Symbol) -> Type) (a6989586621680071819 :: NonEmpty a) | |
| type Apply (LiftA2_6989586621679357531Sym1 a6989586621679357543 :: TyFun (NonEmpty a) (NonEmpty b ~> NonEmpty c) -> Type) (a6989586621679357544 :: NonEmpty a) | |
| type Apply (Let6989586621679357669Bs'Sym1 a6989586621679357666 :: TyFun [a] (TyFun (a ~> NonEmpty b) [b] -> Type) -> Type) (as6989586621679357667 :: [a]) | |
Defined in Control.Monad.Singletons.Internal | |
| type Apply (Let6989586621679357669BSym2 a6989586621679357666 as6989586621679357667 :: TyFun (k1 ~> NonEmpty k3) k3 -> Type) (f6989586621679357668 :: k1 ~> NonEmpty k3) | |
Defined in Control.Monad.Singletons.Internal | |
| type Apply (TFHelper_6989586621679357659Sym1 a6989586621679357664 :: TyFun (a ~> NonEmpty b) (NonEmpty b) -> Type) (a6989586621679357665 :: a ~> NonEmpty b) | |
| type Apply (Let6989586621679357669Bs'Sym2 a6989586621679357666 as6989586621679357667 :: TyFun (a ~> NonEmpty b) [b] -> Type) (f6989586621679357668 :: a ~> NonEmpty b) | |
Defined in Control.Monad.Singletons.Internal | |
| type Apply (Let6989586621679357669BsSym2 a6989586621679357666 as6989586621679357667 :: TyFun (k1 ~> NonEmpty a) [a] -> Type) (f6989586621679357668 :: k1 ~> NonEmpty a) | |
Defined in Control.Monad.Singletons.Internal | |
| type Apply (Foldl1_6989586621680194063Sym0 :: TyFun (a ~> (a ~> a)) (NonEmpty a ~> a) -> Type) (a6989586621680194068 :: a ~> (a ~> a)) | |
| type Apply (Foldr1_6989586621680194075Sym0 :: TyFun (a ~> (a ~> a)) (NonEmpty a ~> a) -> Type) (a6989586621680194080 :: a ~> (a ~> a)) | |
| type Apply (Foldr_6989586621680194032Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (NonEmpty a ~> b)) -> Type) (a6989586621680194038 :: a ~> (b ~> b)) | |
| type Apply (Fmap_6989586621679357364Sym0 :: TyFun (a ~> b) (NonEmpty a ~> NonEmpty b) -> Type) (a6989586621679357369 :: a ~> b) | |
| type Apply (FoldMap_6989586621680194095Sym0 :: TyFun (a ~> m) (NonEmpty a ~> m) -> Type) (a6989586621680194100 :: a ~> m) | |
| type Apply (Foldl_6989586621680194048Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (NonEmpty a ~> b)) -> Type) (a6989586621680194054 :: b ~> (a ~> b)) | |
| type Apply (LiftA2_6989586621679357531Sym0 :: TyFun (a ~> (b ~> c)) (NonEmpty a ~> (NonEmpty b ~> NonEmpty c)) -> Type) (a6989586621679357543 :: a ~> (b ~> c)) | |
| type Apply (Traverse_6989586621680478691Sym0 :: TyFun (a ~> f b) (NonEmpty a ~> f (NonEmpty b)) -> Type) (a6989586621680478696 :: a ~> f b) | |
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]
(<$>) :: 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)
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
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]
fromMaybe :: a -> Maybe a -> a #
The fromMaybe function takes a default value and a Maybe
value. If the Maybe is Nothing, it returns the default value;
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
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]
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]
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""
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
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],[])
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.
>>>cycle []*** Exception: Prelude.cycle: empty list>>>take 20 $ cycle [42][42,42,42,42,42,42,42,42,42,42...>>>take 20 $ cycle [2, 5, 7][2,5,7,2,5,7,2,5,7,2,5,7...
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.
iterate :: (a -> a) -> a -> [a] #
iterate f x returns an infinite list of repeated applications
of f to x:
iterate f x == [x, f x, f (f x), ...]
Note that iterate is lazy, potentially leading to thunk build-up if
the consumer doesn't force each iterate. See iterate' for a strict
variant of this function.
>>>take 10 $ iterate not True[True,False,True,False...>>>take 10 $ iterate (+3) 42[42,45,48,51,54,57,60,63...
repeat x is an infinite list, with x the value of every element.
>>>take 20 $ repeat 17[17,17,17,17,17,17,17,17,17...
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.
>>>replicate 0 True[]>>>replicate (-1) True[]>>>replicate 4 True[True,True,True,True]
reverse xs returns the elements of xs in reverse order.
xs must be finite.
>>>reverse [][]>>>reverse [42][42]>>>reverse [2,5,7][7,5,2]>>>reverse [1..]* Hangs forever *
scanl :: (b -> a -> b) -> b -> [a] -> [b] #
\(\mathcal{O}(n)\). scanl is similar to foldl, but returns a list of
successive reduced values from the left:
scanl f z [x1, x2, ...] == [z, z `f` x1, (z `f` x1) `f` x2, ...]
Note that
last (scanl f z xs) == foldl f z xs
>>>scanl (+) 0 [1..4][0,1,3,6,10]>>>scanl (+) 42 [][42]>>>scanl (-) 100 [1..4][100,99,97,94,90]>>>scanl (\reversedString nextChar -> nextChar : reversedString) "foo" ['a', 'b', 'c', 'd']["foo","afoo","bafoo","cbafoo","dcbafoo"]>>>scanl (+) 0 [1..]* Hangs forever *
scanr :: (a -> b -> b) -> b -> [a] -> [b] #
\(\mathcal{O}(n)\). scanr is the right-to-left dual of scanl. Note that the order of parameters on the accumulating function are reversed compared to scanl.
Also note that
head (scanr f z xs) == foldr f z xs.
>>>scanr (+) 0 [1..4][10,9,7,4,0]>>>scanr (+) 42 [][42]>>>scanr (-) 100 [1..4][98,-97,99,-96,100]>>>scanr (\nextChar reversedString -> nextChar : reversedString) "foo" ['a', 'b', 'c', 'd']["abcdfoo","bcdfoo","cdfoo","dfoo","foo"]>>>force $ scanr (+) 0 [1..]*** Exception: stack overflow
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.
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][]
unzip :: [(a, b)] -> ([a], [b]) #
unzip transforms a list of pairs into a list of first components
and a list of second components.
>>>unzip []([],[])>>>unzip [(1, 'a'), (2, 'b')]([1,2],"ab")
zipWith :: (a -> b -> c) -> [a] -> [b] -> [c] #
\(\mathcal{O}(\min(m,n))\). zipWith generalises zip by zipping with the
function given as the first argument, instead of a tupling function.
zipWith (,) xs ys == zip xs ys zipWith f [x1,x2,x3..] [y1,y2,y3..] == [f x1 y1, f x2 y2, f x3 y3..]
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.
(^^) :: (Fractional a, Integral b) => a -> b -> a infixr 8 #
raise a number to an integral power
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
lcm :: Integral a => a -> a -> a #
lcm x yx and y divide.
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) | |
| Representable (Proxy :: Type -> Type) | |
| 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 |
| Alternative (Proxy :: Type -> Type) | Since: base-4.9.0.0 |
| Applicative (Proxy :: Type -> Type) | Since: base-4.7.0.0 |
| Functor (Proxy :: Type -> Type) | Since: base-4.7.0.0 |
| Monad (Proxy :: Type -> Type) | Since: base-4.7.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 | |
| PFoldable (Proxy :: Type -> Type) | |
| SFoldable (Proxy :: Type -> Type) | |
Defined in Data.Foldable.Singletons Methods sFold :: forall m (t1 :: Proxy m). SMonoid m => Sing t1 -> Sing (Apply FoldSym0 t1) # sFoldMap :: forall a m (t1 :: a ~> m) (t2 :: Proxy a). SMonoid m => Sing t1 -> Sing t2 -> Sing (Apply (Apply FoldMapSym0 t1) t2) # sFoldr :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: Proxy 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 :: Proxy 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 :: Proxy 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 :: Proxy a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply Foldl'Sym0 t1) t2) t3) # sFoldr1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Proxy a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldr1Sym0 t1) t2) # sFoldl1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Proxy a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldl1Sym0 t1) t2) # sToList :: forall a (t1 :: Proxy a). Sing t1 -> Sing (Apply ToListSym0 t1) # sNull :: forall a (t1 :: Proxy a). Sing t1 -> Sing (Apply NullSym0 t1) # sLength :: forall a (t1 :: Proxy a). Sing t1 -> Sing (Apply LengthSym0 t1) # sElem :: forall a (t1 :: a) (t2 :: Proxy a). SEq a => Sing t1 -> Sing t2 -> Sing (Apply (Apply ElemSym0 t1) t2) # sMaximum :: forall a (t1 :: Proxy a). SOrd a => Sing t1 -> Sing (Apply MaximumSym0 t1) # sMinimum :: forall a (t1 :: Proxy a). SOrd a => Sing t1 -> Sing (Apply MinimumSym0 t1) # sSum :: forall a (t1 :: Proxy a). SNum a => Sing t1 -> Sing (Apply SumSym0 t1) # sProduct :: forall a (t1 :: Proxy a). SNum a => Sing t1 -> Sing (Apply ProductSym0 t1) # | |
| PTraversable (Proxy :: Type -> Type) | |
| STraversable (Proxy :: Type -> Type) | |
Defined in Data.Traversable.Singletons Methods sTraverse :: forall a (f :: Type -> Type) b (t1 :: a ~> f b) (t2 :: Proxy a). SApplicative f => Sing t1 -> Sing t2 -> Sing (Apply (Apply TraverseSym0 t1) t2) # sSequenceA :: forall (f :: Type -> Type) a (t1 :: Proxy (f a)). SApplicative f => Sing t1 -> Sing (Apply SequenceASym0 t1) # sMapM :: forall a (m :: Type -> Type) b (t1 :: a ~> m b) (t2 :: Proxy a). SMonad m => Sing t1 -> Sing t2 -> Sing (Apply (Apply MapMSym0 t1) t2) # sSequence :: forall (m :: Type -> Type) a (t1 :: Proxy (m a)). SMonad m => Sing t1 -> Sing (Apply SequenceSym0 t1) # | |
| Monoid (Proxy s) | Since: base-4.7.0.0 |
| Semigroup (Proxy s) | Since: base-4.9.0.0 |
| Bounded (Proxy t) | Since: base-4.7.0.0 |
| Enum (Proxy s) | Since: base-4.7.0.0 |
| Generic (Proxy t) | |
| Ix (Proxy s) | Since: base-4.7.0.0 |
Defined in Data.Proxy | |
| Read (Proxy t) | Since: base-4.7.0.0 |
| Show (Proxy s) | Since: base-4.7.0.0 |
| NFData (Proxy a) | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| Eq (Proxy s) | Since: base-4.7.0.0 |
| Ord (Proxy s) | Since: base-4.7.0.0 |
| Hashable (Proxy a) | |
Defined in Data.Hashable.Class | |
| Semiring (Proxy a) | |
| SuppressUnusedWarnings (Product_6989586621680194250Sym0 :: TyFun (Proxy a) a -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Sum_6989586621680194244Sym0 :: TyFun (Proxy a) a -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Fold_6989586621680194173Sym0 :: TyFun (Proxy m) m -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldl1_6989586621680194206Sym0 :: TyFun (a ~> (a ~> a)) (Proxy a ~> a) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr1_6989586621680194215Sym0 :: TyFun (a ~> (a ~> a)) (Proxy a ~> a) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Pure_6989586621680163954Sym0 :: TyFun a (Proxy a) -> Type) | |
Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Elem_6989586621680194236Sym0 :: TyFun a (Proxy a ~> Bool) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| TestCoercion (SProxy :: Proxy t -> Type) | |
Defined in Data.Proxy.Singletons | |
| TestEquality (SProxy :: Proxy t -> Type) | |
Defined in Data.Proxy.Singletons | |
| SuppressUnusedWarnings (Elem_6989586621680194236Sym1 a6989586621680194241 :: TyFun (Proxy a) Bool -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680163961Sym0 :: TyFun (Proxy (a ~> b)) (Proxy a ~> Proxy b) -> Type) | |
Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldl1_6989586621680194206Sym1 a6989586621680194211 :: TyFun (Proxy a) a -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr1_6989586621680194215Sym1 a6989586621680194220 :: TyFun (Proxy a) a -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (SequenceA_6989586621680478736Sym0 :: TyFun (Proxy (f a)) (f (Proxy a)) -> Type) | |
Defined in Data.Traversable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Sequence_6989586621680478751Sym0 :: TyFun (Proxy (m a)) (m (Proxy a)) -> Type) | |
Defined in Data.Traversable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680163985Sym0 :: TyFun (Proxy a) (Proxy a ~> Proxy a) -> Type) | |
Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Null_6989586621680194229Sym0 :: TyFun (Proxy a) Bool -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Length_6989586621680194223Sym0 :: TyFun (Proxy a) Nat -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Pred_6989586621680163542Sym0 :: TyFun (Proxy s) (Proxy s) -> Type) | |
Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Succ_6989586621680163536Sym0 :: TyFun (Proxy s) (Proxy s) -> Type) | |
Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680163610Sym0 :: TyFun (Proxy s) (Proxy s ~> Proxy s) -> Type) | |
Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680163447Sym0 :: TyFun (Proxy s) (Proxy s ~> Ordering) -> Type) | |
Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (EnumFromThenTo_6989586621680163568Sym0 :: TyFun (Proxy s) (Proxy s ~> (Proxy s ~> [Proxy s])) -> Type) | |
Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680163384Sym0 :: TyFun (Proxy s) (Proxy s ~> Bool) -> Type) | |
Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (EnumFromTo_6989586621680163579Sym0 :: TyFun (Proxy s) (Proxy s ~> [Proxy s]) -> Type) | |
Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FromEnum_6989586621680163548Sym0 :: TyFun (Proxy s) Nat -> Type) | |
Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Sconcat_6989586621680163618Sym0 :: TyFun (NonEmpty (Proxy s)) (Proxy s) -> Type) | |
Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr_6989586621680194181Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (Proxy a ~> b)) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Fmap_6989586621680163886Sym0 :: TyFun (a ~> b) (Proxy a ~> Proxy b) -> Type) | |
Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FoldMap_6989586621680194165Sym0 :: TyFun (a ~> m) (Proxy a ~> m) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldl_6989586621680194194Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (Proxy a ~> b)) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ToEnum_6989586621680163554Sym0 :: TyFun Nat (Proxy s) -> Type) | |
Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621680163487Sym0 :: TyFun Nat (Proxy s ~> (Symbol ~> Symbol)) -> Type) | |
Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Mconcat_6989586621680163839Sym0 :: TyFun [Proxy s] (Proxy s) -> Type) | |
Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Fmap_6989586621680163886Sym1 a6989586621680163891 :: TyFun (Proxy a) (Proxy b) -> Type) | |
Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680163961Sym1 a6989586621680163966 :: TyFun (Proxy a) (Proxy b) -> Type) | |
Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680164026Sym0 :: TyFun (Proxy a) ((a ~> Proxy b) ~> Proxy b) -> Type) | |
Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FoldMap_6989586621680194165Sym1 a6989586621680194170 :: TyFun (Proxy a) m -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680163985Sym1 a6989586621680163990 :: TyFun (Proxy a) (Proxy a) -> Type) | |
Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680163610Sym1 a6989586621680163615 :: TyFun (Proxy s) (Proxy s) -> Type) | |
Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680163447Sym1 a6989586621680163452 :: TyFun (Proxy s) Ordering -> Type) | |
Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (EnumFromThenTo_6989586621680163568Sym1 a6989586621680163574 :: TyFun (Proxy s) (Proxy s ~> [Proxy s]) -> Type) | |
Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621680163487Sym1 a6989586621680163495 :: TyFun (Proxy s) (Symbol ~> Symbol) -> Type) | |
Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680163384Sym1 a6989586621680163389 :: TyFun (Proxy s) Bool -> Type) | |
Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (EnumFromTo_6989586621680163579Sym1 a6989586621680163584 :: TyFun (Proxy s) [Proxy s] -> Type) | |
Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Traverse_6989586621680478728Sym0 :: TyFun (a ~> f b) (Proxy a ~> f (Proxy b)) -> Type) | |
Defined in Data.Traversable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (MapM_6989586621680478743Sym0 :: TyFun (a ~> m b) (Proxy a ~> m (Proxy b)) -> Type) | |
Defined in Data.Traversable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldl_6989586621680194194Sym1 a6989586621680194200 :: TyFun b (Proxy a ~> b) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr_6989586621680194181Sym1 a6989586621680194187 :: TyFun b (Proxy a ~> b) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldl_6989586621680194194Sym2 a6989586621680194200 a6989586621680194201 :: TyFun (Proxy a) b -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr_6989586621680194181Sym2 a6989586621680194187 a6989586621680194188 :: TyFun (Proxy a) b -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Traverse_6989586621680478728Sym1 a6989586621680478733 :: TyFun (Proxy a) (f (Proxy b)) -> Type) | |
Defined in Data.Traversable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (MapM_6989586621680478743Sym1 a6989586621680478748 :: TyFun (Proxy a) (m (Proxy b)) -> Type) | |
Defined in Data.Traversable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (EnumFromThenTo_6989586621680163568Sym2 a6989586621680163574 a6989586621680163575 :: TyFun (Proxy s) [Proxy s] -> Type) | |
Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680164026Sym1 a6989586621680164031 :: TyFun (a ~> Proxy b) (Proxy b) -> Type) | |
Defined in Data.Proxy.Singletons Methods suppressUnusedWarnings :: () # | |
| type MapM (a2 :: a1 ~> m b) (a3 :: Proxy a1) | |
| type Traverse (a2 :: a1 ~> f b) (a3 :: Proxy a1) | |
| type LiftA2 (arg :: a ~> (b ~> c)) (arg1 :: Proxy a) (arg2 :: Proxy b) | |
| type Fmap (a2 :: a1 ~> b) (a3 :: Proxy a1) | |
| type FoldMap (a2 :: a1 ~> k2) (a3 :: Proxy a1) | |
| type Foldl (a2 :: k2 ~> (a1 ~> k2)) (a3 :: k2) (a4 :: Proxy a1) | |
| type Foldl' (arg1 :: b ~> (a ~> b)) (arg2 :: b) (arg3 :: Proxy a) | |
| type Foldr (a2 :: a1 ~> (k2 ~> k2)) (a3 :: k2) (a4 :: Proxy a1) | |
| type Foldr' (arg1 :: a ~> (b ~> b)) (arg2 :: b) (arg3 :: Proxy a) | |
| type Rep1 (Proxy :: k -> Type) | Since: base-4.6.0.0 |
| type Empty | |
Defined in Data.Proxy.Singletons | |
| type Mzero | |
Defined in Data.Proxy.Singletons | |
| type Pure (a :: k1) | |
| type Return (arg :: a) | |
| type Elem (a1 :: k1) (a2 :: Proxy k1) | |
| type Foldl1 (a1 :: k2 ~> (k2 ~> k2)) (a2 :: Proxy k2) | |
| type Foldr1 (a1 :: k2 ~> (k2 ~> k2)) (a2 :: Proxy k2) | |
| type (arg :: a) <$ (arg1 :: Proxy b) | |
| type (a2 :: Proxy a1) <|> (a3 :: Proxy a1) | |
| type Mplus (arg :: Proxy a) (arg1 :: Proxy a) | |
| type Apply (Pure_6989586621680163954Sym0 :: TyFun a (Proxy a) -> Type) (a6989586621680163958 :: a) | |
Defined in Data.Proxy.Singletons | |
| type Apply (Elem_6989586621680194236Sym0 :: TyFun a (Proxy a ~> Bool) -> Type) (a6989586621680194241 :: a) | |
| type Apply (ToEnum_6989586621680163554Sym0 :: TyFun Nat (Proxy s) -> Type) (a6989586621680163558 :: Nat) | |
| type Apply (ShowsPrec_6989586621680163487Sym0 :: TyFun Nat (Proxy s ~> (Symbol ~> Symbol)) -> Type) (a6989586621680163495 :: Nat) | |
| type Apply (Foldl_6989586621680194194Sym1 a6989586621680194200 :: TyFun b (Proxy a ~> b) -> Type) (a6989586621680194201 :: b) | |
| type Apply (Foldr_6989586621680194181Sym1 a6989586621680194187 :: TyFun b (Proxy a ~> b) -> Type) (a6989586621680194188 :: b) | |
| type Rep (Proxy :: Type -> Type) | |
| type Fold (a :: Proxy k2) | |
| type Length (a2 :: Proxy a1) | |
| type Maximum (arg :: Proxy a) | |
| type Minimum (arg :: Proxy a) | |
| type Null (a2 :: Proxy a1) | |
| type Product (a :: Proxy k2) | |
| type Sum (a :: Proxy k2) | |
| type ToList (arg :: Proxy a) | |
| type Sequence (a2 :: Proxy (m a1)) | |
| type SequenceA (a2 :: Proxy (f a1)) | |
| type (arg :: Proxy a) *> (arg1 :: Proxy b) | |
| type (arg :: Proxy a) <* (arg1 :: Proxy b) | |
| type (a2 :: Proxy (a1 ~> b)) <*> (a3 :: Proxy a1) | |
| type (arg :: Proxy a) >> (arg1 :: Proxy b) | |
| type (a2 :: Proxy a1) >>= (a3 :: a1 ~> Proxy b) | |
| type Apply (Sconcat_6989586621680163618Sym0 :: TyFun (NonEmpty (Proxy s)) (Proxy s) -> Type) (a6989586621680163622 :: NonEmpty (Proxy s)) | |
| type Apply (Mconcat_6989586621680163839Sym0 :: TyFun [Proxy s] (Proxy s) -> Type) (a6989586621680163843 :: [Proxy s]) | |
| type Rep (Proxy t) | Since: base-4.6.0.0 |
| type Demote (Proxy t) | |
Defined in Data.Proxy.Singletons | |
| type Sing | |
Defined in Data.Proxy.Singletons | |
| type Mempty | |
Defined in Data.Proxy.Singletons | |
| type MaxBound | |
Defined in Data.Proxy.Singletons | |
| type MinBound | |
Defined in Data.Proxy.Singletons | |
| type Mconcat (a :: [Proxy s]) | |
| type Sconcat (a :: NonEmpty (Proxy s)) | |
| type FromEnum (a :: Proxy s) | |
| type Pred (a :: Proxy s) | |
| type Succ (a :: Proxy s) | |
| type ToEnum a | |
| type Show_ (arg :: Proxy s) | |
| type (arg :: Proxy s) /= (arg1 :: Proxy s) | |
| type (a1 :: Proxy s) == (a2 :: Proxy s) | |
| type Mappend (arg :: Proxy s) (arg1 :: Proxy s) | |
| type (arg :: Proxy s) < (arg1 :: Proxy s) | |
| type (arg :: Proxy s) <= (arg1 :: Proxy s) | |
| type (arg :: Proxy s) > (arg1 :: Proxy s) | |
| type (arg :: Proxy s) >= (arg1 :: Proxy s) | |
| type Compare (a1 :: Proxy s) (a2 :: Proxy s) | |
| type Max (arg :: Proxy s) (arg1 :: Proxy s) | |
| type Min (arg :: Proxy s) (arg1 :: Proxy s) | |
| type (a1 :: Proxy s) <> (a2 :: Proxy s) | |
| type EnumFromTo (a1 :: Proxy s) (a2 :: Proxy s) | |
| type ShowList (arg :: [Proxy s]) arg1 | |
| type EnumFromThenTo (a1 :: Proxy s) (a2 :: Proxy s) (a3 :: Proxy s) | |
| type ShowsPrec a1 (a2 :: Proxy s) a3 | |
| type Apply (Product_6989586621680194250Sym0 :: TyFun (Proxy a) a -> Type) (a6989586621680194254 :: Proxy a) | |
| type Apply (Sum_6989586621680194244Sym0 :: TyFun (Proxy a) a -> Type) (a6989586621680194248 :: Proxy a) | |
| type Apply (Fold_6989586621680194173Sym0 :: TyFun (Proxy m) m -> Type) (a6989586621680194177 :: Proxy m) | |
| type Apply (Elem_6989586621680194236Sym1 a6989586621680194241 :: TyFun (Proxy a) Bool -> Type) (a6989586621680194242 :: Proxy a) | |
| type Apply (Foldl1_6989586621680194206Sym1 a6989586621680194211 :: TyFun (Proxy a) a -> Type) (a6989586621680194212 :: Proxy a) | |
| type Apply (Foldr1_6989586621680194215Sym1 a6989586621680194220 :: TyFun (Proxy a) a -> Type) (a6989586621680194221 :: Proxy a) | |
| type Apply (Null_6989586621680194229Sym0 :: TyFun (Proxy a) Bool -> Type) (a6989586621680194233 :: Proxy a) | |
| type Apply (Length_6989586621680194223Sym0 :: TyFun (Proxy a) Nat -> Type) (a6989586621680194227 :: Proxy a) | |
| type Apply (FromEnum_6989586621680163548Sym0 :: TyFun (Proxy s) Nat -> Type) (a6989586621680163552 :: Proxy s) | |
| type Apply (FoldMap_6989586621680194165Sym1 a6989586621680194170 :: TyFun (Proxy a) m -> Type) (a6989586621680194171 :: Proxy a) | |
| type Apply (Compare_6989586621680163447Sym1 a6989586621680163452 :: TyFun (Proxy s) Ordering -> Type) (a6989586621680163453 :: Proxy s) | |
| type Apply (TFHelper_6989586621680163384Sym1 a6989586621680163389 :: TyFun (Proxy s) Bool -> Type) (a6989586621680163390 :: Proxy s) | |
| type Apply (Foldl_6989586621680194194Sym2 a6989586621680194200 a6989586621680194201 :: TyFun (Proxy a) b -> Type) (a6989586621680194202 :: Proxy a) | |
| type Apply (Foldr_6989586621680194181Sym2 a6989586621680194187 a6989586621680194188 :: TyFun (Proxy a) b -> Type) (a6989586621680194189 :: Proxy a) | |
| type Apply (SequenceA_6989586621680478736Sym0 :: TyFun (Proxy (f a)) (f (Proxy a)) -> Type) (a6989586621680478740 :: Proxy (f a)) | |
| type Apply (Sequence_6989586621680478751Sym0 :: TyFun (Proxy (m a)) (m (Proxy a)) -> Type) (a6989586621680478755 :: Proxy (m a)) | |
| type Apply (EnumFromTo_6989586621680163579Sym1 a6989586621680163584 :: TyFun (Proxy s) [Proxy s] -> Type) (a6989586621680163585 :: Proxy s) | |
| type Apply (Traverse_6989586621680478728Sym1 a6989586621680478733 :: TyFun (Proxy a) (f (Proxy b)) -> Type) (a6989586621680478734 :: Proxy a) | |
| type Apply (MapM_6989586621680478743Sym1 a6989586621680478748 :: TyFun (Proxy a) (m (Proxy b)) -> Type) (a6989586621680478749 :: Proxy a) | |
| type Apply (EnumFromThenTo_6989586621680163568Sym2 a6989586621680163574 a6989586621680163575 :: TyFun (Proxy s) [Proxy s] -> Type) (a6989586621680163576 :: Proxy s) | |
| type Apply (Foldl1_6989586621680194206Sym0 :: TyFun (a ~> (a ~> a)) (Proxy a ~> a) -> Type) (a6989586621680194211 :: a ~> (a ~> a)) | |
| type Apply (Foldr1_6989586621680194215Sym0 :: TyFun (a ~> (a ~> a)) (Proxy a ~> a) -> Type) (a6989586621680194220 :: a ~> (a ~> a)) | |
| type Apply (TFHelper_6989586621680163961Sym0 :: TyFun (Proxy (a ~> b)) (Proxy a ~> Proxy b) -> Type) (a6989586621680163966 :: Proxy (a ~> b)) | |
| type Apply (TFHelper_6989586621680163985Sym0 :: TyFun (Proxy a) (Proxy a ~> Proxy a) -> Type) (a6989586621680163990 :: Proxy a) | |
| type Apply (Pred_6989586621680163542Sym0 :: TyFun (Proxy s) (Proxy s) -> Type) (a6989586621680163546 :: Proxy s) | |
| type Apply (Succ_6989586621680163536Sym0 :: TyFun (Proxy s) (Proxy s) -> Type) (a6989586621680163540 :: Proxy s) | |
| type Apply (TFHelper_6989586621680163610Sym0 :: TyFun (Proxy s) (Proxy s ~> Proxy s) -> Type) (a6989586621680163615 :: Proxy s) | |
| type Apply (Compare_6989586621680163447Sym0 :: TyFun (Proxy s) (Proxy s ~> Ordering) -> Type) (a6989586621680163452 :: Proxy s) | |
| type Apply (EnumFromThenTo_6989586621680163568Sym0 :: TyFun (Proxy s) (Proxy s ~> (Proxy s ~> [Proxy s])) -> Type) (a6989586621680163574 :: Proxy s) | |
| type Apply (TFHelper_6989586621680163384Sym0 :: TyFun (Proxy s) (Proxy s ~> Bool) -> Type) (a6989586621680163389 :: Proxy s) | |
| type Apply (EnumFromTo_6989586621680163579Sym0 :: TyFun (Proxy s) (Proxy s ~> [Proxy s]) -> Type) (a6989586621680163584 :: Proxy s) | |
| type Apply (Foldr_6989586621680194181Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (Proxy a ~> b)) -> Type) (a6989586621680194187 :: a ~> (b ~> b)) | |
| type Apply (Fmap_6989586621680163886Sym0 :: TyFun (a ~> b) (Proxy a ~> Proxy b) -> Type) (a6989586621680163891 :: a ~> b) | |
| type Apply (FoldMap_6989586621680194165Sym0 :: TyFun (a ~> m) (Proxy a ~> m) -> Type) (a6989586621680194170 :: a ~> m) | |
| type Apply (Foldl_6989586621680194194Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (Proxy a ~> b)) -> Type) (a6989586621680194200 :: b ~> (a ~> b)) | |
| type Apply (Fmap_6989586621680163886Sym1 a6989586621680163891 :: TyFun (Proxy a) (Proxy b) -> Type) (a6989586621680163892 :: Proxy a) | |
| type Apply (TFHelper_6989586621680163961Sym1 a6989586621680163966 :: TyFun (Proxy a) (Proxy b) -> Type) (a6989586621680163967 :: Proxy a) | |
| type Apply (TFHelper_6989586621680164026Sym0 :: TyFun (Proxy a) ((a ~> Proxy b) ~> Proxy b) -> Type) (a6989586621680164031 :: Proxy a) | |
| type Apply (TFHelper_6989586621680163985Sym1 a6989586621680163990 :: TyFun (Proxy a) (Proxy a) -> Type) (a6989586621680163991 :: Proxy a) | |
| type Apply (TFHelper_6989586621680163610Sym1 a6989586621680163615 :: TyFun (Proxy s) (Proxy s) -> Type) (a6989586621680163616 :: Proxy s) | |
| type Apply (EnumFromThenTo_6989586621680163568Sym1 a6989586621680163574 :: TyFun (Proxy s) (Proxy s ~> [Proxy s]) -> Type) (a6989586621680163575 :: Proxy s) | |
| type Apply (ShowsPrec_6989586621680163487Sym1 a6989586621680163495 :: TyFun (Proxy s) (Symbol ~> Symbol) -> Type) (a6989586621680163496 :: Proxy s) | |
| type Apply (Traverse_6989586621680478728Sym0 :: TyFun (a ~> f b) (Proxy a ~> f (Proxy b)) -> Type) (a6989586621680478733 :: a ~> f b) | |
| type Apply (MapM_6989586621680478743Sym0 :: TyFun (a ~> m b) (Proxy a ~> m (Proxy b)) -> Type) (a6989586621680478748 :: a ~> m b) | |
| type Apply (TFHelper_6989586621680164026Sym1 a6989586621680164031 :: TyFun (a ~> Proxy b) (Proxy b) -> Type) (a6989586621680164032 :: a ~> Proxy b) | |
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
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
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
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) ...
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] #
\(\mathcal{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 #
\(\mathcal{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
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]
concat :: Foldable t => t [a] -> [a] #
The concatenation of all the elements of a container of lists.
Examples
Basic usage:
>>>concat (Just [1, 2, 3])[1,2,3]
>>>concat (Left 42)[]
>>>concat [[1, 2, 3], [4, 5], [6], []][1,2,3,4,5,6]
concatMap :: Foldable t => (a -> [b]) -> t a -> [b] #
Map a function over all the elements of a container and concatenate the resulting lists.
Examples
Basic usage:
>>>concatMap (take 3) [[1..], [10..], [100..], [1000..]][1,2,3,10,11,12,100,101,102,1000,1001,1002]
>>>concatMap (take 3) (Just [1..])[1,2,3]
The Const functor.
Instances
| () :=> (Functor (Const a :: Type -> Type)) | |
| Generic1 (Const a :: k -> Type) | |
| 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 | |
| (Bits a) :=> (Bits (Const a b)) | |
| (Monoid a) :=> (Applicative (Const a :: Type -> Type)) | |
Defined in Data.Constraint | |
| (Monoid a) :=> (Monoid (Const a b)) | |
| (Semigroup a) :=> (Semigroup (Const a b)) | |
| (Bounded a) :=> (Bounded (Const a b)) | |
| (Enum a) :=> (Enum (Const a b)) | |
| (Floating a) :=> (Floating (Const a b)) | |
| (RealFloat a) :=> (RealFloat (Const a b)) | |
| (Num a) :=> (Num (Const a b)) | |
| (Read a) :=> (Read (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)) | |
| (Real a) :=> (Real (Const a b)) | |
| (RealFrac a) :=> (RealFrac (Const a b)) | |
| (Show a) :=> (Show (Const a b)) | |
| (Eq a) :=> (Eq (Const a b)) | |
| (Ord a) :=> (Ord (Const a b)) | |
| 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 |
| Monoid m => Applicative (Const m :: Type -> Type) | Since: base-2.0.1 |
| Functor (Const m :: Type -> Type) | Since: base-2.1 |
| 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.Traversable.Singletons 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 (t1 :: Const m (f a)). SApplicative f => Sing t1 -> Sing (Apply SequenceASym0 t1) # 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 (t1 :: Const m (m0 a)). SMonad m0 => Sing t1 -> Sing (Apply SequenceSym0 t1) # | |
| SuppressUnusedWarnings (Pure_6989586621680428781Sym0 :: TyFun a (Const m a) -> Type) | |
Defined in Data.Functor.Const.Singletons Methods suppressUnusedWarnings :: () # | |
| SingI (GetConstSym0 :: TyFun (Const a b) a -> Type) | |
Defined in Data.Functor.Const.Singletons Methods sing :: Sing GetConstSym0 # | |
| SingI (ConstSym0 :: TyFun a (Const a b) -> Type) | |
Defined in Data.Functor.Const.Singletons | |
| SuppressUnusedWarnings (TFHelper_6989586621680428802Sym0 :: TyFun (Const m (a ~> b)) (Const m a ~> Const m b) -> Type) | |
Defined in Data.Functor.Const.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Abs_6989586621680428667Sym0 :: TyFun (Const a b) (Const a b) -> Type) | |
Defined in Data.Functor.Const.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Negate_6989586621680428660Sym0 :: TyFun (Const a b) (Const a b) -> Type) | |
Defined in Data.Functor.Const.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Pred_6989586621680428577Sym0 :: TyFun (Const a b) (Const a b) -> Type) | |
Defined in Data.Functor.Const.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Signum_6989586621680428674Sym0 :: TyFun (Const a b) (Const a b) -> Type) | |
Defined in Data.Functor.Const.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Succ_6989586621680428570Sym0 :: TyFun (Const a b) (Const a b) -> Type) | |
Defined in Data.Functor.Const.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680428628Sym0 :: TyFun (Const a b) (Const a b ~> Const a b) -> Type) | |
Defined in Data.Functor.Const.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680428639Sym0 :: TyFun (Const a b) (Const a b ~> Const a b) -> Type) | |
Defined in Data.Functor.Const.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680428650Sym0 :: TyFun (Const a b) (Const a b ~> Const a b) -> Type) | |
Defined in Data.Functor.Const.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680428689Sym0 :: TyFun (Const a b) (Const a b ~> Const a b) -> Type) | |
Defined in Data.Functor.Const.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680428560Sym0 :: TyFun (Const a b) (Const a b ~> Ordering) -> Type) | |
Defined in Data.Functor.Const.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (EnumFromThenTo_6989586621680428611Sym0 :: TyFun (Const a b) (Const a b ~> (Const a b ~> [Const a b])) -> Type) | |
Defined in Data.Functor.Const.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680428549Sym0 :: TyFun (Const a b) (Const a b ~> Bool) -> Type) | |
Defined in Data.Functor.Const.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (EnumFromTo_6989586621680428599Sym0 :: TyFun (Const a b) (Const a b ~> [Const a b]) -> Type) | |
Defined in Data.Functor.Const.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FromEnum_6989586621680428591Sym0 :: TyFun (Const a b) Nat -> Type) | |
Defined in Data.Functor.Const.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (GetConstSym0 :: TyFun (Const a b) a -> Type) | |
Defined in Data.Functor.Const.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr_6989586621680428763Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (Const m a ~> b)) -> Type) | |
Defined in Data.Functor.Const.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Fmap_6989586621680428717Sym0 :: TyFun (a ~> b) (Const m a ~> Const m b) -> Type) | |
Defined in Data.Functor.Const.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680478603Scrutinee_6989586621680478187Sym0 :: TyFun (a ~> b) (TyFun (t a) (Const b (t ())) -> Type) -> Type) | |
Defined in Data.Traversable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FoldMap_6989586621680428747Sym0 :: TyFun (a ~> m1) (Const m2 a ~> m1) -> Type) | |
Defined in Data.Functor.Const.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FromInteger_6989586621680428681Sym0 :: TyFun Nat (Const a b) -> Type) | |
Defined in Data.Functor.Const.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ToEnum_6989586621680428584Sym0 :: TyFun Nat (Const a b) -> Type) | |
Defined in Data.Functor.Const.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621680428701Sym0 :: TyFun Nat (Const a b ~> (Symbol ~> Symbol)) -> Type) | |
Defined in Data.Functor.Const.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ConstSym0 :: TyFun a (Const a b) -> Type) | |
Defined in Data.Functor.Const.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680478597MkConstSym0 :: TyFun k1 (TyFun k2 (TyFun m6989586621680478093 (Const m6989586621680478093 ()) -> Type) -> Type) -> Type) | |
Defined in Data.Traversable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Fmap_6989586621680428717Sym1 a6989586621680428722 :: TyFun (Const m a) (Const m b) -> Type) | |
Defined in Data.Functor.Const.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680428802Sym1 a6989586621680428807 :: TyFun (Const m a) (Const m b) -> Type) | |
Defined in Data.Functor.Const.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FoldMap_6989586621680428747Sym1 a6989586621680428752 :: TyFun (Const m2 a) m1 -> Type) | |
Defined in Data.Functor.Const.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680428628Sym1 a6989586621680428633 :: TyFun (Const a b) (Const a b) -> Type) | |
Defined in Data.Functor.Const.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680428639Sym1 a6989586621680428644 :: TyFun (Const a b) (Const a b) -> Type) | |
Defined in Data.Functor.Const.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680428650Sym1 a6989586621680428655 :: TyFun (Const a b) (Const a b) -> Type) | |
Defined in Data.Functor.Const.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680428689Sym1 a6989586621680428694 :: TyFun (Const a b) (Const a b) -> Type) | |
Defined in Data.Functor.Const.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680428560Sym1 a6989586621680428565 :: TyFun (Const a b) Ordering -> Type) | |
Defined in Data.Functor.Const.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (EnumFromThenTo_6989586621680428611Sym1 a6989586621680428617 :: TyFun (Const a b) (Const a b ~> [Const a b]) -> Type) | |
Defined in Data.Functor.Const.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621680428701Sym1 a6989586621680428709 :: TyFun (Const a b) (Symbol ~> Symbol) -> Type) | |
Defined in Data.Functor.Const.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680428549Sym1 a6989586621680428554 :: TyFun (Const a b) Bool -> Type) | |
Defined in Data.Functor.Const.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (EnumFromTo_6989586621680428599Sym1 a6989586621680428604 :: TyFun (Const a b) [Const a b] -> Type) | |
Defined in Data.Functor.Const.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (LiftA2_6989586621680428789Sym0 :: TyFun (a ~> (b ~> c)) (Const m a ~> (Const m b ~> Const m c)) -> Type) | |
Defined in Data.Functor.Const.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Traverse_6989586621680478758Sym0 :: TyFun (a ~> f b) (Const m a ~> f (Const m b)) -> Type) | |
Defined in Data.Traversable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680428732Sym0 :: TyFun a (Const m b ~> Const m a) -> Type) | |
Defined in Data.Functor.Const.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr_6989586621680428763Sym1 a6989586621680428769 :: TyFun b (Const m a ~> b) -> Type) | |
Defined in Data.Functor.Const.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680478597MkConstSym1 f6989586621680478595 :: TyFun k2 (TyFun m6989586621680478093 (Const m6989586621680478093 ()) -> Type) -> Type) | |
Defined in Data.Traversable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680478603Scrutinee_6989586621680478187Sym1 f6989586621680478595 :: TyFun (t a) (Const b (t ())) -> Type) | |
Defined in Data.Traversable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (LiftA2_6989586621680428789Sym1 a6989586621680428795 :: TyFun (Const m a) (Const m b ~> Const m c) -> Type) | |
Defined in Data.Functor.Const.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr_6989586621680428763Sym2 a6989586621680428769 a6989586621680428770 :: TyFun (Const m a) b -> Type) | |
Defined in Data.Functor.Const.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Traverse_6989586621680478758Sym1 a6989586621680478763 :: TyFun (Const m a) (f (Const m b)) -> Type) | |
Defined in Data.Traversable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (EnumFromThenTo_6989586621680428611Sym2 a6989586621680428617 a6989586621680428618 :: TyFun (Const a b) [Const a b] -> Type) | |
Defined in Data.Functor.Const.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680428732Sym1 a6989586621680428737 :: TyFun (Const m b) (Const m a) -> Type) | |
Defined in Data.Functor.Const.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680478597MkConstSym2 f6989586621680478595 x6989586621680478596 :: TyFun m6989586621680478093 (Const m6989586621680478093 ()) -> Type) | |
Defined in Data.Traversable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (LiftA2_6989586621680428789Sym2 a6989586621680428795 a6989586621680428796 :: TyFun (Const m b) (Const m c) -> Type) | |
Defined in Data.Functor.Const.Singletons Methods suppressUnusedWarnings :: () # | |
| 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 # | |
| IsString a => IsString (Const a b) | Since: base-4.9.0.0 |
Defined in Data.String Methods fromString :: String -> Const a b # | |
| Storable a => Storable (Const a b) | Since: base-4.9.0.0 |
Defined in Data.Functor.Const | |
| Monoid a => Monoid (Const a b) | Since: base-4.9.0.0 |
| Semigroup a => Semigroup (Const a b) | Since: base-4.9.0.0 |
| 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] # | |
| 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 # | |
| 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 # | |
| Generic (Const a b) | |
| 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 # | |
| Num a => Num (Const a b) | Since: base-4.9.0.0 |
Defined in Data.Functor.Const | |
| Read a => Read (Const a b) | This instance would be equivalent to the derived instances of the
Since: base-4.8.0.0 |
| 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) # | |
| Real a => Real (Const a b) | Since: base-4.9.0.0 |
Defined in Data.Functor.Const Methods toRational :: Const a b -> Rational # | |
| 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 |
| NFData a => NFData (Const a b) | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| Eq a => Eq (Const a b) | Since: base-4.9.0.0 |
| Ord a => Ord (Const a b) | Since: base-4.9.0.0 |
| Hashable a => Hashable (Const a b) | |
Defined in Data.Hashable.Class | |
| Wrapped (Const a x) | |
| Ring a => Ring (Const a b) | |
Defined in Data.Semiring | |
| Semiring a => Semiring (Const a b) | |
| 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 # 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 # 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)) # safeHead :: Const a b -> Maybe (Element (Const a b)) # safeMaximum :: Const a b -> Maybe (Element (Const a b)) # safeMinimum :: Const a b -> Maybe (Element (Const a b)) # safeFoldr1 :: (Element (Const a b) -> Element (Const a b) -> Element (Const a b)) -> Const a b -> Maybe (Element (Const a b)) # safeFoldl1 :: (Element (Const a b) -> Element (Const a b) -> Element (Const a b)) -> Const a b -> Maybe (Element (Const a b)) # | |
| Unbox a => Unbox (Const a b) | |
Defined in Data.Vector.Unboxed.Base | |
| 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.Functor.Const.Singletons | |
| SDecide a => TestEquality (SConst :: Const a b -> Type) | |
Defined in Data.Functor.Const.Singletons | |
| type MapM (arg1 :: a ~> m1 b) (arg2 :: Const m2 a) | |
| type Traverse (a2 :: a1 ~> f b) (a3 :: Const m a1) | |
| type LiftA2 (a2 :: a1 ~> (b ~> c)) (a3 :: Const m a1) (a4 :: Const m b) | |
| type Fmap (a2 :: a1 ~> b) (a3 :: Const m a1) | |
| type FoldMap (a2 :: a1 ~> k2) (a3 :: Const m a1) | |
| type Foldl (arg :: b ~> (a ~> b)) (arg1 :: b) (arg2 :: Const m a) | |
| type Foldl' (arg :: b ~> (a ~> b)) (arg1 :: b) (arg2 :: Const m a) | |
| type Foldr (a2 :: a1 ~> (k2 ~> k2)) (a3 :: k2) (a4 :: Const m a1) | |
| type Foldr' (arg :: a ~> (b ~> b)) (arg1 :: b) (arg2 :: Const m a) | |
| type Rep1 (Const a :: k -> Type) | Since: base-4.9.0.0 |
Defined in Data.Functor.Const | |
| type Pure (a :: k1) | |
| type Elem (arg :: a) (arg1 :: Const m a) | |
| type Foldl1 (arg :: a ~> (a ~> a)) (arg1 :: Const m a) | |
| type Foldr1 (arg :: a ~> (a ~> a)) (arg1 :: Const m a) | |
| type (a1 :: k1) <$ (a2 :: Const m b) | |
| type Apply (ShowsPrec_6989586621680428701Sym0 :: TyFun Nat (Const a b ~> (Symbol ~> Symbol)) -> Type) (a6989586621680428709 :: Nat) | |
| type Apply (Let6989586621680478597MkConstSym0 :: TyFun k1 (TyFun k2 (TyFun m6989586621680478093 (Const m6989586621680478093 ()) -> Type) -> Type) -> Type) (f6989586621680478595 :: k1) | |
Defined in Data.Traversable.Singletons type Apply (Let6989586621680478597MkConstSym0 :: TyFun k1 (TyFun k2 (TyFun m6989586621680478093 (Const m6989586621680478093 ()) -> Type) -> Type) -> Type) (f6989586621680478595 :: k1) = Let6989586621680478597MkConstSym1 f6989586621680478595 :: TyFun k2 (TyFun m6989586621680478093 (Const m6989586621680478093 ()) -> Type) -> Type | |
| type Apply (TFHelper_6989586621680428732Sym0 :: TyFun a (Const m b ~> Const m a) -> Type) (a6989586621680428737 :: a) | |
| type Apply (Foldr_6989586621680428763Sym1 a6989586621680428769 :: TyFun b (Const m a ~> b) -> Type) (a6989586621680428770 :: b) | |
| type Apply (Let6989586621680478597MkConstSym1 f6989586621680478595 :: TyFun k2 (TyFun m6989586621680478093 (Const m6989586621680478093 ()) -> Type) -> Type) (x6989586621680478596 :: k2) | |
Defined in Data.Traversable.Singletons type Apply (Let6989586621680478597MkConstSym1 f6989586621680478595 :: TyFun k2 (TyFun m6989586621680478093 (Const m6989586621680478093 ()) -> Type) -> Type) (x6989586621680478596 :: k2) = Let6989586621680478597MkConstSym2 f6989586621680478595 x6989586621680478596 :: TyFun m6989586621680478093 (Const m6989586621680478093 ()) -> Type | |
| newtype MVector s (Const a b) | |
Defined in Data.Vector.Unboxed.Base | |
| type Apply (Pure_6989586621680428781Sym0 :: TyFun a (Const m a) -> Type) (a6989586621680428785 :: a) | |
| type Apply (FromInteger_6989586621680428681Sym0 :: TyFun Nat (Const a b) -> Type) (a6989586621680428685 :: Nat) | |
| type Apply (ToEnum_6989586621680428584Sym0 :: TyFun Nat (Const a b) -> Type) (a6989586621680428588 :: Nat) | |
| type Apply (ConstSym0 :: TyFun a (Const a b) -> Type) (a6989586621680426752 :: a) | |
| type Apply (Let6989586621680478597MkConstSym2 f6989586621680478595 x6989586621680478596 :: TyFun m (Const m ()) -> Type) (a6989586621680478600 :: m) | |
Defined in Data.Traversable.Singletons | |
| type Apply (Let6989586621680478603Scrutinee_6989586621680478187Sym1 f6989586621680478595 :: TyFun (t a) (Const b (t ())) -> Type) (x6989586621680478596 :: t a) | |
Defined in Data.Traversable.Singletons | |
| type Fold (arg :: Const m1 m2) | |
| type Length (arg :: Const m a) | |
| type Maximum (arg :: Const m a) | |
| type Minimum (arg :: Const m a) | |
| type Null (arg :: Const m a) | |
| type Product (arg :: Const m a) | |
| type Sum (arg :: Const m a) | |
| type ToList (arg :: Const m a) | |
| type Sequence (arg :: Const m1 (m2 a)) | |
| type SequenceA (arg :: Const m (f a)) | |
| type (arg :: Const m a) *> (arg1 :: Const m b) | |
| type (arg :: Const m a) <* (arg1 :: Const m b) | |
| type (a2 :: Const m (a1 ~> b)) <*> (a3 :: Const m a1) | |
| type Apply (Foldr_6989586621680428763Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (Const m a ~> b)) -> Type) (a6989586621680428769 :: a ~> (b ~> b)) | |
| type Apply (Fmap_6989586621680428717Sym0 :: TyFun (a ~> b) (Const m a ~> Const m b) -> Type) (a6989586621680428722 :: a ~> b) | |
| type Apply (Let6989586621680478603Scrutinee_6989586621680478187Sym0 :: TyFun (a ~> b) (TyFun (t a) (Const b (t ())) -> Type) -> Type) (f6989586621680478595 :: a ~> b) | |
Defined in Data.Traversable.Singletons | |
| type Apply (FoldMap_6989586621680428747Sym0 :: TyFun (a ~> m1) (Const m2 a ~> m1) -> Type) (a6989586621680428752 :: a ~> m1) | |
| type Apply (LiftA2_6989586621680428789Sym0 :: TyFun (a ~> (b ~> c)) (Const m a ~> (Const m b ~> Const m c)) -> Type) (a6989586621680428795 :: a ~> (b ~> c)) | |
Defined in Data.Functor.Const.Singletons | |
| type Apply (Traverse_6989586621680478758Sym0 :: TyFun (a ~> f b) (Const m a ~> f (Const m b)) -> Type) (a6989586621680478763 :: a ~> f b) | |
| type Rep (Const a b) | Since: base-4.9.0.0 |
Defined in Data.Functor.Const | |
| type Unwrapped (Const a x) | |
Defined in Control.Lens.Wrapped | |
| type Demote (Const a b) | |
Defined in Data.Functor.Const.Singletons | |
| type Sing | |
Defined in Data.Functor.Const.Singletons | |
| type Mempty | |
Defined in Data.Functor.Const.Singletons | |
| type MaxBound | |
Defined in Data.Functor.Const.Singletons | |
| type MinBound | |
Defined in Data.Functor.Const.Singletons | |
| type Element (Const a b) | |
Defined in Universum.Container.Class | |
| newtype Vector (Const a b) | |
Defined in Data.Vector.Unboxed.Base | |
| type Mconcat (arg :: [Const a b]) | |
| type Sconcat (arg :: NonEmpty (Const a b)) | |
| type FromEnum (a2 :: Const a1 b) | |
| type Pred (a2 :: Const a1 b) | |
| type Succ (a2 :: Const a1 b) | |
| type ToEnum a2 | |
| type Abs (a2 :: Const a1 b) | |
| type FromInteger a2 | |
Defined in Data.Functor.Const.Singletons | |
| type Negate (a2 :: Const a1 b) | |
| type Signum (a2 :: Const a1 b) | |
| type Show_ (arg :: Const a b) | |
| type (arg :: Const a b) /= (arg1 :: Const a b) | |
| type (a2 :: Const a1 b) == (a3 :: Const a1 b) | |
| type Mappend (arg :: Const a b) (arg1 :: Const a b) | |
| type (arg :: Const a b) < (arg1 :: Const a b) | |
| type (arg :: Const a b) <= (arg1 :: Const a b) | |
| type (arg :: Const a b) > (arg1 :: Const a b) | |
| type (arg :: Const a b) >= (arg1 :: Const a b) | |
| type Compare (a2 :: Const a1 b) (a3 :: Const a1 b) | |
| type Max (arg :: Const a b) (arg1 :: Const a b) | |
| type Min (arg :: Const a b) (arg1 :: Const a b) | |
| 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 ShowList (arg :: [Const a b]) arg1 | |
| type EnumFromThenTo (a2 :: Const a1 b) (a3 :: Const a1 b) (a4 :: Const a1 b) | |
| type ShowsPrec a2 (a3 :: Const a1 b) a4 | |
| type Apply (FromEnum_6989586621680428591Sym0 :: TyFun (Const a b) Nat -> Type) (a6989586621680428595 :: Const a b) | |
| type Apply (GetConstSym0 :: TyFun (Const a b) a -> Type) (a6989586621680428539 :: Const a b) | |
Defined in Data.Functor.Const.Singletons | |
| type Apply (FoldMap_6989586621680428747Sym1 a6989586621680428752 :: TyFun (Const m2 a) m1 -> Type) (a6989586621680428753 :: Const m2 a) | |
| type Apply (Compare_6989586621680428560Sym1 a6989586621680428565 :: TyFun (Const a b) Ordering -> Type) (a6989586621680428566 :: Const a b) | |
| type Apply (TFHelper_6989586621680428549Sym1 a6989586621680428554 :: TyFun (Const a b) Bool -> Type) (a6989586621680428555 :: Const a b) | |
| type Apply (Foldr_6989586621680428763Sym2 a6989586621680428769 a6989586621680428770 :: TyFun (Const m a) b -> Type) (a6989586621680428771 :: Const m a) | |
| type Apply (EnumFromTo_6989586621680428599Sym1 a6989586621680428604 :: TyFun (Const a b) [Const a b] -> Type) (a6989586621680428605 :: Const a b) | |
| type Apply (Traverse_6989586621680478758Sym1 a6989586621680478763 :: TyFun (Const m a) (f (Const m b)) -> Type) (a6989586621680478764 :: Const m a) | |
| type Apply (EnumFromThenTo_6989586621680428611Sym2 a6989586621680428617 a6989586621680428618 :: TyFun (Const a b) [Const a b] -> Type) (a6989586621680428619 :: Const a b) | |
Defined in Data.Functor.Const.Singletons | |
| type Apply (TFHelper_6989586621680428802Sym0 :: TyFun (Const m (a ~> b)) (Const m a ~> Const m b) -> Type) (a6989586621680428807 :: Const m (a ~> b)) | |
| type Apply (TFHelper_6989586621680428628Sym0 :: TyFun (Const a b) (Const a b ~> Const a b) -> Type) (a6989586621680428633 :: Const a b) | |
| type Apply (TFHelper_6989586621680428639Sym0 :: TyFun (Const a b) (Const a b ~> Const a b) -> Type) (a6989586621680428644 :: Const a b) | |
| type Apply (TFHelper_6989586621680428650Sym0 :: TyFun (Const a b) (Const a b ~> Const a b) -> Type) (a6989586621680428655 :: Const a b) | |
| type Apply (TFHelper_6989586621680428689Sym0 :: TyFun (Const a b) (Const a b ~> Const a b) -> Type) (a6989586621680428694 :: Const a b) | |
| type Apply (Compare_6989586621680428560Sym0 :: TyFun (Const a b) (Const a b ~> Ordering) -> Type) (a6989586621680428565 :: Const a b) | |
| type Apply (EnumFromThenTo_6989586621680428611Sym0 :: TyFun (Const a b) (Const a b ~> (Const a b ~> [Const a b])) -> Type) (a6989586621680428617 :: Const a b) | |
| type Apply (TFHelper_6989586621680428549Sym0 :: TyFun (Const a b) (Const a b ~> Bool) -> Type) (a6989586621680428554 :: Const a b) | |
| type Apply (EnumFromTo_6989586621680428599Sym0 :: TyFun (Const a b) (Const a b ~> [Const a b]) -> Type) (a6989586621680428604 :: Const a b) | |
| type Apply (EnumFromThenTo_6989586621680428611Sym1 a6989586621680428617 :: TyFun (Const a b) (Const a b ~> [Const a b]) -> Type) (a6989586621680428618 :: Const a b) | |
| type Apply (ShowsPrec_6989586621680428701Sym1 a6989586621680428709 :: TyFun (Const a b) (Symbol ~> Symbol) -> Type) (a6989586621680428710 :: Const a b) | |
| type Apply (LiftA2_6989586621680428789Sym1 a6989586621680428795 :: TyFun (Const m a) (Const m b ~> Const m c) -> Type) (a6989586621680428796 :: Const m a) | |
| type Apply (Abs_6989586621680428667Sym0 :: TyFun (Const a b) (Const a b) -> Type) (a6989586621680428671 :: Const a b) | |
| type Apply (Negate_6989586621680428660Sym0 :: TyFun (Const a b) (Const a b) -> Type) (a6989586621680428664 :: Const a b) | |
| type Apply (Pred_6989586621680428577Sym0 :: TyFun (Const a b) (Const a b) -> Type) (a6989586621680428581 :: Const a b) | |
| type Apply (Signum_6989586621680428674Sym0 :: TyFun (Const a b) (Const a b) -> Type) (a6989586621680428678 :: Const a b) | |
| type Apply (Succ_6989586621680428570Sym0 :: TyFun (Const a b) (Const a b) -> Type) (a6989586621680428574 :: Const a b) | |
| type Apply (Fmap_6989586621680428717Sym1 a6989586621680428722 :: TyFun (Const m a) (Const m b) -> Type) (a6989586621680428723 :: Const m a) | |
| type Apply (TFHelper_6989586621680428802Sym1 a6989586621680428807 :: TyFun (Const m a) (Const m b) -> Type) (a6989586621680428808 :: Const m a) | |
| type Apply (TFHelper_6989586621680428628Sym1 a6989586621680428633 :: TyFun (Const a b) (Const a b) -> Type) (a6989586621680428634 :: Const a b) | |
| type Apply (TFHelper_6989586621680428639Sym1 a6989586621680428644 :: TyFun (Const a b) (Const a b) -> Type) (a6989586621680428645 :: Const a b) | |
| type Apply (TFHelper_6989586621680428650Sym1 a6989586621680428655 :: TyFun (Const a b) (Const a b) -> Type) (a6989586621680428656 :: Const a b) | |
| type Apply (TFHelper_6989586621680428689Sym1 a6989586621680428694 :: TyFun (Const a b) (Const a b) -> Type) (a6989586621680428695 :: Const a b) | |
| type Apply (TFHelper_6989586621680428732Sym1 a6989586621680428737 :: TyFun (Const m b) (Const m a) -> Type) (a6989586621680428738 :: Const m b) | |
| type Apply (LiftA2_6989586621680428789Sym2 a6989586621680428795 a6989586621680428796 :: TyFun (Const m b) (Const m c) -> Type) (a6989586621680428797 :: Const m b) | |
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
prettyCallStack :: CallStack -> String #
Pretty print a CallStack.
Since: base-4.9.0.0
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.
callStack :: HasCallStack => CallStack #
withFrozenCallStack :: HasCallStack => (HasCallStack => a) -> a #
Perform some computation without adding new entries to the CallStack.
Since: base-4.9.0.0
Identity functor and monad. (a non-strict monad)
Since: base-4.8.0.0
Constructors
| Identity | |
Fields
| |
Instances
| Representable Identity | |
| MonadFix Identity | Since: base-4.8.0.0 |
Defined in Data.Functor.Identity | |
| 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 |
| Applicative Identity | Since: base-4.8.0.0 |
| Functor Identity | Since: base-4.8.0.0 |
| Monad Identity | Since: base-4.8.0.0 |
| NFData1 Identity | Since: deepseq-1.4.3.0 |
Defined in Control.DeepSeq | |
| Hashable1 Identity | |
Defined in Data.Hashable.Class | |
| KnownNamedFunctor Identity | |
Defined in Morley.Util.Named | |
| InjValue Identity | |
Defined in Named.Internal | |
| PTraversable Identity | |
| STraversable Identity | |
Defined in Data.Traversable.Singletons 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 (t1 :: Identity (f a)). SApplicative f => Sing t1 -> Sing (Apply SequenceASym0 t1) # 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 (t1 :: Identity (m a)). SMonad m => Sing t1 -> Sing (Apply SequenceSym0 t1) # | |
| Cosieve ReifiedGetter Identity | |
Defined in Control.Lens.Reified Methods cosieve :: ReifiedGetter a b -> Identity a -> b # | |
| Sieve ReifiedGetter Identity | |
Defined in Control.Lens.Reified Methods sieve :: ReifiedGetter a b -> a -> Identity b # | |
| () :=> (Functor Identity) | |
| () :=> (Monad 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)) # | |
| 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 # | |
| IsString a => IsString (Identity a) | Since: base-4.9.0.0 |
Defined in Data.String Methods fromString :: String -> Identity a # | |
| 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 () # | |
| Monoid a => Monoid (Identity a) | Since: base-4.9.0.0 |
| Semigroup a => Semigroup (Identity a) | Since: base-4.9.0.0 |
| 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] # | |
| 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 # | |
| 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 # | |
| Generic (Identity a) | |
| 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 # | |
| Num a => Num (Identity a) | Since: base-4.9.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 |
| 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) # | |
| Real a => Real (Identity a) | Since: base-4.9.0.0 |
Defined in Data.Functor.Identity Methods toRational :: Identity a -> Rational # | |
| 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 |
| NFData a => NFData (Identity a) | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| Eq a => Eq (Identity a) | Since: base-4.8.0.0 |
| Ord a => Ord (Identity a) | Since: base-4.8.0.0 |
Defined in Data.Functor.Identity | |
| Hashable a => Hashable (Identity a) | |
Defined in Data.Hashable.Class | |
| Ixed (Identity a) | |
Defined in Control.Lens.At | |
| Wrapped (Identity a) | |
| HasRPCRepr a => HasRPCRepr (Identity a) | |
Defined in Morley.AsRPC | |
| IsoValue a => IsoValue (Identity a) | |
| Ring a => Ring (Identity a) | |
Defined in Data.Semiring | |
| Semiring a => Semiring (Identity a) | |
| PEq (Identity a) | |
| SEq a => SEq (Identity a) | |
| POrd (Identity a) | |
| SOrd a => SOrd (Identity a) | |
Defined in Data.Ord.Singletons 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) # | |
| PBounded (Identity a) | |
Defined in Data.Singletons.Base.Enum | |
| SBounded a => SBounded (Identity a) | |
Defined in Data.Singletons.Base.Enum | |
| (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 # 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 # 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)) # safeHead :: Identity a -> Maybe (Element (Identity a)) # safeMaximum :: Identity a -> Maybe (Element (Identity a)) # safeMinimum :: Identity a -> Maybe (Element (Identity a)) # safeFoldr1 :: (Element (Identity a) -> Element (Identity a) -> Element (Identity a)) -> Identity a -> Maybe (Element (Identity a)) # safeFoldl1 :: (Element (Identity a) -> Element (Identity a) -> Element (Identity a)) -> Identity a -> Maybe (Element (Identity a)) # | |
| Unbox a => Unbox (Identity a) | |
Defined in Data.Vector.Unboxed.Base | |
| Generic1 Identity | |
| t ~ Identity b => Rewrapped (Identity a) t | |
Defined in Control.Lens.Wrapped | |
| SDecide a => TestCoercion (SIdentity :: Identity a -> Type) | |
Defined in Data.Singletons.Base.Instances | |
| SDecide a => TestEquality (SIdentity :: Identity a -> Type) | |
Defined in Data.Singletons.Base.Instances | |
| (Bits a) :=> (Bits (Identity a)) | |
| (Monoid a) :=> (Monoid (Identity a)) | |
| (Semigroup a) :=> (Semigroup (Identity a)) | |
| (Bounded a) :=> (Bounded (Identity a)) | |
| (Enum a) :=> (Enum (Identity a)) | |
| (Floating a) :=> (Floating (Identity a)) | |
| (RealFloat a) :=> (RealFloat (Identity a)) | |
| (Num a) :=> (Num (Identity a)) | |
| (Read a) :=> (Read (Identity a)) | |
| (Fractional a) :=> (Fractional (Identity a)) | |
Defined in Data.Constraint Methods ins :: Fractional a :- Fractional (Identity a) # | |
| (Integral a) :=> (Integral (Identity a)) | |
| (Real a) :=> (Real (Identity a)) | |
| (RealFrac a) :=> (RealFrac (Identity a)) | |
| (Show a) :=> (Show (Identity a)) | |
| (Eq a) :=> (Eq (Identity a)) | |
| (Ord a) :=> (Ord (Identity a)) | |
| Field1 (Identity a) (Identity b) a b | |
| SingI (RunIdentitySym0 :: TyFun (Identity a) a -> Type) | |
Defined in Data.Singletons.Base.Instances Methods sing :: Sing RunIdentitySym0 # | |
| SingI (IdentitySym0 :: TyFun a (Identity a) -> Type) | |
Defined in Data.Singletons.Base.Instances Methods sing :: Sing IdentitySym0 # | |
| SuppressUnusedWarnings (Abs_6989586621680390860Sym0 :: TyFun (Identity a) (Identity a) -> Type) | |
Defined in Data.Functor.Identity.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Negate_6989586621680390853Sym0 :: TyFun (Identity a) (Identity a) -> Type) | |
Defined in Data.Functor.Identity.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Pred_6989586621680390662Sym0 :: TyFun (Identity a) (Identity a) -> Type) | |
Defined in Data.Functor.Identity.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Signum_6989586621680390867Sym0 :: TyFun (Identity a) (Identity a) -> Type) | |
Defined in Data.Functor.Identity.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Succ_6989586621680390655Sym0 :: TyFun (Identity a) (Identity a) -> Type) | |
Defined in Data.Functor.Identity.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680390821Sym0 :: TyFun (Identity a) (Identity a ~> Identity a) -> Type) | |
Defined in Data.Functor.Identity.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680390832Sym0 :: TyFun (Identity a) (Identity a ~> Identity a) -> Type) | |
Defined in Data.Functor.Identity.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680390843Sym0 :: TyFun (Identity a) (Identity a ~> Identity a) -> Type) | |
Defined in Data.Functor.Identity.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680390915Sym0 :: TyFun (Identity a) (Identity a ~> Identity a) -> Type) | |
Defined in Data.Functor.Identity.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679181827Sym0 :: TyFun (Identity a) (Identity a ~> Ordering) -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (EnumFromThenTo_6989586621680390696Sym0 :: TyFun (Identity a) (Identity a ~> (Identity a ~> [Identity a])) -> Type) | |
Defined in Data.Functor.Identity.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679131006Sym0 :: TyFun (Identity a) (Identity a ~> Bool) -> Type) | |
Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (EnumFromTo_6989586621680390684Sym0 :: TyFun (Identity a) (Identity a ~> [Identity a]) -> Type) | |
Defined in Data.Functor.Identity.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Null_6989586621680392273Sym0 :: TyFun (Identity a) Bool -> Type) | |
Defined in Data.Functor.Identity.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FromEnum_6989586621680390676Sym0 :: TyFun (Identity a) Nat -> Type) | |
Defined in Data.Functor.Identity.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Length_6989586621680392253Sym0 :: TyFun (Identity a) Nat -> Type) | |
Defined in Data.Functor.Identity.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ToList_6989586621680392293Sym0 :: TyFun (Identity a) [a] -> Type) | |
Defined in Data.Functor.Identity.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Maximum_6989586621680392259Sym0 :: TyFun (Identity a) a -> Type) | |
Defined in Data.Functor.Identity.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Minimum_6989586621680392266Sym0 :: TyFun (Identity a) a -> Type) | |
Defined in Data.Functor.Identity.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Product_6989586621680392279Sym0 :: TyFun (Identity a) a -> Type) | |
Defined in Data.Functor.Identity.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Sum_6989586621680392286Sym0 :: TyFun (Identity a) a -> Type) | |
Defined in Data.Functor.Identity.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (RunIdentitySym0 :: TyFun (Identity a) a -> Type) | |
Defined in Data.Singletons.Base.Instances Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldl1_6989586621680392198Sym0 :: TyFun (a ~> (a ~> a)) (Identity a ~> a) -> Type) | |
Defined in Data.Functor.Identity.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr1_6989586621680392244Sym0 :: TyFun (a ~> (a ~> a)) (Identity a ~> a) -> Type) | |
Defined in Data.Functor.Identity.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FromInteger_6989586621680390874Sym0 :: TyFun Nat (Identity a) -> Type) | |
Defined in Data.Functor.Identity.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ToEnum_6989586621680390669Sym0 :: TyFun Nat (Identity a) -> Type) | |
Defined in Data.Functor.Identity.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621680390927Sym0 :: TyFun Nat (Identity a ~> (Symbol ~> Symbol)) -> Type) | |
Defined in Data.Functor.Identity.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Pure_6989586621680392300Sym0 :: TyFun a (Identity a) -> Type) | |
Defined in Data.Functor.Identity.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (IdentitySym0 :: TyFun a (Identity a) -> Type) | |
Defined in Data.Singletons.Base.Instances Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Elem_6989586621680392157Sym0 :: TyFun a (Identity a ~> Bool) -> Type) | |
Defined in Data.Functor.Identity.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680392310Sym0 :: TyFun (Identity (a ~> b)) (Identity a ~> Identity b) -> Type) | |
Defined in Data.Functor.Identity.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680390821Sym1 a6989586621680390826 :: TyFun (Identity a) (Identity a) -> Type) | |
Defined in Data.Functor.Identity.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680390832Sym1 a6989586621680390837 :: TyFun (Identity a) (Identity a) -> Type) | |
Defined in Data.Functor.Identity.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680390843Sym1 a6989586621680390848 :: TyFun (Identity a) (Identity a) -> Type) | |
Defined in Data.Functor.Identity.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680390915Sym1 a6989586621680390920 :: TyFun (Identity a) (Identity a) -> Type) | |
Defined in Data.Functor.Identity.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679181827Sym1 a6989586621679181832 :: TyFun (Identity a) Ordering -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (EnumFromThenTo_6989586621680390696Sym1 a6989586621680390702 :: TyFun (Identity a) (Identity a ~> [Identity a]) -> Type) | |
Defined in Data.Functor.Identity.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680392336Sym0 :: TyFun (Identity a) ((a ~> Identity b) ~> Identity b) -> Type) | |
Defined in Data.Functor.Identity.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621680390927Sym1 a6989586621680390935 :: TyFun (Identity a) (Symbol ~> Symbol) -> Type) | |
Defined in Data.Functor.Identity.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679131006Sym1 a6989586621679131011 :: TyFun (Identity a) Bool -> Type) | |
Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Elem_6989586621680392157Sym1 a6989586621680392162 :: TyFun (Identity a) Bool -> Type) | |
Defined in Data.Functor.Identity.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (EnumFromTo_6989586621680390684Sym1 a6989586621680390689 :: TyFun (Identity a) [Identity a] -> Type) | |
Defined in Data.Functor.Identity.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldl1_6989586621680392198Sym1 a6989586621680392203 :: TyFun (Identity a) a -> Type) | |
Defined in Data.Functor.Identity.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr1_6989586621680392244Sym1 a6989586621680392249 :: TyFun (Identity a) a -> Type) | |
Defined in Data.Functor.Identity.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr'_6989586621680392224Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (Identity a ~> b)) -> Type) | |
Defined in Data.Functor.Identity.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr_6989586621680392209Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (Identity a ~> b)) -> Type) | |
Defined in Data.Functor.Identity.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Fmap_6989586621680390943Sym0 :: TyFun (a ~> b) (Identity a ~> Identity b) -> Type) | |
Defined in Data.Functor.Identity.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FoldMap_6989586621680392146Sym0 :: TyFun (a ~> m) (Identity a ~> m) -> Type) | |
Defined in Data.Functor.Identity.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldl'_6989586621680392184Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (Identity a ~> b)) -> Type) | |
Defined in Data.Functor.Identity.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldl_6989586621680392169Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (Identity a ~> b)) -> Type) | |
Defined in Data.Functor.Identity.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680390954Sym0 :: TyFun a (Identity b ~> Identity a) -> Type) | |
Defined in Data.Functor.Identity.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Fmap_6989586621680390943Sym1 a6989586621680390948 :: TyFun (Identity a) (Identity b) -> Type) | |
Defined in Data.Functor.Identity.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680392310Sym1 a6989586621680392315 :: TyFun (Identity a) (Identity b) -> Type) | |
Defined in Data.Functor.Identity.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (EnumFromThenTo_6989586621680390696Sym2 a6989586621680390702 a6989586621680390703 :: TyFun (Identity a) [Identity a] -> Type) | |
Defined in Data.Functor.Identity.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FoldMap_6989586621680392146Sym1 a6989586621680392151 :: TyFun (Identity a) m -> Type) | |
Defined in Data.Functor.Identity.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680390954Sym1 a6989586621680390959 :: TyFun (Identity b) (Identity a) -> Type) | |
Defined in Data.Functor.Identity.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680392336Sym1 a6989586621680392341 :: TyFun (a ~> Identity b) (Identity b) -> Type) | |
Defined in Data.Functor.Identity.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (LiftA2_6989586621680392322Sym0 :: TyFun (a ~> (b ~> c)) (Identity a ~> (Identity b ~> Identity c)) -> Type) | |
Defined in Data.Functor.Identity.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680478616Scrutinee_6989586621680478184Sym0 :: TyFun (a ~> b) (TyFun (t a) (Identity (t b)) -> Type) -> Type) | |
Defined in Data.Traversable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Traverse_6989586621680478824Sym0 :: TyFun (a ~> f b) (Identity a ~> f (Identity b)) -> Type) | |
Defined in Data.Traversable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldl'_6989586621680392184Sym1 a6989586621680392190 :: TyFun b (Identity a ~> b) -> Type) | |
Defined in Data.Functor.Identity.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldl_6989586621680392169Sym1 a6989586621680392175 :: TyFun b (Identity a ~> b) -> Type) | |
Defined in Data.Functor.Identity.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr'_6989586621680392224Sym1 a6989586621680392236 :: TyFun b (Identity a ~> b) -> Type) | |
Defined in Data.Functor.Identity.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr_6989586621680392209Sym1 a6989586621680392215 :: TyFun b (Identity a ~> b) -> Type) | |
Defined in Data.Functor.Identity.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (LiftA2_6989586621680392322Sym1 a6989586621680392328 :: TyFun (Identity a) (Identity b ~> Identity c) -> Type) | |
Defined in Data.Functor.Identity.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldl'_6989586621680392184Sym2 a6989586621680392190 a6989586621680392191 :: TyFun (Identity a) b -> Type) | |
Defined in Data.Functor.Identity.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldl_6989586621680392169Sym2 a6989586621680392175 a6989586621680392176 :: TyFun (Identity a) b -> Type) | |
Defined in Data.Functor.Identity.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr'_6989586621680392224Sym2 a6989586621680392236 a6989586621680392237 :: TyFun (Identity a) b -> Type) | |
Defined in Data.Functor.Identity.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr_6989586621680392209Sym2 a6989586621680392215 a6989586621680392216 :: TyFun (Identity a) b -> Type) | |
Defined in Data.Functor.Identity.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Traverse_6989586621680478824Sym1 a6989586621680478829 :: TyFun (Identity a) (f (Identity b)) -> Type) | |
Defined in Data.Traversable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680478616Scrutinee_6989586621680478184Sym1 f6989586621680478614 :: TyFun (t a) (Identity (t b)) -> Type) | |
Defined in Data.Traversable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (LiftA2_6989586621680392322Sym2 a6989586621680392328 a6989586621680392329 :: TyFun (Identity b) (Identity c) -> Type) | |
Defined in Data.Functor.Identity.Singletons Methods suppressUnusedWarnings :: () # | |
| (HasAnnotation a, KnownSymbol name) => HasAnnotation (NamedF Identity a name) | |
Defined in Lorentz.Annotation Methods getAnnotation :: FollowEntrypointFlag -> Notes (ToT (NamedF Identity a name)) # | |
| Unwrappable (NamedF Identity a name) | |
Defined in Lorentz.Wrappable Associated Types type Unwrappabled (NamedF Identity a name) # | |
| Wrappable (NamedF Identity a name) | |
Defined in Lorentz.Wrappable | |
| HasRPCRepr a => HasRPCRepr (NamedF Identity a name) | |
Defined in Morley.AsRPC | |
| IsoValue a => IsoValue (NamedF Identity a name) | |
| type Rep Identity | |
Defined in Data.Functor.Rep | |
| type Pure (a :: k1) | |
| type Return (arg :: a) | |
| type Fold (arg :: Identity m) | |
| type Length (a2 :: Identity a1) | |
| type Maximum (a :: Identity k2) | |
| type Minimum (a :: Identity k2) | |
| type Null (a2 :: Identity a1) | |
| type Product (a :: Identity k2) | |
| type Sum (a :: Identity k2) | |
| type ToList (a2 :: Identity a1) | |
| 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 Sequence (arg :: Identity (m a)) | |
| type SequenceA (arg :: Identity (f a)) | |
| type (arg :: Identity a) *> (arg1 :: Identity b) | |
| type (a1 :: k1) <$ (a2 :: Identity b) | |
| type (arg :: Identity a) <* (arg1 :: Identity b) | |
| type (a2 :: Identity (a1 ~> b)) <*> (a3 :: Identity a1) | |
| type (arg :: Identity a) >> (arg1 :: Identity b) | |
| type (a2 :: Identity a1) >>= (a3 :: a1 ~> Identity b) | |
| type Fmap (a2 :: a1 ~> b) (a3 :: Identity a1) | |
| type FoldMap (a2 :: a1 ~> k2) (a3 :: Identity a1) | |
| type Foldl (a2 :: k2 ~> (a1 ~> k2)) (a3 :: k2) (a4 :: Identity a1) | |
| type Foldl' (a2 :: k2 ~> (a1 ~> k2)) (a3 :: k2) (a4 :: Identity a1) | |
| type Foldr (a2 :: a1 ~> (k2 ~> k2)) (a3 :: k2) (a4 :: Identity a1) | |
| type Foldr' (a2 :: a1 ~> (k2 ~> k2)) (a3 :: k2) (a4 :: Identity a1) | |
| type MapM (arg1 :: a ~> m b) (arg2 :: Identity a) | |
| type Traverse (a2 :: a1 ~> f b) (a3 :: Identity a1) | |
| type LiftA2 (a2 :: a1 ~> (b ~> c)) (a3 :: Identity a1) (a4 :: Identity b) | |
| newtype MVector s (Identity a) | |
Defined in Data.Vector.Unboxed.Base | |
| type Apply (FromInteger_6989586621680390874Sym0 :: TyFun Nat (Identity a) -> Type) (a6989586621680390878 :: Nat) | |
| type Apply (ToEnum_6989586621680390669Sym0 :: TyFun Nat (Identity a) -> Type) (a6989586621680390673 :: Nat) | |
| type Apply (Pure_6989586621680392300Sym0 :: TyFun a (Identity a) -> Type) (a6989586621680392306 :: a) | |
Defined in Data.Functor.Identity.Singletons | |
| type Apply (IdentitySym0 :: TyFun a (Identity a) -> Type) (a6989586621679029145 :: a) | |
Defined in Data.Singletons.Base.Instances | |
| type Apply (ShowsPrec_6989586621680390927Sym0 :: TyFun Nat (Identity a ~> (Symbol ~> Symbol)) -> Type) (a6989586621680390935 :: Nat) | |
| type Apply (Elem_6989586621680392157Sym0 :: TyFun a (Identity a ~> Bool) -> Type) (a6989586621680392162 :: a) | |
| type Apply (TFHelper_6989586621680390954Sym0 :: TyFun a (Identity b ~> Identity a) -> Type) (a6989586621680390959 :: a) | |
| type Apply (Foldl'_6989586621680392184Sym1 a6989586621680392190 :: TyFun b (Identity a ~> b) -> Type) (a6989586621680392191 :: b) | |
| type Apply (Foldl_6989586621680392169Sym1 a6989586621680392175 :: TyFun b (Identity a ~> b) -> Type) (a6989586621680392176 :: b) | |
| type Apply (Foldr'_6989586621680392224Sym1 a6989586621680392236 :: TyFun b (Identity a ~> b) -> Type) (a6989586621680392237 :: b) | |
| type Apply (Foldr_6989586621680392209Sym1 a6989586621680392215 :: TyFun b (Identity a ~> b) -> Type) (a6989586621680392216 :: b) | |
| type Rep (Identity a) | Since: base-4.8.0.0 |
Defined in Data.Functor.Identity | |
| 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 AsRPC (Identity a) | |
Defined in Morley.AsRPC | |
| type ToT (Identity a) | |
Defined in Morley.Michelson.Typed.Haskell.Value | |
| type Demote (Identity a) | |
Defined in Data.Singletons.Base.Instances | |
| type Sing | |
Defined in Data.Singletons.Base.Instances | |
| type Mempty | |
Defined in Data.Functor.Identity.Singletons | |
| type MaxBound | |
Defined in Data.Singletons.Base.Enum | |
| type MinBound | |
Defined in Data.Singletons.Base.Enum | |
| type Element (Identity a) | |
Defined in Universum.Container.Class | |
| newtype Vector (Identity a) | |
Defined in Data.Vector.Unboxed.Base | |
| type Rep1 Identity | Since: base-4.8.0.0 |
Defined in Data.Functor.Identity | |
| type Mconcat (arg :: [Identity a]) | |
| type Sconcat (arg :: NonEmpty (Identity a)) | |
| type FromEnum (a2 :: Identity a1) | |
| type Pred (a2 :: Identity a1) | |
| type Succ (a2 :: Identity a1) | |
| type ToEnum a2 | |
| type Abs (a2 :: Identity a1) | |
| type FromInteger a2 | |
Defined in Data.Functor.Identity.Singletons | |
| type Negate (a2 :: Identity a1) | |
| type Signum (a2 :: Identity a1) | |
| type Show_ (arg :: Identity a) | |
| type (arg1 :: Identity a) /= (arg2 :: Identity a) | |
| type (a2 :: Identity a1) == (a3 :: Identity a1) | |
| type Mappend (arg :: Identity a) (arg1 :: 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 Max (arg1 :: Identity a) (arg2 :: Identity a) | |
| type Min (arg1 :: Identity a) (arg2 :: Identity a) | |
| 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 ShowList (arg :: [Identity a]) arg1 | |
| type EnumFromThenTo (a2 :: Identity a1) (a3 :: Identity a1) (a4 :: Identity a1) | |
| type ShowsPrec a2 (a3 :: Identity a1) a4 | |
| type Apply (Null_6989586621680392273Sym0 :: TyFun (Identity a) Bool -> Type) (a6989586621680392277 :: Identity a) | |
| type Apply (FromEnum_6989586621680390676Sym0 :: TyFun (Identity a) Nat -> Type) (a6989586621680390680 :: Identity a) | |
| type Apply (Length_6989586621680392253Sym0 :: TyFun (Identity a) Nat -> Type) (a6989586621680392257 :: Identity a) | |
| type Apply (Maximum_6989586621680392259Sym0 :: TyFun (Identity a) a -> Type) (a6989586621680392263 :: Identity a) | |
| type Apply (Minimum_6989586621680392266Sym0 :: TyFun (Identity a) a -> Type) (a6989586621680392270 :: Identity a) | |
| type Apply (Product_6989586621680392279Sym0 :: TyFun (Identity a) a -> Type) (a6989586621680392283 :: Identity a) | |
| type Apply (Sum_6989586621680392286Sym0 :: TyFun (Identity a) a -> Type) (a6989586621680392290 :: Identity a) | |
| type Apply (RunIdentitySym0 :: TyFun (Identity a) a -> Type) (a6989586621679029148 :: Identity a) | |
Defined in Data.Singletons.Base.Instances type Apply (RunIdentitySym0 :: TyFun (Identity a) a -> Type) (a6989586621679029148 :: Identity a) = RunIdentity a6989586621679029148 | |
| type Apply (Compare_6989586621679181827Sym1 a6989586621679181832 :: TyFun (Identity a) Ordering -> Type) (a6989586621679181833 :: Identity a) | |
| type Apply (TFHelper_6989586621679131006Sym1 a6989586621679131011 :: TyFun (Identity a) Bool -> Type) (a6989586621679131012 :: Identity a) | |
| type Apply (Elem_6989586621680392157Sym1 a6989586621680392162 :: TyFun (Identity a) Bool -> Type) (a6989586621680392163 :: Identity a) | |
| type Apply (Foldl1_6989586621680392198Sym1 a6989586621680392203 :: TyFun (Identity a) a -> Type) (a6989586621680392204 :: Identity a) | |
| type Apply (Foldr1_6989586621680392244Sym1 a6989586621680392249 :: TyFun (Identity a) a -> Type) (a6989586621680392250 :: Identity a) | |
| type Apply (FoldMap_6989586621680392146Sym1 a6989586621680392151 :: TyFun (Identity a) m -> Type) (a6989586621680392152 :: Identity a) | |
| type Apply (Foldl'_6989586621680392184Sym2 a6989586621680392190 a6989586621680392191 :: TyFun (Identity a) b -> Type) (a6989586621680392192 :: Identity a) | |
| type Apply (Foldl_6989586621680392169Sym2 a6989586621680392175 a6989586621680392176 :: TyFun (Identity a) b -> Type) (a6989586621680392177 :: Identity a) | |
| type Apply (Foldr'_6989586621680392224Sym2 a6989586621680392236 a6989586621680392237 :: TyFun (Identity a) b -> Type) (a6989586621680392238 :: Identity a) | |
| type Apply (Foldr_6989586621680392209Sym2 a6989586621680392215 a6989586621680392216 :: TyFun (Identity a) b -> Type) (a6989586621680392217 :: Identity a) | |
| type Apply (Abs_6989586621680390860Sym0 :: TyFun (Identity a) (Identity a) -> Type) (a6989586621680390864 :: Identity a) | |
| type Apply (Negate_6989586621680390853Sym0 :: TyFun (Identity a) (Identity a) -> Type) (a6989586621680390857 :: Identity a) | |
| type Apply (Pred_6989586621680390662Sym0 :: TyFun (Identity a) (Identity a) -> Type) (a6989586621680390666 :: Identity a) | |
| type Apply (Signum_6989586621680390867Sym0 :: TyFun (Identity a) (Identity a) -> Type) (a6989586621680390871 :: Identity a) | |
| type Apply (Succ_6989586621680390655Sym0 :: TyFun (Identity a) (Identity a) -> Type) (a6989586621680390659 :: Identity a) | |
| type Apply (ToList_6989586621680392293Sym0 :: TyFun (Identity a) [a] -> Type) (a6989586621680392297 :: Identity a) | |
| type Apply (TFHelper_6989586621680390821Sym1 a6989586621680390826 :: TyFun (Identity a) (Identity a) -> Type) (a6989586621680390827 :: Identity a) | |
| type Apply (TFHelper_6989586621680390832Sym1 a6989586621680390837 :: TyFun (Identity a) (Identity a) -> Type) (a6989586621680390838 :: Identity a) | |
| type Apply (TFHelper_6989586621680390843Sym1 a6989586621680390848 :: TyFun (Identity a) (Identity a) -> Type) (a6989586621680390849 :: Identity a) | |
| type Apply (TFHelper_6989586621680390915Sym1 a6989586621680390920 :: TyFun (Identity a) (Identity a) -> Type) (a6989586621680390921 :: Identity a) | |
| type Apply (EnumFromTo_6989586621680390684Sym1 a6989586621680390689 :: TyFun (Identity a) [Identity a] -> Type) (a6989586621680390690 :: Identity a) | |
| type Apply (Fmap_6989586621680390943Sym1 a6989586621680390948 :: TyFun (Identity a) (Identity b) -> Type) (a6989586621680390949 :: Identity a) | |
| type Apply (TFHelper_6989586621680392310Sym1 a6989586621680392315 :: TyFun (Identity a) (Identity b) -> Type) (a6989586621680392316 :: Identity a) | |
| type Apply (EnumFromThenTo_6989586621680390696Sym2 a6989586621680390702 a6989586621680390703 :: TyFun (Identity a) [Identity a] -> Type) (a6989586621680390704 :: Identity a) | |
Defined in Data.Functor.Identity.Singletons | |
| type Apply (TFHelper_6989586621680390954Sym1 a6989586621680390959 :: TyFun (Identity b) (Identity a) -> Type) (a6989586621680390960 :: Identity b) | |
| type Apply (Traverse_6989586621680478824Sym1 a6989586621680478829 :: TyFun (Identity a) (f (Identity b)) -> Type) (a6989586621680478830 :: Identity a) | |
| type Apply (Let6989586621680478616Scrutinee_6989586621680478184Sym1 f6989586621680478614 :: TyFun (t a) (Identity (t b)) -> Type) (x6989586621680478615 :: t a) | |
Defined in Data.Traversable.Singletons | |
| type Apply (LiftA2_6989586621680392322Sym2 a6989586621680392328 a6989586621680392329 :: TyFun (Identity b) (Identity c) -> Type) (a6989586621680392330 :: Identity b) | |
Defined in Data.Functor.Identity.Singletons | |
| type Apply (TFHelper_6989586621680390821Sym0 :: TyFun (Identity a) (Identity a ~> Identity a) -> Type) (a6989586621680390826 :: Identity a) | |
| type Apply (TFHelper_6989586621680390832Sym0 :: TyFun (Identity a) (Identity a ~> Identity a) -> Type) (a6989586621680390837 :: Identity a) | |
| type Apply (TFHelper_6989586621680390843Sym0 :: TyFun (Identity a) (Identity a ~> Identity a) -> Type) (a6989586621680390848 :: Identity a) | |
| type Apply (TFHelper_6989586621680390915Sym0 :: TyFun (Identity a) (Identity a ~> Identity a) -> Type) (a6989586621680390920 :: Identity a) | |
| type Apply (Compare_6989586621679181827Sym0 :: TyFun (Identity a) (Identity a ~> Ordering) -> Type) (a6989586621679181832 :: Identity a) | |
| type Apply (EnumFromThenTo_6989586621680390696Sym0 :: TyFun (Identity a) (Identity a ~> (Identity a ~> [Identity a])) -> Type) (a6989586621680390702 :: Identity a) | |
| type Apply (TFHelper_6989586621679131006Sym0 :: TyFun (Identity a) (Identity a ~> Bool) -> Type) (a6989586621679131011 :: Identity a) | |
| type Apply (EnumFromTo_6989586621680390684Sym0 :: TyFun (Identity a) (Identity a ~> [Identity a]) -> Type) (a6989586621680390689 :: Identity a) | |
| type Apply (TFHelper_6989586621680392310Sym0 :: TyFun (Identity (a ~> b)) (Identity a ~> Identity b) -> Type) (a6989586621680392315 :: Identity (a ~> b)) | |
| type Apply (EnumFromThenTo_6989586621680390696Sym1 a6989586621680390702 :: TyFun (Identity a) (Identity a ~> [Identity a]) -> Type) (a6989586621680390703 :: Identity a) | |
| type Apply (TFHelper_6989586621680392336Sym0 :: TyFun (Identity a) ((a ~> Identity b) ~> Identity b) -> Type) (a6989586621680392341 :: Identity a) | |
| type Apply (ShowsPrec_6989586621680390927Sym1 a6989586621680390935 :: TyFun (Identity a) (Symbol ~> Symbol) -> Type) (a6989586621680390936 :: Identity a) | |
| type Apply (LiftA2_6989586621680392322Sym1 a6989586621680392328 :: TyFun (Identity a) (Identity b ~> Identity c) -> Type) (a6989586621680392329 :: Identity a) | |
| type Apply (TFHelper_6989586621680392336Sym1 a6989586621680392341 :: TyFun (a ~> Identity b) (Identity b) -> Type) (a6989586621680392342 :: a ~> Identity b) | |
| type Apply (Foldl1_6989586621680392198Sym0 :: TyFun (a ~> (a ~> a)) (Identity a ~> a) -> Type) (a6989586621680392203 :: a ~> (a ~> a)) | |
| type Apply (Foldr1_6989586621680392244Sym0 :: TyFun (a ~> (a ~> a)) (Identity a ~> a) -> Type) (a6989586621680392249 :: a ~> (a ~> a)) | |
| type Apply (Foldr'_6989586621680392224Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (Identity a ~> b)) -> Type) (a6989586621680392236 :: a ~> (b ~> b)) | |
| type Apply (Foldr_6989586621680392209Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (Identity a ~> b)) -> Type) (a6989586621680392215 :: a ~> (b ~> b)) | |
| type Apply (Fmap_6989586621680390943Sym0 :: TyFun (a ~> b) (Identity a ~> Identity b) -> Type) (a6989586621680390948 :: a ~> b) | |
| type Apply (FoldMap_6989586621680392146Sym0 :: TyFun (a ~> m) (Identity a ~> m) -> Type) (a6989586621680392151 :: a ~> m) | |
| type Apply (Foldl'_6989586621680392184Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (Identity a ~> b)) -> Type) (a6989586621680392190 :: b ~> (a ~> b)) | |
| type Apply (Foldl_6989586621680392169Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (Identity a ~> b)) -> Type) (a6989586621680392175 :: b ~> (a ~> b)) | |
| type Apply (LiftA2_6989586621680392322Sym0 :: TyFun (a ~> (b ~> c)) (Identity a ~> (Identity b ~> Identity c)) -> Type) (a6989586621680392328 :: a ~> (b ~> c)) | |
| type Apply (Let6989586621680478616Scrutinee_6989586621680478184Sym0 :: TyFun (a ~> b) (TyFun (t a) (Identity (t b)) -> Type) -> Type) (f6989586621680478614 :: a ~> b) | |
Defined in Data.Traversable.Singletons | |
| type Apply (Traverse_6989586621680478824Sym0 :: TyFun (a ~> f b) (Identity a ~> f (Identity b)) -> Type) (a6989586621680478829 :: a ~> f b) | |
| type Unwrappabled (NamedF Identity a name) | |
Defined in Lorentz.Wrappable | |
| type AsRPC (NamedF Identity a name) | |
| type ToT (NamedF Identity a name) | |
optional :: Alternative f => f a -> f (Maybe a) #
One or none.
It is useful for modelling any computation that is allowed to fail.
Examples
Using the Alternative instance of Except, the following functions:
>>>canFail = throwError "it failed" :: Except String Int>>>final = return 42 :: Except String Int
Can be combined by allowing the first function to fail:
>>>runExcept $ canFail *> finalLeft "it failed">>>runExcept $ optional canFail *> finalRight 42
for :: (Traversable t, Applicative f) => t a -> (a -> f b) -> f (t b) #
filterM :: Applicative m => (a -> m Bool) -> [a] -> m [a] #
This generalizes the list-based filter function.
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.
unless :: Applicative f => Bool -> f () -> f () #
The reverse of when.
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
| 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 # | |
| Semigroup Void | Since: base-4.9.0.0 |
| Exception Void | Since: base-4.8.0.0 |
Defined in Data.Void Methods toException :: Void -> SomeException # fromException :: SomeException -> Maybe Void # displayException :: Void -> String # | |
| Generic Void | |
| Ix 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 |
| NFData Void | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| Buildable Void | |
Defined in Formatting.Buildable | |
| Eq Void | Since: base-4.8.0.0 |
| Ord Void | Since: base-4.8.0.0 |
| Hashable Void | |
Defined in Data.Hashable.Class | |
| ShowErrorComponent Void | |
Defined in Text.Megaparsec.Error | |
| IsoValue Void | |
| PEq Void | |
| SEq Void | |
| POrd Void | |
| SOrd Void | |
Defined in Data.Ord.Singletons 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) # | |
| PSemigroup Void | |
Defined in Data.Semigroup.Singletons.Internal | |
| SSemigroup Void | |
| PShow Void | |
| SShow Void | |
Defined in Text.Show.Singletons 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) # | |
| TestCoercion SVoid | |
Defined in Data.Singletons.Base.Instances | |
| TestEquality SVoid | |
Defined in Data.Singletons.Base.Instances | |
| Lift Void | Since: template-haskell-2.15.0.0 |
| MonadError (MichelsonFailureWithStack Void) EvalOp | |
Defined in Morley.Michelson.Interpret Methods throwError :: MichelsonFailureWithStack Void -> EvalOp a # catchError :: EvalOp a -> (MichelsonFailureWithStack Void -> EvalOp a) -> EvalOp a # | |
| SuppressUnusedWarnings TFHelper_6989586621679584165Sym0 | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings Compare_6989586621679181460Sym0 | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings TFHelper_6989586621679130639Sym0 | |
Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings ShowsPrec_6989586621680071884Sym0 | |
Defined in Text.Show.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679584165Sym1 a6989586621679584170 :: TyFun Void Void -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679181460Sym1 a6989586621679181465 :: TyFun Void Ordering -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621680071884Sym1 a6989586621680071892 :: TyFun Void (Symbol ~> Symbol) -> Type) | |
Defined in Text.Show.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679130639Sym1 a6989586621679130644 :: TyFun Void Bool -> Type) | |
Defined in Data.Eq.Singletons Methods suppressUnusedWarnings :: () # | |
| type Rep Void | Since: base-4.8.0.0 |
| type ToT Void | |
Defined in Morley.Michelson.Typed.Haskell.Value | |
| type Demote Void | |
Defined in Data.Singletons.Base.Instances | |
| type Sing | |
Defined in Data.Singletons.Base.Instances | |
| type Sconcat (arg :: NonEmpty Void) | |
| type Show_ (arg :: Void) | |
| type (arg1 :: Void) /= (arg2 :: Void) | |
| type (a1 :: Void) == (a2 :: 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 Max (arg1 :: Void) (arg2 :: Void) | |
| type Min (arg1 :: Void) (arg2 :: Void) | |
| type (a1 :: Void) <> (a2 :: Void) | |
| type ShowList (arg1 :: [Void]) arg2 | |
| type ShowsPrec a1 (a2 :: Void) a3 | |
| type Apply (TFHelper_6989586621679584165Sym1 a6989586621679584170 :: TyFun Void Void -> Type) (a6989586621679584171 :: Void) | |
| type Apply (Compare_6989586621679181460Sym1 a6989586621679181465 :: TyFun Void Ordering -> Type) (a6989586621679181466 :: Void) | |
| type Apply (TFHelper_6989586621679130639Sym1 a6989586621679130644 :: TyFun Void Bool -> Type) (a6989586621679130645 :: Void) | |
| type Apply TFHelper_6989586621679584165Sym0 (a6989586621679584170 :: Void) | |
Defined in Data.Semigroup.Singletons.Internal | |
| type Apply Compare_6989586621679181460Sym0 (a6989586621679181465 :: Void) | |
Defined in Data.Ord.Singletons | |
| type Apply TFHelper_6989586621679130639Sym0 (a6989586621679130644 :: Void) | |
Defined in Data.Eq.Singletons | |
| type Apply ShowsPrec_6989586621680071884Sym0 (a6989586621680071892 :: Nat) | |
Defined in Text.Show.Singletons | |
| type Apply (ShowsPrec_6989586621680071884Sym1 a6989586621680071892 :: TyFun Void (Symbol ~> Symbol) -> Type) (a6989586621680071893 :: Void) | |
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 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 MaybeT | |
Defined in Control.Monad.Trans.Maybe | |
| MonadTrans (RandT g) | |
Defined in Control.Monad.Trans.Random.Lazy | |
| MonadTrans (RandT g) | |
Defined in Control.Monad.Trans.Random.Strict | |
| Alternative f => MonadTrans (CofreeT f) | |
Defined in Control.Comonad.Trans.Cofree | |
| MonadTrans (FreeT f) | |
Defined in Control.Monad.Trans.Free | |
| MonadTrans (ErrorT e) | |
Defined in Control.Monad.Trans.Error | |
| MonadTrans (ExceptT e) | |
Defined in Control.Monad.Trans.Except | |
| MonadTrans (IdentityT :: (Type -> Type) -> Type -> Type) | |
Defined in Control.Monad.Trans.Identity | |
| MonadTrans (ReaderT r) | |
Defined in Control.Monad.Trans.Reader | |
| MonadTrans (StateT s) | |
Defined in Control.Monad.Trans.State.Lazy | |
| MonadTrans (StateT s) | |
Defined in Control.Monad.Trans.State.Strict | |
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).
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).
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).
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’s argument, hence
the recursion is reintroduced.
forM :: (Traversable t, Monad m) => t a -> (a -> m b) -> m (t b) #
(>=>) :: Monad m => (a -> m b) -> (b -> m c) -> a -> m c infixr 1 #
Left-to-right composition of Kleisli arrows.
'(bs ' can be understood as the >=> cs) ado expression
do b <- bs a cs b
foldM_ :: (Foldable t, Monad m) => (b -> a -> m b) -> b -> t a -> m () #
Like foldM, but discards the result.
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
Note that "forever" isn't necessarily non-terminating.
If the action is in a MonadPlusforevermzero, effectively short-circuiting its caller.
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.
replicateM :: Applicative m => Int -> m a -> m [a] #
replicateM n actact n times,
and then returns the list of results:
Examples
>>>replicateM 3 (putStrLn "a")a a a
replicateM_ :: Applicative m => Int -> m a -> m () #
Like replicateM, but discards the result.
zipWithM :: Applicative m => (a -> b -> m c) -> [a] -> [b] -> m [c] #
zipWithM_ :: Applicative m => (a -> b -> m c) -> [a] -> [b] -> m () #
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:
Methods
Lift a computation from the IO monad.
This allows us to run IO computations in any monadic stack, so long as it supports these kinds of operations
(i.e. IO is the base monad for the stack).
Example
import Control.Monad.Trans.State -- from the "transformers" library printState :: Show s => StateT s IO () printState = do state <- get liftIO $ print state
Had we omitted liftIO
• Couldn't match type ‘IO’ with ‘StateT s IO’ Expected type: StateT s IO () Actual type: IO ()
The important part here is the mismatch between StateT s IO () and IO ()
Luckily, we know of a function that takes an IO a(m a): liftIO
> evalStateT printState "hello" "hello" > evalStateT printState 3 3
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 (RandT g m) | |
Defined in Control.Monad.Trans.Random.Lazy | |
| MonadIO m => MonadIO (RandT g m) | |
Defined in Control.Monad.Trans.Random.Strict | |
| (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 (ExceptT e m) | |
Defined in Control.Monad.Trans.Except | |
| MonadIO m => MonadIO (IdentityT m) | |
Defined in Control.Monad.Trans.Identity | |
| MonadIO m => MonadIO (ReaderT r m) | |
Defined in Control.Monad.Trans.Reader | |
| MonadIO m => MonadIO (StateT s m) | |
Defined in Control.Monad.Trans.State.Lazy | |
| MonadIO m => MonadIO (StateT s m) | |
Defined in Control.Monad.Trans.State.Strict | |
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.
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
Return the state from the internals of the monad.
Replace the state inside the monad.
state :: (s -> (a, s)) -> m a #
Embed a simple state action into the monad.
Instances
The class of types that can be converted to a hash value.
Minimal implementation: hashWithSalt.
Note: the hash is not guaranteed to be stable across library versions, operating systems or architectures. For stable hashing use named hashes: SHA256, CRC32 etc.
If you are looking for Hashable instance in time package,
check time-compat
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. hashWithSaltmay return negativeIntvalues.
Instances
A space efficient, packed, unboxed Unicode text type.
Instances
A map from keys to values. A map cannot contain duplicate keys; each key can map to at most one value.
Instances
| Bifoldable HashMap | Since: unordered-containers-0.2.11 |
| Eq2 HashMap | |
| Ord2 HashMap | |
Defined in Data.HashMap.Internal | |
| Show2 HashMap | |
| NFData2 HashMap | Since: unordered-containers-0.2.14.0 |
Defined in Data.HashMap.Internal | |
| Hashable2 HashMap | |
Defined in Data.HashMap.Internal | |
| (Lift k, Lift v) => Lift (HashMap k v :: Type) | Since: unordered-containers-0.2.17.0 |
| Foldable (HashMap k) | |
Defined in Data.HashMap.Internal 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 # | |
| Eq k => Eq1 (HashMap k) | |
| Ord k => Ord1 (HashMap k) | |
Defined in Data.HashMap.Internal | |
| (Eq k, Hashable k, Read k) => Read1 (HashMap k) | |
Defined in Data.HashMap.Internal | |
| Show k => Show1 (HashMap k) | |
| Traversable (HashMap k) | |
Defined in Data.HashMap.Internal | |
| Functor (HashMap k) | |
| NFData k => NFData1 (HashMap k) | Since: unordered-containers-0.2.14.0 |
Defined in Data.HashMap.Internal | |
| Hashable k => Hashable1 (HashMap k) | |
Defined in Data.HashMap.Internal | |
| (Data k, Data v, Eq k, Hashable k) => Data (HashMap k v) | |
Defined in Data.HashMap.Internal 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) # | |
| (Eq k, Hashable k) => Monoid (HashMap k v) | If a key occurs in both maps, the mapping from the first will be the mapping in the result. Examples
|
| (Eq k, Hashable k) => Semigroup (HashMap k v) | If a key occurs in both maps, the mapping from the first will be the mapping in the result. Examples
|
| (Eq k, Hashable k) => IsList (HashMap k v) | |
| (Eq k, Hashable k, Read k, Read e) => Read (HashMap k e) | |
| (Show k, Show v) => Show (HashMap k v) | |
| (NFData k, NFData v) => NFData (HashMap k v) | |
Defined in Data.HashMap.Internal | |
| (Eq k, Eq v) => Eq (HashMap k v) | Note that, in the presence of hash collisions, equal
In general, the lack of substitutivity can be observed with any function that depends on the key ordering, such as folds and traversals. |
| (Ord k, Ord v) => Ord (HashMap k v) | The ordering is total and consistent with the |
Defined in Data.HashMap.Internal | |
| (Hashable k, Hashable v) => Hashable (HashMap k v) | |
Defined in Data.HashMap.Internal | |
| (Eq k, Hashable k) => At (HashMap k a) | |
| (Eq k, Hashable k) => Ixed (HashMap k a) | |
Defined in Control.Lens.At | |
| (Hashable k, Eq k) => Wrapped (HashMap k a) | |
| (Eq k, Hashable k, Monoid k, Semiring v) => Semiring (HashMap k v) | The multiplication laws are satisfied for
any underlying |
| 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 # 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 # 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)) # safeHead :: HashMap k v -> Maybe (Element (HashMap k v)) # safeMaximum :: HashMap k v -> Maybe (Element (HashMap k v)) # safeMinimum :: HashMap k v -> Maybe (Element (HashMap k v)) # safeFoldr1 :: (Element (HashMap k v) -> Element (HashMap k v) -> Element (HashMap k v)) -> HashMap k v -> Maybe (Element (HashMap k v)) # safeFoldl1 :: (Element (HashMap k v) -> Element (HashMap k v) -> Element (HashMap k v)) -> HashMap k v -> Maybe (Element (HashMap k v)) # | |
| (Eq k, Hashable k) => FromList (HashMap k v) | |
Defined in Universum.Container.Class Methods fromList :: [ListElement (HashMap k v)] -> HashMap k v # | |
| Hashable k => One (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.Internal | |
| 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 Element (HashMap k v) | |
Defined in Universum.Container.Class | |
| type FromListC (HashMap k v) | |
Defined in Universum.Container.Class | |
| type Key (HashMap k v) | |
Defined in Universum.Container.Class | |
| type ListElement (HashMap k v) | |
Defined in Universum.Container.Class | |
| type OneItem (HashMap k v) | |
Defined in Universum.Container.Class | |
| type Val (HashMap 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 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
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
| TestEquality f => TestEquality (Compose f g :: k2 -> Type) | The deduction (via generativity) that if Since: base-4.14.0.0 |
Defined in Data.Functor.Compose | |
| Functor f => Generic1 (Compose f g :: k -> Type) | |
| 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 # | |
| (Representable f, Representable g) => Representable (Compose f g) | |
| (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 # | |
| (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 |
| (Traversable f, Traversable g) => Traversable (Compose f g) | Since: base-4.9.0.0 |
Defined in Data.Functor.Compose | |
| (Alternative f, Applicative g) => Alternative (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 | |
| (Functor f, Functor g) => Functor (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 | |
| (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) # | |
| Generic (Compose f g a) | |
| (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 |
| (NFData1 f, NFData1 g, NFData a) => NFData (Compose f g a) | Since: deepseq-1.4.3.0 |
Defined in Control.DeepSeq | |
| (Eq1 f, Eq1 g, Eq a) => Eq (Compose f g a) | Since: base-4.9.0.0 |
| (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 # | |
| (Hashable1 f, Hashable1 g, Hashable a) => Hashable (Compose f g a) | In general, |
Defined in Data.Hashable.Class | |
| Wrapped (Compose f g a) | |
| Unbox (f (g a)) => Unbox (Compose f g a) | |
Defined in Data.Vector.Unboxed.Base | |
| t ~ Compose f' g' a' => Rewrapped (Compose f g a) t | |
Defined in Control.Lens.Wrapped | |
| (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 # | |
| (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 # | |
| type Rep1 (Compose f g :: k -> Type) | Since: base-4.9.0.0 |
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) | Since: base-4.9.0.0 |
Defined in Data.Functor.Compose | |
| type Unwrapped (Compose f g a) | |
Defined in Control.Lens.Wrapped | |
| newtype Vector (Compose f g a) | |
Defined in Data.Vector.Unboxed.Base | |
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 -> () # | |
| Hashable1 WrappedMonoid | Since: hashable-1.3.1.0 |
Defined in Data.Hashable.Class Methods liftHashWithSalt :: (Int -> a -> Int) -> Int -> WrappedMonoid a -> Int # | |
| 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)) # | |
| 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) # | |
| 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 # | |
| 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 # | |
| 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] # | |
| Generic (WrappedMonoid m) | |
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 # | |
| 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 # | |
| NFData m => NFData (WrappedMonoid m) | Since: deepseq-1.4.2.0 |
Defined in Control.DeepSeq Methods rnf :: WrappedMonoid m -> () # | |
| 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 # | |
| 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 # | |
| Hashable a => Hashable (WrappedMonoid a) | |
Defined in Data.Hashable.Class | |
| Wrapped (WrappedMonoid a) | |
Defined in Control.Lens.Wrapped Associated Types type Unwrapped (WrappedMonoid a) # Methods _Wrapped' :: Iso' (WrappedMonoid a) (Unwrapped (WrappedMonoid a)) # | |
| Unbox a => Unbox (WrappedMonoid a) | |
Defined in Data.Vector.Unboxed.Base | |
| Generic1 WrappedMonoid | |
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.Semigroup.Singletons.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.Semigroup.Singletons.Internal Methods testEquality :: forall (a :: k) (b :: k). SWrappedMonoid a -> SWrappedMonoid b -> Maybe (a :~: b) # | |
| SingI (UnwrapMonoidSym0 :: TyFun (WrappedMonoid m) m -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods | |
| SingI (WrapMonoidSym0 :: TyFun m (WrappedMonoid m) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods sing :: Sing WrapMonoidSym0 # | |
| SuppressUnusedWarnings (Pred_6989586621680605958Sym0 :: TyFun (WrappedMonoid a) (WrappedMonoid a) -> Type) | |
Defined in Data.Semigroup.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Succ_6989586621680605951Sym0 :: TyFun (WrappedMonoid a) (WrappedMonoid a) -> Type) | |
Defined in Data.Semigroup.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (EnumFromThenTo_6989586621680605994Sym0 :: TyFun (WrappedMonoid a) (WrappedMonoid a ~> (WrappedMonoid a ~> [WrappedMonoid a])) -> Type) | |
Defined in Data.Semigroup.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (EnumFromTo_6989586621680605982Sym0 :: TyFun (WrappedMonoid a) (WrappedMonoid a ~> [WrappedMonoid a]) -> Type) | |
Defined in Data.Semigroup.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FromEnum_6989586621680605974Sym0 :: TyFun (WrappedMonoid a) Nat -> Type) | |
Defined in Data.Semigroup.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680605938Sym0 :: TyFun (WrappedMonoid m) (WrappedMonoid m ~> WrappedMonoid m) -> Type) | |
Defined in Data.Semigroup.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679613741Sym0 :: TyFun (WrappedMonoid m) (WrappedMonoid m ~> Ordering) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679606280Sym0 :: TyFun (WrappedMonoid m) (WrappedMonoid m ~> Bool) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (UnwrapMonoidSym0 :: TyFun (WrappedMonoid m) m -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ToEnum_6989586621680605965Sym0 :: TyFun Nat (WrappedMonoid a) -> Type) | |
Defined in Data.Semigroup.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621680582417Sym0 :: TyFun Nat (WrappedMonoid m ~> (Symbol ~> Symbol)) -> Type) | |
Defined in Data.Semigroup.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (WrapMonoidSym0 :: TyFun m (WrappedMonoid m) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (EnumFromThenTo_6989586621680605994Sym1 a6989586621680606000 :: TyFun (WrappedMonoid a) (WrappedMonoid a ~> [WrappedMonoid a]) -> Type) | |
Defined in Data.Semigroup.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (EnumFromTo_6989586621680605982Sym1 a6989586621680605987 :: TyFun (WrappedMonoid a) [WrappedMonoid a] -> Type) | |
Defined in Data.Semigroup.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680605938Sym1 a6989586621680605943 :: TyFun (WrappedMonoid m) (WrappedMonoid m) -> Type) | |
Defined in Data.Semigroup.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679613741Sym1 a6989586621679613746 :: TyFun (WrappedMonoid m) Ordering -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621680582417Sym1 a6989586621680582425 :: TyFun (WrappedMonoid m) (Symbol ~> Symbol) -> Type) | |
Defined in Data.Semigroup.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679606280Sym1 a6989586621679606285 :: TyFun (WrappedMonoid m) Bool -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (EnumFromThenTo_6989586621680605994Sym2 a6989586621680606000 a6989586621680606001 :: TyFun (WrappedMonoid a) [WrappedMonoid a] -> Type) | |
Defined in Data.Semigroup.Singletons Methods suppressUnusedWarnings :: () # | |
| newtype MVector s (WrappedMonoid a) | |
Defined in Data.Vector.Unboxed.Base | |
| type Apply (ToEnum_6989586621680605965Sym0 :: TyFun Nat (WrappedMonoid a) -> Type) (a6989586621680605971 :: Nat) | |
Defined in Data.Semigroup.Singletons type Apply (ToEnum_6989586621680605965Sym0 :: TyFun Nat (WrappedMonoid a) -> Type) (a6989586621680605971 :: Nat) = ToEnum_6989586621680605965 a6989586621680605971 :: WrappedMonoid a | |
| type Apply (WrapMonoidSym0 :: TyFun m (WrappedMonoid m) -> Type) (a6989586621679596528 :: m) | |
Defined in Data.Semigroup.Singletons.Internal type Apply (WrapMonoidSym0 :: TyFun m (WrappedMonoid m) -> Type) (a6989586621679596528 :: m) = 'WrapMonoid a6989586621679596528 | |
| type Apply (ShowsPrec_6989586621680582417Sym0 :: TyFun Nat (WrappedMonoid m ~> (Symbol ~> Symbol)) -> Type) (a6989586621680582425 :: Nat) | |
| type Rep (WrappedMonoid m) | Since: base-4.9.0.0 |
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))) | |
| type Unwrapped (WrappedMonoid a) | |
Defined in Control.Lens.Wrapped | |
| type Demote (WrappedMonoid m) | |
Defined in Data.Semigroup.Singletons.Internal | |
| type Sing | |
Defined in Data.Semigroup.Singletons.Internal | |
| type Mempty | |
Defined in Data.Semigroup.Singletons | |
| type MaxBound | |
Defined in Data.Semigroup.Singletons.Internal | |
| type MinBound | |
Defined in Data.Semigroup.Singletons.Internal | |
| newtype Vector (WrappedMonoid a) | |
Defined in Data.Vector.Unboxed.Base | |
| type Rep1 WrappedMonoid | Since: base-4.9.0.0 |
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 (arg :: [WrappedMonoid m]) | |
Defined in Data.Semigroup.Singletons type Mconcat (arg :: [WrappedMonoid m]) = Apply (Mconcat_6989586621680102596Sym0 :: TyFun [WrappedMonoid m] (WrappedMonoid m) -> Type) arg | |
| type Sconcat (arg :: NonEmpty (WrappedMonoid m)) | |
Defined in Data.Semigroup.Singletons type Sconcat (arg :: NonEmpty (WrappedMonoid m)) = Apply (Sconcat_6989586621679583990Sym0 :: TyFun (NonEmpty (WrappedMonoid m)) (WrappedMonoid m) -> Type) arg | |
| type FromEnum (a2 :: WrappedMonoid a1) | |
Defined in Data.Semigroup.Singletons type FromEnum (a2 :: WrappedMonoid a1) = Apply (FromEnum_6989586621680605974Sym0 :: TyFun (WrappedMonoid a1) Nat -> Type) a2 | |
| type Pred (a2 :: WrappedMonoid a1) | |
Defined in Data.Semigroup.Singletons type Pred (a2 :: WrappedMonoid a1) = Apply (Pred_6989586621680605958Sym0 :: TyFun (WrappedMonoid a1) (WrappedMonoid a1) -> Type) a2 | |
| type Succ (a2 :: WrappedMonoid a1) | |
Defined in Data.Semigroup.Singletons type Succ (a2 :: WrappedMonoid a1) = Apply (Succ_6989586621680605951Sym0 :: TyFun (WrappedMonoid a1) (WrappedMonoid a1) -> Type) a2 | |
| type ToEnum a2 | |
Defined in Data.Semigroup.Singletons | |
| type Show_ (arg :: WrappedMonoid m) | |
Defined in Data.Semigroup.Singletons type Show_ (arg :: WrappedMonoid m) = Apply (Show__6989586621680047550Sym0 :: TyFun (WrappedMonoid m) Symbol -> Type) arg | |
| type (arg :: WrappedMonoid m) /= (arg1 :: WrappedMonoid m) | |
Defined in Data.Semigroup.Singletons.Internal type (arg :: WrappedMonoid m) /= (arg1 :: WrappedMonoid m) = Apply (Apply (TFHelper_6989586621679127817Sym0 :: TyFun (WrappedMonoid m) (WrappedMonoid m ~> Bool) -> Type) arg) arg1 | |
| type (a1 :: WrappedMonoid m) == (a2 :: WrappedMonoid m) | |
Defined in Data.Semigroup.Singletons.Internal type (a1 :: WrappedMonoid m) == (a2 :: WrappedMonoid m) = Apply (Apply (TFHelper_6989586621679606280Sym0 :: TyFun (WrappedMonoid m) (WrappedMonoid m ~> Bool) -> Type) a1) a2 | |
| type Mappend (arg :: WrappedMonoid m) (arg1 :: WrappedMonoid m) | |
Defined in Data.Semigroup.Singletons type Mappend (arg :: WrappedMonoid m) (arg1 :: WrappedMonoid m) = Apply (Apply (Mappend_6989586621680102582Sym0 :: TyFun (WrappedMonoid m) (WrappedMonoid m ~> WrappedMonoid m) -> Type) arg) arg1 | |
| type (arg :: WrappedMonoid m) < (arg1 :: WrappedMonoid m) | |
Defined in Data.Semigroup.Singletons.Internal type (arg :: WrappedMonoid m) < (arg1 :: WrappedMonoid m) = Apply (Apply (TFHelper_6989586621679166153Sym0 :: TyFun (WrappedMonoid m) (WrappedMonoid m ~> Bool) -> Type) arg) arg1 | |
| type (arg :: WrappedMonoid m) <= (arg1 :: WrappedMonoid m) | |
Defined in Data.Semigroup.Singletons.Internal type (arg :: WrappedMonoid m) <= (arg1 :: WrappedMonoid m) = Apply (Apply (TFHelper_6989586621679166169Sym0 :: TyFun (WrappedMonoid m) (WrappedMonoid m ~> Bool) -> Type) arg) arg1 | |
| type (arg :: WrappedMonoid m) > (arg1 :: WrappedMonoid m) | |
Defined in Data.Semigroup.Singletons.Internal type (arg :: WrappedMonoid m) > (arg1 :: WrappedMonoid m) = Apply (Apply (TFHelper_6989586621679166185Sym0 :: TyFun (WrappedMonoid m) (WrappedMonoid m ~> Bool) -> Type) arg) arg1 | |
| type (arg :: WrappedMonoid m) >= (arg1 :: WrappedMonoid m) | |
Defined in Data.Semigroup.Singletons.Internal type (arg :: WrappedMonoid m) >= (arg1 :: WrappedMonoid m) = Apply (Apply (TFHelper_6989586621679166201Sym0 :: TyFun (WrappedMonoid m) (WrappedMonoid m ~> Bool) -> Type) arg) arg1 | |
| type Compare (a1 :: WrappedMonoid m) (a2 :: WrappedMonoid m) | |
Defined in Data.Semigroup.Singletons.Internal type Compare (a1 :: WrappedMonoid m) (a2 :: WrappedMonoid m) = Apply (Apply (Compare_6989586621679613741Sym0 :: TyFun (WrappedMonoid m) (WrappedMonoid m ~> Ordering) -> Type) a1) a2 | |
| type Max (arg :: WrappedMonoid m) (arg1 :: WrappedMonoid m) | |
Defined in Data.Semigroup.Singletons.Internal type Max (arg :: WrappedMonoid m) (arg1 :: WrappedMonoid m) = Apply (Apply (Max_6989586621679166217Sym0 :: TyFun (WrappedMonoid m) (WrappedMonoid m ~> WrappedMonoid m) -> Type) arg) arg1 | |
| type Min (arg :: WrappedMonoid m) (arg1 :: WrappedMonoid m) | |
Defined in Data.Semigroup.Singletons.Internal type Min (arg :: WrappedMonoid m) (arg1 :: WrappedMonoid m) = Apply (Apply (Min_6989586621679166233Sym0 :: TyFun (WrappedMonoid m) (WrappedMonoid m ~> WrappedMonoid m) -> Type) arg) arg1 | |
| type (a1 :: WrappedMonoid m) <> (a2 :: WrappedMonoid m) | |
Defined in Data.Semigroup.Singletons type (a1 :: WrappedMonoid m) <> (a2 :: WrappedMonoid m) = Apply (Apply (TFHelper_6989586621680605938Sym0 :: TyFun (WrappedMonoid m) (WrappedMonoid m ~> WrappedMonoid m) -> Type) a1) a2 | |
| type EnumFromTo (a2 :: WrappedMonoid a1) (a3 :: WrappedMonoid a1) | |
Defined in Data.Semigroup.Singletons type EnumFromTo (a2 :: WrappedMonoid a1) (a3 :: WrappedMonoid a1) = Apply (Apply (EnumFromTo_6989586621680605982Sym0 :: TyFun (WrappedMonoid a1) (WrappedMonoid a1 ~> [WrappedMonoid a1]) -> Type) a2) a3 | |
| type ShowList (arg :: [WrappedMonoid m]) arg1 | |
Defined in Data.Semigroup.Singletons type ShowList (arg :: [WrappedMonoid m]) arg1 = Apply (Apply (ShowList_6989586621680047558Sym0 :: TyFun [WrappedMonoid m] (Symbol ~> Symbol) -> Type) arg) arg1 | |
| type EnumFromThenTo (a2 :: WrappedMonoid a1) (a3 :: WrappedMonoid a1) (a4 :: WrappedMonoid a1) | |
Defined in Data.Semigroup.Singletons type EnumFromThenTo (a2 :: WrappedMonoid a1) (a3 :: WrappedMonoid a1) (a4 :: WrappedMonoid a1) = Apply (Apply (Apply (EnumFromThenTo_6989586621680605994Sym0 :: TyFun (WrappedMonoid a1) (WrappedMonoid a1 ~> (WrappedMonoid a1 ~> [WrappedMonoid a1])) -> Type) a2) a3) a4 | |
| type ShowsPrec a1 (a2 :: WrappedMonoid m) a3 | |
Defined in Data.Semigroup.Singletons | |
| type Apply (FromEnum_6989586621680605974Sym0 :: TyFun (WrappedMonoid a) Nat -> Type) (a6989586621680605978 :: WrappedMonoid a) | |
Defined in Data.Semigroup.Singletons type Apply (FromEnum_6989586621680605974Sym0 :: TyFun (WrappedMonoid a) Nat -> Type) (a6989586621680605978 :: WrappedMonoid a) = FromEnum_6989586621680605974 a6989586621680605978 | |
| type Apply (UnwrapMonoidSym0 :: TyFun (WrappedMonoid m) m -> Type) (a6989586621679596531 :: WrappedMonoid m) | |
Defined in Data.Semigroup.Singletons.Internal type Apply (UnwrapMonoidSym0 :: TyFun (WrappedMonoid m) m -> Type) (a6989586621679596531 :: WrappedMonoid m) = UnwrapMonoid a6989586621679596531 | |
| type Apply (Compare_6989586621679613741Sym1 a6989586621679613746 :: TyFun (WrappedMonoid m) Ordering -> Type) (a6989586621679613747 :: WrappedMonoid m) | |
Defined in Data.Semigroup.Singletons.Internal type Apply (Compare_6989586621679613741Sym1 a6989586621679613746 :: TyFun (WrappedMonoid m) Ordering -> Type) (a6989586621679613747 :: WrappedMonoid m) = Compare_6989586621679613741 a6989586621679613746 a6989586621679613747 | |
| type Apply (TFHelper_6989586621679606280Sym1 a6989586621679606285 :: TyFun (WrappedMonoid m) Bool -> Type) (a6989586621679606286 :: WrappedMonoid m) | |
Defined in Data.Semigroup.Singletons.Internal type Apply (TFHelper_6989586621679606280Sym1 a6989586621679606285 :: TyFun (WrappedMonoid m) Bool -> Type) (a6989586621679606286 :: WrappedMonoid m) = TFHelper_6989586621679606280 a6989586621679606285 a6989586621679606286 | |
| type Apply (Pred_6989586621680605958Sym0 :: TyFun (WrappedMonoid a) (WrappedMonoid a) -> Type) (a6989586621680605962 :: WrappedMonoid a) | |
Defined in Data.Semigroup.Singletons type Apply (Pred_6989586621680605958Sym0 :: TyFun (WrappedMonoid a) (WrappedMonoid a) -> Type) (a6989586621680605962 :: WrappedMonoid a) = Pred_6989586621680605958 a6989586621680605962 | |
| type Apply (Succ_6989586621680605951Sym0 :: TyFun (WrappedMonoid a) (WrappedMonoid a) -> Type) (a6989586621680605955 :: WrappedMonoid a) | |
Defined in Data.Semigroup.Singletons type Apply (Succ_6989586621680605951Sym0 :: TyFun (WrappedMonoid a) (WrappedMonoid a) -> Type) (a6989586621680605955 :: WrappedMonoid a) = Succ_6989586621680605951 a6989586621680605955 | |
| type Apply (EnumFromTo_6989586621680605982Sym1 a6989586621680605987 :: TyFun (WrappedMonoid a) [WrappedMonoid a] -> Type) (a6989586621680605988 :: WrappedMonoid a) | |
Defined in Data.Semigroup.Singletons type Apply (EnumFromTo_6989586621680605982Sym1 a6989586621680605987 :: TyFun (WrappedMonoid a) [WrappedMonoid a] -> Type) (a6989586621680605988 :: WrappedMonoid a) = EnumFromTo_6989586621680605982 a6989586621680605987 a6989586621680605988 | |
| type Apply (TFHelper_6989586621680605938Sym1 a6989586621680605943 :: TyFun (WrappedMonoid m) (WrappedMonoid m) -> Type) (a6989586621680605944 :: WrappedMonoid m) | |
Defined in Data.Semigroup.Singletons type Apply (TFHelper_6989586621680605938Sym1 a6989586621680605943 :: TyFun (WrappedMonoid m) (WrappedMonoid m) -> Type) (a6989586621680605944 :: WrappedMonoid m) = TFHelper_6989586621680605938 a6989586621680605943 a6989586621680605944 | |
| type Apply (EnumFromThenTo_6989586621680605994Sym2 a6989586621680606000 a6989586621680606001 :: TyFun (WrappedMonoid a) [WrappedMonoid a] -> Type) (a6989586621680606002 :: WrappedMonoid a) | |
Defined in Data.Semigroup.Singletons type Apply (EnumFromThenTo_6989586621680605994Sym2 a6989586621680606000 a6989586621680606001 :: TyFun (WrappedMonoid a) [WrappedMonoid a] -> Type) (a6989586621680606002 :: WrappedMonoid a) = EnumFromThenTo_6989586621680605994 a6989586621680606000 a6989586621680606001 a6989586621680606002 | |
| type Apply (EnumFromThenTo_6989586621680605994Sym0 :: TyFun (WrappedMonoid a) (WrappedMonoid a ~> (WrappedMonoid a ~> [WrappedMonoid a])) -> Type) (a6989586621680606000 :: WrappedMonoid a) | |
Defined in Data.Semigroup.Singletons type Apply (EnumFromThenTo_6989586621680605994Sym0 :: TyFun (WrappedMonoid a) (WrappedMonoid a ~> (WrappedMonoid a ~> [WrappedMonoid a])) -> Type) (a6989586621680606000 :: WrappedMonoid a) = EnumFromThenTo_6989586621680605994Sym1 a6989586621680606000 | |
| type Apply (EnumFromTo_6989586621680605982Sym0 :: TyFun (WrappedMonoid a) (WrappedMonoid a ~> [WrappedMonoid a]) -> Type) (a6989586621680605987 :: WrappedMonoid a) | |
Defined in Data.Semigroup.Singletons type Apply (EnumFromTo_6989586621680605982Sym0 :: TyFun (WrappedMonoid a) (WrappedMonoid a ~> [WrappedMonoid a]) -> Type) (a6989586621680605987 :: WrappedMonoid a) = EnumFromTo_6989586621680605982Sym1 a6989586621680605987 | |
| type Apply (TFHelper_6989586621680605938Sym0 :: TyFun (WrappedMonoid m) (WrappedMonoid m ~> WrappedMonoid m) -> Type) (a6989586621680605943 :: WrappedMonoid m) | |
Defined in Data.Semigroup.Singletons type Apply (TFHelper_6989586621680605938Sym0 :: TyFun (WrappedMonoid m) (WrappedMonoid m ~> WrappedMonoid m) -> Type) (a6989586621680605943 :: WrappedMonoid m) = TFHelper_6989586621680605938Sym1 a6989586621680605943 | |
| type Apply (Compare_6989586621679613741Sym0 :: TyFun (WrappedMonoid m) (WrappedMonoid m ~> Ordering) -> Type) (a6989586621679613746 :: WrappedMonoid m) | |
Defined in Data.Semigroup.Singletons.Internal type Apply (Compare_6989586621679613741Sym0 :: TyFun (WrappedMonoid m) (WrappedMonoid m ~> Ordering) -> Type) (a6989586621679613746 :: WrappedMonoid m) = Compare_6989586621679613741Sym1 a6989586621679613746 | |
| type Apply (TFHelper_6989586621679606280Sym0 :: TyFun (WrappedMonoid m) (WrappedMonoid m ~> Bool) -> Type) (a6989586621679606285 :: WrappedMonoid m) | |
Defined in Data.Semigroup.Singletons.Internal type Apply (TFHelper_6989586621679606280Sym0 :: TyFun (WrappedMonoid m) (WrappedMonoid m ~> Bool) -> Type) (a6989586621679606285 :: WrappedMonoid m) = TFHelper_6989586621679606280Sym1 a6989586621679606285 | |
| type Apply (EnumFromThenTo_6989586621680605994Sym1 a6989586621680606000 :: TyFun (WrappedMonoid a) (WrappedMonoid a ~> [WrappedMonoid a]) -> Type) (a6989586621680606001 :: WrappedMonoid a) | |
Defined in Data.Semigroup.Singletons type Apply (EnumFromThenTo_6989586621680605994Sym1 a6989586621680606000 :: TyFun (WrappedMonoid a) (WrappedMonoid a ~> [WrappedMonoid a]) -> Type) (a6989586621680606001 :: WrappedMonoid a) = EnumFromThenTo_6989586621680605994Sym2 a6989586621680606000 a6989586621680606001 | |
| type Apply (ShowsPrec_6989586621680582417Sym1 a6989586621680582425 :: TyFun (WrappedMonoid m) (Symbol ~> Symbol) -> Type) (a6989586621680582426 :: WrappedMonoid m) | |
Defined in Data.Semigroup.Singletons type Apply (ShowsPrec_6989586621680582417Sym1 a6989586621680582425 :: TyFun (WrappedMonoid m) (Symbol ~> Symbol) -> Type) (a6989586621680582426 :: WrappedMonoid m) = ShowsPrec_6989586621680582417Sym2 a6989586621680582425 a6989586621680582426 | |
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.
Instances
| MonadFix Option | Since: base-4.9.0.0 |
Defined in Data.Semigroup | |
| 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 |
| Applicative Option | Since: base-4.9.0.0 |
| Functor Option | Since: base-4.9.0.0 |
| Monad 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 | |
| Hashable1 Option | Since: hashable-1.3.1.0 |
Defined in Data.Hashable.Class | |
| 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) # | |
| Semigroup a => Monoid (Option a) | Since: base-4.9.0.0 |
| Semigroup a => Semigroup (Option a) | Since: base-4.9.0.0 |
| Generic (Option a) | |
| Read a => Read (Option a) | Since: base-4.9.0.0 |
| Show a => Show (Option a) | Since: base-4.9.0.0 |
| NFData a => NFData (Option a) | Since: deepseq-1.4.2.0 |
Defined in Control.DeepSeq | |
| Eq a => Eq (Option a) | Since: base-4.9.0.0 |
| Ord a => Ord (Option a) | Since: base-4.9.0.0 |
Defined in Data.Semigroup | |
| Hashable a => Hashable (Option a) | |
Defined in Data.Hashable.Class | |
| Wrapped (Option a) | |
| Generic1 Option | |
| t ~ Option b => Rewrapped (Option a) t | |
Defined in Control.Lens.Wrapped | |
| type Rep (Option a) | Since: base-4.9.0.0 |
Defined in Data.Semigroup | |
| type Unwrapped (Option a) | |
Defined in Control.Lens.Wrapped | |
| type Rep1 Option | Since: base-4.9.0.0 |
Defined in Data.Semigroup | |
mtimesDefault :: (Integral b, Monoid a) => b -> a -> a #
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
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.
mapAccumR :: Traversable t => (s -> a -> (s, b)) -> s -> t a -> (s, t b) #
The mapAccumR function behaves like a combination of fmap
and foldr; it applies a function to each element of a structure,
passing an accumulating parameter from right to left, and returning
a final value of this accumulator together with the new structure.
Examples
Basic usage:
>>>mapAccumR (\a b -> (a + b, a)) 0 [1..10](55,[54,52,49,45,40,34,27,19,10,0])
>>>mapAccumR (\a b -> (a <> show b, a)) "0" [1..5]("054321",["05432","0543","054","05","0"])
mapAccumL :: Traversable t => (s -> a -> (s, b)) -> s -> t a -> (s, t b) #
The mapAccumL function behaves like a combination of fmap
and foldl; it applies a function to each element of a structure,
passing an accumulating parameter from left to right, and returning
a final value of this accumulator together with the new structure.
Examples
Basic usage:
>>>mapAccumL (\a b -> (a + b, a)) 0 [1..10](55,[0,1,3,6,10,15,21,28,36,45])
>>>mapAccumL (\a b -> (a <> show b, a)) "0" [1..5]("012345",["0","01","012","0123","01234"])
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)
Lists, but with an Applicative functor based on zipping.
Constructors
| ZipList | |
Fields
| |
Instances
| 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 |
| 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 |
| Functor ZipList | Since: base-2.1 |
| NFData1 ZipList | Since: deepseq-1.4.3.0 |
Defined in Control.DeepSeq | |
| IsList (ZipList a) | Since: base-4.15.0.0 |
| Generic (ZipList a) | |
| Read a => Read (ZipList a) | Since: base-4.7.0.0 |
| Show a => Show (ZipList a) | Since: base-4.7.0.0 |
| NFData a => NFData (ZipList a) | Since: deepseq-1.4.0.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 |
| 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 # 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 # 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)) # safeHead :: ZipList a -> Maybe (Element (ZipList a)) # safeMaximum :: ZipList a -> Maybe (Element (ZipList a)) # safeMinimum :: ZipList a -> Maybe (Element (ZipList a)) # safeFoldr1 :: (Element (ZipList a) -> Element (ZipList a) -> Element (ZipList a)) -> ZipList a -> Maybe (Element (ZipList a)) # safeFoldl1 :: (Element (ZipList a) -> Element (ZipList a) -> Element (ZipList a)) -> ZipList a -> Maybe (Element (ZipList a)) # | |
| FromList (ZipList a) | |
Defined in Universum.Container.Class Methods fromList :: [ListElement (ZipList a)] -> ZipList a # | |
| Generic1 ZipList | |
| t ~ ZipList b => Rewrapped (ZipList a) t | |
Defined in Control.Lens.Wrapped | |
| type Item (ZipList a) | |
| type Rep (ZipList a) | Since: base-4.7.0.0 |
Defined in Control.Applicative | |
| type Unwrapped (ZipList a) | |
Defined in Control.Lens.Wrapped | |
| type Element (ZipList a) | |
Defined in Universum.Container.Class | |
| type FromListC (ZipList a) | |
Defined in Universum.Container.Class | |
| type ListElement (ZipList a) | |
Defined in Universum.Container.Class | |
| type Rep1 ZipList | Since: base-4.7.0.0 |
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.
Shared memory locations that support atomic memory transactions.
A monad supporting atomic memory transactions.
Instances
A mutable variable in the IO monad
Instances
| NFData1 IORef | Since: deepseq-1.4.3.0 |
Defined in Control.DeepSeq | |
| NFData (IORef a) | NOTE: Only strict in the reference and not the referenced value. Since: deepseq-1.4.2.0 |
Defined in Control.DeepSeq | |
| Eq (IORef a) | Pointer equality. Since: base-4.0.0.0 |
prettySrcLoc :: SrcLoc -> String #
Pretty print a SrcLoc.
Since: base-4.9.0.0
foldrM :: (Foldable t, Monad m) => (a -> b -> m b) -> b -> t a -> m b #
Right-to-left monadic fold over the elements of a structure.
Given a structure t with elements (a, b, c, ..., x, y), the result of
a fold with an operator function f is equivalent to:
foldrM f z t = do
yy <- f y z
xx <- f x yy
...
bb <- f b cc
aa <- f a bb
return aa -- Just @return z@ when the structure is emptyFor a Monad m, given two functions f1 :: a -> m b and f2 :: b -> m c,
their Kleisli composition (f1 >=> f2) :: a -> m c is defined by:
(f1 >=> f2) a = f1 a >>= f2
Another way of thinking about foldrM is that it amounts to an application
to z of a Kleisli composition:
foldrM f z t = f y >=> f x >=> ... >=> f b >=> f a $ z
The monadic effects of foldrM are sequenced from right to left, and e.g.
folds of infinite lists will diverge.
If at some step the bind operator ( short-circuits (as with, e.g.,
>>=)mzero in a MonadPlus), the evaluated effects will be from a tail of the
element sequence. If you want to evaluate the monadic effects in
left-to-right order, or perhaps be able to short-circuit after an initial
sequence of elements, you'll need to use foldlM instead.
If the monadic effects don't short-circuit, the outermost application of
f is to the leftmost element a, so that, ignoring effects, the result
looks like a right fold:
a `f` (b `f` (c `f` (... (x `f` (y `f` z))))).
Examples
Basic usage:
>>>let f i acc = do { print i ; return $ i : acc }>>>foldrM f [] [0..3]3 2 1 0 [0,1,2,3]
foldlM :: (Foldable t, Monad m) => (b -> a -> m b) -> b -> t a -> m b #
Left-to-right monadic fold over the elements of a structure.
Given a structure t with elements (a, b, ..., w, x, y), the result of
a fold with an operator function f is equivalent to:
foldlM f z t = do
aa <- f z a
bb <- f aa b
...
xx <- f ww x
yy <- f xx y
return yy -- Just @return z@ when the structure is emptyFor a Monad m, given two functions f1 :: a -> m b and f2 :: b -> m c,
their Kleisli composition (f1 >=> f2) :: a -> m c is defined by:
(f1 >=> f2) a = f1 a >>= f2
Another way of thinking about foldlM is that it amounts to an application
to z of a Kleisli composition:
foldlM f z t =
flip f a >=> flip f b >=> ... >=> flip f x >=> flip f y $ zThe monadic effects of foldlM are sequenced from left to right.
If at some step the bind operator ( short-circuits (as with, e.g.,
>>=)mzero in a MonadPlus), the evaluated effects will be from an initial
segment of the element sequence. If you want to evaluate the monadic
effects in right-to-left order, or perhaps be able to short-circuit after
processing a tail of the sequence of elements, you'll need to use foldrM
instead.
If the monadic effects don't short-circuit, the outermost application of
f is to the rightmost element y, so that, ignoring effects, the result
looks like a left fold:
((((z `f` a) `f` b) ... `f` w) `f` x) `f` y
Examples
Basic usage:
>>>let f a e = do { print e ; return $ e : a }>>>foldlM f [] [0..3]0 1 2 3 [3,2,1,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]]
subsequences :: [a] -> [[a]] #
The subsequences function returns the list of all subsequences of the argument.
>>>subsequences "abc"["","a","b","ab","c","ac","bc","abc"]
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 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
permutations :: [a] -> [[a]] #
The permutations function returns the list of all permutations of the argument.
>>>permutations "abc"["abc","bac","cba","bca","cab","acb"]
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.
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.
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.
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.
genericLength :: Num i => [a] -> i #
\(\mathcal{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
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.
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"
Instances
| 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 |
| Applicative Last | Since: base-4.8.0.0 |
| Functor Last | Since: base-4.8.0.0 |
| Monad Last | Since: base-4.8.0.0 |
| NFData1 Last | Since: deepseq-1.4.3.0 |
Defined in Control.DeepSeq | |
| PFoldable Last | |
| SFoldable Last | |
Defined in Data.Foldable.Singletons Methods sFold :: forall m (t1 :: Last m). SMonoid m => Sing t1 -> Sing (Apply FoldSym0 t1) # 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 (t1 :: Last a). Sing t1 -> Sing (Apply ToListSym0 t1) # sNull :: forall a (t1 :: Last a). Sing t1 -> Sing (Apply NullSym0 t1) # sLength :: forall a (t1 :: Last a). Sing t1 -> Sing (Apply LengthSym0 t1) # sElem :: forall a (t1 :: a) (t2 :: Last a). SEq a => Sing t1 -> Sing t2 -> Sing (Apply (Apply ElemSym0 t1) t2) # sMaximum :: forall a (t1 :: Last a). SOrd a => Sing t1 -> Sing (Apply MaximumSym0 t1) # sMinimum :: forall a (t1 :: Last a). SOrd a => Sing t1 -> Sing (Apply MinimumSym0 t1) # sSum :: forall a (t1 :: Last a). SNum a => Sing t1 -> Sing (Apply SumSym0 t1) # sProduct :: forall a (t1 :: Last a). SNum a => Sing t1 -> Sing (Apply ProductSym0 t1) # | |
| PTraversable Last | |
| STraversable Last | |
Defined in Data.Traversable.Singletons 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 (t1 :: Last (f a)). SApplicative f => Sing t1 -> Sing (Apply SequenceASym0 t1) # 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 (t1 :: Last (m a)). SMonad m => Sing t1 -> Sing (Apply SequenceSym0 t1) # | |
| Monoid (Last a) | Since: base-2.1 |
| Semigroup (Last a) | Since: base-4.9.0.0 |
| Generic (Last a) | |
| Read a => Read (Last a) | Since: base-2.1 |
| Show a => Show (Last a) | Since: base-2.1 |
| Default (Last a) | |
Defined in Data.Default.Class | |
| NFData a => NFData (Last a) | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| Eq a => Eq (Last a) | Since: base-2.1 |
| Ord a => Ord (Last a) | Since: base-2.1 |
| Wrapped (Last a) | |
| PMonoid (Last a) | |
| SMonoid (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 # 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 # 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)) # safeHead :: Last a -> Maybe (Element (Last a)) # safeMaximum :: Last a -> Maybe (Element (Last a)) # safeMinimum :: Last a -> Maybe (Element (Last a)) # safeFoldr1 :: (Element (Last a) -> Element (Last a) -> Element (Last a)) -> Last a -> Maybe (Element (Last a)) # safeFoldl1 :: (Element (Last a) -> Element (Last a) -> Element (Last a)) -> Last a -> Maybe (Element (Last a)) # | |
| Generic1 Last | |
| 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.Monoid.Singletons | |
| SDecide (Maybe a) => TestEquality (SLast :: Last a -> Type) | |
Defined in Data.Monoid.Singletons | |
| SingI (GetLastSym0 :: TyFun (Last a) (Maybe a) -> Type) | |
Defined in Data.Monoid.Singletons Methods sing :: Sing GetLastSym0 # | |
| SingI (LastSym0 :: TyFun (Maybe a) (Last a) -> Type) | |
Defined in Data.Monoid.Singletons | |
| SuppressUnusedWarnings (TFHelper_6989586621680118720Sym0 :: TyFun (Last a) (Last a ~> Last a) -> Type) | |
Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680111341Sym0 :: TyFun (Last a) (Last a ~> Ordering) -> Type) | |
Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680109684Sym0 :: TyFun (Last a) (Last a ~> Bool) -> Type) | |
Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (GetLastSym0 :: TyFun (Last a) (Maybe a) -> Type) | |
Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (LastSym0 :: TyFun (Maybe a) (Last a) -> Type) | |
Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621680113571Sym0 :: TyFun Nat (Last a ~> (Symbol ~> Symbol)) -> Type) | |
Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680118729BSym0 :: TyFun a (Last a) -> Type) | |
Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Pure_6989586621680118656Sym0 :: TyFun a (Last a) -> Type) | |
Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680118666Sym0 :: TyFun (Last (a ~> b)) (Last a ~> Last b) -> Type) | |
Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680118720Sym1 a6989586621680118725 :: TyFun (Last a) (Last a) -> Type) | |
Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680111341Sym1 a6989586621680111346 :: TyFun (Last a) Ordering -> Type) | |
Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680118699Sym0 :: TyFun (Last a) ((a ~> Last b) ~> Last b) -> Type) | |
Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621680113571Sym1 a6989586621680113579 :: TyFun (Last a) (Symbol ~> Symbol) -> Type) | |
Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680109684Sym1 a6989586621680109689 :: TyFun (Last a) Bool -> Type) | |
Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr_6989586621680296714Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (Last a ~> b)) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Fmap_6989586621680118677Sym0 :: TyFun (a ~> b) (Last a ~> Last b) -> Type) | |
Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FoldMap_6989586621680296702Sym0 :: TyFun (a ~> m) (Last a ~> m) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680118688Sym0 :: TyFun a (Last b ~> Last a) -> Type) | |
Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Fmap_6989586621680118677Sym1 a6989586621680118682 :: TyFun (Last a) (Last b) -> Type) | |
Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680118666Sym1 a6989586621680118671 :: TyFun (Last a) (Last b) -> Type) | |
Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FoldMap_6989586621680296702Sym1 a6989586621680296707 :: TyFun (Last a) m -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680118688Sym1 a6989586621680118693 :: TyFun (Last b) (Last a) -> Type) | |
Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680118699Sym1 a6989586621680118704 :: TyFun (a ~> Last b) (Last b) -> Type) | |
Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Traverse_6989586621680478813Sym0 :: TyFun (a ~> f b) (Last a ~> f (Last b)) -> Type) | |
Defined in Data.Traversable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr_6989586621680296714Sym1 a6989586621680296720 :: TyFun b (Last a ~> b) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680118708Sym0 :: TyFun k (TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type) -> Type) | |
Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr_6989586621680296714Sym2 a6989586621680296720 a6989586621680296721 :: TyFun (Last a) b -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Traverse_6989586621680478813Sym1 a6989586621680478818 :: TyFun (Last a) (f (Last b)) -> Type) | |
Defined in Data.Traversable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680118708Sym1 a6989586621680118706 :: TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type) | |
Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () # | |
| type Pure (a :: k1) | |
| type Return (arg :: a) | |
| type Fold (arg :: Last m) | |
| type Length (arg :: Last a) | |
| type Maximum (arg :: Last a) | |
| type Minimum (arg :: Last a) | |
| type Null (arg :: Last a) | |
| type Product (arg :: Last a) | |
| type Sum (arg :: Last a) | |
| type ToList (arg :: Last a) | |
| type Elem (arg1 :: a) (arg2 :: Last a) | |
| type Foldl1 (arg1 :: a ~> (a ~> a)) (arg2 :: Last a) | |
| type Foldr1 (arg1 :: a ~> (a ~> a)) (arg2 :: Last a) | |
| type Sequence (arg :: Last (m a)) | |
| type SequenceA (arg :: Last (f a)) | |
| type (arg :: Last a) *> (arg1 :: Last b) | |
| type (a1 :: k1) <$ (a2 :: Last b) | |
| type (arg :: Last a) <* (arg1 :: Last b) | |
| type (a2 :: Last (a1 ~> b)) <*> (a3 :: Last a1) | |
| type (arg :: Last a) >> (arg1 :: Last b) | |
| type (a2 :: Last a1) >>= (a3 :: a1 ~> Last b) | |
| type Fmap (a2 :: a1 ~> b) (a3 :: Last a1) | |
| type FoldMap (a2 :: a1 ~> k2) (a3 :: Last a1) | |
| type Foldl (arg1 :: b ~> (a ~> b)) (arg2 :: b) (arg3 :: Last a) | |
| type Foldl' (arg1 :: b ~> (a ~> b)) (arg2 :: b) (arg3 :: Last a) | |
| type Foldr (a2 :: a1 ~> (k2 ~> k2)) (a3 :: k2) (a4 :: Last a1) | |
| type Foldr' (arg1 :: a ~> (b ~> b)) (arg2 :: b) (arg3 :: Last a) | |
| type MapM (arg1 :: a ~> m b) (arg2 :: Last a) | |
| type Traverse (a2 :: a1 ~> f b) (a3 :: Last a1) | |
| type LiftA2 (arg :: a ~> (b ~> c)) (arg1 :: Last a) (arg2 :: Last b) | |
| type Apply (Let6989586621680118729BSym0 :: TyFun a (Last a) -> Type) (wild_69895866216801179256989586621680118728 :: a) | |
Defined in Data.Monoid.Singletons | |
| type Apply (Pure_6989586621680118656Sym0 :: TyFun a (Last a) -> Type) (a6989586621680118662 :: a) | |
Defined in Data.Monoid.Singletons | |
| type Apply (ShowsPrec_6989586621680113571Sym0 :: TyFun Nat (Last a ~> (Symbol ~> Symbol)) -> Type) (a6989586621680113579 :: Nat) | |
| type Apply (TFHelper_6989586621680118688Sym0 :: TyFun a (Last b ~> Last a) -> Type) (a6989586621680118693 :: a) | |
| type Apply (Foldr_6989586621680296714Sym1 a6989586621680296720 :: TyFun b (Last a ~> b) -> Type) (a6989586621680296721 :: b) | |
| type Apply (Lambda_6989586621680118708Sym0 :: TyFun k (TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type) -> Type) (a6989586621680118706 :: k) | |
| type Rep (Last a) | Since: base-4.7.0.0 |
Defined in Data.Monoid | |
| type Unwrapped (Last a) | |
Defined in Control.Lens.Wrapped | |
| type Demote (Last a) | |
Defined in Data.Monoid.Singletons | |
| type Sing | |
Defined in Data.Monoid.Singletons | |
| type Mempty | |
Defined in Data.Monoid.Singletons | |
| type Element (Last a) | |
Defined in Universum.Container.Class | |
| type Rep1 Last | Since: base-4.7.0.0 |
Defined in Data.Monoid | |
| type Mconcat (arg :: [Last a]) | |
| type Sconcat (arg :: NonEmpty (Last a)) | |
| type Show_ (arg :: Last a) | |
| type (arg :: Last a) /= (arg1 :: Last a) | |
| type (a2 :: Last a1) == (a3 :: Last a1) | |
| type Mappend (arg1 :: Last a) (arg2 :: Last a) | |
| type (arg :: Last a) < (arg1 :: Last a) | |
| type (arg :: Last a) <= (arg1 :: Last a) | |
| type (arg :: Last a) > (arg1 :: Last a) | |
| type (arg :: Last a) >= (arg1 :: Last a) | |
| type Compare (a2 :: Last a1) (a3 :: Last a1) | |
| type Max (arg :: Last a) (arg1 :: Last a) | |
| type Min (arg :: Last a) (arg1 :: Last a) | |
| type (a2 :: Last a1) <> (a3 :: Last a1) | |
| type ShowList (arg :: [Last a]) arg1 | |
| type HKD Last (a :: Type) | |
Defined in Data.Vinyl.XRec | |
| type ShowsPrec a2 (a3 :: Last a1) a4 | |
| type Apply (Compare_6989586621680111341Sym1 a6989586621680111346 :: TyFun (Last a) Ordering -> Type) (a6989586621680111347 :: Last a) | |
| type Apply (TFHelper_6989586621680109684Sym1 a6989586621680109689 :: TyFun (Last a) Bool -> Type) (a6989586621680109690 :: Last a) | |
| type Apply (FoldMap_6989586621680296702Sym1 a6989586621680296707 :: TyFun (Last a) m -> Type) (a6989586621680296708 :: Last a) | |
| type Apply (Foldr_6989586621680296714Sym2 a6989586621680296720 a6989586621680296721 :: TyFun (Last a) b -> Type) (a6989586621680296722 :: Last a) | |
| type Apply (GetLastSym0 :: TyFun (Last a) (Maybe a) -> Type) (a6989586621680108004 :: Last a) | |
Defined in Data.Monoid.Singletons | |
| type Apply (LastSym0 :: TyFun (Maybe a) (Last a) -> Type) (a6989586621680108001 :: Maybe a) | |
| type Apply (TFHelper_6989586621680118720Sym1 a6989586621680118725 :: TyFun (Last a) (Last a) -> Type) (a6989586621680118726 :: Last a) | |
| type Apply (Fmap_6989586621680118677Sym1 a6989586621680118682 :: TyFun (Last a) (Last b) -> Type) (a6989586621680118683 :: Last a) | |
| type Apply (TFHelper_6989586621680118666Sym1 a6989586621680118671 :: TyFun (Last a) (Last b) -> Type) (a6989586621680118672 :: Last a) | |
| type Apply (TFHelper_6989586621680118688Sym1 a6989586621680118693 :: TyFun (Last b) (Last a) -> Type) (a6989586621680118694 :: Last b) | |
| type Apply (Traverse_6989586621680478813Sym1 a6989586621680478818 :: TyFun (Last a) (f (Last b)) -> Type) (a6989586621680478819 :: Last a) | |
| type Apply (TFHelper_6989586621680118720Sym0 :: TyFun (Last a) (Last a ~> Last a) -> Type) (a6989586621680118725 :: Last a) | |
| type Apply (Compare_6989586621680111341Sym0 :: TyFun (Last a) (Last a ~> Ordering) -> Type) (a6989586621680111346 :: Last a) | |
| type Apply (TFHelper_6989586621680109684Sym0 :: TyFun (Last a) (Last a ~> Bool) -> Type) (a6989586621680109689 :: Last a) | |
| type Apply (TFHelper_6989586621680118666Sym0 :: TyFun (Last (a ~> b)) (Last a ~> Last b) -> Type) (a6989586621680118671 :: Last (a ~> b)) | |
| type Apply (TFHelper_6989586621680118699Sym0 :: TyFun (Last a) ((a ~> Last b) ~> Last b) -> Type) (a6989586621680118704 :: Last a) | |
| type Apply (ShowsPrec_6989586621680113571Sym1 a6989586621680113579 :: TyFun (Last a) (Symbol ~> Symbol) -> Type) (a6989586621680113580 :: Last a) | |
| type Apply (TFHelper_6989586621680118699Sym1 a6989586621680118704 :: TyFun (a ~> Last b) (Last b) -> Type) (a6989586621680118705 :: a ~> Last b) | |
| type Apply (Foldr_6989586621680296714Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (Last a ~> b)) -> Type) (a6989586621680296720 :: a ~> (b ~> b)) | |
| type Apply (Fmap_6989586621680118677Sym0 :: TyFun (a ~> b) (Last a ~> Last b) -> Type) (a6989586621680118682 :: a ~> b) | |
| type Apply (FoldMap_6989586621680296702Sym0 :: TyFun (a ~> m) (Last a ~> m) -> Type) (a6989586621680296707 :: a ~> m) | |
| type Apply (Traverse_6989586621680478813Sym0 :: TyFun (a ~> f b) (Last a ~> f (Last b)) -> Type) (a6989586621680478818 :: a ~> f b) | |
| type Apply (Lambda_6989586621680118708Sym1 a6989586621680118706 :: TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type) (k6989586621680118707 :: k1 ~> Last a) | |
Maybe monoid returning the leftmost non-Nothing value.
First aAlt Maybe a
>>>getFirst (First (Just "hello") <> First Nothing <> First (Just "world"))Just "hello"
Instances
| 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 |
| Applicative First | Since: base-4.8.0.0 |
| Functor First | Since: base-4.8.0.0 |
| Monad First | Since: base-4.8.0.0 |
| NFData1 First | Since: deepseq-1.4.3.0 |
Defined in Control.DeepSeq | |
| PFoldable First | |
| SFoldable First | |
Defined in Data.Foldable.Singletons Methods sFold :: forall m (t1 :: First m). SMonoid m => Sing t1 -> Sing (Apply FoldSym0 t1) # 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 (t1 :: First a). Sing t1 -> Sing (Apply ToListSym0 t1) # sNull :: forall a (t1 :: First a). Sing t1 -> Sing (Apply NullSym0 t1) # sLength :: forall a (t1 :: First a). Sing t1 -> Sing (Apply LengthSym0 t1) # sElem :: forall a (t1 :: a) (t2 :: First a). SEq a => Sing t1 -> Sing t2 -> Sing (Apply (Apply ElemSym0 t1) t2) # sMaximum :: forall a (t1 :: First a). SOrd a => Sing t1 -> Sing (Apply MaximumSym0 t1) # sMinimum :: forall a (t1 :: First a). SOrd a => Sing t1 -> Sing (Apply MinimumSym0 t1) # sSum :: forall a (t1 :: First a). SNum a => Sing t1 -> Sing (Apply SumSym0 t1) # sProduct :: forall a (t1 :: First a). SNum a => Sing t1 -> Sing (Apply ProductSym0 t1) # | |
| PTraversable First | |
| STraversable First | |
Defined in Data.Traversable.Singletons 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 (t1 :: First (f a)). SApplicative f => Sing t1 -> Sing (Apply SequenceASym0 t1) # 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 (t1 :: First (m a)). SMonad m => Sing t1 -> Sing (Apply SequenceSym0 t1) # | |
| Monoid (First a) | Since: base-2.1 |
| Semigroup (First a) | Since: base-4.9.0.0 |
| Generic (First a) | |
| Read a => Read (First a) | Since: base-2.1 |
| Show a => Show (First a) | Since: base-2.1 |
| Default (First a) | |
Defined in Data.Default.Class | |
| NFData a => NFData (First a) | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| Eq a => Eq (First a) | Since: base-2.1 |
| Ord a => Ord (First a) | Since: base-2.1 |
| Wrapped (First a) | |
| PMonoid (First a) | |
| SMonoid (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 # 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 # 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)) # safeHead :: First a -> Maybe (Element (First a)) # safeMaximum :: First a -> Maybe (Element (First a)) # safeMinimum :: First a -> Maybe (Element (First a)) # safeFoldr1 :: (Element (First a) -> Element (First a) -> Element (First a)) -> First a -> Maybe (Element (First a)) # safeFoldl1 :: (Element (First a) -> Element (First a) -> Element (First a)) -> First a -> Maybe (Element (First a)) # | |
| Generic1 First | |
| 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.Monoid.Singletons | |
| SDecide (Maybe a) => TestEquality (SFirst :: First a -> Type) | |
Defined in Data.Monoid.Singletons | |
| SingI (GetFirstSym0 :: TyFun (First a) (Maybe a) -> Type) | |
Defined in Data.Monoid.Singletons Methods sing :: Sing GetFirstSym0 # | |
| SingI (FirstSym0 :: TyFun (Maybe a) (First a) -> Type) | |
Defined in Data.Monoid.Singletons | |
| SuppressUnusedWarnings (TFHelper_6989586621680118641Sym0 :: TyFun (First a) (First a ~> First a) -> Type) | |
Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680111321Sym0 :: TyFun (First a) (First a ~> Ordering) -> Type) | |
Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680109664Sym0 :: TyFun (First a) (First a ~> Bool) -> Type) | |
Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (GetFirstSym0 :: TyFun (First a) (Maybe a) -> Type) | |
Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FirstSym0 :: TyFun (Maybe a) (First a) -> Type) | |
Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621680113533Sym0 :: TyFun Nat (First a ~> (Symbol ~> Symbol)) -> Type) | |
Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680118650ASym0 :: TyFun a (First a) -> Type) | |
Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Pure_6989586621680118355Sym0 :: TyFun a (First a) -> Type) | |
Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680118365Sym0 :: TyFun (First (a ~> b)) (First a ~> First b) -> Type) | |
Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680118641Sym1 a6989586621680118646 :: TyFun (First a) (First a) -> Type) | |
Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680111321Sym1 a6989586621680111326 :: TyFun (First a) Ordering -> Type) | |
Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680118488Sym0 :: TyFun (First a) ((a ~> First b) ~> First b) -> Type) | |
Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621680113533Sym1 a6989586621680113541 :: TyFun (First a) (Symbol ~> Symbol) -> Type) | |
Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680109664Sym1 a6989586621680109669 :: TyFun (First a) Bool -> Type) | |
Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr_6989586621680296683Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (First a ~> b)) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680193283Sym0 :: TyFun (a ~> Bool) (TyFun k (TyFun a (First a) -> Type) -> Type) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Fmap_6989586621680118436Sym0 :: TyFun (a ~> b) (First a ~> First b) -> Type) | |
Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FoldMap_6989586621680296671Sym0 :: TyFun (a ~> m) (First a ~> m) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680118447Sym0 :: TyFun a (First b ~> First a) -> Type) | |
Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Fmap_6989586621680118436Sym1 a6989586621680118441 :: TyFun (First a) (First b) -> Type) | |
Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680118365Sym1 a6989586621680118370 :: TyFun (First a) (First b) -> Type) | |
Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FoldMap_6989586621680296671Sym1 a6989586621680296676 :: TyFun (First a) m -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680118447Sym1 a6989586621680118452 :: TyFun (First b) (First a) -> Type) | |
Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680118488Sym1 a6989586621680118493 :: TyFun (a ~> First b) (First b) -> Type) | |
Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Traverse_6989586621680478802Sym0 :: TyFun (a ~> f b) (First a ~> f (First b)) -> Type) | |
Defined in Data.Traversable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr_6989586621680296683Sym1 a6989586621680296689 :: TyFun b (First a ~> b) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680118497Sym0 :: TyFun k (TyFun (k1 ~> First a) (TyFun k1 (Maybe a) -> Type) -> Type) -> Type) | |
Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680193283Sym1 p6989586621680193281 :: TyFun k (TyFun a (First a) -> Type) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr_6989586621680296683Sym2 a6989586621680296689 a6989586621680296690 :: TyFun (First a) b -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Traverse_6989586621680478802Sym1 a6989586621680478807 :: TyFun (First a) (f (First b)) -> Type) | |
Defined in Data.Traversable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680118497Sym1 a6989586621680118495 :: TyFun (k1 ~> First a) (TyFun k1 (Maybe a) -> Type) -> Type) | |
Defined in Data.Monoid.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680193283Sym2 p6989586621680193281 a_69895866216801932746989586621680193282 :: TyFun a (First a) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| type Pure (a :: k1) | |
| type Return (arg :: a) | |
| type Fold (arg :: First m) | |
| type Length (arg :: First a) | |
| type Maximum (arg :: First a) | |
| type Minimum (arg :: First a) | |
| type Null (arg :: First a) | |
| type Product (arg :: First a) | |
| type Sum (arg :: First a) | |
| type ToList (arg :: First a) | |
| type Elem (arg1 :: a) (arg2 :: First a) | |
| type Foldl1 (arg1 :: a ~> (a ~> a)) (arg2 :: First a) | |
| type Foldr1 (arg1 :: a ~> (a ~> a)) (arg2 :: First a) | |
| type Sequence (arg :: First (m a)) | |
| type SequenceA (arg :: First (f a)) | |
| type (arg :: First a) *> (arg1 :: First b) | |
| type (a1 :: k1) <$ (a2 :: First b) | |
| type (arg :: First a) <* (arg1 :: First b) | |
| type (a2 :: First (a1 ~> b)) <*> (a3 :: First a1) | |
| type (arg :: First a) >> (arg1 :: First b) | |
| type (a2 :: First a1) >>= (a3 :: a1 ~> First b) | |
| type Fmap (a2 :: a1 ~> b) (a3 :: First a1) | |
| type FoldMap (a2 :: a1 ~> k2) (a3 :: First a1) | |
| type Foldl (arg1 :: b ~> (a ~> b)) (arg2 :: b) (arg3 :: First a) | |
| type Foldl' (arg1 :: b ~> (a ~> b)) (arg2 :: b) (arg3 :: First a) | |
| type Foldr (a2 :: a1 ~> (k2 ~> k2)) (a3 :: k2) (a4 :: First a1) | |
| type Foldr' (arg1 :: a ~> (b ~> b)) (arg2 :: b) (arg3 :: First a) | |
| type MapM (arg1 :: a ~> m b) (arg2 :: First a) | |
| type Traverse (a2 :: a1 ~> f b) (a3 :: First a1) | |
| type LiftA2 (arg :: a ~> (b ~> c)) (arg1 :: First a) (arg2 :: First b) | |
| type Apply (Let6989586621680118650ASym0 :: TyFun a (First a) -> Type) (wild_69895866216801179186989586621680118649 :: a) | |
Defined in Data.Monoid.Singletons | |
| type Apply (Pure_6989586621680118355Sym0 :: TyFun a (First a) -> Type) (a6989586621680118361 :: a) | |
Defined in Data.Monoid.Singletons | |
| type Apply (Lambda_6989586621680193283Sym2 p6989586621680193281 a_69895866216801932746989586621680193282 :: TyFun a (First a) -> Type) (x6989586621680193285 :: a) | |
Defined in Data.Foldable.Singletons | |
| type Apply (ShowsPrec_6989586621680113533Sym0 :: TyFun Nat (First a ~> (Symbol ~> Symbol)) -> Type) (a6989586621680113541 :: Nat) | |
| type Apply (TFHelper_6989586621680118447Sym0 :: TyFun a (First b ~> First a) -> Type) (a6989586621680118452 :: a) | |
| type Apply (Foldr_6989586621680296683Sym1 a6989586621680296689 :: TyFun b (First a ~> b) -> Type) (a6989586621680296690 :: b) | |
| type Apply (Lambda_6989586621680118497Sym0 :: TyFun k (TyFun (k1 ~> First a) (TyFun k1 (Maybe a) -> Type) -> Type) -> Type) (a6989586621680118495 :: k) | |
Defined in Data.Monoid.Singletons | |
| type Apply (Lambda_6989586621680193283Sym1 p6989586621680193281 :: TyFun k (TyFun a (First a) -> Type) -> Type) (a_69895866216801932746989586621680193282 :: k) | |
| type Rep (First a) | Since: base-4.7.0.0 |
Defined in Data.Monoid | |
| type Unwrapped (First a) | |
Defined in Control.Lens.Wrapped | |
| type Demote (First a) | |
Defined in Data.Monoid.Singletons | |
| type Sing | |
Defined in Data.Monoid.Singletons | |
| type Mempty | |
Defined in Data.Monoid.Singletons | |
| type Element (First a) | |
Defined in Universum.Container.Class | |
| type Rep1 First | Since: base-4.7.0.0 |
Defined in Data.Monoid | |
| type Mconcat (arg :: [First a]) | |
| type Sconcat (arg :: NonEmpty (First a)) | |
| type Show_ (arg :: First a) | |
| type (arg :: First a) /= (arg1 :: First a) | |
| type (a2 :: First a1) == (a3 :: First a1) | |
| type Mappend (arg1 :: First a) (arg2 :: First a) | |
| type (arg :: First a) < (arg1 :: First a) | |
| type (arg :: First a) <= (arg1 :: First a) | |
| type (arg :: First a) > (arg1 :: First a) | |
| type (arg :: First a) >= (arg1 :: First a) | |
| type Compare (a2 :: First a1) (a3 :: First a1) | |
| type Max (arg :: First a) (arg1 :: First a) | |
| type Min (arg :: First a) (arg1 :: First a) | |
| type (a2 :: First a1) <> (a3 :: First a1) | |
| type ShowList (arg :: [First a]) arg1 | |
| type HKD First (a :: Type) | |
Defined in Data.Vinyl.XRec | |
| type ShowsPrec a2 (a3 :: First a1) a4 | |
| type Apply (Compare_6989586621680111321Sym1 a6989586621680111326 :: TyFun (First a) Ordering -> Type) (a6989586621680111327 :: First a) | |
| type Apply (TFHelper_6989586621680109664Sym1 a6989586621680109669 :: TyFun (First a) Bool -> Type) (a6989586621680109670 :: First a) | |
| type Apply (FoldMap_6989586621680296671Sym1 a6989586621680296676 :: TyFun (First a) m -> Type) (a6989586621680296677 :: First a) | |
| type Apply (Foldr_6989586621680296683Sym2 a6989586621680296689 a6989586621680296690 :: TyFun (First a) b -> Type) (a6989586621680296691 :: First a) | |
| type Apply (GetFirstSym0 :: TyFun (First a) (Maybe a) -> Type) (a6989586621680107980 :: First a) | |
Defined in Data.Monoid.Singletons | |
| type Apply (FirstSym0 :: TyFun (Maybe a) (First a) -> Type) (a6989586621680107977 :: Maybe a) | |
| type Apply (TFHelper_6989586621680118641Sym1 a6989586621680118646 :: TyFun (First a) (First a) -> Type) (a6989586621680118647 :: First a) | |
| type Apply (Fmap_6989586621680118436Sym1 a6989586621680118441 :: TyFun (First a) (First b) -> Type) (a6989586621680118442 :: First a) | |
| type Apply (TFHelper_6989586621680118365Sym1 a6989586621680118370 :: TyFun (First a) (First b) -> Type) (a6989586621680118371 :: First a) | |
| type Apply (TFHelper_6989586621680118447Sym1 a6989586621680118452 :: TyFun (First b) (First a) -> Type) (a6989586621680118453 :: First b) | |
| type Apply (Traverse_6989586621680478802Sym1 a6989586621680478807 :: TyFun (First a) (f (First b)) -> Type) (a6989586621680478808 :: First a) | |
| type Apply (TFHelper_6989586621680118641Sym0 :: TyFun (First a) (First a ~> First a) -> Type) (a6989586621680118646 :: First a) | |
| type Apply (Compare_6989586621680111321Sym0 :: TyFun (First a) (First a ~> Ordering) -> Type) (a6989586621680111326 :: First a) | |
| type Apply (TFHelper_6989586621680109664Sym0 :: TyFun (First a) (First a ~> Bool) -> Type) (a6989586621680109669 :: First a) | |
| type Apply (TFHelper_6989586621680118365Sym0 :: TyFun (First (a ~> b)) (First a ~> First b) -> Type) (a6989586621680118370 :: First (a ~> b)) | |
| type Apply (TFHelper_6989586621680118488Sym0 :: TyFun (First a) ((a ~> First b) ~> First b) -> Type) (a6989586621680118493 :: First a) | |
| type Apply (ShowsPrec_6989586621680113533Sym1 a6989586621680113541 :: TyFun (First a) (Symbol ~> Symbol) -> Type) (a6989586621680113542 :: First a) | |
| type Apply (TFHelper_6989586621680118488Sym1 a6989586621680118493 :: TyFun (a ~> First b) (First b) -> Type) (a6989586621680118494 :: a ~> First b) | |
| type Apply (Foldr_6989586621680296683Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (First a ~> b)) -> Type) (a6989586621680296689 :: a ~> (b ~> b)) | |
| type Apply (Lambda_6989586621680193283Sym0 :: TyFun (a ~> Bool) (TyFun k (TyFun a (First a) -> Type) -> Type) -> Type) (p6989586621680193281 :: a ~> Bool) | |
| type Apply (Fmap_6989586621680118436Sym0 :: TyFun (a ~> b) (First a ~> First b) -> Type) (a6989586621680118441 :: a ~> b) | |
| type Apply (FoldMap_6989586621680296671Sym0 :: TyFun (a ~> m) (First a ~> m) -> Type) (a6989586621680296676 :: a ~> m) | |
| type Apply (Traverse_6989586621680478802Sym0 :: TyFun (a ~> f b) (First a ~> f (First b)) -> Type) (a6989586621680478807 :: a ~> f b) | |
| type Apply (Lambda_6989586621680118497Sym1 a6989586621680118495 :: TyFun (k1 ~> First a) (TyFun k1 (Maybe a) -> Type) -> Type) (k6989586621680118496 :: k1 ~> First a) | |
Monoid under addition.
>>>getSum (Sum 1 <> Sum 2 <> mempty)3
Instances
| Representable Sum | |
| 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 |
| Applicative Sum | Since: base-4.8.0.0 |
| Functor Sum | Since: base-4.8.0.0 |
| Monad Sum | Since: base-4.8.0.0 |
| NFData1 Sum | Since: deepseq-1.4.3.0 |
Defined in Control.DeepSeq | |
| PFoldable Sum | |
| SFoldable Sum | |
Defined in Data.Foldable.Singletons Methods sFold :: forall m (t1 :: Sum m). SMonoid m => Sing t1 -> Sing (Apply FoldSym0 t1) # 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 (t1 :: Sum a). Sing t1 -> Sing (Apply ToListSym0 t1) # sNull :: forall a (t1 :: Sum a). Sing t1 -> Sing (Apply NullSym0 t1) # sLength :: forall a (t1 :: Sum a). Sing t1 -> Sing (Apply LengthSym0 t1) # sElem :: forall a (t1 :: a) (t2 :: Sum a). SEq a => Sing t1 -> Sing t2 -> Sing (Apply (Apply ElemSym0 t1) t2) # sMaximum :: forall a (t1 :: Sum a). SOrd a => Sing t1 -> Sing (Apply MaximumSym0 t1) # sMinimum :: forall a (t1 :: Sum a). SOrd a => Sing t1 -> Sing (Apply MinimumSym0 t1) # sSum :: forall a (t1 :: Sum a). SNum a => Sing t1 -> Sing (Apply SumSym0 t1) # sProduct :: forall a (t1 :: Sum a). SNum a => Sing t1 -> Sing (Apply ProductSym0 t1) # | |
| PTraversable Sum | |
| STraversable Sum | |
Defined in Data.Traversable.Singletons 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 (t1 :: Sum (f a)). SApplicative f => Sing t1 -> Sing (Apply SequenceASym0 t1) # 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 (t1 :: Sum (m a)). SMonad m => Sing t1 -> Sing (Apply SequenceSym0 t1) # | |
| 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)) # | |
| Num a => Monoid (Sum a) | Since: base-2.1 |
| Num a => Semigroup (Sum a) | Since: base-4.9.0.0 |
| Bounded a => Bounded (Sum a) | Since: base-2.1 |
| Generic (Sum a) | |
| Num a => Num (Sum a) | Since: base-4.7.0.0 |
| Read a => Read (Sum a) | Since: base-2.1 |
| Show a => Show (Sum a) | Since: base-2.1 |
| Num a => Default (Sum a) | |
Defined in Data.Default.Class | |
| NFData a => NFData (Sum a) | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| Eq a => Eq (Sum a) | Since: base-2.1 |
| Ord a => Ord (Sum a) | Since: base-2.1 |
| Wrapped (Sum a) | |
| PMonoid (Sum a) | |
| SNum a => SMonoid (Sum a) | |
| PSemigroup (Sum a) | |
Defined in Data.Semigroup.Singletons.Internal | |
| SNum a => SSemigroup (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 # 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 # 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)) # safeHead :: Sum a -> Maybe (Element (Sum a)) # safeMaximum :: Sum a -> Maybe (Element (Sum a)) # safeMinimum :: Sum a -> Maybe (Element (Sum a)) # safeFoldr1 :: (Element (Sum a) -> Element (Sum a) -> Element (Sum a)) -> Sum a -> Maybe (Element (Sum a)) # safeFoldl1 :: (Element (Sum a) -> Element (Sum a) -> Element (Sum a)) -> Sum a -> Maybe (Element (Sum a)) # | |
| Unbox a => Unbox (Sum a) | |
Defined in Data.Vector.Unboxed.Base | |
| Generic1 Sum | |
| 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.Semigroup.Singletons.Internal | |
| SDecide a => TestEquality (SSum :: Sum a -> Type) | |
Defined in Data.Semigroup.Singletons.Internal | |
| SingI (GetSumSym0 :: TyFun (Sum a) a -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods sing :: Sing GetSumSym0 # | |
| SingI (SumSym0 :: TyFun a (Sum a) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal | |
| SingI (Sum_Sym0 :: TyFun a (Sum a) -> Type) | |
| SuppressUnusedWarnings (Abs_6989586621679624806Sym0 :: TyFun (Sum a) (Sum a) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Negate_6989586621679624799Sym0 :: TyFun (Sum a) (Sum a) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Signum_6989586621679624813Sym0 :: TyFun (Sum a) (Sum a) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679624733Sym0 :: TyFun (Sum a) (Sum a ~> Sum a) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679624767Sym0 :: TyFun (Sum a) (Sum a ~> Sum a) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679624778Sym0 :: TyFun (Sum a) (Sum a ~> Sum a) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679624789Sym0 :: TyFun (Sum a) (Sum a ~> Sum a) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679613621Sym0 :: TyFun (Sum a) (Sum a ~> Ordering) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679606160Sym0 :: TyFun (Sum a) (Sum a ~> Bool) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Null_6989586621680194575Sym0 :: TyFun (Sum a) Bool -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Length_6989586621680194551Sym0 :: TyFun (Sum a) Nat -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ToList_6989586621680194599Sym0 :: TyFun (Sum a) [a] -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Maximum_6989586621680194557Sym0 :: TyFun (Sum a) a -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Minimum_6989586621680194566Sym0 :: TyFun (Sum a) a -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Product_6989586621680194581Sym0 :: TyFun (Sum a) a -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Sum_6989586621680194590Sym0 :: TyFun (Sum a) a -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (GetSumSym0 :: TyFun (Sum a) a -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldl1_6989586621680194492Sym0 :: TyFun (a ~> (a ~> a)) (Sum a ~> a) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr1_6989586621680194540Sym0 :: TyFun (a ~> (a ~> a)) (Sum a ~> a) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FromInteger_6989586621679624820Sym0 :: TyFun Nat (Sum a) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621680582255Sym0 :: TyFun Nat (Sum a ~> (Symbol ~> Symbol)) -> Type) | |
Defined in Data.Semigroup.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Pure_6989586621679624675Sym0 :: TyFun a (Sum a) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (SumSym0 :: TyFun a (Sum a) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Sum_Sym0 :: TyFun a (Sum a) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal.Disambiguation Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Elem_6989586621680194443Sym0 :: TyFun a (Sum a ~> Bool) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679624685Sym0 :: TyFun (Sum (a ~> b)) (Sum a ~> Sum b) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679624733Sym1 a6989586621679624738 :: TyFun (Sum a) (Sum a) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679624767Sym1 a6989586621679624772 :: TyFun (Sum a) (Sum a) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679624778Sym1 a6989586621679624783 :: TyFun (Sum a) (Sum a) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679624789Sym1 a6989586621679624794 :: TyFun (Sum a) (Sum a) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679613621Sym1 a6989586621679613626 :: TyFun (Sum a) Ordering -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679624722Sym0 :: TyFun (Sum a) ((a ~> Sum b) ~> Sum b) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621680582255Sym1 a6989586621680582263 :: TyFun (Sum a) (Symbol ~> Symbol) -> Type) | |
Defined in Data.Semigroup.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Elem_6989586621680194443Sym1 a6989586621680194452 :: TyFun (Sum a) Bool -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679606160Sym1 a6989586621679606165 :: TyFun (Sum a) Bool -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldl1_6989586621680194492Sym1 a6989586621680194499 :: TyFun (Sum a) a -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr1_6989586621680194540Sym1 a6989586621680194547 :: TyFun (Sum a) a -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr'_6989586621680194520Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (Sum a ~> b)) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr_6989586621680194505Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (Sum a ~> b)) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Fmap_6989586621679624696Sym0 :: TyFun (a ~> b) (Sum a ~> Sum b) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FoldMap_6989586621680194432Sym0 :: TyFun (a ~> m) (Sum a ~> m) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldl'_6989586621680194478Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (Sum a ~> b)) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldl_6989586621680194463Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (Sum a ~> b)) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679624707Sym0 :: TyFun a (Sum b ~> Sum a) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Fmap_6989586621679624696Sym1 a6989586621679624701 :: TyFun (Sum a) (Sum b) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679624685Sym1 a6989586621679624690 :: TyFun (Sum a) (Sum b) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FoldMap_6989586621680194432Sym1 a6989586621680194437 :: TyFun (Sum a) m -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679624707Sym1 a6989586621679624712 :: TyFun (Sum b) (Sum a) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679624722Sym1 a6989586621679624727 :: TyFun (a ~> Sum b) (Sum b) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Traverse_6989586621680478780Sym0 :: TyFun (a ~> f b) (Sum a ~> f (Sum b)) -> Type) | |
Defined in Data.Traversable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldl'_6989586621680194478Sym1 a6989586621680194484 :: TyFun b (Sum a ~> b) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldl_6989586621680194463Sym1 a6989586621680194469 :: TyFun b (Sum a ~> b) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr'_6989586621680194520Sym1 a6989586621680194532 :: TyFun b (Sum a ~> b) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr_6989586621680194505Sym1 a6989586621680194511 :: TyFun b (Sum a ~> b) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldl'_6989586621680194478Sym2 a6989586621680194484 a6989586621680194485 :: TyFun (Sum a) b -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldl_6989586621680194463Sym2 a6989586621680194469 a6989586621680194470 :: TyFun (Sum a) b -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr'_6989586621680194520Sym2 a6989586621680194532 a6989586621680194533 :: TyFun (Sum a) b -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr_6989586621680194505Sym2 a6989586621680194511 a6989586621680194512 :: TyFun (Sum a) b -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Traverse_6989586621680478780Sym1 a6989586621680478785 :: TyFun (Sum a) (f (Sum b)) -> Type) | |
Defined in Data.Traversable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680194456Sym0 :: TyFun k1 (TyFun k2 (TyFun (b ~> c) (Sum b ~> c) -> Type) -> Type) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680194456Sym1 a_69895866216801944456989586621680194454 :: TyFun k2 (TyFun (b ~> c) (Sum b ~> c) -> Type) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680194456Sym2 a_69895866216801944456989586621680194454 a_69895866216801944476989586621680194455 :: TyFun (b ~> c) (Sum b ~> c) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| type Rep Sum | |
Defined in Data.Functor.Rep | |
| type Pure (a :: k1) | |
| type Return (arg :: a) | |
| type Fold (arg :: Sum m) | |
| type Length (a2 :: Sum a1) | |
| type Maximum (a :: Sum k2) | |
| type Minimum (a :: Sum k2) | |
| type Null (a2 :: Sum a1) | |
| type Product (a :: Sum k2) | |
| type Sum (a :: Sum k2) | |
| type ToList (a2 :: Sum a1) | |
| 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 Sequence (arg :: Sum (m a)) | |
| type SequenceA (arg :: Sum (f a)) | |
| type (arg :: Sum a) *> (arg1 :: Sum b) | |
| type (a1 :: k1) <$ (a2 :: Sum b) | |
| type (arg :: Sum a) <* (arg1 :: Sum b) | |
| type (a2 :: Sum (a1 ~> b)) <*> (a3 :: Sum a1) | |
| type (arg :: Sum a) >> (arg1 :: Sum b) | |
| type (a2 :: Sum a1) >>= (a3 :: a1 ~> Sum b) | |
| type Fmap (a2 :: a1 ~> b) (a3 :: Sum a1) | |
| type FoldMap (a2 :: a1 ~> k2) (a3 :: Sum a1) | |
| type Foldl (a2 :: k2 ~> (a1 ~> k2)) (a3 :: k2) (a4 :: Sum a1) | |
| type Foldl' (a2 :: k2 ~> (a1 ~> k2)) (a3 :: k2) (a4 :: Sum a1) | |
| type Foldr (a2 :: a1 ~> (k2 ~> k2)) (a3 :: k2) (a4 :: Sum a1) | |
| type Foldr' (a2 :: a1 ~> (k2 ~> k2)) (a3 :: k2) (a4 :: Sum a1) | |
| type MapM (arg1 :: a ~> m b) (arg2 :: Sum a) | |
| type Traverse (a2 :: a1 ~> f b) (a3 :: Sum a1) | |
| type LiftA2 (arg :: a ~> (b ~> c)) (arg1 :: Sum a) (arg2 :: Sum b) | |
| newtype MVector s (Sum a) | |
Defined in Data.Vector.Unboxed.Base | |
| type Apply (FromInteger_6989586621679624820Sym0 :: TyFun Nat (Sum a) -> Type) (a6989586621679624824 :: Nat) | |
| type Apply (Pure_6989586621679624675Sym0 :: TyFun a (Sum a) -> Type) (a6989586621679624681 :: a) | |
Defined in Data.Semigroup.Singletons.Internal | |
| type Apply (SumSym0 :: TyFun a (Sum a) -> Type) (a6989586621679596414 :: a) | |
| type Apply (Sum_Sym0 :: TyFun a (Sum a) -> Type) (a6989586621679713085 :: a) | |
| type Apply (ShowsPrec_6989586621680582255Sym0 :: TyFun Nat (Sum a ~> (Symbol ~> Symbol)) -> Type) (a6989586621680582263 :: Nat) | |
| type Apply (Elem_6989586621680194443Sym0 :: TyFun a (Sum a ~> Bool) -> Type) (a6989586621680194452 :: a) | |
| type Apply (TFHelper_6989586621679624707Sym0 :: TyFun a (Sum b ~> Sum a) -> Type) (a6989586621679624712 :: a) | |
| type Apply (Foldl'_6989586621680194478Sym1 a6989586621680194484 :: TyFun b (Sum a ~> b) -> Type) (a6989586621680194485 :: b) | |
| type Apply (Foldl_6989586621680194463Sym1 a6989586621680194469 :: TyFun b (Sum a ~> b) -> Type) (a6989586621680194470 :: b) | |
| type Apply (Foldr'_6989586621680194520Sym1 a6989586621680194532 :: TyFun b (Sum a ~> b) -> Type) (a6989586621680194533 :: b) | |
| type Apply (Foldr_6989586621680194505Sym1 a6989586621680194511 :: TyFun b (Sum a ~> b) -> Type) (a6989586621680194512 :: b) | |
| type Apply (Lambda_6989586621680194456Sym0 :: TyFun k1 (TyFun k2 (TyFun (b ~> c) (Sum b ~> c) -> Type) -> Type) -> Type) (a_69895866216801944456989586621680194454 :: k1) | |
Defined in Data.Foldable.Singletons type Apply (Lambda_6989586621680194456Sym0 :: TyFun k1 (TyFun k2 (TyFun (b ~> c) (Sum b ~> c) -> Type) -> Type) -> Type) (a_69895866216801944456989586621680194454 :: k1) = Lambda_6989586621680194456Sym1 a_69895866216801944456989586621680194454 :: TyFun k2 (TyFun (b ~> c) (Sum b ~> c) -> Type) -> Type | |
| type Apply (Lambda_6989586621680194456Sym1 a_69895866216801944456989586621680194454 :: TyFun k2 (TyFun (b ~> c) (Sum b ~> c) -> Type) -> Type) (a_69895866216801944476989586621680194455 :: k2) | |
Defined in Data.Foldable.Singletons type Apply (Lambda_6989586621680194456Sym1 a_69895866216801944456989586621680194454 :: TyFun k2 (TyFun (b ~> c) (Sum b ~> c) -> Type) -> Type) (a_69895866216801944476989586621680194455 :: k2) = Lambda_6989586621680194456Sym2 a_69895866216801944456989586621680194454 a_69895866216801944476989586621680194455 :: TyFun (b ~> c) (Sum b ~> c) -> Type | |
| type Rep (Sum a) | Since: base-4.7.0.0 |
Defined in Data.Semigroup.Internal | |
| type Unwrapped (Sum a) | |
Defined in Control.Lens.Wrapped | |
| type Demote (Sum a) | |
Defined in Data.Semigroup.Singletons.Internal | |
| type Sing | |
Defined in Data.Semigroup.Singletons.Internal | |
| type Mempty | |
Defined in Data.Monoid.Singletons | |
| type MaxBound | |
Defined in Data.Semigroup.Singletons.Internal | |
| type MinBound | |
Defined in Data.Semigroup.Singletons.Internal | |
| type Element (Sum a) | |
Defined in Universum.Container.Class | |
| newtype Vector (Sum a) | |
Defined in Data.Vector.Unboxed.Base | |
| type Rep1 Sum | Since: base-4.7.0.0 |
Defined in Data.Semigroup.Internal | |
| type Mconcat (arg :: [Sum a]) | |
| type Sconcat (arg :: NonEmpty (Sum a)) | |
| type Abs (a2 :: Sum a1) | |
| type FromInteger a2 | |
Defined in Data.Semigroup.Singletons.Internal | |
| type Negate (a2 :: Sum a1) | |
| type Signum (a2 :: Sum a1) | |
| type Show_ (arg :: Sum a) | |
| type (arg :: Sum a) /= (arg1 :: Sum a) | |
| type (a2 :: Sum a1) == (a3 :: Sum a1) | |
| type Mappend (arg1 :: Sum a) (arg2 :: Sum a) | |
| type (arg :: Sum a) < (arg1 :: Sum a) | |
| type (arg :: Sum a) <= (arg1 :: Sum a) | |
| type (arg :: Sum a) > (arg1 :: Sum a) | |
| type (arg :: Sum a) >= (arg1 :: Sum a) | |
| type Compare (a2 :: Sum a1) (a3 :: Sum a1) | |
| type Max (arg :: Sum a) (arg1 :: Sum a) | |
| type Min (arg :: Sum a) (arg1 :: Sum a) | |
| 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 ShowList (arg :: [Sum a]) arg1 | |
| type HKD Sum (a :: Type) | |
Defined in Data.Vinyl.XRec | |
| type ShowsPrec a2 (a3 :: Sum a1) a4 | |
| type Apply (Null_6989586621680194575Sym0 :: TyFun (Sum a) Bool -> Type) (a6989586621680194579 :: Sum a) | |
| type Apply (Length_6989586621680194551Sym0 :: TyFun (Sum a) Nat -> Type) (a6989586621680194555 :: Sum a) | |
| type Apply (Maximum_6989586621680194557Sym0 :: TyFun (Sum a) a -> Type) (a6989586621680194563 :: Sum a) | |
| type Apply (Minimum_6989586621680194566Sym0 :: TyFun (Sum a) a -> Type) (a6989586621680194572 :: Sum a) | |
| type Apply (Product_6989586621680194581Sym0 :: TyFun (Sum a) a -> Type) (a6989586621680194587 :: Sum a) | |
| type Apply (Sum_6989586621680194590Sym0 :: TyFun (Sum a) a -> Type) (a6989586621680194596 :: Sum a) | |
| type Apply (GetSumSym0 :: TyFun (Sum a) a -> Type) (a6989586621679596417 :: Sum a) | |
Defined in Data.Semigroup.Singletons.Internal | |
| type Apply (Compare_6989586621679613621Sym1 a6989586621679613626 :: TyFun (Sum a) Ordering -> Type) (a6989586621679613627 :: Sum a) | |
| type Apply (Elem_6989586621680194443Sym1 a6989586621680194452 :: TyFun (Sum a) Bool -> Type) (a6989586621680194453 :: Sum a) | |
| type Apply (TFHelper_6989586621679606160Sym1 a6989586621679606165 :: TyFun (Sum a) Bool -> Type) (a6989586621679606166 :: Sum a) | |
| type Apply (Foldl1_6989586621680194492Sym1 a6989586621680194499 :: TyFun (Sum a) a -> Type) (a6989586621680194500 :: Sum a) | |
| type Apply (Foldr1_6989586621680194540Sym1 a6989586621680194547 :: TyFun (Sum a) a -> Type) (a6989586621680194548 :: Sum a) | |
| type Apply (FoldMap_6989586621680194432Sym1 a6989586621680194437 :: TyFun (Sum a) m -> Type) (a6989586621680194438 :: Sum a) | |
| type Apply (Foldl'_6989586621680194478Sym2 a6989586621680194484 a6989586621680194485 :: TyFun (Sum a) b -> Type) (a6989586621680194486 :: Sum a) | |
| type Apply (Foldl_6989586621680194463Sym2 a6989586621680194469 a6989586621680194470 :: TyFun (Sum a) b -> Type) (a6989586621680194471 :: Sum a) | |
| type Apply (Foldr'_6989586621680194520Sym2 a6989586621680194532 a6989586621680194533 :: TyFun (Sum a) b -> Type) (a6989586621680194534 :: Sum a) | |
| type Apply (Foldr_6989586621680194505Sym2 a6989586621680194511 a6989586621680194512 :: TyFun (Sum a) b -> Type) (a6989586621680194513 :: Sum a) | |
| type Apply (Abs_6989586621679624806Sym0 :: TyFun (Sum a) (Sum a) -> Type) (a6989586621679624810 :: Sum a) | |
| type Apply (Negate_6989586621679624799Sym0 :: TyFun (Sum a) (Sum a) -> Type) (a6989586621679624803 :: Sum a) | |
| type Apply (Signum_6989586621679624813Sym0 :: TyFun (Sum a) (Sum a) -> Type) (a6989586621679624817 :: Sum a) | |
| type Apply (ToList_6989586621680194599Sym0 :: TyFun (Sum a) [a] -> Type) (a6989586621680194603 :: Sum a) | |
| type Apply (TFHelper_6989586621679624733Sym1 a6989586621679624738 :: TyFun (Sum a) (Sum a) -> Type) (a6989586621679624739 :: Sum a) | |
| type Apply (TFHelper_6989586621679624767Sym1 a6989586621679624772 :: TyFun (Sum a) (Sum a) -> Type) (a6989586621679624773 :: Sum a) | |
| type Apply (TFHelper_6989586621679624778Sym1 a6989586621679624783 :: TyFun (Sum a) (Sum a) -> Type) (a6989586621679624784 :: Sum a) | |
| type Apply (TFHelper_6989586621679624789Sym1 a6989586621679624794 :: TyFun (Sum a) (Sum a) -> Type) (a6989586621679624795 :: Sum a) | |
| type Apply (Fmap_6989586621679624696Sym1 a6989586621679624701 :: TyFun (Sum a) (Sum b) -> Type) (a6989586621679624702 :: Sum a) | |
| type Apply (TFHelper_6989586621679624685Sym1 a6989586621679624690 :: TyFun (Sum a) (Sum b) -> Type) (a6989586621679624691 :: Sum a) | |
| type Apply (TFHelper_6989586621679624707Sym1 a6989586621679624712 :: TyFun (Sum b) (Sum a) -> Type) (a6989586621679624713 :: Sum b) | |
| type Apply (Traverse_6989586621680478780Sym1 a6989586621680478785 :: TyFun (Sum a) (f (Sum b)) -> Type) (a6989586621680478786 :: Sum a) | |
| type Apply (TFHelper_6989586621679624733Sym0 :: TyFun (Sum a) (Sum a ~> Sum a) -> Type) (a6989586621679624738 :: Sum a) | |
| type Apply (TFHelper_6989586621679624767Sym0 :: TyFun (Sum a) (Sum a ~> Sum a) -> Type) (a6989586621679624772 :: Sum a) | |
| type Apply (TFHelper_6989586621679624778Sym0 :: TyFun (Sum a) (Sum a ~> Sum a) -> Type) (a6989586621679624783 :: Sum a) | |
| type Apply (TFHelper_6989586621679624789Sym0 :: TyFun (Sum a) (Sum a ~> Sum a) -> Type) (a6989586621679624794 :: Sum a) | |
| type Apply (Compare_6989586621679613621Sym0 :: TyFun (Sum a) (Sum a ~> Ordering) -> Type) (a6989586621679613626 :: Sum a) | |
| type Apply (TFHelper_6989586621679606160Sym0 :: TyFun (Sum a) (Sum a ~> Bool) -> Type) (a6989586621679606165 :: Sum a) | |
| type Apply (TFHelper_6989586621679624685Sym0 :: TyFun (Sum (a ~> b)) (Sum a ~> Sum b) -> Type) (a6989586621679624690 :: Sum (a ~> b)) | |
| type Apply (TFHelper_6989586621679624722Sym0 :: TyFun (Sum a) ((a ~> Sum b) ~> Sum b) -> Type) (a6989586621679624727 :: Sum a) | |
| type Apply (ShowsPrec_6989586621680582255Sym1 a6989586621680582263 :: TyFun (Sum a) (Symbol ~> Symbol) -> Type) (a6989586621680582264 :: Sum a) | |
| type Apply (TFHelper_6989586621679624722Sym1 a6989586621679624727 :: TyFun (a ~> Sum b) (Sum b) -> Type) (a6989586621679624728 :: a ~> Sum b) | |
| type Apply (Foldl1_6989586621680194492Sym0 :: TyFun (a ~> (a ~> a)) (Sum a ~> a) -> Type) (a6989586621680194499 :: a ~> (a ~> a)) | |
| type Apply (Foldr1_6989586621680194540Sym0 :: TyFun (a ~> (a ~> a)) (Sum a ~> a) -> Type) (a6989586621680194547 :: a ~> (a ~> a)) | |
| type Apply (Foldr'_6989586621680194520Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (Sum a ~> b)) -> Type) (a6989586621680194532 :: a ~> (b ~> b)) | |
| type Apply (Foldr_6989586621680194505Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (Sum a ~> b)) -> Type) (a6989586621680194511 :: a ~> (b ~> b)) | |
| type Apply (Fmap_6989586621679624696Sym0 :: TyFun (a ~> b) (Sum a ~> Sum b) -> Type) (a6989586621679624701 :: a ~> b) | |
| type Apply (FoldMap_6989586621680194432Sym0 :: TyFun (a ~> m) (Sum a ~> m) -> Type) (a6989586621680194437 :: a ~> m) | |
| type Apply (Foldl'_6989586621680194478Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (Sum a ~> b)) -> Type) (a6989586621680194484 :: b ~> (a ~> b)) | |
| type Apply (Foldl_6989586621680194463Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (Sum a ~> b)) -> Type) (a6989586621680194469 :: b ~> (a ~> b)) | |
| type Apply (Traverse_6989586621680478780Sym0 :: TyFun (a ~> f b) (Sum a ~> f (Sum b)) -> Type) (a6989586621680478785 :: a ~> f b) | |
| type Apply (Lambda_6989586621680194456Sym2 a_69895866216801944456989586621680194454 a_69895866216801944476989586621680194455 :: TyFun (b ~> c) (Sum b ~> c) -> Type) (lhs_69895866216801931186989586621680194458 :: b ~> c) | |
Defined in Data.Foldable.Singletons type Apply (Lambda_6989586621680194456Sym2 a_69895866216801944456989586621680194454 a_69895866216801944476989586621680194455 :: TyFun (b ~> c) (Sum b ~> c) -> Type) (lhs_69895866216801931186989586621680194458 :: b ~> c) = Lambda_6989586621680194456 a_69895866216801944456989586621680194454 a_69895866216801944476989586621680194455 lhs_69895866216801931186989586621680194458 | |
Monoid under multiplication.
>>>getProduct (Product 3 <> Product 4 <> mempty)12
Constructors
| Product | |
Fields
| |
Instances
| Representable Product | |
| 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 |
| Applicative Product | Since: base-4.8.0.0 |
| Functor Product | Since: base-4.8.0.0 |
| Monad Product | Since: base-4.8.0.0 |
| NFData1 Product | Since: deepseq-1.4.3.0 |
Defined in Control.DeepSeq | |
| PFoldable Product | |
| SFoldable Product | |
Defined in Data.Foldable.Singletons Methods sFold :: forall m (t1 :: Product m). SMonoid m => Sing t1 -> Sing (Apply FoldSym0 t1) # 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 (t1 :: Product a). Sing t1 -> Sing (Apply ToListSym0 t1) # sNull :: forall a (t1 :: Product a). Sing t1 -> Sing (Apply NullSym0 t1) # sLength :: forall a (t1 :: Product a). Sing t1 -> Sing (Apply LengthSym0 t1) # sElem :: forall a (t1 :: a) (t2 :: Product a). SEq a => Sing t1 -> Sing t2 -> Sing (Apply (Apply ElemSym0 t1) t2) # sMaximum :: forall a (t1 :: Product a). SOrd a => Sing t1 -> Sing (Apply MaximumSym0 t1) # sMinimum :: forall a (t1 :: Product a). SOrd a => Sing t1 -> Sing (Apply MinimumSym0 t1) # sSum :: forall a (t1 :: Product a). SNum a => Sing t1 -> Sing (Apply SumSym0 t1) # sProduct :: forall a (t1 :: Product a). SNum a => Sing t1 -> Sing (Apply ProductSym0 t1) # | |
| PTraversable Product | |
| STraversable Product | |
Defined in Data.Traversable.Singletons 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 (t1 :: Product (f a)). SApplicative f => Sing t1 -> Sing (Apply SequenceASym0 t1) # 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 (t1 :: Product (m a)). SMonad m => Sing t1 -> Sing (Apply SequenceSym0 t1) # | |
| 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)) # | |
| Num a => Monoid (Product a) | Since: base-2.1 |
| Num a => Semigroup (Product a) | Since: base-4.9.0.0 |
| Bounded a => Bounded (Product a) | Since: base-2.1 |
| Generic (Product a) | |
| Num a => Num (Product a) | Since: base-4.7.0.0 |
Defined in Data.Semigroup.Internal | |
| Read a => Read (Product a) | Since: base-2.1 |
| Show a => Show (Product a) | Since: base-2.1 |
| Num a => Default (Product a) | |
Defined in Data.Default.Class | |
| NFData a => NFData (Product a) | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| Eq a => Eq (Product a) | Since: base-2.1 |
| Ord a => Ord (Product a) | Since: base-2.1 |
| Wrapped (Product a) | |
| PMonoid (Product a) | |
| SNum a => SMonoid (Product a) | |
| PSemigroup (Product a) | |
Defined in Data.Semigroup.Singletons.Internal | |
| SNum a => SSemigroup (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 # 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 # 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)) # safeHead :: Product a -> Maybe (Element (Product a)) # safeMaximum :: Product a -> Maybe (Element (Product a)) # safeMinimum :: Product a -> Maybe (Element (Product a)) # safeFoldr1 :: (Element (Product a) -> Element (Product a) -> Element (Product a)) -> Product a -> Maybe (Element (Product a)) # safeFoldl1 :: (Element (Product a) -> Element (Product a) -> Element (Product a)) -> Product a -> Maybe (Element (Product a)) # | |
| Unbox a => Unbox (Product a) | |
Defined in Data.Vector.Unboxed.Base | |
| Generic1 Product | |
| 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.Semigroup.Singletons.Internal | |
| SDecide a => TestEquality (SProduct :: Product a -> Type) | |
Defined in Data.Semigroup.Singletons.Internal | |
| SingI (GetProductSym0 :: TyFun (Product a) a -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods sing :: Sing GetProductSym0 # | |
| SingI (ProductSym0 :: TyFun a (Product a) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods sing :: Sing ProductSym0 # | |
| SingI (Product_Sym0 :: TyFun a (Product a) -> Type) | |
| SuppressUnusedWarnings (Abs_6989586621679624935Sym0 :: TyFun (Product a) (Product a) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Negate_6989586621679624928Sym0 :: TyFun (Product a) (Product a) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Signum_6989586621679624942Sym0 :: TyFun (Product a) (Product a) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679624885Sym0 :: TyFun (Product a) (Product a ~> Product a) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679624896Sym0 :: TyFun (Product a) (Product a ~> Product a) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679624907Sym0 :: TyFun (Product a) (Product a ~> Product a) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679624918Sym0 :: TyFun (Product a) (Product a ~> Product a) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679613641Sym0 :: TyFun (Product a) (Product a ~> Ordering) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679606180Sym0 :: TyFun (Product a) (Product a ~> Bool) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Null_6989586621680194750Sym0 :: TyFun (Product a) Bool -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Length_6989586621680194726Sym0 :: TyFun (Product a) Nat -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ToList_6989586621680194774Sym0 :: TyFun (Product a) [a] -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Maximum_6989586621680194732Sym0 :: TyFun (Product a) a -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Minimum_6989586621680194741Sym0 :: TyFun (Product a) a -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Product_6989586621680194756Sym0 :: TyFun (Product a) a -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Sum_6989586621680194765Sym0 :: TyFun (Product a) a -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (GetProductSym0 :: TyFun (Product a) a -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldl1_6989586621680194667Sym0 :: TyFun (a ~> (a ~> a)) (Product a ~> a) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr1_6989586621680194715Sym0 :: TyFun (a ~> (a ~> a)) (Product a ~> a) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FromInteger_6989586621679624949Sym0 :: TyFun Nat (Product a) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621680582282Sym0 :: TyFun Nat (Product a ~> (Symbol ~> Symbol)) -> Type) | |
Defined in Data.Semigroup.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ProductSym0 :: TyFun a (Product a) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Pure_6989586621679624827Sym0 :: TyFun a (Product a) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Product_Sym0 :: TyFun a (Product a) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal.Disambiguation Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Elem_6989586621680194618Sym0 :: TyFun a (Product a ~> Bool) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679624837Sym0 :: TyFun (Product (a ~> b)) (Product a ~> Product b) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679624885Sym1 a6989586621679624890 :: TyFun (Product a) (Product a) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679624896Sym1 a6989586621679624901 :: TyFun (Product a) (Product a) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679624907Sym1 a6989586621679624912 :: TyFun (Product a) (Product a) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679624918Sym1 a6989586621679624923 :: TyFun (Product a) (Product a) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679613641Sym1 a6989586621679613646 :: TyFun (Product a) Ordering -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679624874Sym0 :: TyFun (Product a) ((a ~> Product b) ~> Product b) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621680582282Sym1 a6989586621680582290 :: TyFun (Product a) (Symbol ~> Symbol) -> Type) | |
Defined in Data.Semigroup.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Elem_6989586621680194618Sym1 a6989586621680194627 :: TyFun (Product a) Bool -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679606180Sym1 a6989586621679606185 :: TyFun (Product a) Bool -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldl1_6989586621680194667Sym1 a6989586621680194674 :: TyFun (Product a) a -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr1_6989586621680194715Sym1 a6989586621680194722 :: TyFun (Product a) a -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr'_6989586621680194695Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (Product a ~> b)) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr_6989586621680194680Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (Product a ~> b)) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Fmap_6989586621679624848Sym0 :: TyFun (a ~> b) (Product a ~> Product b) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FoldMap_6989586621680194607Sym0 :: TyFun (a ~> m) (Product a ~> m) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldl'_6989586621680194653Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (Product a ~> b)) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldl_6989586621680194638Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (Product a ~> b)) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679624859Sym0 :: TyFun a (Product b ~> Product a) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Fmap_6989586621679624848Sym1 a6989586621679624853 :: TyFun (Product a) (Product b) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679624837Sym1 a6989586621679624842 :: TyFun (Product a) (Product b) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FoldMap_6989586621680194607Sym1 a6989586621680194612 :: TyFun (Product a) m -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679624859Sym1 a6989586621679624864 :: TyFun (Product b) (Product a) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679624874Sym1 a6989586621679624879 :: TyFun (a ~> Product b) (Product b) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Traverse_6989586621680478791Sym0 :: TyFun (a ~> f b) (Product a ~> f (Product b)) -> Type) | |
Defined in Data.Traversable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldl'_6989586621680194653Sym1 a6989586621680194659 :: TyFun b (Product a ~> b) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldl_6989586621680194638Sym1 a6989586621680194644 :: TyFun b (Product a ~> b) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr'_6989586621680194695Sym1 a6989586621680194707 :: TyFun b (Product a ~> b) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr_6989586621680194680Sym1 a6989586621680194686 :: TyFun b (Product a ~> b) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldl'_6989586621680194653Sym2 a6989586621680194659 a6989586621680194660 :: TyFun (Product a) b -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldl_6989586621680194638Sym2 a6989586621680194644 a6989586621680194645 :: TyFun (Product a) b -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr'_6989586621680194695Sym2 a6989586621680194707 a6989586621680194708 :: TyFun (Product a) b -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr_6989586621680194680Sym2 a6989586621680194686 a6989586621680194687 :: TyFun (Product a) b -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Traverse_6989586621680478791Sym1 a6989586621680478796 :: TyFun (Product a) (f (Product b)) -> Type) | |
Defined in Data.Traversable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680194631Sym0 :: TyFun k1 (TyFun k2 (TyFun (b ~> c) (Product b ~> c) -> Type) -> Type) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680194631Sym1 a_69895866216801946206989586621680194629 :: TyFun k2 (TyFun (b ~> c) (Product b ~> c) -> Type) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680194631Sym2 a_69895866216801946206989586621680194629 a_69895866216801946226989586621680194630 :: TyFun (b ~> c) (Product b ~> c) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| type Rep Product | |
Defined in Data.Functor.Rep | |
| type Pure (a :: k1) | |
| type Return (arg :: a) | |
| type Fold (arg :: Product m) | |
| type Length (a2 :: Product a1) | |
| type Maximum (a :: Product k2) | |
| type Minimum (a :: Product k2) | |
| type Null (a2 :: Product a1) | |
| type Product (a :: Product k2) | |
| type Sum (a :: Product k2) | |
| type ToList (a2 :: Product a1) | |
| 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 Sequence (arg :: Product (m a)) | |
| type SequenceA (arg :: Product (f a)) | |
| type (arg :: Product a) *> (arg1 :: Product b) | |
| type (a1 :: k1) <$ (a2 :: Product b) | |
| type (arg :: Product a) <* (arg1 :: Product b) | |
| type (a2 :: Product (a1 ~> b)) <*> (a3 :: Product a1) | |
| type (arg :: Product a) >> (arg1 :: Product b) | |
| type (a2 :: Product a1) >>= (a3 :: a1 ~> Product b) | |
| type Fmap (a2 :: a1 ~> b) (a3 :: Product a1) | |
| type FoldMap (a2 :: a1 ~> k2) (a3 :: Product a1) | |
| type Foldl (a2 :: k2 ~> (a1 ~> k2)) (a3 :: k2) (a4 :: Product a1) | |
| type Foldl' (a2 :: k2 ~> (a1 ~> k2)) (a3 :: k2) (a4 :: Product a1) | |
| type Foldr (a2 :: a1 ~> (k2 ~> k2)) (a3 :: k2) (a4 :: Product a1) | |
| type Foldr' (a2 :: a1 ~> (k2 ~> k2)) (a3 :: k2) (a4 :: Product a1) | |
| type MapM (arg1 :: a ~> m b) (arg2 :: Product a) | |
| type Traverse (a2 :: a1 ~> f b) (a3 :: Product a1) | |
| type LiftA2 (arg :: a ~> (b ~> c)) (arg1 :: Product a) (arg2 :: Product b) | |
| newtype MVector s (Product a) | |
Defined in Data.Vector.Unboxed.Base | |
| type Apply (FromInteger_6989586621679624949Sym0 :: TyFun Nat (Product a) -> Type) (a6989586621679624953 :: Nat) | |
| type Apply (ProductSym0 :: TyFun a (Product a) -> Type) (a6989586621679596433 :: a) | |
Defined in Data.Semigroup.Singletons.Internal | |
| type Apply (Pure_6989586621679624827Sym0 :: TyFun a (Product a) -> Type) (a6989586621679624833 :: a) | |
Defined in Data.Semigroup.Singletons.Internal | |
| type Apply (Product_Sym0 :: TyFun a (Product a) -> Type) (a6989586621679713079 :: a) | |
| type Apply (ShowsPrec_6989586621680582282Sym0 :: TyFun Nat (Product a ~> (Symbol ~> Symbol)) -> Type) (a6989586621680582290 :: Nat) | |
| type Apply (Elem_6989586621680194618Sym0 :: TyFun a (Product a ~> Bool) -> Type) (a6989586621680194627 :: a) | |
| type Apply (TFHelper_6989586621679624859Sym0 :: TyFun a (Product b ~> Product a) -> Type) (a6989586621679624864 :: a) | |
| type Apply (Foldl'_6989586621680194653Sym1 a6989586621680194659 :: TyFun b (Product a ~> b) -> Type) (a6989586621680194660 :: b) | |
| type Apply (Foldl_6989586621680194638Sym1 a6989586621680194644 :: TyFun b (Product a ~> b) -> Type) (a6989586621680194645 :: b) | |
| type Apply (Foldr'_6989586621680194695Sym1 a6989586621680194707 :: TyFun b (Product a ~> b) -> Type) (a6989586621680194708 :: b) | |
| type Apply (Foldr_6989586621680194680Sym1 a6989586621680194686 :: TyFun b (Product a ~> b) -> Type) (a6989586621680194687 :: b) | |
| type Apply (Lambda_6989586621680194631Sym0 :: TyFun k1 (TyFun k2 (TyFun (b ~> c) (Product b ~> c) -> Type) -> Type) -> Type) (a_69895866216801946206989586621680194629 :: k1) | |
Defined in Data.Foldable.Singletons type Apply (Lambda_6989586621680194631Sym0 :: TyFun k1 (TyFun k2 (TyFun (b ~> c) (Product b ~> c) -> Type) -> Type) -> Type) (a_69895866216801946206989586621680194629 :: k1) = Lambda_6989586621680194631Sym1 a_69895866216801946206989586621680194629 :: TyFun k2 (TyFun (b ~> c) (Product b ~> c) -> Type) -> Type | |
| type Apply (Lambda_6989586621680194631Sym1 a_69895866216801946206989586621680194629 :: TyFun k2 (TyFun (b ~> c) (Product b ~> c) -> Type) -> Type) (a_69895866216801946226989586621680194630 :: k2) | |
Defined in Data.Foldable.Singletons type Apply (Lambda_6989586621680194631Sym1 a_69895866216801946206989586621680194629 :: TyFun k2 (TyFun (b ~> c) (Product b ~> c) -> Type) -> Type) (a_69895866216801946226989586621680194630 :: k2) = Lambda_6989586621680194631Sym2 a_69895866216801946206989586621680194629 a_69895866216801946226989586621680194630 :: TyFun (b ~> c) (Product b ~> c) -> Type | |
| type Rep (Product a) | Since: base-4.7.0.0 |
Defined in Data.Semigroup.Internal | |
| type Unwrapped (Product a) | |
Defined in Control.Lens.Wrapped | |
| type Demote (Product a) | |
Defined in Data.Semigroup.Singletons.Internal | |
| type Sing | |
Defined in Data.Semigroup.Singletons.Internal | |
| type Mempty | |
Defined in Data.Monoid.Singletons | |
| type MaxBound | |
Defined in Data.Semigroup.Singletons.Internal | |
| type MinBound | |
Defined in Data.Semigroup.Singletons.Internal | |
| type Element (Product a) | |
Defined in Universum.Container.Class | |
| newtype Vector (Product a) | |
Defined in Data.Vector.Unboxed.Base | |
| type Rep1 Product | Since: base-4.7.0.0 |
Defined in Data.Semigroup.Internal | |
| type Mconcat (arg :: [Product a]) | |
| type Sconcat (arg :: NonEmpty (Product a)) | |
| type Abs (a2 :: Product a1) | |
| type FromInteger a2 | |
Defined in Data.Semigroup.Singletons.Internal | |
| type Negate (a2 :: Product a1) | |
| type Signum (a2 :: Product a1) | |
| type Show_ (arg :: Product a) | |
| type (arg :: Product a) /= (arg1 :: Product a) | |
| type (a2 :: Product a1) == (a3 :: Product a1) | |
| type Mappend (arg1 :: Product a) (arg2 :: Product a) | |
| type (arg :: Product a) < (arg1 :: Product a) | |
| type (arg :: Product a) <= (arg1 :: Product a) | |
| type (arg :: Product a) > (arg1 :: Product a) | |
| type (arg :: Product a) >= (arg1 :: Product a) | |
| type Compare (a2 :: Product a1) (a3 :: Product a1) | |
| type Max (arg :: Product a) (arg1 :: Product a) | |
| type Min (arg :: Product a) (arg1 :: Product a) | |
| 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 ShowList (arg :: [Product a]) arg1 | |
| type HKD Product (a :: Type) | |
Defined in Data.Vinyl.XRec | |
| type ShowsPrec a2 (a3 :: Product a1) a4 | |
| type Apply (Null_6989586621680194750Sym0 :: TyFun (Product a) Bool -> Type) (a6989586621680194754 :: Product a) | |
| type Apply (Length_6989586621680194726Sym0 :: TyFun (Product a) Nat -> Type) (a6989586621680194730 :: Product a) | |
| type Apply (Maximum_6989586621680194732Sym0 :: TyFun (Product a) a -> Type) (a6989586621680194738 :: Product a) | |
| type Apply (Minimum_6989586621680194741Sym0 :: TyFun (Product a) a -> Type) (a6989586621680194747 :: Product a) | |
| type Apply (Product_6989586621680194756Sym0 :: TyFun (Product a) a -> Type) (a6989586621680194762 :: Product a) | |
| type Apply (Sum_6989586621680194765Sym0 :: TyFun (Product a) a -> Type) (a6989586621680194771 :: Product a) | |
| type Apply (GetProductSym0 :: TyFun (Product a) a -> Type) (a6989586621679596436 :: Product a) | |
Defined in Data.Semigroup.Singletons.Internal type Apply (GetProductSym0 :: TyFun (Product a) a -> Type) (a6989586621679596436 :: Product a) = GetProduct a6989586621679596436 | |
| type Apply (Compare_6989586621679613641Sym1 a6989586621679613646 :: TyFun (Product a) Ordering -> Type) (a6989586621679613647 :: Product a) | |
| type Apply (Elem_6989586621680194618Sym1 a6989586621680194627 :: TyFun (Product a) Bool -> Type) (a6989586621680194628 :: Product a) | |
| type Apply (TFHelper_6989586621679606180Sym1 a6989586621679606185 :: TyFun (Product a) Bool -> Type) (a6989586621679606186 :: Product a) | |
| type Apply (Foldl1_6989586621680194667Sym1 a6989586621680194674 :: TyFun (Product a) a -> Type) (a6989586621680194675 :: Product a) | |
| type Apply (Foldr1_6989586621680194715Sym1 a6989586621680194722 :: TyFun (Product a) a -> Type) (a6989586621680194723 :: Product a) | |
| type Apply (FoldMap_6989586621680194607Sym1 a6989586621680194612 :: TyFun (Product a) m -> Type) (a6989586621680194613 :: Product a) | |
| type Apply (Foldl'_6989586621680194653Sym2 a6989586621680194659 a6989586621680194660 :: TyFun (Product a) b -> Type) (a6989586621680194661 :: Product a) | |
| type Apply (Foldl_6989586621680194638Sym2 a6989586621680194644 a6989586621680194645 :: TyFun (Product a) b -> Type) (a6989586621680194646 :: Product a) | |
| type Apply (Foldr'_6989586621680194695Sym2 a6989586621680194707 a6989586621680194708 :: TyFun (Product a) b -> Type) (a6989586621680194709 :: Product a) | |
| type Apply (Foldr_6989586621680194680Sym2 a6989586621680194686 a6989586621680194687 :: TyFun (Product a) b -> Type) (a6989586621680194688 :: Product a) | |
| type Apply (Abs_6989586621679624935Sym0 :: TyFun (Product a) (Product a) -> Type) (a6989586621679624939 :: Product a) | |
| type Apply (Negate_6989586621679624928Sym0 :: TyFun (Product a) (Product a) -> Type) (a6989586621679624932 :: Product a) | |
| type Apply (Signum_6989586621679624942Sym0 :: TyFun (Product a) (Product a) -> Type) (a6989586621679624946 :: Product a) | |
| type Apply (ToList_6989586621680194774Sym0 :: TyFun (Product a) [a] -> Type) (a6989586621680194778 :: Product a) | |
| type Apply (TFHelper_6989586621679624885Sym1 a6989586621679624890 :: TyFun (Product a) (Product a) -> Type) (a6989586621679624891 :: Product a) | |
| type Apply (TFHelper_6989586621679624896Sym1 a6989586621679624901 :: TyFun (Product a) (Product a) -> Type) (a6989586621679624902 :: Product a) | |
| type Apply (TFHelper_6989586621679624907Sym1 a6989586621679624912 :: TyFun (Product a) (Product a) -> Type) (a6989586621679624913 :: Product a) | |
| type Apply (TFHelper_6989586621679624918Sym1 a6989586621679624923 :: TyFun (Product a) (Product a) -> Type) (a6989586621679624924 :: Product a) | |
| type Apply (Fmap_6989586621679624848Sym1 a6989586621679624853 :: TyFun (Product a) (Product b) -> Type) (a6989586621679624854 :: Product a) | |
| type Apply (TFHelper_6989586621679624837Sym1 a6989586621679624842 :: TyFun (Product a) (Product b) -> Type) (a6989586621679624843 :: Product a) | |
| type Apply (TFHelper_6989586621679624859Sym1 a6989586621679624864 :: TyFun (Product b) (Product a) -> Type) (a6989586621679624865 :: Product b) | |
| type Apply (Traverse_6989586621680478791Sym1 a6989586621680478796 :: TyFun (Product a) (f (Product b)) -> Type) (a6989586621680478797 :: Product a) | |
| type Apply (TFHelper_6989586621679624885Sym0 :: TyFun (Product a) (Product a ~> Product a) -> Type) (a6989586621679624890 :: Product a) | |
| type Apply (TFHelper_6989586621679624896Sym0 :: TyFun (Product a) (Product a ~> Product a) -> Type) (a6989586621679624901 :: Product a) | |
| type Apply (TFHelper_6989586621679624907Sym0 :: TyFun (Product a) (Product a ~> Product a) -> Type) (a6989586621679624912 :: Product a) | |
| type Apply (TFHelper_6989586621679624918Sym0 :: TyFun (Product a) (Product a ~> Product a) -> Type) (a6989586621679624923 :: Product a) | |
| type Apply (Compare_6989586621679613641Sym0 :: TyFun (Product a) (Product a ~> Ordering) -> Type) (a6989586621679613646 :: Product a) | |
| type Apply (TFHelper_6989586621679606180Sym0 :: TyFun (Product a) (Product a ~> Bool) -> Type) (a6989586621679606185 :: Product a) | |
| type Apply (TFHelper_6989586621679624837Sym0 :: TyFun (Product (a ~> b)) (Product a ~> Product b) -> Type) (a6989586621679624842 :: Product (a ~> b)) | |
| type Apply (TFHelper_6989586621679624874Sym0 :: TyFun (Product a) ((a ~> Product b) ~> Product b) -> Type) (a6989586621679624879 :: Product a) | |
| type Apply (ShowsPrec_6989586621680582282Sym1 a6989586621680582290 :: TyFun (Product a) (Symbol ~> Symbol) -> Type) (a6989586621680582291 :: Product a) | |
| type Apply (TFHelper_6989586621679624874Sym1 a6989586621679624879 :: TyFun (a ~> Product b) (Product b) -> Type) (a6989586621679624880 :: a ~> Product b) | |
| type Apply (Foldl1_6989586621680194667Sym0 :: TyFun (a ~> (a ~> a)) (Product a ~> a) -> Type) (a6989586621680194674 :: a ~> (a ~> a)) | |
| type Apply (Foldr1_6989586621680194715Sym0 :: TyFun (a ~> (a ~> a)) (Product a ~> a) -> Type) (a6989586621680194722 :: a ~> (a ~> a)) | |
| type Apply (Foldr'_6989586621680194695Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (Product a ~> b)) -> Type) (a6989586621680194707 :: a ~> (b ~> b)) | |
| type Apply (Foldr_6989586621680194680Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (Product a ~> b)) -> Type) (a6989586621680194686 :: a ~> (b ~> b)) | |
| type Apply (Fmap_6989586621679624848Sym0 :: TyFun (a ~> b) (Product a ~> Product b) -> Type) (a6989586621679624853 :: a ~> b) | |
| type Apply (FoldMap_6989586621680194607Sym0 :: TyFun (a ~> m) (Product a ~> m) -> Type) (a6989586621680194612 :: a ~> m) | |
| type Apply (Foldl'_6989586621680194653Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (Product a ~> b)) -> Type) (a6989586621680194659 :: b ~> (a ~> b)) | |
| type Apply (Foldl_6989586621680194638Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (Product a ~> b)) -> Type) (a6989586621680194644 :: b ~> (a ~> b)) | |
| type Apply (Traverse_6989586621680478791Sym0 :: TyFun (a ~> f b) (Product a ~> f (Product b)) -> Type) (a6989586621680478796 :: a ~> f b) | |
| type Apply (Lambda_6989586621680194631Sym2 a_69895866216801946206989586621680194629 a_69895866216801946226989586621680194630 :: TyFun (b ~> c) (Product b ~> c) -> Type) (lhs_69895866216801931206989586621680194633 :: b ~> c) | |
Defined in Data.Foldable.Singletons type Apply (Lambda_6989586621680194631Sym2 a_69895866216801946206989586621680194629 a_69895866216801946226989586621680194630 :: TyFun (b ~> c) (Product b ~> c) -> Type) (lhs_69895866216801931206989586621680194633 :: b ~> c) = Lambda_6989586621680194631 a_69895866216801946206989586621680194629 a_69895866216801946226989586621680194630 lhs_69895866216801931206989586621680194633 | |
The monoid of endomorphisms under composition.
>>>let computation = Endo ("Hello, " ++) <> Endo (++ "!")>>>appEndo computation "Haskell""Hello, Haskell!"
Instances
| Monoid (Endo a) | Since: base-2.1 |
| Semigroup (Endo a) | Since: base-4.9.0.0 |
| Generic (Endo a) | |
| 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) | Since: base-4.7.0.0 |
Defined in Data.Semigroup.Internal | |
| type Unwrapped (Endo a) | |
Defined in Control.Lens.Wrapped | |
The dual of a Monoid, obtained by swapping the arguments of mappend.
>>>getDual (mappend (Dual "Hello") (Dual "World"))"WorldHello"
Instances
| Representable Dual | |
| 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 |
| Applicative Dual | Since: base-4.8.0.0 |
| Functor Dual | Since: base-4.8.0.0 |
| Monad Dual | Since: base-4.8.0.0 |
| NFData1 Dual | Since: deepseq-1.4.3.0 |
Defined in Control.DeepSeq | |
| PFoldable Dual | |
| SFoldable Dual | |
Defined in Data.Foldable.Singletons Methods sFold :: forall m (t1 :: Dual m). SMonoid m => Sing t1 -> Sing (Apply FoldSym0 t1) # 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 (t1 :: Dual a). Sing t1 -> Sing (Apply ToListSym0 t1) # sNull :: forall a (t1 :: Dual a). Sing t1 -> Sing (Apply NullSym0 t1) # sLength :: forall a (t1 :: Dual a). Sing t1 -> Sing (Apply LengthSym0 t1) # sElem :: forall a (t1 :: a) (t2 :: Dual a). SEq a => Sing t1 -> Sing t2 -> Sing (Apply (Apply ElemSym0 t1) t2) # sMaximum :: forall a (t1 :: Dual a). SOrd a => Sing t1 -> Sing (Apply MaximumSym0 t1) # sMinimum :: forall a (t1 :: Dual a). SOrd a => Sing t1 -> Sing (Apply MinimumSym0 t1) # sSum :: forall a (t1 :: Dual a). SNum a => Sing t1 -> Sing (Apply SumSym0 t1) # sProduct :: forall a (t1 :: Dual a). SNum a => Sing t1 -> Sing (Apply ProductSym0 t1) # | |
| PTraversable Dual | |
| STraversable Dual | |
Defined in Data.Traversable.Singletons 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 (t1 :: Dual (f a)). SApplicative f => Sing t1 -> Sing (Apply SequenceASym0 t1) # 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 (t1 :: Dual (m a)). SMonad m => Sing t1 -> Sing (Apply SequenceSym0 t1) # | |
| 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)) # | |
| Monoid a => Monoid (Dual a) | Since: base-2.1 |
| Semigroup a => Semigroup (Dual a) | Since: base-4.9.0.0 |
| Bounded a => Bounded (Dual a) | Since: base-2.1 |
| Generic (Dual a) | |
| Read a => Read (Dual a) | Since: base-2.1 |
| Show a => Show (Dual a) | Since: base-2.1 |
| Default a => Default (Dual a) | |
Defined in Data.Default.Class | |
| NFData a => NFData (Dual a) | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| Eq a => Eq (Dual a) | Since: base-2.1 |
| Ord a => Ord (Dual a) | Since: base-2.1 |
| Wrapped (Dual a) | |
| Ring a => Ring (Dual a) | |
Defined in Data.Semiring | |
| Semiring a => Semiring (Dual a) | |
| PMonoid (Dual a) | |
| SMonoid a => SMonoid (Dual a) | |
| PSemigroup (Dual a) | |
Defined in Data.Semigroup.Singletons.Internal | |
| SSemigroup a => SSemigroup (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 # 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 # 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)) # safeHead :: Dual a -> Maybe (Element (Dual a)) # safeMaximum :: Dual a -> Maybe (Element (Dual a)) # safeMinimum :: Dual a -> Maybe (Element (Dual a)) # safeFoldr1 :: (Element (Dual a) -> Element (Dual a) -> Element (Dual a)) -> Dual a -> Maybe (Element (Dual a)) # safeFoldl1 :: (Element (Dual a) -> Element (Dual a) -> Element (Dual a)) -> Dual a -> Maybe (Element (Dual a)) # | |
| Unbox a => Unbox (Dual a) | |
Defined in Data.Vector.Unboxed.Base | |
| Generic1 Dual | |
| t ~ Dual b => Rewrapped (Dual a) t | |
Defined in Control.Lens.Wrapped | |
| SDecide a => TestCoercion (SDual :: Dual a -> Type) | |
Defined in Data.Semigroup.Singletons.Internal | |
| SDecide a => TestEquality (SDual :: Dual a -> Type) | |
Defined in Data.Semigroup.Singletons.Internal | |
| SingI (GetDualSym0 :: TyFun (Dual a) a -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods sing :: Sing GetDualSym0 # | |
| SingI (DualSym0 :: TyFun a (Dual a) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal | |
| SuppressUnusedWarnings (TFHelper_6989586621679624643Sym0 :: TyFun (Dual a) (Dual a ~> Dual a) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679613565Sym0 :: TyFun (Dual a) (Dual a ~> Ordering) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679606106Sym0 :: TyFun (Dual a) (Dual a ~> Bool) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Null_6989586621680194400Sym0 :: TyFun (Dual a) Bool -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Length_6989586621680194376Sym0 :: TyFun (Dual a) Nat -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ToList_6989586621680194424Sym0 :: TyFun (Dual a) [a] -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Maximum_6989586621680194382Sym0 :: TyFun (Dual a) a -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Minimum_6989586621680194391Sym0 :: TyFun (Dual a) a -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Product_6989586621680194406Sym0 :: TyFun (Dual a) a -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Sum_6989586621680194415Sym0 :: TyFun (Dual a) a -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (GetDualSym0 :: TyFun (Dual a) a -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldl1_6989586621680194317Sym0 :: TyFun (a ~> (a ~> a)) (Dual a ~> a) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr1_6989586621680194365Sym0 :: TyFun (a ~> (a ~> a)) (Dual a ~> a) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621680582180Sym0 :: TyFun Nat (Dual a ~> (Symbol ~> Symbol)) -> Type) | |
Defined in Data.Semigroup.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (DualSym0 :: TyFun a (Dual a) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Pure_6989586621679624481Sym0 :: TyFun a (Dual a) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Elem_6989586621680194268Sym0 :: TyFun a (Dual a ~> Bool) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679624491Sym0 :: TyFun (Dual (a ~> b)) (Dual a ~> Dual b) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679624643Sym1 a6989586621679624648 :: TyFun (Dual a) (Dual a) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679613565Sym1 a6989586621679613570 :: TyFun (Dual a) Ordering -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679624632Sym0 :: TyFun (Dual a) ((a ~> Dual b) ~> Dual b) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621680582180Sym1 a6989586621680582188 :: TyFun (Dual a) (Symbol ~> Symbol) -> Type) | |
Defined in Data.Semigroup.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Elem_6989586621680194268Sym1 a6989586621680194277 :: TyFun (Dual a) Bool -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679606106Sym1 a6989586621679606111 :: TyFun (Dual a) Bool -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldl1_6989586621680194317Sym1 a6989586621680194324 :: TyFun (Dual a) a -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr1_6989586621680194365Sym1 a6989586621680194372 :: TyFun (Dual a) a -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr'_6989586621680194345Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (Dual a ~> b)) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr_6989586621680194330Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (Dual a ~> b)) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Fmap_6989586621679624502Sym0 :: TyFun (a ~> b) (Dual a ~> Dual b) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FoldMap_6989586621680194257Sym0 :: TyFun (a ~> m) (Dual a ~> m) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldl'_6989586621680194303Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (Dual a ~> b)) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldl_6989586621680194288Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (Dual a ~> b)) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679624513Sym0 :: TyFun a (Dual b ~> Dual a) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Fmap_6989586621679624502Sym1 a6989586621679624507 :: TyFun (Dual a) (Dual b) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679624491Sym1 a6989586621679624496 :: TyFun (Dual a) (Dual b) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FoldMap_6989586621680194257Sym1 a6989586621680194262 :: TyFun (Dual a) m -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679624513Sym1 a6989586621679624518 :: TyFun (Dual b) (Dual a) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679624632Sym1 a6989586621679624637 :: TyFun (a ~> Dual b) (Dual b) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Traverse_6989586621680478769Sym0 :: TyFun (a ~> f b) (Dual a ~> f (Dual b)) -> Type) | |
Defined in Data.Traversable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldl'_6989586621680194303Sym1 a6989586621680194309 :: TyFun b (Dual a ~> b) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldl_6989586621680194288Sym1 a6989586621680194294 :: TyFun b (Dual a ~> b) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr'_6989586621680194345Sym1 a6989586621680194357 :: TyFun b (Dual a ~> b) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr_6989586621680194330Sym1 a6989586621680194336 :: TyFun b (Dual a ~> b) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldl'_6989586621680194303Sym2 a6989586621680194309 a6989586621680194310 :: TyFun (Dual a) b -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldl_6989586621680194288Sym2 a6989586621680194294 a6989586621680194295 :: TyFun (Dual a) b -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr'_6989586621680194345Sym2 a6989586621680194357 a6989586621680194358 :: TyFun (Dual a) b -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr_6989586621680194330Sym2 a6989586621680194336 a6989586621680194337 :: TyFun (Dual a) b -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Traverse_6989586621680478769Sym1 a6989586621680478774 :: TyFun (Dual a) (f (Dual b)) -> Type) | |
Defined in Data.Traversable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680194281Sym0 :: TyFun k1 (TyFun k2 (TyFun (b ~> c) (Dual b ~> c) -> Type) -> Type) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680194281Sym1 a_69895866216801942706989586621680194279 :: TyFun k2 (TyFun (b ~> c) (Dual b ~> c) -> Type) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680194281Sym2 a_69895866216801942706989586621680194279 a_69895866216801942726989586621680194280 :: TyFun (b ~> c) (Dual b ~> c) -> Type) | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () # | |
| type Rep Dual | |
Defined in Data.Functor.Rep | |
| type Pure (a :: k1) | |
| type Return (arg :: a) | |
| type Fold (arg :: Dual m) | |
| type Length (a2 :: Dual a1) | |
| type Maximum (a :: Dual k2) | |
| type Minimum (a :: Dual k2) | |
| type Null (a2 :: Dual a1) | |
| type Product (a :: Dual k2) | |
| type Sum (a :: Dual k2) | |
| type ToList (a2 :: Dual a1) | |
| 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 Sequence (arg :: Dual (m a)) | |
| type SequenceA (arg :: Dual (f a)) | |
| type (arg :: Dual a) *> (arg1 :: Dual b) | |
| type (a1 :: k1) <$ (a2 :: Dual b) | |
| type (arg :: Dual a) <* (arg1 :: Dual b) | |
| type (a2 :: Dual (a1 ~> b)) <*> (a3 :: Dual a1) | |
| type (arg :: Dual a) >> (arg1 :: Dual b) | |
| type (a2 :: Dual a1) >>= (a3 :: a1 ~> Dual b) | |
| type Fmap (a2 :: a1 ~> b) (a3 :: Dual a1) | |
| type FoldMap (a2 :: a1 ~> k2) (a3 :: Dual a1) | |
| type Foldl (a2 :: k2 ~> (a1 ~> k2)) (a3 :: k2) (a4 :: Dual a1) | |
| type Foldl' (a2 :: k2 ~> (a1 ~> k2)) (a3 :: k2) (a4 :: Dual a1) | |
| type Foldr (a2 :: a1 ~> (k2 ~> k2)) (a3 :: k2) (a4 :: Dual a1) | |
| type Foldr' (a2 :: a1 ~> (k2 ~> k2)) (a3 :: k2) (a4 :: Dual a1) | |
| type MapM (arg1 :: a ~> m b) (arg2 :: Dual a) | |
| type Traverse (a2 :: a1 ~> f b) (a3 :: Dual a1) | |
| type LiftA2 (arg :: a ~> (b ~> c)) (arg1 :: Dual a) (arg2 :: Dual b) | |
| newtype MVector s (Dual a) | |
Defined in Data.Vector.Unboxed.Base | |
| type Apply (DualSym0 :: TyFun a (Dual a) -> Type) (a6989586621679596362 :: a) | |
| type Apply (Pure_6989586621679624481Sym0 :: TyFun a (Dual a) -> Type) (a6989586621679624487 :: a) | |
Defined in Data.Semigroup.Singletons.Internal | |
| type Apply (ShowsPrec_6989586621680582180Sym0 :: TyFun Nat (Dual a ~> (Symbol ~> Symbol)) -> Type) (a6989586621680582188 :: Nat) | |
| type Apply (Elem_6989586621680194268Sym0 :: TyFun a (Dual a ~> Bool) -> Type) (a6989586621680194277 :: a) | |
| type Apply (TFHelper_6989586621679624513Sym0 :: TyFun a (Dual b ~> Dual a) -> Type) (a6989586621679624518 :: a) | |
| type Apply (Foldl'_6989586621680194303Sym1 a6989586621680194309 :: TyFun b (Dual a ~> b) -> Type) (a6989586621680194310 :: b) | |
| type Apply (Foldl_6989586621680194288Sym1 a6989586621680194294 :: TyFun b (Dual a ~> b) -> Type) (a6989586621680194295 :: b) | |
| type Apply (Foldr'_6989586621680194345Sym1 a6989586621680194357 :: TyFun b (Dual a ~> b) -> Type) (a6989586621680194358 :: b) | |
| type Apply (Foldr_6989586621680194330Sym1 a6989586621680194336 :: TyFun b (Dual a ~> b) -> Type) (a6989586621680194337 :: b) | |
| type Apply (Lambda_6989586621680194281Sym0 :: TyFun k1 (TyFun k2 (TyFun (b ~> c) (Dual b ~> c) -> Type) -> Type) -> Type) (a_69895866216801942706989586621680194279 :: k1) | |
Defined in Data.Foldable.Singletons type Apply (Lambda_6989586621680194281Sym0 :: TyFun k1 (TyFun k2 (TyFun (b ~> c) (Dual b ~> c) -> Type) -> Type) -> Type) (a_69895866216801942706989586621680194279 :: k1) = Lambda_6989586621680194281Sym1 a_69895866216801942706989586621680194279 :: TyFun k2 (TyFun (b ~> c) (Dual b ~> c) -> Type) -> Type | |
| type Apply (Lambda_6989586621680194281Sym1 a_69895866216801942706989586621680194279 :: TyFun k2 (TyFun (b ~> c) (Dual b ~> c) -> Type) -> Type) (a_69895866216801942726989586621680194280 :: k2) | |
Defined in Data.Foldable.Singletons type Apply (Lambda_6989586621680194281Sym1 a_69895866216801942706989586621680194279 :: TyFun k2 (TyFun (b ~> c) (Dual b ~> c) -> Type) -> Type) (a_69895866216801942726989586621680194280 :: k2) = Lambda_6989586621680194281Sym2 a_69895866216801942706989586621680194279 a_69895866216801942726989586621680194280 :: TyFun (b ~> c) (Dual b ~> c) -> Type | |
| type Rep (Dual a) | Since: base-4.7.0.0 |
Defined in Data.Semigroup.Internal | |
| type Unwrapped (Dual a) | |
Defined in Control.Lens.Wrapped | |
| type Demote (Dual a) | |
Defined in Data.Semigroup.Singletons.Internal | |
| type Sing | |
Defined in Data.Semigroup.Singletons.Internal | |
| type Mempty | |
Defined in Data.Monoid.Singletons | |
| type MaxBound | |
Defined in Data.Semigroup.Singletons.Internal | |
| type MinBound | |
Defined in Data.Semigroup.Singletons.Internal | |
| type Element (Dual a) | |
Defined in Universum.Container.Class | |
| newtype Vector (Dual a) | |
Defined in Data.Vector.Unboxed.Base | |
| type Rep1 Dual | Since: base-4.7.0.0 |
Defined in Data.Semigroup.Internal | |
| type Mconcat (arg :: [Dual a]) | |
| type Sconcat (arg :: NonEmpty (Dual a)) | |
| type Show_ (arg :: Dual a) | |
| type (arg :: Dual a) /= (arg1 :: Dual a) | |
| type (a2 :: Dual a1) == (a3 :: Dual a1) | |
| type Mappend (arg1 :: Dual a) (arg2 :: Dual a) | |
| type (arg :: Dual a) < (arg1 :: Dual a) | |
| type (arg :: Dual a) <= (arg1 :: Dual a) | |
| type (arg :: Dual a) > (arg1 :: Dual a) | |
| type (arg :: Dual a) >= (arg1 :: Dual a) | |
| type Compare (a2 :: Dual a1) (a3 :: Dual a1) | |
| type Max (arg :: Dual a) (arg1 :: Dual a) | |
| type Min (arg :: Dual a) (arg1 :: Dual a) | |
| type (a2 :: Dual a1) <> (a3 :: Dual a1) | |
| type ShowList (arg :: [Dual a]) arg1 | |
| type ShowsPrec a2 (a3 :: Dual a1) a4 | |
| type Apply (Null_6989586621680194400Sym0 :: TyFun (Dual a) Bool -> Type) (a6989586621680194404 :: Dual a) | |
| type Apply (Length_6989586621680194376Sym0 :: TyFun (Dual a) Nat -> Type) (a6989586621680194380 :: Dual a) | |
| type Apply (Maximum_6989586621680194382Sym0 :: TyFun (Dual a) a -> Type) (a6989586621680194388 :: Dual a) | |
| type Apply (Minimum_6989586621680194391Sym0 :: TyFun (Dual a) a -> Type) (a6989586621680194397 :: Dual a) | |
| type Apply (Product_6989586621680194406Sym0 :: TyFun (Dual a) a -> Type) (a6989586621680194412 :: Dual a) | |
| type Apply (Sum_6989586621680194415Sym0 :: TyFun (Dual a) a -> Type) (a6989586621680194421 :: Dual a) | |
| type Apply (GetDualSym0 :: TyFun (Dual a) a -> Type) (a6989586621679596365 :: Dual a) | |
Defined in Data.Semigroup.Singletons.Internal | |
| type Apply (Compare_6989586621679613565Sym1 a6989586621679613570 :: TyFun (Dual a) Ordering -> Type) (a6989586621679613571 :: Dual a) | |
| type Apply (Elem_6989586621680194268Sym1 a6989586621680194277 :: TyFun (Dual a) Bool -> Type) (a6989586621680194278 :: Dual a) | |
| type Apply (TFHelper_6989586621679606106Sym1 a6989586621679606111 :: TyFun (Dual a) Bool -> Type) (a6989586621679606112 :: Dual a) | |
| type Apply (Foldl1_6989586621680194317Sym1 a6989586621680194324 :: TyFun (Dual a) a -> Type) (a6989586621680194325 :: Dual a) | |
| type Apply (Foldr1_6989586621680194365Sym1 a6989586621680194372 :: TyFun (Dual a) a -> Type) (a6989586621680194373 :: Dual a) | |
| type Apply (FoldMap_6989586621680194257Sym1 a6989586621680194262 :: TyFun (Dual a) m -> Type) (a6989586621680194263 :: Dual a) | |
| type Apply (Foldl'_6989586621680194303Sym2 a6989586621680194309 a6989586621680194310 :: TyFun (Dual a) b -> Type) (a6989586621680194311 :: Dual a) | |
| type Apply (Foldl_6989586621680194288Sym2 a6989586621680194294 a6989586621680194295 :: TyFun (Dual a) b -> Type) (a6989586621680194296 :: Dual a) | |
| type Apply (Foldr'_6989586621680194345Sym2 a6989586621680194357 a6989586621680194358 :: TyFun (Dual a) b -> Type) (a6989586621680194359 :: Dual a) | |
| type Apply (Foldr_6989586621680194330Sym2 a6989586621680194336 a6989586621680194337 :: TyFun (Dual a) b -> Type) (a6989586621680194338 :: Dual a) | |
| type Apply (ToList_6989586621680194424Sym0 :: TyFun (Dual a) [a] -> Type) (a6989586621680194428 :: Dual a) | |
| type Apply (TFHelper_6989586621679624643Sym1 a6989586621679624648 :: TyFun (Dual a) (Dual a) -> Type) (a6989586621679624649 :: Dual a) | |
| type Apply (Fmap_6989586621679624502Sym1 a6989586621679624507 :: TyFun (Dual a) (Dual b) -> Type) (a6989586621679624508 :: Dual a) | |
| type Apply (TFHelper_6989586621679624491Sym1 a6989586621679624496 :: TyFun (Dual a) (Dual b) -> Type) (a6989586621679624497 :: Dual a) | |
| type Apply (TFHelper_6989586621679624513Sym1 a6989586621679624518 :: TyFun (Dual b) (Dual a) -> Type) (a6989586621679624519 :: Dual b) | |
| type Apply (Traverse_6989586621680478769Sym1 a6989586621680478774 :: TyFun (Dual a) (f (Dual b)) -> Type) (a6989586621680478775 :: Dual a) | |
| type Apply (TFHelper_6989586621679624643Sym0 :: TyFun (Dual a) (Dual a ~> Dual a) -> Type) (a6989586621679624648 :: Dual a) | |
| type Apply (Compare_6989586621679613565Sym0 :: TyFun (Dual a) (Dual a ~> Ordering) -> Type) (a6989586621679613570 :: Dual a) | |
| type Apply (TFHelper_6989586621679606106Sym0 :: TyFun (Dual a) (Dual a ~> Bool) -> Type) (a6989586621679606111 :: Dual a) | |
| type Apply (TFHelper_6989586621679624491Sym0 :: TyFun (Dual (a ~> b)) (Dual a ~> Dual b) -> Type) (a6989586621679624496 :: Dual (a ~> b)) | |
| type Apply (TFHelper_6989586621679624632Sym0 :: TyFun (Dual a) ((a ~> Dual b) ~> Dual b) -> Type) (a6989586621679624637 :: Dual a) | |
| type Apply (ShowsPrec_6989586621680582180Sym1 a6989586621680582188 :: TyFun (Dual a) (Symbol ~> Symbol) -> Type) (a6989586621680582189 :: Dual a) | |
| type Apply (TFHelper_6989586621679624632Sym1 a6989586621679624637 :: TyFun (a ~> Dual b) (Dual b) -> Type) (a6989586621679624638 :: a ~> Dual b) | |
| type Apply (Foldl1_6989586621680194317Sym0 :: TyFun (a ~> (a ~> a)) (Dual a ~> a) -> Type) (a6989586621680194324 :: a ~> (a ~> a)) | |
| type Apply (Foldr1_6989586621680194365Sym0 :: TyFun (a ~> (a ~> a)) (Dual a ~> a) -> Type) (a6989586621680194372 :: a ~> (a ~> a)) | |
| type Apply (Foldr'_6989586621680194345Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (Dual a ~> b)) -> Type) (a6989586621680194357 :: a ~> (b ~> b)) | |
| type Apply (Foldr_6989586621680194330Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (Dual a ~> b)) -> Type) (a6989586621680194336 :: a ~> (b ~> b)) | |
| type Apply (Fmap_6989586621679624502Sym0 :: TyFun (a ~> b) (Dual a ~> Dual b) -> Type) (a6989586621679624507 :: a ~> b) | |
| type Apply (FoldMap_6989586621680194257Sym0 :: TyFun (a ~> m) (Dual a ~> m) -> Type) (a6989586621680194262 :: a ~> m) | |
| type Apply (Foldl'_6989586621680194303Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (Dual a ~> b)) -> Type) (a6989586621680194309 :: b ~> (a ~> b)) | |
| type Apply (Foldl_6989586621680194288Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (Dual a ~> b)) -> Type) (a6989586621680194294 :: b ~> (a ~> b)) | |
| type Apply (Traverse_6989586621680478769Sym0 :: TyFun (a ~> f b) (Dual a ~> f (Dual b)) -> Type) (a6989586621680478774 :: a ~> f b) | |
| type Apply (Lambda_6989586621680194281Sym2 a_69895866216801942706989586621680194279 a_69895866216801942726989586621680194280 :: TyFun (b ~> c) (Dual b ~> c) -> Type) (lhs_69895866216801931166989586621680194283 :: b ~> c) | |
Defined in Data.Foldable.Singletons type Apply (Lambda_6989586621680194281Sym2 a_69895866216801942706989586621680194279 a_69895866216801942726989586621680194280 :: TyFun (b ~> c) (Dual b ~> c) -> Type) (lhs_69895866216801931166989586621680194283 :: b ~> c) = Lambda_6989586621680194281 a_69895866216801942706989586621680194279 a_69895866216801942726989586621680194280 lhs_69895866216801931166989586621680194283 | |
newtype Alt (f :: k -> Type) (a :: k) #
Monoid under <|>.
>>>getAlt (Alt (Just 12) <> Alt (Just 24))Just 12
>>>getAlt $ Alt Nothing <> Alt (Just 24)Just 24
Since: base-4.8.0.0
Instances
| Generic1 (Alt f :: k -> Type) | |
| 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)) # | |
| 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 |
| Applicative f => Applicative (Alt f) | Since: base-4.8.0.0 |
| Functor f => Functor (Alt f) | Since: base-4.8.0.0 |
| Monad f => Monad (Alt f) | Since: base-4.8.0.0 |
| MonadPlus f => MonadPlus (Alt f) | Since: base-4.8.0.0 |
| Alternative f => Monoid (Alt f a) | Since: base-4.8.0.0 |
| Alternative f => Semigroup (Alt f a) | Since: base-4.9.0.0 |
| Enum (f a) => Enum (Alt f a) | Since: base-4.8.0.0 |
| Generic (Alt f a) | |
| Num (f a) => Num (Alt f a) | Since: base-4.8.0.0 |
| 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 |
| Eq (f a) => Eq (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 | |
| Wrapped (Alt f a) | |
| Unbox (f a) => Unbox (Alt f a) | |
Defined in Data.Vector.Unboxed.Base | |
| t ~ Alt g b => Rewrapped (Alt f a) t | |
Defined in Control.Lens.Wrapped | |
| type Rep1 (Alt f :: k -> Type) | Since: base-4.8.0.0 |
Defined in Data.Semigroup.Internal | |
| newtype MVector s (Alt f a) | |
Defined in Data.Vector.Unboxed.Base | |
| type Rep (Alt f a) | Since: base-4.8.0.0 |
Defined in Data.Semigroup.Internal | |
| type Unwrapped (Alt f a) | |
Defined in Control.Lens.Wrapped | |
| newtype Vector (Alt f a) | |
Defined in Data.Vector.Unboxed.Base | |
stimesMonoid :: (Integral b, Monoid a) => b -> a -> a #
stimesIdempotent :: Integral b => b -> a -> a #
The Down type allows you to reverse sort order conveniently. A value of type
Down aa (represented as Down a
If a has an Ordthen sortWith by .Down x
>>>compare True FalseGT
>>>compare (Down True) (Down False)LT
If a has a BoundedminBoundmaxBound
>>>minBound :: Int-9223372036854775808
>>>minBound :: Down IntDown 9223372036854775807
All other instances of Down aa.
Since: base-4.6.0.0
Instances
| 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 |
| Applicative Down | Since: base-4.11.0.0 |
| Functor Down | Since: base-4.11.0.0 |
| Monad Down | Since: base-4.11.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)) # | |
| Bits a => Bits (Down a) | Since: base-4.14.0.0 |
Defined in Data.Ord Methods (.&.) :: Down a -> Down a -> Down a # (.|.) :: Down a -> Down a -> Down a # xor :: Down a -> Down a -> Down a # complement :: Down a -> Down a # shift :: Down a -> Int -> Down a # rotate :: Down a -> Int -> Down a # setBit :: Down a -> Int -> Down a # clearBit :: Down a -> Int -> Down a # complementBit :: Down a -> Int -> Down a # testBit :: Down a -> Int -> Bool # bitSizeMaybe :: Down a -> Maybe Int # shiftL :: Down a -> Int -> Down a # unsafeShiftL :: Down a -> Int -> Down a # shiftR :: Down a -> Int -> Down a # unsafeShiftR :: Down a -> Int -> Down a # rotateL :: Down a -> Int -> Down a # | |
| FiniteBits a => FiniteBits (Down a) | Since: base-4.14.0.0 |
Defined in Data.Ord Methods finiteBitSize :: Down a -> Int # countLeadingZeros :: Down a -> Int # countTrailingZeros :: Down a -> Int # | |
| Storable a => Storable (Down a) | Since: base-4.14.0.0 |
| Monoid a => Monoid (Down a) | Since: base-4.11.0.0 |
| Semigroup a => Semigroup (Down a) | Since: base-4.11.0.0 |
| Bounded a => Bounded (Down a) | Swaps Since: base-4.14.0.0 |
| Floating a => Floating (Down a) | Since: base-4.14.0.0 |
| RealFloat a => RealFloat (Down a) | Since: base-4.14.0.0 |
Defined in Data.Ord Methods floatRadix :: Down a -> Integer # floatDigits :: Down a -> Int # floatRange :: Down a -> (Int, Int) # decodeFloat :: Down a -> (Integer, Int) # encodeFloat :: Integer -> Int -> Down a # significand :: Down a -> Down a # scaleFloat :: Int -> Down a -> Down a # isInfinite :: Down a -> Bool # isDenormalized :: Down a -> Bool # isNegativeZero :: Down a -> Bool # | |
| Generic (Down a) | |
| Ix a => Ix (Down a) | Since: base-4.14.0.0 |
| Num a => Num (Down a) | Since: base-4.11.0.0 |
| Read a => Read (Down a) | This instance would be equivalent to the derived instances of the
Since: base-4.7.0.0 |
| Fractional a => Fractional (Down a) | Since: base-4.14.0.0 |
| Real a => Real (Down a) | Since: base-4.14.0.0 |
Defined in Data.Ord Methods toRational :: Down a -> Rational # | |
| RealFrac a => RealFrac (Down a) | Since: base-4.14.0.0 |
| Show a => Show (Down a) | This instance would be equivalent to the derived instances of the
Since: base-4.7.0.0 |
| NFData a => NFData (Down a) | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| Eq a => Eq (Down a) | Since: base-4.6.0.0 |
| Ord a => Ord (Down a) | Since: base-4.6.0.0 |
| Wrapped (Down a) | |
| Ring a => Ring (Down a) | |
Defined in Data.Semiring | |
| Semiring a => Semiring (Down a) | |
| PMonoid (Down a) | |
| SMonoid a => SMonoid (Down a) | |
| POrd (Down a) | |
| SOrd a => SOrd (Down a) | |
Defined in Data.Ord.Singletons 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) # | |
| PSemigroup (Down a) | |
Defined in Data.Semigroup.Singletons.Internal | |
| SSemigroup a => SSemigroup (Down a) | |
| PNum (Down a) | |
| SNum a => SNum (Down a) | |
Defined in GHC.Num.Singletons 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) # | |
| Unbox a => Unbox (Down a) | |
Defined in Data.Vector.Unboxed.Base | |
| Generic1 Down | |
| t ~ Down b => Rewrapped (Down a) t | |
Defined in Control.Lens.Wrapped | |
| SDecide a => TestCoercion (SDown :: Down a -> Type) | |
Defined in Data.Ord.Singletons | |
| SDecide a => TestEquality (SDown :: Down a -> Type) | |
Defined in Data.Ord.Singletons | |
| SingI (GetDownSym0 :: TyFun (Down a) a -> Type) | |
Defined in Data.Ord.Singletons Methods sing :: Sing GetDownSym0 # | |
| SingI (DownSym0 :: TyFun a (Down a) -> Type) | |
Defined in Data.Ord.Singletons | |
| SuppressUnusedWarnings (Abs_6989586621679495702Sym0 :: TyFun (Down a) (Down a) -> Type) | |
Defined in GHC.Num.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Negate_6989586621679495695Sym0 :: TyFun (Down a) (Down a) -> Type) | |
Defined in GHC.Num.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Signum_6989586621679495709Sym0 :: TyFun (Down a) (Down a) -> Type) | |
Defined in GHC.Num.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679584175Sym0 :: TyFun (Down a) (Down a ~> Down a) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679495663Sym0 :: TyFun (Down a) (Down a ~> Down a) -> Type) | |
Defined in GHC.Num.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679495674Sym0 :: TyFun (Down a) (Down a ~> Down a) -> Type) | |
Defined in GHC.Num.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679495685Sym0 :: TyFun (Down a) (Down a ~> Down a) -> Type) | |
Defined in GHC.Num.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679179242Sym0 :: TyFun (Down a) (Down a ~> Ordering) -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679179231Sym0 :: TyFun (Down a) (Down a ~> Bool) -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (GetDownSym0 :: TyFun (Down a) a -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FromInteger_6989586621679495716Sym0 :: TyFun Nat (Down a) -> Type) | |
Defined in GHC.Num.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Pure_6989586621680883146Sym0 :: TyFun a (Down a) -> Type) | |
Defined in Control.Applicative.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (DownSym0 :: TyFun a (Down a) -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680883156Sym0 :: TyFun (Down (a ~> b)) (Down a ~> Down b) -> Type) | |
Defined in Control.Applicative.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679584175Sym1 a6989586621679584180 :: TyFun (Down a) (Down a) -> Type) | |
Defined in Data.Semigroup.Singletons.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679495663Sym1 a6989586621679495668 :: TyFun (Down a) (Down a) -> Type) | |
Defined in GHC.Num.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679495674Sym1 a6989586621679495679 :: TyFun (Down a) (Down a) -> Type) | |
Defined in GHC.Num.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679495685Sym1 a6989586621679495690 :: TyFun (Down a) (Down a) -> Type) | |
Defined in GHC.Num.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679179242Sym1 a6989586621679179247 :: TyFun (Down a) Ordering -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680892758Sym0 :: TyFun (Down a) ((a ~> Down b) ~> Down b) -> Type) | |
Defined in Control.Monad.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679179231Sym1 a6989586621679179236 :: TyFun (Down a) Bool -> Type) | |
Defined in Data.Ord.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Fmap_6989586621679439337Sym0 :: TyFun (a ~> b) (Down a ~> Down b) -> Type) | |
Defined in Data.Functor.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679439348Sym0 :: TyFun a (Down b ~> Down a) -> Type) | |
Defined in Data.Functor.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680883156Sym1 a6989586621680883161 :: TyFun (Down a) (Down b) -> Type) | |
Defined in Control.Applicative.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Fmap_6989586621679439337Sym1 a6989586621679439342 :: TyFun (Down a) (Down b) -> Type) | |
Defined in Data.Functor.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679439348Sym1 a6989586621679439353 :: TyFun (Down b) (Down a) -> Type) | |
Defined in Data.Functor.Singletons Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680892758Sym1 a6989586621680892763 :: TyFun (a ~> Down b) (Down b) -> Type) | |
Defined in Control.Monad.Singletons Methods suppressUnusedWarnings :: () # | |
| type Pure (a :: k1) | |
| type Return (arg :: a) | |
| type (arg :: Down a) *> (arg1 :: Down b) | |
| type (a1 :: k1) <$ (a2 :: Down b) | |
| type (arg :: Down a) <* (arg1 :: Down b) | |
| type (a2 :: Down (a1 ~> b)) <*> (a3 :: Down a1) | |
| type (arg :: Down a) >> (arg1 :: Down b) | |
| type (a2 :: Down a1) >>= (a3 :: a1 ~> Down b) | |
| type Fmap (a2 :: a1 ~> b) (a3 :: Down a1) | |
| type LiftA2 (arg :: a ~> (b ~> c)) (arg1 :: Down a) (arg2 :: Down b) | |
| newtype MVector s (Down a) | |
Defined in Data.Vector.Unboxed.Base | |
| type Apply (FromInteger_6989586621679495716Sym0 :: TyFun Nat (Down a) -> Type) (a6989586621679495720 :: Nat) | |
| type Apply (Pure_6989586621680883146Sym0 :: TyFun a (Down a) -> Type) (a6989586621680883152 :: a) | |
Defined in Control.Applicative.Singletons | |
| type Apply (DownSym0 :: TyFun a (Down a) -> Type) (a6989586621679177352 :: a) | |
| type Apply (TFHelper_6989586621679439348Sym0 :: TyFun a (Down b ~> Down a) -> Type) (a6989586621679439353 :: a) | |
| type Rep (Down a) | Since: base-4.12.0.0 |
Defined in GHC.Generics | |
| type Unwrapped (Down a) | |
Defined in Control.Lens.Wrapped | |
| type Demote (Down a) | |
Defined in Data.Ord.Singletons | |
| type Sing | |
Defined in Data.Ord.Singletons | |
| type Mempty | |
Defined in Data.Monoid.Singletons | |
| newtype Vector (Down a) | |
Defined in Data.Vector.Unboxed.Base | |
| type Rep1 Down | Since: base-4.12.0.0 |
Defined in GHC.Generics | |
| type Mconcat (arg :: [Down a]) | |
| type Sconcat (arg :: NonEmpty (Down a)) | |
| type Abs (a2 :: Down a1) | |
| type FromInteger a2 | |
Defined in GHC.Num.Singletons | |
| type Negate (a2 :: Down a1) | |
| type Signum (a2 :: Down a1) | |
| type (arg :: Down a) /= (arg1 :: Down a) | |
| type (a2 :: Down a1) == (a3 :: Down a1) | |
| type Mappend (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 Max (arg1 :: Down a) (arg2 :: Down a) | |
| type Min (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 Apply (GetDownSym0 :: TyFun (Down a) a -> Type) (a6989586621679177355 :: Down a) | |
Defined in Data.Ord.Singletons | |
| type Apply (Compare_6989586621679179242Sym1 a6989586621679179247 :: TyFun (Down a) Ordering -> Type) (a6989586621679179248 :: Down a) | |
| type Apply (TFHelper_6989586621679179231Sym1 a6989586621679179236 :: TyFun (Down a) Bool -> Type) (a6989586621679179237 :: Down a) | |
| type Apply (Abs_6989586621679495702Sym0 :: TyFun (Down a) (Down a) -> Type) (a6989586621679495706 :: Down a) | |
| type Apply (Negate_6989586621679495695Sym0 :: TyFun (Down a) (Down a) -> Type) (a6989586621679495699 :: Down a) | |
| type Apply (Signum_6989586621679495709Sym0 :: TyFun (Down a) (Down a) -> Type) (a6989586621679495713 :: Down a) | |
| type Apply (TFHelper_6989586621679584175Sym1 a6989586621679584180 :: TyFun (Down a) (Down a) -> Type) (a6989586621679584181 :: Down a) | |
| type Apply (TFHelper_6989586621679495663Sym1 a6989586621679495668 :: TyFun (Down a) (Down a) -> Type) (a6989586621679495669 :: Down a) | |
| type Apply (TFHelper_6989586621679495674Sym1 a6989586621679495679 :: TyFun (Down a) (Down a) -> Type) (a6989586621679495680 :: Down a) | |
| type Apply (TFHelper_6989586621679495685Sym1 a6989586621679495690 :: TyFun (Down a) (Down a) -> Type) (a6989586621679495691 :: Down a) | |
| type Apply (TFHelper_6989586621680883156Sym1 a6989586621680883161 :: TyFun (Down a) (Down b) -> Type) (a6989586621680883162 :: Down a) | |
| type Apply (Fmap_6989586621679439337Sym1 a6989586621679439342 :: TyFun (Down a) (Down b) -> Type) (a6989586621679439343 :: Down a) | |
| type Apply (TFHelper_6989586621679439348Sym1 a6989586621679439353 :: TyFun (Down b) (Down a) -> Type) (a6989586621679439354 :: Down b) | |
| type Apply (TFHelper_6989586621679584175Sym0 :: TyFun (Down a) (Down a ~> Down a) -> Type) (a6989586621679584180 :: Down a) | |
| type Apply (TFHelper_6989586621679495663Sym0 :: TyFun (Down a) (Down a ~> Down a) -> Type) (a6989586621679495668 :: Down a) | |
| type Apply (TFHelper_6989586621679495674Sym0 :: TyFun (Down a) (Down a ~> Down a) -> Type) (a6989586621679495679 :: Down a) | |
| type Apply (TFHelper_6989586621679495685Sym0 :: TyFun (Down a) (Down a ~> Down a) -> Type) (a6989586621679495690 :: Down a) | |
| type Apply (Compare_6989586621679179242Sym0 :: TyFun (Down a) (Down a ~> Ordering) -> Type) (a6989586621679179247 :: Down a) | |
| type Apply (TFHelper_6989586621679179231Sym0 :: TyFun (Down a) (Down a ~> Bool) -> Type) (a6989586621679179236 :: Down a) | |
| type Apply (TFHelper_6989586621680883156Sym0 :: TyFun (Down (a ~> b)) (Down a ~> Down b) -> Type) (a6989586621680883161 :: Down (a ~> b)) | |
| type Apply (TFHelper_6989586621680892758Sym0 :: TyFun (Down a) ((a ~> Down b) ~> Down b) -> Type) (a6989586621680892763 :: Down a) | |
| type Apply (TFHelper_6989586621680892758Sym1 a6989586621680892763 :: TyFun (a ~> Down b) (Down b) -> Type) (a6989586621680892764 :: a ~> Down b) | |
| type Apply (Fmap_6989586621679439337Sym0 :: TyFun (a ~> b) (Down a ~> Down b) -> Type) (a6989586621679439342 :: a ~> b) | |
This type represents unknown type-level natural numbers.
Since: base-4.10.0.0
someNatVal :: Natural -> SomeNat #
Convert an integer into an unknown type-level natural.
Since: base-4.10.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
See openFile
Constructors
| ReadMode | |
| WriteMode | |
| AppendMode | |
| ReadWriteMode |
underflowError :: a #
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.
ratioPrec1 :: Int #
overflowError :: a #
numericEnumFromTo :: (Ord a, Fractional a) => a -> a -> [a] #
numericEnumFromThenTo :: (Ord a, Fractional a) => a -> a -> a -> [a] #
numericEnumFromThen :: Fractional a => a -> a -> [a] #
numericEnumFrom :: Fractional a => a -> [a] #
Extract the numerator of the ratio in reduced form: the numerator and denominator have no common factor and the denominator is positive.
notANumber :: Rational #
naturalFromInt :: Int -> Natural #
Convert an Int into a Natural, throwing an underflow exception for negative values.
integralEnumFromTo :: Integral a => a -> a -> [a] #
integralEnumFromThenTo :: Integral a => a -> a -> a -> [a] #
integralEnumFromThen :: (Integral a, Bounded a) => a -> a -> [a] #
integralEnumFrom :: (Integral a, Bounded a) => a -> [a] #
divZeroError :: 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.
boundedEnumFromThen :: (Enum a, Bounded a) => a -> a -> [a] #
boundedEnumFrom :: (Enum a, Bounded a) => a -> [a] #
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
($>) :: 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
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
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.
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
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
stimesIdempotentMonoid :: (Integral b, Monoid a) => b -> a -> a #
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
| 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 # | |
| 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 |
| Traversable IntMap | Traverses in order of increasing key. |
| Functor IntMap | |
| Hashable1 IntMap | Since: hashable-1.3.4.0 |
Defined in Data.Hashable.Class | |
| Structured v => Structured (IntMap v) | |
Defined in Distribution.Utils.Structured | |
| 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) # | |
| Monoid (IntMap a) | |
| Semigroup (IntMap a) | Since: containers-0.5.7 |
| IsList (IntMap a) | Since: containers-0.5.6.2 |
| Read e => Read (IntMap e) | |
| Show a => Show (IntMap a) | |
| NFData a => NFData (IntMap a) | |
Defined in Data.IntMap.Internal | |
| Eq a => Eq (IntMap a) | |
| Ord a => Ord (IntMap a) | |
Defined in Data.IntMap.Internal | |
| Hashable v => Hashable (IntMap v) | Since: hashable-1.3.4.0 |
Defined in Data.Hashable.Class | |
| At (IntMap a) | |
| Ixed (IntMap a) | |
Defined in Control.Lens.At | |
| Wrapped (IntMap a) | |
| 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 # 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 # 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)) # safeHead :: IntMap v -> Maybe (Element (IntMap v)) # safeMaximum :: IntMap v -> Maybe (Element (IntMap v)) # safeMinimum :: IntMap v -> Maybe (Element (IntMap v)) # safeFoldr1 :: (Element (IntMap v) -> Element (IntMap v) -> Element (IntMap v)) -> IntMap v -> Maybe (Element (IntMap v)) # safeFoldl1 :: (Element (IntMap v) -> Element (IntMap v) -> Element (IntMap v)) -> IntMap v -> Maybe (Element (IntMap v)) # | |
| FromList (IntMap v) | |
Defined in Universum.Container.Class Methods fromList :: [ListElement (IntMap v)] -> IntMap v # | |
| One (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 Element (IntMap v) | |
Defined in Universum.Container.Class | |
| type FromListC (IntMap v) | |
Defined in Universum.Container.Class | |
| type Key (IntMap v) | |
Defined in Universum.Container.Class | |
| type ListElement (IntMap v) | |
Defined in Universum.Container.Class | |
| type OneItem (IntMap v) | |
Defined in Universum.Container.Class | |
| type Val (IntMap v) | |
Defined in Universum.Container.Class | |
A set of integers.
Instances
General-purpose finite sequences.
Instances
| MonadFix Seq | Since: containers-0.5.11 |
Defined in Data.Sequence.Internal | |
| MonadZip Seq |
|
| 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 # | |
| 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 |
| Traversable Seq | |
| Alternative Seq | Since: containers-0.5.4 |
| Applicative Seq | Since: containers-0.5.4 |
| Functor Seq | |
| Monad Seq | |
| MonadPlus Seq | |
| UnzipWith Seq | |
Defined in Data.Sequence.Internal Methods unzipWith' :: (x -> (a, b)) -> Seq x -> (Seq a, Seq b) | |
| Hashable1 Seq | Since: hashable-1.3.4.0 |
Defined in Data.Hashable.Class | |
| Structured v => Structured (Seq v) | |
Defined in Distribution.Utils.Structured | |
| 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) # | |
| a ~ Char => IsString (Seq a) | Since: containers-0.5.7 |
Defined in Data.Sequence.Internal Methods fromString :: String -> Seq a # | |
| Monoid (Seq a) | |
| Semigroup (Seq a) | Since: containers-0.5.7 |
| IsList (Seq a) | |
| Read a => Read (Seq a) | |
| Show a => Show (Seq a) | |
| NFData a => NFData (Seq a) | |
Defined in Data.Sequence.Internal | |
| Eq a => Eq (Seq a) | |
| Ord a => Ord (Seq a) | |
| Hashable v => Hashable (Seq v) | Since: hashable-1.3.4.0 |
Defined in Data.Hashable.Class | |
| Ixed (Seq a) | |
Defined in Control.Lens.At | |
| Wrapped (Seq a) | |
| Ord a => Stream (Seq a) | Since: megaparsec-9.0.0 |
Defined in Text.Megaparsec.Stream Methods tokenToChunk :: Proxy (Seq a) -> Token (Seq a) -> Tokens (Seq a) # tokensToChunk :: Proxy (Seq a) -> [Token (Seq a)] -> Tokens (Seq a) # chunkToTokens :: Proxy (Seq a) -> Tokens (Seq a) -> [Token (Seq a)] # chunkLength :: Proxy (Seq a) -> Tokens (Seq a) -> Int # chunkEmpty :: Proxy (Seq a) -> Tokens (Seq a) -> Bool # take1_ :: Seq a -> Maybe (Token (Seq a), Seq a) # takeN_ :: Int -> Seq a -> Maybe (Tokens (Seq a), Seq a) # takeWhile_ :: (Token (Seq a) -> Bool) -> Seq a -> (Tokens (Seq a), 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 # 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 # 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)) # safeHead :: Seq a -> Maybe (Element (Seq a)) # safeMaximum :: Seq a -> Maybe (Element (Seq a)) # safeMinimum :: Seq a -> Maybe (Element (Seq a)) # safeFoldr1 :: (Element (Seq a) -> Element (Seq a) -> Element (Seq a)) -> Seq a -> Maybe (Element (Seq a)) # safeFoldl1 :: (Element (Seq a) -> Element (Seq a) -> Element (Seq a)) -> Seq a -> Maybe (Element (Seq a)) # | |
| FromList (Seq a) | |
Defined in Universum.Container.Class Methods fromList :: [ListElement (Seq a)] -> Seq a # | |
| One (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 Token (Seq a) | |
Defined in Text.Megaparsec.Stream | |
| type Tokens (Seq a) | |
Defined in Text.Megaparsec.Stream | |
| type Element (Seq a) | |
Defined in Universum.Container.Class | |
| type FromListC (Seq a) | |
Defined in Universum.Container.Class | |
| type ListElement (Seq a) | |
Defined in Universum.Container.Class | |
| type OneItem (Seq a) | |
Defined in Universum.Container.Class | |
($!!) :: 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
runExceptT :: ExceptT e m a -> m (Either e a) #
The inverse of ExceptT.
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
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
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 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 | |
| (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 (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) # | |
| 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 (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 => 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, 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) # | |
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 STM | |
| MonadCatch IO | |
| e ~ SomeException => MonadCatch (Either e) | Since: exceptions-0.8.3 |
| MonadCatch m => MonadCatch (ListT m) | |
| MonadCatch m => MonadCatch (MaybeT 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 (ExceptT e m) | Catches exceptions from the base monad. |
| MonadCatch m => MonadCatch (IdentityT m) | |
| MonadCatch m => MonadCatch (ReaderT r m) | |
| MonadCatch m => MonadCatch (StateT s m) | |
| MonadCatch m => MonadCatch (StateT s 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) | |
type family IntBaseType a :: IntBaseTypeK #
The (open) type family IntBaseType encodes type-level
information about the value range of an integral type.
This module also provides type family instances for the standard
Haskell 2010 integral types (including Foreign.C.Types) as well
as the Natural type.
Here's a simple example for registering a custom type with the Data.IntCast facilities:
-- user-implemented unsigned 4-bit integer data Nibble = … -- declare meta-information type instanceIntBaseTypeNibble =FixedWordTag4 -- user-implemented signed 7-bit integer data MyInt7 = … -- declare meta-information type instanceIntBaseTypeMyInt7 =FixedIntTag7
The type-level predicate IsIntSubType provides a partial
ordering based on the types above. See also intCast.
Instances
A set of values. A set cannot contain duplicate values.
Instances
| Foldable HashSet | |
Defined in Data.HashSet.Internal 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.Internal | |
| Show1 HashSet | |
| NFData1 HashSet | Since: unordered-containers-0.2.14.0 |
Defined in Data.HashSet.Internal | |
| Hashable1 HashSet | |
Defined in Data.HashSet.Internal | |
| Lift a => Lift (HashSet a :: Type) | Since: unordered-containers-0.2.17.0 |
| (Data a, Eq a, Hashable a) => Data (HashSet a) | |
Defined in Data.HashSet.Internal 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) # | |
| (Hashable a, Eq a) => Monoid (HashSet a) | O(n+m) To obtain good performance, the smaller set must be presented as the first argument. Examples
|
| (Hashable a, Eq a) => Semigroup (HashSet a) | O(n+m) To obtain good performance, the smaller set must be presented as the first argument. Examples
|
| (Eq a, Hashable a) => IsList (HashSet a) | |
| (Eq a, Hashable a, Read a) => Read (HashSet a) | |
| Show a => Show (HashSet a) | |
| NFData a => NFData (HashSet a) | |
Defined in Data.HashSet.Internal | |
| Eq a => Eq (HashSet a) | Note that, in the presence of hash collisions, equal
In general, the lack of substitutivity can be observed with any function that depends on the key ordering, such as folds and traversals. |
| Ord a => Ord (HashSet a) | |
| Hashable a => Hashable (HashSet a) | |
Defined in Data.HashSet.Internal | |
| (Eq k, Hashable k) => At (HashSet k) | |
| (Eq a, Hashable a) => Contains (HashSet a) | |
| (Eq k, Hashable k) => Ixed (HashSet k) | |
Defined in Control.Lens.At | |
| (Hashable a, Eq a) => Wrapped (HashSet a) | |
| (Eq a, Hashable a, Monoid a) => Semiring (HashSet a) | The multiplication laws are satisfied for
any underlying |
| (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 # 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 # 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)) # safeHead :: HashSet v -> Maybe (Element (HashSet v)) # safeMaximum :: HashSet v -> Maybe (Element (HashSet v)) # safeMinimum :: HashSet v -> Maybe (Element (HashSet v)) # safeFoldr1 :: (Element (HashSet v) -> Element (HashSet v) -> Element (HashSet v)) -> HashSet v -> Maybe (Element (HashSet v)) # safeFoldl1 :: (Element (HashSet v) -> Element (HashSet v) -> Element (HashSet v)) -> HashSet v -> Maybe (Element (HashSet v)) # | |
| Hashable v => One (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.Internal | |
| 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 Element (HashSet v) | |
Defined in Universum.Container.Class | |
| type OneItem (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
| MonadFail Vector | Since: vector-0.12.1.0 |
Defined in Data.Vector | |
| MonadFix Vector | Instance has same semantics as one for lists Since: vector-0.12.2.0 |
Defined in Data.Vector | |
| MonadZip 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 # | |
| Eq1 Vector | |
| Ord1 Vector | |
Defined in Data.Vector | |
| Read1 Vector | |
Defined in Data.Vector | |
| Show1 Vector | |
| Traversable Vector | |
| Alternative Vector | |
| Applicative Vector | |
| Functor Vector | |
| Monad Vector | |
| MonadPlus 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 () # | |
| 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) # | |
| Monoid (Vector a) | |
| Semigroup (Vector a) | |
| IsList (Vector a) | |
| Read a => Read (Vector a) | |
| Show a => Show (Vector a) | |
| NFData a => NFData (Vector a) | |
Defined in Data.Vector | |
| Eq a => Eq (Vector a) | |
| Ord a => Ord (Vector a) | |
Defined in Data.Vector | |
| Ixed (Vector a) | |
Defined in Control.Lens.At | |
| Wrapped (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 # 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 # 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)) # safeHead :: Vector a -> Maybe (Element (Vector a)) # safeMaximum :: Vector a -> Maybe (Element (Vector a)) # safeMinimum :: Vector a -> Maybe (Element (Vector a)) # safeFoldr1 :: (Element (Vector a) -> Element (Vector a) -> Element (Vector a)) -> Vector a -> Maybe (Element (Vector a)) # safeFoldl1 :: (Element (Vector a) -> Element (Vector a) -> Element (Vector a)) -> Vector a -> Maybe (Element (Vector a)) # | |
| FromList (Vector a) | |
Defined in Universum.Container.Class Methods fromList :: [ListElement (Vector a)] -> Vector a # | |
| One (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 Element (Vector a) | |
Defined in Universum.Container.Class | |
| type FromListC (Vector a) | |
Defined in Universum.Container.Class | |
| type ListElement (Vector a) | |
Defined in Universum.Container.Class | |
| type OneItem (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.
preuse :: MonadState s m => Getting (First a) s a -> m (Maybe a) #
Retrieve the first value targeted by a Fold or Traversal (or Just the result
from a Getter or Lens) into the current state.
preuse=use.pre
preuse::MonadStates m =>Getters a -> m (Maybea)preuse::MonadStates m =>Folds a -> m (Maybea)preuse::MonadStates m =>Lens's a -> m (Maybea)preuse::MonadStates m =>Iso's a -> m (Maybea)preuse::MonadStates m =>Traversal's a -> m (Maybea)
preview :: MonadReader s m => Getting (First a) s a -> m (Maybe a) #
Retrieve the first value targeted by a Fold or Traversal (or Just the result
from a Getter or Lens). See also firstOf and ^?, which are similar with
some subtle differences (explained below).
listToMaybe.toList≡previewfolded
preview=view.pre
Unlike ^?, this function uses a
MonadReader to read the value to be focused in on.
This allows one to pass the value as the last argument by using the
MonadReader instance for (->) s
However, it may also be used as part of some deeply nested transformer stack.
preview uses a monoidal value to obtain the result.
This means that it generally has good performance, but can occasionally cause space leaks
or even stack overflows on some data types.
There is another function, firstOf, which avoids these issues at the cost of
a slight constant performance cost and a little less flexibility.
It may be helpful to think of preview as having one of the following
more specialized types:
preview::Getters a -> s ->Maybeapreview::Folds a -> s ->Maybeapreview::Lens's a -> s ->Maybeapreview::Iso's a -> s ->Maybeapreview::Traversal's a -> s ->Maybea
preview::MonadReaders m =>Getters a -> m (Maybea)preview::MonadReaders m =>Folds a -> m (Maybea)preview::MonadReaders m =>Lens's a -> m (Maybea)preview::MonadReaders m =>Iso's a -> m (Maybea)preview::MonadReaders m =>Traversal's a -> m (Maybea)
(^?) :: s -> Getting (First a) s a -> Maybe a infixl 8 #
Perform a safe head of a Fold or Traversal or retrieve Just the result
from a Getter or Lens.
When using a Traversal as a partial Lens, or a Fold as a partial Getter this can be a convenient
way to extract the optional value.
Note: if you get stack overflows due to this, you may want to use firstOf instead, which can deal
more gracefully with heavily left-biased trees. This is because ^? works by using the
First monoid, which can occasionally cause space leaks.
>>>Left 4 ^?_LeftJust 4
>>>Right 4 ^?_LeftNothing
>>>"world" ^? ix 3Just 'l'
>>>"world" ^? ix 20Nothing
This operator works as an infix version of preview.
(^?) ≡flippreview
It may be helpful to think of ^? as having one of the following
more specialized types:
(^?) :: s ->Getters a ->Maybea (^?) :: s ->Folds a ->Maybea (^?) :: s ->Lens's a ->Maybea (^?) :: s ->Iso's a ->Maybea (^?) :: s ->Traversal's a ->Maybea
(^..) :: s -> Getting (Endo [a]) s a -> [a] infixl 8 #
A convenient infix (flipped) version of toListOf.
>>>[[1,2],[3]]^..id[[[1,2],[3]]]>>>[[1,2],[3]]^..traverse[[1,2],[3]]>>>[[1,2],[3]]^..traverse.traverse[1,2,3]
>>>(1,2)^..both[1,2]
toListxs ≡ xs^..folded(^..) ≡fliptoListOf
(^..) :: s ->Getters a -> a :: s ->Folds a -> a :: s ->Lens's a -> a :: s ->Iso's a -> a :: s ->Traversal's a -> a :: s ->Prism's a -> [a]
use :: MonadState s m => Getting a s a -> m a #
Use the target of a Lens, Iso, or
Getter in the current state, or use a summary of a
Fold or Traversal that points
to a monoidal value.
>>>evalState (use _1) (a,b)a
>>>evalState (use _1) ("hello","world")"hello"
use::MonadStates m =>Getters a -> m ause:: (MonadStates m,Monoidr) =>Folds r -> m ruse::MonadStates m =>Iso's a -> m ause::MonadStates m =>Lens's a -> m ause:: (MonadStates m,Monoidr) =>Traversal's r -> m r
(^.) :: s -> Getting a s a -> a infixl 8 #
View the value pointed to by a Getter or Lens or the
result of folding over all the results of a Fold or
Traversal that points at a monoidal values.
This is the same operation as view with the arguments flipped.
The fixity and semantics are such that subsequent field accesses can be
performed with (.).
>>>(a,b)^._2b
>>>("hello","world")^._2"world"
>>>import Data.Complex>>>((0, 1 :+ 2), 3)^._1._2.to magnitude2.23606797749979
(^.) :: s ->Getters a -> a (^.) ::Monoidm => s ->Folds m -> m (^.) :: s ->Iso's a -> a (^.) :: s ->Lens's a -> a (^.) ::Monoidm => s ->Traversal's m -> m
view :: MonadReader s m => Getting a s a -> m a #
View the value pointed to by a Getter, Iso or
Lens or the result of folding over all the results of a
Fold or Traversal that points
at a monoidal value.
view.to≡id
>>>view (to f) af a
>>>view _2 (1,"hello")"hello"
>>>view (to succ) 56
>>>view (_2._1) ("hello",("world","!!!"))"world"
As view is commonly used to access the target of a Getter or obtain a monoidal summary of the targets of a Fold,
It may be useful to think of it as having one of these more restricted signatures:
view::Getters a -> s -> aview::Monoidm =>Folds m -> s -> mview::Iso's a -> s -> aview::Lens's a -> s -> aview::Monoidm =>Traversal's m -> s -> m
In a more general setting, such as when working with a Monad transformer stack you can use:
view::MonadReaders m =>Getters a -> m aview:: (MonadReaders m,Monoida) =>Folds a -> m aview::MonadReaders m =>Iso's a -> m aview::MonadReaders m =>Lens's a -> m aview:: (MonadReaders m,Monoida) =>Traversal's a -> m a
_1 :: Field1 s t a b => Lens s t a b #
Access the 1st field of a tuple (and possibly change its type).
>>>(1,2)^._11
>>>_1 .~ "hello" $ (1,2)("hello",2)
>>>(1,2) & _1 .~ "hello"("hello",2)
>>>_1 putStrLn ("hello","world")hello ((),"world")
This can also be used on larger tuples as well:
>>>(1,2,3,4,5) & _1 +~ 41(42,2,3,4,5)
_1::Lens(a,b) (a',b) a a'_1::Lens(a,b,c) (a',b,c) a a'_1::Lens(a,b,c,d) (a',b,c,d) a a' ..._1::Lens(a,b,c,d,e,f,g,h,i) (a',b,c,d,e,f,g,h,i) a a'
_2 :: Field2 s t a b => Lens s t a b #
Access the 2nd field of a tuple.
>>>_2 .~ "hello" $ (1,(),3,4)(1,"hello",3,4)
>>>(1,2,3,4) & _2 *~ 3(1,6,3,4)
>>>_2 print (1,2)2 (1,())
anyOf_2:: (s ->Bool) -> (a, s) ->Booltraverse._2:: (Applicativef,Traversablet) => (a -> f b) -> t (s, a) -> f (t (s, b))foldMapOf(traverse._2) :: (Traversablet,Monoidm) => (s -> m) -> t (b, s) -> m
(.~) :: ASetter s t a b -> b -> s -> t infixr 4 #
Replace the target of a Lens or all of the targets of a Setter
or Traversal with a constant value.
This is an infix version of set, provided for consistency with (.=).
f<$a ≡mapped.~f$a
>>>(a,b,c,d) & _4 .~ e(a,b,c,e)
>>>(42,"world") & _1 .~ "hello"("hello","world")
>>>(a,b) & both .~ c(c,c)
(.~) ::Setters t a b -> b -> s -> t (.~) ::Isos t a b -> b -> s -> t (.~) ::Lenss t a b -> b -> s -> t (.~) ::Traversals t a b -> b -> s -> t
(%~) :: ASetter s t a b -> (a -> b) -> s -> t infixr 4 #
Modifies the target of a Lens or all of the targets of a Setter or
Traversal with a user supplied function.
This is an infix version of over.
fmapf ≡mapped%~ffmapDefaultf ≡traverse%~f
>>>(a,b,c) & _3 %~ f(a,b,f c)
>>>(a,b) & both %~ f(f a,f b)
>>>_2 %~ length $ (1,"hello")(1,5)
>>>traverse %~ f $ [a,b,c][f a,f b,f c]
>>>traverse %~ even $ [1,2,3][False,True,False]
>>>traverse.traverse %~ length $ [["hello","world"],["!!!"]][[5,5],[3]]
(%~) ::Setters t a b -> (a -> b) -> s -> t (%~) ::Isos t a b -> (a -> b) -> s -> t (%~) ::Lenss t a b -> (a -> b) -> s -> t (%~) ::Traversals t a b -> (a -> b) -> s -> t
set :: ASetter s t a b -> b -> s -> t #
Replace the target of a Lens or all of the targets of a Setter
or Traversal with a constant value.
(<$) ≡setmapped
>>>set _2 "hello" (1,())(1,"hello")
>>>set mapped () [1,2,3,4][(),(),(),()]
Note: Attempting to set a Fold or Getter will fail at compile time with an
relatively nice error message.
set::Setters t a b -> b -> s -> tset::Isos t a b -> b -> s -> tset::Lenss t a b -> b -> s -> tset::Traversals t a b -> b -> s -> t
over :: ASetter s t a b -> (a -> b) -> s -> t #
Modify the target of a Lens or all the targets of a Setter or Traversal
with a function.
fmap≡overmappedfmapDefault≡overtraversesets.over≡idover.sets≡id
Given any valid Setter l, you can also rely on the law:
overl f.overl g =overl (f.g)
e.g.
>>>over mapped f (over mapped g [a,b,c]) == over mapped (f . g) [a,b,c]True
Another way to view over is to say that it transforms a Setter into a
"semantic editor combinator".
>>>over mapped f (Just a)Just (f a)
>>>over mapped (*10) [1,2,3][10,20,30]
>>>over _1 f (a,b)(f a,b)
>>>over _1 show (10,20)("10",20)
over::Setters t a b -> (a -> b) -> s -> tover::ASetters t a b -> (a -> b) -> s -> t
type Lens s t a b = forall (f :: Type -> Type). Functor f => (a -> f b) -> s -> f t #
A Lens is actually a lens family as described in
http://comonad.com/reader/2012/mirrored-lenses/.
With great power comes great responsibility and a Lens is subject to the
three common sense Lens laws:
1) You get back what you put in:
viewl (setl v s) ≡ v
2) Putting back what you got doesn't change anything:
setl (viewl s) s ≡ s
3) Setting twice is the same as setting once:
setl v' (setl v s) ≡setl v' s
These laws are strong enough that the 4 type parameters of a Lens cannot
vary fully independently. For more on how they interact, read the "Why is
it a Lens Family?" section of
http://comonad.com/reader/2012/mirrored-lenses/.
There are some emergent properties of these laws:
1) set l ss This is a consequence of law #1
2) set lv from some s such that set s v = s
3) Given just the first two laws you can prove a weaker form of law #3 where the values v that you are setting match:
setl v (setl v s) ≡setl v s
Every Lens can be used directly as a Setter or Traversal.
You can also use a Lens for Getting as if it were a
Fold or Getter.
Since every Lens is a valid Traversal, the
Traversal laws are required of any Lens you create:
lpure≡purefmap(l f).l g ≡getCompose.l (Compose.fmapf.g)
typeLenss t a b = forall f.Functorf =>LensLikef s t a b
type Traversal s t a b = forall (f :: Type -> Type). Applicative f => (a -> f b) -> s -> f t #
A Traversal can be used directly as a Setter or a Fold (but not as a Lens) and provides
the ability to both read and update multiple fields, subject to some relatively weak Traversal laws.
These have also been known as multilenses, but they have the signature and spirit of
traverse::Traversablef =>Traversal(f a) (f b) a b
and the more evocative name suggests their application.
Most of the time the Traversal you will want to use is just traverse, but you can also pass any
Lens or Iso as a Traversal, and composition of a Traversal (or Lens or Iso) with a Traversal (or Lens or Iso)
using (.) forms a valid Traversal.
The laws for a Traversal t follow from the laws for Traversable as stated in "The Essence of the Iterator Pattern".
tpure≡purefmap(t f).t g ≡getCompose.t (Compose.fmapf.g)
One consequence of this requirement is that a Traversal needs to leave the same number of elements as a
candidate for subsequent Traversal that it started with. Another testament to the strength of these laws
is that the caveat expressed in section 5.5 of the "Essence of the Iterator Pattern" about exotic
Traversable instances that traverse the same entry multiple times was actually already ruled out by the
second law in that same paper!
type Traversal' s a = Traversal s s a a #
typeTraversal'=SimpleTraversal
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.
fromInteger :: (HasCallStack, Integral a) => Integer -> a #
error :: forall (r :: RuntimeRep) (a :: TYPE r). HasCallStack => Text -> a #
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
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 (_1 :: [k -> Constraint]) ('[] :: [k]) = () | |
| Each (c :: [k -> Constraint]) (h ': t :: [k]) = (c <+> h, Each c t) |
fromIntegral :: (Integral a, Integral b, CheckIntSubType a b) => a -> b #
Statically safe converter between Integral
types, which is just intCast under the hood.
It is used to turn the value of type a into
the value of type b such that a is subtype
of b. It is needed to prevent silent unsafe
conversions.
>>>fromIntegral @Int @Word 1... ... error: ... Can not safely cast 'Int' to 'Word': ... 'Int' is not a subtype of 'Word' ...>>>fromIntegral @Word @Natural 11
unsafe :: (HasCallStack, Buildable a) => Either a b -> b #
Unsafe converter from Either, which uses buildable
Left to throw an exception with error.
It is primarily needed for making unsafe counter-parts
of safe functions. In particular, for replacing
unsafeFName x = either (error . pretty) id
constructors and converters, which produce many similar
functions at the call site, with unsafe . fName $ x.
show :: forall b a. (PrettyShow a, Show a, IsString b) => a -> b #
type family PrettyShow a #
An open type family for types having a human-readable Show representation. The
kind is Constraint in case we need to further constrain the instance, and also for
convenience to avoid explicitly writing ~ 'True everywhere.
Instances
fromIntegralNoOverflow :: (Integral a, Integral b) => a -> Either ArithException b #
Statically safe converter between Integral types
checking for overflow/underflow. Returns Right value if conversion does not
produce overflow/underflow and Left ArithException with corresponding
ArithException (Overflow/Underflow) otherwise.
Note the function is strict in its argument.
>>>fromIntegralNoOverflow @Int @Word 123Right 123>>>fromIntegralNoOverflow @Int @Word (-123)Left arithmetic underflow>>>fromIntegralNoOverflow @Int @Integer (-123)Right (-123)>>>fromIntegralNoOverflow @Int @Natural (-123)Left arithmetic underflow>>>fromIntegralNoOverflow @Int @Int8 127Right 127>>>fromIntegralNoOverflow @Int @Int8 128Left arithmetic overflow
fromIntegralOverflowing :: (Integral a, Num b) => a -> b #
Runtime-safe converter between Integral types, which is just
fromIntegral under the hood.
It is needed to semantically distinguish usages, where overflow is intended,
from those that have to fail on overflow. E.g. Int8 -> Word8 with intended
bits reinterpretation from lossy Integer -> Int.
>>>fromIntegralOverflowing @Int8 @Word8 (-1)255>>>fromIntegralOverflowing @Natural @Int8 450-62
Please note that like fromIntegral from base, this will throw on some
conversions!
>>>fromIntegralOverflowing @Int @Natural (-1)*** Exception: arithmetic underflow
See fromIntegralNoOverflow for an alternative that doesn't throw.
fromIntegralToRealFrac :: (Integral a, RealFrac b, CheckIntSubType a Integer) => a -> b #
Statically safe converter between Integral
and RealFrac types. Could be applied to cast
common types like Float, Double and Scientific.
It is primarily needed to replace usages of
fromIntegral, which are safe actually
as integral numbers are being casted to
fractional ones.
fromIntegralMaybe :: (Integral a, Integral b, Bits a, Bits b) => a -> Maybe b #
Statically safe converter between Integral
types, which is just intCastMaybe under the
hood. Unlike fromIntegral accept any a and
b. Return Just value if conversion is
possible at runtime and Nothing otherwise.
type CheckIntSubType a b = (CheckIntSubTypeErrors a b (IsIntSubType a b), IsIntSubType a b ~ 'True) #
Constraint synonym equivalent to IsIntSubType a b ~ 'True
all1 :: Boolean b => (a -> b) -> NonEmpty a -> b #
A version of all that works on NonEmpty, thus doesn't require
BooleanMonoid instance.
>>>all1 (\x -> if x > 50 then Yay else Nay) $ 100 :| replicate 10 51Yay
any1 :: Boolean b => (a -> b) -> NonEmpty a -> b #
A version of any that works on NonEmpty, thus doesn't require
BooleanMonoid instance.
>>>any1 (\x -> if x > 50 then Yay else Nay) $ 50 :| replicate 10 0Nay
all :: (Container c, BooleanMonoid b) => (Element c -> b) -> c -> b #
Generalized all.
>>>all (\x -> if x > 50 then Yay else Nay) [1..100]Nay
any :: (Container c, BooleanMonoid b) => (Element c -> b) -> c -> b #
Generalized any.
>>>any (\x -> if x > 50 then Yay else Nay) [1..100]Yay
and1 :: Boolean a => NonEmpty a -> a #
A version of and that works on NonEmpty, thus doesn't require
BooleanMonoid instance.
>>>and1 $ Yay :| [Nay]Nay
or1 :: Boolean a => NonEmpty a -> a #
A version of or that works on NonEmpty, thus doesn't require
BooleanMonoid instance.
>>>or1 $ Yay :| [Nay]Yay
and :: (Container c, BooleanMonoid (Element c)) => c -> Element c #
Generalized version of and.
>>>and $ replicate 10 YayYay>>>and $ Nay : replicate 10 YayNay
or :: (Container c, BooleanMonoid (Element c)) => c -> Element c #
Generalized version of or.
>>>or $ replicate 10 NayNay>>>or $ Yay : replicate 10 NayYay
Generalized boolean operators.
This is useful for defining things that behave like booleans, e.g. predicates, or EDSL for predicates.
>>>Yay && NayNay>>>and1 $ Yay :| replicate 9 YayYay
There are also instances for these types lifted into IO and (->) a:
>>>(const Yay) && (const Nay) $ ()Nay>>>(const Yay) || (const Nay) $ ()Yay
Instances
| Boolean Bool | |
| Boolean bool => Boolean (IO bool) | |
| Boolean bool => Boolean (a -> bool) | |
| (Applicative f, Boolean bool) => Boolean (ApplicativeBoolean f bool) | |
Defined in Morley.Prelude.Boolean Methods (&&) :: ApplicativeBoolean f bool -> ApplicativeBoolean f bool -> ApplicativeBoolean f bool # (||) :: ApplicativeBoolean f bool -> ApplicativeBoolean f bool -> ApplicativeBoolean f bool # not :: ApplicativeBoolean f bool -> ApplicativeBoolean f bool # | |
class Boolean a => BooleanMonoid a where #
This is useful to complete the isomorphism between regular and generalized booleans. It's a separate class because not all boolean-like things form a monoid.
>>>or $ replicate 10 NayNay
Instances
| BooleanMonoid Bool | |
| BooleanMonoid bool => BooleanMonoid (IO bool) | |
| BooleanMonoid bool => BooleanMonoid (a -> bool) | |
Defined in Morley.Prelude.Boolean | |
| (Applicative f, BooleanMonoid bool) => BooleanMonoid (ApplicativeBoolean f bool) | |
Defined in Morley.Prelude.Boolean | |
A generalized version of All monoid wrapper.
>>>All Nay <> All NayAll {getAll = Nay}>>>All Yay <> All NayAll {getAll = Nay}>>>All Yay <> All YayAll {getAll = Yay}
Instances
| Data a => Data (All a) | |
Defined in Morley.Prelude.Boolean Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> All a -> c (All a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (All a) # dataTypeOf :: All a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (All a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (All a)) # gmapT :: (forall b. Data b => b -> b) -> All a -> All a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> All a -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> All a -> r # gmapQ :: (forall d. Data d => d -> u) -> All a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> All a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> All a -> m (All a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> All a -> m (All a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> All a -> m (All a) # | |
| BooleanMonoid a => Monoid (All a) | |
| Boolean a => Semigroup (All a) | |
| Bounded a => Bounded (All a) | |
| Enum a => Enum (All a) | |
Defined in Morley.Prelude.Boolean | |
| Generic (All a) | |
| Read a => Read (All a) | |
| Show a => Show (All a) | |
| Eq a => Eq (All a) | |
| Ord a => Ord (All a) | |
| type Rep (All a) | |
Defined in Morley.Prelude.Boolean | |
A generalized version of Any monoid wrapper.
>>>Any Nay <> Any NayAny {getAny = Nay}>>>Any Yay <> Any NayAny {getAny = Yay}>>>Any Yay <> Any YayAny {getAny = Yay}
Instances
| Data a => Data (Any a) | |
Defined in Morley.Prelude.Boolean Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Any a -> c (Any a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Any a) # dataTypeOf :: Any a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Any a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Any a)) # gmapT :: (forall b. Data b => b -> b) -> Any a -> Any a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Any a -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Any a -> r # gmapQ :: (forall d. Data d => d -> u) -> Any a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Any a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Any a -> m (Any a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Any a -> m (Any a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Any a -> m (Any a) # | |
| BooleanMonoid a => Monoid (Any a) | |
| Boolean a => Semigroup (Any a) | |
| Bounded a => Bounded (Any a) | |
| Enum a => Enum (Any a) | |
Defined in Morley.Prelude.Boolean | |
| Generic (Any a) | |
| Read a => Read (Any a) | |
| Show a => Show (Any a) | |
| Eq a => Eq (Any a) | |
| Ord a => Ord (Any a) | |
| type Rep (Any a) | |
Defined in Morley.Prelude.Boolean | |
newtype ApplicativeBoolean (f :: k -> Type) (bool :: k) #
A newtype for deriving a Boolean instance for any Applicative type
constructor using DerivingVia.
Constructors
| ApplicativeBoolean (f bool) |
Instances
pass :: Applicative f => f () #
Shorter alias for pure ().
>>>pass :: Maybe ()Just ()
someNE :: Alternative f => f a -> f (NonEmpty a) #
Similar to some, but reflects in types that a non-empty list
is returned.
($!) :: (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.
updateMVar' :: MonadIO m => MVar s -> StateT s IO a -> m a #
Like modifyMVar, but modification is specified as a State computation.
This method is strict in produced s value.
updateTVar' :: TVar s -> StateT s STM a -> STM a #
Like 'modifyTVar'', but modification is specified as a State monad.
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.
(?:) :: Maybe a -> a -> a infixr 0 #
Similar to fromMaybe but with flipped arguments.
>>>readMaybe "True" ?: FalseTrue
>>>readMaybe "Tru" ?: FalseFalse
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 #
whenLeft :: Applicative f => Either l r -> (l -> f ()) -> f () #
whenRight :: Applicative f => Either l r -> (r -> f ()) -> f () #
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.
hoistMaybe :: forall (m :: Type -> Type) a. Applicative m => Maybe a -> MaybeT m a #
hoistEither :: forall (m :: Type -> Type) e a. Applicative m => Either e a -> ExceptT e m a #
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 IntSet | |
| One MorleyLogsBuilder | |
| One Text | |
| One Text | |
| One (NonEmpty a) | |
| One (IntMap v) | |
| One (Seq a) | |
| One (Set v) | |
| Hashable v => One (HashSet v) | |
| One (Vector a) | |
| Prim a => One (Vector a) | |
| Storable a => One (Vector a) | |
| Unbox a => One (Vector a) | |
| One [a] | |
| One (Map k v) | |
| One (BigMap k v) | |
| n ~ 'S 'Z => One (SizedList' n a) | |
Defined in Morley.Util.SizedList Associated Types type OneItem (SizedList' n a) # Methods one :: OneItem (SizedList' n a) -> SizedList' n a # | |
| Hashable k => One (HashMap 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.
type Element t = ElementDefault t
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 #
notElem :: Element t -> t -> Bool #
find :: (Element t -> Bool) -> t -> Maybe (Element t) #
safeHead :: t -> Maybe (Element t) #
safeMaximum :: t -> Maybe (Element t) #
safeMinimum :: t -> Maybe (Element t) #
safeFoldr1 :: (Element t -> Element t -> Element t) -> t -> Maybe (Element t) #
safeFoldl1 :: (Element t -> Element t -> Element t) -> t -> Maybe (Element t) #
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 constructed from a list.
Minimal complete definition
Nothing
Methods
fromList :: [ListElement l] -> l #
Instances
type family ListElement l #
Instances
| type ListElement ByteString | |
Defined in Universum.Container.Class | |
| type ListElement ByteString | |
Defined in Universum.Container.Class | |
| type ListElement IntSet | |
Defined in Universum.Container.Class | |
| type ListElement Text | |
Defined in Universum.Container.Class | |
| type ListElement Text | |
Defined in Universum.Container.Class | |
| type ListElement (ZipList a) | |
Defined in Universum.Container.Class | |
| type ListElement (NonEmpty a) | |
Defined in Universum.Container.Class | |
| type ListElement (IntMap v) | |
Defined in Universum.Container.Class | |
| type ListElement (Seq a) | |
Defined in Universum.Container.Class | |
| type ListElement (Set a) | |
Defined in Universum.Container.Class | |
| type ListElement (SomeSizedList a) | |
Defined in Morley.Util.SizedList | |
| type ListElement (Vector a) | |
Defined in Universum.Container.Class | |
| type ListElement [a] | |
Defined in Universum.Container.Class | |
| type ListElement (Map k v) | |
Defined in Universum.Container.Class | |
| type ListElement (HashMap k v) | |
Defined in Universum.Container.Class | |
Instances
| type FromListC ByteString | |
Defined in Universum.Container.Class | |
| type FromListC ByteString | |
Defined in Universum.Container.Class | |
| type FromListC IntSet | |
Defined in Universum.Container.Class | |
| type FromListC Text | |
Defined in Universum.Container.Class | |
| type FromListC Text | |
Defined in Universum.Container.Class | |
| type FromListC (ZipList a) | |
Defined in Universum.Container.Class | |
| type FromListC (NonEmpty a) | |
Defined in Universum.Container.Class | |
| type FromListC (IntMap v) | |
Defined in Universum.Container.Class | |
| type FromListC (Seq a) | |
Defined in Universum.Container.Class | |
| type FromListC (Set a) | |
Defined in Universum.Container.Class | |
| type FromListC (SomeSizedList a) | |
Defined in Morley.Util.SizedList | |
| type FromListC (Vector a) | |
Defined in Universum.Container.Class | |
| type FromListC [a] | |
Defined in Universum.Container.Class type FromListC [a] = () | |
| type FromListC (Map k v) | |
Defined in Universum.Container.Class | |
| type FromListC (HashMap k v) | |
Defined in Universum.Container.Class | |
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.
foldl1 :: (a -> a -> a) -> NonEmpty a -> a #
A variant of foldl that has no base case, and thus may only be
applied to NonEmpty.
>>>foldl1 (+) (1 :| [2,3,4,5])15
foldr1 :: (a -> a -> a) -> NonEmpty a -> a #
A variant of foldr that has no base case, and thus may only be
applied to NonEmpty.
>>>foldr1 (+) (1 :| [2,3,4,5])15
minimumBy :: (a -> a -> Ordering) -> NonEmpty a -> a #
The least element of a NonEmpty with respect to the given
comparison function.
maximumBy :: (a -> a -> Ordering) -> NonEmpty a -> a #
The largest element of a NonEmpty with respect to the given
comparison function.
maximum :: Ord a => NonEmpty a -> a #
The largest element of a NonEmpty.
>>>maximum (1 :| [2,3,4,5])5
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
| Exception Bug | |
Defined in Universum.Exception Methods toException :: Bug -> SomeException # fromException :: SomeException -> Maybe Bug # displayException :: Bug -> String # | |
| Show Bug | |
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
| 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 # | |
| 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] # | |
| Generic Undefined | |
| Read Undefined | |
| Show Undefined | |
| Eq Undefined | |
| Ord 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 MText | |
Defined in Morley.Michelson.Text | |
| ToText Text | |
Defined in Universum.String.Conversion | |
| ToText Text | |
Defined in Universum.String.Conversion | |
| ToText String | |
Defined in Universum.String.Conversion | |
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 | |
lenientDecode :: OnDecodeError #
Replace an invalid input byte with the Unicode replacement character U+FFFD.
strictDecode :: OnDecodeError #
Throw a UnicodeException if decoding fails.
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.
data UnicodeException #
An exception type for representing Unicode encoding errors.
Instances
| Exception UnicodeException | |
Defined in Data.Text.Encoding.Error Methods toException :: UnicodeException -> SomeException # | |
| Show UnicodeException | |
Defined in Data.Text.Encoding.Error Methods showsPrec :: Int -> UnicodeException -> ShowS # show :: UnicodeException -> String # showList :: [UnicodeException] -> ShowS # | |
| NFData UnicodeException | |
Defined in Data.Text.Encoding.Error Methods rnf :: UnicodeException -> () # | |
| Eq UnicodeException | |
Defined in Data.Text.Encoding.Error Methods (==) :: UnicodeException -> UnicodeException -> Bool # (/=) :: UnicodeException -> UnicodeException -> Bool # | |
| type PrettyShow UnicodeException | |
Defined in Morley.Prelude.Show | |
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.
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.
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.0.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
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.)
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)
Arguments
| :: State s a | state-passing computation to execute |
| -> s | initial value |
| -> s | final state |
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 |
| -> a | return value of the state computation |
Arguments
| :: Reader r a | A |
| -> r | An initial environment. |
| -> a |
Runs a Reader and extracts the final value from it.
(The inverse of reader.)
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