| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
Termonad.Prelude
Synopsis
- seq :: a -> b -> b
- fst :: (a, b) -> a
- snd :: (a, b) -> b
- otherwise :: Bool
- assert :: Bool -> a -> a
- ($) :: (a -> b) -> a -> b
- fromIntegral :: (Integral a, Num b) => a -> b
- realToFrac :: (Real a, Fractional b) => a -> b
- guard :: Alternative f => Bool -> f ()
- join :: Monad m => m (m a) -> m a
- class Bounded a where
- class Enum a where
- succ :: a -> a
- pred :: a -> a
- toEnum :: Int -> a
- fromEnum :: a -> Int
- enumFrom :: a -> [a]
- enumFromThen :: a -> a -> [a]
- enumFromTo :: a -> a -> [a]
- enumFromThenTo :: a -> a -> a -> [a]
- class Eq a 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 (RealFrac a, Floating a) => RealFloat a where
- floatRadix :: a -> Integer
- floatDigits :: a -> Int
- floatRange :: a -> (Int, Int)
- decodeFloat :: a -> (Integer, Int)
- encodeFloat :: Integer -> Int -> a
- exponent :: a -> Int
- significand :: a -> a
- scaleFloat :: Int -> a -> a
- isNaN :: a -> Bool
- isInfinite :: a -> Bool
- isDenormalized :: a -> Bool
- isNegativeZero :: a -> Bool
- isIEEE :: a -> Bool
- atan2 :: a -> a -> a
- class (Real a, Fractional a) => RealFrac a where
- class Show a where
- class Typeable (a :: k)
- 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 Semigroup a where
- class Semigroup a => Monoid a where
- data Bool
- data Char
- data Double
- data Float
- data Int
- data Int32
- data Int64
- data Integer
- data Maybe a
- data Ordering
- type Rational = Ratio Integer
- data RealWorld :: Type
- data IO a
- data Word
- data Word8
- data Word32
- data Word64
- data Either a b
- data ByteString
- class NFData a where
- rnf :: a -> ()
- data Map k a
- not :: Bool -> Bool
- (||) :: Bool -> Bool -> Bool
- (&&) :: Bool -> Bool -> Bool
- error :: HasCallStack => [Char] -> a
- type String = [Char]
- class (Alternative m, Monad m) => MonadPlus (m :: Type -> Type) where
- class Applicative f => Alternative (f :: Type -> Type) where
- (=<<) :: Monad m => (a -> m b) -> m a -> m b
- when :: Applicative f => Bool -> f () -> f ()
- liftM :: Monad m => (a1 -> r) -> m a1 -> m r
- liftM2 :: Monad m => (a1 -> a2 -> r) -> m a1 -> m a2 -> m r
- ap :: Monad m => m (a -> b) -> m a -> m b
- const :: a -> b -> a
- flip :: (a -> b -> c) -> b -> a -> c
- ($!) :: (a -> b) -> a -> b
- until :: (a -> Bool) -> (a -> a) -> a -> a
- asTypeOf :: a -> a -> a
- subtract :: Num a => a -> a -> a
- curry :: ((a, b) -> c) -> a -> b -> c
- uncurry :: (a -> b -> c) -> (a, b) -> c
- maybe :: b -> (a -> b) -> Maybe a -> b
- isJust :: Maybe a -> Bool
- isNothing :: Maybe a -> Bool
- fromMaybe :: a -> Maybe a -> a
- maybeToList :: Maybe a -> [a]
- listToMaybe :: [a] -> Maybe a
- mapMaybe :: (a -> Maybe b) -> [a] -> [b]
- repeat :: a -> [a]
- even :: Integral a => a -> Bool
- odd :: Integral a => a -> Bool
- (^) :: (Num a, Integral b) => a -> b -> a
- (^^) :: (Fractional a, Integral b) => a -> b -> a
- (<$>) :: Functor f => (a -> b) -> f a -> f b
- void :: Functor f => f a -> f ()
- comparing :: Ord a => (b -> a) -> b -> b -> Ordering
- either :: (a -> c) -> (b -> c) -> Either a b -> c
- type IOError = IOException
- userError :: String -> IOError
- type FilePath = String
- ioError :: IOError -> IO a
- optional :: Alternative f => f a -> f (Maybe a)
- for :: (Traversable t, Applicative f) => t a -> (a -> f b) -> f (t b)
- unless :: Applicative f => Bool -> f () -> f ()
- class Monad m => MonadReader r (m :: Type -> Type) | m -> r where
- ask :: m r
- class Hashable a where
- hashWithSalt :: Int -> a -> Int
- hash :: a -> Int
- data Text
- data UTCTime = UTCTime {
- utctDay :: Day
- utctDayTime :: DiffTime
- data HashMap k v
- data Handle
- waitBothSTM :: Async a -> Async b -> STM (a, b)
- waitEitherSTM_ :: Async a -> Async b -> STM ()
- waitEitherSTM :: Async a -> Async b -> STM (Either a b)
- waitEitherCatchSTM :: Async a -> Async b -> STM (Either (Either SomeException a) (Either SomeException b))
- waitAnySTM :: [Async a] -> STM (Async a, a)
- waitAnyCatchSTM :: [Async a] -> STM (Async a, Either SomeException a)
- pollSTM :: Async a -> STM (Maybe (Either SomeException a))
- waitCatchSTM :: Async a -> STM (Either SomeException a)
- waitSTM :: Async a -> STM a
- data Async a
- data WrappedMonoid m
- data Chan a
- class Bifunctor (p :: Type -> Type -> Type) where
- class Monad m => MonadIO (m :: Type -> Type) where
- replicateM_ :: Applicative m => Int -> m a -> m ()
- forever :: Applicative f => f a -> f b
- (<=<) :: Monad m => (b -> m c) -> (a -> m b) -> a -> m c
- (>=>) :: Monad m => (a -> m b) -> (b -> m c) -> a -> m c
- forM :: (Traversable t, Monad m) => t a -> (a -> m b) -> m (t b)
- (***) :: Arrow a => a b c -> a b' c' -> a (b, b') (c, c')
- (&&&) :: Arrow a => a b c -> a b c' -> a b (c, c')
- newtype Identity a = Identity {
- runIdentity :: a
- stderr :: Handle
- stdin :: Handle
- annotateIOError :: IOError -> String -> Maybe Handle -> Maybe FilePath -> IOError
- modifyIOError :: (IOError -> IOError) -> IO a -> IO a
- ioeSetFileName :: IOError -> FilePath -> IOError
- ioeSetHandle :: IOError -> Handle -> IOError
- ioeSetLocation :: IOError -> String -> IOError
- ioeSetErrorString :: IOError -> String -> IOError
- ioeSetErrorType :: IOError -> IOErrorType -> IOError
- ioeGetFileName :: IOError -> Maybe FilePath
- ioeGetHandle :: IOError -> Maybe Handle
- ioeGetLocation :: IOError -> String
- ioeGetErrorString :: IOError -> String
- ioeGetErrorType :: IOError -> IOErrorType
- isUserErrorType :: IOErrorType -> Bool
- isPermissionErrorType :: IOErrorType -> Bool
- isIllegalOperationErrorType :: IOErrorType -> Bool
- isEOFErrorType :: IOErrorType -> Bool
- isFullErrorType :: IOErrorType -> Bool
- isAlreadyInUseErrorType :: IOErrorType -> Bool
- isDoesNotExistErrorType :: IOErrorType -> Bool
- isAlreadyExistsErrorType :: IOErrorType -> Bool
- userErrorType :: IOErrorType
- permissionErrorType :: IOErrorType
- illegalOperationErrorType :: IOErrorType
- eofErrorType :: IOErrorType
- fullErrorType :: IOErrorType
- alreadyInUseErrorType :: IOErrorType
- doesNotExistErrorType :: IOErrorType
- alreadyExistsErrorType :: IOErrorType
- isUserError :: IOError -> Bool
- isPermissionError :: IOError -> Bool
- isIllegalOperation :: IOError -> Bool
- isEOFError :: IOError -> Bool
- isFullError :: IOError -> Bool
- isAlreadyInUseError :: IOError -> Bool
- isDoesNotExistError :: IOError -> Bool
- isAlreadyExistsError :: IOError -> Bool
- mkIOError :: IOErrorType -> String -> Maybe Handle -> Maybe FilePath -> IOError
- tryIOError :: IO a -> IO (Either IOError a)
- writeTVar :: TVar a -> a -> STM ()
- readTVar :: TVar a -> STM a
- newTVar :: a -> STM (TVar a)
- data STM a
- data TVar a
- data SomeAsyncException where
- SomeAsyncException :: forall e. Exception e => e -> SomeAsyncException
- data IOErrorType
- stdout :: Handle
- data BufferMode
- data SeekMode
- data IORef a
- data IOException
- class (Typeable e, Show e) => Exception e where
- toException :: e -> SomeException
- fromException :: SomeException -> Maybe e
- displayException :: e -> String
- asum :: (Foldable t, Alternative f) => t (f a) -> f a
- partitionEithers :: [Either a b] -> ([a], [b])
- rights :: [Either a b] -> [b]
- lefts :: [Either a b] -> [a]
- newtype Down a = Down a
- asProxyTypeOf :: a -> proxy a -> a
- data Proxy (t :: k) :: forall k. k -> Type = Proxy
- data KProxy t = KProxy
- (.) :: Category cat => cat b c -> cat a b -> cat a c
- id :: Category cat => cat a a
- data IOMode
- class Storable a
- data STRef s a
- bool :: a -> a -> Bool -> a
- (&) :: a -> (a -> b) -> b
- on :: (b -> b -> c) -> (a -> b) -> a -> a -> c
- ($>) :: Functor f => f a -> b -> f b
- (<&>) :: Functor f => f a -> (a -> b) -> f b
- swap :: (a, b) -> (b, a)
- data MVar a
- liftM5 :: Monad m => (a1 -> a2 -> a3 -> a4 -> a5 -> r) -> m a1 -> m a2 -> m a3 -> m a4 -> m a5 -> m r
- liftM4 :: Monad m => (a1 -> a2 -> a3 -> a4 -> r) -> m a1 -> m a2 -> m a3 -> m a4 -> m r
- liftM3 :: Monad m => (a1 -> a2 -> a3 -> r) -> m a1 -> m a2 -> m a3 -> m r
- liftA3 :: Applicative f => (a -> b -> c -> d) -> f a -> f b -> f c -> f d
- liftA :: Applicative f => (a -> b) -> f a -> f b
- (<**>) :: Applicative f => f a -> f (a -> b) -> f b
- data SomeException where
- SomeException :: forall e. Exception e => e -> SomeException
- terror :: HasCallStack => Text -> a
- getArgs :: MonadIO m => m [Text]
- equating :: Eq a => (b -> a) -> b -> b -> Bool
- type LText = Text
- type LByteString = ByteString
- type UVector = Vector
- type SVector = Vector
- data Vector a
- class (Vector Vector a, MVector MVector a) => Unbox a
- data HashSet a
- (<.>) :: FilePath -> String -> FilePath
- (</>) :: FilePath -> FilePath -> FilePath
- data Set a
- data Seq a
- data IntSet
- data IntMap a
- zip :: Zip f => f a -> f b -> f (a, b)
- unzip :: Zip f => f (a, b) -> (f a, f b)
- zipWith :: Zip f => (a -> b -> c) -> f a -> f b -> f c
- unzip3 :: Zip3 f => f (a, b, c) -> (f a, f b, f c)
- zipWith3 :: Zip3 f => (a -> b -> c -> d) -> f a -> f b -> f c -> f d
- zip3 :: Zip3 f => f a -> f b -> f c -> f (a, b, c)
- zip4 :: Zip4 f => f a -> f b -> f c -> f d -> f (a, b, c, d)
- zipWith4 :: Zip4 f => (a -> b -> c -> d -> e) -> f a -> f b -> f c -> f d -> f e
- unzip4 :: Zip4 f => f (a, b, c, d) -> (f a, f b, f c, f d)
- zip5 :: Zip5 f => f a -> f b -> f c -> f d -> f e -> f (a, b, c, d, e)
- zipWith5 :: Zip5 f => (a -> b -> c -> d -> e -> g) -> f a -> f b -> f c -> f d -> f e -> f g
- unzip5 :: Zip5 f => f (a, b, c, d, e) -> (f a, f b, f c, f d, f e)
- zip6 :: Zip6 f => f a -> f b -> f c -> f d -> f e -> f g -> f (a, b, c, d, e, g)
- zipWith6 :: Zip6 f => (a -> b -> c -> d -> e -> g -> h) -> f a -> f b -> f c -> f d -> f e -> f g -> f h
- unzip6 :: Zip6 f => f (a, b, c, d, e, g) -> (f a, f b, f c, f d, f e, f g)
- zip7 :: Zip7 f => f a -> f b -> f c -> f d -> f e -> f g -> f h -> f (a, b, c, d, e, g, h)
- zipWith7 :: Zip7 f => (a -> b -> c -> d -> e -> g -> h -> i) -> f a -> f b -> f c -> f d -> f e -> f g -> f h -> f i
- unzip7 :: Zip7 f => f (a, b, c, d, e, g, h) -> (f a, f b, f c, f d, f e, f g, f h)
- textToBuilder :: ToBuilder Text builder => Text -> builder
- type TextBuilder = Builder
- type BlazeBuilder = Builder
- type ByteStringBuilder = Builder
- class Monoid builder => Builder builder lazy | builder -> lazy, lazy -> builder where
- builderToLazy :: builder -> lazy
- flushBuilder :: builder
- class ToBuilder value builder where
- toBuilder :: value -> builder
- newChan :: MonadIO m => m (Chan a)
- writeChan :: MonadIO m => Chan a -> a -> m ()
- readChan :: MonadIO m => Chan a -> m a
- dupChan :: MonadIO m => Chan a -> m (Chan a)
- getChanContents :: MonadIO m => Chan a -> m [a]
- writeList2Chan :: MonadIO m => Chan a -> [a] -> m ()
- data StringException = StringException String CallStack
- data AsyncExceptionWrapper where
- AsyncExceptionWrapper :: forall e. Exception e => e -> AsyncExceptionWrapper
- data SyncExceptionWrapper where
- SyncExceptionWrapper :: forall e. Exception e => e -> SyncExceptionWrapper
- data Handler (m :: Type -> Type) a where
- catch :: (MonadUnliftIO m, Exception e) => m a -> (e -> m a) -> m a
- catchIO :: MonadUnliftIO m => m a -> (IOException -> m a) -> m a
- catchAny :: MonadUnliftIO m => m a -> (SomeException -> m a) -> m a
- catchDeep :: (MonadUnliftIO m, Exception e, NFData a) => m a -> (e -> m a) -> m a
- catchAnyDeep :: (NFData a, MonadUnliftIO m) => m a -> (SomeException -> m a) -> m a
- catchJust :: (MonadUnliftIO m, Exception e) => (e -> Maybe b) -> m a -> (b -> m a) -> m a
- handle :: (MonadUnliftIO m, Exception e) => (e -> m a) -> m a -> m a
- handleIO :: MonadUnliftIO m => (IOException -> m a) -> m a -> m a
- handleAny :: MonadUnliftIO m => (SomeException -> m a) -> m a -> m a
- handleDeep :: (MonadUnliftIO m, Exception e, NFData a) => (e -> m a) -> m a -> m a
- handleAnyDeep :: (MonadUnliftIO m, NFData a) => (SomeException -> m a) -> m a -> m a
- handleJust :: (MonadUnliftIO m, Exception e) => (e -> Maybe b) -> (b -> m a) -> m a -> m a
- try :: (MonadUnliftIO m, Exception e) => m a -> m (Either e a)
- tryIO :: MonadUnliftIO m => m a -> m (Either IOException a)
- tryAny :: MonadUnliftIO m => m a -> m (Either SomeException a)
- tryDeep :: (MonadUnliftIO m, Exception e, NFData a) => m a -> m (Either e a)
- tryAnyDeep :: (MonadUnliftIO m, NFData a) => m a -> m (Either SomeException a)
- tryJust :: (MonadUnliftIO m, Exception e) => (e -> Maybe b) -> m a -> m (Either b a)
- pureTry :: a -> Either SomeException a
- pureTryDeep :: NFData a => a -> Either SomeException a
- catches :: MonadUnliftIO m => m a -> [Handler m a] -> m a
- catchesDeep :: (MonadUnliftIO m, NFData a) => m a -> [Handler m a] -> m a
- evaluate :: MonadIO m => a -> m a
- evaluateDeep :: (MonadIO m, NFData a) => a -> m a
- bracket :: MonadUnliftIO m => m a -> (a -> m b) -> (a -> m c) -> m c
- bracket_ :: MonadUnliftIO m => m a -> m b -> m c -> m c
- bracketOnError :: MonadUnliftIO m => m a -> (a -> m b) -> (a -> m c) -> m c
- bracketOnError_ :: MonadUnliftIO m => m a -> m b -> m c -> m c
- finally :: MonadUnliftIO m => m a -> m b -> m a
- withException :: (MonadUnliftIO m, Exception e) => m a -> (e -> m b) -> m a
- onException :: MonadUnliftIO m => m a -> m b -> m a
- throwIO :: (MonadIO m, Exception e) => e -> m a
- toSyncException :: Exception e => e -> SomeException
- toAsyncException :: Exception e => e -> SomeException
- isSyncException :: Exception e => e -> Bool
- isAsyncException :: Exception e => e -> Bool
- mask :: MonadUnliftIO m => ((forall a. m a -> m a) -> m b) -> m b
- uninterruptibleMask :: MonadUnliftIO m => ((forall a. m a -> m a) -> m b) -> m b
- mask_ :: MonadUnliftIO m => m a -> m a
- uninterruptibleMask_ :: MonadUnliftIO m => m a -> m a
- throwString :: (MonadIO m, HasCallStack) => String -> m a
- stringException :: HasCallStack -> String -> StringException
- throwTo :: (Exception e, MonadIO m) => ThreadId -> e -> m ()
- impureThrow :: Exception e => e -> a
- fromEither :: (Exception e, MonadIO m) => Either e a -> m a
- fromEitherIO :: (Exception e, MonadIO m) => IO (Either e a) -> m a
- fromEitherM :: (Exception e, MonadIO m) => m (Either e a) -> m a
- withFile :: MonadUnliftIO m => FilePath -> IOMode -> (Handle -> m a) -> m a
- withBinaryFile :: MonadUnliftIO m => FilePath -> IOMode -> (Handle -> m a) -> m a
- hClose :: MonadIO m => Handle -> m ()
- hFlush :: MonadIO m => Handle -> m ()
- hFileSize :: MonadIO m => Handle -> m Integer
- hSetFileSize :: MonadIO m => Handle -> Integer -> m ()
- hIsEOF :: MonadIO m => Handle -> m Bool
- hSetBuffering :: MonadIO m => Handle -> BufferMode -> m ()
- hGetBuffering :: MonadIO m => Handle -> m BufferMode
- hSeek :: MonadIO m => Handle -> SeekMode -> Integer -> m ()
- hTell :: MonadIO m => Handle -> m Integer
- hIsOpen :: MonadIO m => Handle -> m Bool
- hIsClosed :: MonadIO m => Handle -> m Bool
- hIsReadable :: MonadIO m => Handle -> m Bool
- hIsWritable :: MonadIO m => Handle -> m Bool
- hIsSeekable :: MonadIO m => Handle -> m Bool
- hIsTerminalDevice :: MonadIO m => Handle -> m Bool
- hSetEcho :: MonadIO m => Handle -> Bool -> m ()
- hGetEcho :: MonadIO m => Handle -> m Bool
- hWaitForInput :: MonadIO m => Handle -> Int -> m Bool
- hReady :: MonadIO m => Handle -> m Bool
- getMonotonicTime :: MonadIO m => m Double
- 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 ()
- mkWeakIORef :: MonadUnliftIO m => IORef a -> m () -> m (Weak (IORef a))
- data ConcException = EmptyWithNoAlternative
- data Conc (m :: Type -> Type) a
- newtype Concurrently (m :: Type -> Type) a = Concurrently {
- runConcurrently :: m a
- async :: MonadUnliftIO m => m a -> m (Async a)
- asyncBound :: MonadUnliftIO m => m a -> m (Async a)
- asyncOn :: MonadUnliftIO m => Int -> m a -> m (Async a)
- asyncWithUnmask :: MonadUnliftIO m => ((forall b. m b -> m b) -> m a) -> m (Async a)
- asyncOnWithUnmask :: MonadUnliftIO m => Int -> ((forall b. m b -> m b) -> m a) -> m (Async a)
- withAsync :: MonadUnliftIO m => m a -> (Async a -> m b) -> m b
- withAsyncBound :: MonadUnliftIO m => m a -> (Async a -> m b) -> m b
- withAsyncOn :: MonadUnliftIO m => Int -> m a -> (Async a -> m b) -> m b
- withAsyncWithUnmask :: MonadUnliftIO m => ((forall c. m c -> m c) -> m a) -> (Async a -> m b) -> m b
- withAsyncOnWithUnmask :: MonadUnliftIO m => Int -> ((forall c. m c -> m c) -> m a) -> (Async a -> m b) -> m b
- wait :: MonadIO m => Async a -> m a
- poll :: MonadIO m => Async a -> m (Maybe (Either SomeException a))
- waitCatch :: MonadIO m => Async a -> m (Either SomeException a)
- cancel :: MonadIO m => Async a -> m ()
- uninterruptibleCancel :: MonadIO m => Async a -> m ()
- cancelWith :: (Exception e, MonadIO m) => Async a -> e -> m ()
- waitAny :: MonadIO m => [Async a] -> m (Async a, a)
- waitAnyCatch :: MonadIO m => [Async a] -> m (Async a, Either SomeException a)
- waitAnyCancel :: MonadIO m => [Async a] -> m (Async a, a)
- waitAnyCatchCancel :: MonadIO m => [Async a] -> m (Async a, Either SomeException a)
- waitEither :: MonadIO m => Async a -> Async b -> m (Either a b)
- waitEitherCatch :: MonadIO m => Async a -> Async b -> m (Either (Either SomeException a) (Either SomeException b))
- waitEitherCancel :: MonadIO m => Async a -> Async b -> m (Either a b)
- waitEitherCatchCancel :: MonadIO m => Async a -> Async b -> m (Either (Either SomeException a) (Either SomeException b))
- waitEither_ :: MonadIO m => Async a -> Async b -> m ()
- waitBoth :: MonadIO m => Async a -> Async b -> m (a, b)
- link :: MonadIO m => Async a -> m ()
- link2 :: MonadIO m => Async a -> Async b -> m ()
- race :: MonadUnliftIO m => m a -> m b -> m (Either a b)
- race_ :: MonadUnliftIO m => m a -> m b -> m ()
- concurrently :: MonadUnliftIO m => m a -> m b -> m (a, b)
- concurrently_ :: MonadUnliftIO m => m a -> m b -> m ()
- forConcurrently :: (MonadUnliftIO m, Traversable t) => t a -> (a -> m b) -> m (t b)
- forConcurrently_ :: (MonadUnliftIO m, Foldable f) => f a -> (a -> m b) -> m ()
- replicateConcurrently :: MonadUnliftIO m => Int -> m b -> m [b]
- replicateConcurrently_ :: (Applicative m, MonadUnliftIO m) => Int -> m a -> m ()
- mapConcurrently :: (MonadUnliftIO m, Traversable t) => (a -> m b) -> t a -> m (t b)
- mapConcurrently_ :: (MonadUnliftIO m, Foldable f) => (a -> m b) -> f a -> m ()
- conc :: m a -> Conc m a
- runConc :: MonadUnliftIO m => Conc m a -> m a
- pooledMapConcurrentlyN :: (MonadUnliftIO m, Traversable t) => Int -> (a -> m b) -> t a -> m (t b)
- pooledMapConcurrently :: (MonadUnliftIO m, Traversable t) => (a -> m b) -> t a -> m (t b)
- pooledForConcurrentlyN :: (MonadUnliftIO m, Traversable t) => Int -> t a -> (a -> m b) -> m (t b)
- pooledForConcurrently :: (MonadUnliftIO m, Traversable t) => t a -> (a -> m b) -> m (t b)
- pooledMapConcurrentlyN_ :: (MonadUnliftIO m, Foldable f) => Int -> (a -> m b) -> f a -> m ()
- pooledMapConcurrently_ :: (MonadUnliftIO m, Foldable f) => (a -> m b) -> f a -> m ()
- pooledForConcurrently_ :: (MonadUnliftIO m, Foldable f) => f a -> (a -> m b) -> m ()
- pooledForConcurrentlyN_ :: (MonadUnliftIO m, Foldable t) => Int -> t a -> (a -> m b) -> m ()
- pooledReplicateConcurrentlyN :: MonadUnliftIO m => Int -> Int -> m a -> m [a]
- pooledReplicateConcurrently :: MonadUnliftIO m => Int -> m a -> m [a]
- pooledReplicateConcurrentlyN_ :: MonadUnliftIO m => Int -> Int -> m a -> m ()
- pooledReplicateConcurrently_ :: MonadUnliftIO m => Int -> m a -> m ()
- newEmptyMVar :: MonadIO m => m (MVar a)
- newMVar :: MonadIO m => a -> m (MVar a)
- takeMVar :: MonadIO m => MVar a -> m a
- putMVar :: MonadIO m => MVar a -> a -> m ()
- readMVar :: MonadIO m => MVar a -> m a
- swapMVar :: MonadIO m => MVar a -> a -> m a
- tryTakeMVar :: MonadIO m => MVar a -> m (Maybe a)
- tryPutMVar :: MonadIO m => MVar a -> a -> m Bool
- isEmptyMVar :: MonadIO m => MVar a -> m Bool
- tryReadMVar :: MonadIO m => MVar a -> m (Maybe a)
- withMVar :: MonadUnliftIO m => MVar a -> (a -> m b) -> m b
- withMVarMasked :: MonadUnliftIO m => MVar a -> (a -> m b) -> m b
- modifyMVar_ :: MonadUnliftIO m => MVar a -> (a -> m a) -> m ()
- modifyMVar :: MonadUnliftIO m => MVar a -> (a -> m (a, b)) -> m b
- modifyMVarMasked_ :: MonadUnliftIO m => MVar a -> (a -> m a) -> m ()
- modifyMVarMasked :: MonadUnliftIO m => MVar a -> (a -> m (a, b)) -> m b
- mkWeakMVar :: MonadUnliftIO m => MVar a -> m () -> m (Weak (MVar a))
- data Memoized a
- runMemoized :: MonadIO m => Memoized a -> m a
- memoizeRef :: MonadUnliftIO m => m a -> m (Memoized a)
- memoizeMVar :: MonadUnliftIO m => m a -> m (Memoized a)
- atomically :: MonadIO m => STM a -> m a
- retrySTM :: STM a
- checkSTM :: Bool -> STM ()
- newTVarIO :: MonadIO m => a -> m (TVar a)
- readTVarIO :: MonadIO m => TVar a -> m a
- registerDelay :: MonadIO m => Int -> m (TVar Bool)
- mkWeakTVar :: MonadUnliftIO m => TVar a -> m () -> m (Weak (TVar a))
- newTMVarIO :: MonadIO m => a -> m (TMVar a)
- newEmptyTMVarIO :: MonadIO m => m (TMVar a)
- mkWeakTMVar :: MonadUnliftIO m => TMVar a -> m () -> m (Weak (TMVar a))
- newTChanIO :: MonadIO m => m (TChan a)
- newBroadcastTChanIO :: MonadIO m => m (TChan a)
- newTQueueIO :: MonadIO m => m (TQueue a)
- newTBQueueIO :: MonadIO m => Natural -> m (TBQueue a)
- withSystemTempFile :: MonadUnliftIO m => String -> (FilePath -> Handle -> m a) -> m a
- withSystemTempDirectory :: MonadUnliftIO m => String -> (FilePath -> m a) -> m a
- withTempFile :: MonadUnliftIO m => FilePath -> String -> (FilePath -> Handle -> m a) -> m a
- withTempDirectory :: MonadUnliftIO m => FilePath -> String -> (FilePath -> m a) -> m a
- timeout :: MonadUnliftIO m => Int -> m a -> m (Maybe a)
- wrappedWithRunInIO :: MonadUnliftIO n => (n b -> m b) -> (forall a. m a -> n a) -> ((forall a. m a -> IO a) -> IO b) -> m b
- toIO :: MonadUnliftIO m => m a -> m (IO a)
- withUnliftIO :: MonadUnliftIO m => (UnliftIO m -> IO a) -> m a
- askRunInIO :: MonadUnliftIO m => m (m a -> IO a)
- newtype UnliftIO (m :: Type -> Type) = UnliftIO {}
- class MonadIO m => MonadUnliftIO (m :: Type -> Type) where
- askUnliftIO :: m (UnliftIO m)
- withRunInIO :: ((forall a. m a -> IO a) -> IO b) -> m b
- data TBChan a
- newTBChan :: Int -> STM (TBChan a)
- newTBChanIO :: Int -> IO (TBChan a)
- readTBChan :: TBChan a -> STM a
- tryReadTBChan :: TBChan a -> STM (Maybe a)
- peekTBChan :: TBChan a -> STM a
- tryPeekTBChan :: TBChan a -> STM (Maybe a)
- writeTBChan :: TBChan a -> a -> STM ()
- tryWriteTBChan :: TBChan a -> a -> STM Bool
- unGetTBChan :: TBChan a -> a -> STM ()
- isEmptyTBChan :: TBChan a -> STM Bool
- isFullTBChan :: TBChan a -> STM Bool
- estimateFreeSlotsTBChan :: TBChan a -> STM Int
- freeSlotsTBChan :: TBChan a -> STM Int
- data TBMChan a
- newTBMChan :: Int -> STM (TBMChan a)
- newTBMChanIO :: Int -> IO (TBMChan a)
- readTBMChan :: TBMChan a -> STM (Maybe a)
- tryReadTBMChan :: TBMChan a -> STM (Maybe (Maybe a))
- peekTBMChan :: TBMChan a -> STM (Maybe a)
- tryPeekTBMChan :: TBMChan a -> STM (Maybe (Maybe a))
- writeTBMChan :: TBMChan a -> a -> STM ()
- tryWriteTBMChan :: TBMChan a -> a -> STM (Maybe Bool)
- unGetTBMChan :: TBMChan a -> a -> STM ()
- closeTBMChan :: TBMChan a -> STM ()
- isClosedTBMChan :: TBMChan a -> STM Bool
- isEmptyTBMChan :: TBMChan a -> STM Bool
- isFullTBMChan :: TBMChan a -> STM Bool
- estimateFreeSlotsTBMChan :: TBMChan a -> STM Int
- freeSlotsTBMChan :: TBMChan a -> STM Int
- data TBMQueue a
- newTBMQueue :: Int -> STM (TBMQueue a)
- newTBMQueueIO :: Int -> IO (TBMQueue a)
- readTBMQueue :: TBMQueue a -> STM (Maybe a)
- tryReadTBMQueue :: TBMQueue a -> STM (Maybe (Maybe a))
- peekTBMQueue :: TBMQueue a -> STM (Maybe a)
- tryPeekTBMQueue :: TBMQueue a -> STM (Maybe (Maybe a))
- writeTBMQueue :: TBMQueue a -> a -> STM ()
- tryWriteTBMQueue :: TBMQueue a -> a -> STM (Maybe Bool)
- unGetTBMQueue :: TBMQueue a -> a -> STM ()
- closeTBMQueue :: TBMQueue a -> STM ()
- isClosedTBMQueue :: TBMQueue a -> STM Bool
- isEmptyTBMQueue :: TBMQueue a -> STM Bool
- isFullTBMQueue :: TBMQueue a -> STM Bool
- estimateFreeSlotsTBMQueue :: TBMQueue a -> STM Int
- freeSlotsTBMQueue :: TBMQueue a -> STM Int
- data TMChan a
- newTMChan :: STM (TMChan a)
- newTMChanIO :: IO (TMChan a)
- newBroadcastTMChan :: STM (TMChan a)
- newBroadcastTMChanIO :: IO (TMChan a)
- dupTMChan :: TMChan a -> STM (TMChan a)
- readTMChan :: TMChan a -> STM (Maybe a)
- tryReadTMChan :: TMChan a -> STM (Maybe (Maybe a))
- peekTMChan :: TMChan a -> STM (Maybe a)
- tryPeekTMChan :: TMChan a -> STM (Maybe (Maybe a))
- writeTMChan :: TMChan a -> a -> STM ()
- unGetTMChan :: TMChan a -> a -> STM ()
- closeTMChan :: TMChan a -> STM ()
- isClosedTMChan :: TMChan a -> STM Bool
- isEmptyTMChan :: TMChan a -> STM Bool
- data TMQueue a
- newTMQueue :: STM (TMQueue a)
- newTMQueueIO :: IO (TMQueue a)
- readTMQueue :: TMQueue a -> STM (Maybe a)
- tryReadTMQueue :: TMQueue a -> STM (Maybe (Maybe a))
- peekTMQueue :: TMQueue a -> STM (Maybe a)
- tryPeekTMQueue :: TMQueue a -> STM (Maybe (Maybe a))
- writeTMQueue :: TMQueue a -> a -> STM ()
- unGetTMQueue :: TMQueue a -> a -> STM ()
- closeTMQueue :: TMQueue a -> STM ()
- isClosedTMQueue :: TMQueue a -> STM Bool
- isEmptyTMQueue :: TMQueue a -> STM Bool
- data TBQueue a
- newTBQueue :: Natural -> STM (TBQueue a)
- writeTBQueue :: TBQueue a -> a -> STM ()
- readTBQueue :: TBQueue a -> STM a
- tryReadTBQueue :: TBQueue a -> STM (Maybe a)
- peekTBQueue :: TBQueue a -> STM a
- tryPeekTBQueue :: TBQueue a -> STM (Maybe a)
- unGetTBQueue :: TBQueue a -> a -> STM ()
- isEmptyTBQueue :: TBQueue a -> STM Bool
- isFullTBQueue :: TBQueue a -> STM Bool
- data TChan a
- newTChan :: STM (TChan a)
- newBroadcastTChan :: STM (TChan a)
- writeTChan :: TChan a -> a -> STM ()
- readTChan :: TChan a -> STM a
- tryReadTChan :: TChan a -> STM (Maybe a)
- peekTChan :: TChan a -> STM a
- tryPeekTChan :: TChan a -> STM (Maybe a)
- dupTChan :: TChan a -> STM (TChan a)
- unGetTChan :: TChan a -> a -> STM ()
- isEmptyTChan :: TChan a -> STM Bool
- cloneTChan :: TChan a -> STM (TChan a)
- data TMVar a
- newTMVar :: a -> STM (TMVar a)
- newEmptyTMVar :: STM (TMVar a)
- takeTMVar :: TMVar a -> STM a
- tryTakeTMVar :: TMVar a -> STM (Maybe a)
- putTMVar :: TMVar a -> a -> STM ()
- tryPutTMVar :: TMVar a -> a -> STM Bool
- readTMVar :: TMVar a -> STM a
- tryReadTMVar :: TMVar a -> STM (Maybe a)
- swapTMVar :: TMVar a -> a -> STM a
- isEmptyTMVar :: TMVar a -> STM Bool
- data TQueue a
- newTQueue :: STM (TQueue a)
- writeTQueue :: TQueue a -> a -> STM ()
- readTQueue :: TQueue a -> STM a
- tryReadTQueue :: TQueue a -> STM (Maybe a)
- peekTQueue :: TQueue a -> STM a
- tryPeekTQueue :: TQueue a -> STM (Maybe a)
- unGetTQueue :: TQueue a -> a -> STM ()
- isEmptyTQueue :: TQueue a -> STM Bool
- modifyTVar :: TVar a -> (a -> a) -> STM ()
- modifyTVar' :: TVar a -> (a -> a) -> STM ()
- swapTVar :: TVar a -> a -> STM a
- say :: MonadIO m => Text -> m ()
- sayString :: MonadIO m => String -> m ()
- sayShow :: (MonadIO m, Show a) => a -> m ()
- sayErr :: MonadIO m => Text -> m ()
- sayErrString :: MonadIO m => String -> m ()
- sayErrShow :: (MonadIO m, Show a) => a -> m ()
- hSay :: MonadIO m => Handle -> Text -> m ()
- hSayString :: MonadIO m => Handle -> String -> m ()
- hSayShow :: (MonadIO m, Show a) => Handle -> a -> m ()
- newMutVar :: PrimMonad m => a -> m (MutVar (PrimState m) a)
- readMutVar :: PrimMonad m => MutVar (PrimState m) a -> m a
- writeMutVar :: PrimMonad m => MutVar (PrimState m) a -> a -> m ()
- atomicModifyMutVar :: PrimMonad m => MutVar (PrimState m) a -> (a -> (a, b)) -> m b
- atomicModifyMutVar' :: PrimMonad m => MutVar (PrimState m) a -> (a -> (a, b)) -> m b
- modifyMutVar :: PrimMonad m => MutVar (PrimState m) a -> (a -> a) -> m ()
- modifyMutVar' :: PrimMonad m => MutVar (PrimState m) a -> (a -> a) -> m ()
- class Prim a
- data MutVar s a = MutVar (MutVar# s a)
- class Monad m => PrimMonad (m :: Type -> Type) where
- type MutableDeque c = (MutableQueue c, MutablePushFront c, MutablePopBack c)
- type MutableStack c = (MutablePopFront c, MutablePushFront c)
- type MutableQueue c = (MutablePopFront c, MutablePushBack c)
- class MutableCollection c => MutablePushBack c where
- pushBack :: (PrimMonad m, PrimState m ~ MCState c) => c -> CollElement c -> m ()
- class MutableCollection c => MutablePopBack c where
- class MutableCollection c => MutablePushFront c where
- pushFront :: (PrimMonad m, PrimState m ~ MCState c) => c -> CollElement c -> m ()
- class MutableCollection c => MutablePopFront c where
- class MutableContainer c => MutableCollection c where
- class MutableRef c => MutableAtomicRef c where
- atomicModifyRef :: (PrimMonad m, PrimState m ~ MCState c) => c -> (RefElement c -> (RefElement c, a)) -> m a
- atomicModifyRef' :: (PrimMonad m, PrimState m ~ MCState c) => c -> (RefElement c -> (RefElement c, a)) -> m a
- class MutableContainer c => MutableRef c where
- type RefElement c :: Type
- newRef :: (PrimMonad m, PrimState m ~ MCState c) => RefElement c -> m c
- readRef :: (PrimMonad m, PrimState m ~ MCState c) => c -> m (RefElement c)
- writeRef :: (PrimMonad m, PrimState m ~ MCState c) => c -> RefElement c -> m ()
- modifyRef :: (PrimMonad m, PrimState m ~ MCState c) => c -> (RefElement c -> RefElement c) -> m ()
- modifyRef' :: (PrimMonad m, PrimState m ~ MCState c) => c -> (RefElement c -> RefElement c) -> m ()
- class MutableContainer c where
- asIORef :: IORef a -> IORef a
- asSTRef :: STRef s a -> STRef s a
- asMutVar :: MutVar s a -> MutVar s a
- type IOBRef = BRef (PrimState IO)
- data BRef s a
- asBRef :: BRef s a -> BRef s a
- data DLList s a
- asDLList :: DLList s a -> DLList s a
- type BDeque = Deque MVector
- type SDeque = Deque MVector
- type UDeque = Deque MVector
- data Deque (v :: Type -> Type -> Type) s a
- asUDeque :: UDeque s a -> UDeque s a
- asSDeque :: SDeque s a -> SDeque s a
- asBDeque :: BDeque s a -> BDeque s a
- type IOPRef = PRef (PrimState IO)
- data PRef s a
- asPRef :: PRef s a -> PRef s a
- type IOSRef = SRef (PrimState IO)
- data SRef s a
- asSRef :: SRef s a -> SRef s a
- type IOURef = URef (PrimState IO)
- data URef s a
- asURef :: URef s a -> URef s a
- class MonoFoldable mono => GrowingAppend mono
- class MonoFunctor mono => MonoComonad mono where
- class MonoPointed mono where
- class (MonoFunctor mono, MonoFoldable mono) => MonoTraversable mono where
- otraverse :: Applicative f => (Element mono -> f (Element mono)) -> mono -> f mono
- omapM :: Applicative m => (Element mono -> m (Element mono)) -> mono -> m mono
- class MonoFoldable mono where
- ofoldMap :: Monoid m => (Element mono -> m) -> mono -> m
- ofoldr :: (Element mono -> b -> b) -> b -> mono -> b
- ofoldl' :: (a -> Element mono -> a) -> a -> mono -> a
- otoList :: mono -> [Element mono]
- oall :: (Element mono -> Bool) -> mono -> Bool
- oany :: (Element mono -> Bool) -> mono -> Bool
- onull :: mono -> Bool
- olength :: mono -> Int
- olength64 :: mono -> Int64
- ocompareLength :: Integral i => mono -> i -> Ordering
- otraverse_ :: Applicative f => (Element mono -> f b) -> mono -> f ()
- ofor_ :: Applicative f => mono -> (Element mono -> f b) -> f ()
- omapM_ :: Applicative m => (Element mono -> m ()) -> mono -> m ()
- oforM_ :: Applicative m => mono -> (Element mono -> m ()) -> m ()
- ofoldlM :: Monad m => (a -> Element mono -> m a) -> a -> mono -> m a
- ofoldMap1Ex :: Semigroup m => (Element mono -> m) -> mono -> m
- ofoldr1Ex :: (Element mono -> Element mono -> Element mono) -> mono -> Element mono
- ofoldl1Ex' :: (Element mono -> Element mono -> Element mono) -> mono -> Element mono
- headEx :: mono -> Element mono
- lastEx :: mono -> Element mono
- unsafeHead :: mono -> Element mono
- unsafeLast :: mono -> Element mono
- maximumByEx :: (Element mono -> Element mono -> Ordering) -> mono -> Element mono
- minimumByEx :: (Element mono -> Element mono -> Ordering) -> mono -> Element mono
- oelem :: Element mono -> mono -> Bool
- onotElem :: Element mono -> mono -> Bool
- class MonoFunctor mono where
- type family Element mono :: Type
- replaceElem :: (MonoFunctor mono, Eq (Element mono)) => Element mono -> Element mono -> mono -> mono
- replaceElemStrictText :: Char -> Char -> Text -> Text
- replaceElemLazyText :: Char -> Char -> Text -> Text
- headMay :: MonoFoldable mono => mono -> Maybe (Element mono)
- lastMay :: MonoFoldable mono => mono -> Maybe (Element mono)
- osum :: (MonoFoldable mono, Num (Element mono)) => mono -> Element mono
- oproduct :: (MonoFoldable mono, Num (Element mono)) => mono -> Element mono
- oand :: (Element mono ~ Bool, MonoFoldable mono) => mono -> Bool
- oor :: (Element mono ~ Bool, MonoFoldable mono) => mono -> Bool
- oconcatMap :: (MonoFoldable mono, Monoid m) => (Element mono -> m) -> mono -> m
- ofold :: (MonoFoldable mono, Monoid (Element mono)) => mono -> Element mono
- oconcat :: (MonoFoldable mono, Monoid (Element mono)) => mono -> Element mono
- ofoldM :: (MonoFoldable mono, Monad m) => (a -> Element mono -> m a) -> a -> mono -> m a
- osequence_ :: (Applicative m, MonoFoldable mono, Element mono ~ m ()) => mono -> m ()
- maximumEx :: (MonoFoldable mono, Ord (Element mono)) => mono -> Element mono
- minimumEx :: (MonoFoldable mono, Ord (Element mono)) => mono -> Element mono
- maximumMay :: (MonoFoldable mono, Ord (Element mono)) => mono -> Maybe (Element mono)
- maximumByMay :: MonoFoldable mono => (Element mono -> Element mono -> Ordering) -> mono -> Maybe (Element mono)
- minimumMay :: (MonoFoldable mono, Ord (Element mono)) => mono -> Maybe (Element mono)
- minimumByMay :: MonoFoldable mono => (Element mono -> Element mono -> Ordering) -> mono -> Maybe (Element mono)
- ofor :: (MonoTraversable mono, Applicative f) => mono -> (Element mono -> f (Element mono)) -> f mono
- oforM :: (MonoTraversable mono, Applicative f) => mono -> (Element mono -> f (Element mono)) -> f mono
- ofoldlUnwrap :: MonoFoldable mono => (x -> Element mono -> x) -> x -> (x -> b) -> mono -> b
- ofoldMUnwrap :: (Monad m, MonoFoldable mono) => (x -> Element mono -> m x) -> m x -> (x -> m b) -> mono -> m b
- ointercalate :: (MonoFoldable mono, Monoid (Element mono)) => Element mono -> mono -> Element mono
- class SetContainer set => HasKeysSet set where
- class MonoFunctor mono => MonoZip mono where
- class (SetContainer set, Element set ~ ContainerKey set) => IsSet set where
- insertSet :: Element set -> set -> set
- deleteSet :: Element set -> set -> set
- singletonSet :: Element set -> set
- setFromList :: [Element set] -> set
- setToList :: set -> [Element set]
- class (MonoTraversable map, SetContainer map) => IsMap map where
- type MapValue map :: Type
- lookup :: ContainerKey map -> map -> Maybe (MapValue map)
- insertMap :: ContainerKey map -> MapValue map -> map -> map
- deleteMap :: ContainerKey map -> map -> map
- singletonMap :: ContainerKey map -> MapValue map -> map
- mapFromList :: [(ContainerKey map, MapValue map)] -> map
- mapToList :: map -> [(ContainerKey map, MapValue map)]
- findWithDefault :: MapValue map -> ContainerKey map -> map -> MapValue map
- insertWith :: (MapValue map -> MapValue map -> MapValue map) -> ContainerKey map -> MapValue map -> map -> map
- insertWithKey :: (ContainerKey map -> MapValue map -> MapValue map -> MapValue map) -> ContainerKey map -> MapValue map -> map -> map
- insertLookupWithKey :: (ContainerKey map -> MapValue map -> MapValue map -> MapValue map) -> ContainerKey map -> MapValue map -> map -> (Maybe (MapValue map), map)
- adjustMap :: (MapValue map -> MapValue map) -> ContainerKey map -> map -> map
- adjustWithKey :: (ContainerKey map -> MapValue map -> MapValue map) -> ContainerKey map -> map -> map
- updateMap :: (MapValue map -> Maybe (MapValue map)) -> ContainerKey map -> map -> map
- updateWithKey :: (ContainerKey map -> MapValue map -> Maybe (MapValue map)) -> ContainerKey map -> map -> map
- updateLookupWithKey :: (ContainerKey map -> MapValue map -> Maybe (MapValue map)) -> ContainerKey map -> map -> (Maybe (MapValue map), map)
- alterMap :: (Maybe (MapValue map) -> Maybe (MapValue map)) -> ContainerKey map -> map -> map
- unionWith :: (MapValue map -> MapValue map -> MapValue map) -> map -> map -> map
- unionWithKey :: (ContainerKey map -> MapValue map -> MapValue map -> MapValue map) -> map -> map -> map
- unionsWith :: (MapValue map -> MapValue map -> MapValue map) -> [map] -> map
- mapWithKey :: (ContainerKey map -> MapValue map -> MapValue map) -> map -> map
- omapKeysWith :: (MapValue map -> MapValue map -> MapValue map) -> (ContainerKey map -> ContainerKey map) -> map -> map
- filterMap :: (MapValue map -> Bool) -> map -> map
- class BiPolyMap (map :: Type -> Type -> Type) where
- type BPMKeyConstraint (map :: Type -> Type -> Type) key :: Constraint
- mapKeysWith :: (BPMKeyConstraint map k1, BPMKeyConstraint map k2) => (v -> v -> v) -> (k1 -> k2) -> map k1 v -> map k2 v
- class PolyMap (map :: Type -> Type) where
- differenceMap :: map value1 -> map value2 -> map value1
- intersectionMap :: map value1 -> map value2 -> map value1
- intersectionWithMap :: (value1 -> value2 -> value3) -> map value1 -> map value2 -> map value3
- class (Monoid set, Semigroup set, MonoFoldable set, Eq (ContainerKey set), GrowingAppend set) => SetContainer set where
- type ContainerKey set :: Type
- member :: ContainerKey set -> set -> Bool
- notMember :: ContainerKey set -> set -> Bool
- union :: set -> set -> set
- unions :: (MonoFoldable mono, Element mono ~ set) => mono -> set
- difference :: set -> set -> set
- intersection :: set -> set -> set
- keys :: set -> [ContainerKey set]
- foldMap :: (MonoFoldable mono, Monoid m) => (Element mono -> m) -> mono -> m
- foldr :: MonoFoldable mono => (Element mono -> b -> b) -> b -> mono -> b
- foldl' :: MonoFoldable mono => (a -> Element mono -> a) -> a -> mono -> a
- toList :: MonoFoldable mono => mono -> [Element mono]
- all :: MonoFoldable mono => (Element mono -> Bool) -> mono -> Bool
- any :: MonoFoldable mono => (Element mono -> Bool) -> mono -> Bool
- null :: MonoFoldable mono => mono -> Bool
- length :: MonoFoldable mono => mono -> Int
- length64 :: MonoFoldable mono => mono -> Int64
- compareLength :: (MonoFoldable mono, Integral i) => mono -> i -> Ordering
- traverse_ :: (MonoFoldable mono, Applicative f) => (Element mono -> f b) -> mono -> f ()
- for_ :: (MonoFoldable mono, Applicative f) => mono -> (Element mono -> f b) -> f ()
- mapM_ :: (MonoFoldable mono, Applicative m) => (Element mono -> m ()) -> mono -> m ()
- forM_ :: (MonoFoldable mono, Applicative m) => mono -> (Element mono -> m ()) -> m ()
- foldlM :: (MonoFoldable mono, Monad m) => (a -> Element mono -> m a) -> a -> mono -> m a
- foldMap1Ex :: (MonoFoldable mono, Semigroup m) => (Element mono -> m) -> mono -> m
- foldr1Ex :: MonoFoldable mono => (Element mono -> Element mono -> Element mono) -> mono -> Element mono
- foldl1Ex' :: MonoFoldable mono => (Element mono -> Element mono -> Element mono) -> mono -> Element mono
- sum :: (MonoFoldable mono, Num (Element mono)) => mono -> Element mono
- product :: (MonoFoldable mono, Num (Element mono)) => mono -> Element mono
- and :: (MonoFoldable mono, Element mono ~ Bool) => mono -> Bool
- or :: (MonoFoldable mono, Element mono ~ Bool) => mono -> Bool
- concatMap :: (MonoFoldable mono, Monoid m) => (Element mono -> m) -> mono -> m
- elem :: (MonoFoldable mono, Eq (Element mono)) => Element mono -> mono -> Bool
- notElem :: (MonoFoldable mono, Eq (Element mono)) => Element mono -> mono -> Bool
- point :: MonoPointed mono => Element mono -> mono
- intercalate :: (MonoFoldable mono, Monoid (Element mono)) => Element mono -> mono -> Element mono
- fold :: (MonoFoldable mono, Monoid (Element mono)) => mono -> Element mono
- concat :: (MonoFoldable mono, Monoid (Element mono)) => mono -> Element mono
- foldM :: (MonoFoldable mono, Monad m) => (a -> Element mono -> m a) -> a -> mono -> m a
- sequence_ :: (Applicative m, MonoFoldable mono, Element mono ~ m ()) => mono -> m ()
- class (Textual textual, IsSequence binary) => Utf8 textual binary | textual -> binary, binary -> textual where
- encodeUtf8 :: textual -> binary
- decodeUtf8 :: binary -> textual
- class (IsSequence lazy, IsSequence strict) => LazySequence lazy strict | lazy -> strict, strict -> lazy where
- toChunks :: lazy -> [strict]
- fromChunks :: [strict] -> lazy
- toStrict :: lazy -> strict
- fromStrict :: strict -> lazy
- class (IsSequence t, IsString t, Element t ~ Char) => Textual t where
- words :: t -> [t]
- unwords :: (Element seq ~ t, MonoFoldable seq) => seq -> t
- lines :: t -> [t]
- unlines :: (Element seq ~ t, MonoFoldable seq) => seq -> t
- toLower :: t -> t
- toUpper :: t -> t
- toCaseFold :: t -> t
- breakWord :: t -> (t, t)
- breakLine :: t -> (t, t)
- class (Monoid seq, MonoTraversable seq, SemiSequence seq, MonoPointed seq) => IsSequence seq where
- fromList :: [Element seq] -> seq
- lengthIndex :: seq -> Index seq
- break :: (Element seq -> Bool) -> seq -> (seq, seq)
- span :: (Element seq -> Bool) -> seq -> (seq, seq)
- dropWhile :: (Element seq -> Bool) -> seq -> seq
- takeWhile :: (Element seq -> Bool) -> seq -> seq
- splitAt :: Index seq -> seq -> (seq, seq)
- unsafeSplitAt :: Index seq -> seq -> (seq, seq)
- take :: Index seq -> seq -> seq
- unsafeTake :: Index seq -> seq -> seq
- drop :: Index seq -> seq -> seq
- unsafeDrop :: Index seq -> seq -> seq
- dropEnd :: Index seq -> seq -> seq
- partition :: (Element seq -> Bool) -> seq -> (seq, seq)
- uncons :: seq -> Maybe (Element seq, seq)
- unsnoc :: seq -> Maybe (seq, Element seq)
- filter :: (Element seq -> Bool) -> seq -> seq
- filterM :: Monad m => (Element seq -> m Bool) -> seq -> m seq
- replicate :: Index seq -> Element seq -> seq
- replicateM :: Monad m => Index seq -> m (Element seq) -> m seq
- groupBy :: (Element seq -> Element seq -> Bool) -> seq -> [seq]
- groupAllOn :: Eq b => (Element seq -> b) -> seq -> [seq]
- subsequences :: seq -> [seq]
- permutations :: seq -> [seq]
- tailEx :: seq -> seq
- tailMay :: seq -> Maybe seq
- initEx :: seq -> seq
- initMay :: seq -> Maybe seq
- unsafeTail :: seq -> seq
- unsafeInit :: seq -> seq
- index :: seq -> Index seq -> Maybe (Element seq)
- indexEx :: seq -> Index seq -> Element seq
- unsafeIndex :: seq -> Index seq -> Element seq
- splitWhen :: (Element seq -> Bool) -> seq -> [seq]
- class (Integral (Index seq), GrowingAppend seq) => SemiSequence seq where
- singleton :: MonoPointed seq => Element seq -> seq
- defaultFind :: MonoFoldable seq => (Element seq -> Bool) -> seq -> Maybe (Element seq)
- defaultIntersperse :: IsSequence seq => Element seq -> seq -> seq
- defaultReverse :: IsSequence seq => seq -> seq
- defaultSortBy :: IsSequence seq => (Element seq -> Element seq -> Ordering) -> seq -> seq
- defaultSplitWhen :: IsSequence seq => (Element seq -> Bool) -> seq -> [seq]
- vectorSortBy :: Vector v e => (e -> e -> Ordering) -> v e -> v e
- vectorSort :: (Vector v e, Ord e) => v e -> v e
- defaultCons :: IsSequence seq => Element seq -> seq -> seq
- defaultSnoc :: IsSequence seq => seq -> Element seq -> seq
- tailDef :: IsSequence seq => seq -> seq
- initDef :: IsSequence seq => seq -> seq
- splitElem :: (IsSequence seq, Eq (Element seq)) => Element seq -> seq -> [seq]
- splitSeq :: (IsSequence seq, Eq (Element seq)) => seq -> seq -> [seq]
- replaceSeq :: (IsSequence seq, Eq (Element seq)) => seq -> seq -> seq -> seq
- stripPrefix :: (IsSequence seq, Eq (Element seq)) => seq -> seq -> Maybe seq
- stripSuffix :: (IsSequence seq, Eq (Element seq)) => seq -> seq -> Maybe seq
- dropPrefix :: (IsSequence seq, Eq (Element seq)) => seq -> seq -> seq
- dropSuffix :: (IsSequence seq, Eq (Element seq)) => seq -> seq -> seq
- ensurePrefix :: (Eq (Element seq), IsSequence seq) => seq -> seq -> seq
- ensureSuffix :: (Eq (Element seq), IsSequence seq) => seq -> seq -> seq
- isPrefixOf :: (IsSequence seq, Eq (Element seq)) => seq -> seq -> Bool
- isSuffixOf :: (IsSequence seq, Eq (Element seq)) => seq -> seq -> Bool
- isInfixOf :: (IsSequence seq, Eq (Element seq)) => seq -> seq -> Bool
- group :: (IsSequence seq, Eq (Element seq)) => seq -> [seq]
- groupAll :: (IsSequence seq, Eq (Element seq)) => seq -> [seq]
- delete :: (IsSequence seq, Eq (Element seq)) => Element seq -> seq -> seq
- deleteBy :: (IsSequence seq, Eq (Element seq)) => (Element seq -> Element seq -> Bool) -> Element seq -> seq -> seq
- splitElemStrictBS :: Word8 -> ByteString -> [ByteString]
- stripPrefixStrictBS :: ByteString -> ByteString -> Maybe ByteString
- stripSuffixStrictBS :: ByteString -> ByteString -> Maybe ByteString
- splitSeqLazyBS :: Word8 -> ByteString -> [ByteString]
- stripPrefixLazyBS :: ByteString -> ByteString -> Maybe ByteString
- stripSuffixLazyBS :: ByteString -> ByteString -> Maybe ByteString
- splitSeqStrictText :: Text -> Text -> [Text]
- replaceSeqStrictText :: Text -> Text -> Text -> Text
- splitSeqLazyText :: Text -> Text -> [Text]
- replaceSeqLazyText :: Text -> Text -> Text -> Text
- sort :: (SemiSequence seq, Ord (Element seq)) => seq -> seq
- catMaybes :: (IsSequence (f (Maybe t)), Functor f, Element (f (Maybe t)) ~ Maybe t) => f (Maybe t) -> f t
- sortOn :: (Ord o, SemiSequence seq) => (Element seq -> o) -> seq -> seq
- pack :: IsSequence seq => [Element seq] -> seq
- unpack :: MonoFoldable mono => mono -> [Element mono]
- repack :: (MonoFoldable a, IsSequence b, Element a ~ Element b) => a -> b
- data NonNull mono
- fromNullable :: MonoFoldable mono => mono -> Maybe (NonNull mono)
- impureNonNull :: MonoFoldable mono => mono -> NonNull mono
- nonNull :: MonoFoldable mono => mono -> NonNull mono
- fromNonEmpty :: IsSequence seq => NonEmpty (Element seq) -> NonNull seq
- toMinList :: NonEmpty a -> NonNull [a]
- ncons :: SemiSequence seq => Element seq -> seq -> NonNull seq
- nuncons :: IsSequence seq => NonNull seq -> (Element seq, Maybe (NonNull seq))
- splitFirst :: IsSequence seq => NonNull seq -> (Element seq, seq)
- nfilter :: IsSequence seq => (Element seq -> Bool) -> NonNull seq -> seq
- nfilterM :: (Monad m, IsSequence seq) => (Element seq -> m Bool) -> NonNull seq -> m seq
- nReplicate :: IsSequence seq => Index seq -> Element seq -> NonNull seq
- tail :: IsSequence seq => NonNull seq -> seq
- init :: IsSequence seq => NonNull seq -> seq
- (<|) :: SemiSequence seq => Element seq -> NonNull seq -> NonNull seq
- head :: MonoFoldable mono => NonNull mono -> Element mono
- last :: MonoFoldable mono => NonNull mono -> Element mono
- ofoldMap1 :: (MonoFoldable mono, Semigroup m) => (Element mono -> m) -> NonNull mono -> m
- ofold1 :: (MonoFoldable mono, Semigroup (Element mono)) => NonNull mono -> Element mono
- ofoldr1 :: MonoFoldable mono => (Element mono -> Element mono -> Element mono) -> NonNull mono -> Element mono
- ofoldl1' :: MonoFoldable mono => (Element mono -> Element mono -> Element mono) -> NonNull mono -> Element mono
- maximum :: (MonoFoldable mono, Ord (Element mono)) => NonNull mono -> Element mono
- minimum :: (MonoFoldable mono, Ord (Element mono)) => NonNull mono -> Element mono
- maximumBy :: MonoFoldable mono => (Element mono -> Element mono -> Ordering) -> NonNull mono -> Element mono
- minimumBy :: MonoFoldable mono => (Element mono -> Element mono -> Ordering) -> NonNull mono -> Element mono
- mapNonNull :: (Functor f, MonoFoldable (f b)) => (a -> b) -> NonNull (f a) -> NonNull (f b)
- interact :: MonadIO m => (LText -> LText) -> m ()
- getContents :: MonadIO m => m LText
- getLine :: MonadIO m => m Text
- getChar :: MonadIO m => m Char
- putStrLn :: MonadIO m => Text -> m ()
- putStr :: MonadIO m => Text -> m ()
- putChar :: MonadIO m => Char -> m ()
- hGetChunk :: MonadIO m => Handle -> m ByteString
- hPut :: MonadIO m => Handle -> ByteString -> m ()
- hGetContents :: MonadIO m => Handle -> m ByteString
- writeFileUtf8 :: MonadIO m => FilePath -> Text -> m ()
- writeFile :: MonadIO m => FilePath -> ByteString -> m ()
- readFileUtf8 :: MonadIO m => FilePath -> m Text
- readFile :: MonadIO m => FilePath -> m ByteString
- link2Async :: MonadIO m => Async a -> Async b -> m ()
- linkAsync :: MonadIO m => Async a -> m ()
- waitCatchAsync :: MonadIO m => Async a -> m (Either SomeException a)
- pollAsync :: MonadIO m => Async a -> m (Maybe (Either SomeException a))
- waitAsync :: MonadIO m => Async a -> m a
- fromByteVector :: SVector Word8 -> ByteString
- toByteVector :: ByteString -> SVector Word8
- (<||>) :: Applicative a => a Bool -> a Bool -> a Bool
- (<&&>) :: Applicative a => a Bool -> a Bool -> a Bool
- applyDList :: DList a -> [a] -> [a]
- asDList :: DList a -> DList a
- unlessM :: Monad m => m Bool -> m () -> m ()
- whenM :: Monad m => m Bool -> m () -> m ()
- orElseSTM :: STM a -> STM a -> STM a
- ordNubBy :: Ord b => (a -> b) -> (a -> a -> Bool) -> [a] -> [a]
- ordNub :: Ord a => [a] -> [a]
- hashNub :: (Hashable a, Eq a) => [a] -> [a]
- yieldThread :: MonadIO m => m ()
- traceShowM :: (Show a, Monad m) => a -> m ()
- traceShowId :: Show a => a -> a
- traceM :: Monad m => String -> m ()
- traceId :: String -> String
- traceShow :: Show a => a -> b -> b
- trace :: String -> a -> a
- undefined :: HasCallStack => a
- sortWith :: (Ord a, IsSequence c) => (Element c -> a) -> c -> c
- print :: (Show a, MonadIO m) => a -> m ()
- asString :: [Char] -> [Char]
- asSVector :: SVector a -> SVector a
- asUVector :: UVector a -> UVector a
- asVector :: Vector a -> Vector a
- asIntSet :: IntSet -> IntSet
- asSet :: Set a -> Set a
- asMaybe :: Maybe a -> Maybe a
- asIntMap :: IntMap v -> IntMap v
- asMap :: Map k v -> Map k v
- asList :: [a] -> [a]
- asLText :: LText -> LText
- asText :: Text -> Text
- asHashSet :: HashSet a -> HashSet a
- asHashMap :: HashMap k v -> HashMap k v
- asLByteString :: LByteString -> LByteString
- asByteString :: ByteString -> ByteString
- intersect :: SetContainer a => a -> a -> a
- (\\) :: SetContainer a => a -> a -> a
- (++) :: Monoid m => m -> m -> m
- map :: Functor f => (a -> b) -> f a -> f b
- readMay :: (Element c ~ Char, MonoFoldable c, Read a) => c -> Maybe a
- charToUpper :: Char -> Char
- charToLower :: Char -> Char
- tlshow :: Show a => a -> LText
- tshow :: Show a => a -> Text
- newtype Day = ModifiedJulianDay {}
- toGregorian :: Day -> (Integer, Int, Int)
- fromGregorian :: Integer -> Int -> Int -> Day
- getCurrentTime :: IO UTCTime
- defaultTimeLocale :: TimeLocale
- parseTimeM :: (Monad m, ParseTime t) => Bool -> TimeLocale -> String -> String -> m t
- parseTime :: ParseTime t => TimeLocale -> String -> String -> Maybe t
- formatTime :: FormatTime t => TimeLocale -> String -> t -> String
- primToPrim :: (PrimBase m1, PrimMonad m2, PrimState m1 ~ PrimState m2) => m1 a -> m2 a
- primToIO :: (PrimBase m, PrimState m ~ RealWorld) => m a -> IO a
- primToST :: PrimBase m => m a -> ST (PrimState m) a
- type Reader r = ReaderT r Identity
- newtype ReaderT r (m :: k -> Type) (a :: k) :: forall k. Type -> (k -> Type) -> k -> Type = ReaderT {
- runReaderT :: r -> m a
- asks :: MonadReader r m => (r -> a) -> m a
- data DList a
- deepseq :: NFData a => a -> b -> b
- ($!!) :: NFData a => (a -> b) -> a -> b
- force :: NFData a => a -> a
- lift :: (MonadTrans t, Monad m) => m a -> t m a
- whenJust :: Monoid m => Maybe a -> (a -> m) -> m
Documentation
The value of seq a b is bottom if a is bottom, and
otherwise equal to b. In other words, it evaluates the first
argument a to weak head normal form (WHNF). seq is usually
introduced to improve performance by avoiding unneeded laziness.
A note on evaluation order: the expression seq a b does
not guarantee that a will be evaluated before b.
The only guarantee given by seq is that the both a
and b will be evaluated before seq returns a value.
In particular, this means that b may be evaluated before
a. If you need to guarantee a specific order of evaluation,
you must use the function pseq from the "parallel" package.
If the first argument evaluates to True, then the result is the
second argument. Otherwise an AssertionFailed exception is raised,
containing a String with the source file and line number of the
call to assert.
Assertions can normally be turned on or off with a compiler flag
(for GHC, assertions are normally on unless optimisation is turned on
with -O or the -fignore-asserts
option is given). When assertions are turned off, the first
argument to assert is ignored, and the second argument is
returned as the result.
($) :: (a -> b) -> a -> b infixr 0 #
Application operator. This operator is redundant, since ordinary
application (f x) means the same as (f . However, $ x)$ has
low, right-associative binding precedence, so it sometimes allows
parentheses to be omitted; for example:
f $ g $ h x = f (g (h x))
It is also useful in higher-order situations, such as map ($ 0) xszipWith ($) fs xs
Note that ($) is levity-polymorphic in its result type, so that
foo $ True where foo :: Bool -> Int#
is well-typed
fromIntegral :: (Integral a, Num b) => a -> b #
general coercion from integral types
realToFrac :: (Real a, Fractional b) => a -> b #
general coercion to fractional types
guard :: Alternative f => Bool -> f () #
Conditional failure of Alternative computations. Defined by
guard True =pure() guard False =empty
Examples
Common uses of guard include conditionally signaling an error in
an error monad and conditionally rejecting the current choice in an
Alternative-based parser.
As an example of signaling an error in the error monad Maybe,
consider a safe division function safeDiv x y that returns
Nothing when the denominator y is zero and Just (x `div`
y)
>>> safeDiv 4 0 Nothing >>> safeDiv 4 2 Just 2
A definition of safeDiv using guards, but not guard:
safeDiv :: Int -> Int -> Maybe Int
safeDiv x y | y /= 0 = Just (x `div` y)
| otherwise = Nothing
A definition of safeDiv using guard and Monad do-notation:
safeDiv :: Int -> Int -> Maybe Int safeDiv x y = do guard (y /= 0) return (x `div` y)
join :: Monad m => m (m a) -> m a #
The join function is the conventional monad join operator. It
is used to remove one level of monadic structure, projecting its
bound argument into the outer level.
Examples
A common use of join is to run an IO computation returned from
an STM transaction, since STM transactions
can't perform IO directly. Recall that
atomically :: STM a -> IO a
is used to run STM transactions atomically. So, by
specializing the types of atomically and join to
atomically:: STM (IO b) -> IO (IO b)join:: IO (IO b) -> IO b
we can compose them as
join.atomically:: STM (IO b) -> IO b
The Bounded class is used to name the upper and lower limits of a
type. Ord is not a superclass of Bounded since types that are not
totally ordered may also have upper and lower bounds.
The Bounded class may be derived for any enumeration type;
minBound is the first constructor listed in the data declaration
and maxBound is the last.
Bounded may also be derived for single-constructor datatypes whose
constituent types are in Bounded.
Instances
| Bounded Bool | Since: base-2.1 |
| Bounded Char | Since: base-2.1 |
| Bounded Int | Since: base-2.1 |
| Bounded Int8 | Since: base-2.1 |
| Bounded Int16 | Since: base-2.1 |
| Bounded Int32 | Since: base-2.1 |
| Bounded Int64 | Since: base-2.1 |
| Bounded Ordering | Since: base-2.1 |
| Bounded Word | Since: base-2.1 |
| Bounded Word8 | Since: base-2.1 |
| Bounded Word16 | Since: base-2.1 |
| Bounded Word32 | Since: base-2.1 |
| Bounded Word64 | Since: base-2.1 |
| Bounded VecCount | Since: base-4.10.0.0 |
| Bounded VecElem | Since: base-4.10.0.0 |
| Bounded () | Since: base-2.1 |
| Bounded Any | Since: base-2.1 |
| Bounded All | Since: base-2.1 |
| Bounded Associativity | Since: base-4.9.0.0 |
Defined in GHC.Generics | |
| Bounded SourceUnpackedness | Since: base-4.9.0.0 |
Defined in GHC.Generics | |
| Bounded SourceStrictness | Since: base-4.9.0.0 |
Defined in GHC.Generics | |
| Bounded DecidedStrictness | Since: base-4.9.0.0 |
Defined in GHC.Generics | |
| Bounded CChar | |
| Bounded CSChar | |
| Bounded CUChar | |
| Bounded CShort | |
| Bounded CUShort | |
| Bounded CInt | |
| Bounded CUInt | |
| Bounded CLong | |
| Bounded CULong | |
| Bounded CLLong | |
| Bounded CULLong | |
| Bounded CBool | |
| Bounded CPtrdiff | |
| Bounded CSize | |
| Bounded CWchar | |
| Bounded CSigAtomic | |
Defined in Foreign.C.Types | |
| Bounded CIntPtr | |
| Bounded CUIntPtr | |
| Bounded CIntMax | |
| Bounded CUIntMax | |
| Bounded GeneralCategory | Since: base-2.1 |
Defined in GHC.Unicode | |
| Bounded AttrOpTag | |
| Bounded a => Bounded (Last a) | Since: base-4.9.0.0 |
| Bounded a => Bounded (Min a) | Since: base-4.9.0.0 |
| Bounded a => Bounded (Max a) | Since: base-4.9.0.0 |
| Bounded a => Bounded (First a) | Since: base-4.9.0.0 |
| Bounded m => Bounded (WrappedMonoid m) | Since: base-4.9.0.0 |
Defined in Data.Semigroup | |
| Bounded a => Bounded (Identity a) | Since: base-4.9.0.0 |
| Bounded a => Bounded (Dual a) | Since: base-2.1 |
| Bounded a => Bounded (Sum a) | Since: base-2.1 |
| Bounded a => Bounded (Product a) | Since: base-2.1 |
| (Bounded a, Bounded b) => Bounded (a, b) | Since: base-2.1 |
| Bounded (Proxy t) | Since: base-4.7.0.0 |
| (Bounded a, Bounded b, Bounded c) => Bounded (a, b, c) | Since: base-2.1 |
| Bounded a => Bounded (Const a b) | Since: base-4.9.0.0 |
| (Applicative f, Bounded a) => Bounded (Ap f a) | Since: base-4.12.0.0 |
| a ~ b => Bounded (a :~: b) | Since: base-4.7.0.0 |
| Bounded b => Bounded (Tagged s b) | |
| (Bounded a, Bounded b, Bounded c, Bounded d) => Bounded (a, b, c, d) | Since: base-2.1 |
| a ~~ b => Bounded (a :~~: b) | Since: base-4.10.0.0 |
| (Bounded a, Bounded b, Bounded c, Bounded d, Bounded e) => Bounded (a, b, c, d, e) | Since: base-2.1 |
| (Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f) => Bounded (a, b, c, d, e, f) | Since: base-2.1 |
| (Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g) => Bounded (a, b, c, d, e, f, g) | Since: base-2.1 |
| (Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g, Bounded h) => Bounded (a, b, c, d, e, f, g, h) | Since: base-2.1 |
| (Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g, Bounded h, Bounded i) => Bounded (a, b, c, d, e, f, g, h, i) | Since: base-2.1 |
| (Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g, Bounded h, Bounded i, Bounded j) => Bounded (a, b, c, d, e, f, g, h, i, j) | Since: base-2.1 |
| (Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g, Bounded h, Bounded i, Bounded j, Bounded k) => Bounded (a, b, c, d, e, f, g, h, i, j, k) | Since: base-2.1 |
| (Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g, Bounded h, Bounded i, Bounded j, Bounded k, Bounded l) => Bounded (a, b, c, d, e, f, g, h, i, j, k, l) | Since: base-2.1 |
| (Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g, Bounded h, Bounded i, Bounded j, Bounded k, Bounded l, Bounded m) => Bounded (a, b, c, d, e, f, g, h, i, j, k, l, m) | Since: base-2.1 |
| (Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g, Bounded h, Bounded i, Bounded j, Bounded k, Bounded l, Bounded m, Bounded n) => Bounded (a, b, c, d, e, f, g, h, i, j, k, l, m, n) | Since: base-2.1 |
| (Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g, Bounded h, Bounded i, Bounded j, Bounded k, Bounded l, Bounded m, Bounded n, Bounded o) => Bounded (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) | Since: base-2.1 |
Class Enum defines operations on sequentially ordered types.
The enumFrom... methods are used in Haskell's translation of
arithmetic sequences.
Instances of Enum may be derived for any enumeration type (types
whose constructors have no fields). The nullary constructors are
assumed to be numbered left-to-right by fromEnum from 0 through n-1.
See Chapter 10 of the Haskell Report for more details.
For any type that is an instance of class Bounded as well as Enum,
the following should hold:
- The calls
succmaxBoundpredminBound fromEnumandtoEnumshould give a runtime error if the result value is not representable in the result type. For example,toEnum7 ::BoolenumFromandenumFromThenshould be defined with an implicit bound, thus:
enumFrom x = enumFromTo x maxBound
enumFromThen x y = enumFromThenTo x y bound
where
bound | fromEnum y >= fromEnum x = maxBound
| otherwise = minBoundMethods
the successor of a value. For numeric types, succ adds 1.
the predecessor of a value. For numeric types, pred subtracts 1.
Convert from an Int.
Convert to an Int.
It is implementation-dependent what fromEnum returns when
applied to a value that is too large to fit in an Int.
Used in Haskell's translation of [n..] with [n..] = enumFrom n,
a possible implementation being enumFrom n = n : enumFrom (succ n).
For example:
enumFrom 4 :: [Integer] = [4,5,6,7,...]
enumFrom 6 :: [Int] = [6,7,8,9,...,maxBound :: Int]
enumFromThen :: a -> a -> [a] #
Used in Haskell's translation of [n,n'..]
with [n,n'..] = enumFromThen n n', a possible implementation being
enumFromThen n n' = n : n' : worker (f x) (f x n'),
worker s v = v : worker s (s v), x = fromEnum n' - fromEnum n and
f n y
| n > 0 = f (n - 1) (succ y)
| n < 0 = f (n + 1) (pred y)
| otherwise = y
For example:
enumFromThen 4 6 :: [Integer] = [4,6,8,10...]
enumFromThen 6 2 :: [Int] = [6,2,-2,-6,...,minBound :: Int]
enumFromTo :: a -> a -> [a] #
Used in Haskell's translation of [n..m] with
[n..m] = enumFromTo n m, a possible implementation being
enumFromTo n m
| n <= m = n : enumFromTo (succ n) m
| otherwise = [].
For example:
enumFromTo 6 10 :: [Int] = [6,7,8,9,10]
enumFromTo 42 1 :: [Integer] = []
enumFromThenTo :: a -> a -> a -> [a] #
Used in Haskell's translation of [n,n'..m] with
[n,n'..m] = enumFromThenTo n n' m, a possible implementation
being enumFromThenTo n n' m = worker (f x) (c x) n m,
x = fromEnum n' - fromEnum n, c x = bool (>=) ((x 0)
f n y
| n > 0 = f (n - 1) (succ y)
| n < 0 = f (n + 1) (pred y)
| otherwise = y and
worker s c v m
| c v m = v : worker s c (s v) m
| otherwise = []
For example:
enumFromThenTo 4 2 -6 :: [Integer] = [4,2,0,-2,-4,-6]
enumFromThenTo 6 8 2 :: [Int] = []
Instances
The Eq class defines equality (==) and inequality (/=).
All the basic datatypes exported by the Prelude are instances of Eq,
and Eq may be derived for any datatype whose constituents are also
instances of Eq.
The Haskell Report defines no laws for Eq. However, == is customarily
expected to implement an equivalence relationship where two values comparing
equal are indistinguishable by "public" functions, with a "public" function
being one not allowing to see implementation details. For example, for a
type representing non-normalised natural numbers modulo 100, a "public"
function doesn't make the difference between 1 and 201. It is expected to
have the following properties:
Instances
class Fractional a => Floating a where #
Trigonometric and hyperbolic functions and related functions.
The Haskell Report defines no laws for Floating. However, '(+)', '(*)'
and exp are customarily expected to define an exponential field and have
the following properties:
exp (a + b)= @exp a * exp bexp (fromInteger 0)=fromInteger 1
Minimal complete definition
pi, exp, log, sin, cos, asin, acos, atan, sinh, cosh, asinh, acosh, atanh
Instances
class Num a => Fractional a where #
Fractional numbers, supporting real division.
The Haskell Report defines no laws for Fractional. However, '(+)' and
'(*)' are customarily expected to define a division ring and have the
following properties:
recipgives the multiplicative inversex * recip x=recip x * x=fromInteger 1
Note that it isn't customarily expected that a type instance of
Fractional implement a field. However, all instances in base do.
Minimal complete definition
fromRational, (recip | (/))
Methods
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
| Fractional CFloat | |
| Fractional CDouble | |
| Fractional DiffTime | |
| Integral a => Fractional (Ratio a) | Since: base-2.0.1 |
| RealFloat a => Fractional (Complex a) | Since: base-2.1 |
| Fractional a => Fractional (Identity a) | Since: base-4.9.0.0 |
| Fractional a => Fractional (Op a b) | |
| Fractional a => Fractional (Const a b) | Since: base-4.9.0.0 |
| Fractional a => Fractional (Tagged s a) | |
class (Real a, Enum a) => Integral a where #
Integral numbers, supporting integer division.
The Haskell Report defines no laws for Integral. However, Integral
instances are customarily expected to define a Euclidean domain and have the
following properties for the 'div'/'mod' and 'quot'/'rem' pairs, given
suitable Euclidean functions f and g:
x=y * quot x y + rem x ywithrem x y=fromInteger 0org (rem x y)<g yx=y * div x y + mod x ywithmod x y=fromInteger 0orf (mod x y)<f y
An example of a suitable Euclidean function, for Integer's instance, is
abs.
Methods
quot :: a -> a -> a infixl 7 #
integer division truncated toward zero
integer remainder, satisfying
(x `quot` y)*y + (x `rem` y) == x
integer division truncated toward negative infinity
integer modulus, satisfying
(x `div` y)*y + (x `mod` y) == x
conversion to Integer
Instances
class Applicative m => Monad (m :: Type -> Type) where #
The Monad class defines the basic operations over a monad,
a concept from a branch of mathematics known as category theory.
From the perspective of a Haskell programmer, however, it is best to
think of a monad as an abstract datatype of actions.
Haskell's do expressions provide a convenient syntax for writing
monadic expressions.
Instances of Monad should satisfy the following laws:
Furthermore, the Monad and Applicative operations should relate as follows:
The above laws imply:
and that pure and (<*>) satisfy the applicative functor laws.
The instances of Monad for lists, Maybe and IO
defined in the Prelude satisfy these laws.
Minimal complete definition
Methods
(>>=) :: m a -> (a -> m b) -> m b infixl 1 #
Sequentially compose two actions, passing any value produced by the first as an argument to the second.
(>>) :: m a -> m b -> m b infixl 1 #
Sequentially compose two actions, discarding any value produced by the first, like sequencing operators (such as the semicolon) in imperative languages.
Inject a value into the monadic type.
Fail with a message. This operation is not part of the
mathematical definition of a monad, but is invoked on pattern-match
failure in a do expression.
As part of the MonadFail proposal (MFP), this function is moved
to its own class MonadFail (see Control.Monad.Fail for more
details). The definition here will be removed in a future
release.
Instances
| Monad [] | Since: base-2.1 |
| Monad Maybe | Since: base-2.1 |
| Monad IO | Since: base-2.1 |
| Monad Par1 | Since: base-4.9.0.0 |
| Monad Q | |
| Monad Last | Since: base-4.9.0.0 |
| Monad Complex | Since: base-4.9.0.0 |
| Monad Min | Since: base-4.9.0.0 |
| Monad Max | Since: base-4.9.0.0 |
| Monad First | Since: base-4.9.0.0 |
| Monad Option | Since: base-4.9.0.0 |
| Monad Identity | Since: base-4.8.0.0 |
| Monad STM | Since: base-4.3.0.0 |
| Monad First | Since: base-4.8.0.0 |
| Monad Last | Since: base-4.8.0.0 |
| Monad Dual | Since: base-4.8.0.0 |
| Monad Sum | Since: base-4.8.0.0 |
| Monad Product | Since: base-4.8.0.0 |
| Monad Down | Since: base-4.11.0.0 |
| Monad ReadPrec | Since: base-2.1 |
| Monad ReadP | Since: base-2.1 |
| Monad NonEmpty | Since: base-4.9.0.0 |
| Monad Vector | |
| Monad Seq | |
| Monad Memoized | |
| Monad DList | |
| Monad Tree | |
| Monad ScopeM | |
| Monad SmallArray | |
Defined in Data.Primitive.SmallArray Methods (>>=) :: SmallArray a -> (a -> SmallArray b) -> SmallArray b # (>>) :: SmallArray a -> SmallArray b -> SmallArray b # return :: a -> SmallArray a # fail :: String -> SmallArray a # | |
| Monad Array | |
| Monad Id | |
| Monad Box | |
| Monad P | Since: base-2.1 |
| Monad (Either e) | Since: base-4.4.0.0 |
| Monad (U1 :: Type -> Type) | Since: base-4.9.0.0 |
| Monoid a => Monad ((,) a) | Since: base-4.9.0.0 |
| Monad (ST s) | Since: base-2.1 |
| Representable f => Monad (Co f) | |
| Monad (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 # fail :: String -> WrappedMonad m a # | |
| ArrowApply a => Monad (ArrowMonad a) | Since: base-2.1 |
Defined in Control.Arrow Methods (>>=) :: ArrowMonad a a0 -> (a0 -> ArrowMonad a b) -> ArrowMonad a b # (>>) :: ArrowMonad a a0 -> ArrowMonad a b -> ArrowMonad a b # return :: a0 -> ArrowMonad a a0 # fail :: String -> ArrowMonad a a0 # | |
| Monad (Proxy :: Type -> Type) | Since: base-4.7.0.0 |
| Monad m => Monad (MaybeT m) | |
| Monad m => Monad (ResourceT m) | |
| Alternative f => Monad (Cofree f) | |
| Functor f => Monad (Free f) | |
| Monad m => Monad (Yoneda m) | |
| Monad (ReifiedGetter s) | |
Defined in Control.Lens.Reified Methods (>>=) :: ReifiedGetter s a -> (a -> ReifiedGetter s b) -> ReifiedGetter s b # (>>) :: ReifiedGetter s a -> ReifiedGetter s b -> ReifiedGetter s b # return :: a -> ReifiedGetter s a # fail :: String -> ReifiedGetter s a # | |
| Monad (ReifiedFold s) | |
Defined in Control.Lens.Reified Methods (>>=) :: ReifiedFold s a -> (a -> ReifiedFold s b) -> ReifiedFold s b # (>>) :: ReifiedFold s a -> ReifiedFold s b -> ReifiedFold s b # return :: a -> ReifiedFold s a # fail :: String -> ReifiedFold s a # | |
| Monad m => Monad (ListT m) | |
| (Monad (Rep p), Representable p) => Monad (Prep p) | |
| Monad q => Monad (DsM q) | |
| Monad (SetM s) | |
| SingI ns => Monad (Matrix ns) Source # | |
| SingI n => Monad (Vec n) Source # | |
| Monad f => Monad (Rec1 f) | Since: base-4.9.0.0 |
| Monad f => Monad (Ap f) | Since: base-4.12.0.0 |
| Monad f => Monad (Alt f) | Since: base-4.8.0.0 |
| Monad m => Monad (IdentityT m) | |
| (Monoid w, Monad m) => Monad (WriterT w m) | |
| (Monoid w, Monad m) => Monad (WriterT w m) | |
| Monad m => Monad (StateT s m) | |
| Monad m => Monad (StateT s m) | |
| (Applicative f, Monad f) => Monad (WhenMissing f x) | Equivalent to Since: containers-0.5.9 |
Defined in Data.IntMap.Internal Methods (>>=) :: WhenMissing f x a -> (a -> WhenMissing f x b) -> WhenMissing f x b # (>>) :: WhenMissing f x a -> WhenMissing f x b -> WhenMissing f x b # return :: a -> WhenMissing f x a # fail :: String -> WhenMissing f x a # | |
| (Functor f, Monad m) => Monad (FreeT f m) | |
| (Alternative f, Monad w) => Monad (CofreeT f w) | |
| (Monad m, Error e) => Monad (ErrorT e m) | |
| Monad (Indexed i a) | |
| Monad (Tagged s) | |
| Monad ((->) r :: Type -> Type) | Since: base-2.1 |
| (Monad f, Monad g) => Monad (f :*: g) | Since: base-4.9.0.0 |
| (Monad f, Monad g) => Monad (Product f g) | Since: base-4.9.0.0 |
| Monad m => Monad (ReaderT r m) | |
| Monad (Cokleisli w a) | |
| Monad (ConduitT i o m) | |
| (Monad f, Applicative f) => Monad (WhenMatched f x y) | Equivalent to Since: containers-0.5.9 |
Defined in Data.IntMap.Internal Methods (>>=) :: WhenMatched f x y a -> (a -> WhenMatched f x y b) -> WhenMatched f x y b # (>>) :: WhenMatched f x y a -> WhenMatched f x y b -> WhenMatched f x y b # return :: a -> WhenMatched f x y a # fail :: String -> WhenMatched f x y a # | |
| (Applicative f, Monad f) => Monad (WhenMissing f k x) | Equivalent to Since: containers-0.5.9 |
Defined in Data.Map.Internal Methods (>>=) :: WhenMissing f k x a -> (a -> WhenMissing f k x b) -> WhenMissing f k x b # (>>) :: WhenMissing f k x a -> WhenMissing f k x b -> WhenMissing f k x b # return :: a -> WhenMissing f k x a # fail :: String -> WhenMissing f k x a # | |
| Monad (ContT r m) | |
| Monad f => Monad (M1 i c f) | Since: base-4.9.0.0 |
| (Monoid w, Monad m) => Monad (RWST r w s m) | |
| (Monoid w, Monad m) => Monad (RWST r w s m) | |
| (Monad f, Applicative f) => Monad (WhenMatched f k x y) | Equivalent to Since: containers-0.5.9 |
Defined in Data.Map.Internal Methods (>>=) :: WhenMatched f k x y a -> (a -> WhenMatched f k x y b) -> WhenMatched f k x y b # (>>) :: WhenMatched f k x y a -> WhenMatched f k x y b -> WhenMatched f k x y b # return :: a -> WhenMatched f k x y a # fail :: String -> WhenMatched f k x y a # | |
| Monad m => Monad (Pipe l i o u m) | |
class Functor (f :: Type -> Type) where #
The Functor class is used for types that can be mapped over.
Instances of Functor should satisfy the following laws:
fmap id == id fmap (f . g) == fmap f . fmap g
The instances of Functor for lists, Maybe and IO
satisfy these laws.
Minimal complete definition
Instances
Basic numeric class.
The Haskell Report defines no laws for Num. However, '(+)' and '(*)' are
customarily expected to define a ring and have the following properties:
- Associativity of (+)
(x + y) + z=x + (y + z)- Commutativity of (+)
x + y=y + xfromInteger 0is the additive identityx + fromInteger 0=xnegategives the additive inversex + negate x=fromInteger 0- Associativity of (*)
(x * y) * z=x * (y * z)fromInteger 1is the multiplicative identityx * fromInteger 1=xandfromInteger 1 * x=x- Distributivity of (*) with respect to (+)
a * (b + c)=(a * b) + (a * c)and(b + c) * a=(b * a) + (c * a)
Note that it isn't customarily expected that a type instance of both Num
and Ord implement an ordered ring. Indeed, in base only Integer and
Rational do.
Methods
Unary negation.
Absolute value.
Sign of a number.
The functions abs and signum should satisfy the law:
abs x * signum x == x
For real numbers, the signum is either -1 (negative), 0 (zero)
or 1 (positive).
fromInteger :: Integer -> a #
Conversion from an Integer.
An integer literal represents the application of the function
fromInteger to the appropriate value of type Integer,
so such literals have type (.Num a) => a
Instances
The Ord class is used for totally ordered datatypes.
Instances of Ord can be derived for any user-defined datatype whose
constituent types are in Ord. The declared order of the constructors in
the data declaration determines the ordering in derived Ord instances. The
Ordering datatype allows a single comparison to determine the precise
ordering of two objects.
The Haskell Report defines no laws for Ord. However, <= is customarily
expected to implement a non-strict partial order and have the following
properties:
- Transitivity
- if
x <= y && y <= z=True, thenx <= z=True - Reflexivity
x <= x=True- Antisymmetry
- if
x <= y && y <= x=True, thenx == y=True
Note that the following operator interactions are expected to hold:
x >= y=y <= xx < y=x <= y && x /= yx > y=y < xx < y=compare x y == LTx > y=compare x y == GTx == y=compare x y == EQmin x y == if x <= y then x else y=Truemax x y == if x >= y then x else y=True
Minimal complete definition: either compare or <=.
Using compare can be more efficient for complex types.
Methods
compare :: a -> a -> Ordering #
(<) :: a -> a -> Bool infix 4 #
(<=) :: a -> a -> Bool infix 4 #
(>) :: a -> a -> Bool infix 4 #
Instances
Parsing of Strings, producing values.
Derived instances of Read make the following assumptions, which
derived instances of Show obey:
- If the constructor is defined to be an infix operator, then the
derived
Readinstance will parse only infix applications of the constructor (not the prefix form). - Associativity is not used to reduce the occurrence of parentheses, although precedence may be.
- If the constructor is defined using record syntax, the derived
Readwill parse only the record-syntax form, and furthermore, the fields must be given in the same order as the original declaration. - The derived
Readinstance allows arbitrary Haskell whitespace between tokens of the input string. Extra parentheses are also allowed.
For example, given the declarations
infixr 5 :^: data Tree a = Leaf a | Tree a :^: Tree a
the derived instance of Read in Haskell 2010 is equivalent to
instance (Read a) => Read (Tree a) where
readsPrec d r = readParen (d > app_prec)
(\r -> [(Leaf m,t) |
("Leaf",s) <- lex r,
(m,t) <- readsPrec (app_prec+1) s]) r
++ readParen (d > up_prec)
(\r -> [(u:^:v,w) |
(u,s) <- readsPrec (up_prec+1) r,
(":^:",t) <- lex s,
(v,w) <- readsPrec (up_prec+1) t]) r
where app_prec = 10
up_prec = 5Note that right-associativity of :^: is unused.
The derived instance in GHC is equivalent to
instance (Read a) => Read (Tree a) where
readPrec = parens $ (prec app_prec $ do
Ident "Leaf" <- lexP
m <- step readPrec
return (Leaf m))
+++ (prec up_prec $ do
u <- step readPrec
Symbol ":^:" <- lexP
v <- step readPrec
return (u :^: v))
where app_prec = 10
up_prec = 5
readListPrec = readListPrecDefaultWhy do both readsPrec and readPrec exist, and why does GHC opt to
implement readPrec in derived Read instances instead of readsPrec?
The reason is that readsPrec is based on the ReadS type, and although
ReadS is mentioned in the Haskell 2010 Report, it is not a very efficient
parser data structure.
readPrec, on the other hand, is based on a much more efficient ReadPrec
datatype (a.k.a "new-style parsers"), but its definition relies on the use
of the RankNTypes language extension. Therefore, readPrec (and its
cousin, readListPrec) are marked as GHC-only. Nevertheless, it is
recommended to use readPrec instead of readsPrec whenever possible
for the efficiency improvements it brings.
As mentioned above, derived Read instances in GHC will implement
readPrec instead of readsPrec. The default implementations of
readsPrec (and its cousin, readList) will simply use readPrec under
the hood. If you are writing a Read instance by hand, it is recommended
to write it like so:
instanceReadT wherereadPrec= ...readListPrec=readListPrecDefault
Instances
| Read Bool | Since: base-2.1 |
| Read Char | Since: base-2.1 |
| Read Double | Since: base-2.1 |
| Read Float | Since: base-2.1 |
| Read Int | Since: base-2.1 |
| Read Int8 | Since: base-2.1 |
| Read Int16 | Since: base-2.1 |
| Read Int32 | Since: base-2.1 |
| Read Int64 | Since: base-2.1 |
| Read Integer | Since: base-2.1 |
| Read Natural | Since: base-4.8.0.0 |
| Read Ordering | Since: base-2.1 |
| Read Word | Since: base-4.5.0.0 |
| Read Word8 | Since: base-2.1 |
| Read Word16 | Since: base-2.1 |
| Read Word32 | Since: base-2.1 |
| Read Word64 | Since: base-2.1 |
| Read () | Since: base-2.1 |
| Read Version | Since: base-2.1 |
| Read ByteString | |
Defined in Data.ByteString.Lazy.Internal Methods readsPrec :: Int -> ReadS ByteString # readList :: ReadS [ByteString] # readPrec :: ReadPrec ByteString # readListPrec :: ReadPrec [ByteString] # | |
| Read ByteString | |
Defined in Data.ByteString.Internal Methods readsPrec :: Int -> ReadS ByteString # readList :: ReadS [ByteString] # readPrec :: ReadPrec ByteString # readListPrec :: ReadPrec [ByteString] # | |
| Read Any | Since: base-2.1 |
| Read All | Since: base-2.1 |
| Read Void | Reading a Since: base-4.8.0.0 |
| Read ExitCode | |
| Read BufferMode | Since: base-4.2.0.0 |
Defined in GHC.IO.Handle.Types Methods readsPrec :: Int -> ReadS BufferMode # readList :: ReadS [BufferMode] # readPrec :: ReadPrec BufferMode # readListPrec :: ReadPrec [BufferMode] # | |
| Read Newline | Since: base-4.3.0.0 |
| Read NewlineMode | Since: base-4.3.0.0 |
Defined in GHC.IO.Handle.Types Methods readsPrec :: Int -> ReadS NewlineMode # readList :: ReadS [NewlineMode] # readPrec :: ReadPrec NewlineMode # readListPrec :: ReadPrec [NewlineMode] # | |
| Read SeekMode | Since: base-4.2.0.0 |
| Read Fixity | Since: base-4.6.0.0 |
| Read Associativity | Since: base-4.6.0.0 |
Defined in GHC.Generics Methods readsPrec :: Int -> ReadS Associativity # readList :: ReadS [Associativity] # | |
| Read SourceUnpackedness | Since: base-4.9.0.0 |
Defined in GHC.Generics Methods readsPrec :: Int -> ReadS SourceUnpackedness # readList :: ReadS [SourceUnpackedness] # | |
| Read SourceStrictness | Since: base-4.9.0.0 |
Defined in GHC.Generics Methods readsPrec :: Int -> ReadS SourceStrictness # readList :: ReadS [SourceStrictness] # | |
| Read DecidedStrictness | Since: base-4.9.0.0 |
Defined in GHC.Generics Methods readsPrec :: Int -> ReadS DecidedStrictness # readList :: ReadS [DecidedStrictness] # | |
| Read SomeSymbol | Since: base-4.7.0.0 |
Defined in GHC.TypeLits Methods readsPrec :: Int -> ReadS SomeSymbol # readList :: ReadS [SomeSymbol] # readPrec :: ReadPrec SomeSymbol # readListPrec :: ReadPrec [SomeSymbol] # | |
| Read SomeNat | Since: base-4.7.0.0 |
| Read CChar | |
| Read CSChar | |
| Read CUChar | |
| Read CShort | |
| Read CUShort | |
| Read CInt | |
| Read CUInt | |
| Read CLong | |
| Read CULong | |
| Read CLLong | |
| Read CULLong | |
| Read CBool | |
| Read CFloat | |
| Read CDouble | |
| Read CPtrdiff | |
| Read CSize | |
| Read CWchar | |
| Read CSigAtomic | |
Defined in Foreign.C.Types Methods readsPrec :: Int -> ReadS CSigAtomic # readList :: ReadS [CSigAtomic] # readPrec :: ReadPrec CSigAtomic # readListPrec :: ReadPrec [CSigAtomic] # | |
| Read CClock | |
| Read CTime | |
| Read CUSeconds | |
| Read CSUSeconds | |
Defined in Foreign.C.Types Methods readsPrec :: Int -> ReadS CSUSeconds # readList :: ReadS [CSUSeconds] # readPrec :: ReadPrec CSUSeconds # readListPrec :: ReadPrec [CSUSeconds] # | |
| Read CIntPtr | |
| Read CUIntPtr | |
| Read CIntMax | |
| Read CUIntMax | |
| Read IOMode | Since: base-4.2.0.0 |
| Read Lexeme | Since: base-2.1 |
| Read GeneralCategory | Since: base-2.1 |
Defined in GHC.Read Methods readsPrec :: Int -> ReadS GeneralCategory # readList :: ReadS [GeneralCategory] # | |
| Read IntSet | |
| Read RGBGamut | |
| Read Focus | |
| Read LineNum | |
| Read NestLevel | |
| Read OutputType | |
Defined in Text.Pretty.Simple.Internal.Output Methods readsPrec :: Int -> ReadS OutputType # readList :: ReadS [OutputType] # readPrec :: ReadPrec OutputType # readListPrec :: ReadPrec [OutputType] # | |
| Read Output | |
| Read DatatypeVariant | |
Defined in Language.Haskell.TH.Datatype Methods readsPrec :: Int -> ReadS DatatypeVariant # readList :: ReadS [DatatypeVariant] # | |
| Read a => Read [a] | Since: base-2.1 |
| Read a => Read (Maybe a) | Since: base-2.1 |
| (Integral a, Read a) => Read (Ratio a) | Since: base-2.1 |
| Read p => Read (Par1 p) | Since: base-4.7.0.0 |
| Read a => Read (Last a) | Since: base-4.9.0.0 |
| Read vertex => Read (SCC vertex) | Since: containers-0.5.9 |
| Read a => Read (Complex a) | Since: base-2.1 |
| Read a => Read (Min a) | Since: base-4.9.0.0 |
| Read a => Read (Max a) | Since: base-4.9.0.0 |
| Read a => Read (First a) | Since: base-4.9.0.0 |
| Read m => Read (WrappedMonoid m) | Since: base-4.9.0.0 |
Defined in Data.Semigroup Methods readsPrec :: Int -> ReadS (WrappedMonoid m) # readList :: ReadS [WrappedMonoid m] # readPrec :: ReadPrec (WrappedMonoid m) # readListPrec :: ReadPrec [WrappedMonoid m] # | |
| Read a => Read (Option a) | Since: base-4.9.0.0 |
| Read a => Read (ZipList a) | Since: base-4.7.0.0 |
| Read a => Read (Identity a) | This instance would be equivalent to the derived instances of the
Since: base-4.8.0.0 |
| Read a => Read (First a) | Since: base-2.1 |
| Read a => Read (Last a) | Since: base-2.1 |
| Read a => Read (Dual a) | Since: base-2.1 |
| Read a => Read (Sum a) | Since: base-2.1 |
| Read a => Read (Product a) | Since: base-2.1 |
| Read a => Read (Down a) | Since: base-4.7.0.0 |
| Read a => Read (NonEmpty a) | Since: base-4.11.0.0 |
| Read a => Read (Vector a) | |
| (Eq a, Hashable a, Read a) => Read (HashSet a) | |
| (Read a, Ord a) => Read (Set a) | |
| Read a => Read (Seq a) | |
| Read e => Read (IntMap e) | |
| Read mono => Read (NonNull mono) | |
| Read a => Read (DList a) | |
| Read a => Read (RGB a) | |
| Read a => Read (Tree a) | |
| Read a => Read (ViewL a) | |
| Read a => Read (ViewR a) | |
| (Read a, Prim a) => Read (Vector a) | |
| (Read a, Storable a) => Read (Vector a) | |
| Read a => Read (SmallArray a) | |
Defined in Data.Primitive.SmallArray Methods readsPrec :: Int -> ReadS (SmallArray a) # readList :: ReadS [SmallArray a] # readPrec :: ReadPrec (SmallArray a) # readListPrec :: ReadPrec [SmallArray a] # | |
| Read a => Read (Array a) | |
| Read a => Read (Option a) Source # | |
| (Read a, Read b) => Read (Either a b) | Since: base-3.0 |
| Read (V1 p) | Since: base-4.9.0.0 |
| Read (U1 p) | Since: base-4.9.0.0 |
| (Read a, Read b) => Read (a, b) | Since: base-2.1 |
| (Ord k, Read k, Read e) => Read (Map k e) | |
| (Eq k, Hashable k, Read k, Read e) => Read (HashMap k e) | |
| (Ix a, Read a, Read b) => Read (Array a b) | Since: base-2.1 |
| (Read a, Read b) => Read (Arg a b) | Since: base-4.9.0.0 |
| Read (Proxy t) | Since: base-4.7.0.0 |
| (Read1 m, Read a) => Read (MaybeT m a) | |
| (Read1 f, Read a) => Read (Cofree f a) | |
| (Read1 f, Read a) => Read (Free f a) | |
| (Functor f, Read (f a)) => Read (Yoneda f a) | |
| (Read1 m, Read a) => Read (ListT m a) | |
| Read (f p) => Read (Rec1 f p) | Since: base-4.7.0.0 |
| (Read a, Read b, Read c) => Read (a, b, c) | Since: base-2.1 |
| Read a => Read (Const a b) | This instance would be equivalent to the derived instances of the
Since: base-4.8.0.0 |
| Read (f a) => Read (Ap f a) | Since: base-4.12.0.0 |
| Read (f a) => Read (Alt f a) | Since: base-4.8.0.0 |
| a ~ b => Read (a :~: b) | Since: base-4.7.0.0 |
| Read (p a a) => Read (Join p a) | |
| Read (p (Fix p a) a) => Read (Fix p a) | |
| (Read1 f, Read a) => Read (IdentityT f a) | |
| (Read w, Read1 m, Read a) => Read (WriterT w m a) | |
| (Read w, Read1 m, Read a) => Read (WriterT w m a) | |
| (Read a, Read (f b)) => Read (FreeF f a b) | |
| (Read1 f, Read1 m, Read a) => Read (FreeT f m a) | |
| (Read a, Read (f b)) => Read (CofreeF f a b) | |
| Read (w (CofreeF f a (CofreeT f w a))) => Read (CofreeT f w a) | |
| (Read e, Read1 m, Read a) => Read (ErrorT e m a) | |
| Read b => Read (Tagged s b) | |
| Read c => Read (K1 i c p) | Since: base-4.7.0.0 |
| (Read (f p), Read (g p)) => Read ((f :+: g) p) | Since: base-4.7.0.0 |
| (Read (f p), Read (g p)) => Read ((f :*: g) p) | Since: base-4.7.0.0 |
| (Read a, Read b, Read c, Read d) => Read (a, b, c, d) | Since: base-2.1 |
| (Read1 f, Read1 g, Read a) => Read (Product f g a) | Since: base-4.9.0.0 |
| (Read1 f, Read1 g, Read a) => Read (Sum f g a) | Since: base-4.9.0.0 |
| a ~~ b => Read (a :~~: b) | Since: base-4.10.0.0 |
| Read (f p) => Read (M1 i c f p) | Since: base-4.7.0.0 |
| Read (f (g p)) => Read ((f :.: g) p) | Since: base-4.7.0.0 |
| (Read a, Read b, Read c, Read d, Read e) => Read (a, b, c, d, e) | Since: base-2.1 |
| (Read1 f, Read1 g, Read a) => Read (Compose f g a) | Since: base-4.9.0.0 |
| Read (p a b) => Read (WrappedBifunctor p a b) | |
Defined in Data.Bifunctor.Wrapped Methods readsPrec :: Int -> ReadS (WrappedBifunctor p a b) # readList :: ReadS [WrappedBifunctor p a b] # readPrec :: ReadPrec (WrappedBifunctor p a b) # readListPrec :: ReadPrec [WrappedBifunctor p a b] # | |
| Read (g b) => Read (Joker g a b) | |
| Read (p b a) => Read (Flip p a b) | |
| Read (f a) => Read (Clown f a b) | |
| (Read a, Read b, Read c, Read d, Read e, Read f) => Read (a, b, c, d, e, f) | Since: base-2.1 |
| (Read (p a b), Read (q a b)) => Read (Sum p q a b) | |
| (Read (f a b), Read (g a b)) => Read (Product f g a b) | |
| (Read a, Read b, Read c, Read d, Read e, Read f, Read g) => Read (a, b, c, d, e, f, g) | Since: base-2.1 |
| Read (f (p a b)) => Read (Tannen f p a b) | |
| (Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h) => Read (a, b, c, d, e, f, g, h) | Since: base-2.1 |
| (Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h, Read i) => Read (a, b, c, d, e, f, g, h, i) | Since: base-2.1 |
| Read (p (f a) (g b)) => Read (Biff p f g a b) | |
| (Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h, Read i, Read j) => Read (a, b, c, d, e, f, g, h, i, j) | Since: base-2.1 |
| (Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h, Read i, Read j, Read k) => Read (a, b, c, d, e, f, g, h, i, j, k) | Since: base-2.1 |
| (Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h, Read i, Read j, Read k, Read l) => Read (a, b, c, d, e, f, g, h, i, j, k, l) | Since: base-2.1 |
| (Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h, Read i, Read j, Read k, Read l, Read m) => Read (a, b, c, d, e, f, g, h, i, j, k, l, m) | Since: base-2.1 |
| (Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h, Read i, Read j, Read k, Read l, Read m, Read n) => Read (a, b, c, d, e, f, g, h, i, j, k, l, m, n) | Since: base-2.1 |
| (Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h, Read i, Read j, Read k, Read l, Read m, Read n, Read o) => Read (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) | Since: base-2.1 |
Defined in GHC.Read | |
class (Num a, Ord a) => Real a where #
Methods
toRational :: a -> Rational #
the rational equivalent of its real argument with full precision
Instances
class (RealFrac a, Floating a) => RealFloat a where #
Efficient, machine-independent access to the components of a floating-point number.
Minimal complete definition
floatRadix, floatDigits, floatRange, decodeFloat, encodeFloat, isNaN, isInfinite, isDenormalized, isNegativeZero, isIEEE
Methods
floatRadix :: a -> Integer #
a constant function, returning the radix of the representation
(often 2)
floatDigits :: a -> Int #
a constant function, returning the number of digits of
floatRadix in the significand
floatRange :: a -> (Int, Int) #
a constant function, returning the lowest and highest values the exponent may assume
decodeFloat :: a -> (Integer, Int) #
The function decodeFloat applied to a real floating-point
number returns the significand expressed as an Integer and an
appropriately scaled exponent (an Int). If decodeFloat x(m,n), then x is equal in value to m*b^^n, where b
is the floating-point radix, and furthermore, either m and n
are both zero or else b^(d-1) <= , where abs m < b^dd is
the value of floatDigits xdecodeFloat 0 = (0,0)decodeFloat (-0.0) = (0,0)decodeFloat xisNaN xisInfinite xTrue.
encodeFloat :: Integer -> Int -> a #
encodeFloat performs the inverse of decodeFloat in the
sense that for finite x with the exception of -0.0,
uncurry encodeFloat (decodeFloat x) = xencodeFloat m nm*b^^n (or ±Infinity if overflow
occurs); usually the closer, but if m contains too many bits,
the result may be rounded in the wrong direction.
exponent corresponds to the second component of decodeFloat.
exponent 0 = 0x,
exponent x = snd (decodeFloat x) + floatDigits xx is a finite floating-point number, it is equal in value to
significand x * b ^^ exponent xb is the
floating-point radix.
The behaviour is unspecified on infinite or NaN values.
significand :: a -> a #
The first component of decodeFloat, scaled to lie in the open
interval (-1,1), either 0.0 or of absolute value >= 1/b,
where b is the floating-point radix.
The behaviour is unspecified on infinite or NaN values.
scaleFloat :: Int -> a -> a #
multiplies a floating-point number by an integer power of the radix
True if the argument is an IEEE "not-a-number" (NaN) value
isInfinite :: a -> Bool #
True if the argument is an IEEE infinity or negative infinity
isDenormalized :: a -> Bool #
True if the argument is too small to be represented in
normalized format
isNegativeZero :: a -> Bool #
True if the argument is an IEEE negative zero
True if the argument is an IEEE floating point number
a version of arctangent taking two real floating-point arguments.
For real floating x and y, atan2 y x(x,y). atan2 y x-pi,
pi]. It follows the Common Lisp semantics for the origin when
signed zeroes are supported. atan2 y 1y in a type
that is RealFloat, should return the same value as atan yatan2 is provided, but implementors
can provide a more accurate implementation.
Instances
class (Real a, Fractional a) => RealFrac a where #
Extracting components of fractions.
Minimal complete definition
Methods
properFraction :: Integral b => a -> (b, a) #
The function properFraction takes a real fractional number x
and returns a pair (n,f) such that x = n+f, and:
nis an integral number with the same sign asx; andfis a fraction with the same type and sign asx, and with absolute value less than1.
The default definitions of the ceiling, floor, truncate
and round functions are in terms of properFraction.
truncate :: Integral b => a -> b #
truncate xx between zero and x
round :: Integral b => a -> b #
round xx;
the even integer if x is equidistant between two integers
ceiling :: Integral b => a -> b #
ceiling xx
floor :: Integral b => a -> b #
floor xx
Conversion of values to readable Strings.
Derived instances of Show have the following properties, which
are compatible with derived instances of Read:
- The result of
showis a syntactically correct Haskell expression containing only constants, given the fixity declarations in force at the point where the type is declared. It contains only the constructor names defined in the data type, parentheses, and spaces. When labelled constructor fields are used, braces, commas, field names, and equal signs are also used. - If the constructor is defined to be an infix operator, then
showsPrecwill produce infix applications of the constructor. - the representation will be enclosed in parentheses if the
precedence of the top-level constructor in
xis less thand(associativity is ignored). Thus, ifdis0then the result is never surrounded in parentheses; ifdis11it is always surrounded in parentheses, unless it is an atomic expression. - If the constructor is defined using record syntax, then
showwill produce the record-syntax form, with the fields given in the same order as the original declaration.
For example, given the declarations
infixr 5 :^: data Tree a = Leaf a | Tree a :^: Tree a
the derived instance of Show is equivalent to
instance (Show a) => Show (Tree a) where
showsPrec d (Leaf m) = showParen (d > app_prec) $
showString "Leaf " . showsPrec (app_prec+1) m
where app_prec = 10
showsPrec d (u :^: v) = showParen (d > up_prec) $
showsPrec (up_prec+1) u .
showString " :^: " .
showsPrec (up_prec+1) v
where up_prec = 5Note that right-associativity of :^: is ignored. For example,
show(Leaf 1 :^: Leaf 2 :^: Leaf 3)"Leaf 1 :^: (Leaf 2 :^: Leaf 3)".
Methods
Arguments
| :: Int | the operator precedence of the enclosing
context (a number from |
| -> a | the value to be converted to a |
| -> ShowS |
Convert a value to a readable String.
showsPrec should satisfy the law
showsPrec d x r ++ s == showsPrec d x (r ++ s)
Derived instances of Read and Show satisfy the following:
That is, readsPrec parses the string produced by
showsPrec, and delivers the value that showsPrec started with.
Instances
The class Typeable allows a concrete representation of a type to
be calculated.
Minimal complete definition
typeRep#
Class for string-like datastructures; used by the overloaded string extension (-XOverloadedStrings in GHC).
Methods
fromString :: String -> a #
Instances
class Functor f => Applicative (f :: Type -> Type) where #
A functor with application, providing operations to
A minimal complete definition must include implementations of pure
and of either <*> or liftA2. If it defines both, then they must behave
the same as their default definitions:
(<*>) =liftA2id
liftA2f x y = f<$>x<*>y
Further, any definition must satisfy the following:
- identity
pureid<*>v = v- composition
pure(.)<*>u<*>v<*>w = u<*>(v<*>w)- homomorphism
puref<*>purex =pure(f x)- interchange
u
<*>purey =pure($y)<*>u
The other methods have the following default definitions, which may be overridden with equivalent specialized implementations:
As a consequence of these laws, the Functor instance for f will satisfy
It may be useful to note that supposing
forall x y. p (q x y) = f x . g y
it follows from the above that
liftA2p (liftA2q u v) =liftA2f u .liftA2g v
If f is also a Monad, it should satisfy
(which implies that pure and <*> satisfy the applicative functor laws).
Methods
Lift a value.
(<*>) :: f (a -> b) -> f a -> f b infixl 4 #
Sequential application.
A few functors support an implementation of <*> that is more
efficient than the default one.
liftA2 :: (a -> b -> c) -> f a -> f b -> f c #
Lift a binary function to actions.
Some functors support an implementation of liftA2 that is more
efficient than the default one. In particular, if fmap is an
expensive operation, it is likely better to use liftA2 than to
fmap over the structure and then use <*>.
(*>) :: f a -> f b -> f b infixl 4 #
Sequence actions, discarding the value of the first argument.
(<*) :: f a -> f b -> f a infixl 4 #
Sequence actions, discarding the value of the second argument.
Instances
class Foldable (t :: Type -> Type) #
Data structures that can be folded.
For example, given a data type
data Tree a = Empty | Leaf a | Node (Tree a) a (Tree a)
a suitable instance would be
instance Foldable Tree where foldMap f Empty = mempty foldMap f (Leaf x) = f x foldMap f (Node l k r) = foldMap f l `mappend` f k `mappend` foldMap f r
This is suitable even for abstract types, as the monoid is assumed
to satisfy the monoid laws. Alternatively, one could define foldr:
instance Foldable Tree where foldr f z Empty = z foldr f z (Leaf x) = f x z foldr f z (Node l k r) = foldr f (f k (foldr f z r)) l
Foldable instances are expected to satisfy the following laws:
foldr f z t = appEndo (foldMap (Endo . f) t ) z
foldl f z t = appEndo (getDual (foldMap (Dual . Endo . flip f) t)) z
fold = foldMap id
length = getSum . foldMap (Sum . const 1)
sum, product, maximum, and minimum should all be essentially
equivalent to foldMap forms, such as
sum = getSum . foldMap Sum
but may be less defined.
If the type is also a Functor instance, it should satisfy
foldMap f = fold . fmap f
which implies that
foldMap f . fmap g = foldMap (f . g)
Instances
| Foldable [] | Since: base-2.1 |
Defined in Data.Foldable Methods fold :: Monoid m => [m] -> m # foldMap :: Monoid m => (a -> m) -> [a] -> m # foldr :: (a -> b -> b) -> b -> [a] -> b # foldr' :: (a -> b -> b) -> b -> [a] -> b # foldl :: (b -> a -> b) -> b -> [a] -> b # foldl' :: (b -> a -> b) -> b -> [a] -> b # foldr1 :: (a -> a -> a) -> [a] -> a # foldl1 :: (a -> a -> a) -> [a] -> a # elem :: Eq a => a -> [a] -> Bool # maximum :: Ord a => [a] -> a # | |
| Foldable Maybe | Since: base-2.1 |
Defined in Data.Foldable Methods fold :: Monoid m => Maybe m -> m # foldMap :: Monoid m => (a -> m) -> Maybe a -> m # foldr :: (a -> b -> b) -> b -> Maybe a -> b # foldr' :: (a -> b -> b) -> b -> Maybe a -> b # foldl :: (b -> a -> b) -> b -> Maybe a -> b # foldl' :: (b -> a -> b) -> b -> Maybe a -> b # foldr1 :: (a -> a -> a) -> Maybe a -> a # foldl1 :: (a -> a -> a) -> Maybe a -> a # elem :: Eq a => a -> Maybe a -> Bool # maximum :: Ord a => Maybe a -> a # minimum :: Ord a => Maybe a -> a # | |
| Foldable Par1 | Since: base-4.9.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => Par1 m -> m # foldMap :: Monoid m => (a -> m) -> Par1 a -> m # foldr :: (a -> b -> b) -> b -> Par1 a -> b # foldr' :: (a -> b -> b) -> b -> Par1 a -> b # foldl :: (b -> a -> b) -> b -> Par1 a -> b # foldl' :: (b -> a -> b) -> b -> Par1 a -> b # foldr1 :: (a -> a -> a) -> Par1 a -> a # foldl1 :: (a -> a -> a) -> Par1 a -> a # elem :: Eq a => a -> Par1 a -> Bool # maximum :: Ord a => Par1 a -> a # | |
| Foldable Last | Since: base-4.9.0.0 |
Defined in Data.Semigroup Methods fold :: Monoid m => Last m -> m # foldMap :: Monoid m => (a -> m) -> Last a -> m # foldr :: (a -> b -> b) -> b -> Last a -> b # foldr' :: (a -> b -> b) -> b -> Last a -> b # foldl :: (b -> a -> b) -> b -> Last a -> b # foldl' :: (b -> a -> b) -> b -> Last a -> b # foldr1 :: (a -> a -> a) -> Last a -> a # foldl1 :: (a -> a -> a) -> Last a -> a # elem :: Eq a => a -> Last a -> Bool # maximum :: Ord a => Last a -> a # | |
| Foldable SCC | Since: containers-0.5.9 |
Defined in Data.Graph Methods fold :: Monoid m => SCC m -> m # foldMap :: Monoid m => (a -> m) -> SCC a -> m # foldr :: (a -> b -> b) -> b -> SCC a -> b # foldr' :: (a -> b -> b) -> b -> SCC a -> b # foldl :: (b -> a -> b) -> b -> SCC a -> b # foldl' :: (b -> a -> b) -> b -> SCC a -> b # foldr1 :: (a -> a -> a) -> SCC a -> a # foldl1 :: (a -> a -> a) -> SCC a -> a # elem :: Eq a => a -> SCC a -> Bool # maximum :: Ord a => SCC a -> a # | |
| Foldable Complex | Since: base-4.9.0.0 |
Defined in Data.Complex Methods fold :: Monoid m => Complex m -> m # foldMap :: Monoid m => (a -> m) -> Complex a -> m # foldr :: (a -> b -> b) -> b -> Complex a -> b # foldr' :: (a -> b -> b) -> b -> Complex a -> b # foldl :: (b -> a -> b) -> b -> Complex a -> b # foldl' :: (b -> a -> b) -> b -> Complex a -> b # foldr1 :: (a -> a -> a) -> Complex a -> a # foldl1 :: (a -> a -> a) -> Complex a -> a # elem :: Eq a => a -> Complex a -> Bool # maximum :: Ord a => Complex a -> a # minimum :: Ord a => Complex a -> a # | |
| Foldable Min | Since: base-4.9.0.0 |
Defined in Data.Semigroup Methods fold :: Monoid m => Min m -> m # foldMap :: Monoid m => (a -> m) -> Min a -> m # foldr :: (a -> b -> b) -> b -> Min a -> b # foldr' :: (a -> b -> b) -> b -> Min a -> b # foldl :: (b -> a -> b) -> b -> Min a -> b # foldl' :: (b -> a -> b) -> b -> Min a -> b # foldr1 :: (a -> a -> a) -> Min a -> a # foldl1 :: (a -> a -> a) -> Min a -> a # elem :: Eq a => a -> Min a -> Bool # maximum :: Ord a => Min a -> a # | |
| Foldable Max | Since: base-4.9.0.0 |
Defined in Data.Semigroup Methods fold :: Monoid m => Max m -> m # foldMap :: Monoid m => (a -> m) -> Max a -> m # foldr :: (a -> b -> b) -> b -> Max a -> b # foldr' :: (a -> b -> b) -> b -> Max a -> b # foldl :: (b -> a -> b) -> b -> Max a -> b # foldl' :: (b -> a -> b) -> b -> Max a -> b # foldr1 :: (a -> a -> a) -> Max a -> a # foldl1 :: (a -> a -> a) -> Max a -> a # elem :: Eq a => a -> Max a -> Bool # maximum :: Ord a => Max a -> a # | |
| Foldable First | Since: base-4.9.0.0 |
Defined in Data.Semigroup Methods fold :: Monoid m => First m -> m # foldMap :: Monoid m => (a -> m) -> First a -> m # foldr :: (a -> b -> b) -> b -> First a -> b # foldr' :: (a -> b -> b) -> b -> First a -> b # foldl :: (b -> a -> b) -> b -> First a -> b # foldl' :: (b -> a -> b) -> b -> First a -> b # foldr1 :: (a -> a -> a) -> First a -> a # foldl1 :: (a -> a -> a) -> First a -> a # elem :: Eq a => a -> First a -> Bool # maximum :: Ord a => First a -> a # minimum :: Ord a => First a -> a # | |
| Foldable Option | Since: base-4.9.0.0 |
Defined in Data.Semigroup Methods fold :: Monoid m => Option m -> m # foldMap :: Monoid m => (a -> m) -> Option a -> m # foldr :: (a -> b -> b) -> b -> Option a -> b # foldr' :: (a -> b -> b) -> b -> Option a -> b # foldl :: (b -> a -> b) -> b -> Option a -> b # foldl' :: (b -> a -> b) -> b -> Option a -> b # foldr1 :: (a -> a -> a) -> Option a -> a # foldl1 :: (a -> a -> a) -> Option a -> a # elem :: Eq a => a -> Option a -> Bool # maximum :: Ord a => Option a -> a # minimum :: Ord a => Option a -> a # | |
| Foldable ZipList | Since: base-4.9.0.0 |
Defined in Control.Applicative Methods fold :: Monoid m => ZipList m -> m # foldMap :: Monoid m => (a -> m) -> ZipList a -> m # foldr :: (a -> b -> b) -> b -> ZipList a -> b # foldr' :: (a -> b -> b) -> b -> ZipList a -> b # foldl :: (b -> a -> b) -> b -> ZipList a -> b # foldl' :: (b -> a -> b) -> b -> ZipList a -> b # foldr1 :: (a -> a -> a) -> ZipList a -> a # foldl1 :: (a -> a -> a) -> ZipList a -> a # elem :: Eq a => a -> ZipList a -> Bool # maximum :: Ord a => ZipList a -> a # minimum :: Ord a => ZipList a -> a # | |
| Foldable Identity | Since: base-4.8.0.0 |
Defined in Data.Functor.Identity Methods fold :: Monoid m => Identity m -> m # foldMap :: Monoid m => (a -> m) -> Identity a -> m # foldr :: (a -> b -> b) -> b -> Identity a -> b # foldr' :: (a -> b -> b) -> b -> Identity a -> b # foldl :: (b -> a -> b) -> b -> Identity a -> b # foldl' :: (b -> a -> b) -> b -> Identity a -> b # foldr1 :: (a -> a -> a) -> Identity a -> a # foldl1 :: (a -> a -> a) -> Identity a -> a # elem :: Eq a => a -> Identity a -> Bool # maximum :: Ord a => Identity a -> a # minimum :: Ord a => Identity a -> a # | |
| Foldable First | Since: base-4.8.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => First m -> m # foldMap :: Monoid m => (a -> m) -> First a -> m # foldr :: (a -> b -> b) -> b -> First a -> b # foldr' :: (a -> b -> b) -> b -> First a -> b # foldl :: (b -> a -> b) -> b -> First a -> b # foldl' :: (b -> a -> b) -> b -> First a -> b # foldr1 :: (a -> a -> a) -> First a -> a # foldl1 :: (a -> a -> a) -> First a -> a # elem :: Eq a => a -> First a -> Bool # maximum :: Ord a => First a -> a # minimum :: Ord a => First a -> a # | |
| Foldable Last | Since: base-4.8.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => Last m -> m # foldMap :: Monoid m => (a -> m) -> Last a -> m # foldr :: (a -> b -> b) -> b -> Last a -> b # foldr' :: (a -> b -> b) -> b -> Last a -> b # foldl :: (b -> a -> b) -> b -> Last a -> b # foldl' :: (b -> a -> b) -> b -> Last a -> b # foldr1 :: (a -> a -> a) -> Last a -> a # foldl1 :: (a -> a -> a) -> Last a -> a # elem :: Eq a => a -> Last a -> Bool # maximum :: Ord a => Last a -> a # | |
| Foldable Dual | Since: base-4.8.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => Dual m -> m # foldMap :: Monoid m => (a -> m) -> Dual a -> m # foldr :: (a -> b -> b) -> b -> Dual a -> b # foldr' :: (a -> b -> b) -> b -> Dual a -> b # foldl :: (b -> a -> b) -> b -> Dual a -> b # foldl' :: (b -> a -> b) -> b -> Dual a -> b # foldr1 :: (a -> a -> a) -> Dual a -> a # foldl1 :: (a -> a -> a) -> Dual a -> a # elem :: Eq a => a -> Dual a -> Bool # maximum :: Ord a => Dual a -> a # | |
| Foldable Sum | Since: base-4.8.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => Sum m -> m # foldMap :: Monoid m => (a -> m) -> Sum a -> m # foldr :: (a -> b -> b) -> b -> Sum a -> b # foldr' :: (a -> b -> b) -> b -> Sum a -> b # foldl :: (b -> a -> b) -> b -> Sum a -> b # foldl' :: (b -> a -> b) -> b -> Sum a -> b # foldr1 :: (a -> a -> a) -> Sum a -> a # foldl1 :: (a -> a -> a) -> Sum a -> a # elem :: Eq a => a -> Sum a -> Bool # maximum :: Ord a => Sum a -> a # | |
| Foldable Product | Since: base-4.8.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => Product m -> m # foldMap :: Monoid m => (a -> m) -> Product a -> m # foldr :: (a -> b -> b) -> b -> Product a -> b # foldr' :: (a -> b -> b) -> b -> Product a -> b # foldl :: (b -> a -> b) -> b -> Product a -> b # foldl' :: (b -> a -> b) -> b -> Product a -> b # foldr1 :: (a -> a -> a) -> Product a -> a # foldl1 :: (a -> a -> a) -> Product a -> a # elem :: Eq a => a -> Product a -> Bool # maximum :: Ord a => Product a -> a # minimum :: Ord a => Product a -> a # | |
| Foldable Down | Since: base-4.12.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => Down m -> m # foldMap :: Monoid m => (a -> m) -> Down a -> m # foldr :: (a -> b -> b) -> b -> Down a -> b # foldr' :: (a -> b -> b) -> b -> Down a -> b # foldl :: (b -> a -> b) -> b -> Down a -> b # foldl' :: (b -> a -> b) -> b -> Down a -> b # foldr1 :: (a -> a -> a) -> Down a -> a # foldl1 :: (a -> a -> a) -> Down a -> a # elem :: Eq a => a -> Down a -> Bool # maximum :: Ord a => Down a -> a # | |
| Foldable NonEmpty | Since: base-4.9.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => NonEmpty m -> m # foldMap :: Monoid m => (a -> m) -> NonEmpty a -> m # foldr :: (a -> b -> b) -> b -> NonEmpty a -> b # foldr' :: (a -> b -> b) -> b -> NonEmpty a -> b # foldl :: (b -> a -> b) -> b -> NonEmpty a -> b # foldl' :: (b -> a -> b) -> b -> NonEmpty a -> b # foldr1 :: (a -> a -> a) -> NonEmpty a -> a # foldl1 :: (a -> a -> a) -> NonEmpty a -> a # elem :: Eq a => a -> NonEmpty a -> Bool # maximum :: Ord a => NonEmpty a -> a # minimum :: Ord a => NonEmpty a -> a # | |
| Foldable Vector | |
Defined in Data.Vector Methods fold :: Monoid m => Vector m -> m # foldMap :: Monoid m => (a -> m) -> Vector a -> m # foldr :: (a -> b -> b) -> b -> Vector a -> b # foldr' :: (a -> b -> b) -> b -> Vector a -> b # foldl :: (b -> a -> b) -> b -> Vector a -> b # foldl' :: (b -> a -> b) -> b -> Vector a -> b # foldr1 :: (a -> a -> a) -> Vector a -> a # foldl1 :: (a -> a -> a) -> Vector a -> a # elem :: Eq a => a -> Vector a -> Bool # maximum :: Ord a => Vector a -> a # minimum :: Ord a => Vector a -> a # | |
| Foldable HashSet | |
Defined in Data.HashSet Methods fold :: Monoid m => HashSet m -> m # foldMap :: Monoid m => (a -> m) -> HashSet a -> m # foldr :: (a -> b -> b) -> b -> HashSet a -> b # foldr' :: (a -> b -> b) -> b -> HashSet a -> b # foldl :: (b -> a -> b) -> b -> HashSet a -> b # foldl' :: (b -> a -> b) -> b -> HashSet a -> b # foldr1 :: (a -> a -> a) -> HashSet a -> a # foldl1 :: (a -> a -> a) -> HashSet a -> a # elem :: Eq a => a -> HashSet a -> Bool # maximum :: Ord a => HashSet a -> a # minimum :: Ord a => HashSet a -> a # | |
| Foldable Set | |
Defined in Data.Set.Internal Methods fold :: Monoid m => Set m -> m # foldMap :: Monoid m => (a -> m) -> Set a -> m # foldr :: (a -> b -> b) -> b -> Set a -> b # foldr' :: (a -> b -> b) -> b -> Set a -> b # foldl :: (b -> a -> b) -> b -> Set a -> b # foldl' :: (b -> a -> b) -> b -> Set a -> b # foldr1 :: (a -> a -> a) -> Set a -> a # foldl1 :: (a -> a -> a) -> Set a -> a # elem :: Eq a => a -> Set a -> Bool # maximum :: Ord a => Set a -> a # | |
| Foldable Seq | |
Defined in Data.Sequence.Internal Methods fold :: Monoid m => Seq m -> m # foldMap :: Monoid m => (a -> m) -> Seq a -> m # foldr :: (a -> b -> b) -> b -> Seq a -> b # foldr' :: (a -> b -> b) -> b -> Seq a -> b # foldl :: (b -> a -> b) -> b -> Seq a -> b # foldl' :: (b -> a -> b) -> b -> Seq a -> b # foldr1 :: (a -> a -> a) -> Seq a -> a # foldl1 :: (a -> a -> a) -> Seq a -> a # elem :: Eq a => a -> Seq a -> Bool # maximum :: Ord a => Seq a -> a # | |
| Foldable IntMap | |
Defined in Data.IntMap.Internal Methods fold :: Monoid m => IntMap m -> m # foldMap :: Monoid m => (a -> m) -> IntMap a -> m # foldr :: (a -> b -> b) -> b -> IntMap a -> b # foldr' :: (a -> b -> b) -> b -> IntMap a -> b # foldl :: (b -> a -> b) -> b -> IntMap a -> b # foldl' :: (b -> a -> b) -> b -> IntMap a -> b # foldr1 :: (a -> a -> a) -> IntMap a -> a # foldl1 :: (a -> a -> a) -> IntMap a -> a # elem :: Eq a => a -> IntMap a -> Bool # maximum :: Ord a => IntMap a -> a # minimum :: Ord a => IntMap a -> a # | |
| Foldable DList | |
Defined in Data.DList Methods fold :: Monoid m => DList m -> 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 Tree | |
Defined in Data.Tree Methods fold :: Monoid m => Tree m -> m # foldMap :: Monoid m => (a -> m) -> Tree a -> m # foldr :: (a -> b -> b) -> b -> Tree a -> b # foldr' :: (a -> b -> b) -> b -> Tree a -> b # foldl :: (b -> a -> b) -> b -> Tree a -> b # foldl' :: (b -> a -> b) -> b -> Tree a -> b # foldr1 :: (a -> a -> a) -> Tree a -> a # foldl1 :: (a -> a -> a) -> Tree a -> a # elem :: Eq a => a -> Tree a -> Bool # maximum :: Ord a => Tree a -> a # | |
| Foldable FingerTree | |
Defined in Data.Sequence.Internal Methods fold :: Monoid m => FingerTree m -> m # foldMap :: Monoid m => (a -> m) -> FingerTree a -> m # foldr :: (a -> b -> b) -> b -> FingerTree a -> b # foldr' :: (a -> b -> b) -> b -> FingerTree a -> b # foldl :: (b -> a -> b) -> b -> FingerTree a -> b # foldl' :: (b -> a -> b) -> b -> FingerTree a -> b # foldr1 :: (a -> a -> a) -> FingerTree a -> a # foldl1 :: (a -> a -> a) -> FingerTree a -> a # toList :: FingerTree a -> [a] # null :: FingerTree a -> Bool # length :: FingerTree a -> Int # elem :: Eq a => a -> FingerTree a -> Bool # maximum :: Ord a => FingerTree a -> a # minimum :: Ord a => FingerTree a -> a # sum :: Num a => FingerTree a -> a # product :: Num a => FingerTree a -> a # | |
| Foldable Digit | |
Defined in Data.Sequence.Internal Methods fold :: Monoid m => Digit m -> m # foldMap :: Monoid m => (a -> m) -> Digit a -> m # foldr :: (a -> b -> b) -> b -> Digit a -> b # foldr' :: (a -> b -> b) -> b -> Digit a -> b # foldl :: (b -> a -> b) -> b -> Digit a -> b # foldl' :: (b -> a -> b) -> b -> Digit a -> b # foldr1 :: (a -> a -> a) -> Digit a -> a # foldl1 :: (a -> a -> a) -> Digit a -> a # elem :: Eq a => a -> Digit a -> Bool # maximum :: Ord a => Digit a -> a # minimum :: Ord a => Digit a -> a # | |
| Foldable Node | |
Defined in Data.Sequence.Internal Methods fold :: Monoid m => Node m -> m # foldMap :: Monoid m => (a -> m) -> Node a -> m # foldr :: (a -> b -> b) -> b -> Node a -> b # foldr' :: (a -> b -> b) -> b -> Node a -> b # foldl :: (b -> a -> b) -> b -> Node a -> b # foldl' :: (b -> a -> b) -> b -> Node a -> b # foldr1 :: (a -> a -> a) -> Node a -> a # foldl1 :: (a -> a -> a) -> Node a -> a # elem :: Eq a => a -> Node a -> Bool # maximum :: Ord a => Node a -> a # | |
| Foldable Elem | |
Defined in Data.Sequence.Internal Methods fold :: Monoid m => Elem m -> m # foldMap :: Monoid m => (a -> m) -> Elem a -> m # foldr :: (a -> b -> b) -> b -> Elem a -> b # foldr' :: (a -> b -> b) -> b -> Elem a -> b # foldl :: (b -> a -> b) -> b -> Elem a -> b # foldl' :: (b -> a -> b) -> b -> Elem a -> b # foldr1 :: (a -> a -> a) -> Elem a -> a # foldl1 :: (a -> a -> a) -> Elem a -> a # elem :: Eq a => a -> Elem a -> Bool # maximum :: Ord a => Elem a -> a # | |
| Foldable ViewL | |
Defined in Data.Sequence.Internal Methods fold :: Monoid m => ViewL m -> m # foldMap :: Monoid m => (a -> m) -> ViewL a -> m # foldr :: (a -> b -> b) -> b -> ViewL a -> b # foldr' :: (a -> b -> b) -> b -> ViewL a -> b # foldl :: (b -> a -> b) -> b -> ViewL a -> b # foldl' :: (b -> a -> b) -> b -> ViewL a -> b # foldr1 :: (a -> a -> a) -> ViewL a -> a # foldl1 :: (a -> a -> a) -> ViewL a -> a # elem :: Eq a => a -> ViewL a -> Bool # maximum :: Ord a => ViewL a -> a # minimum :: Ord a => ViewL a -> a # | |
| Foldable ViewR | |
Defined in Data.Sequence.Internal Methods fold :: Monoid m => ViewR m -> m # foldMap :: Monoid m => (a -> m) -> ViewR a -> m # foldr :: (a -> b -> b) -> b -> ViewR a -> b # foldr' :: (a -> b -> b) -> b -> ViewR a -> b # foldl :: (b -> a -> b) -> b -> ViewR a -> b # foldl' :: (b -> a -> b) -> b -> ViewR a -> b # foldr1 :: (a -> a -> a) -> ViewR a -> a # foldl1 :: (a -> a -> a) -> ViewR a -> a # elem :: Eq a => a -> ViewR a -> Bool # maximum :: Ord a => ViewR a -> a # minimum :: Ord a => ViewR a -> a # | |
| Foldable FocusList | |
Defined in Data.FocusList Methods fold :: Monoid m => FocusList m -> m # foldMap :: Monoid m => (a -> m) -> FocusList a -> m # foldr :: (a -> b -> b) -> b -> FocusList a -> b # foldr' :: (a -> b -> b) -> b -> FocusList a -> b # foldl :: (b -> a -> b) -> b -> FocusList a -> b # foldl' :: (b -> a -> b) -> b -> FocusList a -> b # foldr1 :: (a -> a -> a) -> FocusList a -> a # foldl1 :: (a -> a -> a) -> FocusList a -> a # toList :: FocusList a -> [a] # length :: FocusList a -> Int # elem :: Eq a => a -> FocusList a -> Bool # maximum :: Ord a => FocusList a -> a # minimum :: Ord a => FocusList a -> a # | |
| Foldable Hashed | |
Defined in Data.Hashable.Class Methods fold :: Monoid m => Hashed m -> m # foldMap :: Monoid m => (a -> m) -> Hashed a -> m # foldr :: (a -> b -> b) -> b -> Hashed a -> b # foldr' :: (a -> b -> b) -> b -> Hashed a -> b # foldl :: (b -> a -> b) -> b -> Hashed a -> b # foldl' :: (b -> a -> b) -> b -> Hashed a -> b # foldr1 :: (a -> a -> a) -> Hashed a -> a # foldl1 :: (a -> a -> a) -> Hashed a -> a # elem :: Eq a => a -> Hashed a -> Bool # maximum :: Ord a => Hashed a -> a # minimum :: Ord a => Hashed a -> a # | |
| Foldable SmallArray | |
Defined in Data.Primitive.SmallArray Methods fold :: Monoid m => SmallArray m -> m # foldMap :: Monoid m => (a -> m) -> SmallArray a -> m # foldr :: (a -> b -> b) -> b -> SmallArray a -> b # foldr' :: (a -> b -> b) -> b -> SmallArray a -> b # foldl :: (b -> a -> b) -> b -> SmallArray a -> b # foldl' :: (b -> a -> b) -> b -> SmallArray a -> b # foldr1 :: (a -> a -> a) -> SmallArray a -> a # foldl1 :: (a -> a -> a) -> SmallArray a -> a # toList :: SmallArray a -> [a] # null :: SmallArray a -> Bool # length :: SmallArray a -> Int # elem :: Eq a => a -> SmallArray a -> Bool # maximum :: Ord a => SmallArray a -> a # minimum :: Ord a => SmallArray a -> a # sum :: Num a => SmallArray a -> a # product :: Num a => SmallArray a -> a # | |
| Foldable Array | |
Defined in Data.Primitive.Array Methods fold :: Monoid m => Array m -> m # foldMap :: Monoid m => (a -> m) -> Array a -> m # foldr :: (a -> b -> b) -> b -> Array a -> b # foldr' :: (a -> b -> b) -> b -> Array a -> b # foldl :: (b -> a -> b) -> b -> Array a -> b # foldl' :: (b -> a -> b) -> b -> Array a -> b # foldr1 :: (a -> a -> a) -> Array a -> a # foldl1 :: (a -> a -> a) -> Array a -> a # elem :: Eq a => a -> Array a -> Bool # maximum :: Ord a => Array a -> a # minimum :: Ord a => Array a -> a # | |
| Foldable Option Source # | |
Defined in Termonad.Types Methods fold :: Monoid m => Option m -> m # foldMap :: Monoid m => (a -> m) -> Option a -> m # foldr :: (a -> b -> b) -> b -> Option a -> b # foldr' :: (a -> b -> b) -> b -> Option a -> b # foldl :: (b -> a -> b) -> b -> Option a -> b # foldl' :: (b -> a -> b) -> b -> Option a -> b # foldr1 :: (a -> a -> a) -> Option a -> a # foldl1 :: (a -> a -> a) -> Option a -> a # elem :: Eq a => a -> Option a -> Bool # maximum :: Ord a => Option a -> a # minimum :: Ord a => Option a -> a # | |
| Foldable Palette Source # | |
Defined in Termonad.Config.Colour Methods fold :: Monoid m => Palette m -> m # foldMap :: Monoid m => (a -> m) -> Palette a -> m # foldr :: (a -> b -> b) -> b -> Palette a -> b # foldr' :: (a -> b -> b) -> b -> Palette a -> b # foldl :: (b -> a -> b) -> b -> Palette a -> b # foldl' :: (b -> a -> b) -> b -> Palette a -> b # foldr1 :: (a -> a -> a) -> Palette a -> a # foldl1 :: (a -> a -> a) -> Palette a -> a # elem :: Eq a => a -> Palette a -> Bool # maximum :: Ord a => Palette a -> a # minimum :: Ord a => Palette a -> a # | |
| Foldable (Either a) | Since: base-4.7.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => Either a m -> m # foldMap :: Monoid m => (a0 -> m) -> Either a a0 -> m # foldr :: (a0 -> b -> b) -> b -> Either a a0 -> b # foldr' :: (a0 -> b -> b) -> b -> Either a a0 -> b # foldl :: (b -> a0 -> b) -> b -> Either a a0 -> b # foldl' :: (b -> a0 -> b) -> b -> Either a a0 -> b # foldr1 :: (a0 -> a0 -> a0) -> Either a a0 -> a0 # foldl1 :: (a0 -> a0 -> a0) -> Either a a0 -> a0 # toList :: Either a a0 -> [a0] # length :: Either a a0 -> Int # elem :: Eq a0 => a0 -> Either a a0 -> Bool # maximum :: Ord a0 => Either a a0 -> a0 # minimum :: Ord a0 => Either a a0 -> a0 # | |
| Foldable (V1 :: Type -> Type) | Since: base-4.9.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => V1 m -> m # foldMap :: Monoid m => (a -> m) -> V1 a -> m # foldr :: (a -> b -> b) -> b -> V1 a -> b # foldr' :: (a -> b -> b) -> b -> V1 a -> b # foldl :: (b -> a -> b) -> b -> V1 a -> b # foldl' :: (b -> a -> b) -> b -> V1 a -> b # foldr1 :: (a -> a -> a) -> V1 a -> a # foldl1 :: (a -> a -> a) -> V1 a -> a # elem :: Eq a => a -> V1 a -> Bool # maximum :: Ord a => V1 a -> a # | |
| Foldable (U1 :: Type -> Type) | Since: base-4.9.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => U1 m -> m # foldMap :: Monoid m => (a -> m) -> U1 a -> m # foldr :: (a -> b -> b) -> b -> U1 a -> b # foldr' :: (a -> b -> b) -> b -> U1 a -> b # foldl :: (b -> a -> b) -> b -> U1 a -> b # foldl' :: (b -> a -> b) -> b -> U1 a -> b # foldr1 :: (a -> a -> a) -> U1 a -> a # foldl1 :: (a -> a -> a) -> U1 a -> a # elem :: Eq a => a -> U1 a -> Bool # maximum :: Ord a => U1 a -> a # | |
| Foldable ((,) a) | Since: base-4.7.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => (a, m) -> m # foldMap :: Monoid m => (a0 -> m) -> (a, a0) -> m # foldr :: (a0 -> b -> b) -> b -> (a, a0) -> b # foldr' :: (a0 -> b -> b) -> b -> (a, a0) -> b # foldl :: (b -> a0 -> b) -> b -> (a, a0) -> b # foldl' :: (b -> a0 -> b) -> b -> (a, a0) -> b # foldr1 :: (a0 -> a0 -> a0) -> (a, a0) -> a0 # foldl1 :: (a0 -> a0 -> a0) -> (a, a0) -> a0 # elem :: Eq a0 => a0 -> (a, a0) -> Bool # maximum :: Ord a0 => (a, a0) -> a0 # minimum :: Ord a0 => (a, a0) -> a0 # | |
| Foldable (Map k) | |
Defined in Data.Map.Internal Methods fold :: Monoid m => Map k m -> m # foldMap :: Monoid m => (a -> m) -> Map k a -> m # foldr :: (a -> b -> b) -> b -> Map k a -> b # foldr' :: (a -> b -> b) -> b -> Map k a -> b # foldl :: (b -> a -> b) -> b -> Map k a -> b # foldl' :: (b -> a -> b) -> b -> Map k a -> b # foldr1 :: (a -> a -> a) -> Map k a -> a # foldl1 :: (a -> a -> a) -> Map k a -> a # elem :: Eq a => a -> Map k a -> Bool # maximum :: Ord a => Map k a -> a # minimum :: Ord a => Map k a -> a # | |
| Foldable (HashMap k) | |
Defined in Data.HashMap.Base Methods fold :: Monoid m => HashMap k m -> m # foldMap :: Monoid m => (a -> m) -> HashMap k a -> m # foldr :: (a -> b -> b) -> b -> HashMap k a -> b # foldr' :: (a -> b -> b) -> b -> HashMap k a -> b # foldl :: (b -> a -> b) -> b -> HashMap k a -> b # foldl' :: (b -> a -> b) -> b -> HashMap k a -> b # foldr1 :: (a -> a -> a) -> HashMap k a -> a # foldl1 :: (a -> a -> a) -> HashMap k a -> a # toList :: HashMap k a -> [a] # length :: HashMap k a -> Int # elem :: Eq a => a -> HashMap k a -> Bool # maximum :: Ord a => HashMap k a -> a # minimum :: Ord a => HashMap k a -> a # | |
| Foldable (Array i) | Since: base-4.8.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => Array i m -> m # foldMap :: Monoid m => (a -> m) -> Array i a -> m # foldr :: (a -> b -> b) -> b -> Array i a -> b # foldr' :: (a -> b -> b) -> b -> Array i a -> b # foldl :: (b -> a -> b) -> b -> Array i a -> b # foldl' :: (b -> a -> b) -> b -> Array i a -> b # foldr1 :: (a -> a -> a) -> Array i a -> a # foldl1 :: (a -> a -> a) -> Array i a -> a # elem :: Eq a => a -> Array i a -> Bool # maximum :: Ord a => Array i a -> a # minimum :: Ord a => Array i a -> a # | |
| Foldable (Arg a) | Since: base-4.9.0.0 |
Defined in Data.Semigroup Methods fold :: Monoid m => Arg a m -> m # foldMap :: Monoid m => (a0 -> m) -> Arg a a0 -> m # foldr :: (a0 -> b -> b) -> b -> Arg a a0 -> b # foldr' :: (a0 -> b -> b) -> b -> Arg a a0 -> b # foldl :: (b -> a0 -> b) -> b -> Arg a a0 -> b # foldl' :: (b -> a0 -> b) -> b -> Arg a a0 -> b # foldr1 :: (a0 -> a0 -> a0) -> Arg a a0 -> a0 # foldl1 :: (a0 -> a0 -> a0) -> Arg a a0 -> a0 # elem :: Eq a0 => a0 -> Arg a a0 -> Bool # maximum :: Ord a0 => Arg a a0 -> a0 # minimum :: Ord a0 => Arg a a0 -> a0 # | |
| Foldable (Proxy :: Type -> Type) | Since: base-4.7.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => Proxy m -> m # foldMap :: Monoid m => (a -> m) -> Proxy a -> m # foldr :: (a -> b -> b) -> b -> Proxy a -> b # foldr' :: (a -> b -> b) -> b -> Proxy a -> b # foldl :: (b -> a -> b) -> b -> Proxy a -> b # foldl' :: (b -> a -> b) -> b -> Proxy a -> b # foldr1 :: (a -> a -> a) -> Proxy a -> a # foldl1 :: (a -> a -> a) -> Proxy a -> a # elem :: Eq a => a -> Proxy a -> Bool # maximum :: Ord a => Proxy a -> a # minimum :: Ord a => Proxy a -> a # | |
| Foldable 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 # foldr :: (a -> b -> b) -> b -> MaybeT f a -> b # foldr' :: (a -> b -> b) -> b -> MaybeT f a -> b # foldl :: (b -> a -> b) -> b -> MaybeT f a -> b # foldl' :: (b -> a -> b) -> b -> MaybeT f a -> b # foldr1 :: (a -> a -> a) -> MaybeT f a -> a # foldl1 :: (a -> a -> a) -> MaybeT f a -> a # elem :: Eq a => a -> MaybeT f a -> Bool # maximum :: Ord a => MaybeT f a -> a # minimum :: Ord a => MaybeT f a -> a # | |
| Foldable f => Foldable (Cofree f) | |
Defined in Control.Comonad.Cofree Methods fold :: Monoid m => Cofree f m -> m # foldMap :: Monoid m => (a -> m) -> Cofree f a -> m # 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 # foldr :: (a -> b -> b) -> b -> Free f a -> b # foldr' :: (a -> b -> b) -> b -> Free f a -> b # foldl :: (b -> a -> b) -> b -> Free f a -> b # foldl' :: (b -> a -> b) -> b -> Free f a -> b # foldr1 :: (a -> a -> a) -> Free f a -> a # foldl1 :: (a -> a -> a) -> Free f a -> a # elem :: Eq a => a -> Free f a -> Bool # maximum :: Ord a => Free f a -> a # minimum :: Ord a => Free f a -> a # | |
| Foldable f => Foldable (Yoneda f) | |
Defined in Data.Functor.Yoneda Methods fold :: Monoid m => Yoneda f m -> m # foldMap :: Monoid m => (a -> m) -> Yoneda f a -> m # foldr :: (a -> b -> b) -> b -> Yoneda f a -> b # foldr' :: (a -> b -> b) -> b -> Yoneda f a -> b # foldl :: (b -> a -> b) -> b -> Yoneda f a -> b # foldl' :: (b -> a -> b) -> b -> Yoneda f a -> b # foldr1 :: (a -> a -> a) -> Yoneda f a -> a # foldl1 :: (a -> a -> a) -> Yoneda f a -> a # elem :: Eq a => a -> Yoneda f a -> Bool # maximum :: Ord a => Yoneda f a -> a # minimum :: Ord a => Yoneda f a -> a # | |
| Foldable f => Foldable (ListT f) | |
Defined in Control.Monad.Trans.List Methods fold :: Monoid m => ListT f m -> m # foldMap :: Monoid m => (a -> m) -> ListT f a -> m # foldr :: (a -> b -> b) -> b -> ListT f a -> b # foldr' :: (a -> b -> b) -> b -> ListT f a -> b # foldl :: (b -> a -> b) -> b -> ListT f a -> b # foldl' :: (b -> a -> b) -> b -> ListT f a -> b # foldr1 :: (a -> a -> a) -> ListT f a -> a # foldl1 :: (a -> a -> a) -> ListT f a -> a # elem :: Eq a => a -> ListT f a -> Bool # maximum :: Ord a => ListT f a -> a # minimum :: Ord a => ListT f a -> a # | |
| SingI ns => Foldable (Matrix ns) Source # | |
Defined in Termonad.Config.Vec Methods fold :: Monoid m => Matrix ns m -> m # foldMap :: Monoid m => (a -> m) -> Matrix ns a -> m # foldr :: (a -> b -> b) -> b -> Matrix ns a -> b # foldr' :: (a -> b -> b) -> b -> Matrix ns a -> b # foldl :: (b -> a -> b) -> b -> Matrix ns a -> b # foldl' :: (b -> a -> b) -> b -> Matrix ns a -> b # foldr1 :: (a -> a -> a) -> Matrix ns a -> a # foldl1 :: (a -> a -> a) -> Matrix ns a -> a # toList :: Matrix ns a -> [a] # length :: Matrix ns a -> Int # elem :: Eq a => a -> Matrix ns a -> Bool # maximum :: Ord a => Matrix ns a -> a # minimum :: Ord a => Matrix ns a -> a # | |
| Foldable (Vec n) Source # | |
Defined in Termonad.Config.Vec Methods fold :: Monoid m => Vec n m -> m # foldMap :: Monoid m => (a -> m) -> Vec n a -> m # foldr :: (a -> b -> b) -> b -> Vec n a -> b # foldr' :: (a -> b -> b) -> b -> Vec n a -> b # foldl :: (b -> a -> b) -> b -> Vec n a -> b # foldl' :: (b -> a -> b) -> b -> Vec n a -> b # foldr1 :: (a -> a -> a) -> Vec n a -> a # foldl1 :: (a -> a -> a) -> Vec n a -> a # elem :: Eq a => a -> Vec n a -> Bool # maximum :: Ord a => Vec n a -> a # minimum :: Ord a => Vec n a -> a # | |
| Foldable f => Foldable (Rec1 f) | Since: base-4.9.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => Rec1 f m -> m # foldMap :: Monoid m => (a -> m) -> Rec1 f a -> m # foldr :: (a -> b -> b) -> b -> Rec1 f a -> b # foldr' :: (a -> b -> b) -> b -> Rec1 f a -> b # foldl :: (b -> a -> b) -> b -> Rec1 f a -> b # foldl' :: (b -> a -> b) -> b -> Rec1 f a -> b # foldr1 :: (a -> a -> a) -> Rec1 f a -> a # foldl1 :: (a -> a -> a) -> Rec1 f a -> a # elem :: Eq a => a -> Rec1 f a -> Bool # maximum :: Ord a => Rec1 f a -> a # minimum :: Ord a => Rec1 f a -> a # | |
| Foldable (URec Char :: Type -> Type) | Since: base-4.9.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => URec Char m -> m # foldMap :: Monoid m => (a -> m) -> URec Char a -> m # foldr :: (a -> b -> b) -> b -> URec Char a -> b # foldr' :: (a -> b -> b) -> b -> URec Char a -> b # foldl :: (b -> a -> b) -> b -> URec Char a -> b # foldl' :: (b -> a -> b) -> b -> URec Char a -> b # foldr1 :: (a -> a -> a) -> URec Char a -> a # foldl1 :: (a -> a -> a) -> URec Char a -> a # toList :: URec Char a -> [a] # length :: URec Char a -> Int # elem :: Eq a => a -> URec Char a -> Bool # maximum :: Ord a => URec Char a -> a # minimum :: Ord a => URec Char a -> a # | |
| Foldable (URec Double :: Type -> Type) | Since: base-4.9.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => URec Double m -> m # foldMap :: Monoid m => (a -> m) -> URec Double a -> m # foldr :: (a -> b -> b) -> b -> URec Double a -> b # foldr' :: (a -> b -> b) -> b -> URec Double a -> b # foldl :: (b -> a -> b) -> b -> URec Double a -> b # foldl' :: (b -> a -> b) -> b -> URec Double a -> b # foldr1 :: (a -> a -> a) -> URec Double a -> a # foldl1 :: (a -> a -> a) -> URec Double a -> a # toList :: URec Double a -> [a] # null :: URec Double a -> Bool # length :: URec Double a -> Int # elem :: Eq a => a -> URec Double a -> Bool # maximum :: Ord a => URec Double a -> a # minimum :: Ord a => URec Double a -> a # | |
| Foldable (URec Float :: Type -> Type) | Since: base-4.9.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => URec Float m -> m # foldMap :: Monoid m => (a -> m) -> URec Float a -> m # foldr :: (a -> b -> b) -> b -> URec Float a -> b # foldr' :: (a -> b -> b) -> b -> URec Float a -> b # foldl :: (b -> a -> b) -> b -> URec Float a -> b # foldl' :: (b -> a -> b) -> b -> URec Float a -> b # foldr1 :: (a -> a -> a) -> URec Float a -> a # foldl1 :: (a -> a -> a) -> URec Float a -> a # toList :: URec Float a -> [a] # null :: URec Float a -> Bool # length :: URec Float a -> Int # elem :: Eq a => a -> URec Float a -> Bool # maximum :: Ord a => URec Float a -> a # minimum :: Ord a => URec Float a -> a # | |
| Foldable (URec Int :: Type -> Type) | Since: base-4.9.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => URec Int m -> m # foldMap :: Monoid m => (a -> m) -> URec Int a -> m # foldr :: (a -> b -> b) -> b -> URec Int a -> b # foldr' :: (a -> b -> b) -> b -> URec Int a -> b # foldl :: (b -> a -> b) -> b -> URec Int a -> b # foldl' :: (b -> a -> b) -> b -> URec Int a -> b # foldr1 :: (a -> a -> a) -> URec Int a -> a # foldl1 :: (a -> a -> a) -> URec Int a -> a # elem :: Eq a => a -> URec Int a -> Bool # maximum :: Ord a => URec Int a -> a # minimum :: Ord a => URec Int a -> a # | |
| Foldable (URec Word :: Type -> Type) | Since: base-4.9.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => URec Word m -> m # foldMap :: Monoid m => (a -> m) -> URec Word a -> m # foldr :: (a -> b -> b) -> b -> URec Word a -> b # foldr' :: (a -> b -> b) -> b -> URec Word a -> b # foldl :: (b -> a -> b) -> b -> URec Word a -> b # foldl' :: (b -> a -> b) -> b -> URec Word a -> b # foldr1 :: (a -> a -> a) -> URec Word a -> a # foldl1 :: (a -> a -> a) -> URec Word a -> a # toList :: URec Word a -> [a] # length :: URec Word a -> Int # elem :: Eq a => a -> URec Word a -> Bool # maximum :: Ord a => URec Word a -> a # minimum :: Ord a => URec Word a -> a # | |
| Foldable (URec (Ptr ()) :: Type -> Type) | Since: base-4.9.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => URec (Ptr ()) m -> m # foldMap :: Monoid m => (a -> m) -> URec (Ptr ()) a -> m # foldr :: (a -> b -> b) -> b -> URec (Ptr ()) a -> b # foldr' :: (a -> b -> b) -> b -> URec (Ptr ()) a -> b # foldl :: (b -> a -> b) -> b -> URec (Ptr ()) a -> b # foldl' :: (b -> a -> b) -> b -> URec (Ptr ()) a -> b # foldr1 :: (a -> a -> a) -> URec (Ptr ()) a -> a # foldl1 :: (a -> a -> a) -> URec (Ptr ()) a -> a # toList :: URec (Ptr ()) a -> [a] # null :: URec (Ptr ()) a -> Bool # length :: URec (Ptr ()) a -> Int # elem :: Eq a => a -> URec (Ptr ()) a -> Bool # maximum :: Ord a => URec (Ptr ()) a -> a # minimum :: Ord a => URec (Ptr ()) a -> a # | |
| Foldable (Const m :: Type -> Type) | Since: base-4.7.0.0 |
Defined in Data.Functor.Const Methods fold :: Monoid m0 => Const m m0 -> m0 # foldMap :: Monoid m0 => (a -> m0) -> Const m a -> m0 # foldr :: (a -> b -> b) -> b -> Const m a -> b # foldr' :: (a -> b -> b) -> b -> Const m a -> b # foldl :: (b -> a -> b) -> b -> Const m a -> b # foldl' :: (b -> a -> b) -> b -> Const m a -> b # foldr1 :: (a -> a -> a) -> Const m a -> a # foldl1 :: (a -> a -> a) -> Const m a -> a # elem :: Eq a => a -> Const m a -> Bool # maximum :: Ord a => Const m a -> a # minimum :: Ord a => Const m a -> a # | |
| Foldable f => Foldable (Ap f) | Since: base-4.12.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => Ap f m -> m # foldMap :: Monoid m => (a -> m) -> Ap f a -> m # foldr :: (a -> b -> b) -> b -> Ap f a -> b # foldr' :: (a -> b -> b) -> b -> Ap f a -> b # foldl :: (b -> a -> b) -> b -> Ap f a -> b # foldl' :: (b -> a -> b) -> b -> Ap f a -> b # foldr1 :: (a -> a -> a) -> Ap f a -> a # foldl1 :: (a -> a -> a) -> Ap f a -> a # elem :: Eq a => a -> Ap f a -> Bool # maximum :: Ord a => Ap f a -> a # | |
| Foldable f => Foldable (Alt f) | Since: base-4.12.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => Alt f m -> m # foldMap :: Monoid m => (a -> m) -> Alt f a -> m # foldr :: (a -> b -> b) -> b -> Alt f a -> b # foldr' :: (a -> b -> b) -> b -> Alt f a -> b # foldl :: (b -> a -> b) -> b -> Alt f a -> b # foldl' :: (b -> a -> b) -> b -> Alt f a -> b # foldr1 :: (a -> a -> a) -> Alt f a -> a # foldl1 :: (a -> a -> a) -> Alt f a -> a # elem :: Eq a => a -> Alt f a -> Bool # maximum :: Ord a => Alt f a -> a # minimum :: Ord a => Alt f a -> a # | |
| Bifoldable p => Foldable (Join p) | |
Defined in Data.Bifunctor.Join Methods fold :: Monoid m => Join p m -> m # foldMap :: Monoid m => (a -> m) -> Join p a -> m # foldr :: (a -> b -> b) -> b -> Join p a -> b # foldr' :: (a -> b -> b) -> b -> Join p a -> b # foldl :: (b -> a -> b) -> b -> Join p a -> b # foldl' :: (b -> a -> b) -> b -> Join p a -> b # foldr1 :: (a -> a -> a) -> Join p a -> a # foldl1 :: (a -> a -> a) -> Join p a -> a # elem :: Eq a => a -> Join p a -> Bool # maximum :: Ord a => Join p a -> a # minimum :: Ord a => Join p a -> a # | |
| Bifoldable p => Foldable (Fix p) | |
Defined in Data.Bifunctor.Fix Methods fold :: Monoid m => Fix p m -> m # foldMap :: Monoid m => (a -> m) -> Fix p a -> m # foldr :: (a -> b -> b) -> b -> Fix p a -> b # foldr' :: (a -> b -> b) -> b -> Fix p a -> b # foldl :: (b -> a -> b) -> b -> Fix p a -> b # foldl' :: (b -> a -> b) -> b -> Fix p a -> b # foldr1 :: (a -> a -> a) -> Fix p a -> a # foldl1 :: (a -> a -> a) -> Fix p a -> a # elem :: Eq a => a -> Fix p a -> Bool # maximum :: Ord a => Fix p a -> a # minimum :: Ord a => Fix p a -> a # | |
| Foldable w => Foldable (EnvT e w) | |
Defined in Control.Comonad.Trans.Env Methods fold :: Monoid m => EnvT e w m -> m # foldMap :: Monoid m => (a -> m) -> EnvT e w a -> m # foldr :: (a -> b -> b) -> b -> EnvT e w a -> b # foldr' :: (a -> b -> b) -> b -> EnvT e w a -> b # foldl :: (b -> a -> b) -> b -> EnvT e w a -> b # foldl' :: (b -> a -> b) -> b -> EnvT e w a -> b # foldr1 :: (a -> a -> a) -> EnvT e w a -> a # foldl1 :: (a -> a -> a) -> EnvT e w a -> a # elem :: Eq a => a -> EnvT e w a -> Bool # maximum :: Ord a => EnvT e w a -> a # minimum :: Ord a => EnvT e w a -> a # | |
| Foldable f => Foldable (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 # foldr :: (a -> b -> b) -> b -> IdentityT f a -> b # foldr' :: (a -> b -> b) -> b -> IdentityT f a -> b # foldl :: (b -> a -> b) -> b -> IdentityT f a -> b # foldl' :: (b -> a -> b) -> b -> IdentityT f a -> b # foldr1 :: (a -> a -> a) -> IdentityT f a -> a # foldl1 :: (a -> a -> a) -> IdentityT f a -> a # toList :: IdentityT f a -> [a] # null :: IdentityT f a -> Bool # length :: IdentityT f a -> Int # elem :: Eq a => a -> IdentityT f a -> Bool # maximum :: Ord a => IdentityT f a -> a # minimum :: Ord a => IdentityT f a -> a # | |
| Foldable f => Foldable (WriterT w f) | |
Defined in Control.Monad.Trans.Writer.Strict Methods fold :: Monoid m => WriterT w f m -> m # foldMap :: Monoid m => (a -> m) -> WriterT w f a -> m # foldr :: (a -> b -> b) -> b -> WriterT w f a -> b # foldr' :: (a -> b -> b) -> b -> WriterT w f a -> b # foldl :: (b -> a -> b) -> b -> WriterT w f a -> b # foldl' :: (b -> a -> b) -> b -> WriterT w f a -> b # foldr1 :: (a -> a -> a) -> WriterT w f a -> a # foldl1 :: (a -> a -> a) -> WriterT w f a -> a # toList :: WriterT w f a -> [a] # null :: WriterT w f a -> Bool # length :: WriterT w f a -> Int # elem :: Eq a => a -> WriterT w f a -> Bool # maximum :: Ord a => WriterT w f a -> a # minimum :: Ord a => WriterT w f a -> a # | |
| Foldable f => Foldable (WriterT w f) | |
Defined in Control.Monad.Trans.Writer.Lazy Methods fold :: Monoid m => WriterT w f m -> m # foldMap :: Monoid m => (a -> m) -> WriterT w f a -> m # foldr :: (a -> b -> b) -> b -> WriterT w f a -> b # foldr' :: (a -> b -> b) -> b -> WriterT w f a -> b # foldl :: (b -> a -> b) -> b -> WriterT w f a -> b # foldl' :: (b -> a -> b) -> b -> WriterT w f a -> b # foldr1 :: (a -> a -> a) -> WriterT w f a -> a # foldl1 :: (a -> a -> a) -> WriterT w f a -> a # toList :: WriterT w f a -> [a] # null :: WriterT w f a -> Bool # length :: WriterT w f a -> Int # elem :: Eq a => a -> WriterT w f a -> Bool # maximum :: Ord a => WriterT w f a -> a # minimum :: Ord a => WriterT w f a -> a # | |
| Foldable f => Foldable (FreeF f a) | |
Defined in Control.Monad.Trans.Free Methods fold :: Monoid m => FreeF f a m -> m # foldMap :: Monoid m => (a0 -> m) -> FreeF f a a0 -> m # foldr :: (a0 -> b -> b) -> b -> FreeF f a a0 -> b # foldr' :: (a0 -> b -> b) -> b -> FreeF f a a0 -> b # foldl :: (b -> a0 -> b) -> b -> FreeF f a a0 -> b # foldl' :: (b -> a0 -> b) -> b -> FreeF f a a0 -> b # foldr1 :: (a0 -> a0 -> a0) -> FreeF f a a0 -> a0 # foldl1 :: (a0 -> a0 -> a0) -> FreeF f a a0 -> a0 # toList :: FreeF f a a0 -> [a0] # null :: FreeF f a a0 -> Bool # length :: FreeF f a a0 -> Int # elem :: Eq a0 => a0 -> FreeF f a a0 -> Bool # maximum :: Ord a0 => FreeF f a a0 -> a0 # minimum :: Ord a0 => FreeF f a a0 -> a0 # | |
| (Foldable m, Foldable f) => Foldable (FreeT f m) | |
Defined in Control.Monad.Trans.Free Methods fold :: Monoid m0 => FreeT f m m0 -> m0 # foldMap :: Monoid m0 => (a -> m0) -> FreeT f m a -> m0 # foldr :: (a -> b -> b) -> b -> FreeT f m a -> b # foldr' :: (a -> b -> b) -> b -> FreeT f m a -> b # foldl :: (b -> a -> b) -> b -> FreeT f m a -> b # foldl' :: (b -> a -> b) -> b -> FreeT f m a -> b # foldr1 :: (a -> a -> a) -> FreeT f m a -> a # foldl1 :: (a -> a -> a) -> FreeT f m a -> a # toList :: FreeT f m a -> [a] # length :: FreeT f m a -> Int # elem :: Eq a => a -> FreeT f m a -> Bool # maximum :: Ord a => FreeT f m a -> a # minimum :: Ord a => FreeT f m a -> a # | |
| Foldable f => Foldable (CofreeF f a) | |
Defined in Control.Comonad.Trans.Cofree Methods fold :: Monoid m => CofreeF f a m -> m # foldMap :: Monoid m => (a0 -> m) -> CofreeF f a a0 -> m # foldr :: (a0 -> b -> b) -> b -> CofreeF f a a0 -> b # foldr' :: (a0 -> b -> b) -> b -> CofreeF f a a0 -> b # foldl :: (b -> a0 -> b) -> b -> CofreeF f a a0 -> b # foldl' :: (b -> a0 -> b) -> b -> CofreeF f a a0 -> b # foldr1 :: (a0 -> a0 -> a0) -> CofreeF f a a0 -> a0 # foldl1 :: (a0 -> a0 -> a0) -> CofreeF f a a0 -> a0 # toList :: CofreeF f a a0 -> [a0] # null :: CofreeF f a a0 -> Bool # length :: CofreeF f a a0 -> Int # elem :: Eq a0 => a0 -> CofreeF f a a0 -> Bool # maximum :: Ord a0 => CofreeF f a a0 -> a0 # minimum :: Ord a0 => CofreeF f a a0 -> a0 # | |
| (Foldable f, Foldable w) => Foldable (CofreeT f w) | |
Defined in Control.Comonad.Trans.Cofree Methods fold :: Monoid m => CofreeT f w m -> m # foldMap :: Monoid m => (a -> m) -> CofreeT f w a -> m # foldr :: (a -> b -> b) -> b -> CofreeT f w a -> b # foldr' :: (a -> b -> b) -> b -> CofreeT f w a -> b # foldl :: (b -> a -> b) -> b -> CofreeT f w a -> b # foldl' :: (b -> a -> b) -> b -> CofreeT f w a -> b # foldr1 :: (a -> a -> a) -> CofreeT f w a -> a # foldl1 :: (a -> a -> a) -> CofreeT f w a -> a # toList :: CofreeT f w a -> [a] # null :: CofreeT f w a -> Bool # length :: CofreeT f w a -> Int # elem :: Eq a => a -> CofreeT f w a -> Bool # maximum :: Ord a => CofreeT f w a -> a # minimum :: Ord a => CofreeT f w a -> a # | |
| Foldable f => Foldable (ErrorT e f) | |
Defined in Control.Monad.Trans.Error Methods fold :: Monoid m => ErrorT e f m -> m # foldMap :: Monoid m => (a -> m) -> ErrorT e f a -> m # foldr :: (a -> b -> b) -> b -> ErrorT e f a -> b # foldr' :: (a -> b -> b) -> b -> ErrorT e f a -> b # foldl :: (b -> a -> b) -> b -> ErrorT e f a -> b # foldl' :: (b -> a -> b) -> b -> ErrorT e f a -> b # foldr1 :: (a -> a -> a) -> ErrorT e f a -> a # foldl1 :: (a -> a -> a) -> ErrorT e f a -> a # toList :: ErrorT e f a -> [a] # null :: ErrorT e f a -> Bool # length :: ErrorT e f a -> Int # elem :: Eq a => a -> ErrorT e f a -> Bool # maximum :: Ord a => ErrorT e f a -> a # minimum :: Ord a => ErrorT e f a -> a # | |
| Foldable (Tagged s) | |
Defined in Data.Tagged Methods fold :: Monoid m => Tagged s m -> m # foldMap :: Monoid m => (a -> m) -> Tagged s a -> m # foldr :: (a -> b -> b) -> b -> Tagged s a -> b # foldr' :: (a -> b -> b) -> b -> Tagged s a -> b # foldl :: (b -> a -> b) -> b -> Tagged s a -> b # foldl' :: (b -> a -> b) -> b -> Tagged s a -> b # foldr1 :: (a -> a -> a) -> Tagged s a -> a # foldl1 :: (a -> a -> a) -> Tagged s a -> a # elem :: Eq a => a -> Tagged s a -> Bool # maximum :: Ord a => Tagged s a -> a # minimum :: Ord a => Tagged s a -> a # | |
| Foldable (K1 i c :: Type -> Type) | Since: base-4.9.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => K1 i c m -> m # foldMap :: Monoid m => (a -> m) -> K1 i c a -> m # foldr :: (a -> b -> b) -> b -> K1 i c a -> b # foldr' :: (a -> b -> b) -> b -> K1 i c a -> b # foldl :: (b -> a -> b) -> b -> K1 i c a -> b # foldl' :: (b -> a -> b) -> b -> K1 i c a -> b # foldr1 :: (a -> a -> a) -> K1 i c a -> a # foldl1 :: (a -> a -> a) -> K1 i c a -> a # elem :: Eq a => a -> K1 i c a -> Bool # maximum :: Ord a => K1 i c a -> a # minimum :: Ord a => K1 i c a -> a # | |
| (Foldable f, Foldable g) => Foldable (f :+: g) | Since: base-4.9.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => (f :+: g) m -> m # foldMap :: Monoid m => (a -> m) -> (f :+: g) a -> m # foldr :: (a -> b -> b) -> b -> (f :+: g) a -> b # foldr' :: (a -> b -> b) -> b -> (f :+: g) a -> b # foldl :: (b -> a -> b) -> b -> (f :+: g) a -> b # foldl' :: (b -> a -> b) -> b -> (f :+: g) a -> b # foldr1 :: (a -> a -> a) -> (f :+: g) a -> a # foldl1 :: (a -> a -> a) -> (f :+: g) a -> a # toList :: (f :+: g) a -> [a] # length :: (f :+: g) a -> Int # elem :: Eq a => a -> (f :+: g) a -> Bool # maximum :: Ord a => (f :+: g) a -> a # minimum :: Ord a => (f :+: g) a -> a # | |
| (Foldable f, Foldable g) => Foldable (f :*: g) | Since: base-4.9.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => (f :*: g) m -> m # foldMap :: Monoid m => (a -> m) -> (f :*: g) a -> m # foldr :: (a -> b -> b) -> b -> (f :*: g) a -> b # foldr' :: (a -> b -> b) -> b -> (f :*: g) a -> b # foldl :: (b -> a -> b) -> b -> (f :*: g) a -> b # foldl' :: (b -> a -> b) -> b -> (f :*: g) a -> b # foldr1 :: (a -> a -> a) -> (f :*: g) a -> a # foldl1 :: (a -> a -> a) -> (f :*: g) a -> a # toList :: (f :*: g) a -> [a] # length :: (f :*: g) a -> Int # elem :: Eq a => a -> (f :*: g) a -> Bool # maximum :: Ord a => (f :*: g) a -> a # minimum :: Ord a => (f :*: g) a -> a # | |
| (Foldable f, Foldable g) => Foldable (Product f g) | Since: base-4.9.0.0 |
Defined in Data.Functor.Product Methods fold :: Monoid m => Product f g m -> m # foldMap :: Monoid m => (a -> m) -> Product f g a -> m # foldr :: (a -> b -> b) -> b -> Product f g a -> b # foldr' :: (a -> b -> b) -> b -> Product f g a -> b # foldl :: (b -> a -> b) -> b -> Product f g a -> b # foldl' :: (b -> a -> b) -> b -> Product f g a -> b # foldr1 :: (a -> a -> a) -> Product f g a -> a # foldl1 :: (a -> a -> a) -> Product f g a -> a # toList :: Product f g a -> [a] # null :: Product f g a -> Bool # length :: Product f g a -> Int # elem :: Eq a => a -> Product f g a -> Bool # maximum :: Ord a => Product f g a -> a # minimum :: Ord a => Product f g a -> a # | |
| (Foldable f, Foldable g) => Foldable (Sum f g) | Since: base-4.9.0.0 |
Defined in Data.Functor.Sum Methods fold :: Monoid m => Sum f g m -> m # foldMap :: Monoid m => (a -> m) -> Sum f g a -> m # foldr :: (a -> b -> b) -> b -> Sum f g a -> b # foldr' :: (a -> b -> b) -> b -> Sum f g a -> b # foldl :: (b -> a -> b) -> b -> Sum f g a -> b # foldl' :: (b -> a -> b) -> b -> Sum f g a -> b # foldr1 :: (a -> a -> a) -> Sum f g a -> a # foldl1 :: (a -> a -> a) -> Sum f g a -> a # elem :: Eq a => a -> Sum f g a -> Bool # maximum :: Ord a => Sum f g a -> a # minimum :: Ord a => Sum f g a -> a # | |
| Foldable f => Foldable (M1 i c f) | Since: base-4.9.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => M1 i c f m -> m # foldMap :: Monoid m => (a -> m) -> M1 i c f a -> m # foldr :: (a -> b -> b) -> b -> M1 i c f a -> b # foldr' :: (a -> b -> b) -> b -> M1 i c f a -> b # foldl :: (b -> a -> b) -> b -> M1 i c f a -> b # foldl' :: (b -> a -> b) -> b -> M1 i c f a -> b # foldr1 :: (a -> a -> a) -> M1 i c f a -> a # foldl1 :: (a -> a -> a) -> M1 i c f a -> a # elem :: Eq a => a -> M1 i c f a -> Bool # maximum :: Ord a => M1 i c f a -> a # minimum :: Ord a => M1 i c f a -> a # | |
| (Foldable f, Foldable g) => Foldable (f :.: g) | Since: base-4.9.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => (f :.: g) m -> m # foldMap :: Monoid m => (a -> m) -> (f :.: g) a -> m # foldr :: (a -> b -> b) -> b -> (f :.: g) a -> b # foldr' :: (a -> b -> b) -> b -> (f :.: g) a -> b # foldl :: (b -> a -> b) -> b -> (f :.: g) a -> b # foldl' :: (b -> a -> b) -> b -> (f :.: g) a -> b # foldr1 :: (a -> a -> a) -> (f :.: g) a -> a # foldl1 :: (a -> a -> a) -> (f :.: g) a -> a # toList :: (f :.: g) a -> [a] # length :: (f :.: g) a -> Int # elem :: Eq a => a -> (f :.: g) a -> Bool # maximum :: Ord a => (f :.: g) a -> a # minimum :: Ord a => (f :.: g) a -> a # | |
| (Foldable f, Foldable g) => Foldable (Compose f g) | Since: base-4.9.0.0 |
Defined in Data.Functor.Compose Methods fold :: Monoid m => Compose f g m -> m # foldMap :: Monoid m => (a -> m) -> Compose f g a -> m # foldr :: (a -> b -> b) -> b -> Compose f g a -> b # foldr' :: (a -> b -> b) -> b -> Compose f g a -> b # foldl :: (b -> a -> b) -> b -> Compose f g a -> b # foldl' :: (b -> a -> b) -> b -> Compose f g a -> b # foldr1 :: (a -> a -> a) -> Compose f g a -> a # foldl1 :: (a -> a -> a) -> Compose f g a -> a # toList :: Compose f g a -> [a] # null :: Compose f g a -> Bool # length :: Compose f g a -> Int # elem :: Eq a => a -> Compose f g a -> Bool # maximum :: Ord a => Compose f g a -> a # minimum :: Ord a => Compose f g a -> a # | |
| Bifoldable p => Foldable (WrappedBifunctor p a) | |
Defined in Data.Bifunctor.Wrapped Methods fold :: Monoid m => WrappedBifunctor p a m -> m # foldMap :: Monoid m => (a0 -> m) -> WrappedBifunctor p a a0 -> m # foldr :: (a0 -> b -> b) -> b -> WrappedBifunctor p a a0 -> b # foldr' :: (a0 -> b -> b) -> b -> WrappedBifunctor p a a0 -> b # foldl :: (b -> a0 -> b) -> b -> WrappedBifunctor p a a0 -> b # foldl' :: (b -> a0 -> b) -> b -> WrappedBifunctor p a a0 -> b # foldr1 :: (a0 -> a0 -> a0) -> WrappedBifunctor p a a0 -> a0 # foldl1 :: (a0 -> a0 -> a0) -> WrappedBifunctor p a a0 -> a0 # toList :: WrappedBifunctor p a a0 -> [a0] # null :: WrappedBifunctor p a a0 -> Bool # length :: WrappedBifunctor p a a0 -> Int # elem :: Eq a0 => a0 -> WrappedBifunctor p a a0 -> Bool # maximum :: Ord a0 => WrappedBifunctor p a a0 -> a0 # minimum :: Ord a0 => WrappedBifunctor p a a0 -> a0 # sum :: Num a0 => WrappedBifunctor p a a0 -> a0 # product :: Num a0 => WrappedBifunctor p a a0 -> a0 # | |
| Foldable g => Foldable (Joker g a) | |
Defined in Data.Bifunctor.Joker Methods fold :: Monoid m => Joker g a m -> m # foldMap :: Monoid m => (a0 -> m) -> Joker g a a0 -> m # foldr :: (a0 -> b -> b) -> b -> Joker g a a0 -> b # foldr' :: (a0 -> b -> b) -> b -> Joker g a a0 -> b # foldl :: (b -> a0 -> b) -> b -> Joker g a a0 -> b # foldl' :: (b -> a0 -> b) -> b -> Joker g a a0 -> b # foldr1 :: (a0 -> a0 -> a0) -> Joker g a a0 -> a0 # foldl1 :: (a0 -> a0 -> a0) -> Joker g a a0 -> a0 # toList :: Joker g a a0 -> [a0] # null :: Joker g a a0 -> Bool # length :: Joker g a a0 -> Int # elem :: Eq a0 => a0 -> Joker g a a0 -> Bool # maximum :: Ord a0 => Joker g a a0 -> a0 # minimum :: Ord a0 => Joker g a a0 -> a0 # | |
| Bifoldable p => Foldable (Flip p a) | |
Defined in Data.Bifunctor.Flip Methods fold :: Monoid m => Flip p a m -> m # foldMap :: Monoid m => (a0 -> m) -> Flip p a a0 -> m # foldr :: (a0 -> b -> b) -> b -> Flip p a a0 -> b # foldr' :: (a0 -> b -> b) -> b -> Flip p a a0 -> b # foldl :: (b -> a0 -> b) -> b -> Flip p a a0 -> b # foldl' :: (b -> a0 -> b) -> b -> Flip p a a0 -> b # foldr1 :: (a0 -> a0 -> a0) -> Flip p a a0 -> a0 # foldl1 :: (a0 -> a0 -> a0) -> Flip p a a0 -> a0 # toList :: Flip p a a0 -> [a0] # length :: Flip p a a0 -> Int # elem :: Eq a0 => a0 -> Flip p a a0 -> Bool # maximum :: Ord a0 => Flip p a a0 -> a0 # minimum :: Ord a0 => Flip p a a0 -> a0 # | |
| Foldable (Clown f a :: Type -> Type) | |
Defined in Data.Bifunctor.Clown Methods fold :: Monoid m => Clown f a m -> m # foldMap :: Monoid m => (a0 -> m) -> Clown f a a0 -> m # foldr :: (a0 -> b -> b) -> b -> Clown f a a0 -> b # foldr' :: (a0 -> b -> b) -> b -> Clown f a a0 -> b # foldl :: (b -> a0 -> b) -> b -> Clown f a a0 -> b # foldl' :: (b -> a0 -> b) -> b -> Clown f a a0 -> b # foldr1 :: (a0 -> a0 -> a0) -> Clown f a a0 -> a0 # foldl1 :: (a0 -> a0 -> a0) -> Clown f a a0 -> a0 # toList :: Clown f a a0 -> [a0] # null :: Clown f a a0 -> Bool # length :: Clown f a a0 -> Int # elem :: Eq a0 => a0 -> Clown f a a0 -> Bool # maximum :: Ord a0 => Clown f a a0 -> a0 # minimum :: Ord a0 => Clown f a a0 -> a0 # | |
| (Foldable f, Bifoldable p) => Foldable (Tannen f p a) | |
Defined in Data.Bifunctor.Tannen Methods fold :: Monoid m => Tannen f p a m -> m # foldMap :: Monoid m => (a0 -> m) -> Tannen f p a a0 -> m # foldr :: (a0 -> b -> b) -> b -> Tannen f p a a0 -> b # foldr' :: (a0 -> b -> b) -> b -> Tannen f p a a0 -> b # foldl :: (b -> a0 -> b) -> b -> Tannen f p a a0 -> b # foldl' :: (b -> a0 -> b) -> b -> Tannen f p a a0 -> b # foldr1 :: (a0 -> a0 -> a0) -> Tannen f p a a0 -> a0 # foldl1 :: (a0 -> a0 -> a0) -> Tannen f p a a0 -> a0 # toList :: Tannen f p a a0 -> [a0] # null :: Tannen f p a a0 -> Bool # length :: Tannen f p a a0 -> Int # elem :: Eq a0 => a0 -> Tannen f p a a0 -> Bool # maximum :: Ord a0 => Tannen f p a a0 -> a0 # minimum :: Ord a0 => Tannen f p a a0 -> a0 # | |
| (Bifoldable p, Foldable g) => Foldable (Biff p f g a) | |
Defined in Data.Bifunctor.Biff Methods fold :: Monoid m => Biff p f g a m -> m # foldMap :: Monoid m => (a0 -> m) -> Biff p f g a a0 -> m # foldr :: (a0 -> b -> b) -> b -> Biff p f g a a0 -> b # foldr' :: (a0 -> b -> b) -> b -> Biff p f g a a0 -> b # foldl :: (b -> a0 -> b) -> b -> Biff p f g a a0 -> b # foldl' :: (b -> a0 -> b) -> b -> Biff p f g a a0 -> b # foldr1 :: (a0 -> a0 -> a0) -> Biff p f g a a0 -> a0 # foldl1 :: (a0 -> a0 -> a0) -> Biff p f g a a0 -> a0 # toList :: Biff p f g a a0 -> [a0] # null :: Biff p f g a a0 -> Bool # length :: Biff p f g a a0 -> Int # elem :: Eq a0 => a0 -> Biff p f g a a0 -> Bool # maximum :: Ord a0 => Biff p f g a a0 -> a0 # minimum :: Ord a0 => Biff p f g a a0 -> a0 # | |
class (Functor t, Foldable t) => Traversable (t :: Type -> Type) where #
Functors representing data structures that can be traversed from left to right.
A definition of traverse must satisfy the following laws:
- naturality
t .for every applicative transformationtraversef =traverse(t . f)t- identity
traverseIdentity = Identity- composition
traverse(Compose .fmapg . f) = Compose .fmap(traverseg) .traversef
A definition of sequenceA must satisfy the following laws:
- naturality
t .for every applicative transformationsequenceA=sequenceA.fmaptt- identity
sequenceA.fmapIdentity = Identity- composition
sequenceA.fmapCompose = Compose .fmapsequenceA.sequenceA
where an applicative transformation is a function
t :: (Applicative f, Applicative g) => f a -> g a
preserving the Applicative operations, i.e.
and the identity functor Identity and composition of functors Compose
are defined as
newtype Identity a = Identity a
instance Functor Identity where
fmap f (Identity x) = Identity (f x)
instance Applicative Identity where
pure x = Identity x
Identity f <*> Identity x = Identity (f x)
newtype Compose f g a = Compose (f (g a))
instance (Functor f, Functor g) => Functor (Compose f g) where
fmap f (Compose x) = Compose (fmap (fmap f) x)
instance (Applicative f, Applicative g) => Applicative (Compose f g) where
pure x = Compose (pure (pure x))
Compose f <*> Compose x = Compose ((<*>) <$> f <*> x)(The naturality law is implied by parametricity.)
Instances are similar to Functor, e.g. given a data type
data Tree a = Empty | Leaf a | Node (Tree a) a (Tree a)
a suitable instance would be
instance Traversable Tree where traverse f Empty = pure Empty traverse f (Leaf x) = Leaf <$> f x traverse f (Node l k r) = Node <$> traverse f l <*> f k <*> traverse f r
This is suitable even for abstract types, as the laws for <*>
imply a form of associativity.
The superclass instances should satisfy the following:
- In the
Functorinstance,fmapshould be equivalent to traversal with the identity applicative functor (fmapDefault). - In the
Foldableinstance,foldMapshould be equivalent to traversal with a constant applicative functor (foldMapDefault).
Methods
traverse :: Applicative f => (a -> f b) -> t a -> f (t b) #
Map each element of a structure to an action, evaluate these actions
from left to right, and collect the results. For a version that ignores
the results see traverse_.
sequenceA :: Applicative f => t (f a) -> f (t a) #
Evaluate each action in the structure from left to right, and
collect the results. For a version that ignores the results
see sequenceA_.
mapM :: Monad m => (a -> m b) -> t a -> m (t b) #
Map each element of a structure to a monadic action, evaluate
these actions from left to right, and collect the results. For
a version that ignores the results see mapM_.
sequence :: Monad m => t (m a) -> m (t a) #
Evaluate each monadic action in the structure from left to
right, and collect the results. For a version that ignores the
results see sequence_.
Instances
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
The class of semigroups (types with an associative binary operation).
Instances should satisfy the associativity law:
Since: base-4.9.0.0
Minimal complete definition
Methods
(<>) :: a -> a -> a infixr 6 #
An associative operation.
Reduce a non-empty list with <>
The default definition should be sufficient, but this can be overridden for efficiency.
stimes :: Integral b => b -> a -> a #
Repeat a value n times.
Given that this works on a Semigroup it is allowed to fail if
you request 0 or fewer repetitions, and the default definition
will do so.
By making this a member of the class, idempotent semigroups
and monoids can upgrade this to execute in O(1) by
picking stimes = or stimesIdempotentstimes =
respectively.stimesIdempotentMonoid
Instances
class Semigroup a => Monoid a where #
The class of monoids (types with an associative binary operation that has an identity). Instances should satisfy the following laws:
x
<>mempty= xmempty<>x = xx(<>(y<>z) = (x<>y)<>zSemigrouplaw)mconcat=foldr'(<>)'mempty
The method names refer to the monoid of lists under concatenation, but there are many other instances.
Some types can be viewed as a monoid in more than one way,
e.g. both addition and multiplication on numbers.
In such cases we often define newtypes and make those instances
of Monoid, e.g. Sum and Product.
NOTE: Semigroup is a superclass of Monoid since base-4.11.0.0.
Minimal complete definition
Methods
Identity of mappend
An associative operation
NOTE: This method is redundant and has the default
implementation mappend = '(<>)'
Fold a list using the monoid.
For most types, the default definition for mconcat will be
used, but the function is included in the class definition so
that an optimized version can be provided for specific types.
Instances
Instances
| Bounded Bool | Since: base-2.1 |
| Enum Bool | Since: base-2.1 |
| Eq Bool | |
| Ord Bool | |
| Read Bool | Since: base-2.1 |
| Show Bool | Since: base-2.1 |
| Ix Bool | Since: base-2.1 |
| Generic Bool | |
| Lift Bool | |
| NFData Bool | |
Defined in Control.DeepSeq | |
| Hashable Bool | |
Defined in Data.Hashable.Class | |
| SingKind Bool | Since: base-4.9.0.0 |
Defined in GHC.Generics | |
| Storable Bool | Since: base-2.1 |
Defined in Foreign.Storable | |
| Unbox Bool | |
Defined in Data.Vector.Unboxed.Base | |
| IsGValue Bool | |
| PShow Bool | |
| SShow Bool | |
| PEnum Bool | |
Defined in Data.Singletons.Prelude.Enum | |
| SEnum Bool | |
Defined in Data.Singletons.Prelude.Enum Methods sSucc :: Sing t -> Sing (Apply SuccSym0 t) # sPred :: Sing t -> Sing (Apply PredSym0 t) # sToEnum :: Sing t -> Sing (Apply ToEnumSym0 t) # sFromEnum :: Sing t -> Sing (Apply FromEnumSym0 t) # sEnumFromTo :: Sing t1 -> Sing t2 -> Sing (Apply (Apply EnumFromToSym0 t1) t2) # sEnumFromThenTo :: Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply EnumFromThenToSym0 t1) t2) t3) # | |
| PBounded Bool | |
Defined in Data.Singletons.Prelude.Enum | |
| SBounded Bool | |
Defined in Data.Singletons.Prelude.Enum | |
| POrd Bool | |
| SOrd Bool | |
Defined in Data.Singletons.Prelude.Ord Methods sCompare :: Sing t1 -> Sing t2 -> Sing (Apply (Apply CompareSym0 t1) t2) # (%<) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (<@#@$) t1) t2) # (%<=) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (<=@#@$) t1) t2) # (%>) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (>@#@$) t1) t2) # (%>=) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (>=@#@$) t1) t2) # sMax :: Sing t1 -> Sing t2 -> Sing (Apply (Apply MaxSym0 t1) t2) # sMin :: Sing t1 -> Sing t2 -> Sing (Apply (Apply MinSym0 t1) t2) # | |
| SEq Bool | |
| PEq Bool | |
| SingI False | Since: base-4.9.0.0 |
Defined in GHC.Generics | |
| SingI True | Since: base-4.9.0.0 |
Defined in GHC.Generics | |
| Vector Vector Bool | |
Defined in Data.Vector.Unboxed.Base Methods basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) Bool -> m (Vector Bool) # basicUnsafeThaw :: PrimMonad m => Vector Bool -> m (Mutable Vector (PrimState m) Bool) # basicLength :: Vector Bool -> Int # basicUnsafeSlice :: Int -> Int -> Vector Bool -> Vector Bool # basicUnsafeIndexM :: Monad m => Vector Bool -> Int -> m Bool # basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) Bool -> Vector Bool -> m () # | |
| MVector MVector Bool | |
Defined in Data.Vector.Unboxed.Base Methods basicLength :: MVector s Bool -> Int # basicUnsafeSlice :: Int -> Int -> MVector s Bool -> MVector s Bool # basicOverlaps :: MVector s Bool -> MVector s Bool -> Bool # basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) Bool) # basicInitialize :: PrimMonad m => MVector (PrimState m) Bool -> m () # basicUnsafeReplicate :: PrimMonad m => Int -> Bool -> m (MVector (PrimState m) Bool) # basicUnsafeRead :: PrimMonad m => MVector (PrimState m) Bool -> Int -> m Bool # basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) Bool -> Int -> Bool -> m () # basicClear :: PrimMonad m => MVector (PrimState m) Bool -> m () # basicSet :: PrimMonad m => MVector (PrimState m) Bool -> Bool -> m () # basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) Bool -> MVector (PrimState m) Bool -> m () # basicUnsafeMove :: PrimMonad m => MVector (PrimState m) Bool -> MVector (PrimState m) Bool -> m () # basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) Bool -> Int -> m (MVector (PrimState m) Bool) # | |
| SuppressUnusedWarnings NotSym0 | |
Defined in Data.Singletons.Prelude.Bool Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings FromEnum_6989586621680082248Sym0 | |
Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings AnySym0 | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings Any_Sym0 | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings AllSym0 | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings All_Sym0 | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (||@#@$) | |
Defined in Data.Singletons.Prelude.Bool Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (&&@#@$) | |
Defined in Data.Singletons.Prelude.Bool Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings Compare_6989586621679830166Sym0 | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings ShowParenSym0 | |
Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings OrSym0 | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings AndSym0 | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings ToEnum_6989586621680082233Sym0 | |
Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings ShowsPrec_6989586621680595456Sym0 | |
Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (<=?@#@$) | |
Defined in Data.Singletons.TypeLits.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings GetAnySym0 | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings GetAllSym0 | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SingI NotSym0 | |
Defined in Data.Singletons.Prelude.Bool | |
| SingI (||@#@$) | |
Defined in Data.Singletons.Prelude.Bool | |
| SingI (&&@#@$) | |
Defined in Data.Singletons.Prelude.Bool | |
| SingI (<=?@#@$) | |
Defined in Data.Singletons.TypeLits.Internal | |
| SingI AnySym0 | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| SingI AllSym0 | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| SingI ShowParenSym0 | |
Defined in Data.Singletons.Prelude.Show Methods sing :: Sing ShowParenSym0 # | |
| SingI OrSym0 | |
Defined in Data.Singletons.Prelude.List.Internal | |
| SingI AndSym0 | |
Defined in Data.Singletons.Prelude.List.Internal | |
| SuppressUnusedWarnings ((||@#@$$) a6989586621679782260 :: TyFun Bool Bool -> Type) | |
Defined in Data.Singletons.Prelude.Bool Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings ((&&@#@$$) a6989586621679781627 :: TyFun Bool Bool -> Type) | |
Defined in Data.Singletons.Prelude.Bool Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679830166Sym1 a6989586621679830164 :: TyFun Bool Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (GuardSym0 :: TyFun Bool (f6989586621679932848 ()) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621680595456Sym1 a6989586621680595453 :: TyFun Bool (Symbol ~> Symbol) -> Type) | |
Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (WhenSym0 :: TyFun Bool (f6989586621679932878 () ~> f6989586621679932878 ()) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (UnlessSym0 :: TyFun Bool (f6989586621681056589 () ~> f6989586621681056589 ()) -> Type) | |
Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ListnullSym0 :: TyFun [a6989586621680565278] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ListisPrefixOfSym0 :: TyFun [a6989586621680565301] ([a6989586621680565301] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (NullSym0 :: TyFun [a6989586621680303205] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (IsSuffixOfSym0 :: TyFun [a6989586621680303170] ([a6989586621680303170] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (IsPrefixOfSym0 :: TyFun [a6989586621680303171] ([a6989586621680303171] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (IsInfixOfSym0 :: TyFun [a6989586621680303169] ([a6989586621680303169] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (IsNothingSym0 :: TyFun (Maybe a6989586621680027018) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (IsJustSym0 :: TyFun (Maybe a6989586621680027019) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings ((<=?@#@$$) a3530822107858468865 :: TyFun Nat Bool -> Type) | |
Defined in Data.Singletons.TypeLits.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679475351Scrutinee_6989586621679460508Sym0 :: TyFun k1 Bool -> Type) Source # | |
Defined in Termonad.Config.Vec Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679475355Scrutinee_6989586621679460510Sym0 :: TyFun k1 Bool -> Type) Source # | |
Defined in Termonad.Config.Vec Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ListelemSym0 :: TyFun a6989586621680565289 ([a6989586621680565289] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (NotElemSym0 :: TyFun a6989586621680303167 ([a6989586621680303167] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ElemSym0 :: TyFun a6989586621680303168 ([a6989586621680303168] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (OrSym0 :: TyFun (t6989586621680712176 Bool) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680712745Scrutinee_6989586621680712503Sym0 :: TyFun (t6989586621680712256 Bool) All -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680712736Scrutinee_6989586621680712505Sym0 :: TyFun (t6989586621680712256 Bool) Any -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680704073Scrutinee_6989586621680704011Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680704046Scrutinee_6989586621680704009Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (AndSym0 :: TyFun (t6989586621680712177 Bool) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (DefaultEqSym0 :: TyFun k6989586621679787904 (k6989586621679787904 ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Eq Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings ((==@#@$) :: TyFun a6989586621679787917 (a6989586621679787917 ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Eq Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings ((/=@#@$) :: TyFun a6989586621679787917 (a6989586621679787917 ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Eq Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Bool_Sym0 :: TyFun a6989586621679780269 (a6989586621679780269 ~> (Bool ~> a6989586621679780269)) -> Type) | |
Defined in Data.Singletons.Prelude.Bool Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679815779Sym0 :: TyFun a6989586621679815165 (a6989586621679815165 ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679815755Sym0 :: TyFun a6989586621679815165 (a6989586621679815165 ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679815734Sym0 :: TyFun a6989586621679815165 (a6989586621679815165 ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679815712Sym0 :: TyFun a6989586621679815165 (a6989586621679815165 ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679815818Scrutinee_6989586621679815233Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679815794Scrutinee_6989586621679815231Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679815677Scrutinee_6989586621679815211Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679815671Scrutinee_6989586621679815209Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings ((>@#@$) :: TyFun a6989586621679815165 (a6989586621679815165 ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings ((>=@#@$) :: TyFun a6989586621679815165 (a6989586621679815165 ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings ((<@#@$) :: TyFun a6989586621679815165 (a6989586621679815165 ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings ((<=@#@$) :: TyFun a6989586621679815165 (a6989586621679815165 ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Elem_6989586621680883476Sym0 :: TyFun a6989586621680712273 (Identity a6989586621680712273 ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Null_6989586621680883623Sym0 :: TyFun (Identity a6989586621680712271) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ListtakeWhileSym0 :: TyFun (a6989586621680565307 ~> Bool) ([a6989586621680565307] ~> [a6989586621680565307]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ListspanSym0 :: TyFun (a6989586621680565305 ~> Bool) ([a6989586621680565305] ~> ([a6989586621680565305], [a6989586621680565305])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ListpartitionSym0 :: TyFun (a6989586621680565303 ~> Bool) ([a6989586621680565303] ~> ([a6989586621680565303], [a6989586621680565303])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ListnubBySym0 :: TyFun (a6989586621680565295 ~> (a6989586621680565295 ~> Bool)) ([a6989586621680565295] ~> [a6989586621680565295]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ListfilterSym0 :: TyFun (a6989586621680565304 ~> Bool) ([a6989586621680565304] ~> [a6989586621680565304]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ListdropWhileSym0 :: TyFun (a6989586621680565306 ~> Bool) ([a6989586621680565306] ~> [a6989586621680565306]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (UnionBySym0 :: TyFun (a6989586621680303084 ~> (a6989586621680303084 ~> Bool)) ([a6989586621680303084] ~> ([a6989586621680303084] ~> [a6989586621680303084])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TakeWhileSym0 :: TyFun (a6989586621680303111 ~> Bool) ([a6989586621680303111] ~> [a6989586621680303111]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (SpanSym0 :: TyFun (a6989586621680303108 ~> Bool) ([a6989586621680303108] ~> ([a6989586621680303108], [a6989586621680303108])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (SelectSym0 :: TyFun (a6989586621680303094 ~> Bool) (a6989586621680303094 ~> (([a6989586621680303094], [a6989586621680303094]) ~> ([a6989586621680303094], [a6989586621680303094]))) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (PartitionSym0 :: TyFun (a6989586621680303095 ~> Bool) ([a6989586621680303095] ~> ([a6989586621680303095], [a6989586621680303095])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (NubBySym0 :: TyFun (a6989586621680303086 ~> (a6989586621680303086 ~> Bool)) ([a6989586621680303086] ~> [a6989586621680303086]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680312569ZsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680312569YsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680312569X_6989586621680312570Sym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] ([k], [k]) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680312526ZsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680312526YsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680312526X_6989586621680312527Sym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] ([k], [k]) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (IntersectBySym0 :: TyFun (a6989586621680303112 ~> (a6989586621680303112 ~> Bool)) ([a6989586621680303112] ~> ([a6989586621680303112] ~> [a6989586621680303112])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (GroupBySym0 :: TyFun (a6989586621680303098 ~> (a6989586621680303098 ~> Bool)) ([a6989586621680303098] ~> [[a6989586621680303098]]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FindSym0 :: TyFun (a6989586621680303118 ~> Bool) ([a6989586621680303118] ~> Maybe a6989586621680303118) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FindIndicesSym0 :: TyFun (a6989586621680303114 ~> Bool) ([a6989586621680303114] ~> [Nat]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FindIndexSym0 :: TyFun (a6989586621680303115 ~> Bool) ([a6989586621680303115] ~> Maybe Nat) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FilterSym0 :: TyFun (a6989586621680303119 ~> Bool) ([a6989586621680303119] ~> [a6989586621680303119]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Elem_bySym0 :: TyFun (a6989586621680303085 ~> (a6989586621680303085 ~> Bool)) (a6989586621680303085 ~> ([a6989586621680303085] ~> Bool)) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (DropWhileSym0 :: TyFun (a6989586621680303110 ~> Bool) ([a6989586621680303110] ~> [a6989586621680303110]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (DropWhileEndSym0 :: TyFun (a6989586621680303109 ~> Bool) ([a6989586621680303109] ~> [a6989586621680303109]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (DeleteFirstsBySym0 :: TyFun (a6989586621680303124 ~> (a6989586621680303124 ~> Bool)) ([a6989586621680303124] ~> ([a6989586621680303124] ~> [a6989586621680303124])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (DeleteBySym0 :: TyFun (a6989586621680303125 ~> (a6989586621680303125 ~> Bool)) (a6989586621680303125 ~> ([a6989586621680303125] ~> [a6989586621680303125])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (BreakSym0 :: TyFun (a6989586621680303107 ~> Bool) ([a6989586621680303107] ~> ([a6989586621680303107], [a6989586621680303107])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (AnySym0 :: TyFun (a6989586621680303188 ~> Bool) ([a6989586621680303188] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (AllSym0 :: TyFun (a6989586621680303189 ~> Bool) ([a6989586621680303189] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (UntilSym0 :: TyFun (a6989586621679791163 ~> Bool) ((a6989586621679791163 ~> a6989586621679791163) ~> (a6989586621679791163 ~> a6989586621679791163)) -> Type) | |
Defined in Data.Singletons.Prelude.Base Methods suppressUnusedWarnings :: () # | |
| SingI x => SingI ((||@#@$$) x :: TyFun Bool Bool -> Type) | |
Defined in Data.Singletons.Prelude.Bool | |
| SingI x => SingI ((&&@#@$$) x :: TyFun Bool Bool -> Type) | |
Defined in Data.Singletons.Prelude.Bool | |
| SingI x => SingI ((<=?@#@$$) x :: TyFun Nat Bool -> Type) | |
Defined in Data.Singletons.TypeLits.Internal Methods sing :: Sing ((<=?@#@$$) x) # | |
| SAlternative f => SingI (GuardSym0 :: TyFun Bool (f ()) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| SApplicative f => SingI (WhenSym0 :: TyFun Bool (f () ~> f ()) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| SApplicative f => SingI (UnlessSym0 :: TyFun Bool (f () ~> f ()) -> Type) | |
Defined in Data.Singletons.Prelude.Monad Methods sing :: Sing UnlessSym0 # | |
| SingI (ListnullSym0 :: TyFun [a] Bool -> Type) | |
| SEq a => SingI (ListisPrefixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type) | |
| SingI (NullSym0 :: TyFun [a] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| SEq a => SingI (IsSuffixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing IsSuffixOfSym0 # | |
| SEq a => SingI (IsPrefixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing IsPrefixOfSym0 # | |
| SEq a => SingI (IsInfixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing IsInfixOfSym0 # | |
| SingI (IsNothingSym0 :: TyFun (Maybe a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing IsNothingSym0 # | |
| SingI (IsJustSym0 :: TyFun (Maybe a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing IsJustSym0 # | |
| SEq a => SingI (ListelemSym0 :: TyFun a ([a] ~> Bool) -> Type) | |
| SEq a => SingI (NotElemSym0 :: TyFun a ([a] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| SEq a => SingI (ElemSym0 :: TyFun a ([a] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| SFoldable t => SingI (OrSym0 :: TyFun (t Bool) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
| SFoldable t => SingI (AndSym0 :: TyFun (t Bool) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
| SEq a => SingI ((==@#@$) :: TyFun a (a ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Eq | |
| SEq a => SingI ((/=@#@$) :: TyFun a (a ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Eq | |
| SingI (Bool_Sym0 :: TyFun a (a ~> (Bool ~> a)) -> Type) | |
Defined in Data.Singletons.Prelude.Bool | |
| SOrd a => SingI ((>@#@$) :: TyFun a (a ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Ord | |
| SOrd a => SingI ((>=@#@$) :: TyFun a (a ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Ord | |
| SOrd a => SingI ((<@#@$) :: TyFun a (a ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Ord | |
| SOrd a => SingI ((<=@#@$) :: TyFun a (a ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Ord | |
| SingI (ListtakeWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) | |
| SingI (ListspanSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) | |
| SingI (ListpartitionSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) | |
| SingI (ListnubBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> [a]) -> Type) | |
| SingI (ListfilterSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) | |
| SingI (ListdropWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) | |
| SingI (UnionBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> ([a] ~> [a])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing UnionBySym0 # | |
| SingI (TakeWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing TakeWhileSym0 # | |
| SingI (SpanSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| SingI (SelectSym0 :: TyFun (a ~> Bool) (a ~> (([a], [a]) ~> ([a], [a]))) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| SingI (PartitionSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing PartitionSym0 # | |
| SingI (NubBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> [a]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| SingI (IntersectBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> ([a] ~> [a])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing IntersectBySym0 # | |
| SingI (GroupBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> [[a]]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing GroupBySym0 # | |
| SingI (FindSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| SingI (FindIndicesSym0 :: TyFun (a ~> Bool) ([a] ~> [Nat]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing FindIndicesSym0 # | |
| SingI (FindIndexSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe Nat) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing FindIndexSym0 # | |
| SingI (FilterSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing FilterSym0 # | |
| SingI (Elem_bySym0 :: TyFun (a ~> (a ~> Bool)) (a ~> ([a] ~> Bool)) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| SingI (DropWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing DropWhileSym0 # | |
| SingI (DropWhileEndSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods | |
| SingI (DeleteFirstsBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> ([a] ~> [a])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods | |
| SingI (DeleteBySym0 :: TyFun (a ~> (a ~> Bool)) (a ~> ([a] ~> [a])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing DeleteBySym0 # | |
| SingI (BreakSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| SingI (AnySym0 :: TyFun (a ~> Bool) ([a] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| SingI (AllSym0 :: TyFun (a ~> Bool) ([a] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| SingI (UntilSym0 :: TyFun (a ~> Bool) ((a ~> a) ~> (a ~> a)) -> Type) | |
Defined in Data.Singletons.Prelude.Base | |
| SuppressUnusedWarnings (ListisPrefixOfSym1 a6989586621680568488 :: TyFun [a6989586621680565301] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ListelemSym1 a6989586621680568423 :: TyFun [a6989586621680565289] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (NotElemSym1 a6989586621680313051 :: TyFun [a6989586621680303167] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (IsSuffixOfSym1 a6989586621680313676 :: TyFun [a6989586621680303170] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (IsPrefixOfSym1 a6989586621680313085 :: TyFun [a6989586621680303171] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (IsInfixOfSym1 a6989586621680313323 :: TyFun [a6989586621680303169] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ElemSym1 a6989586621680313058 :: TyFun [a6989586621680303168] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (AnySym1 a6989586621680313316 :: TyFun [a6989586621680303188] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (AllSym1 a6989586621680313371 :: TyFun [a6989586621680303189] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (IsRightSym0 :: TyFun (Either a6989586621679855247 b6989586621679855248) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (IsLeftSym0 :: TyFun (Either a6989586621679855249 b6989586621679855250) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680312398Scrutinee_6989586621680303786Sym0 :: TyFun k1 (TyFun k Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Elem_bySym1 a6989586621680312343 :: TyFun a6989586621680303085 ([a6989586621680303085] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (NotElemSym0 :: TyFun a6989586621680712167 (t6989586621680712166 a6989586621680712167 ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680704073Scrutinee_6989586621680704011Sym1 x6989586621680704066 :: TyFun k1 Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680704046Scrutinee_6989586621680704009Sym1 x6989586621680704039 :: TyFun k1 Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Elem_6989586621680713973Sym0 :: TyFun a6989586621680712273 (t6989586621680712256 a6989586621680712273 ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Elem_6989586621680713806Sym0 :: TyFun a6989586621680712273 (t6989586621680712256 a6989586621680712273 ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Elem_6989586621680713639Sym0 :: TyFun a6989586621680712273 (t6989586621680712256 a6989586621680712273 ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Elem_6989586621680713302Sym0 :: TyFun a6989586621680712273 (t6989586621680712256 a6989586621680712273 ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Elem_6989586621680713182Sym0 :: TyFun a6989586621680712273 (t6989586621680712256 a6989586621680712273 ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ElemSym0 :: TyFun a6989586621680712273 (t6989586621680712256 a6989586621680712273 ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (DefaultEqSym1 a6989586621679787905 :: TyFun k6989586621679787904 Bool -> Type) | |
Defined in Data.Singletons.Prelude.Eq Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings ((==@#@$$) x6989586621679787922 :: TyFun a6989586621679787917 Bool -> Type) | |
Defined in Data.Singletons.Prelude.Eq Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings ((/=@#@$$) x6989586621679787927 :: TyFun a6989586621679787917 Bool -> Type) | |
Defined in Data.Singletons.Prelude.Eq Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Bool_Sym1 a6989586621679780312 :: TyFun a6989586621679780269 (Bool ~> a6989586621679780269) -> Type) | |
Defined in Data.Singletons.Prelude.Bool Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679815779Sym1 a6989586621679815777 :: TyFun a6989586621679815165 Bool -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679815755Sym1 a6989586621679815753 :: TyFun a6989586621679815165 Bool -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679815734Sym1 a6989586621679815732 :: TyFun a6989586621679815165 Bool -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679815712Sym1 a6989586621679815710 :: TyFun a6989586621679815165 Bool -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679815818Scrutinee_6989586621679815233Sym1 x6989586621679815816 :: TyFun k1 Bool -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679815794Scrutinee_6989586621679815231Sym1 x6989586621679815790 :: TyFun k1 Bool -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679815677Scrutinee_6989586621679815211Sym1 x6989586621679815669 :: TyFun k1 Bool -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679815671Scrutinee_6989586621679815209Sym1 x6989586621679815669 :: TyFun k1 Bool -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings ((>@#@$$) arg6989586621679815642 :: TyFun a6989586621679815165 Bool -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings ((>=@#@$$) arg6989586621679815646 :: TyFun a6989586621679815165 Bool -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings ((<@#@$$) arg6989586621679815632 :: TyFun a6989586621679815165 Bool -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings ((<=@#@$$) arg6989586621679815638 :: TyFun a6989586621679815165 Bool -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621681105244Sym0 :: TyFun (Arg a6989586621681093754 b6989586621681093755) (Arg a6989586621681093754 b6989586621681093755 ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Elem_6989586621680883476Sym1 a6989586621680883474 :: TyFun (Identity a6989586621680712273) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680312601ZsSym0 :: TyFun (k1 ~> (a6989586621680303108 ~> Bool)) (TyFun k1 (TyFun [a6989586621680303108] [a6989586621680303108] -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680312601YsSym0 :: TyFun (k1 ~> (a6989586621680303108 ~> Bool)) (TyFun k1 (TyFun [a6989586621680303108] [a6989586621680303108] -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680312601X_6989586621680312602Sym0 :: TyFun (k1 ~> (a6989586621680303108 ~> Bool)) (TyFun k1 (TyFun [a6989586621680303108] ([a6989586621680303108], [a6989586621680303108]) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680312359NubBy'Sym0 :: TyFun (k1 ~> (k1 ~> Bool)) (TyFun k (TyFun [k1] ([k1] ~> [k1]) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680313692Sym0 :: TyFun (a6989586621680303205 ~> Bool) (TyFun k (TyFun a6989586621680303205 (TyFun [a6989586621680303205] [a6989586621680303205] -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680712726Scrutinee_6989586621680712507Sym0 :: TyFun (a6989586621680712259 ~> Bool) (TyFun (t6989586621680712256 a6989586621680712259) Any -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680712713Scrutinee_6989586621680712509Sym0 :: TyFun (a6989586621680712259 ~> Bool) (TyFun (t6989586621680712256 a6989586621680712259) All -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680712628Scrutinee_6989586621680712515Sym0 :: TyFun (a6989586621680712259 ~> Bool) (TyFun (t6989586621680712256 a6989586621680712259) (First a6989586621680712259) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680712629Sym0 :: TyFun (a6989586621679076674 ~> Bool) (TyFun k (TyFun a6989586621679076674 (First a6989586621679076674) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FindSym0 :: TyFun (a6989586621680712165 ~> Bool) (t6989586621680712164 a6989586621680712165 ~> Maybe a6989586621680712165) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (AnySym0 :: TyFun (a6989586621680712175 ~> Bool) (t6989586621680712174 a6989586621680712175 ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (AllSym0 :: TyFun (a6989586621680712173 ~> Bool) (t6989586621680712172 a6989586621680712173 ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679791803GoSym0 :: TyFun (k2 ~> Bool) (TyFun (k2 ~> k2) (TyFun k1 (TyFun k2 k2 -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Base Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (MfilterSym0 :: TyFun (a6989586621681056585 ~> Bool) (m6989586621681056583 a6989586621681056585 ~> m6989586621681056583 a6989586621681056585) -> Type) | |
Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FilterMSym0 :: TyFun (a6989586621681056624 ~> m6989586621681056623 Bool) ([a6989586621681056624] ~> m6989586621681056623 [a6989586621681056624]) -> Type) | |
Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () # | |
| (SEq a, SingI d) => SingI (ListisPrefixOfSym1 d :: TyFun [a] Bool -> Type) | |
| (SEq a, SingI d) => SingI (ListelemSym1 d :: TyFun [a] Bool -> Type) | |
| (SEq a, SingI d) => SingI (NotElemSym1 d :: TyFun [a] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| (SEq a, SingI d) => SingI (IsSuffixOfSym1 d :: TyFun [a] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing (IsSuffixOfSym1 d) # | |
| (SEq a, SingI d) => SingI (IsPrefixOfSym1 d :: TyFun [a] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing (IsPrefixOfSym1 d) # | |
| (SEq a, SingI d) => SingI (IsInfixOfSym1 d :: TyFun [a] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing (IsInfixOfSym1 d) # | |
| (SEq a, SingI d) => SingI (ElemSym1 d :: TyFun [a] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| SingI d => SingI (AnySym1 d :: TyFun [a] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| SingI d => SingI (AllSym1 d :: TyFun [a] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| SingI (IsRightSym0 :: TyFun (Either a b) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods sing :: Sing IsRightSym0 # | |
| SingI (IsLeftSym0 :: TyFun (Either a b) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods sing :: Sing IsLeftSym0 # | |
| SingI d => SingI (Elem_bySym1 d :: TyFun a ([a] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| (SFoldable t, SEq a) => SingI (NotElemSym0 :: TyFun a (t a ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods sing :: Sing NotElemSym0 # | |
| (SFoldable t, SEq a) => SingI (ElemSym0 :: TyFun a (t a ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
| (SEq a, SingI x) => SingI ((==@#@$$) x :: TyFun a Bool -> Type) | |
Defined in Data.Singletons.Prelude.Eq | |
| (SEq a, SingI x) => SingI ((/=@#@$$) x :: TyFun a Bool -> Type) | |
Defined in Data.Singletons.Prelude.Eq | |
| SingI d => SingI (Bool_Sym1 d :: TyFun a (Bool ~> a) -> Type) | |
Defined in Data.Singletons.Prelude.Bool | |
| (SOrd a, SingI d) => SingI ((>@#@$$) d :: TyFun a Bool -> Type) | |
Defined in Data.Singletons.Prelude.Ord | |
| (SOrd a, SingI d) => SingI ((>=@#@$$) d :: TyFun a Bool -> Type) | |
Defined in Data.Singletons.Prelude.Ord | |
| (SOrd a, SingI d) => SingI ((<@#@$$) d :: TyFun a Bool -> Type) | |
Defined in Data.Singletons.Prelude.Ord | |
| (SOrd a, SingI d) => SingI ((<=@#@$$) d :: TyFun a Bool -> Type) | |
Defined in Data.Singletons.Prelude.Ord | |
| SFoldable t => SingI (FindSym0 :: TyFun (a ~> Bool) (t a ~> Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
| SFoldable t => SingI (AnySym0 :: TyFun (a ~> Bool) (t a ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
| SFoldable t => SingI (AllSym0 :: TyFun (a ~> Bool) (t a ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
| SMonadPlus m => SingI (MfilterSym0 :: TyFun (a ~> Bool) (m a ~> m a) -> Type) | |
Defined in Data.Singletons.Prelude.Monad Methods sing :: Sing MfilterSym0 # | |
| SApplicative m => SingI (FilterMSym0 :: TyFun (a ~> m Bool) ([a] ~> m [a]) -> Type) | |
Defined in Data.Singletons.Prelude.Monad Methods sing :: Sing FilterMSym0 # | |
| SuppressUnusedWarnings (Bool_Sym2 a6989586621679780314 a6989586621679780312 :: TyFun Bool a6989586621679780269 -> Type) | |
Defined in Data.Singletons.Prelude.Bool Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Elem_bySym2 a6989586621680312344 a6989586621680312343 :: TyFun [a6989586621680303085] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680313077Scrutinee_6989586621680303790Sym0 :: TyFun k1 (TyFun k3 (TyFun k2 (TyFun [k3] Bool -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680312495Scrutinee_6989586621680303770Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680312481Scrutinee_6989586621680303772Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680312466Scrutinee_6989586621680303782Sym0 :: TyFun k1 (TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680312398Scrutinee_6989586621680303786Sym1 n6989586621680312396 :: TyFun k Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680312385Scrutinee_6989586621680303788Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Null_6989586621680714096Sym0 :: TyFun (t6989586621680712256 a6989586621680712271) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Null_6989586621680713929Sym0 :: TyFun (t6989586621680712256 a6989586621680712271) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Null_6989586621680713762Sym0 :: TyFun (t6989586621680712256 a6989586621680712271) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Null_6989586621680713616Sym0 :: TyFun (t6989586621680712256 a6989586621680712271) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Null_6989586621680713440Sym0 :: TyFun (t6989586621680712256 a6989586621680712271) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Null_6989586621680713145Sym0 :: TyFun (t6989586621680712256 a6989586621680712271) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (NullSym0 :: TyFun (t6989586621680712256 a6989586621680712271) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (NotElemSym1 a6989586621680712649 t6989586621680712166 :: TyFun (t6989586621680712166 a6989586621680712167) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680713132Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Elem_6989586621680713973Sym1 a6989586621680713971 t6989586621680712256 :: TyFun (t6989586621680712256 a6989586621680712273) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Elem_6989586621680713806Sym1 a6989586621680713804 t6989586621680712256 :: TyFun (t6989586621680712256 a6989586621680712273) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Elem_6989586621680713639Sym1 a6989586621680713637 t6989586621680712256 :: TyFun (t6989586621680712256 a6989586621680712273) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Elem_6989586621680713302Sym1 a6989586621680713300 t6989586621680712256 :: TyFun (t6989586621680712256 a6989586621680712273) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Elem_6989586621680713182Sym1 a6989586621680713180 t6989586621680712256 :: TyFun (t6989586621680712256 a6989586621680712273) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ElemSym1 arg6989586621680712923 t6989586621680712256 :: TyFun (t6989586621680712256 a6989586621680712273) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (AnySym1 a6989586621680712720 t6989586621680712174 :: TyFun (t6989586621680712174 a6989586621680712175) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (AllSym1 a6989586621680712707 t6989586621680712172 :: TyFun (t6989586621680712172 a6989586621680712173) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621681062478Sym0 :: TyFun k1 (TyFun k3 (TyFun k2 (TyFun Bool (TyFun [k3] [k3] -> Type) -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621681105244Sym1 a6989586621681105242 :: TyFun (Arg a6989586621681093754 b6989586621681093755) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680313696Scrutinee_6989586621680303764Sym0 :: TyFun (k1 ~> Bool) (TyFun k1 (TyFun [a6989586621680303205] (TyFun k Bool -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680312369Scrutinee_6989586621680303792Sym0 :: TyFun (k3 ~> (k3 ~> Bool)) (TyFun k1 (TyFun k3 (TyFun k2 (TyFun [k3] Bool -> Type) -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621681062475Sym0 :: TyFun (k3 ~> f6989586621679932933 Bool) (TyFun k2 (TyFun k3 (TyFun (f6989586621679932933 [k3]) (f6989586621679932933 [k3]) -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621681062046Sym0 :: TyFun (k1 ~> Bool) (TyFun k (TyFun k1 (m6989586621679932957 k1) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () # | |
| (SingI d1, SingI d2) => SingI (Bool_Sym2 d1 d2 :: TyFun Bool a -> Type) | |
Defined in Data.Singletons.Prelude.Bool | |
| (SingI d1, SingI d2) => SingI (Elem_bySym2 d1 d2 :: TyFun [a] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| SFoldable t => SingI (NullSym0 :: TyFun (t a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
| (SFoldable t, SEq a, SingI d) => SingI (NotElemSym1 d t :: TyFun (t a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods sing :: Sing (NotElemSym1 d t) # | |
| (SFoldable t, SEq a, SingI d) => SingI (ElemSym1 d t :: TyFun (t a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
| (SFoldable t, SingI d) => SingI (AnySym1 d t :: TyFun (t a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
| (SFoldable t, SingI d) => SingI (AllSym1 d t :: TyFun (t a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
| SuppressUnusedWarnings (Let6989586621680313696Scrutinee_6989586621680303764Sym1 p6989586621680313690 :: TyFun k1 (TyFun [a6989586621680303205] (TyFun k Bool -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680313077Scrutinee_6989586621680303790Sym1 l6989586621680313067 :: TyFun k2 (TyFun k1 (TyFun [k2] Bool -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680312495Scrutinee_6989586621680303770Sym1 n6989586621680312492 :: TyFun k1 (TyFun k2 Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680312481Scrutinee_6989586621680303772Sym1 n6989586621680312478 :: TyFun k1 (TyFun k2 Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680312466Scrutinee_6989586621680303782Sym1 key6989586621680312462 :: TyFun k3 (TyFun k1 (TyFun k2 Bool -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680312385Scrutinee_6989586621680303788Sym1 x6989586621680312382 :: TyFun k1 (TyFun k2 Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680312369Scrutinee_6989586621680303792Sym1 eq6989586621680312357 :: TyFun k1 (TyFun k3 (TyFun k2 (TyFun [k3] Bool -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680713132Sym1 a_69895866216807131276989586621680713131 :: TyFun k1 (TyFun k2 Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680034951Scrutinee_6989586621680033323Sym0 :: TyFun k1 (TyFun k2 (TyFun k2 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621681062478Sym1 p6989586621681062465 :: TyFun k2 (TyFun k1 (TyFun Bool (TyFun [k2] [k2] -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680313696Scrutinee_6989586621680303764Sym2 x6989586621680313694 p6989586621680313690 :: TyFun [a6989586621680303205] (TyFun k Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680313077Scrutinee_6989586621680303790Sym2 x6989586621680313074 l6989586621680313067 :: TyFun k1 (TyFun [k2] Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680312495Scrutinee_6989586621680303770Sym2 x6989586621680312493 n6989586621680312492 :: TyFun k1 Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680312481Scrutinee_6989586621680303772Sym2 x6989586621680312479 n6989586621680312478 :: TyFun k1 Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680312466Scrutinee_6989586621680303782Sym2 x6989586621680312463 key6989586621680312462 :: TyFun k1 (TyFun k2 Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680312385Scrutinee_6989586621680303788Sym2 xs6989586621680312383 x6989586621680312382 :: TyFun k1 Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680312369Scrutinee_6989586621680303792Sym2 l6989586621680312358 eq6989586621680312357 :: TyFun k3 (TyFun k1 (TyFun [k3] Bool -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680713132Sym2 t6989586621680713139 a_69895866216807131276989586621680713131 :: TyFun k1 Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680034951Scrutinee_6989586621680033323Sym1 x06989586621680034934 :: TyFun k1 (TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680034780Scrutinee_6989586621680033356Sym0 :: TyFun k2 (TyFun k1 (TyFun k2 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680034540Scrutinee_6989586621680033372Sym0 :: TyFun k2 (TyFun k1 (TyFun k2 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621681062478Sym2 x6989586621681062477 p6989586621681062465 :: TyFun k1 (TyFun Bool (TyFun [k2] [k2] -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680313351Sym0 :: TyFun (b6989586621679932961 ~> (a6989586621680303188 ~> Bool)) (TyFun k1 (TyFun k2 (TyFun a6989586621680303188 (TyFun [a6989586621680303188] (TyFun b6989586621679932961 (m6989586621679932957 b6989586621679932961) -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621681062478Sym3 a_69895866216810624606989586621681062469 x6989586621681062477 p6989586621681062465 :: TyFun Bool (TyFun [k2] [k2] -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680313077Scrutinee_6989586621680303790Sym3 xs6989586621680313075 x6989586621680313074 l6989586621680313067 :: TyFun [k2] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680313696Scrutinee_6989586621680303764Sym3 xs6989586621680313695 x6989586621680313694 p6989586621680313690 :: TyFun k Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680312466Scrutinee_6989586621680303782Sym3 y6989586621680312464 x6989586621680312463 key6989586621680312462 :: TyFun k1 Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680312369Scrutinee_6989586621680303792Sym3 y6989586621680312366 l6989586621680312358 eq6989586621680312357 :: TyFun k1 (TyFun [k3] Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680034951Scrutinee_6989586621680033323Sym2 y6989586621680034936 x06989586621680034934 :: TyFun k3 (TyFun k1 (TyFun k2 Bool -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680034780Scrutinee_6989586621680033356Sym1 x16989586621680034753 :: TyFun k1 (TyFun k5 (TyFun k2 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680034540Scrutinee_6989586621680033372Sym1 x16989586621680034535 :: TyFun k1 (TyFun k5 (TyFun k2 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680312369Scrutinee_6989586621680303792Sym4 ys6989586621680312367 y6989586621680312366 l6989586621680312358 eq6989586621680312357 :: TyFun [k3] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680034951Scrutinee_6989586621680033323Sym3 x6989586621680034949 y6989586621680034936 x06989586621680034934 :: TyFun k1 (TyFun k2 Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680034780Scrutinee_6989586621680033356Sym2 x26989586621680034756 x16989586621680034753 :: TyFun k5 (TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680034540Scrutinee_6989586621680033372Sym2 x26989586621680034536 x16989586621680034535 :: TyFun k5 (TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680034951Scrutinee_6989586621680033323Sym4 arg_69895866216800333166989586621680034927 x6989586621680034949 y6989586621680034936 x06989586621680034934 :: TyFun k1 Bool -> Type) | |
Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680034780Scrutinee_6989586621680033356Sym3 y6989586621680034759 x26989586621680034756 x16989586621680034753 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680034540Scrutinee_6989586621680033372Sym3 y6989586621680034537 x26989586621680034536 x16989586621680034535 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680034780Scrutinee_6989586621680033356Sym4 arg_69895866216800333506989586621680034729 y6989586621680034759 x26989586621680034756 x16989586621680034753 :: TyFun k1 (TyFun k2 Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680034540Scrutinee_6989586621680033372Sym4 arg_69895866216800333666989586621680034527 y6989586621680034537 x26989586621680034536 x16989586621680034535 :: TyFun k1 (TyFun k2 Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680034780Scrutinee_6989586621680033356Sym5 arg_69895866216800333526989586621680034733 arg_69895866216800333506989586621680034729 y6989586621680034759 x26989586621680034756 x16989586621680034753 :: TyFun k1 Bool -> Type) | |
Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680034540Scrutinee_6989586621680033372Sym5 arg_69895866216800333686989586621680034528 arg_69895866216800333666989586621680034527 y6989586621680034537 x26989586621680034536 x16989586621680034535 :: TyFun k1 Bool -> Type) | |
Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () # | |
| type Rep Bool | Since: base-4.6.0.0 |
| data Sing (a :: Bool) | |
| type DemoteRep Bool | |
Defined in GHC.Generics | |
| newtype Vector Bool | |
| type MaxBound | |
Defined in Data.Singletons.Prelude.Enum type MaxBound = MaxBound_6989586621680024478Sym0 | |
| type MinBound | |
Defined in Data.Singletons.Prelude.Enum type MinBound = MinBound_6989586621680024473Sym0 | |
| data Sing (a :: Bool) | |
| type Demote Bool | |
Defined in Data.Singletons.Prelude.Instances | |
| type Show_ (arg :: Bool) | |
| type FromEnum (a :: Bool) | |
Defined in Data.Singletons.Prelude.Enum | |
| type ToEnum a | |
Defined in Data.Singletons.Prelude.Enum | |
| type Pred (arg :: Bool) | |
| type Succ (arg :: Bool) | |
| newtype MVector s Bool | |
| type ShowList (arg1 :: [Bool]) arg2 | |
| type EnumFromTo (arg1 :: Bool) (arg2 :: Bool) | |
| type Min (arg1 :: Bool) (arg2 :: Bool) | |
| type Max (arg1 :: Bool) (arg2 :: Bool) | |
| type (arg1 :: Bool) >= (arg2 :: Bool) | |
| type (arg1 :: Bool) > (arg2 :: Bool) | |
| type (arg1 :: Bool) <= (arg2 :: Bool) | |
| type (arg1 :: Bool) < (arg2 :: Bool) | |
| type Compare (a1 :: Bool) (a2 :: Bool) | |
| type (x :: Bool) /= (y :: Bool) | |
| type (a :: Bool) == (b :: Bool) | |
Defined in Data.Singletons.Prelude.Eq | |
| type ShowsPrec a1 (a2 :: Bool) a3 | |
| type EnumFromThenTo (arg1 :: Bool) (arg2 :: Bool) (arg3 :: Bool) | |
| type Apply NotSym0 (a6989586621679782781 :: Bool) | |
Defined in Data.Singletons.Prelude.Bool | |
| type Apply ToEnum_6989586621680082233Sym0 (a6989586621680082232 :: Nat) | |
Defined in Data.Singletons.Prelude.Enum | |
| type Apply GetAnySym0 (a6989586621680191439 :: Any) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Apply GetAllSym0 (a6989586621680191426 :: All) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Apply FromEnum_6989586621680082248Sym0 (a6989586621680082247 :: Bool) | |
Defined in Data.Singletons.Prelude.Enum | |
| type Apply Any_Sym0 (a6989586621680228623 :: Bool) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Apply AnySym0 (t6989586621680191442 :: Bool) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Apply All_Sym0 (a6989586621680228624 :: Bool) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Apply AllSym0 (t6989586621680191429 :: Bool) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Apply ((||@#@$$) a6989586621679782260 :: TyFun Bool Bool -> Type) (b6989586621679782261 :: Bool) | |
| type Apply ((&&@#@$$) a6989586621679781627 :: TyFun Bool Bool -> Type) (b6989586621679781630 :: Bool) | |
| type Apply ((<=?@#@$$) a3530822107858468865 :: TyFun Nat Bool -> Type) (b3530822107858468866 :: Nat) | |
Defined in Data.Singletons.TypeLits.Internal | |
| type Apply (Let6989586621679475351Scrutinee_6989586621679460508Sym0 :: TyFun k1 Bool -> Type) (n6989586621679475350 :: k1) Source # | |
Defined in Termonad.Config.Vec type Apply (Let6989586621679475351Scrutinee_6989586621679460508Sym0 :: TyFun k1 Bool -> Type) (n6989586621679475350 :: k1) = Let6989586621679475351Scrutinee_6989586621679460508 n6989586621679475350 | |
| type Apply (Let6989586621679475355Scrutinee_6989586621679460510Sym0 :: TyFun k1 Bool -> Type) (n6989586621679475350 :: k1) Source # | |
Defined in Termonad.Config.Vec type Apply (Let6989586621679475355Scrutinee_6989586621679460510Sym0 :: TyFun k1 Bool -> Type) (n6989586621679475350 :: k1) = Let6989586621679475355Scrutinee_6989586621679460510 n6989586621679475350 | |
| type Apply (Compare_6989586621679830166Sym1 a6989586621679830164 :: TyFun Bool Ordering -> Type) (a6989586621679830165 :: Bool) | |
| type Apply (TFHelper_6989586621679815712Sym1 a6989586621679815710 :: TyFun a Bool -> Type) (a6989586621679815711 :: a) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (Let6989586621680704046Scrutinee_6989586621680704009Sym1 x6989586621680704039 :: TyFun k1 Bool -> Type) (y6989586621680704040 :: k1) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (Let6989586621680704073Scrutinee_6989586621680704011Sym1 x6989586621680704066 :: TyFun k1 Bool -> Type) (y6989586621680704067 :: k1) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply ((==@#@$$) x6989586621679787922 :: TyFun a Bool -> Type) (y6989586621679787923 :: a) | |
| type Apply ((/=@#@$$) x6989586621679787927 :: TyFun a Bool -> Type) (y6989586621679787928 :: a) | |
| type Apply (DefaultEqSym1 a6989586621679787905 :: TyFun k Bool -> Type) (b6989586621679787906 :: k) | |
Defined in Data.Singletons.Prelude.Eq | |
| type Apply (Let6989586621679815671Scrutinee_6989586621679815209Sym1 x6989586621679815669 :: TyFun k1 Bool -> Type) (y6989586621679815670 :: k1) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (TFHelper_6989586621679815779Sym1 a6989586621679815777 :: TyFun a Bool -> Type) (a6989586621679815778 :: a) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (TFHelper_6989586621679815755Sym1 a6989586621679815753 :: TyFun a Bool -> Type) (a6989586621679815754 :: a) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (TFHelper_6989586621679815734Sym1 a6989586621679815732 :: TyFun a Bool -> Type) (a6989586621679815733 :: a) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply ((<=@#@$$) arg6989586621679815638 :: TyFun a Bool -> Type) (arg6989586621679815639 :: a) | |
| type Apply ((>=@#@$$) arg6989586621679815646 :: TyFun a Bool -> Type) (arg6989586621679815647 :: a) | |
| type Apply ((>@#@$$) arg6989586621679815642 :: TyFun a Bool -> Type) (arg6989586621679815643 :: a) | |
| type Apply (Let6989586621679815818Scrutinee_6989586621679815233Sym1 x6989586621679815816 :: TyFun k1 Bool -> Type) (y6989586621679815817 :: k1) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (Let6989586621679815794Scrutinee_6989586621679815231Sym1 x6989586621679815790 :: TyFun k1 Bool -> Type) (y6989586621679815792 :: k1) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (Let6989586621679815677Scrutinee_6989586621679815211Sym1 x6989586621679815669 :: TyFun k1 Bool -> Type) (y6989586621679815670 :: k1) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply ((<@#@$$) arg6989586621679815632 :: TyFun a Bool -> Type) (arg6989586621679815633 :: a) | |
| type Apply (Let6989586621680312398Scrutinee_6989586621680303786Sym1 n6989586621680312396 :: TyFun k Bool -> Type) (x6989586621680312397 :: k) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (Bool_Sym2 a6989586621679780314 a6989586621679780312 :: TyFun Bool a -> Type) (a6989586621679780315 :: Bool) | |
| type Apply (Let6989586621680312385Scrutinee_6989586621680303788Sym2 xs6989586621680312383 x6989586621680312382 :: TyFun k3 Bool -> Type) (n6989586621680312384 :: k3) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (Let6989586621680312481Scrutinee_6989586621680303772Sym2 x6989586621680312479 n6989586621680312478 :: TyFun k3 Bool -> Type) (xs6989586621680312480 :: k3) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (Let6989586621680312495Scrutinee_6989586621680303770Sym2 x6989586621680312493 n6989586621680312492 :: TyFun k3 Bool -> Type) (xs6989586621680312494 :: k3) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (Lambda_6989586621680713132Sym2 t6989586621680713139 a_69895866216807131276989586621680713131 :: TyFun k3 Bool -> Type) (t6989586621680713140 :: k3) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (Let6989586621680312466Scrutinee_6989586621680303782Sym3 y6989586621680312464 x6989586621680312463 key6989586621680312462 :: TyFun k3 Bool -> Type) (xys6989586621680312465 :: k3) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680312466Scrutinee_6989586621680303782Sym3 y6989586621680312464 x6989586621680312463 key6989586621680312462 :: TyFun k3 Bool -> Type) (xys6989586621680312465 :: k3) = Let6989586621680312466Scrutinee_6989586621680303782 y6989586621680312464 x6989586621680312463 key6989586621680312462 xys6989586621680312465 | |
| type Apply (Let6989586621680313696Scrutinee_6989586621680303764Sym3 xs6989586621680313695 x6989586621680313694 p6989586621680313690 :: TyFun k Bool -> Type) (a_69895866216803136886989586621680313691 :: k) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680313696Scrutinee_6989586621680303764Sym3 xs6989586621680313695 x6989586621680313694 p6989586621680313690 :: TyFun k Bool -> Type) (a_69895866216803136886989586621680313691 :: k) = Let6989586621680313696Scrutinee_6989586621680303764 xs6989586621680313695 x6989586621680313694 p6989586621680313690 a_69895866216803136886989586621680313691 | |
| type Apply (Let6989586621680034951Scrutinee_6989586621680033323Sym4 arg_69895866216800333166989586621680034927 x6989586621680034949 y6989586621680034936 x06989586621680034934 :: TyFun k4 Bool -> Type) (arg_69895866216800333186989586621680034929 :: k4) | |
Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680034951Scrutinee_6989586621680033323Sym4 arg_69895866216800333166989586621680034927 x6989586621680034949 y6989586621680034936 x06989586621680034934 :: TyFun k4 Bool -> Type) (arg_69895866216800333186989586621680034929 :: k4) = Let6989586621680034951Scrutinee_6989586621680033323 arg_69895866216800333166989586621680034927 x6989586621680034949 y6989586621680034936 x06989586621680034934 arg_69895866216800333186989586621680034929 | |
| type Apply (Let6989586621680034540Scrutinee_6989586621680033372Sym5 arg_69895866216800333686989586621680034528 arg_69895866216800333666989586621680034527 y6989586621680034537 x26989586621680034536 x16989586621680034535 :: TyFun k5 Bool -> Type) (arg_69895866216800333706989586621680034529 :: k5) | |
Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680034540Scrutinee_6989586621680033372Sym5 arg_69895866216800333686989586621680034528 arg_69895866216800333666989586621680034527 y6989586621680034537 x26989586621680034536 x16989586621680034535 :: TyFun k5 Bool -> Type) (arg_69895866216800333706989586621680034529 :: k5) = Let6989586621680034540Scrutinee_6989586621680033372 arg_69895866216800333686989586621680034528 arg_69895866216800333666989586621680034527 y6989586621680034537 x26989586621680034536 x16989586621680034535 arg_69895866216800333706989586621680034529 | |
| type Apply (Let6989586621680034780Scrutinee_6989586621680033356Sym5 arg_69895866216800333526989586621680034733 arg_69895866216800333506989586621680034729 y6989586621680034759 x26989586621680034756 x16989586621680034753 :: TyFun k5 Bool -> Type) (arg_69895866216800333546989586621680034736 :: k5) | |
Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680034780Scrutinee_6989586621680033356Sym5 arg_69895866216800333526989586621680034733 arg_69895866216800333506989586621680034729 y6989586621680034759 x26989586621680034756 x16989586621680034753 :: TyFun k5 Bool -> Type) (arg_69895866216800333546989586621680034736 :: k5) = Let6989586621680034780Scrutinee_6989586621680033356 arg_69895866216800333526989586621680034733 arg_69895866216800333506989586621680034729 y6989586621680034759 x26989586621680034756 x16989586621680034753 arg_69895866216800333546989586621680034736 | |
| type Apply OrSym0 (a6989586621680313378 :: [Bool]) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply AndSym0 (a6989586621680313382 :: [Bool]) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (ListnullSym0 :: TyFun [a] Bool -> Type) (a6989586621680568340 :: [a]) | |
| type Apply (NullSym0 :: TyFun [a] Bool -> Type) (a6989586621680313682 :: [a]) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (IsNothingSym0 :: TyFun (Maybe a) Bool -> Type) (a6989586621680028313 :: Maybe a) | |
Defined in Data.Singletons.Prelude.Maybe | |
| type Apply (IsJustSym0 :: TyFun (Maybe a) Bool -> Type) (a6989586621680028320 :: Maybe a) | |
Defined in Data.Singletons.Prelude.Maybe | |
| type Apply (AndSym0 :: TyFun (t Bool) Bool -> Type) (a6989586621680712742 :: t Bool) | |
| type Apply (OrSym0 :: TyFun (t Bool) Bool -> Type) (a6989586621680712733 :: t Bool) | |
| type Apply (Null_6989586621680883623Sym0 :: TyFun (Identity a) Bool -> Type) (a6989586621680883622 :: Identity a) | |
| type Apply (Let6989586621680712736Scrutinee_6989586621680712505Sym0 :: TyFun (t6989586621680712256 Bool) Any -> Type) (x6989586621680712735 :: t6989586621680712256 Bool) | |
| type Apply (Let6989586621680712745Scrutinee_6989586621680712503Sym0 :: TyFun (t6989586621680712256 Bool) All -> Type) (x6989586621680712744 :: t6989586621680712256 Bool) | |
| type Apply (ListelemSym1 a6989586621680568423 :: TyFun [a] Bool -> Type) (a6989586621680568424 :: [a]) | |
| type Apply (ListisPrefixOfSym1 a6989586621680568488 :: TyFun [a] Bool -> Type) (a6989586621680568489 :: [a]) | |
| type Apply (NotElemSym1 a6989586621680313051 :: TyFun [a] Bool -> Type) (a6989586621680313052 :: [a]) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (ElemSym1 a6989586621680313058 :: TyFun [a] Bool -> Type) (a6989586621680313059 :: [a]) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (IsPrefixOfSym1 a6989586621680313085 :: TyFun [a] Bool -> Type) (a6989586621680313086 :: [a]) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (IsPrefixOfSym1 a6989586621680313085 :: TyFun [a] Bool -> Type) (a6989586621680313086 :: [a]) = IsPrefixOf a6989586621680313085 a6989586621680313086 | |
| type Apply (AnySym1 a6989586621680313316 :: TyFun [a] Bool -> Type) (a6989586621680313317 :: [a]) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (IsInfixOfSym1 a6989586621680313323 :: TyFun [a] Bool -> Type) (a6989586621680313324 :: [a]) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (AllSym1 a6989586621680313371 :: TyFun [a] Bool -> Type) (a6989586621680313372 :: [a]) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (IsSuffixOfSym1 a6989586621680313676 :: TyFun [a] Bool -> Type) (a6989586621680313677 :: [a]) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (IsSuffixOfSym1 a6989586621680313676 :: TyFun [a] Bool -> Type) (a6989586621680313677 :: [a]) = IsSuffixOf a6989586621680313676 a6989586621680313677 | |
| type Apply (Elem_6989586621680883476Sym1 a6989586621680883474 :: TyFun (Identity a) Bool -> Type) (a6989586621680883475 :: Identity a) | |
| type Apply (Elem_bySym2 a6989586621680312344 a6989586621680312343 :: TyFun [a] Bool -> Type) (a6989586621680312345 :: [a]) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (Elem_6989586621680713182Sym1 a6989586621680713180 t :: TyFun (t a) Bool -> Type) (a6989586621680713181 :: t a) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (Null_6989586621680713145Sym0 :: TyFun (t a) Bool -> Type) (a6989586621680713144 :: t a) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (AnySym1 a6989586621680712720 t :: TyFun (t a) Bool -> Type) (a6989586621680712721 :: t a) | |
| type Apply (ElemSym1 arg6989586621680712923 t :: TyFun (t a) Bool -> Type) (arg6989586621680712924 :: t a) | |
| type Apply (NotElemSym1 a6989586621680712649 t :: TyFun (t a) Bool -> Type) (a6989586621680712650 :: t a) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (NullSym0 :: TyFun (t a) Bool -> Type) (arg6989586621680712919 :: t a) | |
| type Apply (AllSym1 a6989586621680712707 t :: TyFun (t a) Bool -> Type) (a6989586621680712708 :: t a) | |
| type Apply (Elem_6989586621680713302Sym1 a6989586621680713300 t :: TyFun (t a) Bool -> Type) (a6989586621680713301 :: t a) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (Null_6989586621680713440Sym0 :: TyFun (t a) Bool -> Type) (a6989586621680713439 :: t a) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (Null_6989586621680713616Sym0 :: TyFun (t a) Bool -> Type) (a6989586621680713615 :: t a) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (Elem_6989586621680713639Sym1 a6989586621680713637 t :: TyFun (t a) Bool -> Type) (a6989586621680713638 :: t a) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (Null_6989586621680713762Sym0 :: TyFun (t a) Bool -> Type) (a6989586621680713761 :: t a) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (Elem_6989586621680713806Sym1 a6989586621680713804 t :: TyFun (t a) Bool -> Type) (a6989586621680713805 :: t a) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (Null_6989586621680713929Sym0 :: TyFun (t a) Bool -> Type) (a6989586621680713928 :: t a) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (Elem_6989586621680713973Sym1 a6989586621680713971 t :: TyFun (t a) Bool -> Type) (a6989586621680713972 :: t a) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (Null_6989586621680714096Sym0 :: TyFun (t a) Bool -> Type) (a6989586621680714095 :: t a) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (Let6989586621680313077Scrutinee_6989586621680303790Sym3 xs6989586621680313075 x6989586621680313074 l6989586621680313067 :: TyFun [k1] Bool -> Type) (ls6989586621680313076 :: [k1]) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680313077Scrutinee_6989586621680303790Sym3 xs6989586621680313075 x6989586621680313074 l6989586621680313067 :: TyFun [k1] Bool -> Type) (ls6989586621680313076 :: [k1]) = Let6989586621680313077Scrutinee_6989586621680303790 xs6989586621680313075 x6989586621680313074 l6989586621680313067 ls6989586621680313076 | |
| type Apply (Let6989586621680312369Scrutinee_6989586621680303792Sym4 ys6989586621680312367 y6989586621680312366 l6989586621680312358 eq6989586621680312357 :: TyFun [k2] Bool -> Type) (xs6989586621680312368 :: [k2]) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680312369Scrutinee_6989586621680303792Sym4 ys6989586621680312367 y6989586621680312366 l6989586621680312358 eq6989586621680312357 :: TyFun [k2] Bool -> Type) (xs6989586621680312368 :: [k2]) = Let6989586621680312369Scrutinee_6989586621680303792 ys6989586621680312367 y6989586621680312366 l6989586621680312358 eq6989586621680312357 xs6989586621680312368 | |
| type Apply (IsRightSym0 :: TyFun (Either a b) Bool -> Type) (a6989586621679856472 :: Either a b) | |
Defined in Data.Singletons.Prelude.Either | |
| type Apply (IsLeftSym0 :: TyFun (Either a b) Bool -> Type) (a6989586621679856474 :: Either a b) | |
Defined in Data.Singletons.Prelude.Either | |
| type Apply (TFHelper_6989586621681105244Sym1 a6989586621681105242 :: TyFun (Arg a b) Bool -> Type) (a6989586621681105243 :: Arg a b) | |
| type Apply (GuardSym0 :: TyFun Bool (f6989586621679932848 ()) -> Type) (a6989586621679933637 :: Bool) | |
| type Apply (||@#@$) (a6989586621679782260 :: Bool) | |
Defined in Data.Singletons.Prelude.Bool | |
| type Apply (&&@#@$) (a6989586621679781627 :: Bool) | |
Defined in Data.Singletons.Prelude.Bool | |
| type Apply Compare_6989586621679830166Sym0 (a6989586621679830164 :: Bool) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply ShowsPrec_6989586621680595456Sym0 (a6989586621680595453 :: Nat) | |
Defined in Data.Singletons.Prelude.Show | |
| type Apply (<=?@#@$) (a3530822107858468865 :: Nat) | |
Defined in Data.Singletons.TypeLits.Internal | |
| type Apply ShowParenSym0 (a6989586621680567849 :: Bool) | |
Defined in Data.Singletons.Prelude.Show | |
| type Apply (Let6989586621680704046Scrutinee_6989586621680704009Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621680704039 :: k1) | |
| type Apply (Let6989586621680704073Scrutinee_6989586621680704011Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621680704066 :: k1) | |
| type Apply (Let6989586621679815671Scrutinee_6989586621679815209Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621679815669 :: k1) | |
| type Apply (Let6989586621679815818Scrutinee_6989586621679815233Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621679815816 :: k1) | |
| type Apply (Let6989586621679815794Scrutinee_6989586621679815231Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621679815790 :: k1) | |
| type Apply (Let6989586621679815677Scrutinee_6989586621679815211Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621679815669 :: k1) | |
| type Apply (ListelemSym0 :: TyFun a6989586621680565289 ([a6989586621680565289] ~> Bool) -> Type) (a6989586621680568423 :: a6989586621680565289) | |
| type Apply (NotElemSym0 :: TyFun a6989586621680303167 ([a6989586621680303167] ~> Bool) -> Type) (a6989586621680313051 :: a6989586621680303167) | |
| type Apply (ElemSym0 :: TyFun a6989586621680303168 ([a6989586621680303168] ~> Bool) -> Type) (a6989586621680313058 :: a6989586621680303168) | |
| type Apply (ShowsPrec_6989586621680595456Sym1 a6989586621680595453 :: TyFun Bool (Symbol ~> Symbol) -> Type) (a6989586621680595454 :: Bool) | |
| type Apply (TFHelper_6989586621679815712Sym0 :: TyFun a6989586621679815165 (a6989586621679815165 ~> Bool) -> Type) (a6989586621679815710 :: a6989586621679815165) | |
| type Apply ((==@#@$) :: TyFun a6989586621679787917 (a6989586621679787917 ~> Bool) -> Type) (x6989586621679787922 :: a6989586621679787917) | |
| type Apply ((/=@#@$) :: TyFun a6989586621679787917 (a6989586621679787917 ~> Bool) -> Type) (x6989586621679787927 :: a6989586621679787917) | |
| type Apply (DefaultEqSym0 :: TyFun k6989586621679787904 (k6989586621679787904 ~> Bool) -> Type) (a6989586621679787905 :: k6989586621679787904) | |
Defined in Data.Singletons.Prelude.Eq type Apply (DefaultEqSym0 :: TyFun k6989586621679787904 (k6989586621679787904 ~> Bool) -> Type) (a6989586621679787905 :: k6989586621679787904) = DefaultEqSym1 a6989586621679787905 | |
| type Apply (Bool_Sym0 :: TyFun a6989586621679780269 (a6989586621679780269 ~> (Bool ~> a6989586621679780269)) -> Type) (a6989586621679780312 :: a6989586621679780269) | |
| type Apply (WhenSym0 :: TyFun Bool (f6989586621679932878 () ~> f6989586621679932878 ()) -> Type) (a6989586621679933922 :: Bool) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| type Apply (TFHelper_6989586621679815779Sym0 :: TyFun a6989586621679815165 (a6989586621679815165 ~> Bool) -> Type) (a6989586621679815777 :: a6989586621679815165) | |
| type Apply (TFHelper_6989586621679815755Sym0 :: TyFun a6989586621679815165 (a6989586621679815165 ~> Bool) -> Type) (a6989586621679815753 :: a6989586621679815165) | |
| type Apply (TFHelper_6989586621679815734Sym0 :: TyFun a6989586621679815165 (a6989586621679815165 ~> Bool) -> Type) (a6989586621679815732 :: a6989586621679815165) | |
| type Apply ((<=@#@$) :: TyFun a6989586621679815165 (a6989586621679815165 ~> Bool) -> Type) (arg6989586621679815638 :: a6989586621679815165) | |
| type Apply ((>=@#@$) :: TyFun a6989586621679815165 (a6989586621679815165 ~> Bool) -> Type) (arg6989586621679815646 :: a6989586621679815165) | |
| type Apply ((>@#@$) :: TyFun a6989586621679815165 (a6989586621679815165 ~> Bool) -> Type) (arg6989586621679815642 :: a6989586621679815165) | |
| type Apply ((<@#@$) :: TyFun a6989586621679815165 (a6989586621679815165 ~> Bool) -> Type) (arg6989586621679815632 :: a6989586621679815165) | |
| type Apply (UnlessSym0 :: TyFun Bool (f6989586621681056589 () ~> f6989586621681056589 ()) -> Type) (a6989586621681062125 :: Bool) | |
Defined in Data.Singletons.Prelude.Monad type Apply (UnlessSym0 :: TyFun Bool (f6989586621681056589 () ~> f6989586621681056589 ()) -> Type) (a6989586621681062125 :: Bool) = (UnlessSym1 a6989586621681062125 f6989586621681056589 :: TyFun (f6989586621681056589 ()) (f6989586621681056589 ()) -> Type) | |
| type Apply (Elem_6989586621680883476Sym0 :: TyFun a6989586621680712273 (Identity a6989586621680712273 ~> Bool) -> Type) (a6989586621680883474 :: a6989586621680712273) | |
| type Apply (Let6989586621680312398Scrutinee_6989586621680303786Sym0 :: TyFun k1 (TyFun k Bool -> Type) -> Type) (n6989586621680312396 :: k1) | |
| type Apply (Bool_Sym1 a6989586621679780312 :: TyFun a6989586621679780269 (Bool ~> a6989586621679780269) -> Type) (a6989586621679780314 :: a6989586621679780269) | |
| type Apply (Elem_bySym1 a6989586621680312343 :: TyFun a6989586621680303085 ([a6989586621680303085] ~> Bool) -> Type) (a6989586621680312344 :: a6989586621680303085) | |
| type Apply (Elem_6989586621680713182Sym0 :: TyFun a6989586621680712273 (t6989586621680712256 a6989586621680712273 ~> Bool) -> Type) (a6989586621680713180 :: a6989586621680712273) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (Elem_6989586621680713182Sym0 :: TyFun a6989586621680712273 (t6989586621680712256 a6989586621680712273 ~> Bool) -> Type) (a6989586621680713180 :: a6989586621680712273) = (Elem_6989586621680713182Sym1 a6989586621680713180 t6989586621680712256 :: TyFun (t6989586621680712256 a6989586621680712273) Bool -> Type) | |
| type Apply (ElemSym0 :: TyFun a6989586621680712273 (t6989586621680712256 a6989586621680712273 ~> Bool) -> Type) (arg6989586621680712923 :: a6989586621680712273) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (NotElemSym0 :: TyFun a6989586621680712167 (t6989586621680712166 a6989586621680712167 ~> Bool) -> Type) (a6989586621680712649 :: a6989586621680712167) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (NotElemSym0 :: TyFun a6989586621680712167 (t6989586621680712166 a6989586621680712167 ~> Bool) -> Type) (a6989586621680712649 :: a6989586621680712167) = (NotElemSym1 a6989586621680712649 t6989586621680712166 :: TyFun (t6989586621680712166 a6989586621680712167) Bool -> Type) | |
| type Apply (Elem_6989586621680713302Sym0 :: TyFun a6989586621680712273 (t6989586621680712256 a6989586621680712273 ~> Bool) -> Type) (a6989586621680713300 :: a6989586621680712273) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (Elem_6989586621680713302Sym0 :: TyFun a6989586621680712273 (t6989586621680712256 a6989586621680712273 ~> Bool) -> Type) (a6989586621680713300 :: a6989586621680712273) = (Elem_6989586621680713302Sym1 a6989586621680713300 t6989586621680712256 :: TyFun (t6989586621680712256 a6989586621680712273) Bool -> Type) | |
| type Apply (Elem_6989586621680713639Sym0 :: TyFun a6989586621680712273 (t6989586621680712256 a6989586621680712273 ~> Bool) -> Type) (a6989586621680713637 :: a6989586621680712273) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (Elem_6989586621680713639Sym0 :: TyFun a6989586621680712273 (t6989586621680712256 a6989586621680712273 ~> Bool) -> Type) (a6989586621680713637 :: a6989586621680712273) = (Elem_6989586621680713639Sym1 a6989586621680713637 t6989586621680712256 :: TyFun (t6989586621680712256 a6989586621680712273) Bool -> Type) | |
| type Apply (Elem_6989586621680713806Sym0 :: TyFun a6989586621680712273 (t6989586621680712256 a6989586621680712273 ~> Bool) -> Type) (a6989586621680713804 :: a6989586621680712273) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (Elem_6989586621680713806Sym0 :: TyFun a6989586621680712273 (t6989586621680712256 a6989586621680712273 ~> Bool) -> Type) (a6989586621680713804 :: a6989586621680712273) = (Elem_6989586621680713806Sym1 a6989586621680713804 t6989586621680712256 :: TyFun (t6989586621680712256 a6989586621680712273) Bool -> Type) | |
| type Apply (Elem_6989586621680713973Sym0 :: TyFun a6989586621680712273 (t6989586621680712256 a6989586621680712273 ~> Bool) -> Type) (a6989586621680713971 :: a6989586621680712273) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (Elem_6989586621680713973Sym0 :: TyFun a6989586621680712273 (t6989586621680712256 a6989586621680712273 ~> Bool) -> Type) (a6989586621680713971 :: a6989586621680712273) = (Elem_6989586621680713973Sym1 a6989586621680713971 t6989586621680712256 :: TyFun (t6989586621680712256 a6989586621680712273) Bool -> Type) | |
| type Apply (Let6989586621680312385Scrutinee_6989586621680303788Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) (x6989586621680312382 :: k1) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (Let6989586621680312466Scrutinee_6989586621680303782Sym0 :: TyFun k1 (TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) (key6989586621680312462 :: k1) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680312466Scrutinee_6989586621680303782Sym0 :: TyFun k1 (TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) (key6989586621680312462 :: k1) = (Let6989586621680312466Scrutinee_6989586621680303782Sym1 key6989586621680312462 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) | |
| type Apply (Let6989586621680312481Scrutinee_6989586621680303772Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) (n6989586621680312478 :: k1) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (Let6989586621680312495Scrutinee_6989586621680303770Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) (n6989586621680312492 :: k1) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (Let6989586621680313077Scrutinee_6989586621680303790Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 (TyFun [k2] Bool -> Type) -> Type) -> Type) -> Type) (l6989586621680313067 :: k1) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680313077Scrutinee_6989586621680303790Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 (TyFun [k2] Bool -> Type) -> Type) -> Type) -> Type) (l6989586621680313067 :: k1) = (Let6989586621680313077Scrutinee_6989586621680303790Sym1 l6989586621680313067 :: TyFun k2 (TyFun k3 (TyFun [k2] Bool -> Type) -> Type) -> Type) | |
| type Apply (Lambda_6989586621680713132Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) (a_69895866216807131276989586621680713131 :: k1) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (Lambda_6989586621681062478Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 (TyFun Bool (TyFun [k2] [k2] -> Type) -> Type) -> Type) -> Type) -> Type) (p6989586621681062465 :: k1) | |
Defined in Data.Singletons.Prelude.Monad type Apply (Lambda_6989586621681062478Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 (TyFun Bool (TyFun [k2] [k2] -> Type) -> Type) -> Type) -> Type) -> Type) (p6989586621681062465 :: k1) = (Lambda_6989586621681062478Sym1 p6989586621681062465 :: TyFun k2 (TyFun k3 (TyFun Bool (TyFun [k2] [k2] -> Type) -> Type) -> Type) -> Type) | |
| type Apply (Let6989586621680313696Scrutinee_6989586621680303764Sym1 p6989586621680313690 :: TyFun k1 (TyFun [a6989586621680303205] (TyFun k Bool -> Type) -> Type) -> Type) (x6989586621680313694 :: k1) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680313696Scrutinee_6989586621680303764Sym1 p6989586621680313690 :: TyFun k1 (TyFun [a6989586621680303205] (TyFun k Bool -> Type) -> Type) -> Type) (x6989586621680313694 :: k1) = (Let6989586621680313696Scrutinee_6989586621680303764Sym2 p6989586621680313690 x6989586621680313694 :: TyFun [a6989586621680303205] (TyFun k Bool -> Type) -> Type) | |
| type Apply (Let6989586621680312385Scrutinee_6989586621680303788Sym1 x6989586621680312382 :: TyFun k1 (TyFun k3 Bool -> Type) -> Type) (xs6989586621680312383 :: k1) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (Let6989586621680312466Scrutinee_6989586621680303782Sym1 key6989586621680312462 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) (x6989586621680312463 :: k1) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680312466Scrutinee_6989586621680303782Sym1 key6989586621680312462 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) (x6989586621680312463 :: k1) = (Let6989586621680312466Scrutinee_6989586621680303782Sym2 key6989586621680312462 x6989586621680312463 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type) | |
| type Apply (Let6989586621680312481Scrutinee_6989586621680303772Sym1 n6989586621680312478 :: TyFun k1 (TyFun k3 Bool -> Type) -> Type) (x6989586621680312479 :: k1) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (Let6989586621680312495Scrutinee_6989586621680303770Sym1 n6989586621680312492 :: TyFun k1 (TyFun k3 Bool -> Type) -> Type) (x6989586621680312493 :: k1) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (Let6989586621680312369Scrutinee_6989586621680303792Sym1 eq6989586621680312357 :: TyFun k1 (TyFun k2 (TyFun k3 (TyFun [k2] Bool -> Type) -> Type) -> Type) -> Type) (l6989586621680312358 :: k1) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680312369Scrutinee_6989586621680303792Sym1 eq6989586621680312357 :: TyFun k1 (TyFun k2 (TyFun k3 (TyFun [k2] Bool -> Type) -> Type) -> Type) -> Type) (l6989586621680312358 :: k1) = (Let6989586621680312369Scrutinee_6989586621680303792Sym2 eq6989586621680312357 l6989586621680312358 :: TyFun k2 (TyFun k3 (TyFun [k2] Bool -> Type) -> Type) -> Type) | |
| type Apply (Let6989586621680313077Scrutinee_6989586621680303790Sym1 l6989586621680313067 :: TyFun k1 (TyFun k3 (TyFun [k1] Bool -> Type) -> Type) -> Type) (x6989586621680313074 :: k1) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680313077Scrutinee_6989586621680303790Sym1 l6989586621680313067 :: TyFun k1 (TyFun k3 (TyFun [k1] Bool -> Type) -> Type) -> Type) (x6989586621680313074 :: k1) = (Let6989586621680313077Scrutinee_6989586621680303790Sym2 l6989586621680313067 x6989586621680313074 :: TyFun k3 (TyFun [k1] Bool -> Type) -> Type) | |
| type Apply (Lambda_6989586621680713132Sym1 a_69895866216807131276989586621680713131 :: TyFun k1 (TyFun k3 Bool -> Type) -> Type) (t6989586621680713139 :: k1) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (Let6989586621680034951Scrutinee_6989586621680033323Sym0 :: TyFun k1 (TyFun k2 (TyFun k2 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) -> Type) -> Type) (x06989586621680034934 :: k1) | |
Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680034951Scrutinee_6989586621680033323Sym0 :: TyFun k1 (TyFun k2 (TyFun k2 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) -> Type) -> Type) (x06989586621680034934 :: k1) = (Let6989586621680034951Scrutinee_6989586621680033323Sym1 x06989586621680034934 :: TyFun k2 (TyFun k2 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) -> Type) | |
| type Apply (Lambda_6989586621681062478Sym1 p6989586621681062465 :: TyFun k1 (TyFun k3 (TyFun Bool (TyFun [k1] [k1] -> Type) -> Type) -> Type) -> Type) (x6989586621681062477 :: k1) | |
Defined in Data.Singletons.Prelude.Monad type Apply (Lambda_6989586621681062478Sym1 p6989586621681062465 :: TyFun k1 (TyFun k3 (TyFun Bool (TyFun [k1] [k1] -> Type) -> Type) -> Type) -> Type) (x6989586621681062477 :: k1) = (Lambda_6989586621681062478Sym2 p6989586621681062465 x6989586621681062477 :: TyFun k3 (TyFun Bool (TyFun [k1] [k1] -> Type) -> Type) -> Type) | |
| type Apply (Lambda_6989586621681062478Sym2 x6989586621681062477 p6989586621681062465 :: TyFun k3 (TyFun Bool (TyFun [k1] [k1] -> Type) -> Type) -> Type) (a_69895866216810624606989586621681062469 :: k3) | |
Defined in Data.Singletons.Prelude.Monad type Apply (Lambda_6989586621681062478Sym2 x6989586621681062477 p6989586621681062465 :: TyFun k3 (TyFun Bool (TyFun [k1] [k1] -> Type) -> Type) -> Type) (a_69895866216810624606989586621681062469 :: k3) = Lambda_6989586621681062478Sym3 x6989586621681062477 p6989586621681062465 a_69895866216810624606989586621681062469 | |
| type Apply (Let6989586621680313077Scrutinee_6989586621680303790Sym2 x6989586621680313074 l6989586621680313067 :: TyFun k3 (TyFun [k1] Bool -> Type) -> Type) (xs6989586621680313075 :: k3) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680313077Scrutinee_6989586621680303790Sym2 x6989586621680313074 l6989586621680313067 :: TyFun k3 (TyFun [k1] Bool -> Type) -> Type) (xs6989586621680313075 :: k3) = Let6989586621680313077Scrutinee_6989586621680303790Sym3 x6989586621680313074 l6989586621680313067 xs6989586621680313075 | |
| type Apply (Let6989586621680312466Scrutinee_6989586621680303782Sym2 x6989586621680312463 key6989586621680312462 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type) (y6989586621680312464 :: k2) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680312466Scrutinee_6989586621680303782Sym2 x6989586621680312463 key6989586621680312462 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type) (y6989586621680312464 :: k2) = (Let6989586621680312466Scrutinee_6989586621680303782Sym3 x6989586621680312463 key6989586621680312462 y6989586621680312464 :: TyFun k3 Bool -> Type) | |
| type Apply (Let6989586621680312369Scrutinee_6989586621680303792Sym2 l6989586621680312358 eq6989586621680312357 :: TyFun k2 (TyFun k3 (TyFun [k2] Bool -> Type) -> Type) -> Type) (y6989586621680312366 :: k2) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680312369Scrutinee_6989586621680303792Sym2 l6989586621680312358 eq6989586621680312357 :: TyFun k2 (TyFun k3 (TyFun [k2] Bool -> Type) -> Type) -> Type) (y6989586621680312366 :: k2) = (Let6989586621680312369Scrutinee_6989586621680303792Sym3 l6989586621680312358 eq6989586621680312357 y6989586621680312366 :: TyFun k3 (TyFun [k2] Bool -> Type) -> Type) | |
| type Apply (Let6989586621680034540Scrutinee_6989586621680033372Sym0 :: TyFun k1 (TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) (x16989586621680034535 :: k1) | |
Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680034540Scrutinee_6989586621680033372Sym0 :: TyFun k1 (TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) (x16989586621680034535 :: k1) = (Let6989586621680034540Scrutinee_6989586621680033372Sym1 x16989586621680034535 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) | |
| type Apply (Let6989586621680034780Scrutinee_6989586621680033356Sym0 :: TyFun k1 (TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) (x16989586621680034753 :: k1) | |
Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680034780Scrutinee_6989586621680033356Sym0 :: TyFun k1 (TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) (x16989586621680034753 :: k1) = (Let6989586621680034780Scrutinee_6989586621680033356Sym1 x16989586621680034753 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) | |
| type Apply (Let6989586621680034951Scrutinee_6989586621680033323Sym1 x06989586621680034934 :: TyFun k1 (TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) -> Type) (y6989586621680034936 :: k1) | |
Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680034951Scrutinee_6989586621680033323Sym1 x06989586621680034934 :: TyFun k1 (TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) -> Type) (y6989586621680034936 :: k1) = (Let6989586621680034951Scrutinee_6989586621680033323Sym2 x06989586621680034934 y6989586621680034936 :: TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) | |
| type Apply (Let6989586621680312369Scrutinee_6989586621680303792Sym3 y6989586621680312366 l6989586621680312358 eq6989586621680312357 :: TyFun k3 (TyFun [k2] Bool -> Type) -> Type) (ys6989586621680312367 :: k3) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680312369Scrutinee_6989586621680303792Sym3 y6989586621680312366 l6989586621680312358 eq6989586621680312357 :: TyFun k3 (TyFun [k2] Bool -> Type) -> Type) (ys6989586621680312367 :: k3) = Let6989586621680312369Scrutinee_6989586621680303792Sym4 y6989586621680312366 l6989586621680312358 eq6989586621680312357 ys6989586621680312367 | |
| type Apply (Lambda_6989586621681062478Sym3 a_69895866216810624606989586621681062469 x6989586621681062477 p6989586621681062465 :: TyFun Bool (TyFun [k1] [k1] -> Type) -> Type) (t6989586621681062497 :: Bool) | |
Defined in Data.Singletons.Prelude.Monad type Apply (Lambda_6989586621681062478Sym3 a_69895866216810624606989586621681062469 x6989586621681062477 p6989586621681062465 :: TyFun Bool (TyFun [k1] [k1] -> Type) -> Type) (t6989586621681062497 :: Bool) = Lambda_6989586621681062478 a_69895866216810624606989586621681062469 x6989586621681062477 p6989586621681062465 t6989586621681062497 | |
| type Apply (Let6989586621680034540Scrutinee_6989586621680033372Sym1 x16989586621680034535 :: TyFun k1 (TyFun k2 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) (x26989586621680034536 :: k1) | |
Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680034540Scrutinee_6989586621680033372Sym1 x16989586621680034535 :: TyFun k1 (TyFun k2 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) (x26989586621680034536 :: k1) = (Let6989586621680034540Scrutinee_6989586621680033372Sym2 x16989586621680034535 x26989586621680034536 :: TyFun k2 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) | |
| type Apply (Let6989586621680034780Scrutinee_6989586621680033356Sym1 x16989586621680034753 :: TyFun k1 (TyFun k2 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) (x26989586621680034756 :: k1) | |
Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680034780Scrutinee_6989586621680033356Sym1 x16989586621680034753 :: TyFun k1 (TyFun k2 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) (x26989586621680034756 :: k1) = (Let6989586621680034780Scrutinee_6989586621680033356Sym2 x16989586621680034753 x26989586621680034756 :: TyFun k2 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) | |
| type Apply (Let6989586621680034951Scrutinee_6989586621680033323Sym2 y6989586621680034936 x06989586621680034934 :: TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) (x6989586621680034949 :: k1) | |
Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680034951Scrutinee_6989586621680033323Sym2 y6989586621680034936 x06989586621680034934 :: TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) (x6989586621680034949 :: k1) = (Let6989586621680034951Scrutinee_6989586621680033323Sym3 y6989586621680034936 x06989586621680034934 x6989586621680034949 :: TyFun k3 (TyFun k4 Bool -> Type) -> Type) | |
| type Apply (Let6989586621680034540Scrutinee_6989586621680033372Sym2 x26989586621680034536 x16989586621680034535 :: TyFun k2 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) (y6989586621680034537 :: k2) | |
Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680034540Scrutinee_6989586621680033372Sym2 x26989586621680034536 x16989586621680034535 :: TyFun k2 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) (y6989586621680034537 :: k2) = (Let6989586621680034540Scrutinee_6989586621680033372Sym3 x26989586621680034536 x16989586621680034535 y6989586621680034537 :: TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) | |
| type Apply (Let6989586621680034780Scrutinee_6989586621680033356Sym2 x26989586621680034756 x16989586621680034753 :: TyFun k2 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) (y6989586621680034759 :: k2) | |
Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680034780Scrutinee_6989586621680033356Sym2 x26989586621680034756 x16989586621680034753 :: TyFun k2 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) (y6989586621680034759 :: k2) = (Let6989586621680034780Scrutinee_6989586621680033356Sym3 x26989586621680034756 x16989586621680034753 y6989586621680034759 :: TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) | |
| type Apply (Let6989586621680034951Scrutinee_6989586621680033323Sym3 x6989586621680034949 y6989586621680034936 x06989586621680034934 :: TyFun k3 (TyFun k4 Bool -> Type) -> Type) (arg_69895866216800333166989586621680034927 :: k3) | |
Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680034951Scrutinee_6989586621680033323Sym3 x6989586621680034949 y6989586621680034936 x06989586621680034934 :: TyFun k3 (TyFun k4 Bool -> Type) -> Type) (arg_69895866216800333166989586621680034927 :: k3) = (Let6989586621680034951Scrutinee_6989586621680033323Sym4 x6989586621680034949 y6989586621680034936 x06989586621680034934 arg_69895866216800333166989586621680034927 :: TyFun k4 Bool -> Type) | |
| type Apply (Let6989586621680034540Scrutinee_6989586621680033372Sym3 y6989586621680034537 x26989586621680034536 x16989586621680034535 :: TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) (arg_69895866216800333666989586621680034527 :: k3) | |
Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680034540Scrutinee_6989586621680033372Sym3 y6989586621680034537 x26989586621680034536 x16989586621680034535 :: TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) (arg_69895866216800333666989586621680034527 :: k3) = (Let6989586621680034540Scrutinee_6989586621680033372Sym4 y6989586621680034537 x26989586621680034536 x16989586621680034535 arg_69895866216800333666989586621680034527 :: TyFun k4 (TyFun k5 Bool -> Type) -> Type) | |
| type Apply (Let6989586621680034780Scrutinee_6989586621680033356Sym3 y6989586621680034759 x26989586621680034756 x16989586621680034753 :: TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) (arg_69895866216800333506989586621680034729 :: k3) | |
Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680034780Scrutinee_6989586621680033356Sym3 y6989586621680034759 x26989586621680034756 x16989586621680034753 :: TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) (arg_69895866216800333506989586621680034729 :: k3) = (Let6989586621680034780Scrutinee_6989586621680033356Sym4 y6989586621680034759 x26989586621680034756 x16989586621680034753 arg_69895866216800333506989586621680034729 :: TyFun k4 (TyFun k5 Bool -> Type) -> Type) | |
| type Apply (Let6989586621680034540Scrutinee_6989586621680033372Sym4 arg_69895866216800333666989586621680034527 y6989586621680034537 x26989586621680034536 x16989586621680034535 :: TyFun k4 (TyFun k5 Bool -> Type) -> Type) (arg_69895866216800333686989586621680034528 :: k4) | |
Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680034540Scrutinee_6989586621680033372Sym4 arg_69895866216800333666989586621680034527 y6989586621680034537 x26989586621680034536 x16989586621680034535 :: TyFun k4 (TyFun k5 Bool -> Type) -> Type) (arg_69895866216800333686989586621680034528 :: k4) = (Let6989586621680034540Scrutinee_6989586621680033372Sym5 arg_69895866216800333666989586621680034527 y6989586621680034537 x26989586621680034536 x16989586621680034535 arg_69895866216800333686989586621680034528 :: TyFun k5 Bool -> Type) | |
| type Apply (Let6989586621680034780Scrutinee_6989586621680033356Sym4 arg_69895866216800333506989586621680034729 y6989586621680034759 x26989586621680034756 x16989586621680034753 :: TyFun k4 (TyFun k5 Bool -> Type) -> Type) (arg_69895866216800333526989586621680034733 :: k4) | |
Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680034780Scrutinee_6989586621680033356Sym4 arg_69895866216800333506989586621680034729 y6989586621680034759 x26989586621680034756 x16989586621680034753 :: TyFun k4 (TyFun k5 Bool -> Type) -> Type) (arg_69895866216800333526989586621680034733 :: k4) = (Let6989586621680034780Scrutinee_6989586621680033356Sym5 arg_69895866216800333506989586621680034729 y6989586621680034759 x26989586621680034756 x16989586621680034753 arg_69895866216800333526989586621680034733 :: TyFun k5 Bool -> Type) | |
| type Apply (ListisPrefixOfSym0 :: TyFun [a6989586621680565301] ([a6989586621680565301] ~> Bool) -> Type) (a6989586621680568488 :: [a6989586621680565301]) | |
| type Apply (IsPrefixOfSym0 :: TyFun [a6989586621680303171] ([a6989586621680303171] ~> Bool) -> Type) (a6989586621680313085 :: [a6989586621680303171]) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (IsPrefixOfSym0 :: TyFun [a6989586621680303171] ([a6989586621680303171] ~> Bool) -> Type) (a6989586621680313085 :: [a6989586621680303171]) = IsPrefixOfSym1 a6989586621680313085 | |
| type Apply (IsInfixOfSym0 :: TyFun [a6989586621680303169] ([a6989586621680303169] ~> Bool) -> Type) (a6989586621680313323 :: [a6989586621680303169]) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (IsInfixOfSym0 :: TyFun [a6989586621680303169] ([a6989586621680303169] ~> Bool) -> Type) (a6989586621680313323 :: [a6989586621680303169]) = IsInfixOfSym1 a6989586621680313323 | |
| type Apply (IsSuffixOfSym0 :: TyFun [a6989586621680303170] ([a6989586621680303170] ~> Bool) -> Type) (a6989586621680313676 :: [a6989586621680303170]) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (IsSuffixOfSym0 :: TyFun [a6989586621680303170] ([a6989586621680303170] ~> Bool) -> Type) (a6989586621680313676 :: [a6989586621680303170]) = IsSuffixOfSym1 a6989586621680313676 | |
| type Apply (Let6989586621680313696Scrutinee_6989586621680303764Sym2 x6989586621680313694 p6989586621680313690 :: TyFun [a6989586621680303205] (TyFun k Bool -> Type) -> Type) (xs6989586621680313695 :: [a6989586621680303205]) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680313696Scrutinee_6989586621680303764Sym2 x6989586621680313694 p6989586621680313690 :: TyFun [a6989586621680303205] (TyFun k Bool -> Type) -> Type) (xs6989586621680313695 :: [a6989586621680303205]) = (Let6989586621680313696Scrutinee_6989586621680303764Sym3 x6989586621680313694 p6989586621680313690 xs6989586621680313695 :: TyFun k Bool -> Type) | |
| type Apply (Let6989586621680312526ZsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) (p6989586621680312513 :: k ~> Bool) | |
| type Apply (Let6989586621680312526YsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) (p6989586621680312513 :: k ~> Bool) | |
| type Apply (Let6989586621680312526X_6989586621680312527Sym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] ([k], [k]) -> Type) -> Type) -> Type) (p6989586621680312513 :: k ~> Bool) | |
| type Apply (Let6989586621680312569ZsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) (p6989586621680312556 :: k ~> Bool) | |
| type Apply (Let6989586621680312569YsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) (p6989586621680312556 :: k ~> Bool) | |
| type Apply (Let6989586621680312569X_6989586621680312570Sym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] ([k], [k]) -> Type) -> Type) -> Type) (p6989586621680312556 :: k ~> Bool) | |
| type Apply (ListnubBySym0 :: TyFun (a6989586621680565295 ~> (a6989586621680565295 ~> Bool)) ([a6989586621680565295] ~> [a6989586621680565295]) -> Type) (a6989586621680568453 :: a6989586621680565295 ~> (a6989586621680565295 ~> Bool)) | |
| type Apply (ListpartitionSym0 :: TyFun (a6989586621680565303 ~> Bool) ([a6989586621680565303] ~> ([a6989586621680565303], [a6989586621680565303])) -> Type) (a6989586621680568508 :: a6989586621680565303 ~> Bool) | |
| type Apply (ListfilterSym0 :: TyFun (a6989586621680565304 ~> Bool) ([a6989586621680565304] ~> [a6989586621680565304]) -> Type) (a6989586621680568518 :: a6989586621680565304 ~> Bool) | |
| type Apply (ListspanSym0 :: TyFun (a6989586621680565305 ~> Bool) ([a6989586621680565305] ~> ([a6989586621680565305], [a6989586621680565305])) -> Type) (a6989586621680568528 :: a6989586621680565305 ~> Bool) | |
| type Apply (ListdropWhileSym0 :: TyFun (a6989586621680565306 ~> Bool) ([a6989586621680565306] ~> [a6989586621680565306]) -> Type) (a6989586621680568538 :: a6989586621680565306 ~> Bool) | |
| type Apply (ListtakeWhileSym0 :: TyFun (a6989586621680565307 ~> Bool) ([a6989586621680565307] ~> [a6989586621680565307]) -> Type) (a6989586621680568548 :: a6989586621680565307 ~> Bool) | |
| type Apply (NubBySym0 :: TyFun (a6989586621680303086 ~> (a6989586621680303086 ~> Bool)) ([a6989586621680303086] ~> [a6989586621680303086]) -> Type) (a6989586621680312353 :: a6989586621680303086 ~> (a6989586621680303086 ~> Bool)) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (PartitionSym0 :: TyFun (a6989586621680303095 ~> Bool) ([a6989586621680303095] ~> ([a6989586621680303095], [a6989586621680303095])) -> Type) (a6989586621680312451 :: a6989586621680303095 ~> Bool) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (PartitionSym0 :: TyFun (a6989586621680303095 ~> Bool) ([a6989586621680303095] ~> ([a6989586621680303095], [a6989586621680303095])) -> Type) (a6989586621680312451 :: a6989586621680303095 ~> Bool) = PartitionSym1 a6989586621680312451 | |
| type Apply (BreakSym0 :: TyFun (a6989586621680303107 ~> Bool) ([a6989586621680303107] ~> ([a6989586621680303107], [a6989586621680303107])) -> Type) (a6989586621680312508 :: a6989586621680303107 ~> Bool) | |
| type Apply (SpanSym0 :: TyFun (a6989586621680303108 ~> Bool) ([a6989586621680303108] ~> ([a6989586621680303108], [a6989586621680303108])) -> Type) (a6989586621680312551 :: a6989586621680303108 ~> Bool) | |
| type Apply (GroupBySym0 :: TyFun (a6989586621680303098 ~> (a6989586621680303098 ~> Bool)) ([a6989586621680303098] ~> [[a6989586621680303098]]) -> Type) (a6989586621680312594 :: a6989586621680303098 ~> (a6989586621680303098 ~> Bool)) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (DropWhileSym0 :: TyFun (a6989586621680303110 ~> Bool) ([a6989586621680303110] ~> [a6989586621680303110]) -> Type) (a6989586621680312628 :: a6989586621680303110 ~> Bool) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (DropWhileSym0 :: TyFun (a6989586621680303110 ~> Bool) ([a6989586621680303110] ~> [a6989586621680303110]) -> Type) (a6989586621680312628 :: a6989586621680303110 ~> Bool) = DropWhileSym1 a6989586621680312628 | |
| type Apply (TakeWhileSym0 :: TyFun (a6989586621680303111 ~> Bool) ([a6989586621680303111] ~> [a6989586621680303111]) -> Type) (a6989586621680312646 :: a6989586621680303111 ~> Bool) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (TakeWhileSym0 :: TyFun (a6989586621680303111 ~> Bool) ([a6989586621680303111] ~> [a6989586621680303111]) -> Type) (a6989586621680312646 :: a6989586621680303111 ~> Bool) = TakeWhileSym1 a6989586621680312646 | |
| type Apply (FilterSym0 :: TyFun (a6989586621680303119 ~> Bool) ([a6989586621680303119] ~> [a6989586621680303119]) -> Type) (a6989586621680312660 :: a6989586621680303119 ~> Bool) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (FilterSym0 :: TyFun (a6989586621680303119 ~> Bool) ([a6989586621680303119] ~> [a6989586621680303119]) -> Type) (a6989586621680312660 :: a6989586621680303119 ~> Bool) = FilterSym1 a6989586621680312660 | |
| type Apply (FindSym0 :: TyFun (a6989586621680303118 ~> Bool) ([a6989586621680303118] ~> Maybe a6989586621680303118) -> Type) (a6989586621680312675 :: a6989586621680303118 ~> Bool) | |
| type Apply (DeleteFirstsBySym0 :: TyFun (a6989586621680303124 ~> (a6989586621680303124 ~> Bool)) ([a6989586621680303124] ~> ([a6989586621680303124] ~> [a6989586621680303124])) -> Type) (a6989586621680312744 :: a6989586621680303124 ~> (a6989586621680303124 ~> Bool)) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (DeleteFirstsBySym0 :: TyFun (a6989586621680303124 ~> (a6989586621680303124 ~> Bool)) ([a6989586621680303124] ~> ([a6989586621680303124] ~> [a6989586621680303124])) -> Type) (a6989586621680312744 :: a6989586621680303124 ~> (a6989586621680303124 ~> Bool)) = DeleteFirstsBySym1 a6989586621680312744 | |
| type Apply (UnionBySym0 :: TyFun (a6989586621680303084 ~> (a6989586621680303084 ~> Bool)) ([a6989586621680303084] ~> ([a6989586621680303084] ~> [a6989586621680303084])) -> Type) (a6989586621680312757 :: a6989586621680303084 ~> (a6989586621680303084 ~> Bool)) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (FindIndicesSym0 :: TyFun (a6989586621680303114 ~> Bool) ([a6989586621680303114] ~> [Nat]) -> Type) (a6989586621680313001 :: a6989586621680303114 ~> Bool) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (FindIndexSym0 :: TyFun (a6989586621680303115 ~> Bool) ([a6989586621680303115] ~> Maybe Nat) -> Type) (a6989586621680313035 :: a6989586621680303115 ~> Bool) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (AnySym0 :: TyFun (a6989586621680303188 ~> Bool) ([a6989586621680303188] ~> Bool) -> Type) (a6989586621680313316 :: a6989586621680303188 ~> Bool) | |
| type Apply (IntersectBySym0 :: TyFun (a6989586621680303112 ~> (a6989586621680303112 ~> Bool)) ([a6989586621680303112] ~> ([a6989586621680303112] ~> [a6989586621680303112])) -> Type) (a6989586621680313329 :: a6989586621680303112 ~> (a6989586621680303112 ~> Bool)) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (IntersectBySym0 :: TyFun (a6989586621680303112 ~> (a6989586621680303112 ~> Bool)) ([a6989586621680303112] ~> ([a6989586621680303112] ~> [a6989586621680303112])) -> Type) (a6989586621680313329 :: a6989586621680303112 ~> (a6989586621680303112 ~> Bool)) = IntersectBySym1 a6989586621680313329 | |
| type Apply (AllSym0 :: TyFun (a6989586621680303189 ~> Bool) ([a6989586621680303189] ~> Bool) -> Type) (a6989586621680313371 :: a6989586621680303189 ~> Bool) | |
| type Apply (DropWhileEndSym0 :: TyFun (a6989586621680303109 ~> Bool) ([a6989586621680303109] ~> [a6989586621680303109]) -> Type) (a6989586621680313684 :: a6989586621680303109 ~> Bool) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (DropWhileEndSym0 :: TyFun (a6989586621680303109 ~> Bool) ([a6989586621680303109] ~> [a6989586621680303109]) -> Type) (a6989586621680313684 :: a6989586621680303109 ~> Bool) = DropWhileEndSym1 a6989586621680313684 | |
| type Apply (Elem_bySym0 :: TyFun (a6989586621680303085 ~> (a6989586621680303085 ~> Bool)) (a6989586621680303085 ~> ([a6989586621680303085] ~> Bool)) -> Type) (a6989586621680312343 :: a6989586621680303085 ~> (a6989586621680303085 ~> Bool)) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (SelectSym0 :: TyFun (a6989586621680303094 ~> Bool) (a6989586621680303094 ~> (([a6989586621680303094], [a6989586621680303094]) ~> ([a6989586621680303094], [a6989586621680303094]))) -> Type) (a6989586621680312433 :: a6989586621680303094 ~> Bool) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (DeleteBySym0 :: TyFun (a6989586621680303125 ~> (a6989586621680303125 ~> Bool)) (a6989586621680303125 ~> ([a6989586621680303125] ~> [a6989586621680303125])) -> Type) (a6989586621680312726 :: a6989586621680303125 ~> (a6989586621680303125 ~> Bool)) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (UntilSym0 :: TyFun (a6989586621679791163 ~> Bool) ((a6989586621679791163 ~> a6989586621679791163) ~> (a6989586621679791163 ~> a6989586621679791163)) -> Type) (a6989586621679791790 :: a6989586621679791163 ~> Bool) | |
| type Apply (Let6989586621680312359NubBy'Sym0 :: TyFun (k1 ~> (k1 ~> Bool)) (TyFun k (TyFun [k1] ([k1] ~> [k1]) -> Type) -> Type) -> Type) (eq6989586621680312357 :: k1 ~> (k1 ~> Bool)) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (Let6989586621680312601ZsSym0 :: TyFun (k1 ~> (a6989586621680303108 ~> Bool)) (TyFun k1 (TyFun [a6989586621680303108] [a6989586621680303108] -> Type) -> Type) -> Type) (eq6989586621680312598 :: k1 ~> (a6989586621680303108 ~> Bool)) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (Let6989586621680312601YsSym0 :: TyFun (k1 ~> (a6989586621680303108 ~> Bool)) (TyFun k1 (TyFun [a6989586621680303108] [a6989586621680303108] -> Type) -> Type) -> Type) (eq6989586621680312598 :: k1 ~> (a6989586621680303108 ~> Bool)) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (Let6989586621680312601X_6989586621680312602Sym0 :: TyFun (k1 ~> (a6989586621680303108 ~> Bool)) (TyFun k1 (TyFun [a6989586621680303108] ([a6989586621680303108], [a6989586621680303108]) -> Type) -> Type) -> Type) (eq6989586621680312598 :: k1 ~> (a6989586621680303108 ~> Bool)) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680312601X_6989586621680312602Sym0 :: TyFun (k1 ~> (a6989586621680303108 ~> Bool)) (TyFun k1 (TyFun [a6989586621680303108] ([a6989586621680303108], [a6989586621680303108]) -> Type) -> Type) -> Type) (eq6989586621680312598 :: k1 ~> (a6989586621680303108 ~> Bool)) = Let6989586621680312601X_6989586621680312602Sym1 eq6989586621680312598 | |
| type Apply (Lambda_6989586621680313692Sym0 :: TyFun (a6989586621680303205 ~> Bool) (TyFun k (TyFun a6989586621680303205 (TyFun [a6989586621680303205] [a6989586621680303205] -> Type) -> Type) -> Type) -> Type) (p6989586621680313690 :: a6989586621680303205 ~> Bool) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Lambda_6989586621680313692Sym0 :: TyFun (a6989586621680303205 ~> Bool) (TyFun k (TyFun a6989586621680303205 (TyFun [a6989586621680303205] [a6989586621680303205] -> Type) -> Type) -> Type) -> Type) (p6989586621680313690 :: a6989586621680303205 ~> Bool) = (Lambda_6989586621680313692Sym1 p6989586621680313690 :: TyFun k (TyFun a6989586621680303205 (TyFun [a6989586621680303205] [a6989586621680303205] -> Type) -> Type) -> Type) | |
| type Apply (Lambda_6989586621680712629Sym0 :: TyFun (a6989586621679076674 ~> Bool) (TyFun k (TyFun a6989586621679076674 (First a6989586621679076674) -> Type) -> Type) -> Type) (p6989586621680712626 :: a6989586621679076674 ~> Bool) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (Lambda_6989586621680712629Sym0 :: TyFun (a6989586621679076674 ~> Bool) (TyFun k (TyFun a6989586621679076674 (First a6989586621679076674) -> Type) -> Type) -> Type) (p6989586621680712626 :: a6989586621679076674 ~> Bool) = (Lambda_6989586621680712629Sym1 p6989586621680712626 :: TyFun k (TyFun a6989586621679076674 (First a6989586621679076674) -> Type) -> Type) | |
| type Apply (Let6989586621680712726Scrutinee_6989586621680712507Sym0 :: TyFun (a6989586621680712259 ~> Bool) (TyFun (t6989586621680712256 a6989586621680712259) Any -> Type) -> Type) (p6989586621680712724 :: a6989586621680712259 ~> Bool) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680712726Scrutinee_6989586621680712507Sym0 :: TyFun (a6989586621680712259 ~> Bool) (TyFun (t6989586621680712256 a6989586621680712259) Any -> Type) -> Type) (p6989586621680712724 :: a6989586621680712259 ~> Bool) = (Let6989586621680712726Scrutinee_6989586621680712507Sym1 p6989586621680712724 :: TyFun (t6989586621680712256 a6989586621680712259) Any -> Type) | |
| type Apply (Let6989586621680712713Scrutinee_6989586621680712509Sym0 :: TyFun (a6989586621680712259 ~> Bool) (TyFun (t6989586621680712256 a6989586621680712259) All -> Type) -> Type) (p6989586621680712711 :: a6989586621680712259 ~> Bool) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680712713Scrutinee_6989586621680712509Sym0 :: TyFun (a6989586621680712259 ~> Bool) (TyFun (t6989586621680712256 a6989586621680712259) All -> Type) -> Type) (p6989586621680712711 :: a6989586621680712259 ~> Bool) = (Let6989586621680712713Scrutinee_6989586621680712509Sym1 p6989586621680712711 :: TyFun (t6989586621680712256 a6989586621680712259) All -> Type) | |
| type Apply (Let6989586621680712628Scrutinee_6989586621680712515Sym0 :: TyFun (a6989586621680712259 ~> Bool) (TyFun (t6989586621680712256 a6989586621680712259) (First a6989586621680712259) -> Type) -> Type) (p6989586621680712626 :: a6989586621680712259 ~> Bool) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680712628Scrutinee_6989586621680712515Sym0 :: TyFun (a6989586621680712259 ~> Bool) (TyFun (t6989586621680712256 a6989586621680712259) (First a6989586621680712259) -> Type) -> Type) (p6989586621680712626 :: a6989586621680712259 ~> Bool) = (Let6989586621680712628Scrutinee_6989586621680712515Sym1 p6989586621680712626 :: TyFun (t6989586621680712256 a6989586621680712259) (First a6989586621680712259) -> Type) | |
| type Apply (Let6989586621679791803GoSym0 :: TyFun (k1 ~> Bool) (TyFun (k1 ~> k1) (TyFun k2 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type) (p6989586621679791800 :: k1 ~> Bool) | |
Defined in Data.Singletons.Prelude.Base | |
| type Apply (FilterMSym0 :: TyFun (a6989586621681056624 ~> m6989586621681056623 Bool) ([a6989586621681056624] ~> m6989586621681056623 [a6989586621681056624]) -> Type) (a6989586621681062452 :: a6989586621681056624 ~> m6989586621681056623 Bool) | |
Defined in Data.Singletons.Prelude.Monad type Apply (FilterMSym0 :: TyFun (a6989586621681056624 ~> m6989586621681056623 Bool) ([a6989586621681056624] ~> m6989586621681056623 [a6989586621681056624]) -> Type) (a6989586621681062452 :: a6989586621681056624 ~> m6989586621681056623 Bool) = FilterMSym1 a6989586621681062452 | |
| type Apply (AnySym0 :: TyFun (a6989586621680712175 ~> Bool) (t6989586621680712174 a6989586621680712175 ~> Bool) -> Type) (a6989586621680712720 :: a6989586621680712175 ~> Bool) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (AllSym0 :: TyFun (a6989586621680712173 ~> Bool) (t6989586621680712172 a6989586621680712173 ~> Bool) -> Type) (a6989586621680712707 :: a6989586621680712173 ~> Bool) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (FindSym0 :: TyFun (a6989586621680712165 ~> Bool) (t6989586621680712164 a6989586621680712165 ~> Maybe a6989586621680712165) -> Type) (a6989586621680712622 :: a6989586621680712165 ~> Bool) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (FindSym0 :: TyFun (a6989586621680712165 ~> Bool) (t6989586621680712164 a6989586621680712165 ~> Maybe a6989586621680712165) -> Type) (a6989586621680712622 :: a6989586621680712165 ~> Bool) = (FindSym1 a6989586621680712622 t6989586621680712164 :: TyFun (t6989586621680712164 a6989586621680712165) (Maybe a6989586621680712165) -> Type) | |
| type Apply (MfilterSym0 :: TyFun (a6989586621681056585 ~> Bool) (m6989586621681056583 a6989586621681056585 ~> m6989586621681056583 a6989586621681056585) -> Type) (a6989586621681062022 :: a6989586621681056585 ~> Bool) | |
Defined in Data.Singletons.Prelude.Monad type Apply (MfilterSym0 :: TyFun (a6989586621681056585 ~> Bool) (m6989586621681056583 a6989586621681056585 ~> m6989586621681056583 a6989586621681056585) -> Type) (a6989586621681062022 :: a6989586621681056585 ~> Bool) = (MfilterSym1 a6989586621681062022 m6989586621681056583 :: TyFun (m6989586621681056583 a6989586621681056585) (m6989586621681056583 a6989586621681056585) -> Type) | |
| type Apply (TFHelper_6989586621681105244Sym0 :: TyFun (Arg a6989586621681093754 b6989586621681093755) (Arg a6989586621681093754 b6989586621681093755 ~> Bool) -> Type) (a6989586621681105242 :: Arg a6989586621681093754 b6989586621681093755) | |
Defined in Data.Singletons.Prelude.Semigroup | |
| type Apply (Let6989586621680312369Scrutinee_6989586621680303792Sym0 :: TyFun (k1 ~> (k1 ~> Bool)) (TyFun k2 (TyFun k1 (TyFun k3 (TyFun [k1] Bool -> Type) -> Type) -> Type) -> Type) -> Type) (eq6989586621680312357 :: k1 ~> (k1 ~> Bool)) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680312369Scrutinee_6989586621680303792Sym0 :: TyFun (k1 ~> (k1 ~> Bool)) (TyFun k2 (TyFun k1 (TyFun k3 (TyFun [k1] Bool -> Type) -> Type) -> Type) -> Type) -> Type) (eq6989586621680312357 :: k1 ~> (k1 ~> Bool)) = (Let6989586621680312369Scrutinee_6989586621680303792Sym1 eq6989586621680312357 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun [k1] Bool -> Type) -> Type) -> Type) -> Type) | |
| type Apply (Let6989586621680313696Scrutinee_6989586621680303764Sym0 :: TyFun (k1 ~> Bool) (TyFun k1 (TyFun [a6989586621680303205] (TyFun k Bool -> Type) -> Type) -> Type) -> Type) (p6989586621680313690 :: k1 ~> Bool) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680313696Scrutinee_6989586621680303764Sym0 :: TyFun (k1 ~> Bool) (TyFun k1 (TyFun [a6989586621680303205] (TyFun k Bool -> Type) -> Type) -> Type) -> Type) (p6989586621680313690 :: k1 ~> Bool) = (Let6989586621680313696Scrutinee_6989586621680303764Sym1 p6989586621680313690 :: TyFun k1 (TyFun [a6989586621680303205] (TyFun k Bool -> Type) -> Type) -> Type) | |
| type Apply (Lambda_6989586621681062046Sym0 :: TyFun (k1 ~> Bool) (TyFun k (TyFun k1 (m6989586621679932957 k1) -> Type) -> Type) -> Type) (p6989586621681062036 :: k1 ~> Bool) | |
Defined in Data.Singletons.Prelude.Monad | |
| type Apply (Lambda_6989586621681062475Sym0 :: TyFun (k2 ~> f6989586621679932933 Bool) (TyFun k3 (TyFun k2 (TyFun (f6989586621679932933 [k2]) (f6989586621679932933 [k2]) -> Type) -> Type) -> Type) -> Type) (p6989586621681062465 :: k2 ~> f6989586621679932933 Bool) | |
Defined in Data.Singletons.Prelude.Monad type Apply (Lambda_6989586621681062475Sym0 :: TyFun (k2 ~> f6989586621679932933 Bool) (TyFun k3 (TyFun k2 (TyFun (f6989586621679932933 [k2]) (f6989586621679932933 [k2]) -> Type) -> Type) -> Type) -> Type) (p6989586621681062465 :: k2 ~> f6989586621679932933 Bool) = (Lambda_6989586621681062475Sym1 p6989586621681062465 :: TyFun k3 (TyFun k2 (TyFun (f6989586621679932933 [k2]) (f6989586621679932933 [k2]) -> Type) -> Type) -> Type) | |
| type Apply (Lambda_6989586621680313351Sym0 :: TyFun (b6989586621679932961 ~> (a6989586621680303188 ~> Bool)) (TyFun k1 (TyFun k2 (TyFun a6989586621680303188 (TyFun [a6989586621680303188] (TyFun b6989586621679932961 (m6989586621679932957 b6989586621679932961) -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) (eq6989586621680313335 :: b6989586621679932961 ~> (a6989586621680303188 ~> Bool)) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Lambda_6989586621680313351Sym0 :: TyFun (b6989586621679932961 ~> (a6989586621680303188 ~> Bool)) (TyFun k1 (TyFun k2 (TyFun a6989586621680303188 (TyFun [a6989586621680303188] (TyFun b6989586621679932961 (m6989586621679932957 b6989586621679932961) -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) (eq6989586621680313335 :: b6989586621679932961 ~> (a6989586621680303188 ~> Bool)) = (Lambda_6989586621680313351Sym1 eq6989586621680313335 :: TyFun k1 (TyFun k2 (TyFun a6989586621680303188 (TyFun [a6989586621680303188] (TyFun b6989586621679932961 (m6989586621679932957 b6989586621679932961) -> Type) -> Type) -> Type) -> Type) -> Type) | |
The character type Char is an enumeration whose values represent
Unicode (or equivalently ISO/IEC 10646) code points (i.e. characters, see
http://www.unicode.org/ for details). This set extends the ISO 8859-1
(Latin-1) character set (the first 256 characters), which is itself an extension
of the ASCII character set (the first 128 characters). A character literal in
Haskell has type Char.
To convert a Char to or from the corresponding Int value defined
by Unicode, use toEnum and fromEnum from the
Enum class respectively (or equivalently ord and chr).
Instances
Double-precision floating point numbers. It is desirable that this type be at least equal in range and precision to the IEEE double-precision type.
Instances
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
32-bit signed integer type
Instances
64-bit signed integer type
Instances
Invariant: Jn# and Jp# are used iff value doesn't fit in S#
Useful properties resulting from the invariants:
Instances
| Enum Integer | Since: base-2.1 |
| Eq Integer | |
| Integral Integer | Since: base-2.0.1 |
Defined in GHC.Real | |
| Num Integer | Since: base-2.1 |
| Ord Integer | |
| Read Integer | Since: base-2.1 |
| Real Integer | Since: base-2.0.1 |
Defined in GHC.Real Methods toRational :: Integer -> Rational # | |
| Show Integer | Since: base-2.1 |
| Ix Integer | Since: base-2.1 |
Defined in GHC.Arr | |
| Lift Integer | |
| NFData Integer | |
Defined in Control.DeepSeq | |
| Hashable Integer | |
Defined in Data.Hashable.Class | |
| Default Integer | |
Defined in Data.Default.Class | |
| KnownNat n => Reifies (n :: Nat) Integer | |
Defined in Data.Reflection | |
The Maybe type encapsulates an optional value. A value of type
Maybe aa (represented as Just aNothing). Using Maybe is a good way to
deal with errors or exceptional cases without resorting to drastic
measures such as error.
The Maybe type is also a monad. It is a simple kind of error
monad, where all errors are represented by Nothing. A richer
error monad can be built using the Either type.
Instances
| Monad Maybe | Since: base-2.1 |
| Functor Maybe | Since: base-2.1 |
| Applicative Maybe | Since: base-2.1 |
| Foldable Maybe | Since: base-2.1 |
Defined in Data.Foldable Methods fold :: Monoid m => Maybe m -> m # foldMap :: Monoid m => (a -> m) -> Maybe a -> m # foldr :: (a -> b -> b) -> b -> Maybe a -> b # foldr' :: (a -> b -> b) -> b -> Maybe a -> b # foldl :: (b -> a -> b) -> b -> Maybe a -> b # foldl' :: (b -> a -> b) -> b -> Maybe a -> b # foldr1 :: (a -> a -> a) -> Maybe a -> a # foldl1 :: (a -> a -> a) -> Maybe a -> a # elem :: Eq a => a -> Maybe a -> Bool # maximum :: Ord a => Maybe a -> a # minimum :: Ord a => Maybe a -> a # | |
| Traversable Maybe | Since: base-2.1 |
| MonadPlus Maybe | Since: base-2.1 |
| Alternative Maybe | Since: base-2.1 |
| Eq1 Maybe | Since: base-4.9.0.0 |
| Ord1 Maybe | Since: base-4.9.0.0 |
Defined in Data.Functor.Classes | |
| Read1 Maybe | Since: base-4.9.0.0 |
Defined in Data.Functor.Classes | |
| Show1 Maybe | Since: base-4.9.0.0 |
| NFData1 Maybe | Since: deepseq-1.4.3.0 |
Defined in Control.DeepSeq | |
| Hashable1 Maybe | |
Defined in Data.Hashable.Class | |
| Keyed Maybe | |
| Zip Maybe | |
| ZipWithKey Maybe | |
| Indexable Maybe | |
| Lookup Maybe | |
| FoldableWithKey Maybe | |
| TraversableWithKey Maybe | |
Defined in Data.Key Methods traverseWithKey :: Applicative f => (Key Maybe -> a -> f b) -> Maybe a -> f (Maybe b) # mapWithKeyM :: Monad m => (Key Maybe -> a -> m b) -> Maybe a -> m (Maybe b) # | |
| Apply Maybe | |
| Bind Maybe | |
| PTraversable Maybe | |
| STraversable Maybe | |
Defined in Data.Singletons.Prelude.Traversable Methods sTraverse :: SApplicative f => Sing t1 -> Sing t2 -> Sing (Apply (Apply TraverseSym0 t1) t2) # sSequenceA :: SApplicative f => Sing t1 -> Sing (Apply SequenceASym0 t1) # sMapM :: SMonad m => Sing t1 -> Sing t2 -> Sing (Apply (Apply MapMSym0 t1) t2) # sSequence :: SMonad m => Sing t1 -> Sing (Apply SequenceSym0 t1) # | |
| PFoldable Maybe | |
| SFoldable Maybe | |
Defined in Data.Singletons.Prelude.Foldable Methods sFold :: SMonoid m => Sing t1 -> Sing (Apply FoldSym0 t1) # sFoldMap :: SMonoid m => Sing t1 -> Sing t2 -> Sing (Apply (Apply FoldMapSym0 t1) t2) # sFoldr :: Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply FoldrSym0 t1) t2) t3) # sFoldr' :: Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply Foldr'Sym0 t1) t2) t3) # sFoldl :: Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply FoldlSym0 t1) t2) t3) # sFoldl' :: Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply Foldl'Sym0 t1) t2) t3) # sFoldr1 :: Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldr1Sym0 t1) t2) # sFoldl1 :: Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldl1Sym0 t1) t2) # sToList :: Sing t1 -> Sing (Apply ToListSym0 t1) # sNull :: Sing t1 -> Sing (Apply NullSym0 t1) # sLength :: Sing t1 -> Sing (Apply LengthSym0 t1) # sElem :: SEq a => Sing t1 -> Sing t2 -> Sing (Apply (Apply ElemSym0 t1) t2) # sMaximum :: SOrd a => Sing t1 -> Sing (Apply MaximumSym0 t1) # sMinimum :: SOrd a => Sing t1 -> Sing (Apply MinimumSym0 t1) # sSum :: SNum a => Sing t1 -> Sing (Apply SumSym0 t1) # sProduct :: SNum a => Sing t1 -> Sing (Apply ProductSym0 t1) # | |
| PFunctor Maybe | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| PApplicative Maybe | |
| PMonad Maybe | |
| PAlternative Maybe | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| PMonadPlus Maybe | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| SFunctor Maybe | |
| SApplicative Maybe | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods sPure :: Sing t -> Sing (Apply PureSym0 t) # (%<*>) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (<*>@#@$) t1) t2) # sLiftA2 :: Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply LiftA2Sym0 t1) t2) t3) # (%*>) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (*>@#@$) t1) t2) # (%<*) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (<*@#@$) t1) t2) # | |
| SMonad Maybe | |
| SAlternative Maybe | |
| SMonadPlus Maybe | |
| FunctorWithIndex () Maybe | |
Defined in Control.Lens.Indexed | |
| FoldableWithIndex () Maybe | |
| TraversableWithIndex () Maybe | |
Defined in Control.Lens.Indexed Methods itraverse :: Applicative f => (() -> a -> f b) -> Maybe a -> f (Maybe b) # itraversed :: IndexedTraversal () (Maybe a) (Maybe b) a b # | |
| Eq a => Eq (Maybe a) | Since: base-2.1 |
| Ord a => Ord (Maybe a) | Since: base-2.1 |
| Read a => Read (Maybe a) | Since: base-2.1 |
| Show a => Show (Maybe a) | Since: base-2.1 |
| Generic (Maybe a) | |
| Semigroup a => Semigroup (Maybe a) | Since: base-4.9.0.0 |
| Semigroup a => Monoid (Maybe a) | Lift a semigroup into Since 4.11.0: constraint on inner Since: base-2.1 |
| Lift a => Lift (Maybe a) | |
| NFData a => NFData (Maybe a) | |
Defined in Control.DeepSeq | |
| Hashable a => Hashable (Maybe a) | |
Defined in Data.Hashable.Class | |
| SingKind a => SingKind (Maybe a) | Since: base-4.9.0.0 |
Defined in GHC.Generics | |
| MonoPointed (Maybe a) | |
| MonoTraversable (Maybe a) | |
| MonoFoldable (Maybe a) | |
Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element (Maybe a) -> m) -> Maybe a -> m # ofoldr :: (Element (Maybe a) -> b -> b) -> b -> Maybe a -> b # ofoldl' :: (a0 -> Element (Maybe a) -> a0) -> a0 -> Maybe a -> a0 # otoList :: Maybe a -> [Element (Maybe a)] # oall :: (Element (Maybe a) -> Bool) -> Maybe a -> Bool # oany :: (Element (Maybe a) -> Bool) -> Maybe a -> Bool # olength64 :: Maybe a -> Int64 # ocompareLength :: Integral i => Maybe a -> i -> Ordering # otraverse_ :: Applicative f => (Element (Maybe a) -> f b) -> Maybe a -> f () # ofor_ :: Applicative f => Maybe a -> (Element (Maybe a) -> f b) -> f () # omapM_ :: Applicative m => (Element (Maybe a) -> m ()) -> Maybe a -> m () # oforM_ :: Applicative m => Maybe a -> (Element (Maybe a) -> m ()) -> m () # ofoldlM :: Monad m => (a0 -> Element (Maybe a) -> m a0) -> a0 -> Maybe a -> m a0 # ofoldMap1Ex :: Semigroup m => (Element (Maybe a) -> m) -> Maybe a -> m # ofoldr1Ex :: (Element (Maybe a) -> Element (Maybe a) -> Element (Maybe a)) -> Maybe a -> Element (Maybe a) # ofoldl1Ex' :: (Element (Maybe a) -> Element (Maybe a) -> Element (Maybe a)) -> Maybe a -> Element (Maybe a) # headEx :: Maybe a -> Element (Maybe a) # lastEx :: Maybe a -> Element (Maybe a) # unsafeHead :: Maybe a -> Element (Maybe a) # unsafeLast :: Maybe a -> Element (Maybe a) # maximumByEx :: (Element (Maybe a) -> Element (Maybe a) -> Ordering) -> Maybe a -> Element (Maybe a) # minimumByEx :: (Element (Maybe a) -> Element (Maybe a) -> Ordering) -> Maybe a -> Element (Maybe a) # | |
| MonoFunctor (Maybe a) | |
| Default (Maybe a) | |
Defined in Data.Default.Class | |
| NullToNothing (Maybe a) | |
Defined in Data.GI.Base.BasicTypes | |
| IsGValue (Maybe String) | |
| IsGValue (Maybe Text) | |
| Ixed (Maybe a) | |
Defined in Control.Lens.At | |
| At (Maybe a) | |
| PMonoid (Maybe a) | |
| SSemigroup a => SMonoid (Maybe a) | |
Defined in Data.Singletons.Prelude.Monoid | |
| PShow (Maybe a) | |
| SShow a => SShow (Maybe a) | |
| PSemigroup (Maybe a) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| SSemigroup a => SSemigroup (Maybe a) | |
| POrd (Maybe a) | |
| SOrd a => SOrd (Maybe a) | |
Defined in Data.Singletons.Prelude.Ord Methods sCompare :: Sing t1 -> Sing t2 -> Sing (Apply (Apply CompareSym0 t1) t2) # (%<) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (<@#@$) t1) t2) # (%<=) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (<=@#@$) t1) t2) # (%>) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (>@#@$) t1) t2) # (%>=) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (>=@#@$) t1) t2) # sMax :: Sing t1 -> Sing t2 -> Sing (Apply (Apply MaxSym0 t1) t2) # sMin :: Sing t1 -> Sing t2 -> Sing (Apply (Apply MinSym0 t1) t2) # | |
| SEq a => SEq (Maybe a) | |
| PEq (Maybe a) | |
| Generic1 Maybe | |
| SingI (Nothing :: Maybe a) | Since: base-4.9.0.0 |
Defined in GHC.Generics | |
| SingI a2 => SingI (Just a2 :: Maybe a1) | Since: base-4.9.0.0 |
Defined in GHC.Generics | |
| SuppressUnusedWarnings (CatMaybesSym0 :: TyFun [Maybe a6989586621680027010] [a6989586621680027010] -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ListToMaybeSym0 :: TyFun [a6989586621680027011] (Maybe a6989586621680027011) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (StripPrefixSym0 :: TyFun [a6989586621680429335] ([a6989586621680429335] ~> Maybe [a6989586621680429335]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (MaybeToListSym0 :: TyFun (Maybe a6989586621680027013) [a6989586621680027013] -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (IsNothingSym0 :: TyFun (Maybe a6989586621680027018) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (IsJustSym0 :: TyFun (Maybe a6989586621680027019) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FromJustSym0 :: TyFun (Maybe a6989586621680027016) a6989586621680027016 -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (MinInternalSym0 :: TyFun (Maybe a6989586621680703263) (MinInternal a6989586621680703263) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (MaxInternalSym0 :: TyFun (Maybe a6989586621680702577) (MaxInternal a6989586621680702577) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680031551Sym0 :: TyFun (Maybe a6989586621679933013) (Maybe a6989586621679933013 ~> Maybe a6989586621679933013) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679829652Sym0 :: TyFun (Maybe a3530822107858468865) (Maybe a3530822107858468865 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (OptionSym0 :: TyFun (Maybe a6989586621679061685) (Option a6989586621679061685) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (LastSym0 :: TyFun (Maybe a6989586621679076669) (Last a6989586621679076669) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FirstSym0 :: TyFun (Maybe a6989586621679076674) (First a6989586621679076674) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621680595055Sym0 :: TyFun Nat (Maybe a3530822107858468865 ~> (Symbol ~> Symbol)) -> Type) | |
Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Fail_6989586621680031326Sym0 :: TyFun Symbol (Maybe a6989586621679932963) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FromMaybeSym0 :: TyFun a6989586621680027014 (Maybe a6989586621680027014 ~> a6989586621680027014) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ElemIndexSym0 :: TyFun a6989586621680303117 ([a6989586621680303117] ~> Maybe Nat) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Pure_6989586621680030830Sym0 :: TyFun a6989586621679932934 (Maybe a6989586621679932934) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680031544LSym0 :: TyFun k1 (Maybe k1) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (JustSym0 :: TyFun a3530822107858468865 (Maybe a3530822107858468865) -> Type) | |
Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (GetOptionSym0 :: TyFun (Option a6989586621679061685) (Maybe a6989586621679061685) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (GetFirstSym0 :: TyFun (First a6989586621679076674) (Maybe a6989586621679076674) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (GetLastSym0 :: TyFun (Last a6989586621679076669) (Maybe a6989586621679076669) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FindSym0 :: TyFun (a6989586621680303118 ~> Bool) ([a6989586621680303118] ~> Maybe a6989586621680303118) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FindIndexSym0 :: TyFun (a6989586621680303115 ~> Bool) ([a6989586621680303115] ~> Maybe Nat) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SingI (CatMaybesSym0 :: TyFun [Maybe a] [a] -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing CatMaybesSym0 # | |
| SingI (ListToMaybeSym0 :: TyFun [a] (Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing ListToMaybeSym0 # | |
| SingI (MaybeToListSym0 :: TyFun (Maybe a) [a] -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing MaybeToListSym0 # | |
| SingI (IsNothingSym0 :: TyFun (Maybe a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing IsNothingSym0 # | |
| SingI (IsJustSym0 :: TyFun (Maybe a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing IsJustSym0 # | |
| SingI (FromJustSym0 :: TyFun (Maybe a) a -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing FromJustSym0 # | |
| SingI (OptionSym0 :: TyFun (Maybe a) (Option a) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods sing :: Sing OptionSym0 # | |
| SingI (LastSym0 :: TyFun (Maybe a) (Last a) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid | |
| SingI (FirstSym0 :: TyFun (Maybe a) (First a) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid | |
| SingI (FromMaybeSym0 :: TyFun a (Maybe a ~> a) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing FromMaybeSym0 # | |
| SEq a => SingI (ElemIndexSym0 :: TyFun a ([a] ~> Maybe Nat) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing ElemIndexSym0 # | |
| SingI (JustSym0 :: TyFun a (Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Instances | |
| SingI (FindSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| SingI (FindIndexSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe Nat) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing FindIndexSym0 # | |
| SuppressUnusedWarnings (StripPrefixSym1 a6989586621680442045 :: TyFun [a6989586621680429335] (Maybe [a6989586621680429335]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FindSym1 a6989586621680312675 :: TyFun [a6989586621680303118] (Maybe a6989586621680303118) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FindIndexSym1 a6989586621680313035 :: TyFun [a6989586621680303115] (Maybe Nat) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ElemIndexSym1 a6989586621680313043 :: TyFun [a6989586621680303117] (Maybe Nat) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621680595055Sym1 a6989586621680595052 a3530822107858468865 :: TyFun (Maybe a3530822107858468865) (Symbol ~> Symbol) -> Type) | |
Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FromMaybeSym1 a6989586621680028260 :: TyFun (Maybe a6989586621680027014) a6989586621680027014 -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680031551Sym1 a6989586621680031548 :: TyFun (Maybe a6989586621679933013) (Maybe a6989586621679933013) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680031311Sym0 :: TyFun (Maybe a6989586621679932960) (Maybe b6989586621679932961 ~> Maybe b6989586621679932961) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680031284Sym0 :: TyFun (Maybe a6989586621679932958) ((a6989586621679932958 ~> Maybe b6989586621679932959) ~> Maybe b6989586621679932959) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680030923Sym0 :: TyFun (Maybe a6989586621679932940) (Maybe b6989586621679932941 ~> Maybe b6989586621679932941) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679829652Sym1 a6989586621679829650 :: TyFun (Maybe a3530822107858468865) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680030859Sym0 :: TyFun (Maybe (a6989586621679932935 ~> b6989586621679932936)) (Maybe a6989586621679932935 ~> Maybe b6989586621679932936) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Maybe_Sym0 :: TyFun b6989586621680023676 ((a6989586621680023677 ~> b6989586621680023676) ~> (Maybe a6989586621680023677 ~> b6989586621680023676)) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (LookupSym0 :: TyFun a6989586621680303096 ([(a6989586621680303096, b6989586621680303097)] ~> Maybe b6989586621680303097) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680704068NSym0 :: TyFun k (TyFun k1 (Maybe k1) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680704068MSym0 :: TyFun k1 (TyFun k (Maybe k1) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680704041NSym0 :: TyFun k (TyFun k1 (Maybe k1) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680704041MSym0 :: TyFun k1 (TyFun k (Maybe k1) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680030190Sym0 :: TyFun a6989586621679932931 (Maybe b6989586621679932932 ~> Maybe a6989586621679932931) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (OptionalSym0 :: TyFun (f6989586621680946209 a6989586621680946210) (f6989586621680946209 (Maybe a6989586621680946210)) -> Type) | |
Defined in Data.Singletons.Prelude.Applicative Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (MapMaybeSym0 :: TyFun (a6989586621680027008 ~> Maybe b6989586621680027009) ([a6989586621680027008] ~> [b6989586621680027009]) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (UnfoldrSym0 :: TyFun (b6989586621680303174 ~> Maybe (a6989586621680303175, b6989586621680303174)) (b6989586621680303174 ~> [a6989586621680303175]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FindSym0 :: TyFun (a6989586621680712165 ~> Bool) (t6989586621680712164 a6989586621680712165 ~> Maybe a6989586621680712165) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Fmap_6989586621680030099Sym0 :: TyFun (a6989586621679932929 ~> b6989586621679932930) (Maybe a6989586621679932929 ~> Maybe b6989586621679932930) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SingI d => SingI (FindSym1 d :: TyFun [a] (Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| SingI d => SingI (FindIndexSym1 d :: TyFun [a] (Maybe Nat) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing (FindIndexSym1 d) # | |
| (SEq a, SingI d) => SingI (ElemIndexSym1 d :: TyFun [a] (Maybe Nat) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing (ElemIndexSym1 d) # | |
| SingI d => SingI (FromMaybeSym1 d :: TyFun (Maybe a) a -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing (FromMaybeSym1 d) # | |
| SingI (Maybe_Sym0 :: TyFun b ((a ~> b) ~> (Maybe a ~> b)) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing Maybe_Sym0 # | |
| SEq a => SingI (LookupSym0 :: TyFun a ([(a, b)] ~> Maybe b) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing LookupSym0 # | |
| SAlternative f => SingI (OptionalSym0 :: TyFun (f a) (f (Maybe a)) -> Type) | |
Defined in Data.Singletons.Prelude.Applicative Methods sing :: Sing OptionalSym0 # | |
| SingI (MapMaybeSym0 :: TyFun (a ~> Maybe b) ([a] ~> [b]) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing MapMaybeSym0 # | |
| SingI (UnfoldrSym0 :: TyFun (b ~> Maybe (a, b)) (b ~> [a]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing UnfoldrSym0 # | |
| SFoldable t => SingI (FindSym0 :: TyFun (a ~> Bool) (t a ~> Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
| SuppressUnusedWarnings (LookupSym1 a6989586621680312457 b6989586621680303097 :: TyFun [(a6989586621680303096, b6989586621680303097)] (Maybe b6989586621680303097) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680031311Sym1 a6989586621680031309 b6989586621679932961 :: TyFun (Maybe b6989586621679932961) (Maybe b6989586621679932961) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680030923Sym1 a6989586621680030921 b6989586621679932941 :: TyFun (Maybe b6989586621679932941) (Maybe b6989586621679932941) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680030859Sym1 a6989586621680030857 :: TyFun (Maybe a6989586621679932935) (Maybe b6989586621679932936) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680030190Sym1 a6989586621680030185 b6989586621679932932 :: TyFun (Maybe b6989586621679932932) (Maybe a6989586621679932931) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Fmap_6989586621680030099Sym1 a6989586621680030096 :: TyFun (Maybe a6989586621679932929) (Maybe b6989586621679932930) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680704068NSym1 x6989586621680704066 :: TyFun k1 (Maybe k1) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680704068MSym1 x6989586621680704066 :: TyFun k (Maybe k1) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680704041NSym1 x6989586621680704039 :: TyFun k1 (Maybe k1) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680704041MSym1 x6989586621680704039 :: TyFun k (Maybe k1) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FindSym1 a6989586621680712622 t6989586621680712164 :: TyFun (t6989586621680712164 a6989586621680712165) (Maybe a6989586621680712165) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680661377Sym0 :: TyFun k (TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680661289Sym0 :: TyFun k (TyFun (k1 ~> First a) (TyFun k1 (Maybe a) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Traverse_6989586621680957559Sym0 :: TyFun (a6989586621680946430 ~> f6989586621680946429 b6989586621680946431) (Maybe a6989586621680946430 ~> f6989586621680946429 (Maybe b6989586621680946431)) -> Type) | |
Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Maybe_Sym1 a6989586621680023698 a6989586621680023677 :: TyFun (a6989586621680023677 ~> b6989586621680023676) (Maybe a6989586621680023677 ~> b6989586621680023676) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680028183RsSym0 :: TyFun (a6989586621680027008 ~> Maybe k1) (TyFun k (TyFun [a6989586621680027008] [k1] -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680713099MfSym0 :: TyFun (k2 ~> (k3 ~> k3)) (TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680713074MfSym0 :: TyFun (k3 ~> (k2 ~> k3)) (TyFun k (TyFun k3 (TyFun (Maybe k2) (Maybe k3) -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680031284Sym1 a6989586621680031282 b6989586621679932959 :: TyFun (a6989586621679932958 ~> Maybe b6989586621679932959) (Maybe b6989586621679932959) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (LiftA2_6989586621680030899Sym0 :: TyFun (a6989586621679932937 ~> (b6989586621679932938 ~> c6989586621679932939)) (Maybe a6989586621679932937 ~> (Maybe b6989586621679932938 ~> Maybe c6989586621679932939)) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| (SEq a, SingI d) => SingI (LookupSym1 d b :: TyFun [(a, b)] (Maybe b) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing (LookupSym1 d b) # | |
| (SFoldable t, SingI d) => SingI (FindSym1 d t :: TyFun (t a) (Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
| SingI d => SingI (Maybe_Sym1 d a :: TyFun (a ~> b) (Maybe a ~> b) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing (Maybe_Sym1 d a) # | |
| SuppressUnusedWarnings (Traverse_6989586621680957559Sym1 a6989586621680957557 :: TyFun (Maybe a6989586621680946430) (f6989586621680946429 (Maybe b6989586621680946431)) -> Type) | |
Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Maybe_Sym2 a6989586621680023699 a6989586621680023698 :: TyFun (Maybe a6989586621680023677) b6989586621680023676 -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (LiftA2_6989586621680030899Sym1 a6989586621680030895 :: TyFun (Maybe a6989586621679932937) (Maybe b6989586621679932938 ~> Maybe c6989586621679932939) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680713099MfSym1 f6989586621680713097 :: TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680713074MfSym1 f6989586621680713072 :: TyFun k (TyFun k3 (TyFun (Maybe k2) (Maybe k3) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680661377Sym1 a6989586621680661375 :: TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680661289Sym1 a6989586621680661287 :: TyFun (k1 ~> First a) (TyFun k1 (Maybe a) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| (SingI d1, SingI d2) => SingI (Maybe_Sym2 d1 d2 :: TyFun (Maybe a) b -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing (Maybe_Sym2 d1 d2) # | |
| SuppressUnusedWarnings (Let6989586621680713099MfSym2 xs6989586621680713098 f6989586621680713097 :: TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (LiftA2_6989586621680030899Sym2 a6989586621680030897 a6989586621680030895 :: TyFun (Maybe b6989586621679932938) (Maybe c6989586621679932939) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680713074MfSym2 xs6989586621680713073 f6989586621680713072 :: TyFun k3 (TyFun (Maybe k2) (Maybe k3) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680661377Sym2 k6989586621680661376 a6989586621680661375 :: TyFun k1 (Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680661289Sym2 k6989586621680661288 a6989586621680661287 :: TyFun k1 (Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680713074MfSym3 a6989586621680713075 xs6989586621680713073 f6989586621680713072 :: TyFun (Maybe k2) (Maybe k3) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680713099MfSym3 a6989586621680713100 xs6989586621680713098 f6989586621680713097 :: TyFun k3 (Maybe k3) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| type Key Maybe | |
| type Empty | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| type Mzero | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| type Product (arg :: Maybe a) | |
| type Sum (arg :: Maybe a) | |
| type Minimum (arg :: Maybe a) | |
| type Maximum (arg :: Maybe a) | |
| type Length (arg :: Maybe a) | |
| type Null (arg :: Maybe a) | |
| type ToList (arg :: Maybe a) | |
| type Fold (arg :: Maybe m) | |
| type Pure (a :: k1) | |
| type Fail a2 | |
| type Return (arg :: a) | |
| type Sequence (arg :: Maybe (m a)) | |
| type SequenceA (arg :: Maybe (f a)) | |
| type Elem (arg1 :: a) (arg2 :: Maybe a) | |
| type Foldl1 (arg1 :: a ~> (a ~> a)) (arg2 :: Maybe a) | |
| type Foldr1 (arg1 :: a ~> (a ~> a)) (arg2 :: Maybe a) | |
| type (a1 :: Maybe a6989586621679933013) <|> (a2 :: Maybe a6989586621679933013) | |
| type Mplus (arg1 :: Maybe a) (arg2 :: Maybe a) | |
| type FoldMap (a1 :: a6989586621680712259 ~> k2) (a2 :: Maybe a6989586621680712259) | |
| type (a1 :: k1) <$ (a2 :: Maybe b6989586621679932932) | |
| type Fmap (a1 :: a6989586621679932929 ~> b6989586621679932930) (a2 :: Maybe a6989586621679932929) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| type (arg1 :: Maybe a) <* (arg2 :: Maybe b) | |
| type (a1 :: Maybe a6989586621679932940) *> (a2 :: Maybe b6989586621679932941) | |
| type (a1 :: Maybe (a6989586621679932935 ~> b6989586621679932936)) <*> (a2 :: Maybe a6989586621679932935) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| type (a1 :: Maybe a6989586621679932960) >> (a2 :: Maybe b6989586621679932961) | |
| type (a1 :: Maybe a6989586621679932958) >>= (a2 :: a6989586621679932958 ~> Maybe b6989586621679932959) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| type MapM (arg1 :: a ~> m b) (arg2 :: Maybe a) | |
| type Traverse (a1 :: a6989586621680946430 ~> f6989586621680946429 b6989586621680946431) (a2 :: Maybe a6989586621680946430) | |
Defined in Data.Singletons.Prelude.Traversable type Traverse (a1 :: a6989586621680946430 ~> f6989586621680946429 b6989586621680946431) (a2 :: Maybe a6989586621680946430) = Apply (Apply (Traverse_6989586621680957559Sym0 :: TyFun (a6989586621680946430 ~> f6989586621680946429 b6989586621680946431) (Maybe a6989586621680946430 ~> f6989586621680946429 (Maybe b6989586621680946431)) -> Type) a1) a2 | |
| type Foldl' (arg1 :: b ~> (a ~> b)) (arg2 :: b) (arg3 :: Maybe a) | |
| type Foldl (a1 :: k2 ~> (a6989586621680712265 ~> k2)) (a2 :: k2) (a3 :: Maybe a6989586621680712265) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Foldr' (arg1 :: a ~> (b ~> b)) (arg2 :: b) (arg3 :: Maybe a) | |
| type Foldr (a1 :: a6989586621680712260 ~> (k2 ~> k2)) (a2 :: k2) (a3 :: Maybe a6989586621680712260) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type LiftA2 (a1 :: a6989586621679932937 ~> (b6989586621679932938 ~> c6989586621679932939)) (a2 :: Maybe a6989586621679932937) (a3 :: Maybe b6989586621679932938) | |
Defined in Data.Singletons.Prelude.Monad.Internal type LiftA2 (a1 :: a6989586621679932937 ~> (b6989586621679932938 ~> c6989586621679932939)) (a2 :: Maybe a6989586621679932937) (a3 :: Maybe b6989586621679932938) = Apply (Apply (Apply (LiftA2_6989586621680030899Sym0 :: TyFun (a6989586621679932937 ~> (b6989586621679932938 ~> c6989586621679932939)) (Maybe a6989586621679932937 ~> (Maybe b6989586621679932938 ~> Maybe c6989586621679932939)) -> Type) a1) a2) a3 | |
| type Apply (IsNothingSym0 :: TyFun (Maybe a) Bool -> Type) (a6989586621680028313 :: Maybe a) | |
Defined in Data.Singletons.Prelude.Maybe | |
| type Apply (IsJustSym0 :: TyFun (Maybe a) Bool -> Type) (a6989586621680028320 :: Maybe a) | |
Defined in Data.Singletons.Prelude.Maybe | |
| type Apply (FromJustSym0 :: TyFun (Maybe a) a -> Type) (a6989586621680028289 :: Maybe a) | |
Defined in Data.Singletons.Prelude.Maybe | |
| type Apply (Compare_6989586621679829652Sym1 a6989586621679829650 :: TyFun (Maybe a) Ordering -> Type) (a6989586621679829651 :: Maybe a) | |
| type Apply (FromMaybeSym1 a6989586621680028260 :: TyFun (Maybe a) a -> Type) (a6989586621680028263 :: Maybe a) | |
Defined in Data.Singletons.Prelude.Maybe | |
| type Apply (Maybe_Sym2 a6989586621680023699 a6989586621680023698 :: TyFun (Maybe a) b -> Type) (a6989586621680023700 :: Maybe a) | |
Defined in Data.Singletons.Prelude.Maybe | |
| type Rep (Maybe a) | Since: base-4.6.0.0 |
| data Sing (b :: Maybe a) | |
| type DemoteRep (Maybe a) | |
Defined in GHC.Generics | |
| type Element (Maybe a) | |
Defined in Data.MonoTraversable | |
| type Index (Maybe a) | |
Defined in Control.Lens.At | |
| type IxValue (Maybe a) | |
Defined in Control.Lens.At | |
| type Mempty | |
Defined in Data.Singletons.Prelude.Monoid | |
| data Sing (b :: Maybe a) | |
| type Demote (Maybe a) | |
Defined in Data.Singletons.Prelude.Instances | |
| type Rep1 Maybe | Since: base-4.6.0.0 |
| type Mconcat (arg :: [Maybe a]) | |
| type Show_ (arg :: Maybe a) | |
| type Sconcat (arg :: NonEmpty (Maybe a)) | |
| type Mappend (arg1 :: Maybe a) (arg2 :: Maybe a) | |
| type ShowList (arg1 :: [Maybe a]) arg2 | |
| type (a2 :: Maybe a1) <> (a3 :: Maybe a1) | |
| type Min (arg1 :: Maybe a) (arg2 :: Maybe a) | |
| type Max (arg1 :: Maybe a) (arg2 :: Maybe a) | |
| type (arg1 :: Maybe a) >= (arg2 :: Maybe a) | |
| type (arg1 :: Maybe a) > (arg2 :: Maybe a) | |
| type (arg1 :: Maybe a) <= (arg2 :: Maybe a) | |
| type (arg1 :: Maybe a) < (arg2 :: Maybe a) | |
| type Compare (a2 :: Maybe a1) (a3 :: Maybe a1) | |
| type (x :: Maybe a) /= (y :: Maybe a) | |
| type (a2 :: Maybe a1) == (b :: Maybe a1) | |
Defined in Data.Singletons.Prelude.Eq | |
| type ShowsPrec a2 (a3 :: Maybe a1) a4 | |
| type Apply (Pure_6989586621680030830Sym0 :: TyFun a (Maybe a) -> Type) (a6989586621680030828 :: a) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| type Apply (Fail_6989586621680031326Sym0 :: TyFun Symbol (Maybe a6989586621679932963) -> Type) (a6989586621680031325 :: Symbol) | |
| type Apply (Let6989586621680031544LSym0 :: TyFun k1 (Maybe k1) -> Type) (wild_69895866216800248556989586621680031543 :: k1) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| type Apply (JustSym0 :: TyFun a (Maybe a) -> Type) (t6989586621679724560 :: a) | |
| type Apply (Let6989586621680704041MSym1 x6989586621680704039 :: TyFun k (Maybe k1) -> Type) (y6989586621680704040 :: k) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (Let6989586621680704041NSym1 x6989586621680704039 :: TyFun k1 (Maybe k1) -> Type) (y6989586621680704040 :: k1) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (Let6989586621680704068MSym1 x6989586621680704066 :: TyFun k (Maybe k1) -> Type) (y6989586621680704067 :: k) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (Let6989586621680704068NSym1 x6989586621680704066 :: TyFun k1 (Maybe k1) -> Type) (y6989586621680704067 :: k1) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (Lambda_6989586621680661289Sym2 k6989586621680661288 a6989586621680661287 :: TyFun k1 (Maybe a) -> Type) (t6989586621680661300 :: k1) | |
Defined in Data.Singletons.Prelude.Monoid | |
| type Apply (Lambda_6989586621680661377Sym2 k6989586621680661376 a6989586621680661375 :: TyFun k1 (Maybe a) -> Type) (t6989586621680661388 :: k1) | |
Defined in Data.Singletons.Prelude.Monoid | |
| type Apply (Let6989586621680713099MfSym3 a6989586621680713100 xs6989586621680713098 f6989586621680713097 :: TyFun k3 (Maybe k3) -> Type) (a6989586621680713101 :: k3) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (CatMaybesSym0 :: TyFun [Maybe a] [a] -> Type) (a6989586621680028217 :: [Maybe a]) | |
Defined in Data.Singletons.Prelude.Maybe | |
| type Apply (MaybeToListSym0 :: TyFun (Maybe a) [a] -> Type) (a6989586621680028244 :: Maybe a) | |
Defined in Data.Singletons.Prelude.Maybe type Apply (MaybeToListSym0 :: TyFun (Maybe a) [a] -> Type) (a6989586621680028244 :: Maybe a) = MaybeToList a6989586621680028244 | |
| type Apply (ListToMaybeSym0 :: TyFun [a] (Maybe a) -> Type) (a6989586621680028231 :: [a]) | |
Defined in Data.Singletons.Prelude.Maybe type Apply (ListToMaybeSym0 :: TyFun [a] (Maybe a) -> Type) (a6989586621680028231 :: [a]) = ListToMaybe a6989586621680028231 | |
| type Apply (GetOptionSym0 :: TyFun (Option a) (Maybe a) -> Type) (a6989586621680191395 :: Option a) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Apply (GetFirstSym0 :: TyFun (First a) (Maybe a) -> Type) (a6989586621680655185 :: First a) | |
Defined in Data.Singletons.Prelude.Monoid | |
| type Apply (GetLastSym0 :: TyFun (Last a) (Maybe a) -> Type) (a6989586621680655206 :: Last a) | |
Defined in Data.Singletons.Prelude.Monoid | |
| type Apply (OptionSym0 :: TyFun (Maybe a) (Option a) -> Type) (t6989586621680191398 :: Maybe a) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Apply (FirstSym0 :: TyFun (Maybe a) (First a) -> Type) (t6989586621680655188 :: Maybe a) | |
| type Apply (LastSym0 :: TyFun (Maybe a) (Last a) -> Type) (t6989586621680655209 :: Maybe a) | |
| type Apply (MinInternalSym0 :: TyFun (Maybe a) (MinInternal a) -> Type) (t6989586621680703462 :: Maybe a) | |
| type Apply (MaxInternalSym0 :: TyFun (Maybe a) (MaxInternal a) -> Type) (t6989586621680703255 :: Maybe a) | |
| type Apply (StripPrefixSym1 a6989586621680442045 :: TyFun [a] (Maybe [a]) -> Type) (a6989586621680442046 :: [a]) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (StripPrefixSym1 a6989586621680442045 :: TyFun [a] (Maybe [a]) -> Type) (a6989586621680442046 :: [a]) = StripPrefix a6989586621680442045 a6989586621680442046 | |
| type Apply (FindIndexSym1 a6989586621680313035 :: TyFun [a] (Maybe Nat) -> Type) (a6989586621680313036 :: [a]) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (ElemIndexSym1 a6989586621680313043 :: TyFun [a] (Maybe Nat) -> Type) (a6989586621680313044 :: [a]) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (FindSym1 a6989586621680312675 :: TyFun [a] (Maybe a) -> Type) (a6989586621680312676 :: [a]) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (TFHelper_6989586621680031551Sym1 a6989586621680031548 :: TyFun (Maybe a) (Maybe a) -> Type) (a6989586621680031550 :: Maybe a) | |
| type Apply (OptionalSym0 :: TyFun (f a) (f (Maybe a)) -> Type) (a6989586621680946657 :: f a) | |
Defined in Data.Singletons.Prelude.Applicative | |
| type Apply (LookupSym1 a6989586621680312457 b :: TyFun [(a, b)] (Maybe b) -> Type) (a6989586621680312458 :: [(a, b)]) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (FindSym1 a6989586621680712622 t :: TyFun (t a) (Maybe a) -> Type) (a6989586621680712623 :: t a) | |
| type Apply (Fmap_6989586621680030099Sym1 a6989586621680030096 :: TyFun (Maybe a) (Maybe b) -> Type) (a6989586621680030098 :: Maybe a) | |
| type Apply (TFHelper_6989586621680030190Sym1 a6989586621680030185 b :: TyFun (Maybe b) (Maybe a) -> Type) (a6989586621680030187 :: Maybe b) | |
| type Apply (TFHelper_6989586621680030859Sym1 a6989586621680030857 :: TyFun (Maybe a) (Maybe b) -> Type) (a6989586621680030858 :: Maybe a) | |
| type Apply (TFHelper_6989586621680030923Sym1 a6989586621680030921 b :: TyFun (Maybe b) (Maybe b) -> Type) (a6989586621680030922 :: Maybe b) | |
| type Apply (TFHelper_6989586621680031311Sym1 a6989586621680031309 b :: TyFun (Maybe b) (Maybe b) -> Type) (a6989586621680031310 :: Maybe b) | |
| type Apply (Traverse_6989586621680957559Sym1 a6989586621680957557 :: TyFun (Maybe a) (f (Maybe b)) -> Type) (a6989586621680957558 :: Maybe a) | |
| type Apply (LiftA2_6989586621680030899Sym2 a6989586621680030897 a6989586621680030895 :: TyFun (Maybe b) (Maybe c) -> Type) (a6989586621680030898 :: Maybe b) | |
| type Apply (Let6989586621680713074MfSym3 a6989586621680713075 xs6989586621680713073 f6989586621680713072 :: TyFun (Maybe k2) (Maybe k3) -> Type) (a6989586621680713076 :: Maybe k2) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (TFHelper_6989586621680031284Sym1 a6989586621680031282 b :: TyFun (a ~> Maybe b) (Maybe b) -> Type) (a6989586621680031283 :: a ~> Maybe b) | |
| type Apply (ElemIndexSym0 :: TyFun a6989586621680303117 ([a6989586621680303117] ~> Maybe Nat) -> Type) (a6989586621680313043 :: a6989586621680303117) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (ElemIndexSym0 :: TyFun a6989586621680303117 ([a6989586621680303117] ~> Maybe Nat) -> Type) (a6989586621680313043 :: a6989586621680303117) = ElemIndexSym1 a6989586621680313043 | |
| type Apply (ShowsPrec_6989586621680595055Sym0 :: TyFun Nat (Maybe a3530822107858468865 ~> (Symbol ~> Symbol)) -> Type) (a6989586621680595052 :: Nat) | |
Defined in Data.Singletons.Prelude.Show | |
| type Apply (FromMaybeSym0 :: TyFun a6989586621680027014 (Maybe a6989586621680027014 ~> a6989586621680027014) -> Type) (a6989586621680028260 :: a6989586621680027014) | |
Defined in Data.Singletons.Prelude.Maybe type Apply (FromMaybeSym0 :: TyFun a6989586621680027014 (Maybe a6989586621680027014 ~> a6989586621680027014) -> Type) (a6989586621680028260 :: a6989586621680027014) = FromMaybeSym1 a6989586621680028260 | |
| type Apply (Let6989586621680704041MSym0 :: TyFun k1 (TyFun k (Maybe k1) -> Type) -> Type) (x6989586621680704039 :: k1) | |
| type Apply (Let6989586621680704041NSym0 :: TyFun k (TyFun k1 (Maybe k1) -> Type) -> Type) (x6989586621680704039 :: k) | |
| type Apply (Let6989586621680704068MSym0 :: TyFun k1 (TyFun k (Maybe k1) -> Type) -> Type) (x6989586621680704066 :: k1) | |
| type Apply (Let6989586621680704068NSym0 :: TyFun k (TyFun k1 (Maybe k1) -> Type) -> Type) (x6989586621680704066 :: k) | |
| type Apply (LookupSym0 :: TyFun a6989586621680303096 ([(a6989586621680303096, b6989586621680303097)] ~> Maybe b6989586621680303097) -> Type) (a6989586621680312457 :: a6989586621680303096) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (LookupSym0 :: TyFun a6989586621680303096 ([(a6989586621680303096, b6989586621680303097)] ~> Maybe b6989586621680303097) -> Type) (a6989586621680312457 :: a6989586621680303096) = (LookupSym1 a6989586621680312457 b6989586621680303097 :: TyFun [(a6989586621680303096, b6989586621680303097)] (Maybe b6989586621680303097) -> Type) | |
| type Apply (TFHelper_6989586621680030190Sym0 :: TyFun a6989586621679932931 (Maybe b6989586621679932932 ~> Maybe a6989586621679932931) -> Type) (a6989586621680030185 :: a6989586621679932931) | |
Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680030190Sym0 :: TyFun a6989586621679932931 (Maybe b6989586621679932932 ~> Maybe a6989586621679932931) -> Type) (a6989586621680030185 :: a6989586621679932931) = (TFHelper_6989586621680030190Sym1 a6989586621680030185 b6989586621679932932 :: TyFun (Maybe b6989586621679932932) (Maybe a6989586621679932931) -> Type) | |
| type Apply (Maybe_Sym0 :: TyFun b6989586621680023676 ((a6989586621680023677 ~> b6989586621680023676) ~> (Maybe a6989586621680023677 ~> b6989586621680023676)) -> Type) (a6989586621680023698 :: b6989586621680023676) | |
Defined in Data.Singletons.Prelude.Maybe type Apply (Maybe_Sym0 :: TyFun b6989586621680023676 ((a6989586621680023677 ~> b6989586621680023676) ~> (Maybe a6989586621680023677 ~> b6989586621680023676)) -> Type) (a6989586621680023698 :: b6989586621680023676) = (Maybe_Sym1 a6989586621680023698 a6989586621680023677 :: TyFun (a6989586621680023677 ~> b6989586621680023676) (Maybe a6989586621680023677 ~> b6989586621680023676) -> Type) | |
| type Apply (Lambda_6989586621680661289Sym0 :: TyFun k (TyFun (k1 ~> First a) (TyFun k1 (Maybe a) -> Type) -> Type) -> Type) (a6989586621680661287 :: k) | |
Defined in Data.Singletons.Prelude.Monoid | |
| type Apply (Lambda_6989586621680661377Sym0 :: TyFun k (TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type) -> Type) (a6989586621680661375 :: k) | |
Defined in Data.Singletons.Prelude.Monoid | |
| type Apply (Let6989586621680713099MfSym1 f6989586621680713097 :: TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type) (xs6989586621680713098 :: k) | |
| type Apply (Let6989586621680713074MfSym1 f6989586621680713072 :: TyFun k (TyFun k3 (TyFun (Maybe k2) (Maybe k3) -> Type) -> Type) -> Type) (xs6989586621680713073 :: k) | |
| type Apply (Let6989586621680713074MfSym2 xs6989586621680713073 f6989586621680713072 :: TyFun k3 (TyFun (Maybe k2) (Maybe k3) -> Type) -> Type) (a6989586621680713075 :: k3) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (StripPrefixSym0 :: TyFun [a6989586621680429335] ([a6989586621680429335] ~> Maybe [a6989586621680429335]) -> Type) (a6989586621680442045 :: [a6989586621680429335]) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (StripPrefixSym0 :: TyFun [a6989586621680429335] ([a6989586621680429335] ~> Maybe [a6989586621680429335]) -> Type) (a6989586621680442045 :: [a6989586621680429335]) = StripPrefixSym1 a6989586621680442045 | |
| type Apply (TFHelper_6989586621680031551Sym0 :: TyFun (Maybe a6989586621679933013) (Maybe a6989586621679933013 ~> Maybe a6989586621679933013) -> Type) (a6989586621680031548 :: Maybe a6989586621679933013) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| type Apply (Compare_6989586621679829652Sym0 :: TyFun (Maybe a3530822107858468865) (Maybe a3530822107858468865 ~> Ordering) -> Type) (a6989586621679829650 :: Maybe a3530822107858468865) | |
| type Apply (TFHelper_6989586621680030859Sym0 :: TyFun (Maybe (a6989586621679932935 ~> b6989586621679932936)) (Maybe a6989586621679932935 ~> Maybe b6989586621679932936) -> Type) (a6989586621680030857 :: Maybe (a6989586621679932935 ~> b6989586621679932936)) | |
Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680030859Sym0 :: TyFun (Maybe (a6989586621679932935 ~> b6989586621679932936)) (Maybe a6989586621679932935 ~> Maybe b6989586621679932936) -> Type) (a6989586621680030857 :: Maybe (a6989586621679932935 ~> b6989586621679932936)) = TFHelper_6989586621680030859Sym1 a6989586621680030857 | |
| type Apply (TFHelper_6989586621680030923Sym0 :: TyFun (Maybe a6989586621679932940) (Maybe b6989586621679932941 ~> Maybe b6989586621679932941) -> Type) (a6989586621680030921 :: Maybe a6989586621679932940) | |
Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680030923Sym0 :: TyFun (Maybe a6989586621679932940) (Maybe b6989586621679932941 ~> Maybe b6989586621679932941) -> Type) (a6989586621680030921 :: Maybe a6989586621679932940) = (TFHelper_6989586621680030923Sym1 a6989586621680030921 b6989586621679932941 :: TyFun (Maybe b6989586621679932941) (Maybe b6989586621679932941) -> Type) | |
| type Apply (TFHelper_6989586621680031311Sym0 :: TyFun (Maybe a6989586621679932960) (Maybe b6989586621679932961 ~> Maybe b6989586621679932961) -> Type) (a6989586621680031309 :: Maybe a6989586621679932960) | |
Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680031311Sym0 :: TyFun (Maybe a6989586621679932960) (Maybe b6989586621679932961 ~> Maybe b6989586621679932961) -> Type) (a6989586621680031309 :: Maybe a6989586621679932960) = (TFHelper_6989586621680031311Sym1 a6989586621680031309 b6989586621679932961 :: TyFun (Maybe b6989586621679932961) (Maybe b6989586621679932961) -> Type) | |
| type Apply (ShowsPrec_6989586621680595055Sym1 a6989586621680595052 a3530822107858468865 :: TyFun (Maybe a3530822107858468865) (Symbol ~> Symbol) -> Type) (a6989586621680595053 :: Maybe a3530822107858468865) | |
Defined in Data.Singletons.Prelude.Show | |
| type Apply (TFHelper_6989586621680031284Sym0 :: TyFun (Maybe a6989586621679932958) ((a6989586621679932958 ~> Maybe b6989586621679932959) ~> Maybe b6989586621679932959) -> Type) (a6989586621680031282 :: Maybe a6989586621679932958) | |
Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680031284Sym0 :: TyFun (Maybe a6989586621679932958) ((a6989586621679932958 ~> Maybe b6989586621679932959) ~> Maybe b6989586621679932959) -> Type) (a6989586621680031282 :: Maybe a6989586621679932958) = (TFHelper_6989586621680031284Sym1 a6989586621680031282 b6989586621679932959 :: TyFun (a6989586621679932958 ~> Maybe b6989586621679932959) (Maybe b6989586621679932959) -> Type) | |
| type Apply (LiftA2_6989586621680030899Sym1 a6989586621680030895 :: TyFun (Maybe a6989586621679932937) (Maybe b6989586621679932938 ~> Maybe c6989586621679932939) -> Type) (a6989586621680030897 :: Maybe a6989586621679932937) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| type Apply (Let6989586621680713099MfSym2 xs6989586621680713098 f6989586621680713097 :: TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) (a6989586621680713100 :: Maybe k2) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (FindSym0 :: TyFun (a6989586621680303118 ~> Bool) ([a6989586621680303118] ~> Maybe a6989586621680303118) -> Type) (a6989586621680312675 :: a6989586621680303118 ~> Bool) | |
| type Apply (FindIndexSym0 :: TyFun (a6989586621680303115 ~> Bool) ([a6989586621680303115] ~> Maybe Nat) -> Type) (a6989586621680313035 :: a6989586621680303115 ~> Bool) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (MapMaybeSym0 :: TyFun (a6989586621680027008 ~> Maybe b6989586621680027009) ([a6989586621680027008] ~> [b6989586621680027009]) -> Type) (a6989586621680028170 :: a6989586621680027008 ~> Maybe b6989586621680027009) | |
Defined in Data.Singletons.Prelude.Maybe type Apply (MapMaybeSym0 :: TyFun (a6989586621680027008 ~> Maybe b6989586621680027009) ([a6989586621680027008] ~> [b6989586621680027009]) -> Type) (a6989586621680028170 :: a6989586621680027008 ~> Maybe b6989586621680027009) = MapMaybeSym1 a6989586621680028170 | |
| type Apply (Fmap_6989586621680030099Sym0 :: TyFun (a6989586621679932929 ~> b6989586621679932930) (Maybe a6989586621679932929 ~> Maybe b6989586621679932930) -> Type) (a6989586621680030096 :: a6989586621679932929 ~> b6989586621679932930) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| type Apply (UnfoldrSym0 :: TyFun (b6989586621680303174 ~> Maybe (a6989586621680303175, b6989586621680303174)) (b6989586621680303174 ~> [a6989586621680303175]) -> Type) (a6989586621680313108 :: b6989586621680303174 ~> Maybe (a6989586621680303175, b6989586621680303174)) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (UnfoldrSym0 :: TyFun (b6989586621680303174 ~> Maybe (a6989586621680303175, b6989586621680303174)) (b6989586621680303174 ~> [a6989586621680303175]) -> Type) (a6989586621680313108 :: b6989586621680303174 ~> Maybe (a6989586621680303175, b6989586621680303174)) = UnfoldrSym1 a6989586621680313108 | |
| type Apply (FindSym0 :: TyFun (a6989586621680712165 ~> Bool) (t6989586621680712164 a6989586621680712165 ~> Maybe a6989586621680712165) -> Type) (a6989586621680712622 :: a6989586621680712165 ~> Bool) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (FindSym0 :: TyFun (a6989586621680712165 ~> Bool) (t6989586621680712164 a6989586621680712165 ~> Maybe a6989586621680712165) -> Type) (a6989586621680712622 :: a6989586621680712165 ~> Bool) = (FindSym1 a6989586621680712622 t6989586621680712164 :: TyFun (t6989586621680712164 a6989586621680712165) (Maybe a6989586621680712165) -> Type) | |
| type Apply (Let6989586621680028183RsSym0 :: TyFun (a6989586621680027008 ~> Maybe k1) (TyFun k (TyFun [a6989586621680027008] [k1] -> Type) -> Type) -> Type) (f6989586621680028180 :: a6989586621680027008 ~> Maybe k1) | |
Defined in Data.Singletons.Prelude.Maybe type Apply (Let6989586621680028183RsSym0 :: TyFun (a6989586621680027008 ~> Maybe k1) (TyFun k (TyFun [a6989586621680027008] [k1] -> Type) -> Type) -> Type) (f6989586621680028180 :: a6989586621680027008 ~> Maybe k1) = (Let6989586621680028183RsSym1 f6989586621680028180 :: TyFun k (TyFun [a6989586621680027008] [k1] -> Type) -> Type) | |
| type Apply (Let6989586621680713074MfSym0 :: TyFun (k3 ~> (k2 ~> k3)) (TyFun k (TyFun k3 (TyFun (Maybe k2) (Maybe k3) -> Type) -> Type) -> Type) -> Type) (f6989586621680713072 :: k3 ~> (k2 ~> k3)) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680713074MfSym0 :: TyFun (k3 ~> (k2 ~> k3)) (TyFun k (TyFun k3 (TyFun (Maybe k2) (Maybe k3) -> Type) -> Type) -> Type) -> Type) (f6989586621680713072 :: k3 ~> (k2 ~> k3)) = (Let6989586621680713074MfSym1 f6989586621680713072 :: TyFun k (TyFun k3 (TyFun (Maybe k2) (Maybe k3) -> Type) -> Type) -> Type) | |
| type Apply (Let6989586621680713099MfSym0 :: TyFun (k2 ~> (k3 ~> k3)) (TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type) -> Type) (f6989586621680713097 :: k2 ~> (k3 ~> k3)) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680713099MfSym0 :: TyFun (k2 ~> (k3 ~> k3)) (TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type) -> Type) (f6989586621680713097 :: k2 ~> (k3 ~> k3)) = (Let6989586621680713099MfSym1 f6989586621680713097 :: TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type) | |
| type Apply (Traverse_6989586621680957559Sym0 :: TyFun (a6989586621680946430 ~> f6989586621680946429 b6989586621680946431) (Maybe a6989586621680946430 ~> f6989586621680946429 (Maybe b6989586621680946431)) -> Type) (a6989586621680957557 :: a6989586621680946430 ~> f6989586621680946429 b6989586621680946431) | |
Defined in Data.Singletons.Prelude.Traversable type Apply (Traverse_6989586621680957559Sym0 :: TyFun (a6989586621680946430 ~> f6989586621680946429 b6989586621680946431) (Maybe a6989586621680946430 ~> f6989586621680946429 (Maybe b6989586621680946431)) -> Type) (a6989586621680957557 :: a6989586621680946430 ~> f6989586621680946429 b6989586621680946431) = Traverse_6989586621680957559Sym1 a6989586621680957557 | |
| type Apply (Maybe_Sym1 a6989586621680023698 a6989586621680023677 :: TyFun (a6989586621680023677 ~> b6989586621680023676) (Maybe a6989586621680023677 ~> b6989586621680023676) -> Type) (a6989586621680023699 :: a6989586621680023677 ~> b6989586621680023676) | |
Defined in Data.Singletons.Prelude.Maybe type Apply (Maybe_Sym1 a6989586621680023698 a6989586621680023677 :: TyFun (a6989586621680023677 ~> b6989586621680023676) (Maybe a6989586621680023677 ~> b6989586621680023676) -> Type) (a6989586621680023699 :: a6989586621680023677 ~> b6989586621680023676) = Maybe_Sym2 a6989586621680023698 a6989586621680023699 | |
| type Apply (LiftA2_6989586621680030899Sym0 :: TyFun (a6989586621679932937 ~> (b6989586621679932938 ~> c6989586621679932939)) (Maybe a6989586621679932937 ~> (Maybe b6989586621679932938 ~> Maybe c6989586621679932939)) -> Type) (a6989586621680030895 :: a6989586621679932937 ~> (b6989586621679932938 ~> c6989586621679932939)) | |
Defined in Data.Singletons.Prelude.Monad.Internal type Apply (LiftA2_6989586621680030899Sym0 :: TyFun (a6989586621679932937 ~> (b6989586621679932938 ~> c6989586621679932939)) (Maybe a6989586621679932937 ~> (Maybe b6989586621679932938 ~> Maybe c6989586621679932939)) -> Type) (a6989586621680030895 :: a6989586621679932937 ~> (b6989586621679932938 ~> c6989586621679932939)) = LiftA2_6989586621680030899Sym1 a6989586621680030895 | |
| type Apply (Lambda_6989586621680661289Sym1 a6989586621680661287 :: TyFun (k1 ~> First a) (TyFun k1 (Maybe a) -> Type) -> Type) (k6989586621680661288 :: k1 ~> First a) | |
| type Apply (Lambda_6989586621680661377Sym1 a6989586621680661375 :: TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type) (k6989586621680661376 :: k1 ~> Last a) | |
Instances
| Bounded Ordering | Since: base-2.1 |
| Enum Ordering | Since: base-2.1 |
| Eq Ordering | |
| Ord Ordering | |
Defined in GHC.Classes | |
| Read Ordering | Since: base-2.1 |
| Show Ordering | Since: base-2.1 |
| Ix Ordering | Since: base-2.1 |
Defined in GHC.Arr | |
| Generic Ordering | |
| Semigroup Ordering | Since: base-4.9.0.0 |
| Monoid Ordering | Since: base-2.1 |
| NFData Ordering | |
Defined in Control.DeepSeq | |
| Hashable Ordering | |
Defined in Data.Hashable.Class | |
| Default Ordering | |
Defined in Data.Default.Class | |
| PMonoid Ordering | |
| SMonoid Ordering | |
Defined in Data.Singletons.Prelude.Monoid | |
| PShow Ordering | |
| SShow Ordering | |
| PSemigroup Ordering | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| SSemigroup Ordering | |
| PEnum Ordering | |
Defined in Data.Singletons.Prelude.Enum | |
| SEnum Ordering | |
Defined in Data.Singletons.Prelude.Enum Methods sSucc :: Sing t -> Sing (Apply SuccSym0 t) # sPred :: Sing t -> Sing (Apply PredSym0 t) # sToEnum :: Sing t -> Sing (Apply ToEnumSym0 t) # sFromEnum :: Sing t -> Sing (Apply FromEnumSym0 t) # sEnumFromTo :: Sing t1 -> Sing t2 -> Sing (Apply (Apply EnumFromToSym0 t1) t2) # sEnumFromThenTo :: Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply EnumFromThenToSym0 t1) t2) t3) # | |
| PBounded Ordering | |
Defined in Data.Singletons.Prelude.Enum | |
| SBounded Ordering | |
Defined in Data.Singletons.Prelude.Enum | |
| POrd Ordering | |
| SOrd Ordering | |
Defined in Data.Singletons.Prelude.Ord Methods sCompare :: Sing t1 -> Sing t2 -> Sing (Apply (Apply CompareSym0 t1) t2) # (%<) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (<@#@$) t1) t2) # (%<=) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (<=@#@$) t1) t2) # (%>) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (>@#@$) t1) t2) # (%>=) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (>=@#@$) t1) t2) # sMax :: Sing t1 -> Sing t2 -> Sing (Apply (Apply MaxSym0 t1) t2) # sMin :: Sing t1 -> Sing t2 -> Sing (Apply (Apply MinSym0 t1) t2) # | |
| SEq Ordering | |
| PEq Ordering | |
| SuppressUnusedWarnings Compare_6989586621679830166Sym0 | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings FromEnum_6989586621680082331Sym0 | |
Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings ThenCmpSym0 | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings Compare_6989586621679830176Sym0 | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings ToEnum_6989586621680082320Sym0 | |
Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings ShowsPrec_6989586621680595483Sym0 | |
Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings Compare_6989586621679830195Sym0 | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings Compare_6989586621679474059Sym0 Source # | |
Defined in Termonad.Config.Vec Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings Compare_6989586621680201411Sym0 | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings Compare_6989586621680201393Sym0 | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings Compare_6989586621679829775Sym0 | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SingI ThenCmpSym0 | |
Defined in Data.Singletons.Prelude.Ord Methods sing :: Sing ThenCmpSym0 # | |
| SuppressUnusedWarnings (Compare_6989586621679830166Sym1 a6989586621679830164 :: TyFun Bool Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679829686Sym0 :: TyFun [a3530822107858468865] ([a3530822107858468865] ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679829652Sym0 :: TyFun (Maybe a3530822107858468865) (Maybe a3530822107858468865 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ThenCmpSym1 a6989586621679829262 :: TyFun Ordering Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679830176Sym1 a6989586621679830174 :: TyFun Ordering Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621680595483Sym1 a6989586621680595480 :: TyFun Ordering (Symbol ~> Symbol) -> Type) | |
Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679830195Sym1 a6989586621679830193 :: TyFun () Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679474059Sym1 a6989586621679474057 :: TyFun Peano Ordering -> Type) Source # | |
Defined in Termonad.Config.Vec Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679815768Scrutinee_6989586621679815229Sym0 :: TyFun k1 (TyFun k1 Ordering -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679815745Scrutinee_6989586621679815222Sym0 :: TyFun k1 (TyFun k1 Ordering -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679815723Scrutinee_6989586621679815220Sym0 :: TyFun k1 (TyFun k1 Ordering -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679815700Scrutinee_6989586621679815218Sym0 :: TyFun k1 (TyFun k1 Ordering -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679815689Sym0 :: TyFun a6989586621679815165 (a6989586621679815165 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (CompareSym0 :: TyFun a6989586621679815165 (a6989586621679815165 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680201543Sym0 :: TyFun (Last a6989586621679061672) (Last a6989586621679061672 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680201411Sym1 a6989586621680201409 :: TyFun Any Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680201393Sym1 a6989586621680201391 :: TyFun All Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679829775Sym1 a6989586621679829773 :: TyFun Void Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680201480Sym0 :: TyFun (Min a6989586621679061646) (Min a6989586621679061646 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680201501Sym0 :: TyFun (Max a6989586621679061652) (Max a6989586621679061652 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680201522Sym0 :: TyFun (First a6989586621679061666) (First a6989586621679061666 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680201570Sym0 :: TyFun (WrappedMonoid m6989586621679061679) (WrappedMonoid m6989586621679061679 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680201352Sym0 :: TyFun (Option a6989586621679061685) (Option a6989586621679061685 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679830154Sym0 :: TyFun (Identity a6989586621679076664) (Identity a6989586621679076664 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680656831Sym0 :: TyFun (First a6989586621679076674) (First a6989586621679076674 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680656852Sym0 :: TyFun (Last a6989586621679076669) (Last a6989586621679076669 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680201375Sym0 :: TyFun (Dual a6989586621679079717) (Dual a6989586621679079717 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680201432Sym0 :: TyFun (Sum a6989586621679079707) (Sum a6989586621679079707 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680201457Sym0 :: TyFun (Product a6989586621679079712) (Product a6989586621679079712 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679828457Sym0 :: TyFun (Down a6989586621679827814) (Down a6989586621679827814 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679829761Sym0 :: TyFun (NonEmpty a6989586621679076696) (NonEmpty a6989586621679076696 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ListsortBySym0 :: TyFun (a6989586621680565302 ~> (a6989586621680565302 ~> Ordering)) ([a6989586621680565302] ~> [a6989586621680565302]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (SortBySym0 :: TyFun (a6989586621680303123 ~> (a6989586621680303123 ~> Ordering)) ([a6989586621680303123] ~> [a6989586621680303123]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (MinimumBySym0 :: TyFun (a6989586621680303120 ~> (a6989586621680303120 ~> Ordering)) ([a6989586621680303120] ~> a6989586621680303120) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (MaximumBySym0 :: TyFun (a6989586621680303121 ~> (a6989586621680303121 ~> Ordering)) ([a6989586621680303121] ~> a6989586621680303121) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (InsertBySym0 :: TyFun (a6989586621680303122 ~> (a6989586621680303122 ~> Ordering)) (a6989586621680303122 ~> ([a6989586621680303122] ~> [a6989586621680303122])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SingI d => SingI (ThenCmpSym1 d :: TyFun Ordering Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods sing :: Sing (ThenCmpSym1 d) # | |
| SOrd a => SingI (CompareSym0 :: TyFun a (a ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods sing :: Sing CompareSym0 # | |
| SingI (ListsortBySym0 :: TyFun (a ~> (a ~> Ordering)) ([a] ~> [a]) -> Type) | |
| SingI (SortBySym0 :: TyFun (a ~> (a ~> Ordering)) ([a] ~> [a]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing SortBySym0 # | |
| SingI (MinimumBySym0 :: TyFun (a ~> (a ~> Ordering)) ([a] ~> a) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| SingI (MaximumBySym0 :: TyFun (a ~> (a ~> Ordering)) ([a] ~> a) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| SingI (InsertBySym0 :: TyFun (a ~> (a ~> Ordering)) (a ~> ([a] ~> [a])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing InsertBySym0 # | |
| SuppressUnusedWarnings (Compare_6989586621679829686Sym1 a6989586621679829684 :: TyFun [a3530822107858468865] Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679829652Sym1 a6989586621679829650 :: TyFun (Maybe a3530822107858468865) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679829732Sym0 :: TyFun (Either a6989586621679076523 b6989586621679076524) (Either a6989586621679076523 b6989586621679076524 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679829803Sym0 :: TyFun (a3530822107858468865, b3530822107858468866) ((a3530822107858468865, b3530822107858468866) ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679815768Scrutinee_6989586621679815229Sym1 x6989586621679815765 :: TyFun k1 Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679815745Scrutinee_6989586621679815222Sym1 x6989586621679815743 :: TyFun k1 Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679815723Scrutinee_6989586621679815220Sym1 x6989586621679815721 :: TyFun k1 Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679815700Scrutinee_6989586621679815218Sym1 x6989586621679815698 :: TyFun k1 Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679815689Sym1 a6989586621679815686 :: TyFun a6989586621679815165 Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (CompareSym1 arg6989586621679815628 :: TyFun a6989586621679815165 Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680201543Sym1 a6989586621680201541 :: TyFun (Last a6989586621679061672) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680201480Sym1 a6989586621680201478 :: TyFun (Min a6989586621679061646) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680201501Sym1 a6989586621680201499 :: TyFun (Max a6989586621679061652) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621681105311Sym0 :: TyFun (Arg a6989586621681093759 b6989586621681093760) (Arg a6989586621681093759 b6989586621681093760 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680201522Sym1 a6989586621680201520 :: TyFun (First a6989586621679061666) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680201570Sym1 a6989586621680201568 :: TyFun (WrappedMonoid m6989586621679061679) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680201352Sym1 a6989586621680201350 :: TyFun (Option a6989586621679061685) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679830154Sym1 a6989586621679830152 :: TyFun (Identity a6989586621679076664) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680656831Sym1 a6989586621680656829 :: TyFun (First a6989586621679076674) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680656852Sym1 a6989586621680656850 :: TyFun (Last a6989586621679076669) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680201375Sym1 a6989586621680201373 :: TyFun (Dual a6989586621679079717) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680201432Sym1 a6989586621680201430 :: TyFun (Sum a6989586621679079707) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680201457Sym1 a6989586621680201455 :: TyFun (Product a6989586621679079712) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679828457Sym1 a6989586621679828455 :: TyFun (Down a6989586621679827814) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679829761Sym1 a6989586621679829759 :: TyFun (NonEmpty a6989586621679076696) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (MinimumBySym0 :: TyFun (a6989586621680712169 ~> (a6989586621680712169 ~> Ordering)) (t6989586621680712168 a6989586621680712169 ~> a6989586621680712169) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (MaximumBySym0 :: TyFun (a6989586621680712171 ~> (a6989586621680712171 ~> Ordering)) (t6989586621680712170 a6989586621680712171 ~> a6989586621680712171) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680712690Max'Sym0 :: TyFun (k2 ~> (k2 ~> Ordering)) (TyFun k1 (TyFun k2 (TyFun k2 k2 -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680712665Min'Sym0 :: TyFun (k2 ~> (k2 ~> Ordering)) (TyFun k1 (TyFun k2 (TyFun k2 k2 -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ComparingSym0 :: TyFun (b6989586621679815152 ~> a6989586621679815151) (b6989586621679815152 ~> (b6989586621679815152 ~> Ordering)) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| (SOrd a, SingI d) => SingI (CompareSym1 d :: TyFun a Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods sing :: Sing (CompareSym1 d) # | |
| SFoldable t => SingI (MinimumBySym0 :: TyFun (a ~> (a ~> Ordering)) (t a ~> a) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods sing :: Sing MinimumBySym0 # | |
| SFoldable t => SingI (MaximumBySym0 :: TyFun (a ~> (a ~> Ordering)) (t a ~> a) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods sing :: Sing MaximumBySym0 # | |
| SOrd a => SingI (ComparingSym0 :: TyFun (b ~> a) (b ~> (b ~> Ordering)) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods sing :: Sing ComparingSym0 # | |
| SuppressUnusedWarnings (Compare_6989586621679829732Sym1 a6989586621679829730 :: TyFun (Either a6989586621679076523 b6989586621679076524) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679829803Sym1 a6989586621679829801 :: TyFun (a3530822107858468865, b3530822107858468866) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679829846Sym0 :: TyFun (a3530822107858468865, b3530822107858468866, c3530822107858468867) ((a3530822107858468865, b3530822107858468866, c3530822107858468867) ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ComparingSym1 a6989586621679815615 :: TyFun b6989586621679815152 (b6989586621679815152 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621681105311Sym1 a6989586621681105309 :: TyFun (Arg a6989586621681093759 b6989586621681093760) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680885036Sym0 :: TyFun (Const a6989586621680882755 b6989586621680882756) (Const a6989586621680882755 b6989586621680882756 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Const Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680313461MinBySym0 :: TyFun (k3 ~> (k3 ~> Ordering)) (TyFun k1 (TyFun k2 (TyFun k3 (TyFun k3 k3 -> Type) -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680313431MaxBySym0 :: TyFun (k3 ~> (k3 ~> Ordering)) (TyFun k1 (TyFun k2 (TyFun k3 (TyFun k3 k3 -> Type) -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| (SOrd a, SingI d) => SingI (ComparingSym1 d :: TyFun b (b ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods sing :: Sing (ComparingSym1 d) # | |
| SuppressUnusedWarnings (Compare_6989586621679829846Sym1 a6989586621679829844 :: TyFun (a3530822107858468865, b3530822107858468866, c3530822107858468867) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679829899Sym0 :: TyFun (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868) ((a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868) ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ComparingSym2 a6989586621679815616 a6989586621679815615 :: TyFun b6989586621679815152 Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680885036Sym1 a6989586621680885034 :: TyFun (Const a6989586621680882755 b6989586621680882756) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Const Methods suppressUnusedWarnings :: () # | |
| (SOrd a, SingI d1, SingI d2) => SingI (ComparingSym2 d1 d2 :: TyFun b Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods sing :: Sing (ComparingSym2 d1 d2) # | |
| SuppressUnusedWarnings (Compare_6989586621679829899Sym1 a6989586621679829897 :: TyFun (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679829962Sym0 :: TyFun (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869) ((a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869) ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679829962Sym1 a6989586621679829960 :: TyFun (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679830036Sym0 :: TyFun (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869, f3530822107858468870) ((a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869, f3530822107858468870) ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679830036Sym1 a6989586621679830034 :: TyFun (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869, f3530822107858468870) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679830121Sym0 :: TyFun (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869, f3530822107858468870, g3530822107858468871) ((a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869, f3530822107858468870, g3530822107858468871) ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679830121Sym1 a6989586621679830119 :: TyFun (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869, f3530822107858468870, g3530822107858468871) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| type Rep Ordering | Since: base-4.6.0.0 |
| type Mempty | |
Defined in Data.Singletons.Prelude.Monoid | |
| type MaxBound | |
Defined in Data.Singletons.Prelude.Enum type MaxBound = MaxBound_6989586621680024524Sym0 | |
| type MinBound | |
Defined in Data.Singletons.Prelude.Enum type MinBound = MinBound_6989586621680024510Sym0 | |
| data Sing (a :: Ordering) | |
| type Demote Ordering | |
Defined in Data.Singletons.Prelude.Instances | |
| type Mconcat (arg :: [Ordering]) | |
| type Show_ (arg :: Ordering) | |
| type Sconcat (arg :: NonEmpty Ordering) | |
| type FromEnum (a :: Ordering) | |
Defined in Data.Singletons.Prelude.Enum | |
| type ToEnum a | |
Defined in Data.Singletons.Prelude.Enum | |
| type Pred (arg :: Ordering) | |
| type Succ (arg :: Ordering) | |
| type Mappend (arg1 :: Ordering) (arg2 :: Ordering) | |
| type ShowList (arg1 :: [Ordering]) arg2 | |
| type (a1 :: Ordering) <> (a2 :: Ordering) | |
| type EnumFromTo (arg1 :: Ordering) (arg2 :: Ordering) | |
| type Min (arg1 :: Ordering) (arg2 :: Ordering) | |
| type Max (arg1 :: Ordering) (arg2 :: Ordering) | |
| type (arg1 :: Ordering) >= (arg2 :: Ordering) | |
| type (arg1 :: Ordering) > (arg2 :: Ordering) | |
| type (arg1 :: Ordering) <= (arg2 :: Ordering) | |
| type (arg1 :: Ordering) < (arg2 :: Ordering) | |
| type Compare (a1 :: Ordering) (a2 :: Ordering) | |
| type (x :: Ordering) /= (y :: Ordering) | |
| type (a :: Ordering) == (b :: Ordering) | |
Defined in Data.Singletons.Prelude.Eq | |
| type ShowsPrec a1 (a2 :: Ordering) a3 | |
| type EnumFromThenTo (arg1 :: Ordering) (arg2 :: Ordering) (arg3 :: Ordering) | |
| type Apply ToEnum_6989586621680082320Sym0 (a6989586621680082319 :: Nat) | |
Defined in Data.Singletons.Prelude.Enum | |
| type Apply FromEnum_6989586621680082331Sym0 (a6989586621680082329 :: Ordering) | |
Defined in Data.Singletons.Prelude.Enum | |
| type Apply (Compare_6989586621679830166Sym1 a6989586621679830164 :: TyFun Bool Ordering -> Type) (a6989586621679830165 :: Bool) | |
| type Apply (ThenCmpSym1 a6989586621679829262 :: TyFun Ordering Ordering -> Type) (a6989586621679829263 :: Ordering) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (Compare_6989586621679830176Sym1 a6989586621679830174 :: TyFun Ordering Ordering -> Type) (a6989586621679830175 :: Ordering) | |
| type Apply (Compare_6989586621679830195Sym1 a6989586621679830193 :: TyFun () Ordering -> Type) (a6989586621679830194 :: ()) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (Compare_6989586621679474059Sym1 a6989586621679474057 :: TyFun Peano Ordering -> Type) (a6989586621679474058 :: Peano) Source # | |
Defined in Termonad.Config.Vec type Apply (Compare_6989586621679474059Sym1 a6989586621679474057 :: TyFun Peano Ordering -> Type) (a6989586621679474058 :: Peano) = Compare_6989586621679474059 a6989586621679474057 a6989586621679474058 | |
| type Apply (Compare_6989586621680201411Sym1 a6989586621680201409 :: TyFun Any Ordering -> Type) (a6989586621680201410 :: Any) | |
| type Apply (Compare_6989586621680201393Sym1 a6989586621680201391 :: TyFun All Ordering -> Type) (a6989586621680201392 :: All) | |
| type Apply (Compare_6989586621679829775Sym1 a6989586621679829773 :: TyFun Void Ordering -> Type) (a6989586621679829774 :: Void) | |
| type Apply (CompareSym1 arg6989586621679815628 :: TyFun a Ordering -> Type) (arg6989586621679815629 :: a) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (Compare_6989586621679815689Sym1 a6989586621679815686 :: TyFun a Ordering -> Type) (a6989586621679815687 :: a) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (Let6989586621679815768Scrutinee_6989586621679815229Sym1 x6989586621679815765 :: TyFun k1 Ordering -> Type) (y6989586621679815766 :: k1) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (Let6989586621679815745Scrutinee_6989586621679815222Sym1 x6989586621679815743 :: TyFun k1 Ordering -> Type) (y6989586621679815744 :: k1) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (Let6989586621679815723Scrutinee_6989586621679815220Sym1 x6989586621679815721 :: TyFun k1 Ordering -> Type) (y6989586621679815722 :: k1) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (Let6989586621679815700Scrutinee_6989586621679815218Sym1 x6989586621679815698 :: TyFun k1 Ordering -> Type) (y6989586621679815699 :: k1) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (ComparingSym2 a6989586621679815616 a6989586621679815615 :: TyFun b Ordering -> Type) (a6989586621679815617 :: b) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (Compare_6989586621679829686Sym1 a6989586621679829684 :: TyFun [a] Ordering -> Type) (a6989586621679829685 :: [a]) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (Compare_6989586621679829652Sym1 a6989586621679829650 :: TyFun (Maybe a) Ordering -> Type) (a6989586621679829651 :: Maybe a) | |
| type Apply (Compare_6989586621680201543Sym1 a6989586621680201541 :: TyFun (Last a) Ordering -> Type) (a6989586621680201542 :: Last a) | |
| type Apply (Compare_6989586621680201480Sym1 a6989586621680201478 :: TyFun (Min a) Ordering -> Type) (a6989586621680201479 :: Min a) | |
| type Apply (Compare_6989586621680201501Sym1 a6989586621680201499 :: TyFun (Max a) Ordering -> Type) (a6989586621680201500 :: Max a) | |
| type Apply (Compare_6989586621680201522Sym1 a6989586621680201520 :: TyFun (First a) Ordering -> Type) (a6989586621680201521 :: First a) | |
| type Apply (Compare_6989586621680201570Sym1 a6989586621680201568 :: TyFun (WrappedMonoid m) Ordering -> Type) (a6989586621680201569 :: WrappedMonoid m) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply (Compare_6989586621680201570Sym1 a6989586621680201568 :: TyFun (WrappedMonoid m) Ordering -> Type) (a6989586621680201569 :: WrappedMonoid m) = Compare_6989586621680201570 a6989586621680201568 a6989586621680201569 | |
| type Apply (Compare_6989586621680201352Sym1 a6989586621680201350 :: TyFun (Option a) Ordering -> Type) (a6989586621680201351 :: Option a) | |
| type Apply (Compare_6989586621679830154Sym1 a6989586621679830152 :: TyFun (Identity a) Ordering -> Type) (a6989586621679830153 :: Identity a) | |
| type Apply (Compare_6989586621680656831Sym1 a6989586621680656829 :: TyFun (First a) Ordering -> Type) (a6989586621680656830 :: First a) | |
| type Apply (Compare_6989586621680656852Sym1 a6989586621680656850 :: TyFun (Last a) Ordering -> Type) (a6989586621680656851 :: Last a) | |
| type Apply (Compare_6989586621680201375Sym1 a6989586621680201373 :: TyFun (Dual a) Ordering -> Type) (a6989586621680201374 :: Dual a) | |
| type Apply (Compare_6989586621680201432Sym1 a6989586621680201430 :: TyFun (Sum a) Ordering -> Type) (a6989586621680201431 :: Sum a) | |
| type Apply (Compare_6989586621680201457Sym1 a6989586621680201455 :: TyFun (Product a) Ordering -> Type) (a6989586621680201456 :: Product a) | |
| type Apply (Compare_6989586621679828457Sym1 a6989586621679828455 :: TyFun (Down a) Ordering -> Type) (a6989586621679828456 :: Down a) | |
| type Apply (Compare_6989586621679829761Sym1 a6989586621679829759 :: TyFun (NonEmpty a) Ordering -> Type) (a6989586621679829760 :: NonEmpty a) | |
| type Apply (Compare_6989586621679829732Sym1 a6989586621679829730 :: TyFun (Either a b) Ordering -> Type) (a6989586621679829731 :: Either a b) | |
| type Apply (Compare_6989586621679829803Sym1 a6989586621679829801 :: TyFun (a, b) Ordering -> Type) (a6989586621679829802 :: (a, b)) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (Compare_6989586621681105311Sym1 a6989586621681105309 :: TyFun (Arg a b) Ordering -> Type) (a6989586621681105310 :: Arg a b) | |
| type Apply (Compare_6989586621679829846Sym1 a6989586621679829844 :: TyFun (a, b, c) Ordering -> Type) (a6989586621679829845 :: (a, b, c)) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (Compare_6989586621680885036Sym1 a6989586621680885034 :: TyFun (Const a b) Ordering -> Type) (a6989586621680885035 :: Const a b) | |
| type Apply (Compare_6989586621679829899Sym1 a6989586621679829897 :: TyFun (a, b, c, d) Ordering -> Type) (a6989586621679829898 :: (a, b, c, d)) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (Compare_6989586621679829962Sym1 a6989586621679829960 :: TyFun (a, b, c, d, e) Ordering -> Type) (a6989586621679829961 :: (a, b, c, d, e)) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (Compare_6989586621679830036Sym1 a6989586621679830034 :: TyFun (a, b, c, d, e, f) Ordering -> Type) (a6989586621679830035 :: (a, b, c, d, e, f)) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (Compare_6989586621679830121Sym1 a6989586621679830119 :: TyFun (a, b, c, d, e, f, g) Ordering -> Type) (a6989586621679830120 :: (a, b, c, d, e, f, g)) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply Compare_6989586621679830166Sym0 (a6989586621679830164 :: Bool) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply ThenCmpSym0 (a6989586621679829262 :: Ordering) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply Compare_6989586621679830176Sym0 (a6989586621679830174 :: Ordering) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply ShowsPrec_6989586621680595483Sym0 (a6989586621680595480 :: Nat) | |
Defined in Data.Singletons.Prelude.Show | |
| type Apply Compare_6989586621679830195Sym0 (a6989586621679830193 :: ()) | |
Defined in Data.Singletons.Prelude.Ord type Apply Compare_6989586621679830195Sym0 (a6989586621679830193 :: ()) = Compare_6989586621679830195Sym1 a6989586621679830193 | |
| type Apply Compare_6989586621679474059Sym0 (a6989586621679474057 :: Peano) Source # | |
Defined in Termonad.Config.Vec type Apply Compare_6989586621679474059Sym0 (a6989586621679474057 :: Peano) = Compare_6989586621679474059Sym1 a6989586621679474057 | |
| type Apply Compare_6989586621680201411Sym0 (a6989586621680201409 :: Any) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Apply Compare_6989586621680201393Sym0 (a6989586621680201391 :: All) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Apply Compare_6989586621679829775Sym0 (a6989586621679829773 :: Void) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (Let6989586621679815768Scrutinee_6989586621679815229Sym0 :: TyFun k1 (TyFun k1 Ordering -> Type) -> Type) (x6989586621679815765 :: k1) | |
| type Apply (Let6989586621679815745Scrutinee_6989586621679815222Sym0 :: TyFun k1 (TyFun k1 Ordering -> Type) -> Type) (x6989586621679815743 :: k1) | |
| type Apply (Let6989586621679815723Scrutinee_6989586621679815220Sym0 :: TyFun k1 (TyFun k1 Ordering -> Type) -> Type) (x6989586621679815721 :: k1) | |
| type Apply (Let6989586621679815700Scrutinee_6989586621679815218Sym0 :: TyFun k1 (TyFun k1 Ordering -> Type) -> Type) (x6989586621679815698 :: k1) | |
| type Apply (ShowsPrec_6989586621680595483Sym1 a6989586621680595480 :: TyFun Ordering (Symbol ~> Symbol) -> Type) (a6989586621680595481 :: Ordering) | |
| type Apply (CompareSym0 :: TyFun a6989586621679815165 (a6989586621679815165 ~> Ordering) -> Type) (arg6989586621679815628 :: a6989586621679815165) | |
Defined in Data.Singletons.Prelude.Ord type Apply (CompareSym0 :: TyFun a6989586621679815165 (a6989586621679815165 ~> Ordering) -> Type) (arg6989586621679815628 :: a6989586621679815165) = CompareSym1 arg6989586621679815628 | |
| type Apply (Compare_6989586621679815689Sym0 :: TyFun a6989586621679815165 (a6989586621679815165 ~> Ordering) -> Type) (a6989586621679815686 :: a6989586621679815165) | |
| type Apply (ComparingSym1 a6989586621679815615 :: TyFun b6989586621679815152 (b6989586621679815152 ~> Ordering) -> Type) (a6989586621679815616 :: b6989586621679815152) | |
Defined in Data.Singletons.Prelude.Ord type Apply (ComparingSym1 a6989586621679815615 :: TyFun b6989586621679815152 (b6989586621679815152 ~> Ordering) -> Type) (a6989586621679815616 :: b6989586621679815152) = ComparingSym2 a6989586621679815615 a6989586621679815616 | |
| type Apply (Compare_6989586621679829686Sym0 :: TyFun [a3530822107858468865] ([a3530822107858468865] ~> Ordering) -> Type) (a6989586621679829684 :: [a3530822107858468865]) | |
| type Apply (Compare_6989586621679829652Sym0 :: TyFun (Maybe a3530822107858468865) (Maybe a3530822107858468865 ~> Ordering) -> Type) (a6989586621679829650 :: Maybe a3530822107858468865) | |
| type Apply (Compare_6989586621680201543Sym0 :: TyFun (Last a6989586621679061672) (Last a6989586621679061672 ~> Ordering) -> Type) (a6989586621680201541 :: Last a6989586621679061672) | |
| type Apply (Compare_6989586621680201480Sym0 :: TyFun (Min a6989586621679061646) (Min a6989586621679061646 ~> Ordering) -> Type) (a6989586621680201478 :: Min a6989586621679061646) | |
| type Apply (Compare_6989586621680201501Sym0 :: TyFun (Max a6989586621679061652) (Max a6989586621679061652 ~> Ordering) -> Type) (a6989586621680201499 :: Max a6989586621679061652) | |
| type Apply (Compare_6989586621680201522Sym0 :: TyFun (First a6989586621679061666) (First a6989586621679061666 ~> Ordering) -> Type) (a6989586621680201520 :: First a6989586621679061666) | |
| type Apply (Compare_6989586621680201570Sym0 :: TyFun (WrappedMonoid m6989586621679061679) (WrappedMonoid m6989586621679061679 ~> Ordering) -> Type) (a6989586621680201568 :: WrappedMonoid m6989586621679061679) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply (Compare_6989586621680201570Sym0 :: TyFun (WrappedMonoid m6989586621679061679) (WrappedMonoid m6989586621679061679 ~> Ordering) -> Type) (a6989586621680201568 :: WrappedMonoid m6989586621679061679) = Compare_6989586621680201570Sym1 a6989586621680201568 | |
| type Apply (Compare_6989586621680201352Sym0 :: TyFun (Option a6989586621679061685) (Option a6989586621679061685 ~> Ordering) -> Type) (a6989586621680201350 :: Option a6989586621679061685) | |
| type Apply (Compare_6989586621679830154Sym0 :: TyFun (Identity a6989586621679076664) (Identity a6989586621679076664 ~> Ordering) -> Type) (a6989586621679830152 :: Identity a6989586621679076664) | |
| type Apply (Compare_6989586621680656831Sym0 :: TyFun (First a6989586621679076674) (First a6989586621679076674 ~> Ordering) -> Type) (a6989586621680656829 :: First a6989586621679076674) | |
| type Apply (Compare_6989586621680656852Sym0 :: TyFun (Last a6989586621679076669) (Last a6989586621679076669 ~> Ordering) -> Type) (a6989586621680656850 :: Last a6989586621679076669) | |
| type Apply (Compare_6989586621680201375Sym0 :: TyFun (Dual a6989586621679079717) (Dual a6989586621679079717 ~> Ordering) -> Type) (a6989586621680201373 :: Dual a6989586621679079717) | |
| type Apply (Compare_6989586621680201432Sym0 :: TyFun (Sum a6989586621679079707) (Sum a6989586621679079707 ~> Ordering) -> Type) (a6989586621680201430 :: Sum a6989586621679079707) | |
| type Apply (Compare_6989586621680201457Sym0 :: TyFun (Product a6989586621679079712) (Product a6989586621679079712 ~> Ordering) -> Type) (a6989586621680201455 :: Product a6989586621679079712) | |
| type Apply (Compare_6989586621679828457Sym0 :: TyFun (Down a6989586621679827814) (Down a6989586621679827814 ~> Ordering) -> Type) (a6989586621679828455 :: Down a6989586621679827814) | |
| type Apply (Compare_6989586621679829761Sym0 :: TyFun (NonEmpty a6989586621679076696) (NonEmpty a6989586621679076696 ~> Ordering) -> Type) (a6989586621679829759 :: NonEmpty a6989586621679076696) | |
| type Apply (ListsortBySym0 :: TyFun (a6989586621680565302 ~> (a6989586621680565302 ~> Ordering)) ([a6989586621680565302] ~> [a6989586621680565302]) -> Type) (a6989586621680568498 :: a6989586621680565302 ~> (a6989586621680565302 ~> Ordering)) | |
| type Apply (SortBySym0 :: TyFun (a6989586621680303123 ~> (a6989586621680303123 ~> Ordering)) ([a6989586621680303123] ~> [a6989586621680303123]) -> Type) (a6989586621680312713 :: a6989586621680303123 ~> (a6989586621680303123 ~> Ordering)) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (MaximumBySym0 :: TyFun (a6989586621680303121 ~> (a6989586621680303121 ~> Ordering)) ([a6989586621680303121] ~> a6989586621680303121) -> Type) (a6989586621680313420 :: a6989586621680303121 ~> (a6989586621680303121 ~> Ordering)) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (MinimumBySym0 :: TyFun (a6989586621680303120 ~> (a6989586621680303120 ~> Ordering)) ([a6989586621680303120] ~> a6989586621680303120) -> Type) (a6989586621680313450 :: a6989586621680303120 ~> (a6989586621680303120 ~> Ordering)) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (InsertBySym0 :: TyFun (a6989586621680303122 ~> (a6989586621680303122 ~> Ordering)) (a6989586621680303122 ~> ([a6989586621680303122] ~> [a6989586621680303122])) -> Type) (a6989586621680312683 :: a6989586621680303122 ~> (a6989586621680303122 ~> Ordering)) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (InsertBySym0 :: TyFun (a6989586621680303122 ~> (a6989586621680303122 ~> Ordering)) (a6989586621680303122 ~> ([a6989586621680303122] ~> [a6989586621680303122])) -> Type) (a6989586621680312683 :: a6989586621680303122 ~> (a6989586621680303122 ~> Ordering)) = InsertBySym1 a6989586621680312683 | |
| type Apply (Let6989586621680712665Min'Sym0 :: TyFun (k1 ~> (k1 ~> Ordering)) (TyFun k2 (TyFun k1 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type) (cmp6989586621680712663 :: k1 ~> (k1 ~> Ordering)) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680712665Min'Sym0 :: TyFun (k1 ~> (k1 ~> Ordering)) (TyFun k2 (TyFun k1 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type) (cmp6989586621680712663 :: k1 ~> (k1 ~> Ordering)) = (Let6989586621680712665Min'Sym1 cmp6989586621680712663 :: TyFun k2 (TyFun k1 (TyFun k1 k1 -> Type) -> Type) -> Type) | |
| type Apply (Let6989586621680712690Max'Sym0 :: TyFun (k1 ~> (k1 ~> Ordering)) (TyFun k2 (TyFun k1 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type) (cmp6989586621680712688 :: k1 ~> (k1 ~> Ordering)) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680712690Max'Sym0 :: TyFun (k1 ~> (k1 ~> Ordering)) (TyFun k2 (TyFun k1 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type) (cmp6989586621680712688 :: k1 ~> (k1 ~> Ordering)) = (Let6989586621680712690Max'Sym1 cmp6989586621680712688 :: TyFun k2 (TyFun k1 (TyFun k1 k1 -> Type) -> Type) -> Type) | |
| type Apply (Compare_6989586621679829732Sym0 :: TyFun (Either a6989586621679076523 b6989586621679076524) (Either a6989586621679076523 b6989586621679076524 ~> Ordering) -> Type) (a6989586621679829730 :: Either a6989586621679076523 b6989586621679076524) | |
Defined in Data.Singletons.Prelude.Ord type Apply (Compare_6989586621679829732Sym0 :: TyFun (Either a6989586621679076523 b6989586621679076524) (Either a6989586621679076523 b6989586621679076524 ~> Ordering) -> Type) (a6989586621679829730 :: Either a6989586621679076523 b6989586621679076524) = Compare_6989586621679829732Sym1 a6989586621679829730 | |
| type Apply (Compare_6989586621679829803Sym0 :: TyFun (a3530822107858468865, b3530822107858468866) ((a3530822107858468865, b3530822107858468866) ~> Ordering) -> Type) (a6989586621679829801 :: (a3530822107858468865, b3530822107858468866)) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (MaximumBySym0 :: TyFun (a6989586621680712171 ~> (a6989586621680712171 ~> Ordering)) (t6989586621680712170 a6989586621680712171 ~> a6989586621680712171) -> Type) (a6989586621680712682 :: a6989586621680712171 ~> (a6989586621680712171 ~> Ordering)) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (MaximumBySym0 :: TyFun (a6989586621680712171 ~> (a6989586621680712171 ~> Ordering)) (t6989586621680712170 a6989586621680712171 ~> a6989586621680712171) -> Type) (a6989586621680712682 :: a6989586621680712171 ~> (a6989586621680712171 ~> Ordering)) = (MaximumBySym1 a6989586621680712682 t6989586621680712170 :: TyFun (t6989586621680712170 a6989586621680712171) a6989586621680712171 -> Type) | |
| type Apply (MinimumBySym0 :: TyFun (a6989586621680712169 ~> (a6989586621680712169 ~> Ordering)) (t6989586621680712168 a6989586621680712169 ~> a6989586621680712169) -> Type) (a6989586621680712657 :: a6989586621680712169 ~> (a6989586621680712169 ~> Ordering)) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (MinimumBySym0 :: TyFun (a6989586621680712169 ~> (a6989586621680712169 ~> Ordering)) (t6989586621680712168 a6989586621680712169 ~> a6989586621680712169) -> Type) (a6989586621680712657 :: a6989586621680712169 ~> (a6989586621680712169 ~> Ordering)) = (MinimumBySym1 a6989586621680712657 t6989586621680712168 :: TyFun (t6989586621680712168 a6989586621680712169) a6989586621680712169 -> Type) | |
| type Apply (ComparingSym0 :: TyFun (b6989586621679815152 ~> a6989586621679815151) (b6989586621679815152 ~> (b6989586621679815152 ~> Ordering)) -> Type) (a6989586621679815615 :: b6989586621679815152 ~> a6989586621679815151) | |
Defined in Data.Singletons.Prelude.Ord type Apply (ComparingSym0 :: TyFun (b6989586621679815152 ~> a6989586621679815151) (b6989586621679815152 ~> (b6989586621679815152 ~> Ordering)) -> Type) (a6989586621679815615 :: b6989586621679815152 ~> a6989586621679815151) = ComparingSym1 a6989586621679815615 | |
| type Apply (Compare_6989586621681105311Sym0 :: TyFun (Arg a6989586621681093759 b6989586621681093760) (Arg a6989586621681093759 b6989586621681093760 ~> Ordering) -> Type) (a6989586621681105309 :: Arg a6989586621681093759 b6989586621681093760) | |
Defined in Data.Singletons.Prelude.Semigroup | |
| type Apply (Let6989586621680313431MaxBySym0 :: TyFun (k1 ~> (k1 ~> Ordering)) (TyFun k2 (TyFun k3 (TyFun k1 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type) -> Type) (cmp6989586621680313424 :: k1 ~> (k1 ~> Ordering)) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680313431MaxBySym0 :: TyFun (k1 ~> (k1 ~> Ordering)) (TyFun k2 (TyFun k3 (TyFun k1 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type) -> Type) (cmp6989586621680313424 :: k1 ~> (k1 ~> Ordering)) = (Let6989586621680313431MaxBySym1 cmp6989586621680313424 :: TyFun k2 (TyFun k3 (TyFun k1 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type) | |
| type Apply (Let6989586621680313461MinBySym0 :: TyFun (k1 ~> (k1 ~> Ordering)) (TyFun k2 (TyFun k3 (TyFun k1 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type) -> Type) (cmp6989586621680313454 :: k1 ~> (k1 ~> Ordering)) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680313461MinBySym0 :: TyFun (k1 ~> (k1 ~> Ordering)) (TyFun k2 (TyFun k3 (TyFun k1 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type) -> Type) (cmp6989586621680313454 :: k1 ~> (k1 ~> Ordering)) = (Let6989586621680313461MinBySym1 cmp6989586621680313454 :: TyFun k2 (TyFun k3 (TyFun k1 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type) | |
| type Apply (Compare_6989586621679829846Sym0 :: TyFun (a3530822107858468865, b3530822107858468866, c3530822107858468867) ((a3530822107858468865, b3530822107858468866, c3530822107858468867) ~> Ordering) -> Type) (a6989586621679829844 :: (a3530822107858468865, b3530822107858468866, c3530822107858468867)) | |
Defined in Data.Singletons.Prelude.Ord type Apply (Compare_6989586621679829846Sym0 :: TyFun (a3530822107858468865, b3530822107858468866, c3530822107858468867) ((a3530822107858468865, b3530822107858468866, c3530822107858468867) ~> Ordering) -> Type) (a6989586621679829844 :: (a3530822107858468865, b3530822107858468866, c3530822107858468867)) = Compare_6989586621679829846Sym1 a6989586621679829844 | |
| type Apply (Compare_6989586621680885036Sym0 :: TyFun (Const a6989586621680882755 b6989586621680882756) (Const a6989586621680882755 b6989586621680882756 ~> Ordering) -> Type) (a6989586621680885034 :: Const a6989586621680882755 b6989586621680882756) | |
Defined in Data.Singletons.Prelude.Const type Apply (Compare_6989586621680885036Sym0 :: TyFun (Const a6989586621680882755 b6989586621680882756) (Const a6989586621680882755 b6989586621680882756 ~> Ordering) -> Type) (a6989586621680885034 :: Const a6989586621680882755 b6989586621680882756) = Compare_6989586621680885036Sym1 a6989586621680885034 | |
| type Apply (Compare_6989586621679829899Sym0 :: TyFun (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868) ((a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868) ~> Ordering) -> Type) (a6989586621679829897 :: (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868)) | |
Defined in Data.Singletons.Prelude.Ord type Apply (Compare_6989586621679829899Sym0 :: TyFun (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868) ((a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868) ~> Ordering) -> Type) (a6989586621679829897 :: (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868)) = Compare_6989586621679829899Sym1 a6989586621679829897 | |
| type Apply (Compare_6989586621679829962Sym0 :: TyFun (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869) ((a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869) ~> Ordering) -> Type) (a6989586621679829960 :: (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869)) | |
Defined in Data.Singletons.Prelude.Ord type Apply (Compare_6989586621679829962Sym0 :: TyFun (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869) ((a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869) ~> Ordering) -> Type) (a6989586621679829960 :: (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869)) = Compare_6989586621679829962Sym1 a6989586621679829960 | |
| type Apply (Compare_6989586621679830036Sym0 :: TyFun (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869, f3530822107858468870) ((a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869, f3530822107858468870) ~> Ordering) -> Type) (a6989586621679830034 :: (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869, f3530822107858468870)) | |
Defined in Data.Singletons.Prelude.Ord type Apply (Compare_6989586621679830036Sym0 :: TyFun (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869, f3530822107858468870) ((a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869, f3530822107858468870) ~> Ordering) -> Type) (a6989586621679830034 :: (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869, f3530822107858468870)) = Compare_6989586621679830036Sym1 a6989586621679830034 | |
| type Apply (Compare_6989586621679830121Sym0 :: TyFun (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869, f3530822107858468870, g3530822107858468871) ((a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869, f3530822107858468870, g3530822107858468871) ~> Ordering) -> Type) (a6989586621679830119 :: (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869, f3530822107858468870, g3530822107858468871)) | |
Defined in Data.Singletons.Prelude.Ord type Apply (Compare_6989586621679830121Sym0 :: TyFun (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869, f3530822107858468870, g3530822107858468871) ((a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869, f3530822107858468870, g3530822107858468871) ~> Ordering) -> Type) (a6989586621679830119 :: (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869, f3530822107858468870, g3530822107858468871)) = Compare_6989586621679830121Sym1 a6989586621679830119 | |
RealWorld is deeply magical. It is primitive, but it is not
unlifted (hence ptrArg). We never manipulate values of type
RealWorld; it's only used in the type system, to parameterise State#.
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
32-bit unsigned integer type
Instances
64-bit unsigned integer type
Instances
The Either type represents values with two possibilities: a value of
type Either a bLeft aRight b
The Either type is sometimes used to represent a value which is
either correct or an error; by convention, the Left constructor is
used to hold an error value and the Right constructor is used to
hold a correct value (mnemonic: "right" also means "correct").
Examples
The type Either String IntString or an Int. The Left constructor can be used only on
Strings, and the Right constructor can be used only on Ints:
>>>let s = Left "foo" :: Either String Int>>>sLeft "foo">>>let n = Right 3 :: Either String Int>>>nRight 3>>>:type ss :: Either String Int>>>:type nn :: Either String Int
The fmap from our Functor instance will ignore Left values, but
will apply the supplied function to values contained in a Right:
>>>let s = Left "foo" :: Either String Int>>>let n = Right 3 :: Either String Int>>>fmap (*2) sLeft "foo">>>fmap (*2) nRight 6
The Monad instance for Either allows us to chain together multiple
actions which may fail, and fail overall if any of the individual
steps failed. First we'll write a function that can either parse an
Int from a Char, or fail.
>>>import Data.Char ( digitToInt, isDigit )>>>:{let parseEither :: Char -> Either String Int parseEither c | isDigit c = Right (digitToInt c) | otherwise = Left "parse error">>>:}
The following should work, since both '1' and '2' can be
parsed as Ints.
>>>:{let parseMultiple :: Either String Int parseMultiple = do x <- parseEither '1' y <- parseEither '2' return (x + y)>>>:}
>>>parseMultipleRight 3
But the following should fail overall, since the first operation where
we attempt to parse 'm' as an Int will fail:
>>>:{let parseMultiple :: Either String Int parseMultiple = do x <- parseEither 'm' y <- parseEither '2' return (x + y)>>>:}
>>>parseMultipleLeft "parse error"
Instances
| Bifunctor Either | Since: base-4.8.0.0 |
| Eq2 Either | Since: base-4.9.0.0 |
| Ord2 Either | Since: base-4.9.0.0 |
Defined in Data.Functor.Classes | |
| Read2 Either | Since: base-4.9.0.0 |
Defined in Data.Functor.Classes Methods liftReadsPrec2 :: (Int -> ReadS a) -> ReadS [a] -> (Int -> ReadS b) -> ReadS [b] -> Int -> ReadS (Either a b) # liftReadList2 :: (Int -> ReadS a) -> ReadS [a] -> (Int -> ReadS b) -> ReadS [b] -> ReadS [Either a b] # liftReadPrec2 :: ReadPrec a -> ReadPrec [a] -> ReadPrec b -> ReadPrec [b] -> ReadPrec (Either a b) # liftReadListPrec2 :: ReadPrec a -> ReadPrec [a] -> ReadPrec b -> ReadPrec [b] -> ReadPrec [Either a b] # | |
| Show2 Either | Since: base-4.9.0.0 |
| NFData2 Either | Since: deepseq-1.4.3.0 |
Defined in Control.DeepSeq | |
| Hashable2 Either | |
Defined in Data.Hashable.Class | |
| Swapped Either | |
| Monad (Either e) | Since: base-4.4.0.0 |
| Functor (Either a) | Since: base-3.0 |
| Applicative (Either e) | Since: base-3.0 |
| Foldable (Either a) | Since: base-4.7.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => Either a m -> m # foldMap :: Monoid m => (a0 -> m) -> Either a a0 -> m # foldr :: (a0 -> b -> b) -> b -> Either a a0 -> b # foldr' :: (a0 -> b -> b) -> b -> Either a a0 -> b # foldl :: (b -> a0 -> b) -> b -> Either a a0 -> b # foldl' :: (b -> a0 -> b) -> b -> Either a a0 -> b # foldr1 :: (a0 -> a0 -> a0) -> Either a a0 -> a0 # foldl1 :: (a0 -> a0 -> a0) -> Either a a0 -> a0 # toList :: Either a a0 -> [a0] # length :: Either a a0 -> Int # elem :: Eq a0 => a0 -> Either a a0 -> Bool # maximum :: Ord a0 => Either a a0 -> a0 # minimum :: Ord a0 => Either a a0 -> a0 # | |
| Traversable (Either a) | Since: base-4.7.0.0 |
Defined in Data.Traversable | |
| Eq a => Eq1 (Either a) | Since: base-4.9.0.0 |
| Ord a => Ord1 (Either a) | Since: base-4.9.0.0 |
Defined in Data.Functor.Classes | |
| Read a => Read1 (Either a) | Since: base-4.9.0.0 |
Defined in Data.Functor.Classes Methods liftReadsPrec :: (Int -> ReadS a0) -> ReadS [a0] -> Int -> ReadS (Either a a0) # liftReadList :: (Int -> ReadS a0) -> ReadS [a0] -> ReadS [Either a a0] # liftReadPrec :: ReadPrec a0 -> ReadPrec [a0] -> ReadPrec (Either a a0) # liftReadListPrec :: ReadPrec a0 -> ReadPrec [a0] -> ReadPrec [Either a a0] # | |
| Show a => Show1 (Either a) | Since: base-4.9.0.0 |
| NFData a => NFData1 (Either a) | Since: deepseq-1.4.3.0 |
Defined in Control.DeepSeq | |
| Hashable a => Hashable1 (Either a) | |
Defined in Data.Hashable.Class | |
| Apply (Either a) | |
| Bind (Either a) | |
| PTraversable (Either a) | |
| STraversable (Either a) | |
Defined in Data.Singletons.Prelude.Traversable Methods sTraverse :: SApplicative f => Sing t1 -> Sing t2 -> Sing (Apply (Apply TraverseSym0 t1) t2) # sSequenceA :: SApplicative f => Sing t1 -> Sing (Apply SequenceASym0 t1) # sMapM :: SMonad m => Sing t1 -> Sing t2 -> Sing (Apply (Apply MapMSym0 t1) t2) # sSequence :: SMonad m => Sing t1 -> Sing (Apply SequenceSym0 t1) # | |
| PFoldable (Either a) | |
| SFoldable (Either a) | |
Defined in Data.Singletons.Prelude.Foldable Methods sFold :: SMonoid m => Sing t1 -> Sing (Apply FoldSym0 t1) # sFoldMap :: SMonoid m => Sing t1 -> Sing t2 -> Sing (Apply (Apply FoldMapSym0 t1) t2) # sFoldr :: Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply FoldrSym0 t1) t2) t3) # sFoldr' :: Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply Foldr'Sym0 t1) t2) t3) # sFoldl :: Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply FoldlSym0 t1) t2) t3) # sFoldl' :: Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply Foldl'Sym0 t1) t2) t3) # sFoldr1 :: Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldr1Sym0 t1) t2) # sFoldl1 :: Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldl1Sym0 t1) t2) # sToList :: Sing t1 -> Sing (Apply ToListSym0 t1) # sNull :: Sing t1 -> Sing (Apply NullSym0 t1) # sLength :: Sing t1 -> Sing (Apply LengthSym0 t1) # sElem :: SEq a0 => Sing t1 -> Sing t2 -> Sing (Apply (Apply ElemSym0 t1) t2) # sMaximum :: SOrd a0 => Sing t1 -> Sing (Apply MaximumSym0 t1) # sMinimum :: SOrd a0 => Sing t1 -> Sing (Apply MinimumSym0 t1) # sSum :: SNum a0 => Sing t1 -> Sing (Apply SumSym0 t1) # sProduct :: SNum a0 => Sing t1 -> Sing (Apply ProductSym0 t1) # | |
| PFunctor (Either a) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| PApplicative (Either e) | |
| PMonad (Either e) | |
| SFunctor (Either a) | |
| SApplicative (Either e) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods sPure :: Sing t -> Sing (Apply PureSym0 t) # (%<*>) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (<*>@#@$) t1) t2) # sLiftA2 :: Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply LiftA2Sym0 t1) t2) t3) # (%*>) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (*>@#@$) t1) t2) # (%<*) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (<*@#@$) t1) t2) # | |
| SMonad (Either e) | |
| Generic1 (Either a :: Type -> Type) | |
| (Eq a, Eq b) => Eq (Either a b) | Since: base-2.1 |
| (Ord a, Ord b) => Ord (Either a b) | Since: base-2.1 |
| (Read a, Read b) => Read (Either a b) | Since: base-3.0 |
| (Show a, Show b) => Show (Either a b) | Since: base-3.0 |
| Generic (Either a b) | |
| Semigroup (Either a b) | Since: base-4.9.0.0 |
| (Lift a, Lift b) => Lift (Either a b) | |
| (NFData a, NFData b) => NFData (Either a b) | |
Defined in Control.DeepSeq | |
| (Hashable a, Hashable b) => Hashable (Either a b) | |
Defined in Data.Hashable.Class | |
| MonoPointed (Either a b) | |
| MonoTraversable (Either a b) | |
| MonoFoldable (Either a b) | |
Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element (Either a b) -> m) -> Either a b -> m # ofoldr :: (Element (Either a b) -> b0 -> b0) -> b0 -> Either a b -> b0 # ofoldl' :: (a0 -> Element (Either a b) -> a0) -> a0 -> Either a b -> a0 # otoList :: Either a b -> [Element (Either a b)] # oall :: (Element (Either a b) -> Bool) -> Either a b -> Bool # oany :: (Element (Either a b) -> Bool) -> Either a b -> Bool # olength :: Either a b -> Int # olength64 :: Either a b -> Int64 # ocompareLength :: Integral i => Either a b -> i -> Ordering # otraverse_ :: Applicative f => (Element (Either a b) -> f b0) -> Either a b -> f () # ofor_ :: Applicative f => Either a b -> (Element (Either a b) -> f b0) -> f () # omapM_ :: Applicative m => (Element (Either a b) -> m ()) -> Either a b -> m () # oforM_ :: Applicative m => Either a b -> (Element (Either a b) -> m ()) -> m () # ofoldlM :: Monad m => (a0 -> Element (Either a b) -> m a0) -> a0 -> Either a b -> m a0 # ofoldMap1Ex :: Semigroup m => (Element (Either a b) -> m) -> Either a b -> m # ofoldr1Ex :: (Element (Either a b) -> Element (Either a b) -> Element (Either a b)) -> Either a b -> Element (Either a b) # ofoldl1Ex' :: (Element (Either a b) -> Element (Either a b) -> Element (Either a b)) -> Either a b -> Element (Either a b) # headEx :: Either a b -> Element (Either a b) # lastEx :: Either a b -> Element (Either a b) # unsafeHead :: Either a b -> Element (Either a b) # unsafeLast :: Either a b -> Element (Either a b) # maximumByEx :: (Element (Either a b) -> Element (Either a b) -> Ordering) -> Either a b -> Element (Either a b) # minimumByEx :: (Element (Either a b) -> Element (Either a b) -> Ordering) -> Either a b -> Element (Either a b) # | |
| MonoFunctor (Either a b) | |
| PShow (Either a b) | |
| (SShow a, SShow b) => SShow (Either a b) | |
| PSemigroup (Either a b) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| SSemigroup (Either a b) | |
| POrd (Either a b) | |
| (SOrd a, SOrd b) => SOrd (Either a b) | |
Defined in Data.Singletons.Prelude.Ord Methods sCompare :: Sing t1 -> Sing t2 -> Sing (Apply (Apply CompareSym0 t1) t2) # (%<) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (<@#@$) t1) t2) # (%<=) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (<=@#@$) t1) t2) # (%>) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (>@#@$) t1) t2) # (%>=) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (>=@#@$) t1) t2) # sMax :: Sing t1 -> Sing t2 -> Sing (Apply (Apply MaxSym0 t1) t2) # sMin :: Sing t1 -> Sing t2 -> Sing (Apply (Apply MinSym0 t1) t2) # | |
| (SEq a, SEq b) => SEq (Either a b) | |
| PEq (Either a b) | |
| SuppressUnusedWarnings (RightsSym0 :: TyFun [Either a6989586621679855254 b6989586621679855256] [b6989586621679855256] -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (PartitionEithersSym0 :: TyFun [Either a6989586621679855251 b6989586621679855252] ([a6989586621679855251], [b6989586621679855252]) -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (LeftsSym0 :: TyFun [Either a6989586621679855257 b6989586621679855258] [a6989586621679855257] -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (IsRightSym0 :: TyFun (Either a6989586621679855247 b6989586621679855248) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (IsLeftSym0 :: TyFun (Either a6989586621679855249 b6989586621679855250) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679829732Sym0 :: TyFun (Either a6989586621679076523 b6989586621679076524) (Either a6989586621679076523 b6989586621679076524 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621680595146Sym0 :: TyFun Nat (Either a6989586621679076523 b6989586621679076524 ~> (Symbol ~> Symbol)) -> Type) | |
Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Pure_6989586621680031216Sym0 :: TyFun a6989586621679932934 (Either e6989586621680024806 a6989586621679932934) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (RightSym0 :: TyFun b6989586621679076524 (Either a6989586621679076523 b6989586621679076524) -> Type) | |
Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (LeftSym0 :: TyFun a6989586621679076523 (Either a6989586621679076523 b6989586621679076524) -> Type) | |
Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680177921ASym0 :: TyFun k1 (Either a6989586621679076523 k1) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SingI (RightsSym0 :: TyFun [Either a b] [b] -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods sing :: Sing RightsSym0 # | |
| SingI (PartitionEithersSym0 :: TyFun [Either a b] ([a], [b]) -> Type) | |
Defined in Data.Singletons.Prelude.Either | |
| SingI (LeftsSym0 :: TyFun [Either a b] [a] -> Type) | |
Defined in Data.Singletons.Prelude.Either | |
| SingI (IsRightSym0 :: TyFun (Either a b) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods sing :: Sing IsRightSym0 # | |
| SingI (IsLeftSym0 :: TyFun (Either a b) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods sing :: Sing IsLeftSym0 # | |
| SingI (RightSym0 :: TyFun b (Either a b) -> Type) | |
Defined in Data.Singletons.Prelude.Instances | |
| SingI (LeftSym0 :: TyFun a (Either a b) -> Type) | |
Defined in Data.Singletons.Prelude.Instances | |
| (FunctorWithIndex i f, FunctorWithIndex j g) => FunctorWithIndex (Either i j) (Sum f g) | |
| (FunctorWithIndex i f, FunctorWithIndex j g) => FunctorWithIndex (Either i j) (Product f g) | |
| (FunctorWithIndex i f, FunctorWithIndex j g) => FunctorWithIndex (Either i j) (f :+: g) | |
| (FunctorWithIndex i f, FunctorWithIndex j g) => FunctorWithIndex (Either i j) (f :*: g) | |
| (FoldableWithIndex i f, FoldableWithIndex j g) => FoldableWithIndex (Either i j) (Sum f g) | |
Defined in Control.Lens.Indexed Methods ifoldMap :: Monoid m => (Either i j -> a -> m) -> Sum f g a -> m # ifolded :: IndexedFold (Either i j) (Sum f g a) a # ifoldr :: (Either i j -> a -> b -> b) -> b -> Sum f g a -> b # ifoldl :: (Either i j -> b -> a -> b) -> b -> Sum f g a -> b # ifoldr' :: (Either i j -> a -> b -> b) -> b -> Sum f g a -> b # ifoldl' :: (Either i j -> b -> a -> b) -> b -> Sum f g a -> b # | |
| (FoldableWithIndex i f, FoldableWithIndex j g) => FoldableWithIndex (Either i j) (Product f g) | |
Defined in Control.Lens.Indexed Methods ifoldMap :: Monoid m => (Either i j -> a -> m) -> Product f g a -> m # ifolded :: IndexedFold (Either i j) (Product f g a) a # ifoldr :: (Either i j -> a -> b -> b) -> b -> Product f g a -> b # ifoldl :: (Either i j -> b -> a -> b) -> b -> Product f g a -> b # ifoldr' :: (Either i j -> a -> b -> b) -> b -> Product f g a -> b # ifoldl' :: (Either i j -> b -> a -> b) -> b -> Product f g a -> b # | |
| (FoldableWithIndex i f, FoldableWithIndex j g) => FoldableWithIndex (Either i j) (f :+: g) | |
Defined in Control.Lens.Indexed Methods ifoldMap :: Monoid m => (Either i j -> a -> m) -> (f :+: g) a -> m # ifolded :: IndexedFold (Either i j) ((f :+: g) a) a # ifoldr :: (Either i j -> a -> b -> b) -> b -> (f :+: g) a -> b # ifoldl :: (Either i j -> b -> a -> b) -> b -> (f :+: g) a -> b # ifoldr' :: (Either i j -> a -> b -> b) -> b -> (f :+: g) a -> b # ifoldl' :: (Either i j -> b -> a -> b) -> b -> (f :+: g) a -> b # | |
| (FoldableWithIndex i f, FoldableWithIndex j g) => FoldableWithIndex (Either i j) (f :*: g) | |
Defined in Control.Lens.Indexed Methods ifoldMap :: Monoid m => (Either i j -> a -> m) -> (f :*: g) a -> m # ifolded :: IndexedFold (Either i j) ((f :*: g) a) a # ifoldr :: (Either i j -> a -> b -> b) -> b -> (f :*: g) a -> b # ifoldl :: (Either i j -> b -> a -> b) -> b -> (f :*: g) a -> b # ifoldr' :: (Either i j -> a -> b -> b) -> b -> (f :*: g) a -> b # ifoldl' :: (Either i j -> b -> a -> b) -> b -> (f :*: g) a -> b # | |
| (TraversableWithIndex i f, TraversableWithIndex j g) => TraversableWithIndex (Either i j) (Sum f g) | |
Defined in Control.Lens.Indexed Methods itraverse :: Applicative f0 => (Either i j -> a -> f0 b) -> Sum f g a -> f0 (Sum f g b) # itraversed :: IndexedTraversal (Either i j) (Sum f g a) (Sum f g b) a b # | |
| (TraversableWithIndex i f, TraversableWithIndex j g) => TraversableWithIndex (Either i j) (Product f g) | |
Defined in Control.Lens.Indexed Methods itraverse :: Applicative f0 => (Either i j -> a -> f0 b) -> Product f g a -> f0 (Product f g b) # itraversed :: IndexedTraversal (Either i j) (Product f g a) (Product f g b) a b # | |
| (TraversableWithIndex i f, TraversableWithIndex j g) => TraversableWithIndex (Either i j) (f :+: g) | |
Defined in Control.Lens.Indexed Methods itraverse :: Applicative f0 => (Either i j -> a -> f0 b) -> (f :+: g) a -> f0 ((f :+: g) b) # itraversed :: IndexedTraversal (Either i j) ((f :+: g) a) ((f :+: g) b) a b # | |
| (TraversableWithIndex i f, TraversableWithIndex j g) => TraversableWithIndex (Either i j) (f :*: g) | |
Defined in Control.Lens.Indexed Methods itraverse :: Applicative f0 => (Either i j -> a -> f0 b) -> (f :*: g) a -> f0 ((f :*: g) b) # itraversed :: IndexedTraversal (Either i j) ((f :*: g) a) ((f :*: g) b) a b # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621680595146Sym1 a6989586621680595143 a6989586621679076523 b6989586621679076524 :: TyFun (Either a6989586621679076523 b6989586621679076524) (Symbol ~> Symbol) -> Type) | |
Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680031517Sym0 :: TyFun (Either e6989586621680024823 a6989586621679932958) ((a6989586621679932958 ~> Either e6989586621680024823 b6989586621679932959) ~> Either e6989586621680024823 b6989586621679932959) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680031240Sym0 :: TyFun (Either e6989586621680024806 (a6989586621679932935 ~> b6989586621679932936)) (Either e6989586621680024806 a6989586621679932935 ~> Either e6989586621680024806 b6989586621679932936) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679829732Sym1 a6989586621679829730 :: TyFun (Either a6989586621679076523 b6989586621679076524) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680030772Sym0 :: TyFun a6989586621679932931 (Either a6989586621680024794 b6989586621679932932 ~> Either a6989586621680024794 a6989586621679932931) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Either_Sym0 :: TyFun (a6989586621679850875 ~> c6989586621679850876) ((b6989586621679850877 ~> c6989586621679850876) ~> (Either a6989586621679850875 b6989586621679850877 ~> c6989586621679850876)) -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Fmap_6989586621680030725Sym0 :: TyFun (a6989586621679932929 ~> b6989586621679932930) (Either a6989586621680024794 a6989586621679932929 ~> Either a6989586621680024794 b6989586621679932930) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SingI (Either_Sym0 :: TyFun (a ~> c) ((b ~> c) ~> (Either a b ~> c)) -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods sing :: Sing Either_Sym0 # | |
| SuppressUnusedWarnings (TFHelper_6989586621680031240Sym1 a6989586621680031238 :: TyFun (Either e6989586621680024806 a6989586621679932935) (Either e6989586621680024806 b6989586621679932936) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680030772Sym1 a6989586621680030770 a6989586621680024794 b6989586621679932932 :: TyFun (Either a6989586621680024794 b6989586621679932932) (Either a6989586621680024794 a6989586621679932931) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Fmap_6989586621680030725Sym1 a6989586621680030723 a6989586621680024794 :: TyFun (Either a6989586621680024794 a6989586621679932929) (Either a6989586621680024794 b6989586621679932930) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Traverse_6989586621680957656Sym0 :: TyFun (a6989586621680946430 ~> f6989586621680946429 b6989586621680946431) (Either a6989586621680956871 a6989586621680946430 ~> f6989586621680946429 (Either a6989586621680956871 b6989586621680946431)) -> Type) | |
Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Either_Sym1 a6989586621679850932 b6989586621679850877 :: TyFun (b6989586621679850877 ~> c6989586621679850876) (Either a6989586621679850875 b6989586621679850877 ~> c6989586621679850876) -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680031517Sym1 a6989586621680031515 b6989586621679932959 :: TyFun (a6989586621679932958 ~> Either e6989586621680024823 b6989586621679932959) (Either e6989586621680024823 b6989586621679932959) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SingI d => SingI (Either_Sym1 d b :: TyFun (b ~> c) (Either a b ~> c) -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods sing :: Sing (Either_Sym1 d b) # | |
| SuppressUnusedWarnings (Traverse_6989586621680957656Sym1 a6989586621680957654 a6989586621680956871 :: TyFun (Either a6989586621680956871 a6989586621680946430) (f6989586621680946429 (Either a6989586621680956871 b6989586621680946431)) -> Type) | |
Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Either_Sym2 a6989586621679850933 a6989586621679850932 :: TyFun (Either a6989586621679850875 b6989586621679850877) c6989586621679850876 -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods suppressUnusedWarnings :: () # | |
| (SingI d1, SingI d2) => SingI (Either_Sym2 d1 d2 :: TyFun (Either a b) c -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods sing :: Sing (Either_Sym2 d1 d2) # | |
| type Apply (IsRightSym0 :: TyFun (Either a b) Bool -> Type) (a6989586621679856472 :: Either a b) | |
Defined in Data.Singletons.Prelude.Either | |
| type Apply (IsLeftSym0 :: TyFun (Either a b) Bool -> Type) (a6989586621679856474 :: Either a b) | |
Defined in Data.Singletons.Prelude.Either | |
| type Apply (Compare_6989586621679829732Sym1 a6989586621679829730 :: TyFun (Either a b) Ordering -> Type) (a6989586621679829731 :: Either a b) | |
| type Apply (Either_Sym2 a6989586621679850933 a6989586621679850932 :: TyFun (Either a b) c -> Type) (a6989586621679850934 :: Either a b) | |
Defined in Data.Singletons.Prelude.Either | |
| type Product (arg :: Either a1 a2) | |
| type Sum (arg :: Either a1 a2) | |
| type Minimum (arg :: Either a1 a2) | |
| type Maximum (arg :: Either a1 a2) | |
| type Length (a2 :: Either a1 a6989586621680712272) | |
| type Null (a2 :: Either a1 a6989586621680712271) | |
| type ToList (arg :: Either a1 a2) | |
| type Fold (arg :: Either a m) | |
| type Pure (a :: k1) | |
| type Fail arg | |
| type Return (arg :: a) | |
| type Sequence (arg :: Either a1 (m a2)) | |
| type SequenceA (arg :: Either a1 (f a2)) | |
| type Elem (arg1 :: a1) (arg2 :: Either a2 a1) | |
| type Foldl1 (arg1 :: a1 ~> (a1 ~> a1)) (arg2 :: Either a2 a1) | |
| type Foldr1 (arg1 :: a1 ~> (a1 ~> a1)) (arg2 :: Either a2 a1) | |
| type FoldMap (a2 :: a6989586621680712259 ~> k2) (a3 :: Either a1 a6989586621680712259) | |
| type (a2 :: k1) <$ (a3 :: Either a1 b6989586621679932932) | |
| type Fmap (a2 :: a6989586621679932929 ~> b6989586621679932930) (a3 :: Either a1 a6989586621679932929) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| type (arg1 :: Either e a) <* (arg2 :: Either e b) | |
| type (arg1 :: Either e a) *> (arg2 :: Either e b) | |
| type (a1 :: Either e (a6989586621679932935 ~> b6989586621679932936)) <*> (a2 :: Either e a6989586621679932935) | |
Defined in Data.Singletons.Prelude.Monad.Internal type (a1 :: Either e (a6989586621679932935 ~> b6989586621679932936)) <*> (a2 :: Either e a6989586621679932935) = Apply (Apply (TFHelper_6989586621680031240Sym0 :: TyFun (Either e (a6989586621679932935 ~> b6989586621679932936)) (Either e a6989586621679932935 ~> Either e b6989586621679932936) -> Type) a1) a2 | |
| type (arg1 :: Either e a) >> (arg2 :: Either e b) | |
| type (a1 :: Either e a6989586621679932958) >>= (a2 :: a6989586621679932958 ~> Either e b6989586621679932959) | |
Defined in Data.Singletons.Prelude.Monad.Internal type (a1 :: Either e a6989586621679932958) >>= (a2 :: a6989586621679932958 ~> Either e b6989586621679932959) = Apply (Apply (TFHelper_6989586621680031517Sym0 :: TyFun (Either e a6989586621679932958) ((a6989586621679932958 ~> Either e b6989586621679932959) ~> Either e b6989586621679932959) -> Type) a1) a2 | |
| type MapM (arg1 :: a1 ~> m b) (arg2 :: Either a2 a1) | |
| type Traverse (a2 :: a6989586621680946430 ~> f6989586621680946429 b6989586621680946431) (a3 :: Either a1 a6989586621680946430) | |
Defined in Data.Singletons.Prelude.Traversable type Traverse (a2 :: a6989586621680946430 ~> f6989586621680946429 b6989586621680946431) (a3 :: Either a1 a6989586621680946430) = Apply (Apply (Traverse_6989586621680957656Sym0 :: TyFun (a6989586621680946430 ~> f6989586621680946429 b6989586621680946431) (Either a1 a6989586621680946430 ~> f6989586621680946429 (Either a1 b6989586621680946431)) -> Type) a2) a3 | |
| type Foldl' (arg1 :: b ~> (a1 ~> b)) (arg2 :: b) (arg3 :: Either a2 a1) | |
| type Foldl (arg1 :: b ~> (a1 ~> b)) (arg2 :: b) (arg3 :: Either a2 a1) | |
| type Foldr' (arg1 :: a1 ~> (b ~> b)) (arg2 :: b) (arg3 :: Either a2 a1) | |
| type Foldr (a2 :: a6989586621680712260 ~> (k2 ~> k2)) (a3 :: k2) (a4 :: Either a1 a6989586621680712260) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type LiftA2 (arg1 :: a ~> (b ~> c)) (arg2 :: Either e a) (arg3 :: Either e b) | |
| type Rep1 (Either a :: Type -> Type) | Since: base-4.6.0.0 |
Defined in GHC.Generics type Rep1 (Either a :: Type -> Type) = D1 (MetaData "Either" "Data.Either" "base" False) (C1 (MetaCons "Left" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 a)) :+: C1 (MetaCons "Right" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) Par1)) | |
| type Apply (RightsSym0 :: TyFun [Either a b] [b] -> Type) (a6989586621679856504 :: [Either a b]) | |
Defined in Data.Singletons.Prelude.Either | |
| type Apply (LeftsSym0 :: TyFun [Either a b] [a] -> Type) (a6989586621679856512 :: [Either a b]) | |
| type Apply (Traverse_6989586621680957656Sym1 a6989586621680957654 a2 :: TyFun (Either a2 a1) (f (Either a2 b)) -> Type) (a6989586621680957655 :: Either a2 a1) | |
| type Rep (Either a b) | Since: base-4.6.0.0 |
Defined in GHC.Generics type Rep (Either a b) = D1 (MetaData "Either" "Data.Either" "base" False) (C1 (MetaCons "Left" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 a)) :+: C1 (MetaCons "Right" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 b))) | |
| type Element (Either a b) | |
Defined in Data.MonoTraversable | |
| data Sing (c :: Either a b) | |
| type Demote (Either a b) | |
| type Show_ (arg :: Either a b) | |
| type Sconcat (arg :: NonEmpty (Either a b)) | |
| type ShowList (arg1 :: [Either a b]) arg2 | |
| type (a2 :: Either a1 b) <> (a3 :: Either a1 b) | |
| type Min (arg1 :: Either a b) (arg2 :: Either a b) | |
| type Max (arg1 :: Either a b) (arg2 :: Either a b) | |
| type (arg1 :: Either a b) >= (arg2 :: Either a b) | |
| type (arg1 :: Either a b) > (arg2 :: Either a b) | |
| type (arg1 :: Either a b) <= (arg2 :: Either a b) | |
| type (arg1 :: Either a b) < (arg2 :: Either a b) | |
| type Compare (a2 :: Either a1 b) (a3 :: Either a1 b) | |
| type (x :: Either a b) /= (y :: Either a b) | |
| type (a2 :: Either a1 b1) == (b2 :: Either a1 b1) | |
Defined in Data.Singletons.Prelude.Eq | |
| type ShowsPrec a2 (a3 :: Either a1 b) a4 | |
| type Apply (Pure_6989586621680031216Sym0 :: TyFun a (Either e6989586621680024806 a) -> Type) (a6989586621680031214 :: a) | |
| type Apply (LeftSym0 :: TyFun a (Either a b6989586621679076524) -> Type) (t6989586621679724627 :: a) | |
| type Apply (RightSym0 :: TyFun b (Either a6989586621679076523 b) -> Type) (t6989586621679724629 :: b) | |
| type Apply (Let6989586621680177921ASym0 :: TyFun k1 (Either a6989586621679076523 k1) -> Type) (wild_69895866216801748546989586621680177920 :: k1) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Apply (ShowsPrec_6989586621680595146Sym0 :: TyFun Nat (Either a6989586621679076523 b6989586621679076524 ~> (Symbol ~> Symbol)) -> Type) (a6989586621680595143 :: Nat) | |
Defined in Data.Singletons.Prelude.Show type Apply (ShowsPrec_6989586621680595146Sym0 :: TyFun Nat (Either a6989586621679076523 b6989586621679076524 ~> (Symbol ~> Symbol)) -> Type) (a6989586621680595143 :: Nat) = (ShowsPrec_6989586621680595146Sym1 a6989586621680595143 a6989586621679076523 b6989586621679076524 :: TyFun (Either a6989586621679076523 b6989586621679076524) (Symbol ~> Symbol) -> Type) | |
| type Apply (TFHelper_6989586621680030772Sym0 :: TyFun a6989586621679932931 (Either a6989586621680024794 b6989586621679932932 ~> Either a6989586621680024794 a6989586621679932931) -> Type) (a6989586621680030770 :: a6989586621679932931) | |
Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680030772Sym0 :: TyFun a6989586621679932931 (Either a6989586621680024794 b6989586621679932932 ~> Either a6989586621680024794 a6989586621679932931) -> Type) (a6989586621680030770 :: a6989586621679932931) = (TFHelper_6989586621680030772Sym1 a6989586621680030770 a6989586621680024794 b6989586621679932932 :: TyFun (Either a6989586621680024794 b6989586621679932932) (Either a6989586621680024794 a6989586621679932931) -> Type) | |
| type Apply (PartitionEithersSym0 :: TyFun [Either a b] ([a], [b]) -> Type) (a6989586621679856479 :: [Either a b]) | |
Defined in Data.Singletons.Prelude.Either | |
| type Apply (Compare_6989586621679829732Sym0 :: TyFun (Either a6989586621679076523 b6989586621679076524) (Either a6989586621679076523 b6989586621679076524 ~> Ordering) -> Type) (a6989586621679829730 :: Either a6989586621679076523 b6989586621679076524) | |
Defined in Data.Singletons.Prelude.Ord type Apply (Compare_6989586621679829732Sym0 :: TyFun (Either a6989586621679076523 b6989586621679076524) (Either a6989586621679076523 b6989586621679076524 ~> Ordering) -> Type) (a6989586621679829730 :: Either a6989586621679076523 b6989586621679076524) = Compare_6989586621679829732Sym1 a6989586621679829730 | |
| type Apply (Fmap_6989586621680030725Sym0 :: TyFun (a6989586621679932929 ~> b6989586621679932930) (Either a6989586621680024794 a6989586621679932929 ~> Either a6989586621680024794 b6989586621679932930) -> Type) (a6989586621680030723 :: a6989586621679932929 ~> b6989586621679932930) | |
Defined in Data.Singletons.Prelude.Monad.Internal type Apply (Fmap_6989586621680030725Sym0 :: TyFun (a6989586621679932929 ~> b6989586621679932930) (Either a6989586621680024794 a6989586621679932929 ~> Either a6989586621680024794 b6989586621679932930) -> Type) (a6989586621680030723 :: a6989586621679932929 ~> b6989586621679932930) = (Fmap_6989586621680030725Sym1 a6989586621680030723 a6989586621680024794 :: TyFun (Either a6989586621680024794 a6989586621679932929) (Either a6989586621680024794 b6989586621679932930) -> Type) | |
| type Apply (TFHelper_6989586621680031240Sym0 :: TyFun (Either e6989586621680024806 (a6989586621679932935 ~> b6989586621679932936)) (Either e6989586621680024806 a6989586621679932935 ~> Either e6989586621680024806 b6989586621679932936) -> Type) (a6989586621680031238 :: Either e6989586621680024806 (a6989586621679932935 ~> b6989586621679932936)) | |
Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680031240Sym0 :: TyFun (Either e6989586621680024806 (a6989586621679932935 ~> b6989586621679932936)) (Either e6989586621680024806 a6989586621679932935 ~> Either e6989586621680024806 b6989586621679932936) -> Type) (a6989586621680031238 :: Either e6989586621680024806 (a6989586621679932935 ~> b6989586621679932936)) = TFHelper_6989586621680031240Sym1 a6989586621680031238 | |
| type Apply (ShowsPrec_6989586621680595146Sym1 a6989586621680595143 a6989586621679076523 b6989586621679076524 :: TyFun (Either a6989586621679076523 b6989586621679076524) (Symbol ~> Symbol) -> Type) (a6989586621680595144 :: Either a6989586621679076523 b6989586621679076524) | |
Defined in Data.Singletons.Prelude.Show type Apply (ShowsPrec_6989586621680595146Sym1 a6989586621680595143 a6989586621679076523 b6989586621679076524 :: TyFun (Either a6989586621679076523 b6989586621679076524) (Symbol ~> Symbol) -> Type) (a6989586621680595144 :: Either a6989586621679076523 b6989586621679076524) = ShowsPrec_6989586621680595146Sym2 a6989586621680595143 a6989586621680595144 | |
| type Apply (Either_Sym0 :: TyFun (a6989586621679850875 ~> c6989586621679850876) ((b6989586621679850877 ~> c6989586621679850876) ~> (Either a6989586621679850875 b6989586621679850877 ~> c6989586621679850876)) -> Type) (a6989586621679850932 :: a6989586621679850875 ~> c6989586621679850876) | |
Defined in Data.Singletons.Prelude.Either type Apply (Either_Sym0 :: TyFun (a6989586621679850875 ~> c6989586621679850876) ((b6989586621679850877 ~> c6989586621679850876) ~> (Either a6989586621679850875 b6989586621679850877 ~> c6989586621679850876)) -> Type) (a6989586621679850932 :: a6989586621679850875 ~> c6989586621679850876) = (Either_Sym1 a6989586621679850932 b6989586621679850877 :: TyFun (b6989586621679850877 ~> c6989586621679850876) (Either a6989586621679850875 b6989586621679850877 ~> c6989586621679850876) -> Type) | |
| type Apply (TFHelper_6989586621680031517Sym0 :: TyFun (Either e6989586621680024823 a6989586621679932958) ((a6989586621679932958 ~> Either e6989586621680024823 b6989586621679932959) ~> Either e6989586621680024823 b6989586621679932959) -> Type) (a6989586621680031515 :: Either e6989586621680024823 a6989586621679932958) | |
Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680031517Sym0 :: TyFun (Either e6989586621680024823 a6989586621679932958) ((a6989586621679932958 ~> Either e6989586621680024823 b6989586621679932959) ~> Either e6989586621680024823 b6989586621679932959) -> Type) (a6989586621680031515 :: Either e6989586621680024823 a6989586621679932958) = (TFHelper_6989586621680031517Sym1 a6989586621680031515 b6989586621679932959 :: TyFun (a6989586621679932958 ~> Either e6989586621680024823 b6989586621679932959) (Either e6989586621680024823 b6989586621679932959) -> Type) | |
| type Apply (Fmap_6989586621680030725Sym1 a6989586621680030723 a1 :: TyFun (Either a1 a2) (Either a1 b) -> Type) (a6989586621680030724 :: Either a1 a2) | |
| type Apply (TFHelper_6989586621680030772Sym1 a6989586621680030770 a1 b :: TyFun (Either a1 b) (Either a1 a2) -> Type) (a6989586621680030771 :: Either a1 b) | |
| type Apply (TFHelper_6989586621680031240Sym1 a6989586621680031238 :: TyFun (Either e a) (Either e b) -> Type) (a6989586621680031239 :: Either e a) | |
| type Apply (TFHelper_6989586621680031517Sym1 a6989586621680031515 b :: TyFun (a ~> Either e b) (Either e b) -> Type) (a6989586621680031516 :: a ~> Either e b) | |
| type Apply (Traverse_6989586621680957656Sym0 :: TyFun (a6989586621680946430 ~> f6989586621680946429 b6989586621680946431) (Either a6989586621680956871 a6989586621680946430 ~> f6989586621680946429 (Either a6989586621680956871 b6989586621680946431)) -> Type) (a6989586621680957654 :: a6989586621680946430 ~> f6989586621680946429 b6989586621680946431) | |
Defined in Data.Singletons.Prelude.Traversable type Apply (Traverse_6989586621680957656Sym0 :: TyFun (a6989586621680946430 ~> f6989586621680946429 b6989586621680946431) (Either a6989586621680956871 a6989586621680946430 ~> f6989586621680946429 (Either a6989586621680956871 b6989586621680946431)) -> Type) (a6989586621680957654 :: a6989586621680946430 ~> f6989586621680946429 b6989586621680946431) = (Traverse_6989586621680957656Sym1 a6989586621680957654 a6989586621680956871 :: TyFun (Either a6989586621680956871 a6989586621680946430) (f6989586621680946429 (Either a6989586621680956871 b6989586621680946431)) -> Type) | |
| type Apply (Either_Sym1 a6989586621679850932 b6989586621679850877 :: TyFun (b6989586621679850877 ~> c6989586621679850876) (Either a6989586621679850875 b6989586621679850877 ~> c6989586621679850876) -> Type) (a6989586621679850933 :: b6989586621679850877 ~> c6989586621679850876) | |
Defined in Data.Singletons.Prelude.Either type Apply (Either_Sym1 a6989586621679850932 b6989586621679850877 :: TyFun (b6989586621679850877 ~> c6989586621679850876) (Either a6989586621679850875 b6989586621679850877 ~> c6989586621679850876) -> Type) (a6989586621679850933 :: b6989586621679850877 ~> c6989586621679850876) = Either_Sym2 a6989586621679850932 a6989586621679850933 | |
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
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
| NFData Bool | |
Defined in Control.DeepSeq | |
| NFData Char | |
Defined in Control.DeepSeq | |
| NFData Double | |
Defined in Control.DeepSeq | |
| NFData Float | |
Defined in Control.DeepSeq | |
| NFData Int | |
Defined in Control.DeepSeq | |
| NFData Int8 | |
Defined in Control.DeepSeq | |
| NFData Int16 | |
Defined in Control.DeepSeq | |
| NFData Int32 | |
Defined in Control.DeepSeq | |
| NFData Int64 | |
Defined in Control.DeepSeq | |
| NFData Integer | |
Defined in Control.DeepSeq | |
| NFData Natural | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| NFData Ordering | |
Defined in Control.DeepSeq | |
| NFData Word | |
Defined in Control.DeepSeq | |
| NFData Word8 | |
Defined in Control.DeepSeq | |
| NFData Word16 | |
Defined in Control.DeepSeq | |
| NFData Word32 | |
Defined in Control.DeepSeq | |
| NFData Word64 | |
Defined in Control.DeepSeq | |
| NFData CallStack | Since: deepseq-1.4.2.0 |
Defined in Control.DeepSeq | |
| NFData () | |
Defined in Control.DeepSeq | |
| NFData TyCon | NOTE: Prior to Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| NFData Doc | |
Defined in Text.PrettyPrint.HughesPJ | |
| NFData Version | Since: deepseq-1.3.0.0 |
Defined in Control.DeepSeq | |
| NFData ByteString | |
Defined in Data.ByteString.Lazy.Internal Methods rnf :: ByteString -> () # | |
| NFData ByteString | |
Defined in Data.ByteString.Internal Methods rnf :: ByteString -> () # | |
| NFData Any | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| NFData All | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| NFData UTCTime | |
Defined in Data.Time.Clock.Internal.UTCTime | |
| NFData ThreadId | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| NFData Void | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| NFData Unique | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| NFData ExitCode | Since: deepseq-1.4.2.0 |
Defined in Control.DeepSeq | |
| NFData MaskingState | Since: deepseq-1.4.4.0 |
Defined in Control.DeepSeq Methods rnf :: MaskingState -> () # | |
| NFData TypeRep | NOTE: Prior to Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| NFData CChar | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| NFData CSChar | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| NFData CUChar | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| NFData CShort | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| NFData CUShort | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| NFData CInt | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| NFData CUInt | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| NFData CLong | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| NFData CULong | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| NFData CLLong | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| NFData CULLong | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| NFData CBool | Since: deepseq-1.4.3.0 |
Defined in Control.DeepSeq | |
| NFData CFloat | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| NFData CDouble | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| NFData CPtrdiff | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| NFData CSize | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| NFData CWchar | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| NFData CSigAtomic | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq Methods rnf :: CSigAtomic -> () # | |
| NFData CClock | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| NFData CTime | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| NFData CUSeconds | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| NFData CSUSeconds | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq Methods rnf :: CSUSeconds -> () # | |
| NFData CFile | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| NFData CFpos | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| NFData CJmpBuf | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| NFData CIntPtr | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| NFData CUIntPtr | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| NFData CIntMax | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| NFData CUIntMax | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| NFData Fingerprint | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq Methods rnf :: Fingerprint -> () # | |
| NFData SrcLoc | Since: deepseq-1.4.2.0 |
Defined in Control.DeepSeq | |
| NFData IntSet | |
Defined in Data.IntSet.Internal | |
| NFData Day | |
Defined in Data.Time.Calendar.Days | |
| NFData Name | |
Defined in Data.XML.Types | |
| NFData Element | |
| NFData TextDetails | |
Defined in Text.PrettyPrint.Annotated.HughesPJ Methods rnf :: TextDetails -> () # | |
| NFData ZonedTime | |
Defined in Data.Time.LocalTime.Internal.ZonedTime | |
| NFData LocalTime | |
Defined in Data.Time.LocalTime.Internal.LocalTime | |
| NFData TimeOfDay | |
Defined in Data.Time.LocalTime.Internal.TimeOfDay | |
| NFData TimeZone | |
Defined in Data.Time.LocalTime.Internal.TimeZone | |
| NFData UniversalTime | |
Defined in Data.Time.Clock.Internal.UniversalTime Methods rnf :: UniversalTime -> () # | |
| NFData DiffTime | |
Defined in Data.Time.Clock.Internal.DiffTime | |
| NFData Event | |
Defined in Data.XML.Types | |
| NFData Document | |
| NFData Node | |
| NFData ExternalID | |
Defined in Data.XML.Types Methods rnf :: ExternalID -> () # | |
| NFData Doctype | |
Defined in Data.XML.Types | |
| NFData Miscellaneous | |
Defined in Data.XML.Types Methods rnf :: Miscellaneous -> () # | |
| NFData Instruction | |
Defined in Data.XML.Types Methods rnf :: Instruction -> () # | |
| NFData Prologue | |
Defined in Data.XML.Types | |
| NFData Document | |
Defined in Data.XML.Types | |
| NFData Node | |
Defined in Data.XML.Types | |
| NFData Element | |
Defined in Data.XML.Types | |
| NFData Content | |
Defined in Data.XML.Types | |
| NFData a => NFData [a] | |
Defined in Control.DeepSeq | |
| NFData a => NFData (Maybe a) | |
Defined in Control.DeepSeq | |
| NFData a => NFData (Ratio a) | |
Defined in Control.DeepSeq | |
| NFData (Ptr a) | Since: deepseq-1.4.2.0 |
Defined in Control.DeepSeq | |
| NFData (FunPtr a) | Since: deepseq-1.4.2.0 |
Defined in Control.DeepSeq | |
| NFData a => NFData (Last a) | Since: deepseq-1.4.2.0 |
Defined in Control.DeepSeq | |
| NFData a => NFData (SCC a) | |
Defined in Data.Graph | |
| NFData a => NFData (Complex a) | |
Defined in Control.DeepSeq | |
| NFData (Fixed a) | Since: deepseq-1.3.0.0 |
Defined in Control.DeepSeq | |
| NFData a => NFData (Min a) | Since: deepseq-1.4.2.0 |
Defined in Control.DeepSeq | |
| NFData a => NFData (Max a) | Since: deepseq-1.4.2.0 |
Defined in Control.DeepSeq | |
| NFData a => NFData (First a) | Since: deepseq-1.4.2.0 |
Defined in Control.DeepSeq | |
| NFData m => NFData (WrappedMonoid m) | Since: deepseq-1.4.2.0 |
Defined in Control.DeepSeq Methods rnf :: WrappedMonoid m -> () # | |
| NFData a => NFData (Option a) | Since: deepseq-1.4.2.0 |
Defined in Control.DeepSeq | |
| NFData (StableName a) | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq Methods rnf :: StableName a -> () # | |
| NFData a => NFData (ZipList a) | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| NFData a => NFData (Identity a) | Since: deepseq-1.4.0.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 | |
| NFData a => NFData (First a) | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| NFData a => NFData (Last a) | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| NFData a => NFData (Dual a) | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| NFData a => NFData (Sum a) | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| NFData a => NFData (Product a) | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| NFData a => NFData (Down a) | Since: deepseq-1.4.0.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 | |
| NFData a => NFData (NonEmpty a) | Since: deepseq-1.4.2.0 |
Defined in Control.DeepSeq | |
| NFData a => NFData (Vector a) | |
Defined in Data.Vector | |
| NFData a => NFData (HashSet a) | |
Defined in Data.HashSet | |
| NFData a => NFData (Set a) | |
Defined in Data.Set.Internal | |
| NFData a => NFData (Seq a) | |
Defined in Data.Sequence.Internal | |
| NFData a => NFData (IntMap a) | |
Defined in Data.IntMap.Internal | |
| NFData a => NFData (DList a) | |
Defined in Data.DList | |
| NFData a => NFData (Tree a) | |
| NFData a => NFData (FingerTree a) | |
Defined in Data.Sequence.Internal Methods rnf :: FingerTree a -> () # | |
| NFData a => NFData (Digit a) | |
Defined in Data.Sequence.Internal | |
| NFData a => NFData (Node a) | |
Defined in Data.Sequence.Internal | |
| NFData a => NFData (Elem a) | |
Defined in Data.Sequence.Internal | |
| NFData a => NFData (Hashed a) | |
Defined in Data.Hashable.Class | |
| NFData (Vector a) | |
Defined in Data.Vector.Primitive | |
| NFData (Vector a) | |
Defined in Data.Vector.Storable | |
| NFData (Vector a) | |
Defined in Data.Vector.Unboxed.Base | |
| NFData a => NFData (Doc a) | |
Defined in Text.PrettyPrint.Annotated.HughesPJ | |
| NFData a => NFData (AnnotDetails a) | |
Defined in Text.PrettyPrint.Annotated.HughesPJ Methods rnf :: AnnotDetails a -> () # | |
| NFData (a -> b) | This instance is for convenience and consistency with Since: deepseq-1.3.0.0 |
Defined in Control.DeepSeq | |
| (NFData a, NFData b) => NFData (Either a b) | |
Defined in Control.DeepSeq | |
| (NFData a, NFData b) => NFData (a, b) | |
Defined in Control.DeepSeq | |
| (NFData k, NFData a) => NFData (Map k a) | |
Defined in Data.Map.Internal | |
| (NFData k, NFData v) => NFData (HashMap k v) | |
Defined in Data.HashMap.Base | |
| (NFData a, NFData b) => NFData (Array a b) | |
Defined in Control.DeepSeq | |
| (NFData i, NFData r) => NFData (IResult i r) | |
Defined in Data.Attoparsec.Internal.Types | |
| (NFData a, NFData b) => NFData (Arg a b) | Since: deepseq-1.4.2.0 |
Defined in Control.DeepSeq | |
| NFData (Proxy a) | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| NFData (STRef s a) | NOTE: Only strict in the reference and not the referenced value. Since: deepseq-1.4.2.0 |
Defined in Control.DeepSeq | |
| (NFData k, NFData v) => NFData (Leaf k v) | |
Defined in Data.HashMap.Base | |
| NFData (MVector s a) | |
Defined in Data.Vector.Unboxed.Base | |
| NFData (MVector s a) | |
Defined in Data.Vector.Storable.Mutable | |
| NFData (MVector s a) | |
Defined in Data.Vector.Primitive.Mutable | |
| (NFData a1, NFData a2, NFData a3) => NFData (a1, a2, a3) | |
Defined in Control.DeepSeq | |
| NFData a => NFData (Const a b) | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| NFData (a :~: b) | Since: deepseq-1.4.3.0 |
Defined in Control.DeepSeq | |
| NFData b => NFData (Tagged s b) | |
Defined in Data.Tagged | |
| (NFData a1, NFData a2, NFData a3, NFData a4) => NFData (a1, a2, a3, a4) | |
Defined in Control.DeepSeq | |
| (NFData1 f, NFData1 g, NFData a) => NFData (Product f g a) | Since: deepseq-1.4.3.0 |
Defined in Control.DeepSeq | |
| (NFData1 f, NFData1 g, NFData a) => NFData (Sum f g a) | Since: deepseq-1.4.3.0 |
Defined in Control.DeepSeq | |
| NFData (a :~~: b) | Since: deepseq-1.4.3.0 |
Defined in Control.DeepSeq | |
| (NFData a1, NFData a2, NFData a3, NFData a4, NFData a5) => NFData (a1, a2, a3, a4, a5) | |
Defined in Control.DeepSeq | |
| (NFData1 f, NFData1 g, NFData a) => NFData (Compose f g a) | Since: deepseq-1.4.3.0 |
Defined in Control.DeepSeq | |
| (NFData a1, NFData a2, NFData a3, NFData a4, NFData a5, NFData a6) => NFData (a1, a2, a3, a4, a5, a6) | |
Defined in Control.DeepSeq | |
| (NFData a1, NFData a2, NFData a3, NFData a4, NFData a5, NFData a6, NFData a7) => NFData (a1, a2, a3, a4, a5, a6, a7) | |
Defined in Control.DeepSeq | |
| (NFData a1, NFData a2, NFData a3, NFData a4, NFData a5, NFData a6, NFData a7, NFData a8) => NFData (a1, a2, a3, a4, a5, a6, a7, a8) | |
Defined in Control.DeepSeq | |
| (NFData a1, NFData a2, NFData a3, NFData a4, NFData a5, NFData a6, NFData a7, NFData a8, NFData a9) => NFData (a1, a2, a3, a4, a5, a6, a7, a8, a9) | |
Defined in Control.DeepSeq | |
A Map from keys k to values a.
Instances
| Eq2 Map | Since: containers-0.5.9 |
| Ord2 Map | Since: containers-0.5.9 |
Defined in Data.Map.Internal | |
| Show2 Map | Since: containers-0.5.9 |
| BiPolyMap Map | |
Defined in Data.Containers Associated Types type BPMKeyConstraint Map key :: Constraint # Methods mapKeysWith :: (BPMKeyConstraint Map k1, BPMKeyConstraint Map k2) => (v -> v -> v) -> (k1 -> k2) -> Map k1 v -> Map k2 v # | |
| FunctorWithIndex k (Map k) | |
Defined in Control.Lens.Indexed | |
| FoldableWithIndex k (Map k) | |
| TraversableWithIndex k (Map k) | |
Defined in Control.Lens.Indexed Methods itraverse :: Applicative f => (k -> a -> f b) -> Map k a -> f (Map k b) # itraversed :: IndexedTraversal k (Map k a) (Map k b) a b # | |
| Functor (Map k) | |
| Foldable (Map k) | |
Defined in Data.Map.Internal Methods fold :: Monoid m => Map k m -> m # foldMap :: Monoid m => (a -> m) -> Map k a -> m # foldr :: (a -> b -> b) -> b -> Map k a -> b # foldr' :: (a -> b -> b) -> b -> Map k a -> b # foldl :: (b -> a -> b) -> b -> Map k a -> b # foldl' :: (b -> a -> b) -> b -> Map k a -> b # foldr1 :: (a -> a -> a) -> Map k a -> a # foldl1 :: (a -> a -> a) -> Map k a -> a # elem :: Eq a => a -> Map k a -> Bool # maximum :: Ord a => Map k a -> a # minimum :: Ord a => Map k a -> a # | |
| Traversable (Map k) | |
| 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 |
| Ord key => PolyMap (Map key) | This instance uses the functions from Data.Map.Strict. |
Defined in Data.Containers Methods differenceMap :: Map key value1 -> Map key value2 -> Map key value1 # intersectionMap :: Map key value1 -> Map key value2 -> Map key value1 # intersectionWithMap :: (value1 -> value2 -> value3) -> Map key value1 -> Map key value2 -> Map key value3 # | |
| Keyed (Map k) | |
| Ord k => Zip (Map k) | |
| Ord k => ZipWithKey (Map k) | |
| Ord k => Indexable (Map k) | |
| Ord k => Lookup (Map k) | |
| Ord k => Adjustable (Map k) | |
| FoldableWithKey (Map k) | |
| TraversableWithKey (Map k) | |
Defined in Data.Key Methods traverseWithKey :: Applicative f => (Key (Map k) -> a -> f b) -> Map k a -> f (Map k b) # mapWithKeyM :: Monad m => (Key (Map k) -> a -> m b) -> Map k a -> m (Map k b) # | |
| Ord k => Apply (Map k) | A Map is not |
| Ord k => Bind (Map k) | |
| Ord k => IsList (Map k v) | Since: containers-0.5.6.2 |
| (Eq k, Eq a) => Eq (Map k a) | |
| (Data k, Data a, Ord k) => Data (Map k a) | |
Defined in Data.Map.Internal Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Map k a -> c (Map k a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Map k a) # toConstr :: Map k a -> Constr # dataTypeOf :: Map k a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Map k a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Map k a)) # gmapT :: (forall b. Data b => b -> b) -> Map k a -> Map k a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Map k a -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Map k a -> r # gmapQ :: (forall d. Data d => d -> u) -> Map k a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Map k a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Map k a -> m (Map k a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Map k a -> m (Map k a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Map k a -> m (Map k a) # | |
| (Ord k, Ord v) => Ord (Map k v) | |
| (Ord k, Read k, Read e) => Read (Map k e) | |
| (Show k, Show a) => Show (Map k a) | |
| Ord k => Semigroup (Map k v) | |
| Ord k => Monoid (Map k v) | |
| (NFData k, NFData a) => NFData (Map k a) | |
Defined in Data.Map.Internal | |
| Ord k => GrowingAppend (Map k v) | |
Defined in Data.MonoTraversable | |
| MonoTraversable (Map k v) | |
| MonoFoldable (Map k v) | |
Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element (Map k v) -> m) -> Map k v -> m # ofoldr :: (Element (Map k v) -> b -> b) -> b -> Map k v -> b # ofoldl' :: (a -> Element (Map k v) -> a) -> a -> Map k v -> a # otoList :: Map k v -> [Element (Map k v)] # oall :: (Element (Map k v) -> Bool) -> Map k v -> Bool # oany :: (Element (Map k v) -> Bool) -> Map k v -> Bool # olength64 :: Map k v -> Int64 # ocompareLength :: Integral i => Map k v -> i -> Ordering # otraverse_ :: Applicative f => (Element (Map k v) -> f b) -> Map k v -> f () # ofor_ :: Applicative f => Map k v -> (Element (Map k v) -> f b) -> f () # omapM_ :: Applicative m => (Element (Map k v) -> m ()) -> Map k v -> m () # oforM_ :: Applicative m => Map k v -> (Element (Map k v) -> m ()) -> m () # ofoldlM :: Monad m => (a -> Element (Map k v) -> m a) -> a -> Map k v -> m a # ofoldMap1Ex :: Semigroup m => (Element (Map k v) -> m) -> Map k v -> m # ofoldr1Ex :: (Element (Map k v) -> Element (Map k v) -> Element (Map k v)) -> Map k v -> Element (Map k v) # ofoldl1Ex' :: (Element (Map k v) -> Element (Map k v) -> Element (Map k v)) -> Map k v -> Element (Map k v) # headEx :: Map k v -> Element (Map k v) # lastEx :: Map k v -> Element (Map k v) # unsafeHead :: Map k v -> Element (Map k v) # unsafeLast :: Map k v -> Element (Map k v) # maximumByEx :: (Element (Map k v) -> Element (Map k v) -> Ordering) -> Map k v -> Element (Map k v) # minimumByEx :: (Element (Map k v) -> Element (Map k v) -> Ordering) -> Map k v -> Element (Map k v) # | |
| MonoFunctor (Map k v) | |
| Ord k => HasKeysSet (Map k v) | |
| Ord key => IsMap (Map key value) | This instance uses the functions from Data.Map.Strict. |
Defined in Data.Containers Methods lookup :: ContainerKey (Map key value) -> Map key value -> Maybe (MapValue (Map key value)) # insertMap :: ContainerKey (Map key value) -> MapValue (Map key value) -> Map key value -> Map key value # deleteMap :: ContainerKey (Map key value) -> Map key value -> Map key value # singletonMap :: ContainerKey (Map key value) -> MapValue (Map key value) -> Map key value # mapFromList :: [(ContainerKey (Map key value), MapValue (Map key value))] -> Map key value # mapToList :: Map key value -> [(ContainerKey (Map key value), MapValue (Map key value))] # findWithDefault :: MapValue (Map key value) -> ContainerKey (Map key value) -> Map key value -> MapValue (Map key value) # insertWith :: (MapValue (Map key value) -> MapValue (Map key value) -> MapValue (Map key value)) -> ContainerKey (Map key value) -> MapValue (Map key value) -> Map key value -> Map key value # insertWithKey :: (ContainerKey (Map key value) -> MapValue (Map key value) -> MapValue (Map key value) -> MapValue (Map key value)) -> ContainerKey (Map key value) -> MapValue (Map key value) -> Map key value -> Map key value # insertLookupWithKey :: (ContainerKey (Map key value) -> MapValue (Map key value) -> MapValue (Map key value) -> MapValue (Map key value)) -> ContainerKey (Map key value) -> MapValue (Map key value) -> Map key value -> (Maybe (MapValue (Map key value)), Map key value) # adjustMap :: (MapValue (Map key value) -> MapValue (Map key value)) -> ContainerKey (Map key value) -> Map key value -> Map key value # adjustWithKey :: (ContainerKey (Map key value) -> MapValue (Map key value) -> MapValue (Map key value)) -> ContainerKey (Map key value) -> Map key value -> Map key value # updateMap :: (MapValue (Map key value) -> Maybe (MapValue (Map key value))) -> ContainerKey (Map key value) -> Map key value -> Map key value # updateWithKey :: (ContainerKey (Map key value) -> MapValue (Map key value) -> Maybe (MapValue (Map key value))) -> ContainerKey (Map key value) -> Map key value -> Map key value # updateLookupWithKey :: (ContainerKey (Map key value) -> MapValue (Map key value) -> Maybe (MapValue (Map key value))) -> ContainerKey (Map key value) -> Map key value -> (Maybe (MapValue (Map key value)), Map key value) # alterMap :: (Maybe (MapValue (Map key value)) -> Maybe (MapValue (Map key value))) -> ContainerKey (Map key value) -> Map key value -> Map key value # unionWith :: (MapValue (Map key value) -> MapValue (Map key value) -> MapValue (Map key value)) -> Map key value -> Map key value -> Map key value # unionWithKey :: (ContainerKey (Map key value) -> MapValue (Map key value) -> MapValue (Map key value) -> MapValue (Map key value)) -> Map key value -> Map key value -> Map key value # unionsWith :: (MapValue (Map key value) -> MapValue (Map key value) -> MapValue (Map key value)) -> [Map key value] -> Map key value # mapWithKey :: (ContainerKey (Map key value) -> MapValue (Map key value) -> MapValue (Map key value)) -> Map key value -> Map key value # omapKeysWith :: (MapValue (Map key value) -> MapValue (Map key value) -> MapValue (Map key value)) -> (ContainerKey (Map key value) -> ContainerKey (Map key value)) -> Map key value -> Map key value # filterMap :: (MapValue (Map key value) -> Bool) -> Map key value -> Map key value # | |
| Ord k => SetContainer (Map k v) | This instance uses the functions from Data.Map.Strict. |
Defined in Data.Containers Associated Types type ContainerKey (Map k v) :: Type # Methods member :: ContainerKey (Map k v) -> Map k v -> Bool # notMember :: ContainerKey (Map k v) -> Map k v -> Bool # union :: Map k v -> Map k v -> Map k v # unions :: (MonoFoldable mono, Element mono ~ Map k v) => mono -> Map k v # difference :: Map k v -> Map k v -> Map k v # intersection :: Map k v -> Map k v -> Map k v # keys :: Map k v -> [ContainerKey (Map k v)] # | |
| Ord k => Ixed (Map k a) | |
Defined in Control.Lens.At | |
| Ord k => At (Map k a) | |
| Ord k => Wrapped (Map k a) | |
| (t ~ Map k' a', Ord k) => Rewrapped (Map k a) t | Use |
Defined in Control.Lens.Wrapped | |
| type BPMKeyConstraint Map key | |
Defined in Data.Containers | |
| type Key (Map k) | |
| type Item (Map k v) | |
Defined in Data.Map.Internal | |
| type Element (Map k v) | |
Defined in Data.MonoTraversable | |
| type KeySet (Map k v) | |
Defined in Data.Containers | |
| type MapValue (Map key value) | |
Defined in Data.Containers | |
| type ContainerKey (Map k v) | |
Defined in Data.Containers | |
| 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 | |
error :: HasCallStack => [Char] -> a #
error stops execution and displays an error message.
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
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
(=<<) :: Monad m => (a -> m b) -> m a -> m b infixr 1 #
Same as >>=, but with the arguments interchanged.
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.
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
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"
($!) :: (a -> b) -> a -> b infixr 0 #
Strict (call-by-value) application operator. It takes a function and an argument, evaluates the argument to weak head normal form (WHNF), then calls the function with that value.
until :: (a -> Bool) -> (a -> a) -> a -> a #
until p ff until p holds.
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]
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""
fromMaybe :: a -> Maybe a -> a #
The fromMaybe function takes a default value and and Maybe
value. If the Maybe is Nothing, it returns the default values;
otherwise, it returns the value contained in the Maybe.
Examples
Basic usage:
>>>fromMaybe "" (Just "Hello, World!")"Hello, World!"
>>>fromMaybe "" Nothing""
Read an integer from a string using readMaybe. If we fail to
parse an integer, we want to return 0 by default:
>>>import Text.Read ( readMaybe )>>>fromMaybe 0 (readMaybe "5")5>>>fromMaybe 0 (readMaybe "")0
maybeToList :: Maybe a -> [a] #
The maybeToList function returns an empty list when given
Nothing or a singleton list when not given Nothing.
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
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]
(^^) :: (Fractional a, Integral b) => a -> b -> a infixr 8 #
raise a number to an integral power
(<$>) :: 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
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) ...
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
type IOError = IOException #
The Haskell 2010 type for exceptions in the IO monad.
Any I/O operation may raise an IOException instead of returning a result.
For a more general type of exception, including also those that arise
in pure code, see Exception.
In Haskell 2010, this is an opaque type.
userError :: String -> IOError #
Construct an IOException value with a string describing the error.
The fail method of the IO instance of the Monad class raises a
userError, thus:
instance Monad IO where ... fail s = ioError (userError s)
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.
optional :: Alternative f => f a -> f (Maybe a) #
One or none.
for :: (Traversable t, Applicative f) => t a -> (a -> f b) -> f (t b) #
unless :: Applicative f => Bool -> f () -> f () #
The reverse of when.
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.
Instances
The class of types that can be converted to a hash value.
Minimal implementation: hashWithSalt.
Minimal complete definition
Nothing
Methods
hashWithSalt :: Int -> a -> Int infixl 0 #
Return a hash value for the argument, using the given salt.
The general contract of hashWithSalt is:
- If two values are equal according to the
==method, then applying thehashWithSaltmethod on each of the two values must produce the same integer result if the same salt is used in each case. - It is not required that if two values are unequal
according to the
==method, then applying thehashWithSaltmethod on each of the two values must produce distinct integer results. However, the programmer should be aware that producing distinct integer results for unequal values may improve the performance of hashing-based data structures. - This method can be used to compute different hash values for
the same input by providing a different salt in each
application of the method. This implies that any instance
that defines
hashWithSaltmust make use of the salt in its implementation.
Like hashWithSalt, but no salt is used. The default
implementation uses hashWithSalt with some default salt.
Instances might want to implement this method to provide a more
efficient implementation than the default implementation.
Instances
A space efficient, packed, unboxed Unicode text type.
Instances
This is the simplest representation of UTC. It consists of the day number, and a time offset from midnight. Note that if a day has a leap second added to it, it will have 86401 seconds.
Constructors
| UTCTime | |
Fields
| |
Instances
| Eq UTCTime | |
| Data UTCTime | |
Defined in Data.Time.Clock.Internal.UTCTime Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> UTCTime -> c UTCTime # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c UTCTime # toConstr :: UTCTime -> Constr # dataTypeOf :: UTCTime -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c UTCTime) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c UTCTime) # gmapT :: (forall b. Data b => b -> b) -> UTCTime -> UTCTime # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> UTCTime -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> UTCTime -> r # gmapQ :: (forall d. Data d => d -> u) -> UTCTime -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> UTCTime -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> UTCTime -> m UTCTime # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> UTCTime -> m UTCTime # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> UTCTime -> m UTCTime # | |
| Ord UTCTime | |
Defined in Data.Time.Clock.Internal.UTCTime | |
| NFData UTCTime | |
Defined in Data.Time.Clock.Internal.UTCTime | |
| FormatTime UTCTime | |
Defined in Data.Time.Format Methods formatCharacter :: Char -> Maybe (TimeLocale -> Maybe NumericPadOption -> Maybe Int -> UTCTime -> String) # | |
| ParseTime UTCTime | |
Defined in Data.Time.Format.Parse | |
A map from keys to values. A map cannot contain duplicate keys; each key can map to at most one value.
Instances
| Eq2 HashMap | |
| Ord2 HashMap | |
Defined in Data.HashMap.Base | |
| Show2 HashMap | |
| BiPolyMap HashMap | |
Defined in Data.Containers Associated Types type BPMKeyConstraint HashMap key :: Constraint # Methods mapKeysWith :: (BPMKeyConstraint HashMap k1, BPMKeyConstraint HashMap k2) => (v -> v -> v) -> (k1 -> k2) -> HashMap k1 v -> HashMap k2 v # | |
| Hashable2 HashMap | |
Defined in Data.HashMap.Base | |
| FunctorWithIndex k (HashMap k) | |
Defined in Control.Lens.Indexed | |
| FoldableWithIndex k (HashMap k) | |
Defined in Control.Lens.Indexed | |
| TraversableWithIndex k (HashMap k) | |
Defined in Control.Lens.Indexed Methods itraverse :: Applicative f => (k -> a -> f b) -> HashMap k a -> f (HashMap k b) # itraversed :: IndexedTraversal k (HashMap k a) (HashMap k b) a b # | |
| Functor (HashMap k) | |
| Foldable (HashMap k) | |
Defined in Data.HashMap.Base Methods fold :: Monoid m => HashMap k m -> m # foldMap :: Monoid m => (a -> m) -> HashMap k a -> m # foldr :: (a -> b -> b) -> b -> HashMap k a -> b # foldr' :: (a -> b -> b) -> b -> HashMap k a -> b # foldl :: (b -> a -> b) -> b -> HashMap k a -> b # foldl' :: (b -> a -> b) -> b -> HashMap k a -> b # foldr1 :: (a -> a -> a) -> HashMap k a -> a # foldl1 :: (a -> a -> a) -> HashMap k a -> a # toList :: HashMap k a -> [a] # length :: HashMap k a -> Int # elem :: Eq a => a -> HashMap k a -> Bool # maximum :: Ord a => HashMap k a -> a # minimum :: Ord a => HashMap k a -> a # | |
| Traversable (HashMap k) | |
Defined in Data.HashMap.Base | |
| Eq k => Eq1 (HashMap k) | |
| Ord k => Ord1 (HashMap k) | |
Defined in Data.HashMap.Base | |
| (Eq k, Hashable k, Read k) => Read1 (HashMap k) | |
Defined in Data.HashMap.Base | |
| Show k => Show1 (HashMap k) | |
| (Eq key, Hashable key) => PolyMap (HashMap key) | This instance uses the functions from Data.HashMap.Strict. |
Defined in Data.Containers Methods differenceMap :: HashMap key value1 -> HashMap key value2 -> HashMap key value1 # intersectionMap :: HashMap key value1 -> HashMap key value2 -> HashMap key value1 # intersectionWithMap :: (value1 -> value2 -> value3) -> HashMap key value1 -> HashMap key value2 -> HashMap key value3 # | |
| Hashable k => Hashable1 (HashMap k) | |
Defined in Data.HashMap.Base | |
| Keyed (HashMap k) | |
| (Eq k, Hashable k) => Zip (HashMap k) | |
| (Eq k, Hashable k) => ZipWithKey (HashMap k) | |
| (Eq k, Hashable k) => Indexable (HashMap k) | |
| (Eq k, Hashable k) => Lookup (HashMap k) | |
| FoldableWithKey (HashMap k) | |
Defined in Data.Key | |
| TraversableWithKey (HashMap k) | |
Defined in Data.Key Methods traverseWithKey :: Applicative f => (Key (HashMap k) -> a -> f b) -> HashMap k a -> f (HashMap k b) # mapWithKeyM :: Monad m => (Key (HashMap k) -> a -> m b) -> HashMap k a -> m (HashMap k b) # | |
| (Hashable k, Eq k) => Apply (HashMap k) | A |
| (Hashable k, Eq k) => Bind (HashMap k) | |
| (Eq k, Hashable k) => IsList (HashMap k v) | |
| (Eq k, Eq v) => Eq (HashMap k v) | |
| (Data k, Data v, Eq k, Hashable k) => Data (HashMap k v) | |
Defined in Data.HashMap.Base Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> HashMap k v -> c (HashMap k v) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (HashMap k v) # toConstr :: HashMap k v -> Constr # dataTypeOf :: HashMap k v -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (HashMap k v)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (HashMap k v)) # gmapT :: (forall b. Data b => b -> b) -> HashMap k v -> HashMap k v # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> HashMap k v -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> HashMap k v -> r # gmapQ :: (forall d. Data d => d -> u) -> HashMap k v -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> HashMap k v -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> HashMap k v -> m (HashMap k v) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> HashMap k v -> m (HashMap k v) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> HashMap k v -> m (HashMap k v) # | |
| (Ord k, Ord v) => Ord (HashMap k v) | The order is total. Note: Because the hash is not guaranteed to be stable across library
versions, OSes, or architectures, neither is an actual order of elements in
|
Defined in Data.HashMap.Base | |
| (Eq k, Hashable k, Read k, Read e) => Read (HashMap k e) | |
| (Show k, Show v) => Show (HashMap k v) | |
| (Eq k, Hashable k) => Semigroup (HashMap k v) | |
| (Eq k, Hashable k) => Monoid (HashMap k v) | |
| (NFData k, NFData v) => NFData (HashMap k v) | |
Defined in Data.HashMap.Base | |
| (Hashable k, Hashable v) => Hashable (HashMap k v) | |
Defined in Data.HashMap.Base | |
| (Eq k, Hashable k) => GrowingAppend (HashMap k v) | |
Defined in Data.MonoTraversable | |
| MonoTraversable (HashMap k v) | |
| MonoFoldable (HashMap k v) | |
Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element (HashMap k v) -> m) -> HashMap k v -> m # ofoldr :: (Element (HashMap k v) -> b -> b) -> b -> HashMap k v -> b # ofoldl' :: (a -> Element (HashMap k v) -> a) -> a -> HashMap k v -> a # otoList :: HashMap k v -> [Element (HashMap k v)] # oall :: (Element (HashMap k v) -> Bool) -> HashMap k v -> Bool # oany :: (Element (HashMap k v) -> Bool) -> HashMap k v -> Bool # onull :: HashMap k v -> Bool # olength :: HashMap k v -> Int # olength64 :: HashMap k v -> Int64 # ocompareLength :: Integral i => HashMap k v -> i -> Ordering # otraverse_ :: Applicative f => (Element (HashMap k v) -> f b) -> HashMap k v -> f () # ofor_ :: Applicative f => HashMap k v -> (Element (HashMap k v) -> f b) -> f () # omapM_ :: Applicative m => (Element (HashMap k v) -> m ()) -> HashMap k v -> m () # oforM_ :: Applicative m => HashMap k v -> (Element (HashMap k v) -> m ()) -> m () # ofoldlM :: Monad m => (a -> Element (HashMap k v) -> m a) -> a -> HashMap k v -> m a # ofoldMap1Ex :: Semigroup m => (Element (HashMap k v) -> m) -> HashMap k v -> m # ofoldr1Ex :: (Element (HashMap k v) -> Element (HashMap k v) -> Element (HashMap k v)) -> HashMap k v -> Element (HashMap k v) # ofoldl1Ex' :: (Element (HashMap k v) -> Element (HashMap k v) -> Element (HashMap k v)) -> HashMap k v -> Element (HashMap k v) # headEx :: HashMap k v -> Element (HashMap k v) # lastEx :: HashMap k v -> Element (HashMap k v) # unsafeHead :: HashMap k v -> Element (HashMap k v) # unsafeLast :: HashMap k v -> Element (HashMap k v) # maximumByEx :: (Element (HashMap k v) -> Element (HashMap k v) -> Ordering) -> HashMap k v -> Element (HashMap k v) # minimumByEx :: (Element (HashMap k v) -> Element (HashMap k v) -> Ordering) -> HashMap k v -> Element (HashMap k v) # | |
| MonoFunctor (HashMap k v) | |
| (Hashable k, Eq k) => HasKeysSet (HashMap k v) | |
| (Eq key, Hashable key) => IsMap (HashMap key value) | This instance uses the functions from Data.HashMap.Strict. |
Defined in Data.Containers Methods lookup :: ContainerKey (HashMap key value) -> HashMap key value -> Maybe (MapValue (HashMap key value)) # insertMap :: ContainerKey (HashMap key value) -> MapValue (HashMap key value) -> HashMap key value -> HashMap key value # deleteMap :: ContainerKey (HashMap key value) -> HashMap key value -> HashMap key value # singletonMap :: ContainerKey (HashMap key value) -> MapValue (HashMap key value) -> HashMap key value # mapFromList :: [(ContainerKey (HashMap key value), MapValue (HashMap key value))] -> HashMap key value # mapToList :: HashMap key value -> [(ContainerKey (HashMap key value), MapValue (HashMap key value))] # findWithDefault :: MapValue (HashMap key value) -> ContainerKey (HashMap key value) -> HashMap key value -> MapValue (HashMap key value) # insertWith :: (MapValue (HashMap key value) -> MapValue (HashMap key value) -> MapValue (HashMap key value)) -> ContainerKey (HashMap key value) -> MapValue (HashMap key value) -> HashMap key value -> HashMap key value # insertWithKey :: (ContainerKey (HashMap key value) -> MapValue (HashMap key value) -> MapValue (HashMap key value) -> MapValue (HashMap key value)) -> ContainerKey (HashMap key value) -> MapValue (HashMap key value) -> HashMap key value -> HashMap key value # insertLookupWithKey :: (ContainerKey (HashMap key value) -> MapValue (HashMap key value) -> MapValue (HashMap key value) -> MapValue (HashMap key value)) -> ContainerKey (HashMap key value) -> MapValue (HashMap key value) -> HashMap key value -> (Maybe (MapValue (HashMap key value)), HashMap key value) # adjustMap :: (MapValue (HashMap key value) -> MapValue (HashMap key value)) -> ContainerKey (HashMap key value) -> HashMap key value -> HashMap key value # adjustWithKey :: (ContainerKey (HashMap key value) -> MapValue (HashMap key value) -> MapValue (HashMap key value)) -> ContainerKey (HashMap key value) -> HashMap key value -> HashMap key value # updateMap :: (MapValue (HashMap key value) -> Maybe (MapValue (HashMap key value))) -> ContainerKey (HashMap key value) -> HashMap key value -> HashMap key value # updateWithKey :: (ContainerKey (HashMap key value) -> MapValue (HashMap key value) -> Maybe (MapValue (HashMap key value))) -> ContainerKey (HashMap key value) -> HashMap key value -> HashMap key value # updateLookupWithKey :: (ContainerKey (HashMap key value) -> MapValue (HashMap key value) -> Maybe (MapValue (HashMap key value))) -> ContainerKey (HashMap key value) -> HashMap key value -> (Maybe (MapValue (HashMap key value)), HashMap key value) # alterMap :: (Maybe (MapValue (HashMap key value)) -> Maybe (MapValue (HashMap key value))) -> ContainerKey (HashMap key value) -> HashMap key value -> HashMap key value # unionWith :: (MapValue (HashMap key value) -> MapValue (HashMap key value) -> MapValue (HashMap key value)) -> HashMap key value -> HashMap key value -> HashMap key value # unionWithKey :: (ContainerKey (HashMap key value) -> MapValue (HashMap key value) -> MapValue (HashMap key value) -> MapValue (HashMap key value)) -> HashMap key value -> HashMap key value -> HashMap key value # unionsWith :: (MapValue (HashMap key value) -> MapValue (HashMap key value) -> MapValue (HashMap key value)) -> [HashMap key value] -> HashMap key value # mapWithKey :: (ContainerKey (HashMap key value) -> MapValue (HashMap key value) -> MapValue (HashMap key value)) -> HashMap key value -> HashMap key value # omapKeysWith :: (MapValue (HashMap key value) -> MapValue (HashMap key value) -> MapValue (HashMap key value)) -> (ContainerKey (HashMap key value) -> ContainerKey (HashMap key value)) -> HashMap key value -> HashMap key value # filterMap :: (MapValue (HashMap key value) -> Bool) -> HashMap key value -> HashMap key value # | |
| (Eq key, Hashable key) => SetContainer (HashMap key value) | This instance uses the functions from Data.HashMap.Strict. |
Defined in Data.Containers Associated Types type ContainerKey (HashMap key value) :: Type # Methods member :: ContainerKey (HashMap key value) -> HashMap key value -> Bool # notMember :: ContainerKey (HashMap key value) -> HashMap key value -> Bool # union :: HashMap key value -> HashMap key value -> HashMap key value # unions :: (MonoFoldable mono, Element mono ~ HashMap key value) => mono -> HashMap key value # difference :: HashMap key value -> HashMap key value -> HashMap key value # intersection :: HashMap key value -> HashMap key value -> HashMap key value # keys :: HashMap key value -> [ContainerKey (HashMap key value)] # | |
| (Eq k, Hashable k) => Ixed (HashMap k a) | |
Defined in Control.Lens.At | |
| (Eq k, Hashable k) => At (HashMap k a) | |
| (Hashable k, Eq k) => Wrapped (HashMap k a) | |
| (t ~ HashMap k' a', Hashable k, Eq k) => Rewrapped (HashMap k a) t | Use |
Defined in Control.Lens.Wrapped | |
| type BPMKeyConstraint HashMap key | |
Defined in Data.Containers | |
| type Key (HashMap k) | |
| type Item (HashMap k v) | |
Defined in Data.HashMap.Base | |
| type Element (HashMap k v) | |
Defined in Data.MonoTraversable | |
| type KeySet (HashMap k v) | |
Defined in Data.Containers | |
| type MapValue (HashMap key value) | |
Defined in Data.Containers | |
| type ContainerKey (HashMap key value) | |
Defined in Data.Containers | |
| 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 | |
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.
waitBothSTM :: Async a -> Async b -> STM (a, b) #
A version of waitBoth that can be used inside an STM transaction.
Since: async-2.1.0
waitEitherSTM_ :: Async a -> Async b -> STM () #
A version of waitEither_ that can be used inside an STM transaction.
Since: async-2.1.0
waitEitherSTM :: Async a -> Async b -> STM (Either a b) #
A version of waitEither that can be used inside an STM transaction.
Since: async-2.1.0
waitEitherCatchSTM :: Async a -> Async b -> STM (Either (Either SomeException a) (Either SomeException b)) #
A version of waitEitherCatch that can be used inside an STM transaction.
Since: async-2.1.0
waitAnySTM :: [Async a] -> STM (Async a, a) #
A version of waitAny that can be used inside an STM transaction.
Since: async-2.1.0
waitAnyCatchSTM :: [Async a] -> STM (Async a, Either SomeException a) #
A version of waitAnyCatch that can be used inside an STM transaction.
Since: async-2.1.0
pollSTM :: Async a -> STM (Maybe (Either SomeException a)) #
A version of poll that can be used inside an STM transaction.
waitCatchSTM :: Async a -> STM (Either SomeException a) #
A version of waitCatch that can be used inside an STM transaction.
An asynchronous action spawned by async or withAsync.
Asynchronous actions are executed in a separate thread, and
operations are provided for waiting for asynchronous actions to
complete and obtaining their results (see e.g. wait).
Instances
| Functor Async | |
| Eq (Async a) | |
| Ord (Async a) | |
Defined in Control.Concurrent.Async | |
| Hashable (Async a) | |
Defined in Control.Concurrent.Async | |
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 -> () # | |
| Bounded m => Bounded (WrappedMonoid m) | Since: base-4.9.0.0 |
Defined in Data.Semigroup | |
| Enum a => Enum (WrappedMonoid a) | Since: base-4.9.0.0 |
Defined in Data.Semigroup Methods succ :: WrappedMonoid a -> WrappedMonoid a # pred :: WrappedMonoid a -> WrappedMonoid a # toEnum :: Int -> WrappedMonoid a # fromEnum :: WrappedMonoid a -> Int # enumFrom :: WrappedMonoid a -> [WrappedMonoid a] # enumFromThen :: WrappedMonoid a -> WrappedMonoid a -> [WrappedMonoid a] # enumFromTo :: WrappedMonoid a -> WrappedMonoid a -> [WrappedMonoid a] # enumFromThenTo :: WrappedMonoid a -> WrappedMonoid a -> WrappedMonoid a -> [WrappedMonoid a] # | |
| Eq m => Eq (WrappedMonoid m) | Since: base-4.9.0.0 |
Defined in Data.Semigroup Methods (==) :: WrappedMonoid m -> WrappedMonoid m -> Bool # (/=) :: WrappedMonoid m -> WrappedMonoid m -> Bool # | |
| Data m => Data (WrappedMonoid m) | Since: base-4.9.0.0 |
Defined in Data.Semigroup Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> WrappedMonoid m -> c (WrappedMonoid m) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (WrappedMonoid m) # toConstr :: WrappedMonoid m -> Constr # dataTypeOf :: WrappedMonoid m -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (WrappedMonoid m)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (WrappedMonoid m)) # gmapT :: (forall b. Data b => b -> b) -> WrappedMonoid m -> WrappedMonoid m # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> WrappedMonoid m -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> WrappedMonoid m -> r # gmapQ :: (forall d. Data d => d -> u) -> WrappedMonoid m -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> WrappedMonoid m -> u # gmapM :: Monad m0 => (forall d. Data d => d -> m0 d) -> WrappedMonoid m -> m0 (WrappedMonoid m) # gmapMp :: MonadPlus m0 => (forall d. Data d => d -> m0 d) -> WrappedMonoid m -> m0 (WrappedMonoid m) # gmapMo :: MonadPlus m0 => (forall d. Data d => d -> m0 d) -> WrappedMonoid m -> m0 (WrappedMonoid m) # | |
| Ord m => Ord (WrappedMonoid m) | Since: base-4.9.0.0 |
Defined in Data.Semigroup Methods compare :: WrappedMonoid m -> WrappedMonoid m -> Ordering # (<) :: WrappedMonoid m -> WrappedMonoid m -> Bool # (<=) :: WrappedMonoid m -> WrappedMonoid m -> Bool # (>) :: WrappedMonoid m -> WrappedMonoid m -> Bool # (>=) :: WrappedMonoid m -> WrappedMonoid m -> Bool # max :: WrappedMonoid m -> WrappedMonoid m -> WrappedMonoid m # min :: WrappedMonoid m -> WrappedMonoid m -> WrappedMonoid m # | |
| Read m => Read (WrappedMonoid m) | Since: base-4.9.0.0 |
Defined in Data.Semigroup Methods readsPrec :: Int -> ReadS (WrappedMonoid m) # readList :: ReadS [WrappedMonoid m] # readPrec :: ReadPrec (WrappedMonoid m) # readListPrec :: ReadPrec [WrappedMonoid m] # | |
| Show m => Show (WrappedMonoid m) | Since: base-4.9.0.0 |
Defined in Data.Semigroup Methods showsPrec :: Int -> WrappedMonoid m -> ShowS # show :: WrappedMonoid m -> String # showList :: [WrappedMonoid m] -> ShowS # | |
| Generic (WrappedMonoid m) | |
Defined in Data.Semigroup Associated Types type Rep (WrappedMonoid m) :: Type -> Type # Methods from :: WrappedMonoid m -> Rep (WrappedMonoid m) x # to :: Rep (WrappedMonoid m) x -> WrappedMonoid m # | |
| Monoid m => Semigroup (WrappedMonoid m) | Since: base-4.9.0.0 |
Defined in Data.Semigroup Methods (<>) :: WrappedMonoid m -> WrappedMonoid m -> WrappedMonoid m # sconcat :: NonEmpty (WrappedMonoid m) -> WrappedMonoid m # stimes :: Integral b => b -> WrappedMonoid m -> WrappedMonoid m # | |
| Monoid m => Monoid (WrappedMonoid m) | Since: base-4.9.0.0 |
Defined in Data.Semigroup Methods mempty :: WrappedMonoid m # mappend :: WrappedMonoid m -> WrappedMonoid m -> WrappedMonoid m # mconcat :: [WrappedMonoid m] -> WrappedMonoid m # | |
| NFData m => NFData (WrappedMonoid m) | Since: deepseq-1.4.2.0 |
Defined in Control.DeepSeq Methods rnf :: 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) :: Type # Methods _Wrapped' :: Iso' (WrappedMonoid a) (Unwrapped (WrappedMonoid a)) # | |
| Generic1 WrappedMonoid | |
Defined in Data.Semigroup Associated Types type Rep1 WrappedMonoid :: k -> Type # Methods from1 :: WrappedMonoid a -> Rep1 WrappedMonoid a # to1 :: Rep1 WrappedMonoid a -> WrappedMonoid a # | |
| t ~ WrappedMonoid b => Rewrapped (WrappedMonoid a) t | |
Defined in Control.Lens.Wrapped | |
| SuppressUnusedWarnings (ToEnum_6989586621681105990Sym0 :: TyFun Nat (WrappedMonoid a6989586621681093854) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621681056304Sym0 :: TyFun Nat (WrappedMonoid m6989586621679061679 ~> (Symbol ~> Symbol)) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (WrapMonoidSym0 :: TyFun m6989586621679061679 (WrappedMonoid m6989586621679061679) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (UnwrapMonoidSym0 :: TyFun (WrappedMonoid m6989586621679061679) m6989586621679061679 -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680201570Sym0 :: TyFun (WrappedMonoid m6989586621679061679) (WrappedMonoid m6989586621679061679 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621681105964Sym0 :: TyFun (WrappedMonoid m6989586621681093846) (WrappedMonoid m6989586621681093846 ~> WrappedMonoid m6989586621681093846) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Succ_6989586621681105974Sym0 :: TyFun (WrappedMonoid a6989586621681093854) (WrappedMonoid a6989586621681093854) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Pred_6989586621681105981Sym0 :: TyFun (WrappedMonoid a6989586621681093854) (WrappedMonoid a6989586621681093854) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FromEnum_6989586621681105997Sym0 :: TyFun (WrappedMonoid a6989586621681093854) Nat -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (EnumFromTo_6989586621681106011Sym0 :: TyFun (WrappedMonoid a6989586621681093854) (WrappedMonoid a6989586621681093854 ~> [WrappedMonoid a6989586621681093854]) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (EnumFromThenTo_6989586621681106027Sym0 :: TyFun (WrappedMonoid a6989586621681093854) (WrappedMonoid a6989586621681093854 ~> (WrappedMonoid a6989586621681093854 ~> [WrappedMonoid a6989586621681093854])) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () # | |
| SingI (WrapMonoidSym0 :: TyFun m (WrappedMonoid m) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods sing :: Sing WrapMonoidSym0 # | |
| SuppressUnusedWarnings (Compare_6989586621680201570Sym1 a6989586621680201568 :: TyFun (WrappedMonoid m6989586621679061679) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621681105964Sym1 a6989586621681105962 :: TyFun (WrappedMonoid m6989586621681093846) (WrappedMonoid m6989586621681093846) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621681056304Sym1 a6989586621681056301 m6989586621679061679 :: TyFun (WrappedMonoid m6989586621679061679) (Symbol ~> Symbol) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (EnumFromTo_6989586621681106011Sym1 a6989586621681106009 :: TyFun (WrappedMonoid a6989586621681093854) [WrappedMonoid a6989586621681093854] -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (EnumFromThenTo_6989586621681106027Sym1 a6989586621681106024 :: TyFun (WrappedMonoid a6989586621681093854) (WrappedMonoid a6989586621681093854 ~> [WrappedMonoid a6989586621681093854]) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (EnumFromThenTo_6989586621681106027Sym2 a6989586621681106025 a6989586621681106024 :: TyFun (WrappedMonoid a6989586621681093854) [WrappedMonoid a6989586621681093854] -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () # | |
| type Apply (FromEnum_6989586621681105997Sym0 :: TyFun (WrappedMonoid a) Nat -> Type) (a6989586621681105996 :: WrappedMonoid a) | |
Defined in Data.Singletons.Prelude.Semigroup type Apply (FromEnum_6989586621681105997Sym0 :: TyFun (WrappedMonoid a) Nat -> Type) (a6989586621681105996 :: WrappedMonoid a) = FromEnum_6989586621681105997 a6989586621681105996 | |
| type Apply (UnwrapMonoidSym0 :: TyFun (WrappedMonoid m) m -> Type) (a6989586621680191558 :: WrappedMonoid m) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply (UnwrapMonoidSym0 :: TyFun (WrappedMonoid m) m -> Type) (a6989586621680191558 :: WrappedMonoid m) = UnwrapMonoid a6989586621680191558 | |
| type Apply (Compare_6989586621680201570Sym1 a6989586621680201568 :: TyFun (WrappedMonoid m) Ordering -> Type) (a6989586621680201569 :: WrappedMonoid m) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply (Compare_6989586621680201570Sym1 a6989586621680201568 :: TyFun (WrappedMonoid m) Ordering -> Type) (a6989586621680201569 :: WrappedMonoid m) = Compare_6989586621680201570 a6989586621680201568 a6989586621680201569 | |
| 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 Mempty | |
Defined in Data.Singletons.Prelude.Semigroup | |
| type MaxBound | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type MinBound | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| data Sing (a :: WrappedMonoid m) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal data Sing (a :: WrappedMonoid m) where
| |
| type Demote (WrappedMonoid m) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| 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.Singletons.Prelude.Semigroup type Mconcat (arg :: [WrappedMonoid m]) = Apply (Mconcat_6989586621680651658Sym0 :: TyFun [WrappedMonoid m] (WrappedMonoid m) -> Type) arg | |
| type Show_ (arg :: WrappedMonoid m) | |
Defined in Data.Singletons.Prelude.Semigroup type Show_ (arg :: WrappedMonoid m) = Apply (Show__6989586621680567941Sym0 :: TyFun (WrappedMonoid m) Symbol -> Type) arg | |
| type Sconcat (arg :: NonEmpty (WrappedMonoid m)) | |
Defined in Data.Singletons.Prelude.Semigroup type Sconcat (arg :: NonEmpty (WrappedMonoid m)) = Apply (Sconcat_6989586621680176420Sym0 :: TyFun (NonEmpty (WrappedMonoid m)) (WrappedMonoid m) -> Type) arg | |
| type FromEnum (a2 :: WrappedMonoid a1) | |
Defined in Data.Singletons.Prelude.Semigroup type FromEnum (a2 :: WrappedMonoid a1) = Apply (FromEnum_6989586621681105997Sym0 :: TyFun (WrappedMonoid a1) Nat -> Type) a2 | |
| type ToEnum a2 | |
Defined in Data.Singletons.Prelude.Semigroup | |
| type Pred (a2 :: WrappedMonoid a1) | |
Defined in Data.Singletons.Prelude.Semigroup type Pred (a2 :: WrappedMonoid a1) = Apply (Pred_6989586621681105981Sym0 :: TyFun (WrappedMonoid a1) (WrappedMonoid a1) -> Type) a2 | |
| type Succ (a2 :: WrappedMonoid a1) | |
Defined in Data.Singletons.Prelude.Semigroup type Succ (a2 :: WrappedMonoid a1) = Apply (Succ_6989586621681105974Sym0 :: TyFun (WrappedMonoid a1) (WrappedMonoid a1) -> Type) a2 | |
| type Mappend (arg1 :: WrappedMonoid m) (arg2 :: WrappedMonoid m) | |
Defined in Data.Singletons.Prelude.Semigroup type Mappend (arg1 :: WrappedMonoid m) (arg2 :: WrappedMonoid m) = Apply (Apply (Mappend_6989586621680651648Sym0 :: TyFun (WrappedMonoid m) (WrappedMonoid m ~> WrappedMonoid m) -> Type) arg1) arg2 | |
| type ShowList (arg1 :: [WrappedMonoid m]) arg2 | |
Defined in Data.Singletons.Prelude.Semigroup type ShowList (arg1 :: [WrappedMonoid m]) arg2 = Apply (Apply (ShowList_6989586621680567952Sym0 :: TyFun [WrappedMonoid m] (Symbol ~> Symbol) -> Type) arg1) arg2 | |
| type (a1 :: WrappedMonoid m) <> (a2 :: WrappedMonoid m) | |
Defined in Data.Singletons.Prelude.Semigroup type (a1 :: WrappedMonoid m) <> (a2 :: WrappedMonoid m) = Apply (Apply (TFHelper_6989586621681105964Sym0 :: TyFun (WrappedMonoid m) (WrappedMonoid m ~> WrappedMonoid m) -> Type) a1) a2 | |
| type EnumFromTo (a2 :: WrappedMonoid a1) (a3 :: WrappedMonoid a1) | |
Defined in Data.Singletons.Prelude.Semigroup type EnumFromTo (a2 :: WrappedMonoid a1) (a3 :: WrappedMonoid a1) = Apply (Apply (EnumFromTo_6989586621681106011Sym0 :: TyFun (WrappedMonoid a1) (WrappedMonoid a1 ~> [WrappedMonoid a1]) -> Type) a2) a3 | |
| type Min (arg1 :: WrappedMonoid m) (arg2 :: WrappedMonoid m) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal type Min (arg1 :: WrappedMonoid m) (arg2 :: WrappedMonoid m) = Apply (Apply (Min_6989586621679815828Sym0 :: TyFun (WrappedMonoid m) (WrappedMonoid m ~> WrappedMonoid m) -> Type) arg1) arg2 | |
| type Max (arg1 :: WrappedMonoid m) (arg2 :: WrappedMonoid m) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal type Max (arg1 :: WrappedMonoid m) (arg2 :: WrappedMonoid m) = Apply (Apply (Max_6989586621679815808Sym0 :: TyFun (WrappedMonoid m) (WrappedMonoid m ~> WrappedMonoid m) -> Type) arg1) arg2 | |
| type (arg1 :: WrappedMonoid m) >= (arg2 :: WrappedMonoid m) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal type (arg1 :: WrappedMonoid m) >= (arg2 :: WrappedMonoid m) = Apply (Apply (TFHelper_6989586621679815779Sym0 :: TyFun (WrappedMonoid m) (WrappedMonoid m ~> Bool) -> Type) arg1) arg2 | |
| type (arg1 :: WrappedMonoid m) > (arg2 :: WrappedMonoid m) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal type (arg1 :: WrappedMonoid m) > (arg2 :: WrappedMonoid m) = Apply (Apply (TFHelper_6989586621679815755Sym0 :: TyFun (WrappedMonoid m) (WrappedMonoid m ~> Bool) -> Type) arg1) arg2 | |
| type (arg1 :: WrappedMonoid m) <= (arg2 :: WrappedMonoid m) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal type (arg1 :: WrappedMonoid m) <= (arg2 :: WrappedMonoid m) = Apply (Apply (TFHelper_6989586621679815734Sym0 :: TyFun (WrappedMonoid m) (WrappedMonoid m ~> Bool) -> Type) arg1) arg2 | |
| type (arg1 :: WrappedMonoid m) < (arg2 :: WrappedMonoid m) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal type (arg1 :: WrappedMonoid m) < (arg2 :: WrappedMonoid m) = Apply (Apply (TFHelper_6989586621679815712Sym0 :: TyFun (WrappedMonoid m) (WrappedMonoid m ~> Bool) -> Type) arg1) arg2 | |
| type Compare (a1 :: WrappedMonoid m) (a2 :: WrappedMonoid m) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal type Compare (a1 :: WrappedMonoid m) (a2 :: WrappedMonoid m) = Apply (Apply (Compare_6989586621680201570Sym0 :: TyFun (WrappedMonoid m) (WrappedMonoid m ~> Ordering) -> Type) a1) a2 | |
| type (x :: WrappedMonoid m) /= (y :: WrappedMonoid m) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type (a :: WrappedMonoid m) == (b :: WrappedMonoid m) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type ShowsPrec a1 (a2 :: WrappedMonoid m) a3 | |
Defined in Data.Singletons.Prelude.Semigroup | |
| type EnumFromThenTo (a2 :: WrappedMonoid a1) (a3 :: WrappedMonoid a1) (a4 :: WrappedMonoid a1) | |
Defined in Data.Singletons.Prelude.Semigroup type EnumFromThenTo (a2 :: WrappedMonoid a1) (a3 :: WrappedMonoid a1) (a4 :: WrappedMonoid a1) = Apply (Apply (Apply (EnumFromThenTo_6989586621681106027Sym0 :: TyFun (WrappedMonoid a1) (WrappedMonoid a1 ~> (WrappedMonoid a1 ~> [WrappedMonoid a1])) -> Type) a2) a3) a4 | |
| type Apply (WrapMonoidSym0 :: TyFun m (WrappedMonoid m) -> Type) (t6989586621680191561 :: m) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply (WrapMonoidSym0 :: TyFun m (WrappedMonoid m) -> Type) (t6989586621680191561 :: m) = WrapMonoid t6989586621680191561 | |
| type Apply (ToEnum_6989586621681105990Sym0 :: TyFun Nat (WrappedMonoid a6989586621681093854) -> Type) (a6989586621681105989 :: Nat) | |
Defined in Data.Singletons.Prelude.Semigroup type Apply (ToEnum_6989586621681105990Sym0 :: TyFun Nat (WrappedMonoid a6989586621681093854) -> Type) (a6989586621681105989 :: Nat) = (ToEnum_6989586621681105990 a6989586621681105989 :: WrappedMonoid a6989586621681093854) | |
| type Apply (Succ_6989586621681105974Sym0 :: TyFun (WrappedMonoid a) (WrappedMonoid a) -> Type) (a6989586621681105973 :: WrappedMonoid a) | |
Defined in Data.Singletons.Prelude.Semigroup type Apply (Succ_6989586621681105974Sym0 :: TyFun (WrappedMonoid a) (WrappedMonoid a) -> Type) (a6989586621681105973 :: WrappedMonoid a) = Succ_6989586621681105974 a6989586621681105973 | |
| type Apply (Pred_6989586621681105981Sym0 :: TyFun (WrappedMonoid a) (WrappedMonoid a) -> Type) (a6989586621681105980 :: WrappedMonoid a) | |
Defined in Data.Singletons.Prelude.Semigroup type Apply (Pred_6989586621681105981Sym0 :: TyFun (WrappedMonoid a) (WrappedMonoid a) -> Type) (a6989586621681105980 :: WrappedMonoid a) = Pred_6989586621681105981 a6989586621681105980 | |
| type Apply (EnumFromTo_6989586621681106011Sym1 a6989586621681106009 :: TyFun (WrappedMonoid a) [WrappedMonoid a] -> Type) (a6989586621681106010 :: WrappedMonoid a) | |
Defined in Data.Singletons.Prelude.Semigroup type Apply (EnumFromTo_6989586621681106011Sym1 a6989586621681106009 :: TyFun (WrappedMonoid a) [WrappedMonoid a] -> Type) (a6989586621681106010 :: WrappedMonoid a) = EnumFromTo_6989586621681106011 a6989586621681106009 a6989586621681106010 | |
| type Apply (TFHelper_6989586621681105964Sym1 a6989586621681105962 :: TyFun (WrappedMonoid m) (WrappedMonoid m) -> Type) (a6989586621681105963 :: WrappedMonoid m) | |
Defined in Data.Singletons.Prelude.Semigroup type Apply (TFHelper_6989586621681105964Sym1 a6989586621681105962 :: TyFun (WrappedMonoid m) (WrappedMonoid m) -> Type) (a6989586621681105963 :: WrappedMonoid m) = TFHelper_6989586621681105964 a6989586621681105962 a6989586621681105963 | |
| type Apply (EnumFromThenTo_6989586621681106027Sym2 a6989586621681106025 a6989586621681106024 :: TyFun (WrappedMonoid a) [WrappedMonoid a] -> Type) (a6989586621681106026 :: WrappedMonoid a) | |
Defined in Data.Singletons.Prelude.Semigroup type Apply (EnumFromThenTo_6989586621681106027Sym2 a6989586621681106025 a6989586621681106024 :: TyFun (WrappedMonoid a) [WrappedMonoid a] -> Type) (a6989586621681106026 :: WrappedMonoid a) = EnumFromThenTo_6989586621681106027 a6989586621681106025 a6989586621681106024 a6989586621681106026 | |
| type Apply (ShowsPrec_6989586621681056304Sym0 :: TyFun Nat (WrappedMonoid m6989586621679061679 ~> (Symbol ~> Symbol)) -> Type) (a6989586621681056301 :: Nat) | |
Defined in Data.Singletons.Prelude.Semigroup type Apply (ShowsPrec_6989586621681056304Sym0 :: TyFun Nat (WrappedMonoid m6989586621679061679 ~> (Symbol ~> Symbol)) -> Type) (a6989586621681056301 :: Nat) = (ShowsPrec_6989586621681056304Sym1 a6989586621681056301 m6989586621679061679 :: TyFun (WrappedMonoid m6989586621679061679) (Symbol ~> Symbol) -> Type) | |
| type Apply (Compare_6989586621680201570Sym0 :: TyFun (WrappedMonoid m6989586621679061679) (WrappedMonoid m6989586621679061679 ~> Ordering) -> Type) (a6989586621680201568 :: WrappedMonoid m6989586621679061679) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply (Compare_6989586621680201570Sym0 :: TyFun (WrappedMonoid m6989586621679061679) (WrappedMonoid m6989586621679061679 ~> Ordering) -> Type) (a6989586621680201568 :: WrappedMonoid m6989586621679061679) = Compare_6989586621680201570Sym1 a6989586621680201568 | |
| type Apply (TFHelper_6989586621681105964Sym0 :: TyFun (WrappedMonoid m6989586621681093846) (WrappedMonoid m6989586621681093846 ~> WrappedMonoid m6989586621681093846) -> Type) (a6989586621681105962 :: WrappedMonoid m6989586621681093846) | |
Defined in Data.Singletons.Prelude.Semigroup type Apply (TFHelper_6989586621681105964Sym0 :: TyFun (WrappedMonoid m6989586621681093846) (WrappedMonoid m6989586621681093846 ~> WrappedMonoid m6989586621681093846) -> Type) (a6989586621681105962 :: WrappedMonoid m6989586621681093846) = TFHelper_6989586621681105964Sym1 a6989586621681105962 | |
| type Apply (EnumFromTo_6989586621681106011Sym0 :: TyFun (WrappedMonoid a6989586621681093854) (WrappedMonoid a6989586621681093854 ~> [WrappedMonoid a6989586621681093854]) -> Type) (a6989586621681106009 :: WrappedMonoid a6989586621681093854) | |
Defined in Data.Singletons.Prelude.Semigroup type Apply (EnumFromTo_6989586621681106011Sym0 :: TyFun (WrappedMonoid a6989586621681093854) (WrappedMonoid a6989586621681093854 ~> [WrappedMonoid a6989586621681093854]) -> Type) (a6989586621681106009 :: WrappedMonoid a6989586621681093854) = EnumFromTo_6989586621681106011Sym1 a6989586621681106009 | |
| type Apply (EnumFromThenTo_6989586621681106027Sym0 :: TyFun (WrappedMonoid a6989586621681093854) (WrappedMonoid a6989586621681093854 ~> (WrappedMonoid a6989586621681093854 ~> [WrappedMonoid a6989586621681093854])) -> Type) (a6989586621681106024 :: WrappedMonoid a6989586621681093854) | |
Defined in Data.Singletons.Prelude.Semigroup type Apply (EnumFromThenTo_6989586621681106027Sym0 :: TyFun (WrappedMonoid a6989586621681093854) (WrappedMonoid a6989586621681093854 ~> (WrappedMonoid a6989586621681093854 ~> [WrappedMonoid a6989586621681093854])) -> Type) (a6989586621681106024 :: WrappedMonoid a6989586621681093854) = EnumFromThenTo_6989586621681106027Sym1 a6989586621681106024 | |
| type Apply (ShowsPrec_6989586621681056304Sym1 a6989586621681056301 m6989586621679061679 :: TyFun (WrappedMonoid m6989586621679061679) (Symbol ~> Symbol) -> Type) (a6989586621681056302 :: WrappedMonoid m6989586621679061679) | |
Defined in Data.Singletons.Prelude.Semigroup type Apply (ShowsPrec_6989586621681056304Sym1 a6989586621681056301 m6989586621679061679 :: TyFun (WrappedMonoid m6989586621679061679) (Symbol ~> Symbol) -> Type) (a6989586621681056302 :: WrappedMonoid m6989586621679061679) = ShowsPrec_6989586621681056304Sym2 a6989586621681056301 a6989586621681056302 | |
| type Apply (EnumFromThenTo_6989586621681106027Sym1 a6989586621681106024 :: TyFun (WrappedMonoid a6989586621681093854) (WrappedMonoid a6989586621681093854 ~> [WrappedMonoid a6989586621681093854]) -> Type) (a6989586621681106025 :: WrappedMonoid a6989586621681093854) | |
Defined in Data.Singletons.Prelude.Semigroup type Apply (EnumFromThenTo_6989586621681106027Sym1 a6989586621681106024 :: TyFun (WrappedMonoid a6989586621681093854) (WrappedMonoid a6989586621681093854 ~> [WrappedMonoid a6989586621681093854]) -> Type) (a6989586621681106025 :: WrappedMonoid a6989586621681093854) = EnumFromThenTo_6989586621681106027Sym2 a6989586621681106024 a6989586621681106025 | |
Chan is an abstract type representing an unbounded FIFO channel.
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
class Monad m => MonadIO (m :: Type -> Type) where #
Monads in which IO computations may be embedded.
Any monad built by applying a sequence of monad transformers to the
IO monad will be an instance of this class.
Instances should satisfy the following laws, which state that liftIO
is a transformer of monads:
Instances
replicateM_ :: Applicative m => Int -> m a -> m () #
Like replicateM, 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
(>=>) :: Monad m => (a -> m b) -> (b -> m c) -> a -> m c infixr 1 #
Left-to-right composition of Kleisli arrows.
forM :: (Traversable t, Monad m) => t a -> (a -> m b) -> m (t b) #
(***) :: Arrow a => a b c -> a b' c' -> a (b, b') (c, c') infixr 3 #
Split the input between the two argument arrows and combine their output. Note that this is in general not a functor.
The default definition may be overridden with a more efficient version if desired.
(&&&) :: Arrow a => a b c -> a b c' -> a b (c, c') infixr 3 #
Fanout: send the input to both argument arrows and combine their output.
The default definition may be overridden with a more efficient version if desired.
Identity functor and monad. (a non-strict monad)
Since: base-4.8.0.0
Constructors
| Identity | |
Fields
| |
Instances
| Monad Identity | Since: base-4.8.0.0 |
| Functor Identity | Since: base-4.8.0.0 |
| MonadFix Identity | Since: base-4.8.0.0 |
Defined in Data.Functor.Identity | |
| Applicative Identity | Since: base-4.8.0.0 |
| Foldable Identity | Since: base-4.8.0.0 |
Defined in Data.Functor.Identity Methods fold :: Monoid m => Identity m -> m # foldMap :: Monoid m => (a -> m) -> Identity a -> m # 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 |
| Distributive Identity | |
| Representable Identity | |
| Eq1 Identity | Since: base-4.9.0.0 |
| Ord1 Identity | Since: base-4.9.0.0 |
Defined in Data.Functor.Classes | |
| Read1 Identity | Since: base-4.9.0.0 |
Defined in Data.Functor.Classes | |
| Show1 Identity | Since: base-4.9.0.0 |
| Comonad Identity | |
| ComonadApply Identity | |
| NFData1 Identity | Since: deepseq-1.4.3.0 |
Defined in Control.DeepSeq | |
| Hashable1 Identity | |
Defined in Data.Hashable.Class | |
| Keyed Identity | |
| Zip Identity | |
| ZipWithKey Identity | |
| Indexable Identity | |
| Lookup Identity | |
| Adjustable Identity | |
| FoldableWithKey Identity | |
| FoldableWithKey1 Identity | |
| TraversableWithKey Identity | |
Defined in Data.Key Methods traverseWithKey :: Applicative f => (Key Identity -> a -> f b) -> Identity a -> f (Identity b) # mapWithKeyM :: Monad m => (Key Identity -> a -> m b) -> Identity a -> m (Identity b) # | |
| TraversableWithKey1 Identity | |
| Apply Identity | |
| Bind Identity | |
| PTraversable Identity | |
| STraversable Identity | |
Defined in Data.Singletons.Prelude.Traversable Methods sTraverse :: SApplicative f => Sing t1 -> Sing t2 -> Sing (Apply (Apply TraverseSym0 t1) t2) # sSequenceA :: SApplicative f => Sing t1 -> Sing (Apply SequenceASym0 t1) # sMapM :: SMonad m => Sing t1 -> Sing t2 -> Sing (Apply (Apply MapMSym0 t1) t2) # sSequence :: SMonad m => Sing t1 -> Sing (Apply SequenceSym0 t1) # | |
| FunctorWithIndex () Identity | |
Defined in Control.Lens.Indexed | |
| FoldableWithIndex () Identity | |
Defined in Control.Lens.Indexed | |
| TraversableWithIndex () Identity | |
Defined in Control.Lens.Indexed Methods itraverse :: Applicative f => (() -> a -> f b) -> Identity a -> f (Identity b) # itraversed :: IndexedTraversal () (Identity a) (Identity b) a b # | |
| Sieve ReifiedGetter Identity | |
Defined in Control.Lens.Reified Methods sieve :: ReifiedGetter a b -> a -> Identity b # | |
| Cosieve ReifiedGetter Identity | |
Defined in Control.Lens.Reified Methods cosieve :: ReifiedGetter a b -> Identity a -> b # | |
| Bounded a => Bounded (Identity a) | Since: base-4.9.0.0 |
| Enum a => Enum (Identity a) | Since: base-4.9.0.0 |
Defined in Data.Functor.Identity Methods succ :: Identity a -> Identity a # pred :: Identity a -> Identity a # fromEnum :: Identity a -> Int # enumFrom :: Identity a -> [Identity a] # enumFromThen :: Identity a -> Identity a -> [Identity a] # enumFromTo :: Identity a -> Identity a -> [Identity a] # enumFromThenTo :: Identity a -> Identity a -> Identity a -> [Identity a] # | |
| Eq a => Eq (Identity a) | Since: base-4.8.0.0 |
| Floating a => Floating (Identity a) | Since: base-4.9.0.0 |
Defined in Data.Functor.Identity Methods exp :: Identity a -> Identity a # log :: Identity a -> Identity a # sqrt :: Identity a -> Identity a # (**) :: Identity a -> Identity a -> Identity a # logBase :: Identity a -> Identity a -> Identity a # sin :: Identity a -> Identity a # cos :: Identity a -> Identity a # tan :: Identity a -> Identity a # asin :: Identity a -> Identity a # acos :: Identity a -> Identity a # atan :: Identity a -> Identity a # sinh :: Identity a -> Identity a # cosh :: Identity a -> Identity a # tanh :: Identity a -> Identity a # asinh :: Identity a -> Identity a # acosh :: Identity a -> Identity a # atanh :: Identity a -> Identity a # log1p :: Identity a -> Identity a # expm1 :: Identity a -> Identity a # | |
| Fractional a => Fractional (Identity a) | Since: base-4.9.0.0 |
| Integral a => Integral (Identity a) | Since: base-4.9.0.0 |
Defined in Data.Functor.Identity Methods quot :: Identity a -> Identity a -> Identity a # rem :: Identity a -> Identity a -> Identity a # div :: Identity a -> Identity a -> Identity a # mod :: Identity a -> Identity a -> Identity a # quotRem :: Identity a -> Identity a -> (Identity a, Identity a) # divMod :: Identity a -> Identity a -> (Identity a, Identity a) # | |
| Num a => Num (Identity a) | Since: base-4.9.0.0 |
Defined in Data.Functor.Identity | |
| Ord a => Ord (Identity a) | Since: base-4.8.0.0 |
Defined in Data.Functor.Identity | |
| Read a => Read (Identity a) | This instance would be equivalent to the derived instances of the
Since: base-4.8.0.0 |
| Real a => Real (Identity a) | Since: base-4.9.0.0 |
Defined in Data.Functor.Identity Methods toRational :: Identity a -> Rational # | |
| RealFloat a => RealFloat (Identity a) | Since: base-4.9.0.0 |
Defined in Data.Functor.Identity Methods floatRadix :: Identity a -> Integer # floatDigits :: Identity a -> Int # floatRange :: Identity a -> (Int, Int) # decodeFloat :: Identity a -> (Integer, Int) # encodeFloat :: Integer -> Int -> Identity a # exponent :: Identity a -> Int # significand :: Identity a -> Identity a # scaleFloat :: Int -> Identity a -> Identity a # isInfinite :: Identity a -> Bool # isDenormalized :: Identity a -> Bool # isNegativeZero :: Identity a -> Bool # | |
| RealFrac a => RealFrac (Identity a) | Since: base-4.9.0.0 |
| Show a => Show (Identity a) | This instance would be equivalent to the derived instances of the
Since: base-4.8.0.0 |
| Ix a => Ix (Identity a) | Since: base-4.9.0.0 |
Defined in Data.Functor.Identity Methods range :: (Identity a, Identity a) -> [Identity a] # index :: (Identity a, Identity a) -> Identity a -> Int # unsafeIndex :: (Identity a, Identity a) -> Identity a -> Int inRange :: (Identity a, Identity a) -> Identity a -> Bool # rangeSize :: (Identity a, Identity a) -> Int # unsafeRangeSize :: (Identity a, Identity a) -> Int | |
| IsString a => IsString (Identity a) | Since: base-4.9.0.0 |
Defined in Data.String Methods fromString :: String -> Identity a # | |
| Generic (Identity a) | |
| Semigroup a => Semigroup (Identity a) | Since: base-4.9.0.0 |
| Monoid a => Monoid (Identity a) | Since: base-4.9.0.0 |
| NFData a => NFData (Identity a) | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| Hashable a => Hashable (Identity a) | |
Defined in Data.Hashable.Class | |
| Storable a => Storable (Identity a) | Since: base-4.9.0.0 |
Defined in Data.Functor.Identity Methods alignment :: Identity a -> Int # peekElemOff :: Ptr (Identity a) -> Int -> IO (Identity a) # pokeElemOff :: Ptr (Identity a) -> Int -> Identity a -> IO () # peekByteOff :: Ptr b -> Int -> IO (Identity a) # pokeByteOff :: Ptr b -> Int -> Identity a -> IO () # | |
| Bits a => Bits (Identity a) | Since: base-4.9.0.0 |
Defined in Data.Functor.Identity Methods (.&.) :: Identity a -> Identity a -> Identity a # (.|.) :: Identity a -> Identity a -> Identity a # xor :: Identity a -> Identity a -> Identity a # complement :: Identity a -> Identity a # shift :: Identity a -> Int -> Identity a # rotate :: Identity a -> Int -> Identity a # setBit :: Identity a -> Int -> Identity a # clearBit :: Identity a -> Int -> Identity a # complementBit :: Identity a -> Int -> Identity a # testBit :: Identity a -> Int -> Bool # bitSizeMaybe :: Identity a -> Maybe Int # bitSize :: Identity a -> Int # isSigned :: Identity a -> Bool # shiftL :: Identity a -> Int -> Identity a # unsafeShiftL :: Identity a -> Int -> Identity a # shiftR :: Identity a -> Int -> Identity a # unsafeShiftR :: Identity a -> Int -> Identity a # rotateL :: Identity a -> Int -> Identity a # | |
| FiniteBits a => FiniteBits (Identity a) | Since: base-4.9.0.0 |
Defined in Data.Functor.Identity Methods finiteBitSize :: Identity a -> Int # countLeadingZeros :: Identity a -> Int # countTrailingZeros :: Identity a -> Int # | |
| MonoPointed (Identity a) | |
| MonoTraversable (Identity a) | |
| MonoFoldable (Identity a) | |
Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element (Identity a) -> m) -> Identity a -> m # ofoldr :: (Element (Identity a) -> b -> b) -> b -> Identity a -> b # ofoldl' :: (a0 -> Element (Identity a) -> a0) -> a0 -> Identity a -> a0 # otoList :: Identity a -> [Element (Identity a)] # oall :: (Element (Identity a) -> Bool) -> Identity a -> Bool # oany :: (Element (Identity a) -> Bool) -> Identity a -> Bool # olength :: Identity a -> Int # olength64 :: Identity a -> Int64 # ocompareLength :: Integral i => Identity a -> i -> Ordering # otraverse_ :: Applicative f => (Element (Identity a) -> f b) -> Identity a -> f () # ofor_ :: Applicative f => Identity a -> (Element (Identity a) -> f b) -> f () # omapM_ :: Applicative m => (Element (Identity a) -> m ()) -> Identity a -> m () # oforM_ :: Applicative m => Identity a -> (Element (Identity a) -> m ()) -> m () # ofoldlM :: Monad m => (a0 -> Element (Identity a) -> m a0) -> a0 -> Identity a -> m a0 # ofoldMap1Ex :: Semigroup m => (Element (Identity a) -> m) -> Identity a -> m # ofoldr1Ex :: (Element (Identity a) -> Element (Identity a) -> Element (Identity a)) -> Identity a -> Element (Identity a) # ofoldl1Ex' :: (Element (Identity a) -> Element (Identity a) -> Element (Identity a)) -> Identity a -> Element (Identity a) # headEx :: Identity a -> Element (Identity a) # lastEx :: Identity a -> Element (Identity a) # unsafeHead :: Identity a -> Element (Identity a) # unsafeLast :: Identity a -> Element (Identity a) # maximumByEx :: (Element (Identity a) -> Element (Identity a) -> Ordering) -> Identity a -> Element (Identity a) # minimumByEx :: (Element (Identity a) -> Element (Identity a) -> Ordering) -> Identity a -> Element (Identity a) # | |
| MonoFunctor (Identity a) | |
| Ixed (Identity a) | |
Defined in Control.Lens.At | |
| Wrapped (Identity a) | |
| PIsString (Identity a) | |
Defined in Data.Singletons.Prelude.IsString Associated Types type FromString arg :: a # | |
| SIsString a => SIsString (Identity a) | |
Defined in Data.Singletons.Prelude.IsString Methods sFromString :: Sing t -> Sing (Apply FromStringSym0 t) # | |
| PBounded (Identity a) | |
Defined in Data.Singletons.Prelude.Enum | |
| SBounded a => SBounded (Identity a) | |
Defined in Data.Singletons.Prelude.Enum | |
| POrd (Identity a) | |
| SOrd a => SOrd (Identity a) | |
Defined in Data.Singletons.Prelude.Ord Methods sCompare :: Sing t1 -> Sing t2 -> Sing (Apply (Apply CompareSym0 t1) t2) # (%<) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (<@#@$) t1) t2) # (%<=) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (<=@#@$) t1) t2) # (%>) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (>@#@$) t1) t2) # (%>=) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (>=@#@$) t1) t2) # sMax :: Sing t1 -> Sing t2 -> Sing (Apply (Apply MaxSym0 t1) t2) # sMin :: Sing t1 -> Sing t2 -> Sing (Apply (Apply MinSym0 t1) t2) # | |
| SEq a => SEq (Identity a) | |
| PEq (Identity a) | |
| Generic1 Identity | |
| t ~ Identity b => Rewrapped (Identity a) t | |
Defined in Control.Lens.Wrapped | |
| Field1 (Identity a) (Identity b) a b | |
| SuppressUnusedWarnings (ToEnum_6989586621680882741Sym0 :: TyFun Nat (Identity a6989586621680882611) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FromInteger_6989586621680883367Sym0 :: TyFun Nat (Identity a6989586621680882622) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621680883420Sym0 :: TyFun Nat (Identity a6989586621680882636 ~> (Symbol ~> Symbol)) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FromString_6989586621680945959Sym0 :: TyFun Symbol (Identity a6989586621680945775) -> Type) | |
Defined in Data.Singletons.Prelude.IsString Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (IdentitySym0 :: TyFun a6989586621679076664 (Identity a6989586621679076664) -> Type) | |
Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Pure_6989586621680883653Sym0 :: TyFun a6989586621679932934 (Identity a6989586621679932934) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Elem_6989586621680883476Sym0 :: TyFun a6989586621680712273 (Identity a6989586621680712273 ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (RunIdentitySym0 :: TyFun (Identity a6989586621679076664) a6989586621679076664 -> Type) | |
Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679830154Sym0 :: TyFun (Identity a6989586621679076664) (Identity a6989586621679076664 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ToList_6989586621680883644Sym0 :: TyFun (Identity a6989586621680712270) [a6989586621680712270] -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680883390Sym0 :: TyFun (Identity a6989586621680882633) (Identity a6989586621680882633 ~> Identity a6989586621680882633) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680883338Sym0 :: TyFun (Identity a6989586621680882622) (Identity a6989586621680882622 ~> Identity a6989586621680882622) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680883326Sym0 :: TyFun (Identity a6989586621680882622) (Identity a6989586621680882622 ~> Identity a6989586621680882622) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680883314Sym0 :: TyFun (Identity a6989586621680882622) (Identity a6989586621680882622 ~> Identity a6989586621680882622) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Sum_6989586621680883637Sym0 :: TyFun (Identity a6989586621680712276) a6989586621680712276 -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Succ_6989586621680882727Sym0 :: TyFun (Identity a6989586621680882611) (Identity a6989586621680882611) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Signum_6989586621680883360Sym0 :: TyFun (Identity a6989586621680882622) (Identity a6989586621680882622) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Product_6989586621680883630Sym0 :: TyFun (Identity a6989586621680712277) a6989586621680712277 -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Pred_6989586621680882734Sym0 :: TyFun (Identity a6989586621680882611) (Identity a6989586621680882611) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Null_6989586621680883623Sym0 :: TyFun (Identity a6989586621680712271) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Negate_6989586621680883346Sym0 :: TyFun (Identity a6989586621680882622) (Identity a6989586621680882622) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Minimum_6989586621680883617Sym0 :: TyFun (Identity a6989586621680712275) a6989586621680712275 -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Maximum_6989586621680883607Sym0 :: TyFun (Identity a6989586621680712274) a6989586621680712274 -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Length_6989586621680883591Sym0 :: TyFun (Identity a6989586621680712272) Nat -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FromEnum_6989586621680882748Sym0 :: TyFun (Identity a6989586621680882611) Nat -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (EnumFromTo_6989586621680882784Sym0 :: TyFun (Identity a6989586621680882611) (Identity a6989586621680882611 ~> [Identity a6989586621680882611]) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (EnumFromThenTo_6989586621680882821Sym0 :: TyFun (Identity a6989586621680882611) (Identity a6989586621680882611 ~> (Identity a6989586621680882611 ~> [Identity a6989586621680882611])) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Abs_6989586621680883353Sym0 :: TyFun (Identity a6989586621680882622) (Identity a6989586621680882622) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr1_6989586621680883584Sym0 :: TyFun (a6989586621680712268 ~> (a6989586621680712268 ~> a6989586621680712268)) (Identity a6989586621680712268 ~> a6989586621680712268) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldl1_6989586621680883524Sym0 :: TyFun (a6989586621680712269 ~> (a6989586621680712269 ~> a6989586621680712269)) (Identity a6989586621680712269 ~> a6989586621680712269) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SingI (IdentitySym0 :: TyFun a (Identity a) -> Type) | |
Defined in Data.Singletons.Prelude.Instances Methods sing :: Sing IdentitySym0 # | |
| SuppressUnusedWarnings (TFHelper_6989586621680883452Sym0 :: TyFun a6989586621679932931 (Identity b6989586621679932932 ~> Identity a6989586621679932931) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679830154Sym1 a6989586621679830152 :: TyFun (Identity a6989586621679076664) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680883693Sym0 :: TyFun (Identity a6989586621679932958) ((a6989586621679932958 ~> Identity b6989586621679932959) ~> Identity b6989586621679932959) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680883390Sym1 a6989586621680883388 :: TyFun (Identity a6989586621680882633) (Identity a6989586621680882633) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680883338Sym1 a6989586621680883336 :: TyFun (Identity a6989586621680882622) (Identity a6989586621680882622) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680883326Sym1 a6989586621680883324 :: TyFun (Identity a6989586621680882622) (Identity a6989586621680882622) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680883314Sym1 a6989586621680883312 :: TyFun (Identity a6989586621680882622) (Identity a6989586621680882622) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621680883420Sym1 a6989586621680883417 a6989586621680882636 :: TyFun (Identity a6989586621680882636) (Symbol ~> Symbol) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr1_6989586621680883584Sym1 a6989586621680883582 :: TyFun (Identity a6989586621680712268) a6989586621680712268 -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldl1_6989586621680883524Sym1 a6989586621680883522 :: TyFun (Identity a6989586621680712269) a6989586621680712269 -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (EnumFromTo_6989586621680882784Sym1 a6989586621680882782 :: TyFun (Identity a6989586621680882611) [Identity a6989586621680882611] -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (EnumFromThenTo_6989586621680882821Sym1 a6989586621680882818 :: TyFun (Identity a6989586621680882611) (Identity a6989586621680882611 ~> [Identity a6989586621680882611]) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Elem_6989586621680883476Sym1 a6989586621680883474 :: TyFun (Identity a6989586621680712273) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680883664Sym0 :: TyFun (Identity (a6989586621679932935 ~> b6989586621679932936)) (Identity a6989586621679932935 ~> Identity b6989586621679932936) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr_6989586621680883549Sym0 :: TyFun (a6989586621680712260 ~> (b6989586621680712261 ~> b6989586621680712261)) (b6989586621680712261 ~> (Identity a6989586621680712260 ~> b6989586621680712261)) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr'_6989586621680883572Sym0 :: TyFun (a6989586621680712262 ~> (b6989586621680712263 ~> b6989586621680712263)) (b6989586621680712263 ~> (Identity a6989586621680712262 ~> b6989586621680712263)) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldl_6989586621680883492Sym0 :: TyFun (b6989586621680712264 ~> (a6989586621680712265 ~> b6989586621680712264)) (b6989586621680712264 ~> (Identity a6989586621680712265 ~> b6989586621680712264)) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldl'_6989586621680883509Sym0 :: TyFun (b6989586621680712266 ~> (a6989586621680712267 ~> b6989586621680712266)) (b6989586621680712266 ~> (Identity a6989586621680712267 ~> b6989586621680712266)) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FoldMap_6989586621680883464Sym0 :: TyFun (a6989586621680712259 ~> m6989586621680712258) (Identity a6989586621680712259 ~> m6989586621680712258) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Fmap_6989586621680883433Sym0 :: TyFun (a6989586621679932929 ~> b6989586621679932930) (Identity a6989586621679932929 ~> Identity b6989586621679932930) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr_6989586621680883549Sym1 a6989586621680883546 :: TyFun b6989586621680712261 (Identity a6989586621680712260 ~> b6989586621680712261) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr'_6989586621680883572Sym1 a6989586621680883569 :: TyFun b6989586621680712263 (Identity a6989586621680712262 ~> b6989586621680712263) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldl_6989586621680883492Sym1 a6989586621680883489 :: TyFun b6989586621680712264 (Identity a6989586621680712265 ~> b6989586621680712264) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldl'_6989586621680883509Sym1 a6989586621680883506 :: TyFun b6989586621680712266 (Identity a6989586621680712267 ~> b6989586621680712266) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680883664Sym1 a6989586621680883662 :: TyFun (Identity a6989586621679932935) (Identity b6989586621679932936) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680883452Sym1 a6989586621680883450 b6989586621679932932 :: TyFun (Identity b6989586621679932932) (Identity a6989586621679932931) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FoldMap_6989586621680883464Sym1 a6989586621680883462 :: TyFun (Identity a6989586621680712259) m6989586621680712258 -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Fmap_6989586621680883433Sym1 a6989586621680883431 :: TyFun (Identity a6989586621679932929) (Identity b6989586621679932930) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (EnumFromThenTo_6989586621680882821Sym2 a6989586621680882819 a6989586621680882818 :: TyFun (Identity a6989586621680882611) [Identity a6989586621680882611] -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Traverse_6989586621680957756Sym0 :: TyFun (a6989586621680946430 ~> f6989586621680946429 b6989586621680946431) (Identity a6989586621680946430 ~> f6989586621680946429 (Identity b6989586621680946431)) -> Type) | |
Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680957425Scrutinee_6989586621680956945Sym0 :: TyFun (a6989586621680946430 ~> b6989586621680946431) (TyFun (t6989586621680946428 a6989586621680946430) (Identity (t6989586621680946428 b6989586621680946431)) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680883693Sym1 a6989586621680883691 b6989586621679932959 :: TyFun (a6989586621679932958 ~> Identity b6989586621679932959) (Identity b6989586621679932959) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (LiftA2_6989586621680883680Sym0 :: TyFun (a6989586621679932937 ~> (b6989586621679932938 ~> c6989586621679932939)) (Identity a6989586621679932937 ~> (Identity b6989586621679932938 ~> Identity c6989586621679932939)) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680957425Scrutinee_6989586621680956945Sym1 f6989586621680957421 :: TyFun (t6989586621680946428 a6989586621680946430) (Identity (t6989586621680946428 b6989586621680946431)) -> Type) | |
Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Traverse_6989586621680957756Sym1 a6989586621680957754 :: TyFun (Identity a6989586621680946430) (f6989586621680946429 (Identity b6989586621680946431)) -> Type) | |
Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (LiftA2_6989586621680883680Sym1 a6989586621680883677 :: TyFun (Identity a6989586621679932937) (Identity b6989586621679932938 ~> Identity c6989586621679932939) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr_6989586621680883549Sym2 a6989586621680883547 a6989586621680883546 :: TyFun (Identity a6989586621680712260) b6989586621680712261 -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr'_6989586621680883572Sym2 a6989586621680883570 a6989586621680883569 :: TyFun (Identity a6989586621680712262) b6989586621680712263 -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldl_6989586621680883492Sym2 a6989586621680883490 a6989586621680883489 :: TyFun (Identity a6989586621680712265) b6989586621680712264 -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldl'_6989586621680883509Sym2 a6989586621680883507 a6989586621680883506 :: TyFun (Identity a6989586621680712267) b6989586621680712266 -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (LiftA2_6989586621680883680Sym2 a6989586621680883678 a6989586621680883677 :: TyFun (Identity b6989586621679932938) (Identity c6989586621679932939) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| type Rep Identity | |
Defined in Data.Functor.Rep | |
| type Key Identity | |
| type Product (a :: Identity k2) | |
| type Sum (a :: Identity k2) | |
| type Minimum (a :: Identity k2) | |
| type Maximum (a :: Identity k2) | |
| type Length (a :: Identity a6989586621680712272) | |
| type Null (a :: Identity a6989586621680712271) | |
| type ToList (a :: Identity a6989586621680712270) | |
| type Fold (arg :: Identity m) | |
| type Pure (a :: k1) | |
| type Fail arg | |
| type Return (arg :: a) | |
| type Sequence (arg :: Identity (m a)) | |
| type SequenceA (arg :: Identity (f a)) | |
| type Elem (a1 :: k1) (a2 :: Identity k1) | |
| type Foldl1 (a1 :: k2 ~> (k2 ~> k2)) (a2 :: Identity k2) | |
| type Foldr1 (a1 :: k2 ~> (k2 ~> k2)) (a2 :: Identity k2) | |
| type FoldMap (a1 :: a6989586621680712259 ~> k2) (a2 :: Identity a6989586621680712259) | |
| type (a1 :: k1) <$ (a2 :: Identity b6989586621679932932) | |
| type Fmap (a1 :: a6989586621679932929 ~> b6989586621679932930) (a2 :: Identity a6989586621679932929) | |
Defined in Data.Singletons.Prelude.Identity | |
| type (arg1 :: Identity a) <* (arg2 :: Identity b) | |
| type (arg1 :: Identity a) *> (arg2 :: Identity b) | |
| type (a1 :: Identity (a6989586621679932935 ~> b6989586621679932936)) <*> (a2 :: Identity a6989586621679932935) | |
Defined in Data.Singletons.Prelude.Identity type (a1 :: Identity (a6989586621679932935 ~> b6989586621679932936)) <*> (a2 :: Identity a6989586621679932935) = Apply (Apply (TFHelper_6989586621680883664Sym0 :: TyFun (Identity (a6989586621679932935 ~> b6989586621679932936)) (Identity a6989586621679932935 ~> Identity b6989586621679932936) -> Type) a1) a2 | |
| type (arg1 :: Identity a) >> (arg2 :: Identity b) | |
| type (a1 :: Identity a6989586621679932958) >>= (a2 :: a6989586621679932958 ~> Identity b6989586621679932959) | |
Defined in Data.Singletons.Prelude.Identity type (a1 :: Identity a6989586621679932958) >>= (a2 :: a6989586621679932958 ~> Identity b6989586621679932959) = Apply (Apply (TFHelper_6989586621680883693Sym0 :: TyFun (Identity a6989586621679932958) ((a6989586621679932958 ~> Identity b6989586621679932959) ~> Identity b6989586621679932959) -> Type) a1) a2 | |
| type MapM (arg1 :: a ~> m b) (arg2 :: Identity a) | |
| type Traverse (a1 :: a6989586621680946430 ~> f6989586621680946429 b6989586621680946431) (a2 :: Identity a6989586621680946430) | |
Defined in Data.Singletons.Prelude.Traversable type Traverse (a1 :: a6989586621680946430 ~> f6989586621680946429 b6989586621680946431) (a2 :: Identity a6989586621680946430) = Apply (Apply (Traverse_6989586621680957756Sym0 :: TyFun (a6989586621680946430 ~> f6989586621680946429 b6989586621680946431) (Identity a6989586621680946430 ~> f6989586621680946429 (Identity b6989586621680946431)) -> Type) a1) a2 | |
| type Foldl' (a1 :: k2 ~> (a6989586621680712267 ~> k2)) (a2 :: k2) (a3 :: Identity a6989586621680712267) | |
Defined in Data.Singletons.Prelude.Identity | |
| type Foldl (a1 :: k2 ~> (a6989586621680712265 ~> k2)) (a2 :: k2) (a3 :: Identity a6989586621680712265) | |
Defined in Data.Singletons.Prelude.Identity | |
| type Foldr' (a1 :: a6989586621680712262 ~> (k2 ~> k2)) (a2 :: k2) (a3 :: Identity a6989586621680712262) | |
Defined in Data.Singletons.Prelude.Identity | |
| type Foldr (a1 :: a6989586621680712260 ~> (k2 ~> k2)) (a2 :: k2) (a3 :: Identity a6989586621680712260) | |
Defined in Data.Singletons.Prelude.Identity | |
| type LiftA2 (a1 :: a6989586621679932937 ~> (b6989586621679932938 ~> c6989586621679932939)) (a2 :: Identity a6989586621679932937) (a3 :: Identity b6989586621679932938) | |
Defined in Data.Singletons.Prelude.Identity type LiftA2 (a1 :: a6989586621679932937 ~> (b6989586621679932938 ~> c6989586621679932939)) (a2 :: Identity a6989586621679932937) (a3 :: Identity b6989586621679932938) = Apply (Apply (Apply (LiftA2_6989586621680883680Sym0 :: TyFun (a6989586621679932937 ~> (b6989586621679932938 ~> c6989586621679932939)) (Identity a6989586621679932937 ~> (Identity b6989586621679932938 ~> Identity c6989586621679932939)) -> Type) a1) a2) a3 | |
| type Apply (Null_6989586621680883623Sym0 :: TyFun (Identity a) Bool -> Type) (a6989586621680883622 :: Identity a) | |
| type Apply (FromEnum_6989586621680882748Sym0 :: TyFun (Identity a) Nat -> Type) (a6989586621680882747 :: Identity a) | |
| type Apply (Length_6989586621680883591Sym0 :: TyFun (Identity a) Nat -> Type) (a6989586621680883590 :: Identity a) | |
| type Apply (RunIdentitySym0 :: TyFun (Identity a) a -> Type) (a6989586621679725066 :: Identity a) | |
Defined in Data.Singletons.Prelude.Instances type Apply (RunIdentitySym0 :: TyFun (Identity a) a -> Type) (a6989586621679725066 :: Identity a) = RunIdentity a6989586621679725066 | |
| type Apply (Maximum_6989586621680883607Sym0 :: TyFun (Identity a) a -> Type) (a6989586621680883606 :: Identity a) | |
| type Apply (Minimum_6989586621680883617Sym0 :: TyFun (Identity a) a -> Type) (a6989586621680883616 :: Identity a) | |
| type Apply (Product_6989586621680883630Sym0 :: TyFun (Identity a) a -> Type) (a6989586621680883629 :: Identity a) | |
| type Apply (Sum_6989586621680883637Sym0 :: TyFun (Identity a) a -> Type) (a6989586621680883636 :: Identity a) | |
| type Apply (Elem_6989586621680883476Sym1 a6989586621680883474 :: TyFun (Identity a) Bool -> Type) (a6989586621680883475 :: Identity a) | |
| type Apply (Compare_6989586621679830154Sym1 a6989586621679830152 :: TyFun (Identity a) Ordering -> Type) (a6989586621679830153 :: Identity a) | |
| type Apply (Foldl1_6989586621680883524Sym1 a6989586621680883522 :: TyFun (Identity a) a -> Type) (a6989586621680883523 :: Identity a) | |
| type Apply (Foldr1_6989586621680883584Sym1 a6989586621680883582 :: TyFun (Identity a) a -> Type) (a6989586621680883583 :: Identity a) | |
| type Apply (FoldMap_6989586621680883464Sym1 a6989586621680883462 :: TyFun (Identity a) m -> Type) (a6989586621680883463 :: Identity a) | |
| type Apply (Foldl_6989586621680883492Sym2 a6989586621680883490 a6989586621680883489 :: TyFun (Identity a) b -> Type) (a6989586621680883491 :: Identity a) | |
| type Apply (Foldl'_6989586621680883509Sym2 a6989586621680883507 a6989586621680883506 :: TyFun (Identity a) b -> Type) (a6989586621680883508 :: Identity a) | |
| type Apply (Foldr_6989586621680883549Sym2 a6989586621680883547 a6989586621680883546 :: TyFun (Identity a) b -> Type) (a6989586621680883548 :: Identity a) | |
| type Apply (Foldr'_6989586621680883572Sym2 a6989586621680883570 a6989586621680883569 :: TyFun (Identity a) b -> Type) (a6989586621680883571 :: Identity a) | |
| type Rep (Identity a) | Since: base-4.8.0.0 |
Defined in Data.Functor.Identity | |
| type Element (Identity a) | |
Defined in Data.MonoTraversable | |
| 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 Mempty | |
Defined in Data.Singletons.Prelude.Identity | |
| type MaxBound | |
Defined in Data.Singletons.Prelude.Enum | |
| type MinBound | |
Defined in Data.Singletons.Prelude.Enum | |
| data Sing (b :: Identity a) | |
| type Demote (Identity a) | |
Defined in Data.Singletons.Prelude.Instances | |
| type Rep1 Identity | Since: base-4.8.0.0 |
Defined in Data.Functor.Identity | |
| type FromString a2 | |
Defined in Data.Singletons.Prelude.IsString | |
| type Mconcat (arg :: [Identity a]) | |
| type Show_ (arg :: Identity a) | |
| type Sconcat (arg :: NonEmpty (Identity a)) | |
| type FromEnum (a2 :: Identity a1) | |
| type ToEnum a2 | |
| type Pred (a2 :: Identity a1) | |
| type Succ (a2 :: Identity a1) | |
| type FromInteger a2 | |
Defined in Data.Singletons.Prelude.Identity | |
| type Signum (a2 :: Identity a1) | |
| type Abs (a2 :: Identity a1) | |
| type Negate (a2 :: Identity a1) | |
| type Mappend (arg1 :: Identity a) (arg2 :: Identity a) | |
| type ShowList (arg1 :: [Identity a]) arg2 | |
| type (a2 :: Identity a1) <> (a3 :: Identity a1) | |
| type EnumFromTo (a2 :: Identity a1) (a3 :: Identity a1) | |
| type (a2 :: Identity a1) * (a3 :: Identity a1) | |
| type (a2 :: Identity a1) - (a3 :: Identity a1) | |
| type (a2 :: Identity a1) + (a3 :: Identity a1) | |
| type Min (arg1 :: Identity a) (arg2 :: Identity a) | |
| type Max (arg1 :: Identity a) (arg2 :: Identity a) | |
| type (arg1 :: Identity a) >= (arg2 :: Identity a) | |
| type (arg1 :: Identity a) > (arg2 :: Identity a) | |
| type (arg1 :: Identity a) <= (arg2 :: Identity a) | |
| type (arg1 :: Identity a) < (arg2 :: Identity a) | |
| type Compare (a2 :: Identity a1) (a3 :: Identity a1) | |
| type (x :: Identity a) /= (y :: Identity a) | |
| type (a2 :: Identity a1) == (b :: Identity a1) | |
Defined in Data.Singletons.Prelude.Eq | |
| type ShowsPrec a2 (a3 :: Identity a1) a4 | |
| type EnumFromThenTo (a2 :: Identity a1) (a3 :: Identity a1) (a4 :: Identity a1) | |
| type Apply (FromString_6989586621680945959Sym0 :: TyFun Symbol (Identity a6989586621680945775) -> Type) (a6989586621680945958 :: Symbol) | |
| type Apply (IdentitySym0 :: TyFun a (Identity a) -> Type) (t6989586621679725069 :: a) | |
Defined in Data.Singletons.Prelude.Instances | |
| type Apply (ToEnum_6989586621680882741Sym0 :: TyFun Nat (Identity a6989586621680882611) -> Type) (a6989586621680882740 :: Nat) | |
| type Apply (FromInteger_6989586621680883367Sym0 :: TyFun Nat (Identity a6989586621680882622) -> Type) (a6989586621680883366 :: Nat) | |
| type Apply (Pure_6989586621680883653Sym0 :: TyFun a (Identity a) -> Type) (a6989586621680883652 :: a) | |
Defined in Data.Singletons.Prelude.Identity | |
| type Apply (ToList_6989586621680883644Sym0 :: TyFun (Identity a) [a] -> Type) (a6989586621680883643 :: Identity a) | |
| type Apply (Succ_6989586621680882727Sym0 :: TyFun (Identity a) (Identity a) -> Type) (a6989586621680882726 :: Identity a) | |
| type Apply (Pred_6989586621680882734Sym0 :: TyFun (Identity a) (Identity a) -> Type) (a6989586621680882733 :: Identity a) | |
| type Apply (Negate_6989586621680883346Sym0 :: TyFun (Identity a) (Identity a) -> Type) (a6989586621680883345 :: Identity a) | |
| type Apply (Abs_6989586621680883353Sym0 :: TyFun (Identity a) (Identity a) -> Type) (a6989586621680883352 :: Identity a) | |
| type Apply (Signum_6989586621680883360Sym0 :: TyFun (Identity a) (Identity a) -> Type) (a6989586621680883359 :: Identity a) | |
| type Apply (EnumFromTo_6989586621680882784Sym1 a6989586621680882782 :: TyFun (Identity a) [Identity a] -> Type) (a6989586621680882783 :: Identity a) | |
| type Apply (TFHelper_6989586621680883314Sym1 a6989586621680883312 :: TyFun (Identity a) (Identity a) -> Type) (a6989586621680883313 :: Identity a) | |
| type Apply (TFHelper_6989586621680883326Sym1 a6989586621680883324 :: TyFun (Identity a) (Identity a) -> Type) (a6989586621680883325 :: Identity a) | |
| type Apply (TFHelper_6989586621680883338Sym1 a6989586621680883336 :: TyFun (Identity a) (Identity a) -> Type) (a6989586621680883337 :: Identity a) | |
| type Apply (TFHelper_6989586621680883390Sym1 a6989586621680883388 :: TyFun (Identity a) (Identity a) -> Type) (a6989586621680883389 :: Identity a) | |
| type Apply (EnumFromThenTo_6989586621680882821Sym2 a6989586621680882819 a6989586621680882818 :: TyFun (Identity a) [Identity a] -> Type) (a6989586621680882820 :: Identity a) | |
Defined in Data.Singletons.Prelude.Identity | |
| type Apply (Fmap_6989586621680883433Sym1 a6989586621680883431 :: TyFun (Identity a) (Identity b) -> Type) (a6989586621680883432 :: Identity a) | |
| type Apply (TFHelper_6989586621680883452Sym1 a6989586621680883450 b :: TyFun (Identity b) (Identity a) -> Type) (a6989586621680883451 :: Identity b) | |
| type Apply (TFHelper_6989586621680883664Sym1 a6989586621680883662 :: TyFun (Identity a) (Identity b) -> Type) (a6989586621680883663 :: Identity a) | |
| type Apply (Traverse_6989586621680957756Sym1 a6989586621680957754 :: TyFun (Identity a) (f (Identity b)) -> Type) (a6989586621680957755 :: Identity a) | |
| type Apply (Let6989586621680957425Scrutinee_6989586621680956945Sym1 f6989586621680957421 :: TyFun (t6989586621680946428 a6989586621680946430) (Identity (t6989586621680946428 b6989586621680946431)) -> Type) (x6989586621680957422 :: t6989586621680946428 a6989586621680946430) | |
Defined in Data.Singletons.Prelude.Traversable type Apply (Let6989586621680957425Scrutinee_6989586621680956945Sym1 f6989586621680957421 :: TyFun (t6989586621680946428 a6989586621680946430) (Identity (t6989586621680946428 b6989586621680946431)) -> Type) (x6989586621680957422 :: t6989586621680946428 a6989586621680946430) = Let6989586621680957425Scrutinee_6989586621680956945 f6989586621680957421 x6989586621680957422 | |
| type Apply (LiftA2_6989586621680883680Sym2 a6989586621680883678 a6989586621680883677 :: TyFun (Identity b) (Identity c) -> Type) (a6989586621680883679 :: Identity b) | |
Defined in Data.Singletons.Prelude.Identity | |
| type Apply (TFHelper_6989586621680883693Sym1 a6989586621680883691 b :: TyFun (a ~> Identity b) (Identity b) -> Type) (a6989586621680883692 :: a ~> Identity b) | |
| type Apply (ShowsPrec_6989586621680883420Sym0 :: TyFun Nat (Identity a6989586621680882636 ~> (Symbol ~> Symbol)) -> Type) (a6989586621680883417 :: Nat) | |
Defined in Data.Singletons.Prelude.Identity | |
| type Apply (Elem_6989586621680883476Sym0 :: TyFun a6989586621680712273 (Identity a6989586621680712273 ~> Bool) -> Type) (a6989586621680883474 :: a6989586621680712273) | |
| type Apply (TFHelper_6989586621680883452Sym0 :: TyFun a6989586621679932931 (Identity b6989586621679932932 ~> Identity a6989586621679932931) -> Type) (a6989586621680883450 :: a6989586621679932931) | |
Defined in Data.Singletons.Prelude.Identity type Apply (TFHelper_6989586621680883452Sym0 :: TyFun a6989586621679932931 (Identity b6989586621679932932 ~> Identity a6989586621679932931) -> Type) (a6989586621680883450 :: a6989586621679932931) = (TFHelper_6989586621680883452Sym1 a6989586621680883450 b6989586621679932932 :: TyFun (Identity b6989586621679932932) (Identity a6989586621679932931) -> Type) | |
| type Apply (Foldl_6989586621680883492Sym1 a6989586621680883489 :: TyFun b6989586621680712264 (Identity a6989586621680712265 ~> b6989586621680712264) -> Type) (a6989586621680883490 :: b6989586621680712264) | |
Defined in Data.Singletons.Prelude.Identity | |
| type Apply (Foldl'_6989586621680883509Sym1 a6989586621680883506 :: TyFun b6989586621680712266 (Identity a6989586621680712267 ~> b6989586621680712266) -> Type) (a6989586621680883507 :: b6989586621680712266) | |
Defined in Data.Singletons.Prelude.Identity | |
| type Apply (Foldr_6989586621680883549Sym1 a6989586621680883546 :: TyFun b6989586621680712261 (Identity a6989586621680712260 ~> b6989586621680712261) -> Type) (a6989586621680883547 :: b6989586621680712261) | |
Defined in Data.Singletons.Prelude.Identity | |
| type Apply (Foldr'_6989586621680883572Sym1 a6989586621680883569 :: TyFun b6989586621680712263 (Identity a6989586621680712262 ~> b6989586621680712263) -> Type) (a6989586621680883570 :: b6989586621680712263) | |
Defined in Data.Singletons.Prelude.Identity | |
| type Apply (Compare_6989586621679830154Sym0 :: TyFun (Identity a6989586621679076664) (Identity a6989586621679076664 ~> Ordering) -> Type) (a6989586621679830152 :: Identity a6989586621679076664) | |
| type Apply (EnumFromTo_6989586621680882784Sym0 :: TyFun (Identity a6989586621680882611) (Identity a6989586621680882611 ~> [Identity a6989586621680882611]) -> Type) (a6989586621680882782 :: Identity a6989586621680882611) | |
Defined in Data.Singletons.Prelude.Identity | |
| type Apply (EnumFromThenTo_6989586621680882821Sym0 :: TyFun (Identity a6989586621680882611) (Identity a6989586621680882611 ~> (Identity a6989586621680882611 ~> [Identity a6989586621680882611])) -> Type) (a6989586621680882818 :: Identity a6989586621680882611) | |
Defined in Data.Singletons.Prelude.Identity type Apply (EnumFromThenTo_6989586621680882821Sym0 :: TyFun (Identity a6989586621680882611) (Identity a6989586621680882611 ~> (Identity a6989586621680882611 ~> [Identity a6989586621680882611])) -> Type) (a6989586621680882818 :: Identity a6989586621680882611) = EnumFromThenTo_6989586621680882821Sym1 a6989586621680882818 | |
| type Apply (TFHelper_6989586621680883314Sym0 :: TyFun (Identity a6989586621680882622) (Identity a6989586621680882622 ~> Identity a6989586621680882622) -> Type) (a6989586621680883312 :: Identity a6989586621680882622) | |
Defined in Data.Singletons.Prelude.Identity | |
| type Apply (TFHelper_6989586621680883326Sym0 :: TyFun (Identity a6989586621680882622) (Identity a6989586621680882622 ~> Identity a6989586621680882622) -> Type) (a6989586621680883324 :: Identity a6989586621680882622) | |
Defined in Data.Singletons.Prelude.Identity | |
| type Apply (TFHelper_6989586621680883338Sym0 :: TyFun (Identity a6989586621680882622) (Identity a6989586621680882622 ~> Identity a6989586621680882622) -> Type) (a6989586621680883336 :: Identity a6989586621680882622) | |
Defined in Data.Singletons.Prelude.Identity | |
| type Apply (TFHelper_6989586621680883390Sym0 :: TyFun (Identity a6989586621680882633) (Identity a6989586621680882633 ~> Identity a6989586621680882633) -> Type) (a6989586621680883388 :: Identity a6989586621680882633) | |
Defined in Data.Singletons.Prelude.Identity | |
| type Apply (ShowsPrec_6989586621680883420Sym1 a6989586621680883417 a6989586621680882636 :: TyFun (Identity a6989586621680882636) (Symbol ~> Symbol) -> Type) (a6989586621680883418 :: Identity a6989586621680882636) | |
Defined in Data.Singletons.Prelude.Identity | |
| type Apply (EnumFromThenTo_6989586621680882821Sym1 a6989586621680882818 :: TyFun (Identity a6989586621680882611) (Identity a6989586621680882611 ~> [Identity a6989586621680882611]) -> Type) (a6989586621680882819 :: Identity a6989586621680882611) | |
Defined in Data.Singletons.Prelude.Identity type Apply (EnumFromThenTo_6989586621680882821Sym1 a6989586621680882818 :: TyFun (Identity a6989586621680882611) (Identity a6989586621680882611 ~> [Identity a6989586621680882611]) -> Type) (a6989586621680882819 :: Identity a6989586621680882611) = EnumFromThenTo_6989586621680882821Sym2 a6989586621680882818 a6989586621680882819 | |
| type Apply (TFHelper_6989586621680883664Sym0 :: TyFun (Identity (a6989586621679932935 ~> b6989586621679932936)) (Identity a6989586621679932935 ~> Identity b6989586621679932936) -> Type) (a6989586621680883662 :: Identity (a6989586621679932935 ~> b6989586621679932936)) | |
Defined in Data.Singletons.Prelude.Identity type Apply (TFHelper_6989586621680883664Sym0 :: TyFun (Identity (a6989586621679932935 ~> b6989586621679932936)) (Identity a6989586621679932935 ~> Identity b6989586621679932936) -> Type) (a6989586621680883662 :: Identity (a6989586621679932935 ~> b6989586621679932936)) = TFHelper_6989586621680883664Sym1 a6989586621680883662 | |
| type Apply (TFHelper_6989586621680883693Sym0 :: TyFun (Identity a6989586621679932958) ((a6989586621679932958 ~> Identity b6989586621679932959) ~> Identity b6989586621679932959) -> Type) (a6989586621680883691 :: Identity a6989586621679932958) | |
Defined in Data.Singletons.Prelude.Identity type Apply (TFHelper_6989586621680883693Sym0 :: TyFun (Identity a6989586621679932958) ((a6989586621679932958 ~> Identity b6989586621679932959) ~> Identity b6989586621679932959) -> Type) (a6989586621680883691 :: Identity a6989586621679932958) = (TFHelper_6989586621680883693Sym1 a6989586621680883691 b6989586621679932959 :: TyFun (a6989586621679932958 ~> Identity b6989586621679932959) (Identity b6989586621679932959) -> Type) | |
| type Apply (LiftA2_6989586621680883680Sym1 a6989586621680883677 :: TyFun (Identity a6989586621679932937) (Identity b6989586621679932938 ~> Identity c6989586621679932939) -> Type) (a6989586621680883678 :: Identity a6989586621679932937) | |
Defined in Data.Singletons.Prelude.Identity type Apply (LiftA2_6989586621680883680Sym1 a6989586621680883677 :: TyFun (Identity a6989586621679932937) (Identity b6989586621679932938 ~> Identity c6989586621679932939) -> Type) (a6989586621680883678 :: Identity a6989586621679932937) = LiftA2_6989586621680883680Sym2 a6989586621680883677 a6989586621680883678 | |
| type Apply (Foldl1_6989586621680883524Sym0 :: TyFun (a6989586621680712269 ~> (a6989586621680712269 ~> a6989586621680712269)) (Identity a6989586621680712269 ~> a6989586621680712269) -> Type) (a6989586621680883522 :: a6989586621680712269 ~> (a6989586621680712269 ~> a6989586621680712269)) | |
Defined in Data.Singletons.Prelude.Identity type Apply (Foldl1_6989586621680883524Sym0 :: TyFun (a6989586621680712269 ~> (a6989586621680712269 ~> a6989586621680712269)) (Identity a6989586621680712269 ~> a6989586621680712269) -> Type) (a6989586621680883522 :: a6989586621680712269 ~> (a6989586621680712269 ~> a6989586621680712269)) = Foldl1_6989586621680883524Sym1 a6989586621680883522 | |
| type Apply (Foldr1_6989586621680883584Sym0 :: TyFun (a6989586621680712268 ~> (a6989586621680712268 ~> a6989586621680712268)) (Identity a6989586621680712268 ~> a6989586621680712268) -> Type) (a6989586621680883582 :: a6989586621680712268 ~> (a6989586621680712268 ~> a6989586621680712268)) | |
Defined in Data.Singletons.Prelude.Identity type Apply (Foldr1_6989586621680883584Sym0 :: TyFun (a6989586621680712268 ~> (a6989586621680712268 ~> a6989586621680712268)) (Identity a6989586621680712268 ~> a6989586621680712268) -> Type) (a6989586621680883582 :: a6989586621680712268 ~> (a6989586621680712268 ~> a6989586621680712268)) = Foldr1_6989586621680883584Sym1 a6989586621680883582 | |
| type Apply (Foldl_6989586621680883492Sym0 :: TyFun (b6989586621680712264 ~> (a6989586621680712265 ~> b6989586621680712264)) (b6989586621680712264 ~> (Identity a6989586621680712265 ~> b6989586621680712264)) -> Type) (a6989586621680883489 :: b6989586621680712264 ~> (a6989586621680712265 ~> b6989586621680712264)) | |
Defined in Data.Singletons.Prelude.Identity type Apply (Foldl_6989586621680883492Sym0 :: TyFun (b6989586621680712264 ~> (a6989586621680712265 ~> b6989586621680712264)) (b6989586621680712264 ~> (Identity a6989586621680712265 ~> b6989586621680712264)) -> Type) (a6989586621680883489 :: b6989586621680712264 ~> (a6989586621680712265 ~> b6989586621680712264)) = Foldl_6989586621680883492Sym1 a6989586621680883489 | |
| type Apply (Foldl'_6989586621680883509Sym0 :: TyFun (b6989586621680712266 ~> (a6989586621680712267 ~> b6989586621680712266)) (b6989586621680712266 ~> (Identity a6989586621680712267 ~> b6989586621680712266)) -> Type) (a6989586621680883506 :: b6989586621680712266 ~> (a6989586621680712267 ~> b6989586621680712266)) | |
Defined in Data.Singletons.Prelude.Identity type Apply (Foldl'_6989586621680883509Sym0 :: TyFun (b6989586621680712266 ~> (a6989586621680712267 ~> b6989586621680712266)) (b6989586621680712266 ~> (Identity a6989586621680712267 ~> b6989586621680712266)) -> Type) (a6989586621680883506 :: b6989586621680712266 ~> (a6989586621680712267 ~> b6989586621680712266)) = Foldl'_6989586621680883509Sym1 a6989586621680883506 | |
| type Apply (Foldr_6989586621680883549Sym0 :: TyFun (a6989586621680712260 ~> (b6989586621680712261 ~> b6989586621680712261)) (b6989586621680712261 ~> (Identity a6989586621680712260 ~> b6989586621680712261)) -> Type) (a6989586621680883546 :: a6989586621680712260 ~> (b6989586621680712261 ~> b6989586621680712261)) | |
Defined in Data.Singletons.Prelude.Identity type Apply (Foldr_6989586621680883549Sym0 :: TyFun (a6989586621680712260 ~> (b6989586621680712261 ~> b6989586621680712261)) (b6989586621680712261 ~> (Identity a6989586621680712260 ~> b6989586621680712261)) -> Type) (a6989586621680883546 :: a6989586621680712260 ~> (b6989586621680712261 ~> b6989586621680712261)) = Foldr_6989586621680883549Sym1 a6989586621680883546 | |
| type Apply (Foldr'_6989586621680883572Sym0 :: TyFun (a6989586621680712262 ~> (b6989586621680712263 ~> b6989586621680712263)) (b6989586621680712263 ~> (Identity a6989586621680712262 ~> b6989586621680712263)) -> Type) (a6989586621680883569 :: a6989586621680712262 ~> (b6989586621680712263 ~> b6989586621680712263)) | |
Defined in Data.Singletons.Prelude.Identity type Apply (Foldr'_6989586621680883572Sym0 :: TyFun (a6989586621680712262 ~> (b6989586621680712263 ~> b6989586621680712263)) (b6989586621680712263 ~> (Identity a6989586621680712262 ~> b6989586621680712263)) -> Type) (a6989586621680883569 :: a6989586621680712262 ~> (b6989586621680712263 ~> b6989586621680712263)) = Foldr'_6989586621680883572Sym1 a6989586621680883569 | |
| type Apply (Fmap_6989586621680883433Sym0 :: TyFun (a6989586621679932929 ~> b6989586621679932930) (Identity a6989586621679932929 ~> Identity b6989586621679932930) -> Type) (a6989586621680883431 :: a6989586621679932929 ~> b6989586621679932930) | |
Defined in Data.Singletons.Prelude.Identity | |
| type Apply (FoldMap_6989586621680883464Sym0 :: TyFun (a6989586621680712259 ~> m6989586621680712258) (Identity a6989586621680712259 ~> m6989586621680712258) -> Type) (a6989586621680883462 :: a6989586621680712259 ~> m6989586621680712258) | |
Defined in Data.Singletons.Prelude.Identity | |
| type Apply (Let6989586621680957425Scrutinee_6989586621680956945Sym0 :: TyFun (a6989586621680946430 ~> b6989586621680946431) (TyFun (t6989586621680946428 a6989586621680946430) (Identity (t6989586621680946428 b6989586621680946431)) -> Type) -> Type) (f6989586621680957421 :: a6989586621680946430 ~> b6989586621680946431) | |
Defined in Data.Singletons.Prelude.Traversable type Apply (Let6989586621680957425Scrutinee_6989586621680956945Sym0 :: TyFun (a6989586621680946430 ~> b6989586621680946431) (TyFun (t6989586621680946428 a6989586621680946430) (Identity (t6989586621680946428 b6989586621680946431)) -> Type) -> Type) (f6989586621680957421 :: a6989586621680946430 ~> b6989586621680946431) = (Let6989586621680957425Scrutinee_6989586621680956945Sym1 f6989586621680957421 :: TyFun (t6989586621680946428 a6989586621680946430) (Identity (t6989586621680946428 b6989586621680946431)) -> Type) | |
| type Apply (Traverse_6989586621680957756Sym0 :: TyFun (a6989586621680946430 ~> f6989586621680946429 b6989586621680946431) (Identity a6989586621680946430 ~> f6989586621680946429 (Identity b6989586621680946431)) -> Type) (a6989586621680957754 :: a6989586621680946430 ~> f6989586621680946429 b6989586621680946431) | |
Defined in Data.Singletons.Prelude.Traversable type Apply (Traverse_6989586621680957756Sym0 :: TyFun (a6989586621680946430 ~> f6989586621680946429 b6989586621680946431) (Identity a6989586621680946430 ~> f6989586621680946429 (Identity b6989586621680946431)) -> Type) (a6989586621680957754 :: a6989586621680946430 ~> f6989586621680946429 b6989586621680946431) = Traverse_6989586621680957756Sym1 a6989586621680957754 | |
| type Apply (LiftA2_6989586621680883680Sym0 :: TyFun (a6989586621679932937 ~> (b6989586621679932938 ~> c6989586621679932939)) (Identity a6989586621679932937 ~> (Identity b6989586621679932938 ~> Identity c6989586621679932939)) -> Type) (a6989586621680883677 :: a6989586621679932937 ~> (b6989586621679932938 ~> c6989586621679932939)) | |
Defined in Data.Singletons.Prelude.Identity type Apply (LiftA2_6989586621680883680Sym0 :: TyFun (a6989586621679932937 ~> (b6989586621679932938 ~> c6989586621679932939)) (Identity a6989586621679932937 ~> (Identity b6989586621679932938 ~> Identity c6989586621679932939)) -> Type) (a6989586621680883677 :: a6989586621679932937 ~> (b6989586621679932938 ~> c6989586621679932939)) = LiftA2_6989586621680883680Sym1 a6989586621680883677 | |
annotateIOError :: IOError -> String -> Maybe Handle -> Maybe FilePath -> IOError #
Adds a location description and maybe a file path and file handle
to an IOException. If any of the file handle or file path is not given
the corresponding value in the IOException remains unaltered.
modifyIOError :: (IOError -> IOError) -> IO a -> IO a #
Catch any IOException that occurs in the computation and throw a
modified version.
ioeSetFileName :: IOError -> FilePath -> IOError #
ioeSetHandle :: IOError -> Handle -> IOError #
ioeSetLocation :: IOError -> String -> IOError #
ioeSetErrorString :: IOError -> String -> IOError #
ioeSetErrorType :: IOError -> IOErrorType -> IOError #
ioeGetFileName :: IOError -> Maybe FilePath #
ioeGetHandle :: IOError -> Maybe Handle #
ioeGetLocation :: IOError -> String #
ioeGetErrorString :: IOError -> String #
ioeGetErrorType :: IOError -> IOErrorType #
isUserErrorType :: IOErrorType -> Bool #
I/O error that is programmer-defined.
isPermissionErrorType :: IOErrorType -> Bool #
I/O error where the operation failed because the user does not have sufficient operating system privilege to perform that operation.
isIllegalOperationErrorType :: IOErrorType -> Bool #
I/O error where the operation is not possible.
isEOFErrorType :: IOErrorType -> Bool #
I/O error where the operation failed because the end of file has been reached.
isFullErrorType :: IOErrorType -> Bool #
I/O error where the operation failed because the device is full.
isAlreadyInUseErrorType :: IOErrorType -> Bool #
I/O error where the operation failed because one of its arguments is a single-use resource, which is already being used.
isDoesNotExistErrorType :: IOErrorType -> Bool #
I/O error where the operation failed because one of its arguments does not exist.
isAlreadyExistsErrorType :: IOErrorType -> Bool #
I/O error where the operation failed because one of its arguments already exists.
userErrorType :: IOErrorType #
I/O error that is programmer-defined.
permissionErrorType :: IOErrorType #
I/O error where the operation failed because the user does not have sufficient operating system privilege to perform that operation.
illegalOperationErrorType :: IOErrorType #
I/O error where the operation is not possible.
I/O error where the operation failed because the end of file has been reached.
fullErrorType :: IOErrorType #
I/O error where the operation failed because the device is full.
alreadyInUseErrorType :: IOErrorType #
I/O error where the operation failed because one of its arguments is a single-use resource, which is already being used.
doesNotExistErrorType :: IOErrorType #
I/O error where the operation failed because one of its arguments does not exist.
alreadyExistsErrorType :: IOErrorType #
I/O error where the operation failed because one of its arguments already exists.
isUserError :: IOError -> Bool #
A programmer-defined error value constructed using userError.
isPermissionError :: IOError -> Bool #
An error indicating that an IO operation failed because
the user does not have sufficient operating system privilege
to perform that operation.
isIllegalOperation :: IOError -> Bool #
An error indicating that an IO operation failed because
the operation was not possible.
Any computation which returns an IO result may fail with
isIllegalOperation. In some cases, an implementation will not be
able to distinguish between the possible error causes. In this case
it should fail with isIllegalOperation.
isEOFError :: IOError -> Bool #
An error indicating that an IO operation failed because
the end of file has been reached.
isFullError :: IOError -> Bool #
An error indicating that an IO operation failed because
the device is full.
isAlreadyInUseError :: IOError -> Bool #
An error indicating that an IO operation failed because
one of its arguments is a single-use resource, which is already
being used (for example, opening the same file twice for writing
might give this error).
isDoesNotExistError :: IOError -> Bool #
An error indicating that an IO operation failed because
one of its arguments does not exist.
isAlreadyExistsError :: IOError -> Bool #
An error indicating that an IO operation failed because
one of its arguments already exists.
mkIOError :: IOErrorType -> String -> Maybe Handle -> Maybe FilePath -> IOError #
Construct an IOException of the given type where the second argument
describes the error location and the third and fourth argument
contain the file handle and file path of the file involved in the
error if applicable.
tryIOError :: IO a -> IO (Either IOError a) #
The construct tryIOError comp exposes IO errors which occur within a
computation, and which are not fully handled.
Non-I/O exceptions are not caught by this variant; to catch all
exceptions, use try from Control.Exception.
Since: base-4.4.0.0
A monad supporting atomic memory transactions.
Instances
| Monad STM | Since: base-4.3.0.0 |
| Functor STM | Since: base-4.3.0.0 |
| Applicative STM | Since: base-4.8.0.0 |
| MonadPlus STM | Since: base-4.3.0.0 |
| Alternative STM | Since: base-4.8.0.0 |
Shared memory locations that support atomic memory transactions.
Instances
| Eq (TVar a) | Since: base-4.8.0.0 |
| PrimUnlifted (TVar a) | Since: primitive-0.6.4.0 |
Defined in Data.Primitive.UnliftedArray | |
data SomeAsyncException where #
Superclass for asynchronous exceptions.
Since: base-4.7.0.0
Constructors
| SomeAsyncException :: forall e. Exception e => e -> SomeAsyncException |
Instances
| Show SomeAsyncException | Since: base-4.7.0.0 |
Defined in GHC.IO.Exception Methods showsPrec :: Int -> SomeAsyncException -> ShowS # show :: SomeAsyncException -> String # showList :: [SomeAsyncException] -> ShowS # | |
| Exception SomeAsyncException | Since: base-4.7.0.0 |
Defined in GHC.IO.Exception Methods toException :: SomeAsyncException -> SomeException # fromException :: SomeException -> Maybe SomeAsyncException # | |
data IOErrorType #
An abstract type that contains a value for each variant of IOException.
Instances
| Eq IOErrorType | Since: base-4.1.0.0 |
Defined in GHC.IO.Exception | |
| Show IOErrorType | Since: base-4.1.0.0 |
Defined in GHC.IO.Exception Methods showsPrec :: Int -> IOErrorType -> ShowS # show :: IOErrorType -> String # showList :: [IOErrorType] -> ShowS # | |
data BufferMode #
Three kinds of buffering are supported: line-buffering, block-buffering or no-buffering. These modes have the following effects. For output, items are written out, or flushed, from the internal buffer according to the buffer mode:
- line-buffering: the entire output buffer is flushed
whenever a newline is output, the buffer overflows,
a
hFlushis issued, or the handle is closed. - block-buffering: the entire buffer is written out whenever it
overflows, a
hFlushis issued, or the handle is closed. - no-buffering: output is written immediately, and never stored in the buffer.
An implementation is free to flush the buffer more frequently, but not less frequently, than specified above. The output buffer is emptied as soon as it has been written out.
Similarly, input occurs according to the buffer mode for the handle:
- line-buffering: when the buffer for the handle is not empty, the next item is obtained from the buffer; otherwise, when the buffer is empty, characters up to and including the next newline character are read into the buffer. No characters are available until the newline character is available or the buffer is full.
- block-buffering: when the buffer for the handle becomes empty, the next block of data is read into the buffer.
- no-buffering: the next input item is read and returned.
The
hLookAheadoperation implies that even a no-buffered handle may require a one-character buffer.
The default buffering mode when a handle is opened is implementation-dependent and may depend on the file system object which is attached to that handle. For most implementations, physical files will normally be block-buffered and terminals will normally be line-buffered.
Constructors
| NoBuffering | buffering is disabled if possible. |
| LineBuffering | line-buffering should be enabled if possible. |
| BlockBuffering (Maybe Int) | block-buffering should be enabled if possible.
The size of the buffer is |
Instances
| Eq BufferMode | Since: base-4.2.0.0 |
Defined in GHC.IO.Handle.Types | |
| Ord BufferMode | Since: base-4.2.0.0 |
Defined in GHC.IO.Handle.Types Methods compare :: BufferMode -> BufferMode -> Ordering # (<) :: BufferMode -> BufferMode -> Bool # (<=) :: BufferMode -> BufferMode -> Bool # (>) :: BufferMode -> BufferMode -> Bool # (>=) :: BufferMode -> BufferMode -> Bool # max :: BufferMode -> BufferMode -> BufferMode # min :: BufferMode -> BufferMode -> BufferMode # | |
| 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] # | |
| Show BufferMode | Since: base-4.2.0.0 |
Defined in GHC.IO.Handle.Types Methods showsPrec :: Int -> BufferMode -> ShowS # show :: BufferMode -> String # showList :: [BufferMode] -> ShowS # | |
A mode that determines the effect of hSeek hdl mode i.
Instances
| Enum SeekMode | Since: base-4.2.0.0 |
| Eq SeekMode | Since: base-4.2.0.0 |
| Ord SeekMode | Since: base-4.2.0.0 |
Defined in GHC.IO.Device | |
| Read SeekMode | Since: base-4.2.0.0 |
| Show SeekMode | Since: base-4.2.0.0 |
| Ix SeekMode | Since: base-4.2.0.0 |
Defined in GHC.IO.Device | |
A mutable variable in the IO monad
Instances
data IOException #
Exceptions that occur in the IO monad.
An IOException records a more specific error type, a descriptive
string and maybe the handle that was used when the error was
flagged.
Instances
| Eq IOException | Since: base-4.1.0.0 |
Defined in GHC.IO.Exception | |
| Show IOException | Since: base-4.1.0.0 |
Defined in GHC.IO.Exception Methods showsPrec :: Int -> IOException -> ShowS # show :: IOException -> String # showList :: [IOException] -> ShowS # | |
| Exception IOException | Since: base-4.1.0.0 |
Defined in GHC.IO.Exception Methods toException :: IOException -> SomeException # fromException :: SomeException -> Maybe IOException # displayException :: IOException -> String # | |
| Error IOException | |
Defined in Control.Monad.Trans.Error | |
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
asum :: (Foldable t, Alternative f) => t (f a) -> f a #
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
The Down type allows you to reverse sort order conveniently. A value of type
Down aa (represented as Down aa has an Ordthen sortWith by Down x
Since: base-4.6.0.0
Constructors
| Down a |
Instances
| Monad Down | Since: base-4.11.0.0 |
| Functor Down | Since: base-4.11.0.0 |
| Applicative Down | Since: base-4.11.0.0 |
| Foldable Down | Since: base-4.12.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => Down m -> m # foldMap :: Monoid m => (a -> m) -> Down a -> m # 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 |
| Eq1 Down | Since: base-4.12.0.0 |
| Ord1 Down | Since: base-4.12.0.0 |
Defined in Data.Functor.Classes | |
| Read1 Down | Since: base-4.12.0.0 |
Defined in Data.Functor.Classes | |
| Show1 Down | Since: base-4.12.0.0 |
| NFData1 Down | Since: deepseq-1.4.3.0 |
Defined in Control.DeepSeq | |
| Apply Down | |
| Bind Down | |
| Eq a => Eq (Down a) | Since: base-4.6.0.0 |
| Num a => Num (Down a) | Since: base-4.11.0.0 |
| Ord a => Ord (Down a) | Since: base-4.6.0.0 |
| Read a => Read (Down a) | Since: base-4.7.0.0 |
| Show a => Show (Down a) | Since: base-4.7.0.0 |
| Generic (Down a) | |
| Semigroup a => Semigroup (Down a) | Since: base-4.11.0.0 |
| Monoid a => Monoid (Down a) | Since: base-4.11.0.0 |
| NFData a => NFData (Down a) | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| Wrapped (Down a) | |
| PMonoid (Down a) | |
| SMonoid a => SMonoid (Down a) | |
Defined in Data.Singletons.Prelude.Monoid | |
| PSemigroup (Down a) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| SSemigroup a => SSemigroup (Down a) | |
| PNum (Down a) | |
| SNum a => SNum (Down a) | |
Defined in Data.Singletons.Prelude.Num Methods (%+) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (+@#@$) t1) t2) # (%-) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (-@#@$) t1) t2) # (%*) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (*@#@$) t1) t2) # sNegate :: Sing t -> Sing (Apply NegateSym0 t) # sAbs :: Sing t -> Sing (Apply AbsSym0 t) # sSignum :: Sing t -> Sing (Apply SignumSym0 t) # sFromInteger :: Sing t -> Sing (Apply FromIntegerSym0 t) # | |
| POrd (Down a) | |
| SOrd a => SOrd (Down a) | |
Defined in Data.Singletons.Prelude.Ord Methods sCompare :: Sing t1 -> Sing t2 -> Sing (Apply (Apply CompareSym0 t1) t2) # (%<) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (<@#@$) t1) t2) # (%<=) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (<=@#@$) t1) t2) # (%>) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (>@#@$) t1) t2) # (%>=) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (>=@#@$) t1) t2) # sMax :: Sing t1 -> Sing t2 -> Sing (Apply (Apply MaxSym0 t1) t2) # sMin :: Sing t1 -> Sing t2 -> Sing (Apply (Apply MinSym0 t1) t2) # | |
| Generic1 Down | |
| t ~ Down b => Rewrapped (Down a) t | |
Defined in Control.Lens.Wrapped | |
| SuppressUnusedWarnings (DownSym0 :: TyFun a6989586621679090648 (Down a6989586621679090648) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Pure_6989586621680947061Sym0 :: TyFun a6989586621679932934 (Down a6989586621679932934) -> Type) | |
Defined in Data.Singletons.Prelude.Applicative Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679828457Sym0 :: TyFun (Down a6989586621679827814) (Down a6989586621679827814 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SingI (DownSym0 :: TyFun a (Down a) -> Type) | |
Defined in Data.Singletons.Prelude.Ord | |
| SuppressUnusedWarnings (TFHelper_6989586621680174177Sym0 :: TyFun a6989586621679932931 (Down b6989586621679932932 ~> Down a6989586621679932931) -> Type) | |
Defined in Data.Singletons.Prelude.Functor Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679828457Sym1 a6989586621679828455 :: TyFun (Down a6989586621679827814) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621681062785Sym0 :: TyFun (Down a6989586621679932958) ((a6989586621679932958 ~> Down b6989586621679932959) ~> Down b6989586621679932959) -> Type) | |
Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680947153Sym0 :: TyFun (Down (a6989586621679932935 ~> b6989586621679932936)) (Down a6989586621679932935 ~> Down b6989586621679932936) -> Type) | |
Defined in Data.Singletons.Prelude.Applicative Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Fmap_6989586621680174158Sym0 :: TyFun (a6989586621679932929 ~> b6989586621679932930) (Down a6989586621679932929 ~> Down b6989586621679932930) -> Type) | |
Defined in Data.Singletons.Prelude.Functor Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680174177Sym1 a6989586621680174175 b6989586621679932932 :: TyFun (Down b6989586621679932932) (Down a6989586621679932931) -> Type) | |
Defined in Data.Singletons.Prelude.Functor Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Fmap_6989586621680174158Sym1 a6989586621680174156 :: TyFun (Down a6989586621679932929) (Down b6989586621679932930) -> Type) | |
Defined in Data.Singletons.Prelude.Functor Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680947153Sym1 a6989586621680947150 :: TyFun (Down a6989586621679932935) (Down b6989586621679932936) -> Type) | |
Defined in Data.Singletons.Prelude.Applicative Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621681062785Sym1 a6989586621681062783 b6989586621679932959 :: TyFun (a6989586621679932958 ~> Down b6989586621679932959) (Down b6989586621679932959) -> Type) | |
Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () # | |
| type Pure (a :: k1) | |
| type Fail arg | |
| type Return (arg :: a) | |
| type (a1 :: k1) <$ (a2 :: Down b6989586621679932932) | |
| type Fmap (a1 :: a6989586621679932929 ~> b6989586621679932930) (a2 :: Down a6989586621679932929) | |
Defined in Data.Singletons.Prelude.Functor | |
| type (arg1 :: Down a) <* (arg2 :: Down b) | |
| type (arg1 :: Down a) *> (arg2 :: Down b) | |
| type (a1 :: Down (a6989586621679932935 ~> b6989586621679932936)) <*> (a2 :: Down a6989586621679932935) | |
Defined in Data.Singletons.Prelude.Applicative | |
| type (arg1 :: Down a) >> (arg2 :: Down b) | |
| type (a1 :: Down a6989586621679932958) >>= (a2 :: a6989586621679932958 ~> Down b6989586621679932959) | |
Defined in Data.Singletons.Prelude.Monad | |
| type LiftA2 (arg1 :: a ~> (b ~> c)) (arg2 :: Down a) (arg3 :: Down b) | |
| type Apply (Compare_6989586621679828457Sym1 a6989586621679828455 :: TyFun (Down a) Ordering -> Type) (a6989586621679828456 :: Down 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 Mempty | |
Defined in Data.Singletons.Prelude.Monoid | |
| data Sing (b :: Down a) | |
| type Demote (Down a) | |
Defined in Data.Singletons.Prelude.Ord | |
| 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 FromInteger a2 | |
Defined in Data.Singletons.Prelude.Num | |
| type Signum (a2 :: Down a1) | |
| type Abs (a2 :: Down a1) | |
| type Negate (a2 :: Down a1) | |
| type Mappend (arg1 :: Down a) (arg2 :: Down a) | |
| type (a2 :: Down a1) <> (a3 :: Down a1) | |
| type (a2 :: Down a1) * (a3 :: Down a1) | |
| type (a2 :: Down a1) - (a3 :: Down a1) | |
| type (a2 :: Down a1) + (a3 :: Down a1) | |
| type Min (arg1 :: Down a) (arg2 :: Down a) | |
| type Max (arg1 :: Down a) (arg2 :: Down a) | |
| type (arg1 :: Down a) >= (arg2 :: Down a) | |
| type (arg1 :: Down a) > (arg2 :: Down a) | |
| type (arg1 :: Down a) <= (arg2 :: Down a) | |
| type (arg1 :: Down a) < (arg2 :: Down a) | |
| type Compare (a2 :: Down a1) (a3 :: Down a1) | |
| type (x :: Down a) /= (y :: Down a) | |
| type (a2 :: Down a1) == (b :: Down a1) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (DownSym0 :: TyFun a (Down a) -> Type) (t6989586621679826756 :: a) | |
| type Apply (Pure_6989586621680947061Sym0 :: TyFun a (Down a) -> Type) (a6989586621680947060 :: a) | |
Defined in Data.Singletons.Prelude.Applicative | |
| type Apply (Fmap_6989586621680174158Sym1 a6989586621680174156 :: TyFun (Down a) (Down b) -> Type) (a6989586621680174157 :: Down a) | |
| type Apply (TFHelper_6989586621680174177Sym1 a6989586621680174175 b :: TyFun (Down b) (Down a) -> Type) (a6989586621680174176 :: Down b) | |
| type Apply (TFHelper_6989586621680947153Sym1 a6989586621680947150 :: TyFun (Down a) (Down b) -> Type) (a6989586621680947152 :: Down a) | |
| type Apply (TFHelper_6989586621681062785Sym1 a6989586621681062783 b :: TyFun (a ~> Down b) (Down b) -> Type) (a6989586621681062784 :: a ~> Down b) | |
| type Apply (TFHelper_6989586621680174177Sym0 :: TyFun a6989586621679932931 (Down b6989586621679932932 ~> Down a6989586621679932931) -> Type) (a6989586621680174175 :: a6989586621679932931) | |
Defined in Data.Singletons.Prelude.Functor type Apply (TFHelper_6989586621680174177Sym0 :: TyFun a6989586621679932931 (Down b6989586621679932932 ~> Down a6989586621679932931) -> Type) (a6989586621680174175 :: a6989586621679932931) = (TFHelper_6989586621680174177Sym1 a6989586621680174175 b6989586621679932932 :: TyFun (Down b6989586621679932932) (Down a6989586621679932931) -> Type) | |
| type Apply (Compare_6989586621679828457Sym0 :: TyFun (Down a6989586621679827814) (Down a6989586621679827814 ~> Ordering) -> Type) (a6989586621679828455 :: Down a6989586621679827814) | |
| type Apply (TFHelper_6989586621680947153Sym0 :: TyFun (Down (a6989586621679932935 ~> b6989586621679932936)) (Down a6989586621679932935 ~> Down b6989586621679932936) -> Type) (a6989586621680947150 :: Down (a6989586621679932935 ~> b6989586621679932936)) | |
Defined in Data.Singletons.Prelude.Applicative type Apply (TFHelper_6989586621680947153Sym0 :: TyFun (Down (a6989586621679932935 ~> b6989586621679932936)) (Down a6989586621679932935 ~> Down b6989586621679932936) -> Type) (a6989586621680947150 :: Down (a6989586621679932935 ~> b6989586621679932936)) = TFHelper_6989586621680947153Sym1 a6989586621680947150 | |
| type Apply (TFHelper_6989586621681062785Sym0 :: TyFun (Down a6989586621679932958) ((a6989586621679932958 ~> Down b6989586621679932959) ~> Down b6989586621679932959) -> Type) (a6989586621681062783 :: Down a6989586621679932958) | |
Defined in Data.Singletons.Prelude.Monad type Apply (TFHelper_6989586621681062785Sym0 :: TyFun (Down a6989586621679932958) ((a6989586621679932958 ~> Down b6989586621679932959) ~> Down b6989586621679932959) -> Type) (a6989586621681062783 :: Down a6989586621679932958) = (TFHelper_6989586621681062785Sym1 a6989586621681062783 b6989586621679932959 :: TyFun (a6989586621679932958 ~> Down b6989586621679932959) (Down b6989586621679932959) -> Type) | |
| type Apply (Fmap_6989586621680174158Sym0 :: TyFun (a6989586621679932929 ~> b6989586621679932930) (Down a6989586621679932929 ~> Down b6989586621679932930) -> Type) (a6989586621680174156 :: a6989586621679932929 ~> b6989586621679932930) | |
Defined in Data.Singletons.Prelude.Functor | |
asProxyTypeOf :: a -> proxy a -> a #
asProxyTypeOf is a type-restricted version of const.
It is usually used as an infix operator, and its typing forces its first
argument (which is usually overloaded) to have the same type as the tag
of the second.
>>>import Data.Word>>>:type asProxyTypeOf 123 (Proxy :: Proxy Word8)asProxyTypeOf 123 (Proxy :: Proxy Word8) :: Word8
Note the lower-case proxy in the definition. This allows any type
constructor with just one argument to be passed to the function, for example
we could also write
>>>import Data.Word>>>:type asProxyTypeOf 123 (Just (undefined :: Word8))asProxyTypeOf 123 (Just (undefined :: Word8)) :: Word8
data Proxy (t :: k) :: forall k. k -> Type #
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 a'undefined :: a' idiom.
>>>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) | |
| FunctorWithIndex Void (Proxy :: Type -> Type) | |
| FoldableWithIndex Void (Proxy :: Type -> Type) | |
Defined in Control.Lens.Indexed | |
| TraversableWithIndex Void (Proxy :: Type -> Type) | |
Defined in Control.Lens.Indexed Methods itraverse :: Applicative f => (Void -> a -> f b) -> Proxy a -> f (Proxy b) # itraversed :: IndexedTraversal Void (Proxy a) (Proxy b) a b # | |
| Monad (Proxy :: Type -> Type) | Since: base-4.7.0.0 |
| Functor (Proxy :: Type -> Type) | Since: base-4.7.0.0 |
| Applicative (Proxy :: Type -> Type) | Since: base-4.7.0.0 |
| Foldable (Proxy :: Type -> Type) | Since: base-4.7.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => Proxy m -> m # foldMap :: Monoid m => (a -> m) -> Proxy a -> m # 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 |
| MonadPlus (Proxy :: Type -> Type) | Since: base-4.9.0.0 |
| Alternative (Proxy :: Type -> Type) | Since: base-4.9.0.0 |
| Distributive (Proxy :: Type -> Type) | |
| Contravariant (Proxy :: Type -> Type) | |
| Representable (Proxy :: Type -> Type) | |
| Eq1 (Proxy :: Type -> Type) | Since: base-4.9.0.0 |
| Ord1 (Proxy :: Type -> Type) | Since: base-4.9.0.0 |
Defined in Data.Functor.Classes | |
| Read1 (Proxy :: Type -> Type) | Since: base-4.9.0.0 |
Defined in Data.Functor.Classes | |
| Show1 (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 | |
| Keyed (Proxy :: Type -> Type) | |
| Zip (Proxy :: Type -> Type) | |
| ZipWithKey (Proxy :: Type -> Type) | |
| Indexable (Proxy :: Type -> Type) | |
| Lookup (Proxy :: Type -> Type) | |
| Adjustable (Proxy :: Type -> Type) | |
| FoldableWithKey (Proxy :: Type -> Type) | |
| TraversableWithKey (Proxy :: Type -> Type) | |
Defined in Data.Key Methods traverseWithKey :: Applicative f => (Key Proxy -> a -> f b) -> Proxy a -> f (Proxy b) # mapWithKeyM :: Monad m => (Key Proxy -> a -> m b) -> Proxy a -> m (Proxy b) # | |
| Apply (Proxy :: Type -> Type) | |
| Bind (Proxy :: Type -> Type) | |
| Bounded (Proxy t) | Since: base-4.7.0.0 |
| Enum (Proxy s) | Since: base-4.7.0.0 |
| Eq (Proxy s) | Since: base-4.7.0.0 |
| Ord (Proxy s) | Since: base-4.7.0.0 |
| Read (Proxy t) | Since: base-4.7.0.0 |
| Show (Proxy s) | Since: base-4.7.0.0 |
| Ix (Proxy s) | Since: base-4.7.0.0 |
Defined in Data.Proxy | |
| Generic (Proxy t) | |
| Semigroup (Proxy s) | Since: base-4.9.0.0 |
| Monoid (Proxy s) | Since: base-4.7.0.0 |
| NFData (Proxy a) | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| Hashable (Proxy a) | |
Defined in Data.Hashable.Class | |
| type Rep1 (Proxy :: k -> Type) | Since: base-4.6.0.0 |
| type Rep (Proxy :: Type -> Type) | |
| type Key (Proxy :: Type -> Type) | |
| type Rep (Proxy t) | Since: base-4.6.0.0 |
A concrete, promotable proxy type, for use at the kind level There are no instances for this because it is intended at the kind level only
Constructors
| KProxy |
See openFile
Constructors
| ReadMode | |
| WriteMode | |
| AppendMode | |
| ReadWriteMode |
The member functions of this class facilitate writing values of primitive types to raw memory (which may have been allocated with the above mentioned routines) and reading values from blocks of raw memory. The class, furthermore, includes support for computing the storage requirements and alignment restrictions of storable types.
Memory addresses are represented as values of type Ptr aa which is an instance of class Storable. The type argument to
Ptr helps provide some valuable type safety in FFI code (you can't
mix pointers of different types without an explicit cast), while
helping the Haskell type system figure out which marshalling method is
needed for a given pointer.
All marshalling between Haskell and a foreign language ultimately
boils down to translating Haskell data structures into the binary
representation of a corresponding data structure of the foreign
language and vice versa. To code this marshalling in Haskell, it is
necessary to manipulate primitive data types stored in unstructured
memory blocks. The class Storable facilitates this manipulation on
all types for which it is instantiated, which are the standard basic
types of Haskell, the fixed size Int types (Int8, Int16,
Int32, Int64), the fixed size Word types (Word8, Word16,
Word32, Word64), StablePtr, all types from Foreign.C.Types,
as well as Ptr.
Minimal complete definition
sizeOf, alignment, (peek | peekElemOff | peekByteOff), (poke | pokeElemOff | pokeByteOff)
Instances
a value of type STRef s a is a mutable variable in state thread s,
containing a value of type a
>>>:{runST (do ref <- newSTRef "hello" x <- readSTRef ref writeSTRef ref (x ++ "world") readSTRef ref ) :} "helloworld"
Instances
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
An MVar (pronounced "em-var") is a synchronising variable, used
for communication between concurrent threads. It can be thought of
as a box, which may be empty or full.
Instances
| NFData1 MVar | Since: deepseq-1.4.3.0 |
Defined in Control.DeepSeq | |
| Eq (MVar a) | Since: base-4.1.0.0 |
| NFData (MVar a) | NOTE: Only strict in the reference and not the referenced value. Since: deepseq-1.4.2.0 |
Defined in Control.DeepSeq | |
| PrimUnlifted (MVar a) | Since: primitive-0.6.4.0 |
Defined in Data.Primitive.UnliftedArray | |
liftM5 :: Monad m => (a1 -> a2 -> a3 -> a4 -> a5 -> r) -> m a1 -> m a2 -> m a3 -> m a4 -> m a5 -> m r #
Promote a function to a monad, scanning the monadic arguments from
left to right (cf. liftM2).
liftM4 :: Monad m => (a1 -> a2 -> a3 -> a4 -> r) -> m a1 -> m a2 -> m a3 -> m a4 -> m r #
Promote a function to a monad, scanning the monadic arguments from
left to right (cf. liftM2).
liftM3 :: Monad m => (a1 -> a2 -> a3 -> r) -> m a1 -> m a2 -> m a3 -> m r #
Promote a function to a monad, scanning the monadic arguments from
left to right (cf. liftM2).
liftA3 :: Applicative f => (a -> b -> c -> d) -> f a -> f b -> f c -> f d #
Lift a ternary function to actions.
liftA :: Applicative f => (a -> b) -> f a -> f b #
(<**>) :: Applicative f => f a -> f (a -> b) -> f b infixl 4 #
A variant of <*> with the arguments reversed.
data SomeException where #
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
| SomeException :: forall e. Exception e => e -> SomeException |
Instances
| Show SomeException | Since: base-3.0 |
Defined in GHC.Exception.Type Methods showsPrec :: Int -> SomeException -> ShowS # show :: SomeException -> String # showList :: [SomeException] -> ShowS # | |
| Exception SomeException | Since: base-3.0 |
Defined in GHC.Exception.Type Methods toException :: SomeException -> SomeException # fromException :: SomeException -> Maybe SomeException # displayException :: SomeException -> String # | |
terror :: HasCallStack => Text -> a #
error applied to Text
Since 0.4.1
type LByteString = ByteString #
Boxed vectors, supporting efficient slicing.
Instances
class (Vector Vector a, MVector MVector a) => Unbox a #
Instances
A set of values. A set cannot contain duplicate values.
Instances
| Foldable HashSet | |
Defined in Data.HashSet Methods fold :: Monoid m => HashSet m -> m # foldMap :: Monoid m => (a -> m) -> HashSet a -> m # foldr :: (a -> b -> b) -> b -> HashSet a -> b # foldr' :: (a -> b -> b) -> b -> HashSet a -> b # foldl :: (b -> a -> b) -> b -> HashSet a -> b # foldl' :: (b -> a -> b) -> b -> HashSet a -> b # foldr1 :: (a -> a -> a) -> HashSet a -> a # foldl1 :: (a -> a -> a) -> HashSet a -> a # elem :: Eq a => a -> HashSet a -> Bool # maximum :: Ord a => HashSet a -> a # minimum :: Ord a => HashSet a -> a # | |
| Eq1 HashSet | |
| Ord1 HashSet | |
Defined in Data.HashSet | |
| Show1 HashSet | |
| Hashable1 HashSet | |
Defined in Data.HashSet | |
| (Eq a, Hashable a) => IsList (HashSet a) | |
| Eq a => Eq (HashSet a) | |
| (Data a, Eq a, Hashable a) => Data (HashSet a) | |
Defined in Data.HashSet 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 :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> HashSet a -> r # gmapQ :: (forall d. Data d => d -> u) -> HashSet a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> HashSet a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> HashSet a -> m (HashSet a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> HashSet a -> m (HashSet a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> HashSet a -> m (HashSet a) # | |
| Ord a => Ord (HashSet a) | |
| (Eq a, Hashable a, Read a) => Read (HashSet a) | |
| Show a => Show (HashSet a) | |
| (Hashable a, Eq a) => Semigroup (HashSet a) | |
| (Hashable a, Eq a) => Monoid (HashSet a) | |
| NFData a => NFData (HashSet a) | |
Defined in Data.HashSet | |
| Hashable a => Hashable (HashSet a) | |
Defined in Data.HashSet | |
| (Eq v, Hashable v) => GrowingAppend (HashSet v) | |
Defined in Data.MonoTraversable | |
| Hashable a => MonoPointed (HashSet a) | |
| MonoFoldable (HashSet e) | |
Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element (HashSet e) -> m) -> HashSet e -> m # ofoldr :: (Element (HashSet e) -> b -> b) -> b -> HashSet e -> b # ofoldl' :: (a -> Element (HashSet e) -> a) -> a -> HashSet e -> a # otoList :: HashSet e -> [Element (HashSet e)] # oall :: (Element (HashSet e) -> Bool) -> HashSet e -> Bool # oany :: (Element (HashSet e) -> Bool) -> HashSet e -> Bool # olength64 :: HashSet e -> Int64 # ocompareLength :: Integral i => HashSet e -> i -> Ordering # otraverse_ :: Applicative f => (Element (HashSet e) -> f b) -> HashSet e -> f () # ofor_ :: Applicative f => HashSet e -> (Element (HashSet e) -> f b) -> f () # omapM_ :: Applicative m => (Element (HashSet e) -> m ()) -> HashSet e -> m () # oforM_ :: Applicative m => HashSet e -> (Element (HashSet e) -> m ()) -> m () # ofoldlM :: Monad m => (a -> Element (HashSet e) -> m a) -> a -> HashSet e -> m a # ofoldMap1Ex :: Semigroup m => (Element (HashSet e) -> m) -> HashSet e -> m # ofoldr1Ex :: (Element (HashSet e) -> Element (HashSet e) -> Element (HashSet e)) -> HashSet e -> Element (HashSet e) # ofoldl1Ex' :: (Element (HashSet e) -> Element (HashSet e) -> Element (HashSet e)) -> HashSet e -> Element (HashSet e) # headEx :: HashSet e -> Element (HashSet e) # lastEx :: HashSet e -> Element (HashSet e) # unsafeHead :: HashSet e -> Element (HashSet e) # unsafeLast :: HashSet e -> Element (HashSet e) # maximumByEx :: (Element (HashSet e) -> Element (HashSet e) -> Ordering) -> HashSet e -> Element (HashSet e) # minimumByEx :: (Element (HashSet e) -> Element (HashSet e) -> Ordering) -> HashSet e -> Element (HashSet e) # | |
| (Eq element, Hashable element) => IsSet (HashSet element) | |
Defined in Data.Containers Methods insertSet :: Element (HashSet element) -> HashSet element -> HashSet element # deleteSet :: Element (HashSet element) -> HashSet element -> HashSet element # singletonSet :: Element (HashSet element) -> HashSet element # setFromList :: [Element (HashSet element)] -> HashSet element # setToList :: HashSet element -> [Element (HashSet element)] # | |
| (Eq element, Hashable element) => SetContainer (HashSet element) | |
Defined in Data.Containers Associated Types type ContainerKey (HashSet element) :: Type # Methods member :: ContainerKey (HashSet element) -> HashSet element -> Bool # notMember :: ContainerKey (HashSet element) -> HashSet element -> Bool # union :: HashSet element -> HashSet element -> HashSet element # unions :: (MonoFoldable mono, Element mono ~ HashSet element) => mono -> HashSet element # difference :: HashSet element -> HashSet element -> HashSet element # intersection :: HashSet element -> HashSet element -> HashSet element # keys :: HashSet element -> [ContainerKey (HashSet element)] # | |
| (Eq a, Hashable a) => Contains (HashSet a) | |
| (Eq k, Hashable k) => Ixed (HashSet k) | |
Defined in Control.Lens.At | |
| (Eq k, Hashable k) => At (HashSet k) | |
| (Hashable a, Eq a) => Wrapped (HashSet a) | |
| (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 | |
| type Element (HashSet e) | |
Defined in Data.MonoTraversable | |
| type ContainerKey (HashSet element) | |
Defined in Data.Containers | |
| 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 | |
(<.>) :: FilePath -> String -> FilePath infixr 7 #
Add an extension, even if there is already one there, equivalent to addExtension.
"/directory/path" <.> "ext" == "/directory/path.ext" "/directory/path" <.> ".ext" == "/directory/path.ext"
(</>) :: FilePath -> FilePath -> FilePath infixr 5 #
Combine two paths with a path separator.
If the second path starts with a path separator or a drive letter, then it returns the second.
The intention is that readFile (dir will access the same file as
</> file)setCurrentDirectory dir; readFile file.
Posix: "/directory" </> "file.ext" == "/directory/file.ext"
Windows: "/directory" </> "file.ext" == "/directory\\file.ext"
"directory" </> "/file.ext" == "/file.ext"
Valid x => (takeDirectory x </> takeFileName x) `equalFilePath` xCombined:
Posix: "/" </> "test" == "/test" Posix: "home" </> "bob" == "home/bob" Posix: "x:" </> "foo" == "x:/foo" Windows: "C:\\foo" </> "bar" == "C:\\foo\\bar" Windows: "home" </> "bob" == "home\\bob"
Not combined:
Posix: "home" </> "/bob" == "/bob" Windows: "home" </> "C:\\bob" == "C:\\bob"
Not combined (tricky):
On Windows, if a filepath starts with a single slash, it is relative to the
root of the current drive. In [1], this is (confusingly) referred to as an
absolute path.
The current behavior of </> is to never combine these forms.
Windows: "home" </> "/bob" == "/bob" Windows: "home" </> "\\bob" == "\\bob" Windows: "C:\\home" </> "\\bob" == "\\bob"
On Windows, from [1]: "If a file name begins with only a disk designator
but not the backslash after the colon, it is interpreted as a relative path
to the current directory on the drive with the specified letter."
The current behavior of </> is to never combine these forms.
Windows: "D:\\foo" </> "C:bar" == "C:bar" Windows: "C:\\foo" </> "C:bar" == "C:bar"
A set of values a.
Instances
| Foldable Set | |
Defined in Data.Set.Internal Methods fold :: Monoid m => Set m -> m # foldMap :: Monoid m => (a -> m) -> Set a -> m # foldr :: (a -> b -> b) -> b -> Set a -> b # foldr' :: (a -> b -> b) -> b -> Set a -> b # foldl :: (b -> a -> b) -> b -> Set a -> b # foldl' :: (b -> a -> b) -> b -> Set a -> b # foldr1 :: (a -> a -> a) -> Set a -> a # foldl1 :: (a -> a -> a) -> Set a -> a # elem :: Eq a => a -> Set a -> Bool # maximum :: Ord a => Set a -> a # | |
| Eq1 Set | Since: containers-0.5.9 |
| Ord1 Set | Since: containers-0.5.9 |
Defined in Data.Set.Internal | |
| Show1 Set | Since: containers-0.5.9 |
| Ord a => IsList (Set a) | Since: containers-0.5.6.2 |
| Eq a => Eq (Set a) | |
| (Data a, Ord a) => Data (Set a) | |
Defined in Data.Set.Internal Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Set a -> c (Set a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Set a) # dataTypeOf :: Set a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Set a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Set a)) # gmapT :: (forall b. Data b => b -> b) -> Set a -> Set a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Set a -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Set a -> r # gmapQ :: (forall d. Data d => d -> u) -> Set a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Set a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Set a -> m (Set a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Set a -> m (Set a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Set a -> m (Set a) # | |
| Ord a => Ord (Set a) | |
| (Read a, Ord a) => Read (Set a) | |
| Show a => Show (Set a) | |
| Ord a => Semigroup (Set a) | Since: containers-0.5.7 |
| Ord a => Monoid (Set a) | |
| NFData a => NFData (Set a) | |
Defined in Data.Set.Internal | |
| Ord v => GrowingAppend (Set v) | |
Defined in Data.MonoTraversable | |
| MonoPointed (Set a) | |
| Ord e => MonoFoldable (Set e) | |
Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element (Set e) -> m) -> Set e -> m # ofoldr :: (Element (Set e) -> b -> b) -> b -> Set e -> b # ofoldl' :: (a -> Element (Set e) -> a) -> a -> Set e -> a # otoList :: Set e -> [Element (Set e)] # oall :: (Element (Set e) -> Bool) -> Set e -> Bool # oany :: (Element (Set e) -> Bool) -> Set e -> Bool # ocompareLength :: Integral i => Set e -> i -> Ordering # otraverse_ :: Applicative f => (Element (Set e) -> f b) -> Set e -> f () # ofor_ :: Applicative f => Set e -> (Element (Set e) -> f b) -> f () # omapM_ :: Applicative m => (Element (Set e) -> m ()) -> Set e -> m () # oforM_ :: Applicative m => Set e -> (Element (Set e) -> m ()) -> m () # ofoldlM :: Monad m => (a -> Element (Set e) -> m a) -> a -> Set e -> m a # ofoldMap1Ex :: Semigroup m => (Element (Set e) -> m) -> Set e -> m # ofoldr1Ex :: (Element (Set e) -> Element (Set e) -> Element (Set e)) -> Set e -> Element (Set e) # ofoldl1Ex' :: (Element (Set e) -> Element (Set e) -> Element (Set e)) -> Set e -> Element (Set e) # headEx :: Set e -> Element (Set e) # lastEx :: Set e -> Element (Set e) # unsafeHead :: Set e -> Element (Set e) # unsafeLast :: Set e -> Element (Set e) # maximumByEx :: (Element (Set e) -> Element (Set e) -> Ordering) -> Set e -> Element (Set e) # minimumByEx :: (Element (Set e) -> Element (Set e) -> Ordering) -> Set e -> Element (Set e) # | |
| Ord element => IsSet (Set element) | |
| Ord element => SetContainer (Set element) | |
Defined in Data.Containers Associated Types type ContainerKey (Set element) :: Type # Methods member :: ContainerKey (Set element) -> Set element -> Bool # notMember :: ContainerKey (Set element) -> Set element -> Bool # union :: Set element -> Set element -> Set element # unions :: (MonoFoldable mono, Element mono ~ Set element) => mono -> Set element # difference :: Set element -> Set element -> Set element # intersection :: Set element -> Set element -> Set element # keys :: Set element -> [ContainerKey (Set element)] # | |
| Ord a => Contains (Set a) | |
| Ord k => Ixed (Set k) | |
Defined in Control.Lens.At | |
| Ord k => At (Set k) | |
| Ord a => Wrapped (Set a) | |
| (t ~ Set a', Ord a) => Rewrapped (Set a) t | Use |
Defined in Control.Lens.Wrapped | |
| type Item (Set a) | |
Defined in Data.Set.Internal | |
| type Element (Set e) | |
Defined in Data.MonoTraversable | |
| type ContainerKey (Set element) | |
Defined in Data.Containers | |
| 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 | |
General-purpose finite sequences.
Instances
| Monad Seq | |
| Functor Seq | |
| MonadFix Seq | Since: containers-0.5.11 |
Defined in Data.Sequence.Internal | |
| Applicative Seq | Since: containers-0.5.4 |
| Foldable Seq | |
Defined in Data.Sequence.Internal Methods fold :: Monoid m => Seq m -> m # foldMap :: Monoid m => (a -> m) -> Seq a -> m # foldr :: (a -> b -> b) -> b -> Seq a -> b # foldr' :: (a -> b -> b) -> b -> Seq a -> b # foldl :: (b -> a -> b) -> b -> Seq a -> b # foldl' :: (b -> a -> b) -> b -> Seq a -> b # foldr1 :: (a -> a -> a) -> Seq a -> a # foldl1 :: (a -> a -> a) -> Seq a -> a # elem :: Eq a => a -> Seq a -> Bool # maximum :: Ord a => Seq a -> a # | |
| Traversable Seq | |
| MonadPlus Seq | |
| Alternative Seq | Since: containers-0.5.4 |
| Eq1 Seq | Since: containers-0.5.9 |
| Ord1 Seq | Since: containers-0.5.9 |
Defined in Data.Sequence.Internal | |
| Read1 Seq | Since: containers-0.5.9 |
Defined in Data.Sequence.Internal | |
| Show1 Seq | Since: containers-0.5.9 |
| MonadZip Seq |
|
| Zip Seq | |
| Zip3 Seq | |
| Zip4 Seq | |
Defined in Data.ChunkedZip | |
| Keyed Seq | |
| Zip Seq | |
| ZipWithKey Seq | |
| Indexable Seq | |
| Lookup Seq | |
| Adjustable Seq | |
| FoldableWithKey Seq | |
| TraversableWithKey Seq | |
Defined in Data.Key Methods traverseWithKey :: Applicative f => (Key Seq -> a -> f b) -> Seq a -> f (Seq b) # mapWithKeyM :: Monad m => (Key Seq -> a -> m b) -> Seq a -> m (Seq b) # | |
| Apply Seq | |
| Bind Seq | |
| UnzipWith Seq | |
Defined in Data.Sequence.Internal Methods unzipWith' :: (x -> (a, b)) -> Seq x -> (Seq a, Seq b) | |
| FunctorWithIndex Int Seq | The position in the |
| FoldableWithIndex Int Seq | |
| TraversableWithIndex Int Seq | |
Defined in Control.Lens.Indexed Methods itraverse :: Applicative f => (Int -> a -> f b) -> Seq a -> f (Seq b) # itraversed :: IndexedTraversal Int (Seq a) (Seq b) a b # | |
| IsList (Seq a) | |
| Eq a => Eq (Seq a) | |
| Data a => Data (Seq a) | |
Defined in Data.Sequence.Internal Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Seq a -> c (Seq a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Seq a) # dataTypeOf :: Seq a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Seq a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Seq a)) # gmapT :: (forall b. Data b => b -> b) -> Seq a -> Seq a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Seq a -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Seq a -> r # gmapQ :: (forall d. Data d => d -> u) -> Seq a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Seq a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Seq a -> m (Seq a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Seq a -> m (Seq a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Seq a -> m (Seq a) # | |
| Ord a => Ord (Seq a) | |
| Read a => Read (Seq a) | |
| Show a => Show (Seq a) | |
| a ~ Char => IsString (Seq a) | Since: containers-0.5.7 |
Defined in Data.Sequence.Internal Methods fromString :: String -> Seq a # | |
| Semigroup (Seq a) | Since: containers-0.5.7 |
| Monoid (Seq a) | |
| NFData a => NFData (Seq a) | |
Defined in Data.Sequence.Internal | |
| GrowingAppend (Seq a) | |
Defined in Data.MonoTraversable | |
| MonoPointed (Seq a) | |
| MonoTraversable (Seq a) | |
| MonoFoldable (Seq a) | |
Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element (Seq a) -> m) -> Seq a -> m # ofoldr :: (Element (Seq a) -> b -> b) -> b -> Seq a -> b # ofoldl' :: (a0 -> Element (Seq a) -> a0) -> a0 -> Seq a -> a0 # otoList :: Seq a -> [Element (Seq a)] # oall :: (Element (Seq a) -> Bool) -> Seq a -> Bool # oany :: (Element (Seq a) -> Bool) -> Seq a -> Bool # ocompareLength :: Integral i => Seq a -> i -> Ordering # otraverse_ :: Applicative f => (Element (Seq a) -> f b) -> Seq a -> f () # ofor_ :: Applicative f => Seq a -> (Element (Seq a) -> f b) -> f () # omapM_ :: Applicative m => (Element (Seq a) -> m ()) -> Seq a -> m () # oforM_ :: Applicative m => Seq a -> (Element (Seq a) -> m ()) -> m () # ofoldlM :: Monad m => (a0 -> Element (Seq a) -> m a0) -> a0 -> Seq a -> m a0 # ofoldMap1Ex :: Semigroup m => (Element (Seq a) -> m) -> Seq a -> m # ofoldr1Ex :: (Element (Seq a) -> Element (Seq a) -> Element (Seq a)) -> Seq a -> Element (Seq a) # ofoldl1Ex' :: (Element (Seq a) -> Element (Seq a) -> Element (Seq a)) -> Seq a -> Element (Seq a) # headEx :: Seq a -> Element (Seq a) # lastEx :: Seq a -> Element (Seq a) # unsafeHead :: Seq a -> Element (Seq a) # unsafeLast :: Seq a -> Element (Seq a) # maximumByEx :: (Element (Seq a) -> Element (Seq a) -> Ordering) -> Seq a -> Element (Seq a) # minimumByEx :: (Element (Seq a) -> Element (Seq a) -> Ordering) -> Seq a -> Element (Seq a) # | |
| MonoFunctor (Seq a) | |
| IsSequence (Seq a) | |
Defined in Data.Sequences Methods fromList :: [Element (Seq a)] -> Seq a # lengthIndex :: Seq a -> Index (Seq a) # break :: (Element (Seq a) -> Bool) -> Seq a -> (Seq a, Seq a) # span :: (Element (Seq a) -> Bool) -> Seq a -> (Seq a, Seq a) # dropWhile :: (Element (Seq a) -> Bool) -> Seq a -> Seq a # takeWhile :: (Element (Seq a) -> Bool) -> Seq a -> Seq a # splitAt :: Index (Seq a) -> Seq a -> (Seq a, Seq a) # unsafeSplitAt :: Index (Seq a) -> Seq a -> (Seq a, Seq a) # take :: Index (Seq a) -> Seq a -> Seq a # unsafeTake :: Index (Seq a) -> Seq a -> Seq a # drop :: Index (Seq a) -> Seq a -> Seq a # unsafeDrop :: Index (Seq a) -> Seq a -> Seq a # dropEnd :: Index (Seq a) -> Seq a -> Seq a # partition :: (Element (Seq a) -> Bool) -> Seq a -> (Seq a, Seq a) # uncons :: Seq a -> Maybe (Element (Seq a), Seq a) # unsnoc :: Seq a -> Maybe (Seq a, Element (Seq a)) # filter :: (Element (Seq a) -> Bool) -> Seq a -> Seq a # filterM :: Monad m => (Element (Seq a) -> m Bool) -> Seq a -> m (Seq a) # replicate :: Index (Seq a) -> Element (Seq a) -> Seq a # replicateM :: Monad m => Index (Seq a) -> m (Element (Seq a)) -> m (Seq a) # groupBy :: (Element (Seq a) -> Element (Seq a) -> Bool) -> Seq a -> [Seq a] # groupAllOn :: Eq b => (Element (Seq a) -> b) -> Seq a -> [Seq a] # subsequences :: Seq a -> [Seq a] # permutations :: Seq a -> [Seq a] # tailMay :: Seq a -> Maybe (Seq a) # initMay :: Seq a -> Maybe (Seq a) # unsafeTail :: Seq a -> Seq a # unsafeInit :: Seq a -> Seq a # index :: Seq a -> Index (Seq a) -> Maybe (Element (Seq a)) # indexEx :: Seq a -> Index (Seq a) -> Element (Seq a) # unsafeIndex :: Seq a -> Index (Seq a) -> Element (Seq a) # splitWhen :: (Element (Seq a) -> Bool) -> Seq a -> [Seq a] # | |
| SemiSequence (Seq a) | |
| Ixed (Seq a) | |
Defined in Control.Lens.At | |
| Wrapped (Seq a) | |
| t ~ Seq a' => Rewrapped (Seq a) t | |
Defined in Control.Lens.Wrapped | |
| type Key Seq | |
| type Item (Seq a) | |
Defined in Data.Sequence.Internal | |
| type Element (Seq a) | |
Defined in Data.MonoTraversable | |
| type Index (Seq a) | |
Defined in Data.Sequences | |
| 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 | |
A set of integers.
Instances
A map of integers to values a.
Instances
zipWith6 :: Zip6 f => (a -> b -> c -> d -> e -> g -> h) -> f a -> f b -> f c -> f d -> f e -> f g -> f h #
zipWith7 :: Zip7 f => (a -> b -> c -> d -> e -> g -> h -> i) -> f a -> f b -> f c -> f d -> f e -> f g -> f h -> f i #
textToBuilder :: ToBuilder Text builder => Text -> builder #
Provided for type disambiguation in the presence of OverloadedStrings.
Since 0.1.0.0
type TextBuilder = Builder #
Since 0.1.0.0
type BlazeBuilder = Builder #
Since 0.1.0.0
type ByteStringBuilder = Builder #
Since 0.3.0.0
class Monoid builder => Builder builder lazy | builder -> lazy, lazy -> builder where #
Since 0.1.0.0
Instances
| Builder Builder Text | |
Defined in Data.Builder | |
| Builder Builder ByteString | |
Defined in Data.Builder | |
class ToBuilder value builder where #
Since 0.1.0.0
Instances
| ToBuilder Char Builder | |
Defined in Data.Builder | |
| ToBuilder Char Builder | |
Defined in Data.Builder | |
| ToBuilder ByteString Builder | |
Defined in Data.Builder Methods toBuilder :: ByteString -> Builder # | |
| ToBuilder ByteString Builder | |
Defined in Data.Builder Methods toBuilder :: ByteString -> Builder # | |
| ToBuilder Builder Builder | |
Defined in Data.Builder | |
| ToBuilder Builder Builder | |
Defined in Data.Builder | |
| ToBuilder Text Builder | |
Defined in Data.Builder | |
| ToBuilder Text Builder | |
Defined in Data.Builder | |
| ToBuilder Text Builder | |
Defined in Data.Builder | |
| ToBuilder Text Builder | |
Defined in Data.Builder | |
| a ~ Char => ToBuilder [a] Builder | |
Defined in Data.Builder | |
| a ~ Char => ToBuilder [a] Builder | |
Defined in Data.Builder | |
getChanContents :: MonadIO m => Chan a -> m [a] #
Lifted getChanContents.
Since: unliftio-0.1.0.0
writeList2Chan :: MonadIO m => Chan a -> [a] -> m () #
Lifted writeList2Chan.
Since: unliftio-0.1.0.0
data StringException #
Exception type thrown by throwString.
Note that the second field of the data constructor depends on GHC/base version. For base 4.9 and GHC 8.0 and later, the second field is a call stack. Previous versions of GHC and base do not support call stacks, and the field is simply unit (provided to make pattern matching across GHC versions easier).
Since: unliftio-0.1.0.0
Constructors
| StringException String CallStack |
Instances
| Show StringException | Since: unliftio-0.1.0.0 |
Defined in UnliftIO.Exception Methods showsPrec :: Int -> StringException -> ShowS # show :: StringException -> String # showList :: [StringException] -> ShowS # | |
| Exception StringException | Since: unliftio-0.1.0.0 |
Defined in UnliftIO.Exception Methods toException :: StringException -> SomeException # | |
data AsyncExceptionWrapper where #
Wrap up a synchronous exception to be treated as an asynchronous exception.
This is intended to be created via toAsyncException.
Since: unliftio-0.1.0.0
Constructors
| AsyncExceptionWrapper :: forall e. Exception e => e -> AsyncExceptionWrapper |
Instances
| Show AsyncExceptionWrapper | Since: unliftio-0.1.0.0 |
Defined in UnliftIO.Exception Methods showsPrec :: Int -> AsyncExceptionWrapper -> ShowS # show :: AsyncExceptionWrapper -> String # showList :: [AsyncExceptionWrapper] -> ShowS # | |
| Exception AsyncExceptionWrapper | Since: unliftio-0.1.0.0 |
Defined in UnliftIO.Exception | |
data SyncExceptionWrapper where #
Wrap up an asynchronous exception to be treated as a synchronous exception.
This is intended to be created via toSyncException.
Since: unliftio-0.1.0.0
Constructors
| SyncExceptionWrapper :: forall e. Exception e => e -> SyncExceptionWrapper |
Instances
| Show SyncExceptionWrapper | Since: unliftio-0.1.0.0 |
Defined in UnliftIO.Exception Methods showsPrec :: Int -> SyncExceptionWrapper -> ShowS # show :: SyncExceptionWrapper -> String # showList :: [SyncExceptionWrapper] -> ShowS # | |
| Exception SyncExceptionWrapper | Since: unliftio-0.1.0.0 |
Defined in UnliftIO.Exception Methods toException :: SyncExceptionWrapper -> SomeException # fromException :: SomeException -> Maybe SyncExceptionWrapper # | |
catch :: (MonadUnliftIO m, Exception e) => m a -> (e -> m a) -> m a #
Unlifted catch, but will not catch asynchronous exceptions.
Since: unliftio-0.1.0.0
catchIO :: MonadUnliftIO m => m a -> (IOException -> m a) -> m a #
catch specialized to only catching IOExceptions.
Since: unliftio-0.1.0.0
catchAny :: MonadUnliftIO m => m a -> (SomeException -> m a) -> m a #
catch specialized to catch all synchronous exception.
Since: unliftio-0.1.0.0
catchDeep :: (MonadUnliftIO m, Exception e, NFData a) => m a -> (e -> m a) -> m a #
Same as catch, but fully force evaluation of the result value
to find all impure exceptions.
Since: unliftio-0.1.0.0
catchAnyDeep :: (NFData a, MonadUnliftIO m) => m a -> (SomeException -> m a) -> m a #
catchDeep specialized to catch all synchronous exception.
Since: unliftio-0.1.0.0
catchJust :: (MonadUnliftIO m, Exception e) => (e -> Maybe b) -> m a -> (b -> m a) -> m a #
handle :: (MonadUnliftIO m, Exception e) => (e -> m a) -> m a -> m a #
Flipped version of catch.
Since: unliftio-0.1.0.0
handleIO :: MonadUnliftIO m => (IOException -> m a) -> m a -> m a #
handle specialized to only catching IOExceptions.
Since: unliftio-0.1.0.0
handleAny :: MonadUnliftIO m => (SomeException -> m a) -> m a -> m a #
Flipped version of catchAny.
Since: unliftio-0.1.0.0
handleDeep :: (MonadUnliftIO m, Exception e, NFData a) => (e -> m a) -> m a -> m a #
Flipped version of catchDeep.
Since: unliftio-0.1.0.0
handleAnyDeep :: (MonadUnliftIO m, NFData a) => (SomeException -> m a) -> m a -> m a #
Flipped version of catchAnyDeep.
Since: unliftio-0.1.0.0
handleJust :: (MonadUnliftIO m, Exception e) => (e -> Maybe b) -> (b -> m a) -> m a -> m a #
Flipped catchJust.
Since: unliftio-0.1.0.0
try :: (MonadUnliftIO m, Exception e) => m a -> m (Either e a) #
Unlifted try, but will not catch asynchronous exceptions.
Since: unliftio-0.1.0.0
tryIO :: MonadUnliftIO m => m a -> m (Either IOException a) #
try specialized to only catching IOExceptions.
Since: unliftio-0.1.0.0
tryAny :: MonadUnliftIO m => m a -> m (Either SomeException a) #
try specialized to catch all synchronous exceptions.
Since: unliftio-0.1.0.0
tryDeep :: (MonadUnliftIO m, Exception e, NFData a) => m a -> m (Either e a) #
Same as try, but fully force evaluation of the result value
to find all impure exceptions.
Since: unliftio-0.1.0.0
tryAnyDeep :: (MonadUnliftIO m, NFData a) => m a -> m (Either SomeException a) #
tryDeep specialized to catch all synchronous exceptions.
Since: unliftio-0.1.0.0
tryJust :: (MonadUnliftIO m, Exception e) => (e -> Maybe b) -> m a -> m (Either b a) #
A variant of try that takes an exception predicate to select
which exceptions are caught.
Since: unliftio-0.1.0.0
pureTry :: a -> Either SomeException a #
Evaluate the value to WHNF and catch any synchronous exceptions.
The expression may still have bottom values within it; you may
instead want to use pureTryDeep.
Since: unliftio-0.2.2.0
pureTryDeep :: NFData a => a -> Either SomeException a #
Evaluate the value to NF and catch any synchronous exceptions.
Since: unliftio-0.2.2.0
catches :: MonadUnliftIO m => m a -> [Handler m a] -> m a #
Same as upstream catches, but will not catch
asynchronous exceptions.
Since: unliftio-0.1.0.0
catchesDeep :: (MonadUnliftIO m, NFData a) => m a -> [Handler m a] -> m a #
Same as catches, but fully force evaluation of the result value
to find all impure exceptions.
Since: unliftio-0.1.0.0
evaluateDeep :: (MonadIO m, NFData a) => a -> m a #
bracket :: MonadUnliftIO m => m a -> (a -> m b) -> (a -> m c) -> m c #
Async safe version of bracket.
Since: unliftio-0.1.0.0
bracket_ :: MonadUnliftIO m => m a -> m b -> m c -> m c #
Async safe version of bracket_.
Since: unliftio-0.1.0.0
bracketOnError :: MonadUnliftIO m => m a -> (a -> m b) -> (a -> m c) -> m c #
Async safe version of bracketOnError.
Since: unliftio-0.1.0.0
bracketOnError_ :: MonadUnliftIO m => m a -> m b -> m c -> m c #
A variant of bracketOnError where the return value from the first
computation is not required.
Since: unliftio-0.1.0.0
finally :: MonadUnliftIO m => m a -> m b -> m a #
Async safe version of finally.
Since: unliftio-0.1.0.0
withException :: (MonadUnliftIO m, Exception e) => m a -> (e -> m b) -> m a #
Like onException, but provides the handler the thrown
exception.
Since: unliftio-0.1.0.0
onException :: MonadUnliftIO m => m a -> m b -> m a #
Async safe version of onException.
Since: unliftio-0.1.0.0
throwIO :: (MonadIO m, Exception e) => e -> m a #
Synchronously throw the given exception.
Since: unliftio-0.1.0.0
toSyncException :: Exception e => e -> SomeException #
Convert an exception into a synchronous exception.
For synchronous exceptions, this is the same as toException.
For asynchronous exceptions, this will wrap up the exception with
SyncExceptionWrapper.
Since: unliftio-0.1.0.0
toAsyncException :: Exception e => e -> SomeException #
Convert an exception into an asynchronous exception.
For asynchronous exceptions, this is the same as toException.
For synchronous exceptions, this will wrap up the exception with
AsyncExceptionWrapper.
Since: unliftio-0.1.0.0
isSyncException :: Exception e => e -> Bool #
Check if the given exception is synchronous.
Since: unliftio-0.1.0.0
isAsyncException :: Exception e => e -> Bool #
Check if the given exception is asynchronous.
Since: unliftio-0.1.0.0
mask :: MonadUnliftIO m => ((forall a. m a -> m a) -> m b) -> m b #
Unlifted version of mask.
Since: unliftio-0.1.0.0
uninterruptibleMask :: MonadUnliftIO m => ((forall a. m a -> m a) -> m b) -> m b #
Unlifted version of uninterruptibleMask.
Since: unliftio-0.1.0.0
mask_ :: MonadUnliftIO m => m a -> m a #
Unlifted version of mask_.
Since: unliftio-0.1.0.0
uninterruptibleMask_ :: MonadUnliftIO m => m a -> m a #
Unlifted version of uninterruptibleMask_.
Since: unliftio-0.1.0.0
throwString :: (MonadIO m, HasCallStack) => String -> m a #
A convenience function for throwing a user error. This is useful for cases where it would be too high a burden to define your own exception type.
This throws an exception of type StringException. When GHC
supports it (base 4.9 and GHC 8.0 and onward), it includes a call
stack.
Since: unliftio-0.1.0.0
stringException :: HasCallStack -> String -> StringException #
Smart constructor for a StringException that deals with the
call stack.
Since: unliftio-0.1.0.0
throwTo :: (Exception e, MonadIO m) => ThreadId -> e -> m () #
Throw an asynchronous exception to another thread.
Synchronously typed exceptions will be wrapped into an
AsyncExceptionWrapper, see
https://github.com/fpco/safe-exceptions#determining-sync-vs-async.
It's usually a better idea to use the UnliftIO.Async module, see https://github.com/fpco/safe-exceptions#quickstart.
Since: unliftio-0.1.0.0
impureThrow :: Exception e => e -> a #
Generate a pure value which, when forced, will synchronously throw the given exception.
Generally it's better to avoid using this function and instead use throwIO,
see https://github.com/fpco/safe-exceptions#quickstart.
Since: unliftio-0.1.0.0
fromEither :: (Exception e, MonadIO m) => Either e a -> m a #
fromEitherIO :: (Exception e, MonadIO m) => IO (Either e a) -> m a #
Same as fromEither, but works on an IO-wrapped Either.
Since: unliftio-0.1.0.0
fromEitherM :: (Exception e, MonadIO m) => m (Either e a) -> m a #
Same as fromEither, but works on an m-wrapped Either.
Since: unliftio-0.1.0.0
withFile :: MonadUnliftIO m => FilePath -> IOMode -> (Handle -> m a) -> m a #
Unlifted version of withFile.
Since: unliftio-0.1.0.0
withBinaryFile :: MonadUnliftIO m => FilePath -> IOMode -> (Handle -> m a) -> m a #
Unlifted version of withBinaryFile.
Since: unliftio-0.1.0.0
hSetFileSize :: MonadIO m => Handle -> Integer -> m () #
Lifted version of hSetFileSize
Since: unliftio-0.2.1.0
hSetBuffering :: MonadIO m => Handle -> BufferMode -> m () #
Lifted version of hSetBuffering
Since: unliftio-0.2.1.0
hGetBuffering :: MonadIO m => Handle -> m BufferMode #
Lifted version of hGetBuffering
Since: unliftio-0.2.1.0
hSeek :: MonadIO m => Handle -> SeekMode -> Integer -> m () #
Lifted version of hSeek
Since: unliftio-0.2.1.0
hIsReadable :: MonadIO m => Handle -> m Bool #
Lifted version of hIsReadable
Since: unliftio-0.2.1.0
hIsWritable :: MonadIO m => Handle -> m Bool #
Lifted version of hIsWritable
Since: unliftio-0.2.1.0
hIsSeekable :: MonadIO m => Handle -> m Bool #
Lifted version of hIsSeekable
Since: unliftio-0.2.1.0
hIsTerminalDevice :: MonadIO m => Handle -> m Bool #
Lifted version of hIsTerminalDevice
Since: unliftio-0.2.1.0
hWaitForInput :: MonadIO m => Handle -> Int -> m Bool #
Lifted version of hWaitForInput
Since: unliftio-0.2.1.0
getMonotonicTime :: MonadIO m => m Double #
Get the number of seconds which have passed since an arbitrary starting time, useful for calculating runtime in a program.
Since: unliftio-0.2.3.0
writeIORef :: MonadIO m => IORef a -> a -> m () #
Lifted writeIORef.
Since: unliftio-0.1.0.0
modifyIORef :: MonadIO m => IORef a -> (a -> a) -> m () #
Lifted modifyIORef.
Since: unliftio-0.1.0.0
modifyIORef' :: MonadIO m => IORef a -> (a -> a) -> m () #
Lifted modifyIORef'.
Since: unliftio-0.1.0.0
atomicModifyIORef :: MonadIO m => IORef a -> (a -> (a, b)) -> m b #
Lifted atomicModifyIORef.
Since: unliftio-0.1.0.0
atomicModifyIORef' :: MonadIO m => IORef a -> (a -> (a, b)) -> m b #
Lifted atomicModifyIORef'.
Since: unliftio-0.1.0.0
atomicWriteIORef :: MonadIO m => IORef a -> a -> m () #
Lifted atomicWriteIORef.
Since: unliftio-0.1.0.0
mkWeakIORef :: MonadUnliftIO m => IORef a -> m () -> m (Weak (IORef a)) #
Unlifted mkWeakIORef.
Since: unliftio-0.1.0.0
data ConcException #
Things that can go wrong in the structure of a Conc. These are
programmer errors.
Since: unliftio-0.2.9.0
Constructors
| EmptyWithNoAlternative |
Instances
data Conc (m :: Type -> Type) a #
A more efficient alternative to Concurrently, which reduces the
number of threads that need to be forked. For more information, see
FIXME link to blog post. This is provided as a separate type to
Concurrently as it has a slightly different API.
Use the conc function to construct values of type Conc, and
runConc to execute the composed actions. You can use the
Applicative instance to run different actions and wait for all of
them to complete, or the Alternative instance to wait for the
first thread to complete.
In the event of a runtime exception thrown by any of the children
threads, or an asynchronous exception received in the parent
thread, all threads will be killed with an AsyncCancelled
exception and the original exception rethrown. If multiple
exceptions are generated by different threads, there are no
guarantees on which exception will end up getting rethrown.
For many common use cases, you may prefer using helper functions in
this module like mapConcurrently.
There are some intentional differences in behavior to
Concurrently:
- Children threads are always launched in an unmasked state, not the inherited state of the parent thread.
Note that it is a programmer error to use the Alternative
instance in such a way that there are no alternatives to an empty,
e.g. runConc (empty | empty). In such a case, a ConcException
will be thrown. If there was an Alternative in the standard
libraries without empty, this library would use it instead.
Since: unliftio-0.2.9.0
Instances
| Functor m => Functor (Conc m) | |
| MonadUnliftIO m => Applicative (Conc m) | Since: unliftio-0.2.9.0 |
| MonadUnliftIO m => Alternative (Conc m) | Since: unliftio-0.2.9.0 |
| (MonadUnliftIO m, Semigroup a) => Semigroup (Conc m a) | Since: unliftio-0.2.9.0 |
| (Monoid a, MonadUnliftIO m) => Monoid (Conc m a) | Since: unliftio-0.2.9.0 |
newtype Concurrently (m :: Type -> Type) a #
Unlifted Concurrently.
Since: unliftio-0.1.0.0
Constructors
| Concurrently | |
Fields
| |
Instances
| Monad m => Functor (Concurrently m) | Since: unliftio-0.1.0.0 |
Defined in UnliftIO.Internals.Async Methods fmap :: (a -> b) -> Concurrently m a -> Concurrently m b # (<$) :: a -> Concurrently m b -> Concurrently m a # | |
| MonadUnliftIO m => Applicative (Concurrently m) | Since: unliftio-0.1.0.0 |
Defined in UnliftIO.Internals.Async Methods pure :: a -> Concurrently m a # (<*>) :: Concurrently m (a -> b) -> Concurrently m a -> Concurrently m b # liftA2 :: (a -> b -> c) -> Concurrently m a -> Concurrently m b -> Concurrently m c # (*>) :: Concurrently m a -> Concurrently m b -> Concurrently m b # (<*) :: Concurrently m a -> Concurrently m b -> Concurrently m a # | |
| MonadUnliftIO m => Alternative (Concurrently m) | Composing two unlifted Since: unliftio-0.1.0.0 |
Defined in UnliftIO.Internals.Async Methods empty :: Concurrently m a # (<|>) :: Concurrently m a -> Concurrently m a -> Concurrently m a # some :: Concurrently m a -> Concurrently m [a] # many :: Concurrently m a -> Concurrently m [a] # | |
| (MonadUnliftIO m, Semigroup a) => Semigroup (Concurrently m a) | Only defined by Since: unliftio-0.1.0.0 |
Defined in UnliftIO.Internals.Async Methods (<>) :: Concurrently m a -> Concurrently m a -> Concurrently m a # sconcat :: NonEmpty (Concurrently m a) -> Concurrently m a # stimes :: Integral b => b -> Concurrently m a -> Concurrently m a # | |
| (Semigroup a, Monoid a, MonadUnliftIO m) => Monoid (Concurrently m a) | Since: unliftio-0.1.0.0 |
Defined in UnliftIO.Internals.Async Methods mempty :: Concurrently m a # mappend :: Concurrently m a -> Concurrently m a -> Concurrently m a # mconcat :: [Concurrently m a] -> Concurrently m a # | |
async :: MonadUnliftIO m => m a -> m (Async a) #
Unlifted async.
Since: unliftio-0.1.0.0
asyncBound :: MonadUnliftIO m => m a -> m (Async a) #
Unlifted asyncBound.
Since: unliftio-0.1.0.0
asyncWithUnmask :: MonadUnliftIO m => ((forall b. m b -> m b) -> m a) -> m (Async a) #
Unlifted asyncWithUnmask.
Since: unliftio-0.1.0.0
asyncOnWithUnmask :: MonadUnliftIO m => Int -> ((forall b. m b -> m b) -> m a) -> m (Async a) #
Unlifted asyncOnWithUnmask.
Since: unliftio-0.1.0.0
withAsync :: MonadUnliftIO m => m a -> (Async a -> m b) -> m b #
Unlifted withAsync.
Since: unliftio-0.1.0.0
withAsyncBound :: MonadUnliftIO m => m a -> (Async a -> m b) -> m b #
Unlifted withAsyncBound.
Since: unliftio-0.1.0.0
withAsyncOn :: MonadUnliftIO m => Int -> m a -> (Async a -> m b) -> m b #
Unlifted withAsyncOn.
Since: unliftio-0.1.0.0
withAsyncWithUnmask :: MonadUnliftIO m => ((forall c. m c -> m c) -> m a) -> (Async a -> m b) -> m b #
Unlifted withAsyncWithUnmask.
Since: unliftio-0.1.0.0
withAsyncOnWithUnmask :: MonadUnliftIO m => Int -> ((forall c. m c -> m c) -> m a) -> (Async a -> m b) -> m b #
Unlifted withAsyncOnWithMask.
Since: unliftio-0.1.0.0
poll :: MonadIO m => Async a -> m (Maybe (Either SomeException a)) #
Lifted poll.
Since: unliftio-0.1.0.0
waitCatch :: MonadIO m => Async a -> m (Either SomeException a) #
Lifted waitCatch.
Since: unliftio-0.1.0.0
uninterruptibleCancel :: MonadIO m => Async a -> m () #
Lifted uninterruptibleCancel.
Since: unliftio-0.1.0.0
cancelWith :: (Exception e, MonadIO m) => Async a -> e -> m () #
Lifted cancelWith. Additionally uses toAsyncException to
ensure async exception safety.
Since: unliftio-0.1.0.0
waitAnyCatch :: MonadIO m => [Async a] -> m (Async a, Either SomeException a) #
Lifted waitAnyCatch.
Since: unliftio-0.1.0.0
waitAnyCancel :: MonadIO m => [Async a] -> m (Async a, a) #
Lifted waitAnyCancel.
Since: unliftio-0.1.0.0
waitAnyCatchCancel :: MonadIO m => [Async a] -> m (Async a, Either SomeException a) #
Lifted waitAnyCatchCancel.
Since: unliftio-0.1.0.0
waitEither :: MonadIO m => Async a -> Async b -> m (Either a b) #
Lifted waitEither.
Since: unliftio-0.1.0.0
waitEitherCatch :: MonadIO m => Async a -> Async b -> m (Either (Either SomeException a) (Either SomeException b)) #
Lifted waitEitherCatch.
Since: unliftio-0.1.0.0
waitEitherCancel :: MonadIO m => Async a -> Async b -> m (Either a b) #
Lifted waitEitherCancel.
Since: unliftio-0.1.0.0
waitEitherCatchCancel :: MonadIO m => Async a -> Async b -> m (Either (Either SomeException a) (Either SomeException b)) #
Lifted waitEitherCatchCancel.
Since: unliftio-0.1.0.0
waitEither_ :: MonadIO m => Async a -> Async b -> m () #
Lifted waitEither_.
Since: unliftio-0.1.0.0
race :: MonadUnliftIO m => m a -> m b -> m (Either a b) #
Unlifted race.
Since: unliftio-0.1.0.0
race_ :: MonadUnliftIO m => m a -> m b -> m () #
Unlifted race_.
Since: unliftio-0.1.0.0
concurrently :: MonadUnliftIO m => m a -> m b -> m (a, b) #
Unlifted concurrently.
Since: unliftio-0.1.0.0
concurrently_ :: MonadUnliftIO m => m a -> m b -> m () #
Unlifted concurrently_.
Since: unliftio-0.1.0.0
forConcurrently :: (MonadUnliftIO m, Traversable t) => t a -> (a -> m b) -> m (t b) #
Similar to mapConcurrently but with arguments flipped
Since: unliftio-0.1.0.0
forConcurrently_ :: (MonadUnliftIO m, Foldable f) => f a -> (a -> m b) -> m () #
Similar to mapConcurrently_ but with arguments flipped
Since: unliftio-0.1.0.0
replicateConcurrently :: MonadUnliftIO m => Int -> m b -> m [b] #
Unlifted replicateConcurrently.
Since: unliftio-0.1.0.0
replicateConcurrently_ :: (Applicative m, MonadUnliftIO m) => Int -> m a -> m () #
Unlifted replicateConcurrently_.
Since: unliftio-0.1.0.0
mapConcurrently :: (MonadUnliftIO m, Traversable t) => (a -> m b) -> t a -> m (t b) #
Executes a Traversable container of items concurrently, it uses the Flat
type internally.
Since: unliftio-0.1.0.0
mapConcurrently_ :: (MonadUnliftIO m, Foldable f) => (a -> m b) -> f a -> m () #
Executes a Traversable container of items concurrently, it uses the Flat
type internally. This function ignores the results.
Since: unliftio-0.1.0.0
Construct a value of type Conc from an action. Compose these
values using the typeclass instances (most commonly Applicative
and Alternative) and then run with runConc.
Since: unliftio-0.2.9.0
runConc :: MonadUnliftIO m => Conc m a -> m a #
Run a Conc value on multiple threads.
Since: unliftio-0.2.9.0
Arguments
| :: (MonadUnliftIO m, Traversable t) | |
| => Int | Max. number of threads. Should not be less than 1. |
| -> (a -> m b) | |
| -> t a | |
| -> m (t b) |
Like mapConcurrently from async, but instead of one thread per
element, it does pooling from a set of threads. This is useful in
scenarios where resource consumption is bounded and for use cases
where too many concurrent tasks aren't allowed.
Example usage
import Say action :: Int -> IO Int action n = do tid <- myThreadId sayString $ show tid threadDelay (2 * 10^6) -- 2 seconds return n main :: IO () main = do yx <- pooledMapConcurrentlyN 5 (\x -> action x) [1..5] print yx
On executing you can see that five threads have been spawned:
$ ./pool ThreadId 36 ThreadId 38 ThreadId 40 ThreadId 42 ThreadId 44 [1,2,3,4,5]
Let's modify the above program such that there are less threads than the number of items in the list:
import Say action :: Int -> IO Int action n = do tid <- myThreadId sayString $ show tid threadDelay (2 * 10^6) -- 2 seconds return n main :: IO () main = do yx <- pooledMapConcurrentlyN 3 (\x -> action x) [1..5] print yx
On executing you can see that only three threads are active totally:
$ ./pool ThreadId 35 ThreadId 37 ThreadId 39 ThreadId 35 ThreadId 39 [1,2,3,4,5]
Since: unliftio-0.2.10
pooledMapConcurrently :: (MonadUnliftIO m, Traversable t) => (a -> m b) -> t a -> m (t b) #
Similar to pooledMapConcurrentlyN but with number of threads
set from getNumCapabilities. Usually this is useful for CPU bound
tasks.
Since: unliftio-0.2.10
Arguments
| :: (MonadUnliftIO m, Traversable t) | |
| => Int | Max. number of threads. Should not be less than 1. |
| -> t a | |
| -> (a -> m b) | |
| -> m (t b) |
Similar to pooledMapConcurrentlyN but with flipped arguments.
Since: unliftio-0.2.10
pooledForConcurrently :: (MonadUnliftIO m, Traversable t) => t a -> (a -> m b) -> m (t b) #
Similar to pooledForConcurrentlyN but with number of threads
set from getNumCapabilities. Usually this is useful for CPU bound
tasks.
Since: unliftio-0.2.10
Arguments
| :: (MonadUnliftIO m, Foldable f) | |
| => Int | Max. number of threads. Should not be less than 1. |
| -> (a -> m b) | |
| -> f a | |
| -> m () |
Like pooledMapConcurrentlyN but with the return value
discarded.
Since: unliftio-0.2.10
pooledMapConcurrently_ :: (MonadUnliftIO m, Foldable f) => (a -> m b) -> f a -> m () #
Like pooledMapConcurrently but with the return value discarded.
Since: unliftio-0.2.10
pooledForConcurrently_ :: (MonadUnliftIO m, Foldable f) => f a -> (a -> m b) -> m () #
Like pooledMapConcurrently_ but with flipped arguments.
Since: unliftio-0.2.10
Arguments
| :: (MonadUnliftIO m, Foldable t) | |
| => Int | Max. number of threads. Should not be less than 1. |
| -> t a | |
| -> (a -> m b) | |
| -> m () |
Like pooledMapConcurrentlyN_ but with flipped arguments.
Since: unliftio-0.2.10
pooledReplicateConcurrentlyN #
Arguments
| :: MonadUnliftIO m | |
| => Int | Max. number of threads. Should not be less than 1. |
| -> Int | Number of times to perform the action. |
| -> m a | |
| -> m [a] |
Pooled version of replicateConcurrently. Performs the action in
the pooled threads.
Since: unliftio-0.2.10
Arguments
| :: MonadUnliftIO m | |
| => Int | Number of times to perform the action. |
| -> m a | |
| -> m [a] |
Similar to pooledReplicateConcurrentlyN but with number of
threads set from getNumCapabilities. Usually this is useful for
CPU bound tasks.
Since: unliftio-0.2.10
pooledReplicateConcurrentlyN_ #
Arguments
| :: MonadUnliftIO m | |
| => Int | Max. number of threads. Should not be less than 1. |
| -> Int | Number of times to perform the action. |
| -> m a | |
| -> m () |
Pooled version of replicateConcurrently_. Performs the action in
the pooled threads.
Since: unliftio-0.2.10
pooledReplicateConcurrently_ #
Arguments
| :: MonadUnliftIO m | |
| => Int | Number of times to perform the action. |
| -> m a | |
| -> m () |
Similar to pooledReplicateConcurrently_ but with number of
threads set from getNumCapabilities. Usually this is useful for
CPU bound tasks.
Since: unliftio-0.2.10
newEmptyMVar :: MonadIO m => m (MVar a) #
Lifted newEmptyMVar.
Since: unliftio-0.1.0.0
tryTakeMVar :: MonadIO m => MVar a -> m (Maybe a) #
Lifted tryTakeMVar.
Since: unliftio-0.1.0.0
tryPutMVar :: MonadIO m => MVar a -> a -> m Bool #
Lifted tryPutMVar.
Since: unliftio-0.1.0.0
isEmptyMVar :: MonadIO m => MVar a -> m Bool #
Lifted isEmptyMVar.
Since: unliftio-0.1.0.0
tryReadMVar :: MonadIO m => MVar a -> m (Maybe a) #
Lifted tryReadMVar.
Since: unliftio-0.1.0.0
withMVar :: MonadUnliftIO m => MVar a -> (a -> m b) -> m b #
Unlifted withMVar.
Since: unliftio-0.1.0.0
withMVarMasked :: MonadUnliftIO m => MVar a -> (a -> m b) -> m b #
Unlifted withMVarMasked.
Since: unliftio-0.1.0.0
modifyMVar_ :: MonadUnliftIO m => MVar a -> (a -> m a) -> m () #
Unlifted modifyMVar_.
Since: unliftio-0.1.0.0
modifyMVar :: MonadUnliftIO m => MVar a -> (a -> m (a, b)) -> m b #
Unlifted modifyMVar.
Since: unliftio-0.1.0.0
modifyMVarMasked_ :: MonadUnliftIO m => MVar a -> (a -> m a) -> m () #
Unlifted modifyMVarMasked_.
Since: unliftio-0.1.0.0
modifyMVarMasked :: MonadUnliftIO m => MVar a -> (a -> m (a, b)) -> m b #
Unlifted modifyMVarMasked.
Since: unliftio-0.1.0.0
mkWeakMVar :: MonadUnliftIO m => MVar a -> m () -> m (Weak (MVar a)) #
Unlifted mkWeakMVar.
Since: unliftio-0.1.0.0
A "run once" value, with results saved. Extract the value with
runMemoized. For single-threaded usage, you can use memoizeRef to
create a value. If you need guarantees that only one thread will run the
action at a time, use memoizeMVar.
Note that this type provides a Show instance for convenience, but not
useful information can be provided.
Since: unliftio-0.2.8.0
runMemoized :: MonadIO m => Memoized a -> m a #
Extract a value from a Memoized, running an action if no cached value is
available.
Since: unliftio-0.2.8.0
memoizeRef :: MonadUnliftIO m => m a -> m (Memoized a) #
Create a new Memoized value using an IORef under the surface. Note that
the action may be run in multiple threads simultaneously, so this may not be
thread safe (depending on the underlying action). Consider using
memoizeMVar.
Since: unliftio-0.2.8.0
memoizeMVar :: MonadUnliftIO m => m a -> m (Memoized a) #
Same as memoizeRef, but uses an MVar to ensure that an action is
only run once, even in a multithreaded application.
Since: unliftio-0.2.8.0
atomically :: MonadIO m => STM a -> m a #
Lifted version of atomically
Since: unliftio-0.2.1.0
readTVarIO :: MonadIO m => TVar a -> m a #
Lifted version of readTVarIO
Since: unliftio-0.2.1.0
registerDelay :: MonadIO m => Int -> m (TVar Bool) #
Lifted version of registerDelay
Since: unliftio-0.2.1.0
mkWeakTVar :: MonadUnliftIO m => TVar a -> m () -> m (Weak (TVar a)) #
Lifted version of mkWeakTVar
Since: unliftio-0.2.1.0
newTMVarIO :: MonadIO m => a -> m (TMVar a) #
Lifted version of newTMVarIO
Since: unliftio-0.2.1.0
newEmptyTMVarIO :: MonadIO m => m (TMVar a) #
Lifted version of newEmptyTMVarIO
Since: unliftio-0.2.1.0
mkWeakTMVar :: MonadUnliftIO m => TMVar a -> m () -> m (Weak (TMVar a)) #
Lifted version of mkWeakTMVar
Since: unliftio-0.2.1.0
newTChanIO :: MonadIO m => m (TChan a) #
Lifted version of newTChanIO
Since: unliftio-0.2.1.0
newBroadcastTChanIO :: MonadIO m => m (TChan a) #
Lifted version of newBroadcastTChanIO
Since: unliftio-0.2.1.0
newTQueueIO :: MonadIO m => m (TQueue a) #
Lifted version of newTQueueIO
Since: unliftio-0.2.1.0
newTBQueueIO :: MonadIO m => Natural -> m (TBQueue a) #
Lifted version of newTBQueueIO
Since: unliftio-0.2.1.0
Arguments
| :: MonadUnliftIO m | |
| => String | File name template. See |
| -> (FilePath -> Handle -> m a) | Callback that can use the file |
| -> m a |
Create and use a temporary file in the system standard temporary directory.
Behaves exactly the same as withTempFile, except that the parent temporary directory
will be that returned by getCanonicalTemporaryDirectory.
Since: unliftio-0.1.0.0
Arguments
| :: MonadUnliftIO m | |
| => String | Directory name template. See |
| -> (FilePath -> m a) | Callback that can use the directory. |
| -> m a |
Create and use a temporary directory in the system standard temporary directory.
Behaves exactly the same as withTempDirectory, except that the parent temporary directory
will be that returned by getCanonicalTemporaryDirectory.
Since: unliftio-0.1.0.0
Arguments
| :: MonadUnliftIO m | |
| => FilePath | Temp dir to create the file in. |
| -> String | File name template. See |
| -> (FilePath -> Handle -> m a) | Callback that can use the file. |
| -> m a |
Use a temporary filename that doesn't already exist.
Creates a new temporary file inside the given directory, making use of the template. The temp file is deleted after use. For example:
withTempFile "src" "sdist." $ \tmpFile hFile -> do ...
The tmpFile will be file in the given directory, e.g.
src/sdist.342.
Since: unliftio-0.1.0.0
Arguments
| :: MonadUnliftIO m | |
| => FilePath | Temp directory to create the directory in. |
| -> String | Directory name template. See |
| -> (FilePath -> m a) | Callback that can use the directory. |
| -> m a |
Create and use a temporary directory.
Creates a new temporary directory inside the given directory, making use of the template. The temp directory is deleted after use. For example:
withTempDirectory "src" "sdist." $ \tmpDir -> do ...
The tmpDir will be a new subdirectory of the given directory, e.g.
src/sdist.342.
Since: unliftio-0.1.0.0
Arguments
| :: MonadUnliftIO n | |
| => (n b -> m b) | The wrapper, for instance |
| -> (forall a. m a -> n a) | The inverse, for instance |
| -> ((forall a. m a -> IO a) -> IO b) | The actual function to invoke |
| -> m b |
A helper function for implementing MonadUnliftIO instances.
Useful for the common case where you want to simply delegate to the
underlying transformer.
Example
newtype AppT m a = AppT { unAppT :: ReaderT Int (ResourceT m) a }
deriving (Functor, Applicative, Monad, MonadIO)
-- Unfortunately, deriving MonadUnliftIO does not work.
instance MonadUnliftIO m => MonadUnliftIO (AppT m) where
withRunInIO = wrappedWithRunInIO AppT unAppTSince: unliftio-core-0.1.2.0
toIO :: MonadUnliftIO m => m a -> m (IO a) #
Convert an action in m to an action in IO.
Since: unliftio-core-0.1.0.0
withUnliftIO :: MonadUnliftIO m => (UnliftIO m -> IO a) -> m a #
Convenience function for capturing the monadic context and running
an IO action. The UnliftIO newtype wrapper is rarely needed, so
prefer withRunInIO to this function.
Since: unliftio-core-0.1.0.0
askRunInIO :: MonadUnliftIO m => m (m a -> IO a) #
Same as askUnliftIO, but returns a monomorphic function
instead of a polymorphic newtype wrapper. If you only need to apply
the transformation on one concrete type, this function can be more
convenient.
Since: unliftio-core-0.1.0.0
newtype UnliftIO (m :: Type -> Type) #
The ability to run any monadic action m a as IO a.
This is more precisely a natural transformation. We need to new
datatype (instead of simply using a forall) due to lack of
support in GHC for impredicative types.
Since: unliftio-core-0.1.0.0
class MonadIO m => MonadUnliftIO (m :: Type -> Type) where #
Monads which allow their actions to be run in IO.
While MonadIO allows an IO action to be lifted into another
monad, this class captures the opposite concept: allowing you to
capture the monadic context. Note that, in order to meet the laws
given below, the intuition is that a monad must have no monadic
state, but may have monadic context. This essentially limits
MonadUnliftIO to ReaderT and IdentityT transformers on top of
IO.
Laws. For any value u returned by askUnliftIO, it must meet the
monad transformer laws as reformulated for MonadUnliftIO:
unliftIO u . return = return
unliftIO u (m >>= f) = unliftIO u m >>= unliftIO u . f
The third is a currently nameless law which ensures that the current context is preserved.
askUnliftIO >>= (u -> liftIO (unliftIO u m)) = m
If you have a name for this, please submit it in a pull request for great glory.
Since: unliftio-core-0.1.0.0
Minimal complete definition
Methods
askUnliftIO :: m (UnliftIO m) #
Capture the current monadic context, providing the ability to
run monadic actions in IO.
See UnliftIO for an explanation of why we need a helper
datatype here.
Since: unliftio-core-0.1.0.0
withRunInIO :: ((forall a. m a -> IO a) -> IO b) -> m b #
Convenience function for capturing the monadic context and running an IO
action with a runner function. The runner function is used to run a monadic
action m in IO.
Since: unliftio-core-0.1.0.0
Instances
| MonadUnliftIO IO | |
Defined in Control.Monad.IO.Unlift | |
| MonadUnliftIO m => MonadUnliftIO (ResourceT m) | Since: resourcet-1.1.10 |
Defined in Control.Monad.Trans.Resource.Internal | |
| MonadUnliftIO m => MonadUnliftIO (IdentityT m) | |
Defined in Control.Monad.IO.Unlift | |
| MonadUnliftIO m => MonadUnliftIO (ReaderT r m) | |
Defined in Control.Monad.IO.Unlift | |
newTBChan :: Int -> STM (TBChan a) #
Build and returns a new instance of TBChan with the given
capacity. N.B., we do not verify the capacity is positive, but
if it is non-positive then writeTBChan will always retry and
isFullTBChan will always be true.
newTBChanIO :: Int -> IO (TBChan a) #
IO version of newTBChan. This is useful for creating
top-level TBChans using unsafePerformIO, because using
atomically inside unsafePerformIO isn't possible.
readTBChan :: TBChan a -> STM a #
Read the next value from the TBChan, retrying if the channel
is empty.
tryReadTBChan :: TBChan a -> STM (Maybe a) #
A version of readTBChan which does not retry. Instead it
returns Nothing if no value is available.
peekTBChan :: TBChan a -> STM a #
Get the next value from the TBChan without removing it,
retrying if the channel is empty.
tryPeekTBChan :: TBChan a -> STM (Maybe a) #
A version of peekTBChan which does not retry. Instead it
returns Nothing if no value is available.
writeTBChan :: TBChan a -> a -> STM () #
Write a value to a TBChan, retrying if the channel is full.
tryWriteTBChan :: TBChan a -> a -> STM Bool #
A version of writeTBChan which does not retry. Returns True
if the value was successfully written, and False otherwise.
unGetTBChan :: TBChan a -> a -> STM () #
Put a data item back onto a channel, where it will be the next item read. N.B., this could allow the channel to temporarily become longer than the specified limit, which is necessary to ensure that the item is indeed the next one read.
isEmptyTBChan :: TBChan a -> STM Bool #
Returns True if the supplied TBChan is empty (i.e., has
no elements). N.B., a TBChan can be both `empty' and
`full' at the same time, if the initial limit was non-positive.
isFullTBChan :: TBChan a -> STM Bool #
Returns True if the supplied TBChan is full (i.e., is over
its limit). N.B., a TBChan can be both `empty' and `full'
at the same time, if the initial limit was non-positive. N.B.,
a TBChan may still be full after reading, if unGetTBChan was
used to go over the initial limit.
This is equivalent to: liftM (<= 0) estimateFreeSlotsTBMChan
estimateFreeSlotsTBChan :: TBChan a -> STM Int #
Estimate the number of free slots. If the result is positive,
then it's a minimum bound; if it's non-positive then it's exact.
It will only be negative if the initial limit was negative or
if unGetTBChan was used to go over the initial limit.
This function always contends with writers, but only contends
with readers when it has to; compare against freeSlotsTBChan.
freeSlotsTBChan :: TBChan a -> STM Int #
Return the exact number of free slots. The result can be
negative if the initial limit was negative or if unGetTBChan
was used to go over the initial limit.
This function always contends with both readers and writers;
compare against estimateFreeSlotsTBChan.
newTBMChan :: Int -> STM (TBMChan a) #
Build and returns a new instance of TBMChan with the given
capacity. N.B., we do not verify the capacity is positive, but
if it is non-positive then writeTBMChan will always retry and
isFullTBMChan will always be true.
newTBMChanIO :: Int -> IO (TBMChan a) #
IO version of newTBMChan. This is useful for creating
top-level TBMChans using unsafePerformIO, because using
atomically inside unsafePerformIO isn't possible.
readTBMChan :: TBMChan a -> STM (Maybe a) #
Read the next value from the TBMChan, retrying if the channel
is empty (and not closed). We return Nothing immediately if
the channel is closed and empty.
tryReadTBMChan :: TBMChan a -> STM (Maybe (Maybe a)) #
A version of readTBMChan which does not retry. Instead it
returns Just Nothing if the channel is open but no value is
available; it still returns Nothing if the channel is closed
and empty.
peekTBMChan :: TBMChan a -> STM (Maybe a) #
Get the next value from the TBMChan without removing it,
retrying if the channel is empty.
tryPeekTBMChan :: TBMChan a -> STM (Maybe (Maybe a)) #
A version of peekTBMChan which does not retry. Instead it
returns Just Nothing if the channel is open but no value is
available; it still returns Nothing if the channel is closed
and empty.
writeTBMChan :: TBMChan a -> a -> STM () #
Write a value to a TBMChan, retrying if the channel is full.
If the channel is closed then the value is silently discarded.
Use isClosedTBMChan to determine if the channel is closed
before writing, as needed.
tryWriteTBMChan :: TBMChan a -> a -> STM (Maybe Bool) #
A version of writeTBMChan which does not retry. Returns Just
True if the value was successfully written, Just False if it
could not be written (but the channel was open), and Nothing
if it was discarded (i.e., the channel was closed).
unGetTBMChan :: TBMChan a -> a -> STM () #
Put a data item back onto a channel, where it will be the next
item read. If the channel is closed then the value is silently
discarded; you can use peekTBMChan to circumvent this in certain
circumstances. N.B., this could allow the channel to temporarily
become longer than the specified limit, which is necessary to
ensure that the item is indeed the next one read.
closeTBMChan :: TBMChan a -> STM () #
Closes the TBMChan, preventing any further writes.
isClosedTBMChan :: TBMChan a -> STM Bool #
Returns True if the supplied TBMChan has been closed.
isEmptyTBMChan :: TBMChan a -> STM Bool #
Returns True if the supplied TBMChan is empty (i.e., has
no elements). N.B., a TBMChan can be both `empty' and
`full' at the same time, if the initial limit was non-positive.
isFullTBMChan :: TBMChan a -> STM Bool #
Returns True if the supplied TBMChan is full (i.e., is
over its limit). N.B., a TBMChan can be both `empty' and
`full' at the same time, if the initial limit was non-positive.
N.B., a TBMChan may still be full after reading, if
unGetTBMChan was used to go over the initial limit.
This is equivalent to: liftM (<= 0) estimateFreeSlotsTBMChan
estimateFreeSlotsTBMChan :: TBMChan a -> STM Int #
Estimate the number of free slots. If the result is positive,
then it's a minimum bound; if it's non-positive then it's exact.
It will only be negative if the initial limit was negative or
if unGetTBMChan was used to go over the initial limit.
This function always contends with writers, but only contends
with readers when it has to; compare against freeSlotsTBMChan.
freeSlotsTBMChan :: TBMChan a -> STM Int #
Return the exact number of free slots. The result can be
negative if the initial limit was negative or if unGetTBMChan
was used to go over the initial limit.
This function always contends with both readers and writers;
compare against estimateFreeSlotsTBMChan.
newTBMQueue :: Int -> STM (TBMQueue a) #
Build and returns a new instance of TBMQueue with the given
capacity. N.B., we do not verify the capacity is positive, but
if it is non-positive then writeTBMQueue will always retry and
isFullTBMQueue will always be true.
newTBMQueueIO :: Int -> IO (TBMQueue a) #
IO version of newTBMQueue. This is useful for creating
top-level TBMQueues using unsafePerformIO, because using
atomically inside unsafePerformIO isn't possible.
readTBMQueue :: TBMQueue a -> STM (Maybe a) #
Read the next value from the TBMQueue, retrying if the queue
is empty (and not closed). We return Nothing immediately if
the queue is closed and empty.
tryReadTBMQueue :: TBMQueue a -> STM (Maybe (Maybe a)) #
A version of readTBMQueue which does not retry. Instead it
returns Just Nothing if the queue is open but no value is
available; it still returns Nothing if the queue is closed
and empty.
peekTBMQueue :: TBMQueue a -> STM (Maybe a) #
Get the next value from the TBMQueue without removing it,
retrying if the queue is empty.
tryPeekTBMQueue :: TBMQueue a -> STM (Maybe (Maybe a)) #
A version of peekTBMQueue which does not retry. Instead it
returns Just Nothing if the queue is open but no value is
available; it still returns Nothing if the queue is closed
and empty.
writeTBMQueue :: TBMQueue a -> a -> STM () #
Write a value to a TBMQueue, retrying if the queue is full.
If the queue is closed then the value is silently discarded.
Use isClosedTBMQueue to determine if the queue is closed
before writing, as needed.
tryWriteTBMQueue :: TBMQueue a -> a -> STM (Maybe Bool) #
A version of writeTBMQueue which does not retry. Returns Just
True if the value was successfully written, Just False if it
could not be written (but the queue was open), and Nothing
if it was discarded (i.e., the queue was closed).
unGetTBMQueue :: TBMQueue a -> a -> STM () #
Put a data item back onto a queue, where it will be the next
item read. If the queue is closed then the value is silently
discarded; you can use peekTBMQueue to circumvent this in certain
circumstances. N.B., this could allow the queue to temporarily
become longer than the specified limit, which is necessary to
ensure that the item is indeed the next one read.
closeTBMQueue :: TBMQueue a -> STM () #
Closes the TBMQueue, preventing any further writes.
isClosedTBMQueue :: TBMQueue a -> STM Bool #
Returns True if the supplied TBMQueue has been closed.
isEmptyTBMQueue :: TBMQueue a -> STM Bool #
Returns True if the supplied TBMQueue is empty (i.e., has
no elements). N.B., a TBMQueue can be both `empty' and
`full' at the same time, if the initial limit was non-positive.
isFullTBMQueue :: TBMQueue a -> STM Bool #
Returns True if the supplied TBMQueue is full (i.e., is
over its limit). N.B., a TBMQueue can be both `empty' and
`full' at the same time, if the initial limit was non-positive.
N.B., a TBMQueue may still be full after reading, if
unGetTBMQueue was used to go over the initial limit.
This is equivalent to: liftM (<= 0) estimateFreeSlotsTBMQueue
estimateFreeSlotsTBMQueue :: TBMQueue a -> STM Int #
Estimate the number of free slots. If the result is positive,
then it's a minimum bound; if it's non-positive then it's exact.
It will only be negative if the initial limit was negative or
if unGetTBMQueue was used to go over the initial limit.
This function always contends with writers, but only contends
with readers when it has to; compare against freeSlotsTBMQueue.
freeSlotsTBMQueue :: TBMQueue a -> STM Int #
Return the exact number of free slots. The result can be
negative if the initial limit was negative or if unGetTBMQueue
was used to go over the initial limit.
This function always contends with both readers and writers;
compare against estimateFreeSlotsTBMQueue.
newTMChanIO :: IO (TMChan a) #
IO version of newTMChan. This is useful for creating
top-level TMChans using unsafePerformIO, because using
atomically inside unsafePerformIO isn't possible.
newBroadcastTMChan :: STM (TMChan a) #
Like newBroadcastTChan.
Since: 2.1.0
newBroadcastTMChanIO :: IO (TMChan a) #
IO version of newBroadcastTMChan.
Since: 2.1.0
dupTMChan :: TMChan a -> STM (TMChan a) #
Duplicate a TMChan: the duplicate channel begins empty, but
data written to either channel from then on will be available
from both, and closing one copy will close them all. Hence this
creates a kind of broadcast channel, where data written by anyone
is seen by everyone else.
readTMChan :: TMChan a -> STM (Maybe a) #
Read the next value from the TMChan, retrying if the channel
is empty (and not closed). We return Nothing immediately if
the channel is closed and empty.
tryReadTMChan :: TMChan a -> STM (Maybe (Maybe a)) #
A version of readTMChan which does not retry. Instead it
returns Just Nothing if the channel is open but no value is
available; it still returns Nothing if the channel is closed
and empty.
peekTMChan :: TMChan a -> STM (Maybe a) #
Get the next value from the TMChan without removing it,
retrying if the channel is empty.
tryPeekTMChan :: TMChan a -> STM (Maybe (Maybe a)) #
A version of peekTMChan which does not retry. Instead it
returns Just Nothing if the channel is open but no value is
available; it still returns Nothing if the channel is closed
and empty.
writeTMChan :: TMChan a -> a -> STM () #
Write a value to a TMChan. If the channel is closed then the
value is silently discarded. Use isClosedTMChan to determine
if the channel is closed before writing, as needed.
unGetTMChan :: TMChan a -> a -> STM () #
Put a data item back onto a channel, where it will be the next
item read. If the channel is closed then the value is silently
discarded; you can use peekTMChan to circumvent this in certain
circumstances.
closeTMChan :: TMChan a -> STM () #
Closes the TMChan, preventing any further writes.
isClosedTMChan :: TMChan a -> STM Bool #
Returns True if the supplied TMChan has been closed.
isEmptyTMChan :: TMChan a -> STM Bool #
Returns True if the supplied TMChan is empty.
newTMQueue :: STM (TMQueue a) #
Build and returns a new instance of TMQueue.
newTMQueueIO :: IO (TMQueue a) #
IO version of newTMQueue. This is useful for creating
top-level TMQueues using unsafePerformIO, because using
atomically inside unsafePerformIO isn't possible.
readTMQueue :: TMQueue a -> STM (Maybe a) #
Read the next value from the TMQueue, retrying if the queue
is empty (and not closed). We return Nothing immediately if
the queue is closed and empty.
tryReadTMQueue :: TMQueue a -> STM (Maybe (Maybe a)) #
A version of readTMQueue which does not retry. Instead it
returns Just Nothing if the queue is open but no value is
available; it still returns Nothing if the queue is closed
and empty.
peekTMQueue :: TMQueue a -> STM (Maybe a) #
Get the next value from the TMQueue without removing it,
retrying if the queue is empty.
tryPeekTMQueue :: TMQueue a -> STM (Maybe (Maybe a)) #
A version of peekTMQueue which does not retry. Instead it
returns Just Nothing if the queue is open but no value is
available; it still returns Nothing if the queue is closed
and empty.
writeTMQueue :: TMQueue a -> a -> STM () #
Write a value to a TMQueue. If the queue is closed then the
value is silently discarded. Use isClosedTMQueue to determine
if the queue is closed before writing, as needed.
unGetTMQueue :: TMQueue a -> a -> STM () #
Put a data item back onto a queue, where it will be the next
item read. If the queue is closed then the value is silently
discarded; you can use peekTMQueue to circumvent this in certain
circumstances.
closeTMQueue :: TMQueue a -> STM () #
Closes the TMQueue, preventing any further writes.
isClosedTMQueue :: TMQueue a -> STM Bool #
Returns True if the supplied TMQueue has been closed.
isEmptyTMQueue :: TMQueue a -> STM Bool #
Returns True if the supplied TMQueue is empty.
TBQueue is an abstract type representing a bounded FIFO channel.
Since: stm-2.4
Builds and returns a new instance of TBQueue.
writeTBQueue :: TBQueue a -> a -> STM () #
Write a value to a TBQueue; blocks if the queue is full.
readTBQueue :: TBQueue a -> STM a #
Read the next value from the TBQueue.
tryReadTBQueue :: TBQueue a -> STM (Maybe a) #
A version of readTBQueue which does not retry. Instead it
returns Nothing if no value is available.
peekTBQueue :: TBQueue a -> STM a #
Get the next value from the TBQueue without removing it,
retrying if the channel is empty.
tryPeekTBQueue :: TBQueue a -> STM (Maybe a) #
A version of peekTBQueue which does not retry. Instead it
returns Nothing if no value is available.
unGetTBQueue :: TBQueue a -> a -> STM () #
Put a data item back onto a channel, where it will be the next item read. Blocks if the queue is full.
isFullTBQueue :: TBQueue a -> STM Bool #
TChan is an abstract type representing an unbounded FIFO channel.
newBroadcastTChan :: STM (TChan a) #
Create a write-only TChan. More precisely, readTChan will retry
even after items have been written to the channel. The only way to read
a broadcast channel is to duplicate it with dupTChan.
Consider a server that broadcasts messages to clients:
serve :: TChan Message -> Client -> IO loop
serve broadcastChan client = do
myChan <- dupTChan broadcastChan
forever $ do
message <- readTChan myChan
send client messageThe problem with using newTChan to create the broadcast channel is that if
it is only written to and never read, items will pile up in memory. By
using newBroadcastTChan to create the broadcast channel, items can be
garbage collected after clients have seen them.
Since: stm-2.4
writeTChan :: TChan a -> a -> STM () #
Write a value to a TChan.
tryReadTChan :: TChan a -> STM (Maybe a) #
A version of readTChan which does not retry. Instead it
returns Nothing if no value is available.
Since: stm-2.3
peekTChan :: TChan a -> STM a #
Get the next value from the TChan without removing it,
retrying if the channel is empty.
Since: stm-2.3
tryPeekTChan :: TChan a -> STM (Maybe a) #
A version of peekTChan which does not retry. Instead it
returns Nothing if no value is available.
Since: stm-2.3
dupTChan :: TChan a -> STM (TChan a) #
Duplicate a TChan: the duplicate channel begins empty, but data written to
either channel from then on will be available from both. Hence this creates
a kind of broadcast channel, where data written by anyone is seen by
everyone else.
unGetTChan :: TChan a -> a -> STM () #
Put a data item back onto a channel, where it will be the next item read.
cloneTChan :: TChan a -> STM (TChan a) #
Clone a TChan: similar to dupTChan, but the cloned channel starts with the
same content available as the original channel.
Since: stm-2.4
A TMVar is a synchronising variable, used
for communication between concurrent threads. It can be thought of
as a box, which may be empty or full.
newEmptyTMVar :: STM (TMVar a) #
Create a TMVar which is initially empty.
tryTakeTMVar :: TMVar a -> STM (Maybe a) #
A version of takeTMVar that does not retry. The tryTakeTMVar
function returns Nothing if the TMVar was empty, or Just aTMVar was full with contents a. After tryTakeTMVar, the
TMVar is left empty.
tryPutTMVar :: TMVar a -> a -> STM Bool #
tryReadTMVar :: TMVar a -> STM (Maybe a) #
A version of readTMVar which does not retry. Instead it
returns Nothing if no value is available.
Since: stm-2.3
TQueue is an abstract type representing an unbounded FIFO channel.
Since: stm-2.4
writeTQueue :: TQueue a -> a -> STM () #
Write a value to a TQueue.
readTQueue :: TQueue a -> STM a #
Read the next value from the TQueue.
tryReadTQueue :: TQueue a -> STM (Maybe a) #
A version of readTQueue which does not retry. Instead it
returns Nothing if no value is available.
peekTQueue :: TQueue a -> STM a #
Get the next value from the TQueue without removing it,
retrying if the channel is empty.
tryPeekTQueue :: TQueue a -> STM (Maybe a) #
A version of peekTQueue which does not retry. Instead it
returns Nothing if no value is available.
unGetTQueue :: TQueue a -> a -> STM () #
Put a data item back onto a channel, where it will be the next item read.
modifyTVar :: TVar a -> (a -> a) -> STM () #
Mutate the contents of a TVar. N.B., this version is
non-strict.
Since: stm-2.3
modifyTVar' :: TVar a -> (a -> a) -> STM () #
Strict version of modifyTVar.
Since: stm-2.3
say :: MonadIO m => Text -> m () #
Send a Text to standard output, appending a newline, and chunking the
data. By default, the chunk size is 2048 characters, so any messages below
that size will be sent as one contiguous unit. If larger messages are used,
it is possible for interleaving with other threads to occur.
Since: say-0.1.0.0
sayErr :: MonadIO m => Text -> m () #
Same as say, but data is sent to standard error.
Since: say-0.1.0.0
sayErrString :: MonadIO m => String -> m () #
Same as sayString, but data is sent to standard error.
Since: say-0.1.0.0
sayErrShow :: (MonadIO m, Show a) => a -> m () #
Same as sayShow, but data is sent to standard error.
Since: say-0.1.0.0
hSayString :: MonadIO m => Handle -> String -> m () #
newMutVar :: PrimMonad m => a -> m (MutVar (PrimState m) a) #
Create a new MutVar with the specified initial value
atomicModifyMutVar :: PrimMonad m => MutVar (PrimState m) a -> (a -> (a, b)) -> m b #
Atomically mutate the contents of a MutVar
atomicModifyMutVar' :: PrimMonad m => MutVar (PrimState m) a -> (a -> (a, b)) -> m b #
Strict version of atomicModifyMutVar. This forces both the value stored
in the MutVar as well as the value returned.
modifyMutVar :: PrimMonad m => MutVar (PrimState m) a -> (a -> a) -> m () #
Mutate the contents of a MutVar
modifyMutVar' :: PrimMonad m => MutVar (PrimState m) a -> (a -> a) -> m () #
Strict version of modifyMutVar
Class of types supporting primitive array operations
Minimal complete definition
sizeOf#, alignment#, indexByteArray#, readByteArray#, writeByteArray#, setByteArray#, indexOffAddr#, readOffAddr#, writeOffAddr#, setOffAddr#
Instances
A MutVar behaves like a single-element mutable array associated
with a primitive state token.
Instances
class Monad m => PrimMonad (m :: Type -> Type) #
Class of monads which can perform primitive state-transformer actions
Minimal complete definition
Instances
| PrimMonad IO | |
| PrimMonad (ST s) | |
| PrimMonad m => PrimMonad (MaybeT m) | |
| PrimMonad m => PrimMonad (ResourceT m) | |
| PrimMonad m => PrimMonad (ListT m) | |
| PrimMonad m => PrimMonad (IdentityT m) | |
| (Monoid w, PrimMonad m) => PrimMonad (WriterT w m) | |
| (Monoid w, PrimMonad m) => PrimMonad (WriterT w m) | |
| PrimMonad m => PrimMonad (StateT s m) | |
| PrimMonad m => PrimMonad (StateT s m) | |
| PrimMonad m => PrimMonad (ExceptT e m) | |
| (Error e, PrimMonad m) => PrimMonad (ErrorT e m) | |
| (Monoid w, PrimMonad m) => PrimMonad (AccumT w m) | Since: primitive-0.6.3.0 |
| PrimMonad m => PrimMonad (SelectT r m) | |
| PrimMonad m => PrimMonad (ReaderT r m) | |
| PrimMonad m => PrimMonad (ConduitT i o m) | |
| PrimMonad m => PrimMonad (ContT r m) | Since: primitive-0.6.3.0 |
| (Monoid w, PrimMonad m) => PrimMonad (RWST r w s m) | |
| (Monoid w, PrimMonad m) => PrimMonad (RWST r w s m) | |
| PrimMonad m => PrimMonad (Pipe l i o u m) | |
type MutableDeque c = (MutableQueue c, MutablePushFront c, MutablePopBack c) #
Collections which allow pushing and popping at the front and back.
Since 0.2.0
type MutableStack c = (MutablePopFront c, MutablePushFront c) #
Collections which allow pushing at the back and popping at the front (aka FILOs).
Since 0.2.0
type MutableQueue c = (MutablePopFront c, MutablePushBack c) #
Collections which allow pushing and popping at the front (aka FIFOs).
Since 0.2.0
class MutableCollection c => MutablePushBack c where #
Place a value at the back of the collection.
Since 0.2.0
Methods
pushBack :: (PrimMonad m, PrimState m ~ MCState c) => c -> CollElement c -> m () #
Place a value at the back of the collection.
Since 0.2.0
Instances
| IsSequence a => MutablePushBack (IORef a) | |
Defined in Data.Mutable.Class | |
| IsSequence a => MutablePushBack (STRef s a) | |
Defined in Data.Mutable.Class | |
| IsSequence a => MutablePushBack (MutVar s a) | |
Defined in Data.Mutable.Class | |
| IsSequence seq => MutablePushBack (BRef s seq) | |
Defined in Data.Mutable.BRef | |
| MutablePushBack (DLList s a) | |
Defined in Data.Mutable.DLList | |
| MVector v a => MutablePushBack (Deque v s a) | |
Defined in Data.Mutable.Deque | |
class MutableCollection c => MutablePopBack c where #
Take a value from the back of the collection, if available.
Since 0.2.0
Methods
popBack :: (PrimMonad m, PrimState m ~ MCState c) => c -> m (Maybe (CollElement c)) #
Take a value from the back of the collection, if available.
Since 0.2.0
Instances
| IsSequence a => MutablePopBack (IORef a) | |
| IsSequence a => MutablePopBack (STRef s a) | |
| IsSequence a => MutablePopBack (MutVar s a) | |
| IsSequence seq => MutablePopBack (BRef s seq) | |
| MutablePopBack (DLList s a) | |
| MVector v a => MutablePopBack (Deque v s a) | |
class MutableCollection c => MutablePushFront c where #
Place a value at the front of the collection.
Since 0.2.0
Methods
pushFront :: (PrimMonad m, PrimState m ~ MCState c) => c -> CollElement c -> m () #
Place a value at the front of the collection.
Since 0.2.0
Instances
| IsSequence a => MutablePushFront (IORef a) | |
Defined in Data.Mutable.Class | |
| IsSequence a => MutablePushFront (STRef s a) | |
Defined in Data.Mutable.Class | |
| IsSequence a => MutablePushFront (MutVar s a) | |
Defined in Data.Mutable.Class | |
| IsSequence seq => MutablePushFront (BRef s seq) | |
Defined in Data.Mutable.BRef | |
| MutablePushFront (DLList s a) | |
Defined in Data.Mutable.DLList | |
| MVector v a => MutablePushFront (Deque v s a) | |
Defined in Data.Mutable.Deque | |
class MutableCollection c => MutablePopFront c where #
Take a value from the front of the collection, if available.
Since 0.2.0
Methods
popFront :: (PrimMonad m, PrimState m ~ MCState c) => c -> m (Maybe (CollElement c)) #
Take a value from the front of the collection, if available.
Since 0.2.0
Instances
| IsSequence a => MutablePopFront (IORef a) | |
| IsSequence a => MutablePopFront (STRef s a) | |
| IsSequence a => MutablePopFront (MutVar s a) | |
| IsSequence seq => MutablePopFront (BRef s seq) | |
| MutablePopFront (DLList s a) | |
| MVector v a => MutablePopFront (Deque v s a) | |
class MutableContainer c => MutableCollection c where #
Containers which contain 0 or more values.
Since 0.2.0
Methods
newColl :: (PrimMonad m, PrimState m ~ MCState c) => m c #
Create a new, empty collection.
Since 0.2.0
Instances
| Monoid w => MutableCollection (IORef w) | |
| Monoid w => MutableCollection (STRef s w) | |
| Monoid w => MutableCollection (MutVar s w) | |
| Monoid w => MutableCollection (BRef s w) | |
| MutableCollection (DLList s a) | |
| MVector v a => MutableCollection (Deque v s a) | |
class MutableRef c => MutableAtomicRef c where #
MutableRefs that provide for atomic modifications of their contents.
Since 0.2.0
Methods
atomicModifyRef :: (PrimMonad m, PrimState m ~ MCState c) => c -> (RefElement c -> (RefElement c, a)) -> m a #
Modify the value without necessarily forcing the result.
Since 0.2.0
atomicModifyRef' :: (PrimMonad m, PrimState m ~ MCState c) => c -> (RefElement c -> (RefElement c, a)) -> m a #
Modify the value, forcing the result.
Since 0.2.0
Instances
| MutableAtomicRef (IORef a) | |
Defined in Data.Mutable.Class Methods atomicModifyRef :: (PrimMonad m, PrimState m ~ MCState (IORef a)) => IORef a -> (RefElement (IORef a) -> (RefElement (IORef a), a0)) -> m a0 # atomicModifyRef' :: (PrimMonad m, PrimState m ~ MCState (IORef a)) => IORef a -> (RefElement (IORef a) -> (RefElement (IORef a), a0)) -> m a0 # | |
| MutableAtomicRef (MutVar s a) | |
Defined in Data.Mutable.Class Methods atomicModifyRef :: (PrimMonad m, PrimState m ~ MCState (MutVar s a)) => MutVar s a -> (RefElement (MutVar s a) -> (RefElement (MutVar s a), a0)) -> m a0 # atomicModifyRef' :: (PrimMonad m, PrimState m ~ MCState (MutVar s a)) => MutVar s a -> (RefElement (MutVar s a) -> (RefElement (MutVar s a), a0)) -> m a0 # | |
class MutableContainer c => MutableRef c where #
Typeclass for single-cell mutable references.
Since 0.2.0
Associated Types
type RefElement c :: Type #
Associated type giving the type of the value inside the mutable reference.
Since 0.2.0
Methods
newRef :: (PrimMonad m, PrimState m ~ MCState c) => RefElement c -> m c #
Create a new mutable reference with the given value.
Since 0.2.0
readRef :: (PrimMonad m, PrimState m ~ MCState c) => c -> m (RefElement c) #
Read the current value in the mutable reference.
Since 0.2.0
writeRef :: (PrimMonad m, PrimState m ~ MCState c) => c -> RefElement c -> m () #
Write a new value to the mutable reference.
Since 0.2.0
modifyRef :: (PrimMonad m, PrimState m ~ MCState c) => c -> (RefElement c -> RefElement c) -> m () #
Modify the value in the mutable reference, without necessarily forcing the result.
Note: some implementations will force the result, in particular
PRef, SRef, and URef.
Since 0.2.0
modifyRef' :: (PrimMonad m, PrimState m ~ MCState c) => c -> (RefElement c -> RefElement c) -> m () #
Modify the value in the mutable reference, forcing the result.
Since 0.2.0
Instances
class MutableContainer c #
The parent typeclass for all mutable containers.
Since 0.2.0
Associated Types
Associated type giving the primitive state token for the given
container, much like PrimState from primitive.
Since 0.2.0
Instances
| MutableContainer (IORef a) | |
Defined in Data.Mutable.Class | |
| MutableContainer (STRef s a) | |
Defined in Data.Mutable.Class | |
| MutableContainer (MutVar s a) | |
Defined in Data.Mutable.Class | |
| MutableContainer (BRef s a) | |
Defined in Data.Mutable.BRef | |
| MutableContainer (DLList s a) | |
Defined in Data.Mutable.DLList | |
| MutableContainer (PRef s a) | |
Defined in Data.Mutable.PRef | |
| MutableContainer (SRef s a) | |
Defined in Data.Mutable.SRef | |
| MutableContainer (URef s a) | |
Defined in Data.Mutable.URef | |
| MutableContainer (Deque v s a) | |
Defined in Data.Mutable.Deque | |
A boxed vector reference, supporting any monad.
Since 0.2.0
Instances
A doubly-linked list.
Since 0.3.0
Instances
| MutablePushBack (DLList s a) | |
Defined in Data.Mutable.DLList | |
| MutablePopBack (DLList s a) | |
| MutablePushFront (DLList s a) | |
Defined in Data.Mutable.DLList | |
| MutablePopFront (DLList s a) | |
| MutableCollection (DLList s a) | |
| MutableContainer (DLList s a) | |
Defined in Data.Mutable.DLList | |
| type CollElement (DLList s a) | |
Defined in Data.Mutable.DLList | |
| type MCState (DLList s a) | |
Defined in Data.Mutable.DLList | |
data Deque (v :: Type -> Type -> Type) s a #
A double-ended queue supporting any underlying vector type and any monad.
This implements a circular double-ended queue with exponential growth.
Since 0.2.0
Instances
| MVector v a => MutablePushBack (Deque v s a) | |
Defined in Data.Mutable.Deque | |
| MVector v a => MutablePopBack (Deque v s a) | |
| MVector v a => MutablePushFront (Deque v s a) | |
Defined in Data.Mutable.Deque | |
| MVector v a => MutablePopFront (Deque v s a) | |
| MVector v a => MutableCollection (Deque v s a) | |
| MutableContainer (Deque v s a) | |
Defined in Data.Mutable.Deque | |
| type CollElement (Deque v s a) | |
Defined in Data.Mutable.Deque | |
| type MCState (Deque v s a) | |
Defined in Data.Mutable.Deque | |
A primitive ByteArray reference, supporting any monad.
Since 0.2.0
Instances
| Prim a => MutableRef (PRef s a) | |
Defined in Data.Mutable.PRef Associated Types type RefElement (PRef s a) :: Type # Methods newRef :: (PrimMonad m, PrimState m ~ MCState (PRef s a)) => RefElement (PRef s a) -> m (PRef s a) # readRef :: (PrimMonad m, PrimState m ~ MCState (PRef s a)) => PRef s a -> m (RefElement (PRef s a)) # writeRef :: (PrimMonad m, PrimState m ~ MCState (PRef s a)) => PRef s a -> RefElement (PRef s a) -> m () # modifyRef :: (PrimMonad m, PrimState m ~ MCState (PRef s a)) => PRef s a -> (RefElement (PRef s a) -> RefElement (PRef s a)) -> m () # modifyRef' :: (PrimMonad m, PrimState m ~ MCState (PRef s a)) => PRef s a -> (RefElement (PRef s a) -> RefElement (PRef s a)) -> m () # | |
| MutableContainer (PRef s a) | |
Defined in Data.Mutable.PRef | |
| type RefElement (PRef s a) | |
Defined in Data.Mutable.PRef | |
| type MCState (PRef s a) | |
Defined in Data.Mutable.PRef | |
A storable vector reference, supporting any monad.
Since 0.2.0
Instances
| Storable a => MutableRef (SRef s a) | |
Defined in Data.Mutable.SRef Associated Types type RefElement (SRef s a) :: Type # Methods newRef :: (PrimMonad m, PrimState m ~ MCState (SRef s a)) => RefElement (SRef s a) -> m (SRef s a) # readRef :: (PrimMonad m, PrimState m ~ MCState (SRef s a)) => SRef s a -> m (RefElement (SRef s a)) # writeRef :: (PrimMonad m, PrimState m ~ MCState (SRef s a)) => SRef s a -> RefElement (SRef s a) -> m () # modifyRef :: (PrimMonad m, PrimState m ~ MCState (SRef s a)) => SRef s a -> (RefElement (SRef s a) -> RefElement (SRef s a)) -> m () # modifyRef' :: (PrimMonad m, PrimState m ~ MCState (SRef s a)) => SRef s a -> (RefElement (SRef s a) -> RefElement (SRef s a)) -> m () # | |
| MutableContainer (SRef s a) | |
Defined in Data.Mutable.SRef | |
| type RefElement (SRef s a) | |
Defined in Data.Mutable.SRef | |
| type MCState (SRef s a) | |
Defined in Data.Mutable.SRef | |
An unboxed vector reference, supporting any monad.
Since 0.2.0
Instances
| Unbox a => MutableRef (URef s a) | |
Defined in Data.Mutable.URef Associated Types type RefElement (URef s a) :: Type # Methods newRef :: (PrimMonad m, PrimState m ~ MCState (URef s a)) => RefElement (URef s a) -> m (URef s a) # readRef :: (PrimMonad m, PrimState m ~ MCState (URef s a)) => URef s a -> m (RefElement (URef s a)) # writeRef :: (PrimMonad m, PrimState m ~ MCState (URef s a)) => URef s a -> RefElement (URef s a) -> m () # modifyRef :: (PrimMonad m, PrimState m ~ MCState (URef s a)) => URef s a -> (RefElement (URef s a) -> RefElement (URef s a)) -> m () # modifyRef' :: (PrimMonad m, PrimState m ~ MCState (URef s a)) => URef s a -> (RefElement (URef s a) -> RefElement (URef s a)) -> m () # | |
| MutableContainer (URef s a) | |
Defined in Data.Mutable.URef | |
| type RefElement (URef s a) | |
Defined in Data.Mutable.URef | |
| type MCState (URef s a) | |
Defined in Data.Mutable.URef | |
class MonoFoldable mono => GrowingAppend mono #
Containers which, when two values are combined, the combined length is no less than the larger of the two inputs. In code:
olength (x <> y) >= max (olength x) (olength y)
This class has no methods, and is simply used to assert that this law holds, in order to provide guarantees of correctness (see, for instance, Data.NonNull).
This should have a Semigroup superclass constraint, however, due to
Semigroup only recently moving to base, some packages do not provide
instances.
Instances
class MonoFunctor mono => MonoComonad mono where #
Typeclass for monomorphic containers where it is always okay to
"extract" a value from with oextract, and where you can extrapolate
any "extracting" function to be a function on the whole part with
oextend.
oextend and oextract should work together following the laws:
oextendoextract=idoextract.oextendf = foextendf .oextendg =oextend(f .oextendg)
As an intuition, oextend ff to "build up" a new mono with
pieces from the old one received by f.
Methods
oextract :: mono -> Element mono #
Extract an element from mono. Can be thought of as a dual
concept to opoint.
Instances
| IsSequence mono => MonoComonad (NonNull mono) | |
| MonoComonad (ViewL a) | |
| MonoComonad (ViewR a) | |
class MonoPointed mono where #
Typeclass for monomorphic containers that an element can be lifted into.
For any MonoFunctor, the following law holds:
omapf .opoint=opoint. f
Minimal complete definition
Nothing
Methods
opoint :: Element mono -> mono #
Lift an element into a monomorphic container.
opoint is the same as pure for an Applicative
Instances
class (MonoFunctor mono, MonoFoldable mono) => MonoTraversable mono where #
Monomorphic containers that can be traversed from left to right.
NOTE: Due to limitations with the role system, GHC is yet unable to provide newtype-derivation of
MonoTraversable. See https://stackoverflow.com/questions/49776924/newtype-deriving-issequence.
Minimal complete definition
Nothing
Methods
otraverse :: Applicative f => (Element mono -> f (Element mono)) -> mono -> f mono #
Map each element of a monomorphic container to an action, evaluate these actions from left to right, and collect the results.
omapM :: Applicative m => (Element mono -> m (Element mono)) -> mono -> m mono #
Map each element of a monomorphic container to a monadic action, evaluate these actions from left to right, and collect the results.
Instances
class MonoFoldable mono where #
Monomorphic containers that can be folded.
Minimal complete definition
Nothing
Methods
ofoldMap :: Monoid m => (Element mono -> m) -> mono -> m #
Map each element of a monomorphic container to a Monoid
and combine the results.
ofoldr :: (Element mono -> b -> b) -> b -> mono -> b #
Right-associative fold of a monomorphic container.
ofoldl' :: (a -> Element mono -> a) -> a -> mono -> a #
Strict left-associative fold of a monomorphic container.
otoList :: mono -> [Element mono] #
Convert a monomorphic container to a list.
oall :: (Element mono -> Bool) -> mono -> Bool #
Are all of the elements in a monomorphic container
converted to booleans True?
oany :: (Element mono -> Bool) -> mono -> Bool #
Are any of the elements in a monomorphic container
converted to booleans True?
Is the monomorphic container empty?
Length of a monomorphic container, returns a Int.
Length of a monomorphic container, returns a Int64.
ocompareLength :: Integral i => mono -> i -> Ordering #
Compare the length of a monomorphic container and a given number.
otraverse_ :: Applicative f => (Element mono -> f b) -> mono -> f () #
Map each element of a monomorphic container to an action, evaluate these actions from left to right, and ignore the results.
ofor_ :: Applicative f => mono -> (Element mono -> f b) -> f () #
ofor_ is otraverse_ with its arguments flipped.
omapM_ :: Applicative m => (Element mono -> m ()) -> mono -> m () #
Map each element of a monomorphic container to a monadic action, evaluate these actions from left to right, and ignore the results.
oforM_ :: Applicative m => mono -> (Element mono -> m ()) -> m () #
ofoldlM :: Monad m => (a -> Element mono -> m a) -> a -> mono -> m a #
Monadic fold over the elements of a monomorphic container, associating to the left.
ofoldMap1Ex :: Semigroup m => (Element mono -> m) -> mono -> m #
Map each element of a monomorphic container to a semigroup, and combine the results.
Note: this is a partial function. On an empty MonoFoldable, it will
throw an exception.
See ofoldMap1 from Data.NonNull for a total version of this function.
ofoldr1Ex :: (Element mono -> Element mono -> Element mono) -> mono -> Element mono #
Right-associative fold of a monomorphic container with no base element.
Note: this is a partial function. On an empty MonoFoldable, it will
throw an exception.
See ofoldr1 from Data.NonNull for a total version of this function.
ofoldl1Ex' :: (Element mono -> Element mono -> Element mono) -> mono -> Element mono #
Strict left-associative fold of a monomorphic container with no base element.
Note: this is a partial function. On an empty MonoFoldable, it will
throw an exception.
See ofoldl1' from Data.NonNull for a total version of this function.
headEx :: mono -> Element mono #
Get the first element of a monomorphic container.
Note: this is a partial function. On an empty MonoFoldable, it will
throw an exception.
See head from Data.NonNull for a total version of this function.
lastEx :: mono -> Element mono #
Get the last element of a monomorphic container.
Note: this is a partial function. On an empty MonoFoldable, it will
throw an exception.
See last from Data.NonNull for a total version of this function.
unsafeHead :: mono -> Element mono #
Equivalent to headEx.
unsafeLast :: mono -> Element mono #
Equivalent to lastEx.
maximumByEx :: (Element mono -> Element mono -> Ordering) -> mono -> Element mono #
Get the maximum element of a monomorphic container, using a supplied element ordering function.
Note: this is a partial function. On an empty MonoFoldable, it will
throw an exception.
See maximiumBy from Data.NonNull for a total version of this function.
minimumByEx :: (Element mono -> Element mono -> Ordering) -> mono -> Element mono #
Get the minimum element of a monomorphic container, using a supplied element ordering function.
Note: this is a partial function. On an empty MonoFoldable, it will
throw an exception.
See minimumBy from Data.NonNull for a total version of this function.
oelem :: Element mono -> mono -> Bool #
Checks if the monomorphic container includes the supplied element.
onotElem :: Element mono -> mono -> Bool #
Checks if the monomorphic container does not include the supplied element.
Instances
class MonoFunctor mono where #
Monomorphic containers that can be mapped over.
Minimal complete definition
Nothing
Instances
type family Element mono :: Type #
Type family for getting the type of the elements of a monomorphic container.
Instances
replaceElem :: (MonoFunctor mono, Eq (Element mono)) => Element mono -> Element mono -> mono -> mono #
replaceElem old newold elements with new.
Since: mono-traversable-1.0.1
headMay :: MonoFoldable mono => mono -> Maybe (Element mono) #
lastMay :: MonoFoldable mono => mono -> Maybe (Element mono) #
osum :: (MonoFoldable mono, Num (Element mono)) => mono -> Element mono #
osum computes the sum of the numbers of a monomorphic container.
oproduct :: (MonoFoldable mono, Num (Element mono)) => mono -> Element mono #
oproduct computes the product of the numbers of a monomorphic container.
oand :: (Element mono ~ Bool, MonoFoldable mono) => mono -> Bool #
Are all of the elements True?
Since 0.6.0
oor :: (Element mono ~ Bool, MonoFoldable mono) => mono -> Bool #
Are any of the elements True?
Since 0.6.0
oconcatMap :: (MonoFoldable mono, Monoid m) => (Element mono -> m) -> mono -> m #
Synonym for ofoldMap
Since: mono-traversable-1.0.0
ofold :: (MonoFoldable mono, Monoid (Element mono)) => mono -> Element mono #
Monoidally combine all values in the container
Since: mono-traversable-1.0.0
oconcat :: (MonoFoldable mono, Monoid (Element mono)) => mono -> Element mono #
Synonym for ofold
Since: mono-traversable-1.0.0
ofoldM :: (MonoFoldable mono, Monad m) => (a -> Element mono -> m a) -> a -> mono -> m a #
Synonym for ofoldlM
Since: mono-traversable-1.0.0
osequence_ :: (Applicative m, MonoFoldable mono, Element mono ~ m ()) => mono -> m () #
Perform all actions in the given container
Since: mono-traversable-1.0.0
maximumEx :: (MonoFoldable mono, Ord (Element mono)) => mono -> Element mono #
Get the minimum element of a monomorphic container.
Note: this is a partial function. On an empty MonoFoldable, it will
throw an exception.
See maximum from Data.NonNull for a total version of this function.
minimumEx :: (MonoFoldable mono, Ord (Element mono)) => mono -> Element mono #
Get the maximum element of a monomorphic container.
Note: this is a partial function. On an empty MonoFoldable, it will
throw an exception.
See minimum from Data.NonNull for a total version of this function.
maximumMay :: (MonoFoldable mono, Ord (Element mono)) => mono -> Maybe (Element mono) #
maximumByMay :: MonoFoldable mono => (Element mono -> Element mono -> Ordering) -> mono -> Maybe (Element mono) #
Safe version of maximumByEx.
Returns Nothing instead of throwing an exception when
encountering an empty monomorphic container.
minimumMay :: (MonoFoldable mono, Ord (Element mono)) => mono -> Maybe (Element mono) #
minimumByMay :: MonoFoldable mono => (Element mono -> Element mono -> Ordering) -> mono -> Maybe (Element mono) #
Safe version of minimumByEx.
Returns Nothing instead of throwing an exception when
encountering an empty monomorphic container.
ofor :: (MonoTraversable mono, Applicative f) => mono -> (Element mono -> f (Element mono)) -> f mono #
oforM :: (MonoTraversable mono, Applicative f) => mono -> (Element mono -> f (Element mono)) -> f mono #
ofoldlUnwrap :: MonoFoldable mono => (x -> Element mono -> x) -> x -> (x -> b) -> mono -> b #
A strict left fold, together with an unwrap function.
This is convenient when the accumulator value is not the same as the final
expected type. It is provided mainly for integration with the foldl
package, to be used in conjunction with purely.
Since 0.3.1
ofoldMUnwrap :: (Monad m, MonoFoldable mono) => (x -> Element mono -> m x) -> m x -> (x -> m b) -> mono -> m b #
A monadic strict left fold, together with an unwrap function.
Similar to foldlUnwrap, but allows monadic actions. To be used with
impurely from foldl.
Since 0.3.1
ointercalate :: (MonoFoldable mono, Monoid (Element mono)) => Element mono -> mono -> Element mono #
intercalate seq seqs inserts seq in between seqs and
concatenates the result.
Since: mono-traversable-1.0.0
class SetContainer set => HasKeysSet set where #
Type class for maps whose keys can be converted into sets.
Instances
| HasKeysSet (IntMap v) | |
| Ord k => HasKeysSet (Map k v) | |
| (Hashable k, Eq k) => HasKeysSet (HashMap k v) | |
class MonoFunctor mono => MonoZip mono where #
Zip operations on MonoFunctors.
Methods
ozipWith :: (Element mono -> Element mono -> Element mono) -> mono -> mono -> mono #
Combine each element of two MonoZips using a supplied function.
ozip :: mono -> mono -> [(Element mono, Element mono)] #
Take two MonoZips and return a list of the pairs of their elements.
Instances
| MonoZip ByteString | |
Defined in Data.Containers Methods ozipWith :: (Element ByteString -> Element ByteString -> Element ByteString) -> ByteString -> ByteString -> ByteString # ozip :: ByteString -> ByteString -> [(Element ByteString, Element ByteString)] # ounzip :: [(Element ByteString, Element ByteString)] -> (ByteString, ByteString) # | |
| MonoZip ByteString | |
Defined in Data.Containers Methods ozipWith :: (Element ByteString -> Element ByteString -> Element ByteString) -> ByteString -> ByteString -> ByteString # ozip :: ByteString -> ByteString -> [(Element ByteString, Element ByteString)] # ounzip :: [(Element ByteString, Element ByteString)] -> (ByteString, ByteString) # | |
| MonoZip Text | |
| MonoZip Text | |
class (SetContainer set, Element set ~ ContainerKey set) => IsSet set where #
Polymorphic typeclass for interacting with different set types
Methods
insertSet :: Element set -> set -> set #
Insert a value into a set.
deleteSet :: Element set -> set -> set #
Delete a value from a set.
singletonSet :: Element set -> set #
Create a set from a single element.
setFromList :: [Element set] -> set #
Convert a list to a set.
setToList :: set -> [Element set] #
Convert a set to a list.
Instances
| IsSet IntSet | |
| (Eq element, Hashable element) => IsSet (HashSet element) | |
Defined in Data.Containers Methods insertSet :: Element (HashSet element) -> HashSet element -> HashSet element # deleteSet :: Element (HashSet element) -> HashSet element -> HashSet element # singletonSet :: Element (HashSet element) -> HashSet element # setFromList :: [Element (HashSet element)] -> HashSet element # setToList :: HashSet element -> [Element (HashSet element)] # | |
| Ord element => IsSet (Set element) | |
class (MonoTraversable map, SetContainer map) => IsMap map where #
Polymorphic typeclass for interacting with different map types
Minimal complete definition
lookup, insertMap, deleteMap, singletonMap, mapFromList, mapToList
Associated Types
Methods
lookup :: ContainerKey map -> map -> Maybe (MapValue map) #
Look up a value in a map with a specified key.
insertMap :: ContainerKey map -> MapValue map -> map -> map #
Insert a key-value pair into a map.
deleteMap :: ContainerKey map -> map -> map #
Delete a key-value pair of a map using a specified key.
singletonMap :: ContainerKey map -> MapValue map -> map #
Create a map from a single key-value pair.
mapFromList :: [(ContainerKey map, MapValue map)] -> map #
Convert a list of key-value pairs to a map
mapToList :: map -> [(ContainerKey map, MapValue map)] #
Convert a map to a list of key-value pairs.
findWithDefault :: MapValue map -> ContainerKey map -> map -> MapValue map #
Like lookup, but uses a default value when the key does
not exist in the map.
Arguments
| :: (MapValue map -> MapValue map -> MapValue map) | function that accepts the new value and the previous value and returns the value that will be set in the map. |
| -> ContainerKey map | key |
| -> MapValue map | new value to insert |
| -> map | input map |
| -> map | resulting map |
Insert a key-value pair into a map.
Inserts the value directly if the key does not exist in the map. Otherwise, apply a supplied function that accepts the new value and the previous value and insert that result into the map.
Arguments
| :: (ContainerKey map -> MapValue map -> MapValue map -> MapValue map) | function that accepts the key, the new value, and the previous value and returns the value that will be set in the map. |
| -> ContainerKey map | key |
| -> MapValue map | new value to insert |
| -> map | input map |
| -> map | resulting map |
Insert a key-value pair into a map.
Inserts the value directly if the key does not exist in the map. Otherwise, apply a supplied function that accepts the key, the new value, and the previous value and insert that result into the map.
Arguments
| :: (ContainerKey map -> MapValue map -> MapValue map -> MapValue map) | function that accepts the key, the new value, and the previous value and returns the value that will be set in the map. |
| -> ContainerKey map | key |
| -> MapValue map | new value to insert |
| -> map | input map |
| -> (Maybe (MapValue map), map) | previous value and the resulting map |
Insert a key-value pair into a map, return the previous key's value if it existed.
Inserts the value directly if the key does not exist in the map. Otherwise, apply a supplied function that accepts the key, the new value, and the previous value and insert that result into the map.
Arguments
| :: (MapValue map -> MapValue map) | function to apply to the previous value |
| -> ContainerKey map | key |
| -> map | input map |
| -> map | resulting map |
Apply a function to the value of a given key.
Returns the input map when the key-value pair does not exist.
Arguments
| :: (ContainerKey map -> MapValue map -> MapValue map) | function that accepts the key and the previous value and returns the new value |
| -> ContainerKey map | key |
| -> map | input map |
| -> map | resulting map |
Equivalent to adjustMap, but the function accepts the key,
as well as the previous value.
Arguments
| :: (MapValue map -> Maybe (MapValue map)) | function that accepts the previous value
and returns the new value or |
| -> ContainerKey map | key |
| -> map | input map |
| -> map | resulting map |
Apply a function to the value of a given key.
If the function returns Nothing, this deletes the key-value pair.
Returns the input map when the key-value pair does not exist.
Arguments
| :: (ContainerKey map -> MapValue map -> Maybe (MapValue map)) | function that accepts the key and the previous value
and returns the new value or |
| -> ContainerKey map | key |
| -> map | input map |
| -> map | resulting map |
Equivalent to updateMap, but the function accepts the key,
as well as the previous value.
Arguments
| :: (ContainerKey map -> MapValue map -> Maybe (MapValue map)) | function that accepts the key and the previous value
and returns the new value or |
| -> ContainerKey map | key |
| -> map | input map |
| -> (Maybe (MapValue map), map) | previous/new value and the resulting map |
Apply a function to the value of a given key.
If the map does not contain the key this returns Nothing
and the input map.
If the map does contain the key but the function returns Nothing,
this returns the previous value and the map with the key-value pair removed.
If the map contains the key and the function returns a value, this returns the new value and the map with the key-value pair with the new value.
Arguments
| :: (Maybe (MapValue map) -> Maybe (MapValue map)) | function that accepts the previous value and
returns the new value or |
| -> ContainerKey map | key |
| -> map | input map |
| -> map | resulting map |
Update/Delete the value of a given key.
Applies a function to previous value of a given key, if it results in Nothing
delete the key-value pair from the map, otherwise replace the previous value
with the new value.
Arguments
| :: (MapValue map -> MapValue map -> MapValue map) | function that accepts the first map's value and the second map's value and returns the new value that will be used |
| -> map | first map |
| -> map | second map |
| -> map | resulting map |
Combine two maps.
When a key exists in both maps, apply a function to both of the values and use the result of that as the value of the key in the resulting map.
Arguments
| :: (ContainerKey map -> MapValue map -> MapValue map -> MapValue map) | function that accepts the key, the first map's value and the second map's value and returns the new value that will be used |
| -> map | first map |
| -> map | second map |
| -> map | resulting map |
Arguments
| :: (MapValue map -> MapValue map -> MapValue map) | function that accepts the first map's value and the second map's value and returns the new value that will be used |
| -> [map] | input list of maps |
| -> map | resulting map |
Combine a list of maps.
When a key exists in two different maps, apply a function to both of the values and use the result of that as the value of the key in the resulting map.
Arguments
| :: (ContainerKey map -> MapValue map -> MapValue map) | function that accepts the key and the previous value and returns the new value |
| -> map | input map |
| -> map | resulting map |
Apply a function over every key-value pair of a map.
Arguments
| :: (MapValue map -> MapValue map -> MapValue map) | function that accepts the first map's value and the second map's value and returns the new value that will be used |
| -> (ContainerKey map -> ContainerKey map) | function that accepts the previous key and returns the new key |
| -> map | input map |
| -> map | resulting map |
Apply a function over every key of a pair and run
unionsWith over the results.
filterMap :: (MapValue map -> Bool) -> map -> map #
Filter values in a map.
Since: mono-traversable-1.0.9.0
Instances
| Eq key => IsMap [(key, value)] | |
Defined in Data.Containers Methods lookup :: ContainerKey [(key, value)] -> [(key, value)] -> Maybe (MapValue [(key, value)]) # insertMap :: ContainerKey [(key, value)] -> MapValue [(key, value)] -> [(key, value)] -> [(key, value)] # deleteMap :: ContainerKey [(key, value)] -> [(key, value)] -> [(key, value)] # singletonMap :: ContainerKey [(key, value)] -> MapValue [(key, value)] -> [(key, value)] # mapFromList :: [(ContainerKey [(key, value)], MapValue [(key, value)])] -> [(key, value)] # mapToList :: [(key, value)] -> [(ContainerKey [(key, value)], MapValue [(key, value)])] # findWithDefault :: MapValue [(key, value)] -> ContainerKey [(key, value)] -> [(key, value)] -> MapValue [(key, value)] # insertWith :: (MapValue [(key, value)] -> MapValue [(key, value)] -> MapValue [(key, value)]) -> ContainerKey [(key, value)] -> MapValue [(key, value)] -> [(key, value)] -> [(key, value)] # insertWithKey :: (ContainerKey [(key, value)] -> MapValue [(key, value)] -> MapValue [(key, value)] -> MapValue [(key, value)]) -> ContainerKey [(key, value)] -> MapValue [(key, value)] -> [(key, value)] -> [(key, value)] # insertLookupWithKey :: (ContainerKey [(key, value)] -> MapValue [(key, value)] -> MapValue [(key, value)] -> MapValue [(key, value)]) -> ContainerKey [(key, value)] -> MapValue [(key, value)] -> [(key, value)] -> (Maybe (MapValue [(key, value)]), [(key, value)]) # adjustMap :: (MapValue [(key, value)] -> MapValue [(key, value)]) -> ContainerKey [(key, value)] -> [(key, value)] -> [(key, value)] # adjustWithKey :: (ContainerKey [(key, value)] -> MapValue [(key, value)] -> MapValue [(key, value)]) -> ContainerKey [(key, value)] -> [(key, value)] -> [(key, value)] # updateMap :: (MapValue [(key, value)] -> Maybe (MapValue [(key, value)])) -> ContainerKey [(key, value)] -> [(key, value)] -> [(key, value)] # updateWithKey :: (ContainerKey [(key, value)] -> MapValue [(key, value)] -> Maybe (MapValue [(key, value)])) -> ContainerKey [(key, value)] -> [(key, value)] -> [(key, value)] # updateLookupWithKey :: (ContainerKey [(key, value)] -> MapValue [(key, value)] -> Maybe (MapValue [(key, value)])) -> ContainerKey [(key, value)] -> [(key, value)] -> (Maybe (MapValue [(key, value)]), [(key, value)]) # alterMap :: (Maybe (MapValue [(key, value)]) -> Maybe (MapValue [(key, value)])) -> ContainerKey [(key, value)] -> [(key, value)] -> [(key, value)] # unionWith :: (MapValue [(key, value)] -> MapValue [(key, value)] -> MapValue [(key, value)]) -> [(key, value)] -> [(key, value)] -> [(key, value)] # unionWithKey :: (ContainerKey [(key, value)] -> MapValue [(key, value)] -> MapValue [(key, value)] -> MapValue [(key, value)]) -> [(key, value)] -> [(key, value)] -> [(key, value)] # unionsWith :: (MapValue [(key, value)] -> MapValue [(key, value)] -> MapValue [(key, value)]) -> [[(key, value)]] -> [(key, value)] # mapWithKey :: (ContainerKey [(key, value)] -> MapValue [(key, value)] -> MapValue [(key, value)]) -> [(key, value)] -> [(key, value)] # omapKeysWith :: (MapValue [(key, value)] -> MapValue [(key, value)] -> MapValue [(key, value)]) -> (ContainerKey [(key, value)] -> ContainerKey [(key, value)]) -> [(key, value)] -> [(key, value)] # filterMap :: (MapValue [(key, value)] -> Bool) -> [(key, value)] -> [(key, value)] # | |
| IsMap (IntMap value) | This instance uses the functions from Data.IntMap.Strict. |
Defined in Data.Containers Methods lookup :: ContainerKey (IntMap value) -> IntMap value -> Maybe (MapValue (IntMap value)) # insertMap :: ContainerKey (IntMap value) -> MapValue (IntMap value) -> IntMap value -> IntMap value # deleteMap :: ContainerKey (IntMap value) -> IntMap value -> IntMap value # singletonMap :: ContainerKey (IntMap value) -> MapValue (IntMap value) -> IntMap value # mapFromList :: [(ContainerKey (IntMap value), MapValue (IntMap value))] -> IntMap value # mapToList :: IntMap value -> [(ContainerKey (IntMap value), MapValue (IntMap value))] # findWithDefault :: MapValue (IntMap value) -> ContainerKey (IntMap value) -> IntMap value -> MapValue (IntMap value) # insertWith :: (MapValue (IntMap value) -> MapValue (IntMap value) -> MapValue (IntMap value)) -> ContainerKey (IntMap value) -> MapValue (IntMap value) -> IntMap value -> IntMap value # insertWithKey :: (ContainerKey (IntMap value) -> MapValue (IntMap value) -> MapValue (IntMap value) -> MapValue (IntMap value)) -> ContainerKey (IntMap value) -> MapValue (IntMap value) -> IntMap value -> IntMap value # insertLookupWithKey :: (ContainerKey (IntMap value) -> MapValue (IntMap value) -> MapValue (IntMap value) -> MapValue (IntMap value)) -> ContainerKey (IntMap value) -> MapValue (IntMap value) -> IntMap value -> (Maybe (MapValue (IntMap value)), IntMap value) # adjustMap :: (MapValue (IntMap value) -> MapValue (IntMap value)) -> ContainerKey (IntMap value) -> IntMap value -> IntMap value # adjustWithKey :: (ContainerKey (IntMap value) -> MapValue (IntMap value) -> MapValue (IntMap value)) -> ContainerKey (IntMap value) -> IntMap value -> IntMap value # updateMap :: (MapValue (IntMap value) -> Maybe (MapValue (IntMap value))) -> ContainerKey (IntMap value) -> IntMap value -> IntMap value # updateWithKey :: (ContainerKey (IntMap value) -> MapValue (IntMap value) -> Maybe (MapValue (IntMap value))) -> ContainerKey (IntMap value) -> IntMap value -> IntMap value # updateLookupWithKey :: (ContainerKey (IntMap value) -> MapValue (IntMap value) -> Maybe (MapValue (IntMap value))) -> ContainerKey (IntMap value) -> IntMap value -> (Maybe (MapValue (IntMap value)), IntMap value) # alterMap :: (Maybe (MapValue (IntMap value)) -> Maybe (MapValue (IntMap value))) -> ContainerKey (IntMap value) -> IntMap value -> IntMap value # unionWith :: (MapValue (IntMap value) -> MapValue (IntMap value) -> MapValue (IntMap value)) -> IntMap value -> IntMap value -> IntMap value # unionWithKey :: (ContainerKey (IntMap value) -> MapValue (IntMap value) -> MapValue (IntMap value) -> MapValue (IntMap value)) -> IntMap value -> IntMap value -> IntMap value # unionsWith :: (MapValue (IntMap value) -> MapValue (IntMap value) -> MapValue (IntMap value)) -> [IntMap value] -> IntMap value # mapWithKey :: (ContainerKey (IntMap value) -> MapValue (IntMap value) -> MapValue (IntMap value)) -> IntMap value -> IntMap value # omapKeysWith :: (MapValue (IntMap value) -> MapValue (IntMap value) -> MapValue (IntMap value)) -> (ContainerKey (IntMap value) -> ContainerKey (IntMap value)) -> IntMap value -> IntMap value # filterMap :: (MapValue (IntMap value) -> Bool) -> IntMap value -> IntMap value # | |
| Ord key => IsMap (Map key value) | This instance uses the functions from Data.Map.Strict. |
Defined in Data.Containers Methods lookup :: ContainerKey (Map key value) -> Map key value -> Maybe (MapValue (Map key value)) # insertMap :: ContainerKey (Map key value) -> MapValue (Map key value) -> Map key value -> Map key value # deleteMap :: ContainerKey (Map key value) -> Map key value -> Map key value # singletonMap :: ContainerKey (Map key value) -> MapValue (Map key value) -> Map key value # mapFromList :: [(ContainerKey (Map key value), MapValue (Map key value))] -> Map key value # mapToList :: Map key value -> [(ContainerKey (Map key value), MapValue (Map key value))] # findWithDefault :: MapValue (Map key value) -> ContainerKey (Map key value) -> Map key value -> MapValue (Map key value) # insertWith :: (MapValue (Map key value) -> MapValue (Map key value) -> MapValue (Map key value)) -> ContainerKey (Map key value) -> MapValue (Map key value) -> Map key value -> Map key value # insertWithKey :: (ContainerKey (Map key value) -> MapValue (Map key value) -> MapValue (Map key value) -> MapValue (Map key value)) -> ContainerKey (Map key value) -> MapValue (Map key value) -> Map key value -> Map key value # insertLookupWithKey :: (ContainerKey (Map key value) -> MapValue (Map key value) -> MapValue (Map key value) -> MapValue (Map key value)) -> ContainerKey (Map key value) -> MapValue (Map key value) -> Map key value -> (Maybe (MapValue (Map key value)), Map key value) # adjustMap :: (MapValue (Map key value) -> MapValue (Map key value)) -> ContainerKey (Map key value) -> Map key value -> Map key value # adjustWithKey :: (ContainerKey (Map key value) -> MapValue (Map key value) -> MapValue (Map key value)) -> ContainerKey (Map key value) -> Map key value -> Map key value # updateMap :: (MapValue (Map key value) -> Maybe (MapValue (Map key value))) -> ContainerKey (Map key value) -> Map key value -> Map key value # updateWithKey :: (ContainerKey (Map key value) -> MapValue (Map key value) -> Maybe (MapValue (Map key value))) -> ContainerKey (Map key value) -> Map key value -> Map key value # updateLookupWithKey :: (ContainerKey (Map key value) -> MapValue (Map key value) -> Maybe (MapValue (Map key value))) -> ContainerKey (Map key value) -> Map key value -> (Maybe (MapValue (Map key value)), Map key value) # alterMap :: (Maybe (MapValue (Map key value)) -> Maybe (MapValue (Map key value))) -> ContainerKey (Map key value) -> Map key value -> Map key value # unionWith :: (MapValue (Map key value) -> MapValue (Map key value) -> MapValue (Map key value)) -> Map key value -> Map key value -> Map key value # unionWithKey :: (ContainerKey (Map key value) -> MapValue (Map key value) -> MapValue (Map key value) -> MapValue (Map key value)) -> Map key value -> Map key value -> Map key value # unionsWith :: (MapValue (Map key value) -> MapValue (Map key value) -> MapValue (Map key value)) -> [Map key value] -> Map key value # mapWithKey :: (ContainerKey (Map key value) -> MapValue (Map key value) -> MapValue (Map key value)) -> Map key value -> Map key value # omapKeysWith :: (MapValue (Map key value) -> MapValue (Map key value) -> MapValue (Map key value)) -> (ContainerKey (Map key value) -> ContainerKey (Map key value)) -> Map key value -> Map key value # filterMap :: (MapValue (Map key value) -> Bool) -> Map key value -> Map key value # | |
| (Eq key, Hashable key) => IsMap (HashMap key value) | This instance uses the functions from Data.HashMap.Strict. |
Defined in Data.Containers Methods lookup :: ContainerKey (HashMap key value) -> HashMap key value -> Maybe (MapValue (HashMap key value)) # insertMap :: ContainerKey (HashMap key value) -> MapValue (HashMap key value) -> HashMap key value -> HashMap key value # deleteMap :: ContainerKey (HashMap key value) -> HashMap key value -> HashMap key value # singletonMap :: ContainerKey (HashMap key value) -> MapValue (HashMap key value) -> HashMap key value # mapFromList :: [(ContainerKey (HashMap key value), MapValue (HashMap key value))] -> HashMap key value # mapToList :: HashMap key value -> [(ContainerKey (HashMap key value), MapValue (HashMap key value))] # findWithDefault :: MapValue (HashMap key value) -> ContainerKey (HashMap key value) -> HashMap key value -> MapValue (HashMap key value) # insertWith :: (MapValue (HashMap key value) -> MapValue (HashMap key value) -> MapValue (HashMap key value)) -> ContainerKey (HashMap key value) -> MapValue (HashMap key value) -> HashMap key value -> HashMap key value # insertWithKey :: (ContainerKey (HashMap key value) -> MapValue (HashMap key value) -> MapValue (HashMap key value) -> MapValue (HashMap key value)) -> ContainerKey (HashMap key value) -> MapValue (HashMap key value) -> HashMap key value -> HashMap key value # insertLookupWithKey :: (ContainerKey (HashMap key value) -> MapValue (HashMap key value) -> MapValue (HashMap key value) -> MapValue (HashMap key value)) -> ContainerKey (HashMap key value) -> MapValue (HashMap key value) -> HashMap key value -> (Maybe (MapValue (HashMap key value)), HashMap key value) # adjustMap :: (MapValue (HashMap key value) -> MapValue (HashMap key value)) -> ContainerKey (HashMap key value) -> HashMap key value -> HashMap key value # adjustWithKey :: (ContainerKey (HashMap key value) -> MapValue (HashMap key value) -> MapValue (HashMap key value)) -> ContainerKey (HashMap key value) -> HashMap key value -> HashMap key value # updateMap :: (MapValue (HashMap key value) -> Maybe (MapValue (HashMap key value))) -> ContainerKey (HashMap key value) -> HashMap key value -> HashMap key value # updateWithKey :: (ContainerKey (HashMap key value) -> MapValue (HashMap key value) -> Maybe (MapValue (HashMap key value))) -> ContainerKey (HashMap key value) -> HashMap key value -> HashMap key value # updateLookupWithKey :: (ContainerKey (HashMap key value) -> MapValue (HashMap key value) -> Maybe (MapValue (HashMap key value))) -> ContainerKey (HashMap key value) -> HashMap key value -> (Maybe (MapValue (HashMap key value)), HashMap key value) # alterMap :: (Maybe (MapValue (HashMap key value)) -> Maybe (MapValue (HashMap key value))) -> ContainerKey (HashMap key value) -> HashMap key value -> HashMap key value # unionWith :: (MapValue (HashMap key value) -> MapValue (HashMap key value) -> MapValue (HashMap key value)) -> HashMap key value -> HashMap key value -> HashMap key value # unionWithKey :: (ContainerKey (HashMap key value) -> MapValue (HashMap key value) -> MapValue (HashMap key value) -> MapValue (HashMap key value)) -> HashMap key value -> HashMap key value -> HashMap key value # unionsWith :: (MapValue (HashMap key value) -> MapValue (HashMap key value) -> MapValue (HashMap key value)) -> [HashMap key value] -> HashMap key value # mapWithKey :: (ContainerKey (HashMap key value) -> MapValue (HashMap key value) -> MapValue (HashMap key value)) -> HashMap key value -> HashMap key value # omapKeysWith :: (MapValue (HashMap key value) -> MapValue (HashMap key value) -> MapValue (HashMap key value)) -> (ContainerKey (HashMap key value) -> ContainerKey (HashMap key value)) -> HashMap key value -> HashMap key value # filterMap :: (MapValue (HashMap key value) -> Bool) -> HashMap key value -> HashMap key value # | |
class BiPolyMap (map :: Type -> Type -> Type) where #
A Map type polymorphic in both its key and value.
Associated Types
type BPMKeyConstraint (map :: Type -> Type -> Type) key :: Constraint #
Methods
Arguments
| :: (BPMKeyConstraint map k1, BPMKeyConstraint map k2) | |
| => (v -> v -> v) | combine values that now overlap |
| -> (k1 -> k2) | |
| -> map k1 v | |
| -> map k2 v |
Instances
| BiPolyMap Map | |
Defined in Data.Containers Associated Types type BPMKeyConstraint Map key :: Constraint # Methods mapKeysWith :: (BPMKeyConstraint Map k1, BPMKeyConstraint Map k2) => (v -> v -> v) -> (k1 -> k2) -> Map k1 v -> Map k2 v # | |
| BiPolyMap HashMap | |
Defined in Data.Containers Associated Types type BPMKeyConstraint HashMap key :: Constraint # Methods mapKeysWith :: (BPMKeyConstraint HashMap k1, BPMKeyConstraint HashMap k2) => (v -> v -> v) -> (k1 -> k2) -> HashMap k1 v -> HashMap k2 v # | |
class PolyMap (map :: Type -> Type) where #
A guaranteed-polymorphic Map, which allows for more polymorphic versions
of functions.
Methods
differenceMap :: map value1 -> map value2 -> map value1 #
Get the difference between two maps, using the left map's values.
intersectionMap :: map value1 -> map value2 -> map value1 #
Get the intersection of two maps, using the left map's values.
intersectionWithMap :: (value1 -> value2 -> value3) -> map value1 -> map value2 -> map value3 #
Get the intersection of two maps with a supplied function that takes in the left map's value and the right map's value.
Instances
| PolyMap IntMap | This instance uses the functions from Data.IntMap.Strict. |
Defined in Data.Containers Methods differenceMap :: IntMap value1 -> IntMap value2 -> IntMap value1 # intersectionMap :: IntMap value1 -> IntMap value2 -> IntMap value1 # intersectionWithMap :: (value1 -> value2 -> value3) -> IntMap value1 -> IntMap value2 -> IntMap value3 # | |
| Ord key => PolyMap (Map key) | This instance uses the functions from Data.Map.Strict. |
Defined in Data.Containers Methods differenceMap :: Map key value1 -> Map key value2 -> Map key value1 # intersectionMap :: Map key value1 -> Map key value2 -> Map key value1 # intersectionWithMap :: (value1 -> value2 -> value3) -> Map key value1 -> Map key value2 -> Map key value3 # | |
| (Eq key, Hashable key) => PolyMap (HashMap key) | This instance uses the functions from Data.HashMap.Strict. |
Defined in Data.Containers Methods differenceMap :: HashMap key value1 -> HashMap key value2 -> HashMap key value1 # intersectionMap :: HashMap key value1 -> HashMap key value2 -> HashMap key value1 # intersectionWithMap :: (value1 -> value2 -> value3) -> HashMap key value1 -> HashMap key value2 -> HashMap key value3 # | |
class (Monoid set, Semigroup set, MonoFoldable set, Eq (ContainerKey set), GrowingAppend set) => SetContainer set where #
A container whose values are stored in Key-Value pairs.
Minimal complete definition
Methods
member :: ContainerKey set -> set -> Bool #
Check if there is a value with the supplied key in the container.
notMember :: ContainerKey set -> set -> Bool #
Check if there isn't a value with the supplied key in the container.
Get the union of two containers.
unions :: (MonoFoldable mono, Element mono ~ set) => mono -> set #
Combine a collection of SetContainers, with left-most values overriding
when there are matching keys.
Since: mono-traversable-1.0.0
difference :: set -> set -> set #
Get the difference of two containers.
intersection :: set -> set -> set #
Get the intersection of two containers.
keys :: set -> [ContainerKey set] #
Get a list of all of the keys in the container.
Instances
| SetContainer IntSet | |
Defined in Data.Containers Associated Types type ContainerKey IntSet :: Type # Methods member :: ContainerKey IntSet -> IntSet -> Bool # notMember :: ContainerKey IntSet -> IntSet -> Bool # union :: IntSet -> IntSet -> IntSet # unions :: (MonoFoldable mono, Element mono ~ IntSet) => mono -> IntSet # difference :: IntSet -> IntSet -> IntSet # intersection :: IntSet -> IntSet -> IntSet # keys :: IntSet -> [ContainerKey IntSet] # | |
| Eq key => SetContainer [(key, value)] | |
Defined in Data.Containers Associated Types type ContainerKey [(key, value)] :: Type # Methods member :: ContainerKey [(key, value)] -> [(key, value)] -> Bool # notMember :: ContainerKey [(key, value)] -> [(key, value)] -> Bool # union :: [(key, value)] -> [(key, value)] -> [(key, value)] # unions :: (MonoFoldable mono, Element mono ~ [(key, value)]) => mono -> [(key, value)] # difference :: [(key, value)] -> [(key, value)] -> [(key, value)] # intersection :: [(key, value)] -> [(key, value)] -> [(key, value)] # keys :: [(key, value)] -> [ContainerKey [(key, value)]] # | |
| (Eq element, Hashable element) => SetContainer (HashSet element) | |
Defined in Data.Containers Associated Types type ContainerKey (HashSet element) :: Type # Methods member :: ContainerKey (HashSet element) -> HashSet element -> Bool # notMember :: ContainerKey (HashSet element) -> HashSet element -> Bool # union :: HashSet element -> HashSet element -> HashSet element # unions :: (MonoFoldable mono, Element mono ~ HashSet element) => mono -> HashSet element # difference :: HashSet element -> HashSet element -> HashSet element # intersection :: HashSet element -> HashSet element -> HashSet element # keys :: HashSet element -> [ContainerKey (HashSet element)] # | |
| Ord element => SetContainer (Set element) | |
Defined in Data.Containers Associated Types type ContainerKey (Set element) :: Type # Methods member :: ContainerKey (Set element) -> Set element -> Bool # notMember :: ContainerKey (Set element) -> Set element -> Bool # union :: Set element -> Set element -> Set element # unions :: (MonoFoldable mono, Element mono ~ Set element) => mono -> Set element # difference :: Set element -> Set element -> Set element # intersection :: Set element -> Set element -> Set element # keys :: Set element -> [ContainerKey (Set element)] # | |
| SetContainer (IntMap value) | This instance uses the functions from Data.IntMap.Strict. |
Defined in Data.Containers Associated Types type ContainerKey (IntMap value) :: Type # Methods member :: ContainerKey (IntMap value) -> IntMap value -> Bool # notMember :: ContainerKey (IntMap value) -> IntMap value -> Bool # union :: IntMap value -> IntMap value -> IntMap value # unions :: (MonoFoldable mono, Element mono ~ IntMap value) => mono -> IntMap value # difference :: IntMap value -> IntMap value -> IntMap value # intersection :: IntMap value -> IntMap value -> IntMap value # keys :: IntMap value -> [ContainerKey (IntMap value)] # | |
| Ord k => SetContainer (Map k v) | This instance uses the functions from Data.Map.Strict. |
Defined in Data.Containers Associated Types type ContainerKey (Map k v) :: Type # Methods member :: ContainerKey (Map k v) -> Map k v -> Bool # notMember :: ContainerKey (Map k v) -> Map k v -> Bool # union :: Map k v -> Map k v -> Map k v # unions :: (MonoFoldable mono, Element mono ~ Map k v) => mono -> Map k v # difference :: Map k v -> Map k v -> Map k v # intersection :: Map k v -> Map k v -> Map k v # keys :: Map k v -> [ContainerKey (Map k v)] # | |
| (Eq key, Hashable key) => SetContainer (HashMap key value) | This instance uses the functions from Data.HashMap.Strict. |
Defined in Data.Containers Associated Types type ContainerKey (HashMap key value) :: Type # Methods member :: ContainerKey (HashMap key value) -> HashMap key value -> Bool # notMember :: ContainerKey (HashMap key value) -> HashMap key value -> Bool # union :: HashMap key value -> HashMap key value -> HashMap key value # unions :: (MonoFoldable mono, Element mono ~ HashMap key value) => mono -> HashMap key value # difference :: HashMap key value -> HashMap key value -> HashMap key value # intersection :: HashMap key value -> HashMap key value -> HashMap key value # keys :: HashMap key value -> [ContainerKey (HashMap key value)] # | |
foldMap :: (MonoFoldable mono, Monoid m) => (Element mono -> m) -> mono -> m #
Synonym for ofoldMap
Since: mono-traversable-1.0.0
foldr :: MonoFoldable mono => (Element mono -> b -> b) -> b -> mono -> b #
Synonym for ofoldr
Since: mono-traversable-1.0.0
foldl' :: MonoFoldable mono => (a -> Element mono -> a) -> a -> mono -> a #
Synonym for ofoldl'
Since: mono-traversable-1.0.0
toList :: MonoFoldable mono => mono -> [Element mono] #
Synonym for otoList
Since: mono-traversable-1.0.0
all :: MonoFoldable mono => (Element mono -> Bool) -> mono -> Bool #
Synonym for oall
Since: mono-traversable-1.0.0
any :: MonoFoldable mono => (Element mono -> Bool) -> mono -> Bool #
Synonym for oany
Since: mono-traversable-1.0.0
null :: MonoFoldable mono => mono -> Bool #
Synonym for onull
Since: mono-traversable-1.0.0
length :: MonoFoldable mono => mono -> Int #
Synonym for olength
Since: mono-traversable-1.0.0
length64 :: MonoFoldable mono => mono -> Int64 #
Synonym for olength64
Since: mono-traversable-1.0.0
compareLength :: (MonoFoldable mono, Integral i) => mono -> i -> Ordering #
Synonym for ocompareLength
Since: mono-traversable-1.0.0
traverse_ :: (MonoFoldable mono, Applicative f) => (Element mono -> f b) -> mono -> f () #
Synonym for otraverse_
Since: mono-traversable-1.0.0
for_ :: (MonoFoldable mono, Applicative f) => mono -> (Element mono -> f b) -> f () #
Synonym for ofor_
Since: mono-traversable-1.0.0
mapM_ :: (MonoFoldable mono, Applicative m) => (Element mono -> m ()) -> mono -> m () #
Synonym for omapM_
Since: mono-traversable-1.0.0
forM_ :: (MonoFoldable mono, Applicative m) => mono -> (Element mono -> m ()) -> m () #
Synonym for oforM_
Since: mono-traversable-1.0.0
foldlM :: (MonoFoldable mono, Monad m) => (a -> Element mono -> m a) -> a -> mono -> m a #
Synonym for ofoldlM
Since: mono-traversable-1.0.0
foldMap1Ex :: (MonoFoldable mono, Semigroup m) => (Element mono -> m) -> mono -> m #
Synonym for ofoldMap1Ex
Since: mono-traversable-1.0.0
foldr1Ex :: MonoFoldable mono => (Element mono -> Element mono -> Element mono) -> mono -> Element mono #
Synonym for ofoldr1Ex
Since: mono-traversable-1.0.0
foldl1Ex' :: MonoFoldable mono => (Element mono -> Element mono -> Element mono) -> mono -> Element mono #
Synonym for ofoldl1Ex'
Since: mono-traversable-1.0.0
sum :: (MonoFoldable mono, Num (Element mono)) => mono -> Element mono #
Synonym for osum
Since: mono-traversable-1.0.0
product :: (MonoFoldable mono, Num (Element mono)) => mono -> Element mono #
Synonym for oproduct
Since: mono-traversable-1.0.0
and :: (MonoFoldable mono, Element mono ~ Bool) => mono -> Bool #
Synonym for oand
Since: mono-traversable-1.0.0
or :: (MonoFoldable mono, Element mono ~ Bool) => mono -> Bool #
Synonym for oor
Since: mono-traversable-1.0.0
concatMap :: (MonoFoldable mono, Monoid m) => (Element mono -> m) -> mono -> m #
Synonym for oconcatMap
Since: mono-traversable-1.0.0
elem :: (MonoFoldable mono, Eq (Element mono)) => Element mono -> mono -> Bool #
Synonym for oelem
Since: mono-traversable-1.0.0
notElem :: (MonoFoldable mono, Eq (Element mono)) => Element mono -> mono -> Bool #
Synonym for onotElem
Since: mono-traversable-1.0.0
point :: MonoPointed mono => Element mono -> mono #
Synonym for opoint
Since: mono-traversable-1.0.0
intercalate :: (MonoFoldable mono, Monoid (Element mono)) => Element mono -> mono -> Element mono #
Synonym for ointercalate
Since: mono-traversable-1.0.0
fold :: (MonoFoldable mono, Monoid (Element mono)) => mono -> Element mono #
Synonym for ofold
Since: mono-traversable-1.0.0
concat :: (MonoFoldable mono, Monoid (Element mono)) => mono -> Element mono #
Synonym for oconcat
Since: mono-traversable-1.0.0
foldM :: (MonoFoldable mono, Monad m) => (a -> Element mono -> m a) -> a -> mono -> m a #
Synonym for ofoldM
Since: mono-traversable-1.0.0
sequence_ :: (Applicative m, MonoFoldable mono, Element mono ~ m ()) => mono -> m () #
Synonym for osequence_
Since: mono-traversable-1.0.0
class (Textual textual, IsSequence binary) => Utf8 textual binary | textual -> binary, binary -> textual where #
Textual data which can be encoded to and decoded from UTF8.
Since: mono-traversable-1.0.0
Methods
encodeUtf8 :: textual -> binary #
Encode from textual to binary using UTF-8 encoding
Since: mono-traversable-1.0.0
decodeUtf8 :: binary -> textual #
Note that this function is required to be pure. In the case of a decoding error, Unicode replacement characters must be used.
Since: mono-traversable-1.0.0
Instances
| Utf8 Text ByteString | |
Defined in Data.Sequences | |
| Utf8 Text ByteString | |
Defined in Data.Sequences | |
| (c ~ Char, w ~ Word8) => Utf8 [c] [w] | |
Defined in Data.Sequences | |
class (IsSequence lazy, IsSequence strict) => LazySequence lazy strict | lazy -> strict, strict -> lazy where #
Lazy sequences containing strict chunks of data.
Since: mono-traversable-1.0.0
Instances
| LazySequence ByteString ByteString | |
Defined in Data.Sequences Methods toChunks :: ByteString0 -> [ByteString] # fromChunks :: [ByteString] -> ByteString0 # toStrict :: ByteString0 -> ByteString # fromStrict :: ByteString -> ByteString0 # | |
| LazySequence Text Text | |
class (IsSequence t, IsString t, Element t ~ Char) => Textual t where #
A typeclass for sequences whose elements are Chars.
Methods
Break up a textual sequence into a list of words, which were delimited by white space.
> words "abc def ghi"
["abc","def","ghi"]
unwords :: (Element seq ~ t, MonoFoldable seq) => seq -> t #
Join a list of textual sequences using seperating spaces.
> unwords ["abc","def","ghi"]
"abc def ghi"
Break up a textual sequence at newline characters.
> lines "hello\nworld"
["hello","world"]
unlines :: (Element seq ~ t, MonoFoldable seq) => seq -> t #
Join a list of textual sequences using newlines.
> unlines ["abc","def","ghi"]
"abc\ndef\nghi"
Convert a textual sequence to lower-case.
> toLower "HELLO WORLD"
"hello world"
Convert a textual sequence to upper-case.
> toUpper "hello world"
"HELLO WORLD"
toCaseFold :: t -> t #
Convert a textual sequence to folded-case.
Slightly different from toLower, see Data.Text.toCaseFold
Split a textual sequence into two parts, split at the first space.
> breakWord "hello world"
("hello","world")
Split a textual sequence into two parts, split at the newline.
> breakLine "abc\ndef"
("abc","def")
Instances
| Textual Text | |
| Textual Text | |
| c ~ Char => Textual [c] | |
Defined in Data.Sequences Methods unwords :: (Element seq ~ [c], MonoFoldable seq) => seq -> [c] # unlines :: (Element seq ~ [c], MonoFoldable seq) => seq -> [c] # toCaseFold :: [c] -> [c] # | |
class (Monoid seq, MonoTraversable seq, SemiSequence seq, MonoPointed seq) => IsSequence seq where #
Sequence Laws:
fromList.otoList=idfromList(x <> y) =fromListx <>fromListyotoList(fromListx <>fromListy) = x <> y
Minimal complete definition
Nothing
Methods
fromList :: [Element seq] -> seq #
Convert a list to a sequence.
>fromList[a,b,c] :: Text "abc"
lengthIndex :: seq -> Index seq #
lengthIndex returns the length of a sequence as Index seq
Since: mono-traversable-1.0.2
break :: (Element seq -> Bool) -> seq -> (seq, seq) #
break applies a predicate to a sequence, and returns a tuple where
the first element is the longest prefix (possibly empty) of elements that
do not satisfy the predicate. The second element of the tuple is the
remainder of the sequence.
break pspan (not . p)
>break(> 3) (fromList[1,2,3,4,1,2,3,4] ::VectorInt) (fromList [1,2,3],fromList [4,1,2,3,4]) >break(<z) (fromList"abc" ::Text) ("","abc") >break(>z) (fromList"abc" ::Text) ("abc","")
span :: (Element seq -> Bool) -> seq -> (seq, seq) #
span applies a predicate to a sequence, and returns a tuple where
the first element is the longest prefix (possibly empty) that
does satisfy the predicate. The second element of the tuple is the
remainder of the sequence.
span p xs(takeWhile p xs, dropWhile p xs)
>span(< 3) (fromList[1,2,3,4,1,2,3,4] ::VectorInt) (fromList [1,2],fromList [3,4,1,2,3,4]) >span(<z) (fromList"abc" ::Text) ("abc","") >span(< 0) 1,2,3
dropWhile :: (Element seq -> Bool) -> seq -> seq #
dropWhile returns the suffix remaining after takeWhile.
>dropWhile(< 3) [1,2,3,4,5,1,2,3] [3,4,5,1,2,3] >dropWhile(<z) (fromList"abc" ::Text) ""
takeWhile :: (Element seq -> Bool) -> seq -> seq #
takeWhile applies a predicate to a sequence, and returns the
longest prefix (possibly empty) of the sequence of elements that
satisfy the predicate.
>takeWhile(< 3) [1,2,3,4,5,1,2,3] [1,2] >takeWhile(<z) (fromList"abc" ::Text) "abc"
splitAt :: Index seq -> seq -> (seq, seq) #
splitAt n sese with length n, and the second element is the remainder of
the sequence.
>splitAt6 "Hello world!" ("Hello ","world!") >splitAt3 (fromList[1,2,3,4,5] ::VectorInt) (fromList [1,2,3],fromList [4,5])
unsafeSplitAt :: Index seq -> seq -> (seq, seq) #
Equivalent to splitAt.
take :: Index seq -> seq -> seq #
take nn, or the
sequence itself if n > .olength seq
>take3 "abcdefg" "abc" >take4 (fromList[1,2,3,4,5,6] ::VectorInt) fromList [1,2,3,4]
unsafeTake :: Index seq -> seq -> seq #
Equivalent to take.
drop :: Index seq -> seq -> seq #
drop nn
elements, or an empty sequence if n > .olength seq
>drop3 "abcdefg" "defg" >drop4 (fromList[1,2,3,4,5,6] ::VectorInt) fromList [5,6]
unsafeDrop :: Index seq -> seq -> seq #
Equivalent to drop
dropEnd :: Index seq -> seq -> seq #
Same as drop but drops from the end of the sequence instead.
>dropEnd3 "abcdefg" "abcd" >dropEnd4 (fromList[1,2,3,4,5,6] ::VectorInt) fromList [1,2]
Since: mono-traversable-1.0.4.0
partition :: (Element seq -> Bool) -> seq -> (seq, seq) #
partition takes a predicate and a sequence and returns the pair of
sequences of elements which do and do not satisfy the predicate.
partitionp se = (filterp se,filter(not. p) se)
uncons :: seq -> Maybe (Element seq, seq) #
uncons returns the tuple of the first element of a sequence and the rest
of the sequence, or Nothing if the sequence is empty.
>uncons(fromList[1,2,3,4] ::VectorInt)Just(1,fromList [2,3,4]) >uncons([] :: [Int])Nothing
unsnoc :: seq -> Maybe (seq, Element seq) #
unsnoc returns the tuple of the init of a sequence and the last element,
or Nothing if the sequence is empty.
>unsnoc(fromList[1,2,3,4] ::VectorInt)Just(fromList [1,2,3],4) >unsnoc([] :: [Int])Nothing
filter :: (Element seq -> Bool) -> seq -> seq #
filter given a predicate returns a sequence of all elements that satisfy
the predicate.
> filter (< 5) [1 .. 10]
[1,2,3,4]
filterM :: Monad m => (Element seq -> m Bool) -> seq -> m seq #
The monadic version of filter.
replicate :: Index seq -> Element seq -> seq #
replicate n xn with x as the
value of every element.
>replicate10a:: Text "aaaaaaaaaa"
replicateM :: Monad m => Index seq -> m (Element seq) -> m seq #
The monadic version of replicateM.
groupBy :: (Element seq -> Element seq -> Bool) -> seq -> [seq] #
group takes a sequence and returns a list of sequences such that the
concatenation of the result is equal to the argument. Each subsequence in
the result contains only equal elements, using the supplied equality test.
> groupBy (==) Mississippi
[M,"i","ss","i","ss","i","pp","i"]
groupAllOn :: Eq b => (Element seq -> b) -> seq -> [seq] #
Similar to standard groupBy, but operates on the whole collection,
not just the consecutive items.
subsequences :: seq -> [seq] #
subsequences returns a list of all subsequences of the argument.
> subsequences "abc"
["","a","b","ab","c","ac","bc","abc"]
permutations :: seq -> [seq] #
permutations returns a list of all permutations of the argument.
> permutations "abc"
["abc","bac","cba","bca","cab","acb"]
Unsafe
Get the tail of a sequence, throw an exception if the sequence is empty.
> tailEx [1,2,3]
[2,3]
Safe version of tailEx.
Returns Nothing instead of throwing an exception when encountering
an empty monomorphic container.
Since: mono-traversable-1.0.0
Unsafe
Get the init of a sequence, throw an exception if the sequence is empty.
> initEx [1,2,3]
[1,2]
Safe version of initEx.
Returns Nothing instead of throwing an exception when encountering
an empty monomorphic container.
Since: mono-traversable-1.0.0
unsafeTail :: seq -> seq #
Equivalent to tailEx.
unsafeInit :: seq -> seq #
Equivalent to initEx.
index :: seq -> Index seq -> Maybe (Element seq) #
Get the element of a sequence at a certain index, returns Nothing
if that index does not exist.
>index(fromList[1,2,3] ::VectorInt) 1Just2 >index(fromList[1,2,3] ::VectorInt) 4Nothing
indexEx :: seq -> Index seq -> Element seq #
Unsafe
Get the element of a sequence at a certain index, throws an exception if the index does not exist.
unsafeIndex :: seq -> Index seq -> Element seq #
Equivalent to indexEx.
splitWhen :: (Element seq -> Bool) -> seq -> [seq] #
splitWhen splits a sequence into components delimited by separators,
where the predicate returns True for a separator element. The resulting
components do not contain the separators. Two adjacent separators result
in an empty component in the output. The number of resulting components
is greater by one than number of separators.
Since 0.9.3
Instances
class (Integral (Index seq), GrowingAppend seq) => SemiSequence seq where #
SemiSequence was created to share code between IsSequence and NonNull.
Semi means SemiGroup
A SemiSequence can accomodate a SemiGroup such as NonEmpty or NonNull
A Monoid should be able to fill out IsSequence.
SemiSequence operations maintain the same type because they all maintain the same number of elements or increase them.
However, a decreasing function such as filter may change they type.
For example, from NonEmpty to '[]'
This type-changing function exists on NonNull as nfilter
filter and other such functions are placed in IsSequence
NOTE: Like GrowingAppend, ideally we'd have a Semigroup superclass
constraint here, but that would pull in more dependencies to this package
than desired.
Methods
intersperse :: Element seq -> seq -> seq #
intersperse takes an element and intersperses that element between
the elements of the sequence.
> intersperse ',' "abcde"
"a,b,c,d,e"
Reverse a sequence
> reverse "hello world"
"dlrow olleh"
find :: (Element seq -> Bool) -> seq -> Maybe (Element seq) #
find takes a predicate and a sequence and returns the first element in
the sequence matching the predicate, or Nothing if there isn't an element
that matches the predicate.
>find(== 5) [1 .. 10]Just5 >find(== 15) [1 .. 10]Nothing
sortBy :: (Element seq -> Element seq -> Ordering) -> seq -> seq #
Sort a sequence using an supplied element ordering function.
> let compare' x y = casecomparex y of LT -> GT; EQ -> EQ; GT -> LT >sortBycompare' [5,3,6,1,2,4] [6,5,4,3,2,1]
cons :: Element seq -> seq -> seq #
Prepend an element onto a sequence.
> 4 `cons` [1,2,3]
[4,1,2,3]
snoc :: seq -> Element seq -> seq #
Append an element onto a sequence.
> [1,2,3] `snoc` 4
[1,2,3,4]
Instances
singleton :: MonoPointed seq => Element seq -> seq #
defaultFind :: MonoFoldable seq => (Element seq -> Bool) -> seq -> Maybe (Element seq) #
defaultIntersperse :: IsSequence seq => Element seq -> seq -> seq #
Use Data.List's implementation of intersperse.
defaultReverse :: IsSequence seq => seq -> seq #
defaultSortBy :: IsSequence seq => (Element seq -> Element seq -> Ordering) -> seq -> seq #
defaultSplitWhen :: IsSequence seq => (Element seq -> Bool) -> seq -> [seq] #
Use splitWhen from Data.List.Split
vectorSortBy :: Vector v e => (e -> e -> Ordering) -> v e -> v e #
Sort a vector using an supplied element ordering function.
vectorSort :: (Vector v e, Ord e) => v e -> v e #
Sort a vector.
defaultCons :: IsSequence seq => Element seq -> seq -> seq #
defaultSnoc :: IsSequence seq => seq -> Element seq -> seq #
tailDef :: IsSequence seq => seq -> seq #
initDef :: IsSequence seq => seq -> seq #
splitSeq :: (IsSequence seq, Eq (Element seq)) => seq -> seq -> [seq] #
splitSeqsplitSeq is the right inverse of intercalate:
ointercalate x . splitSeq x === id
splitElem can be considered a special case of splitSeq
splitSeq (singleton sep) === splitElem sep
splitSeq memptysplitWhen rules, it has at least one output
component:
>splitSeq"" "" [""] >splitSeq"" "a" ["", "a"] >splitSeq"" "ab" ["", "a", "b"]
Since 0.9.3
replaceSeq :: (IsSequence seq, Eq (Element seq)) => seq -> seq -> seq -> seq #
replaceSeq old newold subsequences with new.
replaceSeq old new === ointercalate new . splitSeq old
Since: mono-traversable-1.0.1
stripPrefix :: (IsSequence seq, Eq (Element seq)) => seq -> seq -> Maybe seq #
stripPrefix drops the given prefix from a sequence.
It returns Nothing if the sequence did not start with the prefix
given, or Just the sequence after the prefix, if it does.
>stripPrefix"foo" "foobar"Just"bar" >stripPrefix"abc" "foobar"Nothing
stripSuffix :: (IsSequence seq, Eq (Element seq)) => seq -> seq -> Maybe seq #
stripSuffix drops the given suffix from a sequence.
It returns Nothing if the sequence did not end with the suffix
given, or Just the sequence before the suffix, if it does.
>stripSuffix"bar" "foobar"Just"foo" >stripSuffix"abc" "foobar"Nothing
dropPrefix :: (IsSequence seq, Eq (Element seq)) => seq -> seq -> seq #
dropPrefix drops the given prefix from a sequence. It returns the
original sequence if the sequence doesn't start with the given prefix.
>dropPrefix"foo" "foobar" "bar" >dropPrefix"abc" "foobar" "foobar"
Since: mono-traversable-1.0.7.0
dropSuffix :: (IsSequence seq, Eq (Element seq)) => seq -> seq -> seq #
dropSuffix drops the given suffix from a sequence. It returns the
original sequence if the sequence doesn't end with the given suffix.
>dropSuffix"bar" "foobar" "foo" >dropSuffix"abc" "foobar" "foobar"
Since: mono-traversable-1.0.7.0
ensurePrefix :: (Eq (Element seq), IsSequence seq) => seq -> seq -> seq #
ensurePrefix will add a prefix to a sequence if it doesn't
exist, and otherwise have no effect.
>ensurePrefix"foo" "foobar" "foobar" >ensurePrefix"abc" "foobar" "abcfoobar"
Since: mono-traversable-1.0.3
ensureSuffix :: (Eq (Element seq), IsSequence seq) => seq -> seq -> seq #
Append a suffix to a sequence, unless it already has that suffix.
>ensureSuffix"bar" "foobar" "foobar" >ensureSuffix"abc" "foobar" "foobarabc"
Since: mono-traversable-1.0.3
isPrefixOf :: (IsSequence seq, Eq (Element seq)) => seq -> seq -> Bool #
isPrefixOf takes two sequences and returns True if the first
sequence is a prefix of the second.
isSuffixOf :: (IsSequence seq, Eq (Element seq)) => seq -> seq -> Bool #
isSuffixOf takes two sequences and returns True if the first
sequence is a suffix of the second.
isInfixOf :: (IsSequence seq, Eq (Element seq)) => seq -> seq -> Bool #
isInfixOf takes two sequences and returns true if the first
sequence is contained, wholly and intact, anywhere within the second.
groupAll :: (IsSequence seq, Eq (Element seq)) => seq -> [seq] #
Similar to standard group, but operates on the whole collection,
not just the consecutive items.
Equivalent to groupAllOn id
delete :: (IsSequence seq, Eq (Element seq)) => Element seq -> seq -> seq #
Since: mono-traversable-0.10.2
deleteBy :: (IsSequence seq, Eq (Element seq)) => (Element seq -> Element seq -> Bool) -> Element seq -> seq -> seq #
Since: mono-traversable-0.10.2
splitElemStrictBS :: Word8 -> ByteString -> [ByteString] #
stripPrefixStrictBS :: ByteString -> ByteString -> Maybe ByteString #
stripSuffixStrictBS :: ByteString -> ByteString -> Maybe ByteString #
splitSeqLazyBS :: Word8 -> ByteString -> [ByteString] #
stripPrefixLazyBS :: ByteString -> ByteString -> Maybe ByteString #
stripSuffixLazyBS :: ByteString -> ByteString -> Maybe ByteString #
splitSeqStrictText :: Text -> Text -> [Text] #
splitSeqLazyText :: Text -> Text -> [Text] #
sort :: (SemiSequence seq, Ord (Element seq)) => seq -> seq #
Sort a ordered sequence.
> sort [4,3,1,2]
[1,2,3,4]
catMaybes :: (IsSequence (f (Maybe t)), Functor f, Element (f (Maybe t)) ~ Maybe t) => f (Maybe t) -> f t #
Takes all of the Just values from a sequence of Maybe ts and
concatenates them into an unboxed sequence of ts.
Since 0.6.2
sortOn :: (Ord o, SemiSequence seq) => (Element seq -> o) -> seq -> seq #
Same as sortBy . comparing.
Since 0.7.0
pack :: IsSequence seq => [Element seq] -> seq #
Synonym for fromList
Since: mono-traversable-1.0.0
unpack :: MonoFoldable mono => mono -> [Element mono] #
Synonym for otoList
Since: mono-traversable-1.0.0
repack :: (MonoFoldable a, IsSequence b, Element a ~ Element b) => a -> b #
Repack from one type to another, dropping to a list in the middle.
repack = pack . unpack.
Since: mono-traversable-1.0.0
A monomorphic container that is not null.
Instances
| Eq mono => Eq (NonNull mono) | |
| Data mono => Data (NonNull mono) | |
Defined in Data.NonNull Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> NonNull mono -> c (NonNull mono) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (NonNull mono) # toConstr :: NonNull mono -> Constr # dataTypeOf :: NonNull mono -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (NonNull mono)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (NonNull mono)) # gmapT :: (forall b. Data b => b -> b) -> NonNull mono -> NonNull mono # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> NonNull mono -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> NonNull mono -> r # gmapQ :: (forall d. Data d => d -> u) -> NonNull mono -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> NonNull mono -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> NonNull mono -> m (NonNull mono) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> NonNull mono -> m (NonNull mono) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> NonNull mono -> m (NonNull mono) # | |
| Ord mono => Ord (NonNull mono) | |
Defined in Data.NonNull | |
| Read mono => Read (NonNull mono) | |
| Show mono => Show (NonNull mono) | |
| (Semigroup mono, GrowingAppend mono) => Semigroup (NonNull mono) | |
| GrowingAppend mono => GrowingAppend (NonNull mono) | |
Defined in Data.NonNull | |
| IsSequence mono => MonoComonad (NonNull mono) | |
| MonoPointed mono => MonoPointed (NonNull mono) | |
| MonoTraversable mono => MonoTraversable (NonNull mono) | |
| MonoFoldable mono => MonoFoldable (NonNull mono) | |
Defined in Data.NonNull Methods ofoldMap :: Monoid m => (Element (NonNull mono) -> m) -> NonNull mono -> m # ofoldr :: (Element (NonNull mono) -> b -> b) -> b -> NonNull mono -> b # ofoldl' :: (a -> Element (NonNull mono) -> a) -> a -> NonNull mono -> a # otoList :: NonNull mono -> [Element (NonNull mono)] # oall :: (Element (NonNull mono) -> Bool) -> NonNull mono -> Bool # oany :: (Element (NonNull mono) -> Bool) -> NonNull mono -> Bool # onull :: NonNull mono -> Bool # olength :: NonNull mono -> Int # olength64 :: NonNull mono -> Int64 # ocompareLength :: Integral i => NonNull mono -> i -> Ordering # otraverse_ :: Applicative f => (Element (NonNull mono) -> f b) -> NonNull mono -> f () # ofor_ :: Applicative f => NonNull mono -> (Element (NonNull mono) -> f b) -> f () # omapM_ :: Applicative m => (Element (NonNull mono) -> m ()) -> NonNull mono -> m () # oforM_ :: Applicative m => NonNull mono -> (Element (NonNull mono) -> m ()) -> m () # ofoldlM :: Monad m => (a -> Element (NonNull mono) -> m a) -> a -> NonNull mono -> m a # ofoldMap1Ex :: Semigroup m => (Element (NonNull mono) -> m) -> NonNull mono -> m # ofoldr1Ex :: (Element (NonNull mono) -> Element (NonNull mono) -> Element (NonNull mono)) -> NonNull mono -> Element (NonNull mono) # ofoldl1Ex' :: (Element (NonNull mono) -> Element (NonNull mono) -> Element (NonNull mono)) -> NonNull mono -> Element (NonNull mono) # headEx :: NonNull mono -> Element (NonNull mono) # lastEx :: NonNull mono -> Element (NonNull mono) # unsafeHead :: NonNull mono -> Element (NonNull mono) # unsafeLast :: NonNull mono -> Element (NonNull mono) # maximumByEx :: (Element (NonNull mono) -> Element (NonNull mono) -> Ordering) -> NonNull mono -> Element (NonNull mono) # minimumByEx :: (Element (NonNull mono) -> Element (NonNull mono) -> Ordering) -> NonNull mono -> Element (NonNull mono) # oelem :: Element (NonNull mono) -> NonNull mono -> Bool # onotElem :: Element (NonNull mono) -> NonNull mono -> Bool # | |
| MonoFunctor mono => MonoFunctor (NonNull mono) | |
| SemiSequence seq => SemiSequence (NonNull seq) | |
Defined in Data.NonNull Methods intersperse :: Element (NonNull seq) -> NonNull seq -> NonNull seq # reverse :: NonNull seq -> NonNull seq # find :: (Element (NonNull seq) -> Bool) -> NonNull seq -> Maybe (Element (NonNull seq)) # sortBy :: (Element (NonNull seq) -> Element (NonNull seq) -> Ordering) -> NonNull seq -> NonNull seq # cons :: Element (NonNull seq) -> NonNull seq -> NonNull seq # snoc :: NonNull seq -> Element (NonNull seq) -> NonNull seq # | |
| type Element (NonNull mono) | |
Defined in Data.NonNull | |
| type Index (NonNull seq) | |
Defined in Data.NonNull | |
fromNullable :: MonoFoldable mono => mono -> Maybe (NonNull mono) #
Safely convert from an unsafe monomorphic container to a safe non-null monomorphic container.
impureNonNull :: MonoFoldable mono => mono -> NonNull mono #
Unsafely convert from an unsafe monomorphic container to a safe non-null monomorphic container.
Throws an exception if the monomorphic container is empty.
Since: mono-traversable-1.0.0
nonNull :: MonoFoldable mono => mono -> NonNull mono #
Old synonym for impureNonNull
fromNonEmpty :: IsSequence seq => NonEmpty (Element seq) -> NonNull seq #
Safely convert from a NonEmpty list to a non-null monomorphic container.
toMinList :: NonEmpty a -> NonNull [a] #
Specializes fromNonEmpty to lists only.
ncons :: SemiSequence seq => Element seq -> seq -> NonNull seq #
Prepend an element to a SemiSequence, creating a non-null SemiSequence.
Generally this uses cons underneath. cons is not efficient for most data structures.
Alternatives:
- if you don't need to cons, use
fromNullableornonNullif you can create your structure in one go. - if you need to cons, you might be able to start off with an efficient data structure such as a
NonEmptyList.fronNonEmptywill convert that to your data structure using the structure's fromList function.
nuncons :: IsSequence seq => NonNull seq -> (Element seq, Maybe (NonNull seq)) #
Extract the first element of a sequnce and the rest of the non-null sequence if it exists.
splitFirst :: IsSequence seq => NonNull seq -> (Element seq, seq) #
Same as nuncons with no guarantee that the rest of the sequence is non-null.
nfilter :: IsSequence seq => (Element seq -> Bool) -> NonNull seq -> seq #
Equivalent to Data.Sequences.,
but works on non-nullable sequences.filter
nfilterM :: (Monad m, IsSequence seq) => (Element seq -> m Bool) -> NonNull seq -> m seq #
Equivalent to Data.Sequences.,
but works on non-nullable sequences.filterM
nReplicate :: IsSequence seq => Index seq -> Element seq -> NonNull seq #
tail :: IsSequence seq => NonNull seq -> seq #
Safe version of tailEx, only working on non-nullable sequences.
init :: IsSequence seq => NonNull seq -> seq #
Safe version of initEx, only working on non-nullable sequences.
(<|) :: SemiSequence seq => Element seq -> NonNull seq -> NonNull seq infixr 5 #
Prepend an element to a non-null SemiSequence.
head :: MonoFoldable mono => NonNull mono -> Element mono #
last :: MonoFoldable mono => NonNull mono -> Element mono #
ofoldMap1 :: (MonoFoldable mono, Semigroup m) => (Element mono -> m) -> NonNull mono -> m #
Map each element of a monomorphic container to a semigroup, and combine the results.
Safe version of ofoldMap1Ex, only works on monomorphic containers wrapped in a
NonNull.
Examples
ofoldr1 :: MonoFoldable mono => (Element mono -> Element mono -> Element mono) -> NonNull mono -> Element mono #
ofoldl1' :: MonoFoldable mono => (Element mono -> Element mono -> Element mono) -> NonNull mono -> Element mono #
maximumBy :: MonoFoldable mono => (Element mono -> Element mono -> Ordering) -> NonNull mono -> Element mono #
Get the maximum element of a monomorphic container, using a supplied element ordering function.
Safe version of maximumByEx, only works on monomorphic containers wrapped in a
NonNull.
minimumBy :: MonoFoldable mono => (Element mono -> Element mono -> Ordering) -> NonNull mono -> Element mono #
Get the minimum element of a monomorphic container, using a supplied element ordering function.
Safe version of minimumByEx, only works on monomorphic containers wrapped in a
NonNull.
mapNonNull :: (Functor f, MonoFoldable (f b)) => (a -> b) -> NonNull (f a) -> NonNull (f b) #
interact :: MonadIO m => (LText -> LText) -> m () #
Takes a function of type 'LText -> LText' and passes all input on stdin to it, then prints result to stdout
Uses lazy IO Uses system locale settings
Since: classy-prelude-1.3.1
getContents :: MonadIO m => m LText #
Read all input from stdin into a lazy Text (LText)
Uses system locale settings
Since: classy-prelude-1.3.1
getLine :: MonadIO m => m Text #
Read a line from stdin
Uses system locale settings
Since: classy-prelude-1.3.1
getChar :: MonadIO m => m Char #
Read a character from stdin
Uses system locale settings
Since: classy-prelude-1.3.1
putStrLn :: MonadIO m => Text -> m () #
Write a Text followed by a newline to stdout
Uses system locale settings
Since: classy-prelude-1.3.1
putStr :: MonadIO m => Text -> m () #
Write a Text to stdout
Uses system locale settings
Since: classy-prelude-1.3.1
putChar :: MonadIO m => Char -> m () #
Write a character to stdout
Uses system locale settings
Since: classy-prelude-1.3.1
hGetChunk :: MonadIO m => Handle -> m ByteString #
Read a single chunk of data as a ByteString from the given
Handle.
Under the surface, this uses hGetSome with the
default chunk size.
Since: classy-prelude-1.2.0
hPut :: MonadIO m => Handle -> ByteString -> m () #
Write a ByteString to the given Handle.
Since: classy-prelude-1.2.0
hGetContents :: MonadIO m => Handle -> m ByteString #
Strictly read the contents of the given Handle into a
ByteString.
Since: classy-prelude-1.2.0
writeFileUtf8 :: MonadIO m => FilePath -> Text -> m () #
Write a Text to a file using a UTF-8 character encoding.
Since: classy-prelude-1.2.0
writeFile :: MonadIO m => FilePath -> ByteString -> m () #
Write a ByteString to a file.
Since: classy-prelude-1.2.0
readFileUtf8 :: MonadIO m => FilePath -> m Text #
Strictly read a file into a Text using a UTF-8 character
encoding. In the event of a character encoding error, a Unicode
replacement character will be used (a.k.a., lenientDecode).
Since: classy-prelude-1.2.0
readFile :: MonadIO m => FilePath -> m ByteString #
Strictly read a file into a ByteString.
Since: classy-prelude-1.2.0
link2Async :: MonadIO m => Async a -> Async b -> m () #
waitCatchAsync :: MonadIO m => Async a -> m (Either SomeException a) #
waitCatchSTM for any MonadIO
Since: classy-prelude-1.0.0
fromByteVector :: SVector Word8 -> ByteString #
Convert a storable Vector into a ByteString.
toByteVector :: ByteString -> SVector Word8 #
Convert a ByteString into a storable Vector.
(<||>) :: Applicative a => a Bool -> a Bool -> a Bool infixr 2 #
|| lifted to an Applicative.
Since: classy-prelude-0.12.8
(<&&>) :: Applicative a => a Bool -> a Bool -> a Bool infixr 3 #
&& lifted to an Applicative.
Since: classy-prelude-0.12.8
applyDList :: DList a -> [a] -> [a] #
Synonym for apply
Since 0.11.0
unlessM :: Monad m => m Bool -> m () -> m () #
Only perform the action if the predicate returns False.
Since 0.9.2
whenM :: Monad m => m Bool -> m () -> m () #
Only perform the action if the predicate returns True.
Since 0.9.2
ordNubBy :: Ord b => (a -> b) -> (a -> a -> Bool) -> [a] -> [a] #
yieldThread :: MonadIO m => m () #
Originally yield.
traceShowM :: (Show a, Monad m) => a -> m () #
Since 0.5.9
traceShowId :: Show a => a -> a #
Since 0.5.9
We define our own trace (and also its variants) which provides a warning
when used. So that tracing is available during development, but the compiler
reminds you to not leave them in the code for production.
undefined :: HasCallStack => a #
We define our own undefined which is marked as deprecated. This makes it
useful to use during development, but lets you more easily get
notifications if you accidentally ship partial code in production.
The classy prelude recommendation for when you need to really have a partial
function in production is to use error with a very descriptive message so
that, in case an exception is thrown, you get more information than
Prelude..undefined
Since 0.5.5
sortWith :: (Ord a, IsSequence c) => (Element c -> a) -> c -> c #
Sort elements using the user supplied function to project something out of each element. Inspired by http://hackage.haskell.org/packages/archive/base/latest/doc/html/GHC-Exts.html#v:sortWith.
asLByteString :: LByteString -> LByteString #
asByteString :: ByteString -> ByteString #
intersect :: SetContainer a => a -> a -> a #
An alias for intersection.
(\\) :: SetContainer a => a -> a -> a infixl 9 #
An alias for difference.
charToUpper :: Char -> Char #
Convert a character to upper case.
Character-based case conversion is lossy in comparison to string-based toUpper.
For instance, ß won't be converted to SS.
charToLower :: Char -> Char #
Convert a character to lower case.
Character-based case conversion is lossy in comparison to string-based toLower.
For instance, İ will be converted to i, instead of i̇.
The Modified Julian Day is a standard count of days, with zero being the day 1858-11-17.
Constructors
| ModifiedJulianDay | |
Fields | |
Instances
| Enum Day | |
| Eq Day | |
| Data Day | |
Defined in Data.Time.Calendar.Days Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Day -> c Day # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Day # dataTypeOf :: Day -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Day) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Day) # gmapT :: (forall b. Data b => b -> b) -> Day -> Day # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Day -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Day -> r # gmapQ :: (forall d. Data d => d -> u) -> Day -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Day -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Day -> m Day # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Day -> m Day # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Day -> m Day # | |
| Ord Day | |
| Ix Day | |
| NFData Day | |
Defined in Data.Time.Calendar.Days | |
| FormatTime Day | |
Defined in Data.Time.Format Methods formatCharacter :: Char -> Maybe (TimeLocale -> Maybe NumericPadOption -> Maybe Int -> Day -> String) # | |
| ParseTime Day | |
Defined in Data.Time.Format.Parse | |
toGregorian :: Day -> (Integer, Int, Int) #
Convert to proleptic Gregorian calendar. First element of result is year, second month number (1-12), third day (1-31).
fromGregorian :: Integer -> Int -> Int -> Day #
Convert from proleptic Gregorian calendar. First argument is year, second month number (1-12), third day (1-31). Invalid values will be clipped to the correct range, month first, then day.
getCurrentTime :: IO UTCTime #
Get the current UTCTime from the system clock.
defaultTimeLocale :: TimeLocale #
Locale representing American usage.
knownTimeZones contains only the ten time-zones mentioned in RFC 822 sec. 5:
"UT", "GMT", "EST", "EDT", "CST", "CDT", "MST", "MDT", "PST", "PDT".
Note that the parsing functions will regardless parse single-letter military time-zones and +HHMM format.
Arguments
| :: (Monad m, ParseTime t) | |
| => Bool | Accept leading and trailing whitespace? |
| -> TimeLocale | Time locale. |
| -> String | Format string. |
| -> String | Input string. |
| -> m t | Return the time value, or fail if the input could not be parsed using the given format. |
Parses a time value given a format string.
Supports the same %-codes as formatTime, including %-, %_ and %0 modifiers, however padding widths are not supported.
Case is not significant in the input string.
Some variations in the input are accepted:
%z- accepts any of
-HHMMor-HH:MM. %Z- accepts any string of letters, or any of the formats accepted by
%z. %0Y- accepts exactly four digits.
%0G- accepts exactly four digits.
%0C- accepts exactly two digits.
%0f- accepts exactly two digits.
formatTime :: FormatTime t => TimeLocale -> String -> t -> String #
Substitute various time-related information for each %-code in the string, as per formatCharacter.
The general form is %<modifier><width><specifier>, where <modifier> and <width> are optional.
<modifier>
glibc-style modifiers can be used before the specifier (here marked as z):
%-z- no padding
%_z- pad with spaces
%0z- pad with zeros
%^z- convert to upper case
%#z- convert to lower case (consistently, unlike glibc)
<width>
Width digits can also be used after any modifiers and before the specifier (here marked as z), for example:
%4z- pad to 4 characters (with default padding character)
%_12z- pad with spaces to 12 characters
<specifier>
For all types (note these three are done by formatTime, not by formatCharacter):
%%%%t- tab
%n- newline
TimeZone
For TimeZone (and ZonedTime and UTCTime):
%z- timezone offset in the format
-HHMM. %Z- timezone name
LocalTime
For LocalTime (and ZonedTime and UTCTime and UniversalTime):
%c- as
dateTimeFmtlocale(e.g.%a %b %e %H:%M:%S %Z %Y)
TimeOfDay
For TimeOfDay (and LocalTime and ZonedTime and UTCTime and UniversalTime):
%R- same as
%H:%M %T- same as
%H:%M:%S %X- as
timeFmtlocale(e.g.%H:%M:%S) %r- as
time12Fmtlocale(e.g.%I:%M:%S %p) %P- day-half of day from (
amPmlocale), converted to lowercase,am,pm %p- day-half of day from (
amPmlocale),AM,PM %H- hour of day (24-hour), 0-padded to two chars,
00-23 %k- hour of day (24-hour), space-padded to two chars,
0-23 %I- hour of day-half (12-hour), 0-padded to two chars,
01-12 %l- hour of day-half (12-hour), space-padded to two chars,
1-12 %M- minute of hour, 0-padded to two chars,
00-59 %S- second of minute (without decimal part), 0-padded to two chars,
00-60 %q- picosecond of second, 0-padded to twelve chars,
000000000000-999999999999. %Q- decimal point and fraction of second, up to 12 second decimals, without trailing zeros.
For a whole number of seconds,
%Qomits the decimal point unless padding is specified.
UTCTime and ZonedTime
%s- number of whole seconds since the Unix epoch. For times before
the Unix epoch, this is a negative number. Note that in
%s.%qand%s%Qthe decimals are positive, not negative. For example, 0.9 seconds before the Unix epoch is formatted as-1.1with%s%Q.
Day
For Day (and LocalTime and ZonedTime and UTCTime and UniversalTime):
%D- same as
%m/%d/%y %F- same as
%Y-%m-%d %x- as
dateFmtlocale(e.g.%m/%d/%y) %Y- year, no padding. Note
%0Yand%_Ypad to four chars %y- year of century, 0-padded to two chars,
00-99 %C- century, no padding. Note
%0Cand%_Cpad to two chars %B- month name, long form (
fstfrommonthslocale),January-December %b,%h- month name, short form (
sndfrommonthslocale),Jan-Dec %m- month of year, 0-padded to two chars,
01-12 %d- day of month, 0-padded to two chars,
01-31 %e- day of month, space-padded to two chars,
1-31 %j- day of year, 0-padded to three chars,
001-366 %f- century for Week Date format, no padding. Note
%0fand%_fpad to two chars %V- week of year for Week Date format, 0-padded to two chars,
01-53 %u- day of week for Week Date format,
1-7 %a- day of week, short form (
sndfromwDayslocale),Sun-Sat %A- day of week, long form (
fstfromwDayslocale),Sunday-Saturday %U- week of year where weeks start on Sunday (as
sundayStartWeek), 0-padded to two chars,00-53 %w- day of week number,
0(= Sunday) -6(= Saturday) %W- week of year where weeks start on Monday (as
mondayStartWeek), 0-padded to two chars,00-53
primToPrim :: (PrimBase m1, PrimMonad m2, PrimState m1 ~ PrimState m2) => m1 a -> m2 a #
Convert a PrimBase to another monad with the same state token.
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.
newtype ReaderT r (m :: k -> Type) (a :: k) :: forall k. Type -> (k -> Type) -> k -> Type #
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
Arguments
| :: MonadReader r m | |
| => (r -> a) | The selector function to apply to the environment. |
| -> m a |
Retrieves a function of the current environment.
A difference list is a function that, given a list, returns the original contents of the difference list prepended to the given list.
This structure supports O(1) append and snoc operations on lists, making it
very useful for append-heavy uses (esp. left-nested uses of ++), such
as logging and pretty printing.
Here is an example using DList as the state type when printing a tree with the Writer monad:
import Control.Monad.Writer
import Data.DList
data Tree a = Leaf a | Branch (Tree a) (Tree a)
flatten_writer :: Tree x -> DList x
flatten_writer = snd . runWriter . flatten
where
flatten (Leaf x) = tell (singleton x)
flatten (Branch x y) = flatten x >> flatten yInstances
| Monad DList | |
| Functor DList | |
| Applicative DList | |
| Foldable DList | |
Defined in Data.DList Methods fold :: Monoid m => DList m -> 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 # | |
| MonadPlus DList | |
| Alternative DList | |
| IsList (DList a) | |
| Eq a => Eq (DList a) | |
| Ord a => Ord (DList a) | |
| Read a => Read (DList a) | |
| Show a => Show (DList a) | |
| a ~ Char => IsString (DList a) | |
Defined in Data.DList Methods fromString :: String -> DList a # | |
| Semigroup (DList a) | |
| Monoid (DList a) | |
| NFData a => NFData (DList a) | |
Defined in Data.DList | |
| type Item (DList a) | |
Defined in Data.DList | |
| type Element (DList a) | |
Defined in Data.MonoTraversable.Instances | |
| type Index (DList a) | |
Defined in Data.MonoTraversable.Instances | |
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
($!!) :: 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
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
lift :: (MonadTrans t, Monad m) => m a -> t m a #
Lift a computation from the argument monad to the constructed monad.