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
- minBound :: a
- maxBound :: a
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
- (==) :: a -> a -> Bool
- (/=) :: a -> a -> Bool
class Fractional a => Floating a where
- pi :: a
- exp :: a -> a
- log :: a -> a
- sqrt :: a -> a
- (**) :: a -> a -> a
- logBase :: a -> a -> a
- sin :: a -> a
- cos :: a -> a
- tan :: a -> a
- asin :: a -> a
- acos :: a -> a
- atan :: a -> a
- sinh :: a -> a
- cosh :: a -> a
- tanh :: a -> a
- asinh :: a -> a
- acosh :: a -> a
- atanh :: a -> a
class Num a => Fractional a where
- (/) :: a -> a -> a
- recip :: a -> a
- fromRational :: Rational -> a
class (Real a, Enum a) => Integral a where
- quot :: a -> a -> a
- rem :: a -> a -> a
- div :: a -> a -> a
- mod :: a -> a -> a
- quotRem :: a -> a -> (a, a)
- divMod :: a -> a -> (a, a)
- toInteger :: a -> Integer
class Applicative m => Monad (m :: Type -> Type) where
- (>>=) :: m a -> (a -> m b) -> m b
- (>>) :: m a -> m b -> m b
- return :: a -> m a
- fail :: String -> m a
class Functor (f :: Type -> Type) where
- fmap :: (a -> b) -> f a -> f b
- (<$) :: a -> f b -> f a
class Num a where
- (+) :: a -> a -> a
- (-) :: a -> a -> a
- (*) :: a -> a -> a
- negate :: a -> a
- abs :: a -> a
- signum :: a -> a
- fromInteger :: Integer -> a
class Eq a => Ord a where
- compare :: a -> a -> Ordering
- (<) :: a -> a -> Bool
- (<=) :: a -> a -> Bool
- (>) :: a -> a -> Bool
- (>=) :: a -> a -> Bool
- max :: a -> a -> a
- min :: a -> a -> a
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
- properFraction :: Integral b => a -> (b, a)
- truncate :: Integral b => a -> b
- round :: Integral b => a -> b
- ceiling :: Integral b => a -> b
- floor :: Integral b => a -> b
class Show a where
- showsPrec :: Int -> a -> ShowS
- show :: a -> String
- showList :: [a] -> ShowS
class Typeable (a :: k)
class IsString a where
- fromString :: String -> a
class Functor f => Applicative (f :: Type -> Type) where
- pure :: a -> f a
- (<*>) :: f (a -> b) -> f a -> f b
- liftA2 :: (a -> b -> c) -> f a -> f b -> f c
- (*>) :: f a -> f b -> f b
- (<*) :: f a -> f b -> f a
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
- (<>) :: a -> a -> a
- sconcat :: NonEmpty a -> a
- stimes :: Integral b => b -> a -> a
class Semigroup a => Monoid a where
- mempty :: a
- mappend :: a -> a -> a
- mconcat :: [a] -> a
data Bool
- = False
- | True
data Char
data Double
data Float
data Int
data Int32
data Int64
data Integer
data Maybe a
- = Nothing
- | Just a
data Ordering
- = LT
- | EQ
- | GT
type Rational = Ratio Integer
data RealWorld :: Type
data IO a
data Word
data Word8
data Word32
data Word64
data Either a b
- = Left a
- | Right 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
- mzero :: m a
- mplus :: m a -> m a -> m a
class Applicative f => Alternative (f :: Type -> Type) where
- empty :: f a
- (<|>) :: f a -> f a -> f a
- some :: f a -> f [a]
- many :: f a -> f [a]
(=<<) :: 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
- bimap :: (a -> b) -> (c -> d) -> p a c -> p b d
- first :: (a -> b) -> p a c -> p b c
- second :: (b -> c) -> p a b -> p a c
class Monad m => MonadIO (m :: Type -> Type) where
- liftIO :: IO a -> m a
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
- = NoBuffering
- | LineBuffering
- | BlockBuffering (Maybe Int)
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
- = ReadMode
- | WriteMode
- | AppendMode
- | ReadWriteMode
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
- Handler :: forall (m :: Type -> Type) a e. Exception e => (e -> m a) -> Handler m a
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 {
- unliftIO :: forall a. m a -> IO a
}
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 PrimState (m :: Type -> Type) :: Type
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
- popBack :: (PrimMonad m, PrimState m ~ MCState c) => c -> m (Maybe (CollElement c))
class MutableCollection c => MutablePushFront c where
- pushFront :: (PrimMonad m, PrimState m ~ MCState c) => c -> CollElement c -> m ()
class MutableCollection c => MutablePopFront c where
- popFront :: (PrimMonad m, PrimState m ~ MCState c) => c -> m (Maybe (CollElement c))
class MutableContainer c => MutableCollection c where
- type CollElement c :: Type
- newColl :: (PrimMonad m, PrimState m ~ MCState c) => m c
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
- type MCState c :: Type
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
- oextract :: mono -> Element mono
- oextend :: (mono -> Element mono) -> mono -> mono
class MonoPointed mono where
- opoint :: Element mono -> mono
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
- omap :: (Element mono -> Element mono) -> mono -> mono
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
- type KeySet set :: Type
- keysSet :: set -> KeySet set
class MonoFunctor mono => MonoZip mono where
- ozipWith :: (Element mono -> Element mono -> Element mono) -> mono -> mono -> mono
- ozip :: mono -> mono -> [(Element mono, Element mono)]
- ounzip :: [(Element mono, Element mono)] -> (mono, mono)
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
- type Index seq :: Type
- intersperse :: Element seq -> seq -> seq
- reverse :: seq -> seq
- find :: (Element seq -> Bool) -> seq -> Maybe (Element seq)
- sortBy :: (Element seq -> Element seq -> Ordering) -> seq -> seq
- cons :: Element seq -> seq -> seq
- snoc :: seq -> Element seq -> seq
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 {
- toModifiedJulianDay :: Integer
}
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 :: Type -> Type) a = 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

seq :: a -> b -> b #

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.

fst :: (a, b) -> a #

Extract the first component of a pair.

snd :: (a, b) -> b #

Extract the second component of a pair.

otherwise :: Bool #

otherwise is defined as the value True. It helps to make guards more readable. eg.

 f x | x < 0     = ...
     | otherwise = ...

assert :: Bool -> a -> a #

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 $ x). However, $ 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) xs, or zipWith ($) 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

Expand

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) otherwise. For example:

>>> 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

Expand

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

to run an STM transaction and the IO action it returns.

class Bounded a where #

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.

Methods

minBound :: a #

maxBound :: a #

Instances

Bounded Bool	Since: base-2.1
Instance details Defined in GHC.Enum Methods minBound :: Bool # maxBound :: Bool #
Bounded Char	Since: base-2.1
Instance details Defined in GHC.Enum Methods minBound :: Char # maxBound :: Char #
Bounded Int	Since: base-2.1
Instance details Defined in GHC.Enum Methods minBound :: Int # maxBound :: Int #
Bounded Int8	Since: base-2.1
Instance details Defined in GHC.Int Methods minBound :: Int8 # maxBound :: Int8 #
Bounded Int16	Since: base-2.1
Instance details Defined in GHC.Int Methods minBound :: Int16 # maxBound :: Int16 #
Bounded Int32	Since: base-2.1
Instance details Defined in GHC.Int Methods minBound :: Int32 # maxBound :: Int32 #
Bounded Int64	Since: base-2.1
Instance details Defined in GHC.Int Methods minBound :: Int64 # maxBound :: Int64 #
Bounded Ordering	Since: base-2.1
Instance details Defined in GHC.Enum Methods minBound :: Ordering # maxBound :: Ordering #
Bounded Word	Since: base-2.1
Instance details Defined in GHC.Enum Methods minBound :: Word # maxBound :: Word #
Bounded Word8	Since: base-2.1
Instance details Defined in GHC.Word Methods minBound :: Word8 # maxBound :: Word8 #
Bounded Word16	Since: base-2.1
Instance details Defined in GHC.Word Methods minBound :: Word16 # maxBound :: Word16 #
Bounded Word32	Since: base-2.1
Instance details Defined in GHC.Word Methods minBound :: Word32 # maxBound :: Word32 #
Bounded Word64	Since: base-2.1
Instance details Defined in GHC.Word Methods minBound :: Word64 # maxBound :: Word64 #
Bounded VecCount	Since: base-4.10.0.0
Instance details Defined in GHC.Enum Methods minBound :: VecCount # maxBound :: VecCount #
Bounded VecElem	Since: base-4.10.0.0
Instance details Defined in GHC.Enum Methods minBound :: VecElem # maxBound :: VecElem #
Bounded ()	Since: base-2.1
Instance details Defined in GHC.Enum Methods minBound :: () # maxBound :: () #
Bounded Any	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods minBound :: Any # maxBound :: Any #
Bounded All	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods minBound :: All # maxBound :: All #
Bounded Associativity	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods minBound :: Associativity # maxBound :: Associativity #
Bounded SourceUnpackedness	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods minBound :: SourceUnpackedness # maxBound :: SourceUnpackedness #
Bounded SourceStrictness	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods minBound :: SourceStrictness # maxBound :: SourceStrictness #
Bounded DecidedStrictness	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods minBound :: DecidedStrictness # maxBound :: DecidedStrictness #
Bounded CChar
Instance details Defined in Foreign.C.Types Methods minBound :: CChar # maxBound :: CChar #
Bounded CSChar
Instance details Defined in Foreign.C.Types Methods minBound :: CSChar # maxBound :: CSChar #
Bounded CUChar
Instance details Defined in Foreign.C.Types Methods minBound :: CUChar # maxBound :: CUChar #
Bounded CShort
Instance details Defined in Foreign.C.Types Methods minBound :: CShort # maxBound :: CShort #
Bounded CUShort
Instance details Defined in Foreign.C.Types Methods minBound :: CUShort # maxBound :: CUShort #
Bounded CInt
Instance details Defined in Foreign.C.Types Methods minBound :: CInt # maxBound :: CInt #
Bounded CUInt
Instance details Defined in Foreign.C.Types Methods minBound :: CUInt # maxBound :: CUInt #
Bounded CLong
Instance details Defined in Foreign.C.Types Methods minBound :: CLong # maxBound :: CLong #
Bounded CULong
Instance details Defined in Foreign.C.Types Methods minBound :: CULong # maxBound :: CULong #
Bounded CLLong
Instance details Defined in Foreign.C.Types Methods minBound :: CLLong # maxBound :: CLLong #
Bounded CULLong
Instance details Defined in Foreign.C.Types Methods minBound :: CULLong # maxBound :: CULLong #
Bounded CBool
Instance details Defined in Foreign.C.Types Methods minBound :: CBool # maxBound :: CBool #
Bounded CPtrdiff
Instance details Defined in Foreign.C.Types Methods minBound :: CPtrdiff # maxBound :: CPtrdiff #
Bounded CSize
Instance details Defined in Foreign.C.Types Methods minBound :: CSize # maxBound :: CSize #
Bounded CWchar
Instance details Defined in Foreign.C.Types Methods minBound :: CWchar # maxBound :: CWchar #
Bounded CSigAtomic
Instance details Defined in Foreign.C.Types Methods minBound :: CSigAtomic # maxBound :: CSigAtomic #
Bounded CIntPtr
Instance details Defined in Foreign.C.Types Methods minBound :: CIntPtr # maxBound :: CIntPtr #
Bounded CUIntPtr
Instance details Defined in Foreign.C.Types Methods minBound :: CUIntPtr # maxBound :: CUIntPtr #
Bounded CIntMax
Instance details Defined in Foreign.C.Types Methods minBound :: CIntMax # maxBound :: CIntMax #
Bounded CUIntMax
Instance details Defined in Foreign.C.Types Methods minBound :: CUIntMax # maxBound :: CUIntMax #
Bounded GeneralCategory	Since: base-2.1
Instance details Defined in GHC.Unicode Methods minBound :: GeneralCategory # maxBound :: GeneralCategory #
Bounded AttrOpTag
Instance details Defined in Data.GI.Base.Attributes Methods minBound :: AttrOpTag # maxBound :: AttrOpTag #
Bounded a => Bounded (Last a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods minBound :: Last a # maxBound :: Last a #
Bounded a => Bounded (Min a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods minBound :: Min a # maxBound :: Min a #
Bounded a => Bounded (Max a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods minBound :: Max a # maxBound :: Max a #
Bounded a => Bounded (First a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods minBound :: First a # maxBound :: First a #
Bounded m => Bounded (WrappedMonoid m)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods minBound :: WrappedMonoid m # maxBound :: WrappedMonoid m #
Bounded a => Bounded (Identity a)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Identity Methods minBound :: Identity a # maxBound :: Identity a #
Bounded a => Bounded (Dual a)	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods minBound :: Dual a # maxBound :: Dual a #
Bounded a => Bounded (Sum a)	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods minBound :: Sum a # maxBound :: Sum a #
Bounded a => Bounded (Product a)	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods minBound :: Product a # maxBound :: Product a #
(Bounded a, Bounded b) => Bounded (a, b)	Since: base-2.1
Instance details Defined in GHC.Enum Methods minBound :: (a, b) # maxBound :: (a, b) #
Bounded (Proxy t)	Since: base-4.7.0.0
Instance details Defined in Data.Proxy Methods minBound :: Proxy t # maxBound :: Proxy t #
(Bounded a, Bounded b, Bounded c) => Bounded (a, b, c)	Since: base-2.1
Instance details Defined in GHC.Enum Methods minBound :: (a, b, c) # maxBound :: (a, b, c) #
Bounded a => Bounded (Const a b)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Const Methods minBound :: Const a b # maxBound :: Const a b #
(Applicative f, Bounded a) => Bounded (Ap f a)	Since: base-4.12.0.0
Instance details Defined in Data.Monoid Methods minBound :: Ap f a # maxBound :: Ap f a #
a ~ b => Bounded (a :~: b)	Since: base-4.7.0.0
Instance details Defined in Data.Type.Equality Methods minBound :: a :~: b # maxBound :: a :~: b #
Bounded b => Bounded (Tagged s b)
Instance details Defined in Data.Tagged Methods minBound :: Tagged s b # maxBound :: Tagged s b #
(Bounded a, Bounded b, Bounded c, Bounded d) => Bounded (a, b, c, d)	Since: base-2.1
Instance details Defined in GHC.Enum Methods minBound :: (a, b, c, d) # maxBound :: (a, b, c, d) #
a ~~ b => Bounded (a :~~: b)	Since: base-4.10.0.0
Instance details Defined in Data.Type.Equality Methods minBound :: a :~~: b # maxBound :: a :~~: b #
(Bounded a, Bounded b, Bounded c, Bounded d, Bounded e) => Bounded (a, b, c, d, e)	Since: base-2.1
Instance details Defined in GHC.Enum Methods minBound :: (a, b, c, d, e) # maxBound :: (a, b, c, d, e) #
(Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f) => Bounded (a, b, c, d, e, f)	Since: base-2.1
Instance details Defined in GHC.Enum Methods minBound :: (a, b, c, d, e, f) # maxBound :: (a, b, c, d, e, f) #
(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
Instance details Defined in GHC.Enum Methods minBound :: (a, b, c, d, e, f, g) # maxBound :: (a, b, c, d, e, f, g) #
(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
Instance details Defined in GHC.Enum Methods minBound :: (a, b, c, d, e, f, g, h) # maxBound :: (a, b, c, d, e, f, g, h) #
(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
Instance details Defined in GHC.Enum Methods minBound :: (a, b, c, d, e, f, g, h, i) # maxBound :: (a, b, c, d, e, f, g, h, i) #
(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
Instance details Defined in GHC.Enum Methods minBound :: (a, b, c, d, e, f, g, h, i, j) # maxBound :: (a, b, c, d, e, f, g, h, i, j) #
(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
Instance details Defined in GHC.Enum Methods minBound :: (a, b, c, d, e, f, g, h, i, j, k) # maxBound :: (a, b, c, d, e, f, g, h, i, j, k) #
(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
Instance details Defined in GHC.Enum Methods minBound :: (a, b, c, d, e, f, g, h, i, j, k, l) # maxBound :: (a, b, c, d, e, f, g, h, i, j, k, l) #
(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
Instance details Defined in GHC.Enum Methods minBound :: (a, b, c, d, e, f, g, h, i, j, k, l, m) # maxBound :: (a, b, c, d, e, f, g, h, i, j, k, l, m) #
(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
Instance details Defined in GHC.Enum Methods minBound :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n) # maxBound :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n) #
(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
Instance details Defined in GHC.Enum Methods minBound :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) # maxBound :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) #

class Enum a where #

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 succ maxBound and pred minBound should result in a runtime error.
fromEnum and toEnum should give a runtime error if the result value is not representable in the result type. For example, toEnum 7 :: Bool is an error.
enumFrom and enumFromThen should 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                = minBound

Minimal complete definition

toEnum, fromEnum

Methods

succ :: a -> a #

the successor of a value. For numeric types, succ adds 1.

pred :: a -> a #

the predecessor of a value. For numeric types, pred subtracts 1.

toEnum :: Int -> a #

Convert from an Int.

fromEnum :: a -> 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.

enumFrom :: a -> [a] #

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

Enum Bool	Since: base-2.1
Instance details Defined in GHC.Enum Methods succ :: Bool -> Bool # pred :: Bool -> Bool # toEnum :: Int -> Bool # fromEnum :: Bool -> Int # enumFrom :: Bool -> [Bool] # enumFromThen :: Bool -> Bool -> [Bool] # enumFromTo :: Bool -> Bool -> [Bool] # enumFromThenTo :: Bool -> Bool -> Bool -> [Bool] #
Enum Char	Since: base-2.1
Instance details Defined in GHC.Enum Methods succ :: Char -> Char # pred :: Char -> Char # toEnum :: Int -> Char # fromEnum :: Char -> Int # enumFrom :: Char -> [Char] # enumFromThen :: Char -> Char -> [Char] # enumFromTo :: Char -> Char -> [Char] # enumFromThenTo :: Char -> Char -> Char -> [Char] #
Enum Int	Since: base-2.1
Instance details Defined in GHC.Enum Methods succ :: Int -> Int # pred :: Int -> Int # toEnum :: Int -> Int # fromEnum :: Int -> Int # enumFrom :: Int -> [Int] # enumFromThen :: Int -> Int -> [Int] # enumFromTo :: Int -> Int -> [Int] # enumFromThenTo :: Int -> Int -> Int -> [Int] #
Enum Int8	Since: base-2.1
Instance details Defined in GHC.Int Methods succ :: Int8 -> Int8 # pred :: Int8 -> Int8 # toEnum :: Int -> Int8 # fromEnum :: Int8 -> Int # enumFrom :: Int8 -> [Int8] # enumFromThen :: Int8 -> Int8 -> [Int8] # enumFromTo :: Int8 -> Int8 -> [Int8] # enumFromThenTo :: Int8 -> Int8 -> Int8 -> [Int8] #
Enum Int16	Since: base-2.1
Instance details Defined in GHC.Int Methods succ :: Int16 -> Int16 # pred :: Int16 -> Int16 # toEnum :: Int -> Int16 # fromEnum :: Int16 -> Int # enumFrom :: Int16 -> [Int16] # enumFromThen :: Int16 -> Int16 -> [Int16] # enumFromTo :: Int16 -> Int16 -> [Int16] # enumFromThenTo :: Int16 -> Int16 -> Int16 -> [Int16] #
Enum Int32	Since: base-2.1
Instance details Defined in GHC.Int Methods succ :: Int32 -> Int32 # pred :: Int32 -> Int32 # toEnum :: Int -> Int32 # fromEnum :: Int32 -> Int # enumFrom :: Int32 -> [Int32] # enumFromThen :: Int32 -> Int32 -> [Int32] # enumFromTo :: Int32 -> Int32 -> [Int32] # enumFromThenTo :: Int32 -> Int32 -> Int32 -> [Int32] #
Enum Int64	Since: base-2.1
Instance details Defined in GHC.Int Methods succ :: Int64 -> Int64 # pred :: Int64 -> Int64 # toEnum :: Int -> Int64 # fromEnum :: Int64 -> Int # enumFrom :: Int64 -> [Int64] # enumFromThen :: Int64 -> Int64 -> [Int64] # enumFromTo :: Int64 -> Int64 -> [Int64] # enumFromThenTo :: Int64 -> Int64 -> Int64 -> [Int64] #
Enum Integer	Since: base-2.1
Instance details Defined in GHC.Enum Methods succ :: Integer -> Integer # pred :: Integer -> Integer # toEnum :: Int -> Integer # fromEnum :: Integer -> Int # enumFrom :: Integer -> [Integer] # enumFromThen :: Integer -> Integer -> [Integer] # enumFromTo :: Integer -> Integer -> [Integer] # enumFromThenTo :: Integer -> Integer -> Integer -> [Integer] #
Enum Natural	Since: base-4.8.0.0
Instance details Defined in GHC.Enum Methods succ :: Natural -> Natural # pred :: Natural -> Natural # toEnum :: Int -> Natural # fromEnum :: Natural -> Int # enumFrom :: Natural -> [Natural] # enumFromThen :: Natural -> Natural -> [Natural] # enumFromTo :: Natural -> Natural -> [Natural] # enumFromThenTo :: Natural -> Natural -> Natural -> [Natural] #
Enum Ordering	Since: base-2.1
Instance details Defined in GHC.Enum Methods succ :: Ordering -> Ordering # pred :: Ordering -> Ordering # toEnum :: Int -> Ordering # fromEnum :: Ordering -> Int # enumFrom :: Ordering -> [Ordering] # enumFromThen :: Ordering -> Ordering -> [Ordering] # enumFromTo :: Ordering -> Ordering -> [Ordering] # enumFromThenTo :: Ordering -> Ordering -> Ordering -> [Ordering] #
Enum Word	Since: base-2.1
Instance details Defined in GHC.Enum Methods succ :: Word -> Word # pred :: Word -> Word # toEnum :: Int -> Word # fromEnum :: Word -> Int # enumFrom :: Word -> [Word] # enumFromThen :: Word -> Word -> [Word] # enumFromTo :: Word -> Word -> [Word] # enumFromThenTo :: Word -> Word -> Word -> [Word] #
Enum Word8	Since: base-2.1
Instance details Defined in GHC.Word Methods succ :: Word8 -> Word8 # pred :: Word8 -> Word8 # toEnum :: Int -> Word8 # fromEnum :: Word8 -> Int # enumFrom :: Word8 -> [Word8] # enumFromThen :: Word8 -> Word8 -> [Word8] # enumFromTo :: Word8 -> Word8 -> [Word8] # enumFromThenTo :: Word8 -> Word8 -> Word8 -> [Word8] #
Enum Word16	Since: base-2.1
Instance details Defined in GHC.Word Methods succ :: Word16 -> Word16 # pred :: Word16 -> Word16 # toEnum :: Int -> Word16 # fromEnum :: Word16 -> Int # enumFrom :: Word16 -> [Word16] # enumFromThen :: Word16 -> Word16 -> [Word16] # enumFromTo :: Word16 -> Word16 -> [Word16] # enumFromThenTo :: Word16 -> Word16 -> Word16 -> [Word16] #
Enum Word32	Since: base-2.1
Instance details Defined in GHC.Word Methods succ :: Word32 -> Word32 # pred :: Word32 -> Word32 # toEnum :: Int -> Word32 # fromEnum :: Word32 -> Int # enumFrom :: Word32 -> [Word32] # enumFromThen :: Word32 -> Word32 -> [Word32] # enumFromTo :: Word32 -> Word32 -> [Word32] # enumFromThenTo :: Word32 -> Word32 -> Word32 -> [Word32] #
Enum Word64	Since: base-2.1
Instance details Defined in GHC.Word Methods succ :: Word64 -> Word64 # pred :: Word64 -> Word64 # toEnum :: Int -> Word64 # fromEnum :: Word64 -> Int # enumFrom :: Word64 -> [Word64] # enumFromThen :: Word64 -> Word64 -> [Word64] # enumFromTo :: Word64 -> Word64 -> [Word64] # enumFromThenTo :: Word64 -> Word64 -> Word64 -> [Word64] #
Enum VecCount	Since: base-4.10.0.0
Instance details Defined in GHC.Enum Methods succ :: VecCount -> VecCount # pred :: VecCount -> VecCount # toEnum :: Int -> VecCount # fromEnum :: VecCount -> Int # enumFrom :: VecCount -> [VecCount] # enumFromThen :: VecCount -> VecCount -> [VecCount] # enumFromTo :: VecCount -> VecCount -> [VecCount] # enumFromThenTo :: VecCount -> VecCount -> VecCount -> [VecCount] #
Enum VecElem	Since: base-4.10.0.0
Instance details Defined in GHC.Enum Methods succ :: VecElem -> VecElem # pred :: VecElem -> VecElem # toEnum :: Int -> VecElem # fromEnum :: VecElem -> Int # enumFrom :: VecElem -> [VecElem] # enumFromThen :: VecElem -> VecElem -> [VecElem] # enumFromTo :: VecElem -> VecElem -> [VecElem] # enumFromThenTo :: VecElem -> VecElem -> VecElem -> [VecElem] #
Enum ()	Since: base-2.1
Instance details Defined in GHC.Enum Methods succ :: () -> () # pred :: () -> () # toEnum :: Int -> () # fromEnum :: () -> Int # enumFrom :: () -> [()] # enumFromThen :: () -> () -> [()] # enumFromTo :: () -> () -> [()] # enumFromThenTo :: () -> () -> () -> [()] #
Enum SeekMode	Since: base-4.2.0.0
Instance details Defined in GHC.IO.Device Methods succ :: SeekMode -> SeekMode # pred :: SeekMode -> SeekMode # toEnum :: Int -> SeekMode # fromEnum :: SeekMode -> Int # enumFrom :: SeekMode -> [SeekMode] # enumFromThen :: SeekMode -> SeekMode -> [SeekMode] # enumFromTo :: SeekMode -> SeekMode -> [SeekMode] # enumFromThenTo :: SeekMode -> SeekMode -> SeekMode -> [SeekMode] #
Enum Associativity	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods succ :: Associativity -> Associativity # pred :: Associativity -> Associativity # toEnum :: Int -> Associativity # fromEnum :: Associativity -> Int # enumFrom :: Associativity -> [Associativity] # enumFromThen :: Associativity -> Associativity -> [Associativity] # enumFromTo :: Associativity -> Associativity -> [Associativity] # enumFromThenTo :: Associativity -> Associativity -> Associativity -> [Associativity] #
Enum SourceUnpackedness	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods succ :: SourceUnpackedness -> SourceUnpackedness # pred :: SourceUnpackedness -> SourceUnpackedness # toEnum :: Int -> SourceUnpackedness # fromEnum :: SourceUnpackedness -> Int # enumFrom :: SourceUnpackedness -> [SourceUnpackedness] # enumFromThen :: SourceUnpackedness -> SourceUnpackedness -> [SourceUnpackedness] # enumFromTo :: SourceUnpackedness -> SourceUnpackedness -> [SourceUnpackedness] # enumFromThenTo :: SourceUnpackedness -> SourceUnpackedness -> SourceUnpackedness -> [SourceUnpackedness] #
Enum SourceStrictness	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods succ :: SourceStrictness -> SourceStrictness # pred :: SourceStrictness -> SourceStrictness # toEnum :: Int -> SourceStrictness # fromEnum :: SourceStrictness -> Int # enumFrom :: SourceStrictness -> [SourceStrictness] # enumFromThen :: SourceStrictness -> SourceStrictness -> [SourceStrictness] # enumFromTo :: SourceStrictness -> SourceStrictness -> [SourceStrictness] # enumFromThenTo :: SourceStrictness -> SourceStrictness -> SourceStrictness -> [SourceStrictness] #
Enum DecidedStrictness	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods succ :: DecidedStrictness -> DecidedStrictness # pred :: DecidedStrictness -> DecidedStrictness # toEnum :: Int -> DecidedStrictness # fromEnum :: DecidedStrictness -> Int # enumFrom :: DecidedStrictness -> [DecidedStrictness] # enumFromThen :: DecidedStrictness -> DecidedStrictness -> [DecidedStrictness] # enumFromTo :: DecidedStrictness -> DecidedStrictness -> [DecidedStrictness] # enumFromThenTo :: DecidedStrictness -> DecidedStrictness -> DecidedStrictness -> [DecidedStrictness] #
Enum CChar
Instance details Defined in Foreign.C.Types Methods succ :: CChar -> CChar # pred :: CChar -> CChar # toEnum :: Int -> CChar # fromEnum :: CChar -> Int # enumFrom :: CChar -> [CChar] # enumFromThen :: CChar -> CChar -> [CChar] # enumFromTo :: CChar -> CChar -> [CChar] # enumFromThenTo :: CChar -> CChar -> CChar -> [CChar] #
Enum CSChar
Instance details Defined in Foreign.C.Types Methods succ :: CSChar -> CSChar # pred :: CSChar -> CSChar # toEnum :: Int -> CSChar # fromEnum :: CSChar -> Int # enumFrom :: CSChar -> [CSChar] # enumFromThen :: CSChar -> CSChar -> [CSChar] # enumFromTo :: CSChar -> CSChar -> [CSChar] # enumFromThenTo :: CSChar -> CSChar -> CSChar -> [CSChar] #
Enum CUChar
Instance details Defined in Foreign.C.Types Methods succ :: CUChar -> CUChar # pred :: CUChar -> CUChar # toEnum :: Int -> CUChar # fromEnum :: CUChar -> Int # enumFrom :: CUChar -> [CUChar] # enumFromThen :: CUChar -> CUChar -> [CUChar] # enumFromTo :: CUChar -> CUChar -> [CUChar] # enumFromThenTo :: CUChar -> CUChar -> CUChar -> [CUChar] #
Enum CShort
Instance details Defined in Foreign.C.Types Methods succ :: CShort -> CShort # pred :: CShort -> CShort # toEnum :: Int -> CShort # fromEnum :: CShort -> Int # enumFrom :: CShort -> [CShort] # enumFromThen :: CShort -> CShort -> [CShort] # enumFromTo :: CShort -> CShort -> [CShort] # enumFromThenTo :: CShort -> CShort -> CShort -> [CShort] #
Enum CUShort
Instance details Defined in Foreign.C.Types Methods succ :: CUShort -> CUShort # pred :: CUShort -> CUShort # toEnum :: Int -> CUShort # fromEnum :: CUShort -> Int # enumFrom :: CUShort -> [CUShort] # enumFromThen :: CUShort -> CUShort -> [CUShort] # enumFromTo :: CUShort -> CUShort -> [CUShort] # enumFromThenTo :: CUShort -> CUShort -> CUShort -> [CUShort] #
Enum CInt
Instance details Defined in Foreign.C.Types Methods succ :: CInt -> CInt # pred :: CInt -> CInt # toEnum :: Int -> CInt # fromEnum :: CInt -> Int # enumFrom :: CInt -> [CInt] # enumFromThen :: CInt -> CInt -> [CInt] # enumFromTo :: CInt -> CInt -> [CInt] # enumFromThenTo :: CInt -> CInt -> CInt -> [CInt] #
Enum CUInt
Instance details Defined in Foreign.C.Types Methods succ :: CUInt -> CUInt # pred :: CUInt -> CUInt # toEnum :: Int -> CUInt # fromEnum :: CUInt -> Int # enumFrom :: CUInt -> [CUInt] # enumFromThen :: CUInt -> CUInt -> [CUInt] # enumFromTo :: CUInt -> CUInt -> [CUInt] # enumFromThenTo :: CUInt -> CUInt -> CUInt -> [CUInt] #
Enum CLong
Instance details Defined in Foreign.C.Types Methods succ :: CLong -> CLong # pred :: CLong -> CLong # toEnum :: Int -> CLong # fromEnum :: CLong -> Int # enumFrom :: CLong -> [CLong] # enumFromThen :: CLong -> CLong -> [CLong] # enumFromTo :: CLong -> CLong -> [CLong] # enumFromThenTo :: CLong -> CLong -> CLong -> [CLong] #
Enum CULong
Instance details Defined in Foreign.C.Types Methods succ :: CULong -> CULong # pred :: CULong -> CULong # toEnum :: Int -> CULong # fromEnum :: CULong -> Int # enumFrom :: CULong -> [CULong] # enumFromThen :: CULong -> CULong -> [CULong] # enumFromTo :: CULong -> CULong -> [CULong] # enumFromThenTo :: CULong -> CULong -> CULong -> [CULong] #
Enum CLLong
Instance details Defined in Foreign.C.Types Methods succ :: CLLong -> CLLong # pred :: CLLong -> CLLong # toEnum :: Int -> CLLong # fromEnum :: CLLong -> Int # enumFrom :: CLLong -> [CLLong] # enumFromThen :: CLLong -> CLLong -> [CLLong] # enumFromTo :: CLLong -> CLLong -> [CLLong] # enumFromThenTo :: CLLong -> CLLong -> CLLong -> [CLLong] #
Enum CULLong
Instance details Defined in Foreign.C.Types Methods succ :: CULLong -> CULLong # pred :: CULLong -> CULLong # toEnum :: Int -> CULLong # fromEnum :: CULLong -> Int # enumFrom :: CULLong -> [CULLong] # enumFromThen :: CULLong -> CULLong -> [CULLong] # enumFromTo :: CULLong -> CULLong -> [CULLong] # enumFromThenTo :: CULLong -> CULLong -> CULLong -> [CULLong] #
Enum CBool
Instance details Defined in Foreign.C.Types Methods succ :: CBool -> CBool # pred :: CBool -> CBool # toEnum :: Int -> CBool # fromEnum :: CBool -> Int # enumFrom :: CBool -> [CBool] # enumFromThen :: CBool -> CBool -> [CBool] # enumFromTo :: CBool -> CBool -> [CBool] # enumFromThenTo :: CBool -> CBool -> CBool -> [CBool] #
Enum CFloat
Instance details Defined in Foreign.C.Types Methods succ :: CFloat -> CFloat # pred :: CFloat -> CFloat # toEnum :: Int -> CFloat # fromEnum :: CFloat -> Int # enumFrom :: CFloat -> [CFloat] # enumFromThen :: CFloat -> CFloat -> [CFloat] # enumFromTo :: CFloat -> CFloat -> [CFloat] # enumFromThenTo :: CFloat -> CFloat -> CFloat -> [CFloat] #
Enum CDouble
Instance details Defined in Foreign.C.Types Methods succ :: CDouble -> CDouble # pred :: CDouble -> CDouble # toEnum :: Int -> CDouble # fromEnum :: CDouble -> Int # enumFrom :: CDouble -> [CDouble] # enumFromThen :: CDouble -> CDouble -> [CDouble] # enumFromTo :: CDouble -> CDouble -> [CDouble] # enumFromThenTo :: CDouble -> CDouble -> CDouble -> [CDouble] #
Enum CPtrdiff
Instance details Defined in Foreign.C.Types Methods succ :: CPtrdiff -> CPtrdiff # pred :: CPtrdiff -> CPtrdiff # toEnum :: Int -> CPtrdiff # fromEnum :: CPtrdiff -> Int # enumFrom :: CPtrdiff -> [CPtrdiff] # enumFromThen :: CPtrdiff -> CPtrdiff -> [CPtrdiff] # enumFromTo :: CPtrdiff -> CPtrdiff -> [CPtrdiff] # enumFromThenTo :: CPtrdiff -> CPtrdiff -> CPtrdiff -> [CPtrdiff] #
Enum CSize
Instance details Defined in Foreign.C.Types Methods succ :: CSize -> CSize # pred :: CSize -> CSize # toEnum :: Int -> CSize # fromEnum :: CSize -> Int # enumFrom :: CSize -> [CSize] # enumFromThen :: CSize -> CSize -> [CSize] # enumFromTo :: CSize -> CSize -> [CSize] # enumFromThenTo :: CSize -> CSize -> CSize -> [CSize] #
Enum CWchar
Instance details Defined in Foreign.C.Types Methods succ :: CWchar -> CWchar # pred :: CWchar -> CWchar # toEnum :: Int -> CWchar # fromEnum :: CWchar -> Int # enumFrom :: CWchar -> [CWchar] # enumFromThen :: CWchar -> CWchar -> [CWchar] # enumFromTo :: CWchar -> CWchar -> [CWchar] # enumFromThenTo :: CWchar -> CWchar -> CWchar -> [CWchar] #
Enum CSigAtomic
Instance details Defined in Foreign.C.Types Methods succ :: CSigAtomic -> CSigAtomic # pred :: CSigAtomic -> CSigAtomic # toEnum :: Int -> CSigAtomic # fromEnum :: CSigAtomic -> Int # enumFrom :: CSigAtomic -> [CSigAtomic] # enumFromThen :: CSigAtomic -> CSigAtomic -> [CSigAtomic] # enumFromTo :: CSigAtomic -> CSigAtomic -> [CSigAtomic] # enumFromThenTo :: CSigAtomic -> CSigAtomic -> CSigAtomic -> [CSigAtomic] #
Enum CClock
Instance details Defined in Foreign.C.Types Methods succ :: CClock -> CClock # pred :: CClock -> CClock # toEnum :: Int -> CClock # fromEnum :: CClock -> Int # enumFrom :: CClock -> [CClock] # enumFromThen :: CClock -> CClock -> [CClock] # enumFromTo :: CClock -> CClock -> [CClock] # enumFromThenTo :: CClock -> CClock -> CClock -> [CClock] #
Enum CTime
Instance details Defined in Foreign.C.Types Methods succ :: CTime -> CTime # pred :: CTime -> CTime # toEnum :: Int -> CTime # fromEnum :: CTime -> Int # enumFrom :: CTime -> [CTime] # enumFromThen :: CTime -> CTime -> [CTime] # enumFromTo :: CTime -> CTime -> [CTime] # enumFromThenTo :: CTime -> CTime -> CTime -> [CTime] #
Enum CUSeconds
Instance details Defined in Foreign.C.Types Methods succ :: CUSeconds -> CUSeconds # pred :: CUSeconds -> CUSeconds # toEnum :: Int -> CUSeconds # fromEnum :: CUSeconds -> Int # enumFrom :: CUSeconds -> [CUSeconds] # enumFromThen :: CUSeconds -> CUSeconds -> [CUSeconds] # enumFromTo :: CUSeconds -> CUSeconds -> [CUSeconds] # enumFromThenTo :: CUSeconds -> CUSeconds -> CUSeconds -> [CUSeconds] #
Enum CSUSeconds
Instance details Defined in Foreign.C.Types Methods succ :: CSUSeconds -> CSUSeconds # pred :: CSUSeconds -> CSUSeconds # toEnum :: Int -> CSUSeconds # fromEnum :: CSUSeconds -> Int # enumFrom :: CSUSeconds -> [CSUSeconds] # enumFromThen :: CSUSeconds -> CSUSeconds -> [CSUSeconds] # enumFromTo :: CSUSeconds -> CSUSeconds -> [CSUSeconds] # enumFromThenTo :: CSUSeconds -> CSUSeconds -> CSUSeconds -> [CSUSeconds] #
Enum CIntPtr
Instance details Defined in Foreign.C.Types Methods succ :: CIntPtr -> CIntPtr # pred :: CIntPtr -> CIntPtr # toEnum :: Int -> CIntPtr # fromEnum :: CIntPtr -> Int # enumFrom :: CIntPtr -> [CIntPtr] # enumFromThen :: CIntPtr -> CIntPtr -> [CIntPtr] # enumFromTo :: CIntPtr -> CIntPtr -> [CIntPtr] # enumFromThenTo :: CIntPtr -> CIntPtr -> CIntPtr -> [CIntPtr] #
Enum CUIntPtr
Instance details Defined in Foreign.C.Types Methods succ :: CUIntPtr -> CUIntPtr # pred :: CUIntPtr -> CUIntPtr # toEnum :: Int -> CUIntPtr # fromEnum :: CUIntPtr -> Int # enumFrom :: CUIntPtr -> [CUIntPtr] # enumFromThen :: CUIntPtr -> CUIntPtr -> [CUIntPtr] # enumFromTo :: CUIntPtr -> CUIntPtr -> [CUIntPtr] # enumFromThenTo :: CUIntPtr -> CUIntPtr -> CUIntPtr -> [CUIntPtr] #
Enum CIntMax
Instance details Defined in Foreign.C.Types Methods succ :: CIntMax -> CIntMax # pred :: CIntMax -> CIntMax # toEnum :: Int -> CIntMax # fromEnum :: CIntMax -> Int # enumFrom :: CIntMax -> [CIntMax] # enumFromThen :: CIntMax -> CIntMax -> [CIntMax] # enumFromTo :: CIntMax -> CIntMax -> [CIntMax] # enumFromThenTo :: CIntMax -> CIntMax -> CIntMax -> [CIntMax] #
Enum CUIntMax
Instance details Defined in Foreign.C.Types Methods succ :: CUIntMax -> CUIntMax # pred :: CUIntMax -> CUIntMax # toEnum :: Int -> CUIntMax # fromEnum :: CUIntMax -> Int # enumFrom :: CUIntMax -> [CUIntMax] # enumFromThen :: CUIntMax -> CUIntMax -> [CUIntMax] # enumFromTo :: CUIntMax -> CUIntMax -> [CUIntMax] # enumFromThenTo :: CUIntMax -> CUIntMax -> CUIntMax -> [CUIntMax] #
Enum IOMode	Since: base-4.2.0.0
Instance details Defined in GHC.IO.IOMode Methods succ :: IOMode -> IOMode # pred :: IOMode -> IOMode # toEnum :: Int -> IOMode # fromEnum :: IOMode -> Int # enumFrom :: IOMode -> [IOMode] # enumFromThen :: IOMode -> IOMode -> [IOMode] # enumFromTo :: IOMode -> IOMode -> [IOMode] # enumFromThenTo :: IOMode -> IOMode -> IOMode -> [IOMode] #
Enum GeneralCategory	Since: base-2.1
Instance details Defined in GHC.Unicode Methods succ :: GeneralCategory -> GeneralCategory # pred :: GeneralCategory -> GeneralCategory # toEnum :: Int -> GeneralCategory # fromEnum :: GeneralCategory -> Int # enumFrom :: GeneralCategory -> [GeneralCategory] # enumFromThen :: GeneralCategory -> GeneralCategory -> [GeneralCategory] # enumFromTo :: GeneralCategory -> GeneralCategory -> [GeneralCategory] # enumFromThenTo :: GeneralCategory -> GeneralCategory -> GeneralCategory -> [GeneralCategory] #
Enum Day
Instance details Defined in Data.Time.Calendar.Days Methods succ :: Day -> Day # pred :: Day -> Day # toEnum :: Int -> Day # fromEnum :: Day -> Int # enumFrom :: Day -> [Day] # enumFromThen :: Day -> Day -> [Day] # enumFromTo :: Day -> Day -> [Day] # enumFromThenTo :: Day -> Day -> Day -> [Day] #
Enum Extension
Instance details Defined in GHC.LanguageExtensions.Type Methods succ :: Extension -> Extension # pred :: Extension -> Extension # toEnum :: Int -> Extension # fromEnum :: Extension -> Int # enumFrom :: Extension -> [Extension] # enumFromThen :: Extension -> Extension -> [Extension] # enumFromTo :: Extension -> Extension -> [Extension] # enumFromThenTo :: Extension -> Extension -> Extension -> [Extension] #
Enum WindowState
Instance details Defined in GI.Gdk.Flags Methods succ :: WindowState -> WindowState # pred :: WindowState -> WindowState # toEnum :: Int -> WindowState # fromEnum :: WindowState -> Int # enumFrom :: WindowState -> [WindowState] # enumFromThen :: WindowState -> WindowState -> [WindowState] # enumFromTo :: WindowState -> WindowState -> [WindowState] # enumFromThenTo :: WindowState -> WindowState -> WindowState -> [WindowState] #
Enum WindowHints
Instance details Defined in GI.Gdk.Flags Methods succ :: WindowHints -> WindowHints # pred :: WindowHints -> WindowHints # toEnum :: Int -> WindowHints # fromEnum :: WindowHints -> Int # enumFrom :: WindowHints -> [WindowHints] # enumFromThen :: WindowHints -> WindowHints -> [WindowHints] # enumFromTo :: WindowHints -> WindowHints -> [WindowHints] # enumFromThenTo :: WindowHints -> WindowHints -> WindowHints -> [WindowHints] #
Enum WindowAttributesType
Instance details Defined in GI.Gdk.Flags Methods succ :: WindowAttributesType -> WindowAttributesType # pred :: WindowAttributesType -> WindowAttributesType # toEnum :: Int -> WindowAttributesType # fromEnum :: WindowAttributesType -> Int # enumFrom :: WindowAttributesType -> [WindowAttributesType] # enumFromThen :: WindowAttributesType -> WindowAttributesType -> [WindowAttributesType] # enumFromTo :: WindowAttributesType -> WindowAttributesType -> [WindowAttributesType] # enumFromThenTo :: WindowAttributesType -> WindowAttributesType -> WindowAttributesType -> [WindowAttributesType] #
Enum WMFunction
Instance details Defined in GI.Gdk.Flags Methods succ :: WMFunction -> WMFunction # pred :: WMFunction -> WMFunction # toEnum :: Int -> WMFunction # fromEnum :: WMFunction -> Int # enumFrom :: WMFunction -> [WMFunction] # enumFromThen :: WMFunction -> WMFunction -> [WMFunction] # enumFromTo :: WMFunction -> WMFunction -> [WMFunction] # enumFromThenTo :: WMFunction -> WMFunction -> WMFunction -> [WMFunction] #
Enum WMDecoration
Instance details Defined in GI.Gdk.Flags Methods succ :: WMDecoration -> WMDecoration # pred :: WMDecoration -> WMDecoration # toEnum :: Int -> WMDecoration # fromEnum :: WMDecoration -> Int # enumFrom :: WMDecoration -> [WMDecoration] # enumFromThen :: WMDecoration -> WMDecoration -> [WMDecoration] # enumFromTo :: WMDecoration -> WMDecoration -> [WMDecoration] # enumFromThenTo :: WMDecoration -> WMDecoration -> WMDecoration -> [WMDecoration] #
Enum SeatCapabilities
Instance details Defined in GI.Gdk.Flags Methods succ :: SeatCapabilities -> SeatCapabilities # pred :: SeatCapabilities -> SeatCapabilities # toEnum :: Int -> SeatCapabilities # fromEnum :: SeatCapabilities -> Int # enumFrom :: SeatCapabilities -> [SeatCapabilities] # enumFromThen :: SeatCapabilities -> SeatCapabilities -> [SeatCapabilities] # enumFromTo :: SeatCapabilities -> SeatCapabilities -> [SeatCapabilities] # enumFromThenTo :: SeatCapabilities -> SeatCapabilities -> SeatCapabilities -> [SeatCapabilities] #
Enum ModifierType
Instance details Defined in GI.Gdk.Flags Methods succ :: ModifierType -> ModifierType # pred :: ModifierType -> ModifierType # toEnum :: Int -> ModifierType # fromEnum :: ModifierType -> Int # enumFrom :: ModifierType -> [ModifierType] # enumFromThen :: ModifierType -> ModifierType -> [ModifierType] # enumFromTo :: ModifierType -> ModifierType -> [ModifierType] # enumFromThenTo :: ModifierType -> ModifierType -> ModifierType -> [ModifierType] #
Enum FrameClockPhase
Instance details Defined in GI.Gdk.Flags Methods succ :: FrameClockPhase -> FrameClockPhase # pred :: FrameClockPhase -> FrameClockPhase # toEnum :: Int -> FrameClockPhase # fromEnum :: FrameClockPhase -> Int # enumFrom :: FrameClockPhase -> [FrameClockPhase] # enumFromThen :: FrameClockPhase -> FrameClockPhase -> [FrameClockPhase] # enumFromTo :: FrameClockPhase -> FrameClockPhase -> [FrameClockPhase] # enumFromThenTo :: FrameClockPhase -> FrameClockPhase -> FrameClockPhase -> [FrameClockPhase] #
Enum EventMask
Instance details Defined in GI.Gdk.Flags Methods succ :: EventMask -> EventMask # pred :: EventMask -> EventMask # toEnum :: Int -> EventMask # fromEnum :: EventMask -> Int # enumFrom :: EventMask -> [EventMask] # enumFromThen :: EventMask -> EventMask -> [EventMask] # enumFromTo :: EventMask -> EventMask -> [EventMask] # enumFromThenTo :: EventMask -> EventMask -> EventMask -> [EventMask] #
Enum DragAction
Instance details Defined in GI.Gdk.Flags Methods succ :: DragAction -> DragAction # pred :: DragAction -> DragAction # toEnum :: Int -> DragAction # fromEnum :: DragAction -> Int # enumFrom :: DragAction -> [DragAction] # enumFromThen :: DragAction -> DragAction -> [DragAction] # enumFromTo :: DragAction -> DragAction -> [DragAction] # enumFromThenTo :: DragAction -> DragAction -> DragAction -> [DragAction] #
Enum AxisFlags
Instance details Defined in GI.Gdk.Flags Methods succ :: AxisFlags -> AxisFlags # pred :: AxisFlags -> AxisFlags # toEnum :: Int -> AxisFlags # fromEnum :: AxisFlags -> Int # enumFrom :: AxisFlags -> [AxisFlags] # enumFromThen :: AxisFlags -> AxisFlags -> [AxisFlags] # enumFromTo :: AxisFlags -> AxisFlags -> [AxisFlags] # enumFromThenTo :: AxisFlags -> AxisFlags -> AxisFlags -> [AxisFlags] #
Enum AnchorHints
Instance details Defined in GI.Gdk.Flags Methods succ :: AnchorHints -> AnchorHints # pred :: AnchorHints -> AnchorHints # toEnum :: Int -> AnchorHints # fromEnum :: AnchorHints -> Int # enumFrom :: AnchorHints -> [AnchorHints] # enumFromThen :: AnchorHints -> AnchorHints -> [AnchorHints] # enumFromTo :: AnchorHints -> AnchorHints -> [AnchorHints] # enumFromThenTo :: AnchorHints -> AnchorHints -> AnchorHints -> [AnchorHints] #
Enum WindowWindowClass
Instance details Defined in GI.Gdk.Enums Methods succ :: WindowWindowClass -> WindowWindowClass # pred :: WindowWindowClass -> WindowWindowClass # toEnum :: Int -> WindowWindowClass # fromEnum :: WindowWindowClass -> Int # enumFrom :: WindowWindowClass -> [WindowWindowClass] # enumFromThen :: WindowWindowClass -> WindowWindowClass -> [WindowWindowClass] # enumFromTo :: WindowWindowClass -> WindowWindowClass -> [WindowWindowClass] # enumFromThenTo :: WindowWindowClass -> WindowWindowClass -> WindowWindowClass -> [WindowWindowClass] #
Enum WindowTypeHint
Instance details Defined in GI.Gdk.Enums Methods succ :: WindowTypeHint -> WindowTypeHint # pred :: WindowTypeHint -> WindowTypeHint # toEnum :: Int -> WindowTypeHint # fromEnum :: WindowTypeHint -> Int # enumFrom :: WindowTypeHint -> [WindowTypeHint] # enumFromThen :: WindowTypeHint -> WindowTypeHint -> [WindowTypeHint] # enumFromTo :: WindowTypeHint -> WindowTypeHint -> [WindowTypeHint] # enumFromThenTo :: WindowTypeHint -> WindowTypeHint -> WindowTypeHint -> [WindowTypeHint] #
Enum WindowType
Instance details Defined in GI.Gdk.Enums Methods succ :: WindowType -> WindowType # pred :: WindowType -> WindowType # toEnum :: Int -> WindowType # fromEnum :: WindowType -> Int # enumFrom :: WindowType -> [WindowType] # enumFromThen :: WindowType -> WindowType -> [WindowType] # enumFromTo :: WindowType -> WindowType -> [WindowType] # enumFromThenTo :: WindowType -> WindowType -> WindowType -> [WindowType] #
Enum WindowEdge
Instance details Defined in GI.Gdk.Enums Methods succ :: WindowEdge -> WindowEdge # pred :: WindowEdge -> WindowEdge # toEnum :: Int -> WindowEdge # fromEnum :: WindowEdge -> Int # enumFrom :: WindowEdge -> [WindowEdge] # enumFromThen :: WindowEdge -> WindowEdge -> [WindowEdge] # enumFromTo :: WindowEdge -> WindowEdge -> [WindowEdge] # enumFromThenTo :: WindowEdge -> WindowEdge -> WindowEdge -> [WindowEdge] #
Enum VisualType
Instance details Defined in GI.Gdk.Enums Methods succ :: VisualType -> VisualType # pred :: VisualType -> VisualType # toEnum :: Int -> VisualType # fromEnum :: VisualType -> Int # enumFrom :: VisualType -> [VisualType] # enumFromThen :: VisualType -> VisualType -> [VisualType] # enumFromTo :: VisualType -> VisualType -> [VisualType] # enumFromThenTo :: VisualType -> VisualType -> VisualType -> [VisualType] #
Enum VisibilityState
Instance details Defined in GI.Gdk.Enums Methods succ :: VisibilityState -> VisibilityState # pred :: VisibilityState -> VisibilityState # toEnum :: Int -> VisibilityState # fromEnum :: VisibilityState -> Int # enumFrom :: VisibilityState -> [VisibilityState] # enumFromThen :: VisibilityState -> VisibilityState -> [VisibilityState] # enumFromTo :: VisibilityState -> VisibilityState -> [VisibilityState] # enumFromThenTo :: VisibilityState -> VisibilityState -> VisibilityState -> [VisibilityState] #
Enum TouchpadGesturePhase
Instance details Defined in GI.Gdk.Enums Methods succ :: TouchpadGesturePhase -> TouchpadGesturePhase # pred :: TouchpadGesturePhase -> TouchpadGesturePhase # toEnum :: Int -> TouchpadGesturePhase # fromEnum :: TouchpadGesturePhase -> Int # enumFrom :: TouchpadGesturePhase -> [TouchpadGesturePhase] # enumFromThen :: TouchpadGesturePhase -> TouchpadGesturePhase -> [TouchpadGesturePhase] # enumFromTo :: TouchpadGesturePhase -> TouchpadGesturePhase -> [TouchpadGesturePhase] # enumFromThenTo :: TouchpadGesturePhase -> TouchpadGesturePhase -> TouchpadGesturePhase -> [TouchpadGesturePhase] #
Enum SubpixelLayout
Instance details Defined in GI.Gdk.Enums Methods succ :: SubpixelLayout -> SubpixelLayout # pred :: SubpixelLayout -> SubpixelLayout # toEnum :: Int -> SubpixelLayout # fromEnum :: SubpixelLayout -> Int # enumFrom :: SubpixelLayout -> [SubpixelLayout] # enumFromThen :: SubpixelLayout -> SubpixelLayout -> [SubpixelLayout] # enumFromTo :: SubpixelLayout -> SubpixelLayout -> [SubpixelLayout] # enumFromThenTo :: SubpixelLayout -> SubpixelLayout -> SubpixelLayout -> [SubpixelLayout] #
Enum Status
Instance details Defined in GI.Gdk.Enums Methods succ :: Status -> Status # pred :: Status -> Status # toEnum :: Int -> Status # fromEnum :: Status -> Int # enumFrom :: Status -> [Status] # enumFromThen :: Status -> Status -> [Status] # enumFromTo :: Status -> Status -> [Status] # enumFromThenTo :: Status -> Status -> Status -> [Status] #
Enum SettingAction
Instance details Defined in GI.Gdk.Enums Methods succ :: SettingAction -> SettingAction # pred :: SettingAction -> SettingAction # toEnum :: Int -> SettingAction # fromEnum :: SettingAction -> Int # enumFrom :: SettingAction -> [SettingAction] # enumFromThen :: SettingAction -> SettingAction -> [SettingAction] # enumFromTo :: SettingAction -> SettingAction -> [SettingAction] # enumFromThenTo :: SettingAction -> SettingAction -> SettingAction -> [SettingAction] #
Enum ScrollDirection
Instance details Defined in GI.Gdk.Enums Methods succ :: ScrollDirection -> ScrollDirection # pred :: ScrollDirection -> ScrollDirection # toEnum :: Int -> ScrollDirection # fromEnum :: ScrollDirection -> Int # enumFrom :: ScrollDirection -> [ScrollDirection] # enumFromThen :: ScrollDirection -> ScrollDirection -> [ScrollDirection] # enumFromTo :: ScrollDirection -> ScrollDirection -> [ScrollDirection] # enumFromThenTo :: ScrollDirection -> ScrollDirection -> ScrollDirection -> [ScrollDirection] #
Enum PropertyState
Instance details Defined in GI.Gdk.Enums Methods succ :: PropertyState -> PropertyState # pred :: PropertyState -> PropertyState # toEnum :: Int -> PropertyState # fromEnum :: PropertyState -> Int # enumFrom :: PropertyState -> [PropertyState] # enumFromThen :: PropertyState -> PropertyState -> [PropertyState] # enumFromTo :: PropertyState -> PropertyState -> [PropertyState] # enumFromThenTo :: PropertyState -> PropertyState -> PropertyState -> [PropertyState] #
Enum PropMode
Instance details Defined in GI.Gdk.Enums Methods succ :: PropMode -> PropMode # pred :: PropMode -> PropMode # toEnum :: Int -> PropMode # fromEnum :: PropMode -> Int # enumFrom :: PropMode -> [PropMode] # enumFromThen :: PropMode -> PropMode -> [PropMode] # enumFromTo :: PropMode -> PropMode -> [PropMode] # enumFromThenTo :: PropMode -> PropMode -> PropMode -> [PropMode] #
Enum OwnerChange
Instance details Defined in GI.Gdk.Enums Methods succ :: OwnerChange -> OwnerChange # pred :: OwnerChange -> OwnerChange # toEnum :: Int -> OwnerChange # fromEnum :: OwnerChange -> Int # enumFrom :: OwnerChange -> [OwnerChange] # enumFromThen :: OwnerChange -> OwnerChange -> [OwnerChange] # enumFromTo :: OwnerChange -> OwnerChange -> [OwnerChange] # enumFromThenTo :: OwnerChange -> OwnerChange -> OwnerChange -> [OwnerChange] #
Enum NotifyType
Instance details Defined in GI.Gdk.Enums Methods succ :: NotifyType -> NotifyType # pred :: NotifyType -> NotifyType # toEnum :: Int -> NotifyType # fromEnum :: NotifyType -> Int # enumFrom :: NotifyType -> [NotifyType] # enumFromThen :: NotifyType -> NotifyType -> [NotifyType] # enumFromTo :: NotifyType -> NotifyType -> [NotifyType] # enumFromThenTo :: NotifyType -> NotifyType -> NotifyType -> [NotifyType] #
Enum ModifierIntent
Instance details Defined in GI.Gdk.Enums Methods succ :: ModifierIntent -> ModifierIntent # pred :: ModifierIntent -> ModifierIntent # toEnum :: Int -> ModifierIntent # fromEnum :: ModifierIntent -> Int # enumFrom :: ModifierIntent -> [ModifierIntent] # enumFromThen :: ModifierIntent -> ModifierIntent -> [ModifierIntent] # enumFromTo :: ModifierIntent -> ModifierIntent -> [ModifierIntent] # enumFromThenTo :: ModifierIntent -> ModifierIntent -> ModifierIntent -> [ModifierIntent] #
Enum InputSource
Instance details Defined in GI.Gdk.Enums Methods succ :: InputSource -> InputSource # pred :: InputSource -> InputSource # toEnum :: Int -> InputSource # fromEnum :: InputSource -> Int # enumFrom :: InputSource -> [InputSource] # enumFromThen :: InputSource -> InputSource -> [InputSource] # enumFromTo :: InputSource -> InputSource -> [InputSource] # enumFromThenTo :: InputSource -> InputSource -> InputSource -> [InputSource] #
Enum InputMode
Instance details Defined in GI.Gdk.Enums Methods succ :: InputMode -> InputMode # pred :: InputMode -> InputMode # toEnum :: Int -> InputMode # fromEnum :: InputMode -> Int # enumFrom :: InputMode -> [InputMode] # enumFromThen :: InputMode -> InputMode -> [InputMode] # enumFromTo :: InputMode -> InputMode -> [InputMode] # enumFromThenTo :: InputMode -> InputMode -> InputMode -> [InputMode] #
Enum Gravity
Instance details Defined in GI.Gdk.Enums Methods succ :: Gravity -> Gravity # pred :: Gravity -> Gravity # toEnum :: Int -> Gravity # fromEnum :: Gravity -> Int # enumFrom :: Gravity -> [Gravity] # enumFromThen :: Gravity -> Gravity -> [Gravity] # enumFromTo :: Gravity -> Gravity -> [Gravity] # enumFromThenTo :: Gravity -> Gravity -> Gravity -> [Gravity] #
Enum GrabStatus
Instance details Defined in GI.Gdk.Enums Methods succ :: GrabStatus -> GrabStatus # pred :: GrabStatus -> GrabStatus # toEnum :: Int -> GrabStatus # fromEnum :: GrabStatus -> Int # enumFrom :: GrabStatus -> [GrabStatus] # enumFromThen :: GrabStatus -> GrabStatus -> [GrabStatus] # enumFromTo :: GrabStatus -> GrabStatus -> [GrabStatus] # enumFromThenTo :: GrabStatus -> GrabStatus -> GrabStatus -> [GrabStatus] #
Enum GrabOwnership
Instance details Defined in GI.Gdk.Enums Methods succ :: GrabOwnership -> GrabOwnership # pred :: GrabOwnership -> GrabOwnership # toEnum :: Int -> GrabOwnership # fromEnum :: GrabOwnership -> Int # enumFrom :: GrabOwnership -> [GrabOwnership] # enumFromThen :: GrabOwnership -> GrabOwnership -> [GrabOwnership] # enumFromTo :: GrabOwnership -> GrabOwnership -> [GrabOwnership] # enumFromThenTo :: GrabOwnership -> GrabOwnership -> GrabOwnership -> [GrabOwnership] #
Enum GLError
Instance details Defined in GI.Gdk.Enums Methods succ :: GLError -> GLError # pred :: GLError -> GLError # toEnum :: Int -> GLError # fromEnum :: GLError -> Int # enumFrom :: GLError -> [GLError] # enumFromThen :: GLError -> GLError -> [GLError] # enumFromTo :: GLError -> GLError -> [GLError] # enumFromThenTo :: GLError -> GLError -> GLError -> [GLError] #
Enum FullscreenMode
Instance details Defined in GI.Gdk.Enums Methods succ :: FullscreenMode -> FullscreenMode # pred :: FullscreenMode -> FullscreenMode # toEnum :: Int -> FullscreenMode # fromEnum :: FullscreenMode -> Int # enumFrom :: FullscreenMode -> [FullscreenMode] # enumFromThen :: FullscreenMode -> FullscreenMode -> [FullscreenMode] # enumFromTo :: FullscreenMode -> FullscreenMode -> [FullscreenMode] # enumFromThenTo :: FullscreenMode -> FullscreenMode -> FullscreenMode -> [FullscreenMode] #
Enum FilterReturn
Instance details Defined in GI.Gdk.Enums Methods succ :: FilterReturn -> FilterReturn # pred :: FilterReturn -> FilterReturn # toEnum :: Int -> FilterReturn # fromEnum :: FilterReturn -> Int # enumFrom :: FilterReturn -> [FilterReturn] # enumFromThen :: FilterReturn -> FilterReturn -> [FilterReturn] # enumFromTo :: FilterReturn -> FilterReturn -> [FilterReturn] # enumFromThenTo :: FilterReturn -> FilterReturn -> FilterReturn -> [FilterReturn] #
Enum EventType
Instance details Defined in GI.Gdk.Enums Methods succ :: EventType -> EventType # pred :: EventType -> EventType # toEnum :: Int -> EventType # fromEnum :: EventType -> Int # enumFrom :: EventType -> [EventType] # enumFromThen :: EventType -> EventType -> [EventType] # enumFromTo :: EventType -> EventType -> [EventType] # enumFromThenTo :: EventType -> EventType -> EventType -> [EventType] #
Enum DragProtocol
Instance details Defined in GI.Gdk.Enums Methods succ :: DragProtocol -> DragProtocol # pred :: DragProtocol -> DragProtocol # toEnum :: Int -> DragProtocol # fromEnum :: DragProtocol -> Int # enumFrom :: DragProtocol -> [DragProtocol] # enumFromThen :: DragProtocol -> DragProtocol -> [DragProtocol] # enumFromTo :: DragProtocol -> DragProtocol -> [DragProtocol] # enumFromThenTo :: DragProtocol -> DragProtocol -> DragProtocol -> [DragProtocol] #
Enum DragCancelReason
Instance details Defined in GI.Gdk.Enums Methods succ :: DragCancelReason -> DragCancelReason # pred :: DragCancelReason -> DragCancelReason # toEnum :: Int -> DragCancelReason # fromEnum :: DragCancelReason -> Int # enumFrom :: DragCancelReason -> [DragCancelReason] # enumFromThen :: DragCancelReason -> DragCancelReason -> [DragCancelReason] # enumFromTo :: DragCancelReason -> DragCancelReason -> [DragCancelReason] # enumFromThenTo :: DragCancelReason -> DragCancelReason -> DragCancelReason -> [DragCancelReason] #
Enum DeviceType
Instance details Defined in GI.Gdk.Enums Methods succ :: DeviceType -> DeviceType # pred :: DeviceType -> DeviceType # toEnum :: Int -> DeviceType # fromEnum :: DeviceType -> Int # enumFrom :: DeviceType -> [DeviceType] # enumFromThen :: DeviceType -> DeviceType -> [DeviceType] # enumFromTo :: DeviceType -> DeviceType -> [DeviceType] # enumFromThenTo :: DeviceType -> DeviceType -> DeviceType -> [DeviceType] #
Enum DeviceToolType
Instance details Defined in GI.Gdk.Enums Methods succ :: DeviceToolType -> DeviceToolType # pred :: DeviceToolType -> DeviceToolType # toEnum :: Int -> DeviceToolType # fromEnum :: DeviceToolType -> Int # enumFrom :: DeviceToolType -> [DeviceToolType] # enumFromThen :: DeviceToolType -> DeviceToolType -> [DeviceToolType] # enumFromTo :: DeviceToolType -> DeviceToolType -> [DeviceToolType] # enumFromThenTo :: DeviceToolType -> DeviceToolType -> DeviceToolType -> [DeviceToolType] #
Enum DevicePadFeature
Instance details Defined in GI.Gdk.Enums Methods succ :: DevicePadFeature -> DevicePadFeature # pred :: DevicePadFeature -> DevicePadFeature # toEnum :: Int -> DevicePadFeature # fromEnum :: DevicePadFeature -> Int # enumFrom :: DevicePadFeature -> [DevicePadFeature] # enumFromThen :: DevicePadFeature -> DevicePadFeature -> [DevicePadFeature] # enumFromTo :: DevicePadFeature -> DevicePadFeature -> [DevicePadFeature] # enumFromThenTo :: DevicePadFeature -> DevicePadFeature -> DevicePadFeature -> [DevicePadFeature] #
Enum CursorType
Instance details Defined in GI.Gdk.Enums Methods succ :: CursorType -> CursorType # pred :: CursorType -> CursorType # toEnum :: Int -> CursorType # fromEnum :: CursorType -> Int # enumFrom :: CursorType -> [CursorType] # enumFromThen :: CursorType -> CursorType -> [CursorType] # enumFromTo :: CursorType -> CursorType -> [CursorType] # enumFromThenTo :: CursorType -> CursorType -> CursorType -> [CursorType] #
Enum CrossingMode
Instance details Defined in GI.Gdk.Enums Methods succ :: CrossingMode -> CrossingMode # pred :: CrossingMode -> CrossingMode # toEnum :: Int -> CrossingMode # fromEnum :: CrossingMode -> Int # enumFrom :: CrossingMode -> [CrossingMode] # enumFromThen :: CrossingMode -> CrossingMode -> [CrossingMode] # enumFromTo :: CrossingMode -> CrossingMode -> [CrossingMode] # enumFromThenTo :: CrossingMode -> CrossingMode -> CrossingMode -> [CrossingMode] #
Enum ByteOrder
Instance details Defined in GI.Gdk.Enums Methods succ :: ByteOrder -> ByteOrder # pred :: ByteOrder -> ByteOrder # toEnum :: Int -> ByteOrder # fromEnum :: ByteOrder -> Int # enumFrom :: ByteOrder -> [ByteOrder] # enumFromThen :: ByteOrder -> ByteOrder -> [ByteOrder] # enumFromTo :: ByteOrder -> ByteOrder -> [ByteOrder] # enumFromThenTo :: ByteOrder -> ByteOrder -> ByteOrder -> [ByteOrder] #
Enum AxisUse
Instance details Defined in GI.Gdk.Enums Methods succ :: AxisUse -> AxisUse # pred :: AxisUse -> AxisUse # toEnum :: Int -> AxisUse # fromEnum :: AxisUse -> Int # enumFrom :: AxisUse -> [AxisUse] # enumFromThen :: AxisUse -> AxisUse -> [AxisUse] # enumFromTo :: AxisUse -> AxisUse -> [AxisUse] # enumFromThenTo :: AxisUse -> AxisUse -> AxisUse -> [AxisUse] #
Enum TlsPasswordFlags
Instance details Defined in GI.Gio.Flags Methods succ :: TlsPasswordFlags -> TlsPasswordFlags # pred :: TlsPasswordFlags -> TlsPasswordFlags # toEnum :: Int -> TlsPasswordFlags # fromEnum :: TlsPasswordFlags -> Int # enumFrom :: TlsPasswordFlags -> [TlsPasswordFlags] # enumFromThen :: TlsPasswordFlags -> TlsPasswordFlags -> [TlsPasswordFlags] # enumFromTo :: TlsPasswordFlags -> TlsPasswordFlags -> [TlsPasswordFlags] # enumFromThenTo :: TlsPasswordFlags -> TlsPasswordFlags -> TlsPasswordFlags -> [TlsPasswordFlags] #
Enum TlsDatabaseVerifyFlags
Instance details Defined in GI.Gio.Flags Methods succ :: TlsDatabaseVerifyFlags -> TlsDatabaseVerifyFlags # pred :: TlsDatabaseVerifyFlags -> TlsDatabaseVerifyFlags # toEnum :: Int -> TlsDatabaseVerifyFlags # fromEnum :: TlsDatabaseVerifyFlags -> Int # enumFrom :: TlsDatabaseVerifyFlags -> [TlsDatabaseVerifyFlags] # enumFromThen :: TlsDatabaseVerifyFlags -> TlsDatabaseVerifyFlags -> [TlsDatabaseVerifyFlags] # enumFromTo :: TlsDatabaseVerifyFlags -> TlsDatabaseVerifyFlags -> [TlsDatabaseVerifyFlags] # enumFromThenTo :: TlsDatabaseVerifyFlags -> TlsDatabaseVerifyFlags -> TlsDatabaseVerifyFlags -> [TlsDatabaseVerifyFlags] #
Enum TlsCertificateFlags
Instance details Defined in GI.Gio.Flags Methods succ :: TlsCertificateFlags -> TlsCertificateFlags # pred :: TlsCertificateFlags -> TlsCertificateFlags # toEnum :: Int -> TlsCertificateFlags # fromEnum :: TlsCertificateFlags -> Int # enumFrom :: TlsCertificateFlags -> [TlsCertificateFlags] # enumFromThen :: TlsCertificateFlags -> TlsCertificateFlags -> [TlsCertificateFlags] # enumFromTo :: TlsCertificateFlags -> TlsCertificateFlags -> [TlsCertificateFlags] # enumFromThenTo :: TlsCertificateFlags -> TlsCertificateFlags -> TlsCertificateFlags -> [TlsCertificateFlags] #
Enum TestDBusFlags
Instance details Defined in GI.Gio.Flags Methods succ :: TestDBusFlags -> TestDBusFlags # pred :: TestDBusFlags -> TestDBusFlags # toEnum :: Int -> TestDBusFlags # fromEnum :: TestDBusFlags -> Int # enumFrom :: TestDBusFlags -> [TestDBusFlags] # enumFromThen :: TestDBusFlags -> TestDBusFlags -> [TestDBusFlags] # enumFromTo :: TestDBusFlags -> TestDBusFlags -> [TestDBusFlags] # enumFromThenTo :: TestDBusFlags -> TestDBusFlags -> TestDBusFlags -> [TestDBusFlags] #
Enum SubprocessFlags
Instance details Defined in GI.Gio.Flags Methods succ :: SubprocessFlags -> SubprocessFlags # pred :: SubprocessFlags -> SubprocessFlags # toEnum :: Int -> SubprocessFlags # fromEnum :: SubprocessFlags -> Int # enumFrom :: SubprocessFlags -> [SubprocessFlags] # enumFromThen :: SubprocessFlags -> SubprocessFlags -> [SubprocessFlags] # enumFromTo :: SubprocessFlags -> SubprocessFlags -> [SubprocessFlags] # enumFromThenTo :: SubprocessFlags -> SubprocessFlags -> SubprocessFlags -> [SubprocessFlags] #
Enum SocketMsgFlags
Instance details Defined in GI.Gio.Flags Methods succ :: SocketMsgFlags -> SocketMsgFlags # pred :: SocketMsgFlags -> SocketMsgFlags # toEnum :: Int -> SocketMsgFlags # fromEnum :: SocketMsgFlags -> Int # enumFrom :: SocketMsgFlags -> [SocketMsgFlags] # enumFromThen :: SocketMsgFlags -> SocketMsgFlags -> [SocketMsgFlags] # enumFromTo :: SocketMsgFlags -> SocketMsgFlags -> [SocketMsgFlags] # enumFromThenTo :: SocketMsgFlags -> SocketMsgFlags -> SocketMsgFlags -> [SocketMsgFlags] #
Enum SettingsBindFlags
Instance details Defined in GI.Gio.Flags Methods succ :: SettingsBindFlags -> SettingsBindFlags # pred :: SettingsBindFlags -> SettingsBindFlags # toEnum :: Int -> SettingsBindFlags # fromEnum :: SettingsBindFlags -> Int # enumFrom :: SettingsBindFlags -> [SettingsBindFlags] # enumFromThen :: SettingsBindFlags -> SettingsBindFlags -> [SettingsBindFlags] # enumFromTo :: SettingsBindFlags -> SettingsBindFlags -> [SettingsBindFlags] # enumFromThenTo :: SettingsBindFlags -> SettingsBindFlags -> SettingsBindFlags -> [SettingsBindFlags] #
Enum ResourceLookupFlags
Instance details Defined in GI.Gio.Flags Methods succ :: ResourceLookupFlags -> ResourceLookupFlags # pred :: ResourceLookupFlags -> ResourceLookupFlags # toEnum :: Int -> ResourceLookupFlags # fromEnum :: ResourceLookupFlags -> Int # enumFrom :: ResourceLookupFlags -> [ResourceLookupFlags] # enumFromThen :: ResourceLookupFlags -> ResourceLookupFlags -> [ResourceLookupFlags] # enumFromTo :: ResourceLookupFlags -> ResourceLookupFlags -> [ResourceLookupFlags] # enumFromThenTo :: ResourceLookupFlags -> ResourceLookupFlags -> ResourceLookupFlags -> [ResourceLookupFlags] #
Enum ResourceFlags
Instance details Defined in GI.Gio.Flags Methods succ :: ResourceFlags -> ResourceFlags # pred :: ResourceFlags -> ResourceFlags # toEnum :: Int -> ResourceFlags # fromEnum :: ResourceFlags -> Int # enumFrom :: ResourceFlags -> [ResourceFlags] # enumFromThen :: ResourceFlags -> ResourceFlags -> [ResourceFlags] # enumFromTo :: ResourceFlags -> ResourceFlags -> [ResourceFlags] # enumFromThenTo :: ResourceFlags -> ResourceFlags -> ResourceFlags -> [ResourceFlags] #
Enum OutputStreamSpliceFlags
Instance details Defined in GI.Gio.Flags Methods succ :: OutputStreamSpliceFlags -> OutputStreamSpliceFlags # pred :: OutputStreamSpliceFlags -> OutputStreamSpliceFlags # toEnum :: Int -> OutputStreamSpliceFlags # fromEnum :: OutputStreamSpliceFlags -> Int # enumFrom :: OutputStreamSpliceFlags -> [OutputStreamSpliceFlags] # enumFromThen :: OutputStreamSpliceFlags -> OutputStreamSpliceFlags -> [OutputStreamSpliceFlags] # enumFromTo :: OutputStreamSpliceFlags -> OutputStreamSpliceFlags -> [OutputStreamSpliceFlags] # enumFromThenTo :: OutputStreamSpliceFlags -> OutputStreamSpliceFlags -> OutputStreamSpliceFlags -> [OutputStreamSpliceFlags] #
Enum MountUnmountFlags
Instance details Defined in GI.Gio.Flags Methods succ :: MountUnmountFlags -> MountUnmountFlags # pred :: MountUnmountFlags -> MountUnmountFlags # toEnum :: Int -> MountUnmountFlags # fromEnum :: MountUnmountFlags -> Int # enumFrom :: MountUnmountFlags -> [MountUnmountFlags] # enumFromThen :: MountUnmountFlags -> MountUnmountFlags -> [MountUnmountFlags] # enumFromTo :: MountUnmountFlags -> MountUnmountFlags -> [MountUnmountFlags] # enumFromThenTo :: MountUnmountFlags -> MountUnmountFlags -> MountUnmountFlags -> [MountUnmountFlags] #
Enum MountMountFlags
Instance details Defined in GI.Gio.Flags Methods succ :: MountMountFlags -> MountMountFlags # pred :: MountMountFlags -> MountMountFlags # toEnum :: Int -> MountMountFlags # fromEnum :: MountMountFlags -> Int # enumFrom :: MountMountFlags -> [MountMountFlags] # enumFromThen :: MountMountFlags -> MountMountFlags -> [MountMountFlags] # enumFromTo :: MountMountFlags -> MountMountFlags -> [MountMountFlags] # enumFromThenTo :: MountMountFlags -> MountMountFlags -> MountMountFlags -> [MountMountFlags] #
Enum IOStreamSpliceFlags
Instance details Defined in GI.Gio.Flags Methods succ :: IOStreamSpliceFlags -> IOStreamSpliceFlags # pred :: IOStreamSpliceFlags -> IOStreamSpliceFlags # toEnum :: Int -> IOStreamSpliceFlags # fromEnum :: IOStreamSpliceFlags -> Int # enumFrom :: IOStreamSpliceFlags -> [IOStreamSpliceFlags] # enumFromThen :: IOStreamSpliceFlags -> IOStreamSpliceFlags -> [IOStreamSpliceFlags] # enumFromTo :: IOStreamSpliceFlags -> IOStreamSpliceFlags -> [IOStreamSpliceFlags] # enumFromThenTo :: IOStreamSpliceFlags -> IOStreamSpliceFlags -> IOStreamSpliceFlags -> [IOStreamSpliceFlags] #
Enum FileQueryInfoFlags
Instance details Defined in GI.Gio.Flags Methods succ :: FileQueryInfoFlags -> FileQueryInfoFlags # pred :: FileQueryInfoFlags -> FileQueryInfoFlags # toEnum :: Int -> FileQueryInfoFlags # fromEnum :: FileQueryInfoFlags -> Int # enumFrom :: FileQueryInfoFlags -> [FileQueryInfoFlags] # enumFromThen :: FileQueryInfoFlags -> FileQueryInfoFlags -> [FileQueryInfoFlags] # enumFromTo :: FileQueryInfoFlags -> FileQueryInfoFlags -> [FileQueryInfoFlags] # enumFromThenTo :: FileQueryInfoFlags -> FileQueryInfoFlags -> FileQueryInfoFlags -> [FileQueryInfoFlags] #
Enum FileMonitorFlags
Instance details Defined in GI.Gio.Flags Methods succ :: FileMonitorFlags -> FileMonitorFlags # pred :: FileMonitorFlags -> FileMonitorFlags # toEnum :: Int -> FileMonitorFlags # fromEnum :: FileMonitorFlags -> Int # enumFrom :: FileMonitorFlags -> [FileMonitorFlags] # enumFromThen :: FileMonitorFlags -> FileMonitorFlags -> [FileMonitorFlags] # enumFromTo :: FileMonitorFlags -> FileMonitorFlags -> [FileMonitorFlags] # enumFromThenTo :: FileMonitorFlags -> FileMonitorFlags -> FileMonitorFlags -> [FileMonitorFlags] #
Enum FileMeasureFlags
Instance details Defined in GI.Gio.Flags Methods succ :: FileMeasureFlags -> FileMeasureFlags # pred :: FileMeasureFlags -> FileMeasureFlags # toEnum :: Int -> FileMeasureFlags # fromEnum :: FileMeasureFlags -> Int # enumFrom :: FileMeasureFlags -> [FileMeasureFlags] # enumFromThen :: FileMeasureFlags -> FileMeasureFlags -> [FileMeasureFlags] # enumFromTo :: FileMeasureFlags -> FileMeasureFlags -> [FileMeasureFlags] # enumFromThenTo :: FileMeasureFlags -> FileMeasureFlags -> FileMeasureFlags -> [FileMeasureFlags] #
Enum FileCreateFlags
Instance details Defined in GI.Gio.Flags Methods succ :: FileCreateFlags -> FileCreateFlags # pred :: FileCreateFlags -> FileCreateFlags # toEnum :: Int -> FileCreateFlags # fromEnum :: FileCreateFlags -> Int # enumFrom :: FileCreateFlags -> [FileCreateFlags] # enumFromThen :: FileCreateFlags -> FileCreateFlags -> [FileCreateFlags] # enumFromTo :: FileCreateFlags -> FileCreateFlags -> [FileCreateFlags] # enumFromThenTo :: FileCreateFlags -> FileCreateFlags -> FileCreateFlags -> [FileCreateFlags] #
Enum FileCopyFlags
Instance details Defined in GI.Gio.Flags Methods succ :: FileCopyFlags -> FileCopyFlags # pred :: FileCopyFlags -> FileCopyFlags # toEnum :: Int -> FileCopyFlags # fromEnum :: FileCopyFlags -> Int # enumFrom :: FileCopyFlags -> [FileCopyFlags] # enumFromThen :: FileCopyFlags -> FileCopyFlags -> [FileCopyFlags] # enumFromTo :: FileCopyFlags -> FileCopyFlags -> [FileCopyFlags] # enumFromThenTo :: FileCopyFlags -> FileCopyFlags -> FileCopyFlags -> [FileCopyFlags] #
Enum FileAttributeInfoFlags
Instance details Defined in GI.Gio.Flags Methods succ :: FileAttributeInfoFlags -> FileAttributeInfoFlags # pred :: FileAttributeInfoFlags -> FileAttributeInfoFlags # toEnum :: Int -> FileAttributeInfoFlags # fromEnum :: FileAttributeInfoFlags -> Int # enumFrom :: FileAttributeInfoFlags -> [FileAttributeInfoFlags] # enumFromThen :: FileAttributeInfoFlags -> FileAttributeInfoFlags -> [FileAttributeInfoFlags] # enumFromTo :: FileAttributeInfoFlags -> FileAttributeInfoFlags -> [FileAttributeInfoFlags] # enumFromThenTo :: FileAttributeInfoFlags -> FileAttributeInfoFlags -> FileAttributeInfoFlags -> [FileAttributeInfoFlags] #
Enum DriveStartFlags
Instance details Defined in GI.Gio.Flags Methods succ :: DriveStartFlags -> DriveStartFlags # pred :: DriveStartFlags -> DriveStartFlags # toEnum :: Int -> DriveStartFlags # fromEnum :: DriveStartFlags -> Int # enumFrom :: DriveStartFlags -> [DriveStartFlags] # enumFromThen :: DriveStartFlags -> DriveStartFlags -> [DriveStartFlags] # enumFromTo :: DriveStartFlags -> DriveStartFlags -> [DriveStartFlags] # enumFromThenTo :: DriveStartFlags -> DriveStartFlags -> DriveStartFlags -> [DriveStartFlags] #
Enum DBusSubtreeFlags
Instance details Defined in GI.Gio.Flags Methods succ :: DBusSubtreeFlags -> DBusSubtreeFlags # pred :: DBusSubtreeFlags -> DBusSubtreeFlags # toEnum :: Int -> DBusSubtreeFlags # fromEnum :: DBusSubtreeFlags -> Int # enumFrom :: DBusSubtreeFlags -> [DBusSubtreeFlags] # enumFromThen :: DBusSubtreeFlags -> DBusSubtreeFlags -> [DBusSubtreeFlags] # enumFromTo :: DBusSubtreeFlags -> DBusSubtreeFlags -> [DBusSubtreeFlags] # enumFromThenTo :: DBusSubtreeFlags -> DBusSubtreeFlags -> DBusSubtreeFlags -> [DBusSubtreeFlags] #
Enum DBusSignalFlags
Instance details Defined in GI.Gio.Flags Methods succ :: DBusSignalFlags -> DBusSignalFlags # pred :: DBusSignalFlags -> DBusSignalFlags # toEnum :: Int -> DBusSignalFlags # fromEnum :: DBusSignalFlags -> Int # enumFrom :: DBusSignalFlags -> [DBusSignalFlags] # enumFromThen :: DBusSignalFlags -> DBusSignalFlags -> [DBusSignalFlags] # enumFromTo :: DBusSignalFlags -> DBusSignalFlags -> [DBusSignalFlags] # enumFromThenTo :: DBusSignalFlags -> DBusSignalFlags -> DBusSignalFlags -> [DBusSignalFlags] #
Enum DBusServerFlags
Instance details Defined in GI.Gio.Flags Methods succ :: DBusServerFlags -> DBusServerFlags # pred :: DBusServerFlags -> DBusServerFlags # toEnum :: Int -> DBusServerFlags # fromEnum :: DBusServerFlags -> Int # enumFrom :: DBusServerFlags -> [DBusServerFlags] # enumFromThen :: DBusServerFlags -> DBusServerFlags -> [DBusServerFlags] # enumFromTo :: DBusServerFlags -> DBusServerFlags -> [DBusServerFlags] # enumFromThenTo :: DBusServerFlags -> DBusServerFlags -> DBusServerFlags -> [DBusServerFlags] #
Enum DBusSendMessageFlags
Instance details Defined in GI.Gio.Flags Methods succ :: DBusSendMessageFlags -> DBusSendMessageFlags # pred :: DBusSendMessageFlags -> DBusSendMessageFlags # toEnum :: Int -> DBusSendMessageFlags # fromEnum :: DBusSendMessageFlags -> Int # enumFrom :: DBusSendMessageFlags -> [DBusSendMessageFlags] # enumFromThen :: DBusSendMessageFlags -> DBusSendMessageFlags -> [DBusSendMessageFlags] # enumFromTo :: DBusSendMessageFlags -> DBusSendMessageFlags -> [DBusSendMessageFlags] # enumFromThenTo :: DBusSendMessageFlags -> DBusSendMessageFlags -> DBusSendMessageFlags -> [DBusSendMessageFlags] #
Enum DBusProxyFlags
Instance details Defined in GI.Gio.Flags Methods succ :: DBusProxyFlags -> DBusProxyFlags # pred :: DBusProxyFlags -> DBusProxyFlags # toEnum :: Int -> DBusProxyFlags # fromEnum :: DBusProxyFlags -> Int # enumFrom :: DBusProxyFlags -> [DBusProxyFlags] # enumFromThen :: DBusProxyFlags -> DBusProxyFlags -> [DBusProxyFlags] # enumFromTo :: DBusProxyFlags -> DBusProxyFlags -> [DBusProxyFlags] # enumFromThenTo :: DBusProxyFlags -> DBusProxyFlags -> DBusProxyFlags -> [DBusProxyFlags] #
Enum DBusPropertyInfoFlags
Instance details Defined in GI.Gio.Flags Methods succ :: DBusPropertyInfoFlags -> DBusPropertyInfoFlags # pred :: DBusPropertyInfoFlags -> DBusPropertyInfoFlags # toEnum :: Int -> DBusPropertyInfoFlags # fromEnum :: DBusPropertyInfoFlags -> Int # enumFrom :: DBusPropertyInfoFlags -> [DBusPropertyInfoFlags] # enumFromThen :: DBusPropertyInfoFlags -> DBusPropertyInfoFlags -> [DBusPropertyInfoFlags] # enumFromTo :: DBusPropertyInfoFlags -> DBusPropertyInfoFlags -> [DBusPropertyInfoFlags] # enumFromThenTo :: DBusPropertyInfoFlags -> DBusPropertyInfoFlags -> DBusPropertyInfoFlags -> [DBusPropertyInfoFlags] #
Enum DBusObjectManagerClientFlags
Instance details Defined in GI.Gio.Flags Methods succ :: DBusObjectManagerClientFlags -> DBusObjectManagerClientFlags # pred :: DBusObjectManagerClientFlags -> DBusObjectManagerClientFlags # toEnum :: Int -> DBusObjectManagerClientFlags # fromEnum :: DBusObjectManagerClientFlags -> Int # enumFrom :: DBusObjectManagerClientFlags -> [DBusObjectManagerClientFlags] # enumFromThen :: DBusObjectManagerClientFlags -> DBusObjectManagerClientFlags -> [DBusObjectManagerClientFlags] # enumFromTo :: DBusObjectManagerClientFlags -> DBusObjectManagerClientFlags -> [DBusObjectManagerClientFlags] # enumFromThenTo :: DBusObjectManagerClientFlags -> DBusObjectManagerClientFlags -> DBusObjectManagerClientFlags -> [DBusObjectManagerClientFlags] #
Enum DBusMessageFlags
Instance details Defined in GI.Gio.Flags Methods succ :: DBusMessageFlags -> DBusMessageFlags # pred :: DBusMessageFlags -> DBusMessageFlags # toEnum :: Int -> DBusMessageFlags # fromEnum :: DBusMessageFlags -> Int # enumFrom :: DBusMessageFlags -> [DBusMessageFlags] # enumFromThen :: DBusMessageFlags -> DBusMessageFlags -> [DBusMessageFlags] # enumFromTo :: DBusMessageFlags -> DBusMessageFlags -> [DBusMessageFlags] # enumFromThenTo :: DBusMessageFlags -> DBusMessageFlags -> DBusMessageFlags -> [DBusMessageFlags] #
Enum DBusInterfaceSkeletonFlags
Instance details Defined in GI.Gio.Flags Methods succ :: DBusInterfaceSkeletonFlags -> DBusInterfaceSkeletonFlags # pred :: DBusInterfaceSkeletonFlags -> DBusInterfaceSkeletonFlags # toEnum :: Int -> DBusInterfaceSkeletonFlags # fromEnum :: DBusInterfaceSkeletonFlags -> Int # enumFrom :: DBusInterfaceSkeletonFlags -> [DBusInterfaceSkeletonFlags] # enumFromThen :: DBusInterfaceSkeletonFlags -> DBusInterfaceSkeletonFlags -> [DBusInterfaceSkeletonFlags] # enumFromTo :: DBusInterfaceSkeletonFlags -> DBusInterfaceSkeletonFlags -> [DBusInterfaceSkeletonFlags] # enumFromThenTo :: DBusInterfaceSkeletonFlags -> DBusInterfaceSkeletonFlags -> DBusInterfaceSkeletonFlags -> [DBusInterfaceSkeletonFlags] #
Enum DBusConnectionFlags
Instance details Defined in GI.Gio.Flags Methods succ :: DBusConnectionFlags -> DBusConnectionFlags # pred :: DBusConnectionFlags -> DBusConnectionFlags # toEnum :: Int -> DBusConnectionFlags # fromEnum :: DBusConnectionFlags -> Int # enumFrom :: DBusConnectionFlags -> [DBusConnectionFlags] # enumFromThen :: DBusConnectionFlags -> DBusConnectionFlags -> [DBusConnectionFlags] # enumFromTo :: DBusConnectionFlags -> DBusConnectionFlags -> [DBusConnectionFlags] # enumFromThenTo :: DBusConnectionFlags -> DBusConnectionFlags -> DBusConnectionFlags -> [DBusConnectionFlags] #
Enum DBusCapabilityFlags
Instance details Defined in GI.Gio.Flags Methods succ :: DBusCapabilityFlags -> DBusCapabilityFlags # pred :: DBusCapabilityFlags -> DBusCapabilityFlags # toEnum :: Int -> DBusCapabilityFlags # fromEnum :: DBusCapabilityFlags -> Int # enumFrom :: DBusCapabilityFlags -> [DBusCapabilityFlags] # enumFromThen :: DBusCapabilityFlags -> DBusCapabilityFlags -> [DBusCapabilityFlags] # enumFromTo :: DBusCapabilityFlags -> DBusCapabilityFlags -> [DBusCapabilityFlags] # enumFromThenTo :: DBusCapabilityFlags -> DBusCapabilityFlags -> DBusCapabilityFlags -> [DBusCapabilityFlags] #
Enum DBusCallFlags
Instance details Defined in GI.Gio.Flags Methods succ :: DBusCallFlags -> DBusCallFlags # pred :: DBusCallFlags -> DBusCallFlags # toEnum :: Int -> DBusCallFlags # fromEnum :: DBusCallFlags -> Int # enumFrom :: DBusCallFlags -> [DBusCallFlags] # enumFromThen :: DBusCallFlags -> DBusCallFlags -> [DBusCallFlags] # enumFromTo :: DBusCallFlags -> DBusCallFlags -> [DBusCallFlags] # enumFromThenTo :: DBusCallFlags -> DBusCallFlags -> DBusCallFlags -> [DBusCallFlags] #
Enum ConverterFlags
Instance details Defined in GI.Gio.Flags Methods succ :: ConverterFlags -> ConverterFlags # pred :: ConverterFlags -> ConverterFlags # toEnum :: Int -> ConverterFlags # fromEnum :: ConverterFlags -> Int # enumFrom :: ConverterFlags -> [ConverterFlags] # enumFromThen :: ConverterFlags -> ConverterFlags -> [ConverterFlags] # enumFromTo :: ConverterFlags -> ConverterFlags -> [ConverterFlags] # enumFromThenTo :: ConverterFlags -> ConverterFlags -> ConverterFlags -> [ConverterFlags] #
Enum BusNameWatcherFlags
Instance details Defined in GI.Gio.Flags Methods succ :: BusNameWatcherFlags -> BusNameWatcherFlags # pred :: BusNameWatcherFlags -> BusNameWatcherFlags # toEnum :: Int -> BusNameWatcherFlags # fromEnum :: BusNameWatcherFlags -> Int # enumFrom :: BusNameWatcherFlags -> [BusNameWatcherFlags] # enumFromThen :: BusNameWatcherFlags -> BusNameWatcherFlags -> [BusNameWatcherFlags] # enumFromTo :: BusNameWatcherFlags -> BusNameWatcherFlags -> [BusNameWatcherFlags] # enumFromThenTo :: BusNameWatcherFlags -> BusNameWatcherFlags -> BusNameWatcherFlags -> [BusNameWatcherFlags] #
Enum BusNameOwnerFlags
Instance details Defined in GI.Gio.Flags Methods succ :: BusNameOwnerFlags -> BusNameOwnerFlags # pred :: BusNameOwnerFlags -> BusNameOwnerFlags # toEnum :: Int -> BusNameOwnerFlags # fromEnum :: BusNameOwnerFlags -> Int # enumFrom :: BusNameOwnerFlags -> [BusNameOwnerFlags] # enumFromThen :: BusNameOwnerFlags -> BusNameOwnerFlags -> [BusNameOwnerFlags] # enumFromTo :: BusNameOwnerFlags -> BusNameOwnerFlags -> [BusNameOwnerFlags] # enumFromThenTo :: BusNameOwnerFlags -> BusNameOwnerFlags -> BusNameOwnerFlags -> [BusNameOwnerFlags] #
Enum AskPasswordFlags
Instance details Defined in GI.Gio.Flags Methods succ :: AskPasswordFlags -> AskPasswordFlags # pred :: AskPasswordFlags -> AskPasswordFlags # toEnum :: Int -> AskPasswordFlags # fromEnum :: AskPasswordFlags -> Int # enumFrom :: AskPasswordFlags -> [AskPasswordFlags] # enumFromThen :: AskPasswordFlags -> AskPasswordFlags -> [AskPasswordFlags] # enumFromTo :: AskPasswordFlags -> AskPasswordFlags -> [AskPasswordFlags] # enumFromThenTo :: AskPasswordFlags -> AskPasswordFlags -> AskPasswordFlags -> [AskPasswordFlags] #
Enum ApplicationFlags
Instance details Defined in GI.Gio.Flags Methods succ :: ApplicationFlags -> ApplicationFlags # pred :: ApplicationFlags -> ApplicationFlags # toEnum :: Int -> ApplicationFlags # fromEnum :: ApplicationFlags -> Int # enumFrom :: ApplicationFlags -> [ApplicationFlags] # enumFromThen :: ApplicationFlags -> ApplicationFlags -> [ApplicationFlags] # enumFromTo :: ApplicationFlags -> ApplicationFlags -> [ApplicationFlags] # enumFromThenTo :: ApplicationFlags -> ApplicationFlags -> ApplicationFlags -> [ApplicationFlags] #
Enum AppInfoCreateFlags
Instance details Defined in GI.Gio.Flags Methods succ :: AppInfoCreateFlags -> AppInfoCreateFlags # pred :: AppInfoCreateFlags -> AppInfoCreateFlags # toEnum :: Int -> AppInfoCreateFlags # fromEnum :: AppInfoCreateFlags -> Int # enumFrom :: AppInfoCreateFlags -> [AppInfoCreateFlags] # enumFromThen :: AppInfoCreateFlags -> AppInfoCreateFlags -> [AppInfoCreateFlags] # enumFromTo :: AppInfoCreateFlags -> AppInfoCreateFlags -> [AppInfoCreateFlags] # enumFromThenTo :: AppInfoCreateFlags -> AppInfoCreateFlags -> AppInfoCreateFlags -> [AppInfoCreateFlags] #
Enum ZlibCompressorFormat
Instance details Defined in GI.Gio.Enums Methods succ :: ZlibCompressorFormat -> ZlibCompressorFormat # pred :: ZlibCompressorFormat -> ZlibCompressorFormat # toEnum :: Int -> ZlibCompressorFormat # fromEnum :: ZlibCompressorFormat -> Int # enumFrom :: ZlibCompressorFormat -> [ZlibCompressorFormat] # enumFromThen :: ZlibCompressorFormat -> ZlibCompressorFormat -> [ZlibCompressorFormat] # enumFromTo :: ZlibCompressorFormat -> ZlibCompressorFormat -> [ZlibCompressorFormat] # enumFromThenTo :: ZlibCompressorFormat -> ZlibCompressorFormat -> ZlibCompressorFormat -> [ZlibCompressorFormat] #
Enum UnixSocketAddressType
Instance details Defined in GI.Gio.Enums Methods succ :: UnixSocketAddressType -> UnixSocketAddressType # pred :: UnixSocketAddressType -> UnixSocketAddressType # toEnum :: Int -> UnixSocketAddressType # fromEnum :: UnixSocketAddressType -> Int # enumFrom :: UnixSocketAddressType -> [UnixSocketAddressType] # enumFromThen :: UnixSocketAddressType -> UnixSocketAddressType -> [UnixSocketAddressType] # enumFromTo :: UnixSocketAddressType -> UnixSocketAddressType -> [UnixSocketAddressType] # enumFromThenTo :: UnixSocketAddressType -> UnixSocketAddressType -> UnixSocketAddressType -> [UnixSocketAddressType] #
Enum TlsRehandshakeMode
Instance details Defined in GI.Gio.Enums Methods succ :: TlsRehandshakeMode -> TlsRehandshakeMode # pred :: TlsRehandshakeMode -> TlsRehandshakeMode # toEnum :: Int -> TlsRehandshakeMode # fromEnum :: TlsRehandshakeMode -> Int # enumFrom :: TlsRehandshakeMode -> [TlsRehandshakeMode] # enumFromThen :: TlsRehandshakeMode -> TlsRehandshakeMode -> [TlsRehandshakeMode] # enumFromTo :: TlsRehandshakeMode -> TlsRehandshakeMode -> [TlsRehandshakeMode] # enumFromThenTo :: TlsRehandshakeMode -> TlsRehandshakeMode -> TlsRehandshakeMode -> [TlsRehandshakeMode] #
Enum TlsInteractionResult
Instance details Defined in GI.Gio.Enums Methods succ :: TlsInteractionResult -> TlsInteractionResult # pred :: TlsInteractionResult -> TlsInteractionResult # toEnum :: Int -> TlsInteractionResult # fromEnum :: TlsInteractionResult -> Int # enumFrom :: TlsInteractionResult -> [TlsInteractionResult] # enumFromThen :: TlsInteractionResult -> TlsInteractionResult -> [TlsInteractionResult] # enumFromTo :: TlsInteractionResult -> TlsInteractionResult -> [TlsInteractionResult] # enumFromThenTo :: TlsInteractionResult -> TlsInteractionResult -> TlsInteractionResult -> [TlsInteractionResult] #
Enum TlsError
Instance details Defined in GI.Gio.Enums Methods succ :: TlsError -> TlsError # pred :: TlsError -> TlsError # toEnum :: Int -> TlsError # fromEnum :: TlsError -> Int # enumFrom :: TlsError -> [TlsError] # enumFromThen :: TlsError -> TlsError -> [TlsError] # enumFromTo :: TlsError -> TlsError -> [TlsError] # enumFromThenTo :: TlsError -> TlsError -> TlsError -> [TlsError] #
Enum TlsDatabaseLookupFlags
Instance details Defined in GI.Gio.Enums Methods succ :: TlsDatabaseLookupFlags -> TlsDatabaseLookupFlags # pred :: TlsDatabaseLookupFlags -> TlsDatabaseLookupFlags # toEnum :: Int -> TlsDatabaseLookupFlags # fromEnum :: TlsDatabaseLookupFlags -> Int # enumFrom :: TlsDatabaseLookupFlags -> [TlsDatabaseLookupFlags] # enumFromThen :: TlsDatabaseLookupFlags -> TlsDatabaseLookupFlags -> [TlsDatabaseLookupFlags] # enumFromTo :: TlsDatabaseLookupFlags -> TlsDatabaseLookupFlags -> [TlsDatabaseLookupFlags] # enumFromThenTo :: TlsDatabaseLookupFlags -> TlsDatabaseLookupFlags -> TlsDatabaseLookupFlags -> [TlsDatabaseLookupFlags] #
Enum TlsCertificateRequestFlags
Instance details Defined in GI.Gio.Enums Methods succ :: TlsCertificateRequestFlags -> TlsCertificateRequestFlags # pred :: TlsCertificateRequestFlags -> TlsCertificateRequestFlags # toEnum :: Int -> TlsCertificateRequestFlags # fromEnum :: TlsCertificateRequestFlags -> Int # enumFrom :: TlsCertificateRequestFlags -> [TlsCertificateRequestFlags] # enumFromThen :: TlsCertificateRequestFlags -> TlsCertificateRequestFlags -> [TlsCertificateRequestFlags] # enumFromTo :: TlsCertificateRequestFlags -> TlsCertificateRequestFlags -> [TlsCertificateRequestFlags] # enumFromThenTo :: TlsCertificateRequestFlags -> TlsCertificateRequestFlags -> TlsCertificateRequestFlags -> [TlsCertificateRequestFlags] #
Enum TlsAuthenticationMode
Instance details Defined in GI.Gio.Enums Methods succ :: TlsAuthenticationMode -> TlsAuthenticationMode # pred :: TlsAuthenticationMode -> TlsAuthenticationMode # toEnum :: Int -> TlsAuthenticationMode # fromEnum :: TlsAuthenticationMode -> Int # enumFrom :: TlsAuthenticationMode -> [TlsAuthenticationMode] # enumFromThen :: TlsAuthenticationMode -> TlsAuthenticationMode -> [TlsAuthenticationMode] # enumFromTo :: TlsAuthenticationMode -> TlsAuthenticationMode -> [TlsAuthenticationMode] # enumFromThenTo :: TlsAuthenticationMode -> TlsAuthenticationMode -> TlsAuthenticationMode -> [TlsAuthenticationMode] #
Enum SocketType
Instance details Defined in GI.Gio.Enums Methods succ :: SocketType -> SocketType # pred :: SocketType -> SocketType # toEnum :: Int -> SocketType # fromEnum :: SocketType -> Int # enumFrom :: SocketType -> [SocketType] # enumFromThen :: SocketType -> SocketType -> [SocketType] # enumFromTo :: SocketType -> SocketType -> [SocketType] # enumFromThenTo :: SocketType -> SocketType -> SocketType -> [SocketType] #
Enum SocketProtocol
Instance details Defined in GI.Gio.Enums Methods succ :: SocketProtocol -> SocketProtocol # pred :: SocketProtocol -> SocketProtocol # toEnum :: Int -> SocketProtocol # fromEnum :: SocketProtocol -> Int # enumFrom :: SocketProtocol -> [SocketProtocol] # enumFromThen :: SocketProtocol -> SocketProtocol -> [SocketProtocol] # enumFromTo :: SocketProtocol -> SocketProtocol -> [SocketProtocol] # enumFromThenTo :: SocketProtocol -> SocketProtocol -> SocketProtocol -> [SocketProtocol] #
Enum SocketListenerEvent
Instance details Defined in GI.Gio.Enums Methods succ :: SocketListenerEvent -> SocketListenerEvent # pred :: SocketListenerEvent -> SocketListenerEvent # toEnum :: Int -> SocketListenerEvent # fromEnum :: SocketListenerEvent -> Int # enumFrom :: SocketListenerEvent -> [SocketListenerEvent] # enumFromThen :: SocketListenerEvent -> SocketListenerEvent -> [SocketListenerEvent] # enumFromTo :: SocketListenerEvent -> SocketListenerEvent -> [SocketListenerEvent] # enumFromThenTo :: SocketListenerEvent -> SocketListenerEvent -> SocketListenerEvent -> [SocketListenerEvent] #
Enum SocketFamily
Instance details Defined in GI.Gio.Enums Methods succ :: SocketFamily -> SocketFamily # pred :: SocketFamily -> SocketFamily # toEnum :: Int -> SocketFamily # fromEnum :: SocketFamily -> Int # enumFrom :: SocketFamily -> [SocketFamily] # enumFromThen :: SocketFamily -> SocketFamily -> [SocketFamily] # enumFromTo :: SocketFamily -> SocketFamily -> [SocketFamily] # enumFromThenTo :: SocketFamily -> SocketFamily -> SocketFamily -> [SocketFamily] #
Enum SocketClientEvent
Instance details Defined in GI.Gio.Enums Methods succ :: SocketClientEvent -> SocketClientEvent # pred :: SocketClientEvent -> SocketClientEvent # toEnum :: Int -> SocketClientEvent # fromEnum :: SocketClientEvent -> Int # enumFrom :: SocketClientEvent -> [SocketClientEvent] # enumFromThen :: SocketClientEvent -> SocketClientEvent -> [SocketClientEvent] # enumFromTo :: SocketClientEvent -> SocketClientEvent -> [SocketClientEvent] # enumFromThenTo :: SocketClientEvent -> SocketClientEvent -> SocketClientEvent -> [SocketClientEvent] #
Enum ResourceError
Instance details Defined in GI.Gio.Enums Methods succ :: ResourceError -> ResourceError # pred :: ResourceError -> ResourceError # toEnum :: Int -> ResourceError # fromEnum :: ResourceError -> Int # enumFrom :: ResourceError -> [ResourceError] # enumFromThen :: ResourceError -> ResourceError -> [ResourceError] # enumFromTo :: ResourceError -> ResourceError -> [ResourceError] # enumFromThenTo :: ResourceError -> ResourceError -> ResourceError -> [ResourceError] #
Enum ResolverRecordType
Instance details Defined in GI.Gio.Enums Methods succ :: ResolverRecordType -> ResolverRecordType # pred :: ResolverRecordType -> ResolverRecordType # toEnum :: Int -> ResolverRecordType # fromEnum :: ResolverRecordType -> Int # enumFrom :: ResolverRecordType -> [ResolverRecordType] # enumFromThen :: ResolverRecordType -> ResolverRecordType -> [ResolverRecordType] # enumFromTo :: ResolverRecordType -> ResolverRecordType -> [ResolverRecordType] # enumFromThenTo :: ResolverRecordType -> ResolverRecordType -> ResolverRecordType -> [ResolverRecordType] #
Enum ResolverError
Instance details Defined in GI.Gio.Enums Methods succ :: ResolverError -> ResolverError # pred :: ResolverError -> ResolverError # toEnum :: Int -> ResolverError # fromEnum :: ResolverError -> Int # enumFrom :: ResolverError -> [ResolverError] # enumFromThen :: ResolverError -> ResolverError -> [ResolverError] # enumFromTo :: ResolverError -> ResolverError -> [ResolverError] # enumFromThenTo :: ResolverError -> ResolverError -> ResolverError -> [ResolverError] #
Enum PasswordSave
Instance details Defined in GI.Gio.Enums Methods succ :: PasswordSave -> PasswordSave # pred :: PasswordSave -> PasswordSave # toEnum :: Int -> PasswordSave # fromEnum :: PasswordSave -> Int # enumFrom :: PasswordSave -> [PasswordSave] # enumFromThen :: PasswordSave -> PasswordSave -> [PasswordSave] # enumFromTo :: PasswordSave -> PasswordSave -> [PasswordSave] # enumFromThenTo :: PasswordSave -> PasswordSave -> PasswordSave -> [PasswordSave] #
Enum NotificationPriority
Instance details Defined in GI.Gio.Enums Methods succ :: NotificationPriority -> NotificationPriority # pred :: NotificationPriority -> NotificationPriority # toEnum :: Int -> NotificationPriority # fromEnum :: NotificationPriority -> Int # enumFrom :: NotificationPriority -> [NotificationPriority] # enumFromThen :: NotificationPriority -> NotificationPriority -> [NotificationPriority] # enumFromTo :: NotificationPriority -> NotificationPriority -> [NotificationPriority] # enumFromThenTo :: NotificationPriority -> NotificationPriority -> NotificationPriority -> [NotificationPriority] #
Enum NetworkConnectivity
Instance details Defined in GI.Gio.Enums Methods succ :: NetworkConnectivity -> NetworkConnectivity # pred :: NetworkConnectivity -> NetworkConnectivity # toEnum :: Int -> NetworkConnectivity # fromEnum :: NetworkConnectivity -> Int # enumFrom :: NetworkConnectivity -> [NetworkConnectivity] # enumFromThen :: NetworkConnectivity -> NetworkConnectivity -> [NetworkConnectivity] # enumFromTo :: NetworkConnectivity -> NetworkConnectivity -> [NetworkConnectivity] # enumFromThenTo :: NetworkConnectivity -> NetworkConnectivity -> NetworkConnectivity -> [NetworkConnectivity] #
Enum MountOperationResult
Instance details Defined in GI.Gio.Enums Methods succ :: MountOperationResult -> MountOperationResult # pred :: MountOperationResult -> MountOperationResult # toEnum :: Int -> MountOperationResult # fromEnum :: MountOperationResult -> Int # enumFrom :: MountOperationResult -> [MountOperationResult] # enumFromThen :: MountOperationResult -> MountOperationResult -> [MountOperationResult] # enumFromTo :: MountOperationResult -> MountOperationResult -> [MountOperationResult] # enumFromThenTo :: MountOperationResult -> MountOperationResult -> MountOperationResult -> [MountOperationResult] #
Enum IOModuleScopeFlags
Instance details Defined in GI.Gio.Enums Methods succ :: IOModuleScopeFlags -> IOModuleScopeFlags # pred :: IOModuleScopeFlags -> IOModuleScopeFlags # toEnum :: Int -> IOModuleScopeFlags # fromEnum :: IOModuleScopeFlags -> Int # enumFrom :: IOModuleScopeFlags -> [IOModuleScopeFlags] # enumFromThen :: IOModuleScopeFlags -> IOModuleScopeFlags -> [IOModuleScopeFlags] # enumFromTo :: IOModuleScopeFlags -> IOModuleScopeFlags -> [IOModuleScopeFlags] # enumFromThenTo :: IOModuleScopeFlags -> IOModuleScopeFlags -> IOModuleScopeFlags -> [IOModuleScopeFlags] #
Enum IOErrorEnum
Instance details Defined in GI.Gio.Enums Methods succ :: IOErrorEnum -> IOErrorEnum # pred :: IOErrorEnum -> IOErrorEnum # toEnum :: Int -> IOErrorEnum # fromEnum :: IOErrorEnum -> Int # enumFrom :: IOErrorEnum -> [IOErrorEnum] # enumFromThen :: IOErrorEnum -> IOErrorEnum -> [IOErrorEnum] # enumFromTo :: IOErrorEnum -> IOErrorEnum -> [IOErrorEnum] # enumFromThenTo :: IOErrorEnum -> IOErrorEnum -> IOErrorEnum -> [IOErrorEnum] #
Enum FilesystemPreviewType
Instance details Defined in GI.Gio.Enums Methods succ :: FilesystemPreviewType -> FilesystemPreviewType # pred :: FilesystemPreviewType -> FilesystemPreviewType # toEnum :: Int -> FilesystemPreviewType # fromEnum :: FilesystemPreviewType -> Int # enumFrom :: FilesystemPreviewType -> [FilesystemPreviewType] # enumFromThen :: FilesystemPreviewType -> FilesystemPreviewType -> [FilesystemPreviewType] # enumFromTo :: FilesystemPreviewType -> FilesystemPreviewType -> [FilesystemPreviewType] # enumFromThenTo :: FilesystemPreviewType -> FilesystemPreviewType -> FilesystemPreviewType -> [FilesystemPreviewType] #
Enum FileType
Instance details Defined in GI.Gio.Enums Methods succ :: FileType -> FileType # pred :: FileType -> FileType # toEnum :: Int -> FileType # fromEnum :: FileType -> Int # enumFrom :: FileType -> [FileType] # enumFromThen :: FileType -> FileType -> [FileType] # enumFromTo :: FileType -> FileType -> [FileType] # enumFromThenTo :: FileType -> FileType -> FileType -> [FileType] #
Enum FileMonitorEvent
Instance details Defined in GI.Gio.Enums Methods succ :: FileMonitorEvent -> FileMonitorEvent # pred :: FileMonitorEvent -> FileMonitorEvent # toEnum :: Int -> FileMonitorEvent # fromEnum :: FileMonitorEvent -> Int # enumFrom :: FileMonitorEvent -> [FileMonitorEvent] # enumFromThen :: FileMonitorEvent -> FileMonitorEvent -> [FileMonitorEvent] # enumFromTo :: FileMonitorEvent -> FileMonitorEvent -> [FileMonitorEvent] # enumFromThenTo :: FileMonitorEvent -> FileMonitorEvent -> FileMonitorEvent -> [FileMonitorEvent] #
Enum FileAttributeType
Instance details Defined in GI.Gio.Enums Methods succ :: FileAttributeType -> FileAttributeType # pred :: FileAttributeType -> FileAttributeType # toEnum :: Int -> FileAttributeType # fromEnum :: FileAttributeType -> Int # enumFrom :: FileAttributeType -> [FileAttributeType] # enumFromThen :: FileAttributeType -> FileAttributeType -> [FileAttributeType] # enumFromTo :: FileAttributeType -> FileAttributeType -> [FileAttributeType] # enumFromThenTo :: FileAttributeType -> FileAttributeType -> FileAttributeType -> [FileAttributeType] #
Enum FileAttributeStatus
Instance details Defined in GI.Gio.Enums Methods succ :: FileAttributeStatus -> FileAttributeStatus # pred :: FileAttributeStatus -> FileAttributeStatus # toEnum :: Int -> FileAttributeStatus # fromEnum :: FileAttributeStatus -> Int # enumFrom :: FileAttributeStatus -> [FileAttributeStatus] # enumFromThen :: FileAttributeStatus -> FileAttributeStatus -> [FileAttributeStatus] # enumFromTo :: FileAttributeStatus -> FileAttributeStatus -> [FileAttributeStatus] # enumFromThenTo :: FileAttributeStatus -> FileAttributeStatus -> FileAttributeStatus -> [FileAttributeStatus] #
Enum EmblemOrigin
Instance details Defined in GI.Gio.Enums Methods succ :: EmblemOrigin -> EmblemOrigin # pred :: EmblemOrigin -> EmblemOrigin # toEnum :: Int -> EmblemOrigin # fromEnum :: EmblemOrigin -> Int # enumFrom :: EmblemOrigin -> [EmblemOrigin] # enumFromThen :: EmblemOrigin -> EmblemOrigin -> [EmblemOrigin] # enumFromTo :: EmblemOrigin -> EmblemOrigin -> [EmblemOrigin] # enumFromThenTo :: EmblemOrigin -> EmblemOrigin -> EmblemOrigin -> [EmblemOrigin] #
Enum DriveStartStopType
Instance details Defined in GI.Gio.Enums Methods succ :: DriveStartStopType -> DriveStartStopType # pred :: DriveStartStopType -> DriveStartStopType # toEnum :: Int -> DriveStartStopType # fromEnum :: DriveStartStopType -> Int # enumFrom :: DriveStartStopType -> [DriveStartStopType] # enumFromThen :: DriveStartStopType -> DriveStartStopType -> [DriveStartStopType] # enumFromTo :: DriveStartStopType -> DriveStartStopType -> [DriveStartStopType] # enumFromThenTo :: DriveStartStopType -> DriveStartStopType -> DriveStartStopType -> [DriveStartStopType] #
Enum DataStreamNewlineType
Instance details Defined in GI.Gio.Enums Methods succ :: DataStreamNewlineType -> DataStreamNewlineType # pred :: DataStreamNewlineType -> DataStreamNewlineType # toEnum :: Int -> DataStreamNewlineType # fromEnum :: DataStreamNewlineType -> Int # enumFrom :: DataStreamNewlineType -> [DataStreamNewlineType] # enumFromThen :: DataStreamNewlineType -> DataStreamNewlineType -> [DataStreamNewlineType] # enumFromTo :: DataStreamNewlineType -> DataStreamNewlineType -> [DataStreamNewlineType] # enumFromThenTo :: DataStreamNewlineType -> DataStreamNewlineType -> DataStreamNewlineType -> [DataStreamNewlineType] #
Enum DataStreamByteOrder
Instance details Defined in GI.Gio.Enums Methods succ :: DataStreamByteOrder -> DataStreamByteOrder # pred :: DataStreamByteOrder -> DataStreamByteOrder # toEnum :: Int -> DataStreamByteOrder # fromEnum :: DataStreamByteOrder -> Int # enumFrom :: DataStreamByteOrder -> [DataStreamByteOrder] # enumFromThen :: DataStreamByteOrder -> DataStreamByteOrder -> [DataStreamByteOrder] # enumFromTo :: DataStreamByteOrder -> DataStreamByteOrder -> [DataStreamByteOrder] # enumFromThenTo :: DataStreamByteOrder -> DataStreamByteOrder -> DataStreamByteOrder -> [DataStreamByteOrder] #
Enum DBusMessageType
Instance details Defined in GI.Gio.Enums Methods succ :: DBusMessageType -> DBusMessageType # pred :: DBusMessageType -> DBusMessageType # toEnum :: Int -> DBusMessageType # fromEnum :: DBusMessageType -> Int # enumFrom :: DBusMessageType -> [DBusMessageType] # enumFromThen :: DBusMessageType -> DBusMessageType -> [DBusMessageType] # enumFromTo :: DBusMessageType -> DBusMessageType -> [DBusMessageType] # enumFromThenTo :: DBusMessageType -> DBusMessageType -> DBusMessageType -> [DBusMessageType] #
Enum DBusMessageHeaderField
Instance details Defined in GI.Gio.Enums Methods succ :: DBusMessageHeaderField -> DBusMessageHeaderField # pred :: DBusMessageHeaderField -> DBusMessageHeaderField # toEnum :: Int -> DBusMessageHeaderField # fromEnum :: DBusMessageHeaderField -> Int # enumFrom :: DBusMessageHeaderField -> [DBusMessageHeaderField] # enumFromThen :: DBusMessageHeaderField -> DBusMessageHeaderField -> [DBusMessageHeaderField] # enumFromTo :: DBusMessageHeaderField -> DBusMessageHeaderField -> [DBusMessageHeaderField] # enumFromThenTo :: DBusMessageHeaderField -> DBusMessageHeaderField -> DBusMessageHeaderField -> [DBusMessageHeaderField] #
Enum DBusMessageByteOrder
Instance details Defined in GI.Gio.Enums Methods succ :: DBusMessageByteOrder -> DBusMessageByteOrder # pred :: DBusMessageByteOrder -> DBusMessageByteOrder # toEnum :: Int -> DBusMessageByteOrder # fromEnum :: DBusMessageByteOrder -> Int # enumFrom :: DBusMessageByteOrder -> [DBusMessageByteOrder] # enumFromThen :: DBusMessageByteOrder -> DBusMessageByteOrder -> [DBusMessageByteOrder] # enumFromTo :: DBusMessageByteOrder -> DBusMessageByteOrder -> [DBusMessageByteOrder] # enumFromThenTo :: DBusMessageByteOrder -> DBusMessageByteOrder -> DBusMessageByteOrder -> [DBusMessageByteOrder] #
Enum DBusError
Instance details Defined in GI.Gio.Enums Methods succ :: DBusError -> DBusError # pred :: DBusError -> DBusError # toEnum :: Int -> DBusError # fromEnum :: DBusError -> Int # enumFrom :: DBusError -> [DBusError] # enumFromThen :: DBusError -> DBusError -> [DBusError] # enumFromTo :: DBusError -> DBusError -> [DBusError] # enumFromThenTo :: DBusError -> DBusError -> DBusError -> [DBusError] #
Enum CredentialsType
Instance details Defined in GI.Gio.Enums Methods succ :: CredentialsType -> CredentialsType # pred :: CredentialsType -> CredentialsType # toEnum :: Int -> CredentialsType # fromEnum :: CredentialsType -> Int # enumFrom :: CredentialsType -> [CredentialsType] # enumFromThen :: CredentialsType -> CredentialsType -> [CredentialsType] # enumFromTo :: CredentialsType -> CredentialsType -> [CredentialsType] # enumFromThenTo :: CredentialsType -> CredentialsType -> CredentialsType -> [CredentialsType] #
Enum ConverterResult
Instance details Defined in GI.Gio.Enums Methods succ :: ConverterResult -> ConverterResult # pred :: ConverterResult -> ConverterResult # toEnum :: Int -> ConverterResult # fromEnum :: ConverterResult -> Int # enumFrom :: ConverterResult -> [ConverterResult] # enumFromThen :: ConverterResult -> ConverterResult -> [ConverterResult] # enumFromTo :: ConverterResult -> ConverterResult -> [ConverterResult] # enumFromThenTo :: ConverterResult -> ConverterResult -> ConverterResult -> [ConverterResult] #
Enum BusType
Instance details Defined in GI.Gio.Enums Methods succ :: BusType -> BusType # pred :: BusType -> BusType # toEnum :: Int -> BusType # fromEnum :: BusType -> Int # enumFrom :: BusType -> [BusType] # enumFromThen :: BusType -> BusType -> [BusType] # enumFromTo :: BusType -> BusType -> [BusType] # enumFromThenTo :: BusType -> BusType -> BusType -> [BusType] #
Enum TraverseFlags
Instance details Defined in GI.GLib.Flags Methods succ :: TraverseFlags -> TraverseFlags # pred :: TraverseFlags -> TraverseFlags # toEnum :: Int -> TraverseFlags # fromEnum :: TraverseFlags -> Int # enumFrom :: TraverseFlags -> [TraverseFlags] # enumFromThen :: TraverseFlags -> TraverseFlags -> [TraverseFlags] # enumFromTo :: TraverseFlags -> TraverseFlags -> [TraverseFlags] # enumFromThenTo :: TraverseFlags -> TraverseFlags -> TraverseFlags -> [TraverseFlags] #
Enum TestTrapFlags
Instance details Defined in GI.GLib.Flags Methods succ :: TestTrapFlags -> TestTrapFlags # pred :: TestTrapFlags -> TestTrapFlags # toEnum :: Int -> TestTrapFlags # fromEnum :: TestTrapFlags -> Int # enumFrom :: TestTrapFlags -> [TestTrapFlags] # enumFromThen :: TestTrapFlags -> TestTrapFlags -> [TestTrapFlags] # enumFromTo :: TestTrapFlags -> TestTrapFlags -> [TestTrapFlags] # enumFromThenTo :: TestTrapFlags -> TestTrapFlags -> TestTrapFlags -> [TestTrapFlags] #
Enum TestSubprocessFlags
Instance details Defined in GI.GLib.Flags Methods succ :: TestSubprocessFlags -> TestSubprocessFlags # pred :: TestSubprocessFlags -> TestSubprocessFlags # toEnum :: Int -> TestSubprocessFlags # fromEnum :: TestSubprocessFlags -> Int # enumFrom :: TestSubprocessFlags -> [TestSubprocessFlags] # enumFromThen :: TestSubprocessFlags -> TestSubprocessFlags -> [TestSubprocessFlags] # enumFromTo :: TestSubprocessFlags -> TestSubprocessFlags -> [TestSubprocessFlags] # enumFromThenTo :: TestSubprocessFlags -> TestSubprocessFlags -> TestSubprocessFlags -> [TestSubprocessFlags] #
Enum SpawnFlags
Instance details Defined in GI.GLib.Flags Methods succ :: SpawnFlags -> SpawnFlags # pred :: SpawnFlags -> SpawnFlags # toEnum :: Int -> SpawnFlags # fromEnum :: SpawnFlags -> Int # enumFrom :: SpawnFlags -> [SpawnFlags] # enumFromThen :: SpawnFlags -> SpawnFlags -> [SpawnFlags] # enumFromTo :: SpawnFlags -> SpawnFlags -> [SpawnFlags] # enumFromThenTo :: SpawnFlags -> SpawnFlags -> SpawnFlags -> [SpawnFlags] #
Enum RegexMatchFlags
Instance details Defined in GI.GLib.Flags Methods succ :: RegexMatchFlags -> RegexMatchFlags # pred :: RegexMatchFlags -> RegexMatchFlags # toEnum :: Int -> RegexMatchFlags # fromEnum :: RegexMatchFlags -> Int # enumFrom :: RegexMatchFlags -> [RegexMatchFlags] # enumFromThen :: RegexMatchFlags -> RegexMatchFlags -> [RegexMatchFlags] # enumFromTo :: RegexMatchFlags -> RegexMatchFlags -> [RegexMatchFlags] # enumFromThenTo :: RegexMatchFlags -> RegexMatchFlags -> RegexMatchFlags -> [RegexMatchFlags] #
Enum RegexCompileFlags
Instance details Defined in GI.GLib.Flags Methods succ :: RegexCompileFlags -> RegexCompileFlags # pred :: RegexCompileFlags -> RegexCompileFlags # toEnum :: Int -> RegexCompileFlags # fromEnum :: RegexCompileFlags -> Int # enumFrom :: RegexCompileFlags -> [RegexCompileFlags] # enumFromThen :: RegexCompileFlags -> RegexCompileFlags -> [RegexCompileFlags] # enumFromTo :: RegexCompileFlags -> RegexCompileFlags -> [RegexCompileFlags] # enumFromThenTo :: RegexCompileFlags -> RegexCompileFlags -> RegexCompileFlags -> [RegexCompileFlags] #
Enum OptionFlags
Instance details Defined in GI.GLib.Flags Methods succ :: OptionFlags -> OptionFlags # pred :: OptionFlags -> OptionFlags # toEnum :: Int -> OptionFlags # fromEnum :: OptionFlags -> Int # enumFrom :: OptionFlags -> [OptionFlags] # enumFromThen :: OptionFlags -> OptionFlags -> [OptionFlags] # enumFromTo :: OptionFlags -> OptionFlags -> [OptionFlags] # enumFromThenTo :: OptionFlags -> OptionFlags -> OptionFlags -> [OptionFlags] #
Enum MarkupParseFlags
Instance details Defined in GI.GLib.Flags Methods succ :: MarkupParseFlags -> MarkupParseFlags # pred :: MarkupParseFlags -> MarkupParseFlags # toEnum :: Int -> MarkupParseFlags # fromEnum :: MarkupParseFlags -> Int # enumFrom :: MarkupParseFlags -> [MarkupParseFlags] # enumFromThen :: MarkupParseFlags -> MarkupParseFlags -> [MarkupParseFlags] # enumFromTo :: MarkupParseFlags -> MarkupParseFlags -> [MarkupParseFlags] # enumFromThenTo :: MarkupParseFlags -> MarkupParseFlags -> MarkupParseFlags -> [MarkupParseFlags] #
Enum MarkupCollectType
Instance details Defined in GI.GLib.Flags Methods succ :: MarkupCollectType -> MarkupCollectType # pred :: MarkupCollectType -> MarkupCollectType # toEnum :: Int -> MarkupCollectType # fromEnum :: MarkupCollectType -> Int # enumFrom :: MarkupCollectType -> [MarkupCollectType] # enumFromThen :: MarkupCollectType -> MarkupCollectType -> [MarkupCollectType] # enumFromTo :: MarkupCollectType -> MarkupCollectType -> [MarkupCollectType] # enumFromThenTo :: MarkupCollectType -> MarkupCollectType -> MarkupCollectType -> [MarkupCollectType] #
Enum LogLevelFlags
Instance details Defined in GI.GLib.Flags Methods succ :: LogLevelFlags -> LogLevelFlags # pred :: LogLevelFlags -> LogLevelFlags # toEnum :: Int -> LogLevelFlags # fromEnum :: LogLevelFlags -> Int # enumFrom :: LogLevelFlags -> [LogLevelFlags] # enumFromThen :: LogLevelFlags -> LogLevelFlags -> [LogLevelFlags] # enumFromTo :: LogLevelFlags -> LogLevelFlags -> [LogLevelFlags] # enumFromThenTo :: LogLevelFlags -> LogLevelFlags -> LogLevelFlags -> [LogLevelFlags] #
Enum KeyFileFlags
Instance details Defined in GI.GLib.Flags Methods succ :: KeyFileFlags -> KeyFileFlags # pred :: KeyFileFlags -> KeyFileFlags # toEnum :: Int -> KeyFileFlags # fromEnum :: KeyFileFlags -> Int # enumFrom :: KeyFileFlags -> [KeyFileFlags] # enumFromThen :: KeyFileFlags -> KeyFileFlags -> [KeyFileFlags] # enumFromTo :: KeyFileFlags -> KeyFileFlags -> [KeyFileFlags] # enumFromThenTo :: KeyFileFlags -> KeyFileFlags -> KeyFileFlags -> [KeyFileFlags] #
Enum IOFlags
Instance details Defined in GI.GLib.Flags Methods succ :: IOFlags -> IOFlags # pred :: IOFlags -> IOFlags # toEnum :: Int -> IOFlags # fromEnum :: IOFlags -> Int # enumFrom :: IOFlags -> [IOFlags] # enumFromThen :: IOFlags -> IOFlags -> [IOFlags] # enumFromTo :: IOFlags -> IOFlags -> [IOFlags] # enumFromThenTo :: IOFlags -> IOFlags -> IOFlags -> [IOFlags] #
Enum IOCondition
Instance details Defined in GI.GLib.Flags Methods succ :: IOCondition -> IOCondition # pred :: IOCondition -> IOCondition # toEnum :: Int -> IOCondition # fromEnum :: IOCondition -> Int # enumFrom :: IOCondition -> [IOCondition] # enumFromThen :: IOCondition -> IOCondition -> [IOCondition] # enumFromTo :: IOCondition -> IOCondition -> [IOCondition] # enumFromThenTo :: IOCondition -> IOCondition -> IOCondition -> [IOCondition] #
Enum HookFlagMask
Instance details Defined in GI.GLib.Flags Methods succ :: HookFlagMask -> HookFlagMask # pred :: HookFlagMask -> HookFlagMask # toEnum :: Int -> HookFlagMask # fromEnum :: HookFlagMask -> Int # enumFrom :: HookFlagMask -> [HookFlagMask] # enumFromThen :: HookFlagMask -> HookFlagMask -> [HookFlagMask] # enumFromTo :: HookFlagMask -> HookFlagMask -> [HookFlagMask] # enumFromThenTo :: HookFlagMask -> HookFlagMask -> HookFlagMask -> [HookFlagMask] #
Enum FormatSizeFlags
Instance details Defined in GI.GLib.Flags Methods succ :: FormatSizeFlags -> FormatSizeFlags # pred :: FormatSizeFlags -> FormatSizeFlags # toEnum :: Int -> FormatSizeFlags # fromEnum :: FormatSizeFlags -> Int # enumFrom :: FormatSizeFlags -> [FormatSizeFlags] # enumFromThen :: FormatSizeFlags -> FormatSizeFlags -> [FormatSizeFlags] # enumFromTo :: FormatSizeFlags -> FormatSizeFlags -> [FormatSizeFlags] # enumFromThenTo :: FormatSizeFlags -> FormatSizeFlags -> FormatSizeFlags -> [FormatSizeFlags] #
Enum FileTest
Instance details Defined in GI.GLib.Flags Methods succ :: FileTest -> FileTest # pred :: FileTest -> FileTest # toEnum :: Int -> FileTest # fromEnum :: FileTest -> Int # enumFrom :: FileTest -> [FileTest] # enumFromThen :: FileTest -> FileTest -> [FileTest] # enumFromTo :: FileTest -> FileTest -> [FileTest] # enumFromThenTo :: FileTest -> FileTest -> FileTest -> [FileTest] #
Enum AsciiType
Instance details Defined in GI.GLib.Flags Methods succ :: AsciiType -> AsciiType # pred :: AsciiType -> AsciiType # toEnum :: Int -> AsciiType # fromEnum :: AsciiType -> Int # enumFrom :: AsciiType -> [AsciiType] # enumFromThen :: AsciiType -> AsciiType -> [AsciiType] # enumFromTo :: AsciiType -> AsciiType -> [AsciiType] # enumFromThenTo :: AsciiType -> AsciiType -> AsciiType -> [AsciiType] #
Enum VariantParseError
Instance details Defined in GI.GLib.Enums Methods succ :: VariantParseError -> VariantParseError # pred :: VariantParseError -> VariantParseError # toEnum :: Int -> VariantParseError # fromEnum :: VariantParseError -> Int # enumFrom :: VariantParseError -> [VariantParseError] # enumFromThen :: VariantParseError -> VariantParseError -> [VariantParseError] # enumFromTo :: VariantParseError -> VariantParseError -> [VariantParseError] # enumFromThenTo :: VariantParseError -> VariantParseError -> VariantParseError -> [VariantParseError] #
Enum VariantClass
Instance details Defined in GI.GLib.Enums Methods succ :: VariantClass -> VariantClass # pred :: VariantClass -> VariantClass # toEnum :: Int -> VariantClass # fromEnum :: VariantClass -> Int # enumFrom :: VariantClass -> [VariantClass] # enumFromThen :: VariantClass -> VariantClass -> [VariantClass] # enumFromTo :: VariantClass -> VariantClass -> [VariantClass] # enumFromThenTo :: VariantClass -> VariantClass -> VariantClass -> [VariantClass] #
Enum UserDirectory
Instance details Defined in GI.GLib.Enums Methods succ :: UserDirectory -> UserDirectory # pred :: UserDirectory -> UserDirectory # toEnum :: Int -> UserDirectory # fromEnum :: UserDirectory -> Int # enumFrom :: UserDirectory -> [UserDirectory] # enumFromThen :: UserDirectory -> UserDirectory -> [UserDirectory] # enumFromTo :: UserDirectory -> UserDirectory -> [UserDirectory] # enumFromThenTo :: UserDirectory -> UserDirectory -> UserDirectory -> [UserDirectory] #
Enum UnicodeType
Instance details Defined in GI.GLib.Enums Methods succ :: UnicodeType -> UnicodeType # pred :: UnicodeType -> UnicodeType # toEnum :: Int -> UnicodeType # fromEnum :: UnicodeType -> Int # enumFrom :: UnicodeType -> [UnicodeType] # enumFromThen :: UnicodeType -> UnicodeType -> [UnicodeType] # enumFromTo :: UnicodeType -> UnicodeType -> [UnicodeType] # enumFromThenTo :: UnicodeType -> UnicodeType -> UnicodeType -> [UnicodeType] #
Enum UnicodeScript
Instance details Defined in GI.GLib.Enums Methods succ :: UnicodeScript -> UnicodeScript # pred :: UnicodeScript -> UnicodeScript # toEnum :: Int -> UnicodeScript # fromEnum :: UnicodeScript -> Int # enumFrom :: UnicodeScript -> [UnicodeScript] # enumFromThen :: UnicodeScript -> UnicodeScript -> [UnicodeScript] # enumFromTo :: UnicodeScript -> UnicodeScript -> [UnicodeScript] # enumFromThenTo :: UnicodeScript -> UnicodeScript -> UnicodeScript -> [UnicodeScript] #
Enum UnicodeBreakType
Instance details Defined in GI.GLib.Enums Methods succ :: UnicodeBreakType -> UnicodeBreakType # pred :: UnicodeBreakType -> UnicodeBreakType # toEnum :: Int -> UnicodeBreakType # fromEnum :: UnicodeBreakType -> Int # enumFrom :: UnicodeBreakType -> [UnicodeBreakType] # enumFromThen :: UnicodeBreakType -> UnicodeBreakType -> [UnicodeBreakType] # enumFromTo :: UnicodeBreakType -> UnicodeBreakType -> [UnicodeBreakType] # enumFromThenTo :: UnicodeBreakType -> UnicodeBreakType -> UnicodeBreakType -> [UnicodeBreakType] #
Enum TraverseType
Instance details Defined in GI.GLib.Enums Methods succ :: TraverseType -> TraverseType # pred :: TraverseType -> TraverseType # toEnum :: Int -> TraverseType # fromEnum :: TraverseType -> Int # enumFrom :: TraverseType -> [TraverseType] # enumFromThen :: TraverseType -> TraverseType -> [TraverseType] # enumFromTo :: TraverseType -> TraverseType -> [TraverseType] # enumFromThenTo :: TraverseType -> TraverseType -> TraverseType -> [TraverseType] #
Enum TokenType
Instance details Defined in GI.GLib.Enums Methods succ :: TokenType -> TokenType # pred :: TokenType -> TokenType # toEnum :: Int -> TokenType # fromEnum :: TokenType -> Int # enumFrom :: TokenType -> [TokenType] # enumFromThen :: TokenType -> TokenType -> [TokenType] # enumFromTo :: TokenType -> TokenType -> [TokenType] # enumFromThenTo :: TokenType -> TokenType -> TokenType -> [TokenType] #
Enum TimeType
Instance details Defined in GI.GLib.Enums Methods succ :: TimeType -> TimeType # pred :: TimeType -> TimeType # toEnum :: Int -> TimeType # fromEnum :: TimeType -> Int # enumFrom :: TimeType -> [TimeType] # enumFromThen :: TimeType -> TimeType -> [TimeType] # enumFromTo :: TimeType -> TimeType -> [TimeType] # enumFromThenTo :: TimeType -> TimeType -> TimeType -> [TimeType] #
Enum ThreadError
Instance details Defined in GI.GLib.Enums Methods succ :: ThreadError -> ThreadError # pred :: ThreadError -> ThreadError # toEnum :: Int -> ThreadError # fromEnum :: ThreadError -> Int # enumFrom :: ThreadError -> [ThreadError] # enumFromThen :: ThreadError -> ThreadError -> [ThreadError] # enumFromTo :: ThreadError -> ThreadError -> [ThreadError] # enumFromThenTo :: ThreadError -> ThreadError -> ThreadError -> [ThreadError] #
Enum TestResult
Instance details Defined in GI.GLib.Enums Methods succ :: TestResult -> TestResult # pred :: TestResult -> TestResult # toEnum :: Int -> TestResult # fromEnum :: TestResult -> Int # enumFrom :: TestResult -> [TestResult] # enumFromThen :: TestResult -> TestResult -> [TestResult] # enumFromTo :: TestResult -> TestResult -> [TestResult] # enumFromThenTo :: TestResult -> TestResult -> TestResult -> [TestResult] #
Enum TestLogType
Instance details Defined in GI.GLib.Enums Methods succ :: TestLogType -> TestLogType # pred :: TestLogType -> TestLogType # toEnum :: Int -> TestLogType # fromEnum :: TestLogType -> Int # enumFrom :: TestLogType -> [TestLogType] # enumFromThen :: TestLogType -> TestLogType -> [TestLogType] # enumFromTo :: TestLogType -> TestLogType -> [TestLogType] # enumFromThenTo :: TestLogType -> TestLogType -> TestLogType -> [TestLogType] #
Enum TestFileType
Instance details Defined in GI.GLib.Enums Methods succ :: TestFileType -> TestFileType # pred :: TestFileType -> TestFileType # toEnum :: Int -> TestFileType # fromEnum :: TestFileType -> Int # enumFrom :: TestFileType -> [TestFileType] # enumFromThen :: TestFileType -> TestFileType -> [TestFileType] # enumFromTo :: TestFileType -> TestFileType -> [TestFileType] # enumFromThenTo :: TestFileType -> TestFileType -> TestFileType -> [TestFileType] #
Enum SpawnError
Instance details Defined in GI.GLib.Enums Methods succ :: SpawnError -> SpawnError # pred :: SpawnError -> SpawnError # toEnum :: Int -> SpawnError # fromEnum :: SpawnError -> Int # enumFrom :: SpawnError -> [SpawnError] # enumFromThen :: SpawnError -> SpawnError -> [SpawnError] # enumFromTo :: SpawnError -> SpawnError -> [SpawnError] # enumFromThenTo :: SpawnError -> SpawnError -> SpawnError -> [SpawnError] #
Enum SliceConfig
Instance details Defined in GI.GLib.Enums Methods succ :: SliceConfig -> SliceConfig # pred :: SliceConfig -> SliceConfig # toEnum :: Int -> SliceConfig # fromEnum :: SliceConfig -> Int # enumFrom :: SliceConfig -> [SliceConfig] # enumFromThen :: SliceConfig -> SliceConfig -> [SliceConfig] # enumFromTo :: SliceConfig -> SliceConfig -> [SliceConfig] # enumFromThenTo :: SliceConfig -> SliceConfig -> SliceConfig -> [SliceConfig] #
Enum ShellError
Instance details Defined in GI.GLib.Enums Methods succ :: ShellError -> ShellError # pred :: ShellError -> ShellError # toEnum :: Int -> ShellError # fromEnum :: ShellError -> Int # enumFrom :: ShellError -> [ShellError] # enumFromThen :: ShellError -> ShellError -> [ShellError] # enumFromTo :: ShellError -> ShellError -> [ShellError] # enumFromThenTo :: ShellError -> ShellError -> ShellError -> [ShellError] #
Enum SeekType
Instance details Defined in GI.GLib.Enums Methods succ :: SeekType -> SeekType # pred :: SeekType -> SeekType # toEnum :: Int -> SeekType # fromEnum :: SeekType -> Int # enumFrom :: SeekType -> [SeekType] # enumFromThen :: SeekType -> SeekType -> [SeekType] # enumFromTo :: SeekType -> SeekType -> [SeekType] # enumFromThenTo :: SeekType -> SeekType -> SeekType -> [SeekType] #
Enum RegexError
Instance details Defined in GI.GLib.Enums Methods succ :: RegexError -> RegexError # pred :: RegexError -> RegexError # toEnum :: Int -> RegexError # fromEnum :: RegexError -> Int # enumFrom :: RegexError -> [RegexError] # enumFromThen :: RegexError -> RegexError -> [RegexError] # enumFromTo :: RegexError -> RegexError -> [RegexError] # enumFromThenTo :: RegexError -> RegexError -> RegexError -> [RegexError] #
Enum OptionError
Instance details Defined in GI.GLib.Enums Methods succ :: OptionError -> OptionError # pred :: OptionError -> OptionError # toEnum :: Int -> OptionError # fromEnum :: OptionError -> Int # enumFrom :: OptionError -> [OptionError] # enumFromThen :: OptionError -> OptionError -> [OptionError] # enumFromTo :: OptionError -> OptionError -> [OptionError] # enumFromThenTo :: OptionError -> OptionError -> OptionError -> [OptionError] #
Enum OptionArg
Instance details Defined in GI.GLib.Enums Methods succ :: OptionArg -> OptionArg # pred :: OptionArg -> OptionArg # toEnum :: Int -> OptionArg # fromEnum :: OptionArg -> Int # enumFrom :: OptionArg -> [OptionArg] # enumFromThen :: OptionArg -> OptionArg -> [OptionArg] # enumFromTo :: OptionArg -> OptionArg -> [OptionArg] # enumFromThenTo :: OptionArg -> OptionArg -> OptionArg -> [OptionArg] #
Enum OnceStatus
Instance details Defined in GI.GLib.Enums Methods succ :: OnceStatus -> OnceStatus # pred :: OnceStatus -> OnceStatus # toEnum :: Int -> OnceStatus # fromEnum :: OnceStatus -> Int # enumFrom :: OnceStatus -> [OnceStatus] # enumFromThen :: OnceStatus -> OnceStatus -> [OnceStatus] # enumFromTo :: OnceStatus -> OnceStatus -> [OnceStatus] # enumFromThenTo :: OnceStatus -> OnceStatus -> OnceStatus -> [OnceStatus] #
Enum NumberParserError
Instance details Defined in GI.GLib.Enums Methods succ :: NumberParserError -> NumberParserError # pred :: NumberParserError -> NumberParserError # toEnum :: Int -> NumberParserError # fromEnum :: NumberParserError -> Int # enumFrom :: NumberParserError -> [NumberParserError] # enumFromThen :: NumberParserError -> NumberParserError -> [NumberParserError] # enumFromTo :: NumberParserError -> NumberParserError -> [NumberParserError] # enumFromThenTo :: NumberParserError -> NumberParserError -> NumberParserError -> [NumberParserError] #
Enum NormalizeMode
Instance details Defined in GI.GLib.Enums Methods succ :: NormalizeMode -> NormalizeMode # pred :: NormalizeMode -> NormalizeMode # toEnum :: Int -> NormalizeMode # fromEnum :: NormalizeMode -> Int # enumFrom :: NormalizeMode -> [NormalizeMode] # enumFromThen :: NormalizeMode -> NormalizeMode -> [NormalizeMode] # enumFromTo :: NormalizeMode -> NormalizeMode -> [NormalizeMode] # enumFromThenTo :: NormalizeMode -> NormalizeMode -> NormalizeMode -> [NormalizeMode] #
Enum MarkupError
Instance details Defined in GI.GLib.Enums Methods succ :: MarkupError -> MarkupError # pred :: MarkupError -> MarkupError # toEnum :: Int -> MarkupError # fromEnum :: MarkupError -> Int # enumFrom :: MarkupError -> [MarkupError] # enumFromThen :: MarkupError -> MarkupError -> [MarkupError] # enumFromTo :: MarkupError -> MarkupError -> [MarkupError] # enumFromThenTo :: MarkupError -> MarkupError -> MarkupError -> [MarkupError] #
Enum LogWriterOutput
Instance details Defined in GI.GLib.Enums Methods succ :: LogWriterOutput -> LogWriterOutput # pred :: LogWriterOutput -> LogWriterOutput # toEnum :: Int -> LogWriterOutput # fromEnum :: LogWriterOutput -> Int # enumFrom :: LogWriterOutput -> [LogWriterOutput] # enumFromThen :: LogWriterOutput -> LogWriterOutput -> [LogWriterOutput] # enumFromTo :: LogWriterOutput -> LogWriterOutput -> [LogWriterOutput] # enumFromThenTo :: LogWriterOutput -> LogWriterOutput -> LogWriterOutput -> [LogWriterOutput] #
Enum KeyFileError
Instance details Defined in GI.GLib.Enums Methods succ :: KeyFileError -> KeyFileError # pred :: KeyFileError -> KeyFileError # toEnum :: Int -> KeyFileError # fromEnum :: KeyFileError -> Int # enumFrom :: KeyFileError -> [KeyFileError] # enumFromThen :: KeyFileError -> KeyFileError -> [KeyFileError] # enumFromTo :: KeyFileError -> KeyFileError -> [KeyFileError] # enumFromThenTo :: KeyFileError -> KeyFileError -> KeyFileError -> [KeyFileError] #
Enum IOStatus
Instance details Defined in GI.GLib.Enums Methods succ :: IOStatus -> IOStatus # pred :: IOStatus -> IOStatus # toEnum :: Int -> IOStatus # fromEnum :: IOStatus -> Int # enumFrom :: IOStatus -> [IOStatus] # enumFromThen :: IOStatus -> IOStatus -> [IOStatus] # enumFromTo :: IOStatus -> IOStatus -> [IOStatus] # enumFromThenTo :: IOStatus -> IOStatus -> IOStatus -> [IOStatus] #
Enum IOError
Instance details Defined in GI.GLib.Enums Methods succ :: IOError -> IOError # pred :: IOError -> IOError # toEnum :: Int -> IOError # fromEnum :: IOError -> Int # enumFrom :: IOError -> [IOError] # enumFromThen :: IOError -> IOError -> [IOError] # enumFromTo :: IOError -> IOError -> [IOError] # enumFromThenTo :: IOError -> IOError -> IOError -> [IOError] #
Enum IOChannelError
Instance details Defined in GI.GLib.Enums Methods succ :: IOChannelError -> IOChannelError # pred :: IOChannelError -> IOChannelError # toEnum :: Int -> IOChannelError # fromEnum :: IOChannelError -> Int # enumFrom :: IOChannelError -> [IOChannelError] # enumFromThen :: IOChannelError -> IOChannelError -> [IOChannelError] # enumFromTo :: IOChannelError -> IOChannelError -> [IOChannelError] # enumFromThenTo :: IOChannelError -> IOChannelError -> IOChannelError -> [IOChannelError] #
Enum FileError
Instance details Defined in GI.GLib.Enums Methods succ :: FileError -> FileError # pred :: FileError -> FileError # toEnum :: Int -> FileError # fromEnum :: FileError -> Int # enumFrom :: FileError -> [FileError] # enumFromThen :: FileError -> FileError -> [FileError] # enumFromTo :: FileError -> FileError -> [FileError] # enumFromThenTo :: FileError -> FileError -> FileError -> [FileError] #
Enum ErrorType
Instance details Defined in GI.GLib.Enums Methods succ :: ErrorType -> ErrorType # pred :: ErrorType -> ErrorType # toEnum :: Int -> ErrorType # fromEnum :: ErrorType -> Int # enumFrom :: ErrorType -> [ErrorType] # enumFromThen :: ErrorType -> ErrorType -> [ErrorType] # enumFromTo :: ErrorType -> ErrorType -> [ErrorType] # enumFromThenTo :: ErrorType -> ErrorType -> ErrorType -> [ErrorType] #
Enum DateWeekday
Instance details Defined in GI.GLib.Enums Methods succ :: DateWeekday -> DateWeekday # pred :: DateWeekday -> DateWeekday # toEnum :: Int -> DateWeekday # fromEnum :: DateWeekday -> Int # enumFrom :: DateWeekday -> [DateWeekday] # enumFromThen :: DateWeekday -> DateWeekday -> [DateWeekday] # enumFromTo :: DateWeekday -> DateWeekday -> [DateWeekday] # enumFromThenTo :: DateWeekday -> DateWeekday -> DateWeekday -> [DateWeekday] #
Enum DateMonth
Instance details Defined in GI.GLib.Enums Methods succ :: DateMonth -> DateMonth # pred :: DateMonth -> DateMonth # toEnum :: Int -> DateMonth # fromEnum :: DateMonth -> Int # enumFrom :: DateMonth -> [DateMonth] # enumFromThen :: DateMonth -> DateMonth -> [DateMonth] # enumFromTo :: DateMonth -> DateMonth -> [DateMonth] # enumFromThenTo :: DateMonth -> DateMonth -> DateMonth -> [DateMonth] #
Enum DateDMY
Instance details Defined in GI.GLib.Enums Methods succ :: DateDMY -> DateDMY # pred :: DateDMY -> DateDMY # toEnum :: Int -> DateDMY # fromEnum :: DateDMY -> Int # enumFrom :: DateDMY -> [DateDMY] # enumFromThen :: DateDMY -> DateDMY -> [DateDMY] # enumFromTo :: DateDMY -> DateDMY -> [DateDMY] # enumFromThenTo :: DateDMY -> DateDMY -> DateDMY -> [DateDMY] #
Enum ConvertError
Instance details Defined in GI.GLib.Enums Methods succ :: ConvertError -> ConvertError # pred :: ConvertError -> ConvertError # toEnum :: Int -> ConvertError # fromEnum :: ConvertError -> Int # enumFrom :: ConvertError -> [ConvertError] # enumFromThen :: ConvertError -> ConvertError -> [ConvertError] # enumFromTo :: ConvertError -> ConvertError -> [ConvertError] # enumFromThenTo :: ConvertError -> ConvertError -> ConvertError -> [ConvertError] #
Enum ChecksumType
Instance details Defined in GI.GLib.Enums Methods succ :: ChecksumType -> ChecksumType # pred :: ChecksumType -> ChecksumType # toEnum :: Int -> ChecksumType # fromEnum :: ChecksumType -> Int # enumFrom :: ChecksumType -> [ChecksumType] # enumFromThen :: ChecksumType -> ChecksumType -> [ChecksumType] # enumFromTo :: ChecksumType -> ChecksumType -> [ChecksumType] # enumFromThenTo :: ChecksumType -> ChecksumType -> ChecksumType -> [ChecksumType] #
Enum BookmarkFileError
Instance details Defined in GI.GLib.Enums Methods succ :: BookmarkFileError -> BookmarkFileError # pred :: BookmarkFileError -> BookmarkFileError # toEnum :: Int -> BookmarkFileError # fromEnum :: BookmarkFileError -> Int # enumFrom :: BookmarkFileError -> [BookmarkFileError] # enumFromThen :: BookmarkFileError -> BookmarkFileError -> [BookmarkFileError] # enumFromTo :: BookmarkFileError -> BookmarkFileError -> [BookmarkFileError] # enumFromThenTo :: BookmarkFileError -> BookmarkFileError -> BookmarkFileError -> [BookmarkFileError] #
Enum UIManagerItemType
Instance details Defined in GI.Gtk.Flags Methods succ :: UIManagerItemType -> UIManagerItemType # pred :: UIManagerItemType -> UIManagerItemType # toEnum :: Int -> UIManagerItemType # fromEnum :: UIManagerItemType -> Int # enumFrom :: UIManagerItemType -> [UIManagerItemType] # enumFromThen :: UIManagerItemType -> UIManagerItemType -> [UIManagerItemType] # enumFromTo :: UIManagerItemType -> UIManagerItemType -> [UIManagerItemType] # enumFromThenTo :: UIManagerItemType -> UIManagerItemType -> UIManagerItemType -> [UIManagerItemType] #
Enum TreeModelFlags
Instance details Defined in GI.Gtk.Flags Methods succ :: TreeModelFlags -> TreeModelFlags # pred :: TreeModelFlags -> TreeModelFlags # toEnum :: Int -> TreeModelFlags # fromEnum :: TreeModelFlags -> Int # enumFrom :: TreeModelFlags -> [TreeModelFlags] # enumFromThen :: TreeModelFlags -> TreeModelFlags -> [TreeModelFlags] # enumFromTo :: TreeModelFlags -> TreeModelFlags -> [TreeModelFlags] # enumFromThenTo :: TreeModelFlags -> TreeModelFlags -> TreeModelFlags -> [TreeModelFlags] #
Enum ToolPaletteDragTargets
Instance details Defined in GI.Gtk.Flags Methods succ :: ToolPaletteDragTargets -> ToolPaletteDragTargets # pred :: ToolPaletteDragTargets -> ToolPaletteDragTargets # toEnum :: Int -> ToolPaletteDragTargets # fromEnum :: ToolPaletteDragTargets -> Int # enumFrom :: ToolPaletteDragTargets -> [ToolPaletteDragTargets] # enumFromThen :: ToolPaletteDragTargets -> ToolPaletteDragTargets -> [ToolPaletteDragTargets] # enumFromTo :: ToolPaletteDragTargets -> ToolPaletteDragTargets -> [ToolPaletteDragTargets] # enumFromThenTo :: ToolPaletteDragTargets -> ToolPaletteDragTargets -> ToolPaletteDragTargets -> [ToolPaletteDragTargets] #
Enum TextSearchFlags
Instance details Defined in GI.Gtk.Flags Methods succ :: TextSearchFlags -> TextSearchFlags # pred :: TextSearchFlags -> TextSearchFlags # toEnum :: Int -> TextSearchFlags # fromEnum :: TextSearchFlags -> Int # enumFrom :: TextSearchFlags -> [TextSearchFlags] # enumFromThen :: TextSearchFlags -> TextSearchFlags -> [TextSearchFlags] # enumFromTo :: TextSearchFlags -> TextSearchFlags -> [TextSearchFlags] # enumFromThenTo :: TextSearchFlags -> TextSearchFlags -> TextSearchFlags -> [TextSearchFlags] #
Enum TargetFlags
Instance details Defined in GI.Gtk.Flags Methods succ :: TargetFlags -> TargetFlags # pred :: TargetFlags -> TargetFlags # toEnum :: Int -> TargetFlags # fromEnum :: TargetFlags -> Int # enumFrom :: TargetFlags -> [TargetFlags] # enumFromThen :: TargetFlags -> TargetFlags -> [TargetFlags] # enumFromTo :: TargetFlags -> TargetFlags -> [TargetFlags] # enumFromThenTo :: TargetFlags -> TargetFlags -> TargetFlags -> [TargetFlags] #
Enum StyleContextPrintFlags
Instance details Defined in GI.Gtk.Flags Methods succ :: StyleContextPrintFlags -> StyleContextPrintFlags # pred :: StyleContextPrintFlags -> StyleContextPrintFlags # toEnum :: Int -> StyleContextPrintFlags # fromEnum :: StyleContextPrintFlags -> Int # enumFrom :: StyleContextPrintFlags -> [StyleContextPrintFlags] # enumFromThen :: StyleContextPrintFlags -> StyleContextPrintFlags -> [StyleContextPrintFlags] # enumFromTo :: StyleContextPrintFlags -> StyleContextPrintFlags -> [StyleContextPrintFlags] # enumFromThenTo :: StyleContextPrintFlags -> StyleContextPrintFlags -> StyleContextPrintFlags -> [StyleContextPrintFlags] #
Enum StateFlags
Instance details Defined in GI.Gtk.Flags Methods succ :: StateFlags -> StateFlags # pred :: StateFlags -> StateFlags # toEnum :: Int -> StateFlags # fromEnum :: StateFlags -> Int # enumFrom :: StateFlags -> [StateFlags] # enumFromThen :: StateFlags -> StateFlags -> [StateFlags] # enumFromTo :: StateFlags -> StateFlags -> [StateFlags] # enumFromThenTo :: StateFlags -> StateFlags -> StateFlags -> [StateFlags] #
Enum RegionFlags
Instance details Defined in GI.Gtk.Flags Methods succ :: RegionFlags -> RegionFlags # pred :: RegionFlags -> RegionFlags # toEnum :: Int -> RegionFlags # fromEnum :: RegionFlags -> Int # enumFrom :: RegionFlags -> [RegionFlags] # enumFromThen :: RegionFlags -> RegionFlags -> [RegionFlags] # enumFromTo :: RegionFlags -> RegionFlags -> [RegionFlags] # enumFromThenTo :: RegionFlags -> RegionFlags -> RegionFlags -> [RegionFlags] #
Enum RecentFilterFlags
Instance details Defined in GI.Gtk.Flags Methods succ :: RecentFilterFlags -> RecentFilterFlags # pred :: RecentFilterFlags -> RecentFilterFlags # toEnum :: Int -> RecentFilterFlags # fromEnum :: RecentFilterFlags -> Int # enumFrom :: RecentFilterFlags -> [RecentFilterFlags] # enumFromThen :: RecentFilterFlags -> RecentFilterFlags -> [RecentFilterFlags] # enumFromTo :: RecentFilterFlags -> RecentFilterFlags -> [RecentFilterFlags] # enumFromThenTo :: RecentFilterFlags -> RecentFilterFlags -> RecentFilterFlags -> [RecentFilterFlags] #
Enum RcFlags
Instance details Defined in GI.Gtk.Flags Methods succ :: RcFlags -> RcFlags # pred :: RcFlags -> RcFlags # toEnum :: Int -> RcFlags # fromEnum :: RcFlags -> Int # enumFrom :: RcFlags -> [RcFlags] # enumFromThen :: RcFlags -> RcFlags -> [RcFlags] # enumFromTo :: RcFlags -> RcFlags -> [RcFlags] # enumFromThenTo :: RcFlags -> RcFlags -> RcFlags -> [RcFlags] #
Enum PlacesOpenFlags
Instance details Defined in GI.Gtk.Flags Methods succ :: PlacesOpenFlags -> PlacesOpenFlags # pred :: PlacesOpenFlags -> PlacesOpenFlags # toEnum :: Int -> PlacesOpenFlags # fromEnum :: PlacesOpenFlags -> Int # enumFrom :: PlacesOpenFlags -> [PlacesOpenFlags] # enumFromThen :: PlacesOpenFlags -> PlacesOpenFlags -> [PlacesOpenFlags] # enumFromTo :: PlacesOpenFlags -> PlacesOpenFlags -> [PlacesOpenFlags] # enumFromThenTo :: PlacesOpenFlags -> PlacesOpenFlags -> PlacesOpenFlags -> [PlacesOpenFlags] #
Enum JunctionSides
Instance details Defined in GI.Gtk.Flags Methods succ :: JunctionSides -> JunctionSides # pred :: JunctionSides -> JunctionSides # toEnum :: Int -> JunctionSides # fromEnum :: JunctionSides -> Int # enumFrom :: JunctionSides -> [JunctionSides] # enumFromThen :: JunctionSides -> JunctionSides -> [JunctionSides] # enumFromTo :: JunctionSides -> JunctionSides -> [JunctionSides] # enumFromThenTo :: JunctionSides -> JunctionSides -> JunctionSides -> [JunctionSides] #
Enum InputHints
Instance details Defined in GI.Gtk.Flags Methods succ :: InputHints -> InputHints # pred :: InputHints -> InputHints # toEnum :: Int -> InputHints # fromEnum :: InputHints -> Int # enumFrom :: InputHints -> [InputHints] # enumFromThen :: InputHints -> InputHints -> [InputHints] # enumFromTo :: InputHints -> InputHints -> [InputHints] # enumFromThenTo :: InputHints -> InputHints -> InputHints -> [InputHints] #
Enum IconLookupFlags
Instance details Defined in GI.Gtk.Flags Methods succ :: IconLookupFlags -> IconLookupFlags # pred :: IconLookupFlags -> IconLookupFlags # toEnum :: Int -> IconLookupFlags # fromEnum :: IconLookupFlags -> Int # enumFrom :: IconLookupFlags -> [IconLookupFlags] # enumFromThen :: IconLookupFlags -> IconLookupFlags -> [IconLookupFlags] # enumFromTo :: IconLookupFlags -> IconLookupFlags -> [IconLookupFlags] # enumFromThenTo :: IconLookupFlags -> IconLookupFlags -> IconLookupFlags -> [IconLookupFlags] #
Enum FontChooserLevel
Instance details Defined in GI.Gtk.Flags Methods succ :: FontChooserLevel -> FontChooserLevel # pred :: FontChooserLevel -> FontChooserLevel # toEnum :: Int -> FontChooserLevel # fromEnum :: FontChooserLevel -> Int # enumFrom :: FontChooserLevel -> [FontChooserLevel] # enumFromThen :: FontChooserLevel -> FontChooserLevel -> [FontChooserLevel] # enumFromTo :: FontChooserLevel -> FontChooserLevel -> [FontChooserLevel] # enumFromThenTo :: FontChooserLevel -> FontChooserLevel -> FontChooserLevel -> [FontChooserLevel] #
Enum FileFilterFlags
Instance details Defined in GI.Gtk.Flags Methods succ :: FileFilterFlags -> FileFilterFlags # pred :: FileFilterFlags -> FileFilterFlags # toEnum :: Int -> FileFilterFlags # fromEnum :: FileFilterFlags -> Int # enumFrom :: FileFilterFlags -> [FileFilterFlags] # enumFromThen :: FileFilterFlags -> FileFilterFlags -> [FileFilterFlags] # enumFromTo :: FileFilterFlags -> FileFilterFlags -> [FileFilterFlags] # enumFromThenTo :: FileFilterFlags -> FileFilterFlags -> FileFilterFlags -> [FileFilterFlags] #
Enum EventControllerScrollFlags
Instance details Defined in GI.Gtk.Flags Methods succ :: EventControllerScrollFlags -> EventControllerScrollFlags # pred :: EventControllerScrollFlags -> EventControllerScrollFlags # toEnum :: Int -> EventControllerScrollFlags # fromEnum :: EventControllerScrollFlags -> Int # enumFrom :: EventControllerScrollFlags -> [EventControllerScrollFlags] # enumFromThen :: EventControllerScrollFlags -> EventControllerScrollFlags -> [EventControllerScrollFlags] # enumFromTo :: EventControllerScrollFlags -> EventControllerScrollFlags -> [EventControllerScrollFlags] # enumFromThenTo :: EventControllerScrollFlags -> EventControllerScrollFlags -> EventControllerScrollFlags -> [EventControllerScrollFlags] #
Enum DialogFlags
Instance details Defined in GI.Gtk.Flags Methods succ :: DialogFlags -> DialogFlags # pred :: DialogFlags -> DialogFlags # toEnum :: Int -> DialogFlags # fromEnum :: DialogFlags -> Int # enumFrom :: DialogFlags -> [DialogFlags] # enumFromThen :: DialogFlags -> DialogFlags -> [DialogFlags] # enumFromTo :: DialogFlags -> DialogFlags -> [DialogFlags] # enumFromThenTo :: DialogFlags -> DialogFlags -> DialogFlags -> [DialogFlags] #
Enum DestDefaults
Instance details Defined in GI.Gtk.Flags Methods succ :: DestDefaults -> DestDefaults # pred :: DestDefaults -> DestDefaults # toEnum :: Int -> DestDefaults # fromEnum :: DestDefaults -> Int # enumFrom :: DestDefaults -> [DestDefaults] # enumFromThen :: DestDefaults -> DestDefaults -> [DestDefaults] # enumFromTo :: DestDefaults -> DestDefaults -> [DestDefaults] # enumFromThenTo :: DestDefaults -> DestDefaults -> DestDefaults -> [DestDefaults] #
Enum DebugFlag
Instance details Defined in GI.Gtk.Flags Methods succ :: DebugFlag -> DebugFlag # pred :: DebugFlag -> DebugFlag # toEnum :: Int -> DebugFlag # fromEnum :: DebugFlag -> Int # enumFrom :: DebugFlag -> [DebugFlag] # enumFromThen :: DebugFlag -> DebugFlag -> [DebugFlag] # enumFromTo :: DebugFlag -> DebugFlag -> [DebugFlag] # enumFromThenTo :: DebugFlag -> DebugFlag -> DebugFlag -> [DebugFlag] #
Enum CellRendererState
Instance details Defined in GI.Gtk.Flags Methods succ :: CellRendererState -> CellRendererState # pred :: CellRendererState -> CellRendererState # toEnum :: Int -> CellRendererState # fromEnum :: CellRendererState -> Int # enumFrom :: CellRendererState -> [CellRendererState] # enumFromThen :: CellRendererState -> CellRendererState -> [CellRendererState] # enumFromTo :: CellRendererState -> CellRendererState -> [CellRendererState] # enumFromThenTo :: CellRendererState -> CellRendererState -> CellRendererState -> [CellRendererState] #
Enum CalendarDisplayOptions
Instance details Defined in GI.Gtk.Flags Methods succ :: CalendarDisplayOptions -> CalendarDisplayOptions # pred :: CalendarDisplayOptions -> CalendarDisplayOptions # toEnum :: Int -> CalendarDisplayOptions # fromEnum :: CalendarDisplayOptions -> Int # enumFrom :: CalendarDisplayOptions -> [CalendarDisplayOptions] # enumFromThen :: CalendarDisplayOptions -> CalendarDisplayOptions -> [CalendarDisplayOptions] # enumFromTo :: CalendarDisplayOptions -> CalendarDisplayOptions -> [CalendarDisplayOptions] # enumFromThenTo :: CalendarDisplayOptions -> CalendarDisplayOptions -> CalendarDisplayOptions -> [CalendarDisplayOptions] #
Enum AttachOptions
Instance details Defined in GI.Gtk.Flags Methods succ :: AttachOptions -> AttachOptions # pred :: AttachOptions -> AttachOptions # toEnum :: Int -> AttachOptions # fromEnum :: AttachOptions -> Int # enumFrom :: AttachOptions -> [AttachOptions] # enumFromThen :: AttachOptions -> AttachOptions -> [AttachOptions] # enumFromTo :: AttachOptions -> AttachOptions -> [AttachOptions] # enumFromThenTo :: AttachOptions -> AttachOptions -> AttachOptions -> [AttachOptions] #
Enum ApplicationInhibitFlags
Instance details Defined in GI.Gtk.Flags Methods succ :: ApplicationInhibitFlags -> ApplicationInhibitFlags # pred :: ApplicationInhibitFlags -> ApplicationInhibitFlags # toEnum :: Int -> ApplicationInhibitFlags # fromEnum :: ApplicationInhibitFlags -> Int # enumFrom :: ApplicationInhibitFlags -> [ApplicationInhibitFlags] # enumFromThen :: ApplicationInhibitFlags -> ApplicationInhibitFlags -> [ApplicationInhibitFlags] # enumFromTo :: ApplicationInhibitFlags -> ApplicationInhibitFlags -> [ApplicationInhibitFlags] # enumFromThenTo :: ApplicationInhibitFlags -> ApplicationInhibitFlags -> ApplicationInhibitFlags -> [ApplicationInhibitFlags] #
Enum AccelFlags
Instance details Defined in GI.Gtk.Flags Methods succ :: AccelFlags -> AccelFlags # pred :: AccelFlags -> AccelFlags # toEnum :: Int -> AccelFlags # fromEnum :: AccelFlags -> Int # enumFrom :: AccelFlags -> [AccelFlags] # enumFromThen :: AccelFlags -> AccelFlags -> [AccelFlags] # enumFromTo :: AccelFlags -> AccelFlags -> [AccelFlags] # enumFromThenTo :: AccelFlags -> AccelFlags -> AccelFlags -> [AccelFlags] #
Enum WrapMode
Instance details Defined in GI.Gtk.Enums Methods succ :: WrapMode -> WrapMode # pred :: WrapMode -> WrapMode # toEnum :: Int -> WrapMode # fromEnum :: WrapMode -> Int # enumFrom :: WrapMode -> [WrapMode] # enumFromThen :: WrapMode -> WrapMode -> [WrapMode] # enumFromTo :: WrapMode -> WrapMode -> [WrapMode] # enumFromThenTo :: WrapMode -> WrapMode -> WrapMode -> [WrapMode] #
Enum WindowType
Instance details Defined in GI.Gtk.Enums Methods succ :: WindowType -> WindowType # pred :: WindowType -> WindowType # toEnum :: Int -> WindowType # fromEnum :: WindowType -> Int # enumFrom :: WindowType -> [WindowType] # enumFromThen :: WindowType -> WindowType -> [WindowType] # enumFromTo :: WindowType -> WindowType -> [WindowType] # enumFromThenTo :: WindowType -> WindowType -> WindowType -> [WindowType] #
Enum WindowPosition
Instance details Defined in GI.Gtk.Enums Methods succ :: WindowPosition -> WindowPosition # pred :: WindowPosition -> WindowPosition # toEnum :: Int -> WindowPosition # fromEnum :: WindowPosition -> Int # enumFrom :: WindowPosition -> [WindowPosition] # enumFromThen :: WindowPosition -> WindowPosition -> [WindowPosition] # enumFromTo :: WindowPosition -> WindowPosition -> [WindowPosition] # enumFromThenTo :: WindowPosition -> WindowPosition -> WindowPosition -> [WindowPosition] #
Enum WidgetHelpType
Instance details Defined in GI.Gtk.Enums Methods succ :: WidgetHelpType -> WidgetHelpType # pred :: WidgetHelpType -> WidgetHelpType # toEnum :: Int -> WidgetHelpType # fromEnum :: WidgetHelpType -> Int # enumFrom :: WidgetHelpType -> [WidgetHelpType] # enumFromThen :: WidgetHelpType -> WidgetHelpType -> [WidgetHelpType] # enumFromTo :: WidgetHelpType -> WidgetHelpType -> [WidgetHelpType] # enumFromThenTo :: WidgetHelpType -> WidgetHelpType -> WidgetHelpType -> [WidgetHelpType] #
Enum Unit
Instance details Defined in GI.Gtk.Enums Methods succ :: Unit -> Unit # pred :: Unit -> Unit # toEnum :: Int -> Unit # fromEnum :: Unit -> Int # enumFrom :: Unit -> [Unit] # enumFromThen :: Unit -> Unit -> [Unit] # enumFromTo :: Unit -> Unit -> [Unit] # enumFromThenTo :: Unit -> Unit -> Unit -> [Unit] #
Enum TreeViewGridLines
Instance details Defined in GI.Gtk.Enums Methods succ :: TreeViewGridLines -> TreeViewGridLines # pred :: TreeViewGridLines -> TreeViewGridLines # toEnum :: Int -> TreeViewGridLines # fromEnum :: TreeViewGridLines -> Int # enumFrom :: TreeViewGridLines -> [TreeViewGridLines] # enumFromThen :: TreeViewGridLines -> TreeViewGridLines -> [TreeViewGridLines] # enumFromTo :: TreeViewGridLines -> TreeViewGridLines -> [TreeViewGridLines] # enumFromThenTo :: TreeViewGridLines -> TreeViewGridLines -> TreeViewGridLines -> [TreeViewGridLines] #
Enum TreeViewDropPosition
Instance details Defined in GI.Gtk.Enums Methods succ :: TreeViewDropPosition -> TreeViewDropPosition # pred :: TreeViewDropPosition -> TreeViewDropPosition # toEnum :: Int -> TreeViewDropPosition # fromEnum :: TreeViewDropPosition -> Int # enumFrom :: TreeViewDropPosition -> [TreeViewDropPosition] # enumFromThen :: TreeViewDropPosition -> TreeViewDropPosition -> [TreeViewDropPosition] # enumFromTo :: TreeViewDropPosition -> TreeViewDropPosition -> [TreeViewDropPosition] # enumFromThenTo :: TreeViewDropPosition -> TreeViewDropPosition -> TreeViewDropPosition -> [TreeViewDropPosition] #
Enum TreeViewColumnSizing
Instance details Defined in GI.Gtk.Enums Methods succ :: TreeViewColumnSizing -> TreeViewColumnSizing # pred :: TreeViewColumnSizing -> TreeViewColumnSizing # toEnum :: Int -> TreeViewColumnSizing # fromEnum :: TreeViewColumnSizing -> Int # enumFrom :: TreeViewColumnSizing -> [TreeViewColumnSizing] # enumFromThen :: TreeViewColumnSizing -> TreeViewColumnSizing -> [TreeViewColumnSizing] # enumFromTo :: TreeViewColumnSizing -> TreeViewColumnSizing -> [TreeViewColumnSizing] # enumFromThenTo :: TreeViewColumnSizing -> TreeViewColumnSizing -> TreeViewColumnSizing -> [TreeViewColumnSizing] #
Enum ToolbarStyle
Instance details Defined in GI.Gtk.Enums Methods succ :: ToolbarStyle -> ToolbarStyle # pred :: ToolbarStyle -> ToolbarStyle # toEnum :: Int -> ToolbarStyle # fromEnum :: ToolbarStyle -> Int # enumFrom :: ToolbarStyle -> [ToolbarStyle] # enumFromThen :: ToolbarStyle -> ToolbarStyle -> [ToolbarStyle] # enumFromTo :: ToolbarStyle -> ToolbarStyle -> [ToolbarStyle] # enumFromThenTo :: ToolbarStyle -> ToolbarStyle -> ToolbarStyle -> [ToolbarStyle] #
Enum ToolbarSpaceStyle
Instance details Defined in GI.Gtk.Enums Methods succ :: ToolbarSpaceStyle -> ToolbarSpaceStyle # pred :: ToolbarSpaceStyle -> ToolbarSpaceStyle # toEnum :: Int -> ToolbarSpaceStyle # fromEnum :: ToolbarSpaceStyle -> Int # enumFrom :: ToolbarSpaceStyle -> [ToolbarSpaceStyle] # enumFromThen :: ToolbarSpaceStyle -> ToolbarSpaceStyle -> [ToolbarSpaceStyle] # enumFromTo :: ToolbarSpaceStyle -> ToolbarSpaceStyle -> [ToolbarSpaceStyle] # enumFromThenTo :: ToolbarSpaceStyle -> ToolbarSpaceStyle -> ToolbarSpaceStyle -> [ToolbarSpaceStyle] #
Enum TextWindowType
Instance details Defined in GI.Gtk.Enums Methods succ :: TextWindowType -> TextWindowType # pred :: TextWindowType -> TextWindowType # toEnum :: Int -> TextWindowType # fromEnum :: TextWindowType -> Int # enumFrom :: TextWindowType -> [TextWindowType] # enumFromThen :: TextWindowType -> TextWindowType -> [TextWindowType] # enumFromTo :: TextWindowType -> TextWindowType -> [TextWindowType] # enumFromThenTo :: TextWindowType -> TextWindowType -> TextWindowType -> [TextWindowType] #
Enum TextViewLayer
Instance details Defined in GI.Gtk.Enums Methods succ :: TextViewLayer -> TextViewLayer # pred :: TextViewLayer -> TextViewLayer # toEnum :: Int -> TextViewLayer # fromEnum :: TextViewLayer -> Int # enumFrom :: TextViewLayer -> [TextViewLayer] # enumFromThen :: TextViewLayer -> TextViewLayer -> [TextViewLayer] # enumFromTo :: TextViewLayer -> TextViewLayer -> [TextViewLayer] # enumFromThenTo :: TextViewLayer -> TextViewLayer -> TextViewLayer -> [TextViewLayer] #
Enum TextExtendSelection
Instance details Defined in GI.Gtk.Enums Methods succ :: TextExtendSelection -> TextExtendSelection # pred :: TextExtendSelection -> TextExtendSelection # toEnum :: Int -> TextExtendSelection # fromEnum :: TextExtendSelection -> Int # enumFrom :: TextExtendSelection -> [TextExtendSelection] # enumFromThen :: TextExtendSelection -> TextExtendSelection -> [TextExtendSelection] # enumFromTo :: TextExtendSelection -> TextExtendSelection -> [TextExtendSelection] # enumFromThenTo :: TextExtendSelection -> TextExtendSelection -> TextExtendSelection -> [TextExtendSelection] #
Enum TextDirection
Instance details Defined in GI.Gtk.Enums Methods succ :: TextDirection -> TextDirection # pred :: TextDirection -> TextDirection # toEnum :: Int -> TextDirection # fromEnum :: TextDirection -> Int # enumFrom :: TextDirection -> [TextDirection] # enumFromThen :: TextDirection -> TextDirection -> [TextDirection] # enumFromTo :: TextDirection -> TextDirection -> [TextDirection] # enumFromThenTo :: TextDirection -> TextDirection -> TextDirection -> [TextDirection] #
Enum TextBufferTargetInfo
Instance details Defined in GI.Gtk.Enums Methods succ :: TextBufferTargetInfo -> TextBufferTargetInfo # pred :: TextBufferTargetInfo -> TextBufferTargetInfo # toEnum :: Int -> TextBufferTargetInfo # fromEnum :: TextBufferTargetInfo -> Int # enumFrom :: TextBufferTargetInfo -> [TextBufferTargetInfo] # enumFromThen :: TextBufferTargetInfo -> TextBufferTargetInfo -> [TextBufferTargetInfo] # enumFromTo :: TextBufferTargetInfo -> TextBufferTargetInfo -> [TextBufferTargetInfo] # enumFromThenTo :: TextBufferTargetInfo -> TextBufferTargetInfo -> TextBufferTargetInfo -> [TextBufferTargetInfo] #
Enum StateType
Instance details Defined in GI.Gtk.Enums Methods succ :: StateType -> StateType # pred :: StateType -> StateType # toEnum :: Int -> StateType # fromEnum :: StateType -> Int # enumFrom :: StateType -> [StateType] # enumFromThen :: StateType -> StateType -> [StateType] # enumFromTo :: StateType -> StateType -> [StateType] # enumFromThenTo :: StateType -> StateType -> StateType -> [StateType] #
Enum StackTransitionType
Instance details Defined in GI.Gtk.Enums Methods succ :: StackTransitionType -> StackTransitionType # pred :: StackTransitionType -> StackTransitionType # toEnum :: Int -> StackTransitionType # fromEnum :: StackTransitionType -> Int # enumFrom :: StackTransitionType -> [StackTransitionType] # enumFromThen :: StackTransitionType -> StackTransitionType -> [StackTransitionType] # enumFromTo :: StackTransitionType -> StackTransitionType -> [StackTransitionType] # enumFromThenTo :: StackTransitionType -> StackTransitionType -> StackTransitionType -> [StackTransitionType] #
Enum SpinType
Instance details Defined in GI.Gtk.Enums Methods succ :: SpinType -> SpinType # pred :: SpinType -> SpinType # toEnum :: Int -> SpinType # fromEnum :: SpinType -> Int # enumFrom :: SpinType -> [SpinType] # enumFromThen :: SpinType -> SpinType -> [SpinType] # enumFromTo :: SpinType -> SpinType -> [SpinType] # enumFromThenTo :: SpinType -> SpinType -> SpinType -> [SpinType] #
Enum SpinButtonUpdatePolicy
Instance details Defined in GI.Gtk.Enums Methods succ :: SpinButtonUpdatePolicy -> SpinButtonUpdatePolicy # pred :: SpinButtonUpdatePolicy -> SpinButtonUpdatePolicy # toEnum :: Int -> SpinButtonUpdatePolicy # fromEnum :: SpinButtonUpdatePolicy -> Int # enumFrom :: SpinButtonUpdatePolicy -> [SpinButtonUpdatePolicy] # enumFromThen :: SpinButtonUpdatePolicy -> SpinButtonUpdatePolicy -> [SpinButtonUpdatePolicy] # enumFromTo :: SpinButtonUpdatePolicy -> SpinButtonUpdatePolicy -> [SpinButtonUpdatePolicy] # enumFromThenTo :: SpinButtonUpdatePolicy -> SpinButtonUpdatePolicy -> SpinButtonUpdatePolicy -> [SpinButtonUpdatePolicy] #
Enum SortType
Instance details Defined in GI.Gtk.Enums Methods succ :: SortType -> SortType # pred :: SortType -> SortType # toEnum :: Int -> SortType # fromEnum :: SortType -> Int # enumFrom :: SortType -> [SortType] # enumFromThen :: SortType -> SortType -> [SortType] # enumFromTo :: SortType -> SortType -> [SortType] # enumFromThenTo :: SortType -> SortType -> SortType -> [SortType] #
Enum SizeRequestMode
Instance details Defined in GI.Gtk.Enums Methods succ :: SizeRequestMode -> SizeRequestMode # pred :: SizeRequestMode -> SizeRequestMode # toEnum :: Int -> SizeRequestMode # fromEnum :: SizeRequestMode -> Int # enumFrom :: SizeRequestMode -> [SizeRequestMode] # enumFromThen :: SizeRequestMode -> SizeRequestMode -> [SizeRequestMode] # enumFromTo :: SizeRequestMode -> SizeRequestMode -> [SizeRequestMode] # enumFromThenTo :: SizeRequestMode -> SizeRequestMode -> SizeRequestMode -> [SizeRequestMode] #
Enum SizeGroupMode
Instance details Defined in GI.Gtk.Enums Methods succ :: SizeGroupMode -> SizeGroupMode # pred :: SizeGroupMode -> SizeGroupMode # toEnum :: Int -> SizeGroupMode # fromEnum :: SizeGroupMode -> Int # enumFrom :: SizeGroupMode -> [SizeGroupMode] # enumFromThen :: SizeGroupMode -> SizeGroupMode -> [SizeGroupMode] # enumFromTo :: SizeGroupMode -> SizeGroupMode -> [SizeGroupMode] # enumFromThenTo :: SizeGroupMode -> SizeGroupMode -> SizeGroupMode -> [SizeGroupMode] #
Enum ShortcutType
Instance details Defined in GI.Gtk.Enums Methods succ :: ShortcutType -> ShortcutType # pred :: ShortcutType -> ShortcutType # toEnum :: Int -> ShortcutType # fromEnum :: ShortcutType -> Int # enumFrom :: ShortcutType -> [ShortcutType] # enumFromThen :: ShortcutType -> ShortcutType -> [ShortcutType] # enumFromTo :: ShortcutType -> ShortcutType -> [ShortcutType] # enumFromThenTo :: ShortcutType -> ShortcutType -> ShortcutType -> [ShortcutType] #
Enum ShadowType
Instance details Defined in GI.Gtk.Enums Methods succ :: ShadowType -> ShadowType # pred :: ShadowType -> ShadowType # toEnum :: Int -> ShadowType # fromEnum :: ShadowType -> Int # enumFrom :: ShadowType -> [ShadowType] # enumFromThen :: ShadowType -> ShadowType -> [ShadowType] # enumFromTo :: ShadowType -> ShadowType -> [ShadowType] # enumFromThenTo :: ShadowType -> ShadowType -> ShadowType -> [ShadowType] #
Enum SensitivityType
Instance details Defined in GI.Gtk.Enums Methods succ :: SensitivityType -> SensitivityType # pred :: SensitivityType -> SensitivityType # toEnum :: Int -> SensitivityType # fromEnum :: SensitivityType -> Int # enumFrom :: SensitivityType -> [SensitivityType] # enumFromThen :: SensitivityType -> SensitivityType -> [SensitivityType] # enumFromTo :: SensitivityType -> SensitivityType -> [SensitivityType] # enumFromThenTo :: SensitivityType -> SensitivityType -> SensitivityType -> [SensitivityType] #
Enum SelectionMode
Instance details Defined in GI.Gtk.Enums Methods succ :: SelectionMode -> SelectionMode # pred :: SelectionMode -> SelectionMode # toEnum :: Int -> SelectionMode # fromEnum :: SelectionMode -> Int # enumFrom :: SelectionMode -> [SelectionMode] # enumFromThen :: SelectionMode -> SelectionMode -> [SelectionMode] # enumFromTo :: SelectionMode -> SelectionMode -> [SelectionMode] # enumFromThenTo :: SelectionMode -> SelectionMode -> SelectionMode -> [SelectionMode] #
Enum ScrollablePolicy
Instance details Defined in GI.Gtk.Enums Methods succ :: ScrollablePolicy -> ScrollablePolicy # pred :: ScrollablePolicy -> ScrollablePolicy # toEnum :: Int -> ScrollablePolicy # fromEnum :: ScrollablePolicy -> Int # enumFrom :: ScrollablePolicy -> [ScrollablePolicy] # enumFromThen :: ScrollablePolicy -> ScrollablePolicy -> [ScrollablePolicy] # enumFromTo :: ScrollablePolicy -> ScrollablePolicy -> [ScrollablePolicy] # enumFromThenTo :: ScrollablePolicy -> ScrollablePolicy -> ScrollablePolicy -> [ScrollablePolicy] #
Enum ScrollType
Instance details Defined in GI.Gtk.Enums Methods succ :: ScrollType -> ScrollType # pred :: ScrollType -> ScrollType # toEnum :: Int -> ScrollType # fromEnum :: ScrollType -> Int # enumFrom :: ScrollType -> [ScrollType] # enumFromThen :: ScrollType -> ScrollType -> [ScrollType] # enumFromTo :: ScrollType -> ScrollType -> [ScrollType] # enumFromThenTo :: ScrollType -> ScrollType -> ScrollType -> [ScrollType] #
Enum ScrollStep
Instance details Defined in GI.Gtk.Enums Methods succ :: ScrollStep -> ScrollStep # pred :: ScrollStep -> ScrollStep # toEnum :: Int -> ScrollStep # fromEnum :: ScrollStep -> Int # enumFrom :: ScrollStep -> [ScrollStep] # enumFromThen :: ScrollStep -> ScrollStep -> [ScrollStep] # enumFromTo :: ScrollStep -> ScrollStep -> [ScrollStep] # enumFromThenTo :: ScrollStep -> ScrollStep -> ScrollStep -> [ScrollStep] #
Enum RevealerTransitionType
Instance details Defined in GI.Gtk.Enums Methods succ :: RevealerTransitionType -> RevealerTransitionType # pred :: RevealerTransitionType -> RevealerTransitionType # toEnum :: Int -> RevealerTransitionType # fromEnum :: RevealerTransitionType -> Int # enumFrom :: RevealerTransitionType -> [RevealerTransitionType] # enumFromThen :: RevealerTransitionType -> RevealerTransitionType -> [RevealerTransitionType] # enumFromTo :: RevealerTransitionType -> RevealerTransitionType -> [RevealerTransitionType] # enumFromThenTo :: RevealerTransitionType -> RevealerTransitionType -> RevealerTransitionType -> [RevealerTransitionType] #
Enum ResponseType
Instance details Defined in GI.Gtk.Enums Methods succ :: ResponseType -> ResponseType # pred :: ResponseType -> ResponseType # toEnum :: Int -> ResponseType # fromEnum :: ResponseType -> Int # enumFrom :: ResponseType -> [ResponseType] # enumFromThen :: ResponseType -> ResponseType -> [ResponseType] # enumFromTo :: ResponseType -> ResponseType -> [ResponseType] # enumFromThenTo :: ResponseType -> ResponseType -> ResponseType -> [ResponseType] #
Enum ResizeMode
Instance details Defined in GI.Gtk.Enums Methods succ :: ResizeMode -> ResizeMode # pred :: ResizeMode -> ResizeMode # toEnum :: Int -> ResizeMode # fromEnum :: ResizeMode -> Int # enumFrom :: ResizeMode -> [ResizeMode] # enumFromThen :: ResizeMode -> ResizeMode -> [ResizeMode] # enumFromTo :: ResizeMode -> ResizeMode -> [ResizeMode] # enumFromThenTo :: ResizeMode -> ResizeMode -> ResizeMode -> [ResizeMode] #
Enum ReliefStyle
Instance details Defined in GI.Gtk.Enums Methods succ :: ReliefStyle -> ReliefStyle # pred :: ReliefStyle -> ReliefStyle # toEnum :: Int -> ReliefStyle # fromEnum :: ReliefStyle -> Int # enumFrom :: ReliefStyle -> [ReliefStyle] # enumFromThen :: ReliefStyle -> ReliefStyle -> [ReliefStyle] # enumFromTo :: ReliefStyle -> ReliefStyle -> [ReliefStyle] # enumFromThenTo :: ReliefStyle -> ReliefStyle -> ReliefStyle -> [ReliefStyle] #
Enum RecentSortType
Instance details Defined in GI.Gtk.Enums Methods succ :: RecentSortType -> RecentSortType # pred :: RecentSortType -> RecentSortType # toEnum :: Int -> RecentSortType # fromEnum :: RecentSortType -> Int # enumFrom :: RecentSortType -> [RecentSortType] # enumFromThen :: RecentSortType -> RecentSortType -> [RecentSortType] # enumFromTo :: RecentSortType -> RecentSortType -> [RecentSortType] # enumFromThenTo :: RecentSortType -> RecentSortType -> RecentSortType -> [RecentSortType] #
Enum RecentManagerError
Instance details Defined in GI.Gtk.Enums Methods succ :: RecentManagerError -> RecentManagerError # pred :: RecentManagerError -> RecentManagerError # toEnum :: Int -> RecentManagerError # fromEnum :: RecentManagerError -> Int # enumFrom :: RecentManagerError -> [RecentManagerError] # enumFromThen :: RecentManagerError -> RecentManagerError -> [RecentManagerError] # enumFromTo :: RecentManagerError -> RecentManagerError -> [RecentManagerError] # enumFromThenTo :: RecentManagerError -> RecentManagerError -> RecentManagerError -> [RecentManagerError] #
Enum RecentChooserError
Instance details Defined in GI.Gtk.Enums Methods succ :: RecentChooserError -> RecentChooserError # pred :: RecentChooserError -> RecentChooserError # toEnum :: Int -> RecentChooserError # fromEnum :: RecentChooserError -> Int # enumFrom :: RecentChooserError -> [RecentChooserError] # enumFromThen :: RecentChooserError -> RecentChooserError -> [RecentChooserError] # enumFromTo :: RecentChooserError -> RecentChooserError -> [RecentChooserError] # enumFromThenTo :: RecentChooserError -> RecentChooserError -> RecentChooserError -> [RecentChooserError] #
Enum RcTokenType
Instance details Defined in GI.Gtk.Enums Methods succ :: RcTokenType -> RcTokenType # pred :: RcTokenType -> RcTokenType # toEnum :: Int -> RcTokenType # fromEnum :: RcTokenType -> Int # enumFrom :: RcTokenType -> [RcTokenType] # enumFromThen :: RcTokenType -> RcTokenType -> [RcTokenType] # enumFromTo :: RcTokenType -> RcTokenType -> [RcTokenType] # enumFromThenTo :: RcTokenType -> RcTokenType -> RcTokenType -> [RcTokenType] #
Enum PropagationPhase
Instance details Defined in GI.Gtk.Enums Methods succ :: PropagationPhase -> PropagationPhase # pred :: PropagationPhase -> PropagationPhase # toEnum :: Int -> PropagationPhase # fromEnum :: PropagationPhase -> Int # enumFrom :: PropagationPhase -> [PropagationPhase] # enumFromThen :: PropagationPhase -> PropagationPhase -> [PropagationPhase] # enumFromTo :: PropagationPhase -> PropagationPhase -> [PropagationPhase] # enumFromThenTo :: PropagationPhase -> PropagationPhase -> PropagationPhase -> [PropagationPhase] #
Enum PrintStatus
Instance details Defined in GI.Gtk.Enums Methods succ :: PrintStatus -> PrintStatus # pred :: PrintStatus -> PrintStatus # toEnum :: Int -> PrintStatus # fromEnum :: PrintStatus -> Int # enumFrom :: PrintStatus -> [PrintStatus] # enumFromThen :: PrintStatus -> PrintStatus -> [PrintStatus] # enumFromTo :: PrintStatus -> PrintStatus -> [PrintStatus] # enumFromThenTo :: PrintStatus -> PrintStatus -> PrintStatus -> [PrintStatus] #
Enum PrintQuality
Instance details Defined in GI.Gtk.Enums Methods succ :: PrintQuality -> PrintQuality # pred :: PrintQuality -> PrintQuality # toEnum :: Int -> PrintQuality # fromEnum :: PrintQuality -> Int # enumFrom :: PrintQuality -> [PrintQuality] # enumFromThen :: PrintQuality -> PrintQuality -> [PrintQuality] # enumFromTo :: PrintQuality -> PrintQuality -> [PrintQuality] # enumFromThenTo :: PrintQuality -> PrintQuality -> PrintQuality -> [PrintQuality] #
Enum PrintPages
Instance details Defined in GI.Gtk.Enums Methods succ :: PrintPages -> PrintPages # pred :: PrintPages -> PrintPages # toEnum :: Int -> PrintPages # fromEnum :: PrintPages -> Int # enumFrom :: PrintPages -> [PrintPages] # enumFromThen :: PrintPages -> PrintPages -> [PrintPages] # enumFromTo :: PrintPages -> PrintPages -> [PrintPages] # enumFromThenTo :: PrintPages -> PrintPages -> PrintPages -> [PrintPages] #
Enum PrintOperationResult
Instance details Defined in GI.Gtk.Enums Methods succ :: PrintOperationResult -> PrintOperationResult # pred :: PrintOperationResult -> PrintOperationResult # toEnum :: Int -> PrintOperationResult # fromEnum :: PrintOperationResult -> Int # enumFrom :: PrintOperationResult -> [PrintOperationResult] # enumFromThen :: PrintOperationResult -> PrintOperationResult -> [PrintOperationResult] # enumFromTo :: PrintOperationResult -> PrintOperationResult -> [PrintOperationResult] # enumFromThenTo :: PrintOperationResult -> PrintOperationResult -> PrintOperationResult -> [PrintOperationResult] #
Enum PrintOperationAction
Instance details Defined in GI.Gtk.Enums Methods succ :: PrintOperationAction -> PrintOperationAction # pred :: PrintOperationAction -> PrintOperationAction # toEnum :: Int -> PrintOperationAction # fromEnum :: PrintOperationAction -> Int # enumFrom :: PrintOperationAction -> [PrintOperationAction] # enumFromThen :: PrintOperationAction -> PrintOperationAction -> [PrintOperationAction] # enumFromTo :: PrintOperationAction -> PrintOperationAction -> [PrintOperationAction] # enumFromThenTo :: PrintOperationAction -> PrintOperationAction -> PrintOperationAction -> [PrintOperationAction] #
Enum PrintError
Instance details Defined in GI.Gtk.Enums Methods succ :: PrintError -> PrintError # pred :: PrintError -> PrintError # toEnum :: Int -> PrintError # fromEnum :: PrintError -> Int # enumFrom :: PrintError -> [PrintError] # enumFromThen :: PrintError -> PrintError -> [PrintError] # enumFromTo :: PrintError -> PrintError -> [PrintError] # enumFromThenTo :: PrintError -> PrintError -> PrintError -> [PrintError] #
Enum PrintDuplex
Instance details Defined in GI.Gtk.Enums Methods succ :: PrintDuplex -> PrintDuplex # pred :: PrintDuplex -> PrintDuplex # toEnum :: Int -> PrintDuplex # fromEnum :: PrintDuplex -> Int # enumFrom :: PrintDuplex -> [PrintDuplex] # enumFromThen :: PrintDuplex -> PrintDuplex -> [PrintDuplex] # enumFromTo :: PrintDuplex -> PrintDuplex -> [PrintDuplex] # enumFromThenTo :: PrintDuplex -> PrintDuplex -> PrintDuplex -> [PrintDuplex] #
Enum PositionType
Instance details Defined in GI.Gtk.Enums Methods succ :: PositionType -> PositionType # pred :: PositionType -> PositionType # toEnum :: Int -> PositionType # fromEnum :: PositionType -> Int # enumFrom :: PositionType -> [PositionType] # enumFromThen :: PositionType -> PositionType -> [PositionType] # enumFromTo :: PositionType -> PositionType -> [PositionType] # enumFromThenTo :: PositionType -> PositionType -> PositionType -> [PositionType] #
Enum PopoverConstraint
Instance details Defined in GI.Gtk.Enums Methods succ :: PopoverConstraint -> PopoverConstraint # pred :: PopoverConstraint -> PopoverConstraint # toEnum :: Int -> PopoverConstraint # fromEnum :: PopoverConstraint -> Int # enumFrom :: PopoverConstraint -> [PopoverConstraint] # enumFromThen :: PopoverConstraint -> PopoverConstraint -> [PopoverConstraint] # enumFromTo :: PopoverConstraint -> PopoverConstraint -> [PopoverConstraint] # enumFromThenTo :: PopoverConstraint -> PopoverConstraint -> PopoverConstraint -> [PopoverConstraint] #
Enum PolicyType
Instance details Defined in GI.Gtk.Enums Methods succ :: PolicyType -> PolicyType # pred :: PolicyType -> PolicyType # toEnum :: Int -> PolicyType # fromEnum :: PolicyType -> Int # enumFrom :: PolicyType -> [PolicyType] # enumFromThen :: PolicyType -> PolicyType -> [PolicyType] # enumFromTo :: PolicyType -> PolicyType -> [PolicyType] # enumFromThenTo :: PolicyType -> PolicyType -> PolicyType -> [PolicyType] #
Enum PathType
Instance details Defined in GI.Gtk.Enums Methods succ :: PathType -> PathType # pred :: PathType -> PathType # toEnum :: Int -> PathType # fromEnum :: PathType -> Int # enumFrom :: PathType -> [PathType] # enumFromThen :: PathType -> PathType -> [PathType] # enumFromTo :: PathType -> PathType -> [PathType] # enumFromThenTo :: PathType -> PathType -> PathType -> [PathType] #
Enum PathPriorityType
Instance details Defined in GI.Gtk.Enums Methods succ :: PathPriorityType -> PathPriorityType # pred :: PathPriorityType -> PathPriorityType # toEnum :: Int -> PathPriorityType # fromEnum :: PathPriorityType -> Int # enumFrom :: PathPriorityType -> [PathPriorityType] # enumFromThen :: PathPriorityType -> PathPriorityType -> [PathPriorityType] # enumFromTo :: PathPriorityType -> PathPriorityType -> [PathPriorityType] # enumFromThenTo :: PathPriorityType -> PathPriorityType -> PathPriorityType -> [PathPriorityType] #
Enum PanDirection
Instance details Defined in GI.Gtk.Enums Methods succ :: PanDirection -> PanDirection # pred :: PanDirection -> PanDirection # toEnum :: Int -> PanDirection # fromEnum :: PanDirection -> Int # enumFrom :: PanDirection -> [PanDirection] # enumFromThen :: PanDirection -> PanDirection -> [PanDirection] # enumFromTo :: PanDirection -> PanDirection -> [PanDirection] # enumFromThenTo :: PanDirection -> PanDirection -> PanDirection -> [PanDirection] #
Enum PageSet
Instance details Defined in GI.Gtk.Enums Methods succ :: PageSet -> PageSet # pred :: PageSet -> PageSet # toEnum :: Int -> PageSet # fromEnum :: PageSet -> Int # enumFrom :: PageSet -> [PageSet] # enumFromThen :: PageSet -> PageSet -> [PageSet] # enumFromTo :: PageSet -> PageSet -> [PageSet] # enumFromThenTo :: PageSet -> PageSet -> PageSet -> [PageSet] #
Enum PageOrientation
Instance details Defined in GI.Gtk.Enums Methods succ :: PageOrientation -> PageOrientation # pred :: PageOrientation -> PageOrientation # toEnum :: Int -> PageOrientation # fromEnum :: PageOrientation -> Int # enumFrom :: PageOrientation -> [PageOrientation] # enumFromThen :: PageOrientation -> PageOrientation -> [PageOrientation] # enumFromTo :: PageOrientation -> PageOrientation -> [PageOrientation] # enumFromThenTo :: PageOrientation -> PageOrientation -> PageOrientation -> [PageOrientation] #
Enum PadActionType
Instance details Defined in GI.Gtk.Enums Methods succ :: PadActionType -> PadActionType # pred :: PadActionType -> PadActionType # toEnum :: Int -> PadActionType # fromEnum :: PadActionType -> Int # enumFrom :: PadActionType -> [PadActionType] # enumFromThen :: PadActionType -> PadActionType -> [PadActionType] # enumFromTo :: PadActionType -> PadActionType -> [PadActionType] # enumFromThenTo :: PadActionType -> PadActionType -> PadActionType -> [PadActionType] #
Enum PackType
Instance details Defined in GI.Gtk.Enums Methods succ :: PackType -> PackType # pred :: PackType -> PackType # toEnum :: Int -> PackType # fromEnum :: PackType -> Int # enumFrom :: PackType -> [PackType] # enumFromThen :: PackType -> PackType -> [PackType] # enumFromTo :: PackType -> PackType -> [PackType] # enumFromThenTo :: PackType -> PackType -> PackType -> [PackType] #
Enum PackDirection
Instance details Defined in GI.Gtk.Enums Methods succ :: PackDirection -> PackDirection # pred :: PackDirection -> PackDirection # toEnum :: Int -> PackDirection # fromEnum :: PackDirection -> Int # enumFrom :: PackDirection -> [PackDirection] # enumFromThen :: PackDirection -> PackDirection -> [PackDirection] # enumFromTo :: PackDirection -> PackDirection -> [PackDirection] # enumFromThenTo :: PackDirection -> PackDirection -> PackDirection -> [PackDirection] #
Enum Orientation
Instance details Defined in GI.Gtk.Enums Methods succ :: Orientation -> Orientation # pred :: Orientation -> Orientation # toEnum :: Int -> Orientation # fromEnum :: Orientation -> Int # enumFrom :: Orientation -> [Orientation] # enumFromThen :: Orientation -> Orientation -> [Orientation] # enumFromTo :: Orientation -> Orientation -> [Orientation] # enumFromThenTo :: Orientation -> Orientation -> Orientation -> [Orientation] #
Enum NumberUpLayout
Instance details Defined in GI.Gtk.Enums Methods succ :: NumberUpLayout -> NumberUpLayout # pred :: NumberUpLayout -> NumberUpLayout # toEnum :: Int -> NumberUpLayout # fromEnum :: NumberUpLayout -> Int # enumFrom :: NumberUpLayout -> [NumberUpLayout] # enumFromThen :: NumberUpLayout -> NumberUpLayout -> [NumberUpLayout] # enumFromTo :: NumberUpLayout -> NumberUpLayout -> [NumberUpLayout] # enumFromThenTo :: NumberUpLayout -> NumberUpLayout -> NumberUpLayout -> [NumberUpLayout] #
Enum NotebookTab
Instance details Defined in GI.Gtk.Enums Methods succ :: NotebookTab -> NotebookTab # pred :: NotebookTab -> NotebookTab # toEnum :: Int -> NotebookTab # fromEnum :: NotebookTab -> Int # enumFrom :: NotebookTab -> [NotebookTab] # enumFromThen :: NotebookTab -> NotebookTab -> [NotebookTab] # enumFromTo :: NotebookTab -> NotebookTab -> [NotebookTab] # enumFromThenTo :: NotebookTab -> NotebookTab -> NotebookTab -> [NotebookTab] #
Enum MovementStep
Instance details Defined in GI.Gtk.Enums Methods succ :: MovementStep -> MovementStep # pred :: MovementStep -> MovementStep # toEnum :: Int -> MovementStep # fromEnum :: MovementStep -> Int # enumFrom :: MovementStep -> [MovementStep] # enumFromThen :: MovementStep -> MovementStep -> [MovementStep] # enumFromTo :: MovementStep -> MovementStep -> [MovementStep] # enumFromThenTo :: MovementStep -> MovementStep -> MovementStep -> [MovementStep] #
Enum MessageType
Instance details Defined in GI.Gtk.Enums Methods succ :: MessageType -> MessageType # pred :: MessageType -> MessageType # toEnum :: Int -> MessageType # fromEnum :: MessageType -> Int # enumFrom :: MessageType -> [MessageType] # enumFromThen :: MessageType -> MessageType -> [MessageType] # enumFromTo :: MessageType -> MessageType -> [MessageType] # enumFromThenTo :: MessageType -> MessageType -> MessageType -> [MessageType] #
Enum MenuDirectionType
Instance details Defined in GI.Gtk.Enums Methods succ :: MenuDirectionType -> MenuDirectionType # pred :: MenuDirectionType -> MenuDirectionType # toEnum :: Int -> MenuDirectionType # fromEnum :: MenuDirectionType -> Int # enumFrom :: MenuDirectionType -> [MenuDirectionType] # enumFromThen :: MenuDirectionType -> MenuDirectionType -> [MenuDirectionType] # enumFromTo :: MenuDirectionType -> MenuDirectionType -> [MenuDirectionType] # enumFromThenTo :: MenuDirectionType -> MenuDirectionType -> MenuDirectionType -> [MenuDirectionType] #
Enum License
Instance details Defined in GI.Gtk.Enums Methods succ :: License -> License # pred :: License -> License # toEnum :: Int -> License # fromEnum :: License -> Int # enumFrom :: License -> [License] # enumFromThen :: License -> License -> [License] # enumFromTo :: License -> License -> [License] # enumFromThenTo :: License -> License -> License -> [License] #
Enum LevelBarMode
Instance details Defined in GI.Gtk.Enums Methods succ :: LevelBarMode -> LevelBarMode # pred :: LevelBarMode -> LevelBarMode # toEnum :: Int -> LevelBarMode # fromEnum :: LevelBarMode -> Int # enumFrom :: LevelBarMode -> [LevelBarMode] # enumFromThen :: LevelBarMode -> LevelBarMode -> [LevelBarMode] # enumFromTo :: LevelBarMode -> LevelBarMode -> [LevelBarMode] # enumFromThenTo :: LevelBarMode -> LevelBarMode -> LevelBarMode -> [LevelBarMode] #
Enum Justification
Instance details Defined in GI.Gtk.Enums Methods succ :: Justification -> Justification # pred :: Justification -> Justification # toEnum :: Int -> Justification # fromEnum :: Justification -> Int # enumFrom :: Justification -> [Justification] # enumFromThen :: Justification -> Justification -> [Justification] # enumFromTo :: Justification -> Justification -> [Justification] # enumFromThenTo :: Justification -> Justification -> Justification -> [Justification] #
Enum InputPurpose
Instance details Defined in GI.Gtk.Enums Methods succ :: InputPurpose -> InputPurpose # pred :: InputPurpose -> InputPurpose # toEnum :: Int -> InputPurpose # fromEnum :: InputPurpose -> Int # enumFrom :: InputPurpose -> [InputPurpose] # enumFromThen :: InputPurpose -> InputPurpose -> [InputPurpose] # enumFromTo :: InputPurpose -> InputPurpose -> [InputPurpose] # enumFromThenTo :: InputPurpose -> InputPurpose -> InputPurpose -> [InputPurpose] #
Enum ImageType
Instance details Defined in GI.Gtk.Enums Methods succ :: ImageType -> ImageType # pred :: ImageType -> ImageType # toEnum :: Int -> ImageType # fromEnum :: ImageType -> Int # enumFrom :: ImageType -> [ImageType] # enumFromThen :: ImageType -> ImageType -> [ImageType] # enumFromTo :: ImageType -> ImageType -> [ImageType] # enumFromThenTo :: ImageType -> ImageType -> ImageType -> [ImageType] #
Enum IconViewDropPosition
Instance details Defined in GI.Gtk.Enums Methods succ :: IconViewDropPosition -> IconViewDropPosition # pred :: IconViewDropPosition -> IconViewDropPosition # toEnum :: Int -> IconViewDropPosition # fromEnum :: IconViewDropPosition -> Int # enumFrom :: IconViewDropPosition -> [IconViewDropPosition] # enumFromThen :: IconViewDropPosition -> IconViewDropPosition -> [IconViewDropPosition] # enumFromTo :: IconViewDropPosition -> IconViewDropPosition -> [IconViewDropPosition] # enumFromThenTo :: IconViewDropPosition -> IconViewDropPosition -> IconViewDropPosition -> [IconViewDropPosition] #
Enum IconThemeError
Instance details Defined in GI.Gtk.Enums Methods succ :: IconThemeError -> IconThemeError # pred :: IconThemeError -> IconThemeError # toEnum :: Int -> IconThemeError # fromEnum :: IconThemeError -> Int # enumFrom :: IconThemeError -> [IconThemeError] # enumFromThen :: IconThemeError -> IconThemeError -> [IconThemeError] # enumFromTo :: IconThemeError -> IconThemeError -> [IconThemeError] # enumFromThenTo :: IconThemeError -> IconThemeError -> IconThemeError -> [IconThemeError] #
Enum IconSize
Instance details Defined in GI.Gtk.Enums Methods succ :: IconSize -> IconSize # pred :: IconSize -> IconSize # toEnum :: Int -> IconSize # fromEnum :: IconSize -> Int # enumFrom :: IconSize -> [IconSize] # enumFromThen :: IconSize -> IconSize -> [IconSize] # enumFromTo :: IconSize -> IconSize -> [IconSize] # enumFromThenTo :: IconSize -> IconSize -> IconSize -> [IconSize] #
Enum IMStatusStyle
Instance details Defined in GI.Gtk.Enums Methods succ :: IMStatusStyle -> IMStatusStyle # pred :: IMStatusStyle -> IMStatusStyle # toEnum :: Int -> IMStatusStyle # fromEnum :: IMStatusStyle -> Int # enumFrom :: IMStatusStyle -> [IMStatusStyle] # enumFromThen :: IMStatusStyle -> IMStatusStyle -> [IMStatusStyle] # enumFromTo :: IMStatusStyle -> IMStatusStyle -> [IMStatusStyle] # enumFromThenTo :: IMStatusStyle -> IMStatusStyle -> IMStatusStyle -> [IMStatusStyle] #
Enum IMPreeditStyle
Instance details Defined in GI.Gtk.Enums Methods succ :: IMPreeditStyle -> IMPreeditStyle # pred :: IMPreeditStyle -> IMPreeditStyle # toEnum :: Int -> IMPreeditStyle # fromEnum :: IMPreeditStyle -> Int # enumFrom :: IMPreeditStyle -> [IMPreeditStyle] # enumFromThen :: IMPreeditStyle -> IMPreeditStyle -> [IMPreeditStyle] # enumFromTo :: IMPreeditStyle -> IMPreeditStyle -> [IMPreeditStyle] # enumFromThenTo :: IMPreeditStyle -> IMPreeditStyle -> IMPreeditStyle -> [IMPreeditStyle] #
Enum FileChooserError
Instance details Defined in GI.Gtk.Enums Methods succ :: FileChooserError -> FileChooserError # pred :: FileChooserError -> FileChooserError # toEnum :: Int -> FileChooserError # fromEnum :: FileChooserError -> Int # enumFrom :: FileChooserError -> [FileChooserError] # enumFromThen :: FileChooserError -> FileChooserError -> [FileChooserError] # enumFromTo :: FileChooserError -> FileChooserError -> [FileChooserError] # enumFromThenTo :: FileChooserError -> FileChooserError -> FileChooserError -> [FileChooserError] #
Enum FileChooserConfirmation
Instance details Defined in GI.Gtk.Enums Methods succ :: FileChooserConfirmation -> FileChooserConfirmation # pred :: FileChooserConfirmation -> FileChooserConfirmation # toEnum :: Int -> FileChooserConfirmation # fromEnum :: FileChooserConfirmation -> Int # enumFrom :: FileChooserConfirmation -> [FileChooserConfirmation] # enumFromThen :: FileChooserConfirmation -> FileChooserConfirmation -> [FileChooserConfirmation] # enumFromTo :: FileChooserConfirmation -> FileChooserConfirmation -> [FileChooserConfirmation] # enumFromThenTo :: FileChooserConfirmation -> FileChooserConfirmation -> FileChooserConfirmation -> [FileChooserConfirmation] #
Enum FileChooserAction
Instance details Defined in GI.Gtk.Enums Methods succ :: FileChooserAction -> FileChooserAction # pred :: FileChooserAction -> FileChooserAction # toEnum :: Int -> FileChooserAction # fromEnum :: FileChooserAction -> Int # enumFrom :: FileChooserAction -> [FileChooserAction] # enumFromThen :: FileChooserAction -> FileChooserAction -> [FileChooserAction] # enumFromTo :: FileChooserAction -> FileChooserAction -> [FileChooserAction] # enumFromThenTo :: FileChooserAction -> FileChooserAction -> FileChooserAction -> [FileChooserAction] #
Enum ExpanderStyle
Instance details Defined in GI.Gtk.Enums Methods succ :: ExpanderStyle -> ExpanderStyle # pred :: ExpanderStyle -> ExpanderStyle # toEnum :: Int -> ExpanderStyle # fromEnum :: ExpanderStyle -> Int # enumFrom :: ExpanderStyle -> [ExpanderStyle] # enumFromThen :: ExpanderStyle -> ExpanderStyle -> [ExpanderStyle] # enumFromTo :: ExpanderStyle -> ExpanderStyle -> [ExpanderStyle] # enumFromThenTo :: ExpanderStyle -> ExpanderStyle -> ExpanderStyle -> [ExpanderStyle] #
Enum EventSequenceState
Instance details Defined in GI.Gtk.Enums Methods succ :: EventSequenceState -> EventSequenceState # pred :: EventSequenceState -> EventSequenceState # toEnum :: Int -> EventSequenceState # fromEnum :: EventSequenceState -> Int # enumFrom :: EventSequenceState -> [EventSequenceState] # enumFromThen :: EventSequenceState -> EventSequenceState -> [EventSequenceState] # enumFromTo :: EventSequenceState -> EventSequenceState -> [EventSequenceState] # enumFromThenTo :: EventSequenceState -> EventSequenceState -> EventSequenceState -> [EventSequenceState] #
Enum EntryIconPosition
Instance details Defined in GI.Gtk.Enums Methods succ :: EntryIconPosition -> EntryIconPosition # pred :: EntryIconPosition -> EntryIconPosition # toEnum :: Int -> EntryIconPosition # fromEnum :: EntryIconPosition -> Int # enumFrom :: EntryIconPosition -> [EntryIconPosition] # enumFromThen :: EntryIconPosition -> EntryIconPosition -> [EntryIconPosition] # enumFromTo :: EntryIconPosition -> EntryIconPosition -> [EntryIconPosition] # enumFromThenTo :: EntryIconPosition -> EntryIconPosition -> EntryIconPosition -> [EntryIconPosition] #
Enum DragResult
Instance details Defined in GI.Gtk.Enums Methods succ :: DragResult -> DragResult # pred :: DragResult -> DragResult # toEnum :: Int -> DragResult # fromEnum :: DragResult -> Int # enumFrom :: DragResult -> [DragResult] # enumFromThen :: DragResult -> DragResult -> [DragResult] # enumFromTo :: DragResult -> DragResult -> [DragResult] # enumFromThenTo :: DragResult -> DragResult -> DragResult -> [DragResult] #
Enum DirectionType
Instance details Defined in GI.Gtk.Enums Methods succ :: DirectionType -> DirectionType # pred :: DirectionType -> DirectionType # toEnum :: Int -> DirectionType # fromEnum :: DirectionType -> Int # enumFrom :: DirectionType -> [DirectionType] # enumFromThen :: DirectionType -> DirectionType -> [DirectionType] # enumFromTo :: DirectionType -> DirectionType -> [DirectionType] # enumFromThenTo :: DirectionType -> DirectionType -> DirectionType -> [DirectionType] #
Enum DeleteType
Instance details Defined in GI.Gtk.Enums Methods succ :: DeleteType -> DeleteType # pred :: DeleteType -> DeleteType # toEnum :: Int -> DeleteType # fromEnum :: DeleteType -> Int # enumFrom :: DeleteType -> [DeleteType] # enumFromThen :: DeleteType -> DeleteType -> [DeleteType] # enumFromTo :: DeleteType -> DeleteType -> [DeleteType] # enumFromThenTo :: DeleteType -> DeleteType -> DeleteType -> [DeleteType] #
Enum CssSectionType
Instance details Defined in GI.Gtk.Enums Methods succ :: CssSectionType -> CssSectionType # pred :: CssSectionType -> CssSectionType # toEnum :: Int -> CssSectionType # fromEnum :: CssSectionType -> Int # enumFrom :: CssSectionType -> [CssSectionType] # enumFromThen :: CssSectionType -> CssSectionType -> [CssSectionType] # enumFromTo :: CssSectionType -> CssSectionType -> [CssSectionType] # enumFromThenTo :: CssSectionType -> CssSectionType -> CssSectionType -> [CssSectionType] #
Enum CssProviderError
Instance details Defined in GI.Gtk.Enums Methods succ :: CssProviderError -> CssProviderError # pred :: CssProviderError -> CssProviderError # toEnum :: Int -> CssProviderError # fromEnum :: CssProviderError -> Int # enumFrom :: CssProviderError -> [CssProviderError] # enumFromThen :: CssProviderError -> CssProviderError -> [CssProviderError] # enumFromTo :: CssProviderError -> CssProviderError -> [CssProviderError] # enumFromThenTo :: CssProviderError -> CssProviderError -> CssProviderError -> [CssProviderError] #
Enum CornerType
Instance details Defined in GI.Gtk.Enums Methods succ :: CornerType -> CornerType # pred :: CornerType -> CornerType # toEnum :: Int -> CornerType # fromEnum :: CornerType -> Int # enumFrom :: CornerType -> [CornerType] # enumFromThen :: CornerType -> CornerType -> [CornerType] # enumFromTo :: CornerType -> CornerType -> [CornerType] # enumFromThenTo :: CornerType -> CornerType -> CornerType -> [CornerType] #
Enum CellRendererMode
Instance details Defined in GI.Gtk.Enums Methods succ :: CellRendererMode -> CellRendererMode # pred :: CellRendererMode -> CellRendererMode # toEnum :: Int -> CellRendererMode # fromEnum :: CellRendererMode -> Int # enumFrom :: CellRendererMode -> [CellRendererMode] # enumFromThen :: CellRendererMode -> CellRendererMode -> [CellRendererMode] # enumFromTo :: CellRendererMode -> CellRendererMode -> [CellRendererMode] # enumFromThenTo :: CellRendererMode -> CellRendererMode -> CellRendererMode -> [CellRendererMode] #
Enum CellRendererAccelMode
Instance details Defined in GI.Gtk.Enums Methods succ :: CellRendererAccelMode -> CellRendererAccelMode # pred :: CellRendererAccelMode -> CellRendererAccelMode # toEnum :: Int -> CellRendererAccelMode # fromEnum :: CellRendererAccelMode -> Int # enumFrom :: CellRendererAccelMode -> [CellRendererAccelMode] # enumFromThen :: CellRendererAccelMode -> CellRendererAccelMode -> [CellRendererAccelMode] # enumFromTo :: CellRendererAccelMode -> CellRendererAccelMode -> [CellRendererAccelMode] # enumFromThenTo :: CellRendererAccelMode -> CellRendererAccelMode -> CellRendererAccelMode -> [CellRendererAccelMode] #
Enum ButtonsType
Instance details Defined in GI.Gtk.Enums Methods succ :: ButtonsType -> ButtonsType # pred :: ButtonsType -> ButtonsType # toEnum :: Int -> ButtonsType # fromEnum :: ButtonsType -> Int # enumFrom :: ButtonsType -> [ButtonsType] # enumFromThen :: ButtonsType -> ButtonsType -> [ButtonsType] # enumFromTo :: ButtonsType -> ButtonsType -> [ButtonsType] # enumFromThenTo :: ButtonsType -> ButtonsType -> ButtonsType -> [ButtonsType] #
Enum ButtonRole
Instance details Defined in GI.Gtk.Enums Methods succ :: ButtonRole -> ButtonRole # pred :: ButtonRole -> ButtonRole # toEnum :: Int -> ButtonRole # fromEnum :: ButtonRole -> Int # enumFrom :: ButtonRole -> [ButtonRole] # enumFromThen :: ButtonRole -> ButtonRole -> [ButtonRole] # enumFromTo :: ButtonRole -> ButtonRole -> [ButtonRole] # enumFromThenTo :: ButtonRole -> ButtonRole -> ButtonRole -> [ButtonRole] #
Enum ButtonBoxStyle
Instance details Defined in GI.Gtk.Enums Methods succ :: ButtonBoxStyle -> ButtonBoxStyle # pred :: ButtonBoxStyle -> ButtonBoxStyle # toEnum :: Int -> ButtonBoxStyle # fromEnum :: ButtonBoxStyle -> Int # enumFrom :: ButtonBoxStyle -> [ButtonBoxStyle] # enumFromThen :: ButtonBoxStyle -> ButtonBoxStyle -> [ButtonBoxStyle] # enumFromTo :: ButtonBoxStyle -> ButtonBoxStyle -> [ButtonBoxStyle] # enumFromThenTo :: ButtonBoxStyle -> ButtonBoxStyle -> ButtonBoxStyle -> [ButtonBoxStyle] #
Enum BuilderError
Instance details Defined in GI.Gtk.Enums Methods succ :: BuilderError -> BuilderError # pred :: BuilderError -> BuilderError # toEnum :: Int -> BuilderError # fromEnum :: BuilderError -> Int # enumFrom :: BuilderError -> [BuilderError] # enumFromThen :: BuilderError -> BuilderError -> [BuilderError] # enumFromTo :: BuilderError -> BuilderError -> [BuilderError] # enumFromThenTo :: BuilderError -> BuilderError -> BuilderError -> [BuilderError] #
Enum BorderStyle
Instance details Defined in GI.Gtk.Enums Methods succ :: BorderStyle -> BorderStyle # pred :: BorderStyle -> BorderStyle # toEnum :: Int -> BorderStyle # fromEnum :: BorderStyle -> Int # enumFrom :: BorderStyle -> [BorderStyle] # enumFromThen :: BorderStyle -> BorderStyle -> [BorderStyle] # enumFromTo :: BorderStyle -> BorderStyle -> [BorderStyle] # enumFromThenTo :: BorderStyle -> BorderStyle -> BorderStyle -> [BorderStyle] #
Enum BaselinePosition
Instance details Defined in GI.Gtk.Enums Methods succ :: BaselinePosition -> BaselinePosition # pred :: BaselinePosition -> BaselinePosition # toEnum :: Int -> BaselinePosition # fromEnum :: BaselinePosition -> Int # enumFrom :: BaselinePosition -> [BaselinePosition] # enumFromThen :: BaselinePosition -> BaselinePosition -> [BaselinePosition] # enumFromTo :: BaselinePosition -> BaselinePosition -> [BaselinePosition] # enumFromThenTo :: BaselinePosition -> BaselinePosition -> BaselinePosition -> [BaselinePosition] #
Enum AssistantPageType
Instance details Defined in GI.Gtk.Enums Methods succ :: AssistantPageType -> AssistantPageType # pred :: AssistantPageType -> AssistantPageType # toEnum :: Int -> AssistantPageType # fromEnum :: AssistantPageType -> Int # enumFrom :: AssistantPageType -> [AssistantPageType] # enumFromThen :: AssistantPageType -> AssistantPageType -> [AssistantPageType] # enumFromTo :: AssistantPageType -> AssistantPageType -> [AssistantPageType] # enumFromThenTo :: AssistantPageType -> AssistantPageType -> AssistantPageType -> [AssistantPageType] #
Enum ArrowType
Instance details Defined in GI.Gtk.Enums Methods succ :: ArrowType -> ArrowType # pred :: ArrowType -> ArrowType # toEnum :: Int -> ArrowType # fromEnum :: ArrowType -> Int # enumFrom :: ArrowType -> [ArrowType] # enumFromThen :: ArrowType -> ArrowType -> [ArrowType] # enumFromTo :: ArrowType -> ArrowType -> [ArrowType] # enumFromThenTo :: ArrowType -> ArrowType -> ArrowType -> [ArrowType] #
Enum ArrowPlacement
Instance details Defined in GI.Gtk.Enums Methods succ :: ArrowPlacement -> ArrowPlacement # pred :: ArrowPlacement -> ArrowPlacement # toEnum :: Int -> ArrowPlacement # fromEnum :: ArrowPlacement -> Int # enumFrom :: ArrowPlacement -> [ArrowPlacement] # enumFromThen :: ArrowPlacement -> ArrowPlacement -> [ArrowPlacement] # enumFromTo :: ArrowPlacement -> ArrowPlacement -> [ArrowPlacement] # enumFromThenTo :: ArrowPlacement -> ArrowPlacement -> ArrowPlacement -> [ArrowPlacement] #
Enum Align
Instance details Defined in GI.Gtk.Enums Methods succ :: Align -> Align # pred :: Align -> Align # toEnum :: Int -> Align # fromEnum :: Align -> Int # enumFrom :: Align -> [Align] # enumFromThen :: Align -> Align -> [Align] # enumFromTo :: Align -> Align -> [Align] # enumFromThenTo :: Align -> Align -> Align -> [Align] #
Enum WrapMode
Instance details Defined in GI.Pango.Enums Methods succ :: WrapMode -> WrapMode # pred :: WrapMode -> WrapMode # toEnum :: Int -> WrapMode # fromEnum :: WrapMode -> Int # enumFrom :: WrapMode -> [WrapMode] # enumFromThen :: WrapMode -> WrapMode -> [WrapMode] # enumFromTo :: WrapMode -> WrapMode -> [WrapMode] # enumFromThenTo :: WrapMode -> WrapMode -> WrapMode -> [WrapMode] #
Enum Weight
Instance details Defined in GI.Pango.Enums Methods succ :: Weight -> Weight # pred :: Weight -> Weight # toEnum :: Int -> Weight # fromEnum :: Weight -> Int # enumFrom :: Weight -> [Weight] # enumFromThen :: Weight -> Weight -> [Weight] # enumFromTo :: Weight -> Weight -> [Weight] # enumFromThenTo :: Weight -> Weight -> Weight -> [Weight] #
Enum Variant
Instance details Defined in GI.Pango.Enums Methods succ :: Variant -> Variant # pred :: Variant -> Variant # toEnum :: Int -> Variant # fromEnum :: Variant -> Int # enumFrom :: Variant -> [Variant] # enumFromThen :: Variant -> Variant -> [Variant] # enumFromTo :: Variant -> Variant -> [Variant] # enumFromThenTo :: Variant -> Variant -> Variant -> [Variant] #
Enum Underline
Instance details Defined in GI.Pango.Enums Methods succ :: Underline -> Underline # pred :: Underline -> Underline # toEnum :: Int -> Underline # fromEnum :: Underline -> Int # enumFrom :: Underline -> [Underline] # enumFromThen :: Underline -> Underline -> [Underline] # enumFromTo :: Underline -> Underline -> [Underline] # enumFromThenTo :: Underline -> Underline -> Underline -> [Underline] #
Enum TabAlign
Instance details Defined in GI.Pango.Enums Methods succ :: TabAlign -> TabAlign # pred :: TabAlign -> TabAlign # toEnum :: Int -> TabAlign # fromEnum :: TabAlign -> Int # enumFrom :: TabAlign -> [TabAlign] # enumFromThen :: TabAlign -> TabAlign -> [TabAlign] # enumFromTo :: TabAlign -> TabAlign -> [TabAlign] # enumFromThenTo :: TabAlign -> TabAlign -> TabAlign -> [TabAlign] #
Enum Style
Instance details Defined in GI.Pango.Enums Methods succ :: Style -> Style # pred :: Style -> Style # toEnum :: Int -> Style # fromEnum :: Style -> Int # enumFrom :: Style -> [Style] # enumFromThen :: Style -> Style -> [Style] # enumFromTo :: Style -> Style -> [Style] # enumFromThenTo :: Style -> Style -> Style -> [Style] #
Enum Stretch
Instance details Defined in GI.Pango.Enums Methods succ :: Stretch -> Stretch # pred :: Stretch -> Stretch # toEnum :: Int -> Stretch # fromEnum :: Stretch -> Int # enumFrom :: Stretch -> [Stretch] # enumFromThen :: Stretch -> Stretch -> [Stretch] # enumFromTo :: Stretch -> Stretch -> [Stretch] # enumFromThenTo :: Stretch -> Stretch -> Stretch -> [Stretch] #
Enum Script
Instance details Defined in GI.Pango.Enums Methods succ :: Script -> Script # pred :: Script -> Script # toEnum :: Int -> Script # fromEnum :: Script -> Int # enumFrom :: Script -> [Script] # enumFromThen :: Script -> Script -> [Script] # enumFromTo :: Script -> Script -> [Script] # enumFromThenTo :: Script -> Script -> Script -> [Script] #
Enum RenderPart
Instance details Defined in GI.Pango.Enums Methods succ :: RenderPart -> RenderPart # pred :: RenderPart -> RenderPart # toEnum :: Int -> RenderPart # fromEnum :: RenderPart -> Int # enumFrom :: RenderPart -> [RenderPart] # enumFromThen :: RenderPart -> RenderPart -> [RenderPart] # enumFromTo :: RenderPart -> RenderPart -> [RenderPart] # enumFromThenTo :: RenderPart -> RenderPart -> RenderPart -> [RenderPart] #
Enum GravityHint
Instance details Defined in GI.Pango.Enums Methods succ :: GravityHint -> GravityHint # pred :: GravityHint -> GravityHint # toEnum :: Int -> GravityHint # fromEnum :: GravityHint -> Int # enumFrom :: GravityHint -> [GravityHint] # enumFromThen :: GravityHint -> GravityHint -> [GravityHint] # enumFromTo :: GravityHint -> GravityHint -> [GravityHint] # enumFromThenTo :: GravityHint -> GravityHint -> GravityHint -> [GravityHint] #
Enum Gravity
Instance details Defined in GI.Pango.Enums Methods succ :: Gravity -> Gravity # pred :: Gravity -> Gravity # toEnum :: Int -> Gravity # fromEnum :: Gravity -> Int # enumFrom :: Gravity -> [Gravity] # enumFromThen :: Gravity -> Gravity -> [Gravity] # enumFromTo :: Gravity -> Gravity -> [Gravity] # enumFromThenTo :: Gravity -> Gravity -> Gravity -> [Gravity] #
Enum EllipsizeMode
Instance details Defined in GI.Pango.Enums Methods succ :: EllipsizeMode -> EllipsizeMode # pred :: EllipsizeMode -> EllipsizeMode # toEnum :: Int -> EllipsizeMode # fromEnum :: EllipsizeMode -> Int # enumFrom :: EllipsizeMode -> [EllipsizeMode] # enumFromThen :: EllipsizeMode -> EllipsizeMode -> [EllipsizeMode] # enumFromTo :: EllipsizeMode -> EllipsizeMode -> [EllipsizeMode] # enumFromThenTo :: EllipsizeMode -> EllipsizeMode -> EllipsizeMode -> [EllipsizeMode] #
Enum Direction
Instance details Defined in GI.Pango.Enums Methods succ :: Direction -> Direction # pred :: Direction -> Direction # toEnum :: Int -> Direction # fromEnum :: Direction -> Int # enumFrom :: Direction -> [Direction] # enumFromThen :: Direction -> Direction -> [Direction] # enumFromTo :: Direction -> Direction -> [Direction] # enumFromThenTo :: Direction -> Direction -> Direction -> [Direction] #
Enum CoverageLevel
Instance details Defined in GI.Pango.Enums Methods succ :: CoverageLevel -> CoverageLevel # pred :: CoverageLevel -> CoverageLevel # toEnum :: Int -> CoverageLevel # fromEnum :: CoverageLevel -> Int # enumFrom :: CoverageLevel -> [CoverageLevel] # enumFromThen :: CoverageLevel -> CoverageLevel -> [CoverageLevel] # enumFromTo :: CoverageLevel -> CoverageLevel -> [CoverageLevel] # enumFromThenTo :: CoverageLevel -> CoverageLevel -> CoverageLevel -> [CoverageLevel] #
Enum BidiType
Instance details Defined in GI.Pango.Enums Methods succ :: BidiType -> BidiType # pred :: BidiType -> BidiType # toEnum :: Int -> BidiType # fromEnum :: BidiType -> Int # enumFrom :: BidiType -> [BidiType] # enumFromThen :: BidiType -> BidiType -> [BidiType] # enumFromTo :: BidiType -> BidiType -> [BidiType] # enumFromThenTo :: BidiType -> BidiType -> BidiType -> [BidiType] #
Enum AttrType
Instance details Defined in GI.Pango.Enums Methods succ :: AttrType -> AttrType # pred :: AttrType -> AttrType # toEnum :: Int -> AttrType # fromEnum :: AttrType -> Int # enumFrom :: AttrType -> [AttrType] # enumFromThen :: AttrType -> AttrType -> [AttrType] # enumFromTo :: AttrType -> AttrType -> [AttrType] # enumFromThenTo :: AttrType -> AttrType -> AttrType -> [AttrType] #
Enum Alignment
Instance details Defined in GI.Pango.Enums Methods succ :: Alignment -> Alignment # pred :: Alignment -> Alignment # toEnum :: Int -> Alignment # fromEnum :: Alignment -> Int # enumFrom :: Alignment -> [Alignment] # enumFromThen :: Alignment -> Alignment -> [Alignment] # enumFromTo :: Alignment -> Alignment -> [Alignment] # enumFromThenTo :: Alignment -> Alignment -> Alignment -> [Alignment] #
Enum PtyFlags
Instance details Defined in GI.Vte.Flags Methods succ :: PtyFlags -> PtyFlags # pred :: PtyFlags -> PtyFlags # toEnum :: Int -> PtyFlags # fromEnum :: PtyFlags -> Int # enumFrom :: PtyFlags -> [PtyFlags] # enumFromThen :: PtyFlags -> PtyFlags -> [PtyFlags] # enumFromTo :: PtyFlags -> PtyFlags -> [PtyFlags] # enumFromThenTo :: PtyFlags -> PtyFlags -> PtyFlags -> [PtyFlags] #
Enum WriteFlags
Instance details Defined in GI.Vte.Enums Methods succ :: WriteFlags -> WriteFlags # pred :: WriteFlags -> WriteFlags # toEnum :: Int -> WriteFlags # fromEnum :: WriteFlags -> Int # enumFrom :: WriteFlags -> [WriteFlags] # enumFromThen :: WriteFlags -> WriteFlags -> [WriteFlags] # enumFromTo :: WriteFlags -> WriteFlags -> [WriteFlags] # enumFromThenTo :: WriteFlags -> WriteFlags -> WriteFlags -> [WriteFlags] #
Enum TextBlinkMode
Instance details Defined in GI.Vte.Enums Methods succ :: TextBlinkMode -> TextBlinkMode # pred :: TextBlinkMode -> TextBlinkMode # toEnum :: Int -> TextBlinkMode # fromEnum :: TextBlinkMode -> Int # enumFrom :: TextBlinkMode -> [TextBlinkMode] # enumFromThen :: TextBlinkMode -> TextBlinkMode -> [TextBlinkMode] # enumFromTo :: TextBlinkMode -> TextBlinkMode -> [TextBlinkMode] # enumFromThenTo :: TextBlinkMode -> TextBlinkMode -> TextBlinkMode -> [TextBlinkMode] #
Enum RegexError
Instance details Defined in GI.Vte.Enums Methods succ :: RegexError -> RegexError # pred :: RegexError -> RegexError # toEnum :: Int -> RegexError # fromEnum :: RegexError -> Int # enumFrom :: RegexError -> [RegexError] # enumFromThen :: RegexError -> RegexError -> [RegexError] # enumFromTo :: RegexError -> RegexError -> [RegexError] # enumFromThenTo :: RegexError -> RegexError -> RegexError -> [RegexError] #
Enum PtyError
Instance details Defined in GI.Vte.Enums Methods succ :: PtyError -> PtyError # pred :: PtyError -> PtyError # toEnum :: Int -> PtyError # fromEnum :: PtyError -> Int # enumFrom :: PtyError -> [PtyError] # enumFromThen :: PtyError -> PtyError -> [PtyError] # enumFromTo :: PtyError -> PtyError -> [PtyError] # enumFromThenTo :: PtyError -> PtyError -> PtyError -> [PtyError] #
Enum Format
Instance details Defined in GI.Vte.Enums Methods succ :: Format -> Format # pred :: Format -> Format # toEnum :: Int -> Format # fromEnum :: Format -> Int # enumFrom :: Format -> [Format] # enumFromThen :: Format -> Format -> [Format] # enumFromTo :: Format -> Format -> [Format] # enumFromThenTo :: Format -> Format -> Format -> [Format] #
Enum EraseBinding
Instance details Defined in GI.Vte.Enums Methods succ :: EraseBinding -> EraseBinding # pred :: EraseBinding -> EraseBinding # toEnum :: Int -> EraseBinding # fromEnum :: EraseBinding -> Int # enumFrom :: EraseBinding -> [EraseBinding] # enumFromThen :: EraseBinding -> EraseBinding -> [EraseBinding] # enumFromTo :: EraseBinding -> EraseBinding -> [EraseBinding] # enumFromThenTo :: EraseBinding -> EraseBinding -> EraseBinding -> [EraseBinding] #
Enum CursorShape
Instance details Defined in GI.Vte.Enums Methods succ :: CursorShape -> CursorShape # pred :: CursorShape -> CursorShape # toEnum :: Int -> CursorShape # fromEnum :: CursorShape -> Int # enumFrom :: CursorShape -> [CursorShape] # enumFromThen :: CursorShape -> CursorShape -> [CursorShape] # enumFromTo :: CursorShape -> CursorShape -> [CursorShape] # enumFromThenTo :: CursorShape -> CursorShape -> CursorShape -> [CursorShape] #
Enum CursorBlinkMode
Instance details Defined in GI.Vte.Enums Methods succ :: CursorBlinkMode -> CursorBlinkMode # pred :: CursorBlinkMode -> CursorBlinkMode # toEnum :: Int -> CursorBlinkMode # fromEnum :: CursorBlinkMode -> Int # enumFrom :: CursorBlinkMode -> [CursorBlinkMode] # enumFromThen :: CursorBlinkMode -> CursorBlinkMode -> [CursorBlinkMode] # enumFromTo :: CursorBlinkMode -> CursorBlinkMode -> [CursorBlinkMode] # enumFromThenTo :: CursorBlinkMode -> CursorBlinkMode -> CursorBlinkMode -> [CursorBlinkMode] #
Enum AttrOpTag
Instance details Defined in Data.GI.Base.Attributes Methods succ :: AttrOpTag -> AttrOpTag # pred :: AttrOpTag -> AttrOpTag # toEnum :: Int -> AttrOpTag # fromEnum :: AttrOpTag -> Int # enumFrom :: AttrOpTag -> [AttrOpTag] # enumFromThen :: AttrOpTag -> AttrOpTag -> [AttrOpTag] # enumFromTo :: AttrOpTag -> AttrOpTag -> [AttrOpTag] # enumFromThenTo :: AttrOpTag -> AttrOpTag -> AttrOpTag -> [AttrOpTag] #
Enum DiffTime
Instance details Defined in Data.Time.Clock.Internal.DiffTime Methods succ :: DiffTime -> DiffTime # pred :: DiffTime -> DiffTime # toEnum :: Int -> DiffTime # fromEnum :: DiffTime -> Int # enumFrom :: DiffTime -> [DiffTime] # enumFromThen :: DiffTime -> DiffTime -> [DiffTime] # enumFromTo :: DiffTime -> DiffTime -> [DiffTime] # enumFromThenTo :: DiffTime -> DiffTime -> DiffTime -> [DiffTime] #
Enum InterpType
Instance details Defined in GI.GdkPixbuf.Enums Methods succ :: InterpType -> InterpType # pred :: InterpType -> InterpType # toEnum :: Int -> InterpType # fromEnum :: InterpType -> Int # enumFrom :: InterpType -> [InterpType] # enumFromThen :: InterpType -> InterpType -> [InterpType] # enumFromTo :: InterpType -> InterpType -> [InterpType] # enumFromThenTo :: InterpType -> InterpType -> InterpType -> [InterpType] #
Enum Colorspace
Instance details Defined in GI.GdkPixbuf.Enums Methods succ :: Colorspace -> Colorspace # pred :: Colorspace -> Colorspace # toEnum :: Int -> Colorspace # fromEnum :: Colorspace -> Int # enumFrom :: Colorspace -> [Colorspace] # enumFromThen :: Colorspace -> Colorspace -> [Colorspace] # enumFromTo :: Colorspace -> Colorspace -> [Colorspace] # enumFromThenTo :: Colorspace -> Colorspace -> Colorspace -> [Colorspace] #
Enum PixbufRotation
Instance details Defined in GI.GdkPixbuf.Enums Methods succ :: PixbufRotation -> PixbufRotation # pred :: PixbufRotation -> PixbufRotation # toEnum :: Int -> PixbufRotation # fromEnum :: PixbufRotation -> Int # enumFrom :: PixbufRotation -> [PixbufRotation] # enumFromThen :: PixbufRotation -> PixbufRotation -> [PixbufRotation] # enumFromTo :: PixbufRotation -> PixbufRotation -> [PixbufRotation] # enumFromThenTo :: PixbufRotation -> PixbufRotation -> PixbufRotation -> [PixbufRotation] #
Enum TypeFlags
Instance details Defined in GI.GObject.Flags Methods succ :: TypeFlags -> TypeFlags # pred :: TypeFlags -> TypeFlags # toEnum :: Int -> TypeFlags # fromEnum :: TypeFlags -> Int # enumFrom :: TypeFlags -> [TypeFlags] # enumFromThen :: TypeFlags -> TypeFlags -> [TypeFlags] # enumFromTo :: TypeFlags -> TypeFlags -> [TypeFlags] # enumFromThenTo :: TypeFlags -> TypeFlags -> TypeFlags -> [TypeFlags] #
Enum PixbufAlphaMode
Instance details Defined in GI.GdkPixbuf.Enums Methods succ :: PixbufAlphaMode -> PixbufAlphaMode # pred :: PixbufAlphaMode -> PixbufAlphaMode # toEnum :: Int -> PixbufAlphaMode # fromEnum :: PixbufAlphaMode -> Int # enumFrom :: PixbufAlphaMode -> [PixbufAlphaMode] # enumFromThen :: PixbufAlphaMode -> PixbufAlphaMode -> [PixbufAlphaMode] # enumFromTo :: PixbufAlphaMode -> PixbufAlphaMode -> [PixbufAlphaMode] # enumFromThenTo :: PixbufAlphaMode -> PixbufAlphaMode -> PixbufAlphaMode -> [PixbufAlphaMode] #
Enum PixbufError
Instance details Defined in GI.GdkPixbuf.Enums Methods succ :: PixbufError -> PixbufError # pred :: PixbufError -> PixbufError # toEnum :: Int -> PixbufError # fromEnum :: PixbufError -> Int # enumFrom :: PixbufError -> [PixbufError] # enumFromThen :: PixbufError -> PixbufError -> [PixbufError] # enumFromTo :: PixbufError -> PixbufError -> [PixbufError] # enumFromThenTo :: PixbufError -> PixbufError -> PixbufError -> [PixbufError] #
Enum BindingFlags
Instance details Defined in GI.GObject.Flags Methods succ :: BindingFlags -> BindingFlags # pred :: BindingFlags -> BindingFlags # toEnum :: Int -> BindingFlags # fromEnum :: BindingFlags -> Int # enumFrom :: BindingFlags -> [BindingFlags] # enumFromThen :: BindingFlags -> BindingFlags -> [BindingFlags] # enumFromTo :: BindingFlags -> BindingFlags -> [BindingFlags] # enumFromThenTo :: BindingFlags -> BindingFlags -> BindingFlags -> [BindingFlags] #
Enum CoordType
Instance details Defined in GI.Atk.Enums Methods succ :: CoordType -> CoordType # pred :: CoordType -> CoordType # toEnum :: Int -> CoordType # fromEnum :: CoordType -> Int # enumFrom :: CoordType -> [CoordType] # enumFromThen :: CoordType -> CoordType -> [CoordType] # enumFromTo :: CoordType -> CoordType -> [CoordType] # enumFromThenTo :: CoordType -> CoordType -> CoordType -> [CoordType] #
Enum Layer
Instance details Defined in GI.Atk.Enums Methods succ :: Layer -> Layer # pred :: Layer -> Layer # toEnum :: Int -> Layer # fromEnum :: Layer -> Int # enumFrom :: Layer -> [Layer] # enumFromThen :: Layer -> Layer -> [Layer] # enumFromTo :: Layer -> Layer -> [Layer] # enumFromThenTo :: Layer -> Layer -> Layer -> [Layer] #
Enum ScrollType
Instance details Defined in GI.Atk.Enums Methods succ :: ScrollType -> ScrollType # pred :: ScrollType -> ScrollType # toEnum :: Int -> ScrollType # fromEnum :: ScrollType -> Int # enumFrom :: ScrollType -> [ScrollType] # enumFromThen :: ScrollType -> ScrollType -> [ScrollType] # enumFromTo :: ScrollType -> ScrollType -> [ScrollType] # enumFromThenTo :: ScrollType -> ScrollType -> ScrollType -> [ScrollType] #
Enum TextClipType
Instance details Defined in GI.Atk.Enums Methods succ :: TextClipType -> TextClipType # pred :: TextClipType -> TextClipType # toEnum :: Int -> TextClipType # fromEnum :: TextClipType -> Int # enumFrom :: TextClipType -> [TextClipType] # enumFromThen :: TextClipType -> TextClipType -> [TextClipType] # enumFromTo :: TextClipType -> TextClipType -> [TextClipType] # enumFromThenTo :: TextClipType -> TextClipType -> TextClipType -> [TextClipType] #
Enum TextGranularity
Instance details Defined in GI.Atk.Enums Methods succ :: TextGranularity -> TextGranularity # pred :: TextGranularity -> TextGranularity # toEnum :: Int -> TextGranularity # fromEnum :: TextGranularity -> Int # enumFrom :: TextGranularity -> [TextGranularity] # enumFromThen :: TextGranularity -> TextGranularity -> [TextGranularity] # enumFromTo :: TextGranularity -> TextGranularity -> [TextGranularity] # enumFromThenTo :: TextGranularity -> TextGranularity -> TextGranularity -> [TextGranularity] #
Enum TextBoundary
Instance details Defined in GI.Atk.Enums Methods succ :: TextBoundary -> TextBoundary # pred :: TextBoundary -> TextBoundary # toEnum :: Int -> TextBoundary # fromEnum :: TextBoundary -> Int # enumFrom :: TextBoundary -> [TextBoundary] # enumFromThen :: TextBoundary -> TextBoundary -> [TextBoundary] # enumFromTo :: TextBoundary -> TextBoundary -> [TextBoundary] # enumFromThenTo :: TextBoundary -> TextBoundary -> TextBoundary -> [TextBoundary] #
Enum RelationType
Instance details Defined in GI.Atk.Enums Methods succ :: RelationType -> RelationType # pred :: RelationType -> RelationType # toEnum :: Int -> RelationType # fromEnum :: RelationType -> Int # enumFrom :: RelationType -> [RelationType] # enumFromThen :: RelationType -> RelationType -> [RelationType] # enumFromTo :: RelationType -> RelationType -> [RelationType] # enumFromThenTo :: RelationType -> RelationType -> RelationType -> [RelationType] #
Enum Role
Instance details Defined in GI.Atk.Enums Methods succ :: Role -> Role # pred :: Role -> Role # toEnum :: Int -> Role # fromEnum :: Role -> Int # enumFrom :: Role -> [Role] # enumFromThen :: Role -> Role -> [Role] # enumFromTo :: Role -> Role -> [Role] # enumFromThenTo :: Role -> Role -> Role -> [Role] #
Enum KeyEventType
Instance details Defined in GI.Atk.Enums Methods succ :: KeyEventType -> KeyEventType # pred :: KeyEventType -> KeyEventType # toEnum :: Int -> KeyEventType # fromEnum :: KeyEventType -> Int # enumFrom :: KeyEventType -> [KeyEventType] # enumFromThen :: KeyEventType -> KeyEventType -> [KeyEventType] # enumFromTo :: KeyEventType -> KeyEventType -> [KeyEventType] # enumFromThenTo :: KeyEventType -> KeyEventType -> KeyEventType -> [KeyEventType] #
Enum StateType
Instance details Defined in GI.Atk.Enums Methods succ :: StateType -> StateType # pred :: StateType -> StateType # toEnum :: Int -> StateType # fromEnum :: StateType -> Int # enumFrom :: StateType -> [StateType] # enumFromThen :: StateType -> StateType -> [StateType] # enumFromTo :: StateType -> StateType -> [StateType] # enumFromThenTo :: StateType -> StateType -> StateType -> [StateType] #
Enum TextAttribute
Instance details Defined in GI.Atk.Enums Methods succ :: TextAttribute -> TextAttribute # pred :: TextAttribute -> TextAttribute # toEnum :: Int -> TextAttribute # fromEnum :: TextAttribute -> Int # enumFrom :: TextAttribute -> [TextAttribute] # enumFromThen :: TextAttribute -> TextAttribute -> [TextAttribute] # enumFromTo :: TextAttribute -> TextAttribute -> [TextAttribute] # enumFromThenTo :: TextAttribute -> TextAttribute -> TextAttribute -> [TextAttribute] #
Enum ValueType
Instance details Defined in GI.Atk.Enums Methods succ :: ValueType -> ValueType # pred :: ValueType -> ValueType # toEnum :: Int -> ValueType # fromEnum :: ValueType -> Int # enumFrom :: ValueType -> [ValueType] # enumFromThen :: ValueType -> ValueType -> [ValueType] # enumFromTo :: ValueType -> ValueType -> [ValueType] # enumFromThenTo :: ValueType -> ValueType -> ValueType -> [ValueType] #
Enum SignalFlags
Instance details Defined in GI.GObject.Flags Methods succ :: SignalFlags -> SignalFlags # pred :: SignalFlags -> SignalFlags # toEnum :: Int -> SignalFlags # fromEnum :: SignalFlags -> Int # enumFrom :: SignalFlags -> [SignalFlags] # enumFromThen :: SignalFlags -> SignalFlags -> [SignalFlags] # enumFromTo :: SignalFlags -> SignalFlags -> [SignalFlags] # enumFromThenTo :: SignalFlags -> SignalFlags -> SignalFlags -> [SignalFlags] #
Enum ConnectFlags
Instance details Defined in GI.GObject.Flags Methods succ :: ConnectFlags -> ConnectFlags # pred :: ConnectFlags -> ConnectFlags # toEnum :: Int -> ConnectFlags # fromEnum :: ConnectFlags -> Int # enumFrom :: ConnectFlags -> [ConnectFlags] # enumFromThen :: ConnectFlags -> ConnectFlags -> [ConnectFlags] # enumFromTo :: ConnectFlags -> ConnectFlags -> [ConnectFlags] # enumFromThenTo :: ConnectFlags -> ConnectFlags -> ConnectFlags -> [ConnectFlags] #
Enum ParamFlags
Instance details Defined in GI.GObject.Flags Methods succ :: ParamFlags -> ParamFlags # pred :: ParamFlags -> ParamFlags # toEnum :: Int -> ParamFlags # fromEnum :: ParamFlags -> Int # enumFrom :: ParamFlags -> [ParamFlags] # enumFromThen :: ParamFlags -> ParamFlags -> [ParamFlags] # enumFromTo :: ParamFlags -> ParamFlags -> [ParamFlags] # enumFromThenTo :: ParamFlags -> ParamFlags -> ParamFlags -> [ParamFlags] #
Enum SignalMatchType
Instance details Defined in GI.GObject.Flags Methods succ :: SignalMatchType -> SignalMatchType # pred :: SignalMatchType -> SignalMatchType # toEnum :: Int -> SignalMatchType # fromEnum :: SignalMatchType -> Int # enumFrom :: SignalMatchType -> [SignalMatchType] # enumFromThen :: SignalMatchType -> SignalMatchType -> [SignalMatchType] # enumFromTo :: SignalMatchType -> SignalMatchType -> [SignalMatchType] # enumFromThenTo :: SignalMatchType -> SignalMatchType -> SignalMatchType -> [SignalMatchType] #
Enum TypeDebugFlags
Instance details Defined in GI.GObject.Flags Methods succ :: TypeDebugFlags -> TypeDebugFlags # pred :: TypeDebugFlags -> TypeDebugFlags # toEnum :: Int -> TypeDebugFlags # fromEnum :: TypeDebugFlags -> Int # enumFrom :: TypeDebugFlags -> [TypeDebugFlags] # enumFromThen :: TypeDebugFlags -> TypeDebugFlags -> [TypeDebugFlags] # enumFromTo :: TypeDebugFlags -> TypeDebugFlags -> [TypeDebugFlags] # enumFromThenTo :: TypeDebugFlags -> TypeDebugFlags -> TypeDebugFlags -> [TypeDebugFlags] #
Enum TypeFundamentalFlags
Instance details Defined in GI.GObject.Flags Methods succ :: TypeFundamentalFlags -> TypeFundamentalFlags # pred :: TypeFundamentalFlags -> TypeFundamentalFlags # toEnum :: Int -> TypeFundamentalFlags # fromEnum :: TypeFundamentalFlags -> Int # enumFrom :: TypeFundamentalFlags -> [TypeFundamentalFlags] # enumFromThen :: TypeFundamentalFlags -> TypeFundamentalFlags -> [TypeFundamentalFlags] # enumFromTo :: TypeFundamentalFlags -> TypeFundamentalFlags -> [TypeFundamentalFlags] # enumFromThenTo :: TypeFundamentalFlags -> TypeFundamentalFlags -> TypeFundamentalFlags -> [TypeFundamentalFlags] #
Integral a => Enum (Ratio a)	Since: base-2.0.1
Instance details Defined in GHC.Real Methods succ :: Ratio a -> Ratio a # pred :: Ratio a -> Ratio a # toEnum :: Int -> Ratio a # fromEnum :: Ratio a -> Int # enumFrom :: Ratio a -> [Ratio a] # enumFromThen :: Ratio a -> Ratio a -> [Ratio a] # enumFromTo :: Ratio a -> Ratio a -> [Ratio a] # enumFromThenTo :: Ratio a -> Ratio a -> Ratio a -> [Ratio a] #
Enum a => Enum (Last a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods succ :: Last a -> Last a # pred :: Last a -> Last a # toEnum :: Int -> Last a # fromEnum :: Last a -> Int # enumFrom :: Last a -> [Last a] # enumFromThen :: Last a -> Last a -> [Last a] # enumFromTo :: Last a -> Last a -> [Last a] # enumFromThenTo :: Last a -> Last a -> Last a -> [Last a] #
Enum a => Enum (Min a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods succ :: Min a -> Min a # pred :: Min a -> Min a # toEnum :: Int -> Min a # fromEnum :: Min a -> Int # enumFrom :: Min a -> [Min a] # enumFromThen :: Min a -> Min a -> [Min a] # enumFromTo :: Min a -> Min a -> [Min a] # enumFromThenTo :: Min a -> Min a -> Min a -> [Min a] #
Enum a => Enum (Max a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods succ :: Max a -> Max a # pred :: Max a -> Max a # toEnum :: Int -> Max a # fromEnum :: Max a -> Int # enumFrom :: Max a -> [Max a] # enumFromThen :: Max a -> Max a -> [Max a] # enumFromTo :: Max a -> Max a -> [Max a] # enumFromThenTo :: Max a -> Max a -> Max a -> [Max a] #
Enum a => Enum (First a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods succ :: First a -> First a # pred :: First a -> First a # toEnum :: Int -> First a # fromEnum :: First a -> Int # enumFrom :: First a -> [First a] # enumFromThen :: First a -> First a -> [First a] # enumFromTo :: First a -> First a -> [First a] # enumFromThenTo :: First a -> First a -> First a -> [First a] #
Enum a => Enum (WrappedMonoid a)	Since: base-4.9.0.0
Instance details 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] #
Enum a => Enum (Identity a)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Identity Methods succ :: Identity a -> Identity a # pred :: Identity a -> Identity a # toEnum :: Int -> 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] #
Enum (Proxy s)	Since: base-4.7.0.0
Instance details Defined in Data.Proxy Methods succ :: Proxy s -> Proxy s # pred :: Proxy s -> Proxy s # toEnum :: Int -> Proxy s # fromEnum :: Proxy s -> Int # enumFrom :: Proxy s -> [Proxy s] # enumFromThen :: Proxy s -> Proxy s -> [Proxy s] # enumFromTo :: Proxy s -> Proxy s -> [Proxy s] # enumFromThenTo :: Proxy s -> Proxy s -> Proxy s -> [Proxy s] #
Enum a => Enum (Const a b)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Const Methods succ :: Const a b -> Const a b # pred :: Const a b -> Const a b # toEnum :: Int -> Const a b # fromEnum :: Const a b -> Int # enumFrom :: Const a b -> [Const a b] # enumFromThen :: Const a b -> Const a b -> [Const a b] # enumFromTo :: Const a b -> Const a b -> [Const a b] # enumFromThenTo :: Const a b -> Const a b -> Const a b -> [Const a b] #
Enum (f a) => Enum (Ap f a)	Since: base-4.12.0.0
Instance details Defined in Data.Monoid Methods succ :: Ap f a -> Ap f a # pred :: Ap f a -> Ap f a # toEnum :: Int -> Ap f a # fromEnum :: Ap f a -> Int # enumFrom :: Ap f a -> [Ap f a] # enumFromThen :: Ap f a -> Ap f a -> [Ap f a] # enumFromTo :: Ap f a -> Ap f a -> [Ap f a] # enumFromThenTo :: Ap f a -> Ap f a -> Ap f a -> [Ap f a] #
Enum (f a) => Enum (Alt f a)	Since: base-4.8.0.0
Instance details Defined in Data.Semigroup.Internal Methods succ :: Alt f a -> Alt f a # pred :: Alt f a -> Alt f a # toEnum :: Int -> Alt f a # fromEnum :: Alt f a -> Int # enumFrom :: Alt f a -> [Alt f a] # enumFromThen :: Alt f a -> Alt f a -> [Alt f a] # enumFromTo :: Alt f a -> Alt f a -> [Alt f a] # enumFromThenTo :: Alt f a -> Alt f a -> Alt f a -> [Alt f a] #
a ~ b => Enum (a :~: b)	Since: base-4.7.0.0
Instance details Defined in Data.Type.Equality Methods succ :: (a :~: b) -> a :~: b # pred :: (a :~: b) -> a :~: b # toEnum :: Int -> a :~: b # fromEnum :: (a :~: b) -> Int # enumFrom :: (a :~: b) -> [a :~: b] # enumFromThen :: (a :~: b) -> (a :~: b) -> [a :~: b] # enumFromTo :: (a :~: b) -> (a :~: b) -> [a :~: b] # enumFromThenTo :: (a :~: b) -> (a :~: b) -> (a :~: b) -> [a :~: b] #
Enum a => Enum (Tagged s a)
Instance details Defined in Data.Tagged Methods succ :: Tagged s a -> Tagged s a # pred :: Tagged s a -> Tagged s a # toEnum :: Int -> Tagged s a # fromEnum :: Tagged s a -> Int # enumFrom :: Tagged s a -> [Tagged s a] # enumFromThen :: Tagged s a -> Tagged s a -> [Tagged s a] # enumFromTo :: Tagged s a -> Tagged s a -> [Tagged s a] # enumFromThenTo :: Tagged s a -> Tagged s a -> Tagged s a -> [Tagged s a] #
a ~~ b => Enum (a :~~: b)	Since: base-4.10.0.0
Instance details Defined in Data.Type.Equality Methods succ :: (a :~~: b) -> a :~~: b # pred :: (a :~~: b) -> a :~~: b # toEnum :: Int -> a :~~: b # fromEnum :: (a :~~: b) -> Int # enumFrom :: (a :~~: b) -> [a :~~: b] # enumFromThen :: (a :~~: b) -> (a :~~: b) -> [a :~~: b] # enumFromTo :: (a :~~: b) -> (a :~~: b) -> [a :~~: b] # enumFromThenTo :: (a :~~: b) -> (a :~~: b) -> (a :~~: b) -> [a :~~: b] #

class Eq a where #

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:

Reflexivity: x == x = True
Symmetry: x == y = y == x
Transitivity: if x == y && y == z = True, then x == z = True
Substitutivity: if x == y = True and f is a "public" function whose return type is an instance of Eq, then f x == f y = True
Negation: x /= y = not (x == y)

Minimal complete definition: either == or /=.

Minimal complete definition

(==) | (/=)

Methods

(==) :: a -> a -> Bool infix 4 #

(/=) :: a -> a -> Bool infix 4 #

Instances

Eq Bool
Instance details Defined in GHC.Classes Methods (==) :: Bool -> Bool -> Bool # (/=) :: Bool -> Bool -> Bool #
Eq Char
Instance details Defined in GHC.Classes Methods (==) :: Char -> Char -> Bool # (/=) :: Char -> Char -> Bool #
Eq Double	Note that due to the presence of `NaN`, `Double`'s `Eq` instance does not satisfy reflexivity. `>>>` `0/0 == (0/0 :: Double)`False Also note that `Double`'s `Eq` instance does not satisfy substitutivity: `>>>` `0 == (-0 :: Double)`True `>>>` `recip 0 == recip (-0 :: Double)`False
Instance details Defined in GHC.Classes Methods (==) :: Double -> Double -> Bool # (/=) :: Double -> Double -> Bool #
Eq Float	Note that due to the presence of `NaN`, `Float`'s `Eq` instance does not satisfy reflexivity. `>>>` `0/0 == (0/0 :: Float)`False Also note that `Float`'s `Eq` instance does not satisfy substitutivity: `>>>` `0 == (-0 :: Float)`True `>>>` `recip 0 == recip (-0 :: Float)`False
Instance details Defined in GHC.Classes Methods (==) :: Float -> Float -> Bool # (/=) :: Float -> Float -> Bool #
Eq Int
Instance details Defined in GHC.Classes Methods (==) :: Int -> Int -> Bool # (/=) :: Int -> Int -> Bool #
Eq Int8	Since: base-2.1
Instance details Defined in GHC.Int Methods (==) :: Int8 -> Int8 -> Bool # (/=) :: Int8 -> Int8 -> Bool #
Eq Int16	Since: base-2.1
Instance details Defined in GHC.Int Methods (==) :: Int16 -> Int16 -> Bool # (/=) :: Int16 -> Int16 -> Bool #
Eq Int32	Since: base-2.1
Instance details Defined in GHC.Int Methods (==) :: Int32 -> Int32 -> Bool # (/=) :: Int32 -> Int32 -> Bool #
Eq Int64	Since: base-2.1
Instance details Defined in GHC.Int Methods (==) :: Int64 -> Int64 -> Bool # (/=) :: Int64 -> Int64 -> Bool #
Eq Integer
Instance details Defined in GHC.Integer.Type Methods (==) :: Integer -> Integer -> Bool # (/=) :: Integer -> Integer -> Bool #
Eq Natural	Since: base-4.8.0.0
Instance details Defined in GHC.Natural Methods (==) :: Natural -> Natural -> Bool # (/=) :: Natural -> Natural -> Bool #
Eq Ordering
Instance details Defined in GHC.Classes Methods (==) :: Ordering -> Ordering -> Bool # (/=) :: Ordering -> Ordering -> Bool #
Eq Word
Instance details Defined in GHC.Classes Methods (==) :: Word -> Word -> Bool # (/=) :: Word -> Word -> Bool #
Eq Word8	Since: base-2.1
Instance details Defined in GHC.Word Methods (==) :: Word8 -> Word8 -> Bool # (/=) :: Word8 -> Word8 -> Bool #
Eq Word16	Since: base-2.1
Instance details Defined in GHC.Word Methods (==) :: Word16 -> Word16 -> Bool # (/=) :: Word16 -> Word16 -> Bool #
Eq Word32	Since: base-2.1
Instance details Defined in GHC.Word Methods (==) :: Word32 -> Word32 -> Bool # (/=) :: Word32 -> Word32 -> Bool #
Eq Word64	Since: base-2.1
Instance details Defined in GHC.Word Methods (==) :: Word64 -> Word64 -> Bool # (/=) :: Word64 -> Word64 -> Bool #
Eq SomeTypeRep
Instance details Defined in Data.Typeable.Internal Methods (==) :: SomeTypeRep -> SomeTypeRep -> Bool # (/=) :: SomeTypeRep -> SomeTypeRep -> Bool #
Eq Exp
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Exp -> Exp -> Bool # (/=) :: Exp -> Exp -> Bool #
Eq Match
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Match -> Match -> Bool # (/=) :: Match -> Match -> Bool #
Eq Clause
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Clause -> Clause -> Bool # (/=) :: Clause -> Clause -> Bool #
Eq Pat
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Pat -> Pat -> Bool # (/=) :: Pat -> Pat -> Bool #
Eq Type
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Type -> Type -> Bool # (/=) :: Type -> Type -> Bool #
Eq Dec
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Dec -> Dec -> Bool # (/=) :: Dec -> Dec -> Bool #
Eq Name
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Name -> Name -> Bool # (/=) :: Name -> Name -> Bool #
Eq FunDep
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: FunDep -> FunDep -> Bool # (/=) :: FunDep -> FunDep -> Bool #
Eq InjectivityAnn
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: InjectivityAnn -> InjectivityAnn -> Bool # (/=) :: InjectivityAnn -> InjectivityAnn -> Bool #
Eq Overlap
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Overlap -> Overlap -> Bool # (/=) :: Overlap -> Overlap -> Bool #
Eq ()
Instance details Defined in GHC.Classes Methods (==) :: () -> () -> Bool # (/=) :: () -> () -> Bool #
Eq TyCon
Instance details Defined in GHC.Classes Methods (==) :: TyCon -> TyCon -> Bool # (/=) :: TyCon -> TyCon -> Bool #
Eq Module
Instance details Defined in GHC.Classes Methods (==) :: Module -> Module -> Bool # (/=) :: Module -> Module -> Bool #
Eq TrName
Instance details Defined in GHC.Classes Methods (==) :: TrName -> TrName -> Bool # (/=) :: TrName -> TrName -> Bool #
Eq Peano Source #
Instance details Defined in Termonad.Config.Vec Methods (==) :: Peano -> Peano -> Bool # (/=) :: Peano -> Peano -> Bool #
Eq Doc
Instance details Defined in Text.PrettyPrint.HughesPJ Methods (==) :: Doc -> Doc -> Bool # (/=) :: Doc -> Doc -> Bool #
Eq Version	Since: base-2.1
Instance details Defined in Data.Version Methods (==) :: Version -> Version -> Bool # (/=) :: Version -> Version -> Bool #
Eq ByteString
Instance details Defined in Data.ByteString.Lazy.Internal Methods (==) :: ByteString -> ByteString -> Bool # (/=) :: ByteString -> ByteString -> Bool #
Eq ByteString
Instance details Defined in Data.ByteString.Internal Methods (==) :: ByteString -> ByteString -> Bool # (/=) :: ByteString -> ByteString -> Bool #
Eq Any	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods (==) :: Any -> Any -> Bool # (/=) :: Any -> Any -> Bool #
Eq All	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods (==) :: All -> All -> Bool # (/=) :: All -> All -> Bool #
Eq Con
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Con -> Con -> Bool # (/=) :: Con -> Con -> Bool #
Eq Builder
Instance details Defined in Data.Text.Internal.Builder Methods (==) :: Builder -> Builder -> Bool # (/=) :: Builder -> Builder -> Bool #
Eq UTCTime
Instance details Defined in Data.Time.Clock.Internal.UTCTime Methods (==) :: UTCTime -> UTCTime -> Bool # (/=) :: UTCTime -> UTCTime -> Bool #
Eq Handle	Since: base-4.1.0.0
Instance details Defined in GHC.IO.Handle.Types Methods (==) :: Handle -> Handle -> Bool # (/=) :: Handle -> Handle -> Bool #
Eq ThreadId	Since: base-4.2.0.0
Instance details Defined in GHC.Conc.Sync Methods (==) :: ThreadId -> ThreadId -> Bool # (/=) :: ThreadId -> ThreadId -> Bool #
Eq AsyncCancelled
Instance details Defined in Control.Concurrent.Async Methods (==) :: AsyncCancelled -> AsyncCancelled -> Bool # (/=) :: AsyncCancelled -> AsyncCancelled -> Bool #
Eq Pos
Instance details Defined in Data.Attoparsec.Internal.Types Methods (==) :: Pos -> Pos -> Bool # (/=) :: Pos -> Pos -> Bool #
Eq More
Instance details Defined in Data.Attoparsec.Internal.Types Methods (==) :: More -> More -> Bool # (/=) :: More -> More -> Bool #
Eq BigNat
Instance details Defined in GHC.Integer.Type Methods (==) :: BigNat -> BigNat -> Bool # (/=) :: BigNat -> BigNat -> Bool #
Eq Void	Since: base-4.8.0.0
Instance details Defined in Data.Void Methods (==) :: Void -> Void -> Bool # (/=) :: Void -> Void -> Bool #
Eq SpecConstrAnnotation	Since: base-4.3.0.0
Instance details Defined in GHC.Exts Methods (==) :: SpecConstrAnnotation -> SpecConstrAnnotation -> Bool # (/=) :: SpecConstrAnnotation -> SpecConstrAnnotation -> Bool #
Eq Unique
Instance details Defined in Data.Unique Methods (==) :: Unique -> Unique -> Bool # (/=) :: Unique -> Unique -> Bool #
Eq BlockReason	Since: base-4.3.0.0
Instance details Defined in GHC.Conc.Sync Methods (==) :: BlockReason -> BlockReason -> Bool # (/=) :: BlockReason -> BlockReason -> Bool #
Eq ThreadStatus	Since: base-4.3.0.0
Instance details Defined in GHC.Conc.Sync Methods (==) :: ThreadStatus -> ThreadStatus -> Bool # (/=) :: ThreadStatus -> ThreadStatus -> Bool #
Eq AsyncException	Since: base-4.2.0.0
Instance details Defined in GHC.IO.Exception Methods (==) :: AsyncException -> AsyncException -> Bool # (/=) :: AsyncException -> AsyncException -> Bool #
Eq ArrayException	Since: base-4.2.0.0
Instance details Defined in GHC.IO.Exception Methods (==) :: ArrayException -> ArrayException -> Bool # (/=) :: ArrayException -> ArrayException -> Bool #
Eq ExitCode
Instance details Defined in GHC.IO.Exception Methods (==) :: ExitCode -> ExitCode -> Bool # (/=) :: ExitCode -> ExitCode -> Bool #
Eq IOErrorType	Since: base-4.1.0.0
Instance details Defined in GHC.IO.Exception Methods (==) :: IOErrorType -> IOErrorType -> Bool # (/=) :: IOErrorType -> IOErrorType -> Bool #
Eq BufferMode	Since: base-4.2.0.0
Instance details Defined in GHC.IO.Handle.Types Methods (==) :: BufferMode -> BufferMode -> Bool # (/=) :: BufferMode -> BufferMode -> Bool #
Eq Newline	Since: base-4.2.0.0
Instance details Defined in GHC.IO.Handle.Types Methods (==) :: Newline -> Newline -> Bool # (/=) :: Newline -> Newline -> Bool #
Eq NewlineMode	Since: base-4.2.0.0
Instance details Defined in GHC.IO.Handle.Types Methods (==) :: NewlineMode -> NewlineMode -> Bool # (/=) :: NewlineMode -> NewlineMode -> Bool #
Eq IODeviceType	Since: base-4.2.0.0
Instance details Defined in GHC.IO.Device Methods (==) :: IODeviceType -> IODeviceType -> Bool # (/=) :: IODeviceType -> IODeviceType -> Bool #
Eq SeekMode	Since: base-4.2.0.0
Instance details Defined in GHC.IO.Device Methods (==) :: SeekMode -> SeekMode -> Bool # (/=) :: SeekMode -> SeekMode -> Bool #
Eq MaskingState	Since: base-4.3.0.0
Instance details Defined in GHC.IO Methods (==) :: MaskingState -> MaskingState -> Bool # (/=) :: MaskingState -> MaskingState -> Bool #
Eq IOException	Since: base-4.1.0.0
Instance details Defined in GHC.IO.Exception Methods (==) :: IOException -> IOException -> Bool # (/=) :: IOException -> IOException -> Bool #
Eq ArithException	Since: base-3.0
Instance details Defined in GHC.Exception.Type Methods (==) :: ArithException -> ArithException -> Bool # (/=) :: ArithException -> ArithException -> Bool #
Eq Fixity	Since: base-4.6.0.0
Instance details Defined in GHC.Generics Methods (==) :: Fixity -> Fixity -> Bool # (/=) :: Fixity -> Fixity -> Bool #
Eq Associativity	Since: base-4.6.0.0
Instance details Defined in GHC.Generics Methods (==) :: Associativity -> Associativity -> Bool # (/=) :: Associativity -> Associativity -> Bool #
Eq SourceUnpackedness	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods (==) :: SourceUnpackedness -> SourceUnpackedness -> Bool # (/=) :: SourceUnpackedness -> SourceUnpackedness -> Bool #
Eq SourceStrictness	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods (==) :: SourceStrictness -> SourceStrictness -> Bool # (/=) :: SourceStrictness -> SourceStrictness -> Bool #
Eq DecidedStrictness	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods (==) :: DecidedStrictness -> DecidedStrictness -> Bool # (/=) :: DecidedStrictness -> DecidedStrictness -> Bool #
Eq SomeSymbol	Since: base-4.7.0.0
Instance details Defined in GHC.TypeLits Methods (==) :: SomeSymbol -> SomeSymbol -> Bool # (/=) :: SomeSymbol -> SomeSymbol -> Bool #
Eq SomeNat	Since: base-4.7.0.0
Instance details Defined in GHC.TypeNats Methods (==) :: SomeNat -> SomeNat -> Bool # (/=) :: SomeNat -> SomeNat -> Bool #
Eq CChar
Instance details Defined in Foreign.C.Types Methods (==) :: CChar -> CChar -> Bool # (/=) :: CChar -> CChar -> Bool #
Eq CSChar
Instance details Defined in Foreign.C.Types Methods (==) :: CSChar -> CSChar -> Bool # (/=) :: CSChar -> CSChar -> Bool #
Eq CUChar
Instance details Defined in Foreign.C.Types Methods (==) :: CUChar -> CUChar -> Bool # (/=) :: CUChar -> CUChar -> Bool #
Eq CShort
Instance details Defined in Foreign.C.Types Methods (==) :: CShort -> CShort -> Bool # (/=) :: CShort -> CShort -> Bool #
Eq CUShort
Instance details Defined in Foreign.C.Types Methods (==) :: CUShort -> CUShort -> Bool # (/=) :: CUShort -> CUShort -> Bool #
Eq CInt
Instance details Defined in Foreign.C.Types Methods (==) :: CInt -> CInt -> Bool # (/=) :: CInt -> CInt -> Bool #
Eq CUInt
Instance details Defined in Foreign.C.Types Methods (==) :: CUInt -> CUInt -> Bool # (/=) :: CUInt -> CUInt -> Bool #
Eq CLong
Instance details Defined in Foreign.C.Types Methods (==) :: CLong -> CLong -> Bool # (/=) :: CLong -> CLong -> Bool #
Eq CULong
Instance details Defined in Foreign.C.Types Methods (==) :: CULong -> CULong -> Bool # (/=) :: CULong -> CULong -> Bool #
Eq CLLong
Instance details Defined in Foreign.C.Types Methods (==) :: CLLong -> CLLong -> Bool # (/=) :: CLLong -> CLLong -> Bool #
Eq CULLong
Instance details Defined in Foreign.C.Types Methods (==) :: CULLong -> CULLong -> Bool # (/=) :: CULLong -> CULLong -> Bool #
Eq CBool
Instance details Defined in Foreign.C.Types Methods (==) :: CBool -> CBool -> Bool # (/=) :: CBool -> CBool -> Bool #
Eq CFloat
Instance details Defined in Foreign.C.Types Methods (==) :: CFloat -> CFloat -> Bool # (/=) :: CFloat -> CFloat -> Bool #
Eq CDouble
Instance details Defined in Foreign.C.Types Methods (==) :: CDouble -> CDouble -> Bool # (/=) :: CDouble -> CDouble -> Bool #
Eq CPtrdiff
Instance details Defined in Foreign.C.Types Methods (==) :: CPtrdiff -> CPtrdiff -> Bool # (/=) :: CPtrdiff -> CPtrdiff -> Bool #
Eq CSize
Instance details Defined in Foreign.C.Types Methods (==) :: CSize -> CSize -> Bool # (/=) :: CSize -> CSize -> Bool #
Eq CWchar
Instance details Defined in Foreign.C.Types Methods (==) :: CWchar -> CWchar -> Bool # (/=) :: CWchar -> CWchar -> Bool #
Eq CSigAtomic
Instance details Defined in Foreign.C.Types Methods (==) :: CSigAtomic -> CSigAtomic -> Bool # (/=) :: CSigAtomic -> CSigAtomic -> Bool #
Eq CClock
Instance details Defined in Foreign.C.Types Methods (==) :: CClock -> CClock -> Bool # (/=) :: CClock -> CClock -> Bool #
Eq CTime
Instance details Defined in Foreign.C.Types Methods (==) :: CTime -> CTime -> Bool # (/=) :: CTime -> CTime -> Bool #
Eq CUSeconds
Instance details Defined in Foreign.C.Types Methods (==) :: CUSeconds -> CUSeconds -> Bool # (/=) :: CUSeconds -> CUSeconds -> Bool #
Eq CSUSeconds
Instance details Defined in Foreign.C.Types Methods (==) :: CSUSeconds -> CSUSeconds -> Bool # (/=) :: CSUSeconds -> CSUSeconds -> Bool #
Eq CIntPtr
Instance details Defined in Foreign.C.Types Methods (==) :: CIntPtr -> CIntPtr -> Bool # (/=) :: CIntPtr -> CIntPtr -> Bool #
Eq CUIntPtr
Instance details Defined in Foreign.C.Types Methods (==) :: CUIntPtr -> CUIntPtr -> Bool # (/=) :: CUIntPtr -> CUIntPtr -> Bool #
Eq CIntMax
Instance details Defined in Foreign.C.Types Methods (==) :: CIntMax -> CIntMax -> Bool # (/=) :: CIntMax -> CIntMax -> Bool #
Eq CUIntMax
Instance details Defined in Foreign.C.Types Methods (==) :: CUIntMax -> CUIntMax -> Bool # (/=) :: CUIntMax -> CUIntMax -> Bool #
Eq IOMode	Since: base-4.2.0.0
Instance details Defined in GHC.IO.IOMode Methods (==) :: IOMode -> IOMode -> Bool # (/=) :: IOMode -> IOMode -> Bool #
Eq Lexeme	Since: base-2.1
Instance details Defined in Text.Read.Lex Methods (==) :: Lexeme -> Lexeme -> Bool # (/=) :: Lexeme -> Lexeme -> Bool #
Eq Number	Since: base-4.6.0.0
Instance details Defined in Text.Read.Lex Methods (==) :: Number -> Number -> Bool # (/=) :: Number -> Number -> Bool #
Eq GeneralCategory	Since: base-2.1
Instance details Defined in GHC.Unicode Methods (==) :: GeneralCategory -> GeneralCategory -> Bool # (/=) :: GeneralCategory -> GeneralCategory -> Bool #
Eq SrcLoc	Since: base-4.9.0.0
Instance details Defined in GHC.Stack.Types Methods (==) :: SrcLoc -> SrcLoc -> Bool # (/=) :: SrcLoc -> SrcLoc -> Bool #
Eq IntSet
Instance details Defined in Data.IntSet.Internal Methods (==) :: IntSet -> IntSet -> Bool # (/=) :: IntSet -> IntSet -> Bool #
Eq ConcException
Instance details Defined in UnliftIO.Internals.Async Methods (==) :: ConcException -> ConcException -> Bool # (/=) :: ConcException -> ConcException -> Bool #
Eq Day
Instance details Defined in Data.Time.Calendar.Days Methods (==) :: Day -> Day -> Bool # (/=) :: Day -> Day -> Bool #
Eq RGBGamut
Instance details Defined in Data.Colour.RGB Methods (==) :: RGBGamut -> RGBGamut -> Bool # (/=) :: RGBGamut -> RGBGamut -> Bool #
Eq Focus
Instance details Defined in Data.FocusList Methods (==) :: Focus -> Focus -> Bool # (/=) :: Focus -> Focus -> Bool #
Eq Extension
Instance details Defined in GHC.LanguageExtensions.Type Methods (==) :: Extension -> Extension -> Bool # (/=) :: Extension -> Extension -> Bool #
Eq ForeignSrcLang
Instance details Defined in GHC.ForeignSrcLang.Type Methods (==) :: ForeignSrcLang -> ForeignSrcLang -> Bool # (/=) :: ForeignSrcLang -> ForeignSrcLang -> Bool #
Eq WindowState
Instance details Defined in GI.Gdk.Flags Methods (==) :: WindowState -> WindowState -> Bool # (/=) :: WindowState -> WindowState -> Bool #
Eq WindowHints
Instance details Defined in GI.Gdk.Flags Methods (==) :: WindowHints -> WindowHints -> Bool # (/=) :: WindowHints -> WindowHints -> Bool #
Eq WindowAttributesType
Instance details Defined in GI.Gdk.Flags Methods (==) :: WindowAttributesType -> WindowAttributesType -> Bool # (/=) :: WindowAttributesType -> WindowAttributesType -> Bool #
Eq WMFunction
Instance details Defined in GI.Gdk.Flags Methods (==) :: WMFunction -> WMFunction -> Bool # (/=) :: WMFunction -> WMFunction -> Bool #
Eq WMDecoration
Instance details Defined in GI.Gdk.Flags Methods (==) :: WMDecoration -> WMDecoration -> Bool # (/=) :: WMDecoration -> WMDecoration -> Bool #
Eq SeatCapabilities
Instance details Defined in GI.Gdk.Flags Methods (==) :: SeatCapabilities -> SeatCapabilities -> Bool # (/=) :: SeatCapabilities -> SeatCapabilities -> Bool #
Eq ModifierType
Instance details Defined in GI.Gdk.Flags Methods (==) :: ModifierType -> ModifierType -> Bool # (/=) :: ModifierType -> ModifierType -> Bool #
Eq FrameClockPhase
Instance details Defined in GI.Gdk.Flags Methods (==) :: FrameClockPhase -> FrameClockPhase -> Bool # (/=) :: FrameClockPhase -> FrameClockPhase -> Bool #
Eq EventMask
Instance details Defined in GI.Gdk.Flags Methods (==) :: EventMask -> EventMask -> Bool # (/=) :: EventMask -> EventMask -> Bool #
Eq DragAction
Instance details Defined in GI.Gdk.Flags Methods (==) :: DragAction -> DragAction -> Bool # (/=) :: DragAction -> DragAction -> Bool #
Eq AxisFlags
Instance details Defined in GI.Gdk.Flags Methods (==) :: AxisFlags -> AxisFlags -> Bool # (/=) :: AxisFlags -> AxisFlags -> Bool #
Eq AnchorHints
Instance details Defined in GI.Gdk.Flags Methods (==) :: AnchorHints -> AnchorHints -> Bool # (/=) :: AnchorHints -> AnchorHints -> Bool #
Eq WindowWindowClass
Instance details Defined in GI.Gdk.Enums Methods (==) :: WindowWindowClass -> WindowWindowClass -> Bool # (/=) :: WindowWindowClass -> WindowWindowClass -> Bool #
Eq WindowTypeHint
Instance details Defined in GI.Gdk.Enums Methods (==) :: WindowTypeHint -> WindowTypeHint -> Bool # (/=) :: WindowTypeHint -> WindowTypeHint -> Bool #
Eq WindowType
Instance details Defined in GI.Gdk.Enums Methods (==) :: WindowType -> WindowType -> Bool # (/=) :: WindowType -> WindowType -> Bool #
Eq WindowEdge
Instance details Defined in GI.Gdk.Enums Methods (==) :: WindowEdge -> WindowEdge -> Bool # (/=) :: WindowEdge -> WindowEdge -> Bool #
Eq VisualType
Instance details Defined in GI.Gdk.Enums Methods (==) :: VisualType -> VisualType -> Bool # (/=) :: VisualType -> VisualType -> Bool #
Eq VisibilityState
Instance details Defined in GI.Gdk.Enums Methods (==) :: VisibilityState -> VisibilityState -> Bool # (/=) :: VisibilityState -> VisibilityState -> Bool #
Eq TouchpadGesturePhase
Instance details Defined in GI.Gdk.Enums Methods (==) :: TouchpadGesturePhase -> TouchpadGesturePhase -> Bool # (/=) :: TouchpadGesturePhase -> TouchpadGesturePhase -> Bool #
Eq SubpixelLayout
Instance details Defined in GI.Gdk.Enums Methods (==) :: SubpixelLayout -> SubpixelLayout -> Bool # (/=) :: SubpixelLayout -> SubpixelLayout -> Bool #
Eq Status
Instance details Defined in GI.Gdk.Enums Methods (==) :: Status -> Status -> Bool # (/=) :: Status -> Status -> Bool #
Eq SettingAction
Instance details Defined in GI.Gdk.Enums Methods (==) :: SettingAction -> SettingAction -> Bool # (/=) :: SettingAction -> SettingAction -> Bool #
Eq ScrollDirection
Instance details Defined in GI.Gdk.Enums Methods (==) :: ScrollDirection -> ScrollDirection -> Bool # (/=) :: ScrollDirection -> ScrollDirection -> Bool #
Eq PropertyState
Instance details Defined in GI.Gdk.Enums Methods (==) :: PropertyState -> PropertyState -> Bool # (/=) :: PropertyState -> PropertyState -> Bool #
Eq PropMode
Instance details Defined in GI.Gdk.Enums Methods (==) :: PropMode -> PropMode -> Bool # (/=) :: PropMode -> PropMode -> Bool #
Eq OwnerChange
Instance details Defined in GI.Gdk.Enums Methods (==) :: OwnerChange -> OwnerChange -> Bool # (/=) :: OwnerChange -> OwnerChange -> Bool #
Eq NotifyType
Instance details Defined in GI.Gdk.Enums Methods (==) :: NotifyType -> NotifyType -> Bool # (/=) :: NotifyType -> NotifyType -> Bool #
Eq ModifierIntent
Instance details Defined in GI.Gdk.Enums Methods (==) :: ModifierIntent -> ModifierIntent -> Bool # (/=) :: ModifierIntent -> ModifierIntent -> Bool #
Eq InputSource
Instance details Defined in GI.Gdk.Enums Methods (==) :: InputSource -> InputSource -> Bool # (/=) :: InputSource -> InputSource -> Bool #
Eq InputMode
Instance details Defined in GI.Gdk.Enums Methods (==) :: InputMode -> InputMode -> Bool # (/=) :: InputMode -> InputMode -> Bool #
Eq Gravity
Instance details Defined in GI.Gdk.Enums Methods (==) :: Gravity -> Gravity -> Bool # (/=) :: Gravity -> Gravity -> Bool #
Eq GrabStatus
Instance details Defined in GI.Gdk.Enums Methods (==) :: GrabStatus -> GrabStatus -> Bool # (/=) :: GrabStatus -> GrabStatus -> Bool #
Eq GrabOwnership
Instance details Defined in GI.Gdk.Enums Methods (==) :: GrabOwnership -> GrabOwnership -> Bool # (/=) :: GrabOwnership -> GrabOwnership -> Bool #
Eq GLError
Instance details Defined in GI.Gdk.Enums Methods (==) :: GLError -> GLError -> Bool # (/=) :: GLError -> GLError -> Bool #
Eq FullscreenMode
Instance details Defined in GI.Gdk.Enums Methods (==) :: FullscreenMode -> FullscreenMode -> Bool # (/=) :: FullscreenMode -> FullscreenMode -> Bool #
Eq FilterReturn
Instance details Defined in GI.Gdk.Enums Methods (==) :: FilterReturn -> FilterReturn -> Bool # (/=) :: FilterReturn -> FilterReturn -> Bool #
Eq EventType
Instance details Defined in GI.Gdk.Enums Methods (==) :: EventType -> EventType -> Bool # (/=) :: EventType -> EventType -> Bool #
Eq DragProtocol
Instance details Defined in GI.Gdk.Enums Methods (==) :: DragProtocol -> DragProtocol -> Bool # (/=) :: DragProtocol -> DragProtocol -> Bool #
Eq DragCancelReason
Instance details Defined in GI.Gdk.Enums Methods (==) :: DragCancelReason -> DragCancelReason -> Bool # (/=) :: DragCancelReason -> DragCancelReason -> Bool #
Eq DeviceType
Instance details Defined in GI.Gdk.Enums Methods (==) :: DeviceType -> DeviceType -> Bool # (/=) :: DeviceType -> DeviceType -> Bool #
Eq DeviceToolType
Instance details Defined in GI.Gdk.Enums Methods (==) :: DeviceToolType -> DeviceToolType -> Bool # (/=) :: DeviceToolType -> DeviceToolType -> Bool #
Eq DevicePadFeature
Instance details Defined in GI.Gdk.Enums Methods (==) :: DevicePadFeature -> DevicePadFeature -> Bool # (/=) :: DevicePadFeature -> DevicePadFeature -> Bool #
Eq CursorType
Instance details Defined in GI.Gdk.Enums Methods (==) :: CursorType -> CursorType -> Bool # (/=) :: CursorType -> CursorType -> Bool #
Eq CrossingMode
Instance details Defined in GI.Gdk.Enums Methods (==) :: CrossingMode -> CrossingMode -> Bool # (/=) :: CrossingMode -> CrossingMode -> Bool #
Eq ByteOrder
Instance details Defined in GI.Gdk.Enums Methods (==) :: ByteOrder -> ByteOrder -> Bool # (/=) :: ByteOrder -> ByteOrder -> Bool #
Eq AxisUse
Instance details Defined in GI.Gdk.Enums Methods (==) :: AxisUse -> AxisUse -> Bool # (/=) :: AxisUse -> AxisUse -> Bool #
Eq TlsPasswordFlags
Instance details Defined in GI.Gio.Flags Methods (==) :: TlsPasswordFlags -> TlsPasswordFlags -> Bool # (/=) :: TlsPasswordFlags -> TlsPasswordFlags -> Bool #
Eq TlsDatabaseVerifyFlags
Instance details Defined in GI.Gio.Flags Methods (==) :: TlsDatabaseVerifyFlags -> TlsDatabaseVerifyFlags -> Bool # (/=) :: TlsDatabaseVerifyFlags -> TlsDatabaseVerifyFlags -> Bool #
Eq TlsCertificateFlags
Instance details Defined in GI.Gio.Flags Methods (==) :: TlsCertificateFlags -> TlsCertificateFlags -> Bool # (/=) :: TlsCertificateFlags -> TlsCertificateFlags -> Bool #
Eq TestDBusFlags
Instance details Defined in GI.Gio.Flags Methods (==) :: TestDBusFlags -> TestDBusFlags -> Bool # (/=) :: TestDBusFlags -> TestDBusFlags -> Bool #
Eq SubprocessFlags
Instance details Defined in GI.Gio.Flags Methods (==) :: SubprocessFlags -> SubprocessFlags -> Bool # (/=) :: SubprocessFlags -> SubprocessFlags -> Bool #
Eq SocketMsgFlags
Instance details Defined in GI.Gio.Flags Methods (==) :: SocketMsgFlags -> SocketMsgFlags -> Bool # (/=) :: SocketMsgFlags -> SocketMsgFlags -> Bool #
Eq SettingsBindFlags
Instance details Defined in GI.Gio.Flags Methods (==) :: SettingsBindFlags -> SettingsBindFlags -> Bool # (/=) :: SettingsBindFlags -> SettingsBindFlags -> Bool #
Eq ResourceLookupFlags
Instance details Defined in GI.Gio.Flags Methods (==) :: ResourceLookupFlags -> ResourceLookupFlags -> Bool # (/=) :: ResourceLookupFlags -> ResourceLookupFlags -> Bool #
Eq ResourceFlags
Instance details Defined in GI.Gio.Flags Methods (==) :: ResourceFlags -> ResourceFlags -> Bool # (/=) :: ResourceFlags -> ResourceFlags -> Bool #
Eq OutputStreamSpliceFlags
Instance details Defined in GI.Gio.Flags Methods (==) :: OutputStreamSpliceFlags -> OutputStreamSpliceFlags -> Bool # (/=) :: OutputStreamSpliceFlags -> OutputStreamSpliceFlags -> Bool #
Eq MountUnmountFlags
Instance details Defined in GI.Gio.Flags Methods (==) :: MountUnmountFlags -> MountUnmountFlags -> Bool # (/=) :: MountUnmountFlags -> MountUnmountFlags -> Bool #
Eq MountMountFlags
Instance details Defined in GI.Gio.Flags Methods (==) :: MountMountFlags -> MountMountFlags -> Bool # (/=) :: MountMountFlags -> MountMountFlags -> Bool #
Eq IOStreamSpliceFlags
Instance details Defined in GI.Gio.Flags Methods (==) :: IOStreamSpliceFlags -> IOStreamSpliceFlags -> Bool # (/=) :: IOStreamSpliceFlags -> IOStreamSpliceFlags -> Bool #
Eq FileQueryInfoFlags
Instance details Defined in GI.Gio.Flags Methods (==) :: FileQueryInfoFlags -> FileQueryInfoFlags -> Bool # (/=) :: FileQueryInfoFlags -> FileQueryInfoFlags -> Bool #
Eq FileMonitorFlags
Instance details Defined in GI.Gio.Flags Methods (==) :: FileMonitorFlags -> FileMonitorFlags -> Bool # (/=) :: FileMonitorFlags -> FileMonitorFlags -> Bool #
Eq FileMeasureFlags
Instance details Defined in GI.Gio.Flags Methods (==) :: FileMeasureFlags -> FileMeasureFlags -> Bool # (/=) :: FileMeasureFlags -> FileMeasureFlags -> Bool #
Eq FileCreateFlags
Instance details Defined in GI.Gio.Flags Methods (==) :: FileCreateFlags -> FileCreateFlags -> Bool # (/=) :: FileCreateFlags -> FileCreateFlags -> Bool #
Eq FileCopyFlags
Instance details Defined in GI.Gio.Flags Methods (==) :: FileCopyFlags -> FileCopyFlags -> Bool # (/=) :: FileCopyFlags -> FileCopyFlags -> Bool #
Eq FileAttributeInfoFlags
Instance details Defined in GI.Gio.Flags Methods (==) :: FileAttributeInfoFlags -> FileAttributeInfoFlags -> Bool # (/=) :: FileAttributeInfoFlags -> FileAttributeInfoFlags -> Bool #
Eq DriveStartFlags
Instance details Defined in GI.Gio.Flags Methods (==) :: DriveStartFlags -> DriveStartFlags -> Bool # (/=) :: DriveStartFlags -> DriveStartFlags -> Bool #
Eq DBusSubtreeFlags
Instance details Defined in GI.Gio.Flags Methods (==) :: DBusSubtreeFlags -> DBusSubtreeFlags -> Bool # (/=) :: DBusSubtreeFlags -> DBusSubtreeFlags -> Bool #
Eq DBusSignalFlags
Instance details Defined in GI.Gio.Flags Methods (==) :: DBusSignalFlags -> DBusSignalFlags -> Bool # (/=) :: DBusSignalFlags -> DBusSignalFlags -> Bool #
Eq DBusServerFlags
Instance details Defined in GI.Gio.Flags Methods (==) :: DBusServerFlags -> DBusServerFlags -> Bool # (/=) :: DBusServerFlags -> DBusServerFlags -> Bool #
Eq DBusSendMessageFlags
Instance details Defined in GI.Gio.Flags Methods (==) :: DBusSendMessageFlags -> DBusSendMessageFlags -> Bool # (/=) :: DBusSendMessageFlags -> DBusSendMessageFlags -> Bool #
Eq DBusProxyFlags
Instance details Defined in GI.Gio.Flags Methods (==) :: DBusProxyFlags -> DBusProxyFlags -> Bool # (/=) :: DBusProxyFlags -> DBusProxyFlags -> Bool #
Eq DBusPropertyInfoFlags
Instance details Defined in GI.Gio.Flags Methods (==) :: DBusPropertyInfoFlags -> DBusPropertyInfoFlags -> Bool # (/=) :: DBusPropertyInfoFlags -> DBusPropertyInfoFlags -> Bool #
Eq DBusObjectManagerClientFlags
Instance details Defined in GI.Gio.Flags Methods (==) :: DBusObjectManagerClientFlags -> DBusObjectManagerClientFlags -> Bool # (/=) :: DBusObjectManagerClientFlags -> DBusObjectManagerClientFlags -> Bool #
Eq DBusMessageFlags
Instance details Defined in GI.Gio.Flags Methods (==) :: DBusMessageFlags -> DBusMessageFlags -> Bool # (/=) :: DBusMessageFlags -> DBusMessageFlags -> Bool #
Eq DBusInterfaceSkeletonFlags
Instance details Defined in GI.Gio.Flags Methods (==) :: DBusInterfaceSkeletonFlags -> DBusInterfaceSkeletonFlags -> Bool # (/=) :: DBusInterfaceSkeletonFlags -> DBusInterfaceSkeletonFlags -> Bool #
Eq DBusConnectionFlags
Instance details Defined in GI.Gio.Flags Methods (==) :: DBusConnectionFlags -> DBusConnectionFlags -> Bool # (/=) :: DBusConnectionFlags -> DBusConnectionFlags -> Bool #
Eq DBusCapabilityFlags
Instance details Defined in GI.Gio.Flags Methods (==) :: DBusCapabilityFlags -> DBusCapabilityFlags -> Bool # (/=) :: DBusCapabilityFlags -> DBusCapabilityFlags -> Bool #
Eq DBusCallFlags
Instance details Defined in GI.Gio.Flags Methods (==) :: DBusCallFlags -> DBusCallFlags -> Bool # (/=) :: DBusCallFlags -> DBusCallFlags -> Bool #
Eq ConverterFlags
Instance details Defined in GI.Gio.Flags Methods (==) :: ConverterFlags -> ConverterFlags -> Bool # (/=) :: ConverterFlags -> ConverterFlags -> Bool #
Eq BusNameWatcherFlags
Instance details Defined in GI.Gio.Flags Methods (==) :: BusNameWatcherFlags -> BusNameWatcherFlags -> Bool # (/=) :: BusNameWatcherFlags -> BusNameWatcherFlags -> Bool #
Eq BusNameOwnerFlags
Instance details Defined in GI.Gio.Flags Methods (==) :: BusNameOwnerFlags -> BusNameOwnerFlags -> Bool # (/=) :: BusNameOwnerFlags -> BusNameOwnerFlags -> Bool #
Eq AskPasswordFlags
Instance details Defined in GI.Gio.Flags Methods (==) :: AskPasswordFlags -> AskPasswordFlags -> Bool # (/=) :: AskPasswordFlags -> AskPasswordFlags -> Bool #
Eq ApplicationFlags
Instance details Defined in GI.Gio.Flags Methods (==) :: ApplicationFlags -> ApplicationFlags -> Bool # (/=) :: ApplicationFlags -> ApplicationFlags -> Bool #
Eq AppInfoCreateFlags
Instance details Defined in GI.Gio.Flags Methods (==) :: AppInfoCreateFlags -> AppInfoCreateFlags -> Bool # (/=) :: AppInfoCreateFlags -> AppInfoCreateFlags -> Bool #
Eq ZlibCompressorFormat
Instance details Defined in GI.Gio.Enums Methods (==) :: ZlibCompressorFormat -> ZlibCompressorFormat -> Bool # (/=) :: ZlibCompressorFormat -> ZlibCompressorFormat -> Bool #
Eq UnixSocketAddressType
Instance details Defined in GI.Gio.Enums Methods (==) :: UnixSocketAddressType -> UnixSocketAddressType -> Bool # (/=) :: UnixSocketAddressType -> UnixSocketAddressType -> Bool #
Eq TlsRehandshakeMode
Instance details Defined in GI.Gio.Enums Methods (==) :: TlsRehandshakeMode -> TlsRehandshakeMode -> Bool # (/=) :: TlsRehandshakeMode -> TlsRehandshakeMode -> Bool #
Eq TlsInteractionResult
Instance details Defined in GI.Gio.Enums Methods (==) :: TlsInteractionResult -> TlsInteractionResult -> Bool # (/=) :: TlsInteractionResult -> TlsInteractionResult -> Bool #
Eq TlsError
Instance details Defined in GI.Gio.Enums Methods (==) :: TlsError -> TlsError -> Bool # (/=) :: TlsError -> TlsError -> Bool #
Eq TlsDatabaseLookupFlags
Instance details Defined in GI.Gio.Enums Methods (==) :: TlsDatabaseLookupFlags -> TlsDatabaseLookupFlags -> Bool # (/=) :: TlsDatabaseLookupFlags -> TlsDatabaseLookupFlags -> Bool #
Eq TlsCertificateRequestFlags
Instance details Defined in GI.Gio.Enums Methods (==) :: TlsCertificateRequestFlags -> TlsCertificateRequestFlags -> Bool # (/=) :: TlsCertificateRequestFlags -> TlsCertificateRequestFlags -> Bool #
Eq TlsAuthenticationMode
Instance details Defined in GI.Gio.Enums Methods (==) :: TlsAuthenticationMode -> TlsAuthenticationMode -> Bool # (/=) :: TlsAuthenticationMode -> TlsAuthenticationMode -> Bool #
Eq SocketType
Instance details Defined in GI.Gio.Enums Methods (==) :: SocketType -> SocketType -> Bool # (/=) :: SocketType -> SocketType -> Bool #
Eq SocketProtocol
Instance details Defined in GI.Gio.Enums Methods (==) :: SocketProtocol -> SocketProtocol -> Bool # (/=) :: SocketProtocol -> SocketProtocol -> Bool #
Eq SocketListenerEvent
Instance details Defined in GI.Gio.Enums Methods (==) :: SocketListenerEvent -> SocketListenerEvent -> Bool # (/=) :: SocketListenerEvent -> SocketListenerEvent -> Bool #
Eq SocketFamily
Instance details Defined in GI.Gio.Enums Methods (==) :: SocketFamily -> SocketFamily -> Bool # (/=) :: SocketFamily -> SocketFamily -> Bool #
Eq SocketClientEvent
Instance details Defined in GI.Gio.Enums Methods (==) :: SocketClientEvent -> SocketClientEvent -> Bool # (/=) :: SocketClientEvent -> SocketClientEvent -> Bool #
Eq ResourceError
Instance details Defined in GI.Gio.Enums Methods (==) :: ResourceError -> ResourceError -> Bool # (/=) :: ResourceError -> ResourceError -> Bool #
Eq ResolverRecordType
Instance details Defined in GI.Gio.Enums Methods (==) :: ResolverRecordType -> ResolverRecordType -> Bool # (/=) :: ResolverRecordType -> ResolverRecordType -> Bool #
Eq ResolverError
Instance details Defined in GI.Gio.Enums Methods (==) :: ResolverError -> ResolverError -> Bool # (/=) :: ResolverError -> ResolverError -> Bool #
Eq PasswordSave
Instance details Defined in GI.Gio.Enums Methods (==) :: PasswordSave -> PasswordSave -> Bool # (/=) :: PasswordSave -> PasswordSave -> Bool #
Eq NotificationPriority
Instance details Defined in GI.Gio.Enums Methods (==) :: NotificationPriority -> NotificationPriority -> Bool # (/=) :: NotificationPriority -> NotificationPriority -> Bool #
Eq NetworkConnectivity
Instance details Defined in GI.Gio.Enums Methods (==) :: NetworkConnectivity -> NetworkConnectivity -> Bool # (/=) :: NetworkConnectivity -> NetworkConnectivity -> Bool #
Eq MountOperationResult
Instance details Defined in GI.Gio.Enums Methods (==) :: MountOperationResult -> MountOperationResult -> Bool # (/=) :: MountOperationResult -> MountOperationResult -> Bool #
Eq IOModuleScopeFlags
Instance details Defined in GI.Gio.Enums Methods (==) :: IOModuleScopeFlags -> IOModuleScopeFlags -> Bool # (/=) :: IOModuleScopeFlags -> IOModuleScopeFlags -> Bool #
Eq IOErrorEnum
Instance details Defined in GI.Gio.Enums Methods (==) :: IOErrorEnum -> IOErrorEnum -> Bool # (/=) :: IOErrorEnum -> IOErrorEnum -> Bool #
Eq FilesystemPreviewType
Instance details Defined in GI.Gio.Enums Methods (==) :: FilesystemPreviewType -> FilesystemPreviewType -> Bool # (/=) :: FilesystemPreviewType -> FilesystemPreviewType -> Bool #
Eq FileType
Instance details Defined in GI.Gio.Enums Methods (==) :: FileType -> FileType -> Bool # (/=) :: FileType -> FileType -> Bool #
Eq FileMonitorEvent
Instance details Defined in GI.Gio.Enums Methods (==) :: FileMonitorEvent -> FileMonitorEvent -> Bool # (/=) :: FileMonitorEvent -> FileMonitorEvent -> Bool #
Eq FileAttributeType
Instance details Defined in GI.Gio.Enums Methods (==) :: FileAttributeType -> FileAttributeType -> Bool # (/=) :: FileAttributeType -> FileAttributeType -> Bool #
Eq FileAttributeStatus
Instance details Defined in GI.Gio.Enums Methods (==) :: FileAttributeStatus -> FileAttributeStatus -> Bool # (/=) :: FileAttributeStatus -> FileAttributeStatus -> Bool #
Eq EmblemOrigin
Instance details Defined in GI.Gio.Enums Methods (==) :: EmblemOrigin -> EmblemOrigin -> Bool # (/=) :: EmblemOrigin -> EmblemOrigin -> Bool #
Eq DriveStartStopType
Instance details Defined in GI.Gio.Enums Methods (==) :: DriveStartStopType -> DriveStartStopType -> Bool # (/=) :: DriveStartStopType -> DriveStartStopType -> Bool #
Eq DataStreamNewlineType
Instance details Defined in GI.Gio.Enums Methods (==) :: DataStreamNewlineType -> DataStreamNewlineType -> Bool # (/=) :: DataStreamNewlineType -> DataStreamNewlineType -> Bool #
Eq DataStreamByteOrder
Instance details Defined in GI.Gio.Enums Methods (==) :: DataStreamByteOrder -> DataStreamByteOrder -> Bool # (/=) :: DataStreamByteOrder -> DataStreamByteOrder -> Bool #
Eq DBusMessageType
Instance details Defined in GI.Gio.Enums Methods (==) :: DBusMessageType -> DBusMessageType -> Bool # (/=) :: DBusMessageType -> DBusMessageType -> Bool #
Eq DBusMessageHeaderField
Instance details Defined in GI.Gio.Enums Methods (==) :: DBusMessageHeaderField -> DBusMessageHeaderField -> Bool # (/=) :: DBusMessageHeaderField -> DBusMessageHeaderField -> Bool #
Eq DBusMessageByteOrder
Instance details Defined in GI.Gio.Enums Methods (==) :: DBusMessageByteOrder -> DBusMessageByteOrder -> Bool # (/=) :: DBusMessageByteOrder -> DBusMessageByteOrder -> Bool #
Eq DBusError
Instance details Defined in GI.Gio.Enums Methods (==) :: DBusError -> DBusError -> Bool # (/=) :: DBusError -> DBusError -> Bool #
Eq CredentialsType
Instance details Defined in GI.Gio.Enums Methods (==) :: CredentialsType -> CredentialsType -> Bool # (/=) :: CredentialsType -> CredentialsType -> Bool #
Eq ConverterResult
Instance details Defined in GI.Gio.Enums Methods (==) :: ConverterResult -> ConverterResult -> Bool # (/=) :: ConverterResult -> ConverterResult -> Bool #
Eq BusType
Instance details Defined in GI.Gio.Enums Methods (==) :: BusType -> BusType -> Bool # (/=) :: BusType -> BusType -> Bool #
Eq TraverseFlags
Instance details Defined in GI.GLib.Flags Methods (==) :: TraverseFlags -> TraverseFlags -> Bool # (/=) :: TraverseFlags -> TraverseFlags -> Bool #
Eq TestTrapFlags
Instance details Defined in GI.GLib.Flags Methods (==) :: TestTrapFlags -> TestTrapFlags -> Bool # (/=) :: TestTrapFlags -> TestTrapFlags -> Bool #
Eq TestSubprocessFlags
Instance details Defined in GI.GLib.Flags Methods (==) :: TestSubprocessFlags -> TestSubprocessFlags -> Bool # (/=) :: TestSubprocessFlags -> TestSubprocessFlags -> Bool #
Eq SpawnFlags
Instance details Defined in GI.GLib.Flags Methods (==) :: SpawnFlags -> SpawnFlags -> Bool # (/=) :: SpawnFlags -> SpawnFlags -> Bool #
Eq RegexMatchFlags
Instance details Defined in GI.GLib.Flags Methods (==) :: RegexMatchFlags -> RegexMatchFlags -> Bool # (/=) :: RegexMatchFlags -> RegexMatchFlags -> Bool #
Eq RegexCompileFlags
Instance details Defined in GI.GLib.Flags Methods (==) :: RegexCompileFlags -> RegexCompileFlags -> Bool # (/=) :: RegexCompileFlags -> RegexCompileFlags -> Bool #
Eq OptionFlags
Instance details Defined in GI.GLib.Flags Methods (==) :: OptionFlags -> OptionFlags -> Bool # (/=) :: OptionFlags -> OptionFlags -> Bool #
Eq MarkupParseFlags
Instance details Defined in GI.GLib.Flags Methods (==) :: MarkupParseFlags -> MarkupParseFlags -> Bool # (/=) :: MarkupParseFlags -> MarkupParseFlags -> Bool #
Eq MarkupCollectType
Instance details Defined in GI.GLib.Flags Methods (==) :: MarkupCollectType -> MarkupCollectType -> Bool # (/=) :: MarkupCollectType -> MarkupCollectType -> Bool #
Eq LogLevelFlags
Instance details Defined in GI.GLib.Flags Methods (==) :: LogLevelFlags -> LogLevelFlags -> Bool # (/=) :: LogLevelFlags -> LogLevelFlags -> Bool #
Eq KeyFileFlags
Instance details Defined in GI.GLib.Flags Methods (==) :: KeyFileFlags -> KeyFileFlags -> Bool # (/=) :: KeyFileFlags -> KeyFileFlags -> Bool #
Eq IOFlags
Instance details Defined in GI.GLib.Flags Methods (==) :: IOFlags -> IOFlags -> Bool # (/=) :: IOFlags -> IOFlags -> Bool #
Eq IOCondition
Instance details Defined in GI.GLib.Flags Methods (==) :: IOCondition -> IOCondition -> Bool # (/=) :: IOCondition -> IOCondition -> Bool #
Eq HookFlagMask
Instance details Defined in GI.GLib.Flags Methods (==) :: HookFlagMask -> HookFlagMask -> Bool # (/=) :: HookFlagMask -> HookFlagMask -> Bool #
Eq FormatSizeFlags
Instance details Defined in GI.GLib.Flags Methods (==) :: FormatSizeFlags -> FormatSizeFlags -> Bool # (/=) :: FormatSizeFlags -> FormatSizeFlags -> Bool #
Eq FileTest
Instance details Defined in GI.GLib.Flags Methods (==) :: FileTest -> FileTest -> Bool # (/=) :: FileTest -> FileTest -> Bool #
Eq AsciiType
Instance details Defined in GI.GLib.Flags Methods (==) :: AsciiType -> AsciiType -> Bool # (/=) :: AsciiType -> AsciiType -> Bool #
Eq VariantParseError
Instance details Defined in GI.GLib.Enums Methods (==) :: VariantParseError -> VariantParseError -> Bool # (/=) :: VariantParseError -> VariantParseError -> Bool #
Eq VariantClass
Instance details Defined in GI.GLib.Enums Methods (==) :: VariantClass -> VariantClass -> Bool # (/=) :: VariantClass -> VariantClass -> Bool #
Eq UserDirectory
Instance details Defined in GI.GLib.Enums Methods (==) :: UserDirectory -> UserDirectory -> Bool # (/=) :: UserDirectory -> UserDirectory -> Bool #
Eq UnicodeType
Instance details Defined in GI.GLib.Enums Methods (==) :: UnicodeType -> UnicodeType -> Bool # (/=) :: UnicodeType -> UnicodeType -> Bool #
Eq UnicodeScript
Instance details Defined in GI.GLib.Enums Methods (==) :: UnicodeScript -> UnicodeScript -> Bool # (/=) :: UnicodeScript -> UnicodeScript -> Bool #
Eq UnicodeBreakType
Instance details Defined in GI.GLib.Enums Methods (==) :: UnicodeBreakType -> UnicodeBreakType -> Bool # (/=) :: UnicodeBreakType -> UnicodeBreakType -> Bool #
Eq TraverseType
Instance details Defined in GI.GLib.Enums Methods (==) :: TraverseType -> TraverseType -> Bool # (/=) :: TraverseType -> TraverseType -> Bool #
Eq TokenType
Instance details Defined in GI.GLib.Enums Methods (==) :: TokenType -> TokenType -> Bool # (/=) :: TokenType -> TokenType -> Bool #
Eq TimeType
Instance details Defined in GI.GLib.Enums Methods (==) :: TimeType -> TimeType -> Bool # (/=) :: TimeType -> TimeType -> Bool #
Eq ThreadError
Instance details Defined in GI.GLib.Enums Methods (==) :: ThreadError -> ThreadError -> Bool # (/=) :: ThreadError -> ThreadError -> Bool #
Eq TestResult
Instance details Defined in GI.GLib.Enums Methods (==) :: TestResult -> TestResult -> Bool # (/=) :: TestResult -> TestResult -> Bool #
Eq TestLogType
Instance details Defined in GI.GLib.Enums Methods (==) :: TestLogType -> TestLogType -> Bool # (/=) :: TestLogType -> TestLogType -> Bool #
Eq TestFileType
Instance details Defined in GI.GLib.Enums Methods (==) :: TestFileType -> TestFileType -> Bool # (/=) :: TestFileType -> TestFileType -> Bool #
Eq SpawnError
Instance details Defined in GI.GLib.Enums Methods (==) :: SpawnError -> SpawnError -> Bool # (/=) :: SpawnError -> SpawnError -> Bool #
Eq SliceConfig
Instance details Defined in GI.GLib.Enums Methods (==) :: SliceConfig -> SliceConfig -> Bool # (/=) :: SliceConfig -> SliceConfig -> Bool #
Eq ShellError
Instance details Defined in GI.GLib.Enums Methods (==) :: ShellError -> ShellError -> Bool # (/=) :: ShellError -> ShellError -> Bool #
Eq SeekType
Instance details Defined in GI.GLib.Enums Methods (==) :: SeekType -> SeekType -> Bool # (/=) :: SeekType -> SeekType -> Bool #
Eq RegexError
Instance details Defined in GI.GLib.Enums Methods (==) :: RegexError -> RegexError -> Bool # (/=) :: RegexError -> RegexError -> Bool #
Eq OptionError
Instance details Defined in GI.GLib.Enums Methods (==) :: OptionError -> OptionError -> Bool # (/=) :: OptionError -> OptionError -> Bool #
Eq OptionArg
Instance details Defined in GI.GLib.Enums Methods (==) :: OptionArg -> OptionArg -> Bool # (/=) :: OptionArg -> OptionArg -> Bool #
Eq OnceStatus
Instance details Defined in GI.GLib.Enums Methods (==) :: OnceStatus -> OnceStatus -> Bool # (/=) :: OnceStatus -> OnceStatus -> Bool #
Eq NumberParserError
Instance details Defined in GI.GLib.Enums Methods (==) :: NumberParserError -> NumberParserError -> Bool # (/=) :: NumberParserError -> NumberParserError -> Bool #
Eq NormalizeMode
Instance details Defined in GI.GLib.Enums Methods (==) :: NormalizeMode -> NormalizeMode -> Bool # (/=) :: NormalizeMode -> NormalizeMode -> Bool #
Eq MarkupError
Instance details Defined in GI.GLib.Enums Methods (==) :: MarkupError -> MarkupError -> Bool # (/=) :: MarkupError -> MarkupError -> Bool #
Eq LogWriterOutput
Instance details Defined in GI.GLib.Enums Methods (==) :: LogWriterOutput -> LogWriterOutput -> Bool # (/=) :: LogWriterOutput -> LogWriterOutput -> Bool #
Eq KeyFileError
Instance details Defined in GI.GLib.Enums Methods (==) :: KeyFileError -> KeyFileError -> Bool # (/=) :: KeyFileError -> KeyFileError -> Bool #
Eq IOStatus
Instance details Defined in GI.GLib.Enums Methods (==) :: IOStatus -> IOStatus -> Bool # (/=) :: IOStatus -> IOStatus -> Bool #
Eq IOError
Instance details Defined in GI.GLib.Enums Methods (==) :: IOError -> IOError -> Bool # (/=) :: IOError -> IOError -> Bool #
Eq IOChannelError
Instance details Defined in GI.GLib.Enums Methods (==) :: IOChannelError -> IOChannelError -> Bool # (/=) :: IOChannelError -> IOChannelError -> Bool #
Eq FileError
Instance details Defined in GI.GLib.Enums Methods (==) :: FileError -> FileError -> Bool # (/=) :: FileError -> FileError -> Bool #
Eq ErrorType
Instance details Defined in GI.GLib.Enums Methods (==) :: ErrorType -> ErrorType -> Bool # (/=) :: ErrorType -> ErrorType -> Bool #
Eq DateWeekday
Instance details Defined in GI.GLib.Enums Methods (==) :: DateWeekday -> DateWeekday -> Bool # (/=) :: DateWeekday -> DateWeekday -> Bool #
Eq DateMonth
Instance details Defined in GI.GLib.Enums Methods (==) :: DateMonth -> DateMonth -> Bool # (/=) :: DateMonth -> DateMonth -> Bool #
Eq DateDMY
Instance details Defined in GI.GLib.Enums Methods (==) :: DateDMY -> DateDMY -> Bool # (/=) :: DateDMY -> DateDMY -> Bool #
Eq ConvertError
Instance details Defined in GI.GLib.Enums Methods (==) :: ConvertError -> ConvertError -> Bool # (/=) :: ConvertError -> ConvertError -> Bool #
Eq ChecksumType
Instance details Defined in GI.GLib.Enums Methods (==) :: ChecksumType -> ChecksumType -> Bool # (/=) :: ChecksumType -> ChecksumType -> Bool #
Eq BookmarkFileError
Instance details Defined in GI.GLib.Enums Methods (==) :: BookmarkFileError -> BookmarkFileError -> Bool # (/=) :: BookmarkFileError -> BookmarkFileError -> Bool #
Eq UIManagerItemType
Instance details Defined in GI.Gtk.Flags Methods (==) :: UIManagerItemType -> UIManagerItemType -> Bool # (/=) :: UIManagerItemType -> UIManagerItemType -> Bool #
Eq TreeModelFlags
Instance details Defined in GI.Gtk.Flags Methods (==) :: TreeModelFlags -> TreeModelFlags -> Bool # (/=) :: TreeModelFlags -> TreeModelFlags -> Bool #
Eq ToolPaletteDragTargets
Instance details Defined in GI.Gtk.Flags Methods (==) :: ToolPaletteDragTargets -> ToolPaletteDragTargets -> Bool # (/=) :: ToolPaletteDragTargets -> ToolPaletteDragTargets -> Bool #
Eq TextSearchFlags
Instance details Defined in GI.Gtk.Flags Methods (==) :: TextSearchFlags -> TextSearchFlags -> Bool # (/=) :: TextSearchFlags -> TextSearchFlags -> Bool #
Eq TargetFlags
Instance details Defined in GI.Gtk.Flags Methods (==) :: TargetFlags -> TargetFlags -> Bool # (/=) :: TargetFlags -> TargetFlags -> Bool #
Eq StyleContextPrintFlags
Instance details Defined in GI.Gtk.Flags Methods (==) :: StyleContextPrintFlags -> StyleContextPrintFlags -> Bool # (/=) :: StyleContextPrintFlags -> StyleContextPrintFlags -> Bool #
Eq StateFlags
Instance details Defined in GI.Gtk.Flags Methods (==) :: StateFlags -> StateFlags -> Bool # (/=) :: StateFlags -> StateFlags -> Bool #
Eq RegionFlags
Instance details Defined in GI.Gtk.Flags Methods (==) :: RegionFlags -> RegionFlags -> Bool # (/=) :: RegionFlags -> RegionFlags -> Bool #
Eq RecentFilterFlags
Instance details Defined in GI.Gtk.Flags Methods (==) :: RecentFilterFlags -> RecentFilterFlags -> Bool # (/=) :: RecentFilterFlags -> RecentFilterFlags -> Bool #
Eq RcFlags
Instance details Defined in GI.Gtk.Flags Methods (==) :: RcFlags -> RcFlags -> Bool # (/=) :: RcFlags -> RcFlags -> Bool #
Eq PlacesOpenFlags
Instance details Defined in GI.Gtk.Flags Methods (==) :: PlacesOpenFlags -> PlacesOpenFlags -> Bool # (/=) :: PlacesOpenFlags -> PlacesOpenFlags -> Bool #
Eq JunctionSides
Instance details Defined in GI.Gtk.Flags Methods (==) :: JunctionSides -> JunctionSides -> Bool # (/=) :: JunctionSides -> JunctionSides -> Bool #
Eq InputHints
Instance details Defined in GI.Gtk.Flags Methods (==) :: InputHints -> InputHints -> Bool # (/=) :: InputHints -> InputHints -> Bool #
Eq IconLookupFlags
Instance details Defined in GI.Gtk.Flags Methods (==) :: IconLookupFlags -> IconLookupFlags -> Bool # (/=) :: IconLookupFlags -> IconLookupFlags -> Bool #
Eq FontChooserLevel
Instance details Defined in GI.Gtk.Flags Methods (==) :: FontChooserLevel -> FontChooserLevel -> Bool # (/=) :: FontChooserLevel -> FontChooserLevel -> Bool #
Eq FileFilterFlags
Instance details Defined in GI.Gtk.Flags Methods (==) :: FileFilterFlags -> FileFilterFlags -> Bool # (/=) :: FileFilterFlags -> FileFilterFlags -> Bool #
Eq EventControllerScrollFlags
Instance details Defined in GI.Gtk.Flags Methods (==) :: EventControllerScrollFlags -> EventControllerScrollFlags -> Bool # (/=) :: EventControllerScrollFlags -> EventControllerScrollFlags -> Bool #
Eq DialogFlags
Instance details Defined in GI.Gtk.Flags Methods (==) :: DialogFlags -> DialogFlags -> Bool # (/=) :: DialogFlags -> DialogFlags -> Bool #
Eq DestDefaults
Instance details Defined in GI.Gtk.Flags Methods (==) :: DestDefaults -> DestDefaults -> Bool # (/=) :: DestDefaults -> DestDefaults -> Bool #
Eq DebugFlag
Instance details Defined in GI.Gtk.Flags Methods (==) :: DebugFlag -> DebugFlag -> Bool # (/=) :: DebugFlag -> DebugFlag -> Bool #
Eq CellRendererState
Instance details Defined in GI.Gtk.Flags Methods (==) :: CellRendererState -> CellRendererState -> Bool # (/=) :: CellRendererState -> CellRendererState -> Bool #
Eq CalendarDisplayOptions
Instance details Defined in GI.Gtk.Flags Methods (==) :: CalendarDisplayOptions -> CalendarDisplayOptions -> Bool # (/=) :: CalendarDisplayOptions -> CalendarDisplayOptions -> Bool #
Eq AttachOptions
Instance details Defined in GI.Gtk.Flags Methods (==) :: AttachOptions -> AttachOptions -> Bool # (/=) :: AttachOptions -> AttachOptions -> Bool #
Eq ApplicationInhibitFlags
Instance details Defined in GI.Gtk.Flags Methods (==) :: ApplicationInhibitFlags -> ApplicationInhibitFlags -> Bool # (/=) :: ApplicationInhibitFlags -> ApplicationInhibitFlags -> Bool #
Eq AccelFlags
Instance details Defined in GI.Gtk.Flags Methods (==) :: AccelFlags -> AccelFlags -> Bool # (/=) :: AccelFlags -> AccelFlags -> Bool #
Eq WrapMode
Instance details Defined in GI.Gtk.Enums Methods (==) :: WrapMode -> WrapMode -> Bool # (/=) :: WrapMode -> WrapMode -> Bool #
Eq WindowType
Instance details Defined in GI.Gtk.Enums Methods (==) :: WindowType -> WindowType -> Bool # (/=) :: WindowType -> WindowType -> Bool #
Eq WindowPosition
Instance details Defined in GI.Gtk.Enums Methods (==) :: WindowPosition -> WindowPosition -> Bool # (/=) :: WindowPosition -> WindowPosition -> Bool #
Eq WidgetHelpType
Instance details Defined in GI.Gtk.Enums Methods (==) :: WidgetHelpType -> WidgetHelpType -> Bool # (/=) :: WidgetHelpType -> WidgetHelpType -> Bool #
Eq Unit
Instance details Defined in GI.Gtk.Enums Methods (==) :: Unit -> Unit -> Bool # (/=) :: Unit -> Unit -> Bool #
Eq TreeViewGridLines
Instance details Defined in GI.Gtk.Enums Methods (==) :: TreeViewGridLines -> TreeViewGridLines -> Bool # (/=) :: TreeViewGridLines -> TreeViewGridLines -> Bool #
Eq TreeViewDropPosition
Instance details Defined in GI.Gtk.Enums Methods (==) :: TreeViewDropPosition -> TreeViewDropPosition -> Bool # (/=) :: TreeViewDropPosition -> TreeViewDropPosition -> Bool #
Eq TreeViewColumnSizing
Instance details Defined in GI.Gtk.Enums Methods (==) :: TreeViewColumnSizing -> TreeViewColumnSizing -> Bool # (/=) :: TreeViewColumnSizing -> TreeViewColumnSizing -> Bool #
Eq ToolbarStyle
Instance details Defined in GI.Gtk.Enums Methods (==) :: ToolbarStyle -> ToolbarStyle -> Bool # (/=) :: ToolbarStyle -> ToolbarStyle -> Bool #
Eq ToolbarSpaceStyle
Instance details Defined in GI.Gtk.Enums Methods (==) :: ToolbarSpaceStyle -> ToolbarSpaceStyle -> Bool # (/=) :: ToolbarSpaceStyle -> ToolbarSpaceStyle -> Bool #
Eq TextWindowType
Instance details Defined in GI.Gtk.Enums Methods (==) :: TextWindowType -> TextWindowType -> Bool # (/=) :: TextWindowType -> TextWindowType -> Bool #
Eq TextViewLayer
Instance details Defined in GI.Gtk.Enums Methods (==) :: TextViewLayer -> TextViewLayer -> Bool # (/=) :: TextViewLayer -> TextViewLayer -> Bool #
Eq TextExtendSelection
Instance details Defined in GI.Gtk.Enums Methods (==) :: TextExtendSelection -> TextExtendSelection -> Bool # (/=) :: TextExtendSelection -> TextExtendSelection -> Bool #
Eq TextDirection
Instance details Defined in GI.Gtk.Enums Methods (==) :: TextDirection -> TextDirection -> Bool # (/=) :: TextDirection -> TextDirection -> Bool #
Eq TextBufferTargetInfo
Instance details Defined in GI.Gtk.Enums Methods (==) :: TextBufferTargetInfo -> TextBufferTargetInfo -> Bool # (/=) :: TextBufferTargetInfo -> TextBufferTargetInfo -> Bool #
Eq StateType
Instance details Defined in GI.Gtk.Enums Methods (==) :: StateType -> StateType -> Bool # (/=) :: StateType -> StateType -> Bool #
Eq StackTransitionType
Instance details Defined in GI.Gtk.Enums Methods (==) :: StackTransitionType -> StackTransitionType -> Bool # (/=) :: StackTransitionType -> StackTransitionType -> Bool #
Eq SpinType
Instance details Defined in GI.Gtk.Enums Methods (==) :: SpinType -> SpinType -> Bool # (/=) :: SpinType -> SpinType -> Bool #
Eq SpinButtonUpdatePolicy
Instance details Defined in GI.Gtk.Enums Methods (==) :: SpinButtonUpdatePolicy -> SpinButtonUpdatePolicy -> Bool # (/=) :: SpinButtonUpdatePolicy -> SpinButtonUpdatePolicy -> Bool #
Eq SortType
Instance details Defined in GI.Gtk.Enums Methods (==) :: SortType -> SortType -> Bool # (/=) :: SortType -> SortType -> Bool #
Eq SizeRequestMode
Instance details Defined in GI.Gtk.Enums Methods (==) :: SizeRequestMode -> SizeRequestMode -> Bool # (/=) :: SizeRequestMode -> SizeRequestMode -> Bool #
Eq SizeGroupMode
Instance details Defined in GI.Gtk.Enums Methods (==) :: SizeGroupMode -> SizeGroupMode -> Bool # (/=) :: SizeGroupMode -> SizeGroupMode -> Bool #
Eq ShortcutType
Instance details Defined in GI.Gtk.Enums Methods (==) :: ShortcutType -> ShortcutType -> Bool # (/=) :: ShortcutType -> ShortcutType -> Bool #
Eq ShadowType
Instance details Defined in GI.Gtk.Enums Methods (==) :: ShadowType -> ShadowType -> Bool # (/=) :: ShadowType -> ShadowType -> Bool #
Eq SensitivityType
Instance details Defined in GI.Gtk.Enums Methods (==) :: SensitivityType -> SensitivityType -> Bool # (/=) :: SensitivityType -> SensitivityType -> Bool #
Eq SelectionMode
Instance details Defined in GI.Gtk.Enums Methods (==) :: SelectionMode -> SelectionMode -> Bool # (/=) :: SelectionMode -> SelectionMode -> Bool #
Eq ScrollablePolicy
Instance details Defined in GI.Gtk.Enums Methods (==) :: ScrollablePolicy -> ScrollablePolicy -> Bool # (/=) :: ScrollablePolicy -> ScrollablePolicy -> Bool #
Eq ScrollType
Instance details Defined in GI.Gtk.Enums Methods (==) :: ScrollType -> ScrollType -> Bool # (/=) :: ScrollType -> ScrollType -> Bool #
Eq ScrollStep
Instance details Defined in GI.Gtk.Enums Methods (==) :: ScrollStep -> ScrollStep -> Bool # (/=) :: ScrollStep -> ScrollStep -> Bool #
Eq RevealerTransitionType
Instance details Defined in GI.Gtk.Enums Methods (==) :: RevealerTransitionType -> RevealerTransitionType -> Bool # (/=) :: RevealerTransitionType -> RevealerTransitionType -> Bool #
Eq ResponseType
Instance details Defined in GI.Gtk.Enums Methods (==) :: ResponseType -> ResponseType -> Bool # (/=) :: ResponseType -> ResponseType -> Bool #
Eq ResizeMode
Instance details Defined in GI.Gtk.Enums Methods (==) :: ResizeMode -> ResizeMode -> Bool # (/=) :: ResizeMode -> ResizeMode -> Bool #
Eq ReliefStyle
Instance details Defined in GI.Gtk.Enums Methods (==) :: ReliefStyle -> ReliefStyle -> Bool # (/=) :: ReliefStyle -> ReliefStyle -> Bool #
Eq RecentSortType
Instance details Defined in GI.Gtk.Enums Methods (==) :: RecentSortType -> RecentSortType -> Bool # (/=) :: RecentSortType -> RecentSortType -> Bool #
Eq RecentManagerError
Instance details Defined in GI.Gtk.Enums Methods (==) :: RecentManagerError -> RecentManagerError -> Bool # (/=) :: RecentManagerError -> RecentManagerError -> Bool #
Eq RecentChooserError
Instance details Defined in GI.Gtk.Enums Methods (==) :: RecentChooserError -> RecentChooserError -> Bool # (/=) :: RecentChooserError -> RecentChooserError -> Bool #
Eq RcTokenType
Instance details Defined in GI.Gtk.Enums Methods (==) :: RcTokenType -> RcTokenType -> Bool # (/=) :: RcTokenType -> RcTokenType -> Bool #
Eq PropagationPhase
Instance details Defined in GI.Gtk.Enums Methods (==) :: PropagationPhase -> PropagationPhase -> Bool # (/=) :: PropagationPhase -> PropagationPhase -> Bool #
Eq PrintStatus
Instance details Defined in GI.Gtk.Enums Methods (==) :: PrintStatus -> PrintStatus -> Bool # (/=) :: PrintStatus -> PrintStatus -> Bool #
Eq PrintQuality
Instance details Defined in GI.Gtk.Enums Methods (==) :: PrintQuality -> PrintQuality -> Bool # (/=) :: PrintQuality -> PrintQuality -> Bool #
Eq PrintPages
Instance details Defined in GI.Gtk.Enums Methods (==) :: PrintPages -> PrintPages -> Bool # (/=) :: PrintPages -> PrintPages -> Bool #
Eq PrintOperationResult
Instance details Defined in GI.Gtk.Enums Methods (==) :: PrintOperationResult -> PrintOperationResult -> Bool # (/=) :: PrintOperationResult -> PrintOperationResult -> Bool #
Eq PrintOperationAction
Instance details Defined in GI.Gtk.Enums Methods (==) :: PrintOperationAction -> PrintOperationAction -> Bool # (/=) :: PrintOperationAction -> PrintOperationAction -> Bool #
Eq PrintError
Instance details Defined in GI.Gtk.Enums Methods (==) :: PrintError -> PrintError -> Bool # (/=) :: PrintError -> PrintError -> Bool #
Eq PrintDuplex
Instance details Defined in GI.Gtk.Enums Methods (==) :: PrintDuplex -> PrintDuplex -> Bool # (/=) :: PrintDuplex -> PrintDuplex -> Bool #
Eq PositionType
Instance details Defined in GI.Gtk.Enums Methods (==) :: PositionType -> PositionType -> Bool # (/=) :: PositionType -> PositionType -> Bool #
Eq PopoverConstraint
Instance details Defined in GI.Gtk.Enums Methods (==) :: PopoverConstraint -> PopoverConstraint -> Bool # (/=) :: PopoverConstraint -> PopoverConstraint -> Bool #
Eq PolicyType
Instance details Defined in GI.Gtk.Enums Methods (==) :: PolicyType -> PolicyType -> Bool # (/=) :: PolicyType -> PolicyType -> Bool #
Eq PathType
Instance details Defined in GI.Gtk.Enums Methods (==) :: PathType -> PathType -> Bool # (/=) :: PathType -> PathType -> Bool #
Eq PathPriorityType
Instance details Defined in GI.Gtk.Enums Methods (==) :: PathPriorityType -> PathPriorityType -> Bool # (/=) :: PathPriorityType -> PathPriorityType -> Bool #
Eq PanDirection
Instance details Defined in GI.Gtk.Enums Methods (==) :: PanDirection -> PanDirection -> Bool # (/=) :: PanDirection -> PanDirection -> Bool #
Eq PageSet
Instance details Defined in GI.Gtk.Enums Methods (==) :: PageSet -> PageSet -> Bool # (/=) :: PageSet -> PageSet -> Bool #
Eq PageOrientation
Instance details Defined in GI.Gtk.Enums Methods (==) :: PageOrientation -> PageOrientation -> Bool # (/=) :: PageOrientation -> PageOrientation -> Bool #
Eq PadActionType
Instance details Defined in GI.Gtk.Enums Methods (==) :: PadActionType -> PadActionType -> Bool # (/=) :: PadActionType -> PadActionType -> Bool #
Eq PackType
Instance details Defined in GI.Gtk.Enums Methods (==) :: PackType -> PackType -> Bool # (/=) :: PackType -> PackType -> Bool #
Eq PackDirection
Instance details Defined in GI.Gtk.Enums Methods (==) :: PackDirection -> PackDirection -> Bool # (/=) :: PackDirection -> PackDirection -> Bool #
Eq Orientation
Instance details Defined in GI.Gtk.Enums Methods (==) :: Orientation -> Orientation -> Bool # (/=) :: Orientation -> Orientation -> Bool #
Eq NumberUpLayout
Instance details Defined in GI.Gtk.Enums Methods (==) :: NumberUpLayout -> NumberUpLayout -> Bool # (/=) :: NumberUpLayout -> NumberUpLayout -> Bool #
Eq NotebookTab
Instance details Defined in GI.Gtk.Enums Methods (==) :: NotebookTab -> NotebookTab -> Bool # (/=) :: NotebookTab -> NotebookTab -> Bool #
Eq MovementStep
Instance details Defined in GI.Gtk.Enums Methods (==) :: MovementStep -> MovementStep -> Bool # (/=) :: MovementStep -> MovementStep -> Bool #
Eq MessageType
Instance details Defined in GI.Gtk.Enums Methods (==) :: MessageType -> MessageType -> Bool # (/=) :: MessageType -> MessageType -> Bool #
Eq MenuDirectionType
Instance details Defined in GI.Gtk.Enums Methods (==) :: MenuDirectionType -> MenuDirectionType -> Bool # (/=) :: MenuDirectionType -> MenuDirectionType -> Bool #
Eq License
Instance details Defined in GI.Gtk.Enums Methods (==) :: License -> License -> Bool # (/=) :: License -> License -> Bool #
Eq LevelBarMode
Instance details Defined in GI.Gtk.Enums Methods (==) :: LevelBarMode -> LevelBarMode -> Bool # (/=) :: LevelBarMode -> LevelBarMode -> Bool #
Eq Justification
Instance details Defined in GI.Gtk.Enums Methods (==) :: Justification -> Justification -> Bool # (/=) :: Justification -> Justification -> Bool #
Eq InputPurpose
Instance details Defined in GI.Gtk.Enums Methods (==) :: InputPurpose -> InputPurpose -> Bool # (/=) :: InputPurpose -> InputPurpose -> Bool #
Eq ImageType
Instance details Defined in GI.Gtk.Enums Methods (==) :: ImageType -> ImageType -> Bool # (/=) :: ImageType -> ImageType -> Bool #
Eq IconViewDropPosition
Instance details Defined in GI.Gtk.Enums Methods (==) :: IconViewDropPosition -> IconViewDropPosition -> Bool # (/=) :: IconViewDropPosition -> IconViewDropPosition -> Bool #
Eq IconThemeError
Instance details Defined in GI.Gtk.Enums Methods (==) :: IconThemeError -> IconThemeError -> Bool # (/=) :: IconThemeError -> IconThemeError -> Bool #
Eq IconSize
Instance details Defined in GI.Gtk.Enums Methods (==) :: IconSize -> IconSize -> Bool # (/=) :: IconSize -> IconSize -> Bool #
Eq IMStatusStyle
Instance details Defined in GI.Gtk.Enums Methods (==) :: IMStatusStyle -> IMStatusStyle -> Bool # (/=) :: IMStatusStyle -> IMStatusStyle -> Bool #
Eq IMPreeditStyle
Instance details Defined in GI.Gtk.Enums Methods (==) :: IMPreeditStyle -> IMPreeditStyle -> Bool # (/=) :: IMPreeditStyle -> IMPreeditStyle -> Bool #
Eq FileChooserError
Instance details Defined in GI.Gtk.Enums Methods (==) :: FileChooserError -> FileChooserError -> Bool # (/=) :: FileChooserError -> FileChooserError -> Bool #
Eq FileChooserConfirmation
Instance details Defined in GI.Gtk.Enums Methods (==) :: FileChooserConfirmation -> FileChooserConfirmation -> Bool # (/=) :: FileChooserConfirmation -> FileChooserConfirmation -> Bool #
Eq FileChooserAction
Instance details Defined in GI.Gtk.Enums Methods (==) :: FileChooserAction -> FileChooserAction -> Bool # (/=) :: FileChooserAction -> FileChooserAction -> Bool #
Eq ExpanderStyle
Instance details Defined in GI.Gtk.Enums Methods (==) :: ExpanderStyle -> ExpanderStyle -> Bool # (/=) :: ExpanderStyle -> ExpanderStyle -> Bool #
Eq EventSequenceState
Instance details Defined in GI.Gtk.Enums Methods (==) :: EventSequenceState -> EventSequenceState -> Bool # (/=) :: EventSequenceState -> EventSequenceState -> Bool #
Eq EntryIconPosition
Instance details Defined in GI.Gtk.Enums Methods (==) :: EntryIconPosition -> EntryIconPosition -> Bool # (/=) :: EntryIconPosition -> EntryIconPosition -> Bool #
Eq DragResult
Instance details Defined in GI.Gtk.Enums Methods (==) :: DragResult -> DragResult -> Bool # (/=) :: DragResult -> DragResult -> Bool #
Eq DirectionType
Instance details Defined in GI.Gtk.Enums Methods (==) :: DirectionType -> DirectionType -> Bool # (/=) :: DirectionType -> DirectionType -> Bool #
Eq DeleteType
Instance details Defined in GI.Gtk.Enums Methods (==) :: DeleteType -> DeleteType -> Bool # (/=) :: DeleteType -> DeleteType -> Bool #
Eq CssSectionType
Instance details Defined in GI.Gtk.Enums Methods (==) :: CssSectionType -> CssSectionType -> Bool # (/=) :: CssSectionType -> CssSectionType -> Bool #
Eq CssProviderError
Instance details Defined in GI.Gtk.Enums Methods (==) :: CssProviderError -> CssProviderError -> Bool # (/=) :: CssProviderError -> CssProviderError -> Bool #
Eq CornerType
Instance details Defined in GI.Gtk.Enums Methods (==) :: CornerType -> CornerType -> Bool # (/=) :: CornerType -> CornerType -> Bool #
Eq CellRendererMode
Instance details Defined in GI.Gtk.Enums Methods (==) :: CellRendererMode -> CellRendererMode -> Bool # (/=) :: CellRendererMode -> CellRendererMode -> Bool #
Eq CellRendererAccelMode
Instance details Defined in GI.Gtk.Enums Methods (==) :: CellRendererAccelMode -> CellRendererAccelMode -> Bool # (/=) :: CellRendererAccelMode -> CellRendererAccelMode -> Bool #
Eq ButtonsType
Instance details Defined in GI.Gtk.Enums Methods (==) :: ButtonsType -> ButtonsType -> Bool # (/=) :: ButtonsType -> ButtonsType -> Bool #
Eq ButtonRole
Instance details Defined in GI.Gtk.Enums Methods (==) :: ButtonRole -> ButtonRole -> Bool # (/=) :: ButtonRole -> ButtonRole -> Bool #
Eq ButtonBoxStyle
Instance details Defined in GI.Gtk.Enums Methods (==) :: ButtonBoxStyle -> ButtonBoxStyle -> Bool # (/=) :: ButtonBoxStyle -> ButtonBoxStyle -> Bool #
Eq BuilderError
Instance details Defined in GI.Gtk.Enums Methods (==) :: BuilderError -> BuilderError -> Bool # (/=) :: BuilderError -> BuilderError -> Bool #
Eq BorderStyle
Instance details Defined in GI.Gtk.Enums Methods (==) :: BorderStyle -> BorderStyle -> Bool # (/=) :: BorderStyle -> BorderStyle -> Bool #
Eq BaselinePosition
Instance details Defined in GI.Gtk.Enums Methods (==) :: BaselinePosition -> BaselinePosition -> Bool # (/=) :: BaselinePosition -> BaselinePosition -> Bool #
Eq AssistantPageType
Instance details Defined in GI.Gtk.Enums Methods (==) :: AssistantPageType -> AssistantPageType -> Bool # (/=) :: AssistantPageType -> AssistantPageType -> Bool #
Eq ArrowType
Instance details Defined in GI.Gtk.Enums Methods (==) :: ArrowType -> ArrowType -> Bool # (/=) :: ArrowType -> ArrowType -> Bool #
Eq ArrowPlacement
Instance details Defined in GI.Gtk.Enums Methods (==) :: ArrowPlacement -> ArrowPlacement -> Bool # (/=) :: ArrowPlacement -> ArrowPlacement -> Bool #
Eq Align
Instance details Defined in GI.Gtk.Enums Methods (==) :: Align -> Align -> Bool # (/=) :: Align -> Align -> Bool #
Eq WrapMode
Instance details Defined in GI.Pango.Enums Methods (==) :: WrapMode -> WrapMode -> Bool # (/=) :: WrapMode -> WrapMode -> Bool #
Eq Weight
Instance details Defined in GI.Pango.Enums Methods (==) :: Weight -> Weight -> Bool # (/=) :: Weight -> Weight -> Bool #
Eq Variant
Instance details Defined in GI.Pango.Enums Methods (==) :: Variant -> Variant -> Bool # (/=) :: Variant -> Variant -> Bool #
Eq Underline
Instance details Defined in GI.Pango.Enums Methods (==) :: Underline -> Underline -> Bool # (/=) :: Underline -> Underline -> Bool #
Eq TabAlign
Instance details Defined in GI.Pango.Enums Methods (==) :: TabAlign -> TabAlign -> Bool # (/=) :: TabAlign -> TabAlign -> Bool #
Eq Style
Instance details Defined in GI.Pango.Enums Methods (==) :: Style -> Style -> Bool # (/=) :: Style -> Style -> Bool #
Eq Stretch
Instance details Defined in GI.Pango.Enums Methods (==) :: Stretch -> Stretch -> Bool # (/=) :: Stretch -> Stretch -> Bool #
Eq Script
Instance details Defined in GI.Pango.Enums Methods (==) :: Script -> Script -> Bool # (/=) :: Script -> Script -> Bool #
Eq RenderPart
Instance details Defined in GI.Pango.Enums Methods (==) :: RenderPart -> RenderPart -> Bool # (/=) :: RenderPart -> RenderPart -> Bool #
Eq GravityHint
Instance details Defined in GI.Pango.Enums Methods (==) :: GravityHint -> GravityHint -> Bool # (/=) :: GravityHint -> GravityHint -> Bool #
Eq Gravity
Instance details Defined in GI.Pango.Enums Methods (==) :: Gravity -> Gravity -> Bool # (/=) :: Gravity -> Gravity -> Bool #
Eq EllipsizeMode
Instance details Defined in GI.Pango.Enums Methods (==) :: EllipsizeMode -> EllipsizeMode -> Bool # (/=) :: EllipsizeMode -> EllipsizeMode -> Bool #
Eq Direction
Instance details Defined in GI.Pango.Enums Methods (==) :: Direction -> Direction -> Bool # (/=) :: Direction -> Direction -> Bool #
Eq CoverageLevel
Instance details Defined in GI.Pango.Enums Methods (==) :: CoverageLevel -> CoverageLevel -> Bool # (/=) :: CoverageLevel -> CoverageLevel -> Bool #
Eq BidiType
Instance details Defined in GI.Pango.Enums Methods (==) :: BidiType -> BidiType -> Bool # (/=) :: BidiType -> BidiType -> Bool #
Eq AttrType
Instance details Defined in GI.Pango.Enums Methods (==) :: AttrType -> AttrType -> Bool # (/=) :: AttrType -> AttrType -> Bool #
Eq Alignment
Instance details Defined in GI.Pango.Enums Methods (==) :: Alignment -> Alignment -> Bool # (/=) :: Alignment -> Alignment -> Bool #
Eq PtyFlags
Instance details Defined in GI.Vte.Flags Methods (==) :: PtyFlags -> PtyFlags -> Bool # (/=) :: PtyFlags -> PtyFlags -> Bool #
Eq WriteFlags
Instance details Defined in GI.Vte.Enums Methods (==) :: WriteFlags -> WriteFlags -> Bool # (/=) :: WriteFlags -> WriteFlags -> Bool #
Eq TextBlinkMode
Instance details Defined in GI.Vte.Enums Methods (==) :: TextBlinkMode -> TextBlinkMode -> Bool # (/=) :: TextBlinkMode -> TextBlinkMode -> Bool #
Eq RegexError
Instance details Defined in GI.Vte.Enums Methods (==) :: RegexError -> RegexError -> Bool # (/=) :: RegexError -> RegexError -> Bool #
Eq PtyError
Instance details Defined in GI.Vte.Enums Methods (==) :: PtyError -> PtyError -> Bool # (/=) :: PtyError -> PtyError -> Bool #
Eq Format
Instance details Defined in GI.Vte.Enums Methods (==) :: Format -> Format -> Bool # (/=) :: Format -> Format -> Bool #
Eq EraseBinding
Instance details Defined in GI.Vte.Enums Methods (==) :: EraseBinding -> EraseBinding -> Bool # (/=) :: EraseBinding -> EraseBinding -> Bool #
Eq CursorShape
Instance details Defined in GI.Vte.Enums Methods (==) :: CursorShape -> CursorShape -> Bool # (/=) :: CursorShape -> CursorShape -> Bool #
Eq CursorBlinkMode
Instance details Defined in GI.Vte.Enums Methods (==) :: CursorBlinkMode -> CursorBlinkMode -> Bool # (/=) :: CursorBlinkMode -> CursorBlinkMode -> Bool #
Eq Name
Instance details Defined in Data.XML.Types Methods (==) :: Name -> Name -> Bool # (/=) :: Name -> Name -> Bool #
Eq Element
Instance details Defined in Text.XML Methods (==) :: Element -> Element -> Bool # (/=) :: Element -> Element -> Bool #
Eq AttrOpTag
Instance details Defined in Data.GI.Base.Attributes Methods (==) :: AttrOpTag -> AttrOpTag -> Bool # (/=) :: AttrOpTag -> AttrOpTag -> Bool #
Eq NCon
Instance details Defined in Control.Lens.Internal.PrismTH Methods (==) :: NCon -> NCon -> Bool # (/=) :: NCon -> NCon -> Bool #
Eq TyVarBndr
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: TyVarBndr -> TyVarBndr -> Bool # (/=) :: TyVarBndr -> TyVarBndr -> Bool #
Eq TextDetails
Instance details Defined in Text.PrettyPrint.Annotated.HughesPJ Methods (==) :: TextDetails -> TextDetails -> Bool # (/=) :: TextDetails -> TextDetails -> Bool #
Eq Style
Instance details Defined in Text.PrettyPrint.Annotated.HughesPJ Methods (==) :: Style -> Style -> Bool # (/=) :: Style -> Style -> Bool #
Eq Mode
Instance details Defined in Text.PrettyPrint.Annotated.HughesPJ Methods (==) :: Mode -> Mode -> Bool # (/=) :: Mode -> Mode -> Bool #
Eq OutputOptions
Instance details Defined in Text.Pretty.Simple.Internal.OutputPrinter Methods (==) :: OutputOptions -> OutputOptions -> Bool # (/=) :: OutputOptions -> OutputOptions -> Bool #
Eq LineNum
Instance details Defined in Text.Pretty.Simple.Internal.ExprToOutput Methods (==) :: LineNum -> LineNum -> Bool # (/=) :: LineNum -> LineNum -> Bool #
Eq PrinterState
Instance details Defined in Text.Pretty.Simple.Internal.ExprToOutput Methods (==) :: PrinterState -> PrinterState -> Bool # (/=) :: PrinterState -> PrinterState -> Bool #
Eq NestLevel
Instance details Defined in Text.Pretty.Simple.Internal.Output Methods (==) :: NestLevel -> NestLevel -> Bool # (/=) :: NestLevel -> NestLevel -> Bool #
Eq OutputType
Instance details Defined in Text.Pretty.Simple.Internal.Output Methods (==) :: OutputType -> OutputType -> Bool # (/=) :: OutputType -> OutputType -> Bool #
Eq Output
Instance details Defined in Text.Pretty.Simple.Internal.Output Methods (==) :: Output -> Output -> Bool # (/=) :: Output -> Output -> Bool #
Eq Expr
Instance details Defined in Text.Pretty.Simple.Internal.Expr Methods (==) :: Expr -> Expr -> Bool # (/=) :: Expr -> Expr -> Bool #
Eq ColorOptions
Instance details Defined in Text.Pretty.Simple.Internal.Color Methods (==) :: ColorOptions -> ColorOptions -> Bool # (/=) :: ColorOptions -> ColorOptions -> Bool #
Eq ByteArray	Since: primitive-0.6.3.0
Instance details Defined in Data.Primitive.ByteArray Methods (==) :: ByteArray -> ByteArray -> Bool # (/=) :: ByteArray -> ByteArray -> Bool #
Eq Addr
Instance details Defined in Data.Primitive.Types Methods (==) :: Addr -> Addr -> Bool # (/=) :: Addr -> Addr -> Bool #
Eq ModName
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: ModName -> ModName -> Bool # (/=) :: ModName -> ModName -> Bool #
Eq PkgName
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: PkgName -> PkgName -> Bool # (/=) :: PkgName -> PkgName -> Bool #
Eq Module
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Module -> Module -> Bool # (/=) :: Module -> Module -> Bool #
Eq OccName
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: OccName -> OccName -> Bool # (/=) :: OccName -> OccName -> Bool #
Eq NameFlavour
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: NameFlavour -> NameFlavour -> Bool # (/=) :: NameFlavour -> NameFlavour -> Bool #
Eq NameSpace
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: NameSpace -> NameSpace -> Bool # (/=) :: NameSpace -> NameSpace -> Bool #
Eq Loc
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Loc -> Loc -> Bool # (/=) :: Loc -> Loc -> Bool #
Eq Info
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Info -> Info -> Bool # (/=) :: Info -> Info -> Bool #
Eq ModuleInfo
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: ModuleInfo -> ModuleInfo -> Bool # (/=) :: ModuleInfo -> ModuleInfo -> Bool #
Eq Fixity
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Fixity -> Fixity -> Bool # (/=) :: Fixity -> Fixity -> Bool #
Eq FixityDirection
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: FixityDirection -> FixityDirection -> Bool # (/=) :: FixityDirection -> FixityDirection -> Bool #
Eq Lit
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Lit -> Lit -> Bool # (/=) :: Lit -> Lit -> Bool #
Eq Body
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Body -> Body -> Bool # (/=) :: Body -> Body -> Bool #
Eq Guard
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Guard -> Guard -> Bool # (/=) :: Guard -> Guard -> Bool #
Eq Stmt
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Stmt -> Stmt -> Bool # (/=) :: Stmt -> Stmt -> Bool #
Eq Range
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Range -> Range -> Bool # (/=) :: Range -> Range -> Bool #
Eq DerivClause
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: DerivClause -> DerivClause -> Bool # (/=) :: DerivClause -> DerivClause -> Bool #
Eq DerivStrategy
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: DerivStrategy -> DerivStrategy -> Bool # (/=) :: DerivStrategy -> DerivStrategy -> Bool #
Eq TypeFamilyHead
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: TypeFamilyHead -> TypeFamilyHead -> Bool # (/=) :: TypeFamilyHead -> TypeFamilyHead -> Bool #
Eq TySynEqn
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: TySynEqn -> TySynEqn -> Bool # (/=) :: TySynEqn -> TySynEqn -> Bool #
Eq Foreign
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Foreign -> Foreign -> Bool # (/=) :: Foreign -> Foreign -> Bool #
Eq Callconv
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Callconv -> Callconv -> Bool # (/=) :: Callconv -> Callconv -> Bool #
Eq Safety
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Safety -> Safety -> Bool # (/=) :: Safety -> Safety -> Bool #
Eq Pragma
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Pragma -> Pragma -> Bool # (/=) :: Pragma -> Pragma -> Bool #
Eq Inline
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Inline -> Inline -> Bool # (/=) :: Inline -> Inline -> Bool #
Eq RuleMatch
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: RuleMatch -> RuleMatch -> Bool # (/=) :: RuleMatch -> RuleMatch -> Bool #
Eq Phases
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Phases -> Phases -> Bool # (/=) :: Phases -> Phases -> Bool #
Eq RuleBndr
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: RuleBndr -> RuleBndr -> Bool # (/=) :: RuleBndr -> RuleBndr -> Bool #
Eq AnnTarget
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: AnnTarget -> AnnTarget -> Bool # (/=) :: AnnTarget -> AnnTarget -> Bool #
Eq SourceUnpackedness
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: SourceUnpackedness -> SourceUnpackedness -> Bool # (/=) :: SourceUnpackedness -> SourceUnpackedness -> Bool #
Eq SourceStrictness
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: SourceStrictness -> SourceStrictness -> Bool # (/=) :: SourceStrictness -> SourceStrictness -> Bool #
Eq DecidedStrictness
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: DecidedStrictness -> DecidedStrictness -> Bool # (/=) :: DecidedStrictness -> DecidedStrictness -> Bool #
Eq Bang
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Bang -> Bang -> Bool # (/=) :: Bang -> Bang -> Bool #
Eq PatSynDir
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: PatSynDir -> PatSynDir -> Bool # (/=) :: PatSynDir -> PatSynDir -> Bool #
Eq PatSynArgs
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: PatSynArgs -> PatSynArgs -> Bool # (/=) :: PatSynArgs -> PatSynArgs -> Bool #
Eq FamilyResultSig
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: FamilyResultSig -> FamilyResultSig -> Bool # (/=) :: FamilyResultSig -> FamilyResultSig -> Bool #
Eq TyLit
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: TyLit -> TyLit -> Bool # (/=) :: TyLit -> TyLit -> Bool #
Eq Role
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: Role -> Role -> Bool # (/=) :: Role -> Role -> Bool #
Eq AnnLookup
Instance details Defined in Language.Haskell.TH.Syntax Methods (==) :: AnnLookup -> AnnLookup -> Bool # (/=) :: AnnLookup -> AnnLookup -> Bool #
Eq DatatypeInfo
Instance details Defined in Language.Haskell.TH.Datatype Methods (==) :: DatatypeInfo -> DatatypeInfo -> Bool # (/=) :: DatatypeInfo -> DatatypeInfo -> Bool #
Eq DatatypeVariant
Instance details Defined in Language.Haskell.TH.Datatype Methods (==) :: DatatypeVariant -> DatatypeVariant -> Bool # (/=) :: DatatypeVariant -> DatatypeVariant -> Bool #
Eq ConstructorInfo
Instance details Defined in Language.Haskell.TH.Datatype Methods (==) :: ConstructorInfo -> ConstructorInfo -> Bool # (/=) :: ConstructorInfo -> ConstructorInfo -> Bool #
Eq ConstructorVariant
Instance details Defined in Language.Haskell.TH.Datatype Methods (==) :: ConstructorVariant -> ConstructorVariant -> Bool # (/=) :: ConstructorVariant -> ConstructorVariant -> Bool #
Eq FieldStrictness
Instance details Defined in Language.Haskell.TH.Datatype Methods (==) :: FieldStrictness -> FieldStrictness -> Bool # (/=) :: FieldStrictness -> FieldStrictness -> Bool #
Eq Unpackedness
Instance details Defined in Language.Haskell.TH.Datatype Methods (==) :: Unpackedness -> Unpackedness -> Bool # (/=) :: Unpackedness -> Unpackedness -> Bool #
Eq Strictness
Instance details Defined in Language.Haskell.TH.Datatype Methods (==) :: Strictness -> Strictness -> Bool # (/=) :: Strictness -> Strictness -> Bool #
Eq NewOrData
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods (==) :: NewOrData -> NewOrData -> Bool # (/=) :: NewOrData -> NewOrData -> Bool #
Eq TimeLocale
Instance details Defined in Data.Time.Format.Locale Methods (==) :: TimeLocale -> TimeLocale -> Bool # (/=) :: TimeLocale -> TimeLocale -> Bool #
Eq LocalTime
Instance details Defined in Data.Time.LocalTime.Internal.LocalTime Methods (==) :: LocalTime -> LocalTime -> Bool # (/=) :: LocalTime -> LocalTime -> Bool #
Eq TimeOfDay
Instance details Defined in Data.Time.LocalTime.Internal.TimeOfDay Methods (==) :: TimeOfDay -> TimeOfDay -> Bool # (/=) :: TimeOfDay -> TimeOfDay -> Bool #
Eq TimeZone
Instance details Defined in Data.Time.LocalTime.Internal.TimeZone Methods (==) :: TimeZone -> TimeZone -> Bool # (/=) :: TimeZone -> TimeZone -> Bool #
Eq UniversalTime
Instance details Defined in Data.Time.Clock.Internal.UniversalTime Methods (==) :: UniversalTime -> UniversalTime -> Bool # (/=) :: UniversalTime -> UniversalTime -> Bool #
Eq DiffTime
Instance details Defined in Data.Time.Clock.Internal.DiffTime Methods (==) :: DiffTime -> DiffTime -> Bool # (/=) :: DiffTime -> DiffTime -> Bool #
Eq Event
Instance details Defined in Data.XML.Types Methods (==) :: Event -> Event -> Bool # (/=) :: Event -> Event -> Bool #
Eq Document
Instance details Defined in Text.XML Methods (==) :: Document -> Document -> Bool # (/=) :: Document -> Document -> Bool #
Eq Node
Instance details Defined in Text.XML Methods (==) :: Node -> Node -> Bool # (/=) :: Node -> Node -> Bool #
Eq ExternalID
Instance details Defined in Data.XML.Types Methods (==) :: ExternalID -> ExternalID -> Bool # (/=) :: ExternalID -> ExternalID -> Bool #
Eq Doctype
Instance details Defined in Data.XML.Types Methods (==) :: Doctype -> Doctype -> Bool # (/=) :: Doctype -> Doctype -> Bool #
Eq Miscellaneous
Instance details Defined in Data.XML.Types Methods (==) :: Miscellaneous -> Miscellaneous -> Bool # (/=) :: Miscellaneous -> Miscellaneous -> Bool #
Eq Instruction
Instance details Defined in Data.XML.Types Methods (==) :: Instruction -> Instruction -> Bool # (/=) :: Instruction -> Instruction -> Bool #
Eq Prologue
Instance details Defined in Data.XML.Types Methods (==) :: Prologue -> Prologue -> Bool # (/=) :: Prologue -> Prologue -> Bool #
Eq Document
Instance details Defined in Data.XML.Types Methods (==) :: Document -> Document -> Bool # (/=) :: Document -> Document -> Bool #
Eq Node
Instance details Defined in Data.XML.Types Methods (==) :: Node -> Node -> Bool # (/=) :: Node -> Node -> Bool #
Eq Element
Instance details Defined in Data.XML.Types Methods (==) :: Element -> Element -> Bool # (/=) :: Element -> Element -> Bool #
Eq Content
Instance details Defined in Data.XML.Types Methods (==) :: Content -> Content -> Bool # (/=) :: Content -> Content -> Bool #
Eq InterpType
Instance details Defined in GI.GdkPixbuf.Enums Methods (==) :: InterpType -> InterpType -> Bool # (/=) :: InterpType -> InterpType -> Bool #
Eq Colorspace
Instance details Defined in GI.GdkPixbuf.Enums Methods (==) :: Colorspace -> Colorspace -> Bool # (/=) :: Colorspace -> Colorspace -> Bool #
Eq PixbufRotation
Instance details Defined in GI.GdkPixbuf.Enums Methods (==) :: PixbufRotation -> PixbufRotation -> Bool # (/=) :: PixbufRotation -> PixbufRotation -> Bool #
Eq TypeFlags
Instance details Defined in GI.GObject.Flags Methods (==) :: TypeFlags -> TypeFlags -> Bool # (/=) :: TypeFlags -> TypeFlags -> Bool #
Eq PixbufAlphaMode
Instance details Defined in GI.GdkPixbuf.Enums Methods (==) :: PixbufAlphaMode -> PixbufAlphaMode -> Bool # (/=) :: PixbufAlphaMode -> PixbufAlphaMode -> Bool #
Eq PixbufError
Instance details Defined in GI.GdkPixbuf.Enums Methods (==) :: PixbufError -> PixbufError -> Bool # (/=) :: PixbufError -> PixbufError -> Bool #
Eq BindingFlags
Instance details Defined in GI.GObject.Flags Methods (==) :: BindingFlags -> BindingFlags -> Bool # (/=) :: BindingFlags -> BindingFlags -> Bool #
Eq CoordType
Instance details Defined in GI.Atk.Enums Methods (==) :: CoordType -> CoordType -> Bool # (/=) :: CoordType -> CoordType -> Bool #
Eq Layer
Instance details Defined in GI.Atk.Enums Methods (==) :: Layer -> Layer -> Bool # (/=) :: Layer -> Layer -> Bool #
Eq ScrollType
Instance details Defined in GI.Atk.Enums Methods (==) :: ScrollType -> ScrollType -> Bool # (/=) :: ScrollType -> ScrollType -> Bool #
Eq TextClipType
Instance details Defined in GI.Atk.Enums Methods (==) :: TextClipType -> TextClipType -> Bool # (/=) :: TextClipType -> TextClipType -> Bool #
Eq TextGranularity
Instance details Defined in GI.Atk.Enums Methods (==) :: TextGranularity -> TextGranularity -> Bool # (/=) :: TextGranularity -> TextGranularity -> Bool #
Eq TextBoundary
Instance details Defined in GI.Atk.Enums Methods (==) :: TextBoundary -> TextBoundary -> Bool # (/=) :: TextBoundary -> TextBoundary -> Bool #
Eq RelationType
Instance details Defined in GI.Atk.Enums Methods (==) :: RelationType -> RelationType -> Bool # (/=) :: RelationType -> RelationType -> Bool #
Eq Role
Instance details Defined in GI.Atk.Enums Methods (==) :: Role -> Role -> Bool # (/=) :: Role -> Role -> Bool #
Eq KeyEventType
Instance details Defined in GI.Atk.Enums Methods (==) :: KeyEventType -> KeyEventType -> Bool # (/=) :: KeyEventType -> KeyEventType -> Bool #
Eq StateType
Instance details Defined in GI.Atk.Enums Methods (==) :: StateType -> StateType -> Bool # (/=) :: StateType -> StateType -> Bool #
Eq TextAttribute
Instance details Defined in GI.Atk.Enums Methods (==) :: TextAttribute -> TextAttribute -> Bool # (/=) :: TextAttribute -> TextAttribute -> Bool #
Eq ValueType
Instance details Defined in GI.Atk.Enums Methods (==) :: ValueType -> ValueType -> Bool # (/=) :: ValueType -> ValueType -> Bool #
Eq SignalFlags
Instance details Defined in GI.GObject.Flags Methods (==) :: SignalFlags -> SignalFlags -> Bool # (/=) :: SignalFlags -> SignalFlags -> Bool #
Eq ConnectFlags
Instance details Defined in GI.GObject.Flags Methods (==) :: ConnectFlags -> ConnectFlags -> Bool # (/=) :: ConnectFlags -> ConnectFlags -> Bool #
Eq ParamFlags
Instance details Defined in GI.GObject.Flags Methods (==) :: ParamFlags -> ParamFlags -> Bool # (/=) :: ParamFlags -> ParamFlags -> Bool #
Eq SignalMatchType
Instance details Defined in GI.GObject.Flags Methods (==) :: SignalMatchType -> SignalMatchType -> Bool # (/=) :: SignalMatchType -> SignalMatchType -> Bool #
Eq TypeDebugFlags
Instance details Defined in GI.GObject.Flags Methods (==) :: TypeDebugFlags -> TypeDebugFlags -> Bool # (/=) :: TypeDebugFlags -> TypeDebugFlags -> Bool #
Eq TypeFundamentalFlags
Instance details Defined in GI.GObject.Flags Methods (==) :: TypeFundamentalFlags -> TypeFundamentalFlags -> Bool # (/=) :: TypeFundamentalFlags -> TypeFundamentalFlags -> Bool #
Eq ConfigOptions Source #
Instance details Defined in Termonad.Types Methods (==) :: ConfigOptions -> ConfigOptions -> Bool # (/=) :: ConfigOptions -> ConfigOptions -> Bool #
Eq ShowTabBar Source #
Instance details Defined in Termonad.Types Methods (==) :: ShowTabBar -> ShowTabBar -> Bool # (/=) :: ShowTabBar -> ShowTabBar -> Bool #
Eq ShowScrollbar Source #
Instance details Defined in Termonad.Types Methods (==) :: ShowScrollbar -> ShowScrollbar -> Bool # (/=) :: ShowScrollbar -> ShowScrollbar -> Bool #
Eq FontConfig Source #
Instance details Defined in Termonad.Types Methods (==) :: FontConfig -> FontConfig -> Bool # (/=) :: FontConfig -> FontConfig -> Bool #
Eq FontSize Source #
Instance details Defined in Termonad.Types Methods (==) :: FontSize -> FontSize -> Bool # (/=) :: FontSize -> FontSize -> Bool #
Eq TMNotebookTab Source #
Instance details Defined in Termonad.Types Methods (==) :: TMNotebookTab -> TMNotebookTab -> Bool # (/=) :: TMNotebookTab -> TMNotebookTab -> Bool #
Eq TMTerm Source #
Instance details Defined in Termonad.Types Methods (==) :: TMTerm -> TMTerm -> Bool # (/=) :: TMTerm -> TMTerm -> Bool #
Eq Key Source #
Instance details Defined in Termonad.Keys Methods (==) :: Key -> Key -> Bool # (/=) :: Key -> Key -> Bool #
Eq a => Eq [a]
Instance details Defined in GHC.Classes Methods (==) :: [a] -> [a] -> Bool # (/=) :: [a] -> [a] -> Bool #
Eq a => Eq (Maybe a)	Since: base-2.1
Instance details Defined in GHC.Maybe Methods (==) :: Maybe a -> Maybe a -> Bool # (/=) :: Maybe a -> Maybe a -> Bool #
Eq a => Eq (Ratio a)	Since: base-2.1
Instance details Defined in GHC.Real Methods (==) :: Ratio a -> Ratio a -> Bool # (/=) :: Ratio a -> Ratio a -> Bool #
Eq (Ptr a)	Since: base-2.1
Instance details Defined in GHC.Ptr Methods (==) :: Ptr a -> Ptr a -> Bool # (/=) :: Ptr a -> Ptr a -> Bool #
Eq (FunPtr a)
Instance details Defined in GHC.Ptr Methods (==) :: FunPtr a -> FunPtr a -> Bool # (/=) :: FunPtr a -> FunPtr a -> Bool #
Eq p => Eq (Par1 p)	Since: base-4.7.0.0
Instance details Defined in GHC.Generics Methods (==) :: Par1 p -> Par1 p -> Bool # (/=) :: Par1 p -> Par1 p -> Bool #
Eq a => Eq (Last a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods (==) :: Last a -> Last a -> Bool # (/=) :: Last a -> Last a -> Bool #
Eq vertex => Eq (SCC vertex)	Since: containers-0.5.9
Instance details Defined in Data.Graph Methods (==) :: SCC vertex -> SCC vertex -> Bool # (/=) :: SCC vertex -> SCC vertex -> Bool #
Eq (ForeignPtr a)	Since: base-2.1
Instance details Defined in GHC.ForeignPtr Methods (==) :: ForeignPtr a -> ForeignPtr a -> Bool # (/=) :: ForeignPtr a -> ForeignPtr a -> Bool #
Eq (Async a)
Instance details Defined in Control.Concurrent.Async Methods (==) :: Async a -> Async a -> Bool # (/=) :: Async a -> Async a -> Bool #
Eq a => Eq (Complex a)	Since: base-2.1
Instance details Defined in Data.Complex Methods (==) :: Complex a -> Complex a -> Bool # (/=) :: Complex a -> Complex a -> Bool #
Eq a => Eq (Min a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods (==) :: Min a -> Min a -> Bool # (/=) :: Min a -> Min a -> Bool #
Eq a => Eq (Max a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods (==) :: Max a -> Max a -> Bool # (/=) :: Max a -> Max a -> Bool #
Eq a => Eq (First a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods (==) :: First a -> First a -> Bool # (/=) :: First a -> First a -> Bool #
Eq m => Eq (WrappedMonoid m)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods (==) :: WrappedMonoid m -> WrappedMonoid m -> Bool # (/=) :: WrappedMonoid m -> WrappedMonoid m -> Bool #
Eq a => Eq (Option a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods (==) :: Option a -> Option a -> Bool # (/=) :: Option a -> Option a -> Bool #
Eq (Chan a)	Since: base-4.4.0.0
Instance details Defined in Control.Concurrent.Chan Methods (==) :: Chan a -> Chan a -> Bool # (/=) :: Chan a -> Chan a -> Bool #
Eq a => Eq (ZipList a)	Since: base-4.7.0.0
Instance details Defined in Control.Applicative Methods (==) :: ZipList a -> ZipList a -> Bool # (/=) :: ZipList a -> ZipList a -> Bool #
Eq a => Eq (Identity a)	Since: base-4.8.0.0
Instance details Defined in Data.Functor.Identity Methods (==) :: Identity a -> Identity a -> Bool # (/=) :: Identity a -> Identity a -> Bool #
Eq (TVar a)	Since: base-4.8.0.0
Instance details Defined in GHC.Conc.Sync Methods (==) :: TVar a -> TVar a -> Bool # (/=) :: TVar a -> TVar a -> Bool #
Eq (IORef a)	^ Pointer equality. Since: base-4.1.0.0
Instance details Defined in GHC.IORef Methods (==) :: IORef a -> IORef a -> Bool # (/=) :: IORef a -> IORef a -> Bool #
Eq a => Eq (First a)	Since: base-2.1
Instance details Defined in Data.Monoid Methods (==) :: First a -> First a -> Bool # (/=) :: First a -> First a -> Bool #
Eq a => Eq (Last a)	Since: base-2.1
Instance details Defined in Data.Monoid Methods (==) :: Last a -> Last a -> Bool # (/=) :: Last a -> Last a -> Bool #
Eq a => Eq (Dual a)	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods (==) :: Dual a -> Dual a -> Bool # (/=) :: Dual a -> Dual a -> Bool #
Eq a => Eq (Sum a)	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods (==) :: Sum a -> Sum a -> Bool # (/=) :: Sum a -> Sum a -> Bool #
Eq a => Eq (Product a)	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods (==) :: Product a -> Product a -> Bool # (/=) :: Product a -> Product a -> Bool #
Eq a => Eq (Down a)	Since: base-4.6.0.0
Instance details Defined in Data.Ord Methods (==) :: Down a -> Down a -> Bool # (/=) :: Down a -> Down a -> Bool #
Eq (MVar a)	Since: base-4.1.0.0
Instance details Defined in GHC.MVar Methods (==) :: MVar a -> MVar a -> Bool # (/=) :: MVar a -> MVar a -> Bool #
Eq a => Eq (NonEmpty a)	Since: base-4.9.0.0
Instance details Defined in GHC.Base Methods (==) :: NonEmpty a -> NonEmpty a -> Bool # (/=) :: NonEmpty a -> NonEmpty a -> Bool #
Eq a => Eq (Vector a)
Instance details Defined in Data.Vector Methods (==) :: Vector a -> Vector a -> Bool # (/=) :: Vector a -> Vector a -> Bool #
Eq a => Eq (HashSet a)
Instance details Defined in Data.HashSet Methods (==) :: HashSet a -> HashSet a -> Bool # (/=) :: HashSet a -> HashSet a -> Bool #
Eq a => Eq (Set a)
Instance details Defined in Data.Set.Internal Methods (==) :: Set a -> Set a -> Bool # (/=) :: Set a -> Set a -> Bool #
Eq a => Eq (Seq a)
Instance details Defined in Data.Sequence.Internal Methods (==) :: Seq a -> Seq a -> Bool # (/=) :: Seq a -> Seq a -> Bool #
Eq a => Eq (IntMap a)
Instance details Defined in Data.IntMap.Internal Methods (==) :: IntMap a -> IntMap a -> Bool # (/=) :: IntMap a -> IntMap a -> Bool #
Eq (TBQueue a)
Instance details Defined in Control.Concurrent.STM.TBQueue Methods (==) :: TBQueue a -> TBQueue a -> Bool # (/=) :: TBQueue a -> TBQueue a -> Bool #
Eq (TChan a)
Instance details Defined in Control.Concurrent.STM.TChan Methods (==) :: TChan a -> TChan a -> Bool # (/=) :: TChan a -> TChan a -> Bool #
Eq (TMVar a)
Instance details Defined in Control.Concurrent.STM.TMVar Methods (==) :: TMVar a -> TMVar a -> Bool # (/=) :: TMVar a -> TMVar a -> Bool #
Eq (TQueue a)
Instance details Defined in Control.Concurrent.STM.TQueue Methods (==) :: TQueue a -> TQueue a -> Bool # (/=) :: TQueue a -> TQueue a -> Bool #
Eq mono => Eq (NonNull mono)
Instance details Defined in Data.NonNull Methods (==) :: NonNull mono -> NonNull mono -> Bool # (/=) :: NonNull mono -> NonNull mono -> Bool #
Eq a => Eq (DList a)
Instance details Defined in Data.DList Methods (==) :: DList a -> DList a -> Bool # (/=) :: DList a -> DList a -> Bool #
Eq a => Eq (RGB a)
Instance details Defined in Data.Colour.RGB Methods (==) :: RGB a -> RGB a -> Bool # (/=) :: RGB a -> RGB a -> Bool #
Eq a => Eq (Colour a)
Instance details Defined in Data.Colour.Internal Methods (==) :: Colour a -> Colour a -> Bool # (/=) :: Colour a -> Colour a -> Bool #
Eq a => Eq (AlphaColour a)
Instance details Defined in Data.Colour.Internal Methods (==) :: AlphaColour a -> AlphaColour a -> Bool # (/=) :: AlphaColour a -> AlphaColour a -> Bool #
Eq a => Eq (Flush a)
Instance details Defined in Data.Conduit.Internal.Conduit Methods (==) :: Flush a -> Flush a -> Bool # (/=) :: Flush a -> Flush a -> Bool #
Eq a => Eq (Tree a)
Instance details Defined in Data.Tree Methods (==) :: Tree a -> Tree a -> Bool # (/=) :: Tree a -> Tree a -> Bool #
Eq a => Eq (ViewL a)
Instance details Defined in Data.Sequence.Internal Methods (==) :: ViewL a -> ViewL a -> Bool # (/=) :: ViewL a -> ViewL a -> Bool #
Eq a => Eq (ViewR a)
Instance details Defined in Data.Sequence.Internal Methods (==) :: ViewR a -> ViewR a -> Bool # (/=) :: ViewR a -> ViewR a -> Bool #
Eq a => Eq (FocusList a)
Instance details Defined in Data.FocusList Methods (==) :: FocusList a -> FocusList a -> Bool # (/=) :: FocusList a -> FocusList a -> Bool #
Eq a => Eq (Hashed a)	Uses precomputed hash to detect inequality faster
Instance details Defined in Data.Hashable.Class Methods (==) :: Hashed a -> Hashed a -> Bool # (/=) :: Hashed a -> Hashed a -> Bool #
(Prim a, Eq a) => Eq (Vector a)
Instance details Defined in Data.Vector.Primitive Methods (==) :: Vector a -> Vector a -> Bool # (/=) :: Vector a -> Vector a -> Bool #
(Storable a, Eq a) => Eq (Vector a)
Instance details Defined in Data.Vector.Storable Methods (==) :: Vector a -> Vector a -> Bool # (/=) :: Vector a -> Vector a -> Bool #
Eq (Doc a)
Instance details Defined in Text.PrettyPrint.Annotated.HughesPJ Methods (==) :: Doc a -> Doc a -> Bool # (/=) :: Doc a -> Doc a -> Bool #
Eq a => Eq (AnnotDetails a)
Instance details Defined in Text.PrettyPrint.Annotated.HughesPJ Methods (==) :: AnnotDetails a -> AnnotDetails a -> Bool # (/=) :: AnnotDetails a -> AnnotDetails a -> Bool #
Eq a => Eq (Span a)
Instance details Defined in Text.PrettyPrint.Annotated.HughesPJ Methods (==) :: Span a -> Span a -> Bool # (/=) :: Span a -> Span a -> Bool #
Eq a => Eq (CommaSeparated a)
Instance details Defined in Text.Pretty.Simple.Internal.Expr Methods (==) :: CommaSeparated a -> CommaSeparated a -> Bool # (/=) :: CommaSeparated a -> CommaSeparated a -> Bool #
(Eq a, PrimUnlifted a) => Eq (UnliftedArray a)
Instance details Defined in Data.Primitive.UnliftedArray Methods (==) :: UnliftedArray a -> UnliftedArray a -> Bool # (/=) :: UnliftedArray a -> UnliftedArray a -> Bool #
(Eq a, Prim a) => Eq (PrimArray a)	Since: primitive-0.6.4.0
Instance details Defined in Data.Primitive.PrimArray Methods (==) :: PrimArray a -> PrimArray a -> Bool # (/=) :: PrimArray a -> PrimArray a -> Bool #
Eq a => Eq (SmallArray a)
Instance details Defined in Data.Primitive.SmallArray Methods (==) :: SmallArray a -> SmallArray a -> Bool # (/=) :: SmallArray a -> SmallArray a -> Bool #
Eq a => Eq (Array a)
Instance details Defined in Data.Primitive.Array Methods (==) :: Array a -> Array a -> Bool # (/=) :: Array a -> Array a -> Bool #
Eq (Fin n) Source #
Instance details Defined in Termonad.Config.Vec Methods (==) :: Fin n -> Fin n -> Bool # (/=) :: Fin n -> Fin n -> Bool #
Eq a => Eq (Option a) Source #
Instance details Defined in Termonad.Types Methods (==) :: Option a -> Option a -> Bool # (/=) :: Option a -> Option a -> Bool #
Eq c => Eq (ColourConfig c) Source #
Instance details Defined in Termonad.Config.Colour Methods (==) :: ColourConfig c -> ColourConfig c -> Bool # (/=) :: ColourConfig c -> ColourConfig c -> Bool #
Eq c => Eq (Palette c) Source #
Instance details Defined in Termonad.Config.Colour Methods (==) :: Palette c -> Palette c -> Bool # (/=) :: Palette c -> Palette c -> Bool #
(Eq a, Eq b) => Eq (Either a b)	Since: base-2.1
Instance details Defined in Data.Either Methods (==) :: Either a b -> Either a b -> Bool # (/=) :: Either a b -> Either a b -> Bool #
Eq (V1 p)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods (==) :: V1 p -> V1 p -> Bool # (/=) :: V1 p -> V1 p -> Bool #
Eq (U1 p)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods (==) :: U1 p -> U1 p -> Bool # (/=) :: U1 p -> U1 p -> Bool #
Eq (TypeRep a)	Since: base-2.1
Instance details Defined in Data.Typeable.Internal Methods (==) :: TypeRep a -> TypeRep a -> Bool # (/=) :: TypeRep a -> TypeRep a -> Bool #
(Eq a, Eq b) => Eq (a, b)
Instance details Defined in GHC.Classes Methods (==) :: (a, b) -> (a, b) -> Bool # (/=) :: (a, b) -> (a, b) -> Bool #
(Eq k, Eq a) => Eq (Map k a)
Instance details Defined in Data.Map.Internal Methods (==) :: Map k a -> Map k a -> Bool # (/=) :: Map k a -> Map k a -> Bool #
(Eq k, Eq v) => Eq (HashMap k v)
Instance details Defined in Data.HashMap.Base Methods (==) :: HashMap k v -> HashMap k v -> Bool # (/=) :: HashMap k v -> HashMap k v -> Bool #
(Ix i, Eq e) => Eq (Array i e)	Since: base-2.1
Instance details Defined in GHC.Arr Methods (==) :: Array i e -> Array i e -> Bool # (/=) :: Array i e -> Array i e -> Bool #
Eq a => Eq (Arg a b)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods (==) :: Arg a b -> Arg a b -> Bool # (/=) :: Arg a b -> Arg a b -> Bool #
Eq (Proxy s)	Since: base-4.7.0.0
Instance details Defined in Data.Proxy Methods (==) :: Proxy s -> Proxy s -> Bool # (/=) :: Proxy s -> Proxy s -> Bool #
Eq (STRef s a)	Pointer equality. Since: base-2.1
Instance details Defined in GHC.STRef Methods (==) :: STRef s a -> STRef s a -> Bool # (/=) :: STRef s a -> STRef s a -> Bool #
Eq (MutVar s a)
Instance details Defined in Data.Primitive.MutVar Methods (==) :: MutVar s a -> MutVar s a -> Bool # (/=) :: MutVar s a -> MutVar s a -> Bool #
(Eq1 m, Eq a) => Eq (MaybeT m a)
Instance details Defined in Control.Monad.Trans.Maybe Methods (==) :: MaybeT m a -> MaybeT m a -> Bool # (/=) :: MaybeT m a -> MaybeT m a -> Bool #
(Eq1 f, Eq a) => Eq (Cofree f a)
Instance details Defined in Control.Comonad.Cofree Methods (==) :: Cofree f a -> Cofree f a -> Bool # (/=) :: Cofree f a -> Cofree f a -> Bool #
(Eq1 f, Eq a) => Eq (Free f a)
Instance details Defined in Control.Monad.Free Methods (==) :: Free f a -> Free f a -> Bool # (/=) :: Free f a -> Free f a -> Bool #
(Eq1 f, Eq a) => Eq (Yoneda f a)
Instance details Defined in Data.Functor.Yoneda Methods (==) :: Yoneda f a -> Yoneda f a -> Bool # (/=) :: Yoneda f a -> Yoneda f a -> Bool #
(Eq1 m, Eq a) => Eq (ListT m a)
Instance details Defined in Control.Monad.Trans.List Methods (==) :: ListT m a -> ListT m a -> Bool # (/=) :: ListT m a -> ListT m a -> Bool #
Eq (MutableUnliftedArray s a)
Instance details Defined in Data.Primitive.UnliftedArray Methods (==) :: MutableUnliftedArray s a -> MutableUnliftedArray s a -> Bool # (/=) :: MutableUnliftedArray s a -> MutableUnliftedArray s a -> Bool #
Eq (SmallMutableArray s a)
Instance details Defined in Data.Primitive.SmallArray Methods (==) :: SmallMutableArray s a -> SmallMutableArray s a -> Bool # (/=) :: SmallMutableArray s a -> SmallMutableArray s a -> Bool #
Eq (MutableArray s a)
Instance details Defined in Data.Primitive.Array Methods (==) :: MutableArray s a -> MutableArray s a -> Bool # (/=) :: MutableArray s a -> MutableArray s a -> Bool #
(Eq k, Eq v) => Eq (Leaf k v)
Instance details Defined in Data.HashMap.Base Methods (==) :: Leaf k v -> Leaf k v -> Bool # (/=) :: Leaf k v -> Leaf k v -> Bool #
Eq (MatrixTF ns a) => Eq (Matrix ns a) Source #
Instance details Defined in Termonad.Config.Vec Methods (==) :: Matrix ns a -> Matrix ns a -> Bool # (/=) :: Matrix ns a -> Matrix ns a -> Bool #
Eq a => Eq (Vec n a) Source #
Instance details Defined in Termonad.Config.Vec Methods (==) :: Vec n a -> Vec n a -> Bool # (/=) :: Vec n a -> Vec n a -> Bool #
Eq (IFin x y) Source #
Instance details Defined in Termonad.Config.Vec Methods (==) :: IFin x y -> IFin x y -> Bool # (/=) :: IFin x y -> IFin x y -> Bool #
Eq (f p) => Eq (Rec1 f p)	Since: base-4.7.0.0
Instance details Defined in GHC.Generics Methods (==) :: Rec1 f p -> Rec1 f p -> Bool # (/=) :: Rec1 f p -> Rec1 f p -> Bool #
Eq (URec (Ptr ()) p)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods (==) :: URec (Ptr ()) p -> URec (Ptr ()) p -> Bool # (/=) :: URec (Ptr ()) p -> URec (Ptr ()) p -> Bool #
Eq (URec Char p)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods (==) :: URec Char p -> URec Char p -> Bool # (/=) :: URec Char p -> URec Char p -> Bool #
Eq (URec Double p)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods (==) :: URec Double p -> URec Double p -> Bool # (/=) :: URec Double p -> URec Double p -> Bool #
Eq (URec Float p)
Instance details Defined in GHC.Generics Methods (==) :: URec Float p -> URec Float p -> Bool # (/=) :: URec Float p -> URec Float p -> Bool #
Eq (URec Int p)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods (==) :: URec Int p -> URec Int p -> Bool # (/=) :: URec Int p -> URec Int p -> Bool #
Eq (URec Word p)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods (==) :: URec Word p -> URec Word p -> Bool # (/=) :: URec Word p -> URec Word p -> Bool #
(Eq a, Eq b, Eq c) => Eq (a, b, c)
Instance details Defined in GHC.Classes Methods (==) :: (a, b, c) -> (a, b, c) -> Bool # (/=) :: (a, b, c) -> (a, b, c) -> Bool #
Eq (STArray s i e)	Since: base-2.1
Instance details Defined in GHC.Arr Methods (==) :: STArray s i e -> STArray s i e -> Bool # (/=) :: STArray s i e -> STArray s i e -> Bool #
Eq a => Eq (Const a b)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Const Methods (==) :: Const a b -> Const a b -> Bool # (/=) :: Const a b -> Const a b -> Bool #
Eq (f a) => Eq (Ap f a)	Since: base-4.12.0.0
Instance details Defined in Data.Monoid Methods (==) :: Ap f a -> Ap f a -> Bool # (/=) :: Ap f a -> Ap f a -> Bool #
Eq (f a) => Eq (Alt f a)	Since: base-4.8.0.0
Instance details Defined in Data.Semigroup.Internal Methods (==) :: Alt f a -> Alt f a -> Bool # (/=) :: Alt f a -> Alt f a -> Bool #
Eq (a :~: b)	Since: base-4.7.0.0
Instance details Defined in Data.Type.Equality Methods (==) :: (a :~: b) -> (a :~: b) -> Bool # (/=) :: (a :~: b) -> (a :~: b) -> Bool #
Eq (p a a) => Eq (Join p a)
Instance details Defined in Data.Bifunctor.Join Methods (==) :: Join p a -> Join p a -> Bool # (/=) :: Join p a -> Join p a -> Bool #
Eq (p (Fix p a) a) => Eq (Fix p a)
Instance details Defined in Data.Bifunctor.Fix Methods (==) :: Fix p a -> Fix p a -> Bool # (/=) :: Fix p a -> Fix p a -> Bool #
(Eq1 f, Eq a) => Eq (IdentityT f a)
Instance details Defined in Control.Monad.Trans.Identity Methods (==) :: IdentityT f a -> IdentityT f a -> Bool # (/=) :: IdentityT f a -> IdentityT f a -> Bool #
(Eq w, Eq1 m, Eq a) => Eq (WriterT w m a)
Instance details Defined in Control.Monad.Trans.Writer.Strict Methods (==) :: WriterT w m a -> WriterT w m a -> Bool # (/=) :: WriterT w m a -> WriterT w m a -> Bool #
(Eq w, Eq1 m, Eq a) => Eq (WriterT w m a)
Instance details Defined in Control.Monad.Trans.Writer.Lazy Methods (==) :: WriterT w m a -> WriterT w m a -> Bool # (/=) :: WriterT w m a -> WriterT w m a -> Bool #
(Eq a, Eq (f b)) => Eq (FreeF f a b)
Instance details Defined in Control.Monad.Trans.Free Methods (==) :: FreeF f a b -> FreeF f a b -> Bool # (/=) :: FreeF f a b -> FreeF f a b -> Bool #
(Eq1 f, Eq1 m, Eq a) => Eq (FreeT f m a)
Instance details Defined in Control.Monad.Trans.Free Methods (==) :: FreeT f m a -> FreeT f m a -> Bool # (/=) :: FreeT f m a -> FreeT f m a -> Bool #
(Eq a, Eq (f b)) => Eq (CofreeF f a b)
Instance details Defined in Control.Comonad.Trans.Cofree Methods (==) :: CofreeF f a b -> CofreeF f a b -> Bool # (/=) :: CofreeF f a b -> CofreeF f a b -> Bool #
Eq (w (CofreeF f a (CofreeT f w a))) => Eq (CofreeT f w a)
Instance details Defined in Control.Comonad.Trans.Cofree Methods (==) :: CofreeT f w a -> CofreeT f w a -> Bool # (/=) :: CofreeT f w a -> CofreeT f w a -> Bool #
(Eq e, Eq1 m, Eq a) => Eq (ErrorT e m a)
Instance details Defined in Control.Monad.Trans.Error Methods (==) :: ErrorT e m a -> ErrorT e m a -> Bool # (/=) :: ErrorT e m a -> ErrorT e m a -> Bool #
Eq b => Eq (Tagged s b)
Instance details Defined in Data.Tagged Methods (==) :: Tagged s b -> Tagged s b -> Bool # (/=) :: Tagged s b -> Tagged s b -> Bool #
Eq c => Eq (K1 i c p)	Since: base-4.7.0.0
Instance details Defined in GHC.Generics Methods (==) :: K1 i c p -> K1 i c p -> Bool # (/=) :: K1 i c p -> K1 i c p -> Bool #
(Eq (f p), Eq (g p)) => Eq ((f :+: g) p)	Since: base-4.7.0.0
Instance details Defined in GHC.Generics Methods (==) :: (f :+: g) p -> (f :+: g) p -> Bool # (/=) :: (f :+: g) p -> (f :+: g) p -> Bool #
(Eq (f p), Eq (g p)) => Eq ((f :*: g) p)	Since: base-4.7.0.0
Instance details Defined in GHC.Generics Methods (==) :: (f :: g) p -> (f :: g) p -> Bool # (/=) :: (f :: g) p -> (f :: g) p -> Bool #
(Eq a, Eq b, Eq c, Eq d) => Eq (a, b, c, d)
Instance details Defined in GHC.Classes Methods (==) :: (a, b, c, d) -> (a, b, c, d) -> Bool # (/=) :: (a, b, c, d) -> (a, b, c, d) -> Bool #
(Eq1 f, Eq1 g, Eq a) => Eq (Product f g a)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Product Methods (==) :: Product f g a -> Product f g a -> Bool # (/=) :: Product f g a -> Product f g a -> Bool #
(Eq1 f, Eq1 g, Eq a) => Eq (Sum f g a)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Sum Methods (==) :: Sum f g a -> Sum f g a -> Bool # (/=) :: Sum f g a -> Sum f g a -> Bool #
Eq (a :~~: b)	Since: base-4.10.0.0
Instance details Defined in Data.Type.Equality Methods (==) :: (a :~~: b) -> (a :~~: b) -> Bool # (/=) :: (a :~~: b) -> (a :~~: b) -> Bool #
Eq (f p) => Eq (M1 i c f p)	Since: base-4.7.0.0
Instance details Defined in GHC.Generics Methods (==) :: M1 i c f p -> M1 i c f p -> Bool # (/=) :: M1 i c f p -> M1 i c f p -> Bool #
Eq (f (g p)) => Eq ((f :.: g) p)	Since: base-4.7.0.0
Instance details Defined in GHC.Generics Methods (==) :: (f :.: g) p -> (f :.: g) p -> Bool # (/=) :: (f :.: g) p -> (f :.: g) p -> Bool #
(Eq a, Eq b, Eq c, Eq d, Eq e) => Eq (a, b, c, d, e)
Instance details Defined in GHC.Classes Methods (==) :: (a, b, c, d, e) -> (a, b, c, d, e) -> Bool # (/=) :: (a, b, c, d, e) -> (a, b, c, d, e) -> Bool #
(Eq1 f, Eq1 g, Eq a) => Eq (Compose f g a)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Compose Methods (==) :: Compose f g a -> Compose f g a -> Bool # (/=) :: Compose f g a -> Compose f g a -> Bool #
Eq (p a b) => Eq (WrappedBifunctor p a b)
Instance details Defined in Data.Bifunctor.Wrapped Methods (==) :: WrappedBifunctor p a b -> WrappedBifunctor p a b -> Bool # (/=) :: WrappedBifunctor p a b -> WrappedBifunctor p a b -> Bool #
Eq (g b) => Eq (Joker g a b)
Instance details Defined in Data.Bifunctor.Joker Methods (==) :: Joker g a b -> Joker g a b -> Bool # (/=) :: Joker g a b -> Joker g a b -> Bool #
Eq (p b a) => Eq (Flip p a b)
Instance details Defined in Data.Bifunctor.Flip Methods (==) :: Flip p a b -> Flip p a b -> Bool # (/=) :: Flip p a b -> Flip p a b -> Bool #
Eq (f a) => Eq (Clown f a b)
Instance details Defined in Data.Bifunctor.Clown Methods (==) :: Clown f a b -> Clown f a b -> Bool # (/=) :: Clown f a b -> Clown f a b -> Bool #
(Eq a, Eq b, Eq c, Eq d, Eq e, Eq f) => Eq (a, b, c, d, e, f)
Instance details Defined in GHC.Classes Methods (==) :: (a, b, c, d, e, f) -> (a, b, c, d, e, f) -> Bool # (/=) :: (a, b, c, d, e, f) -> (a, b, c, d, e, f) -> Bool #
(Eq (p a b), Eq (q a b)) => Eq (Sum p q a b)
Instance details Defined in Data.Bifunctor.Sum Methods (==) :: Sum p q a b -> Sum p q a b -> Bool # (/=) :: Sum p q a b -> Sum p q a b -> Bool #
(Eq (f a b), Eq (g a b)) => Eq (Product f g a b)
Instance details Defined in Data.Bifunctor.Product Methods (==) :: Product f g a b -> Product f g a b -> Bool # (/=) :: Product f g a b -> Product f g a b -> Bool #
(Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g) => Eq (a, b, c, d, e, f, g)
Instance details Defined in GHC.Classes Methods (==) :: (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) -> Bool # (/=) :: (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) -> Bool #
Eq (f (p a b)) => Eq (Tannen f p a b)
Instance details Defined in Data.Bifunctor.Tannen Methods (==) :: Tannen f p a b -> Tannen f p a b -> Bool # (/=) :: Tannen f p a b -> Tannen f p a b -> Bool #
(Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h) => Eq (a, b, c, d, e, f, g, h)
Instance details Defined in GHC.Classes Methods (==) :: (a, b, c, d, e, f, g, h) -> (a, b, c, d, e, f, g, h) -> Bool # (/=) :: (a, b, c, d, e, f, g, h) -> (a, b, c, d, e, f, g, h) -> Bool #
(Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h, Eq i) => Eq (a, b, c, d, e, f, g, h, i)
Instance details Defined in GHC.Classes Methods (==) :: (a, b, c, d, e, f, g, h, i) -> (a, b, c, d, e, f, g, h, i) -> Bool # (/=) :: (a, b, c, d, e, f, g, h, i) -> (a, b, c, d, e, f, g, h, i) -> Bool #
Eq (p (f a) (g b)) => Eq (Biff p f g a b)
Instance details Defined in Data.Bifunctor.Biff Methods (==) :: Biff p f g a b -> Biff p f g a b -> Bool # (/=) :: Biff p f g a b -> Biff p f g a b -> Bool #
(Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h, Eq i, Eq j) => Eq (a, b, c, d, e, f, g, h, i, j)
Instance details Defined in GHC.Classes Methods (==) :: (a, b, c, d, e, f, g, h, i, j) -> (a, b, c, d, e, f, g, h, i, j) -> Bool # (/=) :: (a, b, c, d, e, f, g, h, i, j) -> (a, b, c, d, e, f, g, h, i, j) -> Bool #
(Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h, Eq i, Eq j, Eq k) => Eq (a, b, c, d, e, f, g, h, i, j, k)
Instance details Defined in GHC.Classes Methods (==) :: (a, b, c, d, e, f, g, h, i, j, k) -> (a, b, c, d, e, f, g, h, i, j, k) -> Bool # (/=) :: (a, b, c, d, e, f, g, h, i, j, k) -> (a, b, c, d, e, f, g, h, i, j, k) -> Bool #
(Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h, Eq i, Eq j, Eq k, Eq l) => Eq (a, b, c, d, e, f, g, h, i, j, k, l)
Instance details Defined in GHC.Classes Methods (==) :: (a, b, c, d, e, f, g, h, i, j, k, l) -> (a, b, c, d, e, f, g, h, i, j, k, l) -> Bool # (/=) :: (a, b, c, d, e, f, g, h, i, j, k, l) -> (a, b, c, d, e, f, g, h, i, j, k, l) -> Bool #
(Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h, Eq i, Eq j, Eq k, Eq l, Eq m) => Eq (a, b, c, d, e, f, g, h, i, j, k, l, m)
Instance details Defined in GHC.Classes Methods (==) :: (a, b, c, d, e, f, g, h, i, j, k, l, m) -> (a, b, c, d, e, f, g, h, i, j, k, l, m) -> Bool # (/=) :: (a, b, c, d, e, f, g, h, i, j, k, l, m) -> (a, b, c, d, e, f, g, h, i, j, k, l, m) -> Bool #
(Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h, Eq i, Eq j, Eq k, Eq l, Eq m, Eq n) => Eq (a, b, c, d, e, f, g, h, i, j, k, l, m, n)
Instance details Defined in GHC.Classes Methods (==) :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> Bool # (/=) :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> Bool #
(Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h, Eq i, Eq j, Eq k, Eq l, Eq m, Eq n, Eq o) => Eq (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o)
Instance details Defined in GHC.Classes Methods (==) :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> Bool # (/=) :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> Bool #

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 b
exp (fromInteger 0) = fromInteger 1

Minimal complete definition

pi, exp, log, sin, cos, asin, acos, atan, sinh, cosh, asinh, acosh, atanh

Methods

pi :: a #

exp :: a -> a #

log :: a -> a #

sqrt :: a -> a #

(**) :: a -> a -> a infixr 8 #

logBase :: a -> a -> a #

sin :: a -> a #

cos :: a -> a #

tan :: a -> a #

asin :: a -> a #

acos :: a -> a #

atan :: a -> a #

sinh :: a -> a #

cosh :: a -> a #

tanh :: a -> a #

asinh :: a -> a #

acosh :: a -> a #

atanh :: a -> a #

Instances

Floating Double	Since: base-2.1
Instance details Defined in GHC.Float Methods pi :: Double # exp :: Double -> Double # log :: Double -> Double # sqrt :: Double -> Double # (**) :: Double -> Double -> Double # logBase :: Double -> Double -> Double # sin :: Double -> Double # cos :: Double -> Double # tan :: Double -> Double # asin :: Double -> Double # acos :: Double -> Double # atan :: Double -> Double # sinh :: Double -> Double # cosh :: Double -> Double # tanh :: Double -> Double # asinh :: Double -> Double # acosh :: Double -> Double # atanh :: Double -> Double # log1p :: Double -> Double # expm1 :: Double -> Double # log1pexp :: Double -> Double # log1mexp :: Double -> Double #
Floating Float	Since: base-2.1
Instance details Defined in GHC.Float Methods pi :: Float # exp :: Float -> Float # log :: Float -> Float # sqrt :: Float -> Float # (**) :: Float -> Float -> Float # logBase :: Float -> Float -> Float # sin :: Float -> Float # cos :: Float -> Float # tan :: Float -> Float # asin :: Float -> Float # acos :: Float -> Float # atan :: Float -> Float # sinh :: Float -> Float # cosh :: Float -> Float # tanh :: Float -> Float # asinh :: Float -> Float # acosh :: Float -> Float # atanh :: Float -> Float # log1p :: Float -> Float # expm1 :: Float -> Float # log1pexp :: Float -> Float # log1mexp :: Float -> Float #
Floating CFloat
Instance details Defined in Foreign.C.Types Methods pi :: CFloat # exp :: CFloat -> CFloat # log :: CFloat -> CFloat # sqrt :: CFloat -> CFloat # (**) :: CFloat -> CFloat -> CFloat # logBase :: CFloat -> CFloat -> CFloat # sin :: CFloat -> CFloat # cos :: CFloat -> CFloat # tan :: CFloat -> CFloat # asin :: CFloat -> CFloat # acos :: CFloat -> CFloat # atan :: CFloat -> CFloat # sinh :: CFloat -> CFloat # cosh :: CFloat -> CFloat # tanh :: CFloat -> CFloat # asinh :: CFloat -> CFloat # acosh :: CFloat -> CFloat # atanh :: CFloat -> CFloat # log1p :: CFloat -> CFloat # expm1 :: CFloat -> CFloat # log1pexp :: CFloat -> CFloat # log1mexp :: CFloat -> CFloat #
Floating CDouble
Instance details Defined in Foreign.C.Types Methods pi :: CDouble # exp :: CDouble -> CDouble # log :: CDouble -> CDouble # sqrt :: CDouble -> CDouble # (**) :: CDouble -> CDouble -> CDouble # logBase :: CDouble -> CDouble -> CDouble # sin :: CDouble -> CDouble # cos :: CDouble -> CDouble # tan :: CDouble -> CDouble # asin :: CDouble -> CDouble # acos :: CDouble -> CDouble # atan :: CDouble -> CDouble # sinh :: CDouble -> CDouble # cosh :: CDouble -> CDouble # tanh :: CDouble -> CDouble # asinh :: CDouble -> CDouble # acosh :: CDouble -> CDouble # atanh :: CDouble -> CDouble # log1p :: CDouble -> CDouble # expm1 :: CDouble -> CDouble # log1pexp :: CDouble -> CDouble # log1mexp :: CDouble -> CDouble #
RealFloat a => Floating (Complex a)	Since: base-2.1
Instance details Defined in Data.Complex Methods pi :: Complex a # exp :: Complex a -> Complex a # log :: Complex a -> Complex a # sqrt :: Complex a -> Complex a # (**) :: Complex a -> Complex a -> Complex a # logBase :: Complex a -> Complex a -> Complex a # sin :: Complex a -> Complex a # cos :: Complex a -> Complex a # tan :: Complex a -> Complex a # asin :: Complex a -> Complex a # acos :: Complex a -> Complex a # atan :: Complex a -> Complex a # sinh :: Complex a -> Complex a # cosh :: Complex a -> Complex a # tanh :: Complex a -> Complex a # asinh :: Complex a -> Complex a # acosh :: Complex a -> Complex a # atanh :: Complex a -> Complex a # log1p :: Complex a -> Complex a # expm1 :: Complex a -> Complex a # log1pexp :: Complex a -> Complex a # log1mexp :: Complex a -> Complex a #
Floating a => Floating (Identity a)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Identity Methods pi :: Identity a # 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 # log1pexp :: Identity a -> Identity a # log1mexp :: Identity a -> Identity a #
Floating a => Floating (Op a b)
Instance details Defined in Data.Functor.Contravariant Methods pi :: Op a b # exp :: Op a b -> Op a b # log :: Op a b -> Op a b # sqrt :: Op a b -> Op a b # (**) :: Op a b -> Op a b -> Op a b # logBase :: Op a b -> Op a b -> Op a b # sin :: Op a b -> Op a b # cos :: Op a b -> Op a b # tan :: Op a b -> Op a b # asin :: Op a b -> Op a b # acos :: Op a b -> Op a b # atan :: Op a b -> Op a b # sinh :: Op a b -> Op a b # cosh :: Op a b -> Op a b # tanh :: Op a b -> Op a b # asinh :: Op a b -> Op a b # acosh :: Op a b -> Op a b # atanh :: Op a b -> Op a b # log1p :: Op a b -> Op a b # expm1 :: Op a b -> Op a b # log1pexp :: Op a b -> Op a b # log1mexp :: Op a b -> Op a b #
Floating a => Floating (Const a b)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Const Methods pi :: Const a b # exp :: Const a b -> Const a b # log :: Const a b -> Const a b # sqrt :: Const a b -> Const a b # (**) :: Const a b -> Const a b -> Const a b # logBase :: Const a b -> Const a b -> Const a b # sin :: Const a b -> Const a b # cos :: Const a b -> Const a b # tan :: Const a b -> Const a b # asin :: Const a b -> Const a b # acos :: Const a b -> Const a b # atan :: Const a b -> Const a b # sinh :: Const a b -> Const a b # cosh :: Const a b -> Const a b # tanh :: Const a b -> Const a b # asinh :: Const a b -> Const a b # acosh :: Const a b -> Const a b # atanh :: Const a b -> Const a b # log1p :: Const a b -> Const a b # expm1 :: Const a b -> Const a b # log1pexp :: Const a b -> Const a b # log1mexp :: Const a b -> Const a b #
Floating a => Floating (Tagged s a)
Instance details Defined in Data.Tagged Methods pi :: Tagged s a # exp :: Tagged s a -> Tagged s a # log :: Tagged s a -> Tagged s a # sqrt :: Tagged s a -> Tagged s a # (**) :: Tagged s a -> Tagged s a -> Tagged s a # logBase :: Tagged s a -> Tagged s a -> Tagged s a # sin :: Tagged s a -> Tagged s a # cos :: Tagged s a -> Tagged s a # tan :: Tagged s a -> Tagged s a # asin :: Tagged s a -> Tagged s a # acos :: Tagged s a -> Tagged s a # atan :: Tagged s a -> Tagged s a # sinh :: Tagged s a -> Tagged s a # cosh :: Tagged s a -> Tagged s a # tanh :: Tagged s a -> Tagged s a # asinh :: Tagged s a -> Tagged s a # acosh :: Tagged s a -> Tagged s a # atanh :: Tagged s a -> Tagged s a # log1p :: Tagged s a -> Tagged s a # expm1 :: Tagged s a -> Tagged s a # log1pexp :: Tagged s a -> Tagged s a # log1mexp :: Tagged s a -> Tagged s a #

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:

recip gives the multiplicative inverse: x * recip x = recip x * x = fromInteger 1

Note that it isn't customarily expected that a type instance of Fractional implement a field. However, all instances in base do.

Minimal complete definition

fromRational, (recip | (/))

Methods

(/) :: a -> a -> a infixl 7 #

fractional division

recip :: a -> a #

reciprocal fraction

fromRational :: Rational -> a #

Conversion from a Rational (that is Ratio Integer). A floating literal stands for an application of fromRational to a value of type Rational, so such literals have type (Fractional a) => a.

Instances

Fractional CFloat
Instance details Defined in Foreign.C.Types Methods (/) :: CFloat -> CFloat -> CFloat # recip :: CFloat -> CFloat # fromRational :: Rational -> CFloat #
Fractional CDouble
Instance details Defined in Foreign.C.Types Methods (/) :: CDouble -> CDouble -> CDouble # recip :: CDouble -> CDouble # fromRational :: Rational -> CDouble #
Fractional DiffTime
Instance details Defined in Data.Time.Clock.Internal.DiffTime Methods (/) :: DiffTime -> DiffTime -> DiffTime # recip :: DiffTime -> DiffTime # fromRational :: Rational -> DiffTime #
Integral a => Fractional (Ratio a)	Since: base-2.0.1
Instance details Defined in GHC.Real Methods (/) :: Ratio a -> Ratio a -> Ratio a # recip :: Ratio a -> Ratio a # fromRational :: Rational -> Ratio a #
RealFloat a => Fractional (Complex a)	Since: base-2.1
Instance details Defined in Data.Complex Methods (/) :: Complex a -> Complex a -> Complex a # recip :: Complex a -> Complex a # fromRational :: Rational -> Complex a #
Fractional a => Fractional (Identity a)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Identity Methods (/) :: Identity a -> Identity a -> Identity a # recip :: Identity a -> Identity a # fromRational :: Rational -> Identity a #
Fractional a => Fractional (Op a b)
Instance details Defined in Data.Functor.Contravariant Methods (/) :: Op a b -> Op a b -> Op a b # recip :: Op a b -> Op a b # fromRational :: Rational -> Op a b #
Fractional a => Fractional (Const a b)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Const Methods (/) :: Const a b -> Const a b -> Const a b # recip :: Const a b -> Const a b # fromRational :: Rational -> Const a b #
Fractional a => Fractional (Tagged s a)
Instance details Defined in Data.Tagged Methods (/) :: Tagged s a -> Tagged s a -> Tagged s a # recip :: Tagged s a -> Tagged s a # fromRational :: Rational -> 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 y with rem x y = fromInteger 0 or g (rem x y) < g y
x = y * div x y + mod x y with mod x y = fromInteger 0 or f (mod x y) < f y

An example of a suitable Euclidean function, for Integer's instance, is abs.

Minimal complete definition

quotRem, toInteger

Methods

quot :: a -> a -> a infixl 7 #

integer division truncated toward zero

rem :: a -> a -> a infixl 7 #

integer remainder, satisfying

(x `quot` y)*y + (x `rem` y) == x

div :: a -> a -> a infixl 7 #

integer division truncated toward negative infinity

mod :: a -> a -> a infixl 7 #

integer modulus, satisfying

(x `div` y)*y + (x `mod` y) == x

quotRem :: a -> a -> (a, a) #

simultaneous quot and rem

divMod :: a -> a -> (a, a) #

simultaneous div and mod

toInteger :: a -> Integer #

conversion to Integer

Instances

Integral Int	Since: base-2.0.1
Instance details Defined in GHC.Real Methods quot :: Int -> Int -> Int # rem :: Int -> Int -> Int # div :: Int -> Int -> Int # mod :: Int -> Int -> Int # quotRem :: Int -> Int -> (Int, Int) # divMod :: Int -> Int -> (Int, Int) # toInteger :: Int -> Integer #
Integral Int8	Since: base-2.1
Instance details Defined in GHC.Int Methods quot :: Int8 -> Int8 -> Int8 # rem :: Int8 -> Int8 -> Int8 # div :: Int8 -> Int8 -> Int8 # mod :: Int8 -> Int8 -> Int8 # quotRem :: Int8 -> Int8 -> (Int8, Int8) # divMod :: Int8 -> Int8 -> (Int8, Int8) # toInteger :: Int8 -> Integer #
Integral Int16	Since: base-2.1
Instance details Defined in GHC.Int Methods quot :: Int16 -> Int16 -> Int16 # rem :: Int16 -> Int16 -> Int16 # div :: Int16 -> Int16 -> Int16 # mod :: Int16 -> Int16 -> Int16 # quotRem :: Int16 -> Int16 -> (Int16, Int16) # divMod :: Int16 -> Int16 -> (Int16, Int16) # toInteger :: Int16 -> Integer #
Integral Int32	Since: base-2.1
Instance details Defined in GHC.Int Methods quot :: Int32 -> Int32 -> Int32 # rem :: Int32 -> Int32 -> Int32 # div :: Int32 -> Int32 -> Int32 # mod :: Int32 -> Int32 -> Int32 # quotRem :: Int32 -> Int32 -> (Int32, Int32) # divMod :: Int32 -> Int32 -> (Int32, Int32) # toInteger :: Int32 -> Integer #
Integral Int64	Since: base-2.1
Instance details Defined in GHC.Int Methods quot :: Int64 -> Int64 -> Int64 # rem :: Int64 -> Int64 -> Int64 # div :: Int64 -> Int64 -> Int64 # mod :: Int64 -> Int64 -> Int64 # quotRem :: Int64 -> Int64 -> (Int64, Int64) # divMod :: Int64 -> Int64 -> (Int64, Int64) # toInteger :: Int64 -> Integer #
Integral Integer	Since: base-2.0.1
Instance details Defined in GHC.Real Methods quot :: Integer -> Integer -> Integer # rem :: Integer -> Integer -> Integer # div :: Integer -> Integer -> Integer # mod :: Integer -> Integer -> Integer # quotRem :: Integer -> Integer -> (Integer, Integer) # divMod :: Integer -> Integer -> (Integer, Integer) # toInteger :: Integer -> Integer #
Integral Natural	Since: base-4.8.0.0
Instance details Defined in GHC.Real Methods quot :: Natural -> Natural -> Natural # rem :: Natural -> Natural -> Natural # div :: Natural -> Natural -> Natural # mod :: Natural -> Natural -> Natural # quotRem :: Natural -> Natural -> (Natural, Natural) # divMod :: Natural -> Natural -> (Natural, Natural) # toInteger :: Natural -> Integer #
Integral Word	Since: base-2.1
Instance details Defined in GHC.Real Methods quot :: Word -> Word -> Word # rem :: Word -> Word -> Word # div :: Word -> Word -> Word # mod :: Word -> Word -> Word # quotRem :: Word -> Word -> (Word, Word) # divMod :: Word -> Word -> (Word, Word) # toInteger :: Word -> Integer #
Integral Word8	Since: base-2.1
Instance details Defined in GHC.Word Methods quot :: Word8 -> Word8 -> Word8 # rem :: Word8 -> Word8 -> Word8 # div :: Word8 -> Word8 -> Word8 # mod :: Word8 -> Word8 -> Word8 # quotRem :: Word8 -> Word8 -> (Word8, Word8) # divMod :: Word8 -> Word8 -> (Word8, Word8) # toInteger :: Word8 -> Integer #
Integral Word16	Since: base-2.1
Instance details Defined in GHC.Word Methods quot :: Word16 -> Word16 -> Word16 # rem :: Word16 -> Word16 -> Word16 # div :: Word16 -> Word16 -> Word16 # mod :: Word16 -> Word16 -> Word16 # quotRem :: Word16 -> Word16 -> (Word16, Word16) # divMod :: Word16 -> Word16 -> (Word16, Word16) # toInteger :: Word16 -> Integer #
Integral Word32	Since: base-2.1
Instance details Defined in GHC.Word Methods quot :: Word32 -> Word32 -> Word32 # rem :: Word32 -> Word32 -> Word32 # div :: Word32 -> Word32 -> Word32 # mod :: Word32 -> Word32 -> Word32 # quotRem :: Word32 -> Word32 -> (Word32, Word32) # divMod :: Word32 -> Word32 -> (Word32, Word32) # toInteger :: Word32 -> Integer #
Integral Word64	Since: base-2.1
Instance details Defined in GHC.Word Methods quot :: Word64 -> Word64 -> Word64 # rem :: Word64 -> Word64 -> Word64 # div :: Word64 -> Word64 -> Word64 # mod :: Word64 -> Word64 -> Word64 # quotRem :: Word64 -> Word64 -> (Word64, Word64) # divMod :: Word64 -> Word64 -> (Word64, Word64) # toInteger :: Word64 -> Integer #
Integral CChar
Instance details Defined in Foreign.C.Types Methods quot :: CChar -> CChar -> CChar # rem :: CChar -> CChar -> CChar # div :: CChar -> CChar -> CChar # mod :: CChar -> CChar -> CChar # quotRem :: CChar -> CChar -> (CChar, CChar) # divMod :: CChar -> CChar -> (CChar, CChar) # toInteger :: CChar -> Integer #
Integral CSChar
Instance details Defined in Foreign.C.Types Methods quot :: CSChar -> CSChar -> CSChar # rem :: CSChar -> CSChar -> CSChar # div :: CSChar -> CSChar -> CSChar # mod :: CSChar -> CSChar -> CSChar # quotRem :: CSChar -> CSChar -> (CSChar, CSChar) # divMod :: CSChar -> CSChar -> (CSChar, CSChar) # toInteger :: CSChar -> Integer #
Integral CUChar
Instance details Defined in Foreign.C.Types Methods quot :: CUChar -> CUChar -> CUChar # rem :: CUChar -> CUChar -> CUChar # div :: CUChar -> CUChar -> CUChar # mod :: CUChar -> CUChar -> CUChar # quotRem :: CUChar -> CUChar -> (CUChar, CUChar) # divMod :: CUChar -> CUChar -> (CUChar, CUChar) # toInteger :: CUChar -> Integer #
Integral CShort
Instance details Defined in Foreign.C.Types Methods quot :: CShort -> CShort -> CShort # rem :: CShort -> CShort -> CShort # div :: CShort -> CShort -> CShort # mod :: CShort -> CShort -> CShort # quotRem :: CShort -> CShort -> (CShort, CShort) # divMod :: CShort -> CShort -> (CShort, CShort) # toInteger :: CShort -> Integer #
Integral CUShort
Instance details Defined in Foreign.C.Types Methods quot :: CUShort -> CUShort -> CUShort # rem :: CUShort -> CUShort -> CUShort # div :: CUShort -> CUShort -> CUShort # mod :: CUShort -> CUShort -> CUShort # quotRem :: CUShort -> CUShort -> (CUShort, CUShort) # divMod :: CUShort -> CUShort -> (CUShort, CUShort) # toInteger :: CUShort -> Integer #
Integral CInt
Instance details Defined in Foreign.C.Types Methods quot :: CInt -> CInt -> CInt # rem :: CInt -> CInt -> CInt # div :: CInt -> CInt -> CInt # mod :: CInt -> CInt -> CInt # quotRem :: CInt -> CInt -> (CInt, CInt) # divMod :: CInt -> CInt -> (CInt, CInt) # toInteger :: CInt -> Integer #
Integral CUInt
Instance details Defined in Foreign.C.Types Methods quot :: CUInt -> CUInt -> CUInt # rem :: CUInt -> CUInt -> CUInt # div :: CUInt -> CUInt -> CUInt # mod :: CUInt -> CUInt -> CUInt # quotRem :: CUInt -> CUInt -> (CUInt, CUInt) # divMod :: CUInt -> CUInt -> (CUInt, CUInt) # toInteger :: CUInt -> Integer #
Integral CLong
Instance details Defined in Foreign.C.Types Methods quot :: CLong -> CLong -> CLong # rem :: CLong -> CLong -> CLong # div :: CLong -> CLong -> CLong # mod :: CLong -> CLong -> CLong # quotRem :: CLong -> CLong -> (CLong, CLong) # divMod :: CLong -> CLong -> (CLong, CLong) # toInteger :: CLong -> Integer #
Integral CULong
Instance details Defined in Foreign.C.Types Methods quot :: CULong -> CULong -> CULong # rem :: CULong -> CULong -> CULong # div :: CULong -> CULong -> CULong # mod :: CULong -> CULong -> CULong # quotRem :: CULong -> CULong -> (CULong, CULong) # divMod :: CULong -> CULong -> (CULong, CULong) # toInteger :: CULong -> Integer #
Integral CLLong
Instance details Defined in Foreign.C.Types Methods quot :: CLLong -> CLLong -> CLLong # rem :: CLLong -> CLLong -> CLLong # div :: CLLong -> CLLong -> CLLong # mod :: CLLong -> CLLong -> CLLong # quotRem :: CLLong -> CLLong -> (CLLong, CLLong) # divMod :: CLLong -> CLLong -> (CLLong, CLLong) # toInteger :: CLLong -> Integer #
Integral CULLong
Instance details Defined in Foreign.C.Types Methods quot :: CULLong -> CULLong -> CULLong # rem :: CULLong -> CULLong -> CULLong # div :: CULLong -> CULLong -> CULLong # mod :: CULLong -> CULLong -> CULLong # quotRem :: CULLong -> CULLong -> (CULLong, CULLong) # divMod :: CULLong -> CULLong -> (CULLong, CULLong) # toInteger :: CULLong -> Integer #
Integral CBool
Instance details Defined in Foreign.C.Types Methods quot :: CBool -> CBool -> CBool # rem :: CBool -> CBool -> CBool # div :: CBool -> CBool -> CBool # mod :: CBool -> CBool -> CBool # quotRem :: CBool -> CBool -> (CBool, CBool) # divMod :: CBool -> CBool -> (CBool, CBool) # toInteger :: CBool -> Integer #
Integral CPtrdiff
Instance details Defined in Foreign.C.Types Methods quot :: CPtrdiff -> CPtrdiff -> CPtrdiff # rem :: CPtrdiff -> CPtrdiff -> CPtrdiff # div :: CPtrdiff -> CPtrdiff -> CPtrdiff # mod :: CPtrdiff -> CPtrdiff -> CPtrdiff # quotRem :: CPtrdiff -> CPtrdiff -> (CPtrdiff, CPtrdiff) # divMod :: CPtrdiff -> CPtrdiff -> (CPtrdiff, CPtrdiff) # toInteger :: CPtrdiff -> Integer #
Integral CSize
Instance details Defined in Foreign.C.Types Methods quot :: CSize -> CSize -> CSize # rem :: CSize -> CSize -> CSize # div :: CSize -> CSize -> CSize # mod :: CSize -> CSize -> CSize # quotRem :: CSize -> CSize -> (CSize, CSize) # divMod :: CSize -> CSize -> (CSize, CSize) # toInteger :: CSize -> Integer #
Integral CWchar
Instance details Defined in Foreign.C.Types Methods quot :: CWchar -> CWchar -> CWchar # rem :: CWchar -> CWchar -> CWchar # div :: CWchar -> CWchar -> CWchar # mod :: CWchar -> CWchar -> CWchar # quotRem :: CWchar -> CWchar -> (CWchar, CWchar) # divMod :: CWchar -> CWchar -> (CWchar, CWchar) # toInteger :: CWchar -> Integer #
Integral CSigAtomic
Instance details Defined in Foreign.C.Types Methods quot :: CSigAtomic -> CSigAtomic -> CSigAtomic # rem :: CSigAtomic -> CSigAtomic -> CSigAtomic # div :: CSigAtomic -> CSigAtomic -> CSigAtomic # mod :: CSigAtomic -> CSigAtomic -> CSigAtomic # quotRem :: CSigAtomic -> CSigAtomic -> (CSigAtomic, CSigAtomic) # divMod :: CSigAtomic -> CSigAtomic -> (CSigAtomic, CSigAtomic) # toInteger :: CSigAtomic -> Integer #
Integral CIntPtr
Instance details Defined in Foreign.C.Types Methods quot :: CIntPtr -> CIntPtr -> CIntPtr # rem :: CIntPtr -> CIntPtr -> CIntPtr # div :: CIntPtr -> CIntPtr -> CIntPtr # mod :: CIntPtr -> CIntPtr -> CIntPtr # quotRem :: CIntPtr -> CIntPtr -> (CIntPtr, CIntPtr) # divMod :: CIntPtr -> CIntPtr -> (CIntPtr, CIntPtr) # toInteger :: CIntPtr -> Integer #
Integral CUIntPtr
Instance details Defined in Foreign.C.Types Methods quot :: CUIntPtr -> CUIntPtr -> CUIntPtr # rem :: CUIntPtr -> CUIntPtr -> CUIntPtr # div :: CUIntPtr -> CUIntPtr -> CUIntPtr # mod :: CUIntPtr -> CUIntPtr -> CUIntPtr # quotRem :: CUIntPtr -> CUIntPtr -> (CUIntPtr, CUIntPtr) # divMod :: CUIntPtr -> CUIntPtr -> (CUIntPtr, CUIntPtr) # toInteger :: CUIntPtr -> Integer #
Integral CIntMax
Instance details Defined in Foreign.C.Types Methods quot :: CIntMax -> CIntMax -> CIntMax # rem :: CIntMax -> CIntMax -> CIntMax # div :: CIntMax -> CIntMax -> CIntMax # mod :: CIntMax -> CIntMax -> CIntMax # quotRem :: CIntMax -> CIntMax -> (CIntMax, CIntMax) # divMod :: CIntMax -> CIntMax -> (CIntMax, CIntMax) # toInteger :: CIntMax -> Integer #
Integral CUIntMax
Instance details Defined in Foreign.C.Types Methods quot :: CUIntMax -> CUIntMax -> CUIntMax # rem :: CUIntMax -> CUIntMax -> CUIntMax # div :: CUIntMax -> CUIntMax -> CUIntMax # mod :: CUIntMax -> CUIntMax -> CUIntMax # quotRem :: CUIntMax -> CUIntMax -> (CUIntMax, CUIntMax) # divMod :: CUIntMax -> CUIntMax -> (CUIntMax, CUIntMax) # toInteger :: CUIntMax -> Integer #
Integral a => Integral (Identity a)	Since: base-4.9.0.0
Instance details 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) # toInteger :: Identity a -> Integer #
Integral a => Integral (Const a b)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Const Methods quot :: Const a b -> Const a b -> Const a b # rem :: Const a b -> Const a b -> Const a b # div :: Const a b -> Const a b -> Const a b # mod :: Const a b -> Const a b -> Const a b # quotRem :: Const a b -> Const a b -> (Const a b, Const a b) # divMod :: Const a b -> Const a b -> (Const a b, Const a b) # toInteger :: Const a b -> Integer #
Integral a => Integral (Tagged s a)
Instance details Defined in Data.Tagged Methods quot :: Tagged s a -> Tagged s a -> Tagged s a # rem :: Tagged s a -> Tagged s a -> Tagged s a # div :: Tagged s a -> Tagged s a -> Tagged s a # mod :: Tagged s a -> Tagged s a -> Tagged s a # quotRem :: Tagged s a -> Tagged s a -> (Tagged s a, Tagged s a) # divMod :: Tagged s a -> Tagged s a -> (Tagged s a, Tagged s a) # toInteger :: Tagged s a -> Integer #

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:

```
return a >>= k  =  k a
```
```
m >>= return  =  m
```

m >>= (\x -> k x >>= h)  =  (m >>= k) >>= h

Furthermore, the Monad and Applicative operations should relate as follows:

```
pure = return
```
```
(<*>) = ap
```

The above laws imply:

```
fmap f xs  =  xs >>= return . f
```
```
(>>) = (*>)
```

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.

return :: a -> m a #

Inject a value into the monadic type.

fail :: String -> m a #

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
Instance details Defined in GHC.Base Methods (>>=) :: [a] -> (a -> [b]) -> [b] # (>>) :: [a] -> [b] -> [b] # return :: a -> [a] # fail :: String -> [a] #
Monad Maybe	Since: base-2.1
Instance details Defined in GHC.Base Methods (>>=) :: Maybe a -> (a -> Maybe b) -> Maybe b # (>>) :: Maybe a -> Maybe b -> Maybe b # return :: a -> Maybe a # fail :: String -> Maybe a #
Monad IO	Since: base-2.1
Instance details Defined in GHC.Base Methods (>>=) :: IO a -> (a -> IO b) -> IO b # (>>) :: IO a -> IO b -> IO b # return :: a -> IO a # fail :: String -> IO a #
Monad Par1	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods (>>=) :: Par1 a -> (a -> Par1 b) -> Par1 b # (>>) :: Par1 a -> Par1 b -> Par1 b # return :: a -> Par1 a # fail :: String -> Par1 a #
Monad Q
Instance details Defined in Language.Haskell.TH.Syntax Methods (>>=) :: Q a -> (a -> Q b) -> Q b # (>>) :: Q a -> Q b -> Q b # return :: a -> Q a # fail :: String -> Q a #
Monad Last	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods (>>=) :: Last a -> (a -> Last b) -> Last b # (>>) :: Last a -> Last b -> Last b # return :: a -> Last a # fail :: String -> Last a #
Monad Complex	Since: base-4.9.0.0
Instance details Defined in Data.Complex Methods (>>=) :: Complex a -> (a -> Complex b) -> Complex b # (>>) :: Complex a -> Complex b -> Complex b # return :: a -> Complex a # fail :: String -> Complex a #
Monad Min	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods (>>=) :: Min a -> (a -> Min b) -> Min b # (>>) :: Min a -> Min b -> Min b # return :: a -> Min a # fail :: String -> Min a #
Monad Max	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods (>>=) :: Max a -> (a -> Max b) -> Max b # (>>) :: Max a -> Max b -> Max b # return :: a -> Max a # fail :: String -> Max a #
Monad First	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods (>>=) :: First a -> (a -> First b) -> First b # (>>) :: First a -> First b -> First b # return :: a -> First a # fail :: String -> First a #
Monad Option	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods (>>=) :: Option a -> (a -> Option b) -> Option b # (>>) :: Option a -> Option b -> Option b # return :: a -> Option a # fail :: String -> Option a #
Monad Identity	Since: base-4.8.0.0
Instance details Defined in Data.Functor.Identity Methods (>>=) :: Identity a -> (a -> Identity b) -> Identity b # (>>) :: Identity a -> Identity b -> Identity b # return :: a -> Identity a # fail :: String -> Identity a #
Monad STM	Since: base-4.3.0.0
Instance details Defined in GHC.Conc.Sync Methods (>>=) :: STM a -> (a -> STM b) -> STM b # (>>) :: STM a -> STM b -> STM b # return :: a -> STM a # fail :: String -> STM a #
Monad First	Since: base-4.8.0.0
Instance details Defined in Data.Monoid Methods (>>=) :: First a -> (a -> First b) -> First b # (>>) :: First a -> First b -> First b # return :: a -> First a # fail :: String -> First a #
Monad Last	Since: base-4.8.0.0
Instance details Defined in Data.Monoid Methods (>>=) :: Last a -> (a -> Last b) -> Last b # (>>) :: Last a -> Last b -> Last b # return :: a -> Last a # fail :: String -> Last a #
Monad Dual	Since: base-4.8.0.0
Instance details Defined in Data.Semigroup.Internal Methods (>>=) :: Dual a -> (a -> Dual b) -> Dual b # (>>) :: Dual a -> Dual b -> Dual b # return :: a -> Dual a # fail :: String -> Dual a #
Monad Sum	Since: base-4.8.0.0
Instance details Defined in Data.Semigroup.Internal Methods (>>=) :: Sum a -> (a -> Sum b) -> Sum b # (>>) :: Sum a -> Sum b -> Sum b # return :: a -> Sum a # fail :: String -> Sum a #
Monad Product	Since: base-4.8.0.0
Instance details Defined in Data.Semigroup.Internal Methods (>>=) :: Product a -> (a -> Product b) -> Product b # (>>) :: Product a -> Product b -> Product b # return :: a -> Product a # fail :: String -> Product a #
Monad Down	Since: base-4.11.0.0
Instance details Defined in Data.Ord Methods (>>=) :: Down a -> (a -> Down b) -> Down b # (>>) :: Down a -> Down b -> Down b # return :: a -> Down a # fail :: String -> Down a #
Monad ReadPrec	Since: base-2.1
Instance details Defined in Text.ParserCombinators.ReadPrec Methods (>>=) :: ReadPrec a -> (a -> ReadPrec b) -> ReadPrec b # (>>) :: ReadPrec a -> ReadPrec b -> ReadPrec b # return :: a -> ReadPrec a # fail :: String -> ReadPrec a #
Monad ReadP	Since: base-2.1
Instance details Defined in Text.ParserCombinators.ReadP Methods (>>=) :: ReadP a -> (a -> ReadP b) -> ReadP b # (>>) :: ReadP a -> ReadP b -> ReadP b # return :: a -> ReadP a # fail :: String -> ReadP a #
Monad NonEmpty	Since: base-4.9.0.0
Instance details Defined in GHC.Base Methods (>>=) :: NonEmpty a -> (a -> NonEmpty b) -> NonEmpty b # (>>) :: NonEmpty a -> NonEmpty b -> NonEmpty b # return :: a -> NonEmpty a # fail :: String -> NonEmpty a #
Monad Vector
Instance details Defined in Data.Vector Methods (>>=) :: Vector a -> (a -> Vector b) -> Vector b # (>>) :: Vector a -> Vector b -> Vector b # return :: a -> Vector a # fail :: String -> Vector a #
Monad Seq
Instance details Defined in Data.Sequence.Internal Methods (>>=) :: Seq a -> (a -> Seq b) -> Seq b # (>>) :: Seq a -> Seq b -> Seq b # return :: a -> Seq a # fail :: String -> Seq a #
Monad Memoized
Instance details Defined in UnliftIO.Memoize Methods (>>=) :: Memoized a -> (a -> Memoized b) -> Memoized b # (>>) :: Memoized a -> Memoized b -> Memoized b # return :: a -> Memoized a # fail :: String -> Memoized a #
Monad DList
Instance details Defined in Data.DList Methods (>>=) :: DList a -> (a -> DList b) -> DList b # (>>) :: DList a -> DList b -> DList b # return :: a -> DList a # fail :: String -> DList a #
Monad Tree
Instance details Defined in Data.Tree Methods (>>=) :: Tree a -> (a -> Tree b) -> Tree b # (>>) :: Tree a -> Tree b -> Tree b # return :: a -> Tree a # fail :: String -> Tree a #
Monad ScopeM
Instance details Defined in Text.Heterocephalus Methods (>>=) :: ScopeM a -> (a -> ScopeM b) -> ScopeM b # (>>) :: ScopeM a -> ScopeM b -> ScopeM b # return :: a -> ScopeM a # fail :: String -> ScopeM a #
Monad SmallArray
Instance details 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
Instance details Defined in Data.Primitive.Array Methods (>>=) :: Array a -> (a -> Array b) -> Array b # (>>) :: Array a -> Array b -> Array b # return :: a -> Array a # fail :: String -> Array a #
Monad Id
Instance details Defined in Data.Vector.Fusion.Util Methods (>>=) :: Id a -> (a -> Id b) -> Id b # (>>) :: Id a -> Id b -> Id b # return :: a -> Id a # fail :: String -> Id a #
Monad Box
Instance details Defined in Data.Vector.Fusion.Util Methods (>>=) :: Box a -> (a -> Box b) -> Box b # (>>) :: Box a -> Box b -> Box b # return :: a -> Box a # fail :: String -> Box a #
Monad P	Since: base-2.1
Instance details Defined in Text.ParserCombinators.ReadP Methods (>>=) :: P a -> (a -> P b) -> P b # (>>) :: P a -> P b -> P b # return :: a -> P a # fail :: String -> P a #
Monad (Either e)	Since: base-4.4.0.0
Instance details Defined in Data.Either Methods (>>=) :: Either e a -> (a -> Either e b) -> Either e b # (>>) :: Either e a -> Either e b -> Either e b # return :: a -> Either e a # fail :: String -> Either e a #
Monad (U1 :: Type -> Type)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods (>>=) :: U1 a -> (a -> U1 b) -> U1 b # (>>) :: U1 a -> U1 b -> U1 b # return :: a -> U1 a # fail :: String -> U1 a #
Monoid a => Monad ((,) a)	Since: base-4.9.0.0
Instance details Defined in GHC.Base Methods (>>=) :: (a, a0) -> (a0 -> (a, b)) -> (a, b) # (>>) :: (a, a0) -> (a, b) -> (a, b) # return :: a0 -> (a, a0) # fail :: String -> (a, a0) #
Monad (ST s)	Since: base-2.1
Instance details Defined in GHC.ST Methods (>>=) :: ST s a -> (a -> ST s b) -> ST s b # (>>) :: ST s a -> ST s b -> ST s b # return :: a -> ST s a # fail :: String -> ST s a #
Representable f => Monad (Co f)
Instance details Defined in Data.Functor.Rep Methods (>>=) :: Co f a -> (a -> Co f b) -> Co f b # (>>) :: Co f a -> Co f b -> Co f b # return :: a -> Co f a # fail :: String -> Co f a #
Monad (Parser i)
Instance details Defined in Data.Attoparsec.Internal.Types Methods (>>=) :: Parser i a -> (a -> Parser i b) -> Parser i b # (>>) :: Parser i a -> Parser i b -> Parser i b # return :: a -> Parser i a # fail :: String -> Parser i a #
Monad m => Monad (WrappedMonad m)	Since: base-4.7.0.0
Instance details 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
Instance details 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
Instance details Defined in Data.Proxy Methods (>>=) :: Proxy a -> (a -> Proxy b) -> Proxy b # (>>) :: Proxy a -> Proxy b -> Proxy b # return :: a -> Proxy a # fail :: String -> Proxy a #
Monad m => Monad (MaybeT m)
Instance details Defined in Control.Monad.Trans.Maybe Methods (>>=) :: MaybeT m a -> (a -> MaybeT m b) -> MaybeT m b # (>>) :: MaybeT m a -> MaybeT m b -> MaybeT m b # return :: a -> MaybeT m a # fail :: String -> MaybeT m a #
Monad m => Monad (ResourceT m)
Instance details Defined in Control.Monad.Trans.Resource.Internal Methods (>>=) :: ResourceT m a -> (a -> ResourceT m b) -> ResourceT m b # (>>) :: ResourceT m a -> ResourceT m b -> ResourceT m b # return :: a -> ResourceT m a # fail :: String -> ResourceT m a #
Alternative f => Monad (Cofree f)
Instance details Defined in Control.Comonad.Cofree Methods (>>=) :: Cofree f a -> (a -> Cofree f b) -> Cofree f b # (>>) :: Cofree f a -> Cofree f b -> Cofree f b # return :: a -> Cofree f a # fail :: String -> Cofree f a #
Functor f => Monad (Free f)
Instance details Defined in Control.Monad.Free Methods (>>=) :: Free f a -> (a -> Free f b) -> Free f b # (>>) :: Free f a -> Free f b -> Free f b # return :: a -> Free f a # fail :: String -> Free f a #
Monad m => Monad (Yoneda m)
Instance details Defined in Data.Functor.Yoneda Methods (>>=) :: Yoneda m a -> (a -> Yoneda m b) -> Yoneda m b # (>>) :: Yoneda m a -> Yoneda m b -> Yoneda m b # return :: a -> Yoneda m a # fail :: String -> Yoneda m a #
Monad (ReifiedGetter s)
Instance details 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)
Instance details 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)
Instance details Defined in Control.Monad.Trans.List Methods (>>=) :: ListT m a -> (a -> ListT m b) -> ListT m b # (>>) :: ListT m a -> ListT m b -> ListT m b # return :: a -> ListT m a # fail :: String -> ListT m a #
(Monad (Rep p), Representable p) => Monad (Prep p)
Instance details Defined in Data.Profunctor.Rep Methods (>>=) :: Prep p a -> (a -> Prep p b) -> Prep p b # (>>) :: Prep p a -> Prep p b -> Prep p b # return :: a -> Prep p a # fail :: String -> Prep p a #
Monad q => Monad (DsM q)
Instance details Defined in Language.Haskell.TH.Desugar.Reify Methods (>>=) :: DsM q a -> (a -> DsM q b) -> DsM q b # (>>) :: DsM q a -> DsM q b -> DsM q b # return :: a -> DsM q a # fail :: String -> DsM q a #
Monad (SetM s)
Instance details Defined in Data.Graph Methods (>>=) :: SetM s a -> (a -> SetM s b) -> SetM s b # (>>) :: SetM s a -> SetM s b -> SetM s b # return :: a -> SetM s a # fail :: String -> SetM s a #
SingI ns => Monad (Matrix ns) Source #
Instance details Defined in Termonad.Config.Vec Methods (>>=) :: Matrix ns a -> (a -> Matrix ns b) -> Matrix ns b # (>>) :: Matrix ns a -> Matrix ns b -> Matrix ns b # return :: a -> Matrix ns a # fail :: String -> Matrix ns a #
SingI n => Monad (Vec n) Source #
Instance details Defined in Termonad.Config.Vec Methods (>>=) :: Vec n a -> (a -> Vec n b) -> Vec n b # (>>) :: Vec n a -> Vec n b -> Vec n b # return :: a -> Vec n a # fail :: String -> Vec n a #
Monad f => Monad (Rec1 f)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods (>>=) :: Rec1 f a -> (a -> Rec1 f b) -> Rec1 f b # (>>) :: Rec1 f a -> Rec1 f b -> Rec1 f b # return :: a -> Rec1 f a # fail :: String -> Rec1 f a #
Monad f => Monad (Ap f)	Since: base-4.12.0.0
Instance details Defined in Data.Monoid Methods (>>=) :: Ap f a -> (a -> Ap f b) -> Ap f b # (>>) :: Ap f a -> Ap f b -> Ap f b # return :: a -> Ap f a # fail :: String -> Ap f a #
Monad f => Monad (Alt f)	Since: base-4.8.0.0
Instance details Defined in Data.Semigroup.Internal Methods (>>=) :: Alt f a -> (a -> Alt f b) -> Alt f b # (>>) :: Alt f a -> Alt f b -> Alt f b # return :: a -> Alt f a # fail :: String -> Alt f a #
Monad m => Monad (ReaderT r m)
Instance details Defined in Control.Monad.Trans.Reader Methods (>>=) :: ReaderT r m a -> (a -> ReaderT r m b) -> ReaderT r m b # (>>) :: ReaderT r m a -> ReaderT r m b -> ReaderT r m b # return :: a -> ReaderT r m a # fail :: String -> ReaderT r m a #
Monad m => Monad (IdentityT m)
Instance details Defined in Control.Monad.Trans.Identity Methods (>>=) :: IdentityT m a -> (a -> IdentityT m b) -> IdentityT m b # (>>) :: IdentityT m a -> IdentityT m b -> IdentityT m b # return :: a -> IdentityT m a # fail :: String -> IdentityT m a #
(Monoid w, Monad m) => Monad (WriterT w m)
Instance details Defined in Control.Monad.Trans.Writer.Strict Methods (>>=) :: WriterT w m a -> (a -> WriterT w m b) -> WriterT w m b # (>>) :: WriterT w m a -> WriterT w m b -> WriterT w m b # return :: a -> WriterT w m a # fail :: String -> WriterT w m a #
(Monoid w, Monad m) => Monad (WriterT w m)
Instance details Defined in Control.Monad.Trans.Writer.Lazy Methods (>>=) :: WriterT w m a -> (a -> WriterT w m b) -> WriterT w m b # (>>) :: WriterT w m a -> WriterT w m b -> WriterT w m b # return :: a -> WriterT w m a # fail :: String -> WriterT w m a #
Monad m => Monad (StateT s m)
Instance details Defined in Control.Monad.Trans.State.Strict Methods (>>=) :: StateT s m a -> (a -> StateT s m b) -> StateT s m b # (>>) :: StateT s m a -> StateT s m b -> StateT s m b # return :: a -> StateT s m a # fail :: String -> StateT s m a #
Monad m => Monad (StateT s m)
Instance details Defined in Control.Monad.Trans.State.Lazy Methods (>>=) :: StateT s m a -> (a -> StateT s m b) -> StateT s m b # (>>) :: StateT s m a -> StateT s m b -> StateT s m b # return :: a -> StateT s m a # fail :: String -> StateT s m a #
(Applicative f, Monad f) => Monad (WhenMissing f x)	Equivalent to `ReaderT k (ReaderT x (MaybeT f))`. Since: containers-0.5.9
Instance details 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)
Instance details Defined in Control.Monad.Trans.Free Methods (>>=) :: FreeT f m a -> (a -> FreeT f m b) -> FreeT f m b # (>>) :: FreeT f m a -> FreeT f m b -> FreeT f m b # return :: a -> FreeT f m a # fail :: String -> FreeT f m a #
(Alternative f, Monad w) => Monad (CofreeT f w)
Instance details Defined in Control.Comonad.Trans.Cofree Methods (>>=) :: CofreeT f w a -> (a -> CofreeT f w b) -> CofreeT f w b # (>>) :: CofreeT f w a -> CofreeT f w b -> CofreeT f w b # return :: a -> CofreeT f w a # fail :: String -> CofreeT f w a #
(Monad m, Error e) => Monad (ErrorT e m)
Instance details Defined in Control.Monad.Trans.Error Methods (>>=) :: ErrorT e m a -> (a -> ErrorT e m b) -> ErrorT e m b # (>>) :: ErrorT e m a -> ErrorT e m b -> ErrorT e m b # return :: a -> ErrorT e m a # fail :: String -> ErrorT e m a #
Monad (Indexed i a)
Instance details Defined in Control.Lens.Internal.Indexed Methods (>>=) :: Indexed i a a0 -> (a0 -> Indexed i a b) -> Indexed i a b # (>>) :: Indexed i a a0 -> Indexed i a b -> Indexed i a b # return :: a0 -> Indexed i a a0 # fail :: String -> Indexed i a a0 #
Monad (Tagged s)
Instance details Defined in Data.Tagged Methods (>>=) :: Tagged s a -> (a -> Tagged s b) -> Tagged s b # (>>) :: Tagged s a -> Tagged s b -> Tagged s b # return :: a -> Tagged s a # fail :: String -> Tagged s a #
Monad ((->) r :: Type -> Type)	Since: base-2.1
Instance details Defined in GHC.Base Methods (>>=) :: (r -> a) -> (a -> r -> b) -> r -> b # (>>) :: (r -> a) -> (r -> b) -> r -> b # return :: a -> r -> a # fail :: String -> r -> a #
(Monad f, Monad g) => Monad (f :*: g)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods (>>=) :: (f :: g) a -> (a -> (f :: g) b) -> (f :: g) b # (>>) :: (f :: g) a -> (f :: g) b -> (f :: g) b # return :: a -> (f :: g) a # fail :: String -> (f :: g) a #
(Monad f, Monad g) => Monad (Product f g)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Product Methods (>>=) :: Product f g a -> (a -> Product f g b) -> Product f g b # (>>) :: Product f g a -> Product f g b -> Product f g b # return :: a -> Product f g a # fail :: String -> Product f g a #
Monad (Cokleisli w a)
Instance details Defined in Control.Comonad Methods (>>=) :: Cokleisli w a a0 -> (a0 -> Cokleisli w a b) -> Cokleisli w a b # (>>) :: Cokleisli w a a0 -> Cokleisli w a b -> Cokleisli w a b # return :: a0 -> Cokleisli w a a0 # fail :: String -> Cokleisli w a a0 #
Monad (ConduitT i o m)
Instance details Defined in Data.Conduit.Internal.Conduit Methods (>>=) :: ConduitT i o m a -> (a -> ConduitT i o m b) -> ConduitT i o m b # (>>) :: ConduitT i o m a -> ConduitT i o m b -> ConduitT i o m b # return :: a -> ConduitT i o m a # fail :: String -> ConduitT i o m a #
(Monad f, Applicative f) => Monad (WhenMatched f x y)	Equivalent to `ReaderT Key (ReaderT x (ReaderT y (MaybeT f)))` Since: containers-0.5.9
Instance details 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 `ReaderT k (ReaderT x (MaybeT f))` . Since: containers-0.5.9
Instance details 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)
Instance details Defined in Control.Monad.Trans.Cont Methods (>>=) :: ContT r m a -> (a -> ContT r m b) -> ContT r m b # (>>) :: ContT r m a -> ContT r m b -> ContT r m b # return :: a -> ContT r m a # fail :: String -> ContT r m a #
Monad f => Monad (M1 i c f)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods (>>=) :: M1 i c f a -> (a -> M1 i c f b) -> M1 i c f b # (>>) :: M1 i c f a -> M1 i c f b -> M1 i c f b # return :: a -> M1 i c f a # fail :: String -> M1 i c f a #
(Monoid w, Monad m) => Monad (RWST r w s m)
Instance details Defined in Control.Monad.Trans.RWS.Strict Methods (>>=) :: RWST r w s m a -> (a -> RWST r w s m b) -> RWST r w s m b # (>>) :: RWST r w s m a -> RWST r w s m b -> RWST r w s m b # return :: a -> RWST r w s m a # fail :: String -> RWST r w s m a #
(Monoid w, Monad m) => Monad (RWST r w s m)
Instance details Defined in Control.Monad.Trans.RWS.Lazy Methods (>>=) :: RWST r w s m a -> (a -> RWST r w s m b) -> RWST r w s m b # (>>) :: RWST r w s m a -> RWST r w s m b -> RWST r w s m b # return :: a -> RWST r w s m a # fail :: String -> RWST r w s m a #
(Monad f, Applicative f) => Monad (WhenMatched f k x y)	Equivalent to `ReaderT k (ReaderT x (ReaderT y (MaybeT f)))` Since: containers-0.5.9
Instance details 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)
Instance details Defined in Data.Conduit.Internal.Pipe Methods (>>=) :: Pipe l i o u m a -> (a -> Pipe l i o u m b) -> Pipe l i o u m b # (>>) :: Pipe l i o u m a -> Pipe l i o u m b -> Pipe l i o u m b # return :: a -> Pipe l i o u m a # fail :: String -> Pipe l i o u m a #

class Functor (f :: Type -> Type) where #

The Functor class is used for types that can be mapped over. Instances of Functor should satisfy the following laws:

fmap id  ==  id
fmap (f . g)  ==  fmap f . fmap g

The instances of Functor for lists, Maybe and IO satisfy these laws.

Minimal complete definition

fmap

Methods

fmap :: (a -> b) -> f a -> f b #

(<$) :: a -> f b -> f a infixl 4 #

Replace all locations in the input with the same value. The default definition is fmap . const, but this may be overridden with a more efficient version.

Instances

Functor []	Since: base-2.1
Instance details Defined in GHC.Base Methods fmap :: (a -> b) -> [a] -> [b] # (<$) :: a -> [b] -> [a] #
Functor Maybe	Since: base-2.1
Instance details Defined in GHC.Base Methods fmap :: (a -> b) -> Maybe a -> Maybe b # (<$) :: a -> Maybe b -> Maybe a #
Functor IO	Since: base-2.1
Instance details Defined in GHC.Base Methods fmap :: (a -> b) -> IO a -> IO b # (<$) :: a -> IO b -> IO a #
Functor Par1	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods fmap :: (a -> b) -> Par1 a -> Par1 b # (<$) :: a -> Par1 b -> Par1 a #
Functor Q
Instance details Defined in Language.Haskell.TH.Syntax Methods fmap :: (a -> b) -> Q a -> Q b # (<$) :: a -> Q b -> Q a #
Functor Last	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods fmap :: (a -> b) -> Last a -> Last b # (<$) :: a -> Last b -> Last a #
Functor SCC	Since: containers-0.5.4
Instance details Defined in Data.Graph Methods fmap :: (a -> b) -> SCC a -> SCC b # (<$) :: a -> SCC b -> SCC a #
Functor Async
Instance details Defined in Control.Concurrent.Async Methods fmap :: (a -> b) -> Async a -> Async b # (<$) :: a -> Async b -> Async a #
Functor Concurrently
Instance details Defined in Control.Concurrent.Async Methods fmap :: (a -> b) -> Concurrently a -> Concurrently b # (<$) :: a -> Concurrently b -> Concurrently a #
Functor Complex	Since: base-4.9.0.0
Instance details Defined in Data.Complex Methods fmap :: (a -> b) -> Complex a -> Complex b # (<$) :: a -> Complex b -> Complex a #
Functor Min	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods fmap :: (a -> b) -> Min a -> Min b # (<$) :: a -> Min b -> Min a #
Functor Max	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods fmap :: (a -> b) -> Max a -> Max b # (<$) :: a -> Max b -> Max a #
Functor First	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods fmap :: (a -> b) -> First a -> First b # (<$) :: a -> First b -> First a #
Functor Option	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods fmap :: (a -> b) -> Option a -> Option b # (<$) :: a -> Option b -> Option a #
Functor ZipList	Since: base-2.1
Instance details Defined in Control.Applicative Methods fmap :: (a -> b) -> ZipList a -> ZipList b # (<$) :: a -> ZipList b -> ZipList a #
Functor Identity	Since: base-4.8.0.0
Instance details Defined in Data.Functor.Identity Methods fmap :: (a -> b) -> Identity a -> Identity b # (<$) :: a -> Identity b -> Identity a #
Functor Handler	Since: base-4.6.0.0
Instance details Defined in Control.Exception Methods fmap :: (a -> b) -> Handler a -> Handler b # (<$) :: a -> Handler b -> Handler a #
Functor STM	Since: base-4.3.0.0
Instance details Defined in GHC.Conc.Sync Methods fmap :: (a -> b) -> STM a -> STM b # (<$) :: a -> STM b -> STM a #
Functor First	Since: base-4.8.0.0
Instance details Defined in Data.Monoid Methods fmap :: (a -> b) -> First a -> First b # (<$) :: a -> First b -> First a #
Functor Last	Since: base-4.8.0.0
Instance details Defined in Data.Monoid Methods fmap :: (a -> b) -> Last a -> Last b # (<$) :: a -> Last b -> Last a #
Functor Dual	Since: base-4.8.0.0
Instance details Defined in Data.Semigroup.Internal Methods fmap :: (a -> b) -> Dual a -> Dual b # (<$) :: a -> Dual b -> Dual a #
Functor Sum	Since: base-4.8.0.0
Instance details Defined in Data.Semigroup.Internal Methods fmap :: (a -> b) -> Sum a -> Sum b # (<$) :: a -> Sum b -> Sum a #
Functor Product	Since: base-4.8.0.0
Instance details Defined in Data.Semigroup.Internal Methods fmap :: (a -> b) -> Product a -> Product b # (<$) :: a -> Product b -> Product a #
Functor Down	Since: base-4.11.0.0
Instance details Defined in Data.Ord Methods fmap :: (a -> b) -> Down a -> Down b # (<$) :: a -> Down b -> Down a #
Functor ReadPrec	Since: base-2.1
Instance details Defined in Text.ParserCombinators.ReadPrec Methods fmap :: (a -> b) -> ReadPrec a -> ReadPrec b # (<$) :: a -> ReadPrec b -> ReadPrec a #
Functor ReadP	Since: base-2.1
Instance details Defined in Text.ParserCombinators.ReadP Methods fmap :: (a -> b) -> ReadP a -> ReadP b # (<$) :: a -> ReadP b -> ReadP a #
Functor NonEmpty	Since: base-4.9.0.0
Instance details Defined in GHC.Base Methods fmap :: (a -> b) -> NonEmpty a -> NonEmpty b # (<$) :: a -> NonEmpty b -> NonEmpty a #
Functor Vector
Instance details Defined in Data.Vector Methods fmap :: (a -> b) -> Vector a -> Vector b # (<$) :: a -> Vector b -> Vector a #
Functor Seq
Instance details Defined in Data.Sequence.Internal Methods fmap :: (a -> b) -> Seq a -> Seq b # (<$) :: a -> Seq b -> Seq a #
Functor IntMap
Instance details Defined in Data.IntMap.Internal Methods fmap :: (a -> b) -> IntMap a -> IntMap b # (<$) :: a -> IntMap b -> IntMap a #
Functor Memoized
Instance details Defined in UnliftIO.Memoize Methods fmap :: (a -> b) -> Memoized a -> Memoized b # (<$) :: a -> Memoized b -> Memoized a #
Functor DList
Instance details Defined in Data.DList Methods fmap :: (a -> b) -> DList a -> DList b # (<$) :: a -> DList b -> DList a #
Functor RGB
Instance details Defined in Data.Colour.RGB Methods fmap :: (a -> b) -> RGB a -> RGB b # (<$) :: a -> RGB b -> RGB a #
Functor Flush
Instance details Defined in Data.Conduit.Internal.Conduit Methods fmap :: (a -> b) -> Flush a -> Flush b # (<$) :: a -> Flush b -> Flush a #
Functor Tree
Instance details Defined in Data.Tree Methods fmap :: (a -> b) -> Tree a -> Tree b # (<$) :: a -> Tree b -> Tree a #
Functor FingerTree
Instance details Defined in Data.Sequence.Internal Methods fmap :: (a -> b) -> FingerTree a -> FingerTree b # (<$) :: a -> FingerTree b -> FingerTree a #
Functor Digit
Instance details Defined in Data.Sequence.Internal Methods fmap :: (a -> b) -> Digit a -> Digit b # (<$) :: a -> Digit b -> Digit a #
Functor Node
Instance details Defined in Data.Sequence.Internal Methods fmap :: (a -> b) -> Node a -> Node b # (<$) :: a -> Node b -> Node a #
Functor Elem
Instance details Defined in Data.Sequence.Internal Methods fmap :: (a -> b) -> Elem a -> Elem b # (<$) :: a -> Elem b -> Elem a #
Functor ViewL
Instance details Defined in Data.Sequence.Internal Methods fmap :: (a -> b) -> ViewL a -> ViewL b # (<$) :: a -> ViewL b -> ViewL a #
Functor ViewR
Instance details Defined in Data.Sequence.Internal Methods fmap :: (a -> b) -> ViewR a -> ViewR b # (<$) :: a -> ViewR b -> ViewR a #
Functor FocusList
Instance details Defined in Data.FocusList Methods fmap :: (a -> b) -> FocusList a -> FocusList b # (<$) :: a -> FocusList b -> FocusList a #
Functor ScopeM
Instance details Defined in Text.Heterocephalus Methods fmap :: (a -> b) -> ScopeM a -> ScopeM b # (<$) :: a -> ScopeM b -> ScopeM a #
Functor Doc
Instance details Defined in Text.PrettyPrint.Annotated.HughesPJ Methods fmap :: (a -> b) -> Doc a -> Doc b # (<$) :: a -> Doc b -> Doc a #
Functor AnnotDetails
Instance details Defined in Text.PrettyPrint.Annotated.HughesPJ Methods fmap :: (a -> b) -> AnnotDetails a -> AnnotDetails b # (<$) :: a -> AnnotDetails b -> AnnotDetails a #
Functor Span
Instance details Defined in Text.PrettyPrint.Annotated.HughesPJ Methods fmap :: (a -> b) -> Span a -> Span b # (<$) :: a -> Span b -> Span a #
Functor SmallArray
Instance details Defined in Data.Primitive.SmallArray Methods fmap :: (a -> b) -> SmallArray a -> SmallArray b # (<$) :: a -> SmallArray b -> SmallArray a #
Functor Array
Instance details Defined in Data.Primitive.Array Methods fmap :: (a -> b) -> Array a -> Array b # (<$) :: a -> Array b -> Array a #
Functor Flat
Instance details Defined in UnliftIO.Internals.Async Methods fmap :: (a -> b) -> Flat a -> Flat b # (<$) :: a -> Flat b -> Flat a #
Functor FlatApp
Instance details Defined in UnliftIO.Internals.Async Methods fmap :: (a -> b) -> FlatApp a -> FlatApp b # (<$) :: a -> FlatApp b -> FlatApp a #
Functor Id
Instance details Defined in Data.Vector.Fusion.Util Methods fmap :: (a -> b) -> Id a -> Id b # (<$) :: a -> Id b -> Id a #
Functor Box
Instance details Defined in Data.Vector.Fusion.Util Methods fmap :: (a -> b) -> Box a -> Box b # (<$) :: a -> Box b -> Box a #
Functor P	Since: base-4.8.0.0
Instance details Defined in Text.ParserCombinators.ReadP Methods fmap :: (a -> b) -> P a -> P b # (<$) :: a -> P b -> P a #
Functor Option Source #
Instance details Defined in Termonad.Types Methods fmap :: (a -> b) -> Option a -> Option b # (<$) :: a -> Option b -> Option a #
Functor ColourConfig Source #
Instance details Defined in Termonad.Config.Colour Methods fmap :: (a -> b) -> ColourConfig a -> ColourConfig b # (<$) :: a -> ColourConfig b -> ColourConfig a #
Functor Palette Source #
Instance details Defined in Termonad.Config.Colour Methods fmap :: (a -> b) -> Palette a -> Palette b # (<$) :: a -> Palette b -> Palette a #
Functor (Either a)	Since: base-3.0
Instance details Defined in Data.Either Methods fmap :: (a0 -> b) -> Either a a0 -> Either a b # (<$) :: a0 -> Either a b -> Either a a0 #
Functor (V1 :: Type -> Type)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods fmap :: (a -> b) -> V1 a -> V1 b # (<$) :: a -> V1 b -> V1 a #
Functor (U1 :: Type -> Type)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods fmap :: (a -> b) -> U1 a -> U1 b # (<$) :: a -> U1 b -> U1 a #
Functor ((,) a)	Since: base-2.1
Instance details Defined in GHC.Base Methods fmap :: (a0 -> b) -> (a, a0) -> (a, b) # (<$) :: a0 -> (a, b) -> (a, a0) #
Functor (ST s)	Since: base-2.1
Instance details Defined in GHC.ST Methods fmap :: (a -> b) -> ST s a -> ST s b # (<$) :: a -> ST s b -> ST s a #
Functor (Map k)
Instance details Defined in Data.Map.Internal Methods fmap :: (a -> b) -> Map k a -> Map k b # (<$) :: a -> Map k b -> Map k a #
Functor f => Functor (Co f)
Instance details Defined in Data.Functor.Rep Methods fmap :: (a -> b) -> Co f a -> Co f b # (<$) :: a -> Co f b -> Co f a #
Functor (HashMap k)
Instance details Defined in Data.HashMap.Base Methods fmap :: (a -> b) -> HashMap k a -> HashMap k b # (<$) :: a -> HashMap k b -> HashMap k a #
Functor (Array i)	Since: base-2.1
Instance details Defined in GHC.Arr Methods fmap :: (a -> b) -> Array i a -> Array i b # (<$) :: a -> Array i b -> Array i a #
Functor (IResult i)
Instance details Defined in Data.Attoparsec.Internal.Types Methods fmap :: (a -> b) -> IResult i a -> IResult i b # (<$) :: a -> IResult i b -> IResult i a #
Functor (Parser i)
Instance details Defined in Data.Attoparsec.Internal.Types Methods fmap :: (a -> b) -> Parser i a -> Parser i b # (<$) :: a -> Parser i b -> Parser i a #
Functor (Arg a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods fmap :: (a0 -> b) -> Arg a a0 -> Arg a b # (<$) :: a0 -> Arg a b -> Arg a a0 #
Monad m => Functor (WrappedMonad m)	Since: base-2.1
Instance details Defined in Control.Applicative Methods fmap :: (a -> b) -> WrappedMonad m a -> WrappedMonad m b # (<$) :: a -> WrappedMonad m b -> WrappedMonad m a #
Arrow a => Functor (ArrowMonad a)	Since: base-4.6.0.0
Instance details Defined in Control.Arrow Methods fmap :: (a0 -> b) -> ArrowMonad a a0 -> ArrowMonad a b # (<$) :: a0 -> ArrowMonad a b -> ArrowMonad a a0 #
Functor (Proxy :: Type -> Type)	Since: base-4.7.0.0
Instance details Defined in Data.Proxy Methods fmap :: (a -> b) -> Proxy a -> Proxy b # (<$) :: a -> Proxy b -> Proxy a #
Functor m => Functor (Conc m)
Instance details Defined in UnliftIO.Internals.Async Methods fmap :: (a -> b) -> Conc m a -> Conc m b # (<$) :: a -> Conc m b -> Conc m a #
Monad m => Functor (Concurrently m)	Since: unliftio-0.1.0.0
Instance details Defined in UnliftIO.Internals.Async Methods fmap :: (a -> b) -> Concurrently m a -> Concurrently m b # (<$) :: a -> Concurrently m b -> Concurrently m a #
Functor m => Functor (MaybeT m)
Instance details Defined in Control.Monad.Trans.Maybe Methods fmap :: (a -> b) -> MaybeT m a -> MaybeT m b # (<$) :: a -> MaybeT m b -> MaybeT m a #
Monad m => Functor (ZipSource m)
Instance details Defined in Data.Conduit.Internal.Conduit Methods fmap :: (a -> b) -> ZipSource m a -> ZipSource m b # (<$) :: a -> ZipSource m b -> ZipSource m a #
Functor m => Functor (ResourceT m)
Instance details Defined in Control.Monad.Trans.Resource.Internal Methods fmap :: (a -> b) -> ResourceT m a -> ResourceT m b # (<$) :: a -> ResourceT m b -> ResourceT m a #
Functor f => Functor (Cofree f)
Instance details Defined in Control.Comonad.Cofree Methods fmap :: (a -> b) -> Cofree f a -> Cofree f b # (<$) :: a -> Cofree f b -> Cofree f a #
Functor f => Functor (Free f)
Instance details Defined in Control.Monad.Free Methods fmap :: (a -> b) -> Free f a -> Free f b # (<$) :: a -> Free f b -> Free f a #
Functor (Yoneda f)
Instance details Defined in Data.Functor.Yoneda Methods fmap :: (a -> b) -> Yoneda f a -> Yoneda f b # (<$) :: a -> Yoneda f b -> Yoneda f a #
Functor (ReifiedGetter s)
Instance details Defined in Control.Lens.Reified Methods fmap :: (a -> b) -> ReifiedGetter s a -> ReifiedGetter s b # (<$) :: a -> ReifiedGetter s b -> ReifiedGetter s a #
Functor (ReifiedFold s)
Instance details Defined in Control.Lens.Reified Methods fmap :: (a -> b) -> ReifiedFold s a -> ReifiedFold s b # (<$) :: a -> ReifiedFold s b -> ReifiedFold s a #
Functor f => Functor (Indexing f)
Instance details Defined in Control.Lens.Internal.Indexed Methods fmap :: (a -> b) -> Indexing f a -> Indexing f b # (<$) :: a -> Indexing f b -> Indexing f a #
Functor f => Functor (Indexing64 f)
Instance details Defined in Control.Lens.Internal.Indexed Methods fmap :: (a -> b) -> Indexing64 f a -> Indexing64 f b # (<$) :: a -> Indexing64 f b -> Indexing64 f a #
Functor m => Functor (ListT m)
Instance details Defined in Control.Monad.Trans.List Methods fmap :: (a -> b) -> ListT m a -> ListT m b # (<$) :: a -> ListT m b -> ListT m a #
Profunctor p => Functor (Prep p)
Instance details Defined in Data.Profunctor.Rep Methods fmap :: (a -> b) -> Prep p a -> Prep p b # (<$) :: a -> Prep p b -> Prep p a #
Profunctor p => Functor (Coprep p)
Instance details Defined in Data.Profunctor.Rep Methods fmap :: (a -> b) -> Coprep p a -> Coprep p b # (<$) :: a -> Coprep p b -> Coprep p a #
Functor f => Functor (WrappedApplicative f)
Instance details Defined in Data.Functor.Bind.Class Methods fmap :: (a -> b) -> WrappedApplicative f a -> WrappedApplicative f b # (<$) :: a -> WrappedApplicative f b -> WrappedApplicative f a #
Functor f => Functor (MaybeApply f)
Instance details Defined in Data.Functor.Bind.Class Methods fmap :: (a -> b) -> MaybeApply f a -> MaybeApply f b # (<$) :: a -> MaybeApply f b -> MaybeApply f a #
Functor q => Functor (DsM q)
Instance details Defined in Language.Haskell.TH.Desugar.Reify Methods fmap :: (a -> b) -> DsM q a -> DsM q b # (<$) :: a -> DsM q b -> DsM q a #
Functor (StateL s)
Instance details Defined in Data.Key Methods fmap :: (a -> b) -> StateL s a -> StateL s b # (<$) :: a -> StateL s b -> StateL s a #
Functor (StateR s)
Instance details Defined in Data.Key Methods fmap :: (a -> b) -> StateR s a -> StateR s b # (<$) :: a -> StateR s b -> StateR s a #
Functor f => Functor (Act f)
Instance details Defined in Data.Key Methods fmap :: (a -> b) -> Act f a -> Act f b # (<$) :: a -> Act f b -> Act f a #
Functor (SetM s)
Instance details Defined in Data.Graph Methods fmap :: (a -> b) -> SetM s a -> SetM s b # (<$) :: a -> SetM s b -> SetM s a #
SingI ns => Functor (Matrix ns) Source #
Instance details Defined in Termonad.Config.Vec Methods fmap :: (a -> b) -> Matrix ns a -> Matrix ns b # (<$) :: a -> Matrix ns b -> Matrix ns a #
Functor (Vec n) Source #
Instance details Defined in Termonad.Config.Vec Methods fmap :: (a -> b) -> Vec n a -> Vec n b # (<$) :: a -> Vec n b -> Vec n a #
Functor f => Functor (Rec1 f)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods fmap :: (a -> b) -> Rec1 f a -> Rec1 f b # (<$) :: a -> Rec1 f b -> Rec1 f a #
Functor (URec Char :: Type -> Type)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods fmap :: (a -> b) -> URec Char a -> URec Char b # (<$) :: a -> URec Char b -> URec Char a #
Functor (URec Double :: Type -> Type)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods fmap :: (a -> b) -> URec Double a -> URec Double b # (<$) :: a -> URec Double b -> URec Double a #
Functor (URec Float :: Type -> Type)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods fmap :: (a -> b) -> URec Float a -> URec Float b # (<$) :: a -> URec Float b -> URec Float a #
Functor (URec Int :: Type -> Type)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods fmap :: (a -> b) -> URec Int a -> URec Int b # (<$) :: a -> URec Int b -> URec Int a #
Functor (URec Word :: Type -> Type)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods fmap :: (a -> b) -> URec Word a -> URec Word b # (<$) :: a -> URec Word b -> URec Word a #
Functor (URec (Ptr ()) :: Type -> Type)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods fmap :: (a -> b) -> URec (Ptr ()) a -> URec (Ptr ()) b # (<$) :: a -> URec (Ptr ()) b -> URec (Ptr ()) a #
Arrow a => Functor (WrappedArrow a b)	Since: base-2.1
Instance details Defined in Control.Applicative Methods fmap :: (a0 -> b0) -> WrappedArrow a b a0 -> WrappedArrow a b b0 # (<$) :: a0 -> WrappedArrow a b b0 -> WrappedArrow a b a0 #
Functor (Const m :: Type -> Type)	Since: base-2.1
Instance details Defined in Data.Functor.Const Methods fmap :: (a -> b) -> Const m a -> Const m b # (<$) :: a -> Const m b -> Const m a #
Functor f => Functor (Ap f)	Since: base-4.12.0.0
Instance details Defined in Data.Monoid Methods fmap :: (a -> b) -> Ap f a -> Ap f b # (<$) :: a -> Ap f b -> Ap f a #
Functor f => Functor (Alt f)	Since: base-4.8.0.0
Instance details Defined in Data.Semigroup.Internal Methods fmap :: (a -> b) -> Alt f a -> Alt f b # (<$) :: a -> Alt f b -> Alt f a #
Bifunctor p => Functor (Join p)
Instance details Defined in Data.Bifunctor.Join Methods fmap :: (a -> b) -> Join p a -> Join p b # (<$) :: a -> Join p b -> Join p a #
Bifunctor p => Functor (Fix p)
Instance details Defined in Data.Bifunctor.Fix Methods fmap :: (a -> b) -> Fix p a -> Fix p b # (<$) :: a -> Fix p b -> Fix p a #
Functor m => Functor (ReaderT r m)
Instance details Defined in Control.Monad.Trans.Reader Methods fmap :: (a -> b) -> ReaderT r m a -> ReaderT r m b # (<$) :: a -> ReaderT r m b -> ReaderT r m a #
Functor w => Functor (TracedT m w)
Instance details Defined in Control.Comonad.Trans.Traced Methods fmap :: (a -> b) -> TracedT m w a -> TracedT m w b # (<$) :: a -> TracedT m w b -> TracedT m w a #
Functor w => Functor (StoreT s w)
Instance details Defined in Control.Comonad.Trans.Store Methods fmap :: (a -> b) -> StoreT s w a -> StoreT s w b # (<$) :: a -> StoreT s w b -> StoreT s w a #
Functor w => Functor (EnvT e w)
Instance details Defined in Control.Comonad.Trans.Env Methods fmap :: (a -> b) -> EnvT e w a -> EnvT e w b # (<$) :: a -> EnvT e w b -> EnvT e w a #
Functor m => Functor (IdentityT m)
Instance details Defined in Control.Monad.Trans.Identity Methods fmap :: (a -> b) -> IdentityT m a -> IdentityT m b # (<$) :: a -> IdentityT m b -> IdentityT m a #
Functor m => Functor (WriterT w m)
Instance details Defined in Control.Monad.Trans.Writer.Strict Methods fmap :: (a -> b) -> WriterT w m a -> WriterT w m b # (<$) :: a -> WriterT w m b -> WriterT w m a #
Functor m => Functor (WriterT w m)
Instance details Defined in Control.Monad.Trans.Writer.Lazy Methods fmap :: (a -> b) -> WriterT w m a -> WriterT w m b # (<$) :: a -> WriterT w m b -> WriterT w m a #
Functor m => Functor (StateT s m)
Instance details Defined in Control.Monad.Trans.State.Strict Methods fmap :: (a -> b) -> StateT s m a -> StateT s m b # (<$) :: a -> StateT s m b -> StateT s m a #
Functor m => Functor (StateT s m)
Instance details Defined in Control.Monad.Trans.State.Lazy Methods fmap :: (a -> b) -> StateT s m a -> StateT s m b # (<$) :: a -> StateT s m b -> StateT s m a #
Monad m => Functor (ZipSink i m)
Instance details Defined in Data.Conduit.Internal.Conduit Methods fmap :: (a -> b) -> ZipSink i m a -> ZipSink i m b # (<$) :: a -> ZipSink i m b -> ZipSink i m a #
(Applicative f, Monad f) => Functor (WhenMissing f x)	Since: containers-0.5.9
Instance details Defined in Data.IntMap.Internal Methods fmap :: (a -> b) -> WhenMissing f x a -> WhenMissing f x b # (<$) :: a -> WhenMissing f x b -> WhenMissing f x a #
Functor f => Functor (FreeF f a)
Instance details Defined in Control.Monad.Trans.Free Methods fmap :: (a0 -> b) -> FreeF f a a0 -> FreeF f a b # (<$) :: a0 -> FreeF f a b -> FreeF f a a0 #
(Functor f, Monad m) => Functor (FreeT f m)
Instance details Defined in Control.Monad.Trans.Free Methods fmap :: (a -> b) -> FreeT f m a -> FreeT f m b # (<$) :: a -> FreeT f m b -> FreeT f m a #
Functor f => Functor (CofreeF f a)
Instance details Defined in Control.Comonad.Trans.Cofree Methods fmap :: (a0 -> b) -> CofreeF f a a0 -> CofreeF f a b # (<$) :: a0 -> CofreeF f a b -> CofreeF f a a0 #
(Functor f, Functor w) => Functor (CofreeT f w)
Instance details Defined in Control.Comonad.Trans.Cofree Methods fmap :: (a -> b) -> CofreeT f w a -> CofreeT f w b # (<$) :: a -> CofreeT f w b -> CofreeT f w a #
Functor (Day f g)
Instance details Defined in Data.Functor.Day Methods fmap :: (a -> b) -> Day f g a -> Day f g b # (<$) :: a -> Day f g b -> Day f g a #
Functor m => Functor (ErrorT e m)
Instance details Defined in Control.Monad.Trans.Error Methods fmap :: (a -> b) -> ErrorT e m a -> ErrorT e m b # (<$) :: a -> ErrorT e m b -> ErrorT e m a #
Functor (ReifiedIndexedGetter i s)
Instance details Defined in Control.Lens.Reified Methods fmap :: (a -> b) -> ReifiedIndexedGetter i s a -> ReifiedIndexedGetter i s b # (<$) :: a -> ReifiedIndexedGetter i s b -> ReifiedIndexedGetter i s a #
Functor (ReifiedIndexedFold i s)
Instance details Defined in Control.Lens.Reified Methods fmap :: (a -> b) -> ReifiedIndexedFold i s a -> ReifiedIndexedFold i s b # (<$) :: a -> ReifiedIndexedFold i s b -> ReifiedIndexedFold i s a #
Functor (Indexed i a)
Instance details Defined in Control.Lens.Internal.Indexed Methods fmap :: (a0 -> b) -> Indexed i a a0 -> Indexed i a b # (<$) :: a0 -> Indexed i a b -> Indexed i a a0 #
Profunctor p => Functor (TambaraSum p a)
Instance details Defined in Data.Profunctor.Choice Methods fmap :: (a0 -> b) -> TambaraSum p a a0 -> TambaraSum p a b # (<$) :: a0 -> TambaraSum p a b -> TambaraSum p a a0 #
Functor (CotambaraSum p a)
Instance details Defined in Data.Profunctor.Choice Methods fmap :: (a0 -> b) -> CotambaraSum p a a0 -> CotambaraSum p a b # (<$) :: a0 -> CotambaraSum p a b -> CotambaraSum p a a0 #
Functor f => Functor (Static f a)
Instance details Defined in Data.Semigroupoid.Static Methods fmap :: (a0 -> b) -> Static f a a0 -> Static f a b # (<$) :: a0 -> Static f a b -> Static f a a0 #
Functor (Tagged s)
Instance details Defined in Data.Tagged Methods fmap :: (a -> b) -> Tagged s a -> Tagged s b # (<$) :: a -> Tagged s b -> Tagged s a #
Monad m => Functor (Bundle m v)
Instance details Defined in Data.Vector.Fusion.Bundle.Monadic Methods fmap :: (a -> b) -> Bundle m v a -> Bundle m v b # (<$) :: a -> Bundle m v b -> Bundle m v a #
Functor ((->) r :: Type -> Type)	Since: base-2.1
Instance details Defined in GHC.Base Methods fmap :: (a -> b) -> (r -> a) -> r -> b # (<$) :: a -> (r -> b) -> r -> a #
Functor (K1 i c :: Type -> Type)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods fmap :: (a -> b) -> K1 i c a -> K1 i c b # (<$) :: a -> K1 i c b -> K1 i c a #
(Functor f, Functor g) => Functor (f :+: g)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods fmap :: (a -> b) -> (f :+: g) a -> (f :+: g) b # (<$) :: a -> (f :+: g) b -> (f :+: g) a #
(Functor f, Functor g) => Functor (f :*: g)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods fmap :: (a -> b) -> (f :: g) a -> (f :: g) b # (<$) :: a -> (f :: g) b -> (f :: g) a #
(Functor f, Functor g) => Functor (Product f g)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Product Methods fmap :: (a -> b) -> Product f g a -> Product f g b # (<$) :: a -> Product f g b -> Product f g a #
(Functor f, Functor g) => Functor (Sum f g)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Sum Methods fmap :: (a -> b) -> Sum f g a -> Sum f g b # (<$) :: a -> Sum f g b -> Sum f g a #
Functor (Cokleisli w a)
Instance details Defined in Control.Comonad Methods fmap :: (a0 -> b) -> Cokleisli w a a0 -> Cokleisli w a b # (<$) :: a0 -> Cokleisli w a b -> Cokleisli w a a0 #
Functor (ConduitT i o m)
Instance details Defined in Data.Conduit.Internal.Conduit Methods fmap :: (a -> b) -> ConduitT i o m a -> ConduitT i o m b # (<$) :: a -> ConduitT i o m b -> ConduitT i o m a #
Functor (ZipConduit i o m)
Instance details Defined in Data.Conduit.Internal.Conduit Methods fmap :: (a -> b) -> ZipConduit i o m a -> ZipConduit i o m b # (<$) :: a -> ZipConduit i o m b -> ZipConduit i o m a #
Functor f => Functor (WhenMatched f x y)	Since: containers-0.5.9
Instance details Defined in Data.IntMap.Internal Methods fmap :: (a -> b) -> WhenMatched f x y a -> WhenMatched f x y b # (<$) :: a -> WhenMatched f x y b -> WhenMatched f x y a #
(Applicative f, Monad f) => Functor (WhenMissing f k x)	Since: containers-0.5.9
Instance details Defined in Data.Map.Internal Methods fmap :: (a -> b) -> WhenMissing f k x a -> WhenMissing f k x b # (<$) :: a -> WhenMissing f k x b -> WhenMissing f k x a #
Functor (ContT r m)
Instance details Defined in Control.Monad.Trans.Cont Methods fmap :: (a -> b) -> ContT r m a -> ContT r m b # (<$) :: a -> ContT r m b -> ContT r m a #
Profunctor p => Functor (Procompose p q a)
Instance details Defined in Data.Profunctor.Composition Methods fmap :: (a0 -> b) -> Procompose p q a a0 -> Procompose p q a b # (<$) :: a0 -> Procompose p q a b -> Procompose p q a a0 #
Profunctor p => Functor (Rift p q a)
Instance details Defined in Data.Profunctor.Composition Methods fmap :: (a0 -> b) -> Rift p q a a0 -> Rift p q a b # (<$) :: a0 -> Rift p q a b -> Rift p q a a0 #
Functor f => Functor (M1 i c f)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods fmap :: (a -> b) -> M1 i c f a -> M1 i c f b # (<$) :: a -> M1 i c f b -> M1 i c f a #
(Functor f, Functor g) => Functor (f :.: g)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods fmap :: (a -> b) -> (f :.: g) a -> (f :.: g) b # (<$) :: a -> (f :.: g) b -> (f :.: g) a #
(Functor f, Functor g) => Functor (Compose f g)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Compose Methods fmap :: (a -> b) -> Compose f g a -> Compose f g b # (<$) :: a -> Compose f g b -> Compose f g a #
Bifunctor p => Functor (WrappedBifunctor p a)
Instance details Defined in Data.Bifunctor.Wrapped Methods fmap :: (a0 -> b) -> WrappedBifunctor p a a0 -> WrappedBifunctor p a b # (<$) :: a0 -> WrappedBifunctor p a b -> WrappedBifunctor p a a0 #
Functor g => Functor (Joker g a)
Instance details Defined in Data.Bifunctor.Joker Methods fmap :: (a0 -> b) -> Joker g a a0 -> Joker g a b # (<$) :: a0 -> Joker g a b -> Joker g a a0 #
Bifunctor p => Functor (Flip p a)
Instance details Defined in Data.Bifunctor.Flip Methods fmap :: (a0 -> b) -> Flip p a a0 -> Flip p a b # (<$) :: a0 -> Flip p a b -> Flip p a a0 #
Functor (Clown f a :: Type -> Type)
Instance details Defined in Data.Bifunctor.Clown Methods fmap :: (a0 -> b) -> Clown f a a0 -> Clown f a b # (<$) :: a0 -> Clown f a b -> Clown f a a0 #
Functor m => Functor (RWST r w s m)
Instance details Defined in Control.Monad.Trans.RWS.Strict Methods fmap :: (a -> b) -> RWST r w s m a -> RWST r w s m b # (<$) :: a -> RWST r w s m b -> RWST r w s m a #
Functor m => Functor (RWST r w s m)
Instance details Defined in Control.Monad.Trans.RWS.Lazy Methods fmap :: (a -> b) -> RWST r w s m a -> RWST r w s m b # (<$) :: a -> RWST r w s m b -> RWST r w s m a #
Functor f => Functor (WhenMatched f k x y)	Since: containers-0.5.9
Instance details Defined in Data.Map.Internal Methods fmap :: (a -> b) -> WhenMatched f k x y a -> WhenMatched f k x y b # (<$) :: a -> WhenMatched f k x y b -> WhenMatched f k x y a #
Reifies s (ReifiedApplicative f) => Functor (ReflectedApplicative f s)
Instance details Defined in Data.Reflection Methods fmap :: (a -> b) -> ReflectedApplicative f s a -> ReflectedApplicative f s b # (<$) :: a -> ReflectedApplicative f s b -> ReflectedApplicative f s a #
Monad m => Functor (Pipe l i o u m)
Instance details Defined in Data.Conduit.Internal.Pipe Methods fmap :: (a -> b) -> Pipe l i o u m a -> Pipe l i o u m b # (<$) :: a -> Pipe l i o u m b -> Pipe l i o u m a #
(Functor f, Bifunctor p) => Functor (Tannen f p a)
Instance details Defined in Data.Bifunctor.Tannen Methods fmap :: (a0 -> b) -> Tannen f p a a0 -> Tannen f p a b # (<$) :: a0 -> Tannen f p a b -> Tannen f p a a0 #
(Bifunctor p, Functor g) => Functor (Biff p f g a)
Instance details Defined in Data.Bifunctor.Biff Methods fmap :: (a0 -> b) -> Biff p f g a a0 -> Biff p f g a b # (<$) :: a0 -> Biff p f g a b -> Biff p f g a a0 #

class Num a where #

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 + x
fromInteger 0 is the additive identity: x + fromInteger 0 = x
negate gives the additive inverse: x + negate x = fromInteger 0
Associativity of (*): (x * y) * z = x * (y * z)
fromInteger 1 is the multiplicative identity: x * fromInteger 1 = x and fromInteger 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.

Minimal complete definition

(+), (*), abs, signum, fromInteger, (negate | (-))

Methods

(+) :: a -> a -> a infixl 6 #

(-) :: a -> a -> a infixl 6 #

(*) :: a -> a -> a infixl 7 #

negate :: a -> a #

Unary negation.

abs :: a -> a #

Absolute value.

signum :: a -> a #

Sign of a number. The functions abs and signum should satisfy the law:

abs x * signum x == x

For real numbers, the signum is either -1 (negative), 0 (zero) or 1 (positive).

fromInteger :: Integer -> a #

Conversion from an Integer. An integer literal represents the application of the function fromInteger to the appropriate value of type Integer, so such literals have type (Num a) => a.

Instances

Num Int	Since: base-2.1
Instance details Defined in GHC.Num Methods (+) :: Int -> Int -> Int # (-) :: Int -> Int -> Int # (*) :: Int -> Int -> Int # negate :: Int -> Int # abs :: Int -> Int # signum :: Int -> Int # fromInteger :: Integer -> Int #
Num Int8	Since: base-2.1
Instance details Defined in GHC.Int Methods (+) :: Int8 -> Int8 -> Int8 # (-) :: Int8 -> Int8 -> Int8 # (*) :: Int8 -> Int8 -> Int8 # negate :: Int8 -> Int8 # abs :: Int8 -> Int8 # signum :: Int8 -> Int8 # fromInteger :: Integer -> Int8 #
Num Int16	Since: base-2.1
Instance details Defined in GHC.Int Methods (+) :: Int16 -> Int16 -> Int16 # (-) :: Int16 -> Int16 -> Int16 # (*) :: Int16 -> Int16 -> Int16 # negate :: Int16 -> Int16 # abs :: Int16 -> Int16 # signum :: Int16 -> Int16 # fromInteger :: Integer -> Int16 #
Num Int32	Since: base-2.1
Instance details Defined in GHC.Int Methods (+) :: Int32 -> Int32 -> Int32 # (-) :: Int32 -> Int32 -> Int32 # (*) :: Int32 -> Int32 -> Int32 # negate :: Int32 -> Int32 # abs :: Int32 -> Int32 # signum :: Int32 -> Int32 # fromInteger :: Integer -> Int32 #
Num Int64	Since: base-2.1
Instance details Defined in GHC.Int Methods (+) :: Int64 -> Int64 -> Int64 # (-) :: Int64 -> Int64 -> Int64 # (*) :: Int64 -> Int64 -> Int64 # negate :: Int64 -> Int64 # abs :: Int64 -> Int64 # signum :: Int64 -> Int64 # fromInteger :: Integer -> Int64 #
Num Integer	Since: base-2.1
Instance details Defined in GHC.Num Methods (+) :: Integer -> Integer -> Integer # (-) :: Integer -> Integer -> Integer # (*) :: Integer -> Integer -> Integer # negate :: Integer -> Integer # abs :: Integer -> Integer # signum :: Integer -> Integer # fromInteger :: Integer -> Integer #
Num Natural	Note that `Natural`'s `Num` instance isn't a ring: no element but 0 has an additive inverse. It is a semiring though. Since: base-4.8.0.0
Instance details Defined in GHC.Num Methods (+) :: Natural -> Natural -> Natural # (-) :: Natural -> Natural -> Natural # (*) :: Natural -> Natural -> Natural # negate :: Natural -> Natural # abs :: Natural -> Natural # signum :: Natural -> Natural # fromInteger :: Integer -> Natural #
Num Word	Since: base-2.1
Instance details Defined in GHC.Num Methods (+) :: Word -> Word -> Word # (-) :: Word -> Word -> Word # (*) :: Word -> Word -> Word # negate :: Word -> Word # abs :: Word -> Word # signum :: Word -> Word # fromInteger :: Integer -> Word #
Num Word8	Since: base-2.1
Instance details Defined in GHC.Word Methods (+) :: Word8 -> Word8 -> Word8 # (-) :: Word8 -> Word8 -> Word8 # (*) :: Word8 -> Word8 -> Word8 # negate :: Word8 -> Word8 # abs :: Word8 -> Word8 # signum :: Word8 -> Word8 # fromInteger :: Integer -> Word8 #
Num Word16	Since: base-2.1
Instance details Defined in GHC.Word Methods (+) :: Word16 -> Word16 -> Word16 # (-) :: Word16 -> Word16 -> Word16 # (*) :: Word16 -> Word16 -> Word16 # negate :: Word16 -> Word16 # abs :: Word16 -> Word16 # signum :: Word16 -> Word16 # fromInteger :: Integer -> Word16 #
Num Word32	Since: base-2.1
Instance details Defined in GHC.Word Methods (+) :: Word32 -> Word32 -> Word32 # (-) :: Word32 -> Word32 -> Word32 # (*) :: Word32 -> Word32 -> Word32 # negate :: Word32 -> Word32 # abs :: Word32 -> Word32 # signum :: Word32 -> Word32 # fromInteger :: Integer -> Word32 #
Num Word64	Since: base-2.1
Instance details Defined in GHC.Word Methods (+) :: Word64 -> Word64 -> Word64 # (-) :: Word64 -> Word64 -> Word64 # (*) :: Word64 -> Word64 -> Word64 # negate :: Word64 -> Word64 # abs :: Word64 -> Word64 # signum :: Word64 -> Word64 # fromInteger :: Integer -> Word64 #
Num Peano Source #
Instance details Defined in Termonad.Config.Vec Methods (+) :: Peano -> Peano -> Peano # (-) :: Peano -> Peano -> Peano # (*) :: Peano -> Peano -> Peano # negate :: Peano -> Peano # abs :: Peano -> Peano # signum :: Peano -> Peano # fromInteger :: Integer -> Peano #
Num Pos
Instance details Defined in Data.Attoparsec.Internal.Types Methods (+) :: Pos -> Pos -> Pos # (-) :: Pos -> Pos -> Pos # (*) :: Pos -> Pos -> Pos # negate :: Pos -> Pos # abs :: Pos -> Pos # signum :: Pos -> Pos # fromInteger :: Integer -> Pos #
Num CChar
Instance details Defined in Foreign.C.Types Methods (+) :: CChar -> CChar -> CChar # (-) :: CChar -> CChar -> CChar # (*) :: CChar -> CChar -> CChar # negate :: CChar -> CChar # abs :: CChar -> CChar # signum :: CChar -> CChar # fromInteger :: Integer -> CChar #
Num CSChar
Instance details Defined in Foreign.C.Types Methods (+) :: CSChar -> CSChar -> CSChar # (-) :: CSChar -> CSChar -> CSChar # (*) :: CSChar -> CSChar -> CSChar # negate :: CSChar -> CSChar # abs :: CSChar -> CSChar # signum :: CSChar -> CSChar # fromInteger :: Integer -> CSChar #
Num CUChar
Instance details Defined in Foreign.C.Types Methods (+) :: CUChar -> CUChar -> CUChar # (-) :: CUChar -> CUChar -> CUChar # (*) :: CUChar -> CUChar -> CUChar # negate :: CUChar -> CUChar # abs :: CUChar -> CUChar # signum :: CUChar -> CUChar # fromInteger :: Integer -> CUChar #
Num CShort
Instance details Defined in Foreign.C.Types Methods (+) :: CShort -> CShort -> CShort # (-) :: CShort -> CShort -> CShort # (*) :: CShort -> CShort -> CShort # negate :: CShort -> CShort # abs :: CShort -> CShort # signum :: CShort -> CShort # fromInteger :: Integer -> CShort #
Num CUShort
Instance details Defined in Foreign.C.Types Methods (+) :: CUShort -> CUShort -> CUShort # (-) :: CUShort -> CUShort -> CUShort # (*) :: CUShort -> CUShort -> CUShort # negate :: CUShort -> CUShort # abs :: CUShort -> CUShort # signum :: CUShort -> CUShort # fromInteger :: Integer -> CUShort #
Num CInt
Instance details Defined in Foreign.C.Types Methods (+) :: CInt -> CInt -> CInt # (-) :: CInt -> CInt -> CInt # (*) :: CInt -> CInt -> CInt # negate :: CInt -> CInt # abs :: CInt -> CInt # signum :: CInt -> CInt # fromInteger :: Integer -> CInt #
Num CUInt
Instance details Defined in Foreign.C.Types Methods (+) :: CUInt -> CUInt -> CUInt # (-) :: CUInt -> CUInt -> CUInt # (*) :: CUInt -> CUInt -> CUInt # negate :: CUInt -> CUInt # abs :: CUInt -> CUInt # signum :: CUInt -> CUInt # fromInteger :: Integer -> CUInt #
Num CLong
Instance details Defined in Foreign.C.Types Methods (+) :: CLong -> CLong -> CLong # (-) :: CLong -> CLong -> CLong # (*) :: CLong -> CLong -> CLong # negate :: CLong -> CLong # abs :: CLong -> CLong # signum :: CLong -> CLong # fromInteger :: Integer -> CLong #
Num CULong
Instance details Defined in Foreign.C.Types Methods (+) :: CULong -> CULong -> CULong # (-) :: CULong -> CULong -> CULong # (*) :: CULong -> CULong -> CULong # negate :: CULong -> CULong # abs :: CULong -> CULong # signum :: CULong -> CULong # fromInteger :: Integer -> CULong #
Num CLLong
Instance details Defined in Foreign.C.Types Methods (+) :: CLLong -> CLLong -> CLLong # (-) :: CLLong -> CLLong -> CLLong # (*) :: CLLong -> CLLong -> CLLong # negate :: CLLong -> CLLong # abs :: CLLong -> CLLong # signum :: CLLong -> CLLong # fromInteger :: Integer -> CLLong #
Num CULLong
Instance details Defined in Foreign.C.Types Methods (+) :: CULLong -> CULLong -> CULLong # (-) :: CULLong -> CULLong -> CULLong # (*) :: CULLong -> CULLong -> CULLong # negate :: CULLong -> CULLong # abs :: CULLong -> CULLong # signum :: CULLong -> CULLong # fromInteger :: Integer -> CULLong #
Num CBool
Instance details Defined in Foreign.C.Types Methods (+) :: CBool -> CBool -> CBool # (-) :: CBool -> CBool -> CBool # (*) :: CBool -> CBool -> CBool # negate :: CBool -> CBool # abs :: CBool -> CBool # signum :: CBool -> CBool # fromInteger :: Integer -> CBool #
Num CFloat
Instance details Defined in Foreign.C.Types Methods (+) :: CFloat -> CFloat -> CFloat # (-) :: CFloat -> CFloat -> CFloat # (*) :: CFloat -> CFloat -> CFloat # negate :: CFloat -> CFloat # abs :: CFloat -> CFloat # signum :: CFloat -> CFloat # fromInteger :: Integer -> CFloat #
Num CDouble
Instance details Defined in Foreign.C.Types Methods (+) :: CDouble -> CDouble -> CDouble # (-) :: CDouble -> CDouble -> CDouble # (*) :: CDouble -> CDouble -> CDouble # negate :: CDouble -> CDouble # abs :: CDouble -> CDouble # signum :: CDouble -> CDouble # fromInteger :: Integer -> CDouble #
Num CPtrdiff
Instance details Defined in Foreign.C.Types Methods (+) :: CPtrdiff -> CPtrdiff -> CPtrdiff # (-) :: CPtrdiff -> CPtrdiff -> CPtrdiff # (*) :: CPtrdiff -> CPtrdiff -> CPtrdiff # negate :: CPtrdiff -> CPtrdiff # abs :: CPtrdiff -> CPtrdiff # signum :: CPtrdiff -> CPtrdiff # fromInteger :: Integer -> CPtrdiff #
Num CSize
Instance details Defined in Foreign.C.Types Methods (+) :: CSize -> CSize -> CSize # (-) :: CSize -> CSize -> CSize # (*) :: CSize -> CSize -> CSize # negate :: CSize -> CSize # abs :: CSize -> CSize # signum :: CSize -> CSize # fromInteger :: Integer -> CSize #
Num CWchar
Instance details Defined in Foreign.C.Types Methods (+) :: CWchar -> CWchar -> CWchar # (-) :: CWchar -> CWchar -> CWchar # (*) :: CWchar -> CWchar -> CWchar # negate :: CWchar -> CWchar # abs :: CWchar -> CWchar # signum :: CWchar -> CWchar # fromInteger :: Integer -> CWchar #
Num CSigAtomic
Instance details Defined in Foreign.C.Types Methods (+) :: CSigAtomic -> CSigAtomic -> CSigAtomic # (-) :: CSigAtomic -> CSigAtomic -> CSigAtomic # (*) :: CSigAtomic -> CSigAtomic -> CSigAtomic # negate :: CSigAtomic -> CSigAtomic # abs :: CSigAtomic -> CSigAtomic # signum :: CSigAtomic -> CSigAtomic # fromInteger :: Integer -> CSigAtomic #
Num CClock
Instance details Defined in Foreign.C.Types Methods (+) :: CClock -> CClock -> CClock # (-) :: CClock -> CClock -> CClock # (*) :: CClock -> CClock -> CClock # negate :: CClock -> CClock # abs :: CClock -> CClock # signum :: CClock -> CClock # fromInteger :: Integer -> CClock #
Num CTime
Instance details Defined in Foreign.C.Types Methods (+) :: CTime -> CTime -> CTime # (-) :: CTime -> CTime -> CTime # (*) :: CTime -> CTime -> CTime # negate :: CTime -> CTime # abs :: CTime -> CTime # signum :: CTime -> CTime # fromInteger :: Integer -> CTime #
Num CUSeconds
Instance details Defined in Foreign.C.Types Methods (+) :: CUSeconds -> CUSeconds -> CUSeconds # (-) :: CUSeconds -> CUSeconds -> CUSeconds # (*) :: CUSeconds -> CUSeconds -> CUSeconds # negate :: CUSeconds -> CUSeconds # abs :: CUSeconds -> CUSeconds # signum :: CUSeconds -> CUSeconds # fromInteger :: Integer -> CUSeconds #
Num CSUSeconds
Instance details Defined in Foreign.C.Types Methods (+) :: CSUSeconds -> CSUSeconds -> CSUSeconds # (-) :: CSUSeconds -> CSUSeconds -> CSUSeconds # (*) :: CSUSeconds -> CSUSeconds -> CSUSeconds # negate :: CSUSeconds -> CSUSeconds # abs :: CSUSeconds -> CSUSeconds # signum :: CSUSeconds -> CSUSeconds # fromInteger :: Integer -> CSUSeconds #
Num CIntPtr
Instance details Defined in Foreign.C.Types Methods (+) :: CIntPtr -> CIntPtr -> CIntPtr # (-) :: CIntPtr -> CIntPtr -> CIntPtr # (*) :: CIntPtr -> CIntPtr -> CIntPtr # negate :: CIntPtr -> CIntPtr # abs :: CIntPtr -> CIntPtr # signum :: CIntPtr -> CIntPtr # fromInteger :: Integer -> CIntPtr #
Num CUIntPtr
Instance details Defined in Foreign.C.Types Methods (+) :: CUIntPtr -> CUIntPtr -> CUIntPtr # (-) :: CUIntPtr -> CUIntPtr -> CUIntPtr # (*) :: CUIntPtr -> CUIntPtr -> CUIntPtr # negate :: CUIntPtr -> CUIntPtr # abs :: CUIntPtr -> CUIntPtr # signum :: CUIntPtr -> CUIntPtr # fromInteger :: Integer -> CUIntPtr #
Num CIntMax
Instance details Defined in Foreign.C.Types Methods (+) :: CIntMax -> CIntMax -> CIntMax # (-) :: CIntMax -> CIntMax -> CIntMax # (*) :: CIntMax -> CIntMax -> CIntMax # negate :: CIntMax -> CIntMax # abs :: CIntMax -> CIntMax # signum :: CIntMax -> CIntMax # fromInteger :: Integer -> CIntMax #
Num CUIntMax
Instance details Defined in Foreign.C.Types Methods (+) :: CUIntMax -> CUIntMax -> CUIntMax # (-) :: CUIntMax -> CUIntMax -> CUIntMax # (*) :: CUIntMax -> CUIntMax -> CUIntMax # negate :: CUIntMax -> CUIntMax # abs :: CUIntMax -> CUIntMax # signum :: CUIntMax -> CUIntMax # fromInteger :: Integer -> CUIntMax #
Num LineNum
Instance details Defined in Text.Pretty.Simple.Internal.ExprToOutput Methods (+) :: LineNum -> LineNum -> LineNum # (-) :: LineNum -> LineNum -> LineNum # (*) :: LineNum -> LineNum -> LineNum # negate :: LineNum -> LineNum # abs :: LineNum -> LineNum # signum :: LineNum -> LineNum # fromInteger :: Integer -> LineNum #
Num NestLevel
Instance details Defined in Text.Pretty.Simple.Internal.Output Methods (+) :: NestLevel -> NestLevel -> NestLevel # (-) :: NestLevel -> NestLevel -> NestLevel # (*) :: NestLevel -> NestLevel -> NestLevel # negate :: NestLevel -> NestLevel # abs :: NestLevel -> NestLevel # signum :: NestLevel -> NestLevel # fromInteger :: Integer -> NestLevel #
Num DiffTime
Instance details Defined in Data.Time.Clock.Internal.DiffTime Methods (+) :: DiffTime -> DiffTime -> DiffTime # (-) :: DiffTime -> DiffTime -> DiffTime # (*) :: DiffTime -> DiffTime -> DiffTime # negate :: DiffTime -> DiffTime # abs :: DiffTime -> DiffTime # signum :: DiffTime -> DiffTime # fromInteger :: Integer -> DiffTime #
Integral a => Num (Ratio a)	Since: base-2.0.1
Instance details Defined in GHC.Real Methods (+) :: Ratio a -> Ratio a -> Ratio a # (-) :: Ratio a -> Ratio a -> Ratio a # (*) :: Ratio a -> Ratio a -> Ratio a # negate :: Ratio a -> Ratio a # abs :: Ratio a -> Ratio a # signum :: Ratio a -> Ratio a # fromInteger :: Integer -> Ratio a #
RealFloat a => Num (Complex a)	Since: base-2.1
Instance details Defined in Data.Complex Methods (+) :: Complex a -> Complex a -> Complex a # (-) :: Complex a -> Complex a -> Complex a # (*) :: Complex a -> Complex a -> Complex a # negate :: Complex a -> Complex a # abs :: Complex a -> Complex a # signum :: Complex a -> Complex a # fromInteger :: Integer -> Complex a #
Num a => Num (Min a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods (+) :: Min a -> Min a -> Min a # (-) :: Min a -> Min a -> Min a # (*) :: Min a -> Min a -> Min a # negate :: Min a -> Min a # abs :: Min a -> Min a # signum :: Min a -> Min a # fromInteger :: Integer -> Min a #
Num a => Num (Max a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods (+) :: Max a -> Max a -> Max a # (-) :: Max a -> Max a -> Max a # (*) :: Max a -> Max a -> Max a # negate :: Max a -> Max a # abs :: Max a -> Max a # signum :: Max a -> Max a # fromInteger :: Integer -> Max a #
Num a => Num (Identity a)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Identity Methods (+) :: Identity a -> Identity a -> Identity a # (-) :: Identity a -> Identity a -> Identity a # (*) :: Identity a -> Identity a -> Identity a # negate :: Identity a -> Identity a # abs :: Identity a -> Identity a # signum :: Identity a -> Identity a # fromInteger :: Integer -> Identity a #
Num a => Num (Sum a)	Since: base-4.7.0.0
Instance details Defined in Data.Semigroup.Internal Methods (+) :: Sum a -> Sum a -> Sum a # (-) :: Sum a -> Sum a -> Sum a # (*) :: Sum a -> Sum a -> Sum a # negate :: Sum a -> Sum a # abs :: Sum a -> Sum a # signum :: Sum a -> Sum a # fromInteger :: Integer -> Sum a #
Num a => Num (Product a)	Since: base-4.7.0.0
Instance details Defined in Data.Semigroup.Internal Methods (+) :: Product a -> Product a -> Product a # (-) :: Product a -> Product a -> Product a # (*) :: Product a -> Product a -> Product a # negate :: Product a -> Product a # abs :: Product a -> Product a # signum :: Product a -> Product a # fromInteger :: Integer -> Product a #
Num a => Num (Down a)	Since: base-4.11.0.0
Instance details Defined in Data.Ord Methods (+) :: Down a -> Down a -> Down a # (-) :: Down a -> Down a -> Down a # (*) :: Down a -> Down a -> Down a # negate :: Down a -> Down a # abs :: Down a -> Down a # signum :: Down a -> Down a # fromInteger :: Integer -> Down a #
Num a => Num (Op a b)
Instance details Defined in Data.Functor.Contravariant Methods (+) :: Op a b -> Op a b -> Op a b # (-) :: Op a b -> Op a b -> Op a b # (*) :: Op a b -> Op a b -> Op a b # negate :: Op a b -> Op a b # abs :: Op a b -> Op a b # signum :: Op a b -> Op a b # fromInteger :: Integer -> Op a b #
Num a => Num (Matrix ([] :: [Peano]) a) Source #
Instance details Defined in Termonad.Config.Vec Methods (+) :: Matrix [] a -> Matrix [] a -> Matrix [] a # (-) :: Matrix [] a -> Matrix [] a -> Matrix [] a # (*) :: Matrix [] a -> Matrix [] a -> Matrix [] a # negate :: Matrix [] a -> Matrix [] a # abs :: Matrix [] a -> Matrix [] a # signum :: Matrix [] a -> Matrix [] a # fromInteger :: Integer -> Matrix [] a #
Num a => Num (Const a b)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Const Methods (+) :: Const a b -> Const a b -> Const a b # (-) :: Const a b -> Const a b -> Const a b # (*) :: Const a b -> Const a b -> Const a b # negate :: Const a b -> Const a b # abs :: Const a b -> Const a b # signum :: Const a b -> Const a b # fromInteger :: Integer -> Const a b #
(Applicative f, Num a) => Num (Ap f a)	Since: base-4.12.0.0
Instance details Defined in Data.Monoid Methods (+) :: Ap f a -> Ap f a -> Ap f a # (-) :: Ap f a -> Ap f a -> Ap f a # (*) :: Ap f a -> Ap f a -> Ap f a # negate :: Ap f a -> Ap f a # abs :: Ap f a -> Ap f a # signum :: Ap f a -> Ap f a # fromInteger :: Integer -> Ap f a #
Num (f a) => Num (Alt f a)	Since: base-4.8.0.0
Instance details Defined in Data.Semigroup.Internal Methods (+) :: Alt f a -> Alt f a -> Alt f a # (-) :: Alt f a -> Alt f a -> Alt f a # (*) :: Alt f a -> Alt f a -> Alt f a # negate :: Alt f a -> Alt f a # abs :: Alt f a -> Alt f a # signum :: Alt f a -> Alt f a # fromInteger :: Integer -> Alt f a #
Num a => Num (Tagged s a)
Instance details Defined in Data.Tagged Methods (+) :: Tagged s a -> Tagged s a -> Tagged s a # (-) :: Tagged s a -> Tagged s a -> Tagged s a # (*) :: Tagged s a -> Tagged s a -> Tagged s a # negate :: Tagged s a -> Tagged s a # abs :: Tagged s a -> Tagged s a # signum :: Tagged s a -> Tagged s a # fromInteger :: Integer -> Tagged s a #

class Eq a => Ord a where #

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, then x <= z = True
Reflexivity: x <= x = True
Antisymmetry: if x <= y && y <= x = True, then x == y = True

Note that the following operator interactions are expected to hold:

x >= y = y <= x
x < y = x <= y && x /= y
x > y = y < x
x < y = compare x y == LT
x > y = compare x y == GT
x == y = compare x y == EQ
min x y == if x <= y then x else y = True
max 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.

Minimal complete definition

compare | (<=)

Methods

compare :: a -> a -> Ordering #

(<) :: a -> a -> Bool infix 4 #

(<=) :: a -> a -> Bool infix 4 #

(>) :: a -> a -> Bool infix 4 #

(>=) :: a -> a -> Bool infix 4 #

max :: a -> a -> a #

min :: a -> a -> a #

Instances

Ord Bool
Instance details Defined in GHC.Classes Methods compare :: Bool -> Bool -> Ordering # (<) :: Bool -> Bool -> Bool # (<=) :: Bool -> Bool -> Bool # (>) :: Bool -> Bool -> Bool # (>=) :: Bool -> Bool -> Bool # max :: Bool -> Bool -> Bool # min :: Bool -> Bool -> Bool #
Ord Char
Instance details Defined in GHC.Classes Methods compare :: Char -> Char -> Ordering # (<) :: Char -> Char -> Bool # (<=) :: Char -> Char -> Bool # (>) :: Char -> Char -> Bool # (>=) :: Char -> Char -> Bool # max :: Char -> Char -> Char # min :: Char -> Char -> Char #
Ord Double	Note that due to the presence of `NaN`, `Double`'s `Ord` instance does not satisfy reflexivity. `>>>` `0/0 <= (0/0 :: Double)`False Also note that, due to the same, `Ord`'s operator interactions are not respected by `Double`'s instance: `>>>` `(0/0 :: Double) > 1`False `>>>` `compare (0/0 :: Double) 1`GT
Instance details Defined in GHC.Classes Methods compare :: Double -> Double -> Ordering # (<) :: Double -> Double -> Bool # (<=) :: Double -> Double -> Bool # (>) :: Double -> Double -> Bool # (>=) :: Double -> Double -> Bool # max :: Double -> Double -> Double # min :: Double -> Double -> Double #
Ord Float	Note that due to the presence of `NaN`, `Float`'s `Ord` instance does not satisfy reflexivity. `>>>` `0/0 <= (0/0 :: Float)`False Also note that, due to the same, `Ord`'s operator interactions are not respected by `Float`'s instance: `>>>` `(0/0 :: Float) > 1`False `>>>` `compare (0/0 :: Float) 1`GT
Instance details Defined in GHC.Classes Methods compare :: Float -> Float -> Ordering # (<) :: Float -> Float -> Bool # (<=) :: Float -> Float -> Bool # (>) :: Float -> Float -> Bool # (>=) :: Float -> Float -> Bool # max :: Float -> Float -> Float # min :: Float -> Float -> Float #
Ord Int
Instance details Defined in GHC.Classes Methods compare :: Int -> Int -> Ordering # (<) :: Int -> Int -> Bool # (<=) :: Int -> Int -> Bool # (>) :: Int -> Int -> Bool # (>=) :: Int -> Int -> Bool # max :: Int -> Int -> Int # min :: Int -> Int -> Int #
Ord Int8	Since: base-2.1
Instance details Defined in GHC.Int Methods compare :: Int8 -> Int8 -> Ordering # (<) :: Int8 -> Int8 -> Bool # (<=) :: Int8 -> Int8 -> Bool # (>) :: Int8 -> Int8 -> Bool # (>=) :: Int8 -> Int8 -> Bool # max :: Int8 -> Int8 -> Int8 # min :: Int8 -> Int8 -> Int8 #
Ord Int16	Since: base-2.1
Instance details Defined in GHC.Int Methods compare :: Int16 -> Int16 -> Ordering # (<) :: Int16 -> Int16 -> Bool # (<=) :: Int16 -> Int16 -> Bool # (>) :: Int16 -> Int16 -> Bool # (>=) :: Int16 -> Int16 -> Bool # max :: Int16 -> Int16 -> Int16 # min :: Int16 -> Int16 -> Int16 #
Ord Int32	Since: base-2.1
Instance details Defined in GHC.Int Methods compare :: Int32 -> Int32 -> Ordering # (<) :: Int32 -> Int32 -> Bool # (<=) :: Int32 -> Int32 -> Bool # (>) :: Int32 -> Int32 -> Bool # (>=) :: Int32 -> Int32 -> Bool # max :: Int32 -> Int32 -> Int32 # min :: Int32 -> Int32 -> Int32 #
Ord Int64	Since: base-2.1
Instance details Defined in GHC.Int Methods compare :: Int64 -> Int64 -> Ordering # (<) :: Int64 -> Int64 -> Bool # (<=) :: Int64 -> Int64 -> Bool # (>) :: Int64 -> Int64 -> Bool # (>=) :: Int64 -> Int64 -> Bool # max :: Int64 -> Int64 -> Int64 # min :: Int64 -> Int64 -> Int64 #
Ord Integer
Instance details Defined in GHC.Integer.Type Methods compare :: Integer -> Integer -> Ordering # (<) :: Integer -> Integer -> Bool # (<=) :: Integer -> Integer -> Bool # (>) :: Integer -> Integer -> Bool # (>=) :: Integer -> Integer -> Bool # max :: Integer -> Integer -> Integer # min :: Integer -> Integer -> Integer #
Ord Natural	Since: base-4.8.0.0
Instance details Defined in GHC.Natural Methods compare :: Natural -> Natural -> Ordering # (<) :: Natural -> Natural -> Bool # (<=) :: Natural -> Natural -> Bool # (>) :: Natural -> Natural -> Bool # (>=) :: Natural -> Natural -> Bool # max :: Natural -> Natural -> Natural # min :: Natural -> Natural -> Natural #
Ord Ordering
Instance details Defined in GHC.Classes Methods compare :: Ordering -> Ordering -> Ordering # (<) :: Ordering -> Ordering -> Bool # (<=) :: Ordering -> Ordering -> Bool # (>) :: Ordering -> Ordering -> Bool # (>=) :: Ordering -> Ordering -> Bool # max :: Ordering -> Ordering -> Ordering # min :: Ordering -> Ordering -> Ordering #
Ord Word
Instance details Defined in GHC.Classes Methods compare :: Word -> Word -> Ordering # (<) :: Word -> Word -> Bool # (<=) :: Word -> Word -> Bool # (>) :: Word -> Word -> Bool # (>=) :: Word -> Word -> Bool # max :: Word -> Word -> Word # min :: Word -> Word -> Word #
Ord Word8	Since: base-2.1
Instance details Defined in GHC.Word Methods compare :: Word8 -> Word8 -> Ordering # (<) :: Word8 -> Word8 -> Bool # (<=) :: Word8 -> Word8 -> Bool # (>) :: Word8 -> Word8 -> Bool # (>=) :: Word8 -> Word8 -> Bool # max :: Word8 -> Word8 -> Word8 # min :: Word8 -> Word8 -> Word8 #
Ord Word16	Since: base-2.1
Instance details Defined in GHC.Word Methods compare :: Word16 -> Word16 -> Ordering # (<) :: Word16 -> Word16 -> Bool # (<=) :: Word16 -> Word16 -> Bool # (>) :: Word16 -> Word16 -> Bool # (>=) :: Word16 -> Word16 -> Bool # max :: Word16 -> Word16 -> Word16 # min :: Word16 -> Word16 -> Word16 #
Ord Word32	Since: base-2.1
Instance details Defined in GHC.Word Methods compare :: Word32 -> Word32 -> Ordering # (<) :: Word32 -> Word32 -> Bool # (<=) :: Word32 -> Word32 -> Bool # (>) :: Word32 -> Word32 -> Bool # (>=) :: Word32 -> Word32 -> Bool # max :: Word32 -> Word32 -> Word32 # min :: Word32 -> Word32 -> Word32 #
Ord Word64	Since: base-2.1
Instance details Defined in GHC.Word Methods compare :: Word64 -> Word64 -> Ordering # (<) :: Word64 -> Word64 -> Bool # (<=) :: Word64 -> Word64 -> Bool # (>) :: Word64 -> Word64 -> Bool # (>=) :: Word64 -> Word64 -> Bool # max :: Word64 -> Word64 -> Word64 # min :: Word64 -> Word64 -> Word64 #
Ord SomeTypeRep
Instance details Defined in Data.Typeable.Internal Methods compare :: SomeTypeRep -> SomeTypeRep -> Ordering # (<) :: SomeTypeRep -> SomeTypeRep -> Bool # (<=) :: SomeTypeRep -> SomeTypeRep -> Bool # (>) :: SomeTypeRep -> SomeTypeRep -> Bool # (>=) :: SomeTypeRep -> SomeTypeRep -> Bool # max :: SomeTypeRep -> SomeTypeRep -> SomeTypeRep # min :: SomeTypeRep -> SomeTypeRep -> SomeTypeRep #
Ord Exp
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Exp -> Exp -> Ordering # (<) :: Exp -> Exp -> Bool # (<=) :: Exp -> Exp -> Bool # (>) :: Exp -> Exp -> Bool # (>=) :: Exp -> Exp -> Bool # max :: Exp -> Exp -> Exp # min :: Exp -> Exp -> Exp #
Ord Match
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Match -> Match -> Ordering # (<) :: Match -> Match -> Bool # (<=) :: Match -> Match -> Bool # (>) :: Match -> Match -> Bool # (>=) :: Match -> Match -> Bool # max :: Match -> Match -> Match # min :: Match -> Match -> Match #
Ord Clause
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Clause -> Clause -> Ordering # (<) :: Clause -> Clause -> Bool # (<=) :: Clause -> Clause -> Bool # (>) :: Clause -> Clause -> Bool # (>=) :: Clause -> Clause -> Bool # max :: Clause -> Clause -> Clause # min :: Clause -> Clause -> Clause #
Ord Pat
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Pat -> Pat -> Ordering # (<) :: Pat -> Pat -> Bool # (<=) :: Pat -> Pat -> Bool # (>) :: Pat -> Pat -> Bool # (>=) :: Pat -> Pat -> Bool # max :: Pat -> Pat -> Pat # min :: Pat -> Pat -> Pat #
Ord Type
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Type -> Type -> Ordering # (<) :: Type -> Type -> Bool # (<=) :: Type -> Type -> Bool # (>) :: Type -> Type -> Bool # (>=) :: Type -> Type -> Bool # max :: Type -> Type -> Type # min :: Type -> Type -> Type #
Ord Dec
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Dec -> Dec -> Ordering # (<) :: Dec -> Dec -> Bool # (<=) :: Dec -> Dec -> Bool # (>) :: Dec -> Dec -> Bool # (>=) :: Dec -> Dec -> Bool # max :: Dec -> Dec -> Dec # min :: Dec -> Dec -> Dec #
Ord Name
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Name -> Name -> Ordering # (<) :: Name -> Name -> Bool # (<=) :: Name -> Name -> Bool # (>) :: Name -> Name -> Bool # (>=) :: Name -> Name -> Bool # max :: Name -> Name -> Name # min :: Name -> Name -> Name #
Ord FunDep
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: FunDep -> FunDep -> Ordering # (<) :: FunDep -> FunDep -> Bool # (<=) :: FunDep -> FunDep -> Bool # (>) :: FunDep -> FunDep -> Bool # (>=) :: FunDep -> FunDep -> Bool # max :: FunDep -> FunDep -> FunDep # min :: FunDep -> FunDep -> FunDep #
Ord InjectivityAnn
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: InjectivityAnn -> InjectivityAnn -> Ordering # (<) :: InjectivityAnn -> InjectivityAnn -> Bool # (<=) :: InjectivityAnn -> InjectivityAnn -> Bool # (>) :: InjectivityAnn -> InjectivityAnn -> Bool # (>=) :: InjectivityAnn -> InjectivityAnn -> Bool # max :: InjectivityAnn -> InjectivityAnn -> InjectivityAnn # min :: InjectivityAnn -> InjectivityAnn -> InjectivityAnn #
Ord Overlap
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Overlap -> Overlap -> Ordering # (<) :: Overlap -> Overlap -> Bool # (<=) :: Overlap -> Overlap -> Bool # (>) :: Overlap -> Overlap -> Bool # (>=) :: Overlap -> Overlap -> Bool # max :: Overlap -> Overlap -> Overlap # min :: Overlap -> Overlap -> Overlap #
Ord ()
Instance details Defined in GHC.Classes Methods compare :: () -> () -> Ordering # (<) :: () -> () -> Bool # (<=) :: () -> () -> Bool # (>) :: () -> () -> Bool # (>=) :: () -> () -> Bool # max :: () -> () -> () # min :: () -> () -> () #
Ord TyCon
Instance details Defined in GHC.Classes Methods compare :: TyCon -> TyCon -> Ordering # (<) :: TyCon -> TyCon -> Bool # (<=) :: TyCon -> TyCon -> Bool # (>) :: TyCon -> TyCon -> Bool # (>=) :: TyCon -> TyCon -> Bool # max :: TyCon -> TyCon -> TyCon # min :: TyCon -> TyCon -> TyCon #
Ord Peano Source #
Instance details Defined in Termonad.Config.Vec Methods compare :: Peano -> Peano -> Ordering # (<) :: Peano -> Peano -> Bool # (<=) :: Peano -> Peano -> Bool # (>) :: Peano -> Peano -> Bool # (>=) :: Peano -> Peano -> Bool # max :: Peano -> Peano -> Peano # min :: Peano -> Peano -> Peano #
Ord Version	Since: base-2.1
Instance details Defined in Data.Version Methods compare :: Version -> Version -> Ordering # (<) :: Version -> Version -> Bool # (<=) :: Version -> Version -> Bool # (>) :: Version -> Version -> Bool # (>=) :: Version -> Version -> Bool # max :: Version -> Version -> Version # min :: Version -> Version -> Version #
Ord ByteString
Instance details Defined in Data.ByteString.Lazy.Internal Methods compare :: ByteString -> ByteString -> Ordering # (<) :: ByteString -> ByteString -> Bool # (<=) :: ByteString -> ByteString -> Bool # (>) :: ByteString -> ByteString -> Bool # (>=) :: ByteString -> ByteString -> Bool # max :: ByteString -> ByteString -> ByteString # min :: ByteString -> ByteString -> ByteString #
Ord ByteString
Instance details Defined in Data.ByteString.Internal Methods compare :: ByteString -> ByteString -> Ordering # (<) :: ByteString -> ByteString -> Bool # (<=) :: ByteString -> ByteString -> Bool # (>) :: ByteString -> ByteString -> Bool # (>=) :: ByteString -> ByteString -> Bool # max :: ByteString -> ByteString -> ByteString # min :: ByteString -> ByteString -> ByteString #
Ord Any	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods compare :: Any -> Any -> Ordering # (<) :: Any -> Any -> Bool # (<=) :: Any -> Any -> Bool # (>) :: Any -> Any -> Bool # (>=) :: Any -> Any -> Bool # max :: Any -> Any -> Any # min :: Any -> Any -> Any #
Ord All	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods compare :: All -> All -> Ordering # (<) :: All -> All -> Bool # (<=) :: All -> All -> Bool # (>) :: All -> All -> Bool # (>=) :: All -> All -> Bool # max :: All -> All -> All # min :: All -> All -> All #
Ord Con
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Con -> Con -> Ordering # (<) :: Con -> Con -> Bool # (<=) :: Con -> Con -> Bool # (>) :: Con -> Con -> Bool # (>=) :: Con -> Con -> Bool # max :: Con -> Con -> Con # min :: Con -> Con -> Con #
Ord Builder
Instance details Defined in Data.Text.Internal.Builder Methods compare :: Builder -> Builder -> Ordering # (<) :: Builder -> Builder -> Bool # (<=) :: Builder -> Builder -> Bool # (>) :: Builder -> Builder -> Bool # (>=) :: Builder -> Builder -> Bool # max :: Builder -> Builder -> Builder # min :: Builder -> Builder -> Builder #
Ord UTCTime
Instance details Defined in Data.Time.Clock.Internal.UTCTime Methods compare :: UTCTime -> UTCTime -> Ordering # (<) :: UTCTime -> UTCTime -> Bool # (<=) :: UTCTime -> UTCTime -> Bool # (>) :: UTCTime -> UTCTime -> Bool # (>=) :: UTCTime -> UTCTime -> Bool # max :: UTCTime -> UTCTime -> UTCTime # min :: UTCTime -> UTCTime -> UTCTime #
Ord ThreadId	Since: base-4.2.0.0
Instance details Defined in GHC.Conc.Sync Methods compare :: ThreadId -> ThreadId -> Ordering # (<) :: ThreadId -> ThreadId -> Bool # (<=) :: ThreadId -> ThreadId -> Bool # (>) :: ThreadId -> ThreadId -> Bool # (>=) :: ThreadId -> ThreadId -> Bool # max :: ThreadId -> ThreadId -> ThreadId # min :: ThreadId -> ThreadId -> ThreadId #
Ord Pos
Instance details Defined in Data.Attoparsec.Internal.Types Methods compare :: Pos -> Pos -> Ordering # (<) :: Pos -> Pos -> Bool # (<=) :: Pos -> Pos -> Bool # (>) :: Pos -> Pos -> Bool # (>=) :: Pos -> Pos -> Bool # max :: Pos -> Pos -> Pos # min :: Pos -> Pos -> Pos #
Ord BigNat
Instance details Defined in GHC.Integer.Type Methods compare :: BigNat -> BigNat -> Ordering # (<) :: BigNat -> BigNat -> Bool # (<=) :: BigNat -> BigNat -> Bool # (>) :: BigNat -> BigNat -> Bool # (>=) :: BigNat -> BigNat -> Bool # max :: BigNat -> BigNat -> BigNat # min :: BigNat -> BigNat -> BigNat #
Ord Void	Since: base-4.8.0.0
Instance details Defined in Data.Void Methods compare :: Void -> Void -> Ordering # (<) :: Void -> Void -> Bool # (<=) :: Void -> Void -> Bool # (>) :: Void -> Void -> Bool # (>=) :: Void -> Void -> Bool # max :: Void -> Void -> Void # min :: Void -> Void -> Void #
Ord Unique
Instance details Defined in Data.Unique Methods compare :: Unique -> Unique -> Ordering # (<) :: Unique -> Unique -> Bool # (<=) :: Unique -> Unique -> Bool # (>) :: Unique -> Unique -> Bool # (>=) :: Unique -> Unique -> Bool # max :: Unique -> Unique -> Unique # min :: Unique -> Unique -> Unique #
Ord BlockReason	Since: base-4.3.0.0
Instance details Defined in GHC.Conc.Sync Methods compare :: BlockReason -> BlockReason -> Ordering # (<) :: BlockReason -> BlockReason -> Bool # (<=) :: BlockReason -> BlockReason -> Bool # (>) :: BlockReason -> BlockReason -> Bool # (>=) :: BlockReason -> BlockReason -> Bool # max :: BlockReason -> BlockReason -> BlockReason # min :: BlockReason -> BlockReason -> BlockReason #
Ord ThreadStatus	Since: base-4.3.0.0
Instance details Defined in GHC.Conc.Sync Methods compare :: ThreadStatus -> ThreadStatus -> Ordering # (<) :: ThreadStatus -> ThreadStatus -> Bool # (<=) :: ThreadStatus -> ThreadStatus -> Bool # (>) :: ThreadStatus -> ThreadStatus -> Bool # (>=) :: ThreadStatus -> ThreadStatus -> Bool # max :: ThreadStatus -> ThreadStatus -> ThreadStatus # min :: ThreadStatus -> ThreadStatus -> ThreadStatus #
Ord AsyncException	Since: base-4.2.0.0
Instance details Defined in GHC.IO.Exception Methods compare :: AsyncException -> AsyncException -> Ordering # (<) :: AsyncException -> AsyncException -> Bool # (<=) :: AsyncException -> AsyncException -> Bool # (>) :: AsyncException -> AsyncException -> Bool # (>=) :: AsyncException -> AsyncException -> Bool # max :: AsyncException -> AsyncException -> AsyncException # min :: AsyncException -> AsyncException -> AsyncException #
Ord ArrayException	Since: base-4.2.0.0
Instance details Defined in GHC.IO.Exception Methods compare :: ArrayException -> ArrayException -> Ordering # (<) :: ArrayException -> ArrayException -> Bool # (<=) :: ArrayException -> ArrayException -> Bool # (>) :: ArrayException -> ArrayException -> Bool # (>=) :: ArrayException -> ArrayException -> Bool # max :: ArrayException -> ArrayException -> ArrayException # min :: ArrayException -> ArrayException -> ArrayException #
Ord ExitCode
Instance details Defined in GHC.IO.Exception Methods compare :: ExitCode -> ExitCode -> Ordering # (<) :: ExitCode -> ExitCode -> Bool # (<=) :: ExitCode -> ExitCode -> Bool # (>) :: ExitCode -> ExitCode -> Bool # (>=) :: ExitCode -> ExitCode -> Bool # max :: ExitCode -> ExitCode -> ExitCode # min :: ExitCode -> ExitCode -> ExitCode #
Ord BufferMode	Since: base-4.2.0.0
Instance details 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 #
Ord Newline	Since: base-4.3.0.0
Instance details Defined in GHC.IO.Handle.Types Methods compare :: Newline -> Newline -> Ordering # (<) :: Newline -> Newline -> Bool # (<=) :: Newline -> Newline -> Bool # (>) :: Newline -> Newline -> Bool # (>=) :: Newline -> Newline -> Bool # max :: Newline -> Newline -> Newline # min :: Newline -> Newline -> Newline #
Ord NewlineMode	Since: base-4.3.0.0
Instance details Defined in GHC.IO.Handle.Types Methods compare :: NewlineMode -> NewlineMode -> Ordering # (<) :: NewlineMode -> NewlineMode -> Bool # (<=) :: NewlineMode -> NewlineMode -> Bool # (>) :: NewlineMode -> NewlineMode -> Bool # (>=) :: NewlineMode -> NewlineMode -> Bool # max :: NewlineMode -> NewlineMode -> NewlineMode # min :: NewlineMode -> NewlineMode -> NewlineMode #
Ord SeekMode	Since: base-4.2.0.0
Instance details Defined in GHC.IO.Device Methods compare :: SeekMode -> SeekMode -> Ordering # (<) :: SeekMode -> SeekMode -> Bool # (<=) :: SeekMode -> SeekMode -> Bool # (>) :: SeekMode -> SeekMode -> Bool # (>=) :: SeekMode -> SeekMode -> Bool # max :: SeekMode -> SeekMode -> SeekMode # min :: SeekMode -> SeekMode -> SeekMode #
Ord ArithException	Since: base-3.0
Instance details Defined in GHC.Exception.Type Methods compare :: ArithException -> ArithException -> Ordering # (<) :: ArithException -> ArithException -> Bool # (<=) :: ArithException -> ArithException -> Bool # (>) :: ArithException -> ArithException -> Bool # (>=) :: ArithException -> ArithException -> Bool # max :: ArithException -> ArithException -> ArithException # min :: ArithException -> ArithException -> ArithException #
Ord Fixity	Since: base-4.6.0.0
Instance details Defined in GHC.Generics Methods compare :: Fixity -> Fixity -> Ordering # (<) :: Fixity -> Fixity -> Bool # (<=) :: Fixity -> Fixity -> Bool # (>) :: Fixity -> Fixity -> Bool # (>=) :: Fixity -> Fixity -> Bool # max :: Fixity -> Fixity -> Fixity # min :: Fixity -> Fixity -> Fixity #
Ord Associativity	Since: base-4.6.0.0
Instance details Defined in GHC.Generics Methods compare :: Associativity -> Associativity -> Ordering # (<) :: Associativity -> Associativity -> Bool # (<=) :: Associativity -> Associativity -> Bool # (>) :: Associativity -> Associativity -> Bool # (>=) :: Associativity -> Associativity -> Bool # max :: Associativity -> Associativity -> Associativity # min :: Associativity -> Associativity -> Associativity #
Ord SourceUnpackedness	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods compare :: SourceUnpackedness -> SourceUnpackedness -> Ordering # (<) :: SourceUnpackedness -> SourceUnpackedness -> Bool # (<=) :: SourceUnpackedness -> SourceUnpackedness -> Bool # (>) :: SourceUnpackedness -> SourceUnpackedness -> Bool # (>=) :: SourceUnpackedness -> SourceUnpackedness -> Bool # max :: SourceUnpackedness -> SourceUnpackedness -> SourceUnpackedness # min :: SourceUnpackedness -> SourceUnpackedness -> SourceUnpackedness #
Ord SourceStrictness	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods compare :: SourceStrictness -> SourceStrictness -> Ordering # (<) :: SourceStrictness -> SourceStrictness -> Bool # (<=) :: SourceStrictness -> SourceStrictness -> Bool # (>) :: SourceStrictness -> SourceStrictness -> Bool # (>=) :: SourceStrictness -> SourceStrictness -> Bool # max :: SourceStrictness -> SourceStrictness -> SourceStrictness # min :: SourceStrictness -> SourceStrictness -> SourceStrictness #
Ord DecidedStrictness	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods compare :: DecidedStrictness -> DecidedStrictness -> Ordering # (<) :: DecidedStrictness -> DecidedStrictness -> Bool # (<=) :: DecidedStrictness -> DecidedStrictness -> Bool # (>) :: DecidedStrictness -> DecidedStrictness -> Bool # (>=) :: DecidedStrictness -> DecidedStrictness -> Bool # max :: DecidedStrictness -> DecidedStrictness -> DecidedStrictness # min :: DecidedStrictness -> DecidedStrictness -> DecidedStrictness #
Ord SomeSymbol	Since: base-4.7.0.0
Instance details Defined in GHC.TypeLits Methods compare :: SomeSymbol -> SomeSymbol -> Ordering # (<) :: SomeSymbol -> SomeSymbol -> Bool # (<=) :: SomeSymbol -> SomeSymbol -> Bool # (>) :: SomeSymbol -> SomeSymbol -> Bool # (>=) :: SomeSymbol -> SomeSymbol -> Bool # max :: SomeSymbol -> SomeSymbol -> SomeSymbol # min :: SomeSymbol -> SomeSymbol -> SomeSymbol #
Ord SomeNat	Since: base-4.7.0.0
Instance details Defined in GHC.TypeNats Methods compare :: SomeNat -> SomeNat -> Ordering # (<) :: SomeNat -> SomeNat -> Bool # (<=) :: SomeNat -> SomeNat -> Bool # (>) :: SomeNat -> SomeNat -> Bool # (>=) :: SomeNat -> SomeNat -> Bool # max :: SomeNat -> SomeNat -> SomeNat # min :: SomeNat -> SomeNat -> SomeNat #
Ord CChar
Instance details Defined in Foreign.C.Types Methods compare :: CChar -> CChar -> Ordering # (<) :: CChar -> CChar -> Bool # (<=) :: CChar -> CChar -> Bool # (>) :: CChar -> CChar -> Bool # (>=) :: CChar -> CChar -> Bool # max :: CChar -> CChar -> CChar # min :: CChar -> CChar -> CChar #
Ord CSChar
Instance details Defined in Foreign.C.Types Methods compare :: CSChar -> CSChar -> Ordering # (<) :: CSChar -> CSChar -> Bool # (<=) :: CSChar -> CSChar -> Bool # (>) :: CSChar -> CSChar -> Bool # (>=) :: CSChar -> CSChar -> Bool # max :: CSChar -> CSChar -> CSChar # min :: CSChar -> CSChar -> CSChar #
Ord CUChar
Instance details Defined in Foreign.C.Types Methods compare :: CUChar -> CUChar -> Ordering # (<) :: CUChar -> CUChar -> Bool # (<=) :: CUChar -> CUChar -> Bool # (>) :: CUChar -> CUChar -> Bool # (>=) :: CUChar -> CUChar -> Bool # max :: CUChar -> CUChar -> CUChar # min :: CUChar -> CUChar -> CUChar #
Ord CShort
Instance details Defined in Foreign.C.Types Methods compare :: CShort -> CShort -> Ordering # (<) :: CShort -> CShort -> Bool # (<=) :: CShort -> CShort -> Bool # (>) :: CShort -> CShort -> Bool # (>=) :: CShort -> CShort -> Bool # max :: CShort -> CShort -> CShort # min :: CShort -> CShort -> CShort #
Ord CUShort
Instance details Defined in Foreign.C.Types Methods compare :: CUShort -> CUShort -> Ordering # (<) :: CUShort -> CUShort -> Bool # (<=) :: CUShort -> CUShort -> Bool # (>) :: CUShort -> CUShort -> Bool # (>=) :: CUShort -> CUShort -> Bool # max :: CUShort -> CUShort -> CUShort # min :: CUShort -> CUShort -> CUShort #
Ord CInt
Instance details Defined in Foreign.C.Types Methods compare :: CInt -> CInt -> Ordering # (<) :: CInt -> CInt -> Bool # (<=) :: CInt -> CInt -> Bool # (>) :: CInt -> CInt -> Bool # (>=) :: CInt -> CInt -> Bool # max :: CInt -> CInt -> CInt # min :: CInt -> CInt -> CInt #
Ord CUInt
Instance details Defined in Foreign.C.Types Methods compare :: CUInt -> CUInt -> Ordering # (<) :: CUInt -> CUInt -> Bool # (<=) :: CUInt -> CUInt -> Bool # (>) :: CUInt -> CUInt -> Bool # (>=) :: CUInt -> CUInt -> Bool # max :: CUInt -> CUInt -> CUInt # min :: CUInt -> CUInt -> CUInt #
Ord CLong
Instance details Defined in Foreign.C.Types Methods compare :: CLong -> CLong -> Ordering # (<) :: CLong -> CLong -> Bool # (<=) :: CLong -> CLong -> Bool # (>) :: CLong -> CLong -> Bool # (>=) :: CLong -> CLong -> Bool # max :: CLong -> CLong -> CLong # min :: CLong -> CLong -> CLong #
Ord CULong
Instance details Defined in Foreign.C.Types Methods compare :: CULong -> CULong -> Ordering # (<) :: CULong -> CULong -> Bool # (<=) :: CULong -> CULong -> Bool # (>) :: CULong -> CULong -> Bool # (>=) :: CULong -> CULong -> Bool # max :: CULong -> CULong -> CULong # min :: CULong -> CULong -> CULong #
Ord CLLong
Instance details Defined in Foreign.C.Types Methods compare :: CLLong -> CLLong -> Ordering # (<) :: CLLong -> CLLong -> Bool # (<=) :: CLLong -> CLLong -> Bool # (>) :: CLLong -> CLLong -> Bool # (>=) :: CLLong -> CLLong -> Bool # max :: CLLong -> CLLong -> CLLong # min :: CLLong -> CLLong -> CLLong #
Ord CULLong
Instance details Defined in Foreign.C.Types Methods compare :: CULLong -> CULLong -> Ordering # (<) :: CULLong -> CULLong -> Bool # (<=) :: CULLong -> CULLong -> Bool # (>) :: CULLong -> CULLong -> Bool # (>=) :: CULLong -> CULLong -> Bool # max :: CULLong -> CULLong -> CULLong # min :: CULLong -> CULLong -> CULLong #
Ord CBool
Instance details Defined in Foreign.C.Types Methods compare :: CBool -> CBool -> Ordering # (<) :: CBool -> CBool -> Bool # (<=) :: CBool -> CBool -> Bool # (>) :: CBool -> CBool -> Bool # (>=) :: CBool -> CBool -> Bool # max :: CBool -> CBool -> CBool # min :: CBool -> CBool -> CBool #
Ord CFloat
Instance details Defined in Foreign.C.Types Methods compare :: CFloat -> CFloat -> Ordering # (<) :: CFloat -> CFloat -> Bool # (<=) :: CFloat -> CFloat -> Bool # (>) :: CFloat -> CFloat -> Bool # (>=) :: CFloat -> CFloat -> Bool # max :: CFloat -> CFloat -> CFloat # min :: CFloat -> CFloat -> CFloat #
Ord CDouble
Instance details Defined in Foreign.C.Types Methods compare :: CDouble -> CDouble -> Ordering # (<) :: CDouble -> CDouble -> Bool # (<=) :: CDouble -> CDouble -> Bool # (>) :: CDouble -> CDouble -> Bool # (>=) :: CDouble -> CDouble -> Bool # max :: CDouble -> CDouble -> CDouble # min :: CDouble -> CDouble -> CDouble #
Ord CPtrdiff
Instance details Defined in Foreign.C.Types Methods compare :: CPtrdiff -> CPtrdiff -> Ordering # (<) :: CPtrdiff -> CPtrdiff -> Bool # (<=) :: CPtrdiff -> CPtrdiff -> Bool # (>) :: CPtrdiff -> CPtrdiff -> Bool # (>=) :: CPtrdiff -> CPtrdiff -> Bool # max :: CPtrdiff -> CPtrdiff -> CPtrdiff # min :: CPtrdiff -> CPtrdiff -> CPtrdiff #
Ord CSize
Instance details Defined in Foreign.C.Types Methods compare :: CSize -> CSize -> Ordering # (<) :: CSize -> CSize -> Bool # (<=) :: CSize -> CSize -> Bool # (>) :: CSize -> CSize -> Bool # (>=) :: CSize -> CSize -> Bool # max :: CSize -> CSize -> CSize # min :: CSize -> CSize -> CSize #
Ord CWchar
Instance details Defined in Foreign.C.Types Methods compare :: CWchar -> CWchar -> Ordering # (<) :: CWchar -> CWchar -> Bool # (<=) :: CWchar -> CWchar -> Bool # (>) :: CWchar -> CWchar -> Bool # (>=) :: CWchar -> CWchar -> Bool # max :: CWchar -> CWchar -> CWchar # min :: CWchar -> CWchar -> CWchar #
Ord CSigAtomic
Instance details Defined in Foreign.C.Types Methods compare :: CSigAtomic -> CSigAtomic -> Ordering # (<) :: CSigAtomic -> CSigAtomic -> Bool # (<=) :: CSigAtomic -> CSigAtomic -> Bool # (>) :: CSigAtomic -> CSigAtomic -> Bool # (>=) :: CSigAtomic -> CSigAtomic -> Bool # max :: CSigAtomic -> CSigAtomic -> CSigAtomic # min :: CSigAtomic -> CSigAtomic -> CSigAtomic #
Ord CClock
Instance details Defined in Foreign.C.Types Methods compare :: CClock -> CClock -> Ordering # (<) :: CClock -> CClock -> Bool # (<=) :: CClock -> CClock -> Bool # (>) :: CClock -> CClock -> Bool # (>=) :: CClock -> CClock -> Bool # max :: CClock -> CClock -> CClock # min :: CClock -> CClock -> CClock #
Ord CTime
Instance details Defined in Foreign.C.Types Methods compare :: CTime -> CTime -> Ordering # (<) :: CTime -> CTime -> Bool # (<=) :: CTime -> CTime -> Bool # (>) :: CTime -> CTime -> Bool # (>=) :: CTime -> CTime -> Bool # max :: CTime -> CTime -> CTime # min :: CTime -> CTime -> CTime #
Ord CUSeconds
Instance details Defined in Foreign.C.Types Methods compare :: CUSeconds -> CUSeconds -> Ordering # (<) :: CUSeconds -> CUSeconds -> Bool # (<=) :: CUSeconds -> CUSeconds -> Bool # (>) :: CUSeconds -> CUSeconds -> Bool # (>=) :: CUSeconds -> CUSeconds -> Bool # max :: CUSeconds -> CUSeconds -> CUSeconds # min :: CUSeconds -> CUSeconds -> CUSeconds #
Ord CSUSeconds
Instance details Defined in Foreign.C.Types Methods compare :: CSUSeconds -> CSUSeconds -> Ordering # (<) :: CSUSeconds -> CSUSeconds -> Bool # (<=) :: CSUSeconds -> CSUSeconds -> Bool # (>) :: CSUSeconds -> CSUSeconds -> Bool # (>=) :: CSUSeconds -> CSUSeconds -> Bool # max :: CSUSeconds -> CSUSeconds -> CSUSeconds # min :: CSUSeconds -> CSUSeconds -> CSUSeconds #
Ord CIntPtr
Instance details Defined in Foreign.C.Types Methods compare :: CIntPtr -> CIntPtr -> Ordering # (<) :: CIntPtr -> CIntPtr -> Bool # (<=) :: CIntPtr -> CIntPtr -> Bool # (>) :: CIntPtr -> CIntPtr -> Bool # (>=) :: CIntPtr -> CIntPtr -> Bool # max :: CIntPtr -> CIntPtr -> CIntPtr # min :: CIntPtr -> CIntPtr -> CIntPtr #
Ord CUIntPtr
Instance details Defined in Foreign.C.Types Methods compare :: CUIntPtr -> CUIntPtr -> Ordering # (<) :: CUIntPtr -> CUIntPtr -> Bool # (<=) :: CUIntPtr -> CUIntPtr -> Bool # (>) :: CUIntPtr -> CUIntPtr -> Bool # (>=) :: CUIntPtr -> CUIntPtr -> Bool # max :: CUIntPtr -> CUIntPtr -> CUIntPtr # min :: CUIntPtr -> CUIntPtr -> CUIntPtr #
Ord CIntMax
Instance details Defined in Foreign.C.Types Methods compare :: CIntMax -> CIntMax -> Ordering # (<) :: CIntMax -> CIntMax -> Bool # (<=) :: CIntMax -> CIntMax -> Bool # (>) :: CIntMax -> CIntMax -> Bool # (>=) :: CIntMax -> CIntMax -> Bool # max :: CIntMax -> CIntMax -> CIntMax # min :: CIntMax -> CIntMax -> CIntMax #
Ord CUIntMax
Instance details Defined in Foreign.C.Types Methods compare :: CUIntMax -> CUIntMax -> Ordering # (<) :: CUIntMax -> CUIntMax -> Bool # (<=) :: CUIntMax -> CUIntMax -> Bool # (>) :: CUIntMax -> CUIntMax -> Bool # (>=) :: CUIntMax -> CUIntMax -> Bool # max :: CUIntMax -> CUIntMax -> CUIntMax # min :: CUIntMax -> CUIntMax -> CUIntMax #
Ord IOMode	Since: base-4.2.0.0
Instance details Defined in GHC.IO.IOMode Methods compare :: IOMode -> IOMode -> Ordering # (<) :: IOMode -> IOMode -> Bool # (<=) :: IOMode -> IOMode -> Bool # (>) :: IOMode -> IOMode -> Bool # (>=) :: IOMode -> IOMode -> Bool # max :: IOMode -> IOMode -> IOMode # min :: IOMode -> IOMode -> IOMode #
Ord GeneralCategory	Since: base-2.1
Instance details Defined in GHC.Unicode Methods compare :: GeneralCategory -> GeneralCategory -> Ordering # (<) :: GeneralCategory -> GeneralCategory -> Bool # (<=) :: GeneralCategory -> GeneralCategory -> Bool # (>) :: GeneralCategory -> GeneralCategory -> Bool # (>=) :: GeneralCategory -> GeneralCategory -> Bool # max :: GeneralCategory -> GeneralCategory -> GeneralCategory # min :: GeneralCategory -> GeneralCategory -> GeneralCategory #
Ord IntSet
Instance details Defined in Data.IntSet.Internal Methods compare :: IntSet -> IntSet -> Ordering # (<) :: IntSet -> IntSet -> Bool # (<=) :: IntSet -> IntSet -> Bool # (>) :: IntSet -> IntSet -> Bool # (>=) :: IntSet -> IntSet -> Bool # max :: IntSet -> IntSet -> IntSet # min :: IntSet -> IntSet -> IntSet #
Ord ConcException
Instance details Defined in UnliftIO.Internals.Async Methods compare :: ConcException -> ConcException -> Ordering # (<) :: ConcException -> ConcException -> Bool # (<=) :: ConcException -> ConcException -> Bool # (>) :: ConcException -> ConcException -> Bool # (>=) :: ConcException -> ConcException -> Bool # max :: ConcException -> ConcException -> ConcException # min :: ConcException -> ConcException -> ConcException #
Ord Day
Instance details Defined in Data.Time.Calendar.Days Methods compare :: Day -> Day -> Ordering # (<) :: Day -> Day -> Bool # (<=) :: Day -> Day -> Bool # (>) :: Day -> Day -> Bool # (>=) :: Day -> Day -> Bool # max :: Day -> Day -> Day # min :: Day -> Day -> Day #
Ord Focus	`NoFocus` is always less than `Focus`. NoFocus < Focus a The ordering of `Focus` depends on the ordering of the integer contained inside. (a < b) ==> (Focus a < Focus b)
Instance details Defined in Data.FocusList Methods compare :: Focus -> Focus -> Ordering # (<) :: Focus -> Focus -> Bool # (<=) :: Focus -> Focus -> Bool # (>) :: Focus -> Focus -> Bool # (>=) :: Focus -> Focus -> Bool # max :: Focus -> Focus -> Focus # min :: Focus -> Focus -> Focus #
Ord WindowState
Instance details Defined in GI.Gdk.Flags Methods compare :: WindowState -> WindowState -> Ordering # (<) :: WindowState -> WindowState -> Bool # (<=) :: WindowState -> WindowState -> Bool # (>) :: WindowState -> WindowState -> Bool # (>=) :: WindowState -> WindowState -> Bool # max :: WindowState -> WindowState -> WindowState # min :: WindowState -> WindowState -> WindowState #
Ord WindowHints
Instance details Defined in GI.Gdk.Flags Methods compare :: WindowHints -> WindowHints -> Ordering # (<) :: WindowHints -> WindowHints -> Bool # (<=) :: WindowHints -> WindowHints -> Bool # (>) :: WindowHints -> WindowHints -> Bool # (>=) :: WindowHints -> WindowHints -> Bool # max :: WindowHints -> WindowHints -> WindowHints # min :: WindowHints -> WindowHints -> WindowHints #
Ord WindowAttributesType
Instance details Defined in GI.Gdk.Flags Methods compare :: WindowAttributesType -> WindowAttributesType -> Ordering # (<) :: WindowAttributesType -> WindowAttributesType -> Bool # (<=) :: WindowAttributesType -> WindowAttributesType -> Bool # (>) :: WindowAttributesType -> WindowAttributesType -> Bool # (>=) :: WindowAttributesType -> WindowAttributesType -> Bool # max :: WindowAttributesType -> WindowAttributesType -> WindowAttributesType # min :: WindowAttributesType -> WindowAttributesType -> WindowAttributesType #
Ord WMFunction
Instance details Defined in GI.Gdk.Flags Methods compare :: WMFunction -> WMFunction -> Ordering # (<) :: WMFunction -> WMFunction -> Bool # (<=) :: WMFunction -> WMFunction -> Bool # (>) :: WMFunction -> WMFunction -> Bool # (>=) :: WMFunction -> WMFunction -> Bool # max :: WMFunction -> WMFunction -> WMFunction # min :: WMFunction -> WMFunction -> WMFunction #
Ord WMDecoration
Instance details Defined in GI.Gdk.Flags Methods compare :: WMDecoration -> WMDecoration -> Ordering # (<) :: WMDecoration -> WMDecoration -> Bool # (<=) :: WMDecoration -> WMDecoration -> Bool # (>) :: WMDecoration -> WMDecoration -> Bool # (>=) :: WMDecoration -> WMDecoration -> Bool # max :: WMDecoration -> WMDecoration -> WMDecoration # min :: WMDecoration -> WMDecoration -> WMDecoration #
Ord SeatCapabilities
Instance details Defined in GI.Gdk.Flags Methods compare :: SeatCapabilities -> SeatCapabilities -> Ordering # (<) :: SeatCapabilities -> SeatCapabilities -> Bool # (<=) :: SeatCapabilities -> SeatCapabilities -> Bool # (>) :: SeatCapabilities -> SeatCapabilities -> Bool # (>=) :: SeatCapabilities -> SeatCapabilities -> Bool # max :: SeatCapabilities -> SeatCapabilities -> SeatCapabilities # min :: SeatCapabilities -> SeatCapabilities -> SeatCapabilities #
Ord ModifierType
Instance details Defined in GI.Gdk.Flags Methods compare :: ModifierType -> ModifierType -> Ordering # (<) :: ModifierType -> ModifierType -> Bool # (<=) :: ModifierType -> ModifierType -> Bool # (>) :: ModifierType -> ModifierType -> Bool # (>=) :: ModifierType -> ModifierType -> Bool # max :: ModifierType -> ModifierType -> ModifierType # min :: ModifierType -> ModifierType -> ModifierType #
Ord FrameClockPhase
Instance details Defined in GI.Gdk.Flags Methods compare :: FrameClockPhase -> FrameClockPhase -> Ordering # (<) :: FrameClockPhase -> FrameClockPhase -> Bool # (<=) :: FrameClockPhase -> FrameClockPhase -> Bool # (>) :: FrameClockPhase -> FrameClockPhase -> Bool # (>=) :: FrameClockPhase -> FrameClockPhase -> Bool # max :: FrameClockPhase -> FrameClockPhase -> FrameClockPhase # min :: FrameClockPhase -> FrameClockPhase -> FrameClockPhase #
Ord EventMask
Instance details Defined in GI.Gdk.Flags Methods compare :: EventMask -> EventMask -> Ordering # (<) :: EventMask -> EventMask -> Bool # (<=) :: EventMask -> EventMask -> Bool # (>) :: EventMask -> EventMask -> Bool # (>=) :: EventMask -> EventMask -> Bool # max :: EventMask -> EventMask -> EventMask # min :: EventMask -> EventMask -> EventMask #
Ord DragAction
Instance details Defined in GI.Gdk.Flags Methods compare :: DragAction -> DragAction -> Ordering # (<) :: DragAction -> DragAction -> Bool # (<=) :: DragAction -> DragAction -> Bool # (>) :: DragAction -> DragAction -> Bool # (>=) :: DragAction -> DragAction -> Bool # max :: DragAction -> DragAction -> DragAction # min :: DragAction -> DragAction -> DragAction #
Ord AxisFlags
Instance details Defined in GI.Gdk.Flags Methods compare :: AxisFlags -> AxisFlags -> Ordering # (<) :: AxisFlags -> AxisFlags -> Bool # (<=) :: AxisFlags -> AxisFlags -> Bool # (>) :: AxisFlags -> AxisFlags -> Bool # (>=) :: AxisFlags -> AxisFlags -> Bool # max :: AxisFlags -> AxisFlags -> AxisFlags # min :: AxisFlags -> AxisFlags -> AxisFlags #
Ord AnchorHints
Instance details Defined in GI.Gdk.Flags Methods compare :: AnchorHints -> AnchorHints -> Ordering # (<) :: AnchorHints -> AnchorHints -> Bool # (<=) :: AnchorHints -> AnchorHints -> Bool # (>) :: AnchorHints -> AnchorHints -> Bool # (>=) :: AnchorHints -> AnchorHints -> Bool # max :: AnchorHints -> AnchorHints -> AnchorHints # min :: AnchorHints -> AnchorHints -> AnchorHints #
Ord WindowWindowClass
Instance details Defined in GI.Gdk.Enums Methods compare :: WindowWindowClass -> WindowWindowClass -> Ordering # (<) :: WindowWindowClass -> WindowWindowClass -> Bool # (<=) :: WindowWindowClass -> WindowWindowClass -> Bool # (>) :: WindowWindowClass -> WindowWindowClass -> Bool # (>=) :: WindowWindowClass -> WindowWindowClass -> Bool # max :: WindowWindowClass -> WindowWindowClass -> WindowWindowClass # min :: WindowWindowClass -> WindowWindowClass -> WindowWindowClass #
Ord WindowTypeHint
Instance details Defined in GI.Gdk.Enums Methods compare :: WindowTypeHint -> WindowTypeHint -> Ordering # (<) :: WindowTypeHint -> WindowTypeHint -> Bool # (<=) :: WindowTypeHint -> WindowTypeHint -> Bool # (>) :: WindowTypeHint -> WindowTypeHint -> Bool # (>=) :: WindowTypeHint -> WindowTypeHint -> Bool # max :: WindowTypeHint -> WindowTypeHint -> WindowTypeHint # min :: WindowTypeHint -> WindowTypeHint -> WindowTypeHint #
Ord WindowType
Instance details Defined in GI.Gdk.Enums Methods compare :: WindowType -> WindowType -> Ordering # (<) :: WindowType -> WindowType -> Bool # (<=) :: WindowType -> WindowType -> Bool # (>) :: WindowType -> WindowType -> Bool # (>=) :: WindowType -> WindowType -> Bool # max :: WindowType -> WindowType -> WindowType # min :: WindowType -> WindowType -> WindowType #
Ord WindowEdge
Instance details Defined in GI.Gdk.Enums Methods compare :: WindowEdge -> WindowEdge -> Ordering # (<) :: WindowEdge -> WindowEdge -> Bool # (<=) :: WindowEdge -> WindowEdge -> Bool # (>) :: WindowEdge -> WindowEdge -> Bool # (>=) :: WindowEdge -> WindowEdge -> Bool # max :: WindowEdge -> WindowEdge -> WindowEdge # min :: WindowEdge -> WindowEdge -> WindowEdge #
Ord VisualType
Instance details Defined in GI.Gdk.Enums Methods compare :: VisualType -> VisualType -> Ordering # (<) :: VisualType -> VisualType -> Bool # (<=) :: VisualType -> VisualType -> Bool # (>) :: VisualType -> VisualType -> Bool # (>=) :: VisualType -> VisualType -> Bool # max :: VisualType -> VisualType -> VisualType # min :: VisualType -> VisualType -> VisualType #
Ord VisibilityState
Instance details Defined in GI.Gdk.Enums Methods compare :: VisibilityState -> VisibilityState -> Ordering # (<) :: VisibilityState -> VisibilityState -> Bool # (<=) :: VisibilityState -> VisibilityState -> Bool # (>) :: VisibilityState -> VisibilityState -> Bool # (>=) :: VisibilityState -> VisibilityState -> Bool # max :: VisibilityState -> VisibilityState -> VisibilityState # min :: VisibilityState -> VisibilityState -> VisibilityState #
Ord TouchpadGesturePhase
Instance details Defined in GI.Gdk.Enums Methods compare :: TouchpadGesturePhase -> TouchpadGesturePhase -> Ordering # (<) :: TouchpadGesturePhase -> TouchpadGesturePhase -> Bool # (<=) :: TouchpadGesturePhase -> TouchpadGesturePhase -> Bool # (>) :: TouchpadGesturePhase -> TouchpadGesturePhase -> Bool # (>=) :: TouchpadGesturePhase -> TouchpadGesturePhase -> Bool # max :: TouchpadGesturePhase -> TouchpadGesturePhase -> TouchpadGesturePhase # min :: TouchpadGesturePhase -> TouchpadGesturePhase -> TouchpadGesturePhase #
Ord SubpixelLayout
Instance details Defined in GI.Gdk.Enums Methods compare :: SubpixelLayout -> SubpixelLayout -> Ordering # (<) :: SubpixelLayout -> SubpixelLayout -> Bool # (<=) :: SubpixelLayout -> SubpixelLayout -> Bool # (>) :: SubpixelLayout -> SubpixelLayout -> Bool # (>=) :: SubpixelLayout -> SubpixelLayout -> Bool # max :: SubpixelLayout -> SubpixelLayout -> SubpixelLayout # min :: SubpixelLayout -> SubpixelLayout -> SubpixelLayout #
Ord Status
Instance details Defined in GI.Gdk.Enums Methods compare :: Status -> Status -> Ordering # (<) :: Status -> Status -> Bool # (<=) :: Status -> Status -> Bool # (>) :: Status -> Status -> Bool # (>=) :: Status -> Status -> Bool # max :: Status -> Status -> Status # min :: Status -> Status -> Status #
Ord SettingAction
Instance details Defined in GI.Gdk.Enums Methods compare :: SettingAction -> SettingAction -> Ordering # (<) :: SettingAction -> SettingAction -> Bool # (<=) :: SettingAction -> SettingAction -> Bool # (>) :: SettingAction -> SettingAction -> Bool # (>=) :: SettingAction -> SettingAction -> Bool # max :: SettingAction -> SettingAction -> SettingAction # min :: SettingAction -> SettingAction -> SettingAction #
Ord ScrollDirection
Instance details Defined in GI.Gdk.Enums Methods compare :: ScrollDirection -> ScrollDirection -> Ordering # (<) :: ScrollDirection -> ScrollDirection -> Bool # (<=) :: ScrollDirection -> ScrollDirection -> Bool # (>) :: ScrollDirection -> ScrollDirection -> Bool # (>=) :: ScrollDirection -> ScrollDirection -> Bool # max :: ScrollDirection -> ScrollDirection -> ScrollDirection # min :: ScrollDirection -> ScrollDirection -> ScrollDirection #
Ord PropertyState
Instance details Defined in GI.Gdk.Enums Methods compare :: PropertyState -> PropertyState -> Ordering # (<) :: PropertyState -> PropertyState -> Bool # (<=) :: PropertyState -> PropertyState -> Bool # (>) :: PropertyState -> PropertyState -> Bool # (>=) :: PropertyState -> PropertyState -> Bool # max :: PropertyState -> PropertyState -> PropertyState # min :: PropertyState -> PropertyState -> PropertyState #
Ord PropMode
Instance details Defined in GI.Gdk.Enums Methods compare :: PropMode -> PropMode -> Ordering # (<) :: PropMode -> PropMode -> Bool # (<=) :: PropMode -> PropMode -> Bool # (>) :: PropMode -> PropMode -> Bool # (>=) :: PropMode -> PropMode -> Bool # max :: PropMode -> PropMode -> PropMode # min :: PropMode -> PropMode -> PropMode #
Ord OwnerChange
Instance details Defined in GI.Gdk.Enums Methods compare :: OwnerChange -> OwnerChange -> Ordering # (<) :: OwnerChange -> OwnerChange -> Bool # (<=) :: OwnerChange -> OwnerChange -> Bool # (>) :: OwnerChange -> OwnerChange -> Bool # (>=) :: OwnerChange -> OwnerChange -> Bool # max :: OwnerChange -> OwnerChange -> OwnerChange # min :: OwnerChange -> OwnerChange -> OwnerChange #
Ord NotifyType
Instance details Defined in GI.Gdk.Enums Methods compare :: NotifyType -> NotifyType -> Ordering # (<) :: NotifyType -> NotifyType -> Bool # (<=) :: NotifyType -> NotifyType -> Bool # (>) :: NotifyType -> NotifyType -> Bool # (>=) :: NotifyType -> NotifyType -> Bool # max :: NotifyType -> NotifyType -> NotifyType # min :: NotifyType -> NotifyType -> NotifyType #
Ord ModifierIntent
Instance details Defined in GI.Gdk.Enums Methods compare :: ModifierIntent -> ModifierIntent -> Ordering # (<) :: ModifierIntent -> ModifierIntent -> Bool # (<=) :: ModifierIntent -> ModifierIntent -> Bool # (>) :: ModifierIntent -> ModifierIntent -> Bool # (>=) :: ModifierIntent -> ModifierIntent -> Bool # max :: ModifierIntent -> ModifierIntent -> ModifierIntent # min :: ModifierIntent -> ModifierIntent -> ModifierIntent #
Ord InputSource
Instance details Defined in GI.Gdk.Enums Methods compare :: InputSource -> InputSource -> Ordering # (<) :: InputSource -> InputSource -> Bool # (<=) :: InputSource -> InputSource -> Bool # (>) :: InputSource -> InputSource -> Bool # (>=) :: InputSource -> InputSource -> Bool # max :: InputSource -> InputSource -> InputSource # min :: InputSource -> InputSource -> InputSource #
Ord InputMode
Instance details Defined in GI.Gdk.Enums Methods compare :: InputMode -> InputMode -> Ordering # (<) :: InputMode -> InputMode -> Bool # (<=) :: InputMode -> InputMode -> Bool # (>) :: InputMode -> InputMode -> Bool # (>=) :: InputMode -> InputMode -> Bool # max :: InputMode -> InputMode -> InputMode # min :: InputMode -> InputMode -> InputMode #
Ord Gravity
Instance details Defined in GI.Gdk.Enums Methods compare :: Gravity -> Gravity -> Ordering # (<) :: Gravity -> Gravity -> Bool # (<=) :: Gravity -> Gravity -> Bool # (>) :: Gravity -> Gravity -> Bool # (>=) :: Gravity -> Gravity -> Bool # max :: Gravity -> Gravity -> Gravity # min :: Gravity -> Gravity -> Gravity #
Ord GrabStatus
Instance details Defined in GI.Gdk.Enums Methods compare :: GrabStatus -> GrabStatus -> Ordering # (<) :: GrabStatus -> GrabStatus -> Bool # (<=) :: GrabStatus -> GrabStatus -> Bool # (>) :: GrabStatus -> GrabStatus -> Bool # (>=) :: GrabStatus -> GrabStatus -> Bool # max :: GrabStatus -> GrabStatus -> GrabStatus # min :: GrabStatus -> GrabStatus -> GrabStatus #
Ord GrabOwnership
Instance details Defined in GI.Gdk.Enums Methods compare :: GrabOwnership -> GrabOwnership -> Ordering # (<) :: GrabOwnership -> GrabOwnership -> Bool # (<=) :: GrabOwnership -> GrabOwnership -> Bool # (>) :: GrabOwnership -> GrabOwnership -> Bool # (>=) :: GrabOwnership -> GrabOwnership -> Bool # max :: GrabOwnership -> GrabOwnership -> GrabOwnership # min :: GrabOwnership -> GrabOwnership -> GrabOwnership #
Ord GLError
Instance details Defined in GI.Gdk.Enums Methods compare :: GLError -> GLError -> Ordering # (<) :: GLError -> GLError -> Bool # (<=) :: GLError -> GLError -> Bool # (>) :: GLError -> GLError -> Bool # (>=) :: GLError -> GLError -> Bool # max :: GLError -> GLError -> GLError # min :: GLError -> GLError -> GLError #
Ord FullscreenMode
Instance details Defined in GI.Gdk.Enums Methods compare :: FullscreenMode -> FullscreenMode -> Ordering # (<) :: FullscreenMode -> FullscreenMode -> Bool # (<=) :: FullscreenMode -> FullscreenMode -> Bool # (>) :: FullscreenMode -> FullscreenMode -> Bool # (>=) :: FullscreenMode -> FullscreenMode -> Bool # max :: FullscreenMode -> FullscreenMode -> FullscreenMode # min :: FullscreenMode -> FullscreenMode -> FullscreenMode #
Ord FilterReturn
Instance details Defined in GI.Gdk.Enums Methods compare :: FilterReturn -> FilterReturn -> Ordering # (<) :: FilterReturn -> FilterReturn -> Bool # (<=) :: FilterReturn -> FilterReturn -> Bool # (>) :: FilterReturn -> FilterReturn -> Bool # (>=) :: FilterReturn -> FilterReturn -> Bool # max :: FilterReturn -> FilterReturn -> FilterReturn # min :: FilterReturn -> FilterReturn -> FilterReturn #
Ord EventType
Instance details Defined in GI.Gdk.Enums Methods compare :: EventType -> EventType -> Ordering # (<) :: EventType -> EventType -> Bool # (<=) :: EventType -> EventType -> Bool # (>) :: EventType -> EventType -> Bool # (>=) :: EventType -> EventType -> Bool # max :: EventType -> EventType -> EventType # min :: EventType -> EventType -> EventType #
Ord DragProtocol
Instance details Defined in GI.Gdk.Enums Methods compare :: DragProtocol -> DragProtocol -> Ordering # (<) :: DragProtocol -> DragProtocol -> Bool # (<=) :: DragProtocol -> DragProtocol -> Bool # (>) :: DragProtocol -> DragProtocol -> Bool # (>=) :: DragProtocol -> DragProtocol -> Bool # max :: DragProtocol -> DragProtocol -> DragProtocol # min :: DragProtocol -> DragProtocol -> DragProtocol #
Ord DragCancelReason
Instance details Defined in GI.Gdk.Enums Methods compare :: DragCancelReason -> DragCancelReason -> Ordering # (<) :: DragCancelReason -> DragCancelReason -> Bool # (<=) :: DragCancelReason -> DragCancelReason -> Bool # (>) :: DragCancelReason -> DragCancelReason -> Bool # (>=) :: DragCancelReason -> DragCancelReason -> Bool # max :: DragCancelReason -> DragCancelReason -> DragCancelReason # min :: DragCancelReason -> DragCancelReason -> DragCancelReason #
Ord DeviceType
Instance details Defined in GI.Gdk.Enums Methods compare :: DeviceType -> DeviceType -> Ordering # (<) :: DeviceType -> DeviceType -> Bool # (<=) :: DeviceType -> DeviceType -> Bool # (>) :: DeviceType -> DeviceType -> Bool # (>=) :: DeviceType -> DeviceType -> Bool # max :: DeviceType -> DeviceType -> DeviceType # min :: DeviceType -> DeviceType -> DeviceType #
Ord DeviceToolType
Instance details Defined in GI.Gdk.Enums Methods compare :: DeviceToolType -> DeviceToolType -> Ordering # (<) :: DeviceToolType -> DeviceToolType -> Bool # (<=) :: DeviceToolType -> DeviceToolType -> Bool # (>) :: DeviceToolType -> DeviceToolType -> Bool # (>=) :: DeviceToolType -> DeviceToolType -> Bool # max :: DeviceToolType -> DeviceToolType -> DeviceToolType # min :: DeviceToolType -> DeviceToolType -> DeviceToolType #
Ord DevicePadFeature
Instance details Defined in GI.Gdk.Enums Methods compare :: DevicePadFeature -> DevicePadFeature -> Ordering # (<) :: DevicePadFeature -> DevicePadFeature -> Bool # (<=) :: DevicePadFeature -> DevicePadFeature -> Bool # (>) :: DevicePadFeature -> DevicePadFeature -> Bool # (>=) :: DevicePadFeature -> DevicePadFeature -> Bool # max :: DevicePadFeature -> DevicePadFeature -> DevicePadFeature # min :: DevicePadFeature -> DevicePadFeature -> DevicePadFeature #
Ord CursorType
Instance details Defined in GI.Gdk.Enums Methods compare :: CursorType -> CursorType -> Ordering # (<) :: CursorType -> CursorType -> Bool # (<=) :: CursorType -> CursorType -> Bool # (>) :: CursorType -> CursorType -> Bool # (>=) :: CursorType -> CursorType -> Bool # max :: CursorType -> CursorType -> CursorType # min :: CursorType -> CursorType -> CursorType #
Ord CrossingMode
Instance details Defined in GI.Gdk.Enums Methods compare :: CrossingMode -> CrossingMode -> Ordering # (<) :: CrossingMode -> CrossingMode -> Bool # (<=) :: CrossingMode -> CrossingMode -> Bool # (>) :: CrossingMode -> CrossingMode -> Bool # (>=) :: CrossingMode -> CrossingMode -> Bool # max :: CrossingMode -> CrossingMode -> CrossingMode # min :: CrossingMode -> CrossingMode -> CrossingMode #
Ord ByteOrder
Instance details Defined in GI.Gdk.Enums Methods compare :: ByteOrder -> ByteOrder -> Ordering # (<) :: ByteOrder -> ByteOrder -> Bool # (<=) :: ByteOrder -> ByteOrder -> Bool # (>) :: ByteOrder -> ByteOrder -> Bool # (>=) :: ByteOrder -> ByteOrder -> Bool # max :: ByteOrder -> ByteOrder -> ByteOrder # min :: ByteOrder -> ByteOrder -> ByteOrder #
Ord AxisUse
Instance details Defined in GI.Gdk.Enums Methods compare :: AxisUse -> AxisUse -> Ordering # (<) :: AxisUse -> AxisUse -> Bool # (<=) :: AxisUse -> AxisUse -> Bool # (>) :: AxisUse -> AxisUse -> Bool # (>=) :: AxisUse -> AxisUse -> Bool # max :: AxisUse -> AxisUse -> AxisUse # min :: AxisUse -> AxisUse -> AxisUse #
Ord TlsPasswordFlags
Instance details Defined in GI.Gio.Flags Methods compare :: TlsPasswordFlags -> TlsPasswordFlags -> Ordering # (<) :: TlsPasswordFlags -> TlsPasswordFlags -> Bool # (<=) :: TlsPasswordFlags -> TlsPasswordFlags -> Bool # (>) :: TlsPasswordFlags -> TlsPasswordFlags -> Bool # (>=) :: TlsPasswordFlags -> TlsPasswordFlags -> Bool # max :: TlsPasswordFlags -> TlsPasswordFlags -> TlsPasswordFlags # min :: TlsPasswordFlags -> TlsPasswordFlags -> TlsPasswordFlags #
Ord TlsDatabaseVerifyFlags
Instance details Defined in GI.Gio.Flags Methods compare :: TlsDatabaseVerifyFlags -> TlsDatabaseVerifyFlags -> Ordering # (<) :: TlsDatabaseVerifyFlags -> TlsDatabaseVerifyFlags -> Bool # (<=) :: TlsDatabaseVerifyFlags -> TlsDatabaseVerifyFlags -> Bool # (>) :: TlsDatabaseVerifyFlags -> TlsDatabaseVerifyFlags -> Bool # (>=) :: TlsDatabaseVerifyFlags -> TlsDatabaseVerifyFlags -> Bool # max :: TlsDatabaseVerifyFlags -> TlsDatabaseVerifyFlags -> TlsDatabaseVerifyFlags # min :: TlsDatabaseVerifyFlags -> TlsDatabaseVerifyFlags -> TlsDatabaseVerifyFlags #
Ord TlsCertificateFlags
Instance details Defined in GI.Gio.Flags Methods compare :: TlsCertificateFlags -> TlsCertificateFlags -> Ordering # (<) :: TlsCertificateFlags -> TlsCertificateFlags -> Bool # (<=) :: TlsCertificateFlags -> TlsCertificateFlags -> Bool # (>) :: TlsCertificateFlags -> TlsCertificateFlags -> Bool # (>=) :: TlsCertificateFlags -> TlsCertificateFlags -> Bool # max :: TlsCertificateFlags -> TlsCertificateFlags -> TlsCertificateFlags # min :: TlsCertificateFlags -> TlsCertificateFlags -> TlsCertificateFlags #
Ord TestDBusFlags
Instance details Defined in GI.Gio.Flags Methods compare :: TestDBusFlags -> TestDBusFlags -> Ordering # (<) :: TestDBusFlags -> TestDBusFlags -> Bool # (<=) :: TestDBusFlags -> TestDBusFlags -> Bool # (>) :: TestDBusFlags -> TestDBusFlags -> Bool # (>=) :: TestDBusFlags -> TestDBusFlags -> Bool # max :: TestDBusFlags -> TestDBusFlags -> TestDBusFlags # min :: TestDBusFlags -> TestDBusFlags -> TestDBusFlags #
Ord SubprocessFlags
Instance details Defined in GI.Gio.Flags Methods compare :: SubprocessFlags -> SubprocessFlags -> Ordering # (<) :: SubprocessFlags -> SubprocessFlags -> Bool # (<=) :: SubprocessFlags -> SubprocessFlags -> Bool # (>) :: SubprocessFlags -> SubprocessFlags -> Bool # (>=) :: SubprocessFlags -> SubprocessFlags -> Bool # max :: SubprocessFlags -> SubprocessFlags -> SubprocessFlags # min :: SubprocessFlags -> SubprocessFlags -> SubprocessFlags #
Ord SocketMsgFlags
Instance details Defined in GI.Gio.Flags Methods compare :: SocketMsgFlags -> SocketMsgFlags -> Ordering # (<) :: SocketMsgFlags -> SocketMsgFlags -> Bool # (<=) :: SocketMsgFlags -> SocketMsgFlags -> Bool # (>) :: SocketMsgFlags -> SocketMsgFlags -> Bool # (>=) :: SocketMsgFlags -> SocketMsgFlags -> Bool # max :: SocketMsgFlags -> SocketMsgFlags -> SocketMsgFlags # min :: SocketMsgFlags -> SocketMsgFlags -> SocketMsgFlags #
Ord SettingsBindFlags
Instance details Defined in GI.Gio.Flags Methods compare :: SettingsBindFlags -> SettingsBindFlags -> Ordering # (<) :: SettingsBindFlags -> SettingsBindFlags -> Bool # (<=) :: SettingsBindFlags -> SettingsBindFlags -> Bool # (>) :: SettingsBindFlags -> SettingsBindFlags -> Bool # (>=) :: SettingsBindFlags -> SettingsBindFlags -> Bool # max :: SettingsBindFlags -> SettingsBindFlags -> SettingsBindFlags # min :: SettingsBindFlags -> SettingsBindFlags -> SettingsBindFlags #
Ord ResourceLookupFlags
Instance details Defined in GI.Gio.Flags Methods compare :: ResourceLookupFlags -> ResourceLookupFlags -> Ordering # (<) :: ResourceLookupFlags -> ResourceLookupFlags -> Bool # (<=) :: ResourceLookupFlags -> ResourceLookupFlags -> Bool # (>) :: ResourceLookupFlags -> ResourceLookupFlags -> Bool # (>=) :: ResourceLookupFlags -> ResourceLookupFlags -> Bool # max :: ResourceLookupFlags -> ResourceLookupFlags -> ResourceLookupFlags # min :: ResourceLookupFlags -> ResourceLookupFlags -> ResourceLookupFlags #
Ord ResourceFlags
Instance details Defined in GI.Gio.Flags Methods compare :: ResourceFlags -> ResourceFlags -> Ordering # (<) :: ResourceFlags -> ResourceFlags -> Bool # (<=) :: ResourceFlags -> ResourceFlags -> Bool # (>) :: ResourceFlags -> ResourceFlags -> Bool # (>=) :: ResourceFlags -> ResourceFlags -> Bool # max :: ResourceFlags -> ResourceFlags -> ResourceFlags # min :: ResourceFlags -> ResourceFlags -> ResourceFlags #
Ord OutputStreamSpliceFlags
Instance details Defined in GI.Gio.Flags Methods compare :: OutputStreamSpliceFlags -> OutputStreamSpliceFlags -> Ordering # (<) :: OutputStreamSpliceFlags -> OutputStreamSpliceFlags -> Bool # (<=) :: OutputStreamSpliceFlags -> OutputStreamSpliceFlags -> Bool # (>) :: OutputStreamSpliceFlags -> OutputStreamSpliceFlags -> Bool # (>=) :: OutputStreamSpliceFlags -> OutputStreamSpliceFlags -> Bool # max :: OutputStreamSpliceFlags -> OutputStreamSpliceFlags -> OutputStreamSpliceFlags # min :: OutputStreamSpliceFlags -> OutputStreamSpliceFlags -> OutputStreamSpliceFlags #
Ord MountUnmountFlags
Instance details Defined in GI.Gio.Flags Methods compare :: MountUnmountFlags -> MountUnmountFlags -> Ordering # (<) :: MountUnmountFlags -> MountUnmountFlags -> Bool # (<=) :: MountUnmountFlags -> MountUnmountFlags -> Bool # (>) :: MountUnmountFlags -> MountUnmountFlags -> Bool # (>=) :: MountUnmountFlags -> MountUnmountFlags -> Bool # max :: MountUnmountFlags -> MountUnmountFlags -> MountUnmountFlags # min :: MountUnmountFlags -> MountUnmountFlags -> MountUnmountFlags #
Ord MountMountFlags
Instance details Defined in GI.Gio.Flags Methods compare :: MountMountFlags -> MountMountFlags -> Ordering # (<) :: MountMountFlags -> MountMountFlags -> Bool # (<=) :: MountMountFlags -> MountMountFlags -> Bool # (>) :: MountMountFlags -> MountMountFlags -> Bool # (>=) :: MountMountFlags -> MountMountFlags -> Bool # max :: MountMountFlags -> MountMountFlags -> MountMountFlags # min :: MountMountFlags -> MountMountFlags -> MountMountFlags #
Ord IOStreamSpliceFlags
Instance details Defined in GI.Gio.Flags Methods compare :: IOStreamSpliceFlags -> IOStreamSpliceFlags -> Ordering # (<) :: IOStreamSpliceFlags -> IOStreamSpliceFlags -> Bool # (<=) :: IOStreamSpliceFlags -> IOStreamSpliceFlags -> Bool # (>) :: IOStreamSpliceFlags -> IOStreamSpliceFlags -> Bool # (>=) :: IOStreamSpliceFlags -> IOStreamSpliceFlags -> Bool # max :: IOStreamSpliceFlags -> IOStreamSpliceFlags -> IOStreamSpliceFlags # min :: IOStreamSpliceFlags -> IOStreamSpliceFlags -> IOStreamSpliceFlags #
Ord FileQueryInfoFlags
Instance details Defined in GI.Gio.Flags Methods compare :: FileQueryInfoFlags -> FileQueryInfoFlags -> Ordering # (<) :: FileQueryInfoFlags -> FileQueryInfoFlags -> Bool # (<=) :: FileQueryInfoFlags -> FileQueryInfoFlags -> Bool # (>) :: FileQueryInfoFlags -> FileQueryInfoFlags -> Bool # (>=) :: FileQueryInfoFlags -> FileQueryInfoFlags -> Bool # max :: FileQueryInfoFlags -> FileQueryInfoFlags -> FileQueryInfoFlags # min :: FileQueryInfoFlags -> FileQueryInfoFlags -> FileQueryInfoFlags #
Ord FileMonitorFlags
Instance details Defined in GI.Gio.Flags Methods compare :: FileMonitorFlags -> FileMonitorFlags -> Ordering # (<) :: FileMonitorFlags -> FileMonitorFlags -> Bool # (<=) :: FileMonitorFlags -> FileMonitorFlags -> Bool # (>) :: FileMonitorFlags -> FileMonitorFlags -> Bool # (>=) :: FileMonitorFlags -> FileMonitorFlags -> Bool # max :: FileMonitorFlags -> FileMonitorFlags -> FileMonitorFlags # min :: FileMonitorFlags -> FileMonitorFlags -> FileMonitorFlags #
Ord FileMeasureFlags
Instance details Defined in GI.Gio.Flags Methods compare :: FileMeasureFlags -> FileMeasureFlags -> Ordering # (<) :: FileMeasureFlags -> FileMeasureFlags -> Bool # (<=) :: FileMeasureFlags -> FileMeasureFlags -> Bool # (>) :: FileMeasureFlags -> FileMeasureFlags -> Bool # (>=) :: FileMeasureFlags -> FileMeasureFlags -> Bool # max :: FileMeasureFlags -> FileMeasureFlags -> FileMeasureFlags # min :: FileMeasureFlags -> FileMeasureFlags -> FileMeasureFlags #
Ord FileCreateFlags
Instance details Defined in GI.Gio.Flags Methods compare :: FileCreateFlags -> FileCreateFlags -> Ordering # (<) :: FileCreateFlags -> FileCreateFlags -> Bool # (<=) :: FileCreateFlags -> FileCreateFlags -> Bool # (>) :: FileCreateFlags -> FileCreateFlags -> Bool # (>=) :: FileCreateFlags -> FileCreateFlags -> Bool # max :: FileCreateFlags -> FileCreateFlags -> FileCreateFlags # min :: FileCreateFlags -> FileCreateFlags -> FileCreateFlags #
Ord FileCopyFlags
Instance details Defined in GI.Gio.Flags Methods compare :: FileCopyFlags -> FileCopyFlags -> Ordering # (<) :: FileCopyFlags -> FileCopyFlags -> Bool # (<=) :: FileCopyFlags -> FileCopyFlags -> Bool # (>) :: FileCopyFlags -> FileCopyFlags -> Bool # (>=) :: FileCopyFlags -> FileCopyFlags -> Bool # max :: FileCopyFlags -> FileCopyFlags -> FileCopyFlags # min :: FileCopyFlags -> FileCopyFlags -> FileCopyFlags #
Ord FileAttributeInfoFlags
Instance details Defined in GI.Gio.Flags Methods compare :: FileAttributeInfoFlags -> FileAttributeInfoFlags -> Ordering # (<) :: FileAttributeInfoFlags -> FileAttributeInfoFlags -> Bool # (<=) :: FileAttributeInfoFlags -> FileAttributeInfoFlags -> Bool # (>) :: FileAttributeInfoFlags -> FileAttributeInfoFlags -> Bool # (>=) :: FileAttributeInfoFlags -> FileAttributeInfoFlags -> Bool # max :: FileAttributeInfoFlags -> FileAttributeInfoFlags -> FileAttributeInfoFlags # min :: FileAttributeInfoFlags -> FileAttributeInfoFlags -> FileAttributeInfoFlags #
Ord DriveStartFlags
Instance details Defined in GI.Gio.Flags Methods compare :: DriveStartFlags -> DriveStartFlags -> Ordering # (<) :: DriveStartFlags -> DriveStartFlags -> Bool # (<=) :: DriveStartFlags -> DriveStartFlags -> Bool # (>) :: DriveStartFlags -> DriveStartFlags -> Bool # (>=) :: DriveStartFlags -> DriveStartFlags -> Bool # max :: DriveStartFlags -> DriveStartFlags -> DriveStartFlags # min :: DriveStartFlags -> DriveStartFlags -> DriveStartFlags #
Ord DBusSubtreeFlags
Instance details Defined in GI.Gio.Flags Methods compare :: DBusSubtreeFlags -> DBusSubtreeFlags -> Ordering # (<) :: DBusSubtreeFlags -> DBusSubtreeFlags -> Bool # (<=) :: DBusSubtreeFlags -> DBusSubtreeFlags -> Bool # (>) :: DBusSubtreeFlags -> DBusSubtreeFlags -> Bool # (>=) :: DBusSubtreeFlags -> DBusSubtreeFlags -> Bool # max :: DBusSubtreeFlags -> DBusSubtreeFlags -> DBusSubtreeFlags # min :: DBusSubtreeFlags -> DBusSubtreeFlags -> DBusSubtreeFlags #
Ord DBusSignalFlags
Instance details Defined in GI.Gio.Flags Methods compare :: DBusSignalFlags -> DBusSignalFlags -> Ordering # (<) :: DBusSignalFlags -> DBusSignalFlags -> Bool # (<=) :: DBusSignalFlags -> DBusSignalFlags -> Bool # (>) :: DBusSignalFlags -> DBusSignalFlags -> Bool # (>=) :: DBusSignalFlags -> DBusSignalFlags -> Bool # max :: DBusSignalFlags -> DBusSignalFlags -> DBusSignalFlags # min :: DBusSignalFlags -> DBusSignalFlags -> DBusSignalFlags #
Ord DBusServerFlags
Instance details Defined in GI.Gio.Flags Methods compare :: DBusServerFlags -> DBusServerFlags -> Ordering # (<) :: DBusServerFlags -> DBusServerFlags -> Bool # (<=) :: DBusServerFlags -> DBusServerFlags -> Bool # (>) :: DBusServerFlags -> DBusServerFlags -> Bool # (>=) :: DBusServerFlags -> DBusServerFlags -> Bool # max :: DBusServerFlags -> DBusServerFlags -> DBusServerFlags # min :: DBusServerFlags -> DBusServerFlags -> DBusServerFlags #
Ord DBusSendMessageFlags
Instance details Defined in GI.Gio.Flags Methods compare :: DBusSendMessageFlags -> DBusSendMessageFlags -> Ordering # (<) :: DBusSendMessageFlags -> DBusSendMessageFlags -> Bool # (<=) :: DBusSendMessageFlags -> DBusSendMessageFlags -> Bool # (>) :: DBusSendMessageFlags -> DBusSendMessageFlags -> Bool # (>=) :: DBusSendMessageFlags -> DBusSendMessageFlags -> Bool # max :: DBusSendMessageFlags -> DBusSendMessageFlags -> DBusSendMessageFlags # min :: DBusSendMessageFlags -> DBusSendMessageFlags -> DBusSendMessageFlags #
Ord DBusProxyFlags
Instance details Defined in GI.Gio.Flags Methods compare :: DBusProxyFlags -> DBusProxyFlags -> Ordering # (<) :: DBusProxyFlags -> DBusProxyFlags -> Bool # (<=) :: DBusProxyFlags -> DBusProxyFlags -> Bool # (>) :: DBusProxyFlags -> DBusProxyFlags -> Bool # (>=) :: DBusProxyFlags -> DBusProxyFlags -> Bool # max :: DBusProxyFlags -> DBusProxyFlags -> DBusProxyFlags # min :: DBusProxyFlags -> DBusProxyFlags -> DBusProxyFlags #
Ord DBusPropertyInfoFlags
Instance details Defined in GI.Gio.Flags Methods compare :: DBusPropertyInfoFlags -> DBusPropertyInfoFlags -> Ordering # (<) :: DBusPropertyInfoFlags -> DBusPropertyInfoFlags -> Bool # (<=) :: DBusPropertyInfoFlags -> DBusPropertyInfoFlags -> Bool # (>) :: DBusPropertyInfoFlags -> DBusPropertyInfoFlags -> Bool # (>=) :: DBusPropertyInfoFlags -> DBusPropertyInfoFlags -> Bool # max :: DBusPropertyInfoFlags -> DBusPropertyInfoFlags -> DBusPropertyInfoFlags # min :: DBusPropertyInfoFlags -> DBusPropertyInfoFlags -> DBusPropertyInfoFlags #
Ord DBusObjectManagerClientFlags
Instance details Defined in GI.Gio.Flags Methods compare :: DBusObjectManagerClientFlags -> DBusObjectManagerClientFlags -> Ordering # (<) :: DBusObjectManagerClientFlags -> DBusObjectManagerClientFlags -> Bool # (<=) :: DBusObjectManagerClientFlags -> DBusObjectManagerClientFlags -> Bool # (>) :: DBusObjectManagerClientFlags -> DBusObjectManagerClientFlags -> Bool # (>=) :: DBusObjectManagerClientFlags -> DBusObjectManagerClientFlags -> Bool # max :: DBusObjectManagerClientFlags -> DBusObjectManagerClientFlags -> DBusObjectManagerClientFlags # min :: DBusObjectManagerClientFlags -> DBusObjectManagerClientFlags -> DBusObjectManagerClientFlags #
Ord DBusMessageFlags
Instance details Defined in GI.Gio.Flags Methods compare :: DBusMessageFlags -> DBusMessageFlags -> Ordering # (<) :: DBusMessageFlags -> DBusMessageFlags -> Bool # (<=) :: DBusMessageFlags -> DBusMessageFlags -> Bool # (>) :: DBusMessageFlags -> DBusMessageFlags -> Bool # (>=) :: DBusMessageFlags -> DBusMessageFlags -> Bool # max :: DBusMessageFlags -> DBusMessageFlags -> DBusMessageFlags # min :: DBusMessageFlags -> DBusMessageFlags -> DBusMessageFlags #
Ord DBusInterfaceSkeletonFlags
Instance details Defined in GI.Gio.Flags Methods compare :: DBusInterfaceSkeletonFlags -> DBusInterfaceSkeletonFlags -> Ordering # (<) :: DBusInterfaceSkeletonFlags -> DBusInterfaceSkeletonFlags -> Bool # (<=) :: DBusInterfaceSkeletonFlags -> DBusInterfaceSkeletonFlags -> Bool # (>) :: DBusInterfaceSkeletonFlags -> DBusInterfaceSkeletonFlags -> Bool # (>=) :: DBusInterfaceSkeletonFlags -> DBusInterfaceSkeletonFlags -> Bool # max :: DBusInterfaceSkeletonFlags -> DBusInterfaceSkeletonFlags -> DBusInterfaceSkeletonFlags # min :: DBusInterfaceSkeletonFlags -> DBusInterfaceSkeletonFlags -> DBusInterfaceSkeletonFlags #
Ord DBusConnectionFlags
Instance details Defined in GI.Gio.Flags Methods compare :: DBusConnectionFlags -> DBusConnectionFlags -> Ordering # (<) :: DBusConnectionFlags -> DBusConnectionFlags -> Bool # (<=) :: DBusConnectionFlags -> DBusConnectionFlags -> Bool # (>) :: DBusConnectionFlags -> DBusConnectionFlags -> Bool # (>=) :: DBusConnectionFlags -> DBusConnectionFlags -> Bool # max :: DBusConnectionFlags -> DBusConnectionFlags -> DBusConnectionFlags # min :: DBusConnectionFlags -> DBusConnectionFlags -> DBusConnectionFlags #
Ord DBusCapabilityFlags
Instance details Defined in GI.Gio.Flags Methods compare :: DBusCapabilityFlags -> DBusCapabilityFlags -> Ordering # (<) :: DBusCapabilityFlags -> DBusCapabilityFlags -> Bool # (<=) :: DBusCapabilityFlags -> DBusCapabilityFlags -> Bool # (>) :: DBusCapabilityFlags -> DBusCapabilityFlags -> Bool # (>=) :: DBusCapabilityFlags -> DBusCapabilityFlags -> Bool # max :: DBusCapabilityFlags -> DBusCapabilityFlags -> DBusCapabilityFlags # min :: DBusCapabilityFlags -> DBusCapabilityFlags -> DBusCapabilityFlags #
Ord DBusCallFlags
Instance details Defined in GI.Gio.Flags Methods compare :: DBusCallFlags -> DBusCallFlags -> Ordering # (<) :: DBusCallFlags -> DBusCallFlags -> Bool # (<=) :: DBusCallFlags -> DBusCallFlags -> Bool # (>) :: DBusCallFlags -> DBusCallFlags -> Bool # (>=) :: DBusCallFlags -> DBusCallFlags -> Bool # max :: DBusCallFlags -> DBusCallFlags -> DBusCallFlags # min :: DBusCallFlags -> DBusCallFlags -> DBusCallFlags #
Ord ConverterFlags
Instance details Defined in GI.Gio.Flags Methods compare :: ConverterFlags -> ConverterFlags -> Ordering # (<) :: ConverterFlags -> ConverterFlags -> Bool # (<=) :: ConverterFlags -> ConverterFlags -> Bool # (>) :: ConverterFlags -> ConverterFlags -> Bool # (>=) :: ConverterFlags -> ConverterFlags -> Bool # max :: ConverterFlags -> ConverterFlags -> ConverterFlags # min :: ConverterFlags -> ConverterFlags -> ConverterFlags #
Ord BusNameWatcherFlags
Instance details Defined in GI.Gio.Flags Methods compare :: BusNameWatcherFlags -> BusNameWatcherFlags -> Ordering # (<) :: BusNameWatcherFlags -> BusNameWatcherFlags -> Bool # (<=) :: BusNameWatcherFlags -> BusNameWatcherFlags -> Bool # (>) :: BusNameWatcherFlags -> BusNameWatcherFlags -> Bool # (>=) :: BusNameWatcherFlags -> BusNameWatcherFlags -> Bool # max :: BusNameWatcherFlags -> BusNameWatcherFlags -> BusNameWatcherFlags # min :: BusNameWatcherFlags -> BusNameWatcherFlags -> BusNameWatcherFlags #
Ord BusNameOwnerFlags
Instance details Defined in GI.Gio.Flags Methods compare :: BusNameOwnerFlags -> BusNameOwnerFlags -> Ordering # (<) :: BusNameOwnerFlags -> BusNameOwnerFlags -> Bool # (<=) :: BusNameOwnerFlags -> BusNameOwnerFlags -> Bool # (>) :: BusNameOwnerFlags -> BusNameOwnerFlags -> Bool # (>=) :: BusNameOwnerFlags -> BusNameOwnerFlags -> Bool # max :: BusNameOwnerFlags -> BusNameOwnerFlags -> BusNameOwnerFlags # min :: BusNameOwnerFlags -> BusNameOwnerFlags -> BusNameOwnerFlags #
Ord AskPasswordFlags
Instance details Defined in GI.Gio.Flags Methods compare :: AskPasswordFlags -> AskPasswordFlags -> Ordering # (<) :: AskPasswordFlags -> AskPasswordFlags -> Bool # (<=) :: AskPasswordFlags -> AskPasswordFlags -> Bool # (>) :: AskPasswordFlags -> AskPasswordFlags -> Bool # (>=) :: AskPasswordFlags -> AskPasswordFlags -> Bool # max :: AskPasswordFlags -> AskPasswordFlags -> AskPasswordFlags # min :: AskPasswordFlags -> AskPasswordFlags -> AskPasswordFlags #
Ord ApplicationFlags
Instance details Defined in GI.Gio.Flags Methods compare :: ApplicationFlags -> ApplicationFlags -> Ordering # (<) :: ApplicationFlags -> ApplicationFlags -> Bool # (<=) :: ApplicationFlags -> ApplicationFlags -> Bool # (>) :: ApplicationFlags -> ApplicationFlags -> Bool # (>=) :: ApplicationFlags -> ApplicationFlags -> Bool # max :: ApplicationFlags -> ApplicationFlags -> ApplicationFlags # min :: ApplicationFlags -> ApplicationFlags -> ApplicationFlags #
Ord AppInfoCreateFlags
Instance details Defined in GI.Gio.Flags Methods compare :: AppInfoCreateFlags -> AppInfoCreateFlags -> Ordering # (<) :: AppInfoCreateFlags -> AppInfoCreateFlags -> Bool # (<=) :: AppInfoCreateFlags -> AppInfoCreateFlags -> Bool # (>) :: AppInfoCreateFlags -> AppInfoCreateFlags -> Bool # (>=) :: AppInfoCreateFlags -> AppInfoCreateFlags -> Bool # max :: AppInfoCreateFlags -> AppInfoCreateFlags -> AppInfoCreateFlags # min :: AppInfoCreateFlags -> AppInfoCreateFlags -> AppInfoCreateFlags #
Ord ZlibCompressorFormat
Instance details Defined in GI.Gio.Enums Methods compare :: ZlibCompressorFormat -> ZlibCompressorFormat -> Ordering # (<) :: ZlibCompressorFormat -> ZlibCompressorFormat -> Bool # (<=) :: ZlibCompressorFormat -> ZlibCompressorFormat -> Bool # (>) :: ZlibCompressorFormat -> ZlibCompressorFormat -> Bool # (>=) :: ZlibCompressorFormat -> ZlibCompressorFormat -> Bool # max :: ZlibCompressorFormat -> ZlibCompressorFormat -> ZlibCompressorFormat # min :: ZlibCompressorFormat -> ZlibCompressorFormat -> ZlibCompressorFormat #
Ord UnixSocketAddressType
Instance details Defined in GI.Gio.Enums Methods compare :: UnixSocketAddressType -> UnixSocketAddressType -> Ordering # (<) :: UnixSocketAddressType -> UnixSocketAddressType -> Bool # (<=) :: UnixSocketAddressType -> UnixSocketAddressType -> Bool # (>) :: UnixSocketAddressType -> UnixSocketAddressType -> Bool # (>=) :: UnixSocketAddressType -> UnixSocketAddressType -> Bool # max :: UnixSocketAddressType -> UnixSocketAddressType -> UnixSocketAddressType # min :: UnixSocketAddressType -> UnixSocketAddressType -> UnixSocketAddressType #
Ord TlsRehandshakeMode
Instance details Defined in GI.Gio.Enums Methods compare :: TlsRehandshakeMode -> TlsRehandshakeMode -> Ordering # (<) :: TlsRehandshakeMode -> TlsRehandshakeMode -> Bool # (<=) :: TlsRehandshakeMode -> TlsRehandshakeMode -> Bool # (>) :: TlsRehandshakeMode -> TlsRehandshakeMode -> Bool # (>=) :: TlsRehandshakeMode -> TlsRehandshakeMode -> Bool # max :: TlsRehandshakeMode -> TlsRehandshakeMode -> TlsRehandshakeMode # min :: TlsRehandshakeMode -> TlsRehandshakeMode -> TlsRehandshakeMode #
Ord TlsInteractionResult
Instance details Defined in GI.Gio.Enums Methods compare :: TlsInteractionResult -> TlsInteractionResult -> Ordering # (<) :: TlsInteractionResult -> TlsInteractionResult -> Bool # (<=) :: TlsInteractionResult -> TlsInteractionResult -> Bool # (>) :: TlsInteractionResult -> TlsInteractionResult -> Bool # (>=) :: TlsInteractionResult -> TlsInteractionResult -> Bool # max :: TlsInteractionResult -> TlsInteractionResult -> TlsInteractionResult # min :: TlsInteractionResult -> TlsInteractionResult -> TlsInteractionResult #
Ord TlsError
Instance details Defined in GI.Gio.Enums Methods compare :: TlsError -> TlsError -> Ordering # (<) :: TlsError -> TlsError -> Bool # (<=) :: TlsError -> TlsError -> Bool # (>) :: TlsError -> TlsError -> Bool # (>=) :: TlsError -> TlsError -> Bool # max :: TlsError -> TlsError -> TlsError # min :: TlsError -> TlsError -> TlsError #
Ord TlsDatabaseLookupFlags
Instance details Defined in GI.Gio.Enums Methods compare :: TlsDatabaseLookupFlags -> TlsDatabaseLookupFlags -> Ordering # (<) :: TlsDatabaseLookupFlags -> TlsDatabaseLookupFlags -> Bool # (<=) :: TlsDatabaseLookupFlags -> TlsDatabaseLookupFlags -> Bool # (>) :: TlsDatabaseLookupFlags -> TlsDatabaseLookupFlags -> Bool # (>=) :: TlsDatabaseLookupFlags -> TlsDatabaseLookupFlags -> Bool # max :: TlsDatabaseLookupFlags -> TlsDatabaseLookupFlags -> TlsDatabaseLookupFlags # min :: TlsDatabaseLookupFlags -> TlsDatabaseLookupFlags -> TlsDatabaseLookupFlags #
Ord TlsCertificateRequestFlags
Instance details Defined in GI.Gio.Enums Methods compare :: TlsCertificateRequestFlags -> TlsCertificateRequestFlags -> Ordering # (<) :: TlsCertificateRequestFlags -> TlsCertificateRequestFlags -> Bool # (<=) :: TlsCertificateRequestFlags -> TlsCertificateRequestFlags -> Bool # (>) :: TlsCertificateRequestFlags -> TlsCertificateRequestFlags -> Bool # (>=) :: TlsCertificateRequestFlags -> TlsCertificateRequestFlags -> Bool # max :: TlsCertificateRequestFlags -> TlsCertificateRequestFlags -> TlsCertificateRequestFlags # min :: TlsCertificateRequestFlags -> TlsCertificateRequestFlags -> TlsCertificateRequestFlags #
Ord TlsAuthenticationMode
Instance details Defined in GI.Gio.Enums Methods compare :: TlsAuthenticationMode -> TlsAuthenticationMode -> Ordering # (<) :: TlsAuthenticationMode -> TlsAuthenticationMode -> Bool # (<=) :: TlsAuthenticationMode -> TlsAuthenticationMode -> Bool # (>) :: TlsAuthenticationMode -> TlsAuthenticationMode -> Bool # (>=) :: TlsAuthenticationMode -> TlsAuthenticationMode -> Bool # max :: TlsAuthenticationMode -> TlsAuthenticationMode -> TlsAuthenticationMode # min :: TlsAuthenticationMode -> TlsAuthenticationMode -> TlsAuthenticationMode #
Ord SocketType
Instance details Defined in GI.Gio.Enums Methods compare :: SocketType -> SocketType -> Ordering # (<) :: SocketType -> SocketType -> Bool # (<=) :: SocketType -> SocketType -> Bool # (>) :: SocketType -> SocketType -> Bool # (>=) :: SocketType -> SocketType -> Bool # max :: SocketType -> SocketType -> SocketType # min :: SocketType -> SocketType -> SocketType #
Ord SocketProtocol
Instance details Defined in GI.Gio.Enums Methods compare :: SocketProtocol -> SocketProtocol -> Ordering # (<) :: SocketProtocol -> SocketProtocol -> Bool # (<=) :: SocketProtocol -> SocketProtocol -> Bool # (>) :: SocketProtocol -> SocketProtocol -> Bool # (>=) :: SocketProtocol -> SocketProtocol -> Bool # max :: SocketProtocol -> SocketProtocol -> SocketProtocol # min :: SocketProtocol -> SocketProtocol -> SocketProtocol #
Ord SocketListenerEvent
Instance details Defined in GI.Gio.Enums Methods compare :: SocketListenerEvent -> SocketListenerEvent -> Ordering # (<) :: SocketListenerEvent -> SocketListenerEvent -> Bool # (<=) :: SocketListenerEvent -> SocketListenerEvent -> Bool # (>) :: SocketListenerEvent -> SocketListenerEvent -> Bool # (>=) :: SocketListenerEvent -> SocketListenerEvent -> Bool # max :: SocketListenerEvent -> SocketListenerEvent -> SocketListenerEvent # min :: SocketListenerEvent -> SocketListenerEvent -> SocketListenerEvent #
Ord SocketFamily
Instance details Defined in GI.Gio.Enums Methods compare :: SocketFamily -> SocketFamily -> Ordering # (<) :: SocketFamily -> SocketFamily -> Bool # (<=) :: SocketFamily -> SocketFamily -> Bool # (>) :: SocketFamily -> SocketFamily -> Bool # (>=) :: SocketFamily -> SocketFamily -> Bool # max :: SocketFamily -> SocketFamily -> SocketFamily # min :: SocketFamily -> SocketFamily -> SocketFamily #
Ord SocketClientEvent
Instance details Defined in GI.Gio.Enums Methods compare :: SocketClientEvent -> SocketClientEvent -> Ordering # (<) :: SocketClientEvent -> SocketClientEvent -> Bool # (<=) :: SocketClientEvent -> SocketClientEvent -> Bool # (>) :: SocketClientEvent -> SocketClientEvent -> Bool # (>=) :: SocketClientEvent -> SocketClientEvent -> Bool # max :: SocketClientEvent -> SocketClientEvent -> SocketClientEvent # min :: SocketClientEvent -> SocketClientEvent -> SocketClientEvent #
Ord ResourceError
Instance details Defined in GI.Gio.Enums Methods compare :: ResourceError -> ResourceError -> Ordering # (<) :: ResourceError -> ResourceError -> Bool # (<=) :: ResourceError -> ResourceError -> Bool # (>) :: ResourceError -> ResourceError -> Bool # (>=) :: ResourceError -> ResourceError -> Bool # max :: ResourceError -> ResourceError -> ResourceError # min :: ResourceError -> ResourceError -> ResourceError #
Ord ResolverRecordType
Instance details Defined in GI.Gio.Enums Methods compare :: ResolverRecordType -> ResolverRecordType -> Ordering # (<) :: ResolverRecordType -> ResolverRecordType -> Bool # (<=) :: ResolverRecordType -> ResolverRecordType -> Bool # (>) :: ResolverRecordType -> ResolverRecordType -> Bool # (>=) :: ResolverRecordType -> ResolverRecordType -> Bool # max :: ResolverRecordType -> ResolverRecordType -> ResolverRecordType # min :: ResolverRecordType -> ResolverRecordType -> ResolverRecordType #
Ord ResolverError
Instance details Defined in GI.Gio.Enums Methods compare :: ResolverError -> ResolverError -> Ordering # (<) :: ResolverError -> ResolverError -> Bool # (<=) :: ResolverError -> ResolverError -> Bool # (>) :: ResolverError -> ResolverError -> Bool # (>=) :: ResolverError -> ResolverError -> Bool # max :: ResolverError -> ResolverError -> ResolverError # min :: ResolverError -> ResolverError -> ResolverError #
Ord PasswordSave
Instance details Defined in GI.Gio.Enums Methods compare :: PasswordSave -> PasswordSave -> Ordering # (<) :: PasswordSave -> PasswordSave -> Bool # (<=) :: PasswordSave -> PasswordSave -> Bool # (>) :: PasswordSave -> PasswordSave -> Bool # (>=) :: PasswordSave -> PasswordSave -> Bool # max :: PasswordSave -> PasswordSave -> PasswordSave # min :: PasswordSave -> PasswordSave -> PasswordSave #
Ord NotificationPriority
Instance details Defined in GI.Gio.Enums Methods compare :: NotificationPriority -> NotificationPriority -> Ordering # (<) :: NotificationPriority -> NotificationPriority -> Bool # (<=) :: NotificationPriority -> NotificationPriority -> Bool # (>) :: NotificationPriority -> NotificationPriority -> Bool # (>=) :: NotificationPriority -> NotificationPriority -> Bool # max :: NotificationPriority -> NotificationPriority -> NotificationPriority # min :: NotificationPriority -> NotificationPriority -> NotificationPriority #
Ord NetworkConnectivity
Instance details Defined in GI.Gio.Enums Methods compare :: NetworkConnectivity -> NetworkConnectivity -> Ordering # (<) :: NetworkConnectivity -> NetworkConnectivity -> Bool # (<=) :: NetworkConnectivity -> NetworkConnectivity -> Bool # (>) :: NetworkConnectivity -> NetworkConnectivity -> Bool # (>=) :: NetworkConnectivity -> NetworkConnectivity -> Bool # max :: NetworkConnectivity -> NetworkConnectivity -> NetworkConnectivity # min :: NetworkConnectivity -> NetworkConnectivity -> NetworkConnectivity #
Ord MountOperationResult
Instance details Defined in GI.Gio.Enums Methods compare :: MountOperationResult -> MountOperationResult -> Ordering # (<) :: MountOperationResult -> MountOperationResult -> Bool # (<=) :: MountOperationResult -> MountOperationResult -> Bool # (>) :: MountOperationResult -> MountOperationResult -> Bool # (>=) :: MountOperationResult -> MountOperationResult -> Bool # max :: MountOperationResult -> MountOperationResult -> MountOperationResult # min :: MountOperationResult -> MountOperationResult -> MountOperationResult #
Ord IOModuleScopeFlags
Instance details Defined in GI.Gio.Enums Methods compare :: IOModuleScopeFlags -> IOModuleScopeFlags -> Ordering # (<) :: IOModuleScopeFlags -> IOModuleScopeFlags -> Bool # (<=) :: IOModuleScopeFlags -> IOModuleScopeFlags -> Bool # (>) :: IOModuleScopeFlags -> IOModuleScopeFlags -> Bool # (>=) :: IOModuleScopeFlags -> IOModuleScopeFlags -> Bool # max :: IOModuleScopeFlags -> IOModuleScopeFlags -> IOModuleScopeFlags # min :: IOModuleScopeFlags -> IOModuleScopeFlags -> IOModuleScopeFlags #
Ord IOErrorEnum
Instance details Defined in GI.Gio.Enums Methods compare :: IOErrorEnum -> IOErrorEnum -> Ordering # (<) :: IOErrorEnum -> IOErrorEnum -> Bool # (<=) :: IOErrorEnum -> IOErrorEnum -> Bool # (>) :: IOErrorEnum -> IOErrorEnum -> Bool # (>=) :: IOErrorEnum -> IOErrorEnum -> Bool # max :: IOErrorEnum -> IOErrorEnum -> IOErrorEnum # min :: IOErrorEnum -> IOErrorEnum -> IOErrorEnum #
Ord FilesystemPreviewType
Instance details Defined in GI.Gio.Enums Methods compare :: FilesystemPreviewType -> FilesystemPreviewType -> Ordering # (<) :: FilesystemPreviewType -> FilesystemPreviewType -> Bool # (<=) :: FilesystemPreviewType -> FilesystemPreviewType -> Bool # (>) :: FilesystemPreviewType -> FilesystemPreviewType -> Bool # (>=) :: FilesystemPreviewType -> FilesystemPreviewType -> Bool # max :: FilesystemPreviewType -> FilesystemPreviewType -> FilesystemPreviewType # min :: FilesystemPreviewType -> FilesystemPreviewType -> FilesystemPreviewType #
Ord FileType
Instance details Defined in GI.Gio.Enums Methods compare :: FileType -> FileType -> Ordering # (<) :: FileType -> FileType -> Bool # (<=) :: FileType -> FileType -> Bool # (>) :: FileType -> FileType -> Bool # (>=) :: FileType -> FileType -> Bool # max :: FileType -> FileType -> FileType # min :: FileType -> FileType -> FileType #
Ord FileMonitorEvent
Instance details Defined in GI.Gio.Enums Methods compare :: FileMonitorEvent -> FileMonitorEvent -> Ordering # (<) :: FileMonitorEvent -> FileMonitorEvent -> Bool # (<=) :: FileMonitorEvent -> FileMonitorEvent -> Bool # (>) :: FileMonitorEvent -> FileMonitorEvent -> Bool # (>=) :: FileMonitorEvent -> FileMonitorEvent -> Bool # max :: FileMonitorEvent -> FileMonitorEvent -> FileMonitorEvent # min :: FileMonitorEvent -> FileMonitorEvent -> FileMonitorEvent #
Ord FileAttributeType
Instance details Defined in GI.Gio.Enums Methods compare :: FileAttributeType -> FileAttributeType -> Ordering # (<) :: FileAttributeType -> FileAttributeType -> Bool # (<=) :: FileAttributeType -> FileAttributeType -> Bool # (>) :: FileAttributeType -> FileAttributeType -> Bool # (>=) :: FileAttributeType -> FileAttributeType -> Bool # max :: FileAttributeType -> FileAttributeType -> FileAttributeType # min :: FileAttributeType -> FileAttributeType -> FileAttributeType #
Ord FileAttributeStatus
Instance details Defined in GI.Gio.Enums Methods compare :: FileAttributeStatus -> FileAttributeStatus -> Ordering # (<) :: FileAttributeStatus -> FileAttributeStatus -> Bool # (<=) :: FileAttributeStatus -> FileAttributeStatus -> Bool # (>) :: FileAttributeStatus -> FileAttributeStatus -> Bool # (>=) :: FileAttributeStatus -> FileAttributeStatus -> Bool # max :: FileAttributeStatus -> FileAttributeStatus -> FileAttributeStatus # min :: FileAttributeStatus -> FileAttributeStatus -> FileAttributeStatus #
Ord EmblemOrigin
Instance details Defined in GI.Gio.Enums Methods compare :: EmblemOrigin -> EmblemOrigin -> Ordering # (<) :: EmblemOrigin -> EmblemOrigin -> Bool # (<=) :: EmblemOrigin -> EmblemOrigin -> Bool # (>) :: EmblemOrigin -> EmblemOrigin -> Bool # (>=) :: EmblemOrigin -> EmblemOrigin -> Bool # max :: EmblemOrigin -> EmblemOrigin -> EmblemOrigin # min :: EmblemOrigin -> EmblemOrigin -> EmblemOrigin #
Ord DriveStartStopType
Instance details Defined in GI.Gio.Enums Methods compare :: DriveStartStopType -> DriveStartStopType -> Ordering # (<) :: DriveStartStopType -> DriveStartStopType -> Bool # (<=) :: DriveStartStopType -> DriveStartStopType -> Bool # (>) :: DriveStartStopType -> DriveStartStopType -> Bool # (>=) :: DriveStartStopType -> DriveStartStopType -> Bool # max :: DriveStartStopType -> DriveStartStopType -> DriveStartStopType # min :: DriveStartStopType -> DriveStartStopType -> DriveStartStopType #
Ord DataStreamNewlineType
Instance details Defined in GI.Gio.Enums Methods compare :: DataStreamNewlineType -> DataStreamNewlineType -> Ordering # (<) :: DataStreamNewlineType -> DataStreamNewlineType -> Bool # (<=) :: DataStreamNewlineType -> DataStreamNewlineType -> Bool # (>) :: DataStreamNewlineType -> DataStreamNewlineType -> Bool # (>=) :: DataStreamNewlineType -> DataStreamNewlineType -> Bool # max :: DataStreamNewlineType -> DataStreamNewlineType -> DataStreamNewlineType # min :: DataStreamNewlineType -> DataStreamNewlineType -> DataStreamNewlineType #
Ord DataStreamByteOrder
Instance details Defined in GI.Gio.Enums Methods compare :: DataStreamByteOrder -> DataStreamByteOrder -> Ordering # (<) :: DataStreamByteOrder -> DataStreamByteOrder -> Bool # (<=) :: DataStreamByteOrder -> DataStreamByteOrder -> Bool # (>) :: DataStreamByteOrder -> DataStreamByteOrder -> Bool # (>=) :: DataStreamByteOrder -> DataStreamByteOrder -> Bool # max :: DataStreamByteOrder -> DataStreamByteOrder -> DataStreamByteOrder # min :: DataStreamByteOrder -> DataStreamByteOrder -> DataStreamByteOrder #
Ord DBusMessageType
Instance details Defined in GI.Gio.Enums Methods compare :: DBusMessageType -> DBusMessageType -> Ordering # (<) :: DBusMessageType -> DBusMessageType -> Bool # (<=) :: DBusMessageType -> DBusMessageType -> Bool # (>) :: DBusMessageType -> DBusMessageType -> Bool # (>=) :: DBusMessageType -> DBusMessageType -> Bool # max :: DBusMessageType -> DBusMessageType -> DBusMessageType # min :: DBusMessageType -> DBusMessageType -> DBusMessageType #
Ord DBusMessageHeaderField
Instance details Defined in GI.Gio.Enums Methods compare :: DBusMessageHeaderField -> DBusMessageHeaderField -> Ordering # (<) :: DBusMessageHeaderField -> DBusMessageHeaderField -> Bool # (<=) :: DBusMessageHeaderField -> DBusMessageHeaderField -> Bool # (>) :: DBusMessageHeaderField -> DBusMessageHeaderField -> Bool # (>=) :: DBusMessageHeaderField -> DBusMessageHeaderField -> Bool # max :: DBusMessageHeaderField -> DBusMessageHeaderField -> DBusMessageHeaderField # min :: DBusMessageHeaderField -> DBusMessageHeaderField -> DBusMessageHeaderField #
Ord DBusMessageByteOrder
Instance details Defined in GI.Gio.Enums Methods compare :: DBusMessageByteOrder -> DBusMessageByteOrder -> Ordering # (<) :: DBusMessageByteOrder -> DBusMessageByteOrder -> Bool # (<=) :: DBusMessageByteOrder -> DBusMessageByteOrder -> Bool # (>) :: DBusMessageByteOrder -> DBusMessageByteOrder -> Bool # (>=) :: DBusMessageByteOrder -> DBusMessageByteOrder -> Bool # max :: DBusMessageByteOrder -> DBusMessageByteOrder -> DBusMessageByteOrder # min :: DBusMessageByteOrder -> DBusMessageByteOrder -> DBusMessageByteOrder #
Ord DBusError
Instance details Defined in GI.Gio.Enums Methods compare :: DBusError -> DBusError -> Ordering # (<) :: DBusError -> DBusError -> Bool # (<=) :: DBusError -> DBusError -> Bool # (>) :: DBusError -> DBusError -> Bool # (>=) :: DBusError -> DBusError -> Bool # max :: DBusError -> DBusError -> DBusError # min :: DBusError -> DBusError -> DBusError #
Ord CredentialsType
Instance details Defined in GI.Gio.Enums Methods compare :: CredentialsType -> CredentialsType -> Ordering # (<) :: CredentialsType -> CredentialsType -> Bool # (<=) :: CredentialsType -> CredentialsType -> Bool # (>) :: CredentialsType -> CredentialsType -> Bool # (>=) :: CredentialsType -> CredentialsType -> Bool # max :: CredentialsType -> CredentialsType -> CredentialsType # min :: CredentialsType -> CredentialsType -> CredentialsType #
Ord ConverterResult
Instance details Defined in GI.Gio.Enums Methods compare :: ConverterResult -> ConverterResult -> Ordering # (<) :: ConverterResult -> ConverterResult -> Bool # (<=) :: ConverterResult -> ConverterResult -> Bool # (>) :: ConverterResult -> ConverterResult -> Bool # (>=) :: ConverterResult -> ConverterResult -> Bool # max :: ConverterResult -> ConverterResult -> ConverterResult # min :: ConverterResult -> ConverterResult -> ConverterResult #
Ord BusType
Instance details Defined in GI.Gio.Enums Methods compare :: BusType -> BusType -> Ordering # (<) :: BusType -> BusType -> Bool # (<=) :: BusType -> BusType -> Bool # (>) :: BusType -> BusType -> Bool # (>=) :: BusType -> BusType -> Bool # max :: BusType -> BusType -> BusType # min :: BusType -> BusType -> BusType #
Ord TraverseFlags
Instance details Defined in GI.GLib.Flags Methods compare :: TraverseFlags -> TraverseFlags -> Ordering # (<) :: TraverseFlags -> TraverseFlags -> Bool # (<=) :: TraverseFlags -> TraverseFlags -> Bool # (>) :: TraverseFlags -> TraverseFlags -> Bool # (>=) :: TraverseFlags -> TraverseFlags -> Bool # max :: TraverseFlags -> TraverseFlags -> TraverseFlags # min :: TraverseFlags -> TraverseFlags -> TraverseFlags #
Ord TestTrapFlags
Instance details Defined in GI.GLib.Flags Methods compare :: TestTrapFlags -> TestTrapFlags -> Ordering # (<) :: TestTrapFlags -> TestTrapFlags -> Bool # (<=) :: TestTrapFlags -> TestTrapFlags -> Bool # (>) :: TestTrapFlags -> TestTrapFlags -> Bool # (>=) :: TestTrapFlags -> TestTrapFlags -> Bool # max :: TestTrapFlags -> TestTrapFlags -> TestTrapFlags # min :: TestTrapFlags -> TestTrapFlags -> TestTrapFlags #
Ord TestSubprocessFlags
Instance details Defined in GI.GLib.Flags Methods compare :: TestSubprocessFlags -> TestSubprocessFlags -> Ordering # (<) :: TestSubprocessFlags -> TestSubprocessFlags -> Bool # (<=) :: TestSubprocessFlags -> TestSubprocessFlags -> Bool # (>) :: TestSubprocessFlags -> TestSubprocessFlags -> Bool # (>=) :: TestSubprocessFlags -> TestSubprocessFlags -> Bool # max :: TestSubprocessFlags -> TestSubprocessFlags -> TestSubprocessFlags # min :: TestSubprocessFlags -> TestSubprocessFlags -> TestSubprocessFlags #
Ord SpawnFlags
Instance details Defined in GI.GLib.Flags Methods compare :: SpawnFlags -> SpawnFlags -> Ordering # (<) :: SpawnFlags -> SpawnFlags -> Bool # (<=) :: SpawnFlags -> SpawnFlags -> Bool # (>) :: SpawnFlags -> SpawnFlags -> Bool # (>=) :: SpawnFlags -> SpawnFlags -> Bool # max :: SpawnFlags -> SpawnFlags -> SpawnFlags # min :: SpawnFlags -> SpawnFlags -> SpawnFlags #
Ord RegexMatchFlags
Instance details Defined in GI.GLib.Flags Methods compare :: RegexMatchFlags -> RegexMatchFlags -> Ordering # (<) :: RegexMatchFlags -> RegexMatchFlags -> Bool # (<=) :: RegexMatchFlags -> RegexMatchFlags -> Bool # (>) :: RegexMatchFlags -> RegexMatchFlags -> Bool # (>=) :: RegexMatchFlags -> RegexMatchFlags -> Bool # max :: RegexMatchFlags -> RegexMatchFlags -> RegexMatchFlags # min :: RegexMatchFlags -> RegexMatchFlags -> RegexMatchFlags #
Ord RegexCompileFlags
Instance details Defined in GI.GLib.Flags Methods compare :: RegexCompileFlags -> RegexCompileFlags -> Ordering # (<) :: RegexCompileFlags -> RegexCompileFlags -> Bool # (<=) :: RegexCompileFlags -> RegexCompileFlags -> Bool # (>) :: RegexCompileFlags -> RegexCompileFlags -> Bool # (>=) :: RegexCompileFlags -> RegexCompileFlags -> Bool # max :: RegexCompileFlags -> RegexCompileFlags -> RegexCompileFlags # min :: RegexCompileFlags -> RegexCompileFlags -> RegexCompileFlags #
Ord OptionFlags
Instance details Defined in GI.GLib.Flags Methods compare :: OptionFlags -> OptionFlags -> Ordering # (<) :: OptionFlags -> OptionFlags -> Bool # (<=) :: OptionFlags -> OptionFlags -> Bool # (>) :: OptionFlags -> OptionFlags -> Bool # (>=) :: OptionFlags -> OptionFlags -> Bool # max :: OptionFlags -> OptionFlags -> OptionFlags # min :: OptionFlags -> OptionFlags -> OptionFlags #
Ord MarkupParseFlags
Instance details Defined in GI.GLib.Flags Methods compare :: MarkupParseFlags -> MarkupParseFlags -> Ordering # (<) :: MarkupParseFlags -> MarkupParseFlags -> Bool # (<=) :: MarkupParseFlags -> MarkupParseFlags -> Bool # (>) :: MarkupParseFlags -> MarkupParseFlags -> Bool # (>=) :: MarkupParseFlags -> MarkupParseFlags -> Bool # max :: MarkupParseFlags -> MarkupParseFlags -> MarkupParseFlags # min :: MarkupParseFlags -> MarkupParseFlags -> MarkupParseFlags #
Ord MarkupCollectType
Instance details Defined in GI.GLib.Flags Methods compare :: MarkupCollectType -> MarkupCollectType -> Ordering # (<) :: MarkupCollectType -> MarkupCollectType -> Bool # (<=) :: MarkupCollectType -> MarkupCollectType -> Bool # (>) :: MarkupCollectType -> MarkupCollectType -> Bool # (>=) :: MarkupCollectType -> MarkupCollectType -> Bool # max :: MarkupCollectType -> MarkupCollectType -> MarkupCollectType # min :: MarkupCollectType -> MarkupCollectType -> MarkupCollectType #
Ord LogLevelFlags
Instance details Defined in GI.GLib.Flags Methods compare :: LogLevelFlags -> LogLevelFlags -> Ordering # (<) :: LogLevelFlags -> LogLevelFlags -> Bool # (<=) :: LogLevelFlags -> LogLevelFlags -> Bool # (>) :: LogLevelFlags -> LogLevelFlags -> Bool # (>=) :: LogLevelFlags -> LogLevelFlags -> Bool # max :: LogLevelFlags -> LogLevelFlags -> LogLevelFlags # min :: LogLevelFlags -> LogLevelFlags -> LogLevelFlags #
Ord KeyFileFlags
Instance details Defined in GI.GLib.Flags Methods compare :: KeyFileFlags -> KeyFileFlags -> Ordering # (<) :: KeyFileFlags -> KeyFileFlags -> Bool # (<=) :: KeyFileFlags -> KeyFileFlags -> Bool # (>) :: KeyFileFlags -> KeyFileFlags -> Bool # (>=) :: KeyFileFlags -> KeyFileFlags -> Bool # max :: KeyFileFlags -> KeyFileFlags -> KeyFileFlags # min :: KeyFileFlags -> KeyFileFlags -> KeyFileFlags #
Ord IOFlags
Instance details Defined in GI.GLib.Flags Methods compare :: IOFlags -> IOFlags -> Ordering # (<) :: IOFlags -> IOFlags -> Bool # (<=) :: IOFlags -> IOFlags -> Bool # (>) :: IOFlags -> IOFlags -> Bool # (>=) :: IOFlags -> IOFlags -> Bool # max :: IOFlags -> IOFlags -> IOFlags # min :: IOFlags -> IOFlags -> IOFlags #
Ord IOCondition
Instance details Defined in GI.GLib.Flags Methods compare :: IOCondition -> IOCondition -> Ordering # (<) :: IOCondition -> IOCondition -> Bool # (<=) :: IOCondition -> IOCondition -> Bool # (>) :: IOCondition -> IOCondition -> Bool # (>=) :: IOCondition -> IOCondition -> Bool # max :: IOCondition -> IOCondition -> IOCondition # min :: IOCondition -> IOCondition -> IOCondition #
Ord HookFlagMask
Instance details Defined in GI.GLib.Flags Methods compare :: HookFlagMask -> HookFlagMask -> Ordering # (<) :: HookFlagMask -> HookFlagMask -> Bool # (<=) :: HookFlagMask -> HookFlagMask -> Bool # (>) :: HookFlagMask -> HookFlagMask -> Bool # (>=) :: HookFlagMask -> HookFlagMask -> Bool # max :: HookFlagMask -> HookFlagMask -> HookFlagMask # min :: HookFlagMask -> HookFlagMask -> HookFlagMask #
Ord FormatSizeFlags
Instance details Defined in GI.GLib.Flags Methods compare :: FormatSizeFlags -> FormatSizeFlags -> Ordering # (<) :: FormatSizeFlags -> FormatSizeFlags -> Bool # (<=) :: FormatSizeFlags -> FormatSizeFlags -> Bool # (>) :: FormatSizeFlags -> FormatSizeFlags -> Bool # (>=) :: FormatSizeFlags -> FormatSizeFlags -> Bool # max :: FormatSizeFlags -> FormatSizeFlags -> FormatSizeFlags # min :: FormatSizeFlags -> FormatSizeFlags -> FormatSizeFlags #
Ord FileTest
Instance details Defined in GI.GLib.Flags Methods compare :: FileTest -> FileTest -> Ordering # (<) :: FileTest -> FileTest -> Bool # (<=) :: FileTest -> FileTest -> Bool # (>) :: FileTest -> FileTest -> Bool # (>=) :: FileTest -> FileTest -> Bool # max :: FileTest -> FileTest -> FileTest # min :: FileTest -> FileTest -> FileTest #
Ord AsciiType
Instance details Defined in GI.GLib.Flags Methods compare :: AsciiType -> AsciiType -> Ordering # (<) :: AsciiType -> AsciiType -> Bool # (<=) :: AsciiType -> AsciiType -> Bool # (>) :: AsciiType -> AsciiType -> Bool # (>=) :: AsciiType -> AsciiType -> Bool # max :: AsciiType -> AsciiType -> AsciiType # min :: AsciiType -> AsciiType -> AsciiType #
Ord VariantParseError
Instance details Defined in GI.GLib.Enums Methods compare :: VariantParseError -> VariantParseError -> Ordering # (<) :: VariantParseError -> VariantParseError -> Bool # (<=) :: VariantParseError -> VariantParseError -> Bool # (>) :: VariantParseError -> VariantParseError -> Bool # (>=) :: VariantParseError -> VariantParseError -> Bool # max :: VariantParseError -> VariantParseError -> VariantParseError # min :: VariantParseError -> VariantParseError -> VariantParseError #
Ord VariantClass
Instance details Defined in GI.GLib.Enums Methods compare :: VariantClass -> VariantClass -> Ordering # (<) :: VariantClass -> VariantClass -> Bool # (<=) :: VariantClass -> VariantClass -> Bool # (>) :: VariantClass -> VariantClass -> Bool # (>=) :: VariantClass -> VariantClass -> Bool # max :: VariantClass -> VariantClass -> VariantClass # min :: VariantClass -> VariantClass -> VariantClass #
Ord UserDirectory
Instance details Defined in GI.GLib.Enums Methods compare :: UserDirectory -> UserDirectory -> Ordering # (<) :: UserDirectory -> UserDirectory -> Bool # (<=) :: UserDirectory -> UserDirectory -> Bool # (>) :: UserDirectory -> UserDirectory -> Bool # (>=) :: UserDirectory -> UserDirectory -> Bool # max :: UserDirectory -> UserDirectory -> UserDirectory # min :: UserDirectory -> UserDirectory -> UserDirectory #
Ord UnicodeType
Instance details Defined in GI.GLib.Enums Methods compare :: UnicodeType -> UnicodeType -> Ordering # (<) :: UnicodeType -> UnicodeType -> Bool # (<=) :: UnicodeType -> UnicodeType -> Bool # (>) :: UnicodeType -> UnicodeType -> Bool # (>=) :: UnicodeType -> UnicodeType -> Bool # max :: UnicodeType -> UnicodeType -> UnicodeType # min :: UnicodeType -> UnicodeType -> UnicodeType #
Ord UnicodeScript
Instance details Defined in GI.GLib.Enums Methods compare :: UnicodeScript -> UnicodeScript -> Ordering # (<) :: UnicodeScript -> UnicodeScript -> Bool # (<=) :: UnicodeScript -> UnicodeScript -> Bool # (>) :: UnicodeScript -> UnicodeScript -> Bool # (>=) :: UnicodeScript -> UnicodeScript -> Bool # max :: UnicodeScript -> UnicodeScript -> UnicodeScript # min :: UnicodeScript -> UnicodeScript -> UnicodeScript #
Ord UnicodeBreakType
Instance details Defined in GI.GLib.Enums Methods compare :: UnicodeBreakType -> UnicodeBreakType -> Ordering # (<) :: UnicodeBreakType -> UnicodeBreakType -> Bool # (<=) :: UnicodeBreakType -> UnicodeBreakType -> Bool # (>) :: UnicodeBreakType -> UnicodeBreakType -> Bool # (>=) :: UnicodeBreakType -> UnicodeBreakType -> Bool # max :: UnicodeBreakType -> UnicodeBreakType -> UnicodeBreakType # min :: UnicodeBreakType -> UnicodeBreakType -> UnicodeBreakType #
Ord TraverseType
Instance details Defined in GI.GLib.Enums Methods compare :: TraverseType -> TraverseType -> Ordering # (<) :: TraverseType -> TraverseType -> Bool # (<=) :: TraverseType -> TraverseType -> Bool # (>) :: TraverseType -> TraverseType -> Bool # (>=) :: TraverseType -> TraverseType -> Bool # max :: TraverseType -> TraverseType -> TraverseType # min :: TraverseType -> TraverseType -> TraverseType #
Ord TokenType
Instance details Defined in GI.GLib.Enums Methods compare :: TokenType -> TokenType -> Ordering # (<) :: TokenType -> TokenType -> Bool # (<=) :: TokenType -> TokenType -> Bool # (>) :: TokenType -> TokenType -> Bool # (>=) :: TokenType -> TokenType -> Bool # max :: TokenType -> TokenType -> TokenType # min :: TokenType -> TokenType -> TokenType #
Ord TimeType
Instance details Defined in GI.GLib.Enums Methods compare :: TimeType -> TimeType -> Ordering # (<) :: TimeType -> TimeType -> Bool # (<=) :: TimeType -> TimeType -> Bool # (>) :: TimeType -> TimeType -> Bool # (>=) :: TimeType -> TimeType -> Bool # max :: TimeType -> TimeType -> TimeType # min :: TimeType -> TimeType -> TimeType #
Ord ThreadError
Instance details Defined in GI.GLib.Enums Methods compare :: ThreadError -> ThreadError -> Ordering # (<) :: ThreadError -> ThreadError -> Bool # (<=) :: ThreadError -> ThreadError -> Bool # (>) :: ThreadError -> ThreadError -> Bool # (>=) :: ThreadError -> ThreadError -> Bool # max :: ThreadError -> ThreadError -> ThreadError # min :: ThreadError -> ThreadError -> ThreadError #
Ord TestResult
Instance details Defined in GI.GLib.Enums Methods compare :: TestResult -> TestResult -> Ordering # (<) :: TestResult -> TestResult -> Bool # (<=) :: TestResult -> TestResult -> Bool # (>) :: TestResult -> TestResult -> Bool # (>=) :: TestResult -> TestResult -> Bool # max :: TestResult -> TestResult -> TestResult # min :: TestResult -> TestResult -> TestResult #
Ord TestLogType
Instance details Defined in GI.GLib.Enums Methods compare :: TestLogType -> TestLogType -> Ordering # (<) :: TestLogType -> TestLogType -> Bool # (<=) :: TestLogType -> TestLogType -> Bool # (>) :: TestLogType -> TestLogType -> Bool # (>=) :: TestLogType -> TestLogType -> Bool # max :: TestLogType -> TestLogType -> TestLogType # min :: TestLogType -> TestLogType -> TestLogType #
Ord TestFileType
Instance details Defined in GI.GLib.Enums Methods compare :: TestFileType -> TestFileType -> Ordering # (<) :: TestFileType -> TestFileType -> Bool # (<=) :: TestFileType -> TestFileType -> Bool # (>) :: TestFileType -> TestFileType -> Bool # (>=) :: TestFileType -> TestFileType -> Bool # max :: TestFileType -> TestFileType -> TestFileType # min :: TestFileType -> TestFileType -> TestFileType #
Ord SpawnError
Instance details Defined in GI.GLib.Enums Methods compare :: SpawnError -> SpawnError -> Ordering # (<) :: SpawnError -> SpawnError -> Bool # (<=) :: SpawnError -> SpawnError -> Bool # (>) :: SpawnError -> SpawnError -> Bool # (>=) :: SpawnError -> SpawnError -> Bool # max :: SpawnError -> SpawnError -> SpawnError # min :: SpawnError -> SpawnError -> SpawnError #
Ord SliceConfig
Instance details Defined in GI.GLib.Enums Methods compare :: SliceConfig -> SliceConfig -> Ordering # (<) :: SliceConfig -> SliceConfig -> Bool # (<=) :: SliceConfig -> SliceConfig -> Bool # (>) :: SliceConfig -> SliceConfig -> Bool # (>=) :: SliceConfig -> SliceConfig -> Bool # max :: SliceConfig -> SliceConfig -> SliceConfig # min :: SliceConfig -> SliceConfig -> SliceConfig #
Ord ShellError
Instance details Defined in GI.GLib.Enums Methods compare :: ShellError -> ShellError -> Ordering # (<) :: ShellError -> ShellError -> Bool # (<=) :: ShellError -> ShellError -> Bool # (>) :: ShellError -> ShellError -> Bool # (>=) :: ShellError -> ShellError -> Bool # max :: ShellError -> ShellError -> ShellError # min :: ShellError -> ShellError -> ShellError #
Ord SeekType
Instance details Defined in GI.GLib.Enums Methods compare :: SeekType -> SeekType -> Ordering # (<) :: SeekType -> SeekType -> Bool # (<=) :: SeekType -> SeekType -> Bool # (>) :: SeekType -> SeekType -> Bool # (>=) :: SeekType -> SeekType -> Bool # max :: SeekType -> SeekType -> SeekType # min :: SeekType -> SeekType -> SeekType #
Ord RegexError
Instance details Defined in GI.GLib.Enums Methods compare :: RegexError -> RegexError -> Ordering # (<) :: RegexError -> RegexError -> Bool # (<=) :: RegexError -> RegexError -> Bool # (>) :: RegexError -> RegexError -> Bool # (>=) :: RegexError -> RegexError -> Bool # max :: RegexError -> RegexError -> RegexError # min :: RegexError -> RegexError -> RegexError #
Ord OptionError
Instance details Defined in GI.GLib.Enums Methods compare :: OptionError -> OptionError -> Ordering # (<) :: OptionError -> OptionError -> Bool # (<=) :: OptionError -> OptionError -> Bool # (>) :: OptionError -> OptionError -> Bool # (>=) :: OptionError -> OptionError -> Bool # max :: OptionError -> OptionError -> OptionError # min :: OptionError -> OptionError -> OptionError #
Ord OptionArg
Instance details Defined in GI.GLib.Enums Methods compare :: OptionArg -> OptionArg -> Ordering # (<) :: OptionArg -> OptionArg -> Bool # (<=) :: OptionArg -> OptionArg -> Bool # (>) :: OptionArg -> OptionArg -> Bool # (>=) :: OptionArg -> OptionArg -> Bool # max :: OptionArg -> OptionArg -> OptionArg # min :: OptionArg -> OptionArg -> OptionArg #
Ord OnceStatus
Instance details Defined in GI.GLib.Enums Methods compare :: OnceStatus -> OnceStatus -> Ordering # (<) :: OnceStatus -> OnceStatus -> Bool # (<=) :: OnceStatus -> OnceStatus -> Bool # (>) :: OnceStatus -> OnceStatus -> Bool # (>=) :: OnceStatus -> OnceStatus -> Bool # max :: OnceStatus -> OnceStatus -> OnceStatus # min :: OnceStatus -> OnceStatus -> OnceStatus #
Ord NumberParserError
Instance details Defined in GI.GLib.Enums Methods compare :: NumberParserError -> NumberParserError -> Ordering # (<) :: NumberParserError -> NumberParserError -> Bool # (<=) :: NumberParserError -> NumberParserError -> Bool # (>) :: NumberParserError -> NumberParserError -> Bool # (>=) :: NumberParserError -> NumberParserError -> Bool # max :: NumberParserError -> NumberParserError -> NumberParserError # min :: NumberParserError -> NumberParserError -> NumberParserError #
Ord NormalizeMode
Instance details Defined in GI.GLib.Enums Methods compare :: NormalizeMode -> NormalizeMode -> Ordering # (<) :: NormalizeMode -> NormalizeMode -> Bool # (<=) :: NormalizeMode -> NormalizeMode -> Bool # (>) :: NormalizeMode -> NormalizeMode -> Bool # (>=) :: NormalizeMode -> NormalizeMode -> Bool # max :: NormalizeMode -> NormalizeMode -> NormalizeMode # min :: NormalizeMode -> NormalizeMode -> NormalizeMode #
Ord MarkupError
Instance details Defined in GI.GLib.Enums Methods compare :: MarkupError -> MarkupError -> Ordering # (<) :: MarkupError -> MarkupError -> Bool # (<=) :: MarkupError -> MarkupError -> Bool # (>) :: MarkupError -> MarkupError -> Bool # (>=) :: MarkupError -> MarkupError -> Bool # max :: MarkupError -> MarkupError -> MarkupError # min :: MarkupError -> MarkupError -> MarkupError #
Ord LogWriterOutput
Instance details Defined in GI.GLib.Enums Methods compare :: LogWriterOutput -> LogWriterOutput -> Ordering # (<) :: LogWriterOutput -> LogWriterOutput -> Bool # (<=) :: LogWriterOutput -> LogWriterOutput -> Bool # (>) :: LogWriterOutput -> LogWriterOutput -> Bool # (>=) :: LogWriterOutput -> LogWriterOutput -> Bool # max :: LogWriterOutput -> LogWriterOutput -> LogWriterOutput # min :: LogWriterOutput -> LogWriterOutput -> LogWriterOutput #
Ord KeyFileError
Instance details Defined in GI.GLib.Enums Methods compare :: KeyFileError -> KeyFileError -> Ordering # (<) :: KeyFileError -> KeyFileError -> Bool # (<=) :: KeyFileError -> KeyFileError -> Bool # (>) :: KeyFileError -> KeyFileError -> Bool # (>=) :: KeyFileError -> KeyFileError -> Bool # max :: KeyFileError -> KeyFileError -> KeyFileError # min :: KeyFileError -> KeyFileError -> KeyFileError #
Ord IOStatus
Instance details Defined in GI.GLib.Enums Methods compare :: IOStatus -> IOStatus -> Ordering # (<) :: IOStatus -> IOStatus -> Bool # (<=) :: IOStatus -> IOStatus -> Bool # (>) :: IOStatus -> IOStatus -> Bool # (>=) :: IOStatus -> IOStatus -> Bool # max :: IOStatus -> IOStatus -> IOStatus # min :: IOStatus -> IOStatus -> IOStatus #
Ord IOError
Instance details Defined in GI.GLib.Enums Methods compare :: IOError -> IOError -> Ordering # (<) :: IOError -> IOError -> Bool # (<=) :: IOError -> IOError -> Bool # (>) :: IOError -> IOError -> Bool # (>=) :: IOError -> IOError -> Bool # max :: IOError -> IOError -> IOError # min :: IOError -> IOError -> IOError #
Ord IOChannelError
Instance details Defined in GI.GLib.Enums Methods compare :: IOChannelError -> IOChannelError -> Ordering # (<) :: IOChannelError -> IOChannelError -> Bool # (<=) :: IOChannelError -> IOChannelError -> Bool # (>) :: IOChannelError -> IOChannelError -> Bool # (>=) :: IOChannelError -> IOChannelError -> Bool # max :: IOChannelError -> IOChannelError -> IOChannelError # min :: IOChannelError -> IOChannelError -> IOChannelError #
Ord FileError
Instance details Defined in GI.GLib.Enums Methods compare :: FileError -> FileError -> Ordering # (<) :: FileError -> FileError -> Bool # (<=) :: FileError -> FileError -> Bool # (>) :: FileError -> FileError -> Bool # (>=) :: FileError -> FileError -> Bool # max :: FileError -> FileError -> FileError # min :: FileError -> FileError -> FileError #
Ord ErrorType
Instance details Defined in GI.GLib.Enums Methods compare :: ErrorType -> ErrorType -> Ordering # (<) :: ErrorType -> ErrorType -> Bool # (<=) :: ErrorType -> ErrorType -> Bool # (>) :: ErrorType -> ErrorType -> Bool # (>=) :: ErrorType -> ErrorType -> Bool # max :: ErrorType -> ErrorType -> ErrorType # min :: ErrorType -> ErrorType -> ErrorType #
Ord DateWeekday
Instance details Defined in GI.GLib.Enums Methods compare :: DateWeekday -> DateWeekday -> Ordering # (<) :: DateWeekday -> DateWeekday -> Bool # (<=) :: DateWeekday -> DateWeekday -> Bool # (>) :: DateWeekday -> DateWeekday -> Bool # (>=) :: DateWeekday -> DateWeekday -> Bool # max :: DateWeekday -> DateWeekday -> DateWeekday # min :: DateWeekday -> DateWeekday -> DateWeekday #
Ord DateMonth
Instance details Defined in GI.GLib.Enums Methods compare :: DateMonth -> DateMonth -> Ordering # (<) :: DateMonth -> DateMonth -> Bool # (<=) :: DateMonth -> DateMonth -> Bool # (>) :: DateMonth -> DateMonth -> Bool # (>=) :: DateMonth -> DateMonth -> Bool # max :: DateMonth -> DateMonth -> DateMonth # min :: DateMonth -> DateMonth -> DateMonth #
Ord DateDMY
Instance details Defined in GI.GLib.Enums Methods compare :: DateDMY -> DateDMY -> Ordering # (<) :: DateDMY -> DateDMY -> Bool # (<=) :: DateDMY -> DateDMY -> Bool # (>) :: DateDMY -> DateDMY -> Bool # (>=) :: DateDMY -> DateDMY -> Bool # max :: DateDMY -> DateDMY -> DateDMY # min :: DateDMY -> DateDMY -> DateDMY #
Ord ConvertError
Instance details Defined in GI.GLib.Enums Methods compare :: ConvertError -> ConvertError -> Ordering # (<) :: ConvertError -> ConvertError -> Bool # (<=) :: ConvertError -> ConvertError -> Bool # (>) :: ConvertError -> ConvertError -> Bool # (>=) :: ConvertError -> ConvertError -> Bool # max :: ConvertError -> ConvertError -> ConvertError # min :: ConvertError -> ConvertError -> ConvertError #
Ord ChecksumType
Instance details Defined in GI.GLib.Enums Methods compare :: ChecksumType -> ChecksumType -> Ordering # (<) :: ChecksumType -> ChecksumType -> Bool # (<=) :: ChecksumType -> ChecksumType -> Bool # (>) :: ChecksumType -> ChecksumType -> Bool # (>=) :: ChecksumType -> ChecksumType -> Bool # max :: ChecksumType -> ChecksumType -> ChecksumType # min :: ChecksumType -> ChecksumType -> ChecksumType #
Ord BookmarkFileError
Instance details Defined in GI.GLib.Enums Methods compare :: BookmarkFileError -> BookmarkFileError -> Ordering # (<) :: BookmarkFileError -> BookmarkFileError -> Bool # (<=) :: BookmarkFileError -> BookmarkFileError -> Bool # (>) :: BookmarkFileError -> BookmarkFileError -> Bool # (>=) :: BookmarkFileError -> BookmarkFileError -> Bool # max :: BookmarkFileError -> BookmarkFileError -> BookmarkFileError # min :: BookmarkFileError -> BookmarkFileError -> BookmarkFileError #
Ord UIManagerItemType
Instance details Defined in GI.Gtk.Flags Methods compare :: UIManagerItemType -> UIManagerItemType -> Ordering # (<) :: UIManagerItemType -> UIManagerItemType -> Bool # (<=) :: UIManagerItemType -> UIManagerItemType -> Bool # (>) :: UIManagerItemType -> UIManagerItemType -> Bool # (>=) :: UIManagerItemType -> UIManagerItemType -> Bool # max :: UIManagerItemType -> UIManagerItemType -> UIManagerItemType # min :: UIManagerItemType -> UIManagerItemType -> UIManagerItemType #
Ord TreeModelFlags
Instance details Defined in GI.Gtk.Flags Methods compare :: TreeModelFlags -> TreeModelFlags -> Ordering # (<) :: TreeModelFlags -> TreeModelFlags -> Bool # (<=) :: TreeModelFlags -> TreeModelFlags -> Bool # (>) :: TreeModelFlags -> TreeModelFlags -> Bool # (>=) :: TreeModelFlags -> TreeModelFlags -> Bool # max :: TreeModelFlags -> TreeModelFlags -> TreeModelFlags # min :: TreeModelFlags -> TreeModelFlags -> TreeModelFlags #
Ord ToolPaletteDragTargets
Instance details Defined in GI.Gtk.Flags Methods compare :: ToolPaletteDragTargets -> ToolPaletteDragTargets -> Ordering # (<) :: ToolPaletteDragTargets -> ToolPaletteDragTargets -> Bool # (<=) :: ToolPaletteDragTargets -> ToolPaletteDragTargets -> Bool # (>) :: ToolPaletteDragTargets -> ToolPaletteDragTargets -> Bool # (>=) :: ToolPaletteDragTargets -> ToolPaletteDragTargets -> Bool # max :: ToolPaletteDragTargets -> ToolPaletteDragTargets -> ToolPaletteDragTargets # min :: ToolPaletteDragTargets -> ToolPaletteDragTargets -> ToolPaletteDragTargets #
Ord TextSearchFlags
Instance details Defined in GI.Gtk.Flags Methods compare :: TextSearchFlags -> TextSearchFlags -> Ordering # (<) :: TextSearchFlags -> TextSearchFlags -> Bool # (<=) :: TextSearchFlags -> TextSearchFlags -> Bool # (>) :: TextSearchFlags -> TextSearchFlags -> Bool # (>=) :: TextSearchFlags -> TextSearchFlags -> Bool # max :: TextSearchFlags -> TextSearchFlags -> TextSearchFlags # min :: TextSearchFlags -> TextSearchFlags -> TextSearchFlags #
Ord TargetFlags
Instance details Defined in GI.Gtk.Flags Methods compare :: TargetFlags -> TargetFlags -> Ordering # (<) :: TargetFlags -> TargetFlags -> Bool # (<=) :: TargetFlags -> TargetFlags -> Bool # (>) :: TargetFlags -> TargetFlags -> Bool # (>=) :: TargetFlags -> TargetFlags -> Bool # max :: TargetFlags -> TargetFlags -> TargetFlags # min :: TargetFlags -> TargetFlags -> TargetFlags #
Ord StyleContextPrintFlags
Instance details Defined in GI.Gtk.Flags Methods compare :: StyleContextPrintFlags -> StyleContextPrintFlags -> Ordering # (<) :: StyleContextPrintFlags -> StyleContextPrintFlags -> Bool # (<=) :: StyleContextPrintFlags -> StyleContextPrintFlags -> Bool # (>) :: StyleContextPrintFlags -> StyleContextPrintFlags -> Bool # (>=) :: StyleContextPrintFlags -> StyleContextPrintFlags -> Bool # max :: StyleContextPrintFlags -> StyleContextPrintFlags -> StyleContextPrintFlags # min :: StyleContextPrintFlags -> StyleContextPrintFlags -> StyleContextPrintFlags #
Ord StateFlags
Instance details Defined in GI.Gtk.Flags Methods compare :: StateFlags -> StateFlags -> Ordering # (<) :: StateFlags -> StateFlags -> Bool # (<=) :: StateFlags -> StateFlags -> Bool # (>) :: StateFlags -> StateFlags -> Bool # (>=) :: StateFlags -> StateFlags -> Bool # max :: StateFlags -> StateFlags -> StateFlags # min :: StateFlags -> StateFlags -> StateFlags #
Ord RegionFlags
Instance details Defined in GI.Gtk.Flags Methods compare :: RegionFlags -> RegionFlags -> Ordering # (<) :: RegionFlags -> RegionFlags -> Bool # (<=) :: RegionFlags -> RegionFlags -> Bool # (>) :: RegionFlags -> RegionFlags -> Bool # (>=) :: RegionFlags -> RegionFlags -> Bool # max :: RegionFlags -> RegionFlags -> RegionFlags # min :: RegionFlags -> RegionFlags -> RegionFlags #
Ord RecentFilterFlags
Instance details Defined in GI.Gtk.Flags Methods compare :: RecentFilterFlags -> RecentFilterFlags -> Ordering # (<) :: RecentFilterFlags -> RecentFilterFlags -> Bool # (<=) :: RecentFilterFlags -> RecentFilterFlags -> Bool # (>) :: RecentFilterFlags -> RecentFilterFlags -> Bool # (>=) :: RecentFilterFlags -> RecentFilterFlags -> Bool # max :: RecentFilterFlags -> RecentFilterFlags -> RecentFilterFlags # min :: RecentFilterFlags -> RecentFilterFlags -> RecentFilterFlags #
Ord RcFlags
Instance details Defined in GI.Gtk.Flags Methods compare :: RcFlags -> RcFlags -> Ordering # (<) :: RcFlags -> RcFlags -> Bool # (<=) :: RcFlags -> RcFlags -> Bool # (>) :: RcFlags -> RcFlags -> Bool # (>=) :: RcFlags -> RcFlags -> Bool # max :: RcFlags -> RcFlags -> RcFlags # min :: RcFlags -> RcFlags -> RcFlags #
Ord PlacesOpenFlags
Instance details Defined in GI.Gtk.Flags Methods compare :: PlacesOpenFlags -> PlacesOpenFlags -> Ordering # (<) :: PlacesOpenFlags -> PlacesOpenFlags -> Bool # (<=) :: PlacesOpenFlags -> PlacesOpenFlags -> Bool # (>) :: PlacesOpenFlags -> PlacesOpenFlags -> Bool # (>=) :: PlacesOpenFlags -> PlacesOpenFlags -> Bool # max :: PlacesOpenFlags -> PlacesOpenFlags -> PlacesOpenFlags # min :: PlacesOpenFlags -> PlacesOpenFlags -> PlacesOpenFlags #
Ord JunctionSides
Instance details Defined in GI.Gtk.Flags Methods compare :: JunctionSides -> JunctionSides -> Ordering # (<) :: JunctionSides -> JunctionSides -> Bool # (<=) :: JunctionSides -> JunctionSides -> Bool # (>) :: JunctionSides -> JunctionSides -> Bool # (>=) :: JunctionSides -> JunctionSides -> Bool # max :: JunctionSides -> JunctionSides -> JunctionSides # min :: JunctionSides -> JunctionSides -> JunctionSides #
Ord InputHints
Instance details Defined in GI.Gtk.Flags Methods compare :: InputHints -> InputHints -> Ordering # (<) :: InputHints -> InputHints -> Bool # (<=) :: InputHints -> InputHints -> Bool # (>) :: InputHints -> InputHints -> Bool # (>=) :: InputHints -> InputHints -> Bool # max :: InputHints -> InputHints -> InputHints # min :: InputHints -> InputHints -> InputHints #
Ord IconLookupFlags
Instance details Defined in GI.Gtk.Flags Methods compare :: IconLookupFlags -> IconLookupFlags -> Ordering # (<) :: IconLookupFlags -> IconLookupFlags -> Bool # (<=) :: IconLookupFlags -> IconLookupFlags -> Bool # (>) :: IconLookupFlags -> IconLookupFlags -> Bool # (>=) :: IconLookupFlags -> IconLookupFlags -> Bool # max :: IconLookupFlags -> IconLookupFlags -> IconLookupFlags # min :: IconLookupFlags -> IconLookupFlags -> IconLookupFlags #
Ord FontChooserLevel
Instance details Defined in GI.Gtk.Flags Methods compare :: FontChooserLevel -> FontChooserLevel -> Ordering # (<) :: FontChooserLevel -> FontChooserLevel -> Bool # (<=) :: FontChooserLevel -> FontChooserLevel -> Bool # (>) :: FontChooserLevel -> FontChooserLevel -> Bool # (>=) :: FontChooserLevel -> FontChooserLevel -> Bool # max :: FontChooserLevel -> FontChooserLevel -> FontChooserLevel # min :: FontChooserLevel -> FontChooserLevel -> FontChooserLevel #
Ord FileFilterFlags
Instance details Defined in GI.Gtk.Flags Methods compare :: FileFilterFlags -> FileFilterFlags -> Ordering # (<) :: FileFilterFlags -> FileFilterFlags -> Bool # (<=) :: FileFilterFlags -> FileFilterFlags -> Bool # (>) :: FileFilterFlags -> FileFilterFlags -> Bool # (>=) :: FileFilterFlags -> FileFilterFlags -> Bool # max :: FileFilterFlags -> FileFilterFlags -> FileFilterFlags # min :: FileFilterFlags -> FileFilterFlags -> FileFilterFlags #
Ord EventControllerScrollFlags
Instance details Defined in GI.Gtk.Flags Methods compare :: EventControllerScrollFlags -> EventControllerScrollFlags -> Ordering # (<) :: EventControllerScrollFlags -> EventControllerScrollFlags -> Bool # (<=) :: EventControllerScrollFlags -> EventControllerScrollFlags -> Bool # (>) :: EventControllerScrollFlags -> EventControllerScrollFlags -> Bool # (>=) :: EventControllerScrollFlags -> EventControllerScrollFlags -> Bool # max :: EventControllerScrollFlags -> EventControllerScrollFlags -> EventControllerScrollFlags # min :: EventControllerScrollFlags -> EventControllerScrollFlags -> EventControllerScrollFlags #
Ord DialogFlags
Instance details Defined in GI.Gtk.Flags Methods compare :: DialogFlags -> DialogFlags -> Ordering # (<) :: DialogFlags -> DialogFlags -> Bool # (<=) :: DialogFlags -> DialogFlags -> Bool # (>) :: DialogFlags -> DialogFlags -> Bool # (>=) :: DialogFlags -> DialogFlags -> Bool # max :: DialogFlags -> DialogFlags -> DialogFlags # min :: DialogFlags -> DialogFlags -> DialogFlags #
Ord DestDefaults
Instance details Defined in GI.Gtk.Flags Methods compare :: DestDefaults -> DestDefaults -> Ordering # (<) :: DestDefaults -> DestDefaults -> Bool # (<=) :: DestDefaults -> DestDefaults -> Bool # (>) :: DestDefaults -> DestDefaults -> Bool # (>=) :: DestDefaults -> DestDefaults -> Bool # max :: DestDefaults -> DestDefaults -> DestDefaults # min :: DestDefaults -> DestDefaults -> DestDefaults #
Ord DebugFlag
Instance details Defined in GI.Gtk.Flags Methods compare :: DebugFlag -> DebugFlag -> Ordering # (<) :: DebugFlag -> DebugFlag -> Bool # (<=) :: DebugFlag -> DebugFlag -> Bool # (>) :: DebugFlag -> DebugFlag -> Bool # (>=) :: DebugFlag -> DebugFlag -> Bool # max :: DebugFlag -> DebugFlag -> DebugFlag # min :: DebugFlag -> DebugFlag -> DebugFlag #
Ord CellRendererState
Instance details Defined in GI.Gtk.Flags Methods compare :: CellRendererState -> CellRendererState -> Ordering # (<) :: CellRendererState -> CellRendererState -> Bool # (<=) :: CellRendererState -> CellRendererState -> Bool # (>) :: CellRendererState -> CellRendererState -> Bool # (>=) :: CellRendererState -> CellRendererState -> Bool # max :: CellRendererState -> CellRendererState -> CellRendererState # min :: CellRendererState -> CellRendererState -> CellRendererState #
Ord CalendarDisplayOptions
Instance details Defined in GI.Gtk.Flags Methods compare :: CalendarDisplayOptions -> CalendarDisplayOptions -> Ordering # (<) :: CalendarDisplayOptions -> CalendarDisplayOptions -> Bool # (<=) :: CalendarDisplayOptions -> CalendarDisplayOptions -> Bool # (>) :: CalendarDisplayOptions -> CalendarDisplayOptions -> Bool # (>=) :: CalendarDisplayOptions -> CalendarDisplayOptions -> Bool # max :: CalendarDisplayOptions -> CalendarDisplayOptions -> CalendarDisplayOptions # min :: CalendarDisplayOptions -> CalendarDisplayOptions -> CalendarDisplayOptions #
Ord AttachOptions
Instance details Defined in GI.Gtk.Flags Methods compare :: AttachOptions -> AttachOptions -> Ordering # (<) :: AttachOptions -> AttachOptions -> Bool # (<=) :: AttachOptions -> AttachOptions -> Bool # (>) :: AttachOptions -> AttachOptions -> Bool # (>=) :: AttachOptions -> AttachOptions -> Bool # max :: AttachOptions -> AttachOptions -> AttachOptions # min :: AttachOptions -> AttachOptions -> AttachOptions #
Ord ApplicationInhibitFlags
Instance details Defined in GI.Gtk.Flags Methods compare :: ApplicationInhibitFlags -> ApplicationInhibitFlags -> Ordering # (<) :: ApplicationInhibitFlags -> ApplicationInhibitFlags -> Bool # (<=) :: ApplicationInhibitFlags -> ApplicationInhibitFlags -> Bool # (>) :: ApplicationInhibitFlags -> ApplicationInhibitFlags -> Bool # (>=) :: ApplicationInhibitFlags -> ApplicationInhibitFlags -> Bool # max :: ApplicationInhibitFlags -> ApplicationInhibitFlags -> ApplicationInhibitFlags # min :: ApplicationInhibitFlags -> ApplicationInhibitFlags -> ApplicationInhibitFlags #
Ord AccelFlags
Instance details Defined in GI.Gtk.Flags Methods compare :: AccelFlags -> AccelFlags -> Ordering # (<) :: AccelFlags -> AccelFlags -> Bool # (<=) :: AccelFlags -> AccelFlags -> Bool # (>) :: AccelFlags -> AccelFlags -> Bool # (>=) :: AccelFlags -> AccelFlags -> Bool # max :: AccelFlags -> AccelFlags -> AccelFlags # min :: AccelFlags -> AccelFlags -> AccelFlags #
Ord WrapMode
Instance details Defined in GI.Gtk.Enums Methods compare :: WrapMode -> WrapMode -> Ordering # (<) :: WrapMode -> WrapMode -> Bool # (<=) :: WrapMode -> WrapMode -> Bool # (>) :: WrapMode -> WrapMode -> Bool # (>=) :: WrapMode -> WrapMode -> Bool # max :: WrapMode -> WrapMode -> WrapMode # min :: WrapMode -> WrapMode -> WrapMode #
Ord WindowType
Instance details Defined in GI.Gtk.Enums Methods compare :: WindowType -> WindowType -> Ordering # (<) :: WindowType -> WindowType -> Bool # (<=) :: WindowType -> WindowType -> Bool # (>) :: WindowType -> WindowType -> Bool # (>=) :: WindowType -> WindowType -> Bool # max :: WindowType -> WindowType -> WindowType # min :: WindowType -> WindowType -> WindowType #
Ord WindowPosition
Instance details Defined in GI.Gtk.Enums Methods compare :: WindowPosition -> WindowPosition -> Ordering # (<) :: WindowPosition -> WindowPosition -> Bool # (<=) :: WindowPosition -> WindowPosition -> Bool # (>) :: WindowPosition -> WindowPosition -> Bool # (>=) :: WindowPosition -> WindowPosition -> Bool # max :: WindowPosition -> WindowPosition -> WindowPosition # min :: WindowPosition -> WindowPosition -> WindowPosition #
Ord WidgetHelpType
Instance details Defined in GI.Gtk.Enums Methods compare :: WidgetHelpType -> WidgetHelpType -> Ordering # (<) :: WidgetHelpType -> WidgetHelpType -> Bool # (<=) :: WidgetHelpType -> WidgetHelpType -> Bool # (>) :: WidgetHelpType -> WidgetHelpType -> Bool # (>=) :: WidgetHelpType -> WidgetHelpType -> Bool # max :: WidgetHelpType -> WidgetHelpType -> WidgetHelpType # min :: WidgetHelpType -> WidgetHelpType -> WidgetHelpType #
Ord Unit
Instance details Defined in GI.Gtk.Enums Methods compare :: Unit -> Unit -> Ordering # (<) :: Unit -> Unit -> Bool # (<=) :: Unit -> Unit -> Bool # (>) :: Unit -> Unit -> Bool # (>=) :: Unit -> Unit -> Bool # max :: Unit -> Unit -> Unit # min :: Unit -> Unit -> Unit #
Ord TreeViewGridLines
Instance details Defined in GI.Gtk.Enums Methods compare :: TreeViewGridLines -> TreeViewGridLines -> Ordering # (<) :: TreeViewGridLines -> TreeViewGridLines -> Bool # (<=) :: TreeViewGridLines -> TreeViewGridLines -> Bool # (>) :: TreeViewGridLines -> TreeViewGridLines -> Bool # (>=) :: TreeViewGridLines -> TreeViewGridLines -> Bool # max :: TreeViewGridLines -> TreeViewGridLines -> TreeViewGridLines # min :: TreeViewGridLines -> TreeViewGridLines -> TreeViewGridLines #
Ord TreeViewDropPosition
Instance details Defined in GI.Gtk.Enums Methods compare :: TreeViewDropPosition -> TreeViewDropPosition -> Ordering # (<) :: TreeViewDropPosition -> TreeViewDropPosition -> Bool # (<=) :: TreeViewDropPosition -> TreeViewDropPosition -> Bool # (>) :: TreeViewDropPosition -> TreeViewDropPosition -> Bool # (>=) :: TreeViewDropPosition -> TreeViewDropPosition -> Bool # max :: TreeViewDropPosition -> TreeViewDropPosition -> TreeViewDropPosition # min :: TreeViewDropPosition -> TreeViewDropPosition -> TreeViewDropPosition #
Ord TreeViewColumnSizing
Instance details Defined in GI.Gtk.Enums Methods compare :: TreeViewColumnSizing -> TreeViewColumnSizing -> Ordering # (<) :: TreeViewColumnSizing -> TreeViewColumnSizing -> Bool # (<=) :: TreeViewColumnSizing -> TreeViewColumnSizing -> Bool # (>) :: TreeViewColumnSizing -> TreeViewColumnSizing -> Bool # (>=) :: TreeViewColumnSizing -> TreeViewColumnSizing -> Bool # max :: TreeViewColumnSizing -> TreeViewColumnSizing -> TreeViewColumnSizing # min :: TreeViewColumnSizing -> TreeViewColumnSizing -> TreeViewColumnSizing #
Ord ToolbarStyle
Instance details Defined in GI.Gtk.Enums Methods compare :: ToolbarStyle -> ToolbarStyle -> Ordering # (<) :: ToolbarStyle -> ToolbarStyle -> Bool # (<=) :: ToolbarStyle -> ToolbarStyle -> Bool # (>) :: ToolbarStyle -> ToolbarStyle -> Bool # (>=) :: ToolbarStyle -> ToolbarStyle -> Bool # max :: ToolbarStyle -> ToolbarStyle -> ToolbarStyle # min :: ToolbarStyle -> ToolbarStyle -> ToolbarStyle #
Ord ToolbarSpaceStyle
Instance details Defined in GI.Gtk.Enums Methods compare :: ToolbarSpaceStyle -> ToolbarSpaceStyle -> Ordering # (<) :: ToolbarSpaceStyle -> ToolbarSpaceStyle -> Bool # (<=) :: ToolbarSpaceStyle -> ToolbarSpaceStyle -> Bool # (>) :: ToolbarSpaceStyle -> ToolbarSpaceStyle -> Bool # (>=) :: ToolbarSpaceStyle -> ToolbarSpaceStyle -> Bool # max :: ToolbarSpaceStyle -> ToolbarSpaceStyle -> ToolbarSpaceStyle # min :: ToolbarSpaceStyle -> ToolbarSpaceStyle -> ToolbarSpaceStyle #
Ord TextWindowType
Instance details Defined in GI.Gtk.Enums Methods compare :: TextWindowType -> TextWindowType -> Ordering # (<) :: TextWindowType -> TextWindowType -> Bool # (<=) :: TextWindowType -> TextWindowType -> Bool # (>) :: TextWindowType -> TextWindowType -> Bool # (>=) :: TextWindowType -> TextWindowType -> Bool # max :: TextWindowType -> TextWindowType -> TextWindowType # min :: TextWindowType -> TextWindowType -> TextWindowType #
Ord TextViewLayer
Instance details Defined in GI.Gtk.Enums Methods compare :: TextViewLayer -> TextViewLayer -> Ordering # (<) :: TextViewLayer -> TextViewLayer -> Bool # (<=) :: TextViewLayer -> TextViewLayer -> Bool # (>) :: TextViewLayer -> TextViewLayer -> Bool # (>=) :: TextViewLayer -> TextViewLayer -> Bool # max :: TextViewLayer -> TextViewLayer -> TextViewLayer # min :: TextViewLayer -> TextViewLayer -> TextViewLayer #
Ord TextExtendSelection
Instance details Defined in GI.Gtk.Enums Methods compare :: TextExtendSelection -> TextExtendSelection -> Ordering # (<) :: TextExtendSelection -> TextExtendSelection -> Bool # (<=) :: TextExtendSelection -> TextExtendSelection -> Bool # (>) :: TextExtendSelection -> TextExtendSelection -> Bool # (>=) :: TextExtendSelection -> TextExtendSelection -> Bool # max :: TextExtendSelection -> TextExtendSelection -> TextExtendSelection # min :: TextExtendSelection -> TextExtendSelection -> TextExtendSelection #
Ord TextDirection
Instance details Defined in GI.Gtk.Enums Methods compare :: TextDirection -> TextDirection -> Ordering # (<) :: TextDirection -> TextDirection -> Bool # (<=) :: TextDirection -> TextDirection -> Bool # (>) :: TextDirection -> TextDirection -> Bool # (>=) :: TextDirection -> TextDirection -> Bool # max :: TextDirection -> TextDirection -> TextDirection # min :: TextDirection -> TextDirection -> TextDirection #
Ord TextBufferTargetInfo
Instance details Defined in GI.Gtk.Enums Methods compare :: TextBufferTargetInfo -> TextBufferTargetInfo -> Ordering # (<) :: TextBufferTargetInfo -> TextBufferTargetInfo -> Bool # (<=) :: TextBufferTargetInfo -> TextBufferTargetInfo -> Bool # (>) :: TextBufferTargetInfo -> TextBufferTargetInfo -> Bool # (>=) :: TextBufferTargetInfo -> TextBufferTargetInfo -> Bool # max :: TextBufferTargetInfo -> TextBufferTargetInfo -> TextBufferTargetInfo # min :: TextBufferTargetInfo -> TextBufferTargetInfo -> TextBufferTargetInfo #
Ord StateType
Instance details Defined in GI.Gtk.Enums Methods compare :: StateType -> StateType -> Ordering # (<) :: StateType -> StateType -> Bool # (<=) :: StateType -> StateType -> Bool # (>) :: StateType -> StateType -> Bool # (>=) :: StateType -> StateType -> Bool # max :: StateType -> StateType -> StateType # min :: StateType -> StateType -> StateType #
Ord StackTransitionType
Instance details Defined in GI.Gtk.Enums Methods compare :: StackTransitionType -> StackTransitionType -> Ordering # (<) :: StackTransitionType -> StackTransitionType -> Bool # (<=) :: StackTransitionType -> StackTransitionType -> Bool # (>) :: StackTransitionType -> StackTransitionType -> Bool # (>=) :: StackTransitionType -> StackTransitionType -> Bool # max :: StackTransitionType -> StackTransitionType -> StackTransitionType # min :: StackTransitionType -> StackTransitionType -> StackTransitionType #
Ord SpinType
Instance details Defined in GI.Gtk.Enums Methods compare :: SpinType -> SpinType -> Ordering # (<) :: SpinType -> SpinType -> Bool # (<=) :: SpinType -> SpinType -> Bool # (>) :: SpinType -> SpinType -> Bool # (>=) :: SpinType -> SpinType -> Bool # max :: SpinType -> SpinType -> SpinType # min :: SpinType -> SpinType -> SpinType #
Ord SpinButtonUpdatePolicy
Instance details Defined in GI.Gtk.Enums Methods compare :: SpinButtonUpdatePolicy -> SpinButtonUpdatePolicy -> Ordering # (<) :: SpinButtonUpdatePolicy -> SpinButtonUpdatePolicy -> Bool # (<=) :: SpinButtonUpdatePolicy -> SpinButtonUpdatePolicy -> Bool # (>) :: SpinButtonUpdatePolicy -> SpinButtonUpdatePolicy -> Bool # (>=) :: SpinButtonUpdatePolicy -> SpinButtonUpdatePolicy -> Bool # max :: SpinButtonUpdatePolicy -> SpinButtonUpdatePolicy -> SpinButtonUpdatePolicy # min :: SpinButtonUpdatePolicy -> SpinButtonUpdatePolicy -> SpinButtonUpdatePolicy #
Ord SortType
Instance details Defined in GI.Gtk.Enums Methods compare :: SortType -> SortType -> Ordering # (<) :: SortType -> SortType -> Bool # (<=) :: SortType -> SortType -> Bool # (>) :: SortType -> SortType -> Bool # (>=) :: SortType -> SortType -> Bool # max :: SortType -> SortType -> SortType # min :: SortType -> SortType -> SortType #
Ord SizeRequestMode
Instance details Defined in GI.Gtk.Enums Methods compare :: SizeRequestMode -> SizeRequestMode -> Ordering # (<) :: SizeRequestMode -> SizeRequestMode -> Bool # (<=) :: SizeRequestMode -> SizeRequestMode -> Bool # (>) :: SizeRequestMode -> SizeRequestMode -> Bool # (>=) :: SizeRequestMode -> SizeRequestMode -> Bool # max :: SizeRequestMode -> SizeRequestMode -> SizeRequestMode # min :: SizeRequestMode -> SizeRequestMode -> SizeRequestMode #
Ord SizeGroupMode
Instance details Defined in GI.Gtk.Enums Methods compare :: SizeGroupMode -> SizeGroupMode -> Ordering # (<) :: SizeGroupMode -> SizeGroupMode -> Bool # (<=) :: SizeGroupMode -> SizeGroupMode -> Bool # (>) :: SizeGroupMode -> SizeGroupMode -> Bool # (>=) :: SizeGroupMode -> SizeGroupMode -> Bool # max :: SizeGroupMode -> SizeGroupMode -> SizeGroupMode # min :: SizeGroupMode -> SizeGroupMode -> SizeGroupMode #
Ord ShortcutType
Instance details Defined in GI.Gtk.Enums Methods compare :: ShortcutType -> ShortcutType -> Ordering # (<) :: ShortcutType -> ShortcutType -> Bool # (<=) :: ShortcutType -> ShortcutType -> Bool # (>) :: ShortcutType -> ShortcutType -> Bool # (>=) :: ShortcutType -> ShortcutType -> Bool # max :: ShortcutType -> ShortcutType -> ShortcutType # min :: ShortcutType -> ShortcutType -> ShortcutType #
Ord ShadowType
Instance details Defined in GI.Gtk.Enums Methods compare :: ShadowType -> ShadowType -> Ordering # (<) :: ShadowType -> ShadowType -> Bool # (<=) :: ShadowType -> ShadowType -> Bool # (>) :: ShadowType -> ShadowType -> Bool # (>=) :: ShadowType -> ShadowType -> Bool # max :: ShadowType -> ShadowType -> ShadowType # min :: ShadowType -> ShadowType -> ShadowType #
Ord SensitivityType
Instance details Defined in GI.Gtk.Enums Methods compare :: SensitivityType -> SensitivityType -> Ordering # (<) :: SensitivityType -> SensitivityType -> Bool # (<=) :: SensitivityType -> SensitivityType -> Bool # (>) :: SensitivityType -> SensitivityType -> Bool # (>=) :: SensitivityType -> SensitivityType -> Bool # max :: SensitivityType -> SensitivityType -> SensitivityType # min :: SensitivityType -> SensitivityType -> SensitivityType #
Ord SelectionMode
Instance details Defined in GI.Gtk.Enums Methods compare :: SelectionMode -> SelectionMode -> Ordering # (<) :: SelectionMode -> SelectionMode -> Bool # (<=) :: SelectionMode -> SelectionMode -> Bool # (>) :: SelectionMode -> SelectionMode -> Bool # (>=) :: SelectionMode -> SelectionMode -> Bool # max :: SelectionMode -> SelectionMode -> SelectionMode # min :: SelectionMode -> SelectionMode -> SelectionMode #
Ord ScrollablePolicy
Instance details Defined in GI.Gtk.Enums Methods compare :: ScrollablePolicy -> ScrollablePolicy -> Ordering # (<) :: ScrollablePolicy -> ScrollablePolicy -> Bool # (<=) :: ScrollablePolicy -> ScrollablePolicy -> Bool # (>) :: ScrollablePolicy -> ScrollablePolicy -> Bool # (>=) :: ScrollablePolicy -> ScrollablePolicy -> Bool # max :: ScrollablePolicy -> ScrollablePolicy -> ScrollablePolicy # min :: ScrollablePolicy -> ScrollablePolicy -> ScrollablePolicy #
Ord ScrollType
Instance details Defined in GI.Gtk.Enums Methods compare :: ScrollType -> ScrollType -> Ordering # (<) :: ScrollType -> ScrollType -> Bool # (<=) :: ScrollType -> ScrollType -> Bool # (>) :: ScrollType -> ScrollType -> Bool # (>=) :: ScrollType -> ScrollType -> Bool # max :: ScrollType -> ScrollType -> ScrollType # min :: ScrollType -> ScrollType -> ScrollType #
Ord ScrollStep
Instance details Defined in GI.Gtk.Enums Methods compare :: ScrollStep -> ScrollStep -> Ordering # (<) :: ScrollStep -> ScrollStep -> Bool # (<=) :: ScrollStep -> ScrollStep -> Bool # (>) :: ScrollStep -> ScrollStep -> Bool # (>=) :: ScrollStep -> ScrollStep -> Bool # max :: ScrollStep -> ScrollStep -> ScrollStep # min :: ScrollStep -> ScrollStep -> ScrollStep #
Ord RevealerTransitionType
Instance details Defined in GI.Gtk.Enums Methods compare :: RevealerTransitionType -> RevealerTransitionType -> Ordering # (<) :: RevealerTransitionType -> RevealerTransitionType -> Bool # (<=) :: RevealerTransitionType -> RevealerTransitionType -> Bool # (>) :: RevealerTransitionType -> RevealerTransitionType -> Bool # (>=) :: RevealerTransitionType -> RevealerTransitionType -> Bool # max :: RevealerTransitionType -> RevealerTransitionType -> RevealerTransitionType # min :: RevealerTransitionType -> RevealerTransitionType -> RevealerTransitionType #
Ord ResponseType
Instance details Defined in GI.Gtk.Enums Methods compare :: ResponseType -> ResponseType -> Ordering # (<) :: ResponseType -> ResponseType -> Bool # (<=) :: ResponseType -> ResponseType -> Bool # (>) :: ResponseType -> ResponseType -> Bool # (>=) :: ResponseType -> ResponseType -> Bool # max :: ResponseType -> ResponseType -> ResponseType # min :: ResponseType -> ResponseType -> ResponseType #
Ord ResizeMode
Instance details Defined in GI.Gtk.Enums Methods compare :: ResizeMode -> ResizeMode -> Ordering # (<) :: ResizeMode -> ResizeMode -> Bool # (<=) :: ResizeMode -> ResizeMode -> Bool # (>) :: ResizeMode -> ResizeMode -> Bool # (>=) :: ResizeMode -> ResizeMode -> Bool # max :: ResizeMode -> ResizeMode -> ResizeMode # min :: ResizeMode -> ResizeMode -> ResizeMode #
Ord ReliefStyle
Instance details Defined in GI.Gtk.Enums Methods compare :: ReliefStyle -> ReliefStyle -> Ordering # (<) :: ReliefStyle -> ReliefStyle -> Bool # (<=) :: ReliefStyle -> ReliefStyle -> Bool # (>) :: ReliefStyle -> ReliefStyle -> Bool # (>=) :: ReliefStyle -> ReliefStyle -> Bool # max :: ReliefStyle -> ReliefStyle -> ReliefStyle # min :: ReliefStyle -> ReliefStyle -> ReliefStyle #
Ord RecentSortType
Instance details Defined in GI.Gtk.Enums Methods compare :: RecentSortType -> RecentSortType -> Ordering # (<) :: RecentSortType -> RecentSortType -> Bool # (<=) :: RecentSortType -> RecentSortType -> Bool # (>) :: RecentSortType -> RecentSortType -> Bool # (>=) :: RecentSortType -> RecentSortType -> Bool # max :: RecentSortType -> RecentSortType -> RecentSortType # min :: RecentSortType -> RecentSortType -> RecentSortType #
Ord RecentManagerError
Instance details Defined in GI.Gtk.Enums Methods compare :: RecentManagerError -> RecentManagerError -> Ordering # (<) :: RecentManagerError -> RecentManagerError -> Bool # (<=) :: RecentManagerError -> RecentManagerError -> Bool # (>) :: RecentManagerError -> RecentManagerError -> Bool # (>=) :: RecentManagerError -> RecentManagerError -> Bool # max :: RecentManagerError -> RecentManagerError -> RecentManagerError # min :: RecentManagerError -> RecentManagerError -> RecentManagerError #
Ord RecentChooserError
Instance details Defined in GI.Gtk.Enums Methods compare :: RecentChooserError -> RecentChooserError -> Ordering # (<) :: RecentChooserError -> RecentChooserError -> Bool # (<=) :: RecentChooserError -> RecentChooserError -> Bool # (>) :: RecentChooserError -> RecentChooserError -> Bool # (>=) :: RecentChooserError -> RecentChooserError -> Bool # max :: RecentChooserError -> RecentChooserError -> RecentChooserError # min :: RecentChooserError -> RecentChooserError -> RecentChooserError #
Ord RcTokenType
Instance details Defined in GI.Gtk.Enums Methods compare :: RcTokenType -> RcTokenType -> Ordering # (<) :: RcTokenType -> RcTokenType -> Bool # (<=) :: RcTokenType -> RcTokenType -> Bool # (>) :: RcTokenType -> RcTokenType -> Bool # (>=) :: RcTokenType -> RcTokenType -> Bool # max :: RcTokenType -> RcTokenType -> RcTokenType # min :: RcTokenType -> RcTokenType -> RcTokenType #
Ord PropagationPhase
Instance details Defined in GI.Gtk.Enums Methods compare :: PropagationPhase -> PropagationPhase -> Ordering # (<) :: PropagationPhase -> PropagationPhase -> Bool # (<=) :: PropagationPhase -> PropagationPhase -> Bool # (>) :: PropagationPhase -> PropagationPhase -> Bool # (>=) :: PropagationPhase -> PropagationPhase -> Bool # max :: PropagationPhase -> PropagationPhase -> PropagationPhase # min :: PropagationPhase -> PropagationPhase -> PropagationPhase #
Ord PrintStatus
Instance details Defined in GI.Gtk.Enums Methods compare :: PrintStatus -> PrintStatus -> Ordering # (<) :: PrintStatus -> PrintStatus -> Bool # (<=) :: PrintStatus -> PrintStatus -> Bool # (>) :: PrintStatus -> PrintStatus -> Bool # (>=) :: PrintStatus -> PrintStatus -> Bool # max :: PrintStatus -> PrintStatus -> PrintStatus # min :: PrintStatus -> PrintStatus -> PrintStatus #
Ord PrintQuality
Instance details Defined in GI.Gtk.Enums Methods compare :: PrintQuality -> PrintQuality -> Ordering # (<) :: PrintQuality -> PrintQuality -> Bool # (<=) :: PrintQuality -> PrintQuality -> Bool # (>) :: PrintQuality -> PrintQuality -> Bool # (>=) :: PrintQuality -> PrintQuality -> Bool # max :: PrintQuality -> PrintQuality -> PrintQuality # min :: PrintQuality -> PrintQuality -> PrintQuality #
Ord PrintPages
Instance details Defined in GI.Gtk.Enums Methods compare :: PrintPages -> PrintPages -> Ordering # (<) :: PrintPages -> PrintPages -> Bool # (<=) :: PrintPages -> PrintPages -> Bool # (>) :: PrintPages -> PrintPages -> Bool # (>=) :: PrintPages -> PrintPages -> Bool # max :: PrintPages -> PrintPages -> PrintPages # min :: PrintPages -> PrintPages -> PrintPages #
Ord PrintOperationResult
Instance details Defined in GI.Gtk.Enums Methods compare :: PrintOperationResult -> PrintOperationResult -> Ordering # (<) :: PrintOperationResult -> PrintOperationResult -> Bool # (<=) :: PrintOperationResult -> PrintOperationResult -> Bool # (>) :: PrintOperationResult -> PrintOperationResult -> Bool # (>=) :: PrintOperationResult -> PrintOperationResult -> Bool # max :: PrintOperationResult -> PrintOperationResult -> PrintOperationResult # min :: PrintOperationResult -> PrintOperationResult -> PrintOperationResult #
Ord PrintOperationAction
Instance details Defined in GI.Gtk.Enums Methods compare :: PrintOperationAction -> PrintOperationAction -> Ordering # (<) :: PrintOperationAction -> PrintOperationAction -> Bool # (<=) :: PrintOperationAction -> PrintOperationAction -> Bool # (>) :: PrintOperationAction -> PrintOperationAction -> Bool # (>=) :: PrintOperationAction -> PrintOperationAction -> Bool # max :: PrintOperationAction -> PrintOperationAction -> PrintOperationAction # min :: PrintOperationAction -> PrintOperationAction -> PrintOperationAction #
Ord PrintError
Instance details Defined in GI.Gtk.Enums Methods compare :: PrintError -> PrintError -> Ordering # (<) :: PrintError -> PrintError -> Bool # (<=) :: PrintError -> PrintError -> Bool # (>) :: PrintError -> PrintError -> Bool # (>=) :: PrintError -> PrintError -> Bool # max :: PrintError -> PrintError -> PrintError # min :: PrintError -> PrintError -> PrintError #
Ord PrintDuplex
Instance details Defined in GI.Gtk.Enums Methods compare :: PrintDuplex -> PrintDuplex -> Ordering # (<) :: PrintDuplex -> PrintDuplex -> Bool # (<=) :: PrintDuplex -> PrintDuplex -> Bool # (>) :: PrintDuplex -> PrintDuplex -> Bool # (>=) :: PrintDuplex -> PrintDuplex -> Bool # max :: PrintDuplex -> PrintDuplex -> PrintDuplex # min :: PrintDuplex -> PrintDuplex -> PrintDuplex #
Ord PositionType
Instance details Defined in GI.Gtk.Enums Methods compare :: PositionType -> PositionType -> Ordering # (<) :: PositionType -> PositionType -> Bool # (<=) :: PositionType -> PositionType -> Bool # (>) :: PositionType -> PositionType -> Bool # (>=) :: PositionType -> PositionType -> Bool # max :: PositionType -> PositionType -> PositionType # min :: PositionType -> PositionType -> PositionType #
Ord PopoverConstraint
Instance details Defined in GI.Gtk.Enums Methods compare :: PopoverConstraint -> PopoverConstraint -> Ordering # (<) :: PopoverConstraint -> PopoverConstraint -> Bool # (<=) :: PopoverConstraint -> PopoverConstraint -> Bool # (>) :: PopoverConstraint -> PopoverConstraint -> Bool # (>=) :: PopoverConstraint -> PopoverConstraint -> Bool # max :: PopoverConstraint -> PopoverConstraint -> PopoverConstraint # min :: PopoverConstraint -> PopoverConstraint -> PopoverConstraint #
Ord PolicyType
Instance details Defined in GI.Gtk.Enums Methods compare :: PolicyType -> PolicyType -> Ordering # (<) :: PolicyType -> PolicyType -> Bool # (<=) :: PolicyType -> PolicyType -> Bool # (>) :: PolicyType -> PolicyType -> Bool # (>=) :: PolicyType -> PolicyType -> Bool # max :: PolicyType -> PolicyType -> PolicyType # min :: PolicyType -> PolicyType -> PolicyType #
Ord PathType
Instance details Defined in GI.Gtk.Enums Methods compare :: PathType -> PathType -> Ordering # (<) :: PathType -> PathType -> Bool # (<=) :: PathType -> PathType -> Bool # (>) :: PathType -> PathType -> Bool # (>=) :: PathType -> PathType -> Bool # max :: PathType -> PathType -> PathType # min :: PathType -> PathType -> PathType #
Ord PathPriorityType
Instance details Defined in GI.Gtk.Enums Methods compare :: PathPriorityType -> PathPriorityType -> Ordering # (<) :: PathPriorityType -> PathPriorityType -> Bool # (<=) :: PathPriorityType -> PathPriorityType -> Bool # (>) :: PathPriorityType -> PathPriorityType -> Bool # (>=) :: PathPriorityType -> PathPriorityType -> Bool # max :: PathPriorityType -> PathPriorityType -> PathPriorityType # min :: PathPriorityType -> PathPriorityType -> PathPriorityType #
Ord PanDirection
Instance details Defined in GI.Gtk.Enums Methods compare :: PanDirection -> PanDirection -> Ordering # (<) :: PanDirection -> PanDirection -> Bool # (<=) :: PanDirection -> PanDirection -> Bool # (>) :: PanDirection -> PanDirection -> Bool # (>=) :: PanDirection -> PanDirection -> Bool # max :: PanDirection -> PanDirection -> PanDirection # min :: PanDirection -> PanDirection -> PanDirection #
Ord PageSet
Instance details Defined in GI.Gtk.Enums Methods compare :: PageSet -> PageSet -> Ordering # (<) :: PageSet -> PageSet -> Bool # (<=) :: PageSet -> PageSet -> Bool # (>) :: PageSet -> PageSet -> Bool # (>=) :: PageSet -> PageSet -> Bool # max :: PageSet -> PageSet -> PageSet # min :: PageSet -> PageSet -> PageSet #
Ord PageOrientation
Instance details Defined in GI.Gtk.Enums Methods compare :: PageOrientation -> PageOrientation -> Ordering # (<) :: PageOrientation -> PageOrientation -> Bool # (<=) :: PageOrientation -> PageOrientation -> Bool # (>) :: PageOrientation -> PageOrientation -> Bool # (>=) :: PageOrientation -> PageOrientation -> Bool # max :: PageOrientation -> PageOrientation -> PageOrientation # min :: PageOrientation -> PageOrientation -> PageOrientation #
Ord PadActionType
Instance details Defined in GI.Gtk.Enums Methods compare :: PadActionType -> PadActionType -> Ordering # (<) :: PadActionType -> PadActionType -> Bool # (<=) :: PadActionType -> PadActionType -> Bool # (>) :: PadActionType -> PadActionType -> Bool # (>=) :: PadActionType -> PadActionType -> Bool # max :: PadActionType -> PadActionType -> PadActionType # min :: PadActionType -> PadActionType -> PadActionType #
Ord PackType
Instance details Defined in GI.Gtk.Enums Methods compare :: PackType -> PackType -> Ordering # (<) :: PackType -> PackType -> Bool # (<=) :: PackType -> PackType -> Bool # (>) :: PackType -> PackType -> Bool # (>=) :: PackType -> PackType -> Bool # max :: PackType -> PackType -> PackType # min :: PackType -> PackType -> PackType #
Ord PackDirection
Instance details Defined in GI.Gtk.Enums Methods compare :: PackDirection -> PackDirection -> Ordering # (<) :: PackDirection -> PackDirection -> Bool # (<=) :: PackDirection -> PackDirection -> Bool # (>) :: PackDirection -> PackDirection -> Bool # (>=) :: PackDirection -> PackDirection -> Bool # max :: PackDirection -> PackDirection -> PackDirection # min :: PackDirection -> PackDirection -> PackDirection #
Ord Orientation
Instance details Defined in GI.Gtk.Enums Methods compare :: Orientation -> Orientation -> Ordering # (<) :: Orientation -> Orientation -> Bool # (<=) :: Orientation -> Orientation -> Bool # (>) :: Orientation -> Orientation -> Bool # (>=) :: Orientation -> Orientation -> Bool # max :: Orientation -> Orientation -> Orientation # min :: Orientation -> Orientation -> Orientation #
Ord NumberUpLayout
Instance details Defined in GI.Gtk.Enums Methods compare :: NumberUpLayout -> NumberUpLayout -> Ordering # (<) :: NumberUpLayout -> NumberUpLayout -> Bool # (<=) :: NumberUpLayout -> NumberUpLayout -> Bool # (>) :: NumberUpLayout -> NumberUpLayout -> Bool # (>=) :: NumberUpLayout -> NumberUpLayout -> Bool # max :: NumberUpLayout -> NumberUpLayout -> NumberUpLayout # min :: NumberUpLayout -> NumberUpLayout -> NumberUpLayout #
Ord NotebookTab
Instance details Defined in GI.Gtk.Enums Methods compare :: NotebookTab -> NotebookTab -> Ordering # (<) :: NotebookTab -> NotebookTab -> Bool # (<=) :: NotebookTab -> NotebookTab -> Bool # (>) :: NotebookTab -> NotebookTab -> Bool # (>=) :: NotebookTab -> NotebookTab -> Bool # max :: NotebookTab -> NotebookTab -> NotebookTab # min :: NotebookTab -> NotebookTab -> NotebookTab #
Ord MovementStep
Instance details Defined in GI.Gtk.Enums Methods compare :: MovementStep -> MovementStep -> Ordering # (<) :: MovementStep -> MovementStep -> Bool # (<=) :: MovementStep -> MovementStep -> Bool # (>) :: MovementStep -> MovementStep -> Bool # (>=) :: MovementStep -> MovementStep -> Bool # max :: MovementStep -> MovementStep -> MovementStep # min :: MovementStep -> MovementStep -> MovementStep #
Ord MessageType
Instance details Defined in GI.Gtk.Enums Methods compare :: MessageType -> MessageType -> Ordering # (<) :: MessageType -> MessageType -> Bool # (<=) :: MessageType -> MessageType -> Bool # (>) :: MessageType -> MessageType -> Bool # (>=) :: MessageType -> MessageType -> Bool # max :: MessageType -> MessageType -> MessageType # min :: MessageType -> MessageType -> MessageType #
Ord MenuDirectionType
Instance details Defined in GI.Gtk.Enums Methods compare :: MenuDirectionType -> MenuDirectionType -> Ordering # (<) :: MenuDirectionType -> MenuDirectionType -> Bool # (<=) :: MenuDirectionType -> MenuDirectionType -> Bool # (>) :: MenuDirectionType -> MenuDirectionType -> Bool # (>=) :: MenuDirectionType -> MenuDirectionType -> Bool # max :: MenuDirectionType -> MenuDirectionType -> MenuDirectionType # min :: MenuDirectionType -> MenuDirectionType -> MenuDirectionType #
Ord License
Instance details Defined in GI.Gtk.Enums Methods compare :: License -> License -> Ordering # (<) :: License -> License -> Bool # (<=) :: License -> License -> Bool # (>) :: License -> License -> Bool # (>=) :: License -> License -> Bool # max :: License -> License -> License # min :: License -> License -> License #
Ord LevelBarMode
Instance details Defined in GI.Gtk.Enums Methods compare :: LevelBarMode -> LevelBarMode -> Ordering # (<) :: LevelBarMode -> LevelBarMode -> Bool # (<=) :: LevelBarMode -> LevelBarMode -> Bool # (>) :: LevelBarMode -> LevelBarMode -> Bool # (>=) :: LevelBarMode -> LevelBarMode -> Bool # max :: LevelBarMode -> LevelBarMode -> LevelBarMode # min :: LevelBarMode -> LevelBarMode -> LevelBarMode #
Ord Justification
Instance details Defined in GI.Gtk.Enums Methods compare :: Justification -> Justification -> Ordering # (<) :: Justification -> Justification -> Bool # (<=) :: Justification -> Justification -> Bool # (>) :: Justification -> Justification -> Bool # (>=) :: Justification -> Justification -> Bool # max :: Justification -> Justification -> Justification # min :: Justification -> Justification -> Justification #
Ord InputPurpose
Instance details Defined in GI.Gtk.Enums Methods compare :: InputPurpose -> InputPurpose -> Ordering # (<) :: InputPurpose -> InputPurpose -> Bool # (<=) :: InputPurpose -> InputPurpose -> Bool # (>) :: InputPurpose -> InputPurpose -> Bool # (>=) :: InputPurpose -> InputPurpose -> Bool # max :: InputPurpose -> InputPurpose -> InputPurpose # min :: InputPurpose -> InputPurpose -> InputPurpose #
Ord ImageType
Instance details Defined in GI.Gtk.Enums Methods compare :: ImageType -> ImageType -> Ordering # (<) :: ImageType -> ImageType -> Bool # (<=) :: ImageType -> ImageType -> Bool # (>) :: ImageType -> ImageType -> Bool # (>=) :: ImageType -> ImageType -> Bool # max :: ImageType -> ImageType -> ImageType # min :: ImageType -> ImageType -> ImageType #
Ord IconViewDropPosition
Instance details Defined in GI.Gtk.Enums Methods compare :: IconViewDropPosition -> IconViewDropPosition -> Ordering # (<) :: IconViewDropPosition -> IconViewDropPosition -> Bool # (<=) :: IconViewDropPosition -> IconViewDropPosition -> Bool # (>) :: IconViewDropPosition -> IconViewDropPosition -> Bool # (>=) :: IconViewDropPosition -> IconViewDropPosition -> Bool # max :: IconViewDropPosition -> IconViewDropPosition -> IconViewDropPosition # min :: IconViewDropPosition -> IconViewDropPosition -> IconViewDropPosition #
Ord IconThemeError
Instance details Defined in GI.Gtk.Enums Methods compare :: IconThemeError -> IconThemeError -> Ordering # (<) :: IconThemeError -> IconThemeError -> Bool # (<=) :: IconThemeError -> IconThemeError -> Bool # (>) :: IconThemeError -> IconThemeError -> Bool # (>=) :: IconThemeError -> IconThemeError -> Bool # max :: IconThemeError -> IconThemeError -> IconThemeError # min :: IconThemeError -> IconThemeError -> IconThemeError #
Ord IconSize
Instance details Defined in GI.Gtk.Enums Methods compare :: IconSize -> IconSize -> Ordering # (<) :: IconSize -> IconSize -> Bool # (<=) :: IconSize -> IconSize -> Bool # (>) :: IconSize -> IconSize -> Bool # (>=) :: IconSize -> IconSize -> Bool # max :: IconSize -> IconSize -> IconSize # min :: IconSize -> IconSize -> IconSize #
Ord IMStatusStyle
Instance details Defined in GI.Gtk.Enums Methods compare :: IMStatusStyle -> IMStatusStyle -> Ordering # (<) :: IMStatusStyle -> IMStatusStyle -> Bool # (<=) :: IMStatusStyle -> IMStatusStyle -> Bool # (>) :: IMStatusStyle -> IMStatusStyle -> Bool # (>=) :: IMStatusStyle -> IMStatusStyle -> Bool # max :: IMStatusStyle -> IMStatusStyle -> IMStatusStyle # min :: IMStatusStyle -> IMStatusStyle -> IMStatusStyle #
Ord IMPreeditStyle
Instance details Defined in GI.Gtk.Enums Methods compare :: IMPreeditStyle -> IMPreeditStyle -> Ordering # (<) :: IMPreeditStyle -> IMPreeditStyle -> Bool # (<=) :: IMPreeditStyle -> IMPreeditStyle -> Bool # (>) :: IMPreeditStyle -> IMPreeditStyle -> Bool # (>=) :: IMPreeditStyle -> IMPreeditStyle -> Bool # max :: IMPreeditStyle -> IMPreeditStyle -> IMPreeditStyle # min :: IMPreeditStyle -> IMPreeditStyle -> IMPreeditStyle #
Ord FileChooserError
Instance details Defined in GI.Gtk.Enums Methods compare :: FileChooserError -> FileChooserError -> Ordering # (<) :: FileChooserError -> FileChooserError -> Bool # (<=) :: FileChooserError -> FileChooserError -> Bool # (>) :: FileChooserError -> FileChooserError -> Bool # (>=) :: FileChooserError -> FileChooserError -> Bool # max :: FileChooserError -> FileChooserError -> FileChooserError # min :: FileChooserError -> FileChooserError -> FileChooserError #
Ord FileChooserConfirmation
Instance details Defined in GI.Gtk.Enums Methods compare :: FileChooserConfirmation -> FileChooserConfirmation -> Ordering # (<) :: FileChooserConfirmation -> FileChooserConfirmation -> Bool # (<=) :: FileChooserConfirmation -> FileChooserConfirmation -> Bool # (>) :: FileChooserConfirmation -> FileChooserConfirmation -> Bool # (>=) :: FileChooserConfirmation -> FileChooserConfirmation -> Bool # max :: FileChooserConfirmation -> FileChooserConfirmation -> FileChooserConfirmation # min :: FileChooserConfirmation -> FileChooserConfirmation -> FileChooserConfirmation #
Ord FileChooserAction
Instance details Defined in GI.Gtk.Enums Methods compare :: FileChooserAction -> FileChooserAction -> Ordering # (<) :: FileChooserAction -> FileChooserAction -> Bool # (<=) :: FileChooserAction -> FileChooserAction -> Bool # (>) :: FileChooserAction -> FileChooserAction -> Bool # (>=) :: FileChooserAction -> FileChooserAction -> Bool # max :: FileChooserAction -> FileChooserAction -> FileChooserAction # min :: FileChooserAction -> FileChooserAction -> FileChooserAction #
Ord ExpanderStyle
Instance details Defined in GI.Gtk.Enums Methods compare :: ExpanderStyle -> ExpanderStyle -> Ordering # (<) :: ExpanderStyle -> ExpanderStyle -> Bool # (<=) :: ExpanderStyle -> ExpanderStyle -> Bool # (>) :: ExpanderStyle -> ExpanderStyle -> Bool # (>=) :: ExpanderStyle -> ExpanderStyle -> Bool # max :: ExpanderStyle -> ExpanderStyle -> ExpanderStyle # min :: ExpanderStyle -> ExpanderStyle -> ExpanderStyle #
Ord EventSequenceState
Instance details Defined in GI.Gtk.Enums Methods compare :: EventSequenceState -> EventSequenceState -> Ordering # (<) :: EventSequenceState -> EventSequenceState -> Bool # (<=) :: EventSequenceState -> EventSequenceState -> Bool # (>) :: EventSequenceState -> EventSequenceState -> Bool # (>=) :: EventSequenceState -> EventSequenceState -> Bool # max :: EventSequenceState -> EventSequenceState -> EventSequenceState # min :: EventSequenceState -> EventSequenceState -> EventSequenceState #
Ord EntryIconPosition
Instance details Defined in GI.Gtk.Enums Methods compare :: EntryIconPosition -> EntryIconPosition -> Ordering # (<) :: EntryIconPosition -> EntryIconPosition -> Bool # (<=) :: EntryIconPosition -> EntryIconPosition -> Bool # (>) :: EntryIconPosition -> EntryIconPosition -> Bool # (>=) :: EntryIconPosition -> EntryIconPosition -> Bool # max :: EntryIconPosition -> EntryIconPosition -> EntryIconPosition # min :: EntryIconPosition -> EntryIconPosition -> EntryIconPosition #
Ord DragResult
Instance details Defined in GI.Gtk.Enums Methods compare :: DragResult -> DragResult -> Ordering # (<) :: DragResult -> DragResult -> Bool # (<=) :: DragResult -> DragResult -> Bool # (>) :: DragResult -> DragResult -> Bool # (>=) :: DragResult -> DragResult -> Bool # max :: DragResult -> DragResult -> DragResult # min :: DragResult -> DragResult -> DragResult #
Ord DirectionType
Instance details Defined in GI.Gtk.Enums Methods compare :: DirectionType -> DirectionType -> Ordering # (<) :: DirectionType -> DirectionType -> Bool # (<=) :: DirectionType -> DirectionType -> Bool # (>) :: DirectionType -> DirectionType -> Bool # (>=) :: DirectionType -> DirectionType -> Bool # max :: DirectionType -> DirectionType -> DirectionType # min :: DirectionType -> DirectionType -> DirectionType #
Ord DeleteType
Instance details Defined in GI.Gtk.Enums Methods compare :: DeleteType -> DeleteType -> Ordering # (<) :: DeleteType -> DeleteType -> Bool # (<=) :: DeleteType -> DeleteType -> Bool # (>) :: DeleteType -> DeleteType -> Bool # (>=) :: DeleteType -> DeleteType -> Bool # max :: DeleteType -> DeleteType -> DeleteType # min :: DeleteType -> DeleteType -> DeleteType #
Ord CssSectionType
Instance details Defined in GI.Gtk.Enums Methods compare :: CssSectionType -> CssSectionType -> Ordering # (<) :: CssSectionType -> CssSectionType -> Bool # (<=) :: CssSectionType -> CssSectionType -> Bool # (>) :: CssSectionType -> CssSectionType -> Bool # (>=) :: CssSectionType -> CssSectionType -> Bool # max :: CssSectionType -> CssSectionType -> CssSectionType # min :: CssSectionType -> CssSectionType -> CssSectionType #
Ord CssProviderError
Instance details Defined in GI.Gtk.Enums Methods compare :: CssProviderError -> CssProviderError -> Ordering # (<) :: CssProviderError -> CssProviderError -> Bool # (<=) :: CssProviderError -> CssProviderError -> Bool # (>) :: CssProviderError -> CssProviderError -> Bool # (>=) :: CssProviderError -> CssProviderError -> Bool # max :: CssProviderError -> CssProviderError -> CssProviderError # min :: CssProviderError -> CssProviderError -> CssProviderError #
Ord CornerType
Instance details Defined in GI.Gtk.Enums Methods compare :: CornerType -> CornerType -> Ordering # (<) :: CornerType -> CornerType -> Bool # (<=) :: CornerType -> CornerType -> Bool # (>) :: CornerType -> CornerType -> Bool # (>=) :: CornerType -> CornerType -> Bool # max :: CornerType -> CornerType -> CornerType # min :: CornerType -> CornerType -> CornerType #
Ord CellRendererMode
Instance details Defined in GI.Gtk.Enums Methods compare :: CellRendererMode -> CellRendererMode -> Ordering # (<) :: CellRendererMode -> CellRendererMode -> Bool # (<=) :: CellRendererMode -> CellRendererMode -> Bool # (>) :: CellRendererMode -> CellRendererMode -> Bool # (>=) :: CellRendererMode -> CellRendererMode -> Bool # max :: CellRendererMode -> CellRendererMode -> CellRendererMode # min :: CellRendererMode -> CellRendererMode -> CellRendererMode #
Ord CellRendererAccelMode
Instance details Defined in GI.Gtk.Enums Methods compare :: CellRendererAccelMode -> CellRendererAccelMode -> Ordering # (<) :: CellRendererAccelMode -> CellRendererAccelMode -> Bool # (<=) :: CellRendererAccelMode -> CellRendererAccelMode -> Bool # (>) :: CellRendererAccelMode -> CellRendererAccelMode -> Bool # (>=) :: CellRendererAccelMode -> CellRendererAccelMode -> Bool # max :: CellRendererAccelMode -> CellRendererAccelMode -> CellRendererAccelMode # min :: CellRendererAccelMode -> CellRendererAccelMode -> CellRendererAccelMode #
Ord ButtonsType
Instance details Defined in GI.Gtk.Enums Methods compare :: ButtonsType -> ButtonsType -> Ordering # (<) :: ButtonsType -> ButtonsType -> Bool # (<=) :: ButtonsType -> ButtonsType -> Bool # (>) :: ButtonsType -> ButtonsType -> Bool # (>=) :: ButtonsType -> ButtonsType -> Bool # max :: ButtonsType -> ButtonsType -> ButtonsType # min :: ButtonsType -> ButtonsType -> ButtonsType #
Ord ButtonRole
Instance details Defined in GI.Gtk.Enums Methods compare :: ButtonRole -> ButtonRole -> Ordering # (<) :: ButtonRole -> ButtonRole -> Bool # (<=) :: ButtonRole -> ButtonRole -> Bool # (>) :: ButtonRole -> ButtonRole -> Bool # (>=) :: ButtonRole -> ButtonRole -> Bool # max :: ButtonRole -> ButtonRole -> ButtonRole # min :: ButtonRole -> ButtonRole -> ButtonRole #
Ord ButtonBoxStyle
Instance details Defined in GI.Gtk.Enums Methods compare :: ButtonBoxStyle -> ButtonBoxStyle -> Ordering # (<) :: ButtonBoxStyle -> ButtonBoxStyle -> Bool # (<=) :: ButtonBoxStyle -> ButtonBoxStyle -> Bool # (>) :: ButtonBoxStyle -> ButtonBoxStyle -> Bool # (>=) :: ButtonBoxStyle -> ButtonBoxStyle -> Bool # max :: ButtonBoxStyle -> ButtonBoxStyle -> ButtonBoxStyle # min :: ButtonBoxStyle -> ButtonBoxStyle -> ButtonBoxStyle #
Ord BuilderError
Instance details Defined in GI.Gtk.Enums Methods compare :: BuilderError -> BuilderError -> Ordering # (<) :: BuilderError -> BuilderError -> Bool # (<=) :: BuilderError -> BuilderError -> Bool # (>) :: BuilderError -> BuilderError -> Bool # (>=) :: BuilderError -> BuilderError -> Bool # max :: BuilderError -> BuilderError -> BuilderError # min :: BuilderError -> BuilderError -> BuilderError #
Ord BorderStyle
Instance details Defined in GI.Gtk.Enums Methods compare :: BorderStyle -> BorderStyle -> Ordering # (<) :: BorderStyle -> BorderStyle -> Bool # (<=) :: BorderStyle -> BorderStyle -> Bool # (>) :: BorderStyle -> BorderStyle -> Bool # (>=) :: BorderStyle -> BorderStyle -> Bool # max :: BorderStyle -> BorderStyle -> BorderStyle # min :: BorderStyle -> BorderStyle -> BorderStyle #
Ord BaselinePosition
Instance details Defined in GI.Gtk.Enums Methods compare :: BaselinePosition -> BaselinePosition -> Ordering # (<) :: BaselinePosition -> BaselinePosition -> Bool # (<=) :: BaselinePosition -> BaselinePosition -> Bool # (>) :: BaselinePosition -> BaselinePosition -> Bool # (>=) :: BaselinePosition -> BaselinePosition -> Bool # max :: BaselinePosition -> BaselinePosition -> BaselinePosition # min :: BaselinePosition -> BaselinePosition -> BaselinePosition #
Ord AssistantPageType
Instance details Defined in GI.Gtk.Enums Methods compare :: AssistantPageType -> AssistantPageType -> Ordering # (<) :: AssistantPageType -> AssistantPageType -> Bool # (<=) :: AssistantPageType -> AssistantPageType -> Bool # (>) :: AssistantPageType -> AssistantPageType -> Bool # (>=) :: AssistantPageType -> AssistantPageType -> Bool # max :: AssistantPageType -> AssistantPageType -> AssistantPageType # min :: AssistantPageType -> AssistantPageType -> AssistantPageType #
Ord ArrowType
Instance details Defined in GI.Gtk.Enums Methods compare :: ArrowType -> ArrowType -> Ordering # (<) :: ArrowType -> ArrowType -> Bool # (<=) :: ArrowType -> ArrowType -> Bool # (>) :: ArrowType -> ArrowType -> Bool # (>=) :: ArrowType -> ArrowType -> Bool # max :: ArrowType -> ArrowType -> ArrowType # min :: ArrowType -> ArrowType -> ArrowType #
Ord ArrowPlacement
Instance details Defined in GI.Gtk.Enums Methods compare :: ArrowPlacement -> ArrowPlacement -> Ordering # (<) :: ArrowPlacement -> ArrowPlacement -> Bool # (<=) :: ArrowPlacement -> ArrowPlacement -> Bool # (>) :: ArrowPlacement -> ArrowPlacement -> Bool # (>=) :: ArrowPlacement -> ArrowPlacement -> Bool # max :: ArrowPlacement -> ArrowPlacement -> ArrowPlacement # min :: ArrowPlacement -> ArrowPlacement -> ArrowPlacement #
Ord Align
Instance details Defined in GI.Gtk.Enums Methods compare :: Align -> Align -> Ordering # (<) :: Align -> Align -> Bool # (<=) :: Align -> Align -> Bool # (>) :: Align -> Align -> Bool # (>=) :: Align -> Align -> Bool # max :: Align -> Align -> Align # min :: Align -> Align -> Align #
Ord WrapMode
Instance details Defined in GI.Pango.Enums Methods compare :: WrapMode -> WrapMode -> Ordering # (<) :: WrapMode -> WrapMode -> Bool # (<=) :: WrapMode -> WrapMode -> Bool # (>) :: WrapMode -> WrapMode -> Bool # (>=) :: WrapMode -> WrapMode -> Bool # max :: WrapMode -> WrapMode -> WrapMode # min :: WrapMode -> WrapMode -> WrapMode #
Ord Weight
Instance details Defined in GI.Pango.Enums Methods compare :: Weight -> Weight -> Ordering # (<) :: Weight -> Weight -> Bool # (<=) :: Weight -> Weight -> Bool # (>) :: Weight -> Weight -> Bool # (>=) :: Weight -> Weight -> Bool # max :: Weight -> Weight -> Weight # min :: Weight -> Weight -> Weight #
Ord Variant
Instance details Defined in GI.Pango.Enums Methods compare :: Variant -> Variant -> Ordering # (<) :: Variant -> Variant -> Bool # (<=) :: Variant -> Variant -> Bool # (>) :: Variant -> Variant -> Bool # (>=) :: Variant -> Variant -> Bool # max :: Variant -> Variant -> Variant # min :: Variant -> Variant -> Variant #
Ord Underline
Instance details Defined in GI.Pango.Enums Methods compare :: Underline -> Underline -> Ordering # (<) :: Underline -> Underline -> Bool # (<=) :: Underline -> Underline -> Bool # (>) :: Underline -> Underline -> Bool # (>=) :: Underline -> Underline -> Bool # max :: Underline -> Underline -> Underline # min :: Underline -> Underline -> Underline #
Ord TabAlign
Instance details Defined in GI.Pango.Enums Methods compare :: TabAlign -> TabAlign -> Ordering # (<) :: TabAlign -> TabAlign -> Bool # (<=) :: TabAlign -> TabAlign -> Bool # (>) :: TabAlign -> TabAlign -> Bool # (>=) :: TabAlign -> TabAlign -> Bool # max :: TabAlign -> TabAlign -> TabAlign # min :: TabAlign -> TabAlign -> TabAlign #
Ord Style
Instance details Defined in GI.Pango.Enums Methods compare :: Style -> Style -> Ordering # (<) :: Style -> Style -> Bool # (<=) :: Style -> Style -> Bool # (>) :: Style -> Style -> Bool # (>=) :: Style -> Style -> Bool # max :: Style -> Style -> Style # min :: Style -> Style -> Style #
Ord Stretch
Instance details Defined in GI.Pango.Enums Methods compare :: Stretch -> Stretch -> Ordering # (<) :: Stretch -> Stretch -> Bool # (<=) :: Stretch -> Stretch -> Bool # (>) :: Stretch -> Stretch -> Bool # (>=) :: Stretch -> Stretch -> Bool # max :: Stretch -> Stretch -> Stretch # min :: Stretch -> Stretch -> Stretch #
Ord Script
Instance details Defined in GI.Pango.Enums Methods compare :: Script -> Script -> Ordering # (<) :: Script -> Script -> Bool # (<=) :: Script -> Script -> Bool # (>) :: Script -> Script -> Bool # (>=) :: Script -> Script -> Bool # max :: Script -> Script -> Script # min :: Script -> Script -> Script #
Ord RenderPart
Instance details Defined in GI.Pango.Enums Methods compare :: RenderPart -> RenderPart -> Ordering # (<) :: RenderPart -> RenderPart -> Bool # (<=) :: RenderPart -> RenderPart -> Bool # (>) :: RenderPart -> RenderPart -> Bool # (>=) :: RenderPart -> RenderPart -> Bool # max :: RenderPart -> RenderPart -> RenderPart # min :: RenderPart -> RenderPart -> RenderPart #
Ord GravityHint
Instance details Defined in GI.Pango.Enums Methods compare :: GravityHint -> GravityHint -> Ordering # (<) :: GravityHint -> GravityHint -> Bool # (<=) :: GravityHint -> GravityHint -> Bool # (>) :: GravityHint -> GravityHint -> Bool # (>=) :: GravityHint -> GravityHint -> Bool # max :: GravityHint -> GravityHint -> GravityHint # min :: GravityHint -> GravityHint -> GravityHint #
Ord Gravity
Instance details Defined in GI.Pango.Enums Methods compare :: Gravity -> Gravity -> Ordering # (<) :: Gravity -> Gravity -> Bool # (<=) :: Gravity -> Gravity -> Bool # (>) :: Gravity -> Gravity -> Bool # (>=) :: Gravity -> Gravity -> Bool # max :: Gravity -> Gravity -> Gravity # min :: Gravity -> Gravity -> Gravity #
Ord EllipsizeMode
Instance details Defined in GI.Pango.Enums Methods compare :: EllipsizeMode -> EllipsizeMode -> Ordering # (<) :: EllipsizeMode -> EllipsizeMode -> Bool # (<=) :: EllipsizeMode -> EllipsizeMode -> Bool # (>) :: EllipsizeMode -> EllipsizeMode -> Bool # (>=) :: EllipsizeMode -> EllipsizeMode -> Bool # max :: EllipsizeMode -> EllipsizeMode -> EllipsizeMode # min :: EllipsizeMode -> EllipsizeMode -> EllipsizeMode #
Ord Direction
Instance details Defined in GI.Pango.Enums Methods compare :: Direction -> Direction -> Ordering # (<) :: Direction -> Direction -> Bool # (<=) :: Direction -> Direction -> Bool # (>) :: Direction -> Direction -> Bool # (>=) :: Direction -> Direction -> Bool # max :: Direction -> Direction -> Direction # min :: Direction -> Direction -> Direction #
Ord CoverageLevel
Instance details Defined in GI.Pango.Enums Methods compare :: CoverageLevel -> CoverageLevel -> Ordering # (<) :: CoverageLevel -> CoverageLevel -> Bool # (<=) :: CoverageLevel -> CoverageLevel -> Bool # (>) :: CoverageLevel -> CoverageLevel -> Bool # (>=) :: CoverageLevel -> CoverageLevel -> Bool # max :: CoverageLevel -> CoverageLevel -> CoverageLevel # min :: CoverageLevel -> CoverageLevel -> CoverageLevel #
Ord BidiType
Instance details Defined in GI.Pango.Enums Methods compare :: BidiType -> BidiType -> Ordering # (<) :: BidiType -> BidiType -> Bool # (<=) :: BidiType -> BidiType -> Bool # (>) :: BidiType -> BidiType -> Bool # (>=) :: BidiType -> BidiType -> Bool # max :: BidiType -> BidiType -> BidiType # min :: BidiType -> BidiType -> BidiType #
Ord AttrType
Instance details Defined in GI.Pango.Enums Methods compare :: AttrType -> AttrType -> Ordering # (<) :: AttrType -> AttrType -> Bool # (<=) :: AttrType -> AttrType -> Bool # (>) :: AttrType -> AttrType -> Bool # (>=) :: AttrType -> AttrType -> Bool # max :: AttrType -> AttrType -> AttrType # min :: AttrType -> AttrType -> AttrType #
Ord Alignment
Instance details Defined in GI.Pango.Enums Methods compare :: Alignment -> Alignment -> Ordering # (<) :: Alignment -> Alignment -> Bool # (<=) :: Alignment -> Alignment -> Bool # (>) :: Alignment -> Alignment -> Bool # (>=) :: Alignment -> Alignment -> Bool # max :: Alignment -> Alignment -> Alignment # min :: Alignment -> Alignment -> Alignment #
Ord PtyFlags
Instance details Defined in GI.Vte.Flags Methods compare :: PtyFlags -> PtyFlags -> Ordering # (<) :: PtyFlags -> PtyFlags -> Bool # (<=) :: PtyFlags -> PtyFlags -> Bool # (>) :: PtyFlags -> PtyFlags -> Bool # (>=) :: PtyFlags -> PtyFlags -> Bool # max :: PtyFlags -> PtyFlags -> PtyFlags # min :: PtyFlags -> PtyFlags -> PtyFlags #
Ord WriteFlags
Instance details Defined in GI.Vte.Enums Methods compare :: WriteFlags -> WriteFlags -> Ordering # (<) :: WriteFlags -> WriteFlags -> Bool # (<=) :: WriteFlags -> WriteFlags -> Bool # (>) :: WriteFlags -> WriteFlags -> Bool # (>=) :: WriteFlags -> WriteFlags -> Bool # max :: WriteFlags -> WriteFlags -> WriteFlags # min :: WriteFlags -> WriteFlags -> WriteFlags #
Ord TextBlinkMode
Instance details Defined in GI.Vte.Enums Methods compare :: TextBlinkMode -> TextBlinkMode -> Ordering # (<) :: TextBlinkMode -> TextBlinkMode -> Bool # (<=) :: TextBlinkMode -> TextBlinkMode -> Bool # (>) :: TextBlinkMode -> TextBlinkMode -> Bool # (>=) :: TextBlinkMode -> TextBlinkMode -> Bool # max :: TextBlinkMode -> TextBlinkMode -> TextBlinkMode # min :: TextBlinkMode -> TextBlinkMode -> TextBlinkMode #
Ord RegexError
Instance details Defined in GI.Vte.Enums Methods compare :: RegexError -> RegexError -> Ordering # (<) :: RegexError -> RegexError -> Bool # (<=) :: RegexError -> RegexError -> Bool # (>) :: RegexError -> RegexError -> Bool # (>=) :: RegexError -> RegexError -> Bool # max :: RegexError -> RegexError -> RegexError # min :: RegexError -> RegexError -> RegexError #
Ord PtyError
Instance details Defined in GI.Vte.Enums Methods compare :: PtyError -> PtyError -> Ordering # (<) :: PtyError -> PtyError -> Bool # (<=) :: PtyError -> PtyError -> Bool # (>) :: PtyError -> PtyError -> Bool # (>=) :: PtyError -> PtyError -> Bool # max :: PtyError -> PtyError -> PtyError # min :: PtyError -> PtyError -> PtyError #
Ord Format
Instance details Defined in GI.Vte.Enums Methods compare :: Format -> Format -> Ordering # (<) :: Format -> Format -> Bool # (<=) :: Format -> Format -> Bool # (>) :: Format -> Format -> Bool # (>=) :: Format -> Format -> Bool # max :: Format -> Format -> Format # min :: Format -> Format -> Format #
Ord EraseBinding
Instance details Defined in GI.Vte.Enums Methods compare :: EraseBinding -> EraseBinding -> Ordering # (<) :: EraseBinding -> EraseBinding -> Bool # (<=) :: EraseBinding -> EraseBinding -> Bool # (>) :: EraseBinding -> EraseBinding -> Bool # (>=) :: EraseBinding -> EraseBinding -> Bool # max :: EraseBinding -> EraseBinding -> EraseBinding # min :: EraseBinding -> EraseBinding -> EraseBinding #
Ord CursorShape
Instance details Defined in GI.Vte.Enums Methods compare :: CursorShape -> CursorShape -> Ordering # (<) :: CursorShape -> CursorShape -> Bool # (<=) :: CursorShape -> CursorShape -> Bool # (>) :: CursorShape -> CursorShape -> Bool # (>=) :: CursorShape -> CursorShape -> Bool # max :: CursorShape -> CursorShape -> CursorShape # min :: CursorShape -> CursorShape -> CursorShape #
Ord CursorBlinkMode
Instance details Defined in GI.Vte.Enums Methods compare :: CursorBlinkMode -> CursorBlinkMode -> Ordering # (<) :: CursorBlinkMode -> CursorBlinkMode -> Bool # (<=) :: CursorBlinkMode -> CursorBlinkMode -> Bool # (>) :: CursorBlinkMode -> CursorBlinkMode -> Bool # (>=) :: CursorBlinkMode -> CursorBlinkMode -> Bool # max :: CursorBlinkMode -> CursorBlinkMode -> CursorBlinkMode # min :: CursorBlinkMode -> CursorBlinkMode -> CursorBlinkMode #
Ord Name
Instance details Defined in Data.XML.Types Methods compare :: Name -> Name -> Ordering # (<) :: Name -> Name -> Bool # (<=) :: Name -> Name -> Bool # (>) :: Name -> Name -> Bool # (>=) :: Name -> Name -> Bool # max :: Name -> Name -> Name # min :: Name -> Name -> Name #
Ord Element
Instance details Defined in Text.XML Methods compare :: Element -> Element -> Ordering # (<) :: Element -> Element -> Bool # (<=) :: Element -> Element -> Bool # (>) :: Element -> Element -> Bool # (>=) :: Element -> Element -> Bool # max :: Element -> Element -> Element # min :: Element -> Element -> Element #
Ord AttrOpTag
Instance details Defined in Data.GI.Base.Attributes Methods compare :: AttrOpTag -> AttrOpTag -> Ordering # (<) :: AttrOpTag -> AttrOpTag -> Bool # (<=) :: AttrOpTag -> AttrOpTag -> Bool # (>) :: AttrOpTag -> AttrOpTag -> Bool # (>=) :: AttrOpTag -> AttrOpTag -> Bool # max :: AttrOpTag -> AttrOpTag -> AttrOpTag # min :: AttrOpTag -> AttrOpTag -> AttrOpTag #
Ord TyVarBndr
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: TyVarBndr -> TyVarBndr -> Ordering # (<) :: TyVarBndr -> TyVarBndr -> Bool # (<=) :: TyVarBndr -> TyVarBndr -> Bool # (>) :: TyVarBndr -> TyVarBndr -> Bool # (>=) :: TyVarBndr -> TyVarBndr -> Bool # max :: TyVarBndr -> TyVarBndr -> TyVarBndr # min :: TyVarBndr -> TyVarBndr -> TyVarBndr #
Ord LineNum
Instance details Defined in Text.Pretty.Simple.Internal.ExprToOutput Methods compare :: LineNum -> LineNum -> Ordering # (<) :: LineNum -> LineNum -> Bool # (<=) :: LineNum -> LineNum -> Bool # (>) :: LineNum -> LineNum -> Bool # (>=) :: LineNum -> LineNum -> Bool # max :: LineNum -> LineNum -> LineNum # min :: LineNum -> LineNum -> LineNum #
Ord NestLevel
Instance details Defined in Text.Pretty.Simple.Internal.Output Methods compare :: NestLevel -> NestLevel -> Ordering # (<) :: NestLevel -> NestLevel -> Bool # (<=) :: NestLevel -> NestLevel -> Bool # (>) :: NestLevel -> NestLevel -> Bool # (>=) :: NestLevel -> NestLevel -> Bool # max :: NestLevel -> NestLevel -> NestLevel # min :: NestLevel -> NestLevel -> NestLevel #
Ord ByteArray	Non-lexicographic ordering. This compares the lengths of the byte arrays first and uses a lexicographic ordering if the lengths are equal. Subject to change between major versions. Since: primitive-0.6.3.0
Instance details Defined in Data.Primitive.ByteArray Methods compare :: ByteArray -> ByteArray -> Ordering # (<) :: ByteArray -> ByteArray -> Bool # (<=) :: ByteArray -> ByteArray -> Bool # (>) :: ByteArray -> ByteArray -> Bool # (>=) :: ByteArray -> ByteArray -> Bool # max :: ByteArray -> ByteArray -> ByteArray # min :: ByteArray -> ByteArray -> ByteArray #
Ord Addr
Instance details Defined in Data.Primitive.Types Methods compare :: Addr -> Addr -> Ordering # (<) :: Addr -> Addr -> Bool # (<=) :: Addr -> Addr -> Bool # (>) :: Addr -> Addr -> Bool # (>=) :: Addr -> Addr -> Bool # max :: Addr -> Addr -> Addr # min :: Addr -> Addr -> Addr #
Ord ModName
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: ModName -> ModName -> Ordering # (<) :: ModName -> ModName -> Bool # (<=) :: ModName -> ModName -> Bool # (>) :: ModName -> ModName -> Bool # (>=) :: ModName -> ModName -> Bool # max :: ModName -> ModName -> ModName # min :: ModName -> ModName -> ModName #
Ord PkgName
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: PkgName -> PkgName -> Ordering # (<) :: PkgName -> PkgName -> Bool # (<=) :: PkgName -> PkgName -> Bool # (>) :: PkgName -> PkgName -> Bool # (>=) :: PkgName -> PkgName -> Bool # max :: PkgName -> PkgName -> PkgName # min :: PkgName -> PkgName -> PkgName #
Ord Module
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Module -> Module -> Ordering # (<) :: Module -> Module -> Bool # (<=) :: Module -> Module -> Bool # (>) :: Module -> Module -> Bool # (>=) :: Module -> Module -> Bool # max :: Module -> Module -> Module # min :: Module -> Module -> Module #
Ord OccName
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: OccName -> OccName -> Ordering # (<) :: OccName -> OccName -> Bool # (<=) :: OccName -> OccName -> Bool # (>) :: OccName -> OccName -> Bool # (>=) :: OccName -> OccName -> Bool # max :: OccName -> OccName -> OccName # min :: OccName -> OccName -> OccName #
Ord NameFlavour
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: NameFlavour -> NameFlavour -> Ordering # (<) :: NameFlavour -> NameFlavour -> Bool # (<=) :: NameFlavour -> NameFlavour -> Bool # (>) :: NameFlavour -> NameFlavour -> Bool # (>=) :: NameFlavour -> NameFlavour -> Bool # max :: NameFlavour -> NameFlavour -> NameFlavour # min :: NameFlavour -> NameFlavour -> NameFlavour #
Ord NameSpace
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: NameSpace -> NameSpace -> Ordering # (<) :: NameSpace -> NameSpace -> Bool # (<=) :: NameSpace -> NameSpace -> Bool # (>) :: NameSpace -> NameSpace -> Bool # (>=) :: NameSpace -> NameSpace -> Bool # max :: NameSpace -> NameSpace -> NameSpace # min :: NameSpace -> NameSpace -> NameSpace #
Ord Loc
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Loc -> Loc -> Ordering # (<) :: Loc -> Loc -> Bool # (<=) :: Loc -> Loc -> Bool # (>) :: Loc -> Loc -> Bool # (>=) :: Loc -> Loc -> Bool # max :: Loc -> Loc -> Loc # min :: Loc -> Loc -> Loc #
Ord Info
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Info -> Info -> Ordering # (<) :: Info -> Info -> Bool # (<=) :: Info -> Info -> Bool # (>) :: Info -> Info -> Bool # (>=) :: Info -> Info -> Bool # max :: Info -> Info -> Info # min :: Info -> Info -> Info #
Ord ModuleInfo
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: ModuleInfo -> ModuleInfo -> Ordering # (<) :: ModuleInfo -> ModuleInfo -> Bool # (<=) :: ModuleInfo -> ModuleInfo -> Bool # (>) :: ModuleInfo -> ModuleInfo -> Bool # (>=) :: ModuleInfo -> ModuleInfo -> Bool # max :: ModuleInfo -> ModuleInfo -> ModuleInfo # min :: ModuleInfo -> ModuleInfo -> ModuleInfo #
Ord Fixity
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Fixity -> Fixity -> Ordering # (<) :: Fixity -> Fixity -> Bool # (<=) :: Fixity -> Fixity -> Bool # (>) :: Fixity -> Fixity -> Bool # (>=) :: Fixity -> Fixity -> Bool # max :: Fixity -> Fixity -> Fixity # min :: Fixity -> Fixity -> Fixity #
Ord FixityDirection
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: FixityDirection -> FixityDirection -> Ordering # (<) :: FixityDirection -> FixityDirection -> Bool # (<=) :: FixityDirection -> FixityDirection -> Bool # (>) :: FixityDirection -> FixityDirection -> Bool # (>=) :: FixityDirection -> FixityDirection -> Bool # max :: FixityDirection -> FixityDirection -> FixityDirection # min :: FixityDirection -> FixityDirection -> FixityDirection #
Ord Lit
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Lit -> Lit -> Ordering # (<) :: Lit -> Lit -> Bool # (<=) :: Lit -> Lit -> Bool # (>) :: Lit -> Lit -> Bool # (>=) :: Lit -> Lit -> Bool # max :: Lit -> Lit -> Lit # min :: Lit -> Lit -> Lit #
Ord Body
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Body -> Body -> Ordering # (<) :: Body -> Body -> Bool # (<=) :: Body -> Body -> Bool # (>) :: Body -> Body -> Bool # (>=) :: Body -> Body -> Bool # max :: Body -> Body -> Body # min :: Body -> Body -> Body #
Ord Guard
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Guard -> Guard -> Ordering # (<) :: Guard -> Guard -> Bool # (<=) :: Guard -> Guard -> Bool # (>) :: Guard -> Guard -> Bool # (>=) :: Guard -> Guard -> Bool # max :: Guard -> Guard -> Guard # min :: Guard -> Guard -> Guard #
Ord Stmt
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Stmt -> Stmt -> Ordering # (<) :: Stmt -> Stmt -> Bool # (<=) :: Stmt -> Stmt -> Bool # (>) :: Stmt -> Stmt -> Bool # (>=) :: Stmt -> Stmt -> Bool # max :: Stmt -> Stmt -> Stmt # min :: Stmt -> Stmt -> Stmt #
Ord Range
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Range -> Range -> Ordering # (<) :: Range -> Range -> Bool # (<=) :: Range -> Range -> Bool # (>) :: Range -> Range -> Bool # (>=) :: Range -> Range -> Bool # max :: Range -> Range -> Range # min :: Range -> Range -> Range #
Ord DerivClause
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: DerivClause -> DerivClause -> Ordering # (<) :: DerivClause -> DerivClause -> Bool # (<=) :: DerivClause -> DerivClause -> Bool # (>) :: DerivClause -> DerivClause -> Bool # (>=) :: DerivClause -> DerivClause -> Bool # max :: DerivClause -> DerivClause -> DerivClause # min :: DerivClause -> DerivClause -> DerivClause #
Ord DerivStrategy
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: DerivStrategy -> DerivStrategy -> Ordering # (<) :: DerivStrategy -> DerivStrategy -> Bool # (<=) :: DerivStrategy -> DerivStrategy -> Bool # (>) :: DerivStrategy -> DerivStrategy -> Bool # (>=) :: DerivStrategy -> DerivStrategy -> Bool # max :: DerivStrategy -> DerivStrategy -> DerivStrategy # min :: DerivStrategy -> DerivStrategy -> DerivStrategy #
Ord TypeFamilyHead
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: TypeFamilyHead -> TypeFamilyHead -> Ordering # (<) :: TypeFamilyHead -> TypeFamilyHead -> Bool # (<=) :: TypeFamilyHead -> TypeFamilyHead -> Bool # (>) :: TypeFamilyHead -> TypeFamilyHead -> Bool # (>=) :: TypeFamilyHead -> TypeFamilyHead -> Bool # max :: TypeFamilyHead -> TypeFamilyHead -> TypeFamilyHead # min :: TypeFamilyHead -> TypeFamilyHead -> TypeFamilyHead #
Ord TySynEqn
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: TySynEqn -> TySynEqn -> Ordering # (<) :: TySynEqn -> TySynEqn -> Bool # (<=) :: TySynEqn -> TySynEqn -> Bool # (>) :: TySynEqn -> TySynEqn -> Bool # (>=) :: TySynEqn -> TySynEqn -> Bool # max :: TySynEqn -> TySynEqn -> TySynEqn # min :: TySynEqn -> TySynEqn -> TySynEqn #
Ord Foreign
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Foreign -> Foreign -> Ordering # (<) :: Foreign -> Foreign -> Bool # (<=) :: Foreign -> Foreign -> Bool # (>) :: Foreign -> Foreign -> Bool # (>=) :: Foreign -> Foreign -> Bool # max :: Foreign -> Foreign -> Foreign # min :: Foreign -> Foreign -> Foreign #
Ord Callconv
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Callconv -> Callconv -> Ordering # (<) :: Callconv -> Callconv -> Bool # (<=) :: Callconv -> Callconv -> Bool # (>) :: Callconv -> Callconv -> Bool # (>=) :: Callconv -> Callconv -> Bool # max :: Callconv -> Callconv -> Callconv # min :: Callconv -> Callconv -> Callconv #
Ord Safety
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Safety -> Safety -> Ordering # (<) :: Safety -> Safety -> Bool # (<=) :: Safety -> Safety -> Bool # (>) :: Safety -> Safety -> Bool # (>=) :: Safety -> Safety -> Bool # max :: Safety -> Safety -> Safety # min :: Safety -> Safety -> Safety #
Ord Pragma
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Pragma -> Pragma -> Ordering # (<) :: Pragma -> Pragma -> Bool # (<=) :: Pragma -> Pragma -> Bool # (>) :: Pragma -> Pragma -> Bool # (>=) :: Pragma -> Pragma -> Bool # max :: Pragma -> Pragma -> Pragma # min :: Pragma -> Pragma -> Pragma #
Ord Inline
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Inline -> Inline -> Ordering # (<) :: Inline -> Inline -> Bool # (<=) :: Inline -> Inline -> Bool # (>) :: Inline -> Inline -> Bool # (>=) :: Inline -> Inline -> Bool # max :: Inline -> Inline -> Inline # min :: Inline -> Inline -> Inline #
Ord RuleMatch
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: RuleMatch -> RuleMatch -> Ordering # (<) :: RuleMatch -> RuleMatch -> Bool # (<=) :: RuleMatch -> RuleMatch -> Bool # (>) :: RuleMatch -> RuleMatch -> Bool # (>=) :: RuleMatch -> RuleMatch -> Bool # max :: RuleMatch -> RuleMatch -> RuleMatch # min :: RuleMatch -> RuleMatch -> RuleMatch #
Ord Phases
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Phases -> Phases -> Ordering # (<) :: Phases -> Phases -> Bool # (<=) :: Phases -> Phases -> Bool # (>) :: Phases -> Phases -> Bool # (>=) :: Phases -> Phases -> Bool # max :: Phases -> Phases -> Phases # min :: Phases -> Phases -> Phases #
Ord RuleBndr
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: RuleBndr -> RuleBndr -> Ordering # (<) :: RuleBndr -> RuleBndr -> Bool # (<=) :: RuleBndr -> RuleBndr -> Bool # (>) :: RuleBndr -> RuleBndr -> Bool # (>=) :: RuleBndr -> RuleBndr -> Bool # max :: RuleBndr -> RuleBndr -> RuleBndr # min :: RuleBndr -> RuleBndr -> RuleBndr #
Ord AnnTarget
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: AnnTarget -> AnnTarget -> Ordering # (<) :: AnnTarget -> AnnTarget -> Bool # (<=) :: AnnTarget -> AnnTarget -> Bool # (>) :: AnnTarget -> AnnTarget -> Bool # (>=) :: AnnTarget -> AnnTarget -> Bool # max :: AnnTarget -> AnnTarget -> AnnTarget # min :: AnnTarget -> AnnTarget -> AnnTarget #
Ord SourceUnpackedness
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: SourceUnpackedness -> SourceUnpackedness -> Ordering # (<) :: SourceUnpackedness -> SourceUnpackedness -> Bool # (<=) :: SourceUnpackedness -> SourceUnpackedness -> Bool # (>) :: SourceUnpackedness -> SourceUnpackedness -> Bool # (>=) :: SourceUnpackedness -> SourceUnpackedness -> Bool # max :: SourceUnpackedness -> SourceUnpackedness -> SourceUnpackedness # min :: SourceUnpackedness -> SourceUnpackedness -> SourceUnpackedness #
Ord SourceStrictness
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: SourceStrictness -> SourceStrictness -> Ordering # (<) :: SourceStrictness -> SourceStrictness -> Bool # (<=) :: SourceStrictness -> SourceStrictness -> Bool # (>) :: SourceStrictness -> SourceStrictness -> Bool # (>=) :: SourceStrictness -> SourceStrictness -> Bool # max :: SourceStrictness -> SourceStrictness -> SourceStrictness # min :: SourceStrictness -> SourceStrictness -> SourceStrictness #
Ord DecidedStrictness
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: DecidedStrictness -> DecidedStrictness -> Ordering # (<) :: DecidedStrictness -> DecidedStrictness -> Bool # (<=) :: DecidedStrictness -> DecidedStrictness -> Bool # (>) :: DecidedStrictness -> DecidedStrictness -> Bool # (>=) :: DecidedStrictness -> DecidedStrictness -> Bool # max :: DecidedStrictness -> DecidedStrictness -> DecidedStrictness # min :: DecidedStrictness -> DecidedStrictness -> DecidedStrictness #
Ord Bang
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Bang -> Bang -> Ordering # (<) :: Bang -> Bang -> Bool # (<=) :: Bang -> Bang -> Bool # (>) :: Bang -> Bang -> Bool # (>=) :: Bang -> Bang -> Bool # max :: Bang -> Bang -> Bang # min :: Bang -> Bang -> Bang #
Ord PatSynDir
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: PatSynDir -> PatSynDir -> Ordering # (<) :: PatSynDir -> PatSynDir -> Bool # (<=) :: PatSynDir -> PatSynDir -> Bool # (>) :: PatSynDir -> PatSynDir -> Bool # (>=) :: PatSynDir -> PatSynDir -> Bool # max :: PatSynDir -> PatSynDir -> PatSynDir # min :: PatSynDir -> PatSynDir -> PatSynDir #
Ord PatSynArgs
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: PatSynArgs -> PatSynArgs -> Ordering # (<) :: PatSynArgs -> PatSynArgs -> Bool # (<=) :: PatSynArgs -> PatSynArgs -> Bool # (>) :: PatSynArgs -> PatSynArgs -> Bool # (>=) :: PatSynArgs -> PatSynArgs -> Bool # max :: PatSynArgs -> PatSynArgs -> PatSynArgs # min :: PatSynArgs -> PatSynArgs -> PatSynArgs #
Ord FamilyResultSig
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: FamilyResultSig -> FamilyResultSig -> Ordering # (<) :: FamilyResultSig -> FamilyResultSig -> Bool # (<=) :: FamilyResultSig -> FamilyResultSig -> Bool # (>) :: FamilyResultSig -> FamilyResultSig -> Bool # (>=) :: FamilyResultSig -> FamilyResultSig -> Bool # max :: FamilyResultSig -> FamilyResultSig -> FamilyResultSig # min :: FamilyResultSig -> FamilyResultSig -> FamilyResultSig #
Ord TyLit
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: TyLit -> TyLit -> Ordering # (<) :: TyLit -> TyLit -> Bool # (<=) :: TyLit -> TyLit -> Bool # (>) :: TyLit -> TyLit -> Bool # (>=) :: TyLit -> TyLit -> Bool # max :: TyLit -> TyLit -> TyLit # min :: TyLit -> TyLit -> TyLit #
Ord Role
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: Role -> Role -> Ordering # (<) :: Role -> Role -> Bool # (<=) :: Role -> Role -> Bool # (>) :: Role -> Role -> Bool # (>=) :: Role -> Role -> Bool # max :: Role -> Role -> Role # min :: Role -> Role -> Role #
Ord AnnLookup
Instance details Defined in Language.Haskell.TH.Syntax Methods compare :: AnnLookup -> AnnLookup -> Ordering # (<) :: AnnLookup -> AnnLookup -> Bool # (<=) :: AnnLookup -> AnnLookup -> Bool # (>) :: AnnLookup -> AnnLookup -> Bool # (>=) :: AnnLookup -> AnnLookup -> Bool # max :: AnnLookup -> AnnLookup -> AnnLookup # min :: AnnLookup -> AnnLookup -> AnnLookup #
Ord DatatypeVariant
Instance details Defined in Language.Haskell.TH.Datatype Methods compare :: DatatypeVariant -> DatatypeVariant -> Ordering # (<) :: DatatypeVariant -> DatatypeVariant -> Bool # (<=) :: DatatypeVariant -> DatatypeVariant -> Bool # (>) :: DatatypeVariant -> DatatypeVariant -> Bool # (>=) :: DatatypeVariant -> DatatypeVariant -> Bool # max :: DatatypeVariant -> DatatypeVariant -> DatatypeVariant # min :: DatatypeVariant -> DatatypeVariant -> DatatypeVariant #
Ord ConstructorVariant
Instance details Defined in Language.Haskell.TH.Datatype Methods compare :: ConstructorVariant -> ConstructorVariant -> Ordering # (<) :: ConstructorVariant -> ConstructorVariant -> Bool # (<=) :: ConstructorVariant -> ConstructorVariant -> Bool # (>) :: ConstructorVariant -> ConstructorVariant -> Bool # (>=) :: ConstructorVariant -> ConstructorVariant -> Bool # max :: ConstructorVariant -> ConstructorVariant -> ConstructorVariant # min :: ConstructorVariant -> ConstructorVariant -> ConstructorVariant #
Ord FieldStrictness
Instance details Defined in Language.Haskell.TH.Datatype Methods compare :: FieldStrictness -> FieldStrictness -> Ordering # (<) :: FieldStrictness -> FieldStrictness -> Bool # (<=) :: FieldStrictness -> FieldStrictness -> Bool # (>) :: FieldStrictness -> FieldStrictness -> Bool # (>=) :: FieldStrictness -> FieldStrictness -> Bool # max :: FieldStrictness -> FieldStrictness -> FieldStrictness # min :: FieldStrictness -> FieldStrictness -> FieldStrictness #
Ord Unpackedness
Instance details Defined in Language.Haskell.TH.Datatype Methods compare :: Unpackedness -> Unpackedness -> Ordering # (<) :: Unpackedness -> Unpackedness -> Bool # (<=) :: Unpackedness -> Unpackedness -> Bool # (>) :: Unpackedness -> Unpackedness -> Bool # (>=) :: Unpackedness -> Unpackedness -> Bool # max :: Unpackedness -> Unpackedness -> Unpackedness # min :: Unpackedness -> Unpackedness -> Unpackedness #
Ord Strictness
Instance details Defined in Language.Haskell.TH.Datatype Methods compare :: Strictness -> Strictness -> Ordering # (<) :: Strictness -> Strictness -> Bool # (<=) :: Strictness -> Strictness -> Bool # (>) :: Strictness -> Strictness -> Bool # (>=) :: Strictness -> Strictness -> Bool # max :: Strictness -> Strictness -> Strictness # min :: Strictness -> Strictness -> Strictness #
Ord TimeLocale
Instance details Defined in Data.Time.Format.Locale Methods compare :: TimeLocale -> TimeLocale -> Ordering # (<) :: TimeLocale -> TimeLocale -> Bool # (<=) :: TimeLocale -> TimeLocale -> Bool # (>) :: TimeLocale -> TimeLocale -> Bool # (>=) :: TimeLocale -> TimeLocale -> Bool # max :: TimeLocale -> TimeLocale -> TimeLocale # min :: TimeLocale -> TimeLocale -> TimeLocale #
Ord LocalTime
Instance details Defined in Data.Time.LocalTime.Internal.LocalTime Methods compare :: LocalTime -> LocalTime -> Ordering # (<) :: LocalTime -> LocalTime -> Bool # (<=) :: LocalTime -> LocalTime -> Bool # (>) :: LocalTime -> LocalTime -> Bool # (>=) :: LocalTime -> LocalTime -> Bool # max :: LocalTime -> LocalTime -> LocalTime # min :: LocalTime -> LocalTime -> LocalTime #
Ord TimeOfDay
Instance details Defined in Data.Time.LocalTime.Internal.TimeOfDay Methods compare :: TimeOfDay -> TimeOfDay -> Ordering # (<) :: TimeOfDay -> TimeOfDay -> Bool # (<=) :: TimeOfDay -> TimeOfDay -> Bool # (>) :: TimeOfDay -> TimeOfDay -> Bool # (>=) :: TimeOfDay -> TimeOfDay -> Bool # max :: TimeOfDay -> TimeOfDay -> TimeOfDay # min :: TimeOfDay -> TimeOfDay -> TimeOfDay #
Ord TimeZone
Instance details Defined in Data.Time.LocalTime.Internal.TimeZone Methods compare :: TimeZone -> TimeZone -> Ordering # (<) :: TimeZone -> TimeZone -> Bool # (<=) :: TimeZone -> TimeZone -> Bool # (>) :: TimeZone -> TimeZone -> Bool # (>=) :: TimeZone -> TimeZone -> Bool # max :: TimeZone -> TimeZone -> TimeZone # min :: TimeZone -> TimeZone -> TimeZone #
Ord UniversalTime
Instance details Defined in Data.Time.Clock.Internal.UniversalTime Methods compare :: UniversalTime -> UniversalTime -> Ordering # (<) :: UniversalTime -> UniversalTime -> Bool # (<=) :: UniversalTime -> UniversalTime -> Bool # (>) :: UniversalTime -> UniversalTime -> Bool # (>=) :: UniversalTime -> UniversalTime -> Bool # max :: UniversalTime -> UniversalTime -> UniversalTime # min :: UniversalTime -> UniversalTime -> UniversalTime #
Ord DiffTime
Instance details Defined in Data.Time.Clock.Internal.DiffTime Methods compare :: DiffTime -> DiffTime -> Ordering # (<) :: DiffTime -> DiffTime -> Bool # (<=) :: DiffTime -> DiffTime -> Bool # (>) :: DiffTime -> DiffTime -> Bool # (>=) :: DiffTime -> DiffTime -> Bool # max :: DiffTime -> DiffTime -> DiffTime # min :: DiffTime -> DiffTime -> DiffTime #
Ord Event
Instance details Defined in Data.XML.Types Methods compare :: Event -> Event -> Ordering # (<) :: Event -> Event -> Bool # (<=) :: Event -> Event -> Bool # (>) :: Event -> Event -> Bool # (>=) :: Event -> Event -> Bool # max :: Event -> Event -> Event # min :: Event -> Event -> Event #
Ord Node
Instance details Defined in Text.XML Methods compare :: Node -> Node -> Ordering # (<) :: Node -> Node -> Bool # (<=) :: Node -> Node -> Bool # (>) :: Node -> Node -> Bool # (>=) :: Node -> Node -> Bool # max :: Node -> Node -> Node # min :: Node -> Node -> Node #
Ord ExternalID
Instance details Defined in Data.XML.Types Methods compare :: ExternalID -> ExternalID -> Ordering # (<) :: ExternalID -> ExternalID -> Bool # (<=) :: ExternalID -> ExternalID -> Bool # (>) :: ExternalID -> ExternalID -> Bool # (>=) :: ExternalID -> ExternalID -> Bool # max :: ExternalID -> ExternalID -> ExternalID # min :: ExternalID -> ExternalID -> ExternalID #
Ord Doctype
Instance details Defined in Data.XML.Types Methods compare :: Doctype -> Doctype -> Ordering # (<) :: Doctype -> Doctype -> Bool # (<=) :: Doctype -> Doctype -> Bool # (>) :: Doctype -> Doctype -> Bool # (>=) :: Doctype -> Doctype -> Bool # max :: Doctype -> Doctype -> Doctype # min :: Doctype -> Doctype -> Doctype #
Ord Miscellaneous
Instance details Defined in Data.XML.Types Methods compare :: Miscellaneous -> Miscellaneous -> Ordering # (<) :: Miscellaneous -> Miscellaneous -> Bool # (<=) :: Miscellaneous -> Miscellaneous -> Bool # (>) :: Miscellaneous -> Miscellaneous -> Bool # (>=) :: Miscellaneous -> Miscellaneous -> Bool # max :: Miscellaneous -> Miscellaneous -> Miscellaneous # min :: Miscellaneous -> Miscellaneous -> Miscellaneous #
Ord Instruction
Instance details Defined in Data.XML.Types Methods compare :: Instruction -> Instruction -> Ordering # (<) :: Instruction -> Instruction -> Bool # (<=) :: Instruction -> Instruction -> Bool # (>) :: Instruction -> Instruction -> Bool # (>=) :: Instruction -> Instruction -> Bool # max :: Instruction -> Instruction -> Instruction # min :: Instruction -> Instruction -> Instruction #
Ord Prologue
Instance details Defined in Data.XML.Types Methods compare :: Prologue -> Prologue -> Ordering # (<) :: Prologue -> Prologue -> Bool # (<=) :: Prologue -> Prologue -> Bool # (>) :: Prologue -> Prologue -> Bool # (>=) :: Prologue -> Prologue -> Bool # max :: Prologue -> Prologue -> Prologue # min :: Prologue -> Prologue -> Prologue #
Ord Document
Instance details Defined in Data.XML.Types Methods compare :: Document -> Document -> Ordering # (<) :: Document -> Document -> Bool # (<=) :: Document -> Document -> Bool # (>) :: Document -> Document -> Bool # (>=) :: Document -> Document -> Bool # max :: Document -> Document -> Document # min :: Document -> Document -> Document #
Ord Node
Instance details Defined in Data.XML.Types Methods compare :: Node -> Node -> Ordering # (<) :: Node -> Node -> Bool # (<=) :: Node -> Node -> Bool # (>) :: Node -> Node -> Bool # (>=) :: Node -> Node -> Bool # max :: Node -> Node -> Node # min :: Node -> Node -> Node #
Ord Element
Instance details Defined in Data.XML.Types Methods compare :: Element -> Element -> Ordering # (<) :: Element -> Element -> Bool # (<=) :: Element -> Element -> Bool # (>) :: Element -> Element -> Bool # (>=) :: Element -> Element -> Bool # max :: Element -> Element -> Element # min :: Element -> Element -> Element #
Ord Content
Instance details Defined in Data.XML.Types Methods compare :: Content -> Content -> Ordering # (<) :: Content -> Content -> Bool # (<=) :: Content -> Content -> Bool # (>) :: Content -> Content -> Bool # (>=) :: Content -> Content -> Bool # max :: Content -> Content -> Content # min :: Content -> Content -> Content #
Ord InterpType
Instance details Defined in GI.GdkPixbuf.Enums Methods compare :: InterpType -> InterpType -> Ordering # (<) :: InterpType -> InterpType -> Bool # (<=) :: InterpType -> InterpType -> Bool # (>) :: InterpType -> InterpType -> Bool # (>=) :: InterpType -> InterpType -> Bool # max :: InterpType -> InterpType -> InterpType # min :: InterpType -> InterpType -> InterpType #
Ord Colorspace
Instance details Defined in GI.GdkPixbuf.Enums Methods compare :: Colorspace -> Colorspace -> Ordering # (<) :: Colorspace -> Colorspace -> Bool # (<=) :: Colorspace -> Colorspace -> Bool # (>) :: Colorspace -> Colorspace -> Bool # (>=) :: Colorspace -> Colorspace -> Bool # max :: Colorspace -> Colorspace -> Colorspace # min :: Colorspace -> Colorspace -> Colorspace #
Ord PixbufRotation
Instance details Defined in GI.GdkPixbuf.Enums Methods compare :: PixbufRotation -> PixbufRotation -> Ordering # (<) :: PixbufRotation -> PixbufRotation -> Bool # (<=) :: PixbufRotation -> PixbufRotation -> Bool # (>) :: PixbufRotation -> PixbufRotation -> Bool # (>=) :: PixbufRotation -> PixbufRotation -> Bool # max :: PixbufRotation -> PixbufRotation -> PixbufRotation # min :: PixbufRotation -> PixbufRotation -> PixbufRotation #
Ord TypeFlags
Instance details Defined in GI.GObject.Flags Methods compare :: TypeFlags -> TypeFlags -> Ordering # (<) :: TypeFlags -> TypeFlags -> Bool # (<=) :: TypeFlags -> TypeFlags -> Bool # (>) :: TypeFlags -> TypeFlags -> Bool # (>=) :: TypeFlags -> TypeFlags -> Bool # max :: TypeFlags -> TypeFlags -> TypeFlags # min :: TypeFlags -> TypeFlags -> TypeFlags #
Ord PixbufAlphaMode
Instance details Defined in GI.GdkPixbuf.Enums Methods compare :: PixbufAlphaMode -> PixbufAlphaMode -> Ordering # (<) :: PixbufAlphaMode -> PixbufAlphaMode -> Bool # (<=) :: PixbufAlphaMode -> PixbufAlphaMode -> Bool # (>) :: PixbufAlphaMode -> PixbufAlphaMode -> Bool # (>=) :: PixbufAlphaMode -> PixbufAlphaMode -> Bool # max :: PixbufAlphaMode -> PixbufAlphaMode -> PixbufAlphaMode # min :: PixbufAlphaMode -> PixbufAlphaMode -> PixbufAlphaMode #
Ord PixbufError
Instance details Defined in GI.GdkPixbuf.Enums Methods compare :: PixbufError -> PixbufError -> Ordering # (<) :: PixbufError -> PixbufError -> Bool # (<=) :: PixbufError -> PixbufError -> Bool # (>) :: PixbufError -> PixbufError -> Bool # (>=) :: PixbufError -> PixbufError -> Bool # max :: PixbufError -> PixbufError -> PixbufError # min :: PixbufError -> PixbufError -> PixbufError #
Ord BindingFlags
Instance details Defined in GI.GObject.Flags Methods compare :: BindingFlags -> BindingFlags -> Ordering # (<) :: BindingFlags -> BindingFlags -> Bool # (<=) :: BindingFlags -> BindingFlags -> Bool # (>) :: BindingFlags -> BindingFlags -> Bool # (>=) :: BindingFlags -> BindingFlags -> Bool # max :: BindingFlags -> BindingFlags -> BindingFlags # min :: BindingFlags -> BindingFlags -> BindingFlags #
Ord CoordType
Instance details Defined in GI.Atk.Enums Methods compare :: CoordType -> CoordType -> Ordering # (<) :: CoordType -> CoordType -> Bool # (<=) :: CoordType -> CoordType -> Bool # (>) :: CoordType -> CoordType -> Bool # (>=) :: CoordType -> CoordType -> Bool # max :: CoordType -> CoordType -> CoordType # min :: CoordType -> CoordType -> CoordType #
Ord Layer
Instance details Defined in GI.Atk.Enums Methods compare :: Layer -> Layer -> Ordering # (<) :: Layer -> Layer -> Bool # (<=) :: Layer -> Layer -> Bool # (>) :: Layer -> Layer -> Bool # (>=) :: Layer -> Layer -> Bool # max :: Layer -> Layer -> Layer # min :: Layer -> Layer -> Layer #
Ord ScrollType
Instance details Defined in GI.Atk.Enums Methods compare :: ScrollType -> ScrollType -> Ordering # (<) :: ScrollType -> ScrollType -> Bool # (<=) :: ScrollType -> ScrollType -> Bool # (>) :: ScrollType -> ScrollType -> Bool # (>=) :: ScrollType -> ScrollType -> Bool # max :: ScrollType -> ScrollType -> ScrollType # min :: ScrollType -> ScrollType -> ScrollType #
Ord TextClipType
Instance details Defined in GI.Atk.Enums Methods compare :: TextClipType -> TextClipType -> Ordering # (<) :: TextClipType -> TextClipType -> Bool # (<=) :: TextClipType -> TextClipType -> Bool # (>) :: TextClipType -> TextClipType -> Bool # (>=) :: TextClipType -> TextClipType -> Bool # max :: TextClipType -> TextClipType -> TextClipType # min :: TextClipType -> TextClipType -> TextClipType #
Ord TextGranularity
Instance details Defined in GI.Atk.Enums Methods compare :: TextGranularity -> TextGranularity -> Ordering # (<) :: TextGranularity -> TextGranularity -> Bool # (<=) :: TextGranularity -> TextGranularity -> Bool # (>) :: TextGranularity -> TextGranularity -> Bool # (>=) :: TextGranularity -> TextGranularity -> Bool # max :: TextGranularity -> TextGranularity -> TextGranularity # min :: TextGranularity -> TextGranularity -> TextGranularity #
Ord TextBoundary
Instance details Defined in GI.Atk.Enums Methods compare :: TextBoundary -> TextBoundary -> Ordering # (<) :: TextBoundary -> TextBoundary -> Bool # (<=) :: TextBoundary -> TextBoundary -> Bool # (>) :: TextBoundary -> TextBoundary -> Bool # (>=) :: TextBoundary -> TextBoundary -> Bool # max :: TextBoundary -> TextBoundary -> TextBoundary # min :: TextBoundary -> TextBoundary -> TextBoundary #
Ord RelationType
Instance details Defined in GI.Atk.Enums Methods compare :: RelationType -> RelationType -> Ordering # (<) :: RelationType -> RelationType -> Bool # (<=) :: RelationType -> RelationType -> Bool # (>) :: RelationType -> RelationType -> Bool # (>=) :: RelationType -> RelationType -> Bool # max :: RelationType -> RelationType -> RelationType # min :: RelationType -> RelationType -> RelationType #
Ord Role
Instance details Defined in GI.Atk.Enums Methods compare :: Role -> Role -> Ordering # (<) :: Role -> Role -> Bool # (<=) :: Role -> Role -> Bool # (>) :: Role -> Role -> Bool # (>=) :: Role -> Role -> Bool # max :: Role -> Role -> Role # min :: Role -> Role -> Role #
Ord KeyEventType
Instance details Defined in GI.Atk.Enums Methods compare :: KeyEventType -> KeyEventType -> Ordering # (<) :: KeyEventType -> KeyEventType -> Bool # (<=) :: KeyEventType -> KeyEventType -> Bool # (>) :: KeyEventType -> KeyEventType -> Bool # (>=) :: KeyEventType -> KeyEventType -> Bool # max :: KeyEventType -> KeyEventType -> KeyEventType # min :: KeyEventType -> KeyEventType -> KeyEventType #
Ord StateType
Instance details Defined in GI.Atk.Enums Methods compare :: StateType -> StateType -> Ordering # (<) :: StateType -> StateType -> Bool # (<=) :: StateType -> StateType -> Bool # (>) :: StateType -> StateType -> Bool # (>=) :: StateType -> StateType -> Bool # max :: StateType -> StateType -> StateType # min :: StateType -> StateType -> StateType #
Ord TextAttribute
Instance details Defined in GI.Atk.Enums Methods compare :: TextAttribute -> TextAttribute -> Ordering # (<) :: TextAttribute -> TextAttribute -> Bool # (<=) :: TextAttribute -> TextAttribute -> Bool # (>) :: TextAttribute -> TextAttribute -> Bool # (>=) :: TextAttribute -> TextAttribute -> Bool # max :: TextAttribute -> TextAttribute -> TextAttribute # min :: TextAttribute -> TextAttribute -> TextAttribute #
Ord ValueType
Instance details Defined in GI.Atk.Enums Methods compare :: ValueType -> ValueType -> Ordering # (<) :: ValueType -> ValueType -> Bool # (<=) :: ValueType -> ValueType -> Bool # (>) :: ValueType -> ValueType -> Bool # (>=) :: ValueType -> ValueType -> Bool # max :: ValueType -> ValueType -> ValueType # min :: ValueType -> ValueType -> ValueType #
Ord SignalFlags
Instance details Defined in GI.GObject.Flags Methods compare :: SignalFlags -> SignalFlags -> Ordering # (<) :: SignalFlags -> SignalFlags -> Bool # (<=) :: SignalFlags -> SignalFlags -> Bool # (>) :: SignalFlags -> SignalFlags -> Bool # (>=) :: SignalFlags -> SignalFlags -> Bool # max :: SignalFlags -> SignalFlags -> SignalFlags # min :: SignalFlags -> SignalFlags -> SignalFlags #
Ord ConnectFlags
Instance details Defined in GI.GObject.Flags Methods compare :: ConnectFlags -> ConnectFlags -> Ordering # (<) :: ConnectFlags -> ConnectFlags -> Bool # (<=) :: ConnectFlags -> ConnectFlags -> Bool # (>) :: ConnectFlags -> ConnectFlags -> Bool # (>=) :: ConnectFlags -> ConnectFlags -> Bool # max :: ConnectFlags -> ConnectFlags -> ConnectFlags # min :: ConnectFlags -> ConnectFlags -> ConnectFlags #
Ord ParamFlags
Instance details Defined in GI.GObject.Flags Methods compare :: ParamFlags -> ParamFlags -> Ordering # (<) :: ParamFlags -> ParamFlags -> Bool # (<=) :: ParamFlags -> ParamFlags -> Bool # (>) :: ParamFlags -> ParamFlags -> Bool # (>=) :: ParamFlags -> ParamFlags -> Bool # max :: ParamFlags -> ParamFlags -> ParamFlags # min :: ParamFlags -> ParamFlags -> ParamFlags #
Ord SignalMatchType
Instance details Defined in GI.GObject.Flags Methods compare :: SignalMatchType -> SignalMatchType -> Ordering # (<) :: SignalMatchType -> SignalMatchType -> Bool # (<=) :: SignalMatchType -> SignalMatchType -> Bool # (>) :: SignalMatchType -> SignalMatchType -> Bool # (>=) :: SignalMatchType -> SignalMatchType -> Bool # max :: SignalMatchType -> SignalMatchType -> SignalMatchType # min :: SignalMatchType -> SignalMatchType -> SignalMatchType #
Ord TypeDebugFlags
Instance details Defined in GI.GObject.Flags Methods compare :: TypeDebugFlags -> TypeDebugFlags -> Ordering # (<) :: TypeDebugFlags -> TypeDebugFlags -> Bool # (<=) :: TypeDebugFlags -> TypeDebugFlags -> Bool # (>) :: TypeDebugFlags -> TypeDebugFlags -> Bool # (>=) :: TypeDebugFlags -> TypeDebugFlags -> Bool # max :: TypeDebugFlags -> TypeDebugFlags -> TypeDebugFlags # min :: TypeDebugFlags -> TypeDebugFlags -> TypeDebugFlags #
Ord TypeFundamentalFlags
Instance details Defined in GI.GObject.Flags Methods compare :: TypeFundamentalFlags -> TypeFundamentalFlags -> Ordering # (<) :: TypeFundamentalFlags -> TypeFundamentalFlags -> Bool # (<=) :: TypeFundamentalFlags -> TypeFundamentalFlags -> Bool # (>) :: TypeFundamentalFlags -> TypeFundamentalFlags -> Bool # (>=) :: TypeFundamentalFlags -> TypeFundamentalFlags -> Bool # max :: TypeFundamentalFlags -> TypeFundamentalFlags -> TypeFundamentalFlags # min :: TypeFundamentalFlags -> TypeFundamentalFlags -> TypeFundamentalFlags #
Ord Key Source #
Instance details Defined in Termonad.Keys Methods compare :: Key -> Key -> Ordering # (<) :: Key -> Key -> Bool # (<=) :: Key -> Key -> Bool # (>) :: Key -> Key -> Bool # (>=) :: Key -> Key -> Bool # max :: Key -> Key -> Key # min :: Key -> Key -> Key #
Ord a => Ord [a]
Instance details Defined in GHC.Classes Methods compare :: [a] -> [a] -> Ordering # (<) :: [a] -> [a] -> Bool # (<=) :: [a] -> [a] -> Bool # (>) :: [a] -> [a] -> Bool # (>=) :: [a] -> [a] -> Bool # max :: [a] -> [a] -> [a] # min :: [a] -> [a] -> [a] #
Ord a => Ord (Maybe a)	Since: base-2.1
Instance details Defined in GHC.Maybe Methods compare :: Maybe a -> Maybe a -> Ordering # (<) :: Maybe a -> Maybe a -> Bool # (<=) :: Maybe a -> Maybe a -> Bool # (>) :: Maybe a -> Maybe a -> Bool # (>=) :: Maybe a -> Maybe a -> Bool # max :: Maybe a -> Maybe a -> Maybe a # min :: Maybe a -> Maybe a -> Maybe a #
Integral a => Ord (Ratio a)	Since: base-2.0.1
Instance details Defined in GHC.Real Methods compare :: Ratio a -> Ratio a -> Ordering # (<) :: Ratio a -> Ratio a -> Bool # (<=) :: Ratio a -> Ratio a -> Bool # (>) :: Ratio a -> Ratio a -> Bool # (>=) :: Ratio a -> Ratio a -> Bool # max :: Ratio a -> Ratio a -> Ratio a # min :: Ratio a -> Ratio a -> Ratio a #
Ord (Ptr a)	Since: base-2.1
Instance details Defined in GHC.Ptr Methods compare :: Ptr a -> Ptr a -> Ordering # (<) :: Ptr a -> Ptr a -> Bool # (<=) :: Ptr a -> Ptr a -> Bool # (>) :: Ptr a -> Ptr a -> Bool # (>=) :: Ptr a -> Ptr a -> Bool # max :: Ptr a -> Ptr a -> Ptr a # min :: Ptr a -> Ptr a -> Ptr a #
Ord (FunPtr a)
Instance details Defined in GHC.Ptr Methods compare :: FunPtr a -> FunPtr a -> Ordering # (<) :: FunPtr a -> FunPtr a -> Bool # (<=) :: FunPtr a -> FunPtr a -> Bool # (>) :: FunPtr a -> FunPtr a -> Bool # (>=) :: FunPtr a -> FunPtr a -> Bool # max :: FunPtr a -> FunPtr a -> FunPtr a # min :: FunPtr a -> FunPtr a -> FunPtr a #
Ord p => Ord (Par1 p)	Since: base-4.7.0.0
Instance details Defined in GHC.Generics Methods compare :: Par1 p -> Par1 p -> Ordering # (<) :: Par1 p -> Par1 p -> Bool # (<=) :: Par1 p -> Par1 p -> Bool # (>) :: Par1 p -> Par1 p -> Bool # (>=) :: Par1 p -> Par1 p -> Bool # max :: Par1 p -> Par1 p -> Par1 p # min :: Par1 p -> Par1 p -> Par1 p #
Ord a => Ord (Last a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods compare :: Last a -> Last a -> Ordering # (<) :: Last a -> Last a -> Bool # (<=) :: Last a -> Last a -> Bool # (>) :: Last a -> Last a -> Bool # (>=) :: Last a -> Last a -> Bool # max :: Last a -> Last a -> Last a # min :: Last a -> Last a -> Last a #
Ord (ForeignPtr a)	Since: base-2.1
Instance details Defined in GHC.ForeignPtr Methods compare :: ForeignPtr a -> ForeignPtr a -> Ordering # (<) :: ForeignPtr a -> ForeignPtr a -> Bool # (<=) :: ForeignPtr a -> ForeignPtr a -> Bool # (>) :: ForeignPtr a -> ForeignPtr a -> Bool # (>=) :: ForeignPtr a -> ForeignPtr a -> Bool # max :: ForeignPtr a -> ForeignPtr a -> ForeignPtr a # min :: ForeignPtr a -> ForeignPtr a -> ForeignPtr a #
Ord (Async a)
Instance details Defined in Control.Concurrent.Async Methods compare :: Async a -> Async a -> Ordering # (<) :: Async a -> Async a -> Bool # (<=) :: Async a -> Async a -> Bool # (>) :: Async a -> Async a -> Bool # (>=) :: Async a -> Async a -> Bool # max :: Async a -> Async a -> Async a # min :: Async a -> Async a -> Async a #
Ord a => Ord (Min a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods compare :: Min a -> Min a -> Ordering # (<) :: Min a -> Min a -> Bool # (<=) :: Min a -> Min a -> Bool # (>) :: Min a -> Min a -> Bool # (>=) :: Min a -> Min a -> Bool # max :: Min a -> Min a -> Min a # min :: Min a -> Min a -> Min a #
Ord a => Ord (Max a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods compare :: Max a -> Max a -> Ordering # (<) :: Max a -> Max a -> Bool # (<=) :: Max a -> Max a -> Bool # (>) :: Max a -> Max a -> Bool # (>=) :: Max a -> Max a -> Bool # max :: Max a -> Max a -> Max a # min :: Max a -> Max a -> Max a #
Ord a => Ord (First a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods compare :: First a -> First a -> Ordering # (<) :: First a -> First a -> Bool # (<=) :: First a -> First a -> Bool # (>) :: First a -> First a -> Bool # (>=) :: First a -> First a -> Bool # max :: First a -> First a -> First a # min :: First a -> First a -> First a #
Ord m => Ord (WrappedMonoid m)	Since: base-4.9.0.0
Instance details 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 #
Ord a => Ord (Option a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods compare :: Option a -> Option a -> Ordering # (<) :: Option a -> Option a -> Bool # (<=) :: Option a -> Option a -> Bool # (>) :: Option a -> Option a -> Bool # (>=) :: Option a -> Option a -> Bool # max :: Option a -> Option a -> Option a # min :: Option a -> Option a -> Option a #
Ord a => Ord (ZipList a)	Since: base-4.7.0.0
Instance details Defined in Control.Applicative Methods compare :: ZipList a -> ZipList a -> Ordering # (<) :: ZipList a -> ZipList a -> Bool # (<=) :: ZipList a -> ZipList a -> Bool # (>) :: ZipList a -> ZipList a -> Bool # (>=) :: ZipList a -> ZipList a -> Bool # max :: ZipList a -> ZipList a -> ZipList a # min :: ZipList a -> ZipList a -> ZipList a #
Ord a => Ord (Identity a)	Since: base-4.8.0.0
Instance details Defined in Data.Functor.Identity Methods compare :: Identity a -> Identity a -> Ordering # (<) :: Identity a -> Identity a -> Bool # (<=) :: Identity a -> Identity a -> Bool # (>) :: Identity a -> Identity a -> Bool # (>=) :: Identity a -> Identity a -> Bool # max :: Identity a -> Identity a -> Identity a # min :: Identity a -> Identity a -> Identity a #
Ord a => Ord (First a)	Since: base-2.1
Instance details Defined in Data.Monoid Methods compare :: First a -> First a -> Ordering # (<) :: First a -> First a -> Bool # (<=) :: First a -> First a -> Bool # (>) :: First a -> First a -> Bool # (>=) :: First a -> First a -> Bool # max :: First a -> First a -> First a # min :: First a -> First a -> First a #
Ord a => Ord (Last a)	Since: base-2.1
Instance details Defined in Data.Monoid Methods compare :: Last a -> Last a -> Ordering # (<) :: Last a -> Last a -> Bool # (<=) :: Last a -> Last a -> Bool # (>) :: Last a -> Last a -> Bool # (>=) :: Last a -> Last a -> Bool # max :: Last a -> Last a -> Last a # min :: Last a -> Last a -> Last a #
Ord a => Ord (Dual a)	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods compare :: Dual a -> Dual a -> Ordering # (<) :: Dual a -> Dual a -> Bool # (<=) :: Dual a -> Dual a -> Bool # (>) :: Dual a -> Dual a -> Bool # (>=) :: Dual a -> Dual a -> Bool # max :: Dual a -> Dual a -> Dual a # min :: Dual a -> Dual a -> Dual a #
Ord a => Ord (Sum a)	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods compare :: Sum a -> Sum a -> Ordering # (<) :: Sum a -> Sum a -> Bool # (<=) :: Sum a -> Sum a -> Bool # (>) :: Sum a -> Sum a -> Bool # (>=) :: Sum a -> Sum a -> Bool # max :: Sum a -> Sum a -> Sum a # min :: Sum a -> Sum a -> Sum a #
Ord a => Ord (Product a)	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods compare :: Product a -> Product a -> Ordering # (<) :: Product a -> Product a -> Bool # (<=) :: Product a -> Product a -> Bool # (>) :: Product a -> Product a -> Bool # (>=) :: Product a -> Product a -> Bool # max :: Product a -> Product a -> Product a # min :: Product a -> Product a -> Product a #
Ord a => Ord (Down a)	Since: base-4.6.0.0
Instance details Defined in Data.Ord Methods compare :: Down a -> Down a -> Ordering # (<) :: Down a -> Down a -> Bool # (<=) :: Down a -> Down a -> Bool # (>) :: Down a -> Down a -> Bool # (>=) :: Down a -> Down a -> Bool # max :: Down a -> Down a -> Down a # min :: Down a -> Down a -> Down a #
Ord a => Ord (NonEmpty a)	Since: base-4.9.0.0
Instance details Defined in GHC.Base Methods compare :: NonEmpty a -> NonEmpty a -> Ordering # (<) :: NonEmpty a -> NonEmpty a -> Bool # (<=) :: NonEmpty a -> NonEmpty a -> Bool # (>) :: NonEmpty a -> NonEmpty a -> Bool # (>=) :: NonEmpty a -> NonEmpty a -> Bool # max :: NonEmpty a -> NonEmpty a -> NonEmpty a # min :: NonEmpty a -> NonEmpty a -> NonEmpty a #
Ord a => Ord (Vector a)
Instance details Defined in Data.Vector Methods compare :: Vector a -> Vector a -> Ordering # (<) :: Vector a -> Vector a -> Bool # (<=) :: Vector a -> Vector a -> Bool # (>) :: Vector a -> Vector a -> Bool # (>=) :: Vector a -> Vector a -> Bool # max :: Vector a -> Vector a -> Vector a # min :: Vector a -> Vector a -> Vector a #
Ord a => Ord (HashSet a)
Instance details Defined in Data.HashSet Methods compare :: HashSet a -> HashSet a -> Ordering # (<) :: HashSet a -> HashSet a -> Bool # (<=) :: HashSet a -> HashSet a -> Bool # (>) :: HashSet a -> HashSet a -> Bool # (>=) :: HashSet a -> HashSet a -> Bool # max :: HashSet a -> HashSet a -> HashSet a # min :: HashSet a -> HashSet a -> HashSet a #
Ord a => Ord (Set a)
Instance details Defined in Data.Set.Internal Methods compare :: Set a -> Set a -> Ordering # (<) :: Set a -> Set a -> Bool # (<=) :: Set a -> Set a -> Bool # (>) :: Set a -> Set a -> Bool # (>=) :: Set a -> Set a -> Bool # max :: Set a -> Set a -> Set a # min :: Set a -> Set a -> Set a #
Ord a => Ord (Seq a)
Instance details Defined in Data.Sequence.Internal Methods compare :: Seq a -> Seq a -> Ordering # (<) :: Seq a -> Seq a -> Bool # (<=) :: Seq a -> Seq a -> Bool # (>) :: Seq a -> Seq a -> Bool # (>=) :: Seq a -> Seq a -> Bool # max :: Seq a -> Seq a -> Seq a # min :: Seq a -> Seq a -> Seq a #
Ord a => Ord (IntMap a)
Instance details Defined in Data.IntMap.Internal Methods compare :: IntMap a -> IntMap a -> Ordering # (<) :: IntMap a -> IntMap a -> Bool # (<=) :: IntMap a -> IntMap a -> Bool # (>) :: IntMap a -> IntMap a -> Bool # (>=) :: IntMap a -> IntMap a -> Bool # max :: IntMap a -> IntMap a -> IntMap a # min :: IntMap a -> IntMap a -> IntMap a #
Ord mono => Ord (NonNull mono)
Instance details Defined in Data.NonNull Methods compare :: NonNull mono -> NonNull mono -> Ordering # (<) :: NonNull mono -> NonNull mono -> Bool # (<=) :: NonNull mono -> NonNull mono -> Bool # (>) :: NonNull mono -> NonNull mono -> Bool # (>=) :: NonNull mono -> NonNull mono -> Bool # max :: NonNull mono -> NonNull mono -> NonNull mono # min :: NonNull mono -> NonNull mono -> NonNull mono #
Ord a => Ord (DList a)
Instance details Defined in Data.DList Methods compare :: DList a -> DList a -> Ordering # (<) :: DList a -> DList a -> Bool # (<=) :: DList a -> DList a -> Bool # (>) :: DList a -> DList a -> Bool # (>=) :: DList a -> DList a -> Bool # max :: DList a -> DList a -> DList a # min :: DList a -> DList a -> DList a #
Ord a => Ord (Flush a)
Instance details Defined in Data.Conduit.Internal.Conduit Methods compare :: Flush a -> Flush a -> Ordering # (<) :: Flush a -> Flush a -> Bool # (<=) :: Flush a -> Flush a -> Bool # (>) :: Flush a -> Flush a -> Bool # (>=) :: Flush a -> Flush a -> Bool # max :: Flush a -> Flush a -> Flush a # min :: Flush a -> Flush a -> Flush a #
Ord a => Ord (ViewL a)
Instance details Defined in Data.Sequence.Internal Methods compare :: ViewL a -> ViewL a -> Ordering # (<) :: ViewL a -> ViewL a -> Bool # (<=) :: ViewL a -> ViewL a -> Bool # (>) :: ViewL a -> ViewL a -> Bool # (>=) :: ViewL a -> ViewL a -> Bool # max :: ViewL a -> ViewL a -> ViewL a # min :: ViewL a -> ViewL a -> ViewL a #
Ord a => Ord (ViewR a)
Instance details Defined in Data.Sequence.Internal Methods compare :: ViewR a -> ViewR a -> Ordering # (<) :: ViewR a -> ViewR a -> Bool # (<=) :: ViewR a -> ViewR a -> Bool # (>) :: ViewR a -> ViewR a -> Bool # (>=) :: ViewR a -> ViewR a -> Bool # max :: ViewR a -> ViewR a -> ViewR a # min :: ViewR a -> ViewR a -> ViewR a #
Ord a => Ord (Hashed a)
Instance details Defined in Data.Hashable.Class Methods compare :: Hashed a -> Hashed a -> Ordering # (<) :: Hashed a -> Hashed a -> Bool # (<=) :: Hashed a -> Hashed a -> Bool # (>) :: Hashed a -> Hashed a -> Bool # (>=) :: Hashed a -> Hashed a -> Bool # max :: Hashed a -> Hashed a -> Hashed a # min :: Hashed a -> Hashed a -> Hashed a #
(Prim a, Ord a) => Ord (Vector a)
Instance details Defined in Data.Vector.Primitive Methods compare :: Vector a -> Vector a -> Ordering # (<) :: Vector a -> Vector a -> Bool # (<=) :: Vector a -> Vector a -> Bool # (>) :: Vector a -> Vector a -> Bool # (>=) :: Vector a -> Vector a -> Bool # max :: Vector a -> Vector a -> Vector a # min :: Vector a -> Vector a -> Vector a #
(Storable a, Ord a) => Ord (Vector a)
Instance details Defined in Data.Vector.Storable Methods compare :: Vector a -> Vector a -> Ordering # (<) :: Vector a -> Vector a -> Bool # (<=) :: Vector a -> Vector a -> Bool # (>) :: Vector a -> Vector a -> Bool # (>=) :: Vector a -> Vector a -> Bool # max :: Vector a -> Vector a -> Vector a # min :: Vector a -> Vector a -> Vector a #
(Ord a, PrimUnlifted a) => Ord (UnliftedArray a)	Lexicographic ordering. Subject to change between major versions. Since: primitive-0.6.4.0
Instance details Defined in Data.Primitive.UnliftedArray Methods compare :: UnliftedArray a -> UnliftedArray a -> Ordering # (<) :: UnliftedArray a -> UnliftedArray a -> Bool # (<=) :: UnliftedArray a -> UnliftedArray a -> Bool # (>) :: UnliftedArray a -> UnliftedArray a -> Bool # (>=) :: UnliftedArray a -> UnliftedArray a -> Bool # max :: UnliftedArray a -> UnliftedArray a -> UnliftedArray a # min :: UnliftedArray a -> UnliftedArray a -> UnliftedArray a #
(Ord a, Prim a) => Ord (PrimArray a)	Lexicographic ordering. Subject to change between major versions. Since: primitive-0.6.4.0
Instance details Defined in Data.Primitive.PrimArray Methods compare :: PrimArray a -> PrimArray a -> Ordering # (<) :: PrimArray a -> PrimArray a -> Bool # (<=) :: PrimArray a -> PrimArray a -> Bool # (>) :: PrimArray a -> PrimArray a -> Bool # (>=) :: PrimArray a -> PrimArray a -> Bool # max :: PrimArray a -> PrimArray a -> PrimArray a # min :: PrimArray a -> PrimArray a -> PrimArray a #
Ord a => Ord (SmallArray a)	Lexicographic ordering. Subject to change between major versions.
Instance details Defined in Data.Primitive.SmallArray Methods compare :: SmallArray a -> SmallArray a -> Ordering # (<) :: SmallArray a -> SmallArray a -> Bool # (<=) :: SmallArray a -> SmallArray a -> Bool # (>) :: SmallArray a -> SmallArray a -> Bool # (>=) :: SmallArray a -> SmallArray a -> Bool # max :: SmallArray a -> SmallArray a -> SmallArray a # min :: SmallArray a -> SmallArray a -> SmallArray a #
Ord a => Ord (Array a)	Lexicographic ordering. Subject to change between major versions.
Instance details Defined in Data.Primitive.Array Methods compare :: Array a -> Array a -> Ordering # (<) :: Array a -> Array a -> Bool # (<=) :: Array a -> Array a -> Bool # (>) :: Array a -> Array a -> Bool # (>=) :: Array a -> Array a -> Bool # max :: Array a -> Array a -> Array a # min :: Array a -> Array a -> Array a #
Ord (Fin n) Source #
Instance details Defined in Termonad.Config.Vec Methods compare :: Fin n -> Fin n -> Ordering # (<) :: Fin n -> Fin n -> Bool # (<=) :: Fin n -> Fin n -> Bool # (>) :: Fin n -> Fin n -> Bool # (>=) :: Fin n -> Fin n -> Bool # max :: Fin n -> Fin n -> Fin n # min :: Fin n -> Fin n -> Fin n #
Ord a => Ord (Option a) Source #
Instance details Defined in Termonad.Types Methods compare :: Option a -> Option a -> Ordering # (<) :: Option a -> Option a -> Bool # (<=) :: Option a -> Option a -> Bool # (>) :: Option a -> Option a -> Bool # (>=) :: Option a -> Option a -> Bool # max :: Option a -> Option a -> Option a # min :: Option a -> Option a -> Option a #
(Ord a, Ord b) => Ord (Either a b)	Since: base-2.1
Instance details Defined in Data.Either Methods compare :: Either a b -> Either a b -> Ordering # (<) :: Either a b -> Either a b -> Bool # (<=) :: Either a b -> Either a b -> Bool # (>) :: Either a b -> Either a b -> Bool # (>=) :: Either a b -> Either a b -> Bool # max :: Either a b -> Either a b -> Either a b # min :: Either a b -> Either a b -> Either a b #
Ord (V1 p)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods compare :: V1 p -> V1 p -> Ordering # (<) :: V1 p -> V1 p -> Bool # (<=) :: V1 p -> V1 p -> Bool # (>) :: V1 p -> V1 p -> Bool # (>=) :: V1 p -> V1 p -> Bool # max :: V1 p -> V1 p -> V1 p # min :: V1 p -> V1 p -> V1 p #
Ord (U1 p)	Since: base-4.7.0.0
Instance details Defined in GHC.Generics Methods compare :: U1 p -> U1 p -> Ordering # (<) :: U1 p -> U1 p -> Bool # (<=) :: U1 p -> U1 p -> Bool # (>) :: U1 p -> U1 p -> Bool # (>=) :: U1 p -> U1 p -> Bool # max :: U1 p -> U1 p -> U1 p # min :: U1 p -> U1 p -> U1 p #
Ord (TypeRep a)	Since: base-4.4.0.0
Instance details Defined in Data.Typeable.Internal Methods compare :: TypeRep a -> TypeRep a -> Ordering # (<) :: TypeRep a -> TypeRep a -> Bool # (<=) :: TypeRep a -> TypeRep a -> Bool # (>) :: TypeRep a -> TypeRep a -> Bool # (>=) :: TypeRep a -> TypeRep a -> Bool # max :: TypeRep a -> TypeRep a -> TypeRep a # min :: TypeRep a -> TypeRep a -> TypeRep a #
(Ord a, Ord b) => Ord (a, b)
Instance details Defined in GHC.Classes Methods compare :: (a, b) -> (a, b) -> Ordering # (<) :: (a, b) -> (a, b) -> Bool # (<=) :: (a, b) -> (a, b) -> Bool # (>) :: (a, b) -> (a, b) -> Bool # (>=) :: (a, b) -> (a, b) -> Bool # max :: (a, b) -> (a, b) -> (a, b) # min :: (a, b) -> (a, b) -> (a, b) #
(Ord k, Ord v) => Ord (Map k v)
Instance details Defined in Data.Map.Internal Methods compare :: Map k v -> Map k v -> Ordering # (<) :: Map k v -> Map k v -> Bool # (<=) :: Map k v -> Map k v -> Bool # (>) :: Map k v -> Map k v -> Bool # (>=) :: Map k v -> Map k v -> Bool # max :: Map k v -> Map k v -> Map k v # min :: Map k v -> Map k v -> Map 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 `HashMap` or an result of `compare`.is stable.
Instance details Defined in Data.HashMap.Base Methods compare :: HashMap k v -> HashMap k v -> Ordering # (<) :: HashMap k v -> HashMap k v -> Bool # (<=) :: HashMap k v -> HashMap k v -> Bool # (>) :: HashMap k v -> HashMap k v -> Bool # (>=) :: HashMap k v -> HashMap k v -> Bool # max :: HashMap k v -> HashMap k v -> HashMap k v # min :: HashMap k v -> HashMap k v -> HashMap k v #
(Ix i, Ord e) => Ord (Array i e)	Since: base-2.1
Instance details Defined in GHC.Arr Methods compare :: Array i e -> Array i e -> Ordering # (<) :: Array i e -> Array i e -> Bool # (<=) :: Array i e -> Array i e -> Bool # (>) :: Array i e -> Array i e -> Bool # (>=) :: Array i e -> Array i e -> Bool # max :: Array i e -> Array i e -> Array i e # min :: Array i e -> Array i e -> Array i e #
Ord a => Ord (Arg a b)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods compare :: Arg a b -> Arg a b -> Ordering # (<) :: Arg a b -> Arg a b -> Bool # (<=) :: Arg a b -> Arg a b -> Bool # (>) :: Arg a b -> Arg a b -> Bool # (>=) :: Arg a b -> Arg a b -> Bool # max :: Arg a b -> Arg a b -> Arg a b # min :: Arg a b -> Arg a b -> Arg a b #
Ord (Proxy s)	Since: base-4.7.0.0
Instance details Defined in Data.Proxy Methods compare :: Proxy s -> Proxy s -> Ordering # (<) :: Proxy s -> Proxy s -> Bool # (<=) :: Proxy s -> Proxy s -> Bool # (>) :: Proxy s -> Proxy s -> Bool # (>=) :: Proxy s -> Proxy s -> Bool # max :: Proxy s -> Proxy s -> Proxy s # min :: Proxy s -> Proxy s -> Proxy s #
(Ord1 m, Ord a) => Ord (MaybeT m a)
Instance details Defined in Control.Monad.Trans.Maybe Methods compare :: MaybeT m a -> MaybeT m a -> Ordering # (<) :: MaybeT m a -> MaybeT m a -> Bool # (<=) :: MaybeT m a -> MaybeT m a -> Bool # (>) :: MaybeT m a -> MaybeT m a -> Bool # (>=) :: MaybeT m a -> MaybeT m a -> Bool # max :: MaybeT m a -> MaybeT m a -> MaybeT m a # min :: MaybeT m a -> MaybeT m a -> MaybeT m a #
(Ord1 f, Ord a) => Ord (Cofree f a)
Instance details Defined in Control.Comonad.Cofree Methods compare :: Cofree f a -> Cofree f a -> Ordering # (<) :: Cofree f a -> Cofree f a -> Bool # (<=) :: Cofree f a -> Cofree f a -> Bool # (>) :: Cofree f a -> Cofree f a -> Bool # (>=) :: Cofree f a -> Cofree f a -> Bool # max :: Cofree f a -> Cofree f a -> Cofree f a # min :: Cofree f a -> Cofree f a -> Cofree f a #
(Ord1 f, Ord a) => Ord (Free f a)
Instance details Defined in Control.Monad.Free Methods compare :: Free f a -> Free f a -> Ordering # (<) :: Free f a -> Free f a -> Bool # (<=) :: Free f a -> Free f a -> Bool # (>) :: Free f a -> Free f a -> Bool # (>=) :: Free f a -> Free f a -> Bool # max :: Free f a -> Free f a -> Free f a # min :: Free f a -> Free f a -> Free f a #
(Ord1 f, Ord a) => Ord (Yoneda f a)
Instance details Defined in Data.Functor.Yoneda Methods compare :: Yoneda f a -> Yoneda f a -> Ordering # (<) :: Yoneda f a -> Yoneda f a -> Bool # (<=) :: Yoneda f a -> Yoneda f a -> Bool # (>) :: Yoneda f a -> Yoneda f a -> Bool # (>=) :: Yoneda f a -> Yoneda f a -> Bool # max :: Yoneda f a -> Yoneda f a -> Yoneda f a # min :: Yoneda f a -> Yoneda f a -> Yoneda f a #
(Ord1 m, Ord a) => Ord (ListT m a)
Instance details Defined in Control.Monad.Trans.List Methods compare :: ListT m a -> ListT m a -> Ordering # (<) :: ListT m a -> ListT m a -> Bool # (<=) :: ListT m a -> ListT m a -> Bool # (>) :: ListT m a -> ListT m a -> Bool # (>=) :: ListT m a -> ListT m a -> Bool # max :: ListT m a -> ListT m a -> ListT m a # min :: ListT m a -> ListT m a -> ListT m a #
Ord (MatrixTF ns a) => Ord (Matrix ns a) Source #
Instance details Defined in Termonad.Config.Vec Methods compare :: Matrix ns a -> Matrix ns a -> Ordering # (<) :: Matrix ns a -> Matrix ns a -> Bool # (<=) :: Matrix ns a -> Matrix ns a -> Bool # (>) :: Matrix ns a -> Matrix ns a -> Bool # (>=) :: Matrix ns a -> Matrix ns a -> Bool # max :: Matrix ns a -> Matrix ns a -> Matrix ns a # min :: Matrix ns a -> Matrix ns a -> Matrix ns a #
Ord a => Ord (Vec n a) Source #
Instance details Defined in Termonad.Config.Vec Methods compare :: Vec n a -> Vec n a -> Ordering # (<) :: Vec n a -> Vec n a -> Bool # (<=) :: Vec n a -> Vec n a -> Bool # (>) :: Vec n a -> Vec n a -> Bool # (>=) :: Vec n a -> Vec n a -> Bool # max :: Vec n a -> Vec n a -> Vec n a # min :: Vec n a -> Vec n a -> Vec n a #
Ord (IFin x y) Source #
Instance details Defined in Termonad.Config.Vec Methods compare :: IFin x y -> IFin x y -> Ordering # (<) :: IFin x y -> IFin x y -> Bool # (<=) :: IFin x y -> IFin x y -> Bool # (>) :: IFin x y -> IFin x y -> Bool # (>=) :: IFin x y -> IFin x y -> Bool # max :: IFin x y -> IFin x y -> IFin x y # min :: IFin x y -> IFin x y -> IFin x y #
Ord (f p) => Ord (Rec1 f p)	Since: base-4.7.0.0
Instance details Defined in GHC.Generics Methods compare :: Rec1 f p -> Rec1 f p -> Ordering # (<) :: Rec1 f p -> Rec1 f p -> Bool # (<=) :: Rec1 f p -> Rec1 f p -> Bool # (>) :: Rec1 f p -> Rec1 f p -> Bool # (>=) :: Rec1 f p -> Rec1 f p -> Bool # max :: Rec1 f p -> Rec1 f p -> Rec1 f p # min :: Rec1 f p -> Rec1 f p -> Rec1 f p #
Ord (URec (Ptr ()) p)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods compare :: URec (Ptr ()) p -> URec (Ptr ()) p -> Ordering # (<) :: URec (Ptr ()) p -> URec (Ptr ()) p -> Bool # (<=) :: URec (Ptr ()) p -> URec (Ptr ()) p -> Bool # (>) :: URec (Ptr ()) p -> URec (Ptr ()) p -> Bool # (>=) :: URec (Ptr ()) p -> URec (Ptr ()) p -> Bool # max :: URec (Ptr ()) p -> URec (Ptr ()) p -> URec (Ptr ()) p # min :: URec (Ptr ()) p -> URec (Ptr ()) p -> URec (Ptr ()) p #
Ord (URec Char p)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods compare :: URec Char p -> URec Char p -> Ordering # (<) :: URec Char p -> URec Char p -> Bool # (<=) :: URec Char p -> URec Char p -> Bool # (>) :: URec Char p -> URec Char p -> Bool # (>=) :: URec Char p -> URec Char p -> Bool # max :: URec Char p -> URec Char p -> URec Char p # min :: URec Char p -> URec Char p -> URec Char p #
Ord (URec Double p)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods compare :: URec Double p -> URec Double p -> Ordering # (<) :: URec Double p -> URec Double p -> Bool # (<=) :: URec Double p -> URec Double p -> Bool # (>) :: URec Double p -> URec Double p -> Bool # (>=) :: URec Double p -> URec Double p -> Bool # max :: URec Double p -> URec Double p -> URec Double p # min :: URec Double p -> URec Double p -> URec Double p #
Ord (URec Float p)
Instance details Defined in GHC.Generics Methods compare :: URec Float p -> URec Float p -> Ordering # (<) :: URec Float p -> URec Float p -> Bool # (<=) :: URec Float p -> URec Float p -> Bool # (>) :: URec Float p -> URec Float p -> Bool # (>=) :: URec Float p -> URec Float p -> Bool # max :: URec Float p -> URec Float p -> URec Float p # min :: URec Float p -> URec Float p -> URec Float p #
Ord (URec Int p)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods compare :: URec Int p -> URec Int p -> Ordering # (<) :: URec Int p -> URec Int p -> Bool # (<=) :: URec Int p -> URec Int p -> Bool # (>) :: URec Int p -> URec Int p -> Bool # (>=) :: URec Int p -> URec Int p -> Bool # max :: URec Int p -> URec Int p -> URec Int p # min :: URec Int p -> URec Int p -> URec Int p #
Ord (URec Word p)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods compare :: URec Word p -> URec Word p -> Ordering # (<) :: URec Word p -> URec Word p -> Bool # (<=) :: URec Word p -> URec Word p -> Bool # (>) :: URec Word p -> URec Word p -> Bool # (>=) :: URec Word p -> URec Word p -> Bool # max :: URec Word p -> URec Word p -> URec Word p # min :: URec Word p -> URec Word p -> URec Word p #
(Ord a, Ord b, Ord c) => Ord (a, b, c)
Instance details Defined in GHC.Classes Methods compare :: (a, b, c) -> (a, b, c) -> Ordering # (<) :: (a, b, c) -> (a, b, c) -> Bool # (<=) :: (a, b, c) -> (a, b, c) -> Bool # (>) :: (a, b, c) -> (a, b, c) -> Bool # (>=) :: (a, b, c) -> (a, b, c) -> Bool # max :: (a, b, c) -> (a, b, c) -> (a, b, c) # min :: (a, b, c) -> (a, b, c) -> (a, b, c) #
Ord a => Ord (Const a b)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Const Methods compare :: Const a b -> Const a b -> Ordering # (<) :: Const a b -> Const a b -> Bool # (<=) :: Const a b -> Const a b -> Bool # (>) :: Const a b -> Const a b -> Bool # (>=) :: Const a b -> Const a b -> Bool # max :: Const a b -> Const a b -> Const a b # min :: Const a b -> Const a b -> Const a b #
Ord (f a) => Ord (Ap f a)	Since: base-4.12.0.0
Instance details Defined in Data.Monoid Methods compare :: Ap f a -> Ap f a -> Ordering # (<) :: Ap f a -> Ap f a -> Bool # (<=) :: Ap f a -> Ap f a -> Bool # (>) :: Ap f a -> Ap f a -> Bool # (>=) :: Ap f a -> Ap f a -> Bool # max :: Ap f a -> Ap f a -> Ap f a # min :: Ap f a -> Ap f a -> Ap f a #
Ord (f a) => Ord (Alt f a)	Since: base-4.8.0.0
Instance details Defined in Data.Semigroup.Internal Methods compare :: Alt f a -> Alt f a -> Ordering # (<) :: Alt f a -> Alt f a -> Bool # (<=) :: Alt f a -> Alt f a -> Bool # (>) :: Alt f a -> Alt f a -> Bool # (>=) :: Alt f a -> Alt f a -> Bool # max :: Alt f a -> Alt f a -> Alt f a # min :: Alt f a -> Alt f a -> Alt f a #
Ord (a :~: b)	Since: base-4.7.0.0
Instance details Defined in Data.Type.Equality Methods compare :: (a :~: b) -> (a :~: b) -> Ordering # (<) :: (a :~: b) -> (a :~: b) -> Bool # (<=) :: (a :~: b) -> (a :~: b) -> Bool # (>) :: (a :~: b) -> (a :~: b) -> Bool # (>=) :: (a :~: b) -> (a :~: b) -> Bool # max :: (a :~: b) -> (a :~: b) -> a :~: b # min :: (a :~: b) -> (a :~: b) -> a :~: b #
Ord (p a a) => Ord (Join p a)
Instance details Defined in Data.Bifunctor.Join Methods compare :: Join p a -> Join p a -> Ordering # (<) :: Join p a -> Join p a -> Bool # (<=) :: Join p a -> Join p a -> Bool # (>) :: Join p a -> Join p a -> Bool # (>=) :: Join p a -> Join p a -> Bool # max :: Join p a -> Join p a -> Join p a # min :: Join p a -> Join p a -> Join p a #
Ord (p (Fix p a) a) => Ord (Fix p a)
Instance details Defined in Data.Bifunctor.Fix Methods compare :: Fix p a -> Fix p a -> Ordering # (<) :: Fix p a -> Fix p a -> Bool # (<=) :: Fix p a -> Fix p a -> Bool # (>) :: Fix p a -> Fix p a -> Bool # (>=) :: Fix p a -> Fix p a -> Bool # max :: Fix p a -> Fix p a -> Fix p a # min :: Fix p a -> Fix p a -> Fix p a #
(Ord1 f, Ord a) => Ord (IdentityT f a)
Instance details Defined in Control.Monad.Trans.Identity Methods compare :: IdentityT f a -> IdentityT f a -> Ordering # (<) :: IdentityT f a -> IdentityT f a -> Bool # (<=) :: IdentityT f a -> IdentityT f a -> Bool # (>) :: IdentityT f a -> IdentityT f a -> Bool # (>=) :: IdentityT f a -> IdentityT f a -> Bool # max :: IdentityT f a -> IdentityT f a -> IdentityT f a # min :: IdentityT f a -> IdentityT f a -> IdentityT f a #
(Ord w, Ord1 m, Ord a) => Ord (WriterT w m a)
Instance details Defined in Control.Monad.Trans.Writer.Strict Methods compare :: WriterT w m a -> WriterT w m a -> Ordering # (<) :: WriterT w m a -> WriterT w m a -> Bool # (<=) :: WriterT w m a -> WriterT w m a -> Bool # (>) :: WriterT w m a -> WriterT w m a -> Bool # (>=) :: WriterT w m a -> WriterT w m a -> Bool # max :: WriterT w m a -> WriterT w m a -> WriterT w m a # min :: WriterT w m a -> WriterT w m a -> WriterT w m a #
(Ord w, Ord1 m, Ord a) => Ord (WriterT w m a)
Instance details Defined in Control.Monad.Trans.Writer.Lazy Methods compare :: WriterT w m a -> WriterT w m a -> Ordering # (<) :: WriterT w m a -> WriterT w m a -> Bool # (<=) :: WriterT w m a -> WriterT w m a -> Bool # (>) :: WriterT w m a -> WriterT w m a -> Bool # (>=) :: WriterT w m a -> WriterT w m a -> Bool # max :: WriterT w m a -> WriterT w m a -> WriterT w m a # min :: WriterT w m a -> WriterT w m a -> WriterT w m a #
(Ord a, Ord (f b)) => Ord (FreeF f a b)
Instance details Defined in Control.Monad.Trans.Free Methods compare :: FreeF f a b -> FreeF f a b -> Ordering # (<) :: FreeF f a b -> FreeF f a b -> Bool # (<=) :: FreeF f a b -> FreeF f a b -> Bool # (>) :: FreeF f a b -> FreeF f a b -> Bool # (>=) :: FreeF f a b -> FreeF f a b -> Bool # max :: FreeF f a b -> FreeF f a b -> FreeF f a b # min :: FreeF f a b -> FreeF f a b -> FreeF f a b #
(Ord1 f, Ord1 m, Ord a) => Ord (FreeT f m a)
Instance details Defined in Control.Monad.Trans.Free Methods compare :: FreeT f m a -> FreeT f m a -> Ordering # (<) :: FreeT f m a -> FreeT f m a -> Bool # (<=) :: FreeT f m a -> FreeT f m a -> Bool # (>) :: FreeT f m a -> FreeT f m a -> Bool # (>=) :: FreeT f m a -> FreeT f m a -> Bool # max :: FreeT f m a -> FreeT f m a -> FreeT f m a # min :: FreeT f m a -> FreeT f m a -> FreeT f m a #
(Ord a, Ord (f b)) => Ord (CofreeF f a b)
Instance details Defined in Control.Comonad.Trans.Cofree Methods compare :: CofreeF f a b -> CofreeF f a b -> Ordering # (<) :: CofreeF f a b -> CofreeF f a b -> Bool # (<=) :: CofreeF f a b -> CofreeF f a b -> Bool # (>) :: CofreeF f a b -> CofreeF f a b -> Bool # (>=) :: CofreeF f a b -> CofreeF f a b -> Bool # max :: CofreeF f a b -> CofreeF f a b -> CofreeF f a b # min :: CofreeF f a b -> CofreeF f a b -> CofreeF f a b #
Ord (w (CofreeF f a (CofreeT f w a))) => Ord (CofreeT f w a)
Instance details Defined in Control.Comonad.Trans.Cofree Methods compare :: CofreeT f w a -> CofreeT f w a -> Ordering # (<) :: CofreeT f w a -> CofreeT f w a -> Bool # (<=) :: CofreeT f w a -> CofreeT f w a -> Bool # (>) :: CofreeT f w a -> CofreeT f w a -> Bool # (>=) :: CofreeT f w a -> CofreeT f w a -> Bool # max :: CofreeT f w a -> CofreeT f w a -> CofreeT f w a # min :: CofreeT f w a -> CofreeT f w a -> CofreeT f w a #
(Ord e, Ord1 m, Ord a) => Ord (ErrorT e m a)
Instance details Defined in Control.Monad.Trans.Error Methods compare :: ErrorT e m a -> ErrorT e m a -> Ordering # (<) :: ErrorT e m a -> ErrorT e m a -> Bool # (<=) :: ErrorT e m a -> ErrorT e m a -> Bool # (>) :: ErrorT e m a -> ErrorT e m a -> Bool # (>=) :: ErrorT e m a -> ErrorT e m a -> Bool # max :: ErrorT e m a -> ErrorT e m a -> ErrorT e m a # min :: ErrorT e m a -> ErrorT e m a -> ErrorT e m a #
Ord b => Ord (Tagged s b)
Instance details Defined in Data.Tagged Methods compare :: Tagged s b -> Tagged s b -> Ordering # (<) :: Tagged s b -> Tagged s b -> Bool # (<=) :: Tagged s b -> Tagged s b -> Bool # (>) :: Tagged s b -> Tagged s b -> Bool # (>=) :: Tagged s b -> Tagged s b -> Bool # max :: Tagged s b -> Tagged s b -> Tagged s b # min :: Tagged s b -> Tagged s b -> Tagged s b #
Ord c => Ord (K1 i c p)	Since: base-4.7.0.0
Instance details Defined in GHC.Generics Methods compare :: K1 i c p -> K1 i c p -> Ordering # (<) :: K1 i c p -> K1 i c p -> Bool # (<=) :: K1 i c p -> K1 i c p -> Bool # (>) :: K1 i c p -> K1 i c p -> Bool # (>=) :: K1 i c p -> K1 i c p -> Bool # max :: K1 i c p -> K1 i c p -> K1 i c p # min :: K1 i c p -> K1 i c p -> K1 i c p #
(Ord (f p), Ord (g p)) => Ord ((f :+: g) p)	Since: base-4.7.0.0
Instance details Defined in GHC.Generics Methods compare :: (f :+: g) p -> (f :+: g) p -> Ordering # (<) :: (f :+: g) p -> (f :+: g) p -> Bool # (<=) :: (f :+: g) p -> (f :+: g) p -> Bool # (>) :: (f :+: g) p -> (f :+: g) p -> Bool # (>=) :: (f :+: g) p -> (f :+: g) p -> Bool # max :: (f :+: g) p -> (f :+: g) p -> (f :+: g) p # min :: (f :+: g) p -> (f :+: g) p -> (f :+: g) p #
(Ord (f p), Ord (g p)) => Ord ((f :*: g) p)	Since: base-4.7.0.0
Instance details Defined in GHC.Generics Methods compare :: (f :: g) p -> (f :: g) p -> Ordering # (<) :: (f :: g) p -> (f :: g) p -> Bool # (<=) :: (f :: g) p -> (f :: g) p -> Bool # (>) :: (f :: g) p -> (f :: g) p -> Bool # (>=) :: (f :: g) p -> (f :: g) p -> Bool # max :: (f :: g) p -> (f :: g) p -> (f :: g) p # min :: (f :: g) p -> (f :: g) p -> (f :: g) p #
(Ord a, Ord b, Ord c, Ord d) => Ord (a, b, c, d)
Instance details Defined in GHC.Classes Methods compare :: (a, b, c, d) -> (a, b, c, d) -> Ordering # (<) :: (a, b, c, d) -> (a, b, c, d) -> Bool # (<=) :: (a, b, c, d) -> (a, b, c, d) -> Bool # (>) :: (a, b, c, d) -> (a, b, c, d) -> Bool # (>=) :: (a, b, c, d) -> (a, b, c, d) -> Bool # max :: (a, b, c, d) -> (a, b, c, d) -> (a, b, c, d) # min :: (a, b, c, d) -> (a, b, c, d) -> (a, b, c, d) #
(Ord1 f, Ord1 g, Ord a) => Ord (Product f g a)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Product Methods compare :: Product f g a -> Product f g a -> Ordering # (<) :: Product f g a -> Product f g a -> Bool # (<=) :: Product f g a -> Product f g a -> Bool # (>) :: Product f g a -> Product f g a -> Bool # (>=) :: Product f g a -> Product f g a -> Bool # max :: Product f g a -> Product f g a -> Product f g a # min :: Product f g a -> Product f g a -> Product f g a #
(Ord1 f, Ord1 g, Ord a) => Ord (Sum f g a)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Sum Methods compare :: Sum f g a -> Sum f g a -> Ordering # (<) :: Sum f g a -> Sum f g a -> Bool # (<=) :: Sum f g a -> Sum f g a -> Bool # (>) :: Sum f g a -> Sum f g a -> Bool # (>=) :: Sum f g a -> Sum f g a -> Bool # max :: Sum f g a -> Sum f g a -> Sum f g a # min :: Sum f g a -> Sum f g a -> Sum f g a #
Ord (a :~~: b)	Since: base-4.10.0.0
Instance details Defined in Data.Type.Equality Methods compare :: (a :~~: b) -> (a :~~: b) -> Ordering # (<) :: (a :~~: b) -> (a :~~: b) -> Bool # (<=) :: (a :~~: b) -> (a :~~: b) -> Bool # (>) :: (a :~~: b) -> (a :~~: b) -> Bool # (>=) :: (a :~~: b) -> (a :~~: b) -> Bool # max :: (a :~~: b) -> (a :~~: b) -> a :~~: b # min :: (a :~~: b) -> (a :~~: b) -> a :~~: b #
Ord (f p) => Ord (M1 i c f p)	Since: base-4.7.0.0
Instance details Defined in GHC.Generics Methods compare :: M1 i c f p -> M1 i c f p -> Ordering # (<) :: M1 i c f p -> M1 i c f p -> Bool # (<=) :: M1 i c f p -> M1 i c f p -> Bool # (>) :: M1 i c f p -> M1 i c f p -> Bool # (>=) :: M1 i c f p -> M1 i c f p -> Bool # max :: M1 i c f p -> M1 i c f p -> M1 i c f p # min :: M1 i c f p -> M1 i c f p -> M1 i c f p #
Ord (f (g p)) => Ord ((f :.: g) p)	Since: base-4.7.0.0
Instance details Defined in GHC.Generics Methods compare :: (f :.: g) p -> (f :.: g) p -> Ordering # (<) :: (f :.: g) p -> (f :.: g) p -> Bool # (<=) :: (f :.: g) p -> (f :.: g) p -> Bool # (>) :: (f :.: g) p -> (f :.: g) p -> Bool # (>=) :: (f :.: g) p -> (f :.: g) p -> Bool # max :: (f :.: g) p -> (f :.: g) p -> (f :.: g) p # min :: (f :.: g) p -> (f :.: g) p -> (f :.: g) p #
(Ord a, Ord b, Ord c, Ord d, Ord e) => Ord (a, b, c, d, e)
Instance details Defined in GHC.Classes Methods compare :: (a, b, c, d, e) -> (a, b, c, d, e) -> Ordering # (<) :: (a, b, c, d, e) -> (a, b, c, d, e) -> Bool # (<=) :: (a, b, c, d, e) -> (a, b, c, d, e) -> Bool # (>) :: (a, b, c, d, e) -> (a, b, c, d, e) -> Bool # (>=) :: (a, b, c, d, e) -> (a, b, c, d, e) -> Bool # max :: (a, b, c, d, e) -> (a, b, c, d, e) -> (a, b, c, d, e) # min :: (a, b, c, d, e) -> (a, b, c, d, e) -> (a, b, c, d, e) #
(Ord1 f, Ord1 g, Ord a) => Ord (Compose f g a)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Compose Methods compare :: Compose f g a -> Compose f g a -> Ordering # (<) :: Compose f g a -> Compose f g a -> Bool # (<=) :: Compose f g a -> Compose f g a -> Bool # (>) :: Compose f g a -> Compose f g a -> Bool # (>=) :: Compose f g a -> Compose f g a -> Bool # max :: Compose f g a -> Compose f g a -> Compose f g a # min :: Compose f g a -> Compose f g a -> Compose f g a #
Ord (p a b) => Ord (WrappedBifunctor p a b)
Instance details Defined in Data.Bifunctor.Wrapped Methods compare :: WrappedBifunctor p a b -> WrappedBifunctor p a b -> Ordering # (<) :: WrappedBifunctor p a b -> WrappedBifunctor p a b -> Bool # (<=) :: WrappedBifunctor p a b -> WrappedBifunctor p a b -> Bool # (>) :: WrappedBifunctor p a b -> WrappedBifunctor p a b -> Bool # (>=) :: WrappedBifunctor p a b -> WrappedBifunctor p a b -> Bool # max :: WrappedBifunctor p a b -> WrappedBifunctor p a b -> WrappedBifunctor p a b # min :: WrappedBifunctor p a b -> WrappedBifunctor p a b -> WrappedBifunctor p a b #
Ord (g b) => Ord (Joker g a b)
Instance details Defined in Data.Bifunctor.Joker Methods compare :: Joker g a b -> Joker g a b -> Ordering # (<) :: Joker g a b -> Joker g a b -> Bool # (<=) :: Joker g a b -> Joker g a b -> Bool # (>) :: Joker g a b -> Joker g a b -> Bool # (>=) :: Joker g a b -> Joker g a b -> Bool # max :: Joker g a b -> Joker g a b -> Joker g a b # min :: Joker g a b -> Joker g a b -> Joker g a b #
Ord (p b a) => Ord (Flip p a b)
Instance details Defined in Data.Bifunctor.Flip Methods compare :: Flip p a b -> Flip p a b -> Ordering # (<) :: Flip p a b -> Flip p a b -> Bool # (<=) :: Flip p a b -> Flip p a b -> Bool # (>) :: Flip p a b -> Flip p a b -> Bool # (>=) :: Flip p a b -> Flip p a b -> Bool # max :: Flip p a b -> Flip p a b -> Flip p a b # min :: Flip p a b -> Flip p a b -> Flip p a b #
Ord (f a) => Ord (Clown f a b)
Instance details Defined in Data.Bifunctor.Clown Methods compare :: Clown f a b -> Clown f a b -> Ordering # (<) :: Clown f a b -> Clown f a b -> Bool # (<=) :: Clown f a b -> Clown f a b -> Bool # (>) :: Clown f a b -> Clown f a b -> Bool # (>=) :: Clown f a b -> Clown f a b -> Bool # max :: Clown f a b -> Clown f a b -> Clown f a b # min :: Clown f a b -> Clown f a b -> Clown f a b #
(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f) => Ord (a, b, c, d, e, f)
Instance details Defined in GHC.Classes Methods compare :: (a, b, c, d, e, f) -> (a, b, c, d, e, f) -> Ordering # (<) :: (a, b, c, d, e, f) -> (a, b, c, d, e, f) -> Bool # (<=) :: (a, b, c, d, e, f) -> (a, b, c, d, e, f) -> Bool # (>) :: (a, b, c, d, e, f) -> (a, b, c, d, e, f) -> Bool # (>=) :: (a, b, c, d, e, f) -> (a, b, c, d, e, f) -> Bool # max :: (a, b, c, d, e, f) -> (a, b, c, d, e, f) -> (a, b, c, d, e, f) # min :: (a, b, c, d, e, f) -> (a, b, c, d, e, f) -> (a, b, c, d, e, f) #
(Ord (p a b), Ord (q a b)) => Ord (Sum p q a b)
Instance details Defined in Data.Bifunctor.Sum Methods compare :: Sum p q a b -> Sum p q a b -> Ordering # (<) :: Sum p q a b -> Sum p q a b -> Bool # (<=) :: Sum p q a b -> Sum p q a b -> Bool # (>) :: Sum p q a b -> Sum p q a b -> Bool # (>=) :: Sum p q a b -> Sum p q a b -> Bool # max :: Sum p q a b -> Sum p q a b -> Sum p q a b # min :: Sum p q a b -> Sum p q a b -> Sum p q a b #
(Ord (f a b), Ord (g a b)) => Ord (Product f g a b)
Instance details Defined in Data.Bifunctor.Product Methods compare :: Product f g a b -> Product f g a b -> Ordering # (<) :: Product f g a b -> Product f g a b -> Bool # (<=) :: Product f g a b -> Product f g a b -> Bool # (>) :: Product f g a b -> Product f g a b -> Bool # (>=) :: Product f g a b -> Product f g a b -> Bool # max :: Product f g a b -> Product f g a b -> Product f g a b # min :: Product f g a b -> Product f g a b -> Product f g a b #
(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g) => Ord (a, b, c, d, e, f, g)
Instance details Defined in GHC.Classes Methods compare :: (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) -> Ordering # (<) :: (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) -> Bool # (<=) :: (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) -> Bool # (>) :: (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) -> Bool # (>=) :: (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) -> Bool # max :: (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) # min :: (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) #
Ord (f (p a b)) => Ord (Tannen f p a b)
Instance details Defined in Data.Bifunctor.Tannen Methods compare :: Tannen f p a b -> Tannen f p a b -> Ordering # (<) :: Tannen f p a b -> Tannen f p a b -> Bool # (<=) :: Tannen f p a b -> Tannen f p a b -> Bool # (>) :: Tannen f p a b -> Tannen f p a b -> Bool # (>=) :: Tannen f p a b -> Tannen f p a b -> Bool # max :: Tannen f p a b -> Tannen f p a b -> Tannen f p a b # min :: Tannen f p a b -> Tannen f p a b -> Tannen f p a b #
(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h) => Ord (a, b, c, d, e, f, g, h)
Instance details Defined in GHC.Classes Methods compare :: (a, b, c, d, e, f, g, h) -> (a, b, c, d, e, f, g, h) -> Ordering # (<) :: (a, b, c, d, e, f, g, h) -> (a, b, c, d, e, f, g, h) -> Bool # (<=) :: (a, b, c, d, e, f, g, h) -> (a, b, c, d, e, f, g, h) -> Bool # (>) :: (a, b, c, d, e, f, g, h) -> (a, b, c, d, e, f, g, h) -> Bool # (>=) :: (a, b, c, d, e, f, g, h) -> (a, b, c, d, e, f, g, h) -> Bool # max :: (a, b, c, d, e, f, g, h) -> (a, b, c, d, e, f, g, h) -> (a, b, c, d, e, f, g, h) # min :: (a, b, c, d, e, f, g, h) -> (a, b, c, d, e, f, g, h) -> (a, b, c, d, e, f, g, h) #
(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h, Ord i) => Ord (a, b, c, d, e, f, g, h, i)
Instance details Defined in GHC.Classes Methods compare :: (a, b, c, d, e, f, g, h, i) -> (a, b, c, d, e, f, g, h, i) -> Ordering # (<) :: (a, b, c, d, e, f, g, h, i) -> (a, b, c, d, e, f, g, h, i) -> Bool # (<=) :: (a, b, c, d, e, f, g, h, i) -> (a, b, c, d, e, f, g, h, i) -> Bool # (>) :: (a, b, c, d, e, f, g, h, i) -> (a, b, c, d, e, f, g, h, i) -> Bool # (>=) :: (a, b, c, d, e, f, g, h, i) -> (a, b, c, d, e, f, g, h, i) -> Bool # max :: (a, b, c, d, e, f, g, h, i) -> (a, b, c, d, e, f, g, h, i) -> (a, b, c, d, e, f, g, h, i) # min :: (a, b, c, d, e, f, g, h, i) -> (a, b, c, d, e, f, g, h, i) -> (a, b, c, d, e, f, g, h, i) #
Ord (p (f a) (g b)) => Ord (Biff p f g a b)
Instance details Defined in Data.Bifunctor.Biff Methods compare :: Biff p f g a b -> Biff p f g a b -> Ordering # (<) :: Biff p f g a b -> Biff p f g a b -> Bool # (<=) :: Biff p f g a b -> Biff p f g a b -> Bool # (>) :: Biff p f g a b -> Biff p f g a b -> Bool # (>=) :: Biff p f g a b -> Biff p f g a b -> Bool # max :: Biff p f g a b -> Biff p f g a b -> Biff p f g a b # min :: Biff p f g a b -> Biff p f g a b -> Biff p f g a b #
(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h, Ord i, Ord j) => Ord (a, b, c, d, e, f, g, h, i, j)
Instance details Defined in GHC.Classes Methods compare :: (a, b, c, d, e, f, g, h, i, j) -> (a, b, c, d, e, f, g, h, i, j) -> Ordering # (<) :: (a, b, c, d, e, f, g, h, i, j) -> (a, b, c, d, e, f, g, h, i, j) -> Bool # (<=) :: (a, b, c, d, e, f, g, h, i, j) -> (a, b, c, d, e, f, g, h, i, j) -> Bool # (>) :: (a, b, c, d, e, f, g, h, i, j) -> (a, b, c, d, e, f, g, h, i, j) -> Bool # (>=) :: (a, b, c, d, e, f, g, h, i, j) -> (a, b, c, d, e, f, g, h, i, j) -> Bool # max :: (a, b, c, d, e, f, g, h, i, j) -> (a, b, c, d, e, f, g, h, i, j) -> (a, b, c, d, e, f, g, h, i, j) # min :: (a, b, c, d, e, f, g, h, i, j) -> (a, b, c, d, e, f, g, h, i, j) -> (a, b, c, d, e, f, g, h, i, j) #
(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h, Ord i, Ord j, Ord k) => Ord (a, b, c, d, e, f, g, h, i, j, k)
Instance details Defined in GHC.Classes Methods compare :: (a, b, c, d, e, f, g, h, i, j, k) -> (a, b, c, d, e, f, g, h, i, j, k) -> Ordering # (<) :: (a, b, c, d, e, f, g, h, i, j, k) -> (a, b, c, d, e, f, g, h, i, j, k) -> Bool # (<=) :: (a, b, c, d, e, f, g, h, i, j, k) -> (a, b, c, d, e, f, g, h, i, j, k) -> Bool # (>) :: (a, b, c, d, e, f, g, h, i, j, k) -> (a, b, c, d, e, f, g, h, i, j, k) -> Bool # (>=) :: (a, b, c, d, e, f, g, h, i, j, k) -> (a, b, c, d, e, f, g, h, i, j, k) -> Bool # max :: (a, b, c, d, e, f, g, h, i, j, k) -> (a, b, c, d, e, f, g, h, i, j, k) -> (a, b, c, d, e, f, g, h, i, j, k) # min :: (a, b, c, d, e, f, g, h, i, j, k) -> (a, b, c, d, e, f, g, h, i, j, k) -> (a, b, c, d, e, f, g, h, i, j, k) #
(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h, Ord i, Ord j, Ord k, Ord l) => Ord (a, b, c, d, e, f, g, h, i, j, k, l)
Instance details Defined in GHC.Classes Methods compare :: (a, b, c, d, e, f, g, h, i, j, k, l) -> (a, b, c, d, e, f, g, h, i, j, k, l) -> Ordering # (<) :: (a, b, c, d, e, f, g, h, i, j, k, l) -> (a, b, c, d, e, f, g, h, i, j, k, l) -> Bool # (<=) :: (a, b, c, d, e, f, g, h, i, j, k, l) -> (a, b, c, d, e, f, g, h, i, j, k, l) -> Bool # (>) :: (a, b, c, d, e, f, g, h, i, j, k, l) -> (a, b, c, d, e, f, g, h, i, j, k, l) -> Bool # (>=) :: (a, b, c, d, e, f, g, h, i, j, k, l) -> (a, b, c, d, e, f, g, h, i, j, k, l) -> Bool # max :: (a, b, c, d, e, f, g, h, i, j, k, l) -> (a, b, c, d, e, f, g, h, i, j, k, l) -> (a, b, c, d, e, f, g, h, i, j, k, l) # min :: (a, b, c, d, e, f, g, h, i, j, k, l) -> (a, b, c, d, e, f, g, h, i, j, k, l) -> (a, b, c, d, e, f, g, h, i, j, k, l) #
(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h, Ord i, Ord j, Ord k, Ord l, Ord m) => Ord (a, b, c, d, e, f, g, h, i, j, k, l, m)
Instance details Defined in GHC.Classes Methods compare :: (a, b, c, d, e, f, g, h, i, j, k, l, m) -> (a, b, c, d, e, f, g, h, i, j, k, l, m) -> Ordering # (<) :: (a, b, c, d, e, f, g, h, i, j, k, l, m) -> (a, b, c, d, e, f, g, h, i, j, k, l, m) -> Bool # (<=) :: (a, b, c, d, e, f, g, h, i, j, k, l, m) -> (a, b, c, d, e, f, g, h, i, j, k, l, m) -> Bool # (>) :: (a, b, c, d, e, f, g, h, i, j, k, l, m) -> (a, b, c, d, e, f, g, h, i, j, k, l, m) -> Bool # (>=) :: (a, b, c, d, e, f, g, h, i, j, k, l, m) -> (a, b, c, d, e, f, g, h, i, j, k, l, m) -> Bool # max :: (a, b, c, d, e, f, g, h, i, j, k, l, m) -> (a, b, c, d, e, f, g, h, i, j, k, l, m) -> (a, b, c, d, e, f, g, h, i, j, k, l, m) # min :: (a, b, c, d, e, f, g, h, i, j, k, l, m) -> (a, b, c, d, e, f, g, h, i, j, k, l, m) -> (a, b, c, d, e, f, g, h, i, j, k, l, m) #
(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h, Ord i, Ord j, Ord k, Ord l, Ord m, Ord n) => Ord (a, b, c, d, e, f, g, h, i, j, k, l, m, n)
Instance details Defined in GHC.Classes Methods compare :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> Ordering # (<) :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> Bool # (<=) :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> Bool # (>) :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> Bool # (>=) :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> Bool # max :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n) # min :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n) #
(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h, Ord i, Ord j, Ord k, Ord l, Ord m, Ord n, Ord o) => Ord (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o)
Instance details Defined in GHC.Classes Methods compare :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> Ordering # (<) :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> Bool # (<=) :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> Bool # (>) :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> Bool # (>=) :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> Bool # max :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) # min :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) #

class Read a #

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 Read instance 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 Read will parse only the record-syntax form, and furthermore, the fields must be given in the same order as the original declaration.
The derived Read instance 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 = 5

Note 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 = readListPrecDefault

Why 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:

instance Read T where
  readPrec     = ...
  readListPrec = readListPrecDefault

Minimal complete definition

readsPrec | readPrec

Instances

Read Bool	Since: base-2.1
Instance details Defined in GHC.Read Methods readsPrec :: Int -> ReadS Bool # readList :: ReadS [Bool] # readPrec :: ReadPrec Bool # readListPrec :: ReadPrec [Bool] #
Read Char	Since: base-2.1
Instance details Defined in GHC.Read Methods readsPrec :: Int -> ReadS Char # readList :: ReadS [Char] # readPrec :: ReadPrec Char # readListPrec :: ReadPrec [Char] #
Read Double	Since: base-2.1
Instance details Defined in GHC.Read Methods readsPrec :: Int -> ReadS Double # readList :: ReadS [Double] # readPrec :: ReadPrec Double # readListPrec :: ReadPrec [Double] #
Read Float	Since: base-2.1
Instance details Defined in GHC.Read Methods readsPrec :: Int -> ReadS Float # readList :: ReadS [Float] # readPrec :: ReadPrec Float # readListPrec :: ReadPrec [Float] #
Read Int	Since: base-2.1
Instance details Defined in GHC.Read Methods readsPrec :: Int -> ReadS Int # readList :: ReadS [Int] # readPrec :: ReadPrec Int # readListPrec :: ReadPrec [Int] #
Read Int8	Since: base-2.1
Instance details Defined in GHC.Int Methods readsPrec :: Int -> ReadS Int8 # readList :: ReadS [Int8] # readPrec :: ReadPrec Int8 # readListPrec :: ReadPrec [Int8] #
Read Int16	Since: base-2.1
Instance details Defined in GHC.Int Methods readsPrec :: Int -> ReadS Int16 # readList :: ReadS [Int16] # readPrec :: ReadPrec Int16 # readListPrec :: ReadPrec [Int16] #
Read Int32	Since: base-2.1
Instance details Defined in GHC.Int Methods readsPrec :: Int -> ReadS Int32 # readList :: ReadS [Int32] # readPrec :: ReadPrec Int32 # readListPrec :: ReadPrec [Int32] #
Read Int64	Since: base-2.1
Instance details Defined in GHC.Int Methods readsPrec :: Int -> ReadS Int64 # readList :: ReadS [Int64] # readPrec :: ReadPrec Int64 # readListPrec :: ReadPrec [Int64] #
Read Integer	Since: base-2.1
Instance details Defined in GHC.Read Methods readsPrec :: Int -> ReadS Integer # readList :: ReadS [Integer] # readPrec :: ReadPrec Integer # readListPrec :: ReadPrec [Integer] #
Read Natural	Since: base-4.8.0.0
Instance details Defined in GHC.Read Methods readsPrec :: Int -> ReadS Natural # readList :: ReadS [Natural] # readPrec :: ReadPrec Natural # readListPrec :: ReadPrec [Natural] #
Read Ordering	Since: base-2.1
Instance details Defined in GHC.Read Methods readsPrec :: Int -> ReadS Ordering # readList :: ReadS [Ordering] # readPrec :: ReadPrec Ordering # readListPrec :: ReadPrec [Ordering] #
Read Word	Since: base-4.5.0.0
Instance details Defined in GHC.Read Methods readsPrec :: Int -> ReadS Word # readList :: ReadS [Word] # readPrec :: ReadPrec Word # readListPrec :: ReadPrec [Word] #
Read Word8	Since: base-2.1
Instance details Defined in GHC.Read Methods readsPrec :: Int -> ReadS Word8 # readList :: ReadS [Word8] # readPrec :: ReadPrec Word8 # readListPrec :: ReadPrec [Word8] #
Read Word16	Since: base-2.1
Instance details Defined in GHC.Read Methods readsPrec :: Int -> ReadS Word16 # readList :: ReadS [Word16] # readPrec :: ReadPrec Word16 # readListPrec :: ReadPrec [Word16] #
Read Word32	Since: base-2.1
Instance details Defined in GHC.Read Methods readsPrec :: Int -> ReadS Word32 # readList :: ReadS [Word32] # readPrec :: ReadPrec Word32 # readListPrec :: ReadPrec [Word32] #
Read Word64	Since: base-2.1
Instance details Defined in GHC.Read Methods readsPrec :: Int -> ReadS Word64 # readList :: ReadS [Word64] # readPrec :: ReadPrec Word64 # readListPrec :: ReadPrec [Word64] #
Read ()	Since: base-2.1
Instance details Defined in GHC.Read Methods readsPrec :: Int -> ReadS () # readList :: ReadS [()] # readPrec :: ReadPrec () # readListPrec :: ReadPrec [()] #
Read Version	Since: base-2.1
Instance details Defined in Data.Version Methods readsPrec :: Int -> ReadS Version # readList :: ReadS [Version] # readPrec :: ReadPrec Version # readListPrec :: ReadPrec [Version] #
Read ByteString
Instance details Defined in Data.ByteString.Lazy.Internal Methods readsPrec :: Int -> ReadS ByteString # readList :: ReadS [ByteString] # readPrec :: ReadPrec ByteString # readListPrec :: ReadPrec [ByteString] #
Read ByteString
Instance details 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
Instance details Defined in Data.Semigroup.Internal Methods readsPrec :: Int -> ReadS Any # readList :: ReadS [Any] # readPrec :: ReadPrec Any # readListPrec :: ReadPrec [Any] #
Read All	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods readsPrec :: Int -> ReadS All # readList :: ReadS [All] # readPrec :: ReadPrec All # readListPrec :: ReadPrec [All] #
Read Void	Reading a `Void` value is always a parse error, considering `Void` as a data type with no constructors. Since: base-4.8.0.0
Instance details Defined in Data.Void Methods readsPrec :: Int -> ReadS Void # readList :: ReadS [Void] # readPrec :: ReadPrec Void # readListPrec :: ReadPrec [Void] #
Read ExitCode
Instance details Defined in GHC.IO.Exception Methods readsPrec :: Int -> ReadS ExitCode # readList :: ReadS [ExitCode] # readPrec :: ReadPrec ExitCode # readListPrec :: ReadPrec [ExitCode] #
Read BufferMode	Since: base-4.2.0.0
Instance details 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
Instance details Defined in GHC.IO.Handle.Types Methods readsPrec :: Int -> ReadS Newline # readList :: ReadS [Newline] # readPrec :: ReadPrec Newline # readListPrec :: ReadPrec [Newline] #
Read NewlineMode	Since: base-4.3.0.0
Instance details 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
Instance details Defined in GHC.IO.Device Methods readsPrec :: Int -> ReadS SeekMode # readList :: ReadS [SeekMode] # readPrec :: ReadPrec SeekMode # readListPrec :: ReadPrec [SeekMode] #
Read Fixity	Since: base-4.6.0.0
Instance details Defined in GHC.Generics Methods readsPrec :: Int -> ReadS Fixity # readList :: ReadS [Fixity] # readPrec :: ReadPrec Fixity # readListPrec :: ReadPrec [Fixity] #
Read Associativity	Since: base-4.6.0.0
Instance details Defined in GHC.Generics Methods readsPrec :: Int -> ReadS Associativity # readList :: ReadS [Associativity] # readPrec :: ReadPrec Associativity # readListPrec :: ReadPrec [Associativity] #
Read SourceUnpackedness	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods readsPrec :: Int -> ReadS SourceUnpackedness # readList :: ReadS [SourceUnpackedness] # readPrec :: ReadPrec SourceUnpackedness # readListPrec :: ReadPrec [SourceUnpackedness] #
Read SourceStrictness	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods readsPrec :: Int -> ReadS SourceStrictness # readList :: ReadS [SourceStrictness] # readPrec :: ReadPrec SourceStrictness # readListPrec :: ReadPrec [SourceStrictness] #
Read DecidedStrictness	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods readsPrec :: Int -> ReadS DecidedStrictness # readList :: ReadS [DecidedStrictness] # readPrec :: ReadPrec DecidedStrictness # readListPrec :: ReadPrec [DecidedStrictness] #
Read SomeSymbol	Since: base-4.7.0.0
Instance details 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
Instance details Defined in GHC.TypeNats Methods readsPrec :: Int -> ReadS SomeNat # readList :: ReadS [SomeNat] # readPrec :: ReadPrec SomeNat # readListPrec :: ReadPrec [SomeNat] #
Read CChar
Instance details Defined in Foreign.C.Types Methods readsPrec :: Int -> ReadS CChar # readList :: ReadS [CChar] # readPrec :: ReadPrec CChar # readListPrec :: ReadPrec [CChar] #
Read CSChar
Instance details Defined in Foreign.C.Types Methods readsPrec :: Int -> ReadS CSChar # readList :: ReadS [CSChar] # readPrec :: ReadPrec CSChar # readListPrec :: ReadPrec [CSChar] #
Read CUChar
Instance details Defined in Foreign.C.Types Methods readsPrec :: Int -> ReadS CUChar # readList :: ReadS [CUChar] # readPrec :: ReadPrec CUChar # readListPrec :: ReadPrec [CUChar] #
Read CShort
Instance details Defined in Foreign.C.Types Methods readsPrec :: Int -> ReadS CShort # readList :: ReadS [CShort] # readPrec :: ReadPrec CShort # readListPrec :: ReadPrec [CShort] #
Read CUShort
Instance details Defined in Foreign.C.Types Methods readsPrec :: Int -> ReadS CUShort # readList :: ReadS [CUShort] # readPrec :: ReadPrec CUShort # readListPrec :: ReadPrec [CUShort] #
Read CInt
Instance details Defined in Foreign.C.Types Methods readsPrec :: Int -> ReadS CInt # readList :: ReadS [CInt] # readPrec :: ReadPrec CInt # readListPrec :: ReadPrec [CInt] #
Read CUInt
Instance details Defined in Foreign.C.Types Methods readsPrec :: Int -> ReadS CUInt # readList :: ReadS [CUInt] # readPrec :: ReadPrec CUInt # readListPrec :: ReadPrec [CUInt] #
Read CLong
Instance details Defined in Foreign.C.Types Methods readsPrec :: Int -> ReadS CLong # readList :: ReadS [CLong] # readPrec :: ReadPrec CLong # readListPrec :: ReadPrec [CLong] #
Read CULong
Instance details Defined in Foreign.C.Types Methods readsPrec :: Int -> ReadS CULong # readList :: ReadS [CULong] # readPrec :: ReadPrec CULong # readListPrec :: ReadPrec [CULong] #
Read CLLong
Instance details Defined in Foreign.C.Types Methods readsPrec :: Int -> ReadS CLLong # readList :: ReadS [CLLong] # readPrec :: ReadPrec CLLong # readListPrec :: ReadPrec [CLLong] #
Read CULLong
Instance details Defined in Foreign.C.Types Methods readsPrec :: Int -> ReadS CULLong # readList :: ReadS [CULLong] # readPrec :: ReadPrec CULLong # readListPrec :: ReadPrec [CULLong] #
Read CBool
Instance details Defined in Foreign.C.Types Methods readsPrec :: Int -> ReadS CBool # readList :: ReadS [CBool] # readPrec :: ReadPrec CBool # readListPrec :: ReadPrec [CBool] #
Read CFloat
Instance details Defined in Foreign.C.Types Methods readsPrec :: Int -> ReadS CFloat # readList :: ReadS [CFloat] # readPrec :: ReadPrec CFloat # readListPrec :: ReadPrec [CFloat] #
Read CDouble
Instance details Defined in Foreign.C.Types Methods readsPrec :: Int -> ReadS CDouble # readList :: ReadS [CDouble] # readPrec :: ReadPrec CDouble # readListPrec :: ReadPrec [CDouble] #
Read CPtrdiff
Instance details Defined in Foreign.C.Types Methods readsPrec :: Int -> ReadS CPtrdiff # readList :: ReadS [CPtrdiff] # readPrec :: ReadPrec CPtrdiff # readListPrec :: ReadPrec [CPtrdiff] #
Read CSize
Instance details Defined in Foreign.C.Types Methods readsPrec :: Int -> ReadS CSize # readList :: ReadS [CSize] # readPrec :: ReadPrec CSize # readListPrec :: ReadPrec [CSize] #
Read CWchar
Instance details Defined in Foreign.C.Types Methods readsPrec :: Int -> ReadS CWchar # readList :: ReadS [CWchar] # readPrec :: ReadPrec CWchar # readListPrec :: ReadPrec [CWchar] #
Read CSigAtomic
Instance details Defined in Foreign.C.Types Methods readsPrec :: Int -> ReadS CSigAtomic # readList :: ReadS [CSigAtomic] # readPrec :: ReadPrec CSigAtomic # readListPrec :: ReadPrec [CSigAtomic] #
Read CClock
Instance details Defined in Foreign.C.Types Methods readsPrec :: Int -> ReadS CClock # readList :: ReadS [CClock] # readPrec :: ReadPrec CClock # readListPrec :: ReadPrec [CClock] #
Read CTime
Instance details Defined in Foreign.C.Types Methods readsPrec :: Int -> ReadS CTime # readList :: ReadS [CTime] # readPrec :: ReadPrec CTime # readListPrec :: ReadPrec [CTime] #
Read CUSeconds
Instance details Defined in Foreign.C.Types Methods readsPrec :: Int -> ReadS CUSeconds # readList :: ReadS [CUSeconds] # readPrec :: ReadPrec CUSeconds # readListPrec :: ReadPrec [CUSeconds] #
Read CSUSeconds
Instance details Defined in Foreign.C.Types Methods readsPrec :: Int -> ReadS CSUSeconds # readList :: ReadS [CSUSeconds] # readPrec :: ReadPrec CSUSeconds # readListPrec :: ReadPrec [CSUSeconds] #
Read CIntPtr
Instance details Defined in Foreign.C.Types Methods readsPrec :: Int -> ReadS CIntPtr # readList :: ReadS [CIntPtr] # readPrec :: ReadPrec CIntPtr # readListPrec :: ReadPrec [CIntPtr] #
Read CUIntPtr
Instance details Defined in Foreign.C.Types Methods readsPrec :: Int -> ReadS CUIntPtr # readList :: ReadS [CUIntPtr] # readPrec :: ReadPrec CUIntPtr # readListPrec :: ReadPrec [CUIntPtr] #
Read CIntMax
Instance details Defined in Foreign.C.Types Methods readsPrec :: Int -> ReadS CIntMax # readList :: ReadS [CIntMax] # readPrec :: ReadPrec CIntMax # readListPrec :: ReadPrec [CIntMax] #
Read CUIntMax
Instance details Defined in Foreign.C.Types Methods readsPrec :: Int -> ReadS CUIntMax # readList :: ReadS [CUIntMax] # readPrec :: ReadPrec CUIntMax # readListPrec :: ReadPrec [CUIntMax] #
Read IOMode	Since: base-4.2.0.0
Instance details Defined in GHC.IO.IOMode Methods readsPrec :: Int -> ReadS IOMode # readList :: ReadS [IOMode] # readPrec :: ReadPrec IOMode # readListPrec :: ReadPrec [IOMode] #
Read Lexeme	Since: base-2.1
Instance details Defined in GHC.Read Methods readsPrec :: Int -> ReadS Lexeme # readList :: ReadS [Lexeme] # readPrec :: ReadPrec Lexeme # readListPrec :: ReadPrec [Lexeme] #
Read GeneralCategory	Since: base-2.1
Instance details Defined in GHC.Read Methods readsPrec :: Int -> ReadS GeneralCategory # readList :: ReadS [GeneralCategory] # readPrec :: ReadPrec GeneralCategory # readListPrec :: ReadPrec [GeneralCategory] #
Read IntSet
Instance details Defined in Data.IntSet.Internal Methods readsPrec :: Int -> ReadS IntSet # readList :: ReadS [IntSet] # readPrec :: ReadPrec IntSet # readListPrec :: ReadPrec [IntSet] #
Read RGBGamut
Instance details Defined in Data.Colour.RGB Methods readsPrec :: Int -> ReadS RGBGamut # readList :: ReadS [RGBGamut] # readPrec :: ReadPrec RGBGamut # readListPrec :: ReadPrec [RGBGamut] #
Read Focus
Instance details Defined in Data.FocusList Methods readsPrec :: Int -> ReadS Focus # readList :: ReadS [Focus] # readPrec :: ReadPrec Focus # readListPrec :: ReadPrec [Focus] #
Read LineNum
Instance details Defined in Text.Pretty.Simple.Internal.ExprToOutput Methods readsPrec :: Int -> ReadS LineNum # readList :: ReadS [LineNum] # readPrec :: ReadPrec LineNum # readListPrec :: ReadPrec [LineNum] #
Read NestLevel
Instance details Defined in Text.Pretty.Simple.Internal.Output Methods readsPrec :: Int -> ReadS NestLevel # readList :: ReadS [NestLevel] # readPrec :: ReadPrec NestLevel # readListPrec :: ReadPrec [NestLevel] #
Read OutputType
Instance details Defined in Text.Pretty.Simple.Internal.Output Methods readsPrec :: Int -> ReadS OutputType # readList :: ReadS [OutputType] # readPrec :: ReadPrec OutputType # readListPrec :: ReadPrec [OutputType] #
Read Output
Instance details Defined in Text.Pretty.Simple.Internal.Output Methods readsPrec :: Int -> ReadS Output # readList :: ReadS [Output] # readPrec :: ReadPrec Output # readListPrec :: ReadPrec [Output] #
Read DatatypeVariant
Instance details Defined in Language.Haskell.TH.Datatype Methods readsPrec :: Int -> ReadS DatatypeVariant # readList :: ReadS [DatatypeVariant] # readPrec :: ReadPrec DatatypeVariant # readListPrec :: ReadPrec [DatatypeVariant] #
Read a => Read [a]	Since: base-2.1
Instance details Defined in GHC.Read Methods readsPrec :: Int -> ReadS [a] # readList :: ReadS [[a]] # readPrec :: ReadPrec [a] # readListPrec :: ReadPrec [[a]] #
Read a => Read (Maybe a)	Since: base-2.1
Instance details Defined in GHC.Read Methods readsPrec :: Int -> ReadS (Maybe a) # readList :: ReadS [Maybe a] # readPrec :: ReadPrec (Maybe a) # readListPrec :: ReadPrec [Maybe a] #
(Integral a, Read a) => Read (Ratio a)	Since: base-2.1
Instance details Defined in GHC.Read Methods readsPrec :: Int -> ReadS (Ratio a) # readList :: ReadS [Ratio a] # readPrec :: ReadPrec (Ratio a) # readListPrec :: ReadPrec [Ratio a] #
Read p => Read (Par1 p)	Since: base-4.7.0.0
Instance details Defined in GHC.Generics Methods readsPrec :: Int -> ReadS (Par1 p) # readList :: ReadS [Par1 p] # readPrec :: ReadPrec (Par1 p) # readListPrec :: ReadPrec [Par1 p] #
Read a => Read (Last a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods readsPrec :: Int -> ReadS (Last a) # readList :: ReadS [Last a] # readPrec :: ReadPrec (Last a) # readListPrec :: ReadPrec [Last a] #
Read vertex => Read (SCC vertex)	Since: containers-0.5.9
Instance details Defined in Data.Graph Methods readsPrec :: Int -> ReadS (SCC vertex) # readList :: ReadS [SCC vertex] # readPrec :: ReadPrec (SCC vertex) # readListPrec :: ReadPrec [SCC vertex] #
Read a => Read (Complex a)	Since: base-2.1
Instance details Defined in Data.Complex Methods readsPrec :: Int -> ReadS (Complex a) # readList :: ReadS [Complex a] # readPrec :: ReadPrec (Complex a) # readListPrec :: ReadPrec [Complex a] #
Read a => Read (Min a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods readsPrec :: Int -> ReadS (Min a) # readList :: ReadS [Min a] # readPrec :: ReadPrec (Min a) # readListPrec :: ReadPrec [Min a] #
Read a => Read (Max a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods readsPrec :: Int -> ReadS (Max a) # readList :: ReadS [Max a] # readPrec :: ReadPrec (Max a) # readListPrec :: ReadPrec [Max a] #
Read a => Read (First a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods readsPrec :: Int -> ReadS (First a) # readList :: ReadS [First a] # readPrec :: ReadPrec (First a) # readListPrec :: ReadPrec [First a] #
Read m => Read (WrappedMonoid m)	Since: base-4.9.0.0
Instance details 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
Instance details Defined in Data.Semigroup Methods readsPrec :: Int -> ReadS (Option a) # readList :: ReadS [Option a] # readPrec :: ReadPrec (Option a) # readListPrec :: ReadPrec [Option a] #
Read a => Read (ZipList a)	Since: base-4.7.0.0
Instance details Defined in Control.Applicative Methods readsPrec :: Int -> ReadS (ZipList a) # readList :: ReadS [ZipList a] # readPrec :: ReadPrec (ZipList a) # readListPrec :: ReadPrec [ZipList a] #
Read a => Read (Identity a)	This instance would be equivalent to the derived instances of the `Identity` newtype if the `runIdentity` field were removed Since: base-4.8.0.0
Instance details Defined in Data.Functor.Identity Methods readsPrec :: Int -> ReadS (Identity a) # readList :: ReadS [Identity a] # readPrec :: ReadPrec (Identity a) # readListPrec :: ReadPrec [Identity a] #
Read a => Read (First a)	Since: base-2.1
Instance details Defined in Data.Monoid Methods readsPrec :: Int -> ReadS (First a) # readList :: ReadS [First a] # readPrec :: ReadPrec (First a) # readListPrec :: ReadPrec [First a] #
Read a => Read (Last a)	Since: base-2.1
Instance details Defined in Data.Monoid Methods readsPrec :: Int -> ReadS (Last a) # readList :: ReadS [Last a] # readPrec :: ReadPrec (Last a) # readListPrec :: ReadPrec [Last a] #
Read a => Read (Dual a)	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods readsPrec :: Int -> ReadS (Dual a) # readList :: ReadS [Dual a] # readPrec :: ReadPrec (Dual a) # readListPrec :: ReadPrec [Dual a] #
Read a => Read (Sum a)	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods readsPrec :: Int -> ReadS (Sum a) # readList :: ReadS [Sum a] # readPrec :: ReadPrec (Sum a) # readListPrec :: ReadPrec [Sum a] #
Read a => Read (Product a)	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods readsPrec :: Int -> ReadS (Product a) # readList :: ReadS [Product a] # readPrec :: ReadPrec (Product a) # readListPrec :: ReadPrec [Product a] #
Read a => Read (Down a)	Since: base-4.7.0.0
Instance details Defined in Data.Ord Methods readsPrec :: Int -> ReadS (Down a) # readList :: ReadS [Down a] # readPrec :: ReadPrec (Down a) # readListPrec :: ReadPrec [Down a] #
Read a => Read (NonEmpty a)	Since: base-4.11.0.0
Instance details Defined in GHC.Read Methods readsPrec :: Int -> ReadS (NonEmpty a) # readList :: ReadS [NonEmpty a] # readPrec :: ReadPrec (NonEmpty a) # readListPrec :: ReadPrec [NonEmpty a] #
Read a => Read (Vector a)
Instance details Defined in Data.Vector Methods readsPrec :: Int -> ReadS (Vector a) # readList :: ReadS [Vector a] # readPrec :: ReadPrec (Vector a) # readListPrec :: ReadPrec [Vector a] #
(Eq a, Hashable a, Read a) => Read (HashSet a)
Instance details Defined in Data.HashSet Methods readsPrec :: Int -> ReadS (HashSet a) # readList :: ReadS [HashSet a] # readPrec :: ReadPrec (HashSet a) # readListPrec :: ReadPrec [HashSet a] #
(Read a, Ord a) => Read (Set a)
Instance details Defined in Data.Set.Internal Methods readsPrec :: Int -> ReadS (Set a) # readList :: ReadS [Set a] # readPrec :: ReadPrec (Set a) # readListPrec :: ReadPrec [Set a] #
Read a => Read (Seq a)
Instance details Defined in Data.Sequence.Internal Methods readsPrec :: Int -> ReadS (Seq a) # readList :: ReadS [Seq a] # readPrec :: ReadPrec (Seq a) # readListPrec :: ReadPrec [Seq a] #
Read e => Read (IntMap e)
Instance details Defined in Data.IntMap.Internal Methods readsPrec :: Int -> ReadS (IntMap e) # readList :: ReadS [IntMap e] # readPrec :: ReadPrec (IntMap e) # readListPrec :: ReadPrec [IntMap e] #
Read mono => Read (NonNull mono)
Instance details Defined in Data.NonNull Methods readsPrec :: Int -> ReadS (NonNull mono) # readList :: ReadS [NonNull mono] # readPrec :: ReadPrec (NonNull mono) # readListPrec :: ReadPrec [NonNull mono] #
Read a => Read (DList a)
Instance details Defined in Data.DList Methods readsPrec :: Int -> ReadS (DList a) # readList :: ReadS [DList a] # readPrec :: ReadPrec (DList a) # readListPrec :: ReadPrec [DList a] #
Read a => Read (RGB a)
Instance details Defined in Data.Colour.RGB Methods readsPrec :: Int -> ReadS (RGB a) # readList :: ReadS [RGB a] # readPrec :: ReadPrec (RGB a) # readListPrec :: ReadPrec [RGB a] #
Read a => Read (Tree a)
Instance details Defined in Data.Tree Methods readsPrec :: Int -> ReadS (Tree a) # readList :: ReadS [Tree a] # readPrec :: ReadPrec (Tree a) # readListPrec :: ReadPrec [Tree a] #
Read a => Read (ViewL a)
Instance details Defined in Data.Sequence.Internal Methods readsPrec :: Int -> ReadS (ViewL a) # readList :: ReadS [ViewL a] # readPrec :: ReadPrec (ViewL a) # readListPrec :: ReadPrec [ViewL a] #
Read a => Read (ViewR a)
Instance details Defined in Data.Sequence.Internal Methods readsPrec :: Int -> ReadS (ViewR a) # readList :: ReadS [ViewR a] # readPrec :: ReadPrec (ViewR a) # readListPrec :: ReadPrec [ViewR a] #
(Read a, Prim a) => Read (Vector a)
Instance details Defined in Data.Vector.Primitive Methods readsPrec :: Int -> ReadS (Vector a) # readList :: ReadS [Vector a] # readPrec :: ReadPrec (Vector a) # readListPrec :: ReadPrec [Vector a] #
(Read a, Storable a) => Read (Vector a)
Instance details Defined in Data.Vector.Storable Methods readsPrec :: Int -> ReadS (Vector a) # readList :: ReadS [Vector a] # readPrec :: ReadPrec (Vector a) # readListPrec :: ReadPrec [Vector a] #
Read a => Read (SmallArray a)
Instance details 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)
Instance details Defined in Data.Primitive.Array Methods readsPrec :: Int -> ReadS (Array a) # readList :: ReadS [Array a] # readPrec :: ReadPrec (Array a) # readListPrec :: ReadPrec [Array a] #
Read a => Read (Option a) Source #
Instance details Defined in Termonad.Types Methods readsPrec :: Int -> ReadS (Option a) # readList :: ReadS [Option a] # readPrec :: ReadPrec (Option a) # readListPrec :: ReadPrec [Option a] #
(Read a, Read b) => Read (Either a b)	Since: base-3.0
Instance details Defined in Data.Either Methods readsPrec :: Int -> ReadS (Either a b) # readList :: ReadS [Either a b] # readPrec :: ReadPrec (Either a b) # readListPrec :: ReadPrec [Either a b] #
Read (V1 p)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods readsPrec :: Int -> ReadS (V1 p) # readList :: ReadS [V1 p] # readPrec :: ReadPrec (V1 p) # readListPrec :: ReadPrec [V1 p] #
Read (U1 p)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods readsPrec :: Int -> ReadS (U1 p) # readList :: ReadS [U1 p] # readPrec :: ReadPrec (U1 p) # readListPrec :: ReadPrec [U1 p] #
(Read a, Read b) => Read (a, b)	Since: base-2.1
Instance details Defined in GHC.Read Methods readsPrec :: Int -> ReadS (a, b) # readList :: ReadS [(a, b)] # readPrec :: ReadPrec (a, b) # readListPrec :: ReadPrec [(a, b)] #
(Ord k, Read k, Read e) => Read (Map k e)
Instance details Defined in Data.Map.Internal Methods readsPrec :: Int -> ReadS (Map k e) # readList :: ReadS [Map k e] # readPrec :: ReadPrec (Map k e) # readListPrec :: ReadPrec [Map k e] #
(Eq k, Hashable k, Read k, Read e) => Read (HashMap k e)
Instance details Defined in Data.HashMap.Base Methods readsPrec :: Int -> ReadS (HashMap k e) # readList :: ReadS [HashMap k e] # readPrec :: ReadPrec (HashMap k e) # readListPrec :: ReadPrec [HashMap k e] #
(Ix a, Read a, Read b) => Read (Array a b)	Since: base-2.1
Instance details Defined in GHC.Read Methods readsPrec :: Int -> ReadS (Array a b) # readList :: ReadS [Array a b] # readPrec :: ReadPrec (Array a b) # readListPrec :: ReadPrec [Array a b] #
(Read a, Read b) => Read (Arg a b)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods readsPrec :: Int -> ReadS (Arg a b) # readList :: ReadS [Arg a b] # readPrec :: ReadPrec (Arg a b) # readListPrec :: ReadPrec [Arg a b] #
Read (Proxy t)	Since: base-4.7.0.0
Instance details Defined in Data.Proxy Methods readsPrec :: Int -> ReadS (Proxy t) # readList :: ReadS [Proxy t] # readPrec :: ReadPrec (Proxy t) # readListPrec :: ReadPrec [Proxy t] #
(Read1 m, Read a) => Read (MaybeT m a)
Instance details Defined in Control.Monad.Trans.Maybe Methods readsPrec :: Int -> ReadS (MaybeT m a) # readList :: ReadS [MaybeT m a] # readPrec :: ReadPrec (MaybeT m a) # readListPrec :: ReadPrec [MaybeT m a] #
(Read1 f, Read a) => Read (Cofree f a)
Instance details Defined in Control.Comonad.Cofree Methods readsPrec :: Int -> ReadS (Cofree f a) # readList :: ReadS [Cofree f a] # readPrec :: ReadPrec (Cofree f a) # readListPrec :: ReadPrec [Cofree f a] #
(Read1 f, Read a) => Read (Free f a)
Instance details Defined in Control.Monad.Free Methods readsPrec :: Int -> ReadS (Free f a) # readList :: ReadS [Free f a] # readPrec :: ReadPrec (Free f a) # readListPrec :: ReadPrec [Free f a] #
(Functor f, Read (f a)) => Read (Yoneda f a)
Instance details Defined in Data.Functor.Yoneda Methods readsPrec :: Int -> ReadS (Yoneda f a) # readList :: ReadS [Yoneda f a] # readPrec :: ReadPrec (Yoneda f a) # readListPrec :: ReadPrec [Yoneda f a] #
(Read1 m, Read a) => Read (ListT m a)
Instance details Defined in Control.Monad.Trans.List Methods readsPrec :: Int -> ReadS (ListT m a) # readList :: ReadS [ListT m a] # readPrec :: ReadPrec (ListT m a) # readListPrec :: ReadPrec [ListT m a] #
Read (f p) => Read (Rec1 f p)	Since: base-4.7.0.0
Instance details Defined in GHC.Generics Methods readsPrec :: Int -> ReadS (Rec1 f p) # readList :: ReadS [Rec1 f p] # readPrec :: ReadPrec (Rec1 f p) # readListPrec :: ReadPrec [Rec1 f p] #
(Read a, Read b, Read c) => Read (a, b, c)	Since: base-2.1
Instance details Defined in GHC.Read Methods readsPrec :: Int -> ReadS (a, b, c) # readList :: ReadS [(a, b, c)] # readPrec :: ReadPrec (a, b, c) # readListPrec :: ReadPrec [(a, b, c)] #
Read a => Read (Const a b)	This instance would be equivalent to the derived instances of the `Const` newtype if the `runConst` field were removed Since: base-4.8.0.0
Instance details Defined in Data.Functor.Const Methods readsPrec :: Int -> ReadS (Const a b) # readList :: ReadS [Const a b] # readPrec :: ReadPrec (Const a b) # readListPrec :: ReadPrec [Const a b] #
Read (f a) => Read (Ap f a)	Since: base-4.12.0.0
Instance details Defined in Data.Monoid Methods readsPrec :: Int -> ReadS (Ap f a) # readList :: ReadS [Ap f a] # readPrec :: ReadPrec (Ap f a) # readListPrec :: ReadPrec [Ap f a] #
Read (f a) => Read (Alt f a)	Since: base-4.8.0.0
Instance details Defined in Data.Semigroup.Internal Methods readsPrec :: Int -> ReadS (Alt f a) # readList :: ReadS [Alt f a] # readPrec :: ReadPrec (Alt f a) # readListPrec :: ReadPrec [Alt f a] #
a ~ b => Read (a :~: b)	Since: base-4.7.0.0
Instance details Defined in Data.Type.Equality Methods readsPrec :: Int -> ReadS (a :~: b) # readList :: ReadS [a :~: b] # readPrec :: ReadPrec (a :~: b) # readListPrec :: ReadPrec [a :~: b] #
Read (p a a) => Read (Join p a)
Instance details Defined in Data.Bifunctor.Join Methods readsPrec :: Int -> ReadS (Join p a) # readList :: ReadS [Join p a] # readPrec :: ReadPrec (Join p a) # readListPrec :: ReadPrec [Join p a] #
Read (p (Fix p a) a) => Read (Fix p a)
Instance details Defined in Data.Bifunctor.Fix Methods readsPrec :: Int -> ReadS (Fix p a) # readList :: ReadS [Fix p a] # readPrec :: ReadPrec (Fix p a) # readListPrec :: ReadPrec [Fix p a] #
(Read1 f, Read a) => Read (IdentityT f a)
Instance details Defined in Control.Monad.Trans.Identity Methods readsPrec :: Int -> ReadS (IdentityT f a) # readList :: ReadS [IdentityT f a] # readPrec :: ReadPrec (IdentityT f a) # readListPrec :: ReadPrec [IdentityT f a] #
(Read w, Read1 m, Read a) => Read (WriterT w m a)
Instance details Defined in Control.Monad.Trans.Writer.Strict Methods readsPrec :: Int -> ReadS (WriterT w m a) # readList :: ReadS [WriterT w m a] # readPrec :: ReadPrec (WriterT w m a) # readListPrec :: ReadPrec [WriterT w m a] #
(Read w, Read1 m, Read a) => Read (WriterT w m a)
Instance details Defined in Control.Monad.Trans.Writer.Lazy Methods readsPrec :: Int -> ReadS (WriterT w m a) # readList :: ReadS [WriterT w m a] # readPrec :: ReadPrec (WriterT w m a) # readListPrec :: ReadPrec [WriterT w m a] #
(Read a, Read (f b)) => Read (FreeF f a b)
Instance details Defined in Control.Monad.Trans.Free Methods readsPrec :: Int -> ReadS (FreeF f a b) # readList :: ReadS [FreeF f a b] # readPrec :: ReadPrec (FreeF f a b) # readListPrec :: ReadPrec [FreeF f a b] #
(Read1 f, Read1 m, Read a) => Read (FreeT f m a)
Instance details Defined in Control.Monad.Trans.Free Methods readsPrec :: Int -> ReadS (FreeT f m a) # readList :: ReadS [FreeT f m a] # readPrec :: ReadPrec (FreeT f m a) # readListPrec :: ReadPrec [FreeT f m a] #
(Read a, Read (f b)) => Read (CofreeF f a b)
Instance details Defined in Control.Comonad.Trans.Cofree Methods readsPrec :: Int -> ReadS (CofreeF f a b) # readList :: ReadS [CofreeF f a b] # readPrec :: ReadPrec (CofreeF f a b) # readListPrec :: ReadPrec [CofreeF f a b] #
Read (w (CofreeF f a (CofreeT f w a))) => Read (CofreeT f w a)
Instance details Defined in Control.Comonad.Trans.Cofree Methods readsPrec :: Int -> ReadS (CofreeT f w a) # readList :: ReadS [CofreeT f w a] # readPrec :: ReadPrec (CofreeT f w a) # readListPrec :: ReadPrec [CofreeT f w a] #
(Read e, Read1 m, Read a) => Read (ErrorT e m a)
Instance details Defined in Control.Monad.Trans.Error Methods readsPrec :: Int -> ReadS (ErrorT e m a) # readList :: ReadS [ErrorT e m a] # readPrec :: ReadPrec (ErrorT e m a) # readListPrec :: ReadPrec [ErrorT e m a] #
Read b => Read (Tagged s b)
Instance details Defined in Data.Tagged Methods readsPrec :: Int -> ReadS (Tagged s b) # readList :: ReadS [Tagged s b] # readPrec :: ReadPrec (Tagged s b) # readListPrec :: ReadPrec [Tagged s b] #
Read c => Read (K1 i c p)	Since: base-4.7.0.0
Instance details Defined in GHC.Generics Methods readsPrec :: Int -> ReadS (K1 i c p) # readList :: ReadS [K1 i c p] # readPrec :: ReadPrec (K1 i c p) # readListPrec :: ReadPrec [K1 i c p] #
(Read (f p), Read (g p)) => Read ((f :+: g) p)	Since: base-4.7.0.0
Instance details Defined in GHC.Generics Methods readsPrec :: Int -> ReadS ((f :+: g) p) # readList :: ReadS [(f :+: g) p] # readPrec :: ReadPrec ((f :+: g) p) # readListPrec :: ReadPrec [(f :+: g) p] #
(Read (f p), Read (g p)) => Read ((f :*: g) p)	Since: base-4.7.0.0
Instance details Defined in GHC.Generics Methods readsPrec :: Int -> ReadS ((f :: g) p) # readList :: ReadS [(f :: g) p] # readPrec :: ReadPrec ((f :: g) p) # readListPrec :: ReadPrec [(f :: g) p] #
(Read a, Read b, Read c, Read d) => Read (a, b, c, d)	Since: base-2.1
Instance details Defined in GHC.Read Methods readsPrec :: Int -> ReadS (a, b, c, d) # readList :: ReadS [(a, b, c, d)] # readPrec :: ReadPrec (a, b, c, d) # readListPrec :: ReadPrec [(a, b, c, d)] #
(Read1 f, Read1 g, Read a) => Read (Product f g a)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Product Methods readsPrec :: Int -> ReadS (Product f g a) # readList :: ReadS [Product f g a] # readPrec :: ReadPrec (Product f g a) # readListPrec :: ReadPrec [Product f g a] #
(Read1 f, Read1 g, Read a) => Read (Sum f g a)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Sum Methods readsPrec :: Int -> ReadS (Sum f g a) # readList :: ReadS [Sum f g a] # readPrec :: ReadPrec (Sum f g a) # readListPrec :: ReadPrec [Sum f g a] #
a ~~ b => Read (a :~~: b)	Since: base-4.10.0.0
Instance details Defined in Data.Type.Equality Methods readsPrec :: Int -> ReadS (a :~~: b) # readList :: ReadS [a :~~: b] # readPrec :: ReadPrec (a :~~: b) # readListPrec :: ReadPrec [a :~~: b] #
Read (f p) => Read (M1 i c f p)	Since: base-4.7.0.0
Instance details Defined in GHC.Generics Methods readsPrec :: Int -> ReadS (M1 i c f p) # readList :: ReadS [M1 i c f p] # readPrec :: ReadPrec (M1 i c f p) # readListPrec :: ReadPrec [M1 i c f p] #
Read (f (g p)) => Read ((f :.: g) p)	Since: base-4.7.0.0
Instance details Defined in GHC.Generics Methods readsPrec :: Int -> ReadS ((f :.: g) p) # readList :: ReadS [(f :.: g) p] # readPrec :: ReadPrec ((f :.: g) p) # readListPrec :: ReadPrec [(f :.: g) p] #
(Read a, Read b, Read c, Read d, Read e) => Read (a, b, c, d, e)	Since: base-2.1
Instance details Defined in GHC.Read Methods readsPrec :: Int -> ReadS (a, b, c, d, e) # readList :: ReadS [(a, b, c, d, e)] # readPrec :: ReadPrec (a, b, c, d, e) # readListPrec :: ReadPrec [(a, b, c, d, e)] #
(Read1 f, Read1 g, Read a) => Read (Compose f g a)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Compose Methods readsPrec :: Int -> ReadS (Compose f g a) # readList :: ReadS [Compose f g a] # readPrec :: ReadPrec (Compose f g a) # readListPrec :: ReadPrec [Compose f g a] #
Read (p a b) => Read (WrappedBifunctor p a b)
Instance details 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)
Instance details Defined in Data.Bifunctor.Joker Methods readsPrec :: Int -> ReadS (Joker g a b) # readList :: ReadS [Joker g a b] # readPrec :: ReadPrec (Joker g a b) # readListPrec :: ReadPrec [Joker g a b] #
Read (p b a) => Read (Flip p a b)
Instance details Defined in Data.Bifunctor.Flip Methods readsPrec :: Int -> ReadS (Flip p a b) # readList :: ReadS [Flip p a b] # readPrec :: ReadPrec (Flip p a b) # readListPrec :: ReadPrec [Flip p a b] #
Read (f a) => Read (Clown f a b)
Instance details Defined in Data.Bifunctor.Clown Methods readsPrec :: Int -> ReadS (Clown f a b) # readList :: ReadS [Clown f a b] # readPrec :: ReadPrec (Clown f a b) # readListPrec :: ReadPrec [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
Instance details Defined in GHC.Read Methods readsPrec :: Int -> ReadS (a, b, c, d, e, f) # readList :: ReadS [(a, b, c, d, e, f)] # readPrec :: ReadPrec (a, b, c, d, e, f) # readListPrec :: ReadPrec [(a, b, c, d, e, f)] #
(Read (p a b), Read (q a b)) => Read (Sum p q a b)
Instance details Defined in Data.Bifunctor.Sum Methods readsPrec :: Int -> ReadS (Sum p q a b) # readList :: ReadS [Sum p q a b] # readPrec :: ReadPrec (Sum p q a b) # readListPrec :: ReadPrec [Sum p q a b] #
(Read (f a b), Read (g a b)) => Read (Product f g a b)
Instance details Defined in Data.Bifunctor.Product Methods readsPrec :: Int -> ReadS (Product f g a b) # readList :: ReadS [Product f g a b] # readPrec :: ReadPrec (Product f g a b) # readListPrec :: ReadPrec [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
Instance details Defined in GHC.Read Methods readsPrec :: Int -> ReadS (a, b, c, d, e, f, g) # readList :: ReadS [(a, b, c, d, e, f, g)] # readPrec :: ReadPrec (a, b, c, d, e, f, g) # readListPrec :: ReadPrec [(a, b, c, d, e, f, g)] #
Read (f (p a b)) => Read (Tannen f p a b)
Instance details Defined in Data.Bifunctor.Tannen Methods readsPrec :: Int -> ReadS (Tannen f p a b) # readList :: ReadS [Tannen f p a b] # readPrec :: ReadPrec (Tannen f p a b) # readListPrec :: ReadPrec [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
Instance details Defined in GHC.Read Methods readsPrec :: Int -> ReadS (a, b, c, d, e, f, g, h) # readList :: ReadS [(a, b, c, d, e, f, g, h)] # readPrec :: ReadPrec (a, b, c, d, e, f, g, h) # readListPrec :: ReadPrec [(a, b, c, d, e, f, g, h)] #
(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
Instance details Defined in GHC.Read Methods readsPrec :: Int -> ReadS (a, b, c, d, e, f, g, h, i) # readList :: ReadS [(a, b, c, d, e, f, g, h, i)] # readPrec :: ReadPrec (a, b, c, d, e, f, g, h, i) # readListPrec :: ReadPrec [(a, b, c, d, e, f, g, h, i)] #
Read (p (f a) (g b)) => Read (Biff p f g a b)
Instance details Defined in Data.Bifunctor.Biff Methods readsPrec :: Int -> ReadS (Biff p f g a b) # readList :: ReadS [Biff p f g a b] # readPrec :: ReadPrec (Biff p f g a b) # readListPrec :: ReadPrec [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
Instance details Defined in GHC.Read Methods readsPrec :: Int -> ReadS (a, b, c, d, e, f, g, h, i, j) # readList :: ReadS [(a, b, c, d, e, f, g, h, i, j)] # readPrec :: ReadPrec (a, b, c, d, e, f, g, h, i, j) # readListPrec :: ReadPrec [(a, b, c, d, e, f, g, h, i, j)] #
(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
Instance details Defined in GHC.Read Methods readsPrec :: Int -> ReadS (a, b, c, d, e, f, g, h, i, j, k) # readList :: ReadS [(a, b, c, d, e, f, g, h, i, j, k)] # readPrec :: ReadPrec (a, b, c, d, e, f, g, h, i, j, k) # readListPrec :: ReadPrec [(a, b, c, d, e, f, g, h, i, j, k)] #
(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
Instance details Defined in GHC.Read Methods readsPrec :: Int -> ReadS (a, b, c, d, e, f, g, h, i, j, k, l) # readList :: ReadS [(a, b, c, d, e, f, g, h, i, j, k, l)] # readPrec :: ReadPrec (a, b, c, d, e, f, g, h, i, j, k, l) # readListPrec :: ReadPrec [(a, b, c, d, e, f, g, h, i, j, k, l)] #
(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
Instance details Defined in GHC.Read Methods readsPrec :: Int -> ReadS (a, b, c, d, e, f, g, h, i, j, k, l, m) # readList :: ReadS [(a, b, c, d, e, f, g, h, i, j, k, l, m)] # readPrec :: ReadPrec (a, b, c, d, e, f, g, h, i, j, k, l, m) # readListPrec :: ReadPrec [(a, b, c, d, e, f, g, h, i, j, k, l, m)] #
(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
Instance details Defined in GHC.Read Methods readsPrec :: Int -> ReadS (a, b, c, d, e, f, g, h, i, j, k, l, m, n) # readList :: ReadS [(a, b, c, d, e, f, g, h, i, j, k, l, m, n)] # readPrec :: ReadPrec (a, b, c, d, e, f, g, h, i, j, k, l, m, n) # readListPrec :: ReadPrec [(a, b, c, d, e, f, g, h, i, j, k, l, m, n)] #
(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
Instance details Defined in GHC.Read Methods readsPrec :: Int -> ReadS (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) # readList :: ReadS [(a, b, c, d, e, f, g, h, i, j, k, l, m, n, o)] # readPrec :: ReadPrec (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) # readListPrec :: ReadPrec [(a, b, c, d, e, f, g, h, i, j, k, l, m, n, o)] #

class (Num a, Ord a) => Real a where #

Methods

toRational :: a -> Rational #

the rational equivalent of its real argument with full precision

Instances

Real Int	Since: base-2.0.1
Instance details Defined in GHC.Real Methods toRational :: Int -> Rational #
Real Int8	Since: base-2.1
Instance details Defined in GHC.Int Methods toRational :: Int8 -> Rational #
Real Int16	Since: base-2.1
Instance details Defined in GHC.Int Methods toRational :: Int16 -> Rational #
Real Int32	Since: base-2.1
Instance details Defined in GHC.Int Methods toRational :: Int32 -> Rational #
Real Int64	Since: base-2.1
Instance details Defined in GHC.Int Methods toRational :: Int64 -> Rational #
Real Integer	Since: base-2.0.1
Instance details Defined in GHC.Real Methods toRational :: Integer -> Rational #
Real Natural	Since: base-4.8.0.0
Instance details Defined in GHC.Real Methods toRational :: Natural -> Rational #
Real Word	Since: base-2.1
Instance details Defined in GHC.Real Methods toRational :: Word -> Rational #
Real Word8	Since: base-2.1
Instance details Defined in GHC.Word Methods toRational :: Word8 -> Rational #
Real Word16	Since: base-2.1
Instance details Defined in GHC.Word Methods toRational :: Word16 -> Rational #
Real Word32	Since: base-2.1
Instance details Defined in GHC.Word Methods toRational :: Word32 -> Rational #
Real Word64	Since: base-2.1
Instance details Defined in GHC.Word Methods toRational :: Word64 -> Rational #
Real CChar
Instance details Defined in Foreign.C.Types Methods toRational :: CChar -> Rational #
Real CSChar
Instance details Defined in Foreign.C.Types Methods toRational :: CSChar -> Rational #
Real CUChar
Instance details Defined in Foreign.C.Types Methods toRational :: CUChar -> Rational #
Real CShort
Instance details Defined in Foreign.C.Types Methods toRational :: CShort -> Rational #
Real CUShort
Instance details Defined in Foreign.C.Types Methods toRational :: CUShort -> Rational #
Real CInt
Instance details Defined in Foreign.C.Types Methods toRational :: CInt -> Rational #
Real CUInt
Instance details Defined in Foreign.C.Types Methods toRational :: CUInt -> Rational #
Real CLong
Instance details Defined in Foreign.C.Types Methods toRational :: CLong -> Rational #
Real CULong
Instance details Defined in Foreign.C.Types Methods toRational :: CULong -> Rational #
Real CLLong
Instance details Defined in Foreign.C.Types Methods toRational :: CLLong -> Rational #
Real CULLong
Instance details Defined in Foreign.C.Types Methods toRational :: CULLong -> Rational #
Real CBool
Instance details Defined in Foreign.C.Types Methods toRational :: CBool -> Rational #
Real CFloat
Instance details Defined in Foreign.C.Types Methods toRational :: CFloat -> Rational #
Real CDouble
Instance details Defined in Foreign.C.Types Methods toRational :: CDouble -> Rational #
Real CPtrdiff
Instance details Defined in Foreign.C.Types Methods toRational :: CPtrdiff -> Rational #
Real CSize
Instance details Defined in Foreign.C.Types Methods toRational :: CSize -> Rational #
Real CWchar
Instance details Defined in Foreign.C.Types Methods toRational :: CWchar -> Rational #
Real CSigAtomic
Instance details Defined in Foreign.C.Types Methods toRational :: CSigAtomic -> Rational #
Real CClock
Instance details Defined in Foreign.C.Types Methods toRational :: CClock -> Rational #
Real CTime
Instance details Defined in Foreign.C.Types Methods toRational :: CTime -> Rational #
Real CUSeconds
Instance details Defined in Foreign.C.Types Methods toRational :: CUSeconds -> Rational #
Real CSUSeconds
Instance details Defined in Foreign.C.Types Methods toRational :: CSUSeconds -> Rational #
Real CIntPtr
Instance details Defined in Foreign.C.Types Methods toRational :: CIntPtr -> Rational #
Real CUIntPtr
Instance details Defined in Foreign.C.Types Methods toRational :: CUIntPtr -> Rational #
Real CIntMax
Instance details Defined in Foreign.C.Types Methods toRational :: CIntMax -> Rational #
Real CUIntMax
Instance details Defined in Foreign.C.Types Methods toRational :: CUIntMax -> Rational #
Real DiffTime
Instance details Defined in Data.Time.Clock.Internal.DiffTime Methods toRational :: DiffTime -> Rational #
Integral a => Real (Ratio a)	Since: base-2.0.1
Instance details Defined in GHC.Real Methods toRational :: Ratio a -> Rational #
Real a => Real (Identity a)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Identity Methods toRational :: Identity a -> Rational #
Real a => Real (Const a b)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Const Methods toRational :: Const a b -> Rational #
Real a => Real (Tagged s a)
Instance details Defined in Data.Tagged Methods toRational :: Tagged s a -> Rational #

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 yields (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) <= abs m < b^d, where d is the value of floatDigits x. In particular, decodeFloat 0 = (0,0). If the type contains a negative zero, also decodeFloat (-0.0) = (0,0). The result of decodeFloat x is unspecified if either of isNaN x or isInfinite x is True.

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) = x. encodeFloat m n is one of the two closest representable floating-point numbers to m*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 :: a -> Int #

exponent corresponds to the second component of decodeFloat. exponent 0 = 0 and for finite nonzero x, exponent x = snd (decodeFloat x) + floatDigits x. If x is a finite floating-point number, it is equal in value to significand x * b ^^ exponent x, where b 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

isNaN :: a -> Bool #

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

isIEEE :: a -> Bool #

True if the argument is an IEEE floating point number

atan2 :: a -> a -> a #

a version of arctangent taking two real floating-point arguments. For real floating x and y, atan2 y x computes the angle (from the positive x-axis) of the vector from the origin to the point (x,y). atan2 y x returns a value in the range [-pi, pi]. It follows the Common Lisp semantics for the origin when signed zeroes are supported. atan2 y 1, with y in a type that is RealFloat, should return the same value as atan y. A default definition of atan2 is provided, but implementors can provide a more accurate implementation.

Instances

RealFloat Double	Since: base-2.1
Instance details Defined in GHC.Float Methods floatRadix :: Double -> Integer # floatDigits :: Double -> Int # floatRange :: Double -> (Int, Int) # decodeFloat :: Double -> (Integer, Int) # encodeFloat :: Integer -> Int -> Double # exponent :: Double -> Int # significand :: Double -> Double # scaleFloat :: Int -> Double -> Double # isNaN :: Double -> Bool # isInfinite :: Double -> Bool # isDenormalized :: Double -> Bool # isNegativeZero :: Double -> Bool # isIEEE :: Double -> Bool # atan2 :: Double -> Double -> Double #
RealFloat Float	Since: base-2.1
Instance details Defined in GHC.Float Methods floatRadix :: Float -> Integer # floatDigits :: Float -> Int # floatRange :: Float -> (Int, Int) # decodeFloat :: Float -> (Integer, Int) # encodeFloat :: Integer -> Int -> Float # exponent :: Float -> Int # significand :: Float -> Float # scaleFloat :: Int -> Float -> Float # isNaN :: Float -> Bool # isInfinite :: Float -> Bool # isDenormalized :: Float -> Bool # isNegativeZero :: Float -> Bool # isIEEE :: Float -> Bool # atan2 :: Float -> Float -> Float #
RealFloat CFloat
Instance details Defined in Foreign.C.Types Methods floatRadix :: CFloat -> Integer # floatDigits :: CFloat -> Int # floatRange :: CFloat -> (Int, Int) # decodeFloat :: CFloat -> (Integer, Int) # encodeFloat :: Integer -> Int -> CFloat # exponent :: CFloat -> Int # significand :: CFloat -> CFloat # scaleFloat :: Int -> CFloat -> CFloat # isNaN :: CFloat -> Bool # isInfinite :: CFloat -> Bool # isDenormalized :: CFloat -> Bool # isNegativeZero :: CFloat -> Bool # isIEEE :: CFloat -> Bool # atan2 :: CFloat -> CFloat -> CFloat #
RealFloat CDouble
Instance details Defined in Foreign.C.Types Methods floatRadix :: CDouble -> Integer # floatDigits :: CDouble -> Int # floatRange :: CDouble -> (Int, Int) # decodeFloat :: CDouble -> (Integer, Int) # encodeFloat :: Integer -> Int -> CDouble # exponent :: CDouble -> Int # significand :: CDouble -> CDouble # scaleFloat :: Int -> CDouble -> CDouble # isNaN :: CDouble -> Bool # isInfinite :: CDouble -> Bool # isDenormalized :: CDouble -> Bool # isNegativeZero :: CDouble -> Bool # isIEEE :: CDouble -> Bool # atan2 :: CDouble -> CDouble -> CDouble #
RealFloat a => RealFloat (Identity a)	Since: base-4.9.0.0
Instance details 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 # isNaN :: Identity a -> Bool # isInfinite :: Identity a -> Bool # isDenormalized :: Identity a -> Bool # isNegativeZero :: Identity a -> Bool # isIEEE :: Identity a -> Bool # atan2 :: Identity a -> Identity a -> Identity a #
RealFloat a => RealFloat (Const a b)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Const Methods floatRadix :: Const a b -> Integer # floatDigits :: Const a b -> Int # floatRange :: Const a b -> (Int, Int) # decodeFloat :: Const a b -> (Integer, Int) # encodeFloat :: Integer -> Int -> Const a b # exponent :: Const a b -> Int # significand :: Const a b -> Const a b # scaleFloat :: Int -> Const a b -> Const a b # isNaN :: Const a b -> Bool # isInfinite :: Const a b -> Bool # isDenormalized :: Const a b -> Bool # isNegativeZero :: Const a b -> Bool # isIEEE :: Const a b -> Bool # atan2 :: Const a b -> Const a b -> Const a b #
RealFloat a => RealFloat (Tagged s a)
Instance details Defined in Data.Tagged Methods floatRadix :: Tagged s a -> Integer # floatDigits :: Tagged s a -> Int # floatRange :: Tagged s a -> (Int, Int) # decodeFloat :: Tagged s a -> (Integer, Int) # encodeFloat :: Integer -> Int -> Tagged s a # exponent :: Tagged s a -> Int # significand :: Tagged s a -> Tagged s a # scaleFloat :: Int -> Tagged s a -> Tagged s a # isNaN :: Tagged s a -> Bool # isInfinite :: Tagged s a -> Bool # isDenormalized :: Tagged s a -> Bool # isNegativeZero :: Tagged s a -> Bool # isIEEE :: Tagged s a -> Bool # atan2 :: Tagged s a -> Tagged s a -> Tagged s a #

class (Real a, Fractional a) => RealFrac a where #

Extracting components of fractions.

Minimal complete definition

properFraction

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:

n is an integral number with the same sign as x; and
f is a fraction with the same type and sign as x, and with absolute value less than 1.

The default definitions of the ceiling, floor, truncate and round functions are in terms of properFraction.

truncate :: Integral b => a -> b #

truncate x returns the integer nearest x between zero and x

round :: Integral b => a -> b #

round x returns the nearest integer to x; the even integer if x is equidistant between two integers

ceiling :: Integral b => a -> b #

ceiling x returns the least integer not less than x

floor :: Integral b => a -> b #

floor x returns the greatest integer not greater than x

Instances

RealFrac CFloat
Instance details Defined in Foreign.C.Types Methods properFraction :: Integral b => CFloat -> (b, CFloat) # truncate :: Integral b => CFloat -> b # round :: Integral b => CFloat -> b # ceiling :: Integral b => CFloat -> b # floor :: Integral b => CFloat -> b #
RealFrac CDouble
Instance details Defined in Foreign.C.Types Methods properFraction :: Integral b => CDouble -> (b, CDouble) # truncate :: Integral b => CDouble -> b # round :: Integral b => CDouble -> b # ceiling :: Integral b => CDouble -> b # floor :: Integral b => CDouble -> b #
RealFrac DiffTime
Instance details Defined in Data.Time.Clock.Internal.DiffTime Methods properFraction :: Integral b => DiffTime -> (b, DiffTime) # truncate :: Integral b => DiffTime -> b # round :: Integral b => DiffTime -> b # ceiling :: Integral b => DiffTime -> b # floor :: Integral b => DiffTime -> b #
Integral a => RealFrac (Ratio a)	Since: base-2.0.1
Instance details Defined in GHC.Real Methods properFraction :: Integral b => Ratio a -> (b, Ratio a) # truncate :: Integral b => Ratio a -> b # round :: Integral b => Ratio a -> b # ceiling :: Integral b => Ratio a -> b # floor :: Integral b => Ratio a -> b #
RealFrac a => RealFrac (Identity a)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Identity Methods properFraction :: Integral b => Identity a -> (b, Identity a) # truncate :: Integral b => Identity a -> b # round :: Integral b => Identity a -> b # ceiling :: Integral b => Identity a -> b # floor :: Integral b => Identity a -> b #
RealFrac a => RealFrac (Const a b)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Const Methods properFraction :: Integral b0 => Const a b -> (b0, Const a b) # truncate :: Integral b0 => Const a b -> b0 # round :: Integral b0 => Const a b -> b0 # ceiling :: Integral b0 => Const a b -> b0 # floor :: Integral b0 => Const a b -> b0 #
RealFrac a => RealFrac (Tagged s a)
Instance details Defined in Data.Tagged Methods properFraction :: Integral b => Tagged s a -> (b, Tagged s a) # truncate :: Integral b => Tagged s a -> b # round :: Integral b => Tagged s a -> b # ceiling :: Integral b => Tagged s a -> b # floor :: Integral b => Tagged s a -> b #

class Show a where #

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 show is 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 showsPrec will produce infix applications of the constructor.
the representation will be enclosed in parentheses if the precedence of the top-level constructor in x is less than d (associativity is ignored). Thus, if d is 0 then the result is never surrounded in parentheses; if d is 11 it is always surrounded in parentheses, unless it is an atomic expression.
If the constructor is defined using record syntax, then show will 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 = 5

Note that right-associativity of :^: is ignored. For example,

show (Leaf 1 :^: Leaf 2 :^: Leaf 3) produces the string "Leaf 1 :^: (Leaf 2 :^: Leaf 3)".

Minimal complete definition

showsPrec | show

Methods

showsPrec #

Arguments

:: Int	the operator precedence of the enclosing context (a number from `0` to `11`). Function application has precedence `10`.
-> a	the value to be converted to a `String`
-> 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:

(x,"") is an element of (readsPrec d (showsPrec d x "")).

That is, readsPrec parses the string produced by showsPrec, and delivers the value that showsPrec started with.

show :: a -> String #

A specialised variant of showsPrec, using precedence context zero, and returning an ordinary String.

showList :: [a] -> ShowS #

The method showList is provided to allow the programmer to give a specialised way of showing lists of values. For example, this is used by the predefined Show instance of the Char type, where values of type String should be shown in double quotes, rather than between square brackets.

Instances

Show Bool	Since: base-2.1
Instance details Defined in GHC.Show Methods showsPrec :: Int -> Bool -> ShowS # show :: Bool -> String # showList :: [Bool] -> ShowS #
Show Char	Since: base-2.1
Instance details Defined in GHC.Show Methods showsPrec :: Int -> Char -> ShowS # show :: Char -> String # showList :: [Char] -> ShowS #
Show Int	Since: base-2.1
Instance details Defined in GHC.Show Methods showsPrec :: Int -> Int -> ShowS # show :: Int -> String # showList :: [Int] -> ShowS #
Show Int8	Since: base-2.1
Instance details Defined in GHC.Int Methods showsPrec :: Int -> Int8 -> ShowS # show :: Int8 -> String # showList :: [Int8] -> ShowS #
Show Int16	Since: base-2.1
Instance details Defined in GHC.Int Methods showsPrec :: Int -> Int16 -> ShowS # show :: Int16 -> String # showList :: [Int16] -> ShowS #
Show Int32	Since: base-2.1
Instance details Defined in GHC.Int Methods showsPrec :: Int -> Int32 -> ShowS # show :: Int32 -> String # showList :: [Int32] -> ShowS #
Show Int64	Since: base-2.1
Instance details Defined in GHC.Int Methods showsPrec :: Int -> Int64 -> ShowS # show :: Int64 -> String # showList :: [Int64] -> ShowS #
Show Integer	Since: base-2.1
Instance details Defined in GHC.Show Methods showsPrec :: Int -> Integer -> ShowS # show :: Integer -> String # showList :: [Integer] -> ShowS #
Show Natural	Since: base-4.8.0.0
Instance details Defined in GHC.Show Methods showsPrec :: Int -> Natural -> ShowS # show :: Natural -> String # showList :: [Natural] -> ShowS #
Show Ordering	Since: base-2.1
Instance details Defined in GHC.Show Methods showsPrec :: Int -> Ordering -> ShowS # show :: Ordering -> String # showList :: [Ordering] -> ShowS #
Show Word	Since: base-2.1
Instance details Defined in GHC.Show Methods showsPrec :: Int -> Word -> ShowS # show :: Word -> String # showList :: [Word] -> ShowS #
Show Word8	Since: base-2.1
Instance details Defined in GHC.Word Methods showsPrec :: Int -> Word8 -> ShowS # show :: Word8 -> String # showList :: [Word8] -> ShowS #
Show Word16	Since: base-2.1
Instance details Defined in GHC.Word Methods showsPrec :: Int -> Word16 -> ShowS # show :: Word16 -> String # showList :: [Word16] -> ShowS #
Show Word32	Since: base-2.1
Instance details Defined in GHC.Word Methods showsPrec :: Int -> Word32 -> ShowS # show :: Word32 -> String # showList :: [Word32] -> ShowS #
Show Word64	Since: base-2.1
Instance details Defined in GHC.Word Methods showsPrec :: Int -> Word64 -> ShowS # show :: Word64 -> String # showList :: [Word64] -> ShowS #
Show RuntimeRep	Since: base-4.11.0.0
Instance details Defined in GHC.Show Methods showsPrec :: Int -> RuntimeRep -> ShowS # show :: RuntimeRep -> String # showList :: [RuntimeRep] -> ShowS #
Show VecCount	Since: base-4.11.0.0
Instance details Defined in GHC.Show Methods showsPrec :: Int -> VecCount -> ShowS # show :: VecCount -> String # showList :: [VecCount] -> ShowS #
Show VecElem	Since: base-4.11.0.0
Instance details Defined in GHC.Show Methods showsPrec :: Int -> VecElem -> ShowS # show :: VecElem -> String # showList :: [VecElem] -> ShowS #
Show CallStack	Since: base-4.9.0.0
Instance details Defined in GHC.Show Methods showsPrec :: Int -> CallStack -> ShowS # show :: CallStack -> String # showList :: [CallStack] -> ShowS #
Show SomeTypeRep	Since: base-4.10.0.0
Instance details Defined in Data.Typeable.Internal Methods showsPrec :: Int -> SomeTypeRep -> ShowS # show :: SomeTypeRep -> String # showList :: [SomeTypeRep] -> ShowS #
Show Exp
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Exp -> ShowS # show :: Exp -> String # showList :: [Exp] -> ShowS #
Show Match
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Match -> ShowS # show :: Match -> String # showList :: [Match] -> ShowS #
Show Clause
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Clause -> ShowS # show :: Clause -> String # showList :: [Clause] -> ShowS #
Show Pat
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Pat -> ShowS # show :: Pat -> String # showList :: [Pat] -> ShowS #
Show Type
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Type -> ShowS # show :: Type -> String # showList :: [Type] -> ShowS #
Show Dec
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Dec -> ShowS # show :: Dec -> String # showList :: [Dec] -> ShowS #
Show Name
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Name -> ShowS # show :: Name -> String # showList :: [Name] -> ShowS #
Show FunDep
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> FunDep -> ShowS # show :: FunDep -> String # showList :: [FunDep] -> ShowS #
Show InjectivityAnn
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> InjectivityAnn -> ShowS # show :: InjectivityAnn -> String # showList :: [InjectivityAnn] -> ShowS #
Show Overlap
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Overlap -> ShowS # show :: Overlap -> String # showList :: [Overlap] -> ShowS #
Show ()	Since: base-2.1
Instance details Defined in GHC.Show Methods showsPrec :: Int -> () -> ShowS # show :: () -> String # showList :: [()] -> ShowS #
Show TyCon	Since: base-2.1
Instance details Defined in GHC.Show Methods showsPrec :: Int -> TyCon -> ShowS # show :: TyCon -> String # showList :: [TyCon] -> ShowS #
Show Module	Since: base-4.9.0.0
Instance details Defined in GHC.Show Methods showsPrec :: Int -> Module -> ShowS # show :: Module -> String # showList :: [Module] -> ShowS #
Show TrName	Since: base-4.9.0.0
Instance details Defined in GHC.Show Methods showsPrec :: Int -> TrName -> ShowS # show :: TrName -> String # showList :: [TrName] -> ShowS #
Show KindRep
Instance details Defined in GHC.Show Methods showsPrec :: Int -> KindRep -> ShowS # show :: KindRep -> String # showList :: [KindRep] -> ShowS #
Show TypeLitSort	Since: base-4.11.0.0
Instance details Defined in GHC.Show Methods showsPrec :: Int -> TypeLitSort -> ShowS # show :: TypeLitSort -> String # showList :: [TypeLitSort] -> ShowS #
Show Peano Source #
Instance details Defined in Termonad.Config.Vec Methods showsPrec :: Int -> Peano -> ShowS # show :: Peano -> String # showList :: [Peano] -> ShowS #
Show Doc
Instance details Defined in Text.PrettyPrint.HughesPJ Methods showsPrec :: Int -> Doc -> ShowS # show :: Doc -> String # showList :: [Doc] -> ShowS #
Show Version	Since: base-2.1
Instance details Defined in Data.Version Methods showsPrec :: Int -> Version -> ShowS # show :: Version -> String # showList :: [Version] -> ShowS #
Show ByteString
Instance details Defined in Data.ByteString.Lazy.Internal Methods showsPrec :: Int -> ByteString -> ShowS # show :: ByteString -> String # showList :: [ByteString] -> ShowS #
Show ByteString
Instance details Defined in Data.ByteString.Internal Methods showsPrec :: Int -> ByteString -> ShowS # show :: ByteString -> String # showList :: [ByteString] -> ShowS #
Show Any	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods showsPrec :: Int -> Any -> ShowS # show :: Any -> String # showList :: [Any] -> ShowS #
Show All	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods showsPrec :: Int -> All -> ShowS # show :: All -> String # showList :: [All] -> ShowS #
Show Con
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Con -> ShowS # show :: Con -> String # showList :: [Con] -> ShowS #
Show Builder
Instance details Defined in Data.Text.Internal.Builder Methods showsPrec :: Int -> Builder -> ShowS # show :: Builder -> String # showList :: [Builder] -> ShowS #
Show Handle	Since: base-4.1.0.0
Instance details Defined in GHC.IO.Handle.Types Methods showsPrec :: Int -> Handle -> ShowS # show :: Handle -> String # showList :: [Handle] -> ShowS #
Show ThreadId	Since: base-4.2.0.0
Instance details Defined in GHC.Conc.Sync Methods showsPrec :: Int -> ThreadId -> ShowS # show :: ThreadId -> String # showList :: [ThreadId] -> ShowS #
Show AsyncCancelled
Instance details Defined in Control.Concurrent.Async Methods showsPrec :: Int -> AsyncCancelled -> ShowS # show :: AsyncCancelled -> String # showList :: [AsyncCancelled] -> ShowS #
Show ExceptionInLinkedThread
Instance details Defined in Control.Concurrent.Async Methods showsPrec :: Int -> ExceptionInLinkedThread -> ShowS # show :: ExceptionInLinkedThread -> String # showList :: [ExceptionInLinkedThread] -> ShowS #
Show Pos
Instance details Defined in Data.Attoparsec.Internal.Types Methods showsPrec :: Int -> Pos -> ShowS # show :: Pos -> String # showList :: [Pos] -> ShowS #
Show More
Instance details Defined in Data.Attoparsec.Internal.Types Methods showsPrec :: Int -> More -> ShowS # show :: More -> String # showList :: [More] -> ShowS #
Show HandleType	Since: base-4.1.0.0
Instance details Defined in GHC.IO.Handle.Types Methods showsPrec :: Int -> HandleType -> ShowS # show :: HandleType -> String # showList :: [HandleType] -> ShowS #
Show Void	Since: base-4.8.0.0
Instance details Defined in Data.Void Methods showsPrec :: Int -> Void -> ShowS # show :: Void -> String # showList :: [Void] -> ShowS #
Show BlockReason	Since: base-4.3.0.0
Instance details Defined in GHC.Conc.Sync Methods showsPrec :: Int -> BlockReason -> ShowS # show :: BlockReason -> String # showList :: [BlockReason] -> ShowS #
Show ThreadStatus	Since: base-4.3.0.0
Instance details Defined in GHC.Conc.Sync Methods showsPrec :: Int -> ThreadStatus -> ShowS # show :: ThreadStatus -> String # showList :: [ThreadStatus] -> ShowS #
Show BlockedIndefinitelyOnMVar	Since: base-4.1.0.0
Instance details Defined in GHC.IO.Exception Methods showsPrec :: Int -> BlockedIndefinitelyOnMVar -> ShowS # show :: BlockedIndefinitelyOnMVar -> String # showList :: [BlockedIndefinitelyOnMVar] -> ShowS #
Show BlockedIndefinitelyOnSTM	Since: base-4.1.0.0
Instance details Defined in GHC.IO.Exception Methods showsPrec :: Int -> BlockedIndefinitelyOnSTM -> ShowS # show :: BlockedIndefinitelyOnSTM -> String # showList :: [BlockedIndefinitelyOnSTM] -> ShowS #
Show Deadlock	Since: base-4.1.0.0
Instance details Defined in GHC.IO.Exception Methods showsPrec :: Int -> Deadlock -> ShowS # show :: Deadlock -> String # showList :: [Deadlock] -> ShowS #
Show AllocationLimitExceeded	Since: base-4.7.1.0
Instance details Defined in GHC.IO.Exception Methods showsPrec :: Int -> AllocationLimitExceeded -> ShowS # show :: AllocationLimitExceeded -> String # showList :: [AllocationLimitExceeded] -> ShowS #
Show CompactionFailed	Since: base-4.10.0.0
Instance details Defined in GHC.IO.Exception Methods showsPrec :: Int -> CompactionFailed -> ShowS # show :: CompactionFailed -> String # showList :: [CompactionFailed] -> ShowS #
Show AssertionFailed	Since: base-4.1.0.0
Instance details Defined in GHC.IO.Exception Methods showsPrec :: Int -> AssertionFailed -> ShowS # show :: AssertionFailed -> String # showList :: [AssertionFailed] -> ShowS #
Show SomeAsyncException	Since: base-4.7.0.0
Instance details Defined in GHC.IO.Exception Methods showsPrec :: Int -> SomeAsyncException -> ShowS # show :: SomeAsyncException -> String # showList :: [SomeAsyncException] -> ShowS #
Show AsyncException	Since: base-4.1.0.0
Instance details Defined in GHC.IO.Exception Methods showsPrec :: Int -> AsyncException -> ShowS # show :: AsyncException -> String # showList :: [AsyncException] -> ShowS #
Show ArrayException	Since: base-4.1.0.0
Instance details Defined in GHC.IO.Exception Methods showsPrec :: Int -> ArrayException -> ShowS # show :: ArrayException -> String # showList :: [ArrayException] -> ShowS #
Show FixIOException	Since: base-4.11.0.0
Instance details Defined in GHC.IO.Exception Methods showsPrec :: Int -> FixIOException -> ShowS # show :: FixIOException -> String # showList :: [FixIOException] -> ShowS #
Show ExitCode
Instance details Defined in GHC.IO.Exception Methods showsPrec :: Int -> ExitCode -> ShowS # show :: ExitCode -> String # showList :: [ExitCode] -> ShowS #
Show IOErrorType	Since: base-4.1.0.0
Instance details Defined in GHC.IO.Exception Methods showsPrec :: Int -> IOErrorType -> ShowS # show :: IOErrorType -> String # showList :: [IOErrorType] -> ShowS #
Show BufferMode	Since: base-4.2.0.0
Instance details Defined in GHC.IO.Handle.Types Methods showsPrec :: Int -> BufferMode -> ShowS # show :: BufferMode -> String # showList :: [BufferMode] -> ShowS #
Show Newline	Since: base-4.3.0.0
Instance details Defined in GHC.IO.Handle.Types Methods showsPrec :: Int -> Newline -> ShowS # show :: Newline -> String # showList :: [Newline] -> ShowS #
Show NewlineMode	Since: base-4.3.0.0
Instance details Defined in GHC.IO.Handle.Types Methods showsPrec :: Int -> NewlineMode -> ShowS # show :: NewlineMode -> String # showList :: [NewlineMode] -> ShowS #
Show SeekMode	Since: base-4.2.0.0
Instance details Defined in GHC.IO.Device Methods showsPrec :: Int -> SeekMode -> ShowS # show :: SeekMode -> String # showList :: [SeekMode] -> ShowS #
Show MaskingState	Since: base-4.3.0.0
Instance details Defined in GHC.IO Methods showsPrec :: Int -> MaskingState -> ShowS # show :: MaskingState -> String # showList :: [MaskingState] -> ShowS #
Show IOException	Since: base-4.1.0.0
Instance details Defined in GHC.IO.Exception Methods showsPrec :: Int -> IOException -> ShowS # show :: IOException -> String # showList :: [IOException] -> ShowS #
Show ArithException	Since: base-4.0.0.0
Instance details Defined in GHC.Exception.Type Methods showsPrec :: Int -> ArithException -> ShowS # show :: ArithException -> String # showList :: [ArithException] -> ShowS #
Show Fixity	Since: base-4.6.0.0
Instance details Defined in GHC.Generics Methods showsPrec :: Int -> Fixity -> ShowS # show :: Fixity -> String # showList :: [Fixity] -> ShowS #
Show Associativity	Since: base-4.6.0.0
Instance details Defined in GHC.Generics Methods showsPrec :: Int -> Associativity -> ShowS # show :: Associativity -> String # showList :: [Associativity] -> ShowS #
Show SourceUnpackedness	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods showsPrec :: Int -> SourceUnpackedness -> ShowS # show :: SourceUnpackedness -> String # showList :: [SourceUnpackedness] -> ShowS #
Show SourceStrictness	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods showsPrec :: Int -> SourceStrictness -> ShowS # show :: SourceStrictness -> String # showList :: [SourceStrictness] -> ShowS #
Show DecidedStrictness	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods showsPrec :: Int -> DecidedStrictness -> ShowS # show :: DecidedStrictness -> String # showList :: [DecidedStrictness] -> ShowS #
Show SomeSymbol	Since: base-4.7.0.0
Instance details Defined in GHC.TypeLits Methods showsPrec :: Int -> SomeSymbol -> ShowS # show :: SomeSymbol -> String # showList :: [SomeSymbol] -> ShowS #
Show SomeNat	Since: base-4.7.0.0
Instance details Defined in GHC.TypeNats Methods showsPrec :: Int -> SomeNat -> ShowS # show :: SomeNat -> String # showList :: [SomeNat] -> ShowS #
Show CChar
Instance details Defined in Foreign.C.Types Methods showsPrec :: Int -> CChar -> ShowS # show :: CChar -> String # showList :: [CChar] -> ShowS #
Show CSChar
Instance details Defined in Foreign.C.Types Methods showsPrec :: Int -> CSChar -> ShowS # show :: CSChar -> String # showList :: [CSChar] -> ShowS #
Show CUChar
Instance details Defined in Foreign.C.Types Methods showsPrec :: Int -> CUChar -> ShowS # show :: CUChar -> String # showList :: [CUChar] -> ShowS #
Show CShort
Instance details Defined in Foreign.C.Types Methods showsPrec :: Int -> CShort -> ShowS # show :: CShort -> String # showList :: [CShort] -> ShowS #
Show CUShort
Instance details Defined in Foreign.C.Types Methods showsPrec :: Int -> CUShort -> ShowS # show :: CUShort -> String # showList :: [CUShort] -> ShowS #
Show CInt
Instance details Defined in Foreign.C.Types Methods showsPrec :: Int -> CInt -> ShowS # show :: CInt -> String # showList :: [CInt] -> ShowS #
Show CUInt
Instance details Defined in Foreign.C.Types Methods showsPrec :: Int -> CUInt -> ShowS # show :: CUInt -> String # showList :: [CUInt] -> ShowS #
Show CLong
Instance details Defined in Foreign.C.Types Methods showsPrec :: Int -> CLong -> ShowS # show :: CLong -> String # showList :: [CLong] -> ShowS #
Show CULong
Instance details Defined in Foreign.C.Types Methods showsPrec :: Int -> CULong -> ShowS # show :: CULong -> String # showList :: [CULong] -> ShowS #
Show CLLong
Instance details Defined in Foreign.C.Types Methods showsPrec :: Int -> CLLong -> ShowS # show :: CLLong -> String # showList :: [CLLong] -> ShowS #
Show CULLong
Instance details Defined in Foreign.C.Types Methods showsPrec :: Int -> CULLong -> ShowS # show :: CULLong -> String # showList :: [CULLong] -> ShowS #
Show CBool
Instance details Defined in Foreign.C.Types Methods showsPrec :: Int -> CBool -> ShowS # show :: CBool -> String # showList :: [CBool] -> ShowS #
Show CFloat
Instance details Defined in Foreign.C.Types Methods showsPrec :: Int -> CFloat -> ShowS # show :: CFloat -> String # showList :: [CFloat] -> ShowS #
Show CDouble
Instance details Defined in Foreign.C.Types Methods showsPrec :: Int -> CDouble -> ShowS # show :: CDouble -> String # showList :: [CDouble] -> ShowS #
Show CPtrdiff
Instance details Defined in Foreign.C.Types Methods showsPrec :: Int -> CPtrdiff -> ShowS # show :: CPtrdiff -> String # showList :: [CPtrdiff] -> ShowS #
Show CSize
Instance details Defined in Foreign.C.Types Methods showsPrec :: Int -> CSize -> ShowS # show :: CSize -> String # showList :: [CSize] -> ShowS #
Show CWchar
Instance details Defined in Foreign.C.Types Methods showsPrec :: Int -> CWchar -> ShowS # show :: CWchar -> String # showList :: [CWchar] -> ShowS #
Show CSigAtomic
Instance details Defined in Foreign.C.Types Methods showsPrec :: Int -> CSigAtomic -> ShowS # show :: CSigAtomic -> String # showList :: [CSigAtomic] -> ShowS #
Show CClock
Instance details Defined in Foreign.C.Types Methods showsPrec :: Int -> CClock -> ShowS # show :: CClock -> String # showList :: [CClock] -> ShowS #
Show CTime
Instance details Defined in Foreign.C.Types Methods showsPrec :: Int -> CTime -> ShowS # show :: CTime -> String # showList :: [CTime] -> ShowS #
Show CUSeconds
Instance details Defined in Foreign.C.Types Methods showsPrec :: Int -> CUSeconds -> ShowS # show :: CUSeconds -> String # showList :: [CUSeconds] -> ShowS #
Show CSUSeconds
Instance details Defined in Foreign.C.Types Methods showsPrec :: Int -> CSUSeconds -> ShowS # show :: CSUSeconds -> String # showList :: [CSUSeconds] -> ShowS #
Show CIntPtr
Instance details Defined in Foreign.C.Types Methods showsPrec :: Int -> CIntPtr -> ShowS # show :: CIntPtr -> String # showList :: [CIntPtr] -> ShowS #
Show CUIntPtr
Instance details Defined in Foreign.C.Types Methods showsPrec :: Int -> CUIntPtr -> ShowS # show :: CUIntPtr -> String # showList :: [CUIntPtr] -> ShowS #
Show CIntMax
Instance details Defined in Foreign.C.Types Methods showsPrec :: Int -> CIntMax -> ShowS # show :: CIntMax -> String # showList :: [CIntMax] -> ShowS #
Show CUIntMax
Instance details Defined in Foreign.C.Types Methods showsPrec :: Int -> CUIntMax -> ShowS # show :: CUIntMax -> String # showList :: [CUIntMax] -> ShowS #
Show IOMode	Since: base-4.2.0.0
Instance details Defined in GHC.IO.IOMode Methods showsPrec :: Int -> IOMode -> ShowS # show :: IOMode -> String # showList :: [IOMode] -> ShowS #
Show Lexeme	Since: base-2.1
Instance details Defined in Text.Read.Lex Methods showsPrec :: Int -> Lexeme -> ShowS # show :: Lexeme -> String # showList :: [Lexeme] -> ShowS #
Show Number	Since: base-4.6.0.0
Instance details Defined in Text.Read.Lex Methods showsPrec :: Int -> Number -> ShowS # show :: Number -> String # showList :: [Number] -> ShowS #
Show GeneralCategory	Since: base-2.1
Instance details Defined in GHC.Unicode Methods showsPrec :: Int -> GeneralCategory -> ShowS # show :: GeneralCategory -> String # showList :: [GeneralCategory] -> ShowS #
Show SrcLoc	Since: base-4.9.0.0
Instance details Defined in GHC.Show Methods showsPrec :: Int -> SrcLoc -> ShowS # show :: SrcLoc -> String # showList :: [SrcLoc] -> ShowS #
Show SomeException	Since: base-3.0
Instance details Defined in GHC.Exception.Type Methods showsPrec :: Int -> SomeException -> ShowS # show :: SomeException -> String # showList :: [SomeException] -> ShowS #
Show IntSet
Instance details Defined in Data.IntSet.Internal Methods showsPrec :: Int -> IntSet -> ShowS # show :: IntSet -> String # showList :: [IntSet] -> ShowS #
Show StringException	Since: unliftio-0.1.0.0
Instance details Defined in UnliftIO.Exception Methods showsPrec :: Int -> StringException -> ShowS # show :: StringException -> String # showList :: [StringException] -> ShowS #
Show AsyncExceptionWrapper	Since: unliftio-0.1.0.0
Instance details Defined in UnliftIO.Exception Methods showsPrec :: Int -> AsyncExceptionWrapper -> ShowS # show :: AsyncExceptionWrapper -> String # showList :: [AsyncExceptionWrapper] -> ShowS #
Show SyncExceptionWrapper	Since: unliftio-0.1.0.0
Instance details Defined in UnliftIO.Exception Methods showsPrec :: Int -> SyncExceptionWrapper -> ShowS # show :: SyncExceptionWrapper -> String # showList :: [SyncExceptionWrapper] -> ShowS #
Show ConcException
Instance details Defined in UnliftIO.Internals.Async Methods showsPrec :: Int -> ConcException -> ShowS # show :: ConcException -> String # showList :: [ConcException] -> ShowS #
Show RGBGamut
Instance details Defined in Data.Colour.RGB Methods showsPrec :: Int -> RGBGamut -> ShowS # show :: RGBGamut -> String # showList :: [RGBGamut] -> ShowS #
Show Focus
Instance details Defined in Data.FocusList Methods showsPrec :: Int -> Focus -> ShowS # show :: Focus -> String # showList :: [Focus] -> ShowS #
Show Extension
Instance details Defined in GHC.LanguageExtensions.Type Methods showsPrec :: Int -> Extension -> ShowS # show :: Extension -> String # showList :: [Extension] -> ShowS #
Show ForeignSrcLang
Instance details Defined in GHC.ForeignSrcLang.Type Methods showsPrec :: Int -> ForeignSrcLang -> ShowS # show :: ForeignSrcLang -> String # showList :: [ForeignSrcLang] -> ShowS #
Show UnexpectedNullPointerReturn
Instance details Defined in Data.GI.Base.BasicTypes Methods showsPrec :: Int -> UnexpectedNullPointerReturn -> ShowS # show :: UnexpectedNullPointerReturn -> String # showList :: [UnexpectedNullPointerReturn] -> ShowS #
Show WindowState
Instance details Defined in GI.Gdk.Flags Methods showsPrec :: Int -> WindowState -> ShowS # show :: WindowState -> String # showList :: [WindowState] -> ShowS #
Show WindowHints
Instance details Defined in GI.Gdk.Flags Methods showsPrec :: Int -> WindowHints -> ShowS # show :: WindowHints -> String # showList :: [WindowHints] -> ShowS #
Show WindowAttributesType
Instance details Defined in GI.Gdk.Flags Methods showsPrec :: Int -> WindowAttributesType -> ShowS # show :: WindowAttributesType -> String # showList :: [WindowAttributesType] -> ShowS #
Show WMFunction
Instance details Defined in GI.Gdk.Flags Methods showsPrec :: Int -> WMFunction -> ShowS # show :: WMFunction -> String # showList :: [WMFunction] -> ShowS #
Show WMDecoration
Instance details Defined in GI.Gdk.Flags Methods showsPrec :: Int -> WMDecoration -> ShowS # show :: WMDecoration -> String # showList :: [WMDecoration] -> ShowS #
Show SeatCapabilities
Instance details Defined in GI.Gdk.Flags Methods showsPrec :: Int -> SeatCapabilities -> ShowS # show :: SeatCapabilities -> String # showList :: [SeatCapabilities] -> ShowS #
Show ModifierType
Instance details Defined in GI.Gdk.Flags Methods showsPrec :: Int -> ModifierType -> ShowS # show :: ModifierType -> String # showList :: [ModifierType] -> ShowS #
Show FrameClockPhase
Instance details Defined in GI.Gdk.Flags Methods showsPrec :: Int -> FrameClockPhase -> ShowS # show :: FrameClockPhase -> String # showList :: [FrameClockPhase] -> ShowS #
Show EventMask
Instance details Defined in GI.Gdk.Flags Methods showsPrec :: Int -> EventMask -> ShowS # show :: EventMask -> String # showList :: [EventMask] -> ShowS #
Show DragAction
Instance details Defined in GI.Gdk.Flags Methods showsPrec :: Int -> DragAction -> ShowS # show :: DragAction -> String # showList :: [DragAction] -> ShowS #
Show AxisFlags
Instance details Defined in GI.Gdk.Flags Methods showsPrec :: Int -> AxisFlags -> ShowS # show :: AxisFlags -> String # showList :: [AxisFlags] -> ShowS #
Show AnchorHints
Instance details Defined in GI.Gdk.Flags Methods showsPrec :: Int -> AnchorHints -> ShowS # show :: AnchorHints -> String # showList :: [AnchorHints] -> ShowS #
Show WindowWindowClass
Instance details Defined in GI.Gdk.Enums Methods showsPrec :: Int -> WindowWindowClass -> ShowS # show :: WindowWindowClass -> String # showList :: [WindowWindowClass] -> ShowS #
Show WindowTypeHint
Instance details Defined in GI.Gdk.Enums Methods showsPrec :: Int -> WindowTypeHint -> ShowS # show :: WindowTypeHint -> String # showList :: [WindowTypeHint] -> ShowS #
Show WindowType
Instance details Defined in GI.Gdk.Enums Methods showsPrec :: Int -> WindowType -> ShowS # show :: WindowType -> String # showList :: [WindowType] -> ShowS #
Show WindowEdge
Instance details Defined in GI.Gdk.Enums Methods showsPrec :: Int -> WindowEdge -> ShowS # show :: WindowEdge -> String # showList :: [WindowEdge] -> ShowS #
Show VisualType
Instance details Defined in GI.Gdk.Enums Methods showsPrec :: Int -> VisualType -> ShowS # show :: VisualType -> String # showList :: [VisualType] -> ShowS #
Show VisibilityState
Instance details Defined in GI.Gdk.Enums Methods showsPrec :: Int -> VisibilityState -> ShowS # show :: VisibilityState -> String # showList :: [VisibilityState] -> ShowS #
Show TouchpadGesturePhase
Instance details Defined in GI.Gdk.Enums Methods showsPrec :: Int -> TouchpadGesturePhase -> ShowS # show :: TouchpadGesturePhase -> String # showList :: [TouchpadGesturePhase] -> ShowS #
Show SubpixelLayout
Instance details Defined in GI.Gdk.Enums Methods showsPrec :: Int -> SubpixelLayout -> ShowS # show :: SubpixelLayout -> String # showList :: [SubpixelLayout] -> ShowS #
Show Status
Instance details Defined in GI.Gdk.Enums Methods showsPrec :: Int -> Status -> ShowS # show :: Status -> String # showList :: [Status] -> ShowS #
Show SettingAction
Instance details Defined in GI.Gdk.Enums Methods showsPrec :: Int -> SettingAction -> ShowS # show :: SettingAction -> String # showList :: [SettingAction] -> ShowS #
Show ScrollDirection
Instance details Defined in GI.Gdk.Enums Methods showsPrec :: Int -> ScrollDirection -> ShowS # show :: ScrollDirection -> String # showList :: [ScrollDirection] -> ShowS #
Show PropertyState
Instance details Defined in GI.Gdk.Enums Methods showsPrec :: Int -> PropertyState -> ShowS # show :: PropertyState -> String # showList :: [PropertyState] -> ShowS #
Show PropMode
Instance details Defined in GI.Gdk.Enums Methods showsPrec :: Int -> PropMode -> ShowS # show :: PropMode -> String # showList :: [PropMode] -> ShowS #
Show OwnerChange
Instance details Defined in GI.Gdk.Enums Methods showsPrec :: Int -> OwnerChange -> ShowS # show :: OwnerChange -> String # showList :: [OwnerChange] -> ShowS #
Show NotifyType
Instance details Defined in GI.Gdk.Enums Methods showsPrec :: Int -> NotifyType -> ShowS # show :: NotifyType -> String # showList :: [NotifyType] -> ShowS #
Show ModifierIntent
Instance details Defined in GI.Gdk.Enums Methods showsPrec :: Int -> ModifierIntent -> ShowS # show :: ModifierIntent -> String # showList :: [ModifierIntent] -> ShowS #
Show InputSource
Instance details Defined in GI.Gdk.Enums Methods showsPrec :: Int -> InputSource -> ShowS # show :: InputSource -> String # showList :: [InputSource] -> ShowS #
Show InputMode
Instance details Defined in GI.Gdk.Enums Methods showsPrec :: Int -> InputMode -> ShowS # show :: InputMode -> String # showList :: [InputMode] -> ShowS #
Show Gravity
Instance details Defined in GI.Gdk.Enums Methods showsPrec :: Int -> Gravity -> ShowS # show :: Gravity -> String # showList :: [Gravity] -> ShowS #
Show GrabStatus
Instance details Defined in GI.Gdk.Enums Methods showsPrec :: Int -> GrabStatus -> ShowS # show :: GrabStatus -> String # showList :: [GrabStatus] -> ShowS #
Show GrabOwnership
Instance details Defined in GI.Gdk.Enums Methods showsPrec :: Int -> GrabOwnership -> ShowS # show :: GrabOwnership -> String # showList :: [GrabOwnership] -> ShowS #
Show GLError
Instance details Defined in GI.Gdk.Enums Methods showsPrec :: Int -> GLError -> ShowS # show :: GLError -> String # showList :: [GLError] -> ShowS #
Show FullscreenMode
Instance details Defined in GI.Gdk.Enums Methods showsPrec :: Int -> FullscreenMode -> ShowS # show :: FullscreenMode -> String # showList :: [FullscreenMode] -> ShowS #
Show FilterReturn
Instance details Defined in GI.Gdk.Enums Methods showsPrec :: Int -> FilterReturn -> ShowS # show :: FilterReturn -> String # showList :: [FilterReturn] -> ShowS #
Show EventType
Instance details Defined in GI.Gdk.Enums Methods showsPrec :: Int -> EventType -> ShowS # show :: EventType -> String # showList :: [EventType] -> ShowS #
Show DragProtocol
Instance details Defined in GI.Gdk.Enums Methods showsPrec :: Int -> DragProtocol -> ShowS # show :: DragProtocol -> String # showList :: [DragProtocol] -> ShowS #
Show DragCancelReason
Instance details Defined in GI.Gdk.Enums Methods showsPrec :: Int -> DragCancelReason -> ShowS # show :: DragCancelReason -> String # showList :: [DragCancelReason] -> ShowS #
Show DeviceType
Instance details Defined in GI.Gdk.Enums Methods showsPrec :: Int -> DeviceType -> ShowS # show :: DeviceType -> String # showList :: [DeviceType] -> ShowS #
Show DeviceToolType
Instance details Defined in GI.Gdk.Enums Methods showsPrec :: Int -> DeviceToolType -> ShowS # show :: DeviceToolType -> String # showList :: [DeviceToolType] -> ShowS #
Show DevicePadFeature
Instance details Defined in GI.Gdk.Enums Methods showsPrec :: Int -> DevicePadFeature -> ShowS # show :: DevicePadFeature -> String # showList :: [DevicePadFeature] -> ShowS #
Show CursorType
Instance details Defined in GI.Gdk.Enums Methods showsPrec :: Int -> CursorType -> ShowS # show :: CursorType -> String # showList :: [CursorType] -> ShowS #
Show CrossingMode
Instance details Defined in GI.Gdk.Enums Methods showsPrec :: Int -> CrossingMode -> ShowS # show :: CrossingMode -> String # showList :: [CrossingMode] -> ShowS #
Show ByteOrder
Instance details Defined in GI.Gdk.Enums Methods showsPrec :: Int -> ByteOrder -> ShowS # show :: ByteOrder -> String # showList :: [ByteOrder] -> ShowS #
Show AxisUse
Instance details Defined in GI.Gdk.Enums Methods showsPrec :: Int -> AxisUse -> ShowS # show :: AxisUse -> String # showList :: [AxisUse] -> ShowS #
Show TlsPasswordFlags
Instance details Defined in GI.Gio.Flags Methods showsPrec :: Int -> TlsPasswordFlags -> ShowS # show :: TlsPasswordFlags -> String # showList :: [TlsPasswordFlags] -> ShowS #
Show TlsDatabaseVerifyFlags
Instance details Defined in GI.Gio.Flags Methods showsPrec :: Int -> TlsDatabaseVerifyFlags -> ShowS # show :: TlsDatabaseVerifyFlags -> String # showList :: [TlsDatabaseVerifyFlags] -> ShowS #
Show TlsCertificateFlags
Instance details Defined in GI.Gio.Flags Methods showsPrec :: Int -> TlsCertificateFlags -> ShowS # show :: TlsCertificateFlags -> String # showList :: [TlsCertificateFlags] -> ShowS #
Show TestDBusFlags
Instance details Defined in GI.Gio.Flags Methods showsPrec :: Int -> TestDBusFlags -> ShowS # show :: TestDBusFlags -> String # showList :: [TestDBusFlags] -> ShowS #
Show SubprocessFlags
Instance details Defined in GI.Gio.Flags Methods showsPrec :: Int -> SubprocessFlags -> ShowS # show :: SubprocessFlags -> String # showList :: [SubprocessFlags] -> ShowS #
Show SocketMsgFlags
Instance details Defined in GI.Gio.Flags Methods showsPrec :: Int -> SocketMsgFlags -> ShowS # show :: SocketMsgFlags -> String # showList :: [SocketMsgFlags] -> ShowS #
Show SettingsBindFlags
Instance details Defined in GI.Gio.Flags Methods showsPrec :: Int -> SettingsBindFlags -> ShowS # show :: SettingsBindFlags -> String # showList :: [SettingsBindFlags] -> ShowS #
Show ResourceLookupFlags
Instance details Defined in GI.Gio.Flags Methods showsPrec :: Int -> ResourceLookupFlags -> ShowS # show :: ResourceLookupFlags -> String # showList :: [ResourceLookupFlags] -> ShowS #
Show ResourceFlags
Instance details Defined in GI.Gio.Flags Methods showsPrec :: Int -> ResourceFlags -> ShowS # show :: ResourceFlags -> String # showList :: [ResourceFlags] -> ShowS #
Show OutputStreamSpliceFlags
Instance details Defined in GI.Gio.Flags Methods showsPrec :: Int -> OutputStreamSpliceFlags -> ShowS # show :: OutputStreamSpliceFlags -> String # showList :: [OutputStreamSpliceFlags] -> ShowS #
Show MountUnmountFlags
Instance details Defined in GI.Gio.Flags Methods showsPrec :: Int -> MountUnmountFlags -> ShowS # show :: MountUnmountFlags -> String # showList :: [MountUnmountFlags] -> ShowS #
Show MountMountFlags
Instance details Defined in GI.Gio.Flags Methods showsPrec :: Int -> MountMountFlags -> ShowS # show :: MountMountFlags -> String # showList :: [MountMountFlags] -> ShowS #
Show IOStreamSpliceFlags
Instance details Defined in GI.Gio.Flags Methods showsPrec :: Int -> IOStreamSpliceFlags -> ShowS # show :: IOStreamSpliceFlags -> String # showList :: [IOStreamSpliceFlags] -> ShowS #
Show FileQueryInfoFlags
Instance details Defined in GI.Gio.Flags Methods showsPrec :: Int -> FileQueryInfoFlags -> ShowS # show :: FileQueryInfoFlags -> String # showList :: [FileQueryInfoFlags] -> ShowS #
Show FileMonitorFlags
Instance details Defined in GI.Gio.Flags Methods showsPrec :: Int -> FileMonitorFlags -> ShowS # show :: FileMonitorFlags -> String # showList :: [FileMonitorFlags] -> ShowS #
Show FileMeasureFlags
Instance details Defined in GI.Gio.Flags Methods showsPrec :: Int -> FileMeasureFlags -> ShowS # show :: FileMeasureFlags -> String # showList :: [FileMeasureFlags] -> ShowS #
Show FileCreateFlags
Instance details Defined in GI.Gio.Flags Methods showsPrec :: Int -> FileCreateFlags -> ShowS # show :: FileCreateFlags -> String # showList :: [FileCreateFlags] -> ShowS #
Show FileCopyFlags
Instance details Defined in GI.Gio.Flags Methods showsPrec :: Int -> FileCopyFlags -> ShowS # show :: FileCopyFlags -> String # showList :: [FileCopyFlags] -> ShowS #
Show FileAttributeInfoFlags
Instance details Defined in GI.Gio.Flags Methods showsPrec :: Int -> FileAttributeInfoFlags -> ShowS # show :: FileAttributeInfoFlags -> String # showList :: [FileAttributeInfoFlags] -> ShowS #
Show DriveStartFlags
Instance details Defined in GI.Gio.Flags Methods showsPrec :: Int -> DriveStartFlags -> ShowS # show :: DriveStartFlags -> String # showList :: [DriveStartFlags] -> ShowS #
Show DBusSubtreeFlags
Instance details Defined in GI.Gio.Flags Methods showsPrec :: Int -> DBusSubtreeFlags -> ShowS # show :: DBusSubtreeFlags -> String # showList :: [DBusSubtreeFlags] -> ShowS #
Show DBusSignalFlags
Instance details Defined in GI.Gio.Flags Methods showsPrec :: Int -> DBusSignalFlags -> ShowS # show :: DBusSignalFlags -> String # showList :: [DBusSignalFlags] -> ShowS #
Show DBusServerFlags
Instance details Defined in GI.Gio.Flags Methods showsPrec :: Int -> DBusServerFlags -> ShowS # show :: DBusServerFlags -> String # showList :: [DBusServerFlags] -> ShowS #
Show DBusSendMessageFlags
Instance details Defined in GI.Gio.Flags Methods showsPrec :: Int -> DBusSendMessageFlags -> ShowS # show :: DBusSendMessageFlags -> String # showList :: [DBusSendMessageFlags] -> ShowS #
Show DBusProxyFlags
Instance details Defined in GI.Gio.Flags Methods showsPrec :: Int -> DBusProxyFlags -> ShowS # show :: DBusProxyFlags -> String # showList :: [DBusProxyFlags] -> ShowS #
Show DBusPropertyInfoFlags
Instance details Defined in GI.Gio.Flags Methods showsPrec :: Int -> DBusPropertyInfoFlags -> ShowS # show :: DBusPropertyInfoFlags -> String # showList :: [DBusPropertyInfoFlags] -> ShowS #
Show DBusObjectManagerClientFlags
Instance details Defined in GI.Gio.Flags Methods showsPrec :: Int -> DBusObjectManagerClientFlags -> ShowS # show :: DBusObjectManagerClientFlags -> String # showList :: [DBusObjectManagerClientFlags] -> ShowS #
Show DBusMessageFlags
Instance details Defined in GI.Gio.Flags Methods showsPrec :: Int -> DBusMessageFlags -> ShowS # show :: DBusMessageFlags -> String # showList :: [DBusMessageFlags] -> ShowS #
Show DBusInterfaceSkeletonFlags
Instance details Defined in GI.Gio.Flags Methods showsPrec :: Int -> DBusInterfaceSkeletonFlags -> ShowS # show :: DBusInterfaceSkeletonFlags -> String # showList :: [DBusInterfaceSkeletonFlags] -> ShowS #
Show DBusConnectionFlags
Instance details Defined in GI.Gio.Flags Methods showsPrec :: Int -> DBusConnectionFlags -> ShowS # show :: DBusConnectionFlags -> String # showList :: [DBusConnectionFlags] -> ShowS #
Show DBusCapabilityFlags
Instance details Defined in GI.Gio.Flags Methods showsPrec :: Int -> DBusCapabilityFlags -> ShowS # show :: DBusCapabilityFlags -> String # showList :: [DBusCapabilityFlags] -> ShowS #
Show DBusCallFlags
Instance details Defined in GI.Gio.Flags Methods showsPrec :: Int -> DBusCallFlags -> ShowS # show :: DBusCallFlags -> String # showList :: [DBusCallFlags] -> ShowS #
Show ConverterFlags
Instance details Defined in GI.Gio.Flags Methods showsPrec :: Int -> ConverterFlags -> ShowS # show :: ConverterFlags -> String # showList :: [ConverterFlags] -> ShowS #
Show BusNameWatcherFlags
Instance details Defined in GI.Gio.Flags Methods showsPrec :: Int -> BusNameWatcherFlags -> ShowS # show :: BusNameWatcherFlags -> String # showList :: [BusNameWatcherFlags] -> ShowS #
Show BusNameOwnerFlags
Instance details Defined in GI.Gio.Flags Methods showsPrec :: Int -> BusNameOwnerFlags -> ShowS # show :: BusNameOwnerFlags -> String # showList :: [BusNameOwnerFlags] -> ShowS #
Show AskPasswordFlags
Instance details Defined in GI.Gio.Flags Methods showsPrec :: Int -> AskPasswordFlags -> ShowS # show :: AskPasswordFlags -> String # showList :: [AskPasswordFlags] -> ShowS #
Show ApplicationFlags
Instance details Defined in GI.Gio.Flags Methods showsPrec :: Int -> ApplicationFlags -> ShowS # show :: ApplicationFlags -> String # showList :: [ApplicationFlags] -> ShowS #
Show AppInfoCreateFlags
Instance details Defined in GI.Gio.Flags Methods showsPrec :: Int -> AppInfoCreateFlags -> ShowS # show :: AppInfoCreateFlags -> String # showList :: [AppInfoCreateFlags] -> ShowS #
Show ZlibCompressorFormat
Instance details Defined in GI.Gio.Enums Methods showsPrec :: Int -> ZlibCompressorFormat -> ShowS # show :: ZlibCompressorFormat -> String # showList :: [ZlibCompressorFormat] -> ShowS #
Show UnixSocketAddressType
Instance details Defined in GI.Gio.Enums Methods showsPrec :: Int -> UnixSocketAddressType -> ShowS # show :: UnixSocketAddressType -> String # showList :: [UnixSocketAddressType] -> ShowS #
Show TlsRehandshakeMode
Instance details Defined in GI.Gio.Enums Methods showsPrec :: Int -> TlsRehandshakeMode -> ShowS # show :: TlsRehandshakeMode -> String # showList :: [TlsRehandshakeMode] -> ShowS #
Show TlsInteractionResult
Instance details Defined in GI.Gio.Enums Methods showsPrec :: Int -> TlsInteractionResult -> ShowS # show :: TlsInteractionResult -> String # showList :: [TlsInteractionResult] -> ShowS #
Show TlsError
Instance details Defined in GI.Gio.Enums Methods showsPrec :: Int -> TlsError -> ShowS # show :: TlsError -> String # showList :: [TlsError] -> ShowS #
Show TlsDatabaseLookupFlags
Instance details Defined in GI.Gio.Enums Methods showsPrec :: Int -> TlsDatabaseLookupFlags -> ShowS # show :: TlsDatabaseLookupFlags -> String # showList :: [TlsDatabaseLookupFlags] -> ShowS #
Show TlsCertificateRequestFlags
Instance details Defined in GI.Gio.Enums Methods showsPrec :: Int -> TlsCertificateRequestFlags -> ShowS # show :: TlsCertificateRequestFlags -> String # showList :: [TlsCertificateRequestFlags] -> ShowS #
Show TlsAuthenticationMode
Instance details Defined in GI.Gio.Enums Methods showsPrec :: Int -> TlsAuthenticationMode -> ShowS # show :: TlsAuthenticationMode -> String # showList :: [TlsAuthenticationMode] -> ShowS #
Show SocketType
Instance details Defined in GI.Gio.Enums Methods showsPrec :: Int -> SocketType -> ShowS # show :: SocketType -> String # showList :: [SocketType] -> ShowS #
Show SocketProtocol
Instance details Defined in GI.Gio.Enums Methods showsPrec :: Int -> SocketProtocol -> ShowS # show :: SocketProtocol -> String # showList :: [SocketProtocol] -> ShowS #
Show SocketListenerEvent
Instance details Defined in GI.Gio.Enums Methods showsPrec :: Int -> SocketListenerEvent -> ShowS # show :: SocketListenerEvent -> String # showList :: [SocketListenerEvent] -> ShowS #
Show SocketFamily
Instance details Defined in GI.Gio.Enums Methods showsPrec :: Int -> SocketFamily -> ShowS # show :: SocketFamily -> String # showList :: [SocketFamily] -> ShowS #
Show SocketClientEvent
Instance details Defined in GI.Gio.Enums Methods showsPrec :: Int -> SocketClientEvent -> ShowS # show :: SocketClientEvent -> String # showList :: [SocketClientEvent] -> ShowS #
Show ResourceError
Instance details Defined in GI.Gio.Enums Methods showsPrec :: Int -> ResourceError -> ShowS # show :: ResourceError -> String # showList :: [ResourceError] -> ShowS #
Show ResolverRecordType
Instance details Defined in GI.Gio.Enums Methods showsPrec :: Int -> ResolverRecordType -> ShowS # show :: ResolverRecordType -> String # showList :: [ResolverRecordType] -> ShowS #
Show ResolverError
Instance details Defined in GI.Gio.Enums Methods showsPrec :: Int -> ResolverError -> ShowS # show :: ResolverError -> String # showList :: [ResolverError] -> ShowS #
Show PasswordSave
Instance details Defined in GI.Gio.Enums Methods showsPrec :: Int -> PasswordSave -> ShowS # show :: PasswordSave -> String # showList :: [PasswordSave] -> ShowS #
Show NotificationPriority
Instance details Defined in GI.Gio.Enums Methods showsPrec :: Int -> NotificationPriority -> ShowS # show :: NotificationPriority -> String # showList :: [NotificationPriority] -> ShowS #
Show NetworkConnectivity
Instance details Defined in GI.Gio.Enums Methods showsPrec :: Int -> NetworkConnectivity -> ShowS # show :: NetworkConnectivity -> String # showList :: [NetworkConnectivity] -> ShowS #
Show MountOperationResult
Instance details Defined in GI.Gio.Enums Methods showsPrec :: Int -> MountOperationResult -> ShowS # show :: MountOperationResult -> String # showList :: [MountOperationResult] -> ShowS #
Show IOModuleScopeFlags
Instance details Defined in GI.Gio.Enums Methods showsPrec :: Int -> IOModuleScopeFlags -> ShowS # show :: IOModuleScopeFlags -> String # showList :: [IOModuleScopeFlags] -> ShowS #
Show IOErrorEnum
Instance details Defined in GI.Gio.Enums Methods showsPrec :: Int -> IOErrorEnum -> ShowS # show :: IOErrorEnum -> String # showList :: [IOErrorEnum] -> ShowS #
Show FilesystemPreviewType
Instance details Defined in GI.Gio.Enums Methods showsPrec :: Int -> FilesystemPreviewType -> ShowS # show :: FilesystemPreviewType -> String # showList :: [FilesystemPreviewType] -> ShowS #
Show FileType
Instance details Defined in GI.Gio.Enums Methods showsPrec :: Int -> FileType -> ShowS # show :: FileType -> String # showList :: [FileType] -> ShowS #
Show FileMonitorEvent
Instance details Defined in GI.Gio.Enums Methods showsPrec :: Int -> FileMonitorEvent -> ShowS # show :: FileMonitorEvent -> String # showList :: [FileMonitorEvent] -> ShowS #
Show FileAttributeType
Instance details Defined in GI.Gio.Enums Methods showsPrec :: Int -> FileAttributeType -> ShowS # show :: FileAttributeType -> String # showList :: [FileAttributeType] -> ShowS #
Show FileAttributeStatus
Instance details Defined in GI.Gio.Enums Methods showsPrec :: Int -> FileAttributeStatus -> ShowS # show :: FileAttributeStatus -> String # showList :: [FileAttributeStatus] -> ShowS #
Show EmblemOrigin
Instance details Defined in GI.Gio.Enums Methods showsPrec :: Int -> EmblemOrigin -> ShowS # show :: EmblemOrigin -> String # showList :: [EmblemOrigin] -> ShowS #
Show DriveStartStopType
Instance details Defined in GI.Gio.Enums Methods showsPrec :: Int -> DriveStartStopType -> ShowS # show :: DriveStartStopType -> String # showList :: [DriveStartStopType] -> ShowS #
Show DataStreamNewlineType
Instance details Defined in GI.Gio.Enums Methods showsPrec :: Int -> DataStreamNewlineType -> ShowS # show :: DataStreamNewlineType -> String # showList :: [DataStreamNewlineType] -> ShowS #
Show DataStreamByteOrder
Instance details Defined in GI.Gio.Enums Methods showsPrec :: Int -> DataStreamByteOrder -> ShowS # show :: DataStreamByteOrder -> String # showList :: [DataStreamByteOrder] -> ShowS #
Show DBusMessageType
Instance details Defined in GI.Gio.Enums Methods showsPrec :: Int -> DBusMessageType -> ShowS # show :: DBusMessageType -> String # showList :: [DBusMessageType] -> ShowS #
Show DBusMessageHeaderField
Instance details Defined in GI.Gio.Enums Methods showsPrec :: Int -> DBusMessageHeaderField -> ShowS # show :: DBusMessageHeaderField -> String # showList :: [DBusMessageHeaderField] -> ShowS #
Show DBusMessageByteOrder
Instance details Defined in GI.Gio.Enums Methods showsPrec :: Int -> DBusMessageByteOrder -> ShowS # show :: DBusMessageByteOrder -> String # showList :: [DBusMessageByteOrder] -> ShowS #
Show DBusError
Instance details Defined in GI.Gio.Enums Methods showsPrec :: Int -> DBusError -> ShowS # show :: DBusError -> String # showList :: [DBusError] -> ShowS #
Show CredentialsType
Instance details Defined in GI.Gio.Enums Methods showsPrec :: Int -> CredentialsType -> ShowS # show :: CredentialsType -> String # showList :: [CredentialsType] -> ShowS #
Show ConverterResult
Instance details Defined in GI.Gio.Enums Methods showsPrec :: Int -> ConverterResult -> ShowS # show :: ConverterResult -> String # showList :: [ConverterResult] -> ShowS #
Show BusType
Instance details Defined in GI.Gio.Enums Methods showsPrec :: Int -> BusType -> ShowS # show :: BusType -> String # showList :: [BusType] -> ShowS #
Show TraverseFlags
Instance details Defined in GI.GLib.Flags Methods showsPrec :: Int -> TraverseFlags -> ShowS # show :: TraverseFlags -> String # showList :: [TraverseFlags] -> ShowS #
Show TestTrapFlags
Instance details Defined in GI.GLib.Flags Methods showsPrec :: Int -> TestTrapFlags -> ShowS # show :: TestTrapFlags -> String # showList :: [TestTrapFlags] -> ShowS #
Show TestSubprocessFlags
Instance details Defined in GI.GLib.Flags Methods showsPrec :: Int -> TestSubprocessFlags -> ShowS # show :: TestSubprocessFlags -> String # showList :: [TestSubprocessFlags] -> ShowS #
Show SpawnFlags
Instance details Defined in GI.GLib.Flags Methods showsPrec :: Int -> SpawnFlags -> ShowS # show :: SpawnFlags -> String # showList :: [SpawnFlags] -> ShowS #
Show RegexMatchFlags
Instance details Defined in GI.GLib.Flags Methods showsPrec :: Int -> RegexMatchFlags -> ShowS # show :: RegexMatchFlags -> String # showList :: [RegexMatchFlags] -> ShowS #
Show RegexCompileFlags
Instance details Defined in GI.GLib.Flags Methods showsPrec :: Int -> RegexCompileFlags -> ShowS # show :: RegexCompileFlags -> String # showList :: [RegexCompileFlags] -> ShowS #
Show OptionFlags
Instance details Defined in GI.GLib.Flags Methods showsPrec :: Int -> OptionFlags -> ShowS # show :: OptionFlags -> String # showList :: [OptionFlags] -> ShowS #
Show MarkupParseFlags
Instance details Defined in GI.GLib.Flags Methods showsPrec :: Int -> MarkupParseFlags -> ShowS # show :: MarkupParseFlags -> String # showList :: [MarkupParseFlags] -> ShowS #
Show MarkupCollectType
Instance details Defined in GI.GLib.Flags Methods showsPrec :: Int -> MarkupCollectType -> ShowS # show :: MarkupCollectType -> String # showList :: [MarkupCollectType] -> ShowS #
Show LogLevelFlags
Instance details Defined in GI.GLib.Flags Methods showsPrec :: Int -> LogLevelFlags -> ShowS # show :: LogLevelFlags -> String # showList :: [LogLevelFlags] -> ShowS #
Show KeyFileFlags
Instance details Defined in GI.GLib.Flags Methods showsPrec :: Int -> KeyFileFlags -> ShowS # show :: KeyFileFlags -> String # showList :: [KeyFileFlags] -> ShowS #
Show IOFlags
Instance details Defined in GI.GLib.Flags Methods showsPrec :: Int -> IOFlags -> ShowS # show :: IOFlags -> String # showList :: [IOFlags] -> ShowS #
Show IOCondition
Instance details Defined in GI.GLib.Flags Methods showsPrec :: Int -> IOCondition -> ShowS # show :: IOCondition -> String # showList :: [IOCondition] -> ShowS #
Show HookFlagMask
Instance details Defined in GI.GLib.Flags Methods showsPrec :: Int -> HookFlagMask -> ShowS # show :: HookFlagMask -> String # showList :: [HookFlagMask] -> ShowS #
Show FormatSizeFlags
Instance details Defined in GI.GLib.Flags Methods showsPrec :: Int -> FormatSizeFlags -> ShowS # show :: FormatSizeFlags -> String # showList :: [FormatSizeFlags] -> ShowS #
Show FileTest
Instance details Defined in GI.GLib.Flags Methods showsPrec :: Int -> FileTest -> ShowS # show :: FileTest -> String # showList :: [FileTest] -> ShowS #
Show AsciiType
Instance details Defined in GI.GLib.Flags Methods showsPrec :: Int -> AsciiType -> ShowS # show :: AsciiType -> String # showList :: [AsciiType] -> ShowS #
Show VariantParseError
Instance details Defined in GI.GLib.Enums Methods showsPrec :: Int -> VariantParseError -> ShowS # show :: VariantParseError -> String # showList :: [VariantParseError] -> ShowS #
Show VariantClass
Instance details Defined in GI.GLib.Enums Methods showsPrec :: Int -> VariantClass -> ShowS # show :: VariantClass -> String # showList :: [VariantClass] -> ShowS #
Show UserDirectory
Instance details Defined in GI.GLib.Enums Methods showsPrec :: Int -> UserDirectory -> ShowS # show :: UserDirectory -> String # showList :: [UserDirectory] -> ShowS #
Show UnicodeType
Instance details Defined in GI.GLib.Enums Methods showsPrec :: Int -> UnicodeType -> ShowS # show :: UnicodeType -> String # showList :: [UnicodeType] -> ShowS #
Show UnicodeScript
Instance details Defined in GI.GLib.Enums Methods showsPrec :: Int -> UnicodeScript -> ShowS # show :: UnicodeScript -> String # showList :: [UnicodeScript] -> ShowS #
Show UnicodeBreakType
Instance details Defined in GI.GLib.Enums Methods showsPrec :: Int -> UnicodeBreakType -> ShowS # show :: UnicodeBreakType -> String # showList :: [UnicodeBreakType] -> ShowS #
Show TraverseType
Instance details Defined in GI.GLib.Enums Methods showsPrec :: Int -> TraverseType -> ShowS # show :: TraverseType -> String # showList :: [TraverseType] -> ShowS #
Show TokenType
Instance details Defined in GI.GLib.Enums Methods showsPrec :: Int -> TokenType -> ShowS # show :: TokenType -> String # showList :: [TokenType] -> ShowS #
Show TimeType
Instance details Defined in GI.GLib.Enums Methods showsPrec :: Int -> TimeType -> ShowS # show :: TimeType -> String # showList :: [TimeType] -> ShowS #
Show ThreadError
Instance details Defined in GI.GLib.Enums Methods showsPrec :: Int -> ThreadError -> ShowS # show :: ThreadError -> String # showList :: [ThreadError] -> ShowS #
Show TestResult
Instance details Defined in GI.GLib.Enums Methods showsPrec :: Int -> TestResult -> ShowS # show :: TestResult -> String # showList :: [TestResult] -> ShowS #
Show TestLogType
Instance details Defined in GI.GLib.Enums Methods showsPrec :: Int -> TestLogType -> ShowS # show :: TestLogType -> String # showList :: [TestLogType] -> ShowS #
Show TestFileType
Instance details Defined in GI.GLib.Enums Methods showsPrec :: Int -> TestFileType -> ShowS # show :: TestFileType -> String # showList :: [TestFileType] -> ShowS #
Show SpawnError
Instance details Defined in GI.GLib.Enums Methods showsPrec :: Int -> SpawnError -> ShowS # show :: SpawnError -> String # showList :: [SpawnError] -> ShowS #
Show SliceConfig
Instance details Defined in GI.GLib.Enums Methods showsPrec :: Int -> SliceConfig -> ShowS # show :: SliceConfig -> String # showList :: [SliceConfig] -> ShowS #
Show ShellError
Instance details Defined in GI.GLib.Enums Methods showsPrec :: Int -> ShellError -> ShowS # show :: ShellError -> String # showList :: [ShellError] -> ShowS #
Show SeekType
Instance details Defined in GI.GLib.Enums Methods showsPrec :: Int -> SeekType -> ShowS # show :: SeekType -> String # showList :: [SeekType] -> ShowS #
Show RegexError
Instance details Defined in GI.GLib.Enums Methods showsPrec :: Int -> RegexError -> ShowS # show :: RegexError -> String # showList :: [RegexError] -> ShowS #
Show OptionError
Instance details Defined in GI.GLib.Enums Methods showsPrec :: Int -> OptionError -> ShowS # show :: OptionError -> String # showList :: [OptionError] -> ShowS #
Show OptionArg
Instance details Defined in GI.GLib.Enums Methods showsPrec :: Int -> OptionArg -> ShowS # show :: OptionArg -> String # showList :: [OptionArg] -> ShowS #
Show OnceStatus
Instance details Defined in GI.GLib.Enums Methods showsPrec :: Int -> OnceStatus -> ShowS # show :: OnceStatus -> String # showList :: [OnceStatus] -> ShowS #
Show NumberParserError
Instance details Defined in GI.GLib.Enums Methods showsPrec :: Int -> NumberParserError -> ShowS # show :: NumberParserError -> String # showList :: [NumberParserError] -> ShowS #
Show NormalizeMode
Instance details Defined in GI.GLib.Enums Methods showsPrec :: Int -> NormalizeMode -> ShowS # show :: NormalizeMode -> String # showList :: [NormalizeMode] -> ShowS #
Show MarkupError
Instance details Defined in GI.GLib.Enums Methods showsPrec :: Int -> MarkupError -> ShowS # show :: MarkupError -> String # showList :: [MarkupError] -> ShowS #
Show LogWriterOutput
Instance details Defined in GI.GLib.Enums Methods showsPrec :: Int -> LogWriterOutput -> ShowS # show :: LogWriterOutput -> String # showList :: [LogWriterOutput] -> ShowS #
Show KeyFileError
Instance details Defined in GI.GLib.Enums Methods showsPrec :: Int -> KeyFileError -> ShowS # show :: KeyFileError -> String # showList :: [KeyFileError] -> ShowS #
Show IOStatus
Instance details Defined in GI.GLib.Enums Methods showsPrec :: Int -> IOStatus -> ShowS # show :: IOStatus -> String # showList :: [IOStatus] -> ShowS #
Show IOError
Instance details Defined in GI.GLib.Enums Methods showsPrec :: Int -> IOError -> ShowS # show :: IOError -> String # showList :: [IOError] -> ShowS #
Show IOChannelError
Instance details Defined in GI.GLib.Enums Methods showsPrec :: Int -> IOChannelError -> ShowS # show :: IOChannelError -> String # showList :: [IOChannelError] -> ShowS #
Show FileError
Instance details Defined in GI.GLib.Enums Methods showsPrec :: Int -> FileError -> ShowS # show :: FileError -> String # showList :: [FileError] -> ShowS #
Show ErrorType
Instance details Defined in GI.GLib.Enums Methods showsPrec :: Int -> ErrorType -> ShowS # show :: ErrorType -> String # showList :: [ErrorType] -> ShowS #
Show DateWeekday
Instance details Defined in GI.GLib.Enums Methods showsPrec :: Int -> DateWeekday -> ShowS # show :: DateWeekday -> String # showList :: [DateWeekday] -> ShowS #
Show DateMonth
Instance details Defined in GI.GLib.Enums Methods showsPrec :: Int -> DateMonth -> ShowS # show :: DateMonth -> String # showList :: [DateMonth] -> ShowS #
Show DateDMY
Instance details Defined in GI.GLib.Enums Methods showsPrec :: Int -> DateDMY -> ShowS # show :: DateDMY -> String # showList :: [DateDMY] -> ShowS #
Show ConvertError
Instance details Defined in GI.GLib.Enums Methods showsPrec :: Int -> ConvertError -> ShowS # show :: ConvertError -> String # showList :: [ConvertError] -> ShowS #
Show ChecksumType
Instance details Defined in GI.GLib.Enums Methods showsPrec :: Int -> ChecksumType -> ShowS # show :: ChecksumType -> String # showList :: [ChecksumType] -> ShowS #
Show BookmarkFileError
Instance details Defined in GI.GLib.Enums Methods showsPrec :: Int -> BookmarkFileError -> ShowS # show :: BookmarkFileError -> String # showList :: [BookmarkFileError] -> ShowS #
Show UIManagerItemType
Instance details Defined in GI.Gtk.Flags Methods showsPrec :: Int -> UIManagerItemType -> ShowS # show :: UIManagerItemType -> String # showList :: [UIManagerItemType] -> ShowS #
Show TreeModelFlags
Instance details Defined in GI.Gtk.Flags Methods showsPrec :: Int -> TreeModelFlags -> ShowS # show :: TreeModelFlags -> String # showList :: [TreeModelFlags] -> ShowS #
Show ToolPaletteDragTargets
Instance details Defined in GI.Gtk.Flags Methods showsPrec :: Int -> ToolPaletteDragTargets -> ShowS # show :: ToolPaletteDragTargets -> String # showList :: [ToolPaletteDragTargets] -> ShowS #
Show TextSearchFlags
Instance details Defined in GI.Gtk.Flags Methods showsPrec :: Int -> TextSearchFlags -> ShowS # show :: TextSearchFlags -> String # showList :: [TextSearchFlags] -> ShowS #
Show TargetFlags
Instance details Defined in GI.Gtk.Flags Methods showsPrec :: Int -> TargetFlags -> ShowS # show :: TargetFlags -> String # showList :: [TargetFlags] -> ShowS #
Show StyleContextPrintFlags
Instance details Defined in GI.Gtk.Flags Methods showsPrec :: Int -> StyleContextPrintFlags -> ShowS # show :: StyleContextPrintFlags -> String # showList :: [StyleContextPrintFlags] -> ShowS #
Show StateFlags
Instance details Defined in GI.Gtk.Flags Methods showsPrec :: Int -> StateFlags -> ShowS # show :: StateFlags -> String # showList :: [StateFlags] -> ShowS #
Show RegionFlags
Instance details Defined in GI.Gtk.Flags Methods showsPrec :: Int -> RegionFlags -> ShowS # show :: RegionFlags -> String # showList :: [RegionFlags] -> ShowS #
Show RecentFilterFlags
Instance details Defined in GI.Gtk.Flags Methods showsPrec :: Int -> RecentFilterFlags -> ShowS # show :: RecentFilterFlags -> String # showList :: [RecentFilterFlags] -> ShowS #
Show RcFlags
Instance details Defined in GI.Gtk.Flags Methods showsPrec :: Int -> RcFlags -> ShowS # show :: RcFlags -> String # showList :: [RcFlags] -> ShowS #
Show PlacesOpenFlags
Instance details Defined in GI.Gtk.Flags Methods showsPrec :: Int -> PlacesOpenFlags -> ShowS # show :: PlacesOpenFlags -> String # showList :: [PlacesOpenFlags] -> ShowS #
Show JunctionSides
Instance details Defined in GI.Gtk.Flags Methods showsPrec :: Int -> JunctionSides -> ShowS # show :: JunctionSides -> String # showList :: [JunctionSides] -> ShowS #
Show InputHints
Instance details Defined in GI.Gtk.Flags Methods showsPrec :: Int -> InputHints -> ShowS # show :: InputHints -> String # showList :: [InputHints] -> ShowS #
Show IconLookupFlags
Instance details Defined in GI.Gtk.Flags Methods showsPrec :: Int -> IconLookupFlags -> ShowS # show :: IconLookupFlags -> String # showList :: [IconLookupFlags] -> ShowS #
Show FontChooserLevel
Instance details Defined in GI.Gtk.Flags Methods showsPrec :: Int -> FontChooserLevel -> ShowS # show :: FontChooserLevel -> String # showList :: [FontChooserLevel] -> ShowS #
Show FileFilterFlags
Instance details Defined in GI.Gtk.Flags Methods showsPrec :: Int -> FileFilterFlags -> ShowS # show :: FileFilterFlags -> String # showList :: [FileFilterFlags] -> ShowS #
Show EventControllerScrollFlags
Instance details Defined in GI.Gtk.Flags Methods showsPrec :: Int -> EventControllerScrollFlags -> ShowS # show :: EventControllerScrollFlags -> String # showList :: [EventControllerScrollFlags] -> ShowS #
Show DialogFlags
Instance details Defined in GI.Gtk.Flags Methods showsPrec :: Int -> DialogFlags -> ShowS # show :: DialogFlags -> String # showList :: [DialogFlags] -> ShowS #
Show DestDefaults
Instance details Defined in GI.Gtk.Flags Methods showsPrec :: Int -> DestDefaults -> ShowS # show :: DestDefaults -> String # showList :: [DestDefaults] -> ShowS #
Show DebugFlag
Instance details Defined in GI.Gtk.Flags Methods showsPrec :: Int -> DebugFlag -> ShowS # show :: DebugFlag -> String # showList :: [DebugFlag] -> ShowS #
Show CellRendererState
Instance details Defined in GI.Gtk.Flags Methods showsPrec :: Int -> CellRendererState -> ShowS # show :: CellRendererState -> String # showList :: [CellRendererState] -> ShowS #
Show CalendarDisplayOptions
Instance details Defined in GI.Gtk.Flags Methods showsPrec :: Int -> CalendarDisplayOptions -> ShowS # show :: CalendarDisplayOptions -> String # showList :: [CalendarDisplayOptions] -> ShowS #
Show AttachOptions
Instance details Defined in GI.Gtk.Flags Methods showsPrec :: Int -> AttachOptions -> ShowS # show :: AttachOptions -> String # showList :: [AttachOptions] -> ShowS #
Show ApplicationInhibitFlags
Instance details Defined in GI.Gtk.Flags Methods showsPrec :: Int -> ApplicationInhibitFlags -> ShowS # show :: ApplicationInhibitFlags -> String # showList :: [ApplicationInhibitFlags] -> ShowS #
Show AccelFlags
Instance details Defined in GI.Gtk.Flags Methods showsPrec :: Int -> AccelFlags -> ShowS # show :: AccelFlags -> String # showList :: [AccelFlags] -> ShowS #
Show WrapMode
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> WrapMode -> ShowS # show :: WrapMode -> String # showList :: [WrapMode] -> ShowS #
Show WindowType
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> WindowType -> ShowS # show :: WindowType -> String # showList :: [WindowType] -> ShowS #
Show WindowPosition
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> WindowPosition -> ShowS # show :: WindowPosition -> String # showList :: [WindowPosition] -> ShowS #
Show WidgetHelpType
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> WidgetHelpType -> ShowS # show :: WidgetHelpType -> String # showList :: [WidgetHelpType] -> ShowS #
Show Unit
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> Unit -> ShowS # show :: Unit -> String # showList :: [Unit] -> ShowS #
Show TreeViewGridLines
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> TreeViewGridLines -> ShowS # show :: TreeViewGridLines -> String # showList :: [TreeViewGridLines] -> ShowS #
Show TreeViewDropPosition
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> TreeViewDropPosition -> ShowS # show :: TreeViewDropPosition -> String # showList :: [TreeViewDropPosition] -> ShowS #
Show TreeViewColumnSizing
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> TreeViewColumnSizing -> ShowS # show :: TreeViewColumnSizing -> String # showList :: [TreeViewColumnSizing] -> ShowS #
Show ToolbarStyle
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> ToolbarStyle -> ShowS # show :: ToolbarStyle -> String # showList :: [ToolbarStyle] -> ShowS #
Show ToolbarSpaceStyle
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> ToolbarSpaceStyle -> ShowS # show :: ToolbarSpaceStyle -> String # showList :: [ToolbarSpaceStyle] -> ShowS #
Show TextWindowType
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> TextWindowType -> ShowS # show :: TextWindowType -> String # showList :: [TextWindowType] -> ShowS #
Show TextViewLayer
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> TextViewLayer -> ShowS # show :: TextViewLayer -> String # showList :: [TextViewLayer] -> ShowS #
Show TextExtendSelection
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> TextExtendSelection -> ShowS # show :: TextExtendSelection -> String # showList :: [TextExtendSelection] -> ShowS #
Show TextDirection
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> TextDirection -> ShowS # show :: TextDirection -> String # showList :: [TextDirection] -> ShowS #
Show TextBufferTargetInfo
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> TextBufferTargetInfo -> ShowS # show :: TextBufferTargetInfo -> String # showList :: [TextBufferTargetInfo] -> ShowS #
Show StateType
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> StateType -> ShowS # show :: StateType -> String # showList :: [StateType] -> ShowS #
Show StackTransitionType
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> StackTransitionType -> ShowS # show :: StackTransitionType -> String # showList :: [StackTransitionType] -> ShowS #
Show SpinType
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> SpinType -> ShowS # show :: SpinType -> String # showList :: [SpinType] -> ShowS #
Show SpinButtonUpdatePolicy
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> SpinButtonUpdatePolicy -> ShowS # show :: SpinButtonUpdatePolicy -> String # showList :: [SpinButtonUpdatePolicy] -> ShowS #
Show SortType
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> SortType -> ShowS # show :: SortType -> String # showList :: [SortType] -> ShowS #
Show SizeRequestMode
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> SizeRequestMode -> ShowS # show :: SizeRequestMode -> String # showList :: [SizeRequestMode] -> ShowS #
Show SizeGroupMode
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> SizeGroupMode -> ShowS # show :: SizeGroupMode -> String # showList :: [SizeGroupMode] -> ShowS #
Show ShortcutType
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> ShortcutType -> ShowS # show :: ShortcutType -> String # showList :: [ShortcutType] -> ShowS #
Show ShadowType
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> ShadowType -> ShowS # show :: ShadowType -> String # showList :: [ShadowType] -> ShowS #
Show SensitivityType
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> SensitivityType -> ShowS # show :: SensitivityType -> String # showList :: [SensitivityType] -> ShowS #
Show SelectionMode
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> SelectionMode -> ShowS # show :: SelectionMode -> String # showList :: [SelectionMode] -> ShowS #
Show ScrollablePolicy
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> ScrollablePolicy -> ShowS # show :: ScrollablePolicy -> String # showList :: [ScrollablePolicy] -> ShowS #
Show ScrollType
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> ScrollType -> ShowS # show :: ScrollType -> String # showList :: [ScrollType] -> ShowS #
Show ScrollStep
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> ScrollStep -> ShowS # show :: ScrollStep -> String # showList :: [ScrollStep] -> ShowS #
Show RevealerTransitionType
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> RevealerTransitionType -> ShowS # show :: RevealerTransitionType -> String # showList :: [RevealerTransitionType] -> ShowS #
Show ResponseType
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> ResponseType -> ShowS # show :: ResponseType -> String # showList :: [ResponseType] -> ShowS #
Show ResizeMode
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> ResizeMode -> ShowS # show :: ResizeMode -> String # showList :: [ResizeMode] -> ShowS #
Show ReliefStyle
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> ReliefStyle -> ShowS # show :: ReliefStyle -> String # showList :: [ReliefStyle] -> ShowS #
Show RecentSortType
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> RecentSortType -> ShowS # show :: RecentSortType -> String # showList :: [RecentSortType] -> ShowS #
Show RecentManagerError
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> RecentManagerError -> ShowS # show :: RecentManagerError -> String # showList :: [RecentManagerError] -> ShowS #
Show RecentChooserError
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> RecentChooserError -> ShowS # show :: RecentChooserError -> String # showList :: [RecentChooserError] -> ShowS #
Show RcTokenType
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> RcTokenType -> ShowS # show :: RcTokenType -> String # showList :: [RcTokenType] -> ShowS #
Show PropagationPhase
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> PropagationPhase -> ShowS # show :: PropagationPhase -> String # showList :: [PropagationPhase] -> ShowS #
Show PrintStatus
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> PrintStatus -> ShowS # show :: PrintStatus -> String # showList :: [PrintStatus] -> ShowS #
Show PrintQuality
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> PrintQuality -> ShowS # show :: PrintQuality -> String # showList :: [PrintQuality] -> ShowS #
Show PrintPages
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> PrintPages -> ShowS # show :: PrintPages -> String # showList :: [PrintPages] -> ShowS #
Show PrintOperationResult
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> PrintOperationResult -> ShowS # show :: PrintOperationResult -> String # showList :: [PrintOperationResult] -> ShowS #
Show PrintOperationAction
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> PrintOperationAction -> ShowS # show :: PrintOperationAction -> String # showList :: [PrintOperationAction] -> ShowS #
Show PrintError
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> PrintError -> ShowS # show :: PrintError -> String # showList :: [PrintError] -> ShowS #
Show PrintDuplex
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> PrintDuplex -> ShowS # show :: PrintDuplex -> String # showList :: [PrintDuplex] -> ShowS #
Show PositionType
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> PositionType -> ShowS # show :: PositionType -> String # showList :: [PositionType] -> ShowS #
Show PopoverConstraint
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> PopoverConstraint -> ShowS # show :: PopoverConstraint -> String # showList :: [PopoverConstraint] -> ShowS #
Show PolicyType
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> PolicyType -> ShowS # show :: PolicyType -> String # showList :: [PolicyType] -> ShowS #
Show PathType
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> PathType -> ShowS # show :: PathType -> String # showList :: [PathType] -> ShowS #
Show PathPriorityType
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> PathPriorityType -> ShowS # show :: PathPriorityType -> String # showList :: [PathPriorityType] -> ShowS #
Show PanDirection
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> PanDirection -> ShowS # show :: PanDirection -> String # showList :: [PanDirection] -> ShowS #
Show PageSet
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> PageSet -> ShowS # show :: PageSet -> String # showList :: [PageSet] -> ShowS #
Show PageOrientation
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> PageOrientation -> ShowS # show :: PageOrientation -> String # showList :: [PageOrientation] -> ShowS #
Show PadActionType
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> PadActionType -> ShowS # show :: PadActionType -> String # showList :: [PadActionType] -> ShowS #
Show PackType
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> PackType -> ShowS # show :: PackType -> String # showList :: [PackType] -> ShowS #
Show PackDirection
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> PackDirection -> ShowS # show :: PackDirection -> String # showList :: [PackDirection] -> ShowS #
Show Orientation
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> Orientation -> ShowS # show :: Orientation -> String # showList :: [Orientation] -> ShowS #
Show NumberUpLayout
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> NumberUpLayout -> ShowS # show :: NumberUpLayout -> String # showList :: [NumberUpLayout] -> ShowS #
Show NotebookTab
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> NotebookTab -> ShowS # show :: NotebookTab -> String # showList :: [NotebookTab] -> ShowS #
Show MovementStep
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> MovementStep -> ShowS # show :: MovementStep -> String # showList :: [MovementStep] -> ShowS #
Show MessageType
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> MessageType -> ShowS # show :: MessageType -> String # showList :: [MessageType] -> ShowS #
Show MenuDirectionType
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> MenuDirectionType -> ShowS # show :: MenuDirectionType -> String # showList :: [MenuDirectionType] -> ShowS #
Show License
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> License -> ShowS # show :: License -> String # showList :: [License] -> ShowS #
Show LevelBarMode
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> LevelBarMode -> ShowS # show :: LevelBarMode -> String # showList :: [LevelBarMode] -> ShowS #
Show Justification
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> Justification -> ShowS # show :: Justification -> String # showList :: [Justification] -> ShowS #
Show InputPurpose
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> InputPurpose -> ShowS # show :: InputPurpose -> String # showList :: [InputPurpose] -> ShowS #
Show ImageType
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> ImageType -> ShowS # show :: ImageType -> String # showList :: [ImageType] -> ShowS #
Show IconViewDropPosition
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> IconViewDropPosition -> ShowS # show :: IconViewDropPosition -> String # showList :: [IconViewDropPosition] -> ShowS #
Show IconThemeError
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> IconThemeError -> ShowS # show :: IconThemeError -> String # showList :: [IconThemeError] -> ShowS #
Show IconSize
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> IconSize -> ShowS # show :: IconSize -> String # showList :: [IconSize] -> ShowS #
Show IMStatusStyle
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> IMStatusStyle -> ShowS # show :: IMStatusStyle -> String # showList :: [IMStatusStyle] -> ShowS #
Show IMPreeditStyle
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> IMPreeditStyle -> ShowS # show :: IMPreeditStyle -> String # showList :: [IMPreeditStyle] -> ShowS #
Show FileChooserError
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> FileChooserError -> ShowS # show :: FileChooserError -> String # showList :: [FileChooserError] -> ShowS #
Show FileChooserConfirmation
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> FileChooserConfirmation -> ShowS # show :: FileChooserConfirmation -> String # showList :: [FileChooserConfirmation] -> ShowS #
Show FileChooserAction
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> FileChooserAction -> ShowS # show :: FileChooserAction -> String # showList :: [FileChooserAction] -> ShowS #
Show ExpanderStyle
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> ExpanderStyle -> ShowS # show :: ExpanderStyle -> String # showList :: [ExpanderStyle] -> ShowS #
Show EventSequenceState
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> EventSequenceState -> ShowS # show :: EventSequenceState -> String # showList :: [EventSequenceState] -> ShowS #
Show EntryIconPosition
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> EntryIconPosition -> ShowS # show :: EntryIconPosition -> String # showList :: [EntryIconPosition] -> ShowS #
Show DragResult
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> DragResult -> ShowS # show :: DragResult -> String # showList :: [DragResult] -> ShowS #
Show DirectionType
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> DirectionType -> ShowS # show :: DirectionType -> String # showList :: [DirectionType] -> ShowS #
Show DeleteType
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> DeleteType -> ShowS # show :: DeleteType -> String # showList :: [DeleteType] -> ShowS #
Show CssSectionType
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> CssSectionType -> ShowS # show :: CssSectionType -> String # showList :: [CssSectionType] -> ShowS #
Show CssProviderError
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> CssProviderError -> ShowS # show :: CssProviderError -> String # showList :: [CssProviderError] -> ShowS #
Show CornerType
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> CornerType -> ShowS # show :: CornerType -> String # showList :: [CornerType] -> ShowS #
Show CellRendererMode
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> CellRendererMode -> ShowS # show :: CellRendererMode -> String # showList :: [CellRendererMode] -> ShowS #
Show CellRendererAccelMode
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> CellRendererAccelMode -> ShowS # show :: CellRendererAccelMode -> String # showList :: [CellRendererAccelMode] -> ShowS #
Show ButtonsType
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> ButtonsType -> ShowS # show :: ButtonsType -> String # showList :: [ButtonsType] -> ShowS #
Show ButtonRole
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> ButtonRole -> ShowS # show :: ButtonRole -> String # showList :: [ButtonRole] -> ShowS #
Show ButtonBoxStyle
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> ButtonBoxStyle -> ShowS # show :: ButtonBoxStyle -> String # showList :: [ButtonBoxStyle] -> ShowS #
Show BuilderError
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> BuilderError -> ShowS # show :: BuilderError -> String # showList :: [BuilderError] -> ShowS #
Show BorderStyle
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> BorderStyle -> ShowS # show :: BorderStyle -> String # showList :: [BorderStyle] -> ShowS #
Show BaselinePosition
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> BaselinePosition -> ShowS # show :: BaselinePosition -> String # showList :: [BaselinePosition] -> ShowS #
Show AssistantPageType
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> AssistantPageType -> ShowS # show :: AssistantPageType -> String # showList :: [AssistantPageType] -> ShowS #
Show ArrowType
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> ArrowType -> ShowS # show :: ArrowType -> String # showList :: [ArrowType] -> ShowS #
Show ArrowPlacement
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> ArrowPlacement -> ShowS # show :: ArrowPlacement -> String # showList :: [ArrowPlacement] -> ShowS #
Show Align
Instance details Defined in GI.Gtk.Enums Methods showsPrec :: Int -> Align -> ShowS # show :: Align -> String # showList :: [Align] -> ShowS #
Show WrapMode
Instance details Defined in GI.Pango.Enums Methods showsPrec :: Int -> WrapMode -> ShowS # show :: WrapMode -> String # showList :: [WrapMode] -> ShowS #
Show Weight
Instance details Defined in GI.Pango.Enums Methods showsPrec :: Int -> Weight -> ShowS # show :: Weight -> String # showList :: [Weight] -> ShowS #
Show Variant
Instance details Defined in GI.Pango.Enums Methods showsPrec :: Int -> Variant -> ShowS # show :: Variant -> String # showList :: [Variant] -> ShowS #
Show Underline
Instance details Defined in GI.Pango.Enums Methods showsPrec :: Int -> Underline -> ShowS # show :: Underline -> String # showList :: [Underline] -> ShowS #
Show TabAlign
Instance details Defined in GI.Pango.Enums Methods showsPrec :: Int -> TabAlign -> ShowS # show :: TabAlign -> String # showList :: [TabAlign] -> ShowS #
Show Style
Instance details Defined in GI.Pango.Enums Methods showsPrec :: Int -> Style -> ShowS # show :: Style -> String # showList :: [Style] -> ShowS #
Show Stretch
Instance details Defined in GI.Pango.Enums Methods showsPrec :: Int -> Stretch -> ShowS # show :: Stretch -> String # showList :: [Stretch] -> ShowS #
Show Script
Instance details Defined in GI.Pango.Enums Methods showsPrec :: Int -> Script -> ShowS # show :: Script -> String # showList :: [Script] -> ShowS #
Show RenderPart
Instance details Defined in GI.Pango.Enums Methods showsPrec :: Int -> RenderPart -> ShowS # show :: RenderPart -> String # showList :: [RenderPart] -> ShowS #
Show GravityHint
Instance details Defined in GI.Pango.Enums Methods showsPrec :: Int -> GravityHint -> ShowS # show :: GravityHint -> String # showList :: [GravityHint] -> ShowS #
Show Gravity
Instance details Defined in GI.Pango.Enums Methods showsPrec :: Int -> Gravity -> ShowS # show :: Gravity -> String # showList :: [Gravity] -> ShowS #
Show EllipsizeMode
Instance details Defined in GI.Pango.Enums Methods showsPrec :: Int -> EllipsizeMode -> ShowS # show :: EllipsizeMode -> String # showList :: [EllipsizeMode] -> ShowS #
Show Direction
Instance details Defined in GI.Pango.Enums Methods showsPrec :: Int -> Direction -> ShowS # show :: Direction -> String # showList :: [Direction] -> ShowS #
Show CoverageLevel
Instance details Defined in GI.Pango.Enums Methods showsPrec :: Int -> CoverageLevel -> ShowS # show :: CoverageLevel -> String # showList :: [CoverageLevel] -> ShowS #
Show BidiType
Instance details Defined in GI.Pango.Enums Methods showsPrec :: Int -> BidiType -> ShowS # show :: BidiType -> String # showList :: [BidiType] -> ShowS #
Show AttrType
Instance details Defined in GI.Pango.Enums Methods showsPrec :: Int -> AttrType -> ShowS # show :: AttrType -> String # showList :: [AttrType] -> ShowS #
Show Alignment
Instance details Defined in GI.Pango.Enums Methods showsPrec :: Int -> Alignment -> ShowS # show :: Alignment -> String # showList :: [Alignment] -> ShowS #
Show PtyFlags
Instance details Defined in GI.Vte.Flags Methods showsPrec :: Int -> PtyFlags -> ShowS # show :: PtyFlags -> String # showList :: [PtyFlags] -> ShowS #
Show WriteFlags
Instance details Defined in GI.Vte.Enums Methods showsPrec :: Int -> WriteFlags -> ShowS # show :: WriteFlags -> String # showList :: [WriteFlags] -> ShowS #
Show TextBlinkMode
Instance details Defined in GI.Vte.Enums Methods showsPrec :: Int -> TextBlinkMode -> ShowS # show :: TextBlinkMode -> String # showList :: [TextBlinkMode] -> ShowS #
Show RegexError
Instance details Defined in GI.Vte.Enums Methods showsPrec :: Int -> RegexError -> ShowS # show :: RegexError -> String # showList :: [RegexError] -> ShowS #
Show PtyError
Instance details Defined in GI.Vte.Enums Methods showsPrec :: Int -> PtyError -> ShowS # show :: PtyError -> String # showList :: [PtyError] -> ShowS #
Show Format
Instance details Defined in GI.Vte.Enums Methods showsPrec :: Int -> Format -> ShowS # show :: Format -> String # showList :: [Format] -> ShowS #
Show EraseBinding
Instance details Defined in GI.Vte.Enums Methods showsPrec :: Int -> EraseBinding -> ShowS # show :: EraseBinding -> String # showList :: [EraseBinding] -> ShowS #
Show CursorShape
Instance details Defined in GI.Vte.Enums Methods showsPrec :: Int -> CursorShape -> ShowS # show :: CursorShape -> String # showList :: [CursorShape] -> ShowS #
Show CursorBlinkMode
Instance details Defined in GI.Vte.Enums Methods showsPrec :: Int -> CursorBlinkMode -> ShowS # show :: CursorBlinkMode -> String # showList :: [CursorBlinkMode] -> ShowS #
Show Name
Instance details Defined in Data.XML.Types Methods showsPrec :: Int -> Name -> ShowS # show :: Name -> String # showList :: [Name] -> ShowS #
Show Element
Instance details Defined in Text.XML Methods showsPrec :: Int -> Element -> ShowS # show :: Element -> String # showList :: [Element] -> ShowS #
Show AttrOpTag
Instance details Defined in Data.GI.Base.Attributes Methods showsPrec :: Int -> AttrOpTag -> ShowS # show :: AttrOpTag -> String # showList :: [AttrOpTag] -> ShowS #
Show TyVarBndr
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> TyVarBndr -> ShowS # show :: TyVarBndr -> String # showList :: [TyVarBndr] -> ShowS #
Show TextDetails
Instance details Defined in Text.PrettyPrint.Annotated.HughesPJ Methods showsPrec :: Int -> TextDetails -> ShowS # show :: TextDetails -> String # showList :: [TextDetails] -> ShowS #
Show Style
Instance details Defined in Text.PrettyPrint.Annotated.HughesPJ Methods showsPrec :: Int -> Style -> ShowS # show :: Style -> String # showList :: [Style] -> ShowS #
Show Mode
Instance details Defined in Text.PrettyPrint.Annotated.HughesPJ Methods showsPrec :: Int -> Mode -> ShowS # show :: Mode -> String # showList :: [Mode] -> ShowS #
Show OutputOptions
Instance details Defined in Text.Pretty.Simple.Internal.OutputPrinter Methods showsPrec :: Int -> OutputOptions -> ShowS # show :: OutputOptions -> String # showList :: [OutputOptions] -> ShowS #
Show LineNum
Instance details Defined in Text.Pretty.Simple.Internal.ExprToOutput Methods showsPrec :: Int -> LineNum -> ShowS # show :: LineNum -> String # showList :: [LineNum] -> ShowS #
Show PrinterState
Instance details Defined in Text.Pretty.Simple.Internal.ExprToOutput Methods showsPrec :: Int -> PrinterState -> ShowS # show :: PrinterState -> String # showList :: [PrinterState] -> ShowS #
Show NestLevel
Instance details Defined in Text.Pretty.Simple.Internal.Output Methods showsPrec :: Int -> NestLevel -> ShowS # show :: NestLevel -> String # showList :: [NestLevel] -> ShowS #
Show OutputType
Instance details Defined in Text.Pretty.Simple.Internal.Output Methods showsPrec :: Int -> OutputType -> ShowS # show :: OutputType -> String # showList :: [OutputType] -> ShowS #
Show Output
Instance details Defined in Text.Pretty.Simple.Internal.Output Methods showsPrec :: Int -> Output -> ShowS # show :: Output -> String # showList :: [Output] -> ShowS #
Show Expr
Instance details Defined in Text.Pretty.Simple.Internal.Expr Methods showsPrec :: Int -> Expr -> ShowS # show :: Expr -> String # showList :: [Expr] -> ShowS #
Show ColorOptions
Instance details Defined in Text.Pretty.Simple.Internal.Color Methods showsPrec :: Int -> ColorOptions -> ShowS # show :: ColorOptions -> String # showList :: [ColorOptions] -> ShowS #
Show ByteArray	Since: primitive-0.6.3.0
Instance details Defined in Data.Primitive.ByteArray Methods showsPrec :: Int -> ByteArray -> ShowS # show :: ByteArray -> String # showList :: [ByteArray] -> ShowS #
Show Addr
Instance details Defined in Data.Primitive.Types Methods showsPrec :: Int -> Addr -> ShowS # show :: Addr -> String # showList :: [Addr] -> ShowS #
Show InvalidAccess
Instance details Defined in Control.Monad.Trans.Resource.Internal Methods showsPrec :: Int -> InvalidAccess -> ShowS # show :: InvalidAccess -> String # showList :: [InvalidAccess] -> ShowS #
Show ResourceCleanupException
Instance details Defined in Control.Monad.Trans.Resource.Internal Methods showsPrec :: Int -> ResourceCleanupException -> ShowS # show :: ResourceCleanupException -> String # showList :: [ResourceCleanupException] -> ShowS #
Show DType
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods showsPrec :: Int -> DType -> ShowS # show :: DType -> String # showList :: [DType] -> ShowS #
Show DPred
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods showsPrec :: Int -> DPred -> ShowS # show :: DPred -> String # showList :: [DPred] -> ShowS #
Show ModName
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> ModName -> ShowS # show :: ModName -> String # showList :: [ModName] -> ShowS #
Show PkgName
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> PkgName -> ShowS # show :: PkgName -> String # showList :: [PkgName] -> ShowS #
Show Module
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Module -> ShowS # show :: Module -> String # showList :: [Module] -> ShowS #
Show OccName
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> OccName -> ShowS # show :: OccName -> String # showList :: [OccName] -> ShowS #
Show NameFlavour
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> NameFlavour -> ShowS # show :: NameFlavour -> String # showList :: [NameFlavour] -> ShowS #
Show NameSpace
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> NameSpace -> ShowS # show :: NameSpace -> String # showList :: [NameSpace] -> ShowS #
Show Loc
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Loc -> ShowS # show :: Loc -> String # showList :: [Loc] -> ShowS #
Show Info
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Info -> ShowS # show :: Info -> String # showList :: [Info] -> ShowS #
Show ModuleInfo
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> ModuleInfo -> ShowS # show :: ModuleInfo -> String # showList :: [ModuleInfo] -> ShowS #
Show Fixity
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Fixity -> ShowS # show :: Fixity -> String # showList :: [Fixity] -> ShowS #
Show FixityDirection
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> FixityDirection -> ShowS # show :: FixityDirection -> String # showList :: [FixityDirection] -> ShowS #
Show Lit
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Lit -> ShowS # show :: Lit -> String # showList :: [Lit] -> ShowS #
Show Body
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Body -> ShowS # show :: Body -> String # showList :: [Body] -> ShowS #
Show Guard
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Guard -> ShowS # show :: Guard -> String # showList :: [Guard] -> ShowS #
Show Stmt
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Stmt -> ShowS # show :: Stmt -> String # showList :: [Stmt] -> ShowS #
Show Range
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Range -> ShowS # show :: Range -> String # showList :: [Range] -> ShowS #
Show DerivClause
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> DerivClause -> ShowS # show :: DerivClause -> String # showList :: [DerivClause] -> ShowS #
Show DerivStrategy
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> DerivStrategy -> ShowS # show :: DerivStrategy -> String # showList :: [DerivStrategy] -> ShowS #
Show TypeFamilyHead
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> TypeFamilyHead -> ShowS # show :: TypeFamilyHead -> String # showList :: [TypeFamilyHead] -> ShowS #
Show TySynEqn
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> TySynEqn -> ShowS # show :: TySynEqn -> String # showList :: [TySynEqn] -> ShowS #
Show Foreign
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Foreign -> ShowS # show :: Foreign -> String # showList :: [Foreign] -> ShowS #
Show Callconv
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Callconv -> ShowS # show :: Callconv -> String # showList :: [Callconv] -> ShowS #
Show Safety
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Safety -> ShowS # show :: Safety -> String # showList :: [Safety] -> ShowS #
Show Pragma
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Pragma -> ShowS # show :: Pragma -> String # showList :: [Pragma] -> ShowS #
Show Inline
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Inline -> ShowS # show :: Inline -> String # showList :: [Inline] -> ShowS #
Show RuleMatch
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> RuleMatch -> ShowS # show :: RuleMatch -> String # showList :: [RuleMatch] -> ShowS #
Show Phases
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Phases -> ShowS # show :: Phases -> String # showList :: [Phases] -> ShowS #
Show RuleBndr
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> RuleBndr -> ShowS # show :: RuleBndr -> String # showList :: [RuleBndr] -> ShowS #
Show AnnTarget
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> AnnTarget -> ShowS # show :: AnnTarget -> String # showList :: [AnnTarget] -> ShowS #
Show SourceUnpackedness
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> SourceUnpackedness -> ShowS # show :: SourceUnpackedness -> String # showList :: [SourceUnpackedness] -> ShowS #
Show SourceStrictness
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> SourceStrictness -> ShowS # show :: SourceStrictness -> String # showList :: [SourceStrictness] -> ShowS #
Show DecidedStrictness
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> DecidedStrictness -> ShowS # show :: DecidedStrictness -> String # showList :: [DecidedStrictness] -> ShowS #
Show Bang
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Bang -> ShowS # show :: Bang -> String # showList :: [Bang] -> ShowS #
Show PatSynDir
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> PatSynDir -> ShowS # show :: PatSynDir -> String # showList :: [PatSynDir] -> ShowS #
Show PatSynArgs
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> PatSynArgs -> ShowS # show :: PatSynArgs -> String # showList :: [PatSynArgs] -> ShowS #
Show FamilyResultSig
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> FamilyResultSig -> ShowS # show :: FamilyResultSig -> String # showList :: [FamilyResultSig] -> ShowS #
Show TyLit
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> TyLit -> ShowS # show :: TyLit -> String # showList :: [TyLit] -> ShowS #
Show Role
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Role -> ShowS # show :: Role -> String # showList :: [Role] -> ShowS #
Show AnnLookup
Instance details Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> AnnLookup -> ShowS # show :: AnnLookup -> String # showList :: [AnnLookup] -> ShowS #
Show DatatypeInfo
Instance details Defined in Language.Haskell.TH.Datatype Methods showsPrec :: Int -> DatatypeInfo -> ShowS # show :: DatatypeInfo -> String # showList :: [DatatypeInfo] -> ShowS #
Show DatatypeVariant
Instance details Defined in Language.Haskell.TH.Datatype Methods showsPrec :: Int -> DatatypeVariant -> ShowS # show :: DatatypeVariant -> String # showList :: [DatatypeVariant] -> ShowS #
Show ConstructorInfo
Instance details Defined in Language.Haskell.TH.Datatype Methods showsPrec :: Int -> ConstructorInfo -> ShowS # show :: ConstructorInfo -> String # showList :: [ConstructorInfo] -> ShowS #
Show ConstructorVariant
Instance details Defined in Language.Haskell.TH.Datatype Methods showsPrec :: Int -> ConstructorVariant -> ShowS # show :: ConstructorVariant -> String # showList :: [ConstructorVariant] -> ShowS #
Show FieldStrictness
Instance details Defined in Language.Haskell.TH.Datatype Methods showsPrec :: Int -> FieldStrictness -> ShowS # show :: FieldStrictness -> String # showList :: [FieldStrictness] -> ShowS #
Show Unpackedness
Instance details Defined in Language.Haskell.TH.Datatype Methods showsPrec :: Int -> Unpackedness -> ShowS # show :: Unpackedness -> String # showList :: [Unpackedness] -> ShowS #
Show Strictness
Instance details Defined in Language.Haskell.TH.Datatype Methods showsPrec :: Int -> Strictness -> ShowS # show :: Strictness -> String # showList :: [Strictness] -> ShowS #
Show DExp
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods showsPrec :: Int -> DExp -> ShowS # show :: DExp -> String # showList :: [DExp] -> ShowS #
Show DPat
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods showsPrec :: Int -> DPat -> ShowS # show :: DPat -> String # showList :: [DPat] -> ShowS #
Show DTyVarBndr
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods showsPrec :: Int -> DTyVarBndr -> ShowS # show :: DTyVarBndr -> String # showList :: [DTyVarBndr] -> ShowS #
Show DMatch
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods showsPrec :: Int -> DMatch -> ShowS # show :: DMatch -> String # showList :: [DMatch] -> ShowS #
Show DClause
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods showsPrec :: Int -> DClause -> ShowS # show :: DClause -> String # showList :: [DClause] -> ShowS #
Show DLetDec
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods showsPrec :: Int -> DLetDec -> ShowS # show :: DLetDec -> String # showList :: [DLetDec] -> ShowS #
Show NewOrData
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods showsPrec :: Int -> NewOrData -> ShowS # show :: NewOrData -> String # showList :: [NewOrData] -> ShowS #
Show DDec
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods showsPrec :: Int -> DDec -> ShowS # show :: DDec -> String # showList :: [DDec] -> ShowS #
Show DPatSynDir
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods showsPrec :: Int -> DPatSynDir -> ShowS # show :: DPatSynDir -> String # showList :: [DPatSynDir] -> ShowS #
Show DTypeFamilyHead
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods showsPrec :: Int -> DTypeFamilyHead -> ShowS # show :: DTypeFamilyHead -> String # showList :: [DTypeFamilyHead] -> ShowS #
Show DFamilyResultSig
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods showsPrec :: Int -> DFamilyResultSig -> ShowS # show :: DFamilyResultSig -> String # showList :: [DFamilyResultSig] -> ShowS #
Show DCon
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods showsPrec :: Int -> DCon -> ShowS # show :: DCon -> String # showList :: [DCon] -> ShowS #
Show DConFields
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods showsPrec :: Int -> DConFields -> ShowS # show :: DConFields -> String # showList :: [DConFields] -> ShowS #
Show DForeign
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods showsPrec :: Int -> DForeign -> ShowS # show :: DForeign -> String # showList :: [DForeign] -> ShowS #
Show DPragma
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods showsPrec :: Int -> DPragma -> ShowS # show :: DPragma -> String # showList :: [DPragma] -> ShowS #
Show DRuleBndr
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods showsPrec :: Int -> DRuleBndr -> ShowS # show :: DRuleBndr -> String # showList :: [DRuleBndr] -> ShowS #
Show DTySynEqn
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods showsPrec :: Int -> DTySynEqn -> ShowS # show :: DTySynEqn -> String # showList :: [DTySynEqn] -> ShowS #
Show DInfo
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods showsPrec :: Int -> DInfo -> ShowS # show :: DInfo -> String # showList :: [DInfo] -> ShowS #
Show DDerivClause
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods showsPrec :: Int -> DDerivClause -> ShowS # show :: DDerivClause -> String # showList :: [DDerivClause] -> ShowS #
Show DDerivStrategy
Instance details Defined in Language.Haskell.TH.Desugar.AST Methods showsPrec :: Int -> DDerivStrategy -> ShowS # show :: DDerivStrategy -> String # showList :: [DDerivStrategy] -> ShowS #
Show ZonedTime
Instance details Defined in Data.Time.LocalTime.Internal.ZonedTime Methods showsPrec :: Int -> ZonedTime -> ShowS # show :: ZonedTime -> String # showList :: [ZonedTime] -> ShowS #
Show TimeLocale
Instance details Defined in Data.Time.Format.Locale Methods showsPrec :: Int -> TimeLocale -> ShowS # show :: TimeLocale -> String # showList :: [TimeLocale] -> ShowS #
Show LocalTime
Instance details Defined in Data.Time.LocalTime.Internal.LocalTime Methods showsPrec :: Int -> LocalTime -> ShowS # show :: LocalTime -> String # showList :: [LocalTime] -> ShowS #
Show TimeOfDay
Instance details Defined in Data.Time.LocalTime.Internal.TimeOfDay Methods showsPrec :: Int -> TimeOfDay -> ShowS # show :: TimeOfDay -> String # showList :: [TimeOfDay] -> ShowS #
Show TimeZone
Instance details Defined in Data.Time.LocalTime.Internal.TimeZone Methods showsPrec :: Int -> TimeZone -> ShowS # show :: TimeZone -> String # showList :: [TimeZone] -> ShowS #
Show DiffTime
Instance details Defined in Data.Time.Clock.Internal.DiffTime Methods showsPrec :: Int -> DiffTime -> ShowS # show :: DiffTime -> String # showList :: [DiffTime] -> ShowS #
Show Event
Instance details Defined in Data.XML.Types Methods showsPrec :: Int -> Event -> ShowS # show :: Event -> String # showList :: [Event] -> ShowS #
Show Document
Instance details Defined in Text.XML Methods showsPrec :: Int -> Document -> ShowS # show :: Document -> String # showList :: [Document] -> ShowS #
Show Node
Instance details Defined in Text.XML Methods showsPrec :: Int -> Node -> ShowS # show :: Node -> String # showList :: [Node] -> ShowS #
Show XMLException
Instance details Defined in Text.XML Methods showsPrec :: Int -> XMLException -> ShowS # show :: XMLException -> String # showList :: [XMLException] -> ShowS #
Show UnresolvedEntityException
Instance details Defined in Text.XML Methods showsPrec :: Int -> UnresolvedEntityException -> ShowS # show :: UnresolvedEntityException -> String # showList :: [UnresolvedEntityException] -> ShowS #
Show ExternalID
Instance details Defined in Data.XML.Types Methods showsPrec :: Int -> ExternalID -> ShowS # show :: ExternalID -> String # showList :: [ExternalID] -> ShowS #
Show Doctype
Instance details Defined in Data.XML.Types Methods showsPrec :: Int -> Doctype -> ShowS # show :: Doctype -> String # showList :: [Doctype] -> ShowS #
Show Miscellaneous
Instance details Defined in Data.XML.Types Methods showsPrec :: Int -> Miscellaneous -> ShowS # show :: Miscellaneous -> String # showList :: [Miscellaneous] -> ShowS #
Show Instruction
Instance details Defined in Data.XML.Types Methods showsPrec :: Int -> Instruction -> ShowS # show :: Instruction -> String # showList :: [Instruction] -> ShowS #
Show Prologue
Instance details Defined in Data.XML.Types Methods showsPrec :: Int -> Prologue -> ShowS # show :: Prologue -> String # showList :: [Prologue] -> ShowS #
Show Document
Instance details Defined in Data.XML.Types Methods showsPrec :: Int -> Document -> ShowS # show :: Document -> String # showList :: [Document] -> ShowS #
Show Node
Instance details Defined in Data.XML.Types Methods showsPrec :: Int -> Node -> ShowS # show :: Node -> String # showList :: [Node] -> ShowS #
Show Element
Instance details Defined in Data.XML.Types Methods showsPrec :: Int -> Element -> ShowS # show :: Element -> String # showList :: [Element] -> ShowS #
Show Content
Instance details Defined in Data.XML.Types Methods showsPrec :: Int -> Content -> ShowS # show :: Content -> String # showList :: [Content] -> ShowS #
Show DateFormatSpec
Instance details Defined in Data.Time.Format.Parse Methods showsPrec :: Int -> DateFormatSpec -> ShowS # show :: DateFormatSpec -> String # showList :: [DateFormatSpec] -> ShowS #
Show Padding
Instance details Defined in Data.Time.Format.Parse Methods showsPrec :: Int -> Padding -> ShowS # show :: Padding -> String # showList :: [Padding] -> ShowS #
Show NullError
Instance details Defined in Data.NonNull Methods showsPrec :: Int -> NullError -> ShowS # show :: NullError -> String # showList :: [NullError] -> ShowS #
Show InterpType
Instance details Defined in GI.GdkPixbuf.Enums Methods showsPrec :: Int -> InterpType -> ShowS # show :: InterpType -> String # showList :: [InterpType] -> ShowS #
Show Colorspace
Instance details Defined in GI.GdkPixbuf.Enums Methods showsPrec :: Int -> Colorspace -> ShowS # show :: Colorspace -> String # showList :: [Colorspace] -> ShowS #
Show PixbufRotation
Instance details Defined in GI.GdkPixbuf.Enums Methods showsPrec :: Int -> PixbufRotation -> ShowS # show :: PixbufRotation -> String # showList :: [PixbufRotation] -> ShowS #
Show TypeFlags
Instance details Defined in GI.GObject.Flags Methods showsPrec :: Int -> TypeFlags -> ShowS # show :: TypeFlags -> String # showList :: [TypeFlags] -> ShowS #
Show PixbufAlphaMode
Instance details Defined in GI.GdkPixbuf.Enums Methods showsPrec :: Int -> PixbufAlphaMode -> ShowS # show :: PixbufAlphaMode -> String # showList :: [PixbufAlphaMode] -> ShowS #
Show PixbufError
Instance details Defined in GI.GdkPixbuf.Enums Methods showsPrec :: Int -> PixbufError -> ShowS # show :: PixbufError -> String # showList :: [PixbufError] -> ShowS #
Show BindingFlags
Instance details Defined in GI.GObject.Flags Methods showsPrec :: Int -> BindingFlags -> ShowS # show :: BindingFlags -> String # showList :: [BindingFlags] -> ShowS #
Show CoordType
Instance details Defined in GI.Atk.Enums Methods showsPrec :: Int -> CoordType -> ShowS # show :: CoordType -> String # showList :: [CoordType] -> ShowS #
Show Layer
Instance details Defined in GI.Atk.Enums Methods showsPrec :: Int -> Layer -> ShowS # show :: Layer -> String # showList :: [Layer] -> ShowS #
Show ScrollType
Instance details Defined in GI.Atk.Enums Methods showsPrec :: Int -> ScrollType -> ShowS # show :: ScrollType -> String # showList :: [ScrollType] -> ShowS #
Show TextClipType
Instance details Defined in GI.Atk.Enums Methods showsPrec :: Int -> TextClipType -> ShowS # show :: TextClipType -> String # showList :: [TextClipType] -> ShowS #
Show TextGranularity
Instance details Defined in GI.Atk.Enums Methods showsPrec :: Int -> TextGranularity -> ShowS # show :: TextGranularity -> String # showList :: [TextGranularity] -> ShowS #
Show TextBoundary
Instance details Defined in GI.Atk.Enums Methods showsPrec :: Int -> TextBoundary -> ShowS # show :: TextBoundary -> String # showList :: [TextBoundary] -> ShowS #
Show RelationType
Instance details Defined in GI.Atk.Enums Methods showsPrec :: Int -> RelationType -> ShowS # show :: RelationType -> String # showList :: [RelationType] -> ShowS #
Show Role
Instance details Defined in GI.Atk.Enums Methods showsPrec :: Int -> Role -> ShowS # show :: Role -> String # showList :: [Role] -> ShowS #
Show KeyEventType
Instance details Defined in GI.Atk.Enums Methods showsPrec :: Int -> KeyEventType -> ShowS # show :: KeyEventType -> String # showList :: [KeyEventType] -> ShowS #
Show StateType
Instance details Defined in GI.Atk.Enums Methods showsPrec :: Int -> StateType -> ShowS # show :: StateType -> String # showList :: [StateType] -> ShowS #
Show TextAttribute
Instance details Defined in GI.Atk.Enums Methods showsPrec :: Int -> TextAttribute -> ShowS # show :: TextAttribute -> String # showList :: [TextAttribute] -> ShowS #
Show ValueType
Instance details Defined in GI.Atk.Enums Methods showsPrec :: Int -> ValueType -> ShowS # show :: ValueType -> String # showList :: [ValueType] -> ShowS #
Show SignalFlags
Instance details Defined in GI.GObject.Flags Methods showsPrec :: Int -> SignalFlags -> ShowS # show :: SignalFlags -> String # showList :: [SignalFlags] -> ShowS #
Show ConnectFlags
Instance details Defined in GI.GObject.Flags Methods showsPrec :: Int -> ConnectFlags -> ShowS # show :: ConnectFlags -> String # showList :: [ConnectFlags] -> ShowS #
Show ParamFlags
Instance details Defined in GI.GObject.Flags Methods showsPrec :: Int -> ParamFlags -> ShowS # show :: ParamFlags -> String # showList :: [ParamFlags] -> ShowS #
Show SignalMatchType
Instance details Defined in GI.GObject.Flags Methods showsPrec :: Int -> SignalMatchType -> ShowS # show :: SignalMatchType -> String # showList :: [SignalMatchType] -> ShowS #
Show TypeDebugFlags
Instance details Defined in GI.GObject.Flags Methods showsPrec :: Int -> TypeDebugFlags -> ShowS # show :: TypeDebugFlags -> String # showList :: [TypeDebugFlags] -> ShowS #
Show TypeFundamentalFlags
Instance details Defined in GI.GObject.Flags Methods showsPrec :: Int -> TypeFundamentalFlags -> ShowS # show :: TypeFundamentalFlags -> String # showList :: [TypeFundamentalFlags] -> ShowS #
Show TMStateInvariantErr Source #
Instance details Defined in Termonad.Types Methods showsPrec :: Int -> TMStateInvariantErr -> ShowS # show :: TMStateInvariantErr -> String # showList :: [TMStateInvariantErr] -> ShowS #
Show TabsDoNotMatch Source #
Instance details Defined in Termonad.Types Methods showsPrec :: Int -> TabsDoNotMatch -> ShowS # show :: TabsDoNotMatch -> String # showList :: [TabsDoNotMatch] -> ShowS #
Show FocusNotSameErr Source #
Instance details Defined in Termonad.Types Methods showsPrec :: Int -> FocusNotSameErr -> ShowS # show :: FocusNotSameErr -> String # showList :: [FocusNotSameErr] -> ShowS #
Show ConfigHooks Source #
Instance details Defined in Termonad.Types Methods showsPrec :: Int -> ConfigHooks -> ShowS # show :: ConfigHooks -> String # showList :: [ConfigHooks] -> ShowS #
Show TMConfig Source #
Instance details Defined in Termonad.Types Methods showsPrec :: Int -> TMConfig -> ShowS # show :: TMConfig -> String # showList :: [TMConfig] -> ShowS #
Show ConfigOptions Source #
Instance details Defined in Termonad.Types Methods showsPrec :: Int -> ConfigOptions -> ShowS # show :: ConfigOptions -> String # showList :: [ConfigOptions] -> ShowS #
Show ShowTabBar Source #
Instance details Defined in Termonad.Types Methods showsPrec :: Int -> ShowTabBar -> ShowS # show :: ShowTabBar -> String # showList :: [ShowTabBar] -> ShowS #
Show ShowScrollbar Source #
Instance details Defined in Termonad.Types Methods showsPrec :: Int -> ShowScrollbar -> ShowS # show :: ShowScrollbar -> String # showList :: [ShowScrollbar] -> ShowS #
Show FontConfig Source #
Instance details Defined in Termonad.Types Methods showsPrec :: Int -> FontConfig -> ShowS # show :: FontConfig -> String # showList :: [FontConfig] -> ShowS #
Show FontSize Source #
Instance details Defined in Termonad.Types Methods showsPrec :: Int -> FontSize -> ShowS # show :: FontSize -> String # showList :: [FontSize] -> ShowS #
Show TMState' Source #
Instance details Defined in Termonad.Types Methods showsPrec :: Int -> TMState' -> ShowS # show :: TMState' -> String # showList :: [TMState'] -> ShowS #
Show TMNotebook Source #
Instance details Defined in Termonad.Types Methods showsPrec :: Int -> TMNotebook -> ShowS # show :: TMNotebook -> String # showList :: [TMNotebook] -> ShowS #
Show TMNotebookTab Source #
Instance details Defined in Termonad.Types Methods showsPrec :: Int -> TMNotebookTab -> ShowS # show :: TMNotebookTab -> String # showList :: [TMNotebookTab] -> ShowS #
Show TMTerm Source #
Instance details Defined in Termonad.Types Methods showsPrec :: Int -> TMTerm -> ShowS # show :: TMTerm -> String # showList :: [TMTerm] -> ShowS #
Show Key Source #
Instance details Defined in Termonad.Keys Methods showsPrec :: Int -> Key -> ShowS # show :: Key -> String # showList :: [Key] -> ShowS #
Show a => Show [a]	Since: base-2.1
Instance details Defined in GHC.Show Methods showsPrec :: Int -> [a] -> ShowS # show :: [a] -> String # showList :: [[a]] -> ShowS #
Show a => Show (Maybe a)	Since: base-2.1
Instance details Defined in GHC.Show Methods showsPrec :: Int -> Maybe a -> ShowS # show :: Maybe a -> String # showList :: [Maybe a] -> ShowS #
Show a => Show (Ratio a)	Since: base-2.0.1
Instance details Defined in GHC.Real Methods showsPrec :: Int -> Ratio a -> ShowS # show :: Ratio a -> String # showList :: [Ratio a] -> ShowS #
Show (Ptr a)	Since: base-2.1
Instance details Defined in GHC.Ptr Methods showsPrec :: Int -> Ptr a -> ShowS # show :: Ptr a -> String # showList :: [Ptr a] -> ShowS #
Show (FunPtr a)	Since: base-2.1
Instance details Defined in GHC.Ptr Methods showsPrec :: Int -> FunPtr a -> ShowS # show :: FunPtr a -> String # showList :: [FunPtr a] -> ShowS #
Show p => Show (Par1 p)	Since: base-4.7.0.0
Instance details Defined in GHC.Generics Methods showsPrec :: Int -> Par1 p -> ShowS # show :: Par1 p -> String # showList :: [Par1 p] -> ShowS #
Show a => Show (Last a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods showsPrec :: Int -> Last a -> ShowS # show :: Last a -> String # showList :: [Last a] -> ShowS #
Show vertex => Show (SCC vertex)	Since: containers-0.5.9
Instance details Defined in Data.Graph Methods showsPrec :: Int -> SCC vertex -> ShowS # show :: SCC vertex -> String # showList :: [SCC vertex] -> ShowS #
Show (ForeignPtr a)	Since: base-2.1
Instance details Defined in GHC.ForeignPtr Methods showsPrec :: Int -> ForeignPtr a -> ShowS # show :: ForeignPtr a -> String # showList :: [ForeignPtr a] -> ShowS #
Show a => Show (Complex a)	Since: base-2.1
Instance details Defined in Data.Complex Methods showsPrec :: Int -> Complex a -> ShowS # show :: Complex a -> String # showList :: [Complex a] -> ShowS #
Show a => Show (Min a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods showsPrec :: Int -> Min a -> ShowS # show :: Min a -> String # showList :: [Min a] -> ShowS #
Show a => Show (Max a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods showsPrec :: Int -> Max a -> ShowS # show :: Max a -> String # showList :: [Max a] -> ShowS #
Show a => Show (First a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods showsPrec :: Int -> First a -> ShowS # show :: First a -> String # showList :: [First a] -> ShowS #
Show m => Show (WrappedMonoid m)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods showsPrec :: Int -> WrappedMonoid m -> ShowS # show :: WrappedMonoid m -> String # showList :: [WrappedMonoid m] -> ShowS #
Show a => Show (Option a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods showsPrec :: Int -> Option a -> ShowS # show :: Option a -> String # showList :: [Option a] -> ShowS #
Show a => Show (ZipList a)	Since: base-4.7.0.0
Instance details Defined in Control.Applicative Methods showsPrec :: Int -> ZipList a -> ShowS # show :: ZipList a -> String # showList :: [ZipList a] -> ShowS #
Show a => Show (Identity a)	This instance would be equivalent to the derived instances of the `Identity` newtype if the `runIdentity` field were removed Since: base-4.8.0.0
Instance details Defined in Data.Functor.Identity Methods showsPrec :: Int -> Identity a -> ShowS # show :: Identity a -> String # showList :: [Identity a] -> ShowS #
Show a => Show (First a)	Since: base-2.1
Instance details Defined in Data.Monoid Methods showsPrec :: Int -> First a -> ShowS # show :: First a -> String # showList :: [First a] -> ShowS #
Show a => Show (Last a)	Since: base-2.1
Instance details Defined in Data.Monoid Methods showsPrec :: Int -> Last a -> ShowS # show :: Last a -> String # showList :: [Last a] -> ShowS #
Show a => Show (Dual a)	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods showsPrec :: Int -> Dual a -> ShowS # show :: Dual a -> String # showList :: [Dual a] -> ShowS #
Show a => Show (Sum a)	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods showsPrec :: Int -> Sum a -> ShowS # show :: Sum a -> String # showList :: [Sum a] -> ShowS #
Show a => Show (Product a)	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods showsPrec :: Int -> Product a -> ShowS # show :: Product a -> String # showList :: [Product a] -> ShowS #
Show a => Show (Down a)	Since: base-4.7.0.0
Instance details Defined in Data.Ord Methods showsPrec :: Int -> Down a -> ShowS # show :: Down a -> String # showList :: [Down a] -> ShowS #
Show a => Show (NonEmpty a)	Since: base-4.11.0.0
Instance details Defined in GHC.Show Methods showsPrec :: Int -> NonEmpty a -> ShowS # show :: NonEmpty a -> String # showList :: [NonEmpty a] -> ShowS #
Show a => Show (Vector a)
Instance details Defined in Data.Vector Methods showsPrec :: Int -> Vector a -> ShowS # show :: Vector a -> String # showList :: [Vector a] -> ShowS #
Show a => Show (HashSet a)
Instance details Defined in Data.HashSet Methods showsPrec :: Int -> HashSet a -> ShowS # show :: HashSet a -> String # showList :: [HashSet a] -> ShowS #
Show a => Show (Set a)
Instance details Defined in Data.Set.Internal Methods showsPrec :: Int -> Set a -> ShowS # show :: Set a -> String # showList :: [Set a] -> ShowS #
Show a => Show (Seq a)
Instance details Defined in Data.Sequence.Internal Methods showsPrec :: Int -> Seq a -> ShowS # show :: Seq a -> String # showList :: [Seq a] -> ShowS #
Show a => Show (IntMap a)
Instance details Defined in Data.IntMap.Internal Methods showsPrec :: Int -> IntMap a -> ShowS # show :: IntMap a -> String # showList :: [IntMap a] -> ShowS #
Show (Memoized a)
Instance details Defined in UnliftIO.Memoize Methods showsPrec :: Int -> Memoized a -> ShowS # show :: Memoized a -> String # showList :: [Memoized a] -> ShowS #
Show mono => Show (NonNull mono)
Instance details Defined in Data.NonNull Methods showsPrec :: Int -> NonNull mono -> ShowS # show :: NonNull mono -> String # showList :: [NonNull mono] -> ShowS #
Show a => Show (DList a)
Instance details Defined in Data.DList Methods showsPrec :: Int -> DList a -> ShowS # show :: DList a -> String # showList :: [DList a] -> ShowS #
Show a => Show (RGB a)
Instance details Defined in Data.Colour.RGB Methods showsPrec :: Int -> RGB a -> ShowS # show :: RGB a -> String # showList :: [RGB a] -> ShowS #
Show a => Show (Flush a)
Instance details Defined in Data.Conduit.Internal.Conduit Methods showsPrec :: Int -> Flush a -> ShowS # show :: Flush a -> String # showList :: [Flush a] -> ShowS #
Show a => Show (Tree a)
Instance details Defined in Data.Tree Methods showsPrec :: Int -> Tree a -> ShowS # show :: Tree a -> String # showList :: [Tree a] -> ShowS #
Show a => Show (ViewL a)
Instance details Defined in Data.Sequence.Internal Methods showsPrec :: Int -> ViewL a -> ShowS # show :: ViewL a -> String # showList :: [ViewL a] -> ShowS #
Show a => Show (ViewR a)
Instance details Defined in Data.Sequence.Internal Methods showsPrec :: Int -> ViewR a -> ShowS # show :: ViewR a -> String # showList :: [ViewR a] -> ShowS #
Show a => Show (FocusList a)
Instance details Defined in Data.FocusList Methods showsPrec :: Int -> FocusList a -> ShowS # show :: FocusList a -> String # showList :: [FocusList a] -> ShowS #
Show a => Show (Hashed a)
Instance details Defined in Data.Hashable.Class Methods showsPrec :: Int -> Hashed a -> ShowS # show :: Hashed a -> String # showList :: [Hashed a] -> ShowS #
(Show a, Prim a) => Show (Vector a)
Instance details Defined in Data.Vector.Primitive Methods showsPrec :: Int -> Vector a -> ShowS # show :: Vector a -> String # showList :: [Vector a] -> ShowS #
(Show a, Storable a) => Show (Vector a)
Instance details Defined in Data.Vector.Storable Methods showsPrec :: Int -> Vector a -> ShowS # show :: Vector a -> String # showList :: [Vector a] -> ShowS #
Show (Doc a)
Instance details Defined in Text.PrettyPrint.Annotated.HughesPJ Methods showsPrec :: Int -> Doc a -> ShowS # show :: Doc a -> String # showList :: [Doc a] -> ShowS #
Show a => Show (AnnotDetails a)
Instance details Defined in Text.PrettyPrint.Annotated.HughesPJ Methods showsPrec :: Int -> AnnotDetails a -> ShowS # show :: AnnotDetails a -> String # showList :: [AnnotDetails a] -> ShowS #
Show a => Show (Span a)
Instance details Defined in Text.PrettyPrint.Annotated.HughesPJ Methods showsPrec :: Int -> Span a -> ShowS # show :: Span a -> String # showList :: [Span a] -> ShowS #
Show a => Show (CommaSeparated a)
Instance details Defined in Text.Pretty.Simple.Internal.Expr Methods showsPrec :: Int -> CommaSeparated a -> ShowS # show :: CommaSeparated a -> String # showList :: [CommaSeparated a] -> ShowS #
(Show a, PrimUnlifted a) => Show (UnliftedArray a)	Since: primitive-0.6.4.0
Instance details Defined in Data.Primitive.UnliftedArray Methods showsPrec :: Int -> UnliftedArray a -> ShowS # show :: UnliftedArray a -> String # showList :: [UnliftedArray a] -> ShowS #
(Show a, Prim a) => Show (PrimArray a)	Since: primitive-0.6.4.0
Instance details Defined in Data.Primitive.PrimArray Methods showsPrec :: Int -> PrimArray a -> ShowS # show :: PrimArray a -> String # showList :: [PrimArray a] -> ShowS #
Show a => Show (SmallArray a)
Instance details Defined in Data.Primitive.SmallArray Methods showsPrec :: Int -> SmallArray a -> ShowS # show :: SmallArray a -> String # showList :: [SmallArray a] -> ShowS #
Show a => Show (Array a)
Instance details Defined in Data.Primitive.Array Methods showsPrec :: Int -> Array a -> ShowS # show :: Array a -> String # showList :: [Array a] -> ShowS #
Show (Fin n) Source #
Instance details Defined in Termonad.Config.Vec Methods showsPrec :: Int -> Fin n -> ShowS # show :: Fin n -> String # showList :: [Fin n] -> ShowS #
Show a => Show (Option a) Source #
Instance details Defined in Termonad.Types Methods showsPrec :: Int -> Option a -> ShowS # show :: Option a -> String # showList :: [Option a] -> ShowS #
Show c => Show (ColourConfig c) Source #
Instance details Defined in Termonad.Config.Colour Methods showsPrec :: Int -> ColourConfig c -> ShowS # show :: ColourConfig c -> String # showList :: [ColourConfig c] -> ShowS #
Show c => Show (Palette c) Source #
Instance details Defined in Termonad.Config.Colour Methods showsPrec :: Int -> Palette c -> ShowS # show :: Palette c -> String # showList :: [Palette c] -> ShowS #
(Show a, Show b) => Show (Either a b)	Since: base-3.0
Instance details Defined in Data.Either Methods showsPrec :: Int -> Either a b -> ShowS # show :: Either a b -> String # showList :: [Either a b] -> ShowS #
Show (V1 p)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods showsPrec :: Int -> V1 p -> ShowS # show :: V1 p -> String # showList :: [V1 p] -> ShowS #
Show (U1 p)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods showsPrec :: Int -> U1 p -> ShowS # show :: U1 p -> String # showList :: [U1 p] -> ShowS #
Show (TypeRep a)
Instance details Defined in Data.Typeable.Internal Methods showsPrec :: Int -> TypeRep a -> ShowS # show :: TypeRep a -> String # showList :: [TypeRep a] -> ShowS #
(Show a, Show b) => Show (a, b)	Since: base-2.1
Instance details Defined in GHC.Show Methods showsPrec :: Int -> (a, b) -> ShowS # show :: (a, b) -> String # showList :: [(a, b)] -> ShowS #
Show (ST s a)	Since: base-2.1
Instance details Defined in GHC.ST Methods showsPrec :: Int -> ST s a -> ShowS # show :: ST s a -> String # showList :: [ST s a] -> ShowS #
(Show k, Show a) => Show (Map k a)
Instance details Defined in Data.Map.Internal Methods showsPrec :: Int -> Map k a -> ShowS # show :: Map k a -> String # showList :: [Map k a] -> ShowS #
(Show k, Show v) => Show (HashMap k v)
Instance details Defined in Data.HashMap.Base Methods showsPrec :: Int -> HashMap k v -> ShowS # show :: HashMap k v -> String # showList :: [HashMap k v] -> ShowS #
(Ix a, Show a, Show b) => Show (Array a b)	Since: base-2.1
Instance details Defined in GHC.Arr Methods showsPrec :: Int -> Array a b -> ShowS # show :: Array a b -> String # showList :: [Array a b] -> ShowS #
(Show i, Show r) => Show (IResult i r)
Instance details Defined in Data.Attoparsec.Internal.Types Methods showsPrec :: Int -> IResult i r -> ShowS # show :: IResult i r -> String # showList :: [IResult i r] -> ShowS #
(Show a, Show b) => Show (Arg a b)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods showsPrec :: Int -> Arg a b -> ShowS # show :: Arg a b -> String # showList :: [Arg a b] -> ShowS #
Show (Proxy s)	Since: base-4.7.0.0
Instance details Defined in Data.Proxy Methods showsPrec :: Int -> Proxy s -> ShowS # show :: Proxy s -> String # showList :: [Proxy s] -> ShowS #
(Show1 m, Show a) => Show (MaybeT m a)
Instance details Defined in Control.Monad.Trans.Maybe Methods showsPrec :: Int -> MaybeT m a -> ShowS # show :: MaybeT m a -> String # showList :: [MaybeT m a] -> ShowS #
(Show1 f, Show a) => Show (Cofree f a)
Instance details Defined in Control.Comonad.Cofree Methods showsPrec :: Int -> Cofree f a -> ShowS # show :: Cofree f a -> String # showList :: [Cofree f a] -> ShowS #
(Show1 f, Show a) => Show (Free f a)
Instance details Defined in Control.Monad.Free Methods showsPrec :: Int -> Free f a -> ShowS # show :: Free f a -> String # showList :: [Free f a] -> ShowS #
Show (f a) => Show (Yoneda f a)
Instance details Defined in Data.Functor.Yoneda Methods showsPrec :: Int -> Yoneda f a -> ShowS # show :: Yoneda f a -> String # showList :: [Yoneda f a] -> ShowS #
(Show1 m, Show a) => Show (ListT m a)
Instance details Defined in Control.Monad.Trans.List Methods showsPrec :: Int -> ListT m a -> ShowS # show :: ListT m a -> String # showList :: [ListT m a] -> ShowS #
ShowSing Peano => Show (Sing z) Source #
Instance details Defined in Termonad.Config.Vec Methods showsPrec :: Int -> Sing z -> ShowS # show :: Sing z -> String # showList :: [Sing z] -> ShowS #
Show (Sing n2) => Show (Sing (IFS n2)) Source #
Instance details Defined in Termonad.Config.Vec Methods showsPrec :: Int -> Sing (IFS n2) -> ShowS # show :: Sing (IFS n2) -> String # showList :: [Sing (IFS n2)] -> ShowS #
Show (Sing (IFZ :: IFin (S n) Z)) Source #
Instance details Defined in Termonad.Config.Vec Methods showsPrec :: Int -> Sing IFZ -> ShowS # show :: Sing IFZ -> String # showList :: [Sing IFZ] -> ShowS #
Show (Sing n2) => Show (Sing (FS n2)) Source #
Instance details Defined in Termonad.Config.Vec Methods showsPrec :: Int -> Sing (FS n2) -> ShowS # show :: Sing (FS n2) -> String # showList :: [Sing (FS n2)] -> ShowS #
Show (Sing (FZ :: Fin (S n))) Source #
Instance details Defined in Termonad.Config.Vec Methods showsPrec :: Int -> Sing FZ -> ShowS # show :: Sing FZ -> String # showList :: [Sing FZ] -> ShowS #
Show (MatrixTF ns a) => Show (Matrix ns a) Source #
Instance details Defined in Termonad.Config.Vec Methods showsPrec :: Int -> Matrix ns a -> ShowS # show :: Matrix ns a -> String # showList :: [Matrix ns a] -> ShowS #
Show a => Show (Vec n a) Source #
Instance details Defined in Termonad.Config.Vec Methods showsPrec :: Int -> Vec n a -> ShowS # show :: Vec n a -> String # showList :: [Vec n a] -> ShowS #
Show (IFin x y) Source #
Instance details Defined in Termonad.Config.Vec Methods showsPrec :: Int -> IFin x y -> ShowS # show :: IFin x y -> String # showList :: [IFin x y] -> ShowS #
Show (VarExp msg url)
Instance details Defined in Text.Heterocephalus Methods showsPrec :: Int -> VarExp msg url -> ShowS # show :: VarExp msg url -> String # showList :: [VarExp msg url] -> ShowS #
Show (f p) => Show (Rec1 f p)	Since: base-4.7.0.0
Instance details Defined in GHC.Generics Methods showsPrec :: Int -> Rec1 f p -> ShowS # show :: Rec1 f p -> String # showList :: [Rec1 f p] -> ShowS #
Show (URec Char p)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods showsPrec :: Int -> URec Char p -> ShowS # show :: URec Char p -> String # showList :: [URec Char p] -> ShowS #
Show (URec Double p)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods showsPrec :: Int -> URec Double p -> ShowS # show :: URec Double p -> String # showList :: [URec Double p] -> ShowS #
Show (URec Float p)
Instance details Defined in GHC.Generics Methods showsPrec :: Int -> URec Float p -> ShowS # show :: URec Float p -> String # showList :: [URec Float p] -> ShowS #
Show (URec Int p)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods showsPrec :: Int -> URec Int p -> ShowS # show :: URec Int p -> String # showList :: [URec Int p] -> ShowS #
Show (URec Word p)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods showsPrec :: Int -> URec Word p -> ShowS # show :: URec Word p -> String # showList :: [URec Word p] -> ShowS #
(Show a, Show b, Show c) => Show (a, b, c)	Since: base-2.1
Instance details Defined in GHC.Show Methods showsPrec :: Int -> (a, b, c) -> ShowS # show :: (a, b, c) -> String # showList :: [(a, b, c)] -> ShowS #
Show a => Show (Const a b)	This instance would be equivalent to the derived instances of the `Const` newtype if the `runConst` field were removed Since: base-4.8.0.0
Instance details Defined in Data.Functor.Const Methods showsPrec :: Int -> Const a b -> ShowS # show :: Const a b -> String # showList :: [Const a b] -> ShowS #
Show (f a) => Show (Ap f a)	Since: base-4.12.0.0
Instance details Defined in Data.Monoid Methods showsPrec :: Int -> Ap f a -> ShowS # show :: Ap f a -> String # showList :: [Ap f a] -> ShowS #
Show (f a) => Show (Alt f a)	Since: base-4.8.0.0
Instance details Defined in Data.Semigroup.Internal Methods showsPrec :: Int -> Alt f a -> ShowS # show :: Alt f a -> String # showList :: [Alt f a] -> ShowS #
Show (a :~: b)	Since: base-4.7.0.0
Instance details Defined in Data.Type.Equality Methods showsPrec :: Int -> (a :~: b) -> ShowS # show :: (a :~: b) -> String # showList :: [a :~: b] -> ShowS #
Show (p a a) => Show (Join p a)
Instance details Defined in Data.Bifunctor.Join Methods showsPrec :: Int -> Join p a -> ShowS # show :: Join p a -> String # showList :: [Join p a] -> ShowS #
Show (p (Fix p a) a) => Show (Fix p a)
Instance details Defined in Data.Bifunctor.Fix Methods showsPrec :: Int -> Fix p a -> ShowS # show :: Fix p a -> String # showList :: [Fix p a] -> ShowS #
(Show1 f, Show a) => Show (IdentityT f a)
Instance details Defined in Control.Monad.Trans.Identity Methods showsPrec :: Int -> IdentityT f a -> ShowS # show :: IdentityT f a -> String # showList :: [IdentityT f a] -> ShowS #
(Show w, Show1 m, Show a) => Show (WriterT w m a)
Instance details Defined in Control.Monad.Trans.Writer.Strict Methods showsPrec :: Int -> WriterT w m a -> ShowS # show :: WriterT w m a -> String # showList :: [WriterT w m a] -> ShowS #
(Show w, Show1 m, Show a) => Show (WriterT w m a)
Instance details Defined in Control.Monad.Trans.Writer.Lazy Methods showsPrec :: Int -> WriterT w m a -> ShowS # show :: WriterT w m a -> String # showList :: [WriterT w m a] -> ShowS #
(Show a, Show (f b)) => Show (FreeF f a b)
Instance details Defined in Control.Monad.Trans.Free Methods showsPrec :: Int -> FreeF f a b -> ShowS # show :: FreeF f a b -> String # showList :: [FreeF f a b] -> ShowS #
(Show1 f, Show1 m, Show a) => Show (FreeT f m a)
Instance details Defined in Control.Monad.Trans.Free Methods showsPrec :: Int -> FreeT f m a -> ShowS # show :: FreeT f m a -> String # showList :: [FreeT f m a] -> ShowS #
(Show a, Show (f b)) => Show (CofreeF f a b)
Instance details Defined in Control.Comonad.Trans.Cofree Methods showsPrec :: Int -> CofreeF f a b -> ShowS # show :: CofreeF f a b -> String # showList :: [CofreeF f a b] -> ShowS #
Show (w (CofreeF f a (CofreeT f w a))) => Show (CofreeT f w a)
Instance details Defined in Control.Comonad.Trans.Cofree Methods showsPrec :: Int -> CofreeT f w a -> ShowS # show :: CofreeT f w a -> String # showList :: [CofreeT f w a] -> ShowS #
(Show e, Show1 m, Show a) => Show (ErrorT e m a)
Instance details Defined in Control.Monad.Trans.Error Methods showsPrec :: Int -> ErrorT e m a -> ShowS # show :: ErrorT e m a -> String # showList :: [ErrorT e m a] -> ShowS #
Show b => Show (Tagged s b)
Instance details Defined in Data.Tagged Methods showsPrec :: Int -> Tagged s b -> ShowS # show :: Tagged s b -> String # showList :: [Tagged s b] -> ShowS #
Show c => Show (K1 i c p)	Since: base-4.7.0.0
Instance details Defined in GHC.Generics Methods showsPrec :: Int -> K1 i c p -> ShowS # show :: K1 i c p -> String # showList :: [K1 i c p] -> ShowS #
(Show (f p), Show (g p)) => Show ((f :+: g) p)	Since: base-4.7.0.0
Instance details Defined in GHC.Generics Methods showsPrec :: Int -> (f :+: g) p -> ShowS # show :: (f :+: g) p -> String # showList :: [(f :+: g) p] -> ShowS #
(Show (f p), Show (g p)) => Show ((f :*: g) p)	Since: base-4.7.0.0
Instance details Defined in GHC.Generics Methods showsPrec :: Int -> (f :: g) p -> ShowS # show :: (f :: g) p -> String # showList :: [(f :*: g) p] -> ShowS #
(Show a, Show b, Show c, Show d) => Show (a, b, c, d)	Since: base-2.1
Instance details Defined in GHC.Show Methods showsPrec :: Int -> (a, b, c, d) -> ShowS # show :: (a, b, c, d) -> String # showList :: [(a, b, c, d)] -> ShowS #
(Show1 f, Show1 g, Show a) => Show (Product f g a)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Product Methods showsPrec :: Int -> Product f g a -> ShowS # show :: Product f g a -> String # showList :: [Product f g a] -> ShowS #
(Show1 f, Show1 g, Show a) => Show (Sum f g a)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Sum Methods showsPrec :: Int -> Sum f g a -> ShowS # show :: Sum f g a -> String # showList :: [Sum f g a] -> ShowS #
Show (a :~~: b)	Since: base-4.10.0.0
Instance details Defined in Data.Type.Equality Methods showsPrec :: Int -> (a :~~: b) -> ShowS # show :: (a :~~: b) -> String # showList :: [a :~~: b] -> ShowS #
Show (f p) => Show (M1 i c f p)	Since: base-4.7.0.0
Instance details Defined in GHC.Generics Methods showsPrec :: Int -> M1 i c f p -> ShowS # show :: M1 i c f p -> String # showList :: [M1 i c f p] -> ShowS #
Show (f (g p)) => Show ((f :.: g) p)	Since: base-4.7.0.0
Instance details Defined in GHC.Generics Methods showsPrec :: Int -> (f :.: g) p -> ShowS # show :: (f :.: g) p -> String # showList :: [(f :.: g) p] -> ShowS #
(Show a, Show b, Show c, Show d, Show e) => Show (a, b, c, d, e)	Since: base-2.1
Instance details Defined in GHC.Show Methods showsPrec :: Int -> (a, b, c, d, e) -> ShowS # show :: (a, b, c, d, e) -> String # showList :: [(a, b, c, d, e)] -> ShowS #
(Show1 f, Show1 g, Show a) => Show (Compose f g a)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Compose Methods showsPrec :: Int -> Compose f g a -> ShowS # show :: Compose f g a -> String # showList :: [Compose f g a] -> ShowS #
Show (p a b) => Show (WrappedBifunctor p a b)
Instance details Defined in Data.Bifunctor.Wrapped Methods showsPrec :: Int -> WrappedBifunctor p a b -> ShowS # show :: WrappedBifunctor p a b -> String # showList :: [WrappedBifunctor p a b] -> ShowS #
Show (g b) => Show (Joker g a b)
Instance details Defined in Data.Bifunctor.Joker Methods showsPrec :: Int -> Joker g a b -> ShowS # show :: Joker g a b -> String # showList :: [Joker g a b] -> ShowS #
Show (p b a) => Show (Flip p a b)
Instance details Defined in Data.Bifunctor.Flip Methods showsPrec :: Int -> Flip p a b -> ShowS # show :: Flip p a b -> String # showList :: [Flip p a b] -> ShowS #
Show (f a) => Show (Clown f a b)
Instance details Defined in Data.Bifunctor.Clown Methods showsPrec :: Int -> Clown f a b -> ShowS # show :: Clown f a b -> String # showList :: [Clown f a b] -> ShowS #
(Show a, Show b, Show c, Show d, Show e, Show f) => Show (a, b, c, d, e, f)	Since: base-2.1
Instance details Defined in GHC.Show Methods showsPrec :: Int -> (a, b, c, d, e, f) -> ShowS # show :: (a, b, c, d, e, f) -> String # showList :: [(a, b, c, d, e, f)] -> ShowS #
(Show (p a b), Show (q a b)) => Show (Sum p q a b)
Instance details Defined in Data.Bifunctor.Sum Methods showsPrec :: Int -> Sum p q a b -> ShowS # show :: Sum p q a b -> String # showList :: [Sum p q a b] -> ShowS #
(Show (f a b), Show (g a b)) => Show (Product f g a b)
Instance details Defined in Data.Bifunctor.Product Methods showsPrec :: Int -> Product f g a b -> ShowS # show :: Product f g a b -> String # showList :: [Product f g a b] -> ShowS #
(Show a, Show b, Show c, Show d, Show e, Show f, Show g) => Show (a, b, c, d, e, f, g)	Since: base-2.1
Instance details Defined in GHC.Show Methods showsPrec :: Int -> (a, b, c, d, e, f, g) -> ShowS # show :: (a, b, c, d, e, f, g) -> String # showList :: [(a, b, c, d, e, f, g)] -> ShowS #
Show (f (p a b)) => Show (Tannen f p a b)
Instance details Defined in Data.Bifunctor.Tannen Methods showsPrec :: Int -> Tannen f p a b -> ShowS # show :: Tannen f p a b -> String # showList :: [Tannen f p a b] -> ShowS #
(Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h) => Show (a, b, c, d, e, f, g, h)	Since: base-2.1
Instance details Defined in GHC.Show Methods showsPrec :: Int -> (a, b, c, d, e, f, g, h) -> ShowS # show :: (a, b, c, d, e, f, g, h) -> String # showList :: [(a, b, c, d, e, f, g, h)] -> ShowS #
(Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i) => Show (a, b, c, d, e, f, g, h, i)	Since: base-2.1
Instance details Defined in GHC.Show Methods showsPrec :: Int -> (a, b, c, d, e, f, g, h, i) -> ShowS # show :: (a, b, c, d, e, f, g, h, i) -> String # showList :: [(a, b, c, d, e, f, g, h, i)] -> ShowS #
Show (p (f a) (g b)) => Show (Biff p f g a b)
Instance details Defined in Data.Bifunctor.Biff Methods showsPrec :: Int -> Biff p f g a b -> ShowS # show :: Biff p f g a b -> String # showList :: [Biff p f g a b] -> ShowS #
(Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i, Show j) => Show (a, b, c, d, e, f, g, h, i, j)	Since: base-2.1
Instance details Defined in GHC.Show Methods showsPrec :: Int -> (a, b, c, d, e, f, g, h, i, j) -> ShowS # show :: (a, b, c, d, e, f, g, h, i, j) -> String # showList :: [(a, b, c, d, e, f, g, h, i, j)] -> ShowS #
(Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i, Show j, Show k) => Show (a, b, c, d, e, f, g, h, i, j, k)	Since: base-2.1
Instance details Defined in GHC.Show Methods showsPrec :: Int -> (a, b, c, d, e, f, g, h, i, j, k) -> ShowS # show :: (a, b, c, d, e, f, g, h, i, j, k) -> String # showList :: [(a, b, c, d, e, f, g, h, i, j, k)] -> ShowS #
(Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i, Show j, Show k, Show l) => Show (a, b, c, d, e, f, g, h, i, j, k, l)	Since: base-2.1
Instance details Defined in GHC.Show Methods showsPrec :: Int -> (a, b, c, d, e, f, g, h, i, j, k, l) -> ShowS # show :: (a, b, c, d, e, f, g, h, i, j, k, l) -> String # showList :: [(a, b, c, d, e, f, g, h, i, j, k, l)] -> ShowS #
(Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i, Show j, Show k, Show l, Show m) => Show (a, b, c, d, e, f, g, h, i, j, k, l, m)	Since: base-2.1
Instance details Defined in GHC.Show Methods showsPrec :: Int -> (a, b, c, d, e, f, g, h, i, j, k, l, m) -> ShowS # show :: (a, b, c, d, e, f, g, h, i, j, k, l, m) -> String # showList :: [(a, b, c, d, e, f, g, h, i, j, k, l, m)] -> ShowS #
(Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i, Show j, Show k, Show l, Show m, Show n) => Show (a, b, c, d, e, f, g, h, i, j, k, l, m, n)	Since: base-2.1
Instance details Defined in GHC.Show Methods showsPrec :: Int -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> ShowS # show :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> String # showList :: [(a, b, c, d, e, f, g, h, i, j, k, l, m, n)] -> ShowS #
(Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i, Show j, Show k, Show l, Show m, Show n, Show o) => Show (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o)	Since: base-2.1
Instance details Defined in GHC.Show Methods showsPrec :: Int -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> ShowS # show :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> String # showList :: [(a, b, c, d, e, f, g, h, i, j, k, l, m, n, o)] -> ShowS #

class Typeable (a :: k) #

The class Typeable allows a concrete representation of a type to be calculated.

Minimal complete definition

typeRep#

class IsString a where #

Class for string-like datastructures; used by the overloaded string extension (-XOverloadedStrings in GHC).

Methods

fromString :: String -> a #

Instances

IsString Doc
Instance details Defined in Text.PrettyPrint.HughesPJ Methods fromString :: String -> Doc #
IsString ByteString
Instance details Defined in Data.ByteString.Lazy.Internal Methods fromString :: String -> ByteString #
IsString ByteString
Instance details Defined in Data.ByteString.Internal Methods fromString :: String -> ByteString #
IsString Builder
Instance details Defined in Data.Text.Internal.Builder Methods fromString :: String -> Builder #
IsString Name
Instance details Defined in Data.XML.Types Methods fromString :: String -> Name #
IsString OutputType	`IsString` (and `fromString`) should generally only be used in tests and debugging. There is no way to represent `OutputIndent` and `OutputStringLit`.
Instance details Defined in Text.Pretty.Simple.Internal.Output Methods fromString :: String -> OutputType #
a ~ Char => IsString [a]	`(a ~ Char)` context was introduced in `4.9.0.0` Since: base-2.1
Instance details Defined in Data.String Methods fromString :: String -> [a] #
IsString a => IsString (Identity a)	Since: base-4.9.0.0
Instance details Defined in Data.String Methods fromString :: String -> Identity a #
a ~ Char => IsString (Seq a)	Since: containers-0.5.7
Instance details Defined in Data.Sequence.Internal Methods fromString :: String -> Seq a #
a ~ Char => IsString (DList a)
Instance details Defined in Data.DList Methods fromString :: String -> DList a #
(IsString a, Hashable a) => IsString (Hashed a)
Instance details Defined in Data.Hashable.Class Methods fromString :: String -> Hashed a #
IsString (Doc a)
Instance details Defined in Text.PrettyPrint.Annotated.HughesPJ Methods fromString :: String -> Doc a #
IsString a => IsString (Const a b)	Since: base-4.9.0.0
Instance details Defined in Data.String Methods fromString :: String -> Const a b #
IsString a => IsString (Tagged s a)
Instance details Defined in Data.Tagged Methods fromString :: String -> Tagged s a #

class Functor f => Applicative (f :: Type -> Type) where #

A functor with application, providing operations to

embed pure expressions (pure), and
sequence computations and combine their results (<*> and liftA2).

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:

(<*>) = liftA2 id

liftA2 f x y = f <$> x <*> y

Further, any definition must satisfy the following:

identity

pure id <*> v = v

composition

pure (.) <*> u <*> v <*> w = u <*> (v <*> w)

homomorphism

pure f <*> pure x = pure (f x)

interchange

u <*> pure y = pure ($ y) <*> u

The other methods have the following default definitions, which may be overridden with equivalent specialized implementations:

```
u *> v = (id <$ u) <*> v
```
```
u <* v = liftA2 const u v
```

As a consequence of these laws, the Functor instance for f will satisfy

```
fmap f x = pure f <*> x
```

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

liftA2 p (liftA2 q u v) = liftA2 f u . liftA2 g v

If f is also a Monad, it should satisfy

```
pure = return
```
```
(<*>) = ap
```
```
(*>) = (>>)
```

(which implies that pure and <*> satisfy the applicative functor laws).

Minimal complete definition

pure, ((<*>) | liftA2)

Methods

pure :: a -> f a #

Lift a value.

(<*>) :: f (a -> b) -> f a -> f b infixl 4 #

Sequential application.

A few functors support an implementation of <*> that is more efficient than the default one.

liftA2 :: (a -> b -> c) -> f a -> f b -> f c #

Lift a binary function to actions.

Some functors support an implementation of liftA2 that is more efficient than the default one. In particular, if fmap is an expensive operation, it is likely better to use liftA2 than to fmap over the structure and then use <*>.

(*>) :: f a -> f b -> f b infixl 4 #

Sequence actions, discarding the value of the first argument.

(<*) :: f a -> f b -> f a infixl 4 #

Sequence actions, discarding the value of the second argument.

Instances

Applicative []	Since: base-2.1
Instance details Defined in GHC.Base Methods pure :: a -> [a] # (<>) :: [a -> b] -> [a] -> [b] # liftA2 :: (a -> b -> c) -> [a] -> [b] -> [c] # (>) :: [a] -> [b] -> [b] # (<*) :: [a] -> [b] -> [a] #
Applicative Maybe	Since: base-2.1
Instance details Defined in GHC.Base Methods pure :: a -> Maybe a # (<>) :: Maybe (a -> b) -> Maybe a -> Maybe b # liftA2 :: (a -> b -> c) -> Maybe a -> Maybe b -> Maybe c # (>) :: Maybe a -> Maybe b -> Maybe b # (<*) :: Maybe a -> Maybe b -> Maybe a #
Applicative IO	Since: base-2.1
Instance details Defined in GHC.Base Methods pure :: a -> IO a # (<>) :: IO (a -> b) -> IO a -> IO b # liftA2 :: (a -> b -> c) -> IO a -> IO b -> IO c # (>) :: IO a -> IO b -> IO b # (<*) :: IO a -> IO b -> IO a #
Applicative Par1	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods pure :: a -> Par1 a # (<>) :: Par1 (a -> b) -> Par1 a -> Par1 b # liftA2 :: (a -> b -> c) -> Par1 a -> Par1 b -> Par1 c # (>) :: Par1 a -> Par1 b -> Par1 b # (<*) :: Par1 a -> Par1 b -> Par1 a #
Applicative Q
Instance details Defined in Language.Haskell.TH.Syntax Methods pure :: a -> Q a # (<>) :: Q (a -> b) -> Q a -> Q b # liftA2 :: (a -> b -> c) -> Q a -> Q b -> Q c # (>) :: Q a -> Q b -> Q b # (<*) :: Q a -> Q b -> Q a #
Applicative Last	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods pure :: a -> Last a # (<>) :: Last (a -> b) -> Last a -> Last b # liftA2 :: (a -> b -> c) -> Last a -> Last b -> Last c # (>) :: Last a -> Last b -> Last b # (<*) :: Last a -> Last b -> Last a #
Applicative Concurrently
Instance details Defined in Control.Concurrent.Async Methods pure :: a -> Concurrently a # (<>) :: Concurrently (a -> b) -> Concurrently a -> Concurrently b # liftA2 :: (a -> b -> c) -> Concurrently a -> Concurrently b -> Concurrently c # (>) :: Concurrently a -> Concurrently b -> Concurrently b # (<*) :: Concurrently a -> Concurrently b -> Concurrently a #
Applicative Complex	Since: base-4.9.0.0
Instance details Defined in Data.Complex Methods pure :: a -> Complex a # (<>) :: Complex (a -> b) -> Complex a -> Complex b # liftA2 :: (a -> b -> c) -> Complex a -> Complex b -> Complex c # (>) :: Complex a -> Complex b -> Complex b # (<*) :: Complex a -> Complex b -> Complex a #
Applicative Min	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods pure :: a -> Min a # (<>) :: Min (a -> b) -> Min a -> Min b # liftA2 :: (a -> b -> c) -> Min a -> Min b -> Min c # (>) :: Min a -> Min b -> Min b # (<*) :: Min a -> Min b -> Min a #
Applicative Max	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods pure :: a -> Max a # (<>) :: Max (a -> b) -> Max a -> Max b # liftA2 :: (a -> b -> c) -> Max a -> Max b -> Max c # (>) :: Max a -> Max b -> Max b # (<*) :: Max a -> Max b -> Max a #
Applicative First	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods pure :: a -> First a # (<>) :: First (a -> b) -> First a -> First b # liftA2 :: (a -> b -> c) -> First a -> First b -> First c # (>) :: First a -> First b -> First b # (<*) :: First a -> First b -> First a #
Applicative Option	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods pure :: a -> Option a # (<>) :: Option (a -> b) -> Option a -> Option b # liftA2 :: (a -> b -> c) -> Option a -> Option b -> Option c # (>) :: Option a -> Option b -> Option b # (<*) :: Option a -> Option b -> Option a #
Applicative ZipList	f '<$>' 'ZipList' xs1 '<>' ... '<>' 'ZipList' xsN = 'ZipList' (zipWithN f xs1 ... xsN) where `zipWithN` refers to the `zipWith` function of the appropriate arity (`zipWith`, `zipWith3`, `zipWith4`, ...). For example: (\a b c -> stimes c [a, b]) <$> ZipList "abcd" <> ZipList "567" <> ZipList [1..] = ZipList (zipWith3 (\a b c -> stimes c [a, b]) "abcd" "567" [1..]) = ZipList {getZipList = ["a5","b6b6","c7c7c7"]} Since: base-2.1
Instance details Defined in Control.Applicative Methods pure :: a -> ZipList a # (<>) :: ZipList (a -> b) -> ZipList a -> ZipList b # liftA2 :: (a -> b -> c) -> ZipList a -> ZipList b -> ZipList c # (>) :: ZipList a -> ZipList b -> ZipList b # (<*) :: ZipList a -> ZipList b -> ZipList a #
Applicative Identity	Since: base-4.8.0.0
Instance details Defined in Data.Functor.Identity Methods pure :: a -> Identity a # (<>) :: Identity (a -> b) -> Identity a -> Identity b # liftA2 :: (a -> b -> c) -> Identity a -> Identity b -> Identity c # (>) :: Identity a -> Identity b -> Identity b # (<*) :: Identity a -> Identity b -> Identity a #
Applicative STM	Since: base-4.8.0.0
Instance details Defined in GHC.Conc.Sync Methods pure :: a -> STM a # (<>) :: STM (a -> b) -> STM a -> STM b # liftA2 :: (a -> b -> c) -> STM a -> STM b -> STM c # (>) :: STM a -> STM b -> STM b # (<*) :: STM a -> STM b -> STM a #
Applicative First	Since: base-4.8.0.0
Instance details Defined in Data.Monoid Methods pure :: a -> First a # (<>) :: First (a -> b) -> First a -> First b # liftA2 :: (a -> b -> c) -> First a -> First b -> First c # (>) :: First a -> First b -> First b # (<*) :: First a -> First b -> First a #
Applicative Last	Since: base-4.8.0.0
Instance details Defined in Data.Monoid Methods pure :: a -> Last a # (<>) :: Last (a -> b) -> Last a -> Last b # liftA2 :: (a -> b -> c) -> Last a -> Last b -> Last c # (>) :: Last a -> Last b -> Last b # (<*) :: Last a -> Last b -> Last a #
Applicative Dual	Since: base-4.8.0.0
Instance details Defined in Data.Semigroup.Internal Methods pure :: a -> Dual a # (<>) :: Dual (a -> b) -> Dual a -> Dual b # liftA2 :: (a -> b -> c) -> Dual a -> Dual b -> Dual c # (>) :: Dual a -> Dual b -> Dual b # (<*) :: Dual a -> Dual b -> Dual a #
Applicative Sum	Since: base-4.8.0.0
Instance details Defined in Data.Semigroup.Internal Methods pure :: a -> Sum a # (<>) :: Sum (a -> b) -> Sum a -> Sum b # liftA2 :: (a -> b -> c) -> Sum a -> Sum b -> Sum c # (>) :: Sum a -> Sum b -> Sum b # (<*) :: Sum a -> Sum b -> Sum a #
Applicative Product	Since: base-4.8.0.0
Instance details Defined in Data.Semigroup.Internal Methods pure :: a -> Product a # (<>) :: Product (a -> b) -> Product a -> Product b # liftA2 :: (a -> b -> c) -> Product a -> Product b -> Product c # (>) :: Product a -> Product b -> Product b # (<*) :: Product a -> Product b -> Product a #
Applicative Down	Since: base-4.11.0.0
Instance details Defined in Data.Ord Methods pure :: a -> Down a # (<>) :: Down (a -> b) -> Down a -> Down b # liftA2 :: (a -> b -> c) -> Down a -> Down b -> Down c # (>) :: Down a -> Down b -> Down b # (<*) :: Down a -> Down b -> Down a #
Applicative ReadPrec	Since: base-4.6.0.0
Instance details Defined in Text.ParserCombinators.ReadPrec Methods pure :: a -> ReadPrec a # (<>) :: ReadPrec (a -> b) -> ReadPrec a -> ReadPrec b # liftA2 :: (a -> b -> c) -> ReadPrec a -> ReadPrec b -> ReadPrec c # (>) :: ReadPrec a -> ReadPrec b -> ReadPrec b # (<*) :: ReadPrec a -> ReadPrec b -> ReadPrec a #
Applicative ReadP	Since: base-4.6.0.0
Instance details Defined in Text.ParserCombinators.ReadP Methods pure :: a -> ReadP a # (<>) :: ReadP (a -> b) -> ReadP a -> ReadP b # liftA2 :: (a -> b -> c) -> ReadP a -> ReadP b -> ReadP c # (>) :: ReadP a -> ReadP b -> ReadP b # (<*) :: ReadP a -> ReadP b -> ReadP a #
Applicative NonEmpty	Since: base-4.9.0.0
Instance details Defined in GHC.Base Methods pure :: a -> NonEmpty a # (<>) :: NonEmpty (a -> b) -> NonEmpty a -> NonEmpty b # liftA2 :: (a -> b -> c) -> NonEmpty a -> NonEmpty b -> NonEmpty c # (>) :: NonEmpty a -> NonEmpty b -> NonEmpty b # (<*) :: NonEmpty a -> NonEmpty b -> NonEmpty a #
Applicative Vector
Instance details Defined in Data.Vector Methods pure :: a -> Vector a # (<>) :: Vector (a -> b) -> Vector a -> Vector b # liftA2 :: (a -> b -> c) -> Vector a -> Vector b -> Vector c # (>) :: Vector a -> Vector b -> Vector b # (<*) :: Vector a -> Vector b -> Vector a #
Applicative Seq	Since: containers-0.5.4
Instance details Defined in Data.Sequence.Internal Methods pure :: a -> Seq a # (<>) :: Seq (a -> b) -> Seq a -> Seq b # liftA2 :: (a -> b -> c) -> Seq a -> Seq b -> Seq c # (>) :: Seq a -> Seq b -> Seq b # (<*) :: Seq a -> Seq b -> Seq a #
Applicative Memoized
Instance details Defined in UnliftIO.Memoize Methods pure :: a -> Memoized a # (<>) :: Memoized (a -> b) -> Memoized a -> Memoized b # liftA2 :: (a -> b -> c) -> Memoized a -> Memoized b -> Memoized c # (>) :: Memoized a -> Memoized b -> Memoized b # (<*) :: Memoized a -> Memoized b -> Memoized a #
Applicative DList
Instance details Defined in Data.DList Methods pure :: a -> DList a # (<>) :: DList (a -> b) -> DList a -> DList b # liftA2 :: (a -> b -> c) -> DList a -> DList b -> DList c # (>) :: DList a -> DList b -> DList b # (<*) :: DList a -> DList b -> DList a #
Applicative RGB
Instance details Defined in Data.Colour.RGB Methods pure :: a -> RGB a # (<>) :: RGB (a -> b) -> RGB a -> RGB b # liftA2 :: (a -> b -> c) -> RGB a -> RGB b -> RGB c # (>) :: RGB a -> RGB b -> RGB b # (<*) :: RGB a -> RGB b -> RGB a #
Applicative Tree
Instance details Defined in Data.Tree Methods pure :: a -> Tree a # (<>) :: Tree (a -> b) -> Tree a -> Tree b # liftA2 :: (a -> b -> c) -> Tree a -> Tree b -> Tree c # (>) :: Tree a -> Tree b -> Tree b # (<*) :: Tree a -> Tree b -> Tree a #
Applicative ScopeM
Instance details Defined in Text.Heterocephalus Methods pure :: a -> ScopeM a # (<>) :: ScopeM (a -> b) -> ScopeM a -> ScopeM b # liftA2 :: (a -> b -> c) -> ScopeM a -> ScopeM b -> ScopeM c # (>) :: ScopeM a -> ScopeM b -> ScopeM b # (<*) :: ScopeM a -> ScopeM b -> ScopeM a #
Applicative SmallArray
Instance details Defined in Data.Primitive.SmallArray Methods pure :: a -> SmallArray a # (<>) :: SmallArray (a -> b) -> SmallArray a -> SmallArray b # liftA2 :: (a -> b -> c) -> SmallArray a -> SmallArray b -> SmallArray c # (>) :: SmallArray a -> SmallArray b -> SmallArray b # (<*) :: SmallArray a -> SmallArray b -> SmallArray a #
Applicative Array
Instance details Defined in Data.Primitive.Array Methods pure :: a -> Array a # (<>) :: Array (a -> b) -> Array a -> Array b # liftA2 :: (a -> b -> c) -> Array a -> Array b -> Array c # (>) :: Array a -> Array b -> Array b # (<*) :: Array a -> Array b -> Array a #
Applicative Flat
Instance details Defined in UnliftIO.Internals.Async Methods pure :: a -> Flat a # (<>) :: Flat (a -> b) -> Flat a -> Flat b # liftA2 :: (a -> b -> c) -> Flat a -> Flat b -> Flat c # (>) :: Flat a -> Flat b -> Flat b # (<*) :: Flat a -> Flat b -> Flat a #
Applicative FlatApp
Instance details Defined in UnliftIO.Internals.Async Methods pure :: a -> FlatApp a # (<>) :: FlatApp (a -> b) -> FlatApp a -> FlatApp b # liftA2 :: (a -> b -> c) -> FlatApp a -> FlatApp b -> FlatApp c # (>) :: FlatApp a -> FlatApp b -> FlatApp b # (<*) :: FlatApp a -> FlatApp b -> FlatApp a #
Applicative Id
Instance details Defined in Data.Vector.Fusion.Util Methods pure :: a -> Id a # (<>) :: Id (a -> b) -> Id a -> Id b # liftA2 :: (a -> b -> c) -> Id a -> Id b -> Id c # (>) :: Id a -> Id b -> Id b # (<*) :: Id a -> Id b -> Id a #
Applicative Box
Instance details Defined in Data.Vector.Fusion.Util Methods pure :: a -> Box a # (<>) :: Box (a -> b) -> Box a -> Box b # liftA2 :: (a -> b -> c) -> Box a -> Box b -> Box c # (>) :: Box a -> Box b -> Box b # (<*) :: Box a -> Box b -> Box a #
Applicative P	Since: base-4.5.0.0
Instance details Defined in Text.ParserCombinators.ReadP Methods pure :: a -> P a # (<>) :: P (a -> b) -> P a -> P b # liftA2 :: (a -> b -> c) -> P a -> P b -> P c # (>) :: P a -> P b -> P b # (<*) :: P a -> P b -> P a #
Applicative (Either e)	Since: base-3.0
Instance details Defined in Data.Either Methods pure :: a -> Either e a # (<>) :: Either e (a -> b) -> Either e a -> Either e b # liftA2 :: (a -> b -> c) -> Either e a -> Either e b -> Either e c # (>) :: Either e a -> Either e b -> Either e b # (<*) :: Either e a -> Either e b -> Either e a #
Applicative (U1 :: Type -> Type)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods pure :: a -> U1 a # (<>) :: U1 (a -> b) -> U1 a -> U1 b # liftA2 :: (a -> b -> c) -> U1 a -> U1 b -> U1 c # (>) :: U1 a -> U1 b -> U1 b # (<*) :: U1 a -> U1 b -> U1 a #
Monoid a => Applicative ((,) a)	For tuples, the `Monoid` constraint on `a` determines how the first values merge. For example, `String`s concatenate: ("hello ", (+15)) <> ("world!", 2002) ("hello world!",2017) Since: base-2.1*
Instance details Defined in GHC.Base Methods pure :: a0 -> (a, a0) # (<>) :: (a, a0 -> b) -> (a, a0) -> (a, b) # liftA2 :: (a0 -> b -> c) -> (a, a0) -> (a, b) -> (a, c) # (>) :: (a, a0) -> (a, b) -> (a, b) # (<*) :: (a, a0) -> (a, b) -> (a, a0) #
Applicative (ST s)	Since: base-4.4.0.0
Instance details Defined in GHC.ST Methods pure :: a -> ST s a # (<>) :: ST s (a -> b) -> ST s a -> ST s b # liftA2 :: (a -> b -> c) -> ST s a -> ST s b -> ST s c # (>) :: ST s a -> ST s b -> ST s b # (<*) :: ST s a -> ST s b -> ST s a #
Representable f => Applicative (Co f)
Instance details Defined in Data.Functor.Rep Methods pure :: a -> Co f a # (<>) :: Co f (a -> b) -> Co f a -> Co f b # liftA2 :: (a -> b -> c) -> Co f a -> Co f b -> Co f c # (>) :: Co f a -> Co f b -> Co f b # (<*) :: Co f a -> Co f b -> Co f a #
Applicative (Parser i)
Instance details Defined in Data.Attoparsec.Internal.Types Methods pure :: a -> Parser i a # (<>) :: Parser i (a -> b) -> Parser i a -> Parser i b # liftA2 :: (a -> b -> c) -> Parser i a -> Parser i b -> Parser i c # (>) :: Parser i a -> Parser i b -> Parser i b # (<*) :: Parser i a -> Parser i b -> Parser i a #
Monad m => Applicative (WrappedMonad m)	Since: base-2.1
Instance details Defined in Control.Applicative Methods pure :: a -> WrappedMonad m a # (<>) :: WrappedMonad m (a -> b) -> WrappedMonad m a -> WrappedMonad m b # liftA2 :: (a -> b -> c) -> WrappedMonad m a -> WrappedMonad m b -> WrappedMonad m c # (>) :: WrappedMonad m a -> WrappedMonad m b -> WrappedMonad m b # (<*) :: WrappedMonad m a -> WrappedMonad m b -> WrappedMonad m a #
Arrow a => Applicative (ArrowMonad a)	Since: base-4.6.0.0
Instance details Defined in Control.Arrow Methods pure :: a0 -> ArrowMonad a a0 # (<>) :: ArrowMonad a (a0 -> b) -> ArrowMonad a a0 -> ArrowMonad a b # liftA2 :: (a0 -> b -> c) -> ArrowMonad a a0 -> ArrowMonad a b -> ArrowMonad a c # (>) :: ArrowMonad a a0 -> ArrowMonad a b -> ArrowMonad a b # (<*) :: ArrowMonad a a0 -> ArrowMonad a b -> ArrowMonad a a0 #
Applicative (Proxy :: Type -> Type)	Since: base-4.7.0.0
Instance details Defined in Data.Proxy Methods pure :: a -> Proxy a # (<>) :: Proxy (a -> b) -> Proxy a -> Proxy b # liftA2 :: (a -> b -> c) -> Proxy a -> Proxy b -> Proxy c # (>) :: Proxy a -> Proxy b -> Proxy b # (<*) :: Proxy a -> Proxy b -> Proxy a #
MonadUnliftIO m => Applicative (Conc m)	Since: unliftio-0.2.9.0
Instance details Defined in UnliftIO.Internals.Async Methods pure :: a -> Conc m a # (<>) :: Conc m (a -> b) -> Conc m a -> Conc m b # liftA2 :: (a -> b -> c) -> Conc m a -> Conc m b -> Conc m c # (>) :: Conc m a -> Conc m b -> Conc m b # (<*) :: Conc m a -> Conc m b -> Conc m a #
MonadUnliftIO m => Applicative (Concurrently m)	Since: unliftio-0.1.0.0
Instance details 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 #
(Functor m, Monad m) => Applicative (MaybeT m)
Instance details Defined in Control.Monad.Trans.Maybe Methods pure :: a -> MaybeT m a # (<>) :: MaybeT m (a -> b) -> MaybeT m a -> MaybeT m b # liftA2 :: (a -> b -> c) -> MaybeT m a -> MaybeT m b -> MaybeT m c # (>) :: MaybeT m a -> MaybeT m b -> MaybeT m b # (<*) :: MaybeT m a -> MaybeT m b -> MaybeT m a #
Monad m => Applicative (ZipSource m)
Instance details Defined in Data.Conduit.Internal.Conduit Methods pure :: a -> ZipSource m a # (<>) :: ZipSource m (a -> b) -> ZipSource m a -> ZipSource m b # liftA2 :: (a -> b -> c) -> ZipSource m a -> ZipSource m b -> ZipSource m c # (>) :: ZipSource m a -> ZipSource m b -> ZipSource m b # (<*) :: ZipSource m a -> ZipSource m b -> ZipSource m a #
Applicative m => Applicative (ResourceT m)
Instance details Defined in Control.Monad.Trans.Resource.Internal Methods pure :: a -> ResourceT m a # (<>) :: ResourceT m (a -> b) -> ResourceT m a -> ResourceT m b # liftA2 :: (a -> b -> c) -> ResourceT m a -> ResourceT m b -> ResourceT m c # (>) :: ResourceT m a -> ResourceT m b -> ResourceT m b # (<*) :: ResourceT m a -> ResourceT m b -> ResourceT m a #
Alternative f => Applicative (Cofree f)
Instance details Defined in Control.Comonad.Cofree Methods pure :: a -> Cofree f a # (<>) :: Cofree f (a -> b) -> Cofree f a -> Cofree f b # liftA2 :: (a -> b -> c) -> Cofree f a -> Cofree f b -> Cofree f c # (>) :: Cofree f a -> Cofree f b -> Cofree f b # (<*) :: Cofree f a -> Cofree f b -> Cofree f a #
Functor f => Applicative (Free f)
Instance details Defined in Control.Monad.Free Methods pure :: a -> Free f a # (<>) :: Free f (a -> b) -> Free f a -> Free f b # liftA2 :: (a -> b -> c) -> Free f a -> Free f b -> Free f c # (>) :: Free f a -> Free f b -> Free f b # (<*) :: Free f a -> Free f b -> Free f a #
Applicative f => Applicative (Yoneda f)
Instance details Defined in Data.Functor.Yoneda Methods pure :: a -> Yoneda f a # (<>) :: Yoneda f (a -> b) -> Yoneda f a -> Yoneda f b # liftA2 :: (a -> b -> c) -> Yoneda f a -> Yoneda f b -> Yoneda f c # (>) :: Yoneda f a -> Yoneda f b -> Yoneda f b # (<*) :: Yoneda f a -> Yoneda f b -> Yoneda f a #
Applicative (ReifiedGetter s)
Instance details Defined in Control.Lens.Reified Methods pure :: a -> ReifiedGetter s a # (<>) :: ReifiedGetter s (a -> b) -> ReifiedGetter s a -> ReifiedGetter s b # liftA2 :: (a -> b -> c) -> ReifiedGetter s a -> ReifiedGetter s b -> ReifiedGetter s c # (>) :: ReifiedGetter s a -> ReifiedGetter s b -> ReifiedGetter s b # (<*) :: ReifiedGetter s a -> ReifiedGetter s b -> ReifiedGetter s a #
Applicative (ReifiedFold s)
Instance details Defined in Control.Lens.Reified Methods pure :: a -> ReifiedFold s a # (<>) :: ReifiedFold s (a -> b) -> ReifiedFold s a -> ReifiedFold s b # liftA2 :: (a -> b -> c) -> ReifiedFold s a -> ReifiedFold s b -> ReifiedFold s c # (>) :: ReifiedFold s a -> ReifiedFold s b -> ReifiedFold s b # (<*) :: ReifiedFold s a -> ReifiedFold s b -> ReifiedFold s a #
Applicative f => Applicative (Indexing f)
Instance details Defined in Control.Lens.Internal.Indexed Methods pure :: a -> Indexing f a # (<>) :: Indexing f (a -> b) -> Indexing f a -> Indexing f b # liftA2 :: (a -> b -> c) -> Indexing f a -> Indexing f b -> Indexing f c # (>) :: Indexing f a -> Indexing f b -> Indexing f b # (<*) :: Indexing f a -> Indexing f b -> Indexing f a #
Applicative f => Applicative (Indexing64 f)
Instance details Defined in Control.Lens.Internal.Indexed Methods pure :: a -> Indexing64 f a # (<>) :: Indexing64 f (a -> b) -> Indexing64 f a -> Indexing64 f b # liftA2 :: (a -> b -> c) -> Indexing64 f a -> Indexing64 f b -> Indexing64 f c # (>) :: Indexing64 f a -> Indexing64 f b -> Indexing64 f b # (<*) :: Indexing64 f a -> Indexing64 f b -> Indexing64 f a #
Applicative m => Applicative (ListT m)
Instance details Defined in Control.Monad.Trans.List Methods pure :: a -> ListT m a # (<>) :: ListT m (a -> b) -> ListT m a -> ListT m b # liftA2 :: (a -> b -> c) -> ListT m a -> ListT m b -> ListT m c # (>) :: ListT m a -> ListT m b -> ListT m b # (<*) :: ListT m a -> ListT m b -> ListT m a #
(Applicative (Rep p), Representable p) => Applicative (Prep p)
Instance details Defined in Data.Profunctor.Rep Methods pure :: a -> Prep p a # (<>) :: Prep p (a -> b) -> Prep p a -> Prep p b # liftA2 :: (a -> b -> c) -> Prep p a -> Prep p b -> Prep p c # (>) :: Prep p a -> Prep p b -> Prep p b # (<*) :: Prep p a -> Prep p b -> Prep p a #
Applicative f => Applicative (WrappedApplicative f)
Instance details Defined in Data.Functor.Bind.Class Methods pure :: a -> WrappedApplicative f a # (<>) :: WrappedApplicative f (a -> b) -> WrappedApplicative f a -> WrappedApplicative f b # liftA2 :: (a -> b -> c) -> WrappedApplicative f a -> WrappedApplicative f b -> WrappedApplicative f c # (>) :: WrappedApplicative f a -> WrappedApplicative f b -> WrappedApplicative f b # (<*) :: WrappedApplicative f a -> WrappedApplicative f b -> WrappedApplicative f a #
Apply f => Applicative (MaybeApply f)
Instance details Defined in Data.Functor.Bind.Class Methods pure :: a -> MaybeApply f a # (<>) :: MaybeApply f (a -> b) -> MaybeApply f a -> MaybeApply f b # liftA2 :: (a -> b -> c) -> MaybeApply f a -> MaybeApply f b -> MaybeApply f c # (>) :: MaybeApply f a -> MaybeApply f b -> MaybeApply f b # (<*) :: MaybeApply f a -> MaybeApply f b -> MaybeApply f a #
Applicative q => Applicative (DsM q)
Instance details Defined in Language.Haskell.TH.Desugar.Reify Methods pure :: a -> DsM q a # (<>) :: DsM q (a -> b) -> DsM q a -> DsM q b # liftA2 :: (a -> b -> c) -> DsM q a -> DsM q b -> DsM q c # (>) :: DsM q a -> DsM q b -> DsM q b # (<*) :: DsM q a -> DsM q b -> DsM q a #
Applicative (StateL s)
Instance details Defined in Data.Key Methods pure :: a -> StateL s a # (<>) :: StateL s (a -> b) -> StateL s a -> StateL s b # liftA2 :: (a -> b -> c) -> StateL s a -> StateL s b -> StateL s c # (>) :: StateL s a -> StateL s b -> StateL s b # (<*) :: StateL s a -> StateL s b -> StateL s a #
Applicative (StateR s)
Instance details Defined in Data.Key Methods pure :: a -> StateR s a # (<>) :: StateR s (a -> b) -> StateR s a -> StateR s b # liftA2 :: (a -> b -> c) -> StateR s a -> StateR s b -> StateR s c # (>) :: StateR s a -> StateR s b -> StateR s b # (<*) :: StateR s a -> StateR s b -> StateR s a #
Applicative (SetM s)
Instance details Defined in Data.Graph Methods pure :: a -> SetM s a # (<>) :: SetM s (a -> b) -> SetM s a -> SetM s b # liftA2 :: (a -> b -> c) -> SetM s a -> SetM s b -> SetM s c # (>) :: SetM s a -> SetM s b -> SetM s b # (<*) :: SetM s a -> SetM s b -> SetM s a #
SingI ns => Applicative (Matrix ns) Source #
Instance details Defined in Termonad.Config.Vec Methods pure :: a -> Matrix ns a # (<>) :: Matrix ns (a -> b) -> Matrix ns a -> Matrix ns b # liftA2 :: (a -> b -> c) -> Matrix ns a -> Matrix ns b -> Matrix ns c # (>) :: Matrix ns a -> Matrix ns b -> Matrix ns b # (<*) :: Matrix ns a -> Matrix ns b -> Matrix ns a #
SingI n => Applicative (Vec n) Source #
Instance details Defined in Termonad.Config.Vec Methods pure :: a -> Vec n a # (<>) :: Vec n (a -> b) -> Vec n a -> Vec n b # liftA2 :: (a -> b -> c) -> Vec n a -> Vec n b -> Vec n c # (>) :: Vec n a -> Vec n b -> Vec n b # (<*) :: Vec n a -> Vec n b -> Vec n a #
Applicative f => Applicative (Rec1 f)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods pure :: a -> Rec1 f a # (<>) :: Rec1 f (a -> b) -> Rec1 f a -> Rec1 f b # liftA2 :: (a -> b -> c) -> Rec1 f a -> Rec1 f b -> Rec1 f c # (>) :: Rec1 f a -> Rec1 f b -> Rec1 f b # (<*) :: Rec1 f a -> Rec1 f b -> Rec1 f a #
Arrow a => Applicative (WrappedArrow a b)	Since: base-2.1
Instance details Defined in Control.Applicative Methods pure :: a0 -> WrappedArrow a b a0 # (<>) :: WrappedArrow a b (a0 -> b0) -> WrappedArrow a b a0 -> WrappedArrow a b b0 # liftA2 :: (a0 -> b0 -> c) -> WrappedArrow a b a0 -> WrappedArrow a b b0 -> WrappedArrow a b c # (>) :: WrappedArrow a b a0 -> WrappedArrow a b b0 -> WrappedArrow a b b0 # (<*) :: WrappedArrow a b a0 -> WrappedArrow a b b0 -> WrappedArrow a b a0 #
Monoid m => Applicative (Const m :: Type -> Type)	Since: base-2.0.1
Instance details Defined in Data.Functor.Const Methods pure :: a -> Const m a # (<>) :: Const m (a -> b) -> Const m a -> Const m b # liftA2 :: (a -> b -> c) -> Const m a -> Const m b -> Const m c # (>) :: Const m a -> Const m b -> Const m b # (<*) :: Const m a -> Const m b -> Const m a #
Applicative f => Applicative (Ap f)	Since: base-4.12.0.0
Instance details Defined in Data.Monoid Methods pure :: a -> Ap f a # (<>) :: Ap f (a -> b) -> Ap f a -> Ap f b # liftA2 :: (a -> b -> c) -> Ap f a -> Ap f b -> Ap f c # (>) :: Ap f a -> Ap f b -> Ap f b # (<*) :: Ap f a -> Ap f b -> Ap f a #
Applicative f => Applicative (Alt f)	Since: base-4.8.0.0
Instance details Defined in Data.Semigroup.Internal Methods pure :: a -> Alt f a # (<>) :: Alt f (a -> b) -> Alt f a -> Alt f b # liftA2 :: (a -> b -> c) -> Alt f a -> Alt f b -> Alt f c # (>) :: Alt f a -> Alt f b -> Alt f b # (<*) :: Alt f a -> Alt f b -> Alt f a #
Biapplicative p => Applicative (Join p)
Instance details Defined in Data.Bifunctor.Join Methods pure :: a -> Join p a # (<>) :: Join p (a -> b) -> Join p a -> Join p b # liftA2 :: (a -> b -> c) -> Join p a -> Join p b -> Join p c # (>) :: Join p a -> Join p b -> Join p b # (<*) :: Join p a -> Join p b -> Join p a #
Biapplicative p => Applicative (Fix p)
Instance details Defined in Data.Bifunctor.Fix Methods pure :: a -> Fix p a # (<>) :: Fix p (a -> b) -> Fix p a -> Fix p b # liftA2 :: (a -> b -> c) -> Fix p a -> Fix p b -> Fix p c # (>) :: Fix p a -> Fix p b -> Fix p b # (<*) :: Fix p a -> Fix p b -> Fix p a #
Applicative m => Applicative (ReaderT r m)
Instance details Defined in Control.Monad.Trans.Reader Methods pure :: a -> ReaderT r m a # (<>) :: ReaderT r m (a -> b) -> ReaderT r m a -> ReaderT r m b # liftA2 :: (a -> b -> c) -> ReaderT r m a -> ReaderT r m b -> ReaderT r m c # (>) :: ReaderT r m a -> ReaderT r m b -> ReaderT r m b # (<*) :: ReaderT r m a -> ReaderT r m b -> ReaderT r m a #
Applicative w => Applicative (TracedT m w)
Instance details Defined in Control.Comonad.Trans.Traced Methods pure :: a -> TracedT m w a # (<>) :: TracedT m w (a -> b) -> TracedT m w a -> TracedT m w b # liftA2 :: (a -> b -> c) -> TracedT m w a -> TracedT m w b -> TracedT m w c # (>) :: TracedT m w a -> TracedT m w b -> TracedT m w b # (<*) :: TracedT m w a -> TracedT m w b -> TracedT m w a #
(Applicative w, Monoid s) => Applicative (StoreT s w)
Instance details Defined in Control.Comonad.Trans.Store Methods pure :: a -> StoreT s w a # (<>) :: StoreT s w (a -> b) -> StoreT s w a -> StoreT s w b # liftA2 :: (a -> b -> c) -> StoreT s w a -> StoreT s w b -> StoreT s w c # (>) :: StoreT s w a -> StoreT s w b -> StoreT s w b # (<*) :: StoreT s w a -> StoreT s w b -> StoreT s w a #
(Monoid e, Applicative m) => Applicative (EnvT e m)
Instance details Defined in Control.Comonad.Trans.Env Methods pure :: a -> EnvT e m a # (<>) :: EnvT e m (a -> b) -> EnvT e m a -> EnvT e m b # liftA2 :: (a -> b -> c) -> EnvT e m a -> EnvT e m b -> EnvT e m c # (>) :: EnvT e m a -> EnvT e m b -> EnvT e m b # (<*) :: EnvT e m a -> EnvT e m b -> EnvT e m a #
Applicative m => Applicative (IdentityT m)
Instance details Defined in Control.Monad.Trans.Identity Methods pure :: a -> IdentityT m a # (<>) :: IdentityT m (a -> b) -> IdentityT m a -> IdentityT m b # liftA2 :: (a -> b -> c) -> IdentityT m a -> IdentityT m b -> IdentityT m c # (>) :: IdentityT m a -> IdentityT m b -> IdentityT m b # (<*) :: IdentityT m a -> IdentityT m b -> IdentityT m a #
(Monoid w, Applicative m) => Applicative (WriterT w m)
Instance details Defined in Control.Monad.Trans.Writer.Strict Methods pure :: a -> WriterT w m a # (<>) :: WriterT w m (a -> b) -> WriterT w m a -> WriterT w m b # liftA2 :: (a -> b -> c) -> WriterT w m a -> WriterT w m b -> WriterT w m c # (>) :: WriterT w m a -> WriterT w m b -> WriterT w m b # (<*) :: WriterT w m a -> WriterT w m b -> WriterT w m a #
(Monoid w, Applicative m) => Applicative (WriterT w m)
Instance details Defined in Control.Monad.Trans.Writer.Lazy Methods pure :: a -> WriterT w m a # (<>) :: WriterT w m (a -> b) -> WriterT w m a -> WriterT w m b # liftA2 :: (a -> b -> c) -> WriterT w m a -> WriterT w m b -> WriterT w m c # (>) :: WriterT w m a -> WriterT w m b -> WriterT w m b # (<*) :: WriterT w m a -> WriterT w m b -> WriterT w m a #
(Functor m, Monad m) => Applicative (StateT s m)
Instance details Defined in Control.Monad.Trans.State.Strict Methods pure :: a -> StateT s m a # (<>) :: StateT s m (a -> b) -> StateT s m a -> StateT s m b # liftA2 :: (a -> b -> c) -> StateT s m a -> StateT s m b -> StateT s m c # (>) :: StateT s m a -> StateT s m b -> StateT s m b # (<*) :: StateT s m a -> StateT s m b -> StateT s m a #
(Functor m, Monad m) => Applicative (StateT s m)
Instance details Defined in Control.Monad.Trans.State.Lazy Methods pure :: a -> StateT s m a # (<>) :: StateT s m (a -> b) -> StateT s m a -> StateT s m b # liftA2 :: (a -> b -> c) -> StateT s m a -> StateT s m b -> StateT s m c # (>) :: StateT s m a -> StateT s m b -> StateT s m b # (<*) :: StateT s m a -> StateT s m b -> StateT s m a #
Monad m => Applicative (ZipSink i m)
Instance details Defined in Data.Conduit.Internal.Conduit Methods pure :: a -> ZipSink i m a # (<>) :: ZipSink i m (a -> b) -> ZipSink i m a -> ZipSink i m b # liftA2 :: (a -> b -> c) -> ZipSink i m a -> ZipSink i m b -> ZipSink i m c # (>) :: ZipSink i m a -> ZipSink i m b -> ZipSink i m b # (<*) :: ZipSink i m a -> ZipSink i m b -> ZipSink i m a #
(Applicative f, Monad f) => Applicative (WhenMissing f x)	Equivalent to `ReaderT k (ReaderT x (MaybeT f))`. Since: containers-0.5.9
Instance details Defined in Data.IntMap.Internal Methods pure :: a -> WhenMissing f x a # (<>) :: WhenMissing f x (a -> b) -> WhenMissing f x a -> WhenMissing f x b # liftA2 :: (a -> b -> c) -> WhenMissing f x a -> WhenMissing f x b -> WhenMissing f x c # (>) :: WhenMissing f x a -> WhenMissing f x b -> WhenMissing f x b # (<*) :: WhenMissing f x a -> WhenMissing f x b -> WhenMissing f x a #
(Functor f, Monad m) => Applicative (FreeT f m)
Instance details Defined in Control.Monad.Trans.Free Methods pure :: a -> FreeT f m a # (<>) :: FreeT f m (a -> b) -> FreeT f m a -> FreeT f m b # liftA2 :: (a -> b -> c) -> FreeT f m a -> FreeT f m b -> FreeT f m c # (>) :: FreeT f m a -> FreeT f m b -> FreeT f m b # (<*) :: FreeT f m a -> FreeT f m b -> FreeT f m a #
(Alternative f, Applicative w) => Applicative (CofreeT f w)
Instance details Defined in Control.Comonad.Trans.Cofree Methods pure :: a -> CofreeT f w a # (<>) :: CofreeT f w (a -> b) -> CofreeT f w a -> CofreeT f w b # liftA2 :: (a -> b -> c) -> CofreeT f w a -> CofreeT f w b -> CofreeT f w c # (>) :: CofreeT f w a -> CofreeT f w b -> CofreeT f w b # (<*) :: CofreeT f w a -> CofreeT f w b -> CofreeT f w a #
(Applicative f, Applicative g) => Applicative (Day f g)
Instance details Defined in Data.Functor.Day Methods pure :: a -> Day f g a # (<>) :: Day f g (a -> b) -> Day f g a -> Day f g b # liftA2 :: (a -> b -> c) -> Day f g a -> Day f g b -> Day f g c # (>) :: Day f g a -> Day f g b -> Day f g b # (<*) :: Day f g a -> Day f g b -> Day f g a #
(Functor m, Monad m) => Applicative (ErrorT e m)
Instance details Defined in Control.Monad.Trans.Error Methods pure :: a -> ErrorT e m a # (<>) :: ErrorT e m (a -> b) -> ErrorT e m a -> ErrorT e m b # liftA2 :: (a -> b -> c) -> ErrorT e m a -> ErrorT e m b -> ErrorT e m c # (>) :: ErrorT e m a -> ErrorT e m b -> ErrorT e m b # (<*) :: ErrorT e m a -> ErrorT e m b -> ErrorT e m a #
Applicative (Indexed i a)
Instance details Defined in Control.Lens.Internal.Indexed Methods pure :: a0 -> Indexed i a a0 # (<>) :: Indexed i a (a0 -> b) -> Indexed i a a0 -> Indexed i a b # liftA2 :: (a0 -> b -> c) -> Indexed i a a0 -> Indexed i a b -> Indexed i a c # (>) :: Indexed i a a0 -> Indexed i a b -> Indexed i a b # (<*) :: Indexed i a a0 -> Indexed i a b -> Indexed i a a0 #
Applicative f => Applicative (Static f a)
Instance details Defined in Data.Semigroupoid.Static Methods pure :: a0 -> Static f a a0 # (<>) :: Static f a (a0 -> b) -> Static f a a0 -> Static f a b # liftA2 :: (a0 -> b -> c) -> Static f a a0 -> Static f a b -> Static f a c # (>) :: Static f a a0 -> Static f a b -> Static f a b # (<*) :: Static f a a0 -> Static f a b -> Static f a a0 #
Applicative (Tagged s)
Instance details Defined in Data.Tagged Methods pure :: a -> Tagged s a # (<>) :: Tagged s (a -> b) -> Tagged s a -> Tagged s b # liftA2 :: (a -> b -> c) -> Tagged s a -> Tagged s b -> Tagged s c # (>) :: Tagged s a -> Tagged s b -> Tagged s b # (<*) :: Tagged s a -> Tagged s b -> Tagged s a #
Applicative ((->) a :: Type -> Type)	Since: base-2.1
Instance details Defined in GHC.Base Methods pure :: a0 -> a -> a0 # (<>) :: (a -> (a0 -> b)) -> (a -> a0) -> a -> b # liftA2 :: (a0 -> b -> c) -> (a -> a0) -> (a -> b) -> a -> c # (>) :: (a -> a0) -> (a -> b) -> a -> b # (<*) :: (a -> a0) -> (a -> b) -> a -> a0 #
Monoid c => Applicative (K1 i c :: Type -> Type)	Since: base-4.12.0.0
Instance details Defined in GHC.Generics Methods pure :: a -> K1 i c a # (<>) :: K1 i c (a -> b) -> K1 i c a -> K1 i c b # liftA2 :: (a -> b -> c0) -> K1 i c a -> K1 i c b -> K1 i c c0 # (>) :: K1 i c a -> K1 i c b -> K1 i c b # (<*) :: K1 i c a -> K1 i c b -> K1 i c a #
(Applicative f, Applicative g) => Applicative (f :*: g)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods pure :: a -> (f :: g) a # (<>) :: (f :: g) (a -> b) -> (f :: g) a -> (f :: g) b # liftA2 :: (a -> b -> c) -> (f :: g) a -> (f :: g) b -> (f :: g) c # (>) :: (f :: g) a -> (f :: g) b -> (f :: g) b # (<) :: (f :: g) a -> (f :: g) b -> (f :: g) a #
(Applicative f, Applicative g) => Applicative (Product f g)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Product Methods pure :: a -> Product f g a # (<>) :: Product f g (a -> b) -> Product f g a -> Product f g b # liftA2 :: (a -> b -> c) -> Product f g a -> Product f g b -> Product f g c # (>) :: Product f g a -> Product f g b -> Product f g b # (<*) :: Product f g a -> Product f g b -> Product f g a #
Applicative (Cokleisli w a)
Instance details Defined in Control.Comonad Methods pure :: a0 -> Cokleisli w a a0 # (<>) :: Cokleisli w a (a0 -> b) -> Cokleisli w a a0 -> Cokleisli w a b # liftA2 :: (a0 -> b -> c) -> Cokleisli w a a0 -> Cokleisli w a b -> Cokleisli w a c # (>) :: Cokleisli w a a0 -> Cokleisli w a b -> Cokleisli w a b # (<*) :: Cokleisli w a a0 -> Cokleisli w a b -> Cokleisli w a a0 #
Applicative (ConduitT i o m)
Instance details Defined in Data.Conduit.Internal.Conduit Methods pure :: a -> ConduitT i o m a # (<>) :: ConduitT i o m (a -> b) -> ConduitT i o m a -> ConduitT i o m b # liftA2 :: (a -> b -> c) -> ConduitT i o m a -> ConduitT i o m b -> ConduitT i o m c # (>) :: ConduitT i o m a -> ConduitT i o m b -> ConduitT i o m b # (<*) :: ConduitT i o m a -> ConduitT i o m b -> ConduitT i o m a #
Monad m => Applicative (ZipConduit i o m)
Instance details Defined in Data.Conduit.Internal.Conduit Methods pure :: a -> ZipConduit i o m a # (<>) :: ZipConduit i o m (a -> b) -> ZipConduit i o m a -> ZipConduit i o m b # liftA2 :: (a -> b -> c) -> ZipConduit i o m a -> ZipConduit i o m b -> ZipConduit i o m c # (>) :: ZipConduit i o m a -> ZipConduit i o m b -> ZipConduit i o m b # (<*) :: ZipConduit i o m a -> ZipConduit i o m b -> ZipConduit i o m a #
(Monad f, Applicative f) => Applicative (WhenMatched f x y)	Equivalent to `ReaderT Key (ReaderT x (ReaderT y (MaybeT f)))` Since: containers-0.5.9
Instance details Defined in Data.IntMap.Internal Methods pure :: a -> WhenMatched f x y a # (<>) :: WhenMatched f x y (a -> b) -> WhenMatched f x y a -> WhenMatched f x y b # liftA2 :: (a -> b -> c) -> WhenMatched f x y a -> WhenMatched f x y b -> WhenMatched f x y c # (>) :: WhenMatched f x y a -> WhenMatched f x y b -> WhenMatched f x y b # (<*) :: WhenMatched f x y a -> WhenMatched f x y b -> WhenMatched f x y a #
(Applicative f, Monad f) => Applicative (WhenMissing f k x)	Equivalent to `ReaderT k (ReaderT x (MaybeT f))` . Since: containers-0.5.9
Instance details Defined in Data.Map.Internal Methods pure :: a -> WhenMissing f k x a # (<>) :: WhenMissing f k x (a -> b) -> WhenMissing f k x a -> WhenMissing f k x b # liftA2 :: (a -> b -> c) -> WhenMissing f k x a -> WhenMissing f k x b -> WhenMissing f k x c # (>) :: WhenMissing f k x a -> WhenMissing f k x b -> WhenMissing f k x b # (<*) :: WhenMissing f k x a -> WhenMissing f k x b -> WhenMissing f k x a #
Applicative (ContT r m)
Instance details Defined in Control.Monad.Trans.Cont Methods pure :: a -> ContT r m a # (<>) :: ContT r m (a -> b) -> ContT r m a -> ContT r m b # liftA2 :: (a -> b -> c) -> ContT r m a -> ContT r m b -> ContT r m c # (>) :: ContT r m a -> ContT r m b -> ContT r m b # (<*) :: ContT r m a -> ContT r m b -> ContT r m a #
Applicative f => Applicative (M1 i c f)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods pure :: a -> M1 i c f a # (<>) :: M1 i c f (a -> b) -> M1 i c f a -> M1 i c f b # liftA2 :: (a -> b -> c0) -> M1 i c f a -> M1 i c f b -> M1 i c f c0 # (>) :: M1 i c f a -> M1 i c f b -> M1 i c f b # (<*) :: M1 i c f a -> M1 i c f b -> M1 i c f a #
(Applicative f, Applicative g) => Applicative (f :.: g)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods pure :: a -> (f :.: g) a # (<>) :: (f :.: g) (a -> b) -> (f :.: g) a -> (f :.: g) b # liftA2 :: (a -> b -> c) -> (f :.: g) a -> (f :.: g) b -> (f :.: g) c # (>) :: (f :.: g) a -> (f :.: g) b -> (f :.: g) b # (<*) :: (f :.: g) a -> (f :.: g) b -> (f :.: g) a #
(Applicative f, Applicative g) => Applicative (Compose f g)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Compose Methods pure :: a -> Compose f g a # (<>) :: Compose f g (a -> b) -> Compose f g a -> Compose f g b # liftA2 :: (a -> b -> c) -> Compose f g a -> Compose f g b -> Compose f g c # (>) :: Compose f g a -> Compose f g b -> Compose f g b # (<*) :: Compose f g a -> Compose f g b -> Compose f g a #
(Monoid w, Functor m, Monad m) => Applicative (RWST r w s m)
Instance details Defined in Control.Monad.Trans.RWS.Strict Methods pure :: a -> RWST r w s m a # (<>) :: RWST r w s m (a -> b) -> RWST r w s m a -> RWST r w s m b # liftA2 :: (a -> b -> c) -> RWST r w s m a -> RWST r w s m b -> RWST r w s m c # (>) :: RWST r w s m a -> RWST r w s m b -> RWST r w s m b # (<*) :: RWST r w s m a -> RWST r w s m b -> RWST r w s m a #
(Monoid w, Functor m, Monad m) => Applicative (RWST r w s m)
Instance details Defined in Control.Monad.Trans.RWS.Lazy Methods pure :: a -> RWST r w s m a # (<>) :: RWST r w s m (a -> b) -> RWST r w s m a -> RWST r w s m b # liftA2 :: (a -> b -> c) -> RWST r w s m a -> RWST r w s m b -> RWST r w s m c # (>) :: RWST r w s m a -> RWST r w s m b -> RWST r w s m b # (<*) :: RWST r w s m a -> RWST r w s m b -> RWST r w s m a #
(Monad f, Applicative f) => Applicative (WhenMatched f k x y)	Equivalent to `ReaderT k (ReaderT x (ReaderT y (MaybeT f)))` Since: containers-0.5.9
Instance details Defined in Data.Map.Internal Methods pure :: a -> WhenMatched f k x y a # (<>) :: WhenMatched f k x y (a -> b) -> WhenMatched f k x y a -> WhenMatched f k x y b # liftA2 :: (a -> b -> c) -> WhenMatched f k x y a -> WhenMatched f k x y b -> WhenMatched f k x y c # (>) :: WhenMatched f k x y a -> WhenMatched f k x y b -> WhenMatched f k x y b # (<*) :: WhenMatched f k x y a -> WhenMatched f k x y b -> WhenMatched f k x y a #
Reifies s (ReifiedApplicative f) => Applicative (ReflectedApplicative f s)
Instance details Defined in Data.Reflection Methods pure :: a -> ReflectedApplicative f s a # (<>) :: ReflectedApplicative f s (a -> b) -> ReflectedApplicative f s a -> ReflectedApplicative f s b # liftA2 :: (a -> b -> c) -> ReflectedApplicative f s a -> ReflectedApplicative f s b -> ReflectedApplicative f s c # (>) :: ReflectedApplicative f s a -> ReflectedApplicative f s b -> ReflectedApplicative f s b # (<*) :: ReflectedApplicative f s a -> ReflectedApplicative f s b -> ReflectedApplicative f s a #
Monad m => Applicative (Pipe l i o u m)
Instance details Defined in Data.Conduit.Internal.Pipe Methods pure :: a -> Pipe l i o u m a # (<>) :: Pipe l i o u m (a -> b) -> Pipe l i o u m a -> Pipe l i o u m b # liftA2 :: (a -> b -> c) -> Pipe l i o u m a -> Pipe l i o u m b -> Pipe l i o u m c # (>) :: Pipe l i o u m a -> Pipe l i o u m b -> Pipe l i o u m b # (<*) :: Pipe l i o u m a -> Pipe l i o u m b -> Pipe l i o u m a #

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)

Minimal complete definition

foldMap | foldr

Instances

Foldable []	Since: base-2.1
Instance details 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 # toList :: [a] -> [a] # null :: [a] -> Bool # length :: [a] -> Int # elem :: Eq a => a -> [a] -> Bool # maximum :: Ord a => [a] -> a # minimum :: Ord a => [a] -> a # sum :: Num a => [a] -> a # product :: Num a => [a] -> a #
Foldable Maybe	Since: base-2.1
Instance details 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 # toList :: Maybe a -> [a] # null :: Maybe a -> Bool # length :: Maybe a -> Int # elem :: Eq a => a -> Maybe a -> Bool # maximum :: Ord a => Maybe a -> a # minimum :: Ord a => Maybe a -> a # sum :: Num a => Maybe a -> a # product :: Num a => Maybe a -> a #
Foldable Par1	Since: base-4.9.0.0
Instance details 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 # toList :: Par1 a -> [a] # null :: Par1 a -> Bool # length :: Par1 a -> Int # elem :: Eq a => a -> Par1 a -> Bool # maximum :: Ord a => Par1 a -> a # minimum :: Ord a => Par1 a -> a # sum :: Num a => Par1 a -> a # product :: Num a => Par1 a -> a #
Foldable Last	Since: base-4.9.0.0
Instance details 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 # toList :: Last a -> [a] # null :: Last a -> Bool # length :: Last a -> Int # elem :: Eq a => a -> Last a -> Bool # maximum :: Ord a => Last a -> a # minimum :: Ord a => Last a -> a # sum :: Num a => Last a -> a # product :: Num a => Last a -> a #
Foldable SCC	Since: containers-0.5.9
Instance details 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 # toList :: SCC a -> [a] # null :: SCC a -> Bool # length :: SCC a -> Int # elem :: Eq a => a -> SCC a -> Bool # maximum :: Ord a => SCC a -> a # minimum :: Ord a => SCC a -> a # sum :: Num a => SCC a -> a # product :: Num a => SCC a -> a #
Foldable Complex	Since: base-4.9.0.0
Instance details 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 # toList :: Complex a -> [a] # null :: Complex a -> Bool # length :: Complex a -> Int # elem :: Eq a => a -> Complex a -> Bool # maximum :: Ord a => Complex a -> a # minimum :: Ord a => Complex a -> a # sum :: Num a => Complex a -> a # product :: Num a => Complex a -> a #
Foldable Min	Since: base-4.9.0.0
Instance details 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 # toList :: Min a -> [a] # null :: Min a -> Bool # length :: Min a -> Int # elem :: Eq a => a -> Min a -> Bool # maximum :: Ord a => Min a -> a # minimum :: Ord a => Min a -> a # sum :: Num a => Min a -> a # product :: Num a => Min a -> a #
Foldable Max	Since: base-4.9.0.0
Instance details 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 # toList :: Max a -> [a] # null :: Max a -> Bool # length :: Max a -> Int # elem :: Eq a => a -> Max a -> Bool # maximum :: Ord a => Max a -> a # minimum :: Ord a => Max a -> a # sum :: Num a => Max a -> a # product :: Num a => Max a -> a #
Foldable First	Since: base-4.9.0.0
Instance details 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 # toList :: First a -> [a] # null :: First a -> Bool # length :: First a -> Int # elem :: Eq a => a -> First a -> Bool # maximum :: Ord a => First a -> a # minimum :: Ord a => First a -> a # sum :: Num a => First a -> a # product :: Num a => First a -> a #
Foldable Option	Since: base-4.9.0.0
Instance details 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 # toList :: Option a -> [a] # null :: Option a -> Bool # length :: Option a -> Int # elem :: Eq a => a -> Option a -> Bool # maximum :: Ord a => Option a -> a # minimum :: Ord a => Option a -> a # sum :: Num a => Option a -> a # product :: Num a => Option a -> a #
Foldable ZipList	Since: base-4.9.0.0
Instance details 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 # toList :: ZipList a -> [a] # null :: ZipList a -> Bool # length :: ZipList a -> Int # elem :: Eq a => a -> ZipList a -> Bool # maximum :: Ord a => ZipList a -> a # minimum :: Ord a => ZipList a -> a # sum :: Num a => ZipList a -> a # product :: Num a => ZipList a -> a #
Foldable Identity	Since: base-4.8.0.0
Instance details 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 # toList :: Identity a -> [a] # null :: Identity a -> Bool # length :: Identity a -> Int # elem :: Eq a => a -> Identity a -> Bool # maximum :: Ord a => Identity a -> a # minimum :: Ord a => Identity a -> a # sum :: Num a => Identity a -> a # product :: Num a => Identity a -> a #
Foldable First	Since: base-4.8.0.0
Instance details 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 # toList :: First a -> [a] # null :: First a -> Bool # length :: First a -> Int # elem :: Eq a => a -> First a -> Bool # maximum :: Ord a => First a -> a # minimum :: Ord a => First a -> a # sum :: Num a => First a -> a # product :: Num a => First a -> a #
Foldable Last	Since: base-4.8.0.0
Instance details 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 # toList :: Last a -> [a] # null :: Last a -> Bool # length :: Last a -> Int # elem :: Eq a => a -> Last a -> Bool # maximum :: Ord a => Last a -> a # minimum :: Ord a => Last a -> a # sum :: Num a => Last a -> a # product :: Num a => Last a -> a #
Foldable Dual	Since: base-4.8.0.0
Instance details 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 # toList :: Dual a -> [a] # null :: Dual a -> Bool # length :: Dual a -> Int # elem :: Eq a => a -> Dual a -> Bool # maximum :: Ord a => Dual a -> a # minimum :: Ord a => Dual a -> a # sum :: Num a => Dual a -> a # product :: Num a => Dual a -> a #
Foldable Sum	Since: base-4.8.0.0
Instance details 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 # toList :: Sum a -> [a] # null :: Sum a -> Bool # length :: Sum a -> Int # elem :: Eq a => a -> Sum a -> Bool # maximum :: Ord a => Sum a -> a # minimum :: Ord a => Sum a -> a # sum :: Num a => Sum a -> a # product :: Num a => Sum a -> a #
Foldable Product	Since: base-4.8.0.0
Instance details 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 # toList :: Product a -> [a] # null :: Product a -> Bool # length :: Product a -> Int # elem :: Eq a => a -> Product a -> Bool # maximum :: Ord a => Product a -> a # minimum :: Ord a => Product a -> a # sum :: Num a => Product a -> a # product :: Num a => Product a -> a #
Foldable Down	Since: base-4.12.0.0
Instance details 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 # toList :: Down a -> [a] # null :: Down a -> Bool # length :: Down a -> Int # elem :: Eq a => a -> Down a -> Bool # maximum :: Ord a => Down a -> a # minimum :: Ord a => Down a -> a # sum :: Num a => Down a -> a # product :: Num a => Down a -> a #
Foldable NonEmpty	Since: base-4.9.0.0
Instance details 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 # toList :: NonEmpty a -> [a] # null :: NonEmpty a -> Bool # length :: NonEmpty a -> Int # elem :: Eq a => a -> NonEmpty a -> Bool # maximum :: Ord a => NonEmpty a -> a # minimum :: Ord a => NonEmpty a -> a # sum :: Num a => NonEmpty a -> a # product :: Num a => NonEmpty a -> a #
Foldable Vector
Instance details 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 # toList :: Vector a -> [a] # null :: Vector a -> Bool # length :: Vector a -> Int # elem :: Eq a => a -> Vector a -> Bool # maximum :: Ord a => Vector a -> a # minimum :: Ord a => Vector a -> a # sum :: Num a => Vector a -> a # product :: Num a => Vector a -> a #
Foldable HashSet
Instance details 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 # toList :: HashSet a -> [a] # null :: HashSet a -> Bool # length :: HashSet a -> Int # elem :: Eq a => a -> HashSet a -> Bool # maximum :: Ord a => HashSet a -> a # minimum :: Ord a => HashSet a -> a # sum :: Num a => HashSet a -> a # product :: Num a => HashSet a -> a #
Foldable Set
Instance details 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 # toList :: Set a -> [a] # null :: Set a -> Bool # length :: Set a -> Int # elem :: Eq a => a -> Set a -> Bool # maximum :: Ord a => Set a -> a # minimum :: Ord a => Set a -> a # sum :: Num a => Set a -> a # product :: Num a => Set a -> a #
Foldable Seq
Instance details 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 # toList :: Seq a -> [a] # null :: Seq a -> Bool # length :: Seq a -> Int # elem :: Eq a => a -> Seq a -> Bool # maximum :: Ord a => Seq a -> a # minimum :: Ord a => Seq a -> a # sum :: Num a => Seq a -> a # product :: Num a => Seq a -> a #
Foldable IntMap
Instance details 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 # toList :: IntMap a -> [a] # null :: IntMap a -> Bool # length :: IntMap a -> Int # elem :: Eq a => a -> IntMap a -> Bool # maximum :: Ord a => IntMap a -> a # minimum :: Ord a => IntMap a -> a # sum :: Num a => IntMap a -> a # product :: Num a => IntMap a -> a #
Foldable DList
Instance details 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 # toList :: DList a -> [a] # null :: DList a -> Bool # length :: DList a -> Int # elem :: Eq a => a -> DList a -> Bool # maximum :: Ord a => DList a -> a # minimum :: Ord a => DList a -> a # sum :: Num a => DList a -> a # product :: Num a => DList a -> a #
Foldable Tree
Instance details 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 # toList :: Tree a -> [a] # null :: Tree a -> Bool # length :: Tree a -> Int # elem :: Eq a => a -> Tree a -> Bool # maximum :: Ord a => Tree a -> a # minimum :: Ord a => Tree a -> a # sum :: Num a => Tree a -> a # product :: Num a => Tree a -> a #
Foldable FingerTree
Instance details 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
Instance details 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 # toList :: Digit a -> [a] # null :: Digit a -> Bool # length :: Digit a -> Int # elem :: Eq a => a -> Digit a -> Bool # maximum :: Ord a => Digit a -> a # minimum :: Ord a => Digit a -> a # sum :: Num a => Digit a -> a # product :: Num a => Digit a -> a #
Foldable Node
Instance details 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 # toList :: Node a -> [a] # null :: Node a -> Bool # length :: Node a -> Int # elem :: Eq a => a -> Node a -> Bool # maximum :: Ord a => Node a -> a # minimum :: Ord a => Node a -> a # sum :: Num a => Node a -> a # product :: Num a => Node a -> a #
Foldable Elem
Instance details 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 # toList :: Elem a -> [a] # null :: Elem a -> Bool # length :: Elem a -> Int # elem :: Eq a => a -> Elem a -> Bool # maximum :: Ord a => Elem a -> a # minimum :: Ord a => Elem a -> a # sum :: Num a => Elem a -> a # product :: Num a => Elem a -> a #
Foldable ViewL
Instance details 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 # toList :: ViewL a -> [a] # null :: ViewL a -> Bool # length :: ViewL a -> Int # elem :: Eq a => a -> ViewL a -> Bool # maximum :: Ord a => ViewL a -> a # minimum :: Ord a => ViewL a -> a # sum :: Num a => ViewL a -> a # product :: Num a => ViewL a -> a #
Foldable ViewR
Instance details 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 # toList :: ViewR a -> [a] # null :: ViewR a -> Bool # length :: ViewR a -> Int # elem :: Eq a => a -> ViewR a -> Bool # maximum :: Ord a => ViewR a -> a # minimum :: Ord a => ViewR a -> a # sum :: Num a => ViewR a -> a # product :: Num a => ViewR a -> a #
Foldable FocusList
Instance details 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] # null :: FocusList a -> Bool # length :: FocusList a -> Int # elem :: Eq a => a -> FocusList a -> Bool # maximum :: Ord a => FocusList a -> a # minimum :: Ord a => FocusList a -> a # sum :: Num a => FocusList a -> a # product :: Num a => FocusList a -> a #
Foldable Hashed
Instance details 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 # toList :: Hashed a -> [a] # null :: Hashed a -> Bool # length :: Hashed a -> Int # elem :: Eq a => a -> Hashed a -> Bool # maximum :: Ord a => Hashed a -> a # minimum :: Ord a => Hashed a -> a # sum :: Num a => Hashed a -> a # product :: Num a => Hashed a -> a #
Foldable SmallArray
Instance details 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
Instance details 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 # toList :: Array a -> [a] # null :: Array a -> Bool # length :: Array a -> Int # elem :: Eq a => a -> Array a -> Bool # maximum :: Ord a => Array a -> a # minimum :: Ord a => Array a -> a # sum :: Num a => Array a -> a # product :: Num a => Array a -> a #
Foldable Option Source #
Instance details 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 # toList :: Option a -> [a] # null :: Option a -> Bool # length :: Option a -> Int # elem :: Eq a => a -> Option a -> Bool # maximum :: Ord a => Option a -> a # minimum :: Ord a => Option a -> a # sum :: Num a => Option a -> a # product :: Num a => Option a -> a #
Foldable Palette Source #
Instance details 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 # toList :: Palette a -> [a] # null :: Palette a -> Bool # length :: Palette a -> Int # elem :: Eq a => a -> Palette a -> Bool # maximum :: Ord a => Palette a -> a # minimum :: Ord a => Palette a -> a # sum :: Num a => Palette a -> a # product :: Num a => Palette a -> a #
Foldable (Either a)	Since: base-4.7.0.0
Instance details 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] # null :: Either a a0 -> Bool # 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 # sum :: Num a0 => Either a a0 -> a0 # product :: Num a0 => Either a a0 -> a0 #
Foldable (V1 :: Type -> Type)	Since: base-4.9.0.0
Instance details 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 # toList :: V1 a -> [a] # null :: V1 a -> Bool # length :: V1 a -> Int # elem :: Eq a => a -> V1 a -> Bool # maximum :: Ord a => V1 a -> a # minimum :: Ord a => V1 a -> a # sum :: Num a => V1 a -> a # product :: Num a => V1 a -> a #
Foldable (U1 :: Type -> Type)	Since: base-4.9.0.0
Instance details 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 # toList :: U1 a -> [a] # null :: U1 a -> Bool # length :: U1 a -> Int # elem :: Eq a => a -> U1 a -> Bool # maximum :: Ord a => U1 a -> a # minimum :: Ord a => U1 a -> a # sum :: Num a => U1 a -> a # product :: Num a => U1 a -> a #
Foldable ((,) a)	Since: base-4.7.0.0
Instance details 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 # toList :: (a, a0) -> [a0] # null :: (a, a0) -> Bool # length :: (a, a0) -> Int # elem :: Eq a0 => a0 -> (a, a0) -> Bool # maximum :: Ord a0 => (a, a0) -> a0 # minimum :: Ord a0 => (a, a0) -> a0 # sum :: Num a0 => (a, a0) -> a0 # product :: Num a0 => (a, a0) -> a0 #
Foldable (Map k)
Instance details 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 # toList :: Map k a -> [a] # null :: Map k a -> Bool # length :: Map k a -> Int # elem :: Eq a => a -> Map k a -> Bool # maximum :: Ord a => Map k a -> a # minimum :: Ord a => Map k a -> a # sum :: Num a => Map k a -> a # product :: Num a => Map k a -> a #
Foldable (HashMap k)
Instance details 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] # null :: HashMap k a -> Bool # 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 # sum :: Num a => HashMap k a -> a # product :: Num a => HashMap k a -> a #
Foldable (Array i)	Since: base-4.8.0.0
Instance details 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 # toList :: Array i a -> [a] # null :: Array i a -> Bool # length :: Array i a -> Int # elem :: Eq a => a -> Array i a -> Bool # maximum :: Ord a => Array i a -> a # minimum :: Ord a => Array i a -> a # sum :: Num a => Array i a -> a # product :: Num a => Array i a -> a #
Foldable (Arg a)	Since: base-4.9.0.0
Instance details 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 # toList :: Arg a a0 -> [a0] # null :: Arg a a0 -> Bool # length :: Arg a a0 -> Int # elem :: Eq a0 => a0 -> Arg a a0 -> Bool # maximum :: Ord a0 => Arg a a0 -> a0 # minimum :: Ord a0 => Arg a a0 -> a0 # sum :: Num a0 => Arg a a0 -> a0 # product :: Num a0 => Arg a a0 -> a0 #
Foldable (Proxy :: Type -> Type)	Since: base-4.7.0.0
Instance details 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 # toList :: Proxy a -> [a] # null :: Proxy a -> Bool # length :: Proxy a -> Int # elem :: Eq a => a -> Proxy a -> Bool # maximum :: Ord a => Proxy a -> a # minimum :: Ord a => Proxy a -> a # sum :: Num a => Proxy a -> a # product :: Num a => Proxy a -> a #
Foldable f => Foldable (MaybeT f)
Instance details 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 # toList :: MaybeT f a -> [a] # null :: MaybeT f a -> Bool # length :: MaybeT f a -> Int # elem :: Eq a => a -> MaybeT f a -> Bool # maximum :: Ord a => MaybeT f a -> a # minimum :: Ord a => MaybeT f a -> a # sum :: Num a => MaybeT f a -> a # product :: Num a => MaybeT f a -> a #
Foldable f => Foldable (Cofree f)
Instance details 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 # toList :: Cofree f a -> [a] # null :: Cofree f a -> Bool # length :: Cofree f a -> Int # elem :: Eq a => a -> Cofree f a -> Bool # maximum :: Ord a => Cofree f a -> a # minimum :: Ord a => Cofree f a -> a # sum :: Num a => Cofree f a -> a # product :: Num a => Cofree f a -> a #
Foldable f => Foldable (Free f)
Instance details 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 # toList :: Free f a -> [a] # null :: Free f a -> Bool # length :: Free f a -> Int # elem :: Eq a => a -> Free f a -> Bool # maximum :: Ord a => Free f a -> a # minimum :: Ord a => Free f a -> a # sum :: Num a => Free f a -> a # product :: Num a => Free f a -> a #
Foldable f => Foldable (Yoneda f)
Instance details 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 # toList :: Yoneda f a -> [a] # null :: Yoneda f a -> Bool # length :: Yoneda f a -> Int # elem :: Eq a => a -> Yoneda f a -> Bool # maximum :: Ord a => Yoneda f a -> a # minimum :: Ord a => Yoneda f a -> a # sum :: Num a => Yoneda f a -> a # product :: Num a => Yoneda f a -> a #
Foldable f => Foldable (ListT f)
Instance details 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 # toList :: ListT f a -> [a] # null :: ListT f a -> Bool # length :: ListT f a -> Int # elem :: Eq a => a -> ListT f a -> Bool # maximum :: Ord a => ListT f a -> a # minimum :: Ord a => ListT f a -> a # sum :: Num a => ListT f a -> a # product :: Num a => ListT f a -> a #
SingI ns => Foldable (Matrix ns) Source #
Instance details 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] # null :: Matrix ns a -> Bool # 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 # sum :: Num a => Matrix ns a -> a # product :: Num a => Matrix ns a -> a #
Foldable (Vec n) Source #
Instance details 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 # toList :: Vec n a -> [a] # null :: Vec n a -> Bool # length :: Vec n a -> Int # elem :: Eq a => a -> Vec n a -> Bool # maximum :: Ord a => Vec n a -> a # minimum :: Ord a => Vec n a -> a # sum :: Num a => Vec n a -> a # product :: Num a => Vec n a -> a #
Foldable f => Foldable (Rec1 f)	Since: base-4.9.0.0
Instance details 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 # toList :: Rec1 f a -> [a] # null :: Rec1 f a -> Bool # length :: Rec1 f a -> Int # elem :: Eq a => a -> Rec1 f a -> Bool # maximum :: Ord a => Rec1 f a -> a # minimum :: Ord a => Rec1 f a -> a # sum :: Num a => Rec1 f a -> a # product :: Num a => Rec1 f a -> a #
Foldable (URec Char :: Type -> Type)	Since: base-4.9.0.0
Instance details 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] # null :: URec Char a -> Bool # 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 # sum :: Num a => URec Char a -> a # product :: Num a => URec Char a -> a #
Foldable (URec Double :: Type -> Type)	Since: base-4.9.0.0
Instance details 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 # sum :: Num a => URec Double a -> a # product :: Num a => URec Double a -> a #
Foldable (URec Float :: Type -> Type)	Since: base-4.9.0.0
Instance details 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 # sum :: Num a => URec Float a -> a # product :: Num a => URec Float a -> a #
Foldable (URec Int :: Type -> Type)	Since: base-4.9.0.0
Instance details 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 # toList :: URec Int a -> [a] # null :: URec Int a -> Bool # length :: URec Int a -> Int # elem :: Eq a => a -> URec Int a -> Bool # maximum :: Ord a => URec Int a -> a # minimum :: Ord a => URec Int a -> a # sum :: Num a => URec Int a -> a # product :: Num a => URec Int a -> a #
Foldable (URec Word :: Type -> Type)	Since: base-4.9.0.0
Instance details 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] # null :: URec Word a -> Bool # 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 # sum :: Num a => URec Word a -> a # product :: Num a => URec Word a -> a #
Foldable (URec (Ptr ()) :: Type -> Type)	Since: base-4.9.0.0
Instance details 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 # sum :: Num a => URec (Ptr ()) a -> a # product :: Num a => URec (Ptr ()) a -> a #
Foldable (Const m :: Type -> Type)	Since: base-4.7.0.0
Instance details 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 # toList :: Const m a -> [a] # null :: Const m a -> Bool # length :: Const m a -> Int # elem :: Eq a => a -> Const m a -> Bool # maximum :: Ord a => Const m a -> a # minimum :: Ord a => Const m a -> a # sum :: Num a => Const m a -> a # product :: Num a => Const m a -> a #
Foldable f => Foldable (Ap f)	Since: base-4.12.0.0
Instance details 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 # toList :: Ap f a -> [a] # null :: Ap f a -> Bool # length :: Ap f a -> Int # elem :: Eq a => a -> Ap f a -> Bool # maximum :: Ord a => Ap f a -> a # minimum :: Ord a => Ap f a -> a # sum :: Num a => Ap f a -> a # product :: Num a => Ap f a -> a #
Foldable f => Foldable (Alt f)	Since: base-4.12.0.0
Instance details 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 # toList :: Alt f a -> [a] # null :: Alt f a -> Bool # length :: Alt f a -> Int # elem :: Eq a => a -> Alt f a -> Bool # maximum :: Ord a => Alt f a -> a # minimum :: Ord a => Alt f a -> a # sum :: Num a => Alt f a -> a # product :: Num a => Alt f a -> a #
Bifoldable p => Foldable (Join p)
Instance details 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 # toList :: Join p a -> [a] # null :: Join p a -> Bool # length :: Join p a -> Int # elem :: Eq a => a -> Join p a -> Bool # maximum :: Ord a => Join p a -> a # minimum :: Ord a => Join p a -> a # sum :: Num a => Join p a -> a # product :: Num a => Join p a -> a #
Bifoldable p => Foldable (Fix p)
Instance details 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 # toList :: Fix p a -> [a] # null :: Fix p a -> Bool # length :: Fix p a -> Int # elem :: Eq a => a -> Fix p a -> Bool # maximum :: Ord a => Fix p a -> a # minimum :: Ord a => Fix p a -> a # sum :: Num a => Fix p a -> a # product :: Num a => Fix p a -> a #
Foldable w => Foldable (EnvT e w)
Instance details 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 # toList :: EnvT e w a -> [a] # null :: EnvT e w a -> Bool # length :: EnvT e w a -> Int # 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 # sum :: Num a => EnvT e w a -> a # product :: Num a => EnvT e w a -> a #
Foldable f => Foldable (IdentityT f)
Instance details 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 # sum :: Num a => IdentityT f a -> a # product :: Num a => IdentityT f a -> a #
Foldable f => Foldable (WriterT w f)
Instance details 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 # sum :: Num a => WriterT w f a -> a # product :: Num a => WriterT w f a -> a #
Foldable f => Foldable (WriterT w f)
Instance details 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 # sum :: Num a => WriterT w f a -> a # product :: Num a => WriterT w f a -> a #
Foldable f => Foldable (FreeF f a)
Instance details 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 # sum :: Num a0 => FreeF f a a0 -> a0 # product :: Num a0 => FreeF f a a0 -> a0 #
(Foldable m, Foldable f) => Foldable (FreeT f m)
Instance details 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] # null :: FreeT f m a -> Bool # 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 # sum :: Num a => FreeT f m a -> a # product :: Num a => FreeT f m a -> a #
Foldable f => Foldable (CofreeF f a)
Instance details 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 # sum :: Num a0 => CofreeF f a a0 -> a0 # product :: Num a0 => CofreeF f a a0 -> a0 #
(Foldable f, Foldable w) => Foldable (CofreeT f w)
Instance details 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 # sum :: Num a => CofreeT f w a -> a # product :: Num a => CofreeT f w a -> a #
Foldable f => Foldable (ErrorT e f)
Instance details 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 # sum :: Num a => ErrorT e f a -> a # product :: Num a => ErrorT e f a -> a #
Foldable (Tagged s)
Instance details 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 # toList :: Tagged s a -> [a] # null :: Tagged s a -> Bool # length :: Tagged s a -> Int # elem :: Eq a => a -> Tagged s a -> Bool # maximum :: Ord a => Tagged s a -> a # minimum :: Ord a => Tagged s a -> a # sum :: Num a => Tagged s a -> a # product :: Num a => Tagged s a -> a #
Foldable (K1 i c :: Type -> Type)	Since: base-4.9.0.0
Instance details 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 # toList :: K1 i c a -> [a] # null :: K1 i c a -> Bool # length :: K1 i c a -> Int # 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 # sum :: Num a => K1 i c a -> a # product :: Num a => K1 i c a -> a #
(Foldable f, Foldable g) => Foldable (f :+: g)	Since: base-4.9.0.0
Instance details 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] # null :: (f :+: g) a -> Bool # 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 # sum :: Num a => (f :+: g) a -> a # product :: Num a => (f :+: g) a -> a #
(Foldable f, Foldable g) => Foldable (f :*: g)	Since: base-4.9.0.0
Instance details 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] # null :: (f :: g) a -> Bool # 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 # sum :: Num a => (f :: g) a -> a # product :: Num a => (f :: g) a -> a #
(Foldable f, Foldable g) => Foldable (Product f g)	Since: base-4.9.0.0
Instance details 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 # sum :: Num a => Product f g a -> a # product :: Num a => Product f g a -> a #
(Foldable f, Foldable g) => Foldable (Sum f g)	Since: base-4.9.0.0
Instance details 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 # toList :: Sum f g a -> [a] # null :: Sum f g a -> Bool # length :: Sum f g a -> Int # 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 # sum :: Num a => Sum f g a -> a # product :: Num a => Sum f g a -> a #
Foldable f => Foldable (M1 i c f)	Since: base-4.9.0.0
Instance details 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 # toList :: M1 i c f a -> [a] # null :: M1 i c f a -> Bool # length :: M1 i c f a -> Int # 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 # sum :: Num a => M1 i c f a -> a # product :: Num a => M1 i c f a -> a #
(Foldable f, Foldable g) => Foldable (f :.: g)	Since: base-4.9.0.0
Instance details 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] # null :: (f :.: g) a -> Bool # 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 # sum :: Num a => (f :.: g) a -> a # product :: Num a => (f :.: g) a -> a #
(Foldable f, Foldable g) => Foldable (Compose f g)	Since: base-4.9.0.0
Instance details 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 # sum :: Num a => Compose f g a -> a # product :: Num a => Compose f g a -> a #
Bifoldable p => Foldable (WrappedBifunctor p a)
Instance details 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)
Instance details 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 # sum :: Num a0 => Joker g a a0 -> a0 # product :: Num a0 => Joker g a a0 -> a0 #
Bifoldable p => Foldable (Flip p a)
Instance details 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] # null :: Flip p a a0 -> Bool # 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 # sum :: Num a0 => Flip p a a0 -> a0 # product :: Num a0 => Flip p a a0 -> a0 #
Foldable (Clown f a :: Type -> Type)
Instance details 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 # sum :: Num a0 => Clown f a a0 -> a0 # product :: Num a0 => Clown f a a0 -> a0 #
(Foldable f, Bifoldable p) => Foldable (Tannen f p a)
Instance details 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 # sum :: Num a0 => Tannen f p a a0 -> a0 # product :: Num a0 => Tannen f p a a0 -> a0 #
(Bifoldable p, Foldable g) => Foldable (Biff p f g a)
Instance details 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 # sum :: Num a0 => Biff p f g a a0 -> a0 # product :: Num 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 . traverse f = traverse (t . f) for every applicative transformation t
identity: traverse Identity = Identity
composition: traverse (Compose . fmap g . f) = Compose . fmap (traverse g) . traverse f

A definition of sequenceA must satisfy the following laws:

naturality: t . sequenceA = sequenceA . fmap t for every applicative transformation t
identity: sequenceA . fmap Identity = Identity
composition: sequenceA . fmap Compose = Compose . fmap sequenceA . sequenceA

where an applicative transformation is a function

t :: (Applicative f, Applicative g) => f a -> g a

preserving the Applicative operations, i.e.

```
t (pure x) = pure x
```
```
t (x <*> y) = t x <*> t y
```

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 Functor instance, fmap should be equivalent to traversal with the identity applicative functor (fmapDefault).
In the Foldable instance, foldMap should be equivalent to traversal with a constant applicative functor (foldMapDefault).

Minimal complete definition

traverse | sequenceA

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

Traversable []	Since: base-2.1
Instance details Defined in Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> [a] -> f [b] # sequenceA :: Applicative f => [f a] -> f [a] # mapM :: Monad m => (a -> m b) -> [a] -> m [b] # sequence :: Monad m => [m a] -> m [a] #
Traversable Maybe	Since: base-2.1
Instance details Defined in Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> Maybe a -> f (Maybe b) # sequenceA :: Applicative f => Maybe (f a) -> f (Maybe a) # mapM :: Monad m => (a -> m b) -> Maybe a -> m (Maybe b) # sequence :: Monad m => Maybe (m a) -> m (Maybe a) #
Traversable Par1	Since: base-4.9.0.0
Instance details Defined in Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> Par1 a -> f (Par1 b) # sequenceA :: Applicative f => Par1 (f a) -> f (Par1 a) # mapM :: Monad m => (a -> m b) -> Par1 a -> m (Par1 b) # sequence :: Monad m => Par1 (m a) -> m (Par1 a) #
Traversable Last	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods traverse :: Applicative f => (a -> f b) -> Last a -> f (Last b) # sequenceA :: Applicative f => Last (f a) -> f (Last a) # mapM :: Monad m => (a -> m b) -> Last a -> m (Last b) # sequence :: Monad m => Last (m a) -> m (Last a) #
Traversable SCC	Since: containers-0.5.9
Instance details Defined in Data.Graph Methods traverse :: Applicative f => (a -> f b) -> SCC a -> f (SCC b) # sequenceA :: Applicative f => SCC (f a) -> f (SCC a) # mapM :: Monad m => (a -> m b) -> SCC a -> m (SCC b) # sequence :: Monad m => SCC (m a) -> m (SCC a) #
Traversable Complex	Since: base-4.9.0.0
Instance details Defined in Data.Complex Methods traverse :: Applicative f => (a -> f b) -> Complex a -> f (Complex b) # sequenceA :: Applicative f => Complex (f a) -> f (Complex a) # mapM :: Monad m => (a -> m b) -> Complex a -> m (Complex b) # sequence :: Monad m => Complex (m a) -> m (Complex a) #
Traversable Min	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods traverse :: Applicative f => (a -> f b) -> Min a -> f (Min b) # sequenceA :: Applicative f => Min (f a) -> f (Min a) # mapM :: Monad m => (a -> m b) -> Min a -> m (Min b) # sequence :: Monad m => Min (m a) -> m (Min a) #
Traversable Max	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods traverse :: Applicative f => (a -> f b) -> Max a -> f (Max b) # sequenceA :: Applicative f => Max (f a) -> f (Max a) # mapM :: Monad m => (a -> m b) -> Max a -> m (Max b) # sequence :: Monad m => Max (m a) -> m (Max a) #
Traversable First	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods traverse :: Applicative f => (a -> f b) -> First a -> f (First b) # sequenceA :: Applicative f => First (f a) -> f (First a) # mapM :: Monad m => (a -> m b) -> First a -> m (First b) # sequence :: Monad m => First (m a) -> m (First a) #
Traversable Option	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods traverse :: Applicative f => (a -> f b) -> Option a -> f (Option b) # sequenceA :: Applicative f => Option (f a) -> f (Option a) # mapM :: Monad m => (a -> m b) -> Option a -> m (Option b) # sequence :: Monad m => Option (m a) -> m (Option a) #
Traversable ZipList	Since: base-4.9.0.0
Instance details Defined in Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> ZipList a -> f (ZipList b) # sequenceA :: Applicative f => ZipList (f a) -> f (ZipList a) # mapM :: Monad m => (a -> m b) -> ZipList a -> m (ZipList b) # sequence :: Monad m => ZipList (m a) -> m (ZipList a) #
Traversable Identity	Since: base-4.9.0.0
Instance details Defined in Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> Identity a -> f (Identity b) # sequenceA :: Applicative f => Identity (f a) -> f (Identity a) # mapM :: Monad m => (a -> m b) -> Identity a -> m (Identity b) # sequence :: Monad m => Identity (m a) -> m (Identity a) #
Traversable First	Since: base-4.8.0.0
Instance details Defined in Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> First a -> f (First b) # sequenceA :: Applicative f => First (f a) -> f (First a) # mapM :: Monad m => (a -> m b) -> First a -> m (First b) # sequence :: Monad m => First (m a) -> m (First a) #
Traversable Last	Since: base-4.8.0.0
Instance details Defined in Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> Last a -> f (Last b) # sequenceA :: Applicative f => Last (f a) -> f (Last a) # mapM :: Monad m => (a -> m b) -> Last a -> m (Last b) # sequence :: Monad m => Last (m a) -> m (Last a) #
Traversable Dual	Since: base-4.8.0.0
Instance details Defined in Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> Dual a -> f (Dual b) # sequenceA :: Applicative f => Dual (f a) -> f (Dual a) # mapM :: Monad m => (a -> m b) -> Dual a -> m (Dual b) # sequence :: Monad m => Dual (m a) -> m (Dual a) #
Traversable Sum	Since: base-4.8.0.0
Instance details Defined in Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> Sum a -> f (Sum b) # sequenceA :: Applicative f => Sum (f a) -> f (Sum a) # mapM :: Monad m => (a -> m b) -> Sum a -> m (Sum b) # sequence :: Monad m => Sum (m a) -> m (Sum a) #
Traversable Product	Since: base-4.8.0.0
Instance details Defined in Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> Product a -> f (Product b) # sequenceA :: Applicative f => Product (f a) -> f (Product a) # mapM :: Monad m => (a -> m b) -> Product a -> m (Product b) # sequence :: Monad m => Product (m a) -> m (Product a) #
Traversable Down	Since: base-4.12.0.0
Instance details Defined in Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> Down a -> f (Down b) # sequenceA :: Applicative f => Down (f a) -> f (Down a) # mapM :: Monad m => (a -> m b) -> Down a -> m (Down b) # sequence :: Monad m => Down (m a) -> m (Down a) #
Traversable NonEmpty	Since: base-4.9.0.0
Instance details Defined in Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> NonEmpty a -> f (NonEmpty b) # sequenceA :: Applicative f => NonEmpty (f a) -> f (NonEmpty a) # mapM :: Monad m => (a -> m b) -> NonEmpty a -> m (NonEmpty b) # sequence :: Monad m => NonEmpty (m a) -> m (NonEmpty a) #
Traversable Vector
Instance details Defined in Data.Vector Methods traverse :: Applicative f => (a -> f b) -> Vector a -> f (Vector b) # sequenceA :: Applicative f => Vector (f a) -> f (Vector a) # mapM :: Monad m => (a -> m b) -> Vector a -> m (Vector b) # sequence :: Monad m => Vector (m a) -> m (Vector a) #
Traversable Seq
Instance details Defined in Data.Sequence.Internal Methods traverse :: Applicative f => (a -> f b) -> Seq a -> f (Seq b) # sequenceA :: Applicative f => Seq (f a) -> f (Seq a) # mapM :: Monad m => (a -> m b) -> Seq a -> m (Seq b) # sequence :: Monad m => Seq (m a) -> m (Seq a) #
Traversable IntMap
Instance details Defined in Data.IntMap.Internal Methods traverse :: Applicative f => (a -> f b) -> IntMap a -> f (IntMap b) # sequenceA :: Applicative f => IntMap (f a) -> f (IntMap a) # mapM :: Monad m => (a -> m b) -> IntMap a -> m (IntMap b) # sequence :: Monad m => IntMap (m a) -> m (IntMap a) #
Traversable Tree
Instance details Defined in Data.Tree Methods traverse :: Applicative f => (a -> f b) -> Tree a -> f (Tree b) # sequenceA :: Applicative f => Tree (f a) -> f (Tree a) # mapM :: Monad m => (a -> m b) -> Tree a -> m (Tree b) # sequence :: Monad m => Tree (m a) -> m (Tree a) #
Traversable FingerTree
Instance details Defined in Data.Sequence.Internal Methods traverse :: Applicative f => (a -> f b) -> FingerTree a -> f (FingerTree b) # sequenceA :: Applicative f => FingerTree (f a) -> f (FingerTree a) # mapM :: Monad m => (a -> m b) -> FingerTree a -> m (FingerTree b) # sequence :: Monad m => FingerTree (m a) -> m (FingerTree a) #
Traversable Digit
Instance details Defined in Data.Sequence.Internal Methods traverse :: Applicative f => (a -> f b) -> Digit a -> f (Digit b) # sequenceA :: Applicative f => Digit (f a) -> f (Digit a) # mapM :: Monad m => (a -> m b) -> Digit a -> m (Digit b) # sequence :: Monad m => Digit (m a) -> m (Digit a) #
Traversable Node
Instance details Defined in Data.Sequence.Internal Methods traverse :: Applicative f => (a -> f b) -> Node a -> f (Node b) # sequenceA :: Applicative f => Node (f a) -> f (Node a) # mapM :: Monad m => (a -> m b) -> Node a -> m (Node b) # sequence :: Monad m => Node (m a) -> m (Node a) #
Traversable Elem
Instance details Defined in Data.Sequence.Internal Methods traverse :: Applicative f => (a -> f b) -> Elem a -> f (Elem b) # sequenceA :: Applicative f => Elem (f a) -> f (Elem a) # mapM :: Monad m => (a -> m b) -> Elem a -> m (Elem b) # sequence :: Monad m => Elem (m a) -> m (Elem a) #
Traversable ViewL
Instance details Defined in Data.Sequence.Internal Methods traverse :: Applicative f => (a -> f b) -> ViewL a -> f (ViewL b) # sequenceA :: Applicative f => ViewL (f a) -> f (ViewL a) # mapM :: Monad m => (a -> m b) -> ViewL a -> m (ViewL b) # sequence :: Monad m => ViewL (m a) -> m (ViewL a) #
Traversable ViewR
Instance details Defined in Data.Sequence.Internal Methods traverse :: Applicative f => (a -> f b) -> ViewR a -> f (ViewR b) # sequenceA :: Applicative f => ViewR (f a) -> f (ViewR a) # mapM :: Monad m => (a -> m b) -> ViewR a -> m (ViewR b) # sequence :: Monad m => ViewR (m a) -> m (ViewR a) #
Traversable FocusList
Instance details Defined in Data.FocusList Methods traverse :: Applicative f => (a -> f b) -> FocusList a -> f (FocusList b) # sequenceA :: Applicative f => FocusList (f a) -> f (FocusList a) # mapM :: Monad m => (a -> m b) -> FocusList a -> m (FocusList b) # sequence :: Monad m => FocusList (m a) -> m (FocusList a) #
Traversable SmallArray
Instance details Defined in Data.Primitive.SmallArray Methods traverse :: Applicative f => (a -> f b) -> SmallArray a -> f (SmallArray b) # sequenceA :: Applicative f => SmallArray (f a) -> f (SmallArray a) # mapM :: Monad m => (a -> m b) -> SmallArray a -> m (SmallArray b) # sequence :: Monad m => SmallArray (m a) -> m (SmallArray a) #
Traversable Array
Instance details Defined in Data.Primitive.Array Methods traverse :: Applicative f => (a -> f b) -> Array a -> f (Array b) # sequenceA :: Applicative f => Array (f a) -> f (Array a) # mapM :: Monad m => (a -> m b) -> Array a -> m (Array b) # sequence :: Monad m => Array (m a) -> m (Array a) #
Traversable (Either a)	Since: base-4.7.0.0
Instance details Defined in Data.Traversable Methods traverse :: Applicative f => (a0 -> f b) -> Either a a0 -> f (Either a b) # sequenceA :: Applicative f => Either a (f a0) -> f (Either a a0) # mapM :: Monad m => (a0 -> m b) -> Either a a0 -> m (Either a b) # sequence :: Monad m => Either a (m a0) -> m (Either a a0) #
Traversable (V1 :: Type -> Type)	Since: base-4.9.0.0
Instance details Defined in Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> V1 a -> f (V1 b) # sequenceA :: Applicative f => V1 (f a) -> f (V1 a) # mapM :: Monad m => (a -> m b) -> V1 a -> m (V1 b) # sequence :: Monad m => V1 (m a) -> m (V1 a) #
Traversable (U1 :: Type -> Type)	Since: base-4.9.0.0
Instance details Defined in Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> U1 a -> f (U1 b) # sequenceA :: Applicative f => U1 (f a) -> f (U1 a) # mapM :: Monad m => (a -> m b) -> U1 a -> m (U1 b) # sequence :: Monad m => U1 (m a) -> m (U1 a) #
Traversable ((,) a)	Since: base-4.7.0.0
Instance details Defined in Data.Traversable Methods traverse :: Applicative f => (a0 -> f b) -> (a, a0) -> f (a, b) # sequenceA :: Applicative f => (a, f a0) -> f (a, a0) # mapM :: Monad m => (a0 -> m b) -> (a, a0) -> m (a, b) # sequence :: Monad m => (a, m a0) -> m (a, a0) #
Traversable (Map k)
Instance details Defined in Data.Map.Internal Methods traverse :: Applicative f => (a -> f b) -> Map k a -> f (Map k b) # sequenceA :: Applicative f => Map k (f a) -> f (Map k a) # mapM :: Monad m => (a -> m b) -> Map k a -> m (Map k b) # sequence :: Monad m => Map k (m a) -> m (Map k a) #
Traversable (HashMap k)
Instance details Defined in Data.HashMap.Base Methods traverse :: Applicative f => (a -> f b) -> HashMap k a -> f (HashMap k b) # sequenceA :: Applicative f => HashMap k (f a) -> f (HashMap k a) # mapM :: Monad m => (a -> m b) -> HashMap k a -> m (HashMap k b) # sequence :: Monad m => HashMap k (m a) -> m (HashMap k a) #
Ix i => Traversable (Array i)	Since: base-2.1
Instance details Defined in Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> Array i a -> f (Array i b) # sequenceA :: Applicative f => Array i (f a) -> f (Array i a) # mapM :: Monad m => (a -> m b) -> Array i a -> m (Array i b) # sequence :: Monad m => Array i (m a) -> m (Array i a) #
Traversable (Arg a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods traverse :: Applicative f => (a0 -> f b) -> Arg a a0 -> f (Arg a b) # sequenceA :: Applicative f => Arg a (f a0) -> f (Arg a a0) # mapM :: Monad m => (a0 -> m b) -> Arg a a0 -> m (Arg a b) # sequence :: Monad m => Arg a (m a0) -> m (Arg a a0) #
Traversable (Proxy :: Type -> Type)	Since: base-4.7.0.0
Instance details Defined in Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> Proxy a -> f (Proxy b) # sequenceA :: Applicative f => Proxy (f a) -> f (Proxy a) # mapM :: Monad m => (a -> m b) -> Proxy a -> m (Proxy b) # sequence :: Monad m => Proxy (m a) -> m (Proxy a) #
Traversable f => Traversable (MaybeT f)
Instance details Defined in Control.Monad.Trans.Maybe Methods traverse :: Applicative f0 => (a -> f0 b) -> MaybeT f a -> f0 (MaybeT f b) # sequenceA :: Applicative f0 => MaybeT f (f0 a) -> f0 (MaybeT f a) # mapM :: Monad m => (a -> m b) -> MaybeT f a -> m (MaybeT f b) # sequence :: Monad m => MaybeT f (m a) -> m (MaybeT f a) #
Traversable f => Traversable (Cofree f)
Instance details Defined in Control.Comonad.Cofree Methods traverse :: Applicative f0 => (a -> f0 b) -> Cofree f a -> f0 (Cofree f b) # sequenceA :: Applicative f0 => Cofree f (f0 a) -> f0 (Cofree f a) # mapM :: Monad m => (a -> m b) -> Cofree f a -> m (Cofree f b) # sequence :: Monad m => Cofree f (m a) -> m (Cofree f a) #
Traversable f => Traversable (Free f)
Instance details Defined in Control.Monad.Free Methods traverse :: Applicative f0 => (a -> f0 b) -> Free f a -> f0 (Free f b) # sequenceA :: Applicative f0 => Free f (f0 a) -> f0 (Free f a) # mapM :: Monad m => (a -> m b) -> Free f a -> m (Free f b) # sequence :: Monad m => Free f (m a) -> m (Free f a) #
Traversable f => Traversable (Yoneda f)
Instance details Defined in Data.Functor.Yoneda Methods traverse :: Applicative f0 => (a -> f0 b) -> Yoneda f a -> f0 (Yoneda f b) # sequenceA :: Applicative f0 => Yoneda f (f0 a) -> f0 (Yoneda f a) # mapM :: Monad m => (a -> m b) -> Yoneda f a -> m (Yoneda f b) # sequence :: Monad m => Yoneda f (m a) -> m (Yoneda f a) #
Traversable f => Traversable (ListT f)
Instance details Defined in Control.Monad.Trans.List Methods traverse :: Applicative f0 => (a -> f0 b) -> ListT f a -> f0 (ListT f b) # sequenceA :: Applicative f0 => ListT f (f0 a) -> f0 (ListT f a) # mapM :: Monad m => (a -> m b) -> ListT f a -> m (ListT f b) # sequence :: Monad m => ListT f (m a) -> m (ListT f a) #
Traversable f => Traversable (Rec1 f)	Since: base-4.9.0.0
Instance details Defined in Data.Traversable Methods traverse :: Applicative f0 => (a -> f0 b) -> Rec1 f a -> f0 (Rec1 f b) # sequenceA :: Applicative f0 => Rec1 f (f0 a) -> f0 (Rec1 f a) # mapM :: Monad m => (a -> m b) -> Rec1 f a -> m (Rec1 f b) # sequence :: Monad m => Rec1 f (m a) -> m (Rec1 f a) #
Traversable (URec Char :: Type -> Type)	Since: base-4.9.0.0
Instance details Defined in Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> URec Char a -> f (URec Char b) # sequenceA :: Applicative f => URec Char (f a) -> f (URec Char a) # mapM :: Monad m => (a -> m b) -> URec Char a -> m (URec Char b) # sequence :: Monad m => URec Char (m a) -> m (URec Char a) #
Traversable (URec Double :: Type -> Type)	Since: base-4.9.0.0
Instance details Defined in Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> URec Double a -> f (URec Double b) # sequenceA :: Applicative f => URec Double (f a) -> f (URec Double a) # mapM :: Monad m => (a -> m b) -> URec Double a -> m (URec Double b) # sequence :: Monad m => URec Double (m a) -> m (URec Double a) #
Traversable (URec Float :: Type -> Type)	Since: base-4.9.0.0
Instance details Defined in Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> URec Float a -> f (URec Float b) # sequenceA :: Applicative f => URec Float (f a) -> f (URec Float a) # mapM :: Monad m => (a -> m b) -> URec Float a -> m (URec Float b) # sequence :: Monad m => URec Float (m a) -> m (URec Float a) #
Traversable (URec Int :: Type -> Type)	Since: base-4.9.0.0
Instance details Defined in Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> URec Int a -> f (URec Int b) # sequenceA :: Applicative f => URec Int (f a) -> f (URec Int a) # mapM :: Monad m => (a -> m b) -> URec Int a -> m (URec Int b) # sequence :: Monad m => URec Int (m a) -> m (URec Int a) #
Traversable (URec Word :: Type -> Type)	Since: base-4.9.0.0
Instance details Defined in Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> URec Word a -> f (URec Word b) # sequenceA :: Applicative f => URec Word (f a) -> f (URec Word a) # mapM :: Monad m => (a -> m b) -> URec Word a -> m (URec Word b) # sequence :: Monad m => URec Word (m a) -> m (URec Word a) #
Traversable (URec (Ptr ()) :: Type -> Type)	Since: base-4.9.0.0
Instance details Defined in Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> URec (Ptr ()) a -> f (URec (Ptr ()) b) # sequenceA :: Applicative f => URec (Ptr ()) (f a) -> f (URec (Ptr ()) a) # mapM :: Monad m => (a -> m b) -> URec (Ptr ()) a -> m (URec (Ptr ()) b) # sequence :: Monad m => URec (Ptr ()) (m a) -> m (URec (Ptr ()) a) #
Traversable (Const m :: Type -> Type)	Since: base-4.7.0.0
Instance details Defined in Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> Const m a -> f (Const m b) # sequenceA :: Applicative f => Const m (f a) -> f (Const m a) # mapM :: Monad m0 => (a -> m0 b) -> Const m a -> m0 (Const m b) # sequence :: Monad m0 => Const m (m0 a) -> m0 (Const m a) #
Traversable f => Traversable (Ap f)	Since: base-4.12.0.0
Instance details Defined in Data.Traversable Methods traverse :: Applicative f0 => (a -> f0 b) -> Ap f a -> f0 (Ap f b) # sequenceA :: Applicative f0 => Ap f (f0 a) -> f0 (Ap f a) # mapM :: Monad m => (a -> m b) -> Ap f a -> m (Ap f b) # sequence :: Monad m => Ap f (m a) -> m (Ap f a) #
Traversable f => Traversable (Alt f)	Since: base-4.12.0.0
Instance details Defined in Data.Traversable Methods traverse :: Applicative f0 => (a -> f0 b) -> Alt f a -> f0 (Alt f b) # sequenceA :: Applicative f0 => Alt f (f0 a) -> f0 (Alt f a) # mapM :: Monad m => (a -> m b) -> Alt f a -> m (Alt f b) # sequence :: Monad m => Alt f (m a) -> m (Alt f a) #
Bitraversable p => Traversable (Join p)
Instance details Defined in Data.Bifunctor.Join Methods traverse :: Applicative f => (a -> f b) -> Join p a -> f (Join p b) # sequenceA :: Applicative f => Join p (f a) -> f (Join p a) # mapM :: Monad m => (a -> m b) -> Join p a -> m (Join p b) # sequence :: Monad m => Join p (m a) -> m (Join p a) #
Bitraversable p => Traversable (Fix p)
Instance details Defined in Data.Bifunctor.Fix Methods traverse :: Applicative f => (a -> f b) -> Fix p a -> f (Fix p b) # sequenceA :: Applicative f => Fix p (f a) -> f (Fix p a) # mapM :: Monad m => (a -> m b) -> Fix p a -> m (Fix p b) # sequence :: Monad m => Fix p (m a) -> m (Fix p a) #
Traversable w => Traversable (EnvT e w)
Instance details Defined in Control.Comonad.Trans.Env Methods traverse :: Applicative f => (a -> f b) -> EnvT e w a -> f (EnvT e w b) # sequenceA :: Applicative f => EnvT e w (f a) -> f (EnvT e w a) # mapM :: Monad m => (a -> m b) -> EnvT e w a -> m (EnvT e w b) # sequence :: Monad m => EnvT e w (m a) -> m (EnvT e w a) #
Traversable f => Traversable (IdentityT f)
Instance details Defined in Control.Monad.Trans.Identity Methods traverse :: Applicative f0 => (a -> f0 b) -> IdentityT f a -> f0 (IdentityT f b) # sequenceA :: Applicative f0 => IdentityT f (f0 a) -> f0 (IdentityT f a) # mapM :: Monad m => (a -> m b) -> IdentityT f a -> m (IdentityT f b) # sequence :: Monad m => IdentityT f (m a) -> m (IdentityT f a) #
Traversable f => Traversable (WriterT w f)
Instance details Defined in Control.Monad.Trans.Writer.Strict Methods traverse :: Applicative f0 => (a -> f0 b) -> WriterT w f a -> f0 (WriterT w f b) # sequenceA :: Applicative f0 => WriterT w f (f0 a) -> f0 (WriterT w f a) # mapM :: Monad m => (a -> m b) -> WriterT w f a -> m (WriterT w f b) # sequence :: Monad m => WriterT w f (m a) -> m (WriterT w f a) #
Traversable f => Traversable (WriterT w f)
Instance details Defined in Control.Monad.Trans.Writer.Lazy Methods traverse :: Applicative f0 => (a -> f0 b) -> WriterT w f a -> f0 (WriterT w f b) # sequenceA :: Applicative f0 => WriterT w f (f0 a) -> f0 (WriterT w f a) # mapM :: Monad m => (a -> m b) -> WriterT w f a -> m (WriterT w f b) # sequence :: Monad m => WriterT w f (m a) -> m (WriterT w f a) #
Traversable f => Traversable (FreeF f a)
Instance details Defined in Control.Monad.Trans.Free Methods traverse :: Applicative f0 => (a0 -> f0 b) -> FreeF f a a0 -> f0 (FreeF f a b) # sequenceA :: Applicative f0 => FreeF f a (f0 a0) -> f0 (FreeF f a a0) # mapM :: Monad m => (a0 -> m b) -> FreeF f a a0 -> m (FreeF f a b) # sequence :: Monad m => FreeF f a (m a0) -> m (FreeF f a a0) #
(Monad m, Traversable m, Traversable f) => Traversable (FreeT f m)
Instance details Defined in Control.Monad.Trans.Free Methods traverse :: Applicative f0 => (a -> f0 b) -> FreeT f m a -> f0 (FreeT f m b) # sequenceA :: Applicative f0 => FreeT f m (f0 a) -> f0 (FreeT f m a) # mapM :: Monad m0 => (a -> m0 b) -> FreeT f m a -> m0 (FreeT f m b) # sequence :: Monad m0 => FreeT f m (m0 a) -> m0 (FreeT f m a) #
Traversable f => Traversable (CofreeF f a)
Instance details Defined in Control.Comonad.Trans.Cofree Methods traverse :: Applicative f0 => (a0 -> f0 b) -> CofreeF f a a0 -> f0 (CofreeF f a b) # sequenceA :: Applicative f0 => CofreeF f a (f0 a0) -> f0 (CofreeF f a a0) # mapM :: Monad m => (a0 -> m b) -> CofreeF f a a0 -> m (CofreeF f a b) # sequence :: Monad m => CofreeF f a (m a0) -> m (CofreeF f a a0) #
(Traversable f, Traversable w) => Traversable (CofreeT f w)
Instance details Defined in Control.Comonad.Trans.Cofree Methods traverse :: Applicative f0 => (a -> f0 b) -> CofreeT f w a -> f0 (CofreeT f w b) # sequenceA :: Applicative f0 => CofreeT f w (f0 a) -> f0 (CofreeT f w a) # mapM :: Monad m => (a -> m b) -> CofreeT f w a -> m (CofreeT f w b) # sequence :: Monad m => CofreeT f w (m a) -> m (CofreeT f w a) #
Traversable f => Traversable (ErrorT e f)
Instance details Defined in Control.Monad.Trans.Error Methods traverse :: Applicative f0 => (a -> f0 b) -> ErrorT e f a -> f0 (ErrorT e f b) # sequenceA :: Applicative f0 => ErrorT e f (f0 a) -> f0 (ErrorT e f a) # mapM :: Monad m => (a -> m b) -> ErrorT e f a -> m (ErrorT e f b) # sequence :: Monad m => ErrorT e f (m a) -> m (ErrorT e f a) #
Traversable (Tagged s)
Instance details Defined in Data.Tagged Methods traverse :: Applicative f => (a -> f b) -> Tagged s a -> f (Tagged s b) # sequenceA :: Applicative f => Tagged s (f a) -> f (Tagged s a) # mapM :: Monad m => (a -> m b) -> Tagged s a -> m (Tagged s b) # sequence :: Monad m => Tagged s (m a) -> m (Tagged s a) #
Traversable (K1 i c :: Type -> Type)	Since: base-4.9.0.0
Instance details Defined in Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> K1 i c a -> f (K1 i c b) # sequenceA :: Applicative f => K1 i c (f a) -> f (K1 i c a) # mapM :: Monad m => (a -> m b) -> K1 i c a -> m (K1 i c b) # sequence :: Monad m => K1 i c (m a) -> m (K1 i c a) #
(Traversable f, Traversable g) => Traversable (f :+: g)	Since: base-4.9.0.0
Instance details Defined in Data.Traversable Methods traverse :: Applicative f0 => (a -> f0 b) -> (f :+: g) a -> f0 ((f :+: g) b) # sequenceA :: Applicative f0 => (f :+: g) (f0 a) -> f0 ((f :+: g) a) # mapM :: Monad m => (a -> m b) -> (f :+: g) a -> m ((f :+: g) b) # sequence :: Monad m => (f :+: g) (m a) -> m ((f :+: g) a) #
(Traversable f, Traversable g) => Traversable (f :*: g)	Since: base-4.9.0.0
Instance details Defined in Data.Traversable Methods traverse :: Applicative f0 => (a -> f0 b) -> (f :: g) a -> f0 ((f :: g) b) # sequenceA :: Applicative f0 => (f :: g) (f0 a) -> f0 ((f :: g) a) # mapM :: Monad m => (a -> m b) -> (f :: g) a -> m ((f :: g) b) # sequence :: Monad m => (f :: g) (m a) -> m ((f :: g) a) #
(Traversable f, Traversable g) => Traversable (Product f g)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Product Methods traverse :: Applicative f0 => (a -> f0 b) -> Product f g a -> f0 (Product f g b) # sequenceA :: Applicative f0 => Product f g (f0 a) -> f0 (Product f g a) # mapM :: Monad m => (a -> m b) -> Product f g a -> m (Product f g b) # sequence :: Monad m => Product f g (m a) -> m (Product f g a) #
(Traversable f, Traversable g) => Traversable (Sum f g)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Sum Methods traverse :: Applicative f0 => (a -> f0 b) -> Sum f g a -> f0 (Sum f g b) # sequenceA :: Applicative f0 => Sum f g (f0 a) -> f0 (Sum f g a) # mapM :: Monad m => (a -> m b) -> Sum f g a -> m (Sum f g b) # sequence :: Monad m => Sum f g (m a) -> m (Sum f g a) #
Traversable f => Traversable (M1 i c f)	Since: base-4.9.0.0
Instance details Defined in Data.Traversable Methods traverse :: Applicative f0 => (a -> f0 b) -> M1 i c f a -> f0 (M1 i c f b) # sequenceA :: Applicative f0 => M1 i c f (f0 a) -> f0 (M1 i c f a) # mapM :: Monad m => (a -> m b) -> M1 i c f a -> m (M1 i c f b) # sequence :: Monad m => M1 i c f (m a) -> m (M1 i c f a) #
(Traversable f, Traversable g) => Traversable (f :.: g)	Since: base-4.9.0.0
Instance details Defined in Data.Traversable Methods traverse :: Applicative f0 => (a -> f0 b) -> (f :.: g) a -> f0 ((f :.: g) b) # sequenceA :: Applicative f0 => (f :.: g) (f0 a) -> f0 ((f :.: g) a) # mapM :: Monad m => (a -> m b) -> (f :.: g) a -> m ((f :.: g) b) # sequence :: Monad m => (f :.: g) (m a) -> m ((f :.: g) a) #
(Traversable f, Traversable g) => Traversable (Compose f g)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Compose Methods traverse :: Applicative f0 => (a -> f0 b) -> Compose f g a -> f0 (Compose f g b) # sequenceA :: Applicative f0 => Compose f g (f0 a) -> f0 (Compose f g a) # mapM :: Monad m => (a -> m b) -> Compose f g a -> m (Compose f g b) # sequence :: Monad m => Compose f g (m a) -> m (Compose f g a) #
Bitraversable p => Traversable (WrappedBifunctor p a)
Instance details Defined in Data.Bifunctor.Wrapped Methods traverse :: Applicative f => (a0 -> f b) -> WrappedBifunctor p a a0 -> f (WrappedBifunctor p a b) # sequenceA :: Applicative f => WrappedBifunctor p a (f a0) -> f (WrappedBifunctor p a a0) # mapM :: Monad m => (a0 -> m b) -> WrappedBifunctor p a a0 -> m (WrappedBifunctor p a b) # sequence :: Monad m => WrappedBifunctor p a (m a0) -> m (WrappedBifunctor p a a0) #
Traversable g => Traversable (Joker g a)
Instance details Defined in Data.Bifunctor.Joker Methods traverse :: Applicative f => (a0 -> f b) -> Joker g a a0 -> f (Joker g a b) # sequenceA :: Applicative f => Joker g a (f a0) -> f (Joker g a a0) # mapM :: Monad m => (a0 -> m b) -> Joker g a a0 -> m (Joker g a b) # sequence :: Monad m => Joker g a (m a0) -> m (Joker g a a0) #
Bitraversable p => Traversable (Flip p a)
Instance details Defined in Data.Bifunctor.Flip Methods traverse :: Applicative f => (a0 -> f b) -> Flip p a a0 -> f (Flip p a b) # sequenceA :: Applicative f => Flip p a (f a0) -> f (Flip p a a0) # mapM :: Monad m => (a0 -> m b) -> Flip p a a0 -> m (Flip p a b) # sequence :: Monad m => Flip p a (m a0) -> m (Flip p a a0) #
Traversable (Clown f a :: Type -> Type)
Instance details Defined in Data.Bifunctor.Clown Methods traverse :: Applicative f0 => (a0 -> f0 b) -> Clown f a a0 -> f0 (Clown f a b) # sequenceA :: Applicative f0 => Clown f a (f0 a0) -> f0 (Clown f a a0) # mapM :: Monad m => (a0 -> m b) -> Clown f a a0 -> m (Clown f a b) # sequence :: Monad m => Clown f a (m a0) -> m (Clown f a a0) #
(Traversable f, Bitraversable p) => Traversable (Tannen f p a)
Instance details Defined in Data.Bifunctor.Tannen Methods traverse :: Applicative f0 => (a0 -> f0 b) -> Tannen f p a a0 -> f0 (Tannen f p a b) # sequenceA :: Applicative f0 => Tannen f p a (f0 a0) -> f0 (Tannen f p a a0) # mapM :: Monad m => (a0 -> m b) -> Tannen f p a a0 -> m (Tannen f p a b) # sequence :: Monad m => Tannen f p a (m a0) -> m (Tannen f p a a0) #
(Bitraversable p, Traversable g) => Traversable (Biff p f g a)
Instance details Defined in Data.Bifunctor.Biff Methods traverse :: Applicative f0 => (a0 -> f0 b) -> Biff p f g a a0 -> f0 (Biff p f g a b) # sequenceA :: Applicative f0 => Biff p f g a (f0 a0) -> f0 (Biff p f g a a0) # mapM :: Monad m => (a0 -> m b) -> Biff p f g a a0 -> m (Biff p f g a b) # sequence :: Monad m => Biff p f g a (m a0) -> m (Biff p f g a a0) #

class Generic a #

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 ≡ id
to . from ≡ id

Minimal complete definition

from, to

Instances

Generic Bool
Instance details Defined in GHC.Generics Associated Types type Rep Bool :: Type -> Type # Methods from :: Bool -> Rep Bool x # to :: Rep Bool x -> Bool #
Generic Ordering
Instance details Defined in GHC.Generics Associated Types type Rep Ordering :: Type -> Type # Methods from :: Ordering -> Rep Ordering x # to :: Rep Ordering x -> Ordering #
Generic Exp
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep Exp :: Type -> Type # Methods from :: Exp -> Rep Exp x # to :: Rep Exp x -> Exp #
Generic Match
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep Match :: Type -> Type # Methods from :: Match -> Rep Match x # to :: Rep Match x -> Match #
Generic Clause
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep Clause :: Type -> Type # Methods from :: Clause -> Rep Clause x # to :: Rep Clause x -> Clause #
Generic Pat
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep Pat :: Type -> Type # Methods from :: Pat -> Rep Pat x # to :: Rep Pat x -> Pat #
Generic Type
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep Type :: Type -> Type # Methods from :: Type -> Rep Type x # to :: Rep Type x -> Type #
Generic Dec
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep Dec :: Type -> Type # Methods from :: Dec -> Rep Dec x # to :: Rep Dec x -> Dec #
Generic Name
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep Name :: Type -> Type # Methods from :: Name -> Rep Name x # to :: Rep Name x -> Name #
Generic FunDep
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep FunDep :: Type -> Type # Methods from :: FunDep -> Rep FunDep x # to :: Rep FunDep x -> FunDep #
Generic InjectivityAnn
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep InjectivityAnn :: Type -> Type # Methods from :: InjectivityAnn -> Rep InjectivityAnn x # to :: Rep InjectivityAnn x -> InjectivityAnn #
Generic Overlap
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep Overlap :: Type -> Type # Methods from :: Overlap -> Rep Overlap x # to :: Rep Overlap x -> Overlap #
Generic ()
Instance details Defined in GHC.Generics Associated Types type Rep () :: Type -> Type # Methods from :: () -> Rep () x # to :: Rep () x -> () #
Generic Doc
Instance details Defined in Text.PrettyPrint.HughesPJ Associated Types type Rep Doc :: Type -> Type # Methods from :: Doc -> Rep Doc x # to :: Rep Doc x -> Doc #
Generic Version
Instance details Defined in Data.Version Associated Types type Rep Version :: Type -> Type # Methods from :: Version -> Rep Version x # to :: Rep Version x -> Version #
Generic Any
Instance details Defined in Data.Semigroup.Internal Associated Types type Rep Any :: Type -> Type # Methods from :: Any -> Rep Any x # to :: Rep Any x -> Any #
Generic All
Instance details Defined in Data.Semigroup.Internal Associated Types type Rep All :: Type -> Type # Methods from :: All -> Rep All x # to :: Rep All x -> All #
Generic Con
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep Con :: Type -> Type # Methods from :: Con -> Rep Con x # to :: Rep Con x -> Con #
Generic Void
Instance details Defined in Data.Void Associated Types type Rep Void :: Type -> Type # Methods from :: Void -> Rep Void x # to :: Rep Void x -> Void #
Generic ExitCode
Instance details Defined in GHC.IO.Exception Associated Types type Rep ExitCode :: Type -> Type # Methods from :: ExitCode -> Rep ExitCode x # to :: Rep ExitCode x -> ExitCode #
Generic Fixity
Instance details Defined in GHC.Generics Associated Types type Rep Fixity :: Type -> Type # Methods from :: Fixity -> Rep Fixity x # to :: Rep Fixity x -> Fixity #
Generic Associativity
Instance details Defined in GHC.Generics Associated Types type Rep Associativity :: Type -> Type # Methods from :: Associativity -> Rep Associativity x # to :: Rep Associativity x -> Associativity #
Generic SourceUnpackedness
Instance details Defined in GHC.Generics Associated Types type Rep SourceUnpackedness :: Type -> Type # Methods from :: SourceUnpackedness -> Rep SourceUnpackedness x # to :: Rep SourceUnpackedness x -> SourceUnpackedness #
Generic SourceStrictness
Instance details Defined in GHC.Generics Associated Types type Rep SourceStrictness :: Type -> Type # Methods from :: SourceStrictness -> Rep SourceStrictness x # to :: Rep SourceStrictness x -> SourceStrictness #
Generic DecidedStrictness
Instance details Defined in GHC.Generics Associated Types type Rep DecidedStrictness :: Type -> Type # Methods from :: DecidedStrictness -> Rep DecidedStrictness x # to :: Rep DecidedStrictness x -> DecidedStrictness #
Generic ConcException
Instance details Defined in UnliftIO.Internals.Async Associated Types type Rep ConcException :: Type -> Type # Methods from :: ConcException -> Rep ConcException x # to :: Rep ConcException x -> ConcException #
Generic Focus
Instance details Defined in Data.FocusList Associated Types type Rep Focus :: Type -> Type # Methods from :: Focus -> Rep Focus x # to :: Rep Focus x -> Focus #
Generic Extension
Instance details Defined in GHC.LanguageExtensions.Type Associated Types type Rep Extension :: Type -> Type # Methods from :: Extension -> Rep Extension x # to :: Rep Extension x -> Extension #
Generic ForeignSrcLang
Instance details Defined in GHC.ForeignSrcLang.Type Associated Types type Rep ForeignSrcLang :: Type -> Type # Methods from :: ForeignSrcLang -> Rep ForeignSrcLang x # to :: Rep ForeignSrcLang x -> ForeignSrcLang #
Generic Name
Instance details Defined in Data.XML.Types Associated Types type Rep Name :: Type -> Type # Methods from :: Name -> Rep Name x # to :: Rep Name x -> Name #
Generic TyVarBndr
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep TyVarBndr :: Type -> Type # Methods from :: TyVarBndr -> Rep TyVarBndr x # to :: Rep TyVarBndr x -> TyVarBndr #
Generic TextDetails
Instance details Defined in Text.PrettyPrint.Annotated.HughesPJ Associated Types type Rep TextDetails :: Type -> Type # Methods from :: TextDetails -> Rep TextDetails x # to :: Rep TextDetails x -> TextDetails #
Generic Style
Instance details Defined in Text.PrettyPrint.Annotated.HughesPJ Associated Types type Rep Style :: Type -> Type # Methods from :: Style -> Rep Style x # to :: Rep Style x -> Style #
Generic Mode
Instance details Defined in Text.PrettyPrint.Annotated.HughesPJ Associated Types type Rep Mode :: Type -> Type # Methods from :: Mode -> Rep Mode x # to :: Rep Mode x -> Mode #
Generic OutputOptions
Instance details Defined in Text.Pretty.Simple.Internal.OutputPrinter Associated Types type Rep OutputOptions :: Type -> Type # Methods from :: OutputOptions -> Rep OutputOptions x # to :: Rep OutputOptions x -> OutputOptions #
Generic LineNum
Instance details Defined in Text.Pretty.Simple.Internal.ExprToOutput Associated Types type Rep LineNum :: Type -> Type # Methods from :: LineNum -> Rep LineNum x # to :: Rep LineNum x -> LineNum #
Generic PrinterState
Instance details Defined in Text.Pretty.Simple.Internal.ExprToOutput Associated Types type Rep PrinterState :: Type -> Type # Methods from :: PrinterState -> Rep PrinterState x # to :: Rep PrinterState x -> PrinterState #
Generic NestLevel
Instance details Defined in Text.Pretty.Simple.Internal.Output Associated Types type Rep NestLevel :: Type -> Type # Methods from :: NestLevel -> Rep NestLevel x # to :: Rep NestLevel x -> NestLevel #
Generic OutputType
Instance details Defined in Text.Pretty.Simple.Internal.Output Associated Types type Rep OutputType :: Type -> Type # Methods from :: OutputType -> Rep OutputType x # to :: Rep OutputType x -> OutputType #
Generic Output
Instance details Defined in Text.Pretty.Simple.Internal.Output Associated Types type Rep Output :: Type -> Type # Methods from :: Output -> Rep Output x # to :: Rep Output x -> Output #
Generic Expr
Instance details Defined in Text.Pretty.Simple.Internal.Expr Associated Types type Rep Expr :: Type -> Type # Methods from :: Expr -> Rep Expr x # to :: Rep Expr x -> Expr #
Generic ColorOptions
Instance details Defined in Text.Pretty.Simple.Internal.Color Associated Types type Rep ColorOptions :: Type -> Type # Methods from :: ColorOptions -> Rep ColorOptions x # to :: Rep ColorOptions x -> ColorOptions #
Generic DType
Instance details Defined in Language.Haskell.TH.Desugar.AST Associated Types type Rep DType :: Type -> Type # Methods from :: DType -> Rep DType x # to :: Rep DType x -> DType #
Generic DPred
Instance details Defined in Language.Haskell.TH.Desugar.AST Associated Types type Rep DPred :: Type -> Type # Methods from :: DPred -> Rep DPred x # to :: Rep DPred x -> DPred #
Generic ModName
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep ModName :: Type -> Type # Methods from :: ModName -> Rep ModName x # to :: Rep ModName x -> ModName #
Generic PkgName
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep PkgName :: Type -> Type # Methods from :: PkgName -> Rep PkgName x # to :: Rep PkgName x -> PkgName #
Generic Module
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep Module :: Type -> Type # Methods from :: Module -> Rep Module x # to :: Rep Module x -> Module #
Generic OccName
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep OccName :: Type -> Type # Methods from :: OccName -> Rep OccName x # to :: Rep OccName x -> OccName #
Generic NameFlavour
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep NameFlavour :: Type -> Type # Methods from :: NameFlavour -> Rep NameFlavour x # to :: Rep NameFlavour x -> NameFlavour #
Generic NameSpace
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep NameSpace :: Type -> Type # Methods from :: NameSpace -> Rep NameSpace x # to :: Rep NameSpace x -> NameSpace #
Generic Loc
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep Loc :: Type -> Type # Methods from :: Loc -> Rep Loc x # to :: Rep Loc x -> Loc #
Generic Info
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep Info :: Type -> Type # Methods from :: Info -> Rep Info x # to :: Rep Info x -> Info #
Generic ModuleInfo
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep ModuleInfo :: Type -> Type # Methods from :: ModuleInfo -> Rep ModuleInfo x # to :: Rep ModuleInfo x -> ModuleInfo #
Generic Fixity
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep Fixity :: Type -> Type # Methods from :: Fixity -> Rep Fixity x # to :: Rep Fixity x -> Fixity #
Generic FixityDirection
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep FixityDirection :: Type -> Type # Methods from :: FixityDirection -> Rep FixityDirection x # to :: Rep FixityDirection x -> FixityDirection #
Generic Lit
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep Lit :: Type -> Type # Methods from :: Lit -> Rep Lit x # to :: Rep Lit x -> Lit #
Generic Body
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep Body :: Type -> Type # Methods from :: Body -> Rep Body x # to :: Rep Body x -> Body #
Generic Guard
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep Guard :: Type -> Type # Methods from :: Guard -> Rep Guard x # to :: Rep Guard x -> Guard #
Generic Stmt
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep Stmt :: Type -> Type # Methods from :: Stmt -> Rep Stmt x # to :: Rep Stmt x -> Stmt #
Generic Range
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep Range :: Type -> Type # Methods from :: Range -> Rep Range x # to :: Rep Range x -> Range #
Generic DerivClause
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep DerivClause :: Type -> Type # Methods from :: DerivClause -> Rep DerivClause x # to :: Rep DerivClause x -> DerivClause #
Generic DerivStrategy
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep DerivStrategy :: Type -> Type # Methods from :: DerivStrategy -> Rep DerivStrategy x # to :: Rep DerivStrategy x -> DerivStrategy #
Generic TypeFamilyHead
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep TypeFamilyHead :: Type -> Type # Methods from :: TypeFamilyHead -> Rep TypeFamilyHead x # to :: Rep TypeFamilyHead x -> TypeFamilyHead #
Generic TySynEqn
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep TySynEqn :: Type -> Type # Methods from :: TySynEqn -> Rep TySynEqn x # to :: Rep TySynEqn x -> TySynEqn #
Generic Foreign
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep Foreign :: Type -> Type # Methods from :: Foreign -> Rep Foreign x # to :: Rep Foreign x -> Foreign #
Generic Callconv
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep Callconv :: Type -> Type # Methods from :: Callconv -> Rep Callconv x # to :: Rep Callconv x -> Callconv #
Generic Safety
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep Safety :: Type -> Type # Methods from :: Safety -> Rep Safety x # to :: Rep Safety x -> Safety #
Generic Pragma
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep Pragma :: Type -> Type # Methods from :: Pragma -> Rep Pragma x # to :: Rep Pragma x -> Pragma #
Generic Inline
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep Inline :: Type -> Type # Methods from :: Inline -> Rep Inline x # to :: Rep Inline x -> Inline #
Generic RuleMatch
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep RuleMatch :: Type -> Type # Methods from :: RuleMatch -> Rep RuleMatch x # to :: Rep RuleMatch x -> RuleMatch #
Generic Phases
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep Phases :: Type -> Type # Methods from :: Phases -> Rep Phases x # to :: Rep Phases x -> Phases #
Generic RuleBndr
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep RuleBndr :: Type -> Type # Methods from :: RuleBndr -> Rep RuleBndr x # to :: Rep RuleBndr x -> RuleBndr #
Generic AnnTarget
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep AnnTarget :: Type -> Type # Methods from :: AnnTarget -> Rep AnnTarget x # to :: Rep AnnTarget x -> AnnTarget #
Generic SourceUnpackedness
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep SourceUnpackedness :: Type -> Type # Methods from :: SourceUnpackedness -> Rep SourceUnpackedness x # to :: Rep SourceUnpackedness x -> SourceUnpackedness #
Generic SourceStrictness
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep SourceStrictness :: Type -> Type # Methods from :: SourceStrictness -> Rep SourceStrictness x # to :: Rep SourceStrictness x -> SourceStrictness #
Generic DecidedStrictness
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep DecidedStrictness :: Type -> Type # Methods from :: DecidedStrictness -> Rep DecidedStrictness x # to :: Rep DecidedStrictness x -> DecidedStrictness #
Generic Bang
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep Bang :: Type -> Type # Methods from :: Bang -> Rep Bang x # to :: Rep Bang x -> Bang #
Generic PatSynDir
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep PatSynDir :: Type -> Type # Methods from :: PatSynDir -> Rep PatSynDir x # to :: Rep PatSynDir x -> PatSynDir #
Generic PatSynArgs
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep PatSynArgs :: Type -> Type # Methods from :: PatSynArgs -> Rep PatSynArgs x # to :: Rep PatSynArgs x -> PatSynArgs #
Generic FamilyResultSig
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep FamilyResultSig :: Type -> Type # Methods from :: FamilyResultSig -> Rep FamilyResultSig x # to :: Rep FamilyResultSig x -> FamilyResultSig #
Generic TyLit
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep TyLit :: Type -> Type # Methods from :: TyLit -> Rep TyLit x # to :: Rep TyLit x -> TyLit #
Generic Role
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep Role :: Type -> Type # Methods from :: Role -> Rep Role x # to :: Rep Role x -> Role #
Generic AnnLookup
Instance details Defined in Language.Haskell.TH.Syntax Associated Types type Rep AnnLookup :: Type -> Type # Methods from :: AnnLookup -> Rep AnnLookup x # to :: Rep AnnLookup x -> AnnLookup #
Generic DatatypeInfo
Instance details Defined in Language.Haskell.TH.Datatype Associated Types type Rep DatatypeInfo :: Type -> Type # Methods from :: DatatypeInfo -> Rep DatatypeInfo x # to :: Rep DatatypeInfo x -> DatatypeInfo #
Generic DatatypeVariant
Instance details Defined in Language.Haskell.TH.Datatype Associated Types type Rep DatatypeVariant :: Type -> Type # Methods from :: DatatypeVariant -> Rep DatatypeVariant x # to :: Rep DatatypeVariant x -> DatatypeVariant #
Generic ConstructorInfo
Instance details Defined in Language.Haskell.TH.Datatype Associated Types type Rep ConstructorInfo :: Type -> Type # Methods from :: ConstructorInfo -> Rep ConstructorInfo x # to :: Rep ConstructorInfo x -> ConstructorInfo #
Generic ConstructorVariant
Instance details Defined in Language.Haskell.TH.Datatype Associated Types type Rep ConstructorVariant :: Type -> Type # Methods from :: ConstructorVariant -> Rep ConstructorVariant x # to :: Rep ConstructorVariant x -> ConstructorVariant #
Generic FieldStrictness
Instance details Defined in Language.Haskell.TH.Datatype Associated Types type Rep FieldStrictness :: Type -> Type # Methods from :: FieldStrictness -> Rep FieldStrictness x # to :: Rep FieldStrictness x -> FieldStrictness #
Generic Unpackedness
Instance details Defined in Language.Haskell.TH.Datatype Associated Types type Rep Unpackedness :: Type -> Type # Methods from :: Unpackedness -> Rep Unpackedness x # to :: Rep Unpackedness x -> Unpackedness #
Generic Strictness
Instance details Defined in Language.Haskell.TH.Datatype Associated Types type Rep Strictness :: Type -> Type # Methods from :: Strictness -> Rep Strictness x # to :: Rep Strictness x -> Strictness #
Generic DExp
Instance details Defined in Language.Haskell.TH.Desugar.AST Associated Types type Rep DExp :: Type -> Type # Methods from :: DExp -> Rep DExp x # to :: Rep DExp x -> DExp #
Generic DPat
Instance details Defined in Language.Haskell.TH.Desugar.AST Associated Types type Rep DPat :: Type -> Type # Methods from :: DPat -> Rep DPat x # to :: Rep DPat x -> DPat #
Generic DTyVarBndr
Instance details Defined in Language.Haskell.TH.Desugar.AST Associated Types type Rep DTyVarBndr :: Type -> Type # Methods from :: DTyVarBndr -> Rep DTyVarBndr x # to :: Rep DTyVarBndr x -> DTyVarBndr #
Generic DMatch
Instance details Defined in Language.Haskell.TH.Desugar.AST Associated Types type Rep DMatch :: Type -> Type # Methods from :: DMatch -> Rep DMatch x # to :: Rep DMatch x -> DMatch #
Generic DClause
Instance details Defined in Language.Haskell.TH.Desugar.AST Associated Types type Rep DClause :: Type -> Type # Methods from :: DClause -> Rep DClause x # to :: Rep DClause x -> DClause #
Generic DLetDec
Instance details Defined in Language.Haskell.TH.Desugar.AST Associated Types type Rep DLetDec :: Type -> Type # Methods from :: DLetDec -> Rep DLetDec x # to :: Rep DLetDec x -> DLetDec #
Generic NewOrData
Instance details Defined in Language.Haskell.TH.Desugar.AST Associated Types type Rep NewOrData :: Type -> Type # Methods from :: NewOrData -> Rep NewOrData x # to :: Rep NewOrData x -> NewOrData #
Generic DDec
Instance details Defined in Language.Haskell.TH.Desugar.AST Associated Types type Rep DDec :: Type -> Type # Methods from :: DDec -> Rep DDec x # to :: Rep DDec x -> DDec #
Generic DPatSynDir
Instance details Defined in Language.Haskell.TH.Desugar.AST Associated Types type Rep DPatSynDir :: Type -> Type # Methods from :: DPatSynDir -> Rep DPatSynDir x # to :: Rep DPatSynDir x -> DPatSynDir #
Generic DTypeFamilyHead
Instance details Defined in Language.Haskell.TH.Desugar.AST Associated Types type Rep DTypeFamilyHead :: Type -> Type # Methods from :: DTypeFamilyHead -> Rep DTypeFamilyHead x # to :: Rep DTypeFamilyHead x -> DTypeFamilyHead #
Generic DFamilyResultSig
Instance details Defined in Language.Haskell.TH.Desugar.AST Associated Types type Rep DFamilyResultSig :: Type -> Type # Methods from :: DFamilyResultSig -> Rep DFamilyResultSig x # to :: Rep DFamilyResultSig x -> DFamilyResultSig #
Generic DCon
Instance details Defined in Language.Haskell.TH.Desugar.AST Associated Types type Rep DCon :: Type -> Type # Methods from :: DCon -> Rep DCon x # to :: Rep DCon x -> DCon #
Generic DConFields
Instance details Defined in Language.Haskell.TH.Desugar.AST Associated Types type Rep DConFields :: Type -> Type # Methods from :: DConFields -> Rep DConFields x # to :: Rep DConFields x -> DConFields #
Generic DForeign
Instance details Defined in Language.Haskell.TH.Desugar.AST Associated Types type Rep DForeign :: Type -> Type # Methods from :: DForeign -> Rep DForeign x # to :: Rep DForeign x -> DForeign #
Generic DPragma
Instance details Defined in Language.Haskell.TH.Desugar.AST Associated Types type Rep DPragma :: Type -> Type # Methods from :: DPragma -> Rep DPragma x # to :: Rep DPragma x -> DPragma #
Generic DRuleBndr
Instance details Defined in Language.Haskell.TH.Desugar.AST Associated Types type Rep DRuleBndr :: Type -> Type # Methods from :: DRuleBndr -> Rep DRuleBndr x # to :: Rep DRuleBndr x -> DRuleBndr #
Generic DTySynEqn
Instance details Defined in Language.Haskell.TH.Desugar.AST Associated Types type Rep DTySynEqn :: Type -> Type # Methods from :: DTySynEqn -> Rep DTySynEqn x # to :: Rep DTySynEqn x -> DTySynEqn #
Generic DInfo
Instance details Defined in Language.Haskell.TH.Desugar.AST Associated Types type Rep DInfo :: Type -> Type # Methods from :: DInfo -> Rep DInfo x # to :: Rep DInfo x -> DInfo #
Generic DDerivClause
Instance details Defined in Language.Haskell.TH.Desugar.AST Associated Types type Rep DDerivClause :: Type -> Type # Methods from :: DDerivClause -> Rep DDerivClause x # to :: Rep DDerivClause x -> DDerivClause #
Generic DDerivStrategy
Instance details Defined in Language.Haskell.TH.Desugar.AST Associated Types type Rep DDerivStrategy :: Type -> Type # Methods from :: DDerivStrategy -> Rep DDerivStrategy x # to :: Rep DDerivStrategy x -> DDerivStrategy #
Generic Event
Instance details Defined in Data.XML.Types Associated Types type Rep Event :: Type -> Type # Methods from :: Event -> Rep Event x # to :: Rep Event x -> Event #
Generic ExternalID
Instance details Defined in Data.XML.Types Associated Types type Rep ExternalID :: Type -> Type # Methods from :: ExternalID -> Rep ExternalID x # to :: Rep ExternalID x -> ExternalID #
Generic Doctype
Instance details Defined in Data.XML.Types Associated Types type Rep Doctype :: Type -> Type # Methods from :: Doctype -> Rep Doctype x # to :: Rep Doctype x -> Doctype #
Generic Miscellaneous
Instance details Defined in Data.XML.Types Associated Types type Rep Miscellaneous :: Type -> Type # Methods from :: Miscellaneous -> Rep Miscellaneous x # to :: Rep Miscellaneous x -> Miscellaneous #
Generic Instruction
Instance details Defined in Data.XML.Types Associated Types type Rep Instruction :: Type -> Type # Methods from :: Instruction -> Rep Instruction x # to :: Rep Instruction x -> Instruction #
Generic Prologue
Instance details Defined in Data.XML.Types Associated Types type Rep Prologue :: Type -> Type # Methods from :: Prologue -> Rep Prologue x # to :: Rep Prologue x -> Prologue #
Generic Document
Instance details Defined in Data.XML.Types Associated Types type Rep Document :: Type -> Type # Methods from :: Document -> Rep Document x # to :: Rep Document x -> Document #
Generic Node
Instance details Defined in Data.XML.Types Associated Types type Rep Node :: Type -> Type # Methods from :: Node -> Rep Node x # to :: Rep Node x -> Node #
Generic Element
Instance details Defined in Data.XML.Types Associated Types type Rep Element :: Type -> Type # Methods from :: Element -> Rep Element x # to :: Rep Element x -> Element #
Generic Content
Instance details Defined in Data.XML.Types Associated Types type Rep Content :: Type -> Type # Methods from :: Content -> Rep Content x # to :: Rep Content x -> Content #
Generic [a]
Instance details Defined in GHC.Generics Associated Types type Rep [a] :: Type -> Type # Methods from :: [a] -> Rep [a] x # to :: Rep [a] x -> [a] #
Generic (Maybe a)
Instance details Defined in GHC.Generics Associated Types type Rep (Maybe a) :: Type -> Type # Methods from :: Maybe a -> Rep (Maybe a) x # to :: Rep (Maybe a) x -> Maybe a #
Generic (Par1 p)
Instance details Defined in GHC.Generics Associated Types type Rep (Par1 p) :: Type -> Type # Methods from :: Par1 p -> Rep (Par1 p) x # to :: Rep (Par1 p) x -> Par1 p #
Generic (Last a)
Instance details Defined in Data.Semigroup Associated Types type Rep (Last a) :: Type -> Type # Methods from :: Last a -> Rep (Last a) x # to :: Rep (Last a) x -> Last a #
Generic (SCC vertex)
Instance details Defined in Data.Graph Associated Types type Rep (SCC vertex) :: Type -> Type # Methods from :: SCC vertex -> Rep (SCC vertex) x # to :: Rep (SCC vertex) x -> SCC vertex #
Generic (Complex a)
Instance details Defined in Data.Complex Associated Types type Rep (Complex a) :: Type -> Type # Methods from :: Complex a -> Rep (Complex a) x # to :: Rep (Complex a) x -> Complex a #
Generic (Min a)
Instance details Defined in Data.Semigroup Associated Types type Rep (Min a) :: Type -> Type # Methods from :: Min a -> Rep (Min a) x # to :: Rep (Min a) x -> Min a #
Generic (Max a)
Instance details Defined in Data.Semigroup Associated Types type Rep (Max a) :: Type -> Type # Methods from :: Max a -> Rep (Max a) x # to :: Rep (Max a) x -> Max a #
Generic (First a)
Instance details Defined in Data.Semigroup Associated Types type Rep (First a) :: Type -> Type # Methods from :: First a -> Rep (First a) x # to :: Rep (First a) x -> First a #
Generic (WrappedMonoid m)
Instance details 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 #
Generic (Option a)
Instance details Defined in Data.Semigroup Associated Types type Rep (Option a) :: Type -> Type # Methods from :: Option a -> Rep (Option a) x # to :: Rep (Option a) x -> Option a #
Generic (ZipList a)
Instance details Defined in Control.Applicative Associated Types type Rep (ZipList a) :: Type -> Type # Methods from :: ZipList a -> Rep (ZipList a) x # to :: Rep (ZipList a) x -> ZipList a #
Generic (Identity a)
Instance details Defined in Data.Functor.Identity Associated Types type Rep (Identity a) :: Type -> Type # Methods from :: Identity a -> Rep (Identity a) x # to :: Rep (Identity a) x -> Identity a #
Generic (First a)
Instance details Defined in Data.Monoid Associated Types type Rep (First a) :: Type -> Type # Methods from :: First a -> Rep (First a) x # to :: Rep (First a) x -> First a #
Generic (Last a)
Instance details Defined in Data.Monoid Associated Types type Rep (Last a) :: Type -> Type # Methods from :: Last a -> Rep (Last a) x # to :: Rep (Last a) x -> Last a #
Generic (Dual a)
Instance details Defined in Data.Semigroup.Internal Associated Types type Rep (Dual a) :: Type -> Type # Methods from :: Dual a -> Rep (Dual a) x # to :: Rep (Dual a) x -> Dual a #
Generic (Endo a)
Instance details Defined in Data.Semigroup.Internal Associated Types type Rep (Endo a) :: Type -> Type # Methods from :: Endo a -> Rep (Endo a) x # to :: Rep (Endo a) x -> Endo a #
Generic (Sum a)
Instance details Defined in Data.Semigroup.Internal Associated Types type Rep (Sum a) :: Type -> Type # Methods from :: Sum a -> Rep (Sum a) x # to :: Rep (Sum a) x -> Sum a #
Generic (Product a)
Instance details Defined in Data.Semigroup.Internal Associated Types type Rep (Product a) :: Type -> Type # Methods from :: Product a -> Rep (Product a) x # to :: Rep (Product a) x -> Product a #
Generic (Down a)
Instance details Defined in GHC.Generics Associated Types type Rep (Down a) :: Type -> Type # Methods from :: Down a -> Rep (Down a) x # to :: Rep (Down a) x -> Down a #
Generic (NonEmpty a)
Instance details Defined in GHC.Generics Associated Types type Rep (NonEmpty a) :: Type -> Type # Methods from :: NonEmpty a -> Rep (NonEmpty a) x # to :: Rep (NonEmpty a) x -> NonEmpty a #
Generic (Tree a)
Instance details Defined in Data.Tree Associated Types type Rep (Tree a) :: Type -> Type # Methods from :: Tree a -> Rep (Tree a) x # to :: Rep (Tree a) x -> Tree a #
Generic (FingerTree a)
Instance details Defined in Data.Sequence.Internal Associated Types type Rep (FingerTree a) :: Type -> Type # Methods from :: FingerTree a -> Rep (FingerTree a) x # to :: Rep (FingerTree a) x -> FingerTree a #
Generic (Digit a)
Instance details Defined in Data.Sequence.Internal Associated Types type Rep (Digit a) :: Type -> Type # Methods from :: Digit a -> Rep (Digit a) x # to :: Rep (Digit a) x -> Digit a #
Generic (Node a)
Instance details Defined in Data.Sequence.Internal Associated Types type Rep (Node a) :: Type -> Type # Methods from :: Node a -> Rep (Node a) x # to :: Rep (Node a) x -> Node a #
Generic (Elem a)
Instance details Defined in Data.Sequence.Internal Associated Types type Rep (Elem a) :: Type -> Type # Methods from :: Elem a -> Rep (Elem a) x # to :: Rep (Elem a) x -> Elem a #
Generic (ViewL a)
Instance details Defined in Data.Sequence.Internal Associated Types type Rep (ViewL a) :: Type -> Type # Methods from :: ViewL a -> Rep (ViewL a) x # to :: Rep (ViewL a) x -> ViewL a #
Generic (ViewR a)
Instance details Defined in Data.Sequence.Internal Associated Types type Rep (ViewR a) :: Type -> Type # Methods from :: ViewR a -> Rep (ViewR a) x # to :: Rep (ViewR a) x -> ViewR a #
Generic (FocusList a)
Instance details Defined in Data.FocusList Associated Types type Rep (FocusList a) :: Type -> Type # Methods from :: FocusList a -> Rep (FocusList a) x # to :: Rep (FocusList a) x -> FocusList a #
Generic (Doc a)
Instance details Defined in Text.PrettyPrint.Annotated.HughesPJ Associated Types type Rep (Doc a) :: Type -> Type # Methods from :: Doc a -> Rep (Doc a) x # to :: Rep (Doc a) x -> Doc a #
Generic (CommaSeparated a)
Instance details Defined in Text.Pretty.Simple.Internal.Expr Associated Types type Rep (CommaSeparated a) :: Type -> Type # Methods from :: CommaSeparated a -> Rep (CommaSeparated a) x # to :: Rep (CommaSeparated a) x -> CommaSeparated a #
Generic (Either a b)
Instance details Defined in GHC.Generics Associated Types type Rep (Either a b) :: Type -> Type # Methods from :: Either a b -> Rep (Either a b) x # to :: Rep (Either a b) x -> Either a b #
Generic (V1 p)
Instance details Defined in GHC.Generics Associated Types type Rep (V1 p) :: Type -> Type # Methods from :: V1 p -> Rep (V1 p) x # to :: Rep (V1 p) x -> V1 p #
Generic (U1 p)
Instance details Defined in GHC.Generics Associated Types type Rep (U1 p) :: Type -> Type # Methods from :: U1 p -> Rep (U1 p) x # to :: Rep (U1 p) x -> U1 p #
Generic (a, b)
Instance details Defined in GHC.Generics Associated Types type Rep (a, b) :: Type -> Type # Methods from :: (a, b) -> Rep (a, b) x # to :: Rep (a, b) x -> (a, b) #
Generic (Arg a b)
Instance details Defined in Data.Semigroup Associated Types type Rep (Arg a b) :: Type -> Type # Methods from :: Arg a b -> Rep (Arg a b) x # to :: Rep (Arg a b) x -> Arg a b #
Generic (WrappedMonad m a)
Instance details Defined in Control.Applicative Associated Types type Rep (WrappedMonad m a) :: Type -> Type # Methods from :: WrappedMonad m a -> Rep (WrappedMonad m a) x # to :: Rep (WrappedMonad m a) x -> WrappedMonad m a #
Generic (Proxy t)
Instance details Defined in GHC.Generics Associated Types type Rep (Proxy t) :: Type -> Type # Methods from :: Proxy t -> Rep (Proxy t) x # to :: Rep (Proxy t) x -> Proxy t #
Generic (Cofree f a)
Instance details Defined in Control.Comonad.Cofree Associated Types type Rep (Cofree f a) :: Type -> Type # Methods from :: Cofree f a -> Rep (Cofree f a) x # to :: Rep (Cofree f a) x -> Cofree f a #
Generic (Free f a)
Instance details Defined in Control.Monad.Free Associated Types type Rep (Free f a) :: Type -> Type # Methods from :: Free f a -> Rep (Free f a) x # to :: Rep (Free f a) x -> Free f a #
Generic (Rec1 f p)
Instance details Defined in GHC.Generics Associated Types type Rep (Rec1 f p) :: Type -> Type # Methods from :: Rec1 f p -> Rep (Rec1 f p) x # to :: Rep (Rec1 f p) x -> Rec1 f p #
Generic (URec (Ptr ()) p)
Instance details Defined in GHC.Generics Associated Types type Rep (URec (Ptr ()) p) :: Type -> Type # Methods from :: URec (Ptr ()) p -> Rep (URec (Ptr ()) p) x # to :: Rep (URec (Ptr ()) p) x -> URec (Ptr ()) p #
Generic (URec Char p)
Instance details Defined in GHC.Generics Associated Types type Rep (URec Char p) :: Type -> Type # Methods from :: URec Char p -> Rep (URec Char p) x # to :: Rep (URec Char p) x -> URec Char p #
Generic (URec Double p)
Instance details Defined in GHC.Generics Associated Types type Rep (URec Double p) :: Type -> Type # Methods from :: URec Double p -> Rep (URec Double p) x # to :: Rep (URec Double p) x -> URec Double p #
Generic (URec Float p)
Instance details Defined in GHC.Generics Associated Types type Rep (URec Float p) :: Type -> Type # Methods from :: URec Float p -> Rep (URec Float p) x # to :: Rep (URec Float p) x -> URec Float p #
Generic (URec Int p)
Instance details Defined in GHC.Generics Associated Types type Rep (URec Int p) :: Type -> Type # Methods from :: URec Int p -> Rep (URec Int p) x # to :: Rep (URec Int p) x -> URec Int p #
Generic (URec Word p)
Instance details Defined in GHC.Generics Associated Types type Rep (URec Word p) :: Type -> Type # Methods from :: URec Word p -> Rep (URec Word p) x # to :: Rep (URec Word p) x -> URec Word p #
Generic (a, b, c)
Instance details Defined in GHC.Generics Associated Types type Rep (a, b, c) :: Type -> Type # Methods from :: (a, b, c) -> Rep (a, b, c) x # to :: Rep (a, b, c) x -> (a, b, c) #
Generic (WrappedArrow a b c)
Instance details Defined in Control.Applicative Associated Types type Rep (WrappedArrow a b c) :: Type -> Type # Methods from :: WrappedArrow a b c -> Rep (WrappedArrow a b c) x # to :: Rep (WrappedArrow a b c) x -> WrappedArrow a b c #
Generic (Const a b)
Instance details Defined in Data.Functor.Const Associated Types type Rep (Const a b) :: Type -> Type # Methods from :: Const a b -> Rep (Const a b) x # to :: Rep (Const a b) x -> Const a b #
Generic (Ap f a)
Instance details Defined in Data.Monoid Associated Types type Rep (Ap f a) :: Type -> Type # Methods from :: Ap f a -> Rep (Ap f a) x # to :: Rep (Ap f a) x -> Ap f a #
Generic (Alt f a)
Instance details Defined in Data.Semigroup.Internal Associated Types type Rep (Alt f a) :: Type -> Type # Methods from :: Alt f a -> Rep (Alt f a) x # to :: Rep (Alt f a) x -> Alt f a #
Generic (Join p a)
Instance details Defined in Data.Bifunctor.Join Associated Types type Rep (Join p a) :: Type -> Type # Methods from :: Join p a -> Rep (Join p a) x # to :: Rep (Join p a) x -> Join p a #
Generic (Fix p a)
Instance details Defined in Data.Bifunctor.Fix Associated Types type Rep (Fix p a) :: Type -> Type # Methods from :: Fix p a -> Rep (Fix p a) x # to :: Rep (Fix p a) x -> Fix p a #
Generic (FreeF f a b)
Instance details Defined in Control.Monad.Trans.Free Associated Types type Rep (FreeF f a b) :: Type -> Type # Methods from :: FreeF f a b -> Rep (FreeF f a b) x # to :: Rep (FreeF f a b) x -> FreeF f a b #
Generic (CofreeF f a b)
Instance details Defined in Control.Comonad.Trans.Cofree Associated Types type Rep (CofreeF f a b) :: Type -> Type # Methods from :: CofreeF f a b -> Rep (CofreeF f a b) x # to :: Rep (CofreeF f a b) x -> CofreeF f a b #
Generic (Tagged s b)
Instance details Defined in Data.Tagged Associated Types type Rep (Tagged s b) :: Type -> Type # Methods from :: Tagged s b -> Rep (Tagged s b) x # to :: Rep (Tagged s b) x -> Tagged s b #
Generic (K1 i c p)
Instance details Defined in GHC.Generics Associated Types type Rep (K1 i c p) :: Type -> Type # Methods from :: K1 i c p -> Rep (K1 i c p) x # to :: Rep (K1 i c p) x -> K1 i c p #
Generic ((f :+: g) p)
Instance details Defined in GHC.Generics Associated Types type Rep ((f :+: g) p) :: Type -> Type # Methods from :: (f :+: g) p -> Rep ((f :+: g) p) x # to :: Rep ((f :+: g) p) x -> (f :+: g) p #
Generic ((f :*: g) p)
Instance details Defined in GHC.Generics Associated Types type Rep ((f :: g) p) :: Type -> Type # Methods from :: (f :: g) p -> Rep ((f :: g) p) x # to :: Rep ((f :: g) p) x -> (f :*: g) p #
Generic (a, b, c, d)
Instance details Defined in GHC.Generics Associated Types type Rep (a, b, c, d) :: Type -> Type # Methods from :: (a, b, c, d) -> Rep (a, b, c, d) x # to :: Rep (a, b, c, d) x -> (a, b, c, d) #
Generic (Product f g a)
Instance details Defined in Data.Functor.Product Associated Types type Rep (Product f g a) :: Type -> Type # Methods from :: Product f g a -> Rep (Product f g a) x # to :: Rep (Product f g a) x -> Product f g a #
Generic (Sum f g a)
Instance details Defined in Data.Functor.Sum Associated Types type Rep (Sum f g a) :: Type -> Type # Methods from :: Sum f g a -> Rep (Sum f g a) x # to :: Rep (Sum f g a) x -> Sum f g a #
Generic (M1 i c f p)
Instance details Defined in GHC.Generics Associated Types type Rep (M1 i c f p) :: Type -> Type # Methods from :: M1 i c f p -> Rep (M1 i c f p) x # to :: Rep (M1 i c f p) x -> M1 i c f p #
Generic ((f :.: g) p)
Instance details Defined in GHC.Generics Associated Types type Rep ((f :.: g) p) :: Type -> Type # Methods from :: (f :.: g) p -> Rep ((f :.: g) p) x # to :: Rep ((f :.: g) p) x -> (f :.: g) p #
Generic (a, b, c, d, e)
Instance details Defined in GHC.Generics Associated Types type Rep (a, b, c, d, e) :: Type -> Type # Methods from :: (a, b, c, d, e) -> Rep (a, b, c, d, e) x # to :: Rep (a, b, c, d, e) x -> (a, b, c, d, e) #
Generic (Compose f g a)
Instance details Defined in Data.Functor.Compose Associated Types type Rep (Compose f g a) :: Type -> Type # Methods from :: Compose f g a -> Rep (Compose f g a) x # to :: Rep (Compose f g a) x -> Compose f g a #
Generic (WrappedBifunctor p a b)
Instance details Defined in Data.Bifunctor.Wrapped Associated Types type Rep (WrappedBifunctor p a b) :: Type -> Type # Methods from :: WrappedBifunctor p a b -> Rep (WrappedBifunctor p a b) x # to :: Rep (WrappedBifunctor p a b) x -> WrappedBifunctor p a b #
Generic (Joker g a b)
Instance details Defined in Data.Bifunctor.Joker Associated Types type Rep (Joker g a b) :: Type -> Type # Methods from :: Joker g a b -> Rep (Joker g a b) x # to :: Rep (Joker g a b) x -> Joker g a b #
Generic (Flip p a b)
Instance details Defined in Data.Bifunctor.Flip Associated Types type Rep (Flip p a b) :: Type -> Type # Methods from :: Flip p a b -> Rep (Flip p a b) x # to :: Rep (Flip p a b) x -> Flip p a b #
Generic (Clown f a b)
Instance details Defined in Data.Bifunctor.Clown Associated Types type Rep (Clown f a b) :: Type -> Type # Methods from :: Clown f a b -> Rep (Clown f a b) x # to :: Rep (Clown f a b) x -> Clown f a b #
Generic (a, b, c, d, e, f)
Instance details Defined in GHC.Generics Associated Types type Rep (a, b, c, d, e, f) :: Type -> Type # Methods from :: (a, b, c, d, e, f) -> Rep (a, b, c, d, e, f) x # to :: Rep (a, b, c, d, e, f) x -> (a, b, c, d, e, f) #
Generic (Sum p q a b)
Instance details Defined in Data.Bifunctor.Sum Associated Types type Rep (Sum p q a b) :: Type -> Type # Methods from :: Sum p q a b -> Rep (Sum p q a b) x # to :: Rep (Sum p q a b) x -> Sum p q a b #
Generic (Product f g a b)
Instance details Defined in Data.Bifunctor.Product Associated Types type Rep (Product f g a b) :: Type -> Type # Methods from :: Product f g a b -> Rep (Product f g a b) x # to :: Rep (Product f g a b) x -> Product f g a b #
Generic (a, b, c, d, e, f, g)
Instance details Defined in GHC.Generics Associated Types type Rep (a, b, c, d, e, f, g) :: Type -> Type # Methods from :: (a, b, c, d, e, f, g) -> Rep (a, b, c, d, e, f, g) x # to :: Rep (a, b, c, d, e, f, g) x -> (a, b, c, d, e, f, g) #
Generic (Tannen f p a b)
Instance details Defined in Data.Bifunctor.Tannen Associated Types type Rep (Tannen f p a b) :: Type -> Type # Methods from :: Tannen f p a b -> Rep (Tannen f p a b) x # to :: Rep (Tannen f p a b) x -> Tannen f p a b #
Generic (Biff p f g a b)
Instance details Defined in Data.Bifunctor.Biff Associated Types type Rep (Biff p f g a b) :: Type -> Type # Methods from :: Biff p f g a b -> Rep (Biff p f g a b) x # to :: Rep (Biff p f g a b) x -> Biff p f g a b #

class Semigroup a where #

The class of semigroups (types with an associative binary operation).

Instances should satisfy the associativity law:

```
x <> (y <> z) = (x <> y) <> z
```

Since: base-4.9.0.0

Minimal complete definition

(<>)

Methods

(<>) :: a -> a -> a infixr 6 #

An associative operation.

sconcat :: NonEmpty a -> a #

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 = stimesIdempotent or stimes = stimesIdempotentMonoid respectively.

Instances

Semigroup Ordering	Since: base-4.9.0.0
Instance details Defined in GHC.Base Methods (<>) :: Ordering -> Ordering -> Ordering # sconcat :: NonEmpty Ordering -> Ordering # stimes :: Integral b => b -> Ordering -> Ordering #
Semigroup ()	Since: base-4.9.0.0
Instance details Defined in GHC.Base Methods (<>) :: () -> () -> () # sconcat :: NonEmpty () -> () # stimes :: Integral b => b -> () -> () #
Semigroup Doc
Instance details Defined in Text.PrettyPrint.HughesPJ Methods (<>) :: Doc -> Doc -> Doc # sconcat :: NonEmpty Doc -> Doc # stimes :: Integral b => b -> Doc -> Doc #
Semigroup ByteString
Instance details Defined in Data.ByteString.Lazy.Internal Methods (<>) :: ByteString -> ByteString -> ByteString # sconcat :: NonEmpty ByteString -> ByteString # stimes :: Integral b => b -> ByteString -> ByteString #
Semigroup ByteString
Instance details Defined in Data.ByteString.Internal Methods (<>) :: ByteString -> ByteString -> ByteString # sconcat :: NonEmpty ByteString -> ByteString # stimes :: Integral b => b -> ByteString -> ByteString #
Semigroup Any	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup.Internal Methods (<>) :: Any -> Any -> Any # sconcat :: NonEmpty Any -> Any # stimes :: Integral b => b -> Any -> Any #
Semigroup All	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup.Internal Methods (<>) :: All -> All -> All # sconcat :: NonEmpty All -> All # stimes :: Integral b => b -> All -> All #
Semigroup Builder
Instance details Defined in Data.Text.Internal.Builder Methods (<>) :: Builder -> Builder -> Builder # sconcat :: NonEmpty Builder -> Builder # stimes :: Integral b => b -> Builder -> Builder #
Semigroup More
Instance details Defined in Data.Attoparsec.Internal.Types Methods (<>) :: More -> More -> More # sconcat :: NonEmpty More -> More # stimes :: Integral b => b -> More -> More #
Semigroup Void	Since: base-4.9.0.0
Instance details Defined in Data.Void Methods (<>) :: Void -> Void -> Void # sconcat :: NonEmpty Void -> Void # stimes :: Integral b => b -> Void -> Void #
Semigroup IntSet	Since: containers-0.5.7
Instance details Defined in Data.IntSet.Internal Methods (<>) :: IntSet -> IntSet -> IntSet # sconcat :: NonEmpty IntSet -> IntSet # stimes :: Integral b => b -> IntSet -> IntSet #
Semigroup ByteArray
Instance details Defined in Data.Primitive.ByteArray Methods (<>) :: ByteArray -> ByteArray -> ByteArray # sconcat :: NonEmpty ByteArray -> ByteArray # stimes :: Integral b => b -> ByteArray -> ByteArray #
Semigroup PromDPatInfos
Instance details Defined in Data.Singletons.Syntax Methods (<>) :: PromDPatInfos -> PromDPatInfos -> PromDPatInfos # sconcat :: NonEmpty PromDPatInfos -> PromDPatInfos # stimes :: Integral b => b -> PromDPatInfos -> PromDPatInfos #
Semigroup ULetDecEnv
Instance details Defined in Data.Singletons.Syntax Methods (<>) :: ULetDecEnv -> ULetDecEnv -> ULetDecEnv # sconcat :: NonEmpty ULetDecEnv -> ULetDecEnv # stimes :: Integral b => b -> ULetDecEnv -> ULetDecEnv #
Semigroup Attributes
Instance details Defined in Text.XML.Stream.Render Methods (<>) :: Attributes -> Attributes -> Attributes # sconcat :: NonEmpty Attributes -> Attributes # stimes :: Integral b => b -> Attributes -> Attributes #
Semigroup [a]	Since: base-4.9.0.0
Instance details Defined in GHC.Base Methods (<>) :: [a] -> [a] -> [a] # sconcat :: NonEmpty [a] -> [a] # stimes :: Integral b => b -> [a] -> [a] #
Semigroup a => Semigroup (Maybe a)	Since: base-4.9.0.0
Instance details Defined in GHC.Base Methods (<>) :: Maybe a -> Maybe a -> Maybe a # sconcat :: NonEmpty (Maybe a) -> Maybe a # stimes :: Integral b => b -> Maybe a -> Maybe a #
Semigroup a => Semigroup (IO a)	Since: base-4.10.0.0
Instance details Defined in GHC.Base Methods (<>) :: IO a -> IO a -> IO a # sconcat :: NonEmpty (IO a) -> IO a # stimes :: Integral b => b -> IO a -> IO a #
Semigroup p => Semigroup (Par1 p)	Since: base-4.12.0.0
Instance details Defined in GHC.Generics Methods (<>) :: Par1 p -> Par1 p -> Par1 p # sconcat :: NonEmpty (Par1 p) -> Par1 p # stimes :: Integral b => b -> Par1 p -> Par1 p #
Semigroup (Last a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods (<>) :: Last a -> Last a -> Last a # sconcat :: NonEmpty (Last a) -> Last a # stimes :: Integral b => b -> Last a -> Last a #
Semigroup a => Semigroup (Concurrently a)	Only defined by `async` for `base >= 4.9` Since: async-2.1.0
Instance details Defined in Control.Concurrent.Async Methods (<>) :: Concurrently a -> Concurrently a -> Concurrently a # sconcat :: NonEmpty (Concurrently a) -> Concurrently a # stimes :: Integral b => b -> Concurrently a -> Concurrently a #
Semigroup (Predicate a)
Instance details Defined in Data.Functor.Contravariant Methods (<>) :: Predicate a -> Predicate a -> Predicate a # sconcat :: NonEmpty (Predicate a) -> Predicate a # stimes :: Integral b => b -> Predicate a -> Predicate a #
Semigroup (Comparison a)
Instance details Defined in Data.Functor.Contravariant Methods (<>) :: Comparison a -> Comparison a -> Comparison a # sconcat :: NonEmpty (Comparison a) -> Comparison a # stimes :: Integral b => b -> Comparison a -> Comparison a #
Semigroup (Equivalence a)
Instance details Defined in Data.Functor.Contravariant Methods (<>) :: Equivalence a -> Equivalence a -> Equivalence a # sconcat :: NonEmpty (Equivalence a) -> Equivalence a # stimes :: Integral b => b -> Equivalence a -> Equivalence a #
Ord a => Semigroup (Min a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods (<>) :: Min a -> Min a -> Min a # sconcat :: NonEmpty (Min a) -> Min a # stimes :: Integral b => b -> Min a -> Min a #
Ord a => Semigroup (Max a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods (<>) :: Max a -> Max a -> Max a # sconcat :: NonEmpty (Max a) -> Max a # stimes :: Integral b => b -> Max a -> Max a #
Semigroup (First a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods (<>) :: First a -> First a -> First a # sconcat :: NonEmpty (First a) -> First a # stimes :: Integral b => b -> First a -> First a #
Monoid m => Semigroup (WrappedMonoid m)	Since: base-4.9.0.0
Instance details 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 #
Semigroup a => Semigroup (Option a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods (<>) :: Option a -> Option a -> Option a # sconcat :: NonEmpty (Option a) -> Option a # stimes :: Integral b => b -> Option a -> Option a #
Semigroup a => Semigroup (Identity a)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Identity Methods (<>) :: Identity a -> Identity a -> Identity a # sconcat :: NonEmpty (Identity a) -> Identity a # stimes :: Integral b => b -> Identity a -> Identity a #
Semigroup (First a)	Since: base-4.9.0.0
Instance details Defined in Data.Monoid Methods (<>) :: First a -> First a -> First a # sconcat :: NonEmpty (First a) -> First a # stimes :: Integral b => b -> First a -> First a #
Semigroup (Last a)	Since: base-4.9.0.0
Instance details Defined in Data.Monoid Methods (<>) :: Last a -> Last a -> Last a # sconcat :: NonEmpty (Last a) -> Last a # stimes :: Integral b => b -> Last a -> Last a #
Semigroup a => Semigroup (Dual a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup.Internal Methods (<>) :: Dual a -> Dual a -> Dual a # sconcat :: NonEmpty (Dual a) -> Dual a # stimes :: Integral b => b -> Dual a -> Dual a #
Semigroup (Endo a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup.Internal Methods (<>) :: Endo a -> Endo a -> Endo a # sconcat :: NonEmpty (Endo a) -> Endo a # stimes :: Integral b => b -> Endo a -> Endo a #
Num a => Semigroup (Sum a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup.Internal Methods (<>) :: Sum a -> Sum a -> Sum a # sconcat :: NonEmpty (Sum a) -> Sum a # stimes :: Integral b => b -> Sum a -> Sum a #
Num a => Semigroup (Product a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup.Internal Methods (<>) :: Product a -> Product a -> Product a # sconcat :: NonEmpty (Product a) -> Product a # stimes :: Integral b => b -> Product a -> Product a #
Semigroup a => Semigroup (Down a)	Since: base-4.11.0.0
Instance details Defined in Data.Ord Methods (<>) :: Down a -> Down a -> Down a # sconcat :: NonEmpty (Down a) -> Down a # stimes :: Integral b => b -> Down a -> Down a #
Semigroup (NonEmpty a)	Since: base-4.9.0.0
Instance details Defined in GHC.Base Methods (<>) :: NonEmpty a -> NonEmpty a -> NonEmpty a # sconcat :: NonEmpty (NonEmpty a) -> NonEmpty a # stimes :: Integral b => b -> NonEmpty a -> NonEmpty a #
Semigroup (Vector a)
Instance details Defined in Data.Vector Methods (<>) :: Vector a -> Vector a -> Vector a # sconcat :: NonEmpty (Vector a) -> Vector a # stimes :: Integral b => b -> Vector a -> Vector a #
(Hashable a, Eq a) => Semigroup (HashSet a)
Instance details Defined in Data.HashSet Methods (<>) :: HashSet a -> HashSet a -> HashSet a # sconcat :: NonEmpty (HashSet a) -> HashSet a # stimes :: Integral b => b -> HashSet a -> HashSet a #
Ord a => Semigroup (Set a)	Since: containers-0.5.7
Instance details Defined in Data.Set.Internal Methods (<>) :: Set a -> Set a -> Set a # sconcat :: NonEmpty (Set a) -> Set a # stimes :: Integral b => b -> Set a -> Set a #
Semigroup (Seq a)	Since: containers-0.5.7
Instance details Defined in Data.Sequence.Internal Methods (<>) :: Seq a -> Seq a -> Seq a # sconcat :: NonEmpty (Seq a) -> Seq a # stimes :: Integral b => b -> Seq a -> Seq a #
Semigroup (IntMap a)	Since: containers-0.5.7
Instance details Defined in Data.IntMap.Internal Methods (<>) :: IntMap a -> IntMap a -> IntMap a # sconcat :: NonEmpty (IntMap a) -> IntMap a # stimes :: Integral b => b -> IntMap a -> IntMap a #
(Semigroup mono, GrowingAppend mono) => Semigroup (NonNull mono)
Instance details Defined in Data.NonNull Methods (<>) :: NonNull mono -> NonNull mono -> NonNull mono # sconcat :: NonEmpty (NonNull mono) -> NonNull mono # stimes :: Integral b => b -> NonNull mono -> NonNull mono #
Semigroup (DList a)
Instance details Defined in Data.DList Methods (<>) :: DList a -> DList a -> DList a # sconcat :: NonEmpty (DList a) -> DList a # stimes :: Integral b => b -> DList a -> DList a #
Num a => Semigroup (Colour a)
Instance details Defined in Data.Colour.Internal Methods (<>) :: Colour a -> Colour a -> Colour a # sconcat :: NonEmpty (Colour a) -> Colour a # stimes :: Integral b => b -> Colour a -> Colour a #
Num a => Semigroup (AlphaColour a)	`AlphaColour` forms a monoid with `over` and `transparent`.
Instance details Defined in Data.Colour.Internal Methods (<>) :: AlphaColour a -> AlphaColour a -> AlphaColour a # sconcat :: NonEmpty (AlphaColour a) -> AlphaColour a # stimes :: Integral b => b -> AlphaColour a -> AlphaColour a #
Semigroup (ScopeM ())
Instance details Defined in Text.Heterocephalus Methods (<>) :: ScopeM () -> ScopeM () -> ScopeM () # sconcat :: NonEmpty (ScopeM ()) -> ScopeM () # stimes :: Integral b => b -> ScopeM () -> ScopeM () #
Prim a => Semigroup (Vector a)
Instance details Defined in Data.Vector.Primitive Methods (<>) :: Vector a -> Vector a -> Vector a # sconcat :: NonEmpty (Vector a) -> Vector a # stimes :: Integral b => b -> Vector a -> Vector a #
Storable a => Semigroup (Vector a)
Instance details Defined in Data.Vector.Storable Methods (<>) :: Vector a -> Vector a -> Vector a # sconcat :: NonEmpty (Vector a) -> Vector a # stimes :: Integral b => b -> Vector a -> Vector a #
Semigroup (Doc a)
Instance details Defined in Text.PrettyPrint.Annotated.HughesPJ Methods (<>) :: Doc a -> Doc a -> Doc a # sconcat :: NonEmpty (Doc a) -> Doc a # stimes :: Integral b => b -> Doc a -> Doc a #
PrimUnlifted a => Semigroup (UnliftedArray a)	Since: primitive-0.6.4.0
Instance details Defined in Data.Primitive.UnliftedArray Methods (<>) :: UnliftedArray a -> UnliftedArray a -> UnliftedArray a # sconcat :: NonEmpty (UnliftedArray a) -> UnliftedArray a # stimes :: Integral b => b -> UnliftedArray a -> UnliftedArray a #
Semigroup (PrimArray a)	Since: primitive-0.6.4.0
Instance details Defined in Data.Primitive.PrimArray Methods (<>) :: PrimArray a -> PrimArray a -> PrimArray a # sconcat :: NonEmpty (PrimArray a) -> PrimArray a # stimes :: Integral b => b -> PrimArray a -> PrimArray a #
Semigroup (SmallArray a)	Since: primitive-0.6.3.0
Instance details Defined in Data.Primitive.SmallArray Methods (<>) :: SmallArray a -> SmallArray a -> SmallArray a # sconcat :: NonEmpty (SmallArray a) -> SmallArray a # stimes :: Integral b => b -> SmallArray a -> SmallArray a #
Semigroup (Array a)	Since: primitive-0.6.3.0
Instance details Defined in Data.Primitive.Array Methods (<>) :: Array a -> Array a -> Array a # sconcat :: NonEmpty (Array a) -> Array a # stimes :: Integral b => b -> Array a -> Array a #
Semigroup (MergeSet a)
Instance details Defined in Data.Set.Internal Methods (<>) :: MergeSet a -> MergeSet a -> MergeSet a # sconcat :: NonEmpty (MergeSet a) -> MergeSet a # stimes :: Integral b => b -> MergeSet a -> MergeSet a #
Semigroup b => Semigroup (a -> b)	Since: base-4.9.0.0
Instance details Defined in GHC.Base Methods (<>) :: (a -> b) -> (a -> b) -> a -> b # sconcat :: NonEmpty (a -> b) -> a -> b # stimes :: Integral b0 => b0 -> (a -> b) -> a -> b #
Semigroup (Either a b)	Since: base-4.9.0.0
Instance details Defined in Data.Either Methods (<>) :: Either a b -> Either a b -> Either a b # sconcat :: NonEmpty (Either a b) -> Either a b # stimes :: Integral b0 => b0 -> Either a b -> Either a b #
Semigroup (V1 p)	Since: base-4.12.0.0
Instance details Defined in GHC.Generics Methods (<>) :: V1 p -> V1 p -> V1 p # sconcat :: NonEmpty (V1 p) -> V1 p # stimes :: Integral b => b -> V1 p -> V1 p #
Semigroup (U1 p)	Since: base-4.12.0.0
Instance details Defined in GHC.Generics Methods (<>) :: U1 p -> U1 p -> U1 p # sconcat :: NonEmpty (U1 p) -> U1 p # stimes :: Integral b => b -> U1 p -> U1 p #
(Semigroup a, Semigroup b) => Semigroup (a, b)	Since: base-4.9.0.0
Instance details Defined in GHC.Base Methods (<>) :: (a, b) -> (a, b) -> (a, b) # sconcat :: NonEmpty (a, b) -> (a, b) # stimes :: Integral b0 => b0 -> (a, b) -> (a, b) #
Semigroup a => Semigroup (ST s a)	Since: base-4.11.0.0
Instance details Defined in GHC.ST Methods (<>) :: ST s a -> ST s a -> ST s a # sconcat :: NonEmpty (ST s a) -> ST s a # stimes :: Integral b => b -> ST s a -> ST s a #
Ord k => Semigroup (Map k v)
Instance details Defined in Data.Map.Internal Methods (<>) :: Map k v -> Map k v -> Map k v # sconcat :: NonEmpty (Map k v) -> Map k v # stimes :: Integral b => b -> Map k v -> Map k v #
Semigroup a => Semigroup (Op a b)
Instance details Defined in Data.Functor.Contravariant Methods (<>) :: Op a b -> Op a b -> Op a b # sconcat :: NonEmpty (Op a b) -> Op a b # stimes :: Integral b0 => b0 -> Op a b -> Op a b #
(Eq k, Hashable k) => Semigroup (HashMap k v)
Instance details Defined in Data.HashMap.Base Methods (<>) :: HashMap k v -> HashMap k v -> HashMap k v # sconcat :: NonEmpty (HashMap k v) -> HashMap k v # stimes :: Integral b => b -> HashMap k v -> HashMap k v #
Semigroup (Parser i a)
Instance details Defined in Data.Attoparsec.Internal.Types Methods (<>) :: Parser i a -> Parser i a -> Parser i a # sconcat :: NonEmpty (Parser i a) -> Parser i a # stimes :: Integral b => b -> Parser i a -> Parser i a #
Semigroup (Proxy s)	Since: base-4.9.0.0
Instance details Defined in Data.Proxy Methods (<>) :: Proxy s -> Proxy s -> Proxy s # sconcat :: NonEmpty (Proxy s) -> Proxy s # stimes :: Integral b => b -> Proxy s -> Proxy s #
(MonadUnliftIO m, Semigroup a) => Semigroup (Conc m a)	Since: unliftio-0.2.9.0
Instance details Defined in UnliftIO.Internals.Async Methods (<>) :: Conc m a -> Conc m a -> Conc m a # sconcat :: NonEmpty (Conc m a) -> Conc m a # stimes :: Integral b => b -> Conc m a -> Conc m a #
(MonadUnliftIO m, Semigroup a) => Semigroup (Concurrently m a)	Only defined by `async` for `base >= 4.9`. Since: unliftio-0.1.0.0
Instance details 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 (ReifiedFold s a)
Instance details Defined in Control.Lens.Reified Methods (<>) :: ReifiedFold s a -> ReifiedFold s a -> ReifiedFold s a # sconcat :: NonEmpty (ReifiedFold s a) -> ReifiedFold s a # stimes :: Integral b => b -> ReifiedFold s a -> ReifiedFold s a #
Semigroup (f a) => Semigroup (Indexing f a)
Instance details Defined in Control.Lens.Internal.Indexed Methods (<>) :: Indexing f a -> Indexing f a -> Indexing f a # sconcat :: NonEmpty (Indexing f a) -> Indexing f a # stimes :: Integral b => b -> Indexing f a -> Indexing f a #
Apply f => Semigroup (Act f a)
Instance details Defined in Data.Key Methods (<>) :: Act f a -> Act f a -> Act f a # sconcat :: NonEmpty (Act f a) -> Act f a # stimes :: Integral b => b -> Act f a -> Act f a #
Semigroup (f p) => Semigroup (Rec1 f p)	Since: base-4.12.0.0
Instance details Defined in GHC.Generics Methods (<>) :: Rec1 f p -> Rec1 f p -> Rec1 f p # sconcat :: NonEmpty (Rec1 f p) -> Rec1 f p # stimes :: Integral b => b -> Rec1 f p -> Rec1 f p #
(Semigroup a, Semigroup b, Semigroup c) => Semigroup (a, b, c)	Since: base-4.9.0.0
Instance details Defined in GHC.Base Methods (<>) :: (a, b, c) -> (a, b, c) -> (a, b, c) # sconcat :: NonEmpty (a, b, c) -> (a, b, c) # stimes :: Integral b0 => b0 -> (a, b, c) -> (a, b, c) #
Semigroup a => Semigroup (Const a b)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Const Methods (<>) :: Const a b -> Const a b -> Const a b # sconcat :: NonEmpty (Const a b) -> Const a b # stimes :: Integral b0 => b0 -> Const a b -> Const a b #
(Applicative f, Semigroup a) => Semigroup (Ap f a)	Since: base-4.12.0.0
Instance details Defined in Data.Monoid Methods (<>) :: Ap f a -> Ap f a -> Ap f a # sconcat :: NonEmpty (Ap f a) -> Ap f a # stimes :: Integral b => b -> Ap f a -> Ap f a #
Alternative f => Semigroup (Alt f a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup.Internal Methods (<>) :: Alt f a -> Alt f a -> Alt f a # sconcat :: NonEmpty (Alt f a) -> Alt f a # stimes :: Integral b => b -> Alt f a -> Alt f a #
Semigroup (ReifiedIndexedFold i s a)
Instance details Defined in Control.Lens.Reified Methods (<>) :: ReifiedIndexedFold i s a -> ReifiedIndexedFold i s a -> ReifiedIndexedFold i s a # sconcat :: NonEmpty (ReifiedIndexedFold i s a) -> ReifiedIndexedFold i s a # stimes :: Integral b => b -> ReifiedIndexedFold i s a -> ReifiedIndexedFold i s a #
Reifies s (ReifiedMonoid a) => Semigroup (ReflectedMonoid a s)
Instance details Defined in Data.Reflection Methods (<>) :: ReflectedMonoid a s -> ReflectedMonoid a s -> ReflectedMonoid a s # sconcat :: NonEmpty (ReflectedMonoid a s) -> ReflectedMonoid a s # stimes :: Integral b => b -> ReflectedMonoid a s -> ReflectedMonoid a s #
Semigroup a => Semigroup (Tagged s a)
Instance details Defined in Data.Tagged Methods (<>) :: Tagged s a -> Tagged s a -> Tagged s a # sconcat :: NonEmpty (Tagged s a) -> Tagged s a # stimes :: Integral b => b -> Tagged s a -> Tagged s a #
Semigroup c => Semigroup (K1 i c p)	Since: base-4.12.0.0
Instance details Defined in GHC.Generics Methods (<>) :: K1 i c p -> K1 i c p -> K1 i c p # sconcat :: NonEmpty (K1 i c p) -> K1 i c p # stimes :: Integral b => b -> K1 i c p -> K1 i c p #
(Semigroup (f p), Semigroup (g p)) => Semigroup ((f :*: g) p)	Since: base-4.12.0.0
Instance details Defined in GHC.Generics Methods (<>) :: (f :: g) p -> (f :: g) p -> (f :: g) p # sconcat :: NonEmpty ((f :: g) p) -> (f :: g) p # stimes :: Integral b => b -> (f :: g) p -> (f :*: g) p #
(Semigroup a, Semigroup b, Semigroup c, Semigroup d) => Semigroup (a, b, c, d)	Since: base-4.9.0.0
Instance details Defined in GHC.Base Methods (<>) :: (a, b, c, d) -> (a, b, c, d) -> (a, b, c, d) # sconcat :: NonEmpty (a, b, c, d) -> (a, b, c, d) # stimes :: Integral b0 => b0 -> (a, b, c, d) -> (a, b, c, d) #
Monad m => Semigroup (ConduitT i o m ())
Instance details Defined in Data.Conduit.Internal.Conduit Methods (<>) :: ConduitT i o m () -> ConduitT i o m () -> ConduitT i o m () # sconcat :: NonEmpty (ConduitT i o m ()) -> ConduitT i o m () # stimes :: Integral b => b -> ConduitT i o m () -> ConduitT i o m () #
Semigroup (f p) => Semigroup (M1 i c f p)	Since: base-4.12.0.0
Instance details Defined in GHC.Generics Methods (<>) :: M1 i c f p -> M1 i c f p -> M1 i c f p # sconcat :: NonEmpty (M1 i c f p) -> M1 i c f p # stimes :: Integral b => b -> M1 i c f p -> M1 i c f p #
Semigroup (f (g p)) => Semigroup ((f :.: g) p)	Since: base-4.12.0.0
Instance details Defined in GHC.Generics Methods (<>) :: (f :.: g) p -> (f :.: g) p -> (f :.: g) p # sconcat :: NonEmpty ((f :.: g) p) -> (f :.: g) p # stimes :: Integral b => b -> (f :.: g) p -> (f :.: g) p #
(Semigroup a, Semigroup b, Semigroup c, Semigroup d, Semigroup e) => Semigroup (a, b, c, d, e)	Since: base-4.9.0.0
Instance details Defined in GHC.Base Methods (<>) :: (a, b, c, d, e) -> (a, b, c, d, e) -> (a, b, c, d, e) # sconcat :: NonEmpty (a, b, c, d, e) -> (a, b, c, d, e) # stimes :: Integral b0 => b0 -> (a, b, c, d, e) -> (a, b, c, d, e) #
Monad m => Semigroup (Pipe l i o u m ())
Instance details Defined in Data.Conduit.Internal.Pipe Methods (<>) :: Pipe l i o u m () -> Pipe l i o u m () -> Pipe l i o u m () # sconcat :: NonEmpty (Pipe l i o u m ()) -> Pipe l i o u m () # stimes :: Integral b => b -> Pipe l i o u m () -> Pipe l i o u m () #

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 = x
```
```
mempty <> x = x
```
x <> (y <> z) = (x <> y) <> z (Semigroup law)
```
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

mempty

Methods

mempty :: a #

Identity of mappend

mappend :: a -> a -> a #

An associative operation

NOTE: This method is redundant and has the default implementation mappend = '(<>)' since base-4.11.0.0.

mconcat :: [a] -> a #

Fold a list using the monoid.

For most types, the default definition for mconcat will be used, but the function is included in the class definition so that an optimized version can be provided for specific types.

Instances

Monoid Ordering	Since: base-2.1
Instance details Defined in GHC.Base Methods mempty :: Ordering # mappend :: Ordering -> Ordering -> Ordering # mconcat :: [Ordering] -> Ordering #
Monoid ()	Since: base-2.1
Instance details Defined in GHC.Base Methods mempty :: () # mappend :: () -> () -> () # mconcat :: [()] -> () #
Monoid Doc
Instance details Defined in Text.PrettyPrint.HughesPJ Methods mempty :: Doc # mappend :: Doc -> Doc -> Doc # mconcat :: [Doc] -> Doc #
Monoid ByteString
Instance details Defined in Data.ByteString.Lazy.Internal Methods mempty :: ByteString # mappend :: ByteString -> ByteString -> ByteString # mconcat :: [ByteString] -> ByteString #
Monoid ByteString
Instance details Defined in Data.ByteString.Internal Methods mempty :: ByteString # mappend :: ByteString -> ByteString -> ByteString # mconcat :: [ByteString] -> ByteString #
Monoid Any	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods mempty :: Any # mappend :: Any -> Any -> Any # mconcat :: [Any] -> Any #
Monoid All	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods mempty :: All # mappend :: All -> All -> All # mconcat :: [All] -> All #
Monoid Builder
Instance details Defined in Data.Text.Internal.Builder Methods mempty :: Builder # mappend :: Builder -> Builder -> Builder # mconcat :: [Builder] -> Builder #
Monoid More
Instance details Defined in Data.Attoparsec.Internal.Types Methods mempty :: More # mappend :: More -> More -> More # mconcat :: [More] -> More #
Monoid IntSet
Instance details Defined in Data.IntSet.Internal Methods mempty :: IntSet # mappend :: IntSet -> IntSet -> IntSet # mconcat :: [IntSet] -> IntSet #
Monoid ByteArray
Instance details Defined in Data.Primitive.ByteArray Methods mempty :: ByteArray # mappend :: ByteArray -> ByteArray -> ByteArray # mconcat :: [ByteArray] -> ByteArray #
Monoid PromDPatInfos
Instance details Defined in Data.Singletons.Syntax Methods mempty :: PromDPatInfos # mappend :: PromDPatInfos -> PromDPatInfos -> PromDPatInfos # mconcat :: [PromDPatInfos] -> PromDPatInfos #
Monoid ULetDecEnv
Instance details Defined in Data.Singletons.Syntax Methods mempty :: ULetDecEnv # mappend :: ULetDecEnv -> ULetDecEnv -> ULetDecEnv # mconcat :: [ULetDecEnv] -> ULetDecEnv #
Monoid Attributes
Instance details Defined in Text.XML.Stream.Render Methods mempty :: Attributes # mappend :: Attributes -> Attributes -> Attributes # mconcat :: [Attributes] -> Attributes #
Monoid [a]	Since: base-2.1
Instance details Defined in GHC.Base Methods mempty :: [a] # mappend :: [a] -> [a] -> [a] # mconcat :: [[a]] -> [a] #
Semigroup a => Monoid (Maybe a)	Lift a semigroup into `Maybe` forming a `Monoid` according to http://en.wikipedia.org/wiki/Monoid: "Any semigroup `S` may be turned into a monoid simply by adjoining an element `e` not in `S` and defining `ee = e` and `es = s = se` for all `s ∈ S`." Since 4.11.0: constraint on inner `a` value generalised from `Monoid` to `Semigroup`. Since: base-2.1*
Instance details Defined in GHC.Base Methods mempty :: Maybe a # mappend :: Maybe a -> Maybe a -> Maybe a # mconcat :: [Maybe a] -> Maybe a #
Monoid a => Monoid (IO a)	Since: base-4.9.0.0
Instance details Defined in GHC.Base Methods mempty :: IO a # mappend :: IO a -> IO a -> IO a # mconcat :: [IO a] -> IO a #
Monoid p => Monoid (Par1 p)	Since: base-4.12.0.0
Instance details Defined in GHC.Generics Methods mempty :: Par1 p # mappend :: Par1 p -> Par1 p -> Par1 p # mconcat :: [Par1 p] -> Par1 p #
(Semigroup a, Monoid a) => Monoid (Concurrently a)	Since: async-2.1.0
Instance details Defined in Control.Concurrent.Async Methods mempty :: Concurrently a # mappend :: Concurrently a -> Concurrently a -> Concurrently a # mconcat :: [Concurrently a] -> Concurrently a #
Monoid (Predicate a)
Instance details Defined in Data.Functor.Contravariant Methods mempty :: Predicate a # mappend :: Predicate a -> Predicate a -> Predicate a # mconcat :: [Predicate a] -> Predicate a #
Monoid (Comparison a)
Instance details Defined in Data.Functor.Contravariant Methods mempty :: Comparison a # mappend :: Comparison a -> Comparison a -> Comparison a # mconcat :: [Comparison a] -> Comparison a #
Monoid (Equivalence a)
Instance details Defined in Data.Functor.Contravariant Methods mempty :: Equivalence a # mappend :: Equivalence a -> Equivalence a -> Equivalence a # mconcat :: [Equivalence a] -> Equivalence a #
(Ord a, Bounded a) => Monoid (Min a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods mempty :: Min a # mappend :: Min a -> Min a -> Min a # mconcat :: [Min a] -> Min a #
(Ord a, Bounded a) => Monoid (Max a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods mempty :: Max a # mappend :: Max a -> Max a -> Max a # mconcat :: [Max a] -> Max a #
Monoid m => Monoid (WrappedMonoid m)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods mempty :: WrappedMonoid m # mappend :: WrappedMonoid m -> WrappedMonoid m -> WrappedMonoid m # mconcat :: [WrappedMonoid m] -> WrappedMonoid m #
Semigroup a => Monoid (Option a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods mempty :: Option a # mappend :: Option a -> Option a -> Option a # mconcat :: [Option a] -> Option a #
Monoid a => Monoid (Identity a)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Identity Methods mempty :: Identity a # mappend :: Identity a -> Identity a -> Identity a # mconcat :: [Identity a] -> Identity a #
Monoid (First a)	Since: base-2.1
Instance details Defined in Data.Monoid Methods mempty :: First a # mappend :: First a -> First a -> First a # mconcat :: [First a] -> First a #
Monoid (Last a)	Since: base-2.1
Instance details Defined in Data.Monoid Methods mempty :: Last a # mappend :: Last a -> Last a -> Last a # mconcat :: [Last a] -> Last a #
Monoid a => Monoid (Dual a)	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods mempty :: Dual a # mappend :: Dual a -> Dual a -> Dual a # mconcat :: [Dual a] -> Dual a #
Monoid (Endo a)	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods mempty :: Endo a # mappend :: Endo a -> Endo a -> Endo a # mconcat :: [Endo a] -> Endo a #
Num a => Monoid (Sum a)	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods mempty :: Sum a # mappend :: Sum a -> Sum a -> Sum a # mconcat :: [Sum a] -> Sum a #
Num a => Monoid (Product a)	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods mempty :: Product a # mappend :: Product a -> Product a -> Product a # mconcat :: [Product a] -> Product a #
Monoid a => Monoid (Down a)	Since: base-4.11.0.0
Instance details Defined in Data.Ord Methods mempty :: Down a # mappend :: Down a -> Down a -> Down a # mconcat :: [Down a] -> Down a #
Monoid (Vector a)
Instance details Defined in Data.Vector Methods mempty :: Vector a # mappend :: Vector a -> Vector a -> Vector a # mconcat :: [Vector a] -> Vector a #
(Hashable a, Eq a) => Monoid (HashSet a)
Instance details Defined in Data.HashSet Methods mempty :: HashSet a # mappend :: HashSet a -> HashSet a -> HashSet a # mconcat :: [HashSet a] -> HashSet a #
Ord a => Monoid (Set a)
Instance details Defined in Data.Set.Internal Methods mempty :: Set a # mappend :: Set a -> Set a -> Set a # mconcat :: [Set a] -> Set a #
Monoid (Seq a)
Instance details Defined in Data.Sequence.Internal Methods mempty :: Seq a # mappend :: Seq a -> Seq a -> Seq a # mconcat :: [Seq a] -> Seq a #
Monoid (IntMap a)
Instance details Defined in Data.IntMap.Internal Methods mempty :: IntMap a # mappend :: IntMap a -> IntMap a -> IntMap a # mconcat :: [IntMap a] -> IntMap a #
Monoid (DList a)
Instance details Defined in Data.DList Methods mempty :: DList a # mappend :: DList a -> DList a -> DList a # mconcat :: [DList a] -> DList a #
Num a => Monoid (Colour a)
Instance details Defined in Data.Colour.Internal Methods mempty :: Colour a # mappend :: Colour a -> Colour a -> Colour a # mconcat :: [Colour a] -> Colour a #
Num a => Monoid (AlphaColour a)
Instance details Defined in Data.Colour.Internal Methods mempty :: AlphaColour a # mappend :: AlphaColour a -> AlphaColour a -> AlphaColour a # mconcat :: [AlphaColour a] -> AlphaColour a #
Monoid (ScopeM ())
Instance details Defined in Text.Heterocephalus Methods mempty :: ScopeM () # mappend :: ScopeM () -> ScopeM () -> ScopeM () # mconcat :: [ScopeM ()] -> ScopeM () #
Prim a => Monoid (Vector a)
Instance details Defined in Data.Vector.Primitive Methods mempty :: Vector a # mappend :: Vector a -> Vector a -> Vector a # mconcat :: [Vector a] -> Vector a #
Storable a => Monoid (Vector a)
Instance details Defined in Data.Vector.Storable Methods mempty :: Vector a # mappend :: Vector a -> Vector a -> Vector a # mconcat :: [Vector a] -> Vector a #
Monoid (Doc a)
Instance details Defined in Text.PrettyPrint.Annotated.HughesPJ Methods mempty :: Doc a # mappend :: Doc a -> Doc a -> Doc a # mconcat :: [Doc a] -> Doc a #
PrimUnlifted a => Monoid (UnliftedArray a)	Since: primitive-0.6.4.0
Instance details Defined in Data.Primitive.UnliftedArray Methods mempty :: UnliftedArray a # mappend :: UnliftedArray a -> UnliftedArray a -> UnliftedArray a # mconcat :: [UnliftedArray a] -> UnliftedArray a #
Monoid (PrimArray a)	Since: primitive-0.6.4.0
Instance details Defined in Data.Primitive.PrimArray Methods mempty :: PrimArray a # mappend :: PrimArray a -> PrimArray a -> PrimArray a # mconcat :: [PrimArray a] -> PrimArray a #
Monoid (SmallArray a)
Instance details Defined in Data.Primitive.SmallArray Methods mempty :: SmallArray a # mappend :: SmallArray a -> SmallArray a -> SmallArray a # mconcat :: [SmallArray a] -> SmallArray a #
Monoid (Array a)
Instance details Defined in Data.Primitive.Array Methods mempty :: Array a # mappend :: Array a -> Array a -> Array a # mconcat :: [Array a] -> Array a #
Monoid (MergeSet a)
Instance details Defined in Data.Set.Internal Methods mempty :: MergeSet a # mappend :: MergeSet a -> MergeSet a -> MergeSet a # mconcat :: [MergeSet a] -> MergeSet a #
Monoid b => Monoid (a -> b)	Since: base-2.1
Instance details Defined in GHC.Base Methods mempty :: a -> b # mappend :: (a -> b) -> (a -> b) -> a -> b # mconcat :: [a -> b] -> a -> b #
Monoid (U1 p)	Since: base-4.12.0.0
Instance details Defined in GHC.Generics Methods mempty :: U1 p # mappend :: U1 p -> U1 p -> U1 p # mconcat :: [U1 p] -> U1 p #
(Monoid a, Monoid b) => Monoid (a, b)	Since: base-2.1
Instance details Defined in GHC.Base Methods mempty :: (a, b) # mappend :: (a, b) -> (a, b) -> (a, b) # mconcat :: [(a, b)] -> (a, b) #
Monoid a => Monoid (ST s a)	Since: base-4.11.0.0
Instance details Defined in GHC.ST Methods mempty :: ST s a # mappend :: ST s a -> ST s a -> ST s a # mconcat :: [ST s a] -> ST s a #
Ord k => Monoid (Map k v)
Instance details Defined in Data.Map.Internal Methods mempty :: Map k v # mappend :: Map k v -> Map k v -> Map k v # mconcat :: [Map k v] -> Map k v #
Monoid a => Monoid (Op a b)
Instance details Defined in Data.Functor.Contravariant Methods mempty :: Op a b # mappend :: Op a b -> Op a b -> Op a b # mconcat :: [Op a b] -> Op a b #
(Eq k, Hashable k) => Monoid (HashMap k v)
Instance details Defined in Data.HashMap.Base Methods mempty :: HashMap k v # mappend :: HashMap k v -> HashMap k v -> HashMap k v # mconcat :: [HashMap k v] -> HashMap k v #
Monoid (Parser i a)
Instance details Defined in Data.Attoparsec.Internal.Types Methods mempty :: Parser i a # mappend :: Parser i a -> Parser i a -> Parser i a # mconcat :: [Parser i a] -> Parser i a #
Monoid (Proxy s)	Since: base-4.7.0.0
Instance details Defined in Data.Proxy Methods mempty :: Proxy s # mappend :: Proxy s -> Proxy s -> Proxy s # mconcat :: [Proxy s] -> Proxy s #
(Monoid a, MonadUnliftIO m) => Monoid (Conc m a)	Since: unliftio-0.2.9.0
Instance details Defined in UnliftIO.Internals.Async Methods mempty :: Conc m a # mappend :: Conc m a -> Conc m a -> Conc m a # mconcat :: [Conc m a] -> Conc m a #
(Semigroup a, Monoid a, MonadUnliftIO m) => Monoid (Concurrently m a)	Since: unliftio-0.1.0.0
Instance details 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 #
Monoid (ReifiedFold s a)
Instance details Defined in Control.Lens.Reified Methods mempty :: ReifiedFold s a # mappend :: ReifiedFold s a -> ReifiedFold s a -> ReifiedFold s a # mconcat :: [ReifiedFold s a] -> ReifiedFold s a #
Monoid (f a) => Monoid (Indexing f a)	`>>>` `"cat" ^@.. (folded <> folded)`[(0,'c'),(1,'a'),(2,'t'),(0,'c'),(1,'a'),(2,'t')] `>>>` `"cat" ^@.. indexing (folded <> folded)`[(0,'c'),(1,'a'),(2,'t'),(3,'c'),(4,'a'),(5,'t')]
Instance details Defined in Control.Lens.Internal.Indexed Methods mempty :: Indexing f a # mappend :: Indexing f a -> Indexing f a -> Indexing f a # mconcat :: [Indexing f a] -> Indexing f a #
Monoid (f p) => Monoid (Rec1 f p)	Since: base-4.12.0.0
Instance details Defined in GHC.Generics Methods mempty :: Rec1 f p # mappend :: Rec1 f p -> Rec1 f p -> Rec1 f p # mconcat :: [Rec1 f p] -> Rec1 f p #
(Monoid a, Monoid b, Monoid c) => Monoid (a, b, c)	Since: base-2.1
Instance details Defined in GHC.Base Methods mempty :: (a, b, c) # mappend :: (a, b, c) -> (a, b, c) -> (a, b, c) # mconcat :: [(a, b, c)] -> (a, b, c) #
Monoid a => Monoid (Const a b)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Const Methods mempty :: Const a b # mappend :: Const a b -> Const a b -> Const a b # mconcat :: [Const a b] -> Const a b #
(Applicative f, Monoid a) => Monoid (Ap f a)	Since: base-4.12.0.0
Instance details Defined in Data.Monoid Methods mempty :: Ap f a # mappend :: Ap f a -> Ap f a -> Ap f a # mconcat :: [Ap f a] -> Ap f a #
Alternative f => Monoid (Alt f a)	Since: base-4.8.0.0
Instance details Defined in Data.Semigroup.Internal Methods mempty :: Alt f a # mappend :: Alt f a -> Alt f a -> Alt f a # mconcat :: [Alt f a] -> Alt f a #
Monoid (ReifiedIndexedFold i s a)
Instance details Defined in Control.Lens.Reified Methods mempty :: ReifiedIndexedFold i s a # mappend :: ReifiedIndexedFold i s a -> ReifiedIndexedFold i s a -> ReifiedIndexedFold i s a # mconcat :: [ReifiedIndexedFold i s a] -> ReifiedIndexedFold i s a #
Reifies s (ReifiedMonoid a) => Monoid (ReflectedMonoid a s)
Instance details Defined in Data.Reflection Methods mempty :: ReflectedMonoid a s # mappend :: ReflectedMonoid a s -> ReflectedMonoid a s -> ReflectedMonoid a s # mconcat :: [ReflectedMonoid a s] -> ReflectedMonoid a s #
(Semigroup a, Monoid a) => Monoid (Tagged s a)
Instance details Defined in Data.Tagged Methods mempty :: Tagged s a # mappend :: Tagged s a -> Tagged s a -> Tagged s a # mconcat :: [Tagged s a] -> Tagged s a #
Monoid c => Monoid (K1 i c p)	Since: base-4.12.0.0
Instance details Defined in GHC.Generics Methods mempty :: K1 i c p # mappend :: K1 i c p -> K1 i c p -> K1 i c p # mconcat :: [K1 i c p] -> K1 i c p #
(Monoid (f p), Monoid (g p)) => Monoid ((f :*: g) p)	Since: base-4.12.0.0
Instance details Defined in GHC.Generics Methods mempty :: (f :: g) p # mappend :: (f :: g) p -> (f :: g) p -> (f :: g) p # mconcat :: [(f :: g) p] -> (f :: g) p #
(Monoid a, Monoid b, Monoid c, Monoid d) => Monoid (a, b, c, d)	Since: base-2.1
Instance details Defined in GHC.Base Methods mempty :: (a, b, c, d) # mappend :: (a, b, c, d) -> (a, b, c, d) -> (a, b, c, d) # mconcat :: [(a, b, c, d)] -> (a, b, c, d) #
Monad m => Monoid (ConduitT i o m ())
Instance details Defined in Data.Conduit.Internal.Conduit Methods mempty :: ConduitT i o m () # mappend :: ConduitT i o m () -> ConduitT i o m () -> ConduitT i o m () # mconcat :: [ConduitT i o m ()] -> ConduitT i o m () #
Monoid (f p) => Monoid (M1 i c f p)	Since: base-4.12.0.0
Instance details Defined in GHC.Generics Methods mempty :: M1 i c f p # mappend :: M1 i c f p -> M1 i c f p -> M1 i c f p # mconcat :: [M1 i c f p] -> M1 i c f p #
Monoid (f (g p)) => Monoid ((f :.: g) p)	Since: base-4.12.0.0
Instance details Defined in GHC.Generics Methods mempty :: (f :.: g) p # mappend :: (f :.: g) p -> (f :.: g) p -> (f :.: g) p # mconcat :: [(f :.: g) p] -> (f :.: g) p #
(Monoid a, Monoid b, Monoid c, Monoid d, Monoid e) => Monoid (a, b, c, d, e)	Since: base-2.1
Instance details Defined in GHC.Base Methods mempty :: (a, b, c, d, e) # mappend :: (a, b, c, d, e) -> (a, b, c, d, e) -> (a, b, c, d, e) # mconcat :: [(a, b, c, d, e)] -> (a, b, c, d, e) #
Monad m => Monoid (Pipe l i o u m ())
Instance details Defined in Data.Conduit.Internal.Pipe Methods mempty :: Pipe l i o u m () # mappend :: Pipe l i o u m () -> Pipe l i o u m () -> Pipe l i o u m () # mconcat :: [Pipe l i o u m ()] -> Pipe l i o u m () #

data Bool #

Constructors

False
True

Instances

Bounded Bool	Since: base-2.1
Instance details Defined in GHC.Enum Methods minBound :: Bool # maxBound :: Bool #
Enum Bool	Since: base-2.1
Instance details Defined in GHC.Enum Methods succ :: Bool -> Bool # pred :: Bool -> Bool # toEnum :: Int -> Bool # fromEnum :: Bool -> Int # enumFrom :: Bool -> [Bool] # enumFromThen :: Bool -> Bool -> [Bool] # enumFromTo :: Bool -> Bool -> [Bool] # enumFromThenTo :: Bool -> Bool -> Bool -> [Bool] #
Eq Bool
Instance details Defined in GHC.Classes Methods (==) :: Bool -> Bool -> Bool # (/=) :: Bool -> Bool -> Bool #
Ord Bool
Instance details Defined in GHC.Classes Methods compare :: Bool -> Bool -> Ordering # (<) :: Bool -> Bool -> Bool # (<=) :: Bool -> Bool -> Bool # (>) :: Bool -> Bool -> Bool # (>=) :: Bool -> Bool -> Bool # max :: Bool -> Bool -> Bool # min :: Bool -> Bool -> Bool #
Read Bool	Since: base-2.1
Instance details Defined in GHC.Read Methods readsPrec :: Int -> ReadS Bool # readList :: ReadS [Bool] # readPrec :: ReadPrec Bool # readListPrec :: ReadPrec [Bool] #
Show Bool	Since: base-2.1
Instance details Defined in GHC.Show Methods showsPrec :: Int -> Bool -> ShowS # show :: Bool -> String # showList :: [Bool] -> ShowS #
Ix Bool	Since: base-2.1
Instance details Defined in GHC.Arr Methods range :: (Bool, Bool) -> [Bool] # index :: (Bool, Bool) -> Bool -> Int # unsafeIndex :: (Bool, Bool) -> Bool -> Int inRange :: (Bool, Bool) -> Bool -> Bool # rangeSize :: (Bool, Bool) -> Int # unsafeRangeSize :: (Bool, Bool) -> Int
Generic Bool
Instance details Defined in GHC.Generics Associated Types type Rep Bool :: Type -> Type # Methods from :: Bool -> Rep Bool x # to :: Rep Bool x -> Bool #
Lift Bool
Instance details Defined in Language.Haskell.TH.Syntax Methods lift :: Bool -> Q Exp #
NFData Bool
Instance details Defined in Control.DeepSeq Methods rnf :: Bool -> () #
Hashable Bool
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Bool -> Int # hash :: Bool -> Int #
SingKind Bool	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Associated Types type DemoteRep Bool :: Type Methods fromSing :: Sing a -> DemoteRep Bool
Storable Bool	Since: base-2.1
Instance details Defined in Foreign.Storable Methods sizeOf :: Bool -> Int # alignment :: Bool -> Int # peekElemOff :: Ptr Bool -> Int -> IO Bool # pokeElemOff :: Ptr Bool -> Int -> Bool -> IO () # peekByteOff :: Ptr b -> Int -> IO Bool # pokeByteOff :: Ptr b -> Int -> Bool -> IO () # peek :: Ptr Bool -> IO Bool # poke :: Ptr Bool -> Bool -> IO () #
Unbox Bool
Instance details Defined in Data.Vector.Unboxed.Base
IsGValue Bool
Instance details Defined in Data.GI.Base.GValue Methods toGValue :: Bool -> IO GValue # fromGValue :: GValue -> IO Bool #
PShow Bool
Instance details Defined in Data.Singletons.Prelude.Show Associated Types type ShowsPrec arg arg1 arg2 :: Symbol # type Show_ arg :: Symbol # type ShowList arg arg1 :: Symbol #
SShow Bool
Instance details Defined in Data.Singletons.Prelude.Show Methods sShowsPrec :: Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply ShowsPrecSym0 t1) t2) t3) # sShow_ :: Sing t -> Sing (Apply Show_Sym0 t) # sShowList :: Sing t1 -> Sing t2 -> Sing (Apply (Apply ShowListSym0 t1) t2) #
PEnum Bool
Instance details Defined in Data.Singletons.Prelude.Enum Associated Types type Succ arg :: a # type Pred arg :: a # type ToEnum arg :: a # type FromEnum arg :: Nat # type EnumFromTo arg arg1 :: [a] # type EnumFromThenTo arg arg1 arg2 :: [a] #
SEnum Bool
Instance details 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
Instance details Defined in Data.Singletons.Prelude.Enum Associated Types type MinBound :: a # type MaxBound :: a #
SBounded Bool
Instance details Defined in Data.Singletons.Prelude.Enum Methods sMinBound :: Sing MinBoundSym0 # sMaxBound :: Sing MaxBoundSym0 #
POrd Bool
Instance details Defined in Data.Singletons.Prelude.Ord Associated Types type Compare arg arg1 :: Ordering # type arg < arg1 :: Bool # type arg <= arg1 :: Bool # type arg > arg1 :: Bool # type arg >= arg1 :: Bool # type Max arg arg1 :: a # type Min arg arg1 :: a #
SOrd Bool
Instance details 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
Instance details Defined in Data.Singletons.Prelude.Eq Methods (%==) :: Sing a -> Sing b -> Sing (a == b) # (%/=) :: Sing a -> Sing b -> Sing (a /= b) #
PEq Bool
Instance details Defined in Data.Singletons.Prelude.Eq Associated Types type x == y :: Bool # type x /= y :: Bool #
SingI False	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods sing :: Sing False
SingI True	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods sing :: Sing True
Vector Vector Bool
Instance details 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 () # elemseq :: Vector Bool -> Bool -> b -> b #
MVector MVector Bool
Instance details 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
Instance details Defined in Data.Singletons.Prelude.Bool Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings FromEnum_6989586621680096094Sym0
Instance details Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings AnySym0
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings Any_Sym0
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings AllSym0
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings All_Sym0
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (\|\|@#@$)
Instance details Defined in Data.Singletons.Prelude.Bool Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (&&@#@$)
Instance details Defined in Data.Singletons.Prelude.Bool Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings Compare_6989586621679858858Sym0
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ShowParenSym0
Instance details Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings OrSym0
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings AndSym0
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ToEnum_6989586621680096083Sym0
Instance details Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ShowsPrec_6989586621680611339Sym0
Instance details Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (<=?@#@$)
Instance details Defined in Data.Singletons.TypeLits.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings GetAnySym0
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings GetAllSym0
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () #
SingI NotSym0
Instance details Defined in Data.Singletons.Prelude.Bool Methods sing :: Sing NotSym0 #
SingI (\|\|@#@$)
Instance details Defined in Data.Singletons.Prelude.Bool Methods sing :: Sing (\|\|@#@$) #
SingI (&&@#@$)
Instance details Defined in Data.Singletons.Prelude.Bool Methods sing :: Sing (&&@#@$) #
SingI (<=?@#@$)
Instance details Defined in Data.Singletons.TypeLits.Internal Methods sing :: Sing (<=?@#@$) #
SingI AnySym0
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods sing :: Sing AnySym0 #
SingI AllSym0
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods sing :: Sing AllSym0 #
SingI ShowParenSym0
Instance details Defined in Data.Singletons.Prelude.Show Methods sing :: Sing ShowParenSym0 #
SingI OrSym0
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing OrSym0 #
SingI AndSym0
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing AndSym0 #
SuppressUnusedWarnings ((\|\|@#@$$) a6989586621679795656 :: TyFun Bool Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Bool Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ((&&@#@$$) a6989586621679795039 :: TyFun Bool Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Bool Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Compare_6989586621679858858Sym1 a6989586621679858856 :: TyFun Bool Ordering -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (GuardSym0 :: TyFun Bool (f6989586621679943678 ()) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ShowsPrec_6989586621680611339Sym1 a6989586621680611336 :: TyFun Bool (Symbol ~> Symbol) -> Type)
Instance details Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (WhenSym0 :: TyFun Bool (f6989586621679943711 () ~> f6989586621679943711 ()) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (UnlessSym0 :: TyFun Bool (f6989586621681071232 () ~> f6989586621681071232 ()) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ListnullSym0 :: TyFun [a6989586621680578886] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ListisPrefixOfSym0 :: TyFun [a6989586621680578909] ([a6989586621680578909] ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (NullSym0 :: TyFun [a6989586621680316670] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (IsSuffixOfSym0 :: TyFun [a6989586621680316635] ([a6989586621680316635] ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (IsPrefixOfSym0 :: TyFun [a6989586621680316636] ([a6989586621680316636] ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (IsInfixOfSym0 :: TyFun [a6989586621680316634] ([a6989586621680316634] ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (IsNothingSym0 :: TyFun (Maybe a6989586621680040191) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (IsJustSym0 :: TyFun (Maybe a6989586621680040193) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ((<=?@#@$$) a3530822107858468865 :: TyFun Nat Bool -> Type)
Instance details Defined in Data.Singletons.TypeLits.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679476227Scrutinee_6989586621679461448Sym0 :: TyFun k1 Bool -> Type) Source #
Instance details Defined in Termonad.Config.Vec Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679476231Scrutinee_6989586621679461450Sym0 :: TyFun k1 Bool -> Type) Source #
Instance details Defined in Termonad.Config.Vec Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ListelemSym0 :: TyFun a6989586621680578897 ([a6989586621680578897] ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (NotElemSym0 :: TyFun a6989586621680316632 ([a6989586621680316632] ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ElemSym0 :: TyFun a6989586621680316633 ([a6989586621680316633] ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (OrSym0 :: TyFun (t6989586621680725641 Bool) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680726210Scrutinee_6989586621680725968Sym0 :: TyFun (t6989586621680725721 Bool) All -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680726201Scrutinee_6989586621680725970Sym0 :: TyFun (t6989586621680725721 Bool) Any -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680717538Scrutinee_6989586621680717476Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680717511Scrutinee_6989586621680717474Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (AndSym0 :: TyFun (t6989586621680725642 Bool) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (DefaultEqSym0 :: TyFun k6989586621679802025 (k6989586621679802025 ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Eq Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ((==@#@$) :: TyFun a6989586621679802034 (a6989586621679802034 ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Eq Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ((/=@#@$) :: TyFun a6989586621679802034 (a6989586621679802034 ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Eq Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Bool_Sym0 :: TyFun a6989586621679793463 (a6989586621679793463 ~> (Bool ~> a6989586621679793463)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Bool Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679832857Sym0 :: TyFun a6989586621679832158 (a6989586621679832158 ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679832839Sym0 :: TyFun a6989586621679832158 (a6989586621679832158 ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679832817Sym0 :: TyFun a6989586621679832158 (a6989586621679832158 ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679832797Sym0 :: TyFun a6989586621679832158 (a6989586621679832158 ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679832885Scrutinee_6989586621679832228Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679832867Scrutinee_6989586621679832226Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679832764Scrutinee_6989586621679832198Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679832756Scrutinee_6989586621679832196Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ((>@#@$) :: TyFun a6989586621679832158 (a6989586621679832158 ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ((>=@#@$) :: TyFun a6989586621679832158 (a6989586621679832158 ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ((<@#@$) :: TyFun a6989586621679832158 (a6989586621679832158 ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ((<=@#@$) :: TyFun a6989586621679832158 (a6989586621679832158 ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Elem_6989586621680897085Sym0 :: TyFun a6989586621680725738 (Identity a6989586621680725738 ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Null_6989586621680897247Sym0 :: TyFun (Identity a6989586621680725736) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ListtakeWhileSym0 :: TyFun (a6989586621680578915 ~> Bool) ([a6989586621680578915] ~> [a6989586621680578915]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ListspanSym0 :: TyFun (a6989586621680578913 ~> Bool) ([a6989586621680578913] ~> ([a6989586621680578913], [a6989586621680578913])) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ListpartitionSym0 :: TyFun (a6989586621680578911 ~> Bool) ([a6989586621680578911] ~> ([a6989586621680578911], [a6989586621680578911])) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ListnubBySym0 :: TyFun (a6989586621680578903 ~> (a6989586621680578903 ~> Bool)) ([a6989586621680578903] ~> [a6989586621680578903]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ListfilterSym0 :: TyFun (a6989586621680578912 ~> Bool) ([a6989586621680578912] ~> [a6989586621680578912]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ListdropWhileSym0 :: TyFun (a6989586621680578914 ~> Bool) ([a6989586621680578914] ~> [a6989586621680578914]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (UnionBySym0 :: TyFun (a6989586621680316549 ~> (a6989586621680316549 ~> Bool)) ([a6989586621680316549] ~> ([a6989586621680316549] ~> [a6989586621680316549])) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TakeWhileSym0 :: TyFun (a6989586621680316576 ~> Bool) ([a6989586621680316576] ~> [a6989586621680316576]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (SpanSym0 :: TyFun (a6989586621680316573 ~> Bool) ([a6989586621680316573] ~> ([a6989586621680316573], [a6989586621680316573])) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (SelectSym0 :: TyFun (a6989586621680316559 ~> Bool) (a6989586621680316559 ~> (([a6989586621680316559], [a6989586621680316559]) ~> ([a6989586621680316559], [a6989586621680316559]))) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (PartitionSym0 :: TyFun (a6989586621680316560 ~> Bool) ([a6989586621680316560] ~> ([a6989586621680316560], [a6989586621680316560])) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (NubBySym0 :: TyFun (a6989586621680316551 ~> (a6989586621680316551 ~> Bool)) ([a6989586621680316551] ~> [a6989586621680316551]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680326034ZsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680326034YsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680326034X_6989586621680326035Sym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] ([k], [k]) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680325991ZsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680325991YsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680325991X_6989586621680325992Sym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] ([k], [k]) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (IntersectBySym0 :: TyFun (a6989586621680316577 ~> (a6989586621680316577 ~> Bool)) ([a6989586621680316577] ~> ([a6989586621680316577] ~> [a6989586621680316577])) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (GroupBySym0 :: TyFun (a6989586621680316563 ~> (a6989586621680316563 ~> Bool)) ([a6989586621680316563] ~> [[a6989586621680316563]]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FindSym0 :: TyFun (a6989586621680316583 ~> Bool) ([a6989586621680316583] ~> Maybe a6989586621680316583) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FindIndicesSym0 :: TyFun (a6989586621680316579 ~> Bool) ([a6989586621680316579] ~> [Nat]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FindIndexSym0 :: TyFun (a6989586621680316580 ~> Bool) ([a6989586621680316580] ~> Maybe Nat) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FilterSym0 :: TyFun (a6989586621680316584 ~> Bool) ([a6989586621680316584] ~> [a6989586621680316584]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Elem_bySym0 :: TyFun (a6989586621680316550 ~> (a6989586621680316550 ~> Bool)) (a6989586621680316550 ~> ([a6989586621680316550] ~> Bool)) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (DropWhileSym0 :: TyFun (a6989586621680316575 ~> Bool) ([a6989586621680316575] ~> [a6989586621680316575]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (DropWhileEndSym0 :: TyFun (a6989586621680316574 ~> Bool) ([a6989586621680316574] ~> [a6989586621680316574]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (DeleteFirstsBySym0 :: TyFun (a6989586621680316589 ~> (a6989586621680316589 ~> Bool)) ([a6989586621680316589] ~> ([a6989586621680316589] ~> [a6989586621680316589])) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (DeleteBySym0 :: TyFun (a6989586621680316590 ~> (a6989586621680316590 ~> Bool)) (a6989586621680316590 ~> ([a6989586621680316590] ~> [a6989586621680316590])) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (BreakSym0 :: TyFun (a6989586621680316572 ~> Bool) ([a6989586621680316572] ~> ([a6989586621680316572], [a6989586621680316572])) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (AnySym0 :: TyFun (a6989586621680316653 ~> Bool) ([a6989586621680316653] ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (AllSym0 :: TyFun (a6989586621680316654 ~> Bool) ([a6989586621680316654] ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (UntilSym0 :: TyFun (a6989586621679803796 ~> Bool) ((a6989586621679803796 ~> a6989586621679803796) ~> (a6989586621679803796 ~> a6989586621679803796)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Base Methods suppressUnusedWarnings :: () #
SingI x => SingI ((\|\|@#@$$) x :: TyFun Bool Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Bool Methods sing :: Sing ((\|\|@#@$$) x) #
SingI x => SingI ((&&@#@$$) x :: TyFun Bool Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Bool Methods sing :: Sing ((&&@#@$$) x) #
SingI x => SingI ((<=?@#@$$) x :: TyFun Nat Bool -> Type)
Instance details Defined in Data.Singletons.TypeLits.Internal Methods sing :: Sing ((<=?@#@$$) x) #
SAlternative f => SingI (GuardSym0 :: TyFun Bool (f ()) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods sing :: Sing GuardSym0 #
SApplicative f => SingI (WhenSym0 :: TyFun Bool (f () ~> f ()) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods sing :: Sing WhenSym0 #
SApplicative f => SingI (UnlessSym0 :: TyFun Bool (f () ~> f ()) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad Methods sing :: Sing UnlessSym0 #
SingI (ListnullSym0 :: TyFun [a] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods sing :: Sing ListnullSym0 #
SEq a => SingI (ListisPrefixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods sing :: Sing ListisPrefixOfSym0 #
SingI (NullSym0 :: TyFun [a] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing NullSym0 #
SEq a => SingI (IsSuffixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing IsSuffixOfSym0 #
SEq a => SingI (IsPrefixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing IsPrefixOfSym0 #
SEq a => SingI (IsInfixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing IsInfixOfSym0 #
SingI (IsNothingSym0 :: TyFun (Maybe a) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing IsNothingSym0 #
SingI (IsJustSym0 :: TyFun (Maybe a) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing IsJustSym0 #
SEq a => SingI (ListelemSym0 :: TyFun a ([a] ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods sing :: Sing ListelemSym0 #
SEq a => SingI (NotElemSym0 :: TyFun a ([a] ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing NotElemSym0 #
SEq a => SingI (ElemSym0 :: TyFun a ([a] ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing ElemSym0 #
SFoldable t => SingI (OrSym0 :: TyFun (t Bool) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods sing :: Sing OrSym0 #
SFoldable t => SingI (AndSym0 :: TyFun (t Bool) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods sing :: Sing AndSym0 #
SEq a => SingI ((==@#@$) :: TyFun a (a ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Eq Methods sing :: Sing (==@#@$) #
SEq a => SingI ((/=@#@$) :: TyFun a (a ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Eq Methods sing :: Sing (/=@#@$) #
SingI (Bool_Sym0 :: TyFun a (a ~> (Bool ~> a)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Bool Methods sing :: Sing Bool_Sym0 #
SOrd a => SingI ((>@#@$) :: TyFun a (a ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods sing :: Sing (>@#@$) #
SOrd a => SingI ((>=@#@$) :: TyFun a (a ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods sing :: Sing (>=@#@$) #
SOrd a => SingI ((<@#@$) :: TyFun a (a ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods sing :: Sing (<@#@$) #
SOrd a => SingI ((<=@#@$) :: TyFun a (a ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods sing :: Sing (<=@#@$) #
SingI (ListtakeWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods sing :: Sing ListtakeWhileSym0 #
SingI (ListspanSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods sing :: Sing ListspanSym0 #
SingI (ListpartitionSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods sing :: Sing ListpartitionSym0 #
SingI (ListnubBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> [a]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods sing :: Sing ListnubBySym0 #
SingI (ListfilterSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods sing :: Sing ListfilterSym0 #
SingI (ListdropWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods sing :: Sing ListdropWhileSym0 #
SingI (UnionBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> ([a] ~> [a])) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing UnionBySym0 #
SingI (TakeWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing TakeWhileSym0 #
SingI (SpanSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing SpanSym0 #
SingI (SelectSym0 :: TyFun (a ~> Bool) (a ~> (([a], [a]) ~> ([a], [a]))) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing SelectSym0 #
SingI (PartitionSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing PartitionSym0 #
SingI (NubBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> [a]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing NubBySym0 #
SingI (IntersectBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> ([a] ~> [a])) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing IntersectBySym0 #
SingI (GroupBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> [[a]]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing GroupBySym0 #
SingI (FindSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing FindSym0 #
SingI (FindIndicesSym0 :: TyFun (a ~> Bool) ([a] ~> [Nat]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing FindIndicesSym0 #
SingI (FindIndexSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe Nat) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing FindIndexSym0 #
SingI (FilterSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing FilterSym0 #
SingI (Elem_bySym0 :: TyFun (a ~> (a ~> Bool)) (a ~> ([a] ~> Bool)) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing Elem_bySym0 #
SingI (DropWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing DropWhileSym0 #
SingI (DropWhileEndSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing DropWhileEndSym0 #
SingI (DeleteFirstsBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> ([a] ~> [a])) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing DeleteFirstsBySym0 #
SingI (DeleteBySym0 :: TyFun (a ~> (a ~> Bool)) (a ~> ([a] ~> [a])) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing DeleteBySym0 #
SingI (BreakSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing BreakSym0 #
SingI (AnySym0 :: TyFun (a ~> Bool) ([a] ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing AnySym0 #
SingI (AllSym0 :: TyFun (a ~> Bool) ([a] ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing AllSym0 #
SingI (UntilSym0 :: TyFun (a ~> Bool) ((a ~> a) ~> (a ~> a)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Base Methods sing :: Sing UntilSym0 #
SuppressUnusedWarnings (ListisPrefixOfSym1 a6989586621680581945 :: TyFun [a6989586621680578909] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ListelemSym1 a6989586621680581880 :: TyFun [a6989586621680578897] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (NotElemSym1 a6989586621680326516 :: TyFun [a6989586621680316632] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (IsSuffixOfSym1 a6989586621680327141 :: TyFun [a6989586621680316635] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (IsPrefixOfSym1 a6989586621680326550 :: TyFun [a6989586621680316636] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (IsInfixOfSym1 a6989586621680326788 :: TyFun [a6989586621680316634] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ElemSym1 a6989586621680326523 :: TyFun [a6989586621680316633] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (AnySym1 a6989586621680326781 :: TyFun [a6989586621680316653] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (AllSym1 a6989586621680326836 :: TyFun [a6989586621680316654] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (IsRightSym0 :: TyFun (Either a6989586621679849241 b6989586621679849242) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Either Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (IsLeftSym0 :: TyFun (Either a6989586621679849244 b6989586621679849245) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Either Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680325863Scrutinee_6989586621680317251Sym0 :: TyFun k1 (TyFun k Bool -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Elem_bySym1 a6989586621680325808 :: TyFun a6989586621680316550 ([a6989586621680316550] ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (NotElemSym0 :: TyFun a6989586621680725632 (t6989586621680725631 a6989586621680725632 ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680717538Scrutinee_6989586621680717476Sym1 x6989586621680717531 :: TyFun k1 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680717511Scrutinee_6989586621680717474Sym1 x6989586621680717504 :: TyFun k1 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Elem_6989586621680727438Sym0 :: TyFun a6989586621680725738 (t6989586621680725721 a6989586621680725738 ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Elem_6989586621680727271Sym0 :: TyFun a6989586621680725738 (t6989586621680725721 a6989586621680725738 ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Elem_6989586621680727104Sym0 :: TyFun a6989586621680725738 (t6989586621680725721 a6989586621680725738 ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Elem_6989586621680726767Sym0 :: TyFun a6989586621680725738 (t6989586621680725721 a6989586621680725738 ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Elem_6989586621680726647Sym0 :: TyFun a6989586621680725738 (t6989586621680725721 a6989586621680725738 ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ElemSym0 :: TyFun a6989586621680725738 (t6989586621680725721 a6989586621680725738 ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (DefaultEqSym1 a6989586621679802026 :: TyFun k6989586621679802025 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Eq Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ((==@#@$$) x6989586621679802039 :: TyFun a6989586621679802034 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Eq Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ((/=@#@$$) x6989586621679802043 :: TyFun a6989586621679802034 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Eq Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Bool_Sym1 a6989586621679793487 :: TyFun a6989586621679793463 (Bool ~> a6989586621679793463) -> Type)
Instance details Defined in Data.Singletons.Prelude.Bool Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679832857Sym1 a6989586621679832855 :: TyFun a6989586621679832158 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679832839Sym1 a6989586621679832837 :: TyFun a6989586621679832158 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679832817Sym1 a6989586621679832815 :: TyFun a6989586621679832158 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679832797Sym1 a6989586621679832794 :: TyFun a6989586621679832158 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679832885Scrutinee_6989586621679832228Sym1 x6989586621679832883 :: TyFun k1 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679832867Scrutinee_6989586621679832226Sym1 x6989586621679832865 :: TyFun k1 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679832764Scrutinee_6989586621679832198Sym1 x6989586621679832754 :: TyFun k1 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679832756Scrutinee_6989586621679832196Sym1 x6989586621679832754 :: TyFun k1 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ((>@#@$$) arg6989586621679832731 :: TyFun a6989586621679832158 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ((>=@#@$$) arg6989586621679832736 :: TyFun a6989586621679832158 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ((<@#@$$) arg6989586621679832721 :: TyFun a6989586621679832158 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ((<=@#@$$) arg6989586621679832726 :: TyFun a6989586621679832158 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621681113237Sym0 :: TyFun (Arg a6989586621681106445 b6989586621681106446) (Arg a6989586621681106445 b6989586621681106446 ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Elem_6989586621680897085Sym1 a6989586621680897083 :: TyFun (Identity a6989586621680725738) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680326066ZsSym0 :: TyFun (k1 ~> (a6989586621680316573 ~> Bool)) (TyFun k1 (TyFun [a6989586621680316573] [a6989586621680316573] -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680326066YsSym0 :: TyFun (k1 ~> (a6989586621680316573 ~> Bool)) (TyFun k1 (TyFun [a6989586621680316573] [a6989586621680316573] -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680326066X_6989586621680326067Sym0 :: TyFun (k1 ~> (a6989586621680316573 ~> Bool)) (TyFun k1 (TyFun [a6989586621680316573] ([a6989586621680316573], [a6989586621680316573]) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680325824NubBy'Sym0 :: TyFun (k1 ~> (k1 ~> Bool)) (TyFun k (TyFun [k1] ([k1] ~> [k1]) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621680327157Sym0 :: TyFun (a6989586621680316670 ~> Bool) (TyFun k (TyFun a6989586621680316670 (TyFun [a6989586621680316670] [a6989586621680316670] -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680726191Scrutinee_6989586621680725972Sym0 :: TyFun (a6989586621680725724 ~> Bool) (TyFun (t6989586621680725721 a6989586621680725724) Any -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680726178Scrutinee_6989586621680725974Sym0 :: TyFun (a6989586621680725724 ~> Bool) (TyFun (t6989586621680725721 a6989586621680725724) All -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680726093Scrutinee_6989586621680725980Sym0 :: TyFun (a6989586621680725724 ~> Bool) (TyFun (t6989586621680725721 a6989586621680725724) (First a6989586621680725724) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621680726094Sym0 :: TyFun (a6989586621679070391 ~> Bool) (TyFun k (TyFun a6989586621679070391 (First a6989586621679070391) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FindSym0 :: TyFun (a6989586621680725630 ~> Bool) (t6989586621680725629 a6989586621680725630 ~> Maybe a6989586621680725630) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (AnySym0 :: TyFun (a6989586621680725640 ~> Bool) (t6989586621680725639 a6989586621680725640 ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (AllSym0 :: TyFun (a6989586621680725638 ~> Bool) (t6989586621680725637 a6989586621680725638 ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679804366GoSym0 :: TyFun (k2 ~> Bool) (TyFun (k2 ~> k2) (TyFun k1 (TyFun k2 k2 -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Base Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (MfilterSym0 :: TyFun (a6989586621681071227 ~> Bool) (m6989586621681071226 a6989586621681071227 ~> m6989586621681071226 a6989586621681071227) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FilterMSym0 :: TyFun (a6989586621681071270 ~> m6989586621681071269 Bool) ([a6989586621681071270] ~> m6989586621681071269 [a6989586621681071270]) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () #
(SEq a, SingI d) => SingI (ListisPrefixOfSym1 d :: TyFun [a] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods sing :: Sing (ListisPrefixOfSym1 d) #
(SEq a, SingI d) => SingI (ListelemSym1 d :: TyFun [a] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods sing :: Sing (ListelemSym1 d) #
(SEq a, SingI d) => SingI (NotElemSym1 d :: TyFun [a] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing (NotElemSym1 d) #
(SEq a, SingI d) => SingI (IsSuffixOfSym1 d :: TyFun [a] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing (IsSuffixOfSym1 d) #
(SEq a, SingI d) => SingI (IsPrefixOfSym1 d :: TyFun [a] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing (IsPrefixOfSym1 d) #
(SEq a, SingI d) => SingI (IsInfixOfSym1 d :: TyFun [a] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing (IsInfixOfSym1 d) #
(SEq a, SingI d) => SingI (ElemSym1 d :: TyFun [a] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing (ElemSym1 d) #
SingI d => SingI (AnySym1 d :: TyFun [a] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing (AnySym1 d) #
SingI d => SingI (AllSym1 d :: TyFun [a] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing (AllSym1 d) #
SingI (IsRightSym0 :: TyFun (Either a b) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Either Methods sing :: Sing IsRightSym0 #
SingI (IsLeftSym0 :: TyFun (Either a b) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Either Methods sing :: Sing IsLeftSym0 #
SingI d => SingI (Elem_bySym1 d :: TyFun a ([a] ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing (Elem_bySym1 d) #
(SFoldable t, SEq a) => SingI (NotElemSym0 :: TyFun a (t a ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods sing :: Sing NotElemSym0 #
(SFoldable t, SEq a) => SingI (ElemSym0 :: TyFun a (t a ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods sing :: Sing ElemSym0 #
(SEq a, SingI x) => SingI ((==@#@$$) x :: TyFun a Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Eq Methods sing :: Sing ((==@#@$$) x) #
(SEq a, SingI x) => SingI ((/=@#@$$) x :: TyFun a Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Eq Methods sing :: Sing ((/=@#@$$) x) #
SingI d => SingI (Bool_Sym1 d :: TyFun a (Bool ~> a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Bool Methods sing :: Sing (Bool_Sym1 d) #
(SOrd a, SingI d) => SingI ((>@#@$$) d :: TyFun a Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods sing :: Sing ((>@#@$$) d) #
(SOrd a, SingI d) => SingI ((>=@#@$$) d :: TyFun a Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods sing :: Sing ((>=@#@$$) d) #
(SOrd a, SingI d) => SingI ((<@#@$$) d :: TyFun a Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods sing :: Sing ((<@#@$$) d) #
(SOrd a, SingI d) => SingI ((<=@#@$$) d :: TyFun a Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods sing :: Sing ((<=@#@$$) d) #
SFoldable t => SingI (FindSym0 :: TyFun (a ~> Bool) (t a ~> Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods sing :: Sing FindSym0 #
SFoldable t => SingI (AnySym0 :: TyFun (a ~> Bool) (t a ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods sing :: Sing AnySym0 #
SFoldable t => SingI (AllSym0 :: TyFun (a ~> Bool) (t a ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods sing :: Sing AllSym0 #
SMonadPlus m => SingI (MfilterSym0 :: TyFun (a ~> Bool) (m a ~> m a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad Methods sing :: Sing MfilterSym0 #
SApplicative m => SingI (FilterMSym0 :: TyFun (a ~> m Bool) ([a] ~> m [a]) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad Methods sing :: Sing FilterMSym0 #
SuppressUnusedWarnings (Bool_Sym2 a6989586621679793488 a6989586621679793487 :: TyFun Bool a6989586621679793463 -> Type)
Instance details Defined in Data.Singletons.Prelude.Bool Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Elem_bySym2 a6989586621680325809 a6989586621680325808 :: TyFun [a6989586621680316550] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680326542Scrutinee_6989586621680317255Sym0 :: TyFun k1 (TyFun k3 (TyFun k2 (TyFun [k3] Bool -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680325960Scrutinee_6989586621680317235Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680325946Scrutinee_6989586621680317237Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680325931Scrutinee_6989586621680317247Sym0 :: TyFun k1 (TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680325863Scrutinee_6989586621680317251Sym1 n6989586621680325861 :: TyFun k Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680325850Scrutinee_6989586621680317253Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Null_6989586621680727561Sym0 :: TyFun (t6989586621680725721 a6989586621680725736) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Null_6989586621680727394Sym0 :: TyFun (t6989586621680725721 a6989586621680725736) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Null_6989586621680727227Sym0 :: TyFun (t6989586621680725721 a6989586621680725736) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Null_6989586621680727081Sym0 :: TyFun (t6989586621680725721 a6989586621680725736) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Null_6989586621680726905Sym0 :: TyFun (t6989586621680725721 a6989586621680725736) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Null_6989586621680726610Sym0 :: TyFun (t6989586621680725721 a6989586621680725736) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (NullSym0 :: TyFun (t6989586621680725721 a6989586621680725736) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (NotElemSym1 a6989586621680726114 t6989586621680725631 :: TyFun (t6989586621680725631 a6989586621680725632) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621680726597Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Elem_6989586621680727438Sym1 a6989586621680727436 t6989586621680725721 :: TyFun (t6989586621680725721 a6989586621680725738) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Elem_6989586621680727271Sym1 a6989586621680727269 t6989586621680725721 :: TyFun (t6989586621680725721 a6989586621680725738) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Elem_6989586621680727104Sym1 a6989586621680727102 t6989586621680725721 :: TyFun (t6989586621680725721 a6989586621680725738) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Elem_6989586621680726767Sym1 a6989586621680726765 t6989586621680725721 :: TyFun (t6989586621680725721 a6989586621680725738) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Elem_6989586621680726647Sym1 a6989586621680726645 t6989586621680725721 :: TyFun (t6989586621680725721 a6989586621680725738) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ElemSym1 arg6989586621680726388 t6989586621680725721 :: TyFun (t6989586621680725721 a6989586621680725738) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (AnySym1 a6989586621680726185 t6989586621680725639 :: TyFun (t6989586621680725639 a6989586621680725640) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (AllSym1 a6989586621680726172 t6989586621680725637 :: TyFun (t6989586621680725637 a6989586621680725638) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621681076997Sym0 :: TyFun k1 (TyFun k3 (TyFun k2 (TyFun Bool (TyFun [k3] [k3] -> Type) -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621681113237Sym1 a6989586621681113235 :: TyFun (Arg a6989586621681106445 b6989586621681106446) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680327161Scrutinee_6989586621680317229Sym0 :: TyFun (k1 ~> Bool) (TyFun k1 (TyFun [a6989586621680316670] (TyFun k Bool -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680325834Scrutinee_6989586621680317257Sym0 :: TyFun (k3 ~> (k3 ~> Bool)) (TyFun k1 (TyFun k3 (TyFun k2 (TyFun [k3] Bool -> Type) -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621681076994Sym0 :: TyFun (k3 ~> f6989586621679943777 Bool) (TyFun k2 (TyFun k3 (TyFun (f6989586621679943777 [k3]) (f6989586621679943777 [k3]) -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621681076633Sym0 :: TyFun (k1 ~> Bool) (TyFun k (TyFun k1 (m6989586621679943814 k1) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () #
(SingI d1, SingI d2) => SingI (Bool_Sym2 d1 d2 :: TyFun Bool a -> Type)
Instance details Defined in Data.Singletons.Prelude.Bool Methods sing :: Sing (Bool_Sym2 d1 d2) #
(SingI d1, SingI d2) => SingI (Elem_bySym2 d1 d2 :: TyFun [a] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing (Elem_bySym2 d1 d2) #
SFoldable t => SingI (NullSym0 :: TyFun (t a) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods sing :: Sing NullSym0 #
(SFoldable t, SEq a, SingI d) => SingI (NotElemSym1 d t :: TyFun (t a) Bool -> Type)
Instance details 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)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods sing :: Sing (ElemSym1 d t) #
(SFoldable t, SingI d) => SingI (AnySym1 d t :: TyFun (t a) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods sing :: Sing (AnySym1 d t) #
(SFoldable t, SingI d) => SingI (AllSym1 d t :: TyFun (t a) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods sing :: Sing (AllSym1 d t) #
SuppressUnusedWarnings (Let6989586621680327161Scrutinee_6989586621680317229Sym1 p6989586621680327155 :: TyFun k1 (TyFun [a6989586621680316670] (TyFun k Bool -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680326542Scrutinee_6989586621680317255Sym1 l6989586621680326532 :: TyFun k2 (TyFun k1 (TyFun [k2] Bool -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680325960Scrutinee_6989586621680317235Sym1 n6989586621680325957 :: TyFun k1 (TyFun k2 Bool -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680325946Scrutinee_6989586621680317237Sym1 n6989586621680325943 :: TyFun k1 (TyFun k2 Bool -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680325931Scrutinee_6989586621680317247Sym1 key6989586621680325927 :: TyFun k3 (TyFun k1 (TyFun k2 Bool -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680325850Scrutinee_6989586621680317253Sym1 x6989586621680325847 :: TyFun k1 (TyFun k2 Bool -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680325834Scrutinee_6989586621680317257Sym1 eq6989586621680325822 :: TyFun k1 (TyFun k3 (TyFun k2 (TyFun [k3] Bool -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621680726597Sym1 a_69895866216807265926989586621680726596 :: TyFun k1 (TyFun k2 Bool -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680050077Scrutinee_6989586621680048419Sym0 :: TyFun k1 (TyFun k2 (TyFun k2 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621681076997Sym1 p6989586621681076989 :: TyFun k2 (TyFun k1 (TyFun Bool (TyFun [k2] [k2] -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680327161Scrutinee_6989586621680317229Sym2 x6989586621680327159 p6989586621680327155 :: TyFun [a6989586621680316670] (TyFun k Bool -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680326542Scrutinee_6989586621680317255Sym2 x6989586621680326539 l6989586621680326532 :: TyFun k1 (TyFun [k2] Bool -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680325960Scrutinee_6989586621680317235Sym2 x6989586621680325958 n6989586621680325957 :: TyFun k1 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680325946Scrutinee_6989586621680317237Sym2 x6989586621680325944 n6989586621680325943 :: TyFun k1 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680325931Scrutinee_6989586621680317247Sym2 x6989586621680325928 key6989586621680325927 :: TyFun k1 (TyFun k2 Bool -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680325850Scrutinee_6989586621680317253Sym2 xs6989586621680325848 x6989586621680325847 :: TyFun k1 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680325834Scrutinee_6989586621680317257Sym2 l6989586621680325823 eq6989586621680325822 :: TyFun k3 (TyFun k1 (TyFun [k3] Bool -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621680726597Sym2 t6989586621680726604 a_69895866216807265926989586621680726596 :: TyFun k1 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680050077Scrutinee_6989586621680048419Sym1 x06989586621680050062 :: TyFun k1 (TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680049943Scrutinee_6989586621680048446Sym0 :: TyFun k2 (TyFun k1 (TyFun k2 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680049828Scrutinee_6989586621680048459Sym0 :: TyFun k2 (TyFun k1 (TyFun k2 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621681076997Sym2 x6989586621681076996 p6989586621681076989 :: TyFun k1 (TyFun Bool (TyFun [k2] [k2] -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621680326816Sym0 :: TyFun (b6989586621679943818 ~> (a6989586621680316653 ~> Bool)) (TyFun k1 (TyFun k2 (TyFun a6989586621680316653 (TyFun [a6989586621680316653] (TyFun b6989586621679943818 (m6989586621679943814 b6989586621679943818) -> Type) -> Type) -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621681076997Sym3 a_69895866216810769866989586621681076992 x6989586621681076996 p6989586621681076989 :: TyFun Bool (TyFun [k2] [k2] -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680326542Scrutinee_6989586621680317255Sym3 xs6989586621680326540 x6989586621680326539 l6989586621680326532 :: TyFun [k2] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680327161Scrutinee_6989586621680317229Sym3 xs6989586621680327160 x6989586621680327159 p6989586621680327155 :: TyFun k Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680325931Scrutinee_6989586621680317247Sym3 y6989586621680325929 x6989586621680325928 key6989586621680325927 :: TyFun k1 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680325834Scrutinee_6989586621680317257Sym3 y6989586621680325831 l6989586621680325823 eq6989586621680325822 :: TyFun k1 (TyFun [k3] Bool -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680050077Scrutinee_6989586621680048419Sym2 y6989586621680050063 x06989586621680050062 :: TyFun k3 (TyFun k1 (TyFun k2 Bool -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680049943Scrutinee_6989586621680048446Sym1 x16989586621680049938 :: TyFun k1 (TyFun k5 (TyFun k2 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680049828Scrutinee_6989586621680048459Sym1 x16989586621680049821 :: TyFun k1 (TyFun k5 (TyFun k2 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680325834Scrutinee_6989586621680317257Sym4 ys6989586621680325832 y6989586621680325831 l6989586621680325823 eq6989586621680325822 :: TyFun [k3] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680050077Scrutinee_6989586621680048419Sym3 x6989586621680050076 y6989586621680050063 x06989586621680050062 :: TyFun k1 (TyFun k2 Bool -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680049943Scrutinee_6989586621680048446Sym2 x26989586621680049939 x16989586621680049938 :: TyFun k5 (TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680049828Scrutinee_6989586621680048459Sym2 x26989586621680049823 x16989586621680049821 :: TyFun k5 (TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680050077Scrutinee_6989586621680048419Sym4 arg_69895866216800484156989586621680050056 x6989586621680050076 y6989586621680050063 x06989586621680050062 :: TyFun k1 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680049943Scrutinee_6989586621680048446Sym3 y6989586621680049940 x26989586621680049939 x16989586621680049938 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680049828Scrutinee_6989586621680048459Sym3 y6989586621680049825 x26989586621680049823 x16989586621680049821 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680049943Scrutinee_6989586621680048446Sym4 arg_69895866216800484376989586621680049923 y6989586621680049940 x26989586621680049939 x16989586621680049938 :: TyFun k1 (TyFun k2 Bool -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680049828Scrutinee_6989586621680048459Sym4 arg_69895866216800484526989586621680049809 y6989586621680049825 x26989586621680049823 x16989586621680049821 :: TyFun k1 (TyFun k2 Bool -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680049943Scrutinee_6989586621680048446Sym5 arg_69895866216800484406989586621680049924 arg_69895866216800484376989586621680049923 y6989586621680049940 x26989586621680049939 x16989586621680049938 :: TyFun k1 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680049828Scrutinee_6989586621680048459Sym5 arg_69895866216800484556989586621680049810 arg_69895866216800484526989586621680049809 y6989586621680049825 x26989586621680049823 x16989586621680049821 :: TyFun k1 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () #
type Rep Bool	Since: base-4.6.0.0
Instance details Defined in GHC.Generics type Rep Bool = D1 (MetaData "Bool" "GHC.Types" "ghc-prim" False) (C1 (MetaCons "False" PrefixI False) (U1 :: Type -> Type) :+: C1 (MetaCons "True" PrefixI False) (U1 :: Type -> Type))
data Sing (a :: Bool)
Instance details Defined in GHC.Generics data Sing (a :: Bool) where STrue :: forall (a :: Bool). Sing True SFalse :: forall (a :: Bool). Sing False
type DemoteRep Bool
Instance details Defined in GHC.Generics type DemoteRep Bool = Bool
newtype Vector Bool
Instance details Defined in Data.Vector.Unboxed.Base newtype Vector Bool = V_Bool (Vector Word8)
type MaxBound
Instance details Defined in Data.Singletons.Prelude.Enum type MaxBound = MaxBound_6989586621680038790Sym0
type MinBound
Instance details Defined in Data.Singletons.Prelude.Enum type MinBound = MinBound_6989586621680038773Sym0
data Sing (a :: Bool)
Instance details Defined in Data.Singletons.Prelude.Instances data Sing (a :: Bool) where SFalse :: forall (a :: Bool). Sing False STrue :: forall (a :: Bool). Sing True
type Demote Bool
Instance details Defined in Data.Singletons.Prelude.Instances type Demote Bool = Bool
type Show_ (arg :: Bool)
Instance details Defined in Data.Singletons.Prelude.Show type Show_ (arg :: Bool) = Apply (Show__6989586621680581388Sym0 :: TyFun Bool Symbol -> Type) arg
type FromEnum (a :: Bool)
Instance details Defined in Data.Singletons.Prelude.Enum type FromEnum (a :: Bool) = Apply FromEnum_6989586621680096094Sym0 a
type ToEnum a
Instance details Defined in Data.Singletons.Prelude.Enum type ToEnum a = Apply ToEnum_6989586621680096083Sym0 a
type Pred (arg :: Bool)
Instance details Defined in Data.Singletons.Prelude.Enum type Pred (arg :: Bool) = Apply (Pred_6989586621680050178Sym0 :: TyFun Bool Bool -> Type) arg
type Succ (arg :: Bool)
Instance details Defined in Data.Singletons.Prelude.Enum type Succ (arg :: Bool) = Apply (Succ_6989586621680050160Sym0 :: TyFun Bool Bool -> Type) arg
newtype MVector s Bool
Instance details Defined in Data.Vector.Unboxed.Base newtype MVector s Bool = MV_Bool (MVector s Word8)
type ShowList (arg1 :: [Bool]) arg2
Instance details Defined in Data.Singletons.Prelude.Show type ShowList (arg1 :: [Bool]) arg2 = Apply (Apply (ShowList_6989586621680581399Sym0 :: TyFun [Bool] (Symbol ~> Symbol) -> Type) arg1) arg2
type EnumFromTo (arg1 :: Bool) (arg2 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Enum type EnumFromTo (arg1 :: Bool) (arg2 :: Bool) = Apply (Apply (EnumFromTo_6989586621680050202Sym0 :: TyFun Bool (Bool ~> [Bool]) -> Type) arg1) arg2
type Min (arg1 :: Bool) (arg2 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Ord type Min (arg1 :: Bool) (arg2 :: Bool) = Apply (Apply (Min_6989586621679832893Sym0 :: TyFun Bool (Bool ~> Bool) -> Type) arg1) arg2
type Max (arg1 :: Bool) (arg2 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Ord type Max (arg1 :: Bool) (arg2 :: Bool) = Apply (Apply (Max_6989586621679832875Sym0 :: TyFun Bool (Bool ~> Bool) -> Type) arg1) arg2
type (arg1 :: Bool) >= (arg2 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Ord type (arg1 :: Bool) >= (arg2 :: Bool) = Apply (Apply (TFHelper_6989586621679832857Sym0 :: TyFun Bool (Bool ~> Bool) -> Type) arg1) arg2
type (arg1 :: Bool) > (arg2 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Ord type (arg1 :: Bool) > (arg2 :: Bool) = Apply (Apply (TFHelper_6989586621679832839Sym0 :: TyFun Bool (Bool ~> Bool) -> Type) arg1) arg2
type (arg1 :: Bool) <= (arg2 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Ord type (arg1 :: Bool) <= (arg2 :: Bool) = Apply (Apply (TFHelper_6989586621679832817Sym0 :: TyFun Bool (Bool ~> Bool) -> Type) arg1) arg2
type (arg1 :: Bool) < (arg2 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Ord type (arg1 :: Bool) < (arg2 :: Bool) = Apply (Apply (TFHelper_6989586621679832797Sym0 :: TyFun Bool (Bool ~> Bool) -> Type) arg1) arg2
type Compare (a1 :: Bool) (a2 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Ord type Compare (a1 :: Bool) (a2 :: Bool) = Apply (Apply Compare_6989586621679858858Sym0 a1) a2
type (x :: Bool) /= (y :: Bool)
Instance details Defined in Data.Singletons.Prelude.Eq type (x :: Bool) /= (y :: Bool) = Not (x == y)
type (a :: Bool) == (b :: Bool)
Instance details Defined in Data.Singletons.Prelude.Eq type (a :: Bool) == (b :: Bool) = Equals_6989586621679804338 a b
type ShowsPrec a1 (a2 :: Bool) a3
Instance details Defined in Data.Singletons.Prelude.Show type ShowsPrec a1 (a2 :: Bool) a3 = Apply (Apply (Apply ShowsPrec_6989586621680611339Sym0 a1) a2) a3
type EnumFromThenTo (arg1 :: Bool) (arg2 :: Bool) (arg3 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Enum type EnumFromThenTo (arg1 :: Bool) (arg2 :: Bool) (arg3 :: Bool) = Apply (Apply (Apply (EnumFromThenTo_6989586621680050226Sym0 :: TyFun Bool (Bool ~> (Bool ~> [Bool])) -> Type) arg1) arg2) arg3
type Apply NotSym0 (a6989586621679796444 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Bool type Apply NotSym0 (a6989586621679796444 :: Bool) = Not a6989586621679796444
type Apply ToEnum_6989586621680096083Sym0 (a6989586621680096082 :: Nat)
Instance details Defined in Data.Singletons.Prelude.Enum type Apply ToEnum_6989586621680096083Sym0 (a6989586621680096082 :: Nat) = ToEnum_6989586621680096083 a6989586621680096082
type Apply GetAnySym0 (a6989586621680204544 :: Any)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply GetAnySym0 (a6989586621680204544 :: Any) = GetAny a6989586621680204544
type Apply GetAllSym0 (a6989586621680204526 :: All)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply GetAllSym0 (a6989586621680204526 :: All) = GetAll a6989586621680204526
type Apply FromEnum_6989586621680096094Sym0 (a6989586621680096093 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Enum type Apply FromEnum_6989586621680096094Sym0 (a6989586621680096093 :: Bool) = FromEnum_6989586621680096094 a6989586621680096093
type Apply Any_Sym0 (a6989586621680242088 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply Any_Sym0 (a6989586621680242088 :: Bool) = Any_ a6989586621680242088
type Apply AnySym0 (t6989586621680204547 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply AnySym0 (t6989586621680204547 :: Bool) = Any t6989586621680204547
type Apply All_Sym0 (a6989586621680242089 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply All_Sym0 (a6989586621680242089 :: Bool) = All_ a6989586621680242089
type Apply AllSym0 (t6989586621680204529 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply AllSym0 (t6989586621680204529 :: Bool) = All t6989586621680204529
type Apply ((\|\|@#@$$) a6989586621679795656 :: TyFun Bool Bool -> Type) (b6989586621679795657 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Bool type Apply ((\|\|@#@$$) a6989586621679795656 :: TyFun Bool Bool -> Type) (b6989586621679795657 :: Bool) = a6989586621679795656 \|\| b6989586621679795657
type Apply ((&&@#@$$) a6989586621679795039 :: TyFun Bool Bool -> Type) (b6989586621679795040 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Bool type Apply ((&&@#@$$) a6989586621679795039 :: TyFun Bool Bool -> Type) (b6989586621679795040 :: Bool) = a6989586621679795039 && b6989586621679795040
type Apply ((<=?@#@$$) a3530822107858468865 :: TyFun Nat Bool -> Type) (b3530822107858468866 :: Nat)
Instance details Defined in Data.Singletons.TypeLits.Internal type Apply ((<=?@#@$$) a3530822107858468865 :: TyFun Nat Bool -> Type) (b3530822107858468866 :: Nat) = a3530822107858468865 <=? b3530822107858468866
type Apply (Let6989586621679476227Scrutinee_6989586621679461448Sym0 :: TyFun k1 Bool -> Type) (n6989586621679476226 :: k1) Source #
Instance details Defined in Termonad.Config.Vec type Apply (Let6989586621679476227Scrutinee_6989586621679461448Sym0 :: TyFun k1 Bool -> Type) (n6989586621679476226 :: k1) = Let6989586621679476227Scrutinee_6989586621679461448 n6989586621679476226
type Apply (Let6989586621679476231Scrutinee_6989586621679461450Sym0 :: TyFun k1 Bool -> Type) (n6989586621679476226 :: k1) Source #
Instance details Defined in Termonad.Config.Vec type Apply (Let6989586621679476231Scrutinee_6989586621679461450Sym0 :: TyFun k1 Bool -> Type) (n6989586621679476226 :: k1) = Let6989586621679476231Scrutinee_6989586621679461450 n6989586621679476226
type Apply (Compare_6989586621679858858Sym1 a6989586621679858856 :: TyFun Bool Ordering -> Type) (a6989586621679858857 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Compare_6989586621679858858Sym1 a6989586621679858856 :: TyFun Bool Ordering -> Type) (a6989586621679858857 :: Bool) = Compare_6989586621679858858 a6989586621679858856 a6989586621679858857
type Apply (TFHelper_6989586621679832797Sym1 a6989586621679832794 :: TyFun a Bool -> Type) (a6989586621679832796 :: a)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (TFHelper_6989586621679832797Sym1 a6989586621679832794 :: TyFun a Bool -> Type) (a6989586621679832796 :: a) = TFHelper_6989586621679832797 a6989586621679832794 a6989586621679832796
type Apply (Let6989586621680717511Scrutinee_6989586621680717474Sym1 x6989586621680717504 :: TyFun k1 Bool -> Type) (y6989586621680717505 :: k1)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680717511Scrutinee_6989586621680717474Sym1 x6989586621680717504 :: TyFun k1 Bool -> Type) (y6989586621680717505 :: k1) = Let6989586621680717511Scrutinee_6989586621680717474 x6989586621680717504 y6989586621680717505
type Apply (Let6989586621680717538Scrutinee_6989586621680717476Sym1 x6989586621680717531 :: TyFun k1 Bool -> Type) (y6989586621680717532 :: k1)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680717538Scrutinee_6989586621680717476Sym1 x6989586621680717531 :: TyFun k1 Bool -> Type) (y6989586621680717532 :: k1) = Let6989586621680717538Scrutinee_6989586621680717476 x6989586621680717531 y6989586621680717532
type Apply ((==@#@$$) x6989586621679802039 :: TyFun a Bool -> Type) (y6989586621679802040 :: a)
Instance details Defined in Data.Singletons.Prelude.Eq type Apply ((==@#@$$) x6989586621679802039 :: TyFun a Bool -> Type) (y6989586621679802040 :: a) = x6989586621679802039 == y6989586621679802040
type Apply ((/=@#@$$) x6989586621679802043 :: TyFun a Bool -> Type) (y6989586621679802046 :: a)
Instance details Defined in Data.Singletons.Prelude.Eq type Apply ((/=@#@$$) x6989586621679802043 :: TyFun a Bool -> Type) (y6989586621679802046 :: a) = x6989586621679802043 /= y6989586621679802046
type Apply (DefaultEqSym1 a6989586621679802026 :: TyFun k Bool -> Type) (b6989586621679802027 :: k)
Instance details Defined in Data.Singletons.Prelude.Eq type Apply (DefaultEqSym1 a6989586621679802026 :: TyFun k Bool -> Type) (b6989586621679802027 :: k) = DefaultEq a6989586621679802026 b6989586621679802027
type Apply (Let6989586621679832756Scrutinee_6989586621679832196Sym1 x6989586621679832754 :: TyFun k1 Bool -> Type) (y6989586621679832755 :: k1)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Let6989586621679832756Scrutinee_6989586621679832196Sym1 x6989586621679832754 :: TyFun k1 Bool -> Type) (y6989586621679832755 :: k1) = Let6989586621679832756Scrutinee_6989586621679832196 x6989586621679832754 y6989586621679832755
type Apply (TFHelper_6989586621679832857Sym1 a6989586621679832855 :: TyFun a Bool -> Type) (a6989586621679832856 :: a)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (TFHelper_6989586621679832857Sym1 a6989586621679832855 :: TyFun a Bool -> Type) (a6989586621679832856 :: a) = TFHelper_6989586621679832857 a6989586621679832855 a6989586621679832856
type Apply (TFHelper_6989586621679832839Sym1 a6989586621679832837 :: TyFun a Bool -> Type) (a6989586621679832838 :: a)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (TFHelper_6989586621679832839Sym1 a6989586621679832837 :: TyFun a Bool -> Type) (a6989586621679832838 :: a) = TFHelper_6989586621679832839 a6989586621679832837 a6989586621679832838
type Apply (TFHelper_6989586621679832817Sym1 a6989586621679832815 :: TyFun a Bool -> Type) (a6989586621679832816 :: a)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (TFHelper_6989586621679832817Sym1 a6989586621679832815 :: TyFun a Bool -> Type) (a6989586621679832816 :: a) = TFHelper_6989586621679832817 a6989586621679832815 a6989586621679832816
type Apply ((<=@#@$$) arg6989586621679832726 :: TyFun a Bool -> Type) (arg6989586621679832727 :: a)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply ((<=@#@$$) arg6989586621679832726 :: TyFun a Bool -> Type) (arg6989586621679832727 :: a) = arg6989586621679832726 <= arg6989586621679832727
type Apply ((>=@#@$$) arg6989586621679832736 :: TyFun a Bool -> Type) (arg6989586621679832737 :: a)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply ((>=@#@$$) arg6989586621679832736 :: TyFun a Bool -> Type) (arg6989586621679832737 :: a) = arg6989586621679832736 >= arg6989586621679832737
type Apply ((>@#@$$) arg6989586621679832731 :: TyFun a Bool -> Type) (arg6989586621679832732 :: a)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply ((>@#@$$) arg6989586621679832731 :: TyFun a Bool -> Type) (arg6989586621679832732 :: a) = arg6989586621679832731 > arg6989586621679832732
type Apply (Let6989586621679832885Scrutinee_6989586621679832228Sym1 x6989586621679832883 :: TyFun k1 Bool -> Type) (y6989586621679832884 :: k1)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Let6989586621679832885Scrutinee_6989586621679832228Sym1 x6989586621679832883 :: TyFun k1 Bool -> Type) (y6989586621679832884 :: k1) = Let6989586621679832885Scrutinee_6989586621679832228 x6989586621679832883 y6989586621679832884
type Apply (Let6989586621679832867Scrutinee_6989586621679832226Sym1 x6989586621679832865 :: TyFun k1 Bool -> Type) (y6989586621679832866 :: k1)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Let6989586621679832867Scrutinee_6989586621679832226Sym1 x6989586621679832865 :: TyFun k1 Bool -> Type) (y6989586621679832866 :: k1) = Let6989586621679832867Scrutinee_6989586621679832226 x6989586621679832865 y6989586621679832866
type Apply (Let6989586621679832764Scrutinee_6989586621679832198Sym1 x6989586621679832754 :: TyFun k1 Bool -> Type) (y6989586621679832755 :: k1)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Let6989586621679832764Scrutinee_6989586621679832198Sym1 x6989586621679832754 :: TyFun k1 Bool -> Type) (y6989586621679832755 :: k1) = Let6989586621679832764Scrutinee_6989586621679832198 x6989586621679832754 y6989586621679832755
type Apply ((<@#@$$) arg6989586621679832721 :: TyFun a Bool -> Type) (arg6989586621679832722 :: a)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply ((<@#@$$) arg6989586621679832721 :: TyFun a Bool -> Type) (arg6989586621679832722 :: a) = arg6989586621679832721 < arg6989586621679832722
type Apply (Let6989586621680325863Scrutinee_6989586621680317251Sym1 n6989586621680325861 :: TyFun k Bool -> Type) (x6989586621680325862 :: k)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680325863Scrutinee_6989586621680317251Sym1 n6989586621680325861 :: TyFun k Bool -> Type) (x6989586621680325862 :: k) = Let6989586621680325863Scrutinee_6989586621680317251 n6989586621680325861 x6989586621680325862
type Apply (Bool_Sym2 a6989586621679793488 a6989586621679793487 :: TyFun Bool a -> Type) (a6989586621679793489 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Bool type Apply (Bool_Sym2 a6989586621679793488 a6989586621679793487 :: TyFun Bool a -> Type) (a6989586621679793489 :: Bool) = Bool_ a6989586621679793488 a6989586621679793487 a6989586621679793489
type Apply (Let6989586621680325850Scrutinee_6989586621680317253Sym2 xs6989586621680325848 x6989586621680325847 :: TyFun k3 Bool -> Type) (n6989586621680325849 :: k3)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680325850Scrutinee_6989586621680317253Sym2 xs6989586621680325848 x6989586621680325847 :: TyFun k3 Bool -> Type) (n6989586621680325849 :: k3) = Let6989586621680325850Scrutinee_6989586621680317253 xs6989586621680325848 x6989586621680325847 n6989586621680325849
type Apply (Let6989586621680325946Scrutinee_6989586621680317237Sym2 x6989586621680325944 n6989586621680325943 :: TyFun k3 Bool -> Type) (xs6989586621680325945 :: k3)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680325946Scrutinee_6989586621680317237Sym2 x6989586621680325944 n6989586621680325943 :: TyFun k3 Bool -> Type) (xs6989586621680325945 :: k3) = Let6989586621680325946Scrutinee_6989586621680317237 x6989586621680325944 n6989586621680325943 xs6989586621680325945
type Apply (Let6989586621680325960Scrutinee_6989586621680317235Sym2 x6989586621680325958 n6989586621680325957 :: TyFun k3 Bool -> Type) (xs6989586621680325959 :: k3)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680325960Scrutinee_6989586621680317235Sym2 x6989586621680325958 n6989586621680325957 :: TyFun k3 Bool -> Type) (xs6989586621680325959 :: k3) = Let6989586621680325960Scrutinee_6989586621680317235 x6989586621680325958 n6989586621680325957 xs6989586621680325959
type Apply (Lambda_6989586621680726597Sym2 t6989586621680726604 a_69895866216807265926989586621680726596 :: TyFun k3 Bool -> Type) (t6989586621680726605 :: k3)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Lambda_6989586621680726597Sym2 t6989586621680726604 a_69895866216807265926989586621680726596 :: TyFun k3 Bool -> Type) (t6989586621680726605 :: k3) = Lambda_6989586621680726597 t6989586621680726604 a_69895866216807265926989586621680726596 t6989586621680726605
type Apply (Let6989586621680325931Scrutinee_6989586621680317247Sym3 y6989586621680325929 x6989586621680325928 key6989586621680325927 :: TyFun k3 Bool -> Type) (xys6989586621680325930 :: k3)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680325931Scrutinee_6989586621680317247Sym3 y6989586621680325929 x6989586621680325928 key6989586621680325927 :: TyFun k3 Bool -> Type) (xys6989586621680325930 :: k3) = Let6989586621680325931Scrutinee_6989586621680317247 y6989586621680325929 x6989586621680325928 key6989586621680325927 xys6989586621680325930
type Apply (Let6989586621680327161Scrutinee_6989586621680317229Sym3 xs6989586621680327160 x6989586621680327159 p6989586621680327155 :: TyFun k Bool -> Type) (a_69895866216803271536989586621680327156 :: k)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680327161Scrutinee_6989586621680317229Sym3 xs6989586621680327160 x6989586621680327159 p6989586621680327155 :: TyFun k Bool -> Type) (a_69895866216803271536989586621680327156 :: k) = Let6989586621680327161Scrutinee_6989586621680317229 xs6989586621680327160 x6989586621680327159 p6989586621680327155 a_69895866216803271536989586621680327156
type Apply (Let6989586621680050077Scrutinee_6989586621680048419Sym4 arg_69895866216800484156989586621680050056 x6989586621680050076 y6989586621680050063 x06989586621680050062 :: TyFun k4 Bool -> Type) (arg_69895866216800484176989586621680050057 :: k4)
Instance details Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680050077Scrutinee_6989586621680048419Sym4 arg_69895866216800484156989586621680050056 x6989586621680050076 y6989586621680050063 x06989586621680050062 :: TyFun k4 Bool -> Type) (arg_69895866216800484176989586621680050057 :: k4) = Let6989586621680050077Scrutinee_6989586621680048419 arg_69895866216800484156989586621680050056 x6989586621680050076 y6989586621680050063 x06989586621680050062 arg_69895866216800484176989586621680050057
type Apply (Let6989586621680049828Scrutinee_6989586621680048459Sym5 arg_69895866216800484556989586621680049810 arg_69895866216800484526989586621680049809 y6989586621680049825 x26989586621680049823 x16989586621680049821 :: TyFun k5 Bool -> Type) (arg_69895866216800484576989586621680049811 :: k5)
Instance details Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680049828Scrutinee_6989586621680048459Sym5 arg_69895866216800484556989586621680049810 arg_69895866216800484526989586621680049809 y6989586621680049825 x26989586621680049823 x16989586621680049821 :: TyFun k5 Bool -> Type) (arg_69895866216800484576989586621680049811 :: k5) = Let6989586621680049828Scrutinee_6989586621680048459 arg_69895866216800484556989586621680049810 arg_69895866216800484526989586621680049809 y6989586621680049825 x26989586621680049823 x16989586621680049821 arg_69895866216800484576989586621680049811
type Apply (Let6989586621680049943Scrutinee_6989586621680048446Sym5 arg_69895866216800484406989586621680049924 arg_69895866216800484376989586621680049923 y6989586621680049940 x26989586621680049939 x16989586621680049938 :: TyFun k5 Bool -> Type) (arg_69895866216800484436989586621680049926 :: k5)
Instance details Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680049943Scrutinee_6989586621680048446Sym5 arg_69895866216800484406989586621680049924 arg_69895866216800484376989586621680049923 y6989586621680049940 x26989586621680049939 x16989586621680049938 :: TyFun k5 Bool -> Type) (arg_69895866216800484436989586621680049926 :: k5) = Let6989586621680049943Scrutinee_6989586621680048446 arg_69895866216800484406989586621680049924 arg_69895866216800484376989586621680049923 y6989586621680049940 x26989586621680049939 x16989586621680049938 arg_69895866216800484436989586621680049926
type Apply OrSym0 (a6989586621680326843 :: [Bool])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply OrSym0 (a6989586621680326843 :: [Bool]) = Or a6989586621680326843
type Apply AndSym0 (a6989586621680326847 :: [Bool])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply AndSym0 (a6989586621680326847 :: [Bool]) = And a6989586621680326847
type Apply (ListnullSym0 :: TyFun [a] Bool -> Type) (a6989586621680581797 :: [a])
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation type Apply (ListnullSym0 :: TyFun [a] Bool -> Type) (a6989586621680581797 :: [a]) = Listnull a6989586621680581797
type Apply (NullSym0 :: TyFun [a] Bool -> Type) (a6989586621680327147 :: [a])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (NullSym0 :: TyFun [a] Bool -> Type) (a6989586621680327147 :: [a]) = Null a6989586621680327147
type Apply (IsNothingSym0 :: TyFun (Maybe a) Bool -> Type) (a6989586621680040910 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Maybe type Apply (IsNothingSym0 :: TyFun (Maybe a) Bool -> Type) (a6989586621680040910 :: Maybe a) = IsNothing a6989586621680040910
type Apply (IsJustSym0 :: TyFun (Maybe a) Bool -> Type) (a6989586621680040920 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Maybe type Apply (IsJustSym0 :: TyFun (Maybe a) Bool -> Type) (a6989586621680040920 :: Maybe a) = IsJust a6989586621680040920
type Apply (AndSym0 :: TyFun (t Bool) Bool -> Type) (a6989586621680726207 :: t Bool)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (AndSym0 :: TyFun (t Bool) Bool -> Type) (a6989586621680726207 :: t Bool) = And a6989586621680726207
type Apply (OrSym0 :: TyFun (t Bool) Bool -> Type) (a6989586621680726198 :: t Bool)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (OrSym0 :: TyFun (t Bool) Bool -> Type) (a6989586621680726198 :: t Bool) = Or a6989586621680726198
type Apply (Null_6989586621680897247Sym0 :: TyFun (Identity a) Bool -> Type) (a6989586621680897246 :: Identity a)
Instance details Defined in Data.Singletons.Prelude.Identity type Apply (Null_6989586621680897247Sym0 :: TyFun (Identity a) Bool -> Type) (a6989586621680897246 :: Identity a) = Null_6989586621680897247 a6989586621680897246
type Apply (Let6989586621680726201Scrutinee_6989586621680725970Sym0 :: TyFun (t6989586621680725721 Bool) Any -> Type) (x6989586621680726200 :: t6989586621680725721 Bool)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680726201Scrutinee_6989586621680725970Sym0 :: TyFun (t6989586621680725721 Bool) Any -> Type) (x6989586621680726200 :: t6989586621680725721 Bool) = Let6989586621680726201Scrutinee_6989586621680725970 x6989586621680726200
type Apply (Let6989586621680726210Scrutinee_6989586621680725968Sym0 :: TyFun (t6989586621680725721 Bool) All -> Type) (x6989586621680726209 :: t6989586621680725721 Bool)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680726210Scrutinee_6989586621680725968Sym0 :: TyFun (t6989586621680725721 Bool) All -> Type) (x6989586621680726209 :: t6989586621680725721 Bool) = Let6989586621680726210Scrutinee_6989586621680725968 x6989586621680726209
type Apply (ListelemSym1 a6989586621680581880 :: TyFun [a] Bool -> Type) (a6989586621680581881 :: [a])
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation type Apply (ListelemSym1 a6989586621680581880 :: TyFun [a] Bool -> Type) (a6989586621680581881 :: [a]) = Listelem a6989586621680581880 a6989586621680581881
type Apply (ListisPrefixOfSym1 a6989586621680581945 :: TyFun [a] Bool -> Type) (a6989586621680581947 :: [a])
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation type Apply (ListisPrefixOfSym1 a6989586621680581945 :: TyFun [a] Bool -> Type) (a6989586621680581947 :: [a]) = ListisPrefixOf a6989586621680581945 a6989586621680581947
type Apply (NotElemSym1 a6989586621680326516 :: TyFun [a] Bool -> Type) (a6989586621680326517 :: [a])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (NotElemSym1 a6989586621680326516 :: TyFun [a] Bool -> Type) (a6989586621680326517 :: [a]) = NotElem a6989586621680326516 a6989586621680326517
type Apply (ElemSym1 a6989586621680326523 :: TyFun [a] Bool -> Type) (a6989586621680326524 :: [a])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (ElemSym1 a6989586621680326523 :: TyFun [a] Bool -> Type) (a6989586621680326524 :: [a]) = Elem a6989586621680326523 a6989586621680326524
type Apply (IsPrefixOfSym1 a6989586621680326550 :: TyFun [a] Bool -> Type) (a6989586621680326551 :: [a])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (IsPrefixOfSym1 a6989586621680326550 :: TyFun [a] Bool -> Type) (a6989586621680326551 :: [a]) = IsPrefixOf a6989586621680326550 a6989586621680326551
type Apply (AnySym1 a6989586621680326781 :: TyFun [a] Bool -> Type) (a6989586621680326782 :: [a])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (AnySym1 a6989586621680326781 :: TyFun [a] Bool -> Type) (a6989586621680326782 :: [a]) = Any a6989586621680326781 a6989586621680326782
type Apply (IsInfixOfSym1 a6989586621680326788 :: TyFun [a] Bool -> Type) (a6989586621680326789 :: [a])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (IsInfixOfSym1 a6989586621680326788 :: TyFun [a] Bool -> Type) (a6989586621680326789 :: [a]) = IsInfixOf a6989586621680326788 a6989586621680326789
type Apply (AllSym1 a6989586621680326836 :: TyFun [a] Bool -> Type) (a6989586621680326837 :: [a])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (AllSym1 a6989586621680326836 :: TyFun [a] Bool -> Type) (a6989586621680326837 :: [a]) = All a6989586621680326836 a6989586621680326837
type Apply (IsSuffixOfSym1 a6989586621680327141 :: TyFun [a] Bool -> Type) (a6989586621680327142 :: [a])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (IsSuffixOfSym1 a6989586621680327141 :: TyFun [a] Bool -> Type) (a6989586621680327142 :: [a]) = IsSuffixOf a6989586621680327141 a6989586621680327142
type Apply (Elem_6989586621680897085Sym1 a6989586621680897083 :: TyFun (Identity a) Bool -> Type) (a6989586621680897084 :: Identity a)
Instance details Defined in Data.Singletons.Prelude.Identity type Apply (Elem_6989586621680897085Sym1 a6989586621680897083 :: TyFun (Identity a) Bool -> Type) (a6989586621680897084 :: Identity a) = Elem_6989586621680897085 a6989586621680897083 a6989586621680897084
type Apply (Elem_bySym2 a6989586621680325809 a6989586621680325808 :: TyFun [a] Bool -> Type) (a6989586621680325810 :: [a])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Elem_bySym2 a6989586621680325809 a6989586621680325808 :: TyFun [a] Bool -> Type) (a6989586621680325810 :: [a]) = Elem_by a6989586621680325809 a6989586621680325808 a6989586621680325810
type Apply (Elem_6989586621680726647Sym1 a6989586621680726645 t :: TyFun (t a) Bool -> Type) (a6989586621680726646 :: t a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Elem_6989586621680726647Sym1 a6989586621680726645 t :: TyFun (t a) Bool -> Type) (a6989586621680726646 :: t a) = Elem_6989586621680726647 a6989586621680726645 a6989586621680726646
type Apply (Null_6989586621680726610Sym0 :: TyFun (t a) Bool -> Type) (a6989586621680726609 :: t a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Null_6989586621680726610Sym0 :: TyFun (t a) Bool -> Type) (a6989586621680726609 :: t a) = Null_6989586621680726610 a6989586621680726609
type Apply (AnySym1 a6989586621680726185 t :: TyFun (t a) Bool -> Type) (a6989586621680726186 :: t a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (AnySym1 a6989586621680726185 t :: TyFun (t a) Bool -> Type) (a6989586621680726186 :: t a) = Any a6989586621680726185 a6989586621680726186
type Apply (ElemSym1 arg6989586621680726388 t :: TyFun (t a) Bool -> Type) (arg6989586621680726389 :: t a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (ElemSym1 arg6989586621680726388 t :: TyFun (t a) Bool -> Type) (arg6989586621680726389 :: t a) = Elem arg6989586621680726388 arg6989586621680726389
type Apply (NotElemSym1 a6989586621680726114 t :: TyFun (t a) Bool -> Type) (a6989586621680726115 :: t a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (NotElemSym1 a6989586621680726114 t :: TyFun (t a) Bool -> Type) (a6989586621680726115 :: t a) = NotElem a6989586621680726114 a6989586621680726115
type Apply (NullSym0 :: TyFun (t a) Bool -> Type) (arg6989586621680726384 :: t a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (NullSym0 :: TyFun (t a) Bool -> Type) (arg6989586621680726384 :: t a) = Null arg6989586621680726384
type Apply (AllSym1 a6989586621680726172 t :: TyFun (t a) Bool -> Type) (a6989586621680726173 :: t a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (AllSym1 a6989586621680726172 t :: TyFun (t a) Bool -> Type) (a6989586621680726173 :: t a) = All a6989586621680726172 a6989586621680726173
type Apply (Elem_6989586621680726767Sym1 a6989586621680726765 t :: TyFun (t a) Bool -> Type) (a6989586621680726766 :: t a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Elem_6989586621680726767Sym1 a6989586621680726765 t :: TyFun (t a) Bool -> Type) (a6989586621680726766 :: t a) = Elem_6989586621680726767 a6989586621680726765 a6989586621680726766
type Apply (Null_6989586621680726905Sym0 :: TyFun (t a) Bool -> Type) (a6989586621680726904 :: t a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Null_6989586621680726905Sym0 :: TyFun (t a) Bool -> Type) (a6989586621680726904 :: t a) = Null_6989586621680726905 a6989586621680726904
type Apply (Null_6989586621680727081Sym0 :: TyFun (t a) Bool -> Type) (a6989586621680727080 :: t a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Null_6989586621680727081Sym0 :: TyFun (t a) Bool -> Type) (a6989586621680727080 :: t a) = Null_6989586621680727081 a6989586621680727080
type Apply (Elem_6989586621680727104Sym1 a6989586621680727102 t :: TyFun (t a) Bool -> Type) (a6989586621680727103 :: t a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Elem_6989586621680727104Sym1 a6989586621680727102 t :: TyFun (t a) Bool -> Type) (a6989586621680727103 :: t a) = Elem_6989586621680727104 a6989586621680727102 a6989586621680727103
type Apply (Null_6989586621680727227Sym0 :: TyFun (t a) Bool -> Type) (a6989586621680727226 :: t a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Null_6989586621680727227Sym0 :: TyFun (t a) Bool -> Type) (a6989586621680727226 :: t a) = Null_6989586621680727227 a6989586621680727226
type Apply (Elem_6989586621680727271Sym1 a6989586621680727269 t :: TyFun (t a) Bool -> Type) (a6989586621680727270 :: t a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Elem_6989586621680727271Sym1 a6989586621680727269 t :: TyFun (t a) Bool -> Type) (a6989586621680727270 :: t a) = Elem_6989586621680727271 a6989586621680727269 a6989586621680727270
type Apply (Null_6989586621680727394Sym0 :: TyFun (t a) Bool -> Type) (a6989586621680727393 :: t a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Null_6989586621680727394Sym0 :: TyFun (t a) Bool -> Type) (a6989586621680727393 :: t a) = Null_6989586621680727394 a6989586621680727393
type Apply (Elem_6989586621680727438Sym1 a6989586621680727436 t :: TyFun (t a) Bool -> Type) (a6989586621680727437 :: t a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Elem_6989586621680727438Sym1 a6989586621680727436 t :: TyFun (t a) Bool -> Type) (a6989586621680727437 :: t a) = Elem_6989586621680727438 a6989586621680727436 a6989586621680727437
type Apply (Null_6989586621680727561Sym0 :: TyFun (t a) Bool -> Type) (a6989586621680727560 :: t a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Null_6989586621680727561Sym0 :: TyFun (t a) Bool -> Type) (a6989586621680727560 :: t a) = Null_6989586621680727561 a6989586621680727560
type Apply (Let6989586621680326542Scrutinee_6989586621680317255Sym3 xs6989586621680326540 x6989586621680326539 l6989586621680326532 :: TyFun [k1] Bool -> Type) (ls6989586621680326541 :: [k1])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680326542Scrutinee_6989586621680317255Sym3 xs6989586621680326540 x6989586621680326539 l6989586621680326532 :: TyFun [k1] Bool -> Type) (ls6989586621680326541 :: [k1]) = Let6989586621680326542Scrutinee_6989586621680317255 xs6989586621680326540 x6989586621680326539 l6989586621680326532 ls6989586621680326541
type Apply (Let6989586621680325834Scrutinee_6989586621680317257Sym4 ys6989586621680325832 y6989586621680325831 l6989586621680325823 eq6989586621680325822 :: TyFun [k2] Bool -> Type) (xs6989586621680325833 :: [k2])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680325834Scrutinee_6989586621680317257Sym4 ys6989586621680325832 y6989586621680325831 l6989586621680325823 eq6989586621680325822 :: TyFun [k2] Bool -> Type) (xs6989586621680325833 :: [k2]) = Let6989586621680325834Scrutinee_6989586621680317257 ys6989586621680325832 y6989586621680325831 l6989586621680325823 eq6989586621680325822 xs6989586621680325833
type Apply (IsRightSym0 :: TyFun (Either a b) Bool -> Type) (a6989586621679850561 :: Either a b)
Instance details Defined in Data.Singletons.Prelude.Either type Apply (IsRightSym0 :: TyFun (Either a b) Bool -> Type) (a6989586621679850561 :: Either a b) = IsRight a6989586621679850561
type Apply (IsLeftSym0 :: TyFun (Either a b) Bool -> Type) (a6989586621679850564 :: Either a b)
Instance details Defined in Data.Singletons.Prelude.Either type Apply (IsLeftSym0 :: TyFun (Either a b) Bool -> Type) (a6989586621679850564 :: Either a b) = IsLeft a6989586621679850564
type Apply (TFHelper_6989586621681113237Sym1 a6989586621681113235 :: TyFun (Arg a b) Bool -> Type) (a6989586621681113236 :: Arg a b)
Instance details Defined in Data.Singletons.Prelude.Semigroup type Apply (TFHelper_6989586621681113237Sym1 a6989586621681113235 :: TyFun (Arg a b) Bool -> Type) (a6989586621681113236 :: Arg a b) = TFHelper_6989586621681113237 a6989586621681113235 a6989586621681113236
type Apply (GuardSym0 :: TyFun Bool (f6989586621679943678 ()) -> Type) (a6989586621679945126 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (GuardSym0 :: TyFun Bool (f6989586621679943678 ()) -> Type) (a6989586621679945126 :: Bool) = (Guard a6989586621679945126 :: f6989586621679943678 ())
type Apply (\|\|@#@$) (a6989586621679795656 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Bool type Apply (\|\|@#@$) (a6989586621679795656 :: Bool) = (\|\|@#@$$) a6989586621679795656
type Apply (&&@#@$) (a6989586621679795039 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Bool type Apply (&&@#@$) (a6989586621679795039 :: Bool) = (&&@#@$$) a6989586621679795039
type Apply Compare_6989586621679858858Sym0 (a6989586621679858856 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply Compare_6989586621679858858Sym0 (a6989586621679858856 :: Bool) = Compare_6989586621679858858Sym1 a6989586621679858856
type Apply ShowsPrec_6989586621680611339Sym0 (a6989586621680611336 :: Nat)
Instance details Defined in Data.Singletons.Prelude.Show type Apply ShowsPrec_6989586621680611339Sym0 (a6989586621680611336 :: Nat) = ShowsPrec_6989586621680611339Sym1 a6989586621680611336
type Apply (<=?@#@$) (a3530822107858468865 :: Nat)
Instance details Defined in Data.Singletons.TypeLits.Internal type Apply (<=?@#@$) (a3530822107858468865 :: Nat) = (<=?@#@$$) a3530822107858468865
type Apply ShowParenSym0 (a6989586621680581242 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Show type Apply ShowParenSym0 (a6989586621680581242 :: Bool) = ShowParenSym1 a6989586621680581242
type Apply (Let6989586621680717511Scrutinee_6989586621680717474Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621680717504 :: k1)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680717511Scrutinee_6989586621680717474Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621680717504 :: k1) = Let6989586621680717511Scrutinee_6989586621680717474Sym1 x6989586621680717504
type Apply (Let6989586621680717538Scrutinee_6989586621680717476Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621680717531 :: k1)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680717538Scrutinee_6989586621680717476Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621680717531 :: k1) = Let6989586621680717538Scrutinee_6989586621680717476Sym1 x6989586621680717531
type Apply (Let6989586621679832756Scrutinee_6989586621679832196Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621679832754 :: k1)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Let6989586621679832756Scrutinee_6989586621679832196Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621679832754 :: k1) = Let6989586621679832756Scrutinee_6989586621679832196Sym1 x6989586621679832754
type Apply (Let6989586621679832885Scrutinee_6989586621679832228Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621679832883 :: k1)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Let6989586621679832885Scrutinee_6989586621679832228Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621679832883 :: k1) = Let6989586621679832885Scrutinee_6989586621679832228Sym1 x6989586621679832883
type Apply (Let6989586621679832867Scrutinee_6989586621679832226Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621679832865 :: k1)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Let6989586621679832867Scrutinee_6989586621679832226Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621679832865 :: k1) = Let6989586621679832867Scrutinee_6989586621679832226Sym1 x6989586621679832865
type Apply (Let6989586621679832764Scrutinee_6989586621679832198Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621679832754 :: k1)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Let6989586621679832764Scrutinee_6989586621679832198Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621679832754 :: k1) = Let6989586621679832764Scrutinee_6989586621679832198Sym1 x6989586621679832754
type Apply (ListelemSym0 :: TyFun a6989586621680578897 ([a6989586621680578897] ~> Bool) -> Type) (a6989586621680581880 :: a6989586621680578897)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation type Apply (ListelemSym0 :: TyFun a6989586621680578897 ([a6989586621680578897] ~> Bool) -> Type) (a6989586621680581880 :: a6989586621680578897) = ListelemSym1 a6989586621680581880
type Apply (NotElemSym0 :: TyFun a6989586621680316632 ([a6989586621680316632] ~> Bool) -> Type) (a6989586621680326516 :: a6989586621680316632)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (NotElemSym0 :: TyFun a6989586621680316632 ([a6989586621680316632] ~> Bool) -> Type) (a6989586621680326516 :: a6989586621680316632) = NotElemSym1 a6989586621680326516
type Apply (ElemSym0 :: TyFun a6989586621680316633 ([a6989586621680316633] ~> Bool) -> Type) (a6989586621680326523 :: a6989586621680316633)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (ElemSym0 :: TyFun a6989586621680316633 ([a6989586621680316633] ~> Bool) -> Type) (a6989586621680326523 :: a6989586621680316633) = ElemSym1 a6989586621680326523
type Apply (ShowsPrec_6989586621680611339Sym1 a6989586621680611336 :: TyFun Bool (Symbol ~> Symbol) -> Type) (a6989586621680611337 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Show type Apply (ShowsPrec_6989586621680611339Sym1 a6989586621680611336 :: TyFun Bool (Symbol ~> Symbol) -> Type) (a6989586621680611337 :: Bool) = ShowsPrec_6989586621680611339Sym2 a6989586621680611336 a6989586621680611337
type Apply (TFHelper_6989586621679832797Sym0 :: TyFun a6989586621679832158 (a6989586621679832158 ~> Bool) -> Type) (a6989586621679832794 :: a6989586621679832158)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (TFHelper_6989586621679832797Sym0 :: TyFun a6989586621679832158 (a6989586621679832158 ~> Bool) -> Type) (a6989586621679832794 :: a6989586621679832158) = TFHelper_6989586621679832797Sym1 a6989586621679832794
type Apply ((==@#@$) :: TyFun a6989586621679802034 (a6989586621679802034 ~> Bool) -> Type) (x6989586621679802039 :: a6989586621679802034)
Instance details Defined in Data.Singletons.Prelude.Eq type Apply ((==@#@$) :: TyFun a6989586621679802034 (a6989586621679802034 ~> Bool) -> Type) (x6989586621679802039 :: a6989586621679802034) = (==@#@$$) x6989586621679802039
type Apply ((/=@#@$) :: TyFun a6989586621679802034 (a6989586621679802034 ~> Bool) -> Type) (x6989586621679802043 :: a6989586621679802034)
Instance details Defined in Data.Singletons.Prelude.Eq type Apply ((/=@#@$) :: TyFun a6989586621679802034 (a6989586621679802034 ~> Bool) -> Type) (x6989586621679802043 :: a6989586621679802034) = (/=@#@$$) x6989586621679802043
type Apply (DefaultEqSym0 :: TyFun k6989586621679802025 (k6989586621679802025 ~> Bool) -> Type) (a6989586621679802026 :: k6989586621679802025)
Instance details Defined in Data.Singletons.Prelude.Eq type Apply (DefaultEqSym0 :: TyFun k6989586621679802025 (k6989586621679802025 ~> Bool) -> Type) (a6989586621679802026 :: k6989586621679802025) = DefaultEqSym1 a6989586621679802026
type Apply (Bool_Sym0 :: TyFun a6989586621679793463 (a6989586621679793463 ~> (Bool ~> a6989586621679793463)) -> Type) (a6989586621679793487 :: a6989586621679793463)
Instance details Defined in Data.Singletons.Prelude.Bool type Apply (Bool_Sym0 :: TyFun a6989586621679793463 (a6989586621679793463 ~> (Bool ~> a6989586621679793463)) -> Type) (a6989586621679793487 :: a6989586621679793463) = Bool_Sym1 a6989586621679793487
type Apply (WhenSym0 :: TyFun Bool (f6989586621679943711 () ~> f6989586621679943711 ()) -> Type) (a6989586621679945374 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (WhenSym0 :: TyFun Bool (f6989586621679943711 () ~> f6989586621679943711 ()) -> Type) (a6989586621679945374 :: Bool) = (WhenSym1 a6989586621679945374 f6989586621679943711 :: TyFun (f6989586621679943711 ()) (f6989586621679943711 ()) -> Type)
type Apply (TFHelper_6989586621679832857Sym0 :: TyFun a6989586621679832158 (a6989586621679832158 ~> Bool) -> Type) (a6989586621679832855 :: a6989586621679832158)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (TFHelper_6989586621679832857Sym0 :: TyFun a6989586621679832158 (a6989586621679832158 ~> Bool) -> Type) (a6989586621679832855 :: a6989586621679832158) = TFHelper_6989586621679832857Sym1 a6989586621679832855
type Apply (TFHelper_6989586621679832839Sym0 :: TyFun a6989586621679832158 (a6989586621679832158 ~> Bool) -> Type) (a6989586621679832837 :: a6989586621679832158)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (TFHelper_6989586621679832839Sym0 :: TyFun a6989586621679832158 (a6989586621679832158 ~> Bool) -> Type) (a6989586621679832837 :: a6989586621679832158) = TFHelper_6989586621679832839Sym1 a6989586621679832837
type Apply (TFHelper_6989586621679832817Sym0 :: TyFun a6989586621679832158 (a6989586621679832158 ~> Bool) -> Type) (a6989586621679832815 :: a6989586621679832158)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (TFHelper_6989586621679832817Sym0 :: TyFun a6989586621679832158 (a6989586621679832158 ~> Bool) -> Type) (a6989586621679832815 :: a6989586621679832158) = TFHelper_6989586621679832817Sym1 a6989586621679832815
type Apply ((<=@#@$) :: TyFun a6989586621679832158 (a6989586621679832158 ~> Bool) -> Type) (arg6989586621679832726 :: a6989586621679832158)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply ((<=@#@$) :: TyFun a6989586621679832158 (a6989586621679832158 ~> Bool) -> Type) (arg6989586621679832726 :: a6989586621679832158) = (<=@#@$$) arg6989586621679832726
type Apply ((>=@#@$) :: TyFun a6989586621679832158 (a6989586621679832158 ~> Bool) -> Type) (arg6989586621679832736 :: a6989586621679832158)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply ((>=@#@$) :: TyFun a6989586621679832158 (a6989586621679832158 ~> Bool) -> Type) (arg6989586621679832736 :: a6989586621679832158) = (>=@#@$$) arg6989586621679832736
type Apply ((>@#@$) :: TyFun a6989586621679832158 (a6989586621679832158 ~> Bool) -> Type) (arg6989586621679832731 :: a6989586621679832158)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply ((>@#@$) :: TyFun a6989586621679832158 (a6989586621679832158 ~> Bool) -> Type) (arg6989586621679832731 :: a6989586621679832158) = (>@#@$$) arg6989586621679832731
type Apply ((<@#@$) :: TyFun a6989586621679832158 (a6989586621679832158 ~> Bool) -> Type) (arg6989586621679832721 :: a6989586621679832158)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply ((<@#@$) :: TyFun a6989586621679832158 (a6989586621679832158 ~> Bool) -> Type) (arg6989586621679832721 :: a6989586621679832158) = (<@#@$$) arg6989586621679832721
type Apply (UnlessSym0 :: TyFun Bool (f6989586621681071232 () ~> f6989586621681071232 ()) -> Type) (a6989586621681076736 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Monad type Apply (UnlessSym0 :: TyFun Bool (f6989586621681071232 () ~> f6989586621681071232 ()) -> Type) (a6989586621681076736 :: Bool) = (UnlessSym1 a6989586621681076736 f6989586621681071232 :: TyFun (f6989586621681071232 ()) (f6989586621681071232 ()) -> Type)
type Apply (Elem_6989586621680897085Sym0 :: TyFun a6989586621680725738 (Identity a6989586621680725738 ~> Bool) -> Type) (a6989586621680897083 :: a6989586621680725738)
Instance details Defined in Data.Singletons.Prelude.Identity type Apply (Elem_6989586621680897085Sym0 :: TyFun a6989586621680725738 (Identity a6989586621680725738 ~> Bool) -> Type) (a6989586621680897083 :: a6989586621680725738) = Elem_6989586621680897085Sym1 a6989586621680897083
type Apply (Let6989586621680325863Scrutinee_6989586621680317251Sym0 :: TyFun k1 (TyFun k Bool -> Type) -> Type) (n6989586621680325861 :: k1)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680325863Scrutinee_6989586621680317251Sym0 :: TyFun k1 (TyFun k Bool -> Type) -> Type) (n6989586621680325861 :: k1) = (Let6989586621680325863Scrutinee_6989586621680317251Sym1 n6989586621680325861 :: TyFun k Bool -> Type)
type Apply (Bool_Sym1 a6989586621679793487 :: TyFun a6989586621679793463 (Bool ~> a6989586621679793463) -> Type) (a6989586621679793488 :: a6989586621679793463)
Instance details Defined in Data.Singletons.Prelude.Bool type Apply (Bool_Sym1 a6989586621679793487 :: TyFun a6989586621679793463 (Bool ~> a6989586621679793463) -> Type) (a6989586621679793488 :: a6989586621679793463) = Bool_Sym2 a6989586621679793487 a6989586621679793488
type Apply (Elem_bySym1 a6989586621680325808 :: TyFun a6989586621680316550 ([a6989586621680316550] ~> Bool) -> Type) (a6989586621680325809 :: a6989586621680316550)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Elem_bySym1 a6989586621680325808 :: TyFun a6989586621680316550 ([a6989586621680316550] ~> Bool) -> Type) (a6989586621680325809 :: a6989586621680316550) = Elem_bySym2 a6989586621680325808 a6989586621680325809
type Apply (Elem_6989586621680726647Sym0 :: TyFun a6989586621680725738 (t6989586621680725721 a6989586621680725738 ~> Bool) -> Type) (a6989586621680726645 :: a6989586621680725738)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Elem_6989586621680726647Sym0 :: TyFun a6989586621680725738 (t6989586621680725721 a6989586621680725738 ~> Bool) -> Type) (a6989586621680726645 :: a6989586621680725738) = (Elem_6989586621680726647Sym1 a6989586621680726645 t6989586621680725721 :: TyFun (t6989586621680725721 a6989586621680725738) Bool -> Type)
type Apply (ElemSym0 :: TyFun a6989586621680725738 (t6989586621680725721 a6989586621680725738 ~> Bool) -> Type) (arg6989586621680726388 :: a6989586621680725738)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (ElemSym0 :: TyFun a6989586621680725738 (t6989586621680725721 a6989586621680725738 ~> Bool) -> Type) (arg6989586621680726388 :: a6989586621680725738) = (ElemSym1 arg6989586621680726388 t6989586621680725721 :: TyFun (t6989586621680725721 a6989586621680725738) Bool -> Type)
type Apply (NotElemSym0 :: TyFun a6989586621680725632 (t6989586621680725631 a6989586621680725632 ~> Bool) -> Type) (a6989586621680726114 :: a6989586621680725632)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (NotElemSym0 :: TyFun a6989586621680725632 (t6989586621680725631 a6989586621680725632 ~> Bool) -> Type) (a6989586621680726114 :: a6989586621680725632) = (NotElemSym1 a6989586621680726114 t6989586621680725631 :: TyFun (t6989586621680725631 a6989586621680725632) Bool -> Type)
type Apply (Elem_6989586621680726767Sym0 :: TyFun a6989586621680725738 (t6989586621680725721 a6989586621680725738 ~> Bool) -> Type) (a6989586621680726765 :: a6989586621680725738)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Elem_6989586621680726767Sym0 :: TyFun a6989586621680725738 (t6989586621680725721 a6989586621680725738 ~> Bool) -> Type) (a6989586621680726765 :: a6989586621680725738) = (Elem_6989586621680726767Sym1 a6989586621680726765 t6989586621680725721 :: TyFun (t6989586621680725721 a6989586621680725738) Bool -> Type)
type Apply (Elem_6989586621680727104Sym0 :: TyFun a6989586621680725738 (t6989586621680725721 a6989586621680725738 ~> Bool) -> Type) (a6989586621680727102 :: a6989586621680725738)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Elem_6989586621680727104Sym0 :: TyFun a6989586621680725738 (t6989586621680725721 a6989586621680725738 ~> Bool) -> Type) (a6989586621680727102 :: a6989586621680725738) = (Elem_6989586621680727104Sym1 a6989586621680727102 t6989586621680725721 :: TyFun (t6989586621680725721 a6989586621680725738) Bool -> Type)
type Apply (Elem_6989586621680727271Sym0 :: TyFun a6989586621680725738 (t6989586621680725721 a6989586621680725738 ~> Bool) -> Type) (a6989586621680727269 :: a6989586621680725738)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Elem_6989586621680727271Sym0 :: TyFun a6989586621680725738 (t6989586621680725721 a6989586621680725738 ~> Bool) -> Type) (a6989586621680727269 :: a6989586621680725738) = (Elem_6989586621680727271Sym1 a6989586621680727269 t6989586621680725721 :: TyFun (t6989586621680725721 a6989586621680725738) Bool -> Type)
type Apply (Elem_6989586621680727438Sym0 :: TyFun a6989586621680725738 (t6989586621680725721 a6989586621680725738 ~> Bool) -> Type) (a6989586621680727436 :: a6989586621680725738)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Elem_6989586621680727438Sym0 :: TyFun a6989586621680725738 (t6989586621680725721 a6989586621680725738 ~> Bool) -> Type) (a6989586621680727436 :: a6989586621680725738) = (Elem_6989586621680727438Sym1 a6989586621680727436 t6989586621680725721 :: TyFun (t6989586621680725721 a6989586621680725738) Bool -> Type)
type Apply (Let6989586621680325850Scrutinee_6989586621680317253Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) (x6989586621680325847 :: k1)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680325850Scrutinee_6989586621680317253Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) (x6989586621680325847 :: k1) = (Let6989586621680325850Scrutinee_6989586621680317253Sym1 x6989586621680325847 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type)
type Apply (Let6989586621680325931Scrutinee_6989586621680317247Sym0 :: TyFun k1 (TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) (key6989586621680325927 :: k1)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680325931Scrutinee_6989586621680317247Sym0 :: TyFun k1 (TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) (key6989586621680325927 :: k1) = (Let6989586621680325931Scrutinee_6989586621680317247Sym1 key6989586621680325927 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type)
type Apply (Let6989586621680325946Scrutinee_6989586621680317237Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) (n6989586621680325943 :: k1)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680325946Scrutinee_6989586621680317237Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) (n6989586621680325943 :: k1) = (Let6989586621680325946Scrutinee_6989586621680317237Sym1 n6989586621680325943 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type)
type Apply (Let6989586621680325960Scrutinee_6989586621680317235Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) (n6989586621680325957 :: k1)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680325960Scrutinee_6989586621680317235Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) (n6989586621680325957 :: k1) = (Let6989586621680325960Scrutinee_6989586621680317235Sym1 n6989586621680325957 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type)
type Apply (Let6989586621680326542Scrutinee_6989586621680317255Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 (TyFun [k2] Bool -> Type) -> Type) -> Type) -> Type) (l6989586621680326532 :: k1)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680326542Scrutinee_6989586621680317255Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 (TyFun [k2] Bool -> Type) -> Type) -> Type) -> Type) (l6989586621680326532 :: k1) = (Let6989586621680326542Scrutinee_6989586621680317255Sym1 l6989586621680326532 :: TyFun k2 (TyFun k3 (TyFun [k2] Bool -> Type) -> Type) -> Type)
type Apply (Lambda_6989586621680726597Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) (a_69895866216807265926989586621680726596 :: k1)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Lambda_6989586621680726597Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) (a_69895866216807265926989586621680726596 :: k1) = (Lambda_6989586621680726597Sym1 a_69895866216807265926989586621680726596 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type)
type Apply (Lambda_6989586621681076997Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 (TyFun Bool (TyFun [k2] [k2] -> Type) -> Type) -> Type) -> Type) -> Type) (p6989586621681076989 :: k1)
Instance details Defined in Data.Singletons.Prelude.Monad type Apply (Lambda_6989586621681076997Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 (TyFun Bool (TyFun [k2] [k2] -> Type) -> Type) -> Type) -> Type) -> Type) (p6989586621681076989 :: k1) = (Lambda_6989586621681076997Sym1 p6989586621681076989 :: TyFun k2 (TyFun k3 (TyFun Bool (TyFun [k2] [k2] -> Type) -> Type) -> Type) -> Type)
type Apply (Let6989586621680327161Scrutinee_6989586621680317229Sym1 p6989586621680327155 :: TyFun k1 (TyFun [a6989586621680316670] (TyFun k Bool -> Type) -> Type) -> Type) (x6989586621680327159 :: k1)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680327161Scrutinee_6989586621680317229Sym1 p6989586621680327155 :: TyFun k1 (TyFun [a6989586621680316670] (TyFun k Bool -> Type) -> Type) -> Type) (x6989586621680327159 :: k1) = (Let6989586621680327161Scrutinee_6989586621680317229Sym2 p6989586621680327155 x6989586621680327159 :: TyFun [a6989586621680316670] (TyFun k Bool -> Type) -> Type)
type Apply (Let6989586621680325850Scrutinee_6989586621680317253Sym1 x6989586621680325847 :: TyFun k1 (TyFun k3 Bool -> Type) -> Type) (xs6989586621680325848 :: k1)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680325850Scrutinee_6989586621680317253Sym1 x6989586621680325847 :: TyFun k1 (TyFun k3 Bool -> Type) -> Type) (xs6989586621680325848 :: k1) = (Let6989586621680325850Scrutinee_6989586621680317253Sym2 x6989586621680325847 xs6989586621680325848 :: TyFun k3 Bool -> Type)
type Apply (Let6989586621680325931Scrutinee_6989586621680317247Sym1 key6989586621680325927 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) (x6989586621680325928 :: k1)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680325931Scrutinee_6989586621680317247Sym1 key6989586621680325927 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) (x6989586621680325928 :: k1) = (Let6989586621680325931Scrutinee_6989586621680317247Sym2 key6989586621680325927 x6989586621680325928 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type)
type Apply (Let6989586621680325946Scrutinee_6989586621680317237Sym1 n6989586621680325943 :: TyFun k1 (TyFun k3 Bool -> Type) -> Type) (x6989586621680325944 :: k1)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680325946Scrutinee_6989586621680317237Sym1 n6989586621680325943 :: TyFun k1 (TyFun k3 Bool -> Type) -> Type) (x6989586621680325944 :: k1) = (Let6989586621680325946Scrutinee_6989586621680317237Sym2 n6989586621680325943 x6989586621680325944 :: TyFun k3 Bool -> Type)
type Apply (Let6989586621680325960Scrutinee_6989586621680317235Sym1 n6989586621680325957 :: TyFun k1 (TyFun k3 Bool -> Type) -> Type) (x6989586621680325958 :: k1)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680325960Scrutinee_6989586621680317235Sym1 n6989586621680325957 :: TyFun k1 (TyFun k3 Bool -> Type) -> Type) (x6989586621680325958 :: k1) = (Let6989586621680325960Scrutinee_6989586621680317235Sym2 n6989586621680325957 x6989586621680325958 :: TyFun k3 Bool -> Type)
type Apply (Let6989586621680325834Scrutinee_6989586621680317257Sym1 eq6989586621680325822 :: TyFun k1 (TyFun k2 (TyFun k3 (TyFun [k2] Bool -> Type) -> Type) -> Type) -> Type) (l6989586621680325823 :: k1)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680325834Scrutinee_6989586621680317257Sym1 eq6989586621680325822 :: TyFun k1 (TyFun k2 (TyFun k3 (TyFun [k2] Bool -> Type) -> Type) -> Type) -> Type) (l6989586621680325823 :: k1) = (Let6989586621680325834Scrutinee_6989586621680317257Sym2 eq6989586621680325822 l6989586621680325823 :: TyFun k2 (TyFun k3 (TyFun [k2] Bool -> Type) -> Type) -> Type)
type Apply (Let6989586621680326542Scrutinee_6989586621680317255Sym1 l6989586621680326532 :: TyFun k1 (TyFun k3 (TyFun [k1] Bool -> Type) -> Type) -> Type) (x6989586621680326539 :: k1)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680326542Scrutinee_6989586621680317255Sym1 l6989586621680326532 :: TyFun k1 (TyFun k3 (TyFun [k1] Bool -> Type) -> Type) -> Type) (x6989586621680326539 :: k1) = (Let6989586621680326542Scrutinee_6989586621680317255Sym2 l6989586621680326532 x6989586621680326539 :: TyFun k3 (TyFun [k1] Bool -> Type) -> Type)
type Apply (Lambda_6989586621680726597Sym1 a_69895866216807265926989586621680726596 :: TyFun k1 (TyFun k3 Bool -> Type) -> Type) (t6989586621680726604 :: k1)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Lambda_6989586621680726597Sym1 a_69895866216807265926989586621680726596 :: TyFun k1 (TyFun k3 Bool -> Type) -> Type) (t6989586621680726604 :: k1) = (Lambda_6989586621680726597Sym2 a_69895866216807265926989586621680726596 t6989586621680726604 :: TyFun k3 Bool -> Type)
type Apply (Let6989586621680050077Scrutinee_6989586621680048419Sym0 :: TyFun k1 (TyFun k2 (TyFun k2 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) -> Type) -> Type) (x06989586621680050062 :: k1)
Instance details Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680050077Scrutinee_6989586621680048419Sym0 :: TyFun k1 (TyFun k2 (TyFun k2 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) -> Type) -> Type) (x06989586621680050062 :: k1) = (Let6989586621680050077Scrutinee_6989586621680048419Sym1 x06989586621680050062 :: TyFun k2 (TyFun k2 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) -> Type)
type Apply (Lambda_6989586621681076997Sym1 p6989586621681076989 :: TyFun k1 (TyFun k3 (TyFun Bool (TyFun [k1] [k1] -> Type) -> Type) -> Type) -> Type) (x6989586621681076996 :: k1)
Instance details Defined in Data.Singletons.Prelude.Monad type Apply (Lambda_6989586621681076997Sym1 p6989586621681076989 :: TyFun k1 (TyFun k3 (TyFun Bool (TyFun [k1] [k1] -> Type) -> Type) -> Type) -> Type) (x6989586621681076996 :: k1) = (Lambda_6989586621681076997Sym2 p6989586621681076989 x6989586621681076996 :: TyFun k3 (TyFun Bool (TyFun [k1] [k1] -> Type) -> Type) -> Type)
type Apply (Lambda_6989586621681076997Sym2 x6989586621681076996 p6989586621681076989 :: TyFun k3 (TyFun Bool (TyFun [k1] [k1] -> Type) -> Type) -> Type) (a_69895866216810769866989586621681076992 :: k3)
Instance details Defined in Data.Singletons.Prelude.Monad type Apply (Lambda_6989586621681076997Sym2 x6989586621681076996 p6989586621681076989 :: TyFun k3 (TyFun Bool (TyFun [k1] [k1] -> Type) -> Type) -> Type) (a_69895866216810769866989586621681076992 :: k3) = Lambda_6989586621681076997Sym3 x6989586621681076996 p6989586621681076989 a_69895866216810769866989586621681076992
type Apply (Let6989586621680326542Scrutinee_6989586621680317255Sym2 x6989586621680326539 l6989586621680326532 :: TyFun k3 (TyFun [k1] Bool -> Type) -> Type) (xs6989586621680326540 :: k3)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680326542Scrutinee_6989586621680317255Sym2 x6989586621680326539 l6989586621680326532 :: TyFun k3 (TyFun [k1] Bool -> Type) -> Type) (xs6989586621680326540 :: k3) = Let6989586621680326542Scrutinee_6989586621680317255Sym3 x6989586621680326539 l6989586621680326532 xs6989586621680326540
type Apply (Let6989586621680325931Scrutinee_6989586621680317247Sym2 x6989586621680325928 key6989586621680325927 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type) (y6989586621680325929 :: k2)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680325931Scrutinee_6989586621680317247Sym2 x6989586621680325928 key6989586621680325927 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type) (y6989586621680325929 :: k2) = (Let6989586621680325931Scrutinee_6989586621680317247Sym3 x6989586621680325928 key6989586621680325927 y6989586621680325929 :: TyFun k3 Bool -> Type)
type Apply (Let6989586621680325834Scrutinee_6989586621680317257Sym2 l6989586621680325823 eq6989586621680325822 :: TyFun k2 (TyFun k3 (TyFun [k2] Bool -> Type) -> Type) -> Type) (y6989586621680325831 :: k2)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680325834Scrutinee_6989586621680317257Sym2 l6989586621680325823 eq6989586621680325822 :: TyFun k2 (TyFun k3 (TyFun [k2] Bool -> Type) -> Type) -> Type) (y6989586621680325831 :: k2) = (Let6989586621680325834Scrutinee_6989586621680317257Sym3 l6989586621680325823 eq6989586621680325822 y6989586621680325831 :: TyFun k3 (TyFun [k2] Bool -> Type) -> Type)
type Apply (Let6989586621680049828Scrutinee_6989586621680048459Sym0 :: TyFun k1 (TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) (x16989586621680049821 :: k1)
Instance details Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680049828Scrutinee_6989586621680048459Sym0 :: TyFun k1 (TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) (x16989586621680049821 :: k1) = (Let6989586621680049828Scrutinee_6989586621680048459Sym1 x16989586621680049821 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type)
type Apply (Let6989586621680049943Scrutinee_6989586621680048446Sym0 :: TyFun k1 (TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) (x16989586621680049938 :: k1)
Instance details Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680049943Scrutinee_6989586621680048446Sym0 :: TyFun k1 (TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) (x16989586621680049938 :: k1) = (Let6989586621680049943Scrutinee_6989586621680048446Sym1 x16989586621680049938 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type)
type Apply (Let6989586621680050077Scrutinee_6989586621680048419Sym1 x06989586621680050062 :: TyFun k1 (TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) -> Type) (y6989586621680050063 :: k1)
Instance details Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680050077Scrutinee_6989586621680048419Sym1 x06989586621680050062 :: TyFun k1 (TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) -> Type) (y6989586621680050063 :: k1) = (Let6989586621680050077Scrutinee_6989586621680048419Sym2 x06989586621680050062 y6989586621680050063 :: TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type)
type Apply (Let6989586621680325834Scrutinee_6989586621680317257Sym3 y6989586621680325831 l6989586621680325823 eq6989586621680325822 :: TyFun k3 (TyFun [k2] Bool -> Type) -> Type) (ys6989586621680325832 :: k3)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680325834Scrutinee_6989586621680317257Sym3 y6989586621680325831 l6989586621680325823 eq6989586621680325822 :: TyFun k3 (TyFun [k2] Bool -> Type) -> Type) (ys6989586621680325832 :: k3) = Let6989586621680325834Scrutinee_6989586621680317257Sym4 y6989586621680325831 l6989586621680325823 eq6989586621680325822 ys6989586621680325832
type Apply (Lambda_6989586621681076997Sym3 a_69895866216810769866989586621681076992 x6989586621681076996 p6989586621681076989 :: TyFun Bool (TyFun [k1] [k1] -> Type) -> Type) (t6989586621681077006 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Monad type Apply (Lambda_6989586621681076997Sym3 a_69895866216810769866989586621681076992 x6989586621681076996 p6989586621681076989 :: TyFun Bool (TyFun [k1] [k1] -> Type) -> Type) (t6989586621681077006 :: Bool) = Lambda_6989586621681076997 a_69895866216810769866989586621681076992 x6989586621681076996 p6989586621681076989 t6989586621681077006
type Apply (Let6989586621680049828Scrutinee_6989586621680048459Sym1 x16989586621680049821 :: TyFun k1 (TyFun k2 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) (x26989586621680049823 :: k1)
Instance details Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680049828Scrutinee_6989586621680048459Sym1 x16989586621680049821 :: TyFun k1 (TyFun k2 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) (x26989586621680049823 :: k1) = (Let6989586621680049828Scrutinee_6989586621680048459Sym2 x16989586621680049821 x26989586621680049823 :: TyFun k2 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type)
type Apply (Let6989586621680049943Scrutinee_6989586621680048446Sym1 x16989586621680049938 :: TyFun k1 (TyFun k2 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) (x26989586621680049939 :: k1)
Instance details Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680049943Scrutinee_6989586621680048446Sym1 x16989586621680049938 :: TyFun k1 (TyFun k2 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) (x26989586621680049939 :: k1) = (Let6989586621680049943Scrutinee_6989586621680048446Sym2 x16989586621680049938 x26989586621680049939 :: TyFun k2 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type)
type Apply (Let6989586621680050077Scrutinee_6989586621680048419Sym2 y6989586621680050063 x06989586621680050062 :: TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) (x6989586621680050076 :: k1)
Instance details Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680050077Scrutinee_6989586621680048419Sym2 y6989586621680050063 x06989586621680050062 :: TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) (x6989586621680050076 :: k1) = (Let6989586621680050077Scrutinee_6989586621680048419Sym3 y6989586621680050063 x06989586621680050062 x6989586621680050076 :: TyFun k3 (TyFun k4 Bool -> Type) -> Type)
type Apply (Let6989586621680049828Scrutinee_6989586621680048459Sym2 x26989586621680049823 x16989586621680049821 :: TyFun k2 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) (y6989586621680049825 :: k2)
Instance details Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680049828Scrutinee_6989586621680048459Sym2 x26989586621680049823 x16989586621680049821 :: TyFun k2 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) (y6989586621680049825 :: k2) = (Let6989586621680049828Scrutinee_6989586621680048459Sym3 x26989586621680049823 x16989586621680049821 y6989586621680049825 :: TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type)
type Apply (Let6989586621680049943Scrutinee_6989586621680048446Sym2 x26989586621680049939 x16989586621680049938 :: TyFun k2 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) (y6989586621680049940 :: k2)
Instance details Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680049943Scrutinee_6989586621680048446Sym2 x26989586621680049939 x16989586621680049938 :: TyFun k2 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) (y6989586621680049940 :: k2) = (Let6989586621680049943Scrutinee_6989586621680048446Sym3 x26989586621680049939 x16989586621680049938 y6989586621680049940 :: TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type)
type Apply (Let6989586621680050077Scrutinee_6989586621680048419Sym3 x6989586621680050076 y6989586621680050063 x06989586621680050062 :: TyFun k3 (TyFun k4 Bool -> Type) -> Type) (arg_69895866216800484156989586621680050056 :: k3)
Instance details Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680050077Scrutinee_6989586621680048419Sym3 x6989586621680050076 y6989586621680050063 x06989586621680050062 :: TyFun k3 (TyFun k4 Bool -> Type) -> Type) (arg_69895866216800484156989586621680050056 :: k3) = (Let6989586621680050077Scrutinee_6989586621680048419Sym4 x6989586621680050076 y6989586621680050063 x06989586621680050062 arg_69895866216800484156989586621680050056 :: TyFun k4 Bool -> Type)
type Apply (Let6989586621680049828Scrutinee_6989586621680048459Sym3 y6989586621680049825 x26989586621680049823 x16989586621680049821 :: TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) (arg_69895866216800484526989586621680049809 :: k3)
Instance details Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680049828Scrutinee_6989586621680048459Sym3 y6989586621680049825 x26989586621680049823 x16989586621680049821 :: TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) (arg_69895866216800484526989586621680049809 :: k3) = (Let6989586621680049828Scrutinee_6989586621680048459Sym4 y6989586621680049825 x26989586621680049823 x16989586621680049821 arg_69895866216800484526989586621680049809 :: TyFun k4 (TyFun k5 Bool -> Type) -> Type)
type Apply (Let6989586621680049943Scrutinee_6989586621680048446Sym3 y6989586621680049940 x26989586621680049939 x16989586621680049938 :: TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) (arg_69895866216800484376989586621680049923 :: k3)
Instance details Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680049943Scrutinee_6989586621680048446Sym3 y6989586621680049940 x26989586621680049939 x16989586621680049938 :: TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) (arg_69895866216800484376989586621680049923 :: k3) = (Let6989586621680049943Scrutinee_6989586621680048446Sym4 y6989586621680049940 x26989586621680049939 x16989586621680049938 arg_69895866216800484376989586621680049923 :: TyFun k4 (TyFun k5 Bool -> Type) -> Type)
type Apply (Let6989586621680049828Scrutinee_6989586621680048459Sym4 arg_69895866216800484526989586621680049809 y6989586621680049825 x26989586621680049823 x16989586621680049821 :: TyFun k4 (TyFun k5 Bool -> Type) -> Type) (arg_69895866216800484556989586621680049810 :: k4)
Instance details Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680049828Scrutinee_6989586621680048459Sym4 arg_69895866216800484526989586621680049809 y6989586621680049825 x26989586621680049823 x16989586621680049821 :: TyFun k4 (TyFun k5 Bool -> Type) -> Type) (arg_69895866216800484556989586621680049810 :: k4) = (Let6989586621680049828Scrutinee_6989586621680048459Sym5 arg_69895866216800484526989586621680049809 y6989586621680049825 x26989586621680049823 x16989586621680049821 arg_69895866216800484556989586621680049810 :: TyFun k5 Bool -> Type)
type Apply (Let6989586621680049943Scrutinee_6989586621680048446Sym4 arg_69895866216800484376989586621680049923 y6989586621680049940 x26989586621680049939 x16989586621680049938 :: TyFun k4 (TyFun k5 Bool -> Type) -> Type) (arg_69895866216800484406989586621680049924 :: k4)
Instance details Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680049943Scrutinee_6989586621680048446Sym4 arg_69895866216800484376989586621680049923 y6989586621680049940 x26989586621680049939 x16989586621680049938 :: TyFun k4 (TyFun k5 Bool -> Type) -> Type) (arg_69895866216800484406989586621680049924 :: k4) = (Let6989586621680049943Scrutinee_6989586621680048446Sym5 arg_69895866216800484376989586621680049923 y6989586621680049940 x26989586621680049939 x16989586621680049938 arg_69895866216800484406989586621680049924 :: TyFun k5 Bool -> Type)
type Apply (ListisPrefixOfSym0 :: TyFun [a6989586621680578909] ([a6989586621680578909] ~> Bool) -> Type) (a6989586621680581945 :: [a6989586621680578909])
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation type Apply (ListisPrefixOfSym0 :: TyFun [a6989586621680578909] ([a6989586621680578909] ~> Bool) -> Type) (a6989586621680581945 :: [a6989586621680578909]) = ListisPrefixOfSym1 a6989586621680581945
type Apply (IsPrefixOfSym0 :: TyFun [a6989586621680316636] ([a6989586621680316636] ~> Bool) -> Type) (a6989586621680326550 :: [a6989586621680316636])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (IsPrefixOfSym0 :: TyFun [a6989586621680316636] ([a6989586621680316636] ~> Bool) -> Type) (a6989586621680326550 :: [a6989586621680316636]) = IsPrefixOfSym1 a6989586621680326550
type Apply (IsInfixOfSym0 :: TyFun [a6989586621680316634] ([a6989586621680316634] ~> Bool) -> Type) (a6989586621680326788 :: [a6989586621680316634])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (IsInfixOfSym0 :: TyFun [a6989586621680316634] ([a6989586621680316634] ~> Bool) -> Type) (a6989586621680326788 :: [a6989586621680316634]) = IsInfixOfSym1 a6989586621680326788
type Apply (IsSuffixOfSym0 :: TyFun [a6989586621680316635] ([a6989586621680316635] ~> Bool) -> Type) (a6989586621680327141 :: [a6989586621680316635])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (IsSuffixOfSym0 :: TyFun [a6989586621680316635] ([a6989586621680316635] ~> Bool) -> Type) (a6989586621680327141 :: [a6989586621680316635]) = IsSuffixOfSym1 a6989586621680327141
type Apply (Let6989586621680327161Scrutinee_6989586621680317229Sym2 x6989586621680327159 p6989586621680327155 :: TyFun [a6989586621680316670] (TyFun k Bool -> Type) -> Type) (xs6989586621680327160 :: [a6989586621680316670])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680327161Scrutinee_6989586621680317229Sym2 x6989586621680327159 p6989586621680327155 :: TyFun [a6989586621680316670] (TyFun k Bool -> Type) -> Type) (xs6989586621680327160 :: [a6989586621680316670]) = (Let6989586621680327161Scrutinee_6989586621680317229Sym3 x6989586621680327159 p6989586621680327155 xs6989586621680327160 :: TyFun k Bool -> Type)
type Apply (Let6989586621680325991ZsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) (p6989586621680325978 :: k ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680325991ZsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) (p6989586621680325978 :: k ~> Bool) = Let6989586621680325991ZsSym1 p6989586621680325978
type Apply (Let6989586621680325991YsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) (p6989586621680325978 :: k ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680325991YsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) (p6989586621680325978 :: k ~> Bool) = Let6989586621680325991YsSym1 p6989586621680325978
type Apply (Let6989586621680325991X_6989586621680325992Sym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] ([k], [k]) -> Type) -> Type) -> Type) (p6989586621680325978 :: k ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680325991X_6989586621680325992Sym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] ([k], [k]) -> Type) -> Type) -> Type) (p6989586621680325978 :: k ~> Bool) = Let6989586621680325991X_6989586621680325992Sym1 p6989586621680325978
type Apply (Let6989586621680326034ZsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) (p6989586621680326021 :: k ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680326034ZsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) (p6989586621680326021 :: k ~> Bool) = Let6989586621680326034ZsSym1 p6989586621680326021
type Apply (Let6989586621680326034YsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) (p6989586621680326021 :: k ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680326034YsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) (p6989586621680326021 :: k ~> Bool) = Let6989586621680326034YsSym1 p6989586621680326021
type Apply (Let6989586621680326034X_6989586621680326035Sym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] ([k], [k]) -> Type) -> Type) -> Type) (p6989586621680326021 :: k ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680326034X_6989586621680326035Sym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] ([k], [k]) -> Type) -> Type) -> Type) (p6989586621680326021 :: k ~> Bool) = Let6989586621680326034X_6989586621680326035Sym1 p6989586621680326021
type Apply (ListnubBySym0 :: TyFun (a6989586621680578903 ~> (a6989586621680578903 ~> Bool)) ([a6989586621680578903] ~> [a6989586621680578903]) -> Type) (a6989586621680581910 :: a6989586621680578903 ~> (a6989586621680578903 ~> Bool))
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation type Apply (ListnubBySym0 :: TyFun (a6989586621680578903 ~> (a6989586621680578903 ~> Bool)) ([a6989586621680578903] ~> [a6989586621680578903]) -> Type) (a6989586621680581910 :: a6989586621680578903 ~> (a6989586621680578903 ~> Bool)) = ListnubBySym1 a6989586621680581910
type Apply (ListpartitionSym0 :: TyFun (a6989586621680578911 ~> Bool) ([a6989586621680578911] ~> ([a6989586621680578911], [a6989586621680578911])) -> Type) (a6989586621680581968 :: a6989586621680578911 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation type Apply (ListpartitionSym0 :: TyFun (a6989586621680578911 ~> Bool) ([a6989586621680578911] ~> ([a6989586621680578911], [a6989586621680578911])) -> Type) (a6989586621680581968 :: a6989586621680578911 ~> Bool) = ListpartitionSym1 a6989586621680581968
type Apply (ListfilterSym0 :: TyFun (a6989586621680578912 ~> Bool) ([a6989586621680578912] ~> [a6989586621680578912]) -> Type) (a6989586621680581978 :: a6989586621680578912 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation type Apply (ListfilterSym0 :: TyFun (a6989586621680578912 ~> Bool) ([a6989586621680578912] ~> [a6989586621680578912]) -> Type) (a6989586621680581978 :: a6989586621680578912 ~> Bool) = ListfilterSym1 a6989586621680581978
type Apply (ListspanSym0 :: TyFun (a6989586621680578913 ~> Bool) ([a6989586621680578913] ~> ([a6989586621680578913], [a6989586621680578913])) -> Type) (a6989586621680581988 :: a6989586621680578913 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation type Apply (ListspanSym0 :: TyFun (a6989586621680578913 ~> Bool) ([a6989586621680578913] ~> ([a6989586621680578913], [a6989586621680578913])) -> Type) (a6989586621680581988 :: a6989586621680578913 ~> Bool) = ListspanSym1 a6989586621680581988
type Apply (ListdropWhileSym0 :: TyFun (a6989586621680578914 ~> Bool) ([a6989586621680578914] ~> [a6989586621680578914]) -> Type) (a6989586621680581998 :: a6989586621680578914 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation type Apply (ListdropWhileSym0 :: TyFun (a6989586621680578914 ~> Bool) ([a6989586621680578914] ~> [a6989586621680578914]) -> Type) (a6989586621680581998 :: a6989586621680578914 ~> Bool) = ListdropWhileSym1 a6989586621680581998
type Apply (ListtakeWhileSym0 :: TyFun (a6989586621680578915 ~> Bool) ([a6989586621680578915] ~> [a6989586621680578915]) -> Type) (a6989586621680582008 :: a6989586621680578915 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation type Apply (ListtakeWhileSym0 :: TyFun (a6989586621680578915 ~> Bool) ([a6989586621680578915] ~> [a6989586621680578915]) -> Type) (a6989586621680582008 :: a6989586621680578915 ~> Bool) = ListtakeWhileSym1 a6989586621680582008
type Apply (NubBySym0 :: TyFun (a6989586621680316551 ~> (a6989586621680316551 ~> Bool)) ([a6989586621680316551] ~> [a6989586621680316551]) -> Type) (a6989586621680325818 :: a6989586621680316551 ~> (a6989586621680316551 ~> Bool))
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (NubBySym0 :: TyFun (a6989586621680316551 ~> (a6989586621680316551 ~> Bool)) ([a6989586621680316551] ~> [a6989586621680316551]) -> Type) (a6989586621680325818 :: a6989586621680316551 ~> (a6989586621680316551 ~> Bool)) = NubBySym1 a6989586621680325818
type Apply (PartitionSym0 :: TyFun (a6989586621680316560 ~> Bool) ([a6989586621680316560] ~> ([a6989586621680316560], [a6989586621680316560])) -> Type) (a6989586621680325916 :: a6989586621680316560 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (PartitionSym0 :: TyFun (a6989586621680316560 ~> Bool) ([a6989586621680316560] ~> ([a6989586621680316560], [a6989586621680316560])) -> Type) (a6989586621680325916 :: a6989586621680316560 ~> Bool) = PartitionSym1 a6989586621680325916
type Apply (BreakSym0 :: TyFun (a6989586621680316572 ~> Bool) ([a6989586621680316572] ~> ([a6989586621680316572], [a6989586621680316572])) -> Type) (a6989586621680325973 :: a6989586621680316572 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (BreakSym0 :: TyFun (a6989586621680316572 ~> Bool) ([a6989586621680316572] ~> ([a6989586621680316572], [a6989586621680316572])) -> Type) (a6989586621680325973 :: a6989586621680316572 ~> Bool) = BreakSym1 a6989586621680325973
type Apply (SpanSym0 :: TyFun (a6989586621680316573 ~> Bool) ([a6989586621680316573] ~> ([a6989586621680316573], [a6989586621680316573])) -> Type) (a6989586621680326016 :: a6989586621680316573 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (SpanSym0 :: TyFun (a6989586621680316573 ~> Bool) ([a6989586621680316573] ~> ([a6989586621680316573], [a6989586621680316573])) -> Type) (a6989586621680326016 :: a6989586621680316573 ~> Bool) = SpanSym1 a6989586621680326016
type Apply (GroupBySym0 :: TyFun (a6989586621680316563 ~> (a6989586621680316563 ~> Bool)) ([a6989586621680316563] ~> [[a6989586621680316563]]) -> Type) (a6989586621680326059 :: a6989586621680316563 ~> (a6989586621680316563 ~> Bool))
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (GroupBySym0 :: TyFun (a6989586621680316563 ~> (a6989586621680316563 ~> Bool)) ([a6989586621680316563] ~> [[a6989586621680316563]]) -> Type) (a6989586621680326059 :: a6989586621680316563 ~> (a6989586621680316563 ~> Bool)) = GroupBySym1 a6989586621680326059
type Apply (DropWhileSym0 :: TyFun (a6989586621680316575 ~> Bool) ([a6989586621680316575] ~> [a6989586621680316575]) -> Type) (a6989586621680326093 :: a6989586621680316575 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (DropWhileSym0 :: TyFun (a6989586621680316575 ~> Bool) ([a6989586621680316575] ~> [a6989586621680316575]) -> Type) (a6989586621680326093 :: a6989586621680316575 ~> Bool) = DropWhileSym1 a6989586621680326093
type Apply (TakeWhileSym0 :: TyFun (a6989586621680316576 ~> Bool) ([a6989586621680316576] ~> [a6989586621680316576]) -> Type) (a6989586621680326111 :: a6989586621680316576 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (TakeWhileSym0 :: TyFun (a6989586621680316576 ~> Bool) ([a6989586621680316576] ~> [a6989586621680316576]) -> Type) (a6989586621680326111 :: a6989586621680316576 ~> Bool) = TakeWhileSym1 a6989586621680326111
type Apply (FilterSym0 :: TyFun (a6989586621680316584 ~> Bool) ([a6989586621680316584] ~> [a6989586621680316584]) -> Type) (a6989586621680326125 :: a6989586621680316584 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (FilterSym0 :: TyFun (a6989586621680316584 ~> Bool) ([a6989586621680316584] ~> [a6989586621680316584]) -> Type) (a6989586621680326125 :: a6989586621680316584 ~> Bool) = FilterSym1 a6989586621680326125
type Apply (FindSym0 :: TyFun (a6989586621680316583 ~> Bool) ([a6989586621680316583] ~> Maybe a6989586621680316583) -> Type) (a6989586621680326140 :: a6989586621680316583 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (FindSym0 :: TyFun (a6989586621680316583 ~> Bool) ([a6989586621680316583] ~> Maybe a6989586621680316583) -> Type) (a6989586621680326140 :: a6989586621680316583 ~> Bool) = FindSym1 a6989586621680326140
type Apply (DeleteFirstsBySym0 :: TyFun (a6989586621680316589 ~> (a6989586621680316589 ~> Bool)) ([a6989586621680316589] ~> ([a6989586621680316589] ~> [a6989586621680316589])) -> Type) (a6989586621680326209 :: a6989586621680316589 ~> (a6989586621680316589 ~> Bool))
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (DeleteFirstsBySym0 :: TyFun (a6989586621680316589 ~> (a6989586621680316589 ~> Bool)) ([a6989586621680316589] ~> ([a6989586621680316589] ~> [a6989586621680316589])) -> Type) (a6989586621680326209 :: a6989586621680316589 ~> (a6989586621680316589 ~> Bool)) = DeleteFirstsBySym1 a6989586621680326209
type Apply (UnionBySym0 :: TyFun (a6989586621680316549 ~> (a6989586621680316549 ~> Bool)) ([a6989586621680316549] ~> ([a6989586621680316549] ~> [a6989586621680316549])) -> Type) (a6989586621680326222 :: a6989586621680316549 ~> (a6989586621680316549 ~> Bool))
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (UnionBySym0 :: TyFun (a6989586621680316549 ~> (a6989586621680316549 ~> Bool)) ([a6989586621680316549] ~> ([a6989586621680316549] ~> [a6989586621680316549])) -> Type) (a6989586621680326222 :: a6989586621680316549 ~> (a6989586621680316549 ~> Bool)) = UnionBySym1 a6989586621680326222
type Apply (FindIndicesSym0 :: TyFun (a6989586621680316579 ~> Bool) ([a6989586621680316579] ~> [Nat]) -> Type) (a6989586621680326466 :: a6989586621680316579 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (FindIndicesSym0 :: TyFun (a6989586621680316579 ~> Bool) ([a6989586621680316579] ~> [Nat]) -> Type) (a6989586621680326466 :: a6989586621680316579 ~> Bool) = FindIndicesSym1 a6989586621680326466
type Apply (FindIndexSym0 :: TyFun (a6989586621680316580 ~> Bool) ([a6989586621680316580] ~> Maybe Nat) -> Type) (a6989586621680326500 :: a6989586621680316580 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (FindIndexSym0 :: TyFun (a6989586621680316580 ~> Bool) ([a6989586621680316580] ~> Maybe Nat) -> Type) (a6989586621680326500 :: a6989586621680316580 ~> Bool) = FindIndexSym1 a6989586621680326500
type Apply (AnySym0 :: TyFun (a6989586621680316653 ~> Bool) ([a6989586621680316653] ~> Bool) -> Type) (a6989586621680326781 :: a6989586621680316653 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (AnySym0 :: TyFun (a6989586621680316653 ~> Bool) ([a6989586621680316653] ~> Bool) -> Type) (a6989586621680326781 :: a6989586621680316653 ~> Bool) = AnySym1 a6989586621680326781
type Apply (IntersectBySym0 :: TyFun (a6989586621680316577 ~> (a6989586621680316577 ~> Bool)) ([a6989586621680316577] ~> ([a6989586621680316577] ~> [a6989586621680316577])) -> Type) (a6989586621680326794 :: a6989586621680316577 ~> (a6989586621680316577 ~> Bool))
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (IntersectBySym0 :: TyFun (a6989586621680316577 ~> (a6989586621680316577 ~> Bool)) ([a6989586621680316577] ~> ([a6989586621680316577] ~> [a6989586621680316577])) -> Type) (a6989586621680326794 :: a6989586621680316577 ~> (a6989586621680316577 ~> Bool)) = IntersectBySym1 a6989586621680326794
type Apply (AllSym0 :: TyFun (a6989586621680316654 ~> Bool) ([a6989586621680316654] ~> Bool) -> Type) (a6989586621680326836 :: a6989586621680316654 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (AllSym0 :: TyFun (a6989586621680316654 ~> Bool) ([a6989586621680316654] ~> Bool) -> Type) (a6989586621680326836 :: a6989586621680316654 ~> Bool) = AllSym1 a6989586621680326836
type Apply (DropWhileEndSym0 :: TyFun (a6989586621680316574 ~> Bool) ([a6989586621680316574] ~> [a6989586621680316574]) -> Type) (a6989586621680327149 :: a6989586621680316574 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (DropWhileEndSym0 :: TyFun (a6989586621680316574 ~> Bool) ([a6989586621680316574] ~> [a6989586621680316574]) -> Type) (a6989586621680327149 :: a6989586621680316574 ~> Bool) = DropWhileEndSym1 a6989586621680327149
type Apply (Elem_bySym0 :: TyFun (a6989586621680316550 ~> (a6989586621680316550 ~> Bool)) (a6989586621680316550 ~> ([a6989586621680316550] ~> Bool)) -> Type) (a6989586621680325808 :: a6989586621680316550 ~> (a6989586621680316550 ~> Bool))
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Elem_bySym0 :: TyFun (a6989586621680316550 ~> (a6989586621680316550 ~> Bool)) (a6989586621680316550 ~> ([a6989586621680316550] ~> Bool)) -> Type) (a6989586621680325808 :: a6989586621680316550 ~> (a6989586621680316550 ~> Bool)) = Elem_bySym1 a6989586621680325808
type Apply (SelectSym0 :: TyFun (a6989586621680316559 ~> Bool) (a6989586621680316559 ~> (([a6989586621680316559], [a6989586621680316559]) ~> ([a6989586621680316559], [a6989586621680316559]))) -> Type) (a6989586621680325898 :: a6989586621680316559 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (SelectSym0 :: TyFun (a6989586621680316559 ~> Bool) (a6989586621680316559 ~> (([a6989586621680316559], [a6989586621680316559]) ~> ([a6989586621680316559], [a6989586621680316559]))) -> Type) (a6989586621680325898 :: a6989586621680316559 ~> Bool) = SelectSym1 a6989586621680325898
type Apply (DeleteBySym0 :: TyFun (a6989586621680316590 ~> (a6989586621680316590 ~> Bool)) (a6989586621680316590 ~> ([a6989586621680316590] ~> [a6989586621680316590])) -> Type) (a6989586621680326191 :: a6989586621680316590 ~> (a6989586621680316590 ~> Bool))
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (DeleteBySym0 :: TyFun (a6989586621680316590 ~> (a6989586621680316590 ~> Bool)) (a6989586621680316590 ~> ([a6989586621680316590] ~> [a6989586621680316590])) -> Type) (a6989586621680326191 :: a6989586621680316590 ~> (a6989586621680316590 ~> Bool)) = DeleteBySym1 a6989586621680326191
type Apply (UntilSym0 :: TyFun (a6989586621679803796 ~> Bool) ((a6989586621679803796 ~> a6989586621679803796) ~> (a6989586621679803796 ~> a6989586621679803796)) -> Type) (a6989586621679804355 :: a6989586621679803796 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.Base type Apply (UntilSym0 :: TyFun (a6989586621679803796 ~> Bool) ((a6989586621679803796 ~> a6989586621679803796) ~> (a6989586621679803796 ~> a6989586621679803796)) -> Type) (a6989586621679804355 :: a6989586621679803796 ~> Bool) = UntilSym1 a6989586621679804355
type Apply (Let6989586621680325824NubBy'Sym0 :: TyFun (k1 ~> (k1 ~> Bool)) (TyFun k (TyFun [k1] ([k1] ~> [k1]) -> Type) -> Type) -> Type) (eq6989586621680325822 :: k1 ~> (k1 ~> Bool))
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680325824NubBy'Sym0 :: TyFun (k1 ~> (k1 ~> Bool)) (TyFun k (TyFun [k1] ([k1] ~> [k1]) -> Type) -> Type) -> Type) (eq6989586621680325822 :: k1 ~> (k1 ~> Bool)) = (Let6989586621680325824NubBy'Sym1 eq6989586621680325822 :: TyFun k (TyFun [k1] ([k1] ~> [k1]) -> Type) -> Type)
type Apply (Let6989586621680326066ZsSym0 :: TyFun (k1 ~> (a6989586621680316573 ~> Bool)) (TyFun k1 (TyFun [a6989586621680316573] [a6989586621680316573] -> Type) -> Type) -> Type) (eq6989586621680326063 :: k1 ~> (a6989586621680316573 ~> Bool))
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680326066ZsSym0 :: TyFun (k1 ~> (a6989586621680316573 ~> Bool)) (TyFun k1 (TyFun [a6989586621680316573] [a6989586621680316573] -> Type) -> Type) -> Type) (eq6989586621680326063 :: k1 ~> (a6989586621680316573 ~> Bool)) = Let6989586621680326066ZsSym1 eq6989586621680326063
type Apply (Let6989586621680326066YsSym0 :: TyFun (k1 ~> (a6989586621680316573 ~> Bool)) (TyFun k1 (TyFun [a6989586621680316573] [a6989586621680316573] -> Type) -> Type) -> Type) (eq6989586621680326063 :: k1 ~> (a6989586621680316573 ~> Bool))
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680326066YsSym0 :: TyFun (k1 ~> (a6989586621680316573 ~> Bool)) (TyFun k1 (TyFun [a6989586621680316573] [a6989586621680316573] -> Type) -> Type) -> Type) (eq6989586621680326063 :: k1 ~> (a6989586621680316573 ~> Bool)) = Let6989586621680326066YsSym1 eq6989586621680326063
type Apply (Let6989586621680326066X_6989586621680326067Sym0 :: TyFun (k1 ~> (a6989586621680316573 ~> Bool)) (TyFun k1 (TyFun [a6989586621680316573] ([a6989586621680316573], [a6989586621680316573]) -> Type) -> Type) -> Type) (eq6989586621680326063 :: k1 ~> (a6989586621680316573 ~> Bool))
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680326066X_6989586621680326067Sym0 :: TyFun (k1 ~> (a6989586621680316573 ~> Bool)) (TyFun k1 (TyFun [a6989586621680316573] ([a6989586621680316573], [a6989586621680316573]) -> Type) -> Type) -> Type) (eq6989586621680326063 :: k1 ~> (a6989586621680316573 ~> Bool)) = Let6989586621680326066X_6989586621680326067Sym1 eq6989586621680326063
type Apply (Lambda_6989586621680327157Sym0 :: TyFun (a6989586621680316670 ~> Bool) (TyFun k (TyFun a6989586621680316670 (TyFun [a6989586621680316670] [a6989586621680316670] -> Type) -> Type) -> Type) -> Type) (p6989586621680327155 :: a6989586621680316670 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Lambda_6989586621680327157Sym0 :: TyFun (a6989586621680316670 ~> Bool) (TyFun k (TyFun a6989586621680316670 (TyFun [a6989586621680316670] [a6989586621680316670] -> Type) -> Type) -> Type) -> Type) (p6989586621680327155 :: a6989586621680316670 ~> Bool) = (Lambda_6989586621680327157Sym1 p6989586621680327155 :: TyFun k (TyFun a6989586621680316670 (TyFun [a6989586621680316670] [a6989586621680316670] -> Type) -> Type) -> Type)
type Apply (Lambda_6989586621680726094Sym0 :: TyFun (a6989586621679070391 ~> Bool) (TyFun k (TyFun a6989586621679070391 (First a6989586621679070391) -> Type) -> Type) -> Type) (p6989586621680726091 :: a6989586621679070391 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Lambda_6989586621680726094Sym0 :: TyFun (a6989586621679070391 ~> Bool) (TyFun k (TyFun a6989586621679070391 (First a6989586621679070391) -> Type) -> Type) -> Type) (p6989586621680726091 :: a6989586621679070391 ~> Bool) = (Lambda_6989586621680726094Sym1 p6989586621680726091 :: TyFun k (TyFun a6989586621679070391 (First a6989586621679070391) -> Type) -> Type)
type Apply (Let6989586621680726191Scrutinee_6989586621680725972Sym0 :: TyFun (a6989586621680725724 ~> Bool) (TyFun (t6989586621680725721 a6989586621680725724) Any -> Type) -> Type) (p6989586621680726189 :: a6989586621680725724 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680726191Scrutinee_6989586621680725972Sym0 :: TyFun (a6989586621680725724 ~> Bool) (TyFun (t6989586621680725721 a6989586621680725724) Any -> Type) -> Type) (p6989586621680726189 :: a6989586621680725724 ~> Bool) = (Let6989586621680726191Scrutinee_6989586621680725972Sym1 p6989586621680726189 :: TyFun (t6989586621680725721 a6989586621680725724) Any -> Type)
type Apply (Let6989586621680726178Scrutinee_6989586621680725974Sym0 :: TyFun (a6989586621680725724 ~> Bool) (TyFun (t6989586621680725721 a6989586621680725724) All -> Type) -> Type) (p6989586621680726176 :: a6989586621680725724 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680726178Scrutinee_6989586621680725974Sym0 :: TyFun (a6989586621680725724 ~> Bool) (TyFun (t6989586621680725721 a6989586621680725724) All -> Type) -> Type) (p6989586621680726176 :: a6989586621680725724 ~> Bool) = (Let6989586621680726178Scrutinee_6989586621680725974Sym1 p6989586621680726176 :: TyFun (t6989586621680725721 a6989586621680725724) All -> Type)
type Apply (Let6989586621680726093Scrutinee_6989586621680725980Sym0 :: TyFun (a6989586621680725724 ~> Bool) (TyFun (t6989586621680725721 a6989586621680725724) (First a6989586621680725724) -> Type) -> Type) (p6989586621680726091 :: a6989586621680725724 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680726093Scrutinee_6989586621680725980Sym0 :: TyFun (a6989586621680725724 ~> Bool) (TyFun (t6989586621680725721 a6989586621680725724) (First a6989586621680725724) -> Type) -> Type) (p6989586621680726091 :: a6989586621680725724 ~> Bool) = (Let6989586621680726093Scrutinee_6989586621680725980Sym1 p6989586621680726091 :: TyFun (t6989586621680725721 a6989586621680725724) (First a6989586621680725724) -> Type)
type Apply (Let6989586621679804366GoSym0 :: TyFun (k1 ~> Bool) (TyFun (k1 ~> k1) (TyFun k2 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type) (p6989586621679804363 :: k1 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.Base type Apply (Let6989586621679804366GoSym0 :: TyFun (k1 ~> Bool) (TyFun (k1 ~> k1) (TyFun k2 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type) (p6989586621679804363 :: k1 ~> Bool) = (Let6989586621679804366GoSym1 p6989586621679804363 :: TyFun (k1 ~> k1) (TyFun k2 (TyFun k1 k1 -> Type) -> Type) -> Type)
type Apply (FilterMSym0 :: TyFun (a6989586621681071270 ~> m6989586621681071269 Bool) ([a6989586621681071270] ~> m6989586621681071269 [a6989586621681071270]) -> Type) (a6989586621681076982 :: a6989586621681071270 ~> m6989586621681071269 Bool)
Instance details Defined in Data.Singletons.Prelude.Monad type Apply (FilterMSym0 :: TyFun (a6989586621681071270 ~> m6989586621681071269 Bool) ([a6989586621681071270] ~> m6989586621681071269 [a6989586621681071270]) -> Type) (a6989586621681076982 :: a6989586621681071270 ~> m6989586621681071269 Bool) = FilterMSym1 a6989586621681076982
type Apply (AnySym0 :: TyFun (a6989586621680725640 ~> Bool) (t6989586621680725639 a6989586621680725640 ~> Bool) -> Type) (a6989586621680726185 :: a6989586621680725640 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (AnySym0 :: TyFun (a6989586621680725640 ~> Bool) (t6989586621680725639 a6989586621680725640 ~> Bool) -> Type) (a6989586621680726185 :: a6989586621680725640 ~> Bool) = (AnySym1 a6989586621680726185 t6989586621680725639 :: TyFun (t6989586621680725639 a6989586621680725640) Bool -> Type)
type Apply (AllSym0 :: TyFun (a6989586621680725638 ~> Bool) (t6989586621680725637 a6989586621680725638 ~> Bool) -> Type) (a6989586621680726172 :: a6989586621680725638 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (AllSym0 :: TyFun (a6989586621680725638 ~> Bool) (t6989586621680725637 a6989586621680725638 ~> Bool) -> Type) (a6989586621680726172 :: a6989586621680725638 ~> Bool) = (AllSym1 a6989586621680726172 t6989586621680725637 :: TyFun (t6989586621680725637 a6989586621680725638) Bool -> Type)
type Apply (FindSym0 :: TyFun (a6989586621680725630 ~> Bool) (t6989586621680725629 a6989586621680725630 ~> Maybe a6989586621680725630) -> Type) (a6989586621680726087 :: a6989586621680725630 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (FindSym0 :: TyFun (a6989586621680725630 ~> Bool) (t6989586621680725629 a6989586621680725630 ~> Maybe a6989586621680725630) -> Type) (a6989586621680726087 :: a6989586621680725630 ~> Bool) = (FindSym1 a6989586621680726087 t6989586621680725629 :: TyFun (t6989586621680725629 a6989586621680725630) (Maybe a6989586621680725630) -> Type)
type Apply (MfilterSym0 :: TyFun (a6989586621681071227 ~> Bool) (m6989586621681071226 a6989586621681071227 ~> m6989586621681071226 a6989586621681071227) -> Type) (a6989586621681076619 :: a6989586621681071227 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.Monad type Apply (MfilterSym0 :: TyFun (a6989586621681071227 ~> Bool) (m6989586621681071226 a6989586621681071227 ~> m6989586621681071226 a6989586621681071227) -> Type) (a6989586621681076619 :: a6989586621681071227 ~> Bool) = (MfilterSym1 a6989586621681076619 m6989586621681071226 :: TyFun (m6989586621681071226 a6989586621681071227) (m6989586621681071226 a6989586621681071227) -> Type)
type Apply (TFHelper_6989586621681113237Sym0 :: TyFun (Arg a6989586621681106445 b6989586621681106446) (Arg a6989586621681106445 b6989586621681106446 ~> Bool) -> Type) (a6989586621681113235 :: Arg a6989586621681106445 b6989586621681106446)
Instance details Defined in Data.Singletons.Prelude.Semigroup type Apply (TFHelper_6989586621681113237Sym0 :: TyFun (Arg a6989586621681106445 b6989586621681106446) (Arg a6989586621681106445 b6989586621681106446 ~> Bool) -> Type) (a6989586621681113235 :: Arg a6989586621681106445 b6989586621681106446) = TFHelper_6989586621681113237Sym1 a6989586621681113235
type Apply (Let6989586621680325834Scrutinee_6989586621680317257Sym0 :: TyFun (k1 ~> (k1 ~> Bool)) (TyFun k2 (TyFun k1 (TyFun k3 (TyFun [k1] Bool -> Type) -> Type) -> Type) -> Type) -> Type) (eq6989586621680325822 :: k1 ~> (k1 ~> Bool))
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680325834Scrutinee_6989586621680317257Sym0 :: TyFun (k1 ~> (k1 ~> Bool)) (TyFun k2 (TyFun k1 (TyFun k3 (TyFun [k1] Bool -> Type) -> Type) -> Type) -> Type) -> Type) (eq6989586621680325822 :: k1 ~> (k1 ~> Bool)) = (Let6989586621680325834Scrutinee_6989586621680317257Sym1 eq6989586621680325822 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun [k1] Bool -> Type) -> Type) -> Type) -> Type)
type Apply (Let6989586621680327161Scrutinee_6989586621680317229Sym0 :: TyFun (k1 ~> Bool) (TyFun k1 (TyFun [a6989586621680316670] (TyFun k Bool -> Type) -> Type) -> Type) -> Type) (p6989586621680327155 :: k1 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680327161Scrutinee_6989586621680317229Sym0 :: TyFun (k1 ~> Bool) (TyFun k1 (TyFun [a6989586621680316670] (TyFun k Bool -> Type) -> Type) -> Type) -> Type) (p6989586621680327155 :: k1 ~> Bool) = (Let6989586621680327161Scrutinee_6989586621680317229Sym1 p6989586621680327155 :: TyFun k1 (TyFun [a6989586621680316670] (TyFun k Bool -> Type) -> Type) -> Type)
type Apply (Lambda_6989586621681076633Sym0 :: TyFun (k1 ~> Bool) (TyFun k (TyFun k1 (m6989586621679943814 k1) -> Type) -> Type) -> Type) (p6989586621681076626 :: k1 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.Monad type Apply (Lambda_6989586621681076633Sym0 :: TyFun (k1 ~> Bool) (TyFun k (TyFun k1 (m6989586621679943814 k1) -> Type) -> Type) -> Type) (p6989586621681076626 :: k1 ~> Bool) = (Lambda_6989586621681076633Sym1 p6989586621681076626 :: TyFun k (TyFun k1 (m6989586621679943814 k1) -> Type) -> Type)
type Apply (Lambda_6989586621681076994Sym0 :: TyFun (k2 ~> f6989586621679943777 Bool) (TyFun k3 (TyFun k2 (TyFun (f6989586621679943777 [k2]) (f6989586621679943777 [k2]) -> Type) -> Type) -> Type) -> Type) (p6989586621681076989 :: k2 ~> f6989586621679943777 Bool)
Instance details Defined in Data.Singletons.Prelude.Monad type Apply (Lambda_6989586621681076994Sym0 :: TyFun (k2 ~> f6989586621679943777 Bool) (TyFun k3 (TyFun k2 (TyFun (f6989586621679943777 [k2]) (f6989586621679943777 [k2]) -> Type) -> Type) -> Type) -> Type) (p6989586621681076989 :: k2 ~> f6989586621679943777 Bool) = (Lambda_6989586621681076994Sym1 p6989586621681076989 :: TyFun k3 (TyFun k2 (TyFun (f6989586621679943777 [k2]) (f6989586621679943777 [k2]) -> Type) -> Type) -> Type)
type Apply (Lambda_6989586621680326816Sym0 :: TyFun (b6989586621679943818 ~> (a6989586621680316653 ~> Bool)) (TyFun k1 (TyFun k2 (TyFun a6989586621680316653 (TyFun [a6989586621680316653] (TyFun b6989586621679943818 (m6989586621679943814 b6989586621679943818) -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) (eq6989586621680326800 :: b6989586621679943818 ~> (a6989586621680316653 ~> Bool))
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Lambda_6989586621680326816Sym0 :: TyFun (b6989586621679943818 ~> (a6989586621680316653 ~> Bool)) (TyFun k1 (TyFun k2 (TyFun a6989586621680316653 (TyFun [a6989586621680316653] (TyFun b6989586621679943818 (m6989586621679943814 b6989586621679943818) -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) (eq6989586621680326800 :: b6989586621679943818 ~> (a6989586621680316653 ~> Bool)) = (Lambda_6989586621680326816Sym1 eq6989586621680326800 :: TyFun k1 (TyFun k2 (TyFun a6989586621680316653 (TyFun [a6989586621680316653] (TyFun b6989586621679943818 (m6989586621679943814 b6989586621679943818) -> Type) -> Type) -> Type) -> Type) -> Type)

data Char #

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

Bounded Char	Since: base-2.1
Instance details Defined in GHC.Enum Methods minBound :: Char # maxBound :: Char #
Enum Char	Since: base-2.1
Instance details Defined in GHC.Enum Methods succ :: Char -> Char # pred :: Char -> Char # toEnum :: Int -> Char # fromEnum :: Char -> Int # enumFrom :: Char -> [Char] # enumFromThen :: Char -> Char -> [Char] # enumFromTo :: Char -> Char -> [Char] # enumFromThenTo :: Char -> Char -> Char -> [Char] #
Eq Char
Instance details Defined in GHC.Classes Methods (==) :: Char -> Char -> Bool # (/=) :: Char -> Char -> Bool #
Ord Char
Instance details Defined in GHC.Classes Methods compare :: Char -> Char -> Ordering # (<) :: Char -> Char -> Bool # (<=) :: Char -> Char -> Bool # (>) :: Char -> Char -> Bool # (>=) :: Char -> Char -> Bool # max :: Char -> Char -> Char # min :: Char -> Char -> Char #
Read Char	Since: base-2.1
Instance details Defined in GHC.Read Methods readsPrec :: Int -> ReadS Char # readList :: ReadS [Char] # readPrec :: ReadPrec Char # readListPrec :: ReadPrec [Char] #
Show Char	Since: base-2.1
Instance details Defined in GHC.Show Methods showsPrec :: Int -> Char -> ShowS # show :: Char -> String # showList :: [Char] -> ShowS #
Ix Char	Since: base-2.1
Instance details Defined in GHC.Arr Methods range :: (Char, Char) -> [Char] # index :: (Char, Char) -> Char -> Int # unsafeIndex :: (Char, Char) -> Char -> Int inRange :: (Char, Char) -> Char -> Bool # rangeSize :: (Char, Char) -> Int # unsafeRangeSize :: (Char, Char) -> Int
Lift Char
Instance details Defined in Language.Haskell.TH.Syntax Methods lift :: Char -> Q Exp #
NFData Char
Instance details Defined in Control.DeepSeq Methods rnf :: Char -> () #
Hashable Char
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Char -> Int # hash :: Char -> Int #
Storable Char	Since: base-2.1
Instance details Defined in Foreign.Storable Methods sizeOf :: Char -> Int # alignment :: Char -> Int # peekElemOff :: Ptr Char -> Int -> IO Char # pokeElemOff :: Ptr Char -> Int -> Char -> IO () # peekByteOff :: Ptr b -> Int -> IO Char # pokeByteOff :: Ptr b -> Int -> Char -> IO () # peek :: Ptr Char -> IO Char # poke :: Ptr Char -> Char -> IO () #
Unbox Char
Instance details Defined in Data.Vector.Unboxed.Base
Prim Char
Instance details Defined in Data.Primitive.Types Methods sizeOf# :: Char -> Int# # alignment# :: Char -> Int# # indexByteArray# :: ByteArray# -> Int# -> Char # readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (#State# s, Char#) # writeByteArray# :: MutableByteArray# s -> Int# -> Char -> State# s -> State# s # setByteArray# :: MutableByteArray# s -> Int# -> Int# -> Char -> State# s -> State# s # indexOffAddr# :: Addr# -> Int# -> Char # readOffAddr# :: Addr# -> Int# -> State# s -> (#State# s, Char#) # writeOffAddr# :: Addr# -> Int# -> Char -> State# s -> State# s # setOffAddr# :: Addr# -> Int# -> Int# -> Char -> State# s -> State# s #
ErrorList Char
Instance details Defined in Control.Monad.Trans.Error Methods listMsg :: String -> [Char] #
ToBuilder Char Builder
Instance details Defined in Data.Builder Methods toBuilder :: Char -> Builder #
ToBuilder Char Builder
Instance details Defined in Data.Builder Methods toBuilder :: Char -> Builder #
Vector Vector Char
Instance details Defined in Data.Vector.Unboxed.Base Methods basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) Char -> m (Vector Char) # basicUnsafeThaw :: PrimMonad m => Vector Char -> m (Mutable Vector (PrimState m) Char) # basicLength :: Vector Char -> Int # basicUnsafeSlice :: Int -> Int -> Vector Char -> Vector Char # basicUnsafeIndexM :: Monad m => Vector Char -> Int -> m Char # basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) Char -> Vector Char -> m () # elemseq :: Vector Char -> Char -> b -> b #
MVector MVector Char
Instance details Defined in Data.Vector.Unboxed.Base Methods basicLength :: MVector s Char -> Int # basicUnsafeSlice :: Int -> Int -> MVector s Char -> MVector s Char # basicOverlaps :: MVector s Char -> MVector s Char -> Bool # basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) Char) # basicInitialize :: PrimMonad m => MVector (PrimState m) Char -> m () # basicUnsafeReplicate :: PrimMonad m => Int -> Char -> m (MVector (PrimState m) Char) # basicUnsafeRead :: PrimMonad m => MVector (PrimState m) Char -> Int -> m Char # basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) Char -> Int -> Char -> m () # basicClear :: PrimMonad m => MVector (PrimState m) Char -> m () # basicSet :: PrimMonad m => MVector (PrimState m) Char -> Char -> m () # basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) Char -> MVector (PrimState m) Char -> m () # basicUnsafeMove :: PrimMonad m => MVector (PrimState m) Char -> MVector (PrimState m) Char -> m () # basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) Char -> Int -> m (MVector (PrimState m) Char) #
KnownSymbol n => Reifies (n :: Symbol) String
Instance details Defined in Data.Reflection Methods reflect :: proxy n -> String #
Generic1 (URec Char :: k -> Type)
Instance details Defined in GHC.Generics Associated Types type Rep1 (URec Char) :: k -> Type # Methods from1 :: URec Char a -> Rep1 (URec Char) a # to1 :: Rep1 (URec Char) a -> URec Char a #
IsGValue (Maybe String)
Instance details Defined in Data.GI.Base.GValue Methods toGValue :: Maybe String -> IO GValue # fromGValue :: GValue -> IO (Maybe String) #
Functor (URec Char :: Type -> Type)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods fmap :: (a -> b) -> URec Char a -> URec Char b # (<$) :: a -> URec Char b -> URec Char a #
Foldable (URec Char :: Type -> Type)	Since: base-4.9.0.0
Instance details 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] # null :: URec Char a -> Bool # 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 # sum :: Num a => URec Char a -> a # product :: Num a => URec Char a -> a #
Traversable (URec Char :: Type -> Type)	Since: base-4.9.0.0
Instance details Defined in Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> URec Char a -> f (URec Char b) # sequenceA :: Applicative f => URec Char (f a) -> f (URec Char a) # mapM :: Monad m => (a -> m b) -> URec Char a -> m (URec Char b) # sequence :: Monad m => URec Char (m a) -> m (URec Char a) #
Eq (URec Char p)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods (==) :: URec Char p -> URec Char p -> Bool # (/=) :: URec Char p -> URec Char p -> Bool #
Ord (URec Char p)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods compare :: URec Char p -> URec Char p -> Ordering # (<) :: URec Char p -> URec Char p -> Bool # (<=) :: URec Char p -> URec Char p -> Bool # (>) :: URec Char p -> URec Char p -> Bool # (>=) :: URec Char p -> URec Char p -> Bool # max :: URec Char p -> URec Char p -> URec Char p # min :: URec Char p -> URec Char p -> URec Char p #
Show (URec Char p)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods showsPrec :: Int -> URec Char p -> ShowS # show :: URec Char p -> String # showList :: [URec Char p] -> ShowS #
Generic (URec Char p)
Instance details Defined in GHC.Generics Associated Types type Rep (URec Char p) :: Type -> Type # Methods from :: URec Char p -> Rep (URec Char p) x # to :: Rep (URec Char p) x -> URec Char p #
newtype Vector Char
Instance details Defined in Data.Vector.Unboxed.Base newtype Vector Char = V_Char (Vector Char)
data URec Char (p :: k)	Used for marking occurrences of `Char#` Since: base-4.9.0.0
Instance details Defined in GHC.Generics data URec Char (p :: k) = UChar { uChar# :: Char# }
newtype MVector s Char
Instance details Defined in Data.Vector.Unboxed.Base newtype MVector s Char = MV_Char (MVector s Char)
type Rep1 (URec Char :: k -> Type)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics type Rep1 (URec Char :: k -> Type) = D1 (MetaData "URec" "GHC.Generics" "base" False) (C1 (MetaCons "UChar" PrefixI True) (S1 (MetaSel (Just "uChar#") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (UChar :: k -> Type)))
type Rep (URec Char p)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics type Rep (URec Char p) = D1 (MetaData "URec" "GHC.Generics" "base" False) (C1 (MetaCons "UChar" PrefixI True) (S1 (MetaSel (Just "uChar#") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (UChar :: Type -> Type)))

data Double #

Double-precision floating point numbers. It is desirable that this type be at least equal in range and precision to the IEEE double-precision type.

Instances

Eq Double	Note that due to the presence of `NaN`, `Double`'s `Eq` instance does not satisfy reflexivity. `>>>` `0/0 == (0/0 :: Double)`False Also note that `Double`'s `Eq` instance does not satisfy substitutivity: `>>>` `0 == (-0 :: Double)`True `>>>` `recip 0 == recip (-0 :: Double)`False
Instance details Defined in GHC.Classes Methods (==) :: Double -> Double -> Bool # (/=) :: Double -> Double -> Bool #
Floating Double	Since: base-2.1
Instance details Defined in GHC.Float Methods pi :: Double # exp :: Double -> Double # log :: Double -> Double # sqrt :: Double -> Double # (**) :: Double -> Double -> Double # logBase :: Double -> Double -> Double # sin :: Double -> Double # cos :: Double -> Double # tan :: Double -> Double # asin :: Double -> Double # acos :: Double -> Double # atan :: Double -> Double # sinh :: Double -> Double # cosh :: Double -> Double # tanh :: Double -> Double # asinh :: Double -> Double # acosh :: Double -> Double # atanh :: Double -> Double # log1p :: Double -> Double # expm1 :: Double -> Double # log1pexp :: Double -> Double # log1mexp :: Double -> Double #
Ord Double	Note that due to the presence of `NaN`, `Double`'s `Ord` instance does not satisfy reflexivity. `>>>` `0/0 <= (0/0 :: Double)`False Also note that, due to the same, `Ord`'s operator interactions are not respected by `Double`'s instance: `>>>` `(0/0 :: Double) > 1`False `>>>` `compare (0/0 :: Double) 1`GT
Instance details Defined in GHC.Classes Methods compare :: Double -> Double -> Ordering # (<) :: Double -> Double -> Bool # (<=) :: Double -> Double -> Bool # (>) :: Double -> Double -> Bool # (>=) :: Double -> Double -> Bool # max :: Double -> Double -> Double # min :: Double -> Double -> Double #
Read Double	Since: base-2.1
Instance details Defined in GHC.Read Methods readsPrec :: Int -> ReadS Double # readList :: ReadS [Double] # readPrec :: ReadPrec Double # readListPrec :: ReadPrec [Double] #
RealFloat Double	Since: base-2.1
Instance details Defined in GHC.Float Methods floatRadix :: Double -> Integer # floatDigits :: Double -> Int # floatRange :: Double -> (Int, Int) # decodeFloat :: Double -> (Integer, Int) # encodeFloat :: Integer -> Int -> Double # exponent :: Double -> Int # significand :: Double -> Double # scaleFloat :: Int -> Double -> Double # isNaN :: Double -> Bool # isInfinite :: Double -> Bool # isDenormalized :: Double -> Bool # isNegativeZero :: Double -> Bool # isIEEE :: Double -> Bool # atan2 :: Double -> Double -> Double #
Lift Double
Instance details Defined in Language.Haskell.TH.Syntax Methods lift :: Double -> Q Exp #
NFData Double
Instance details Defined in Control.DeepSeq Methods rnf :: Double -> () #
Hashable Double
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Double -> Int # hash :: Double -> Int #
Storable Double	Since: base-2.1
Instance details Defined in Foreign.Storable Methods sizeOf :: Double -> Int # alignment :: Double -> Int # peekElemOff :: Ptr Double -> Int -> IO Double # pokeElemOff :: Ptr Double -> Int -> Double -> IO () # peekByteOff :: Ptr b -> Int -> IO Double # pokeByteOff :: Ptr b -> Int -> Double -> IO () # peek :: Ptr Double -> IO Double # poke :: Ptr Double -> Double -> IO () #
Unbox Double
Instance details Defined in Data.Vector.Unboxed.Base
Prim Double
Instance details Defined in Data.Primitive.Types Methods sizeOf# :: Double -> Int# # alignment# :: Double -> Int# # indexByteArray# :: ByteArray# -> Int# -> Double # readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (#State# s, Double#) # writeByteArray# :: MutableByteArray# s -> Int# -> Double -> State# s -> State# s # setByteArray# :: MutableByteArray# s -> Int# -> Int# -> Double -> State# s -> State# s # indexOffAddr# :: Addr# -> Int# -> Double # readOffAddr# :: Addr# -> Int# -> State# s -> (#State# s, Double#) # writeOffAddr# :: Addr# -> Int# -> Double -> State# s -> State# s # setOffAddr# :: Addr# -> Int# -> Int# -> Double -> State# s -> State# s #
Default Double
Instance details Defined in Data.Default.Class Methods def :: Double #
IsGValue Double
Instance details Defined in Data.GI.Base.GValue Methods toGValue :: Double -> IO GValue # fromGValue :: GValue -> IO Double #
Vector Vector Double
Instance details Defined in Data.Vector.Unboxed.Base Methods basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) Double -> m (Vector Double) # basicUnsafeThaw :: PrimMonad m => Vector Double -> m (Mutable Vector (PrimState m) Double) # basicLength :: Vector Double -> Int # basicUnsafeSlice :: Int -> Int -> Vector Double -> Vector Double # basicUnsafeIndexM :: Monad m => Vector Double -> Int -> m Double # basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) Double -> Vector Double -> m () # elemseq :: Vector Double -> Double -> b -> b #
MVector MVector Double
Instance details Defined in Data.Vector.Unboxed.Base Methods basicLength :: MVector s Double -> Int # basicUnsafeSlice :: Int -> Int -> MVector s Double -> MVector s Double # basicOverlaps :: MVector s Double -> MVector s Double -> Bool # basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) Double) # basicInitialize :: PrimMonad m => MVector (PrimState m) Double -> m () # basicUnsafeReplicate :: PrimMonad m => Int -> Double -> m (MVector (PrimState m) Double) # basicUnsafeRead :: PrimMonad m => MVector (PrimState m) Double -> Int -> m Double # basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) Double -> Int -> Double -> m () # basicClear :: PrimMonad m => MVector (PrimState m) Double -> m () # basicSet :: PrimMonad m => MVector (PrimState m) Double -> Double -> m () # basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) Double -> MVector (PrimState m) Double -> m () # basicUnsafeMove :: PrimMonad m => MVector (PrimState m) Double -> MVector (PrimState m) Double -> m () # basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) Double -> Int -> m (MVector (PrimState m) Double) #
Generic1 (URec Double :: k -> Type)
Instance details Defined in GHC.Generics Associated Types type Rep1 (URec Double) :: k -> Type # Methods from1 :: URec Double a -> Rep1 (URec Double) a # to1 :: Rep1 (URec Double) a -> URec Double a #
Functor (URec Double :: Type -> Type)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods fmap :: (a -> b) -> URec Double a -> URec Double b # (<$) :: a -> URec Double b -> URec Double a #
Foldable (URec Double :: Type -> Type)	Since: base-4.9.0.0
Instance details 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 # sum :: Num a => URec Double a -> a # product :: Num a => URec Double a -> a #
Traversable (URec Double :: Type -> Type)	Since: base-4.9.0.0
Instance details Defined in Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> URec Double a -> f (URec Double b) # sequenceA :: Applicative f => URec Double (f a) -> f (URec Double a) # mapM :: Monad m => (a -> m b) -> URec Double a -> m (URec Double b) # sequence :: Monad m => URec Double (m a) -> m (URec Double a) #
Eq (URec Double p)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods (==) :: URec Double p -> URec Double p -> Bool # (/=) :: URec Double p -> URec Double p -> Bool #
Ord (URec Double p)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods compare :: URec Double p -> URec Double p -> Ordering # (<) :: URec Double p -> URec Double p -> Bool # (<=) :: URec Double p -> URec Double p -> Bool # (>) :: URec Double p -> URec Double p -> Bool # (>=) :: URec Double p -> URec Double p -> Bool # max :: URec Double p -> URec Double p -> URec Double p # min :: URec Double p -> URec Double p -> URec Double p #
Show (URec Double p)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods showsPrec :: Int -> URec Double p -> ShowS # show :: URec Double p -> String # showList :: [URec Double p] -> ShowS #
Generic (URec Double p)
Instance details Defined in GHC.Generics Associated Types type Rep (URec Double p) :: Type -> Type # Methods from :: URec Double p -> Rep (URec Double p) x # to :: Rep (URec Double p) x -> URec Double p #
newtype Vector Double
Instance details Defined in Data.Vector.Unboxed.Base newtype Vector Double = V_Double (Vector Double)
data URec Double (p :: k)	Used for marking occurrences of `Double#` Since: base-4.9.0.0
Instance details Defined in GHC.Generics data URec Double (p :: k) = UDouble { uDouble# :: Double# }
newtype MVector s Double
Instance details Defined in Data.Vector.Unboxed.Base newtype MVector s Double = MV_Double (MVector s Double)
type Rep1 (URec Double :: k -> Type)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics type Rep1 (URec Double :: k -> Type) = D1 (MetaData "URec" "GHC.Generics" "base" False) (C1 (MetaCons "UDouble" PrefixI True) (S1 (MetaSel (Just "uDouble#") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (UDouble :: k -> Type)))
type Rep (URec Double p)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics type Rep (URec Double p) = D1 (MetaData "URec" "GHC.Generics" "base" False) (C1 (MetaCons "UDouble" PrefixI True) (S1 (MetaSel (Just "uDouble#") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (UDouble :: Type -> Type)))

data Float #

Single-precision floating point numbers. It is desirable that this type be at least equal in range and precision to the IEEE single-precision type.

Instances

Eq Float	Note that due to the presence of `NaN`, `Float`'s `Eq` instance does not satisfy reflexivity. `>>>` `0/0 == (0/0 :: Float)`False Also note that `Float`'s `Eq` instance does not satisfy substitutivity: `>>>` `0 == (-0 :: Float)`True `>>>` `recip 0 == recip (-0 :: Float)`False
Instance details Defined in GHC.Classes Methods (==) :: Float -> Float -> Bool # (/=) :: Float -> Float -> Bool #
Floating Float	Since: base-2.1
Instance details Defined in GHC.Float Methods pi :: Float # exp :: Float -> Float # log :: Float -> Float # sqrt :: Float -> Float # (**) :: Float -> Float -> Float # logBase :: Float -> Float -> Float # sin :: Float -> Float # cos :: Float -> Float # tan :: Float -> Float # asin :: Float -> Float # acos :: Float -> Float # atan :: Float -> Float # sinh :: Float -> Float # cosh :: Float -> Float # tanh :: Float -> Float # asinh :: Float -> Float # acosh :: Float -> Float # atanh :: Float -> Float # log1p :: Float -> Float # expm1 :: Float -> Float # log1pexp :: Float -> Float # log1mexp :: Float -> Float #
Ord Float	Note that due to the presence of `NaN`, `Float`'s `Ord` instance does not satisfy reflexivity. `>>>` `0/0 <= (0/0 :: Float)`False Also note that, due to the same, `Ord`'s operator interactions are not respected by `Float`'s instance: `>>>` `(0/0 :: Float) > 1`False `>>>` `compare (0/0 :: Float) 1`GT
Instance details Defined in GHC.Classes Methods compare :: Float -> Float -> Ordering # (<) :: Float -> Float -> Bool # (<=) :: Float -> Float -> Bool # (>) :: Float -> Float -> Bool # (>=) :: Float -> Float -> Bool # max :: Float -> Float -> Float # min :: Float -> Float -> Float #
Read Float	Since: base-2.1
Instance details Defined in GHC.Read Methods readsPrec :: Int -> ReadS Float # readList :: ReadS [Float] # readPrec :: ReadPrec Float # readListPrec :: ReadPrec [Float] #
RealFloat Float	Since: base-2.1
Instance details Defined in GHC.Float Methods floatRadix :: Float -> Integer # floatDigits :: Float -> Int # floatRange :: Float -> (Int, Int) # decodeFloat :: Float -> (Integer, Int) # encodeFloat :: Integer -> Int -> Float # exponent :: Float -> Int # significand :: Float -> Float # scaleFloat :: Int -> Float -> Float # isNaN :: Float -> Bool # isInfinite :: Float -> Bool # isDenormalized :: Float -> Bool # isNegativeZero :: Float -> Bool # isIEEE :: Float -> Bool # atan2 :: Float -> Float -> Float #
Lift Float
Instance details Defined in Language.Haskell.TH.Syntax Methods lift :: Float -> Q Exp #
NFData Float
Instance details Defined in Control.DeepSeq Methods rnf :: Float -> () #
Hashable Float
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Float -> Int # hash :: Float -> Int #
Storable Float	Since: base-2.1
Instance details Defined in Foreign.Storable Methods sizeOf :: Float -> Int # alignment :: Float -> Int # peekElemOff :: Ptr Float -> Int -> IO Float # pokeElemOff :: Ptr Float -> Int -> Float -> IO () # peekByteOff :: Ptr b -> Int -> IO Float # pokeByteOff :: Ptr b -> Int -> Float -> IO () # peek :: Ptr Float -> IO Float # poke :: Ptr Float -> Float -> IO () #
Unbox Float
Instance details Defined in Data.Vector.Unboxed.Base
Prim Float
Instance details Defined in Data.Primitive.Types Methods sizeOf# :: Float -> Int# # alignment# :: Float -> Int# # indexByteArray# :: ByteArray# -> Int# -> Float # readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (#State# s, Float#) # writeByteArray# :: MutableByteArray# s -> Int# -> Float -> State# s -> State# s # setByteArray# :: MutableByteArray# s -> Int# -> Int# -> Float -> State# s -> State# s # indexOffAddr# :: Addr# -> Int# -> Float # readOffAddr# :: Addr# -> Int# -> State# s -> (#State# s, Float#) # writeOffAddr# :: Addr# -> Int# -> Float -> State# s -> State# s # setOffAddr# :: Addr# -> Int# -> Int# -> Float -> State# s -> State# s #
Default Float
Instance details Defined in Data.Default.Class Methods def :: Float #
IsGValue Float
Instance details Defined in Data.GI.Base.GValue Methods toGValue :: Float -> IO GValue # fromGValue :: GValue -> IO Float #
Vector Vector Float
Instance details Defined in Data.Vector.Unboxed.Base Methods basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) Float -> m (Vector Float) # basicUnsafeThaw :: PrimMonad m => Vector Float -> m (Mutable Vector (PrimState m) Float) # basicLength :: Vector Float -> Int # basicUnsafeSlice :: Int -> Int -> Vector Float -> Vector Float # basicUnsafeIndexM :: Monad m => Vector Float -> Int -> m Float # basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) Float -> Vector Float -> m () # elemseq :: Vector Float -> Float -> b -> b #
MVector MVector Float
Instance details Defined in Data.Vector.Unboxed.Base Methods basicLength :: MVector s Float -> Int # basicUnsafeSlice :: Int -> Int -> MVector s Float -> MVector s Float # basicOverlaps :: MVector s Float -> MVector s Float -> Bool # basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) Float) # basicInitialize :: PrimMonad m => MVector (PrimState m) Float -> m () # basicUnsafeReplicate :: PrimMonad m => Int -> Float -> m (MVector (PrimState m) Float) # basicUnsafeRead :: PrimMonad m => MVector (PrimState m) Float -> Int -> m Float # basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) Float -> Int -> Float -> m () # basicClear :: PrimMonad m => MVector (PrimState m) Float -> m () # basicSet :: PrimMonad m => MVector (PrimState m) Float -> Float -> m () # basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) Float -> MVector (PrimState m) Float -> m () # basicUnsafeMove :: PrimMonad m => MVector (PrimState m) Float -> MVector (PrimState m) Float -> m () # basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) Float -> Int -> m (MVector (PrimState m) Float) #
Generic1 (URec Float :: k -> Type)
Instance details Defined in GHC.Generics Associated Types type Rep1 (URec Float) :: k -> Type # Methods from1 :: URec Float a -> Rep1 (URec Float) a # to1 :: Rep1 (URec Float) a -> URec Float a #
Functor (URec Float :: Type -> Type)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods fmap :: (a -> b) -> URec Float a -> URec Float b # (<$) :: a -> URec Float b -> URec Float a #
Foldable (URec Float :: Type -> Type)	Since: base-4.9.0.0
Instance details 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 # sum :: Num a => URec Float a -> a # product :: Num a => URec Float a -> a #
Traversable (URec Float :: Type -> Type)	Since: base-4.9.0.0
Instance details Defined in Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> URec Float a -> f (URec Float b) # sequenceA :: Applicative f => URec Float (f a) -> f (URec Float a) # mapM :: Monad m => (a -> m b) -> URec Float a -> m (URec Float b) # sequence :: Monad m => URec Float (m a) -> m (URec Float a) #
Eq (URec Float p)
Instance details Defined in GHC.Generics Methods (==) :: URec Float p -> URec Float p -> Bool # (/=) :: URec Float p -> URec Float p -> Bool #
Ord (URec Float p)
Instance details Defined in GHC.Generics Methods compare :: URec Float p -> URec Float p -> Ordering # (<) :: URec Float p -> URec Float p -> Bool # (<=) :: URec Float p -> URec Float p -> Bool # (>) :: URec Float p -> URec Float p -> Bool # (>=) :: URec Float p -> URec Float p -> Bool # max :: URec Float p -> URec Float p -> URec Float p # min :: URec Float p -> URec Float p -> URec Float p #
Show (URec Float p)
Instance details Defined in GHC.Generics Methods showsPrec :: Int -> URec Float p -> ShowS # show :: URec Float p -> String # showList :: [URec Float p] -> ShowS #
Generic (URec Float p)
Instance details Defined in GHC.Generics Associated Types type Rep (URec Float p) :: Type -> Type # Methods from :: URec Float p -> Rep (URec Float p) x # to :: Rep (URec Float p) x -> URec Float p #
newtype Vector Float
Instance details Defined in Data.Vector.Unboxed.Base newtype Vector Float = V_Float (Vector Float)
data URec Float (p :: k)	Used for marking occurrences of `Float#` Since: base-4.9.0.0
Instance details Defined in GHC.Generics data URec Float (p :: k) = UFloat { uFloat# :: Float# }
newtype MVector s Float
Instance details Defined in Data.Vector.Unboxed.Base newtype MVector s Float = MV_Float (MVector s Float)
type Rep1 (URec Float :: k -> Type)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics type Rep1 (URec Float :: k -> Type) = D1 (MetaData "URec" "GHC.Generics" "base" False) (C1 (MetaCons "UFloat" PrefixI True) (S1 (MetaSel (Just "uFloat#") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (UFloat :: k -> Type)))
type Rep (URec Float p)
Instance details Defined in GHC.Generics type Rep (URec Float p) = D1 (MetaData "URec" "GHC.Generics" "base" False) (C1 (MetaCons "UFloat" PrefixI True) (S1 (MetaSel (Just "uFloat#") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (UFloat :: Type -> Type)))

data Int #

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

Bounded Int	Since: base-2.1
Instance details Defined in GHC.Enum Methods minBound :: Int # maxBound :: Int #
Enum Int	Since: base-2.1
Instance details Defined in GHC.Enum Methods succ :: Int -> Int # pred :: Int -> Int # toEnum :: Int -> Int # fromEnum :: Int -> Int # enumFrom :: Int -> [Int] # enumFromThen :: Int -> Int -> [Int] # enumFromTo :: Int -> Int -> [Int] # enumFromThenTo :: Int -> Int -> Int -> [Int] #
Eq Int
Instance details Defined in GHC.Classes Methods (==) :: Int -> Int -> Bool # (/=) :: Int -> Int -> Bool #
Integral Int	Since: base-2.0.1
Instance details Defined in GHC.Real Methods quot :: Int -> Int -> Int # rem :: Int -> Int -> Int # div :: Int -> Int -> Int # mod :: Int -> Int -> Int # quotRem :: Int -> Int -> (Int, Int) # divMod :: Int -> Int -> (Int, Int) # toInteger :: Int -> Integer #
Num Int	Since: base-2.1
Instance details Defined in GHC.Num Methods (+) :: Int -> Int -> Int # (-) :: Int -> Int -> Int # (*) :: Int -> Int -> Int # negate :: Int -> Int # abs :: Int -> Int # signum :: Int -> Int # fromInteger :: Integer -> Int #
Ord Int
Instance details Defined in GHC.Classes Methods compare :: Int -> Int -> Ordering # (<) :: Int -> Int -> Bool # (<=) :: Int -> Int -> Bool # (>) :: Int -> Int -> Bool # (>=) :: Int -> Int -> Bool # max :: Int -> Int -> Int # min :: Int -> Int -> Int #
Read Int	Since: base-2.1
Instance details Defined in GHC.Read Methods readsPrec :: Int -> ReadS Int # readList :: ReadS [Int] # readPrec :: ReadPrec Int # readListPrec :: ReadPrec [Int] #
Real Int	Since: base-2.0.1
Instance details Defined in GHC.Real Methods toRational :: Int -> Rational #
Show Int	Since: base-2.1
Instance details Defined in GHC.Show Methods showsPrec :: Int -> Int -> ShowS # show :: Int -> String # showList :: [Int] -> ShowS #
Ix Int	Since: base-2.1
Instance details Defined in GHC.Arr Methods range :: (Int, Int) -> [Int] # index :: (Int, Int) -> Int -> Int # unsafeIndex :: (Int, Int) -> Int -> Int inRange :: (Int, Int) -> Int -> Bool # rangeSize :: (Int, Int) -> Int # unsafeRangeSize :: (Int, Int) -> Int
Lift Int
Instance details Defined in Language.Haskell.TH.Syntax Methods lift :: Int -> Q Exp #
NFData Int
Instance details Defined in Control.DeepSeq Methods rnf :: Int -> () #
Hashable Int
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Int -> Int # hash :: Int -> Int #
Storable Int	Since: base-2.1
Instance details Defined in Foreign.Storable Methods sizeOf :: Int -> Int # alignment :: Int -> Int # peekElemOff :: Ptr Int -> Int -> IO Int # pokeElemOff :: Ptr Int -> Int -> Int -> IO () # peekByteOff :: Ptr b -> Int -> IO Int # pokeByteOff :: Ptr b -> Int -> Int -> IO () # peek :: Ptr Int -> IO Int # poke :: Ptr Int -> Int -> IO () #
Unbox Int
Instance details Defined in Data.Vector.Unboxed.Base
Prim Int
Instance details Defined in Data.Primitive.Types Methods sizeOf# :: Int -> Int# # alignment# :: Int -> Int# # indexByteArray# :: ByteArray# -> Int# -> Int # readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (#State# s, Int#) # writeByteArray# :: MutableByteArray# s -> Int# -> Int -> State# s -> State# s # setByteArray# :: MutableByteArray# s -> Int# -> Int# -> Int -> State# s -> State# s # indexOffAddr# :: Addr# -> Int# -> Int # readOffAddr# :: Addr# -> Int# -> State# s -> (#State# s, Int#) # writeOffAddr# :: Addr# -> Int# -> Int -> State# s -> State# s # setOffAddr# :: Addr# -> Int# -> Int# -> Int -> State# s -> State# s #
Default Int
Instance details Defined in Data.Default.Class Methods def :: Int #
Vector Vector Int
Instance details Defined in Data.Vector.Unboxed.Base Methods basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) Int -> m (Vector Int) # basicUnsafeThaw :: PrimMonad m => Vector Int -> m (Mutable Vector (PrimState m) Int) # basicLength :: Vector Int -> Int # basicUnsafeSlice :: Int -> Int -> Vector Int -> Vector Int # basicUnsafeIndexM :: Monad m => Vector Int -> Int -> m Int # basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) Int -> Vector Int -> m () # elemseq :: Vector Int -> Int -> b -> b #
FunctorWithIndex Int []	The position in the list is available as the index.
Instance details Defined in Control.Lens.Indexed Methods imap :: (Int -> a -> b) -> [a] -> [b] # imapped :: IndexedSetter Int [a] [b] a b #
FunctorWithIndex Int ZipList	Same instance as for `[]`.
Instance details Defined in Control.Lens.Indexed Methods imap :: (Int -> a -> b) -> ZipList a -> ZipList b # imapped :: IndexedSetter Int (ZipList a) (ZipList b) a b #
FunctorWithIndex Int NonEmpty
Instance details Defined in Control.Lens.Indexed Methods imap :: (Int -> a -> b) -> NonEmpty a -> NonEmpty b # imapped :: IndexedSetter Int (NonEmpty a) (NonEmpty b) a b #
FunctorWithIndex Int Vector
Instance details Defined in Control.Lens.Indexed Methods imap :: (Int -> a -> b) -> Vector a -> Vector b # imapped :: IndexedSetter Int (Vector a) (Vector b) a b #
FunctorWithIndex Int Seq	The position in the `Seq` is available as the index.
Instance details Defined in Control.Lens.Indexed Methods imap :: (Int -> a -> b) -> Seq a -> Seq b # imapped :: IndexedSetter Int (Seq a) (Seq b) a b #
FunctorWithIndex Int IntMap
Instance details Defined in Control.Lens.Indexed Methods imap :: (Int -> a -> b) -> IntMap a -> IntMap b # imapped :: IndexedSetter Int (IntMap a) (IntMap b) a b #
FoldableWithIndex Int []
Instance details Defined in Control.Lens.Indexed Methods ifoldMap :: Monoid m => (Int -> a -> m) -> [a] -> m # ifolded :: IndexedFold Int [a] a # ifoldr :: (Int -> a -> b -> b) -> b -> [a] -> b # ifoldl :: (Int -> b -> a -> b) -> b -> [a] -> b # ifoldr' :: (Int -> a -> b -> b) -> b -> [a] -> b # ifoldl' :: (Int -> b -> a -> b) -> b -> [a] -> b #
FoldableWithIndex Int ZipList
Instance details Defined in Control.Lens.Indexed Methods ifoldMap :: Monoid m => (Int -> a -> m) -> ZipList a -> m # ifolded :: IndexedFold Int (ZipList a) a # ifoldr :: (Int -> a -> b -> b) -> b -> ZipList a -> b # ifoldl :: (Int -> b -> a -> b) -> b -> ZipList a -> b # ifoldr' :: (Int -> a -> b -> b) -> b -> ZipList a -> b # ifoldl' :: (Int -> b -> a -> b) -> b -> ZipList a -> b #
FoldableWithIndex Int NonEmpty
Instance details Defined in Control.Lens.Indexed Methods ifoldMap :: Monoid m => (Int -> a -> m) -> NonEmpty a -> m # ifolded :: IndexedFold Int (NonEmpty a) a # ifoldr :: (Int -> a -> b -> b) -> b -> NonEmpty a -> b # ifoldl :: (Int -> b -> a -> b) -> b -> NonEmpty a -> b # ifoldr' :: (Int -> a -> b -> b) -> b -> NonEmpty a -> b # ifoldl' :: (Int -> b -> a -> b) -> b -> NonEmpty a -> b #
FoldableWithIndex Int Vector
Instance details Defined in Control.Lens.Indexed Methods ifoldMap :: Monoid m => (Int -> a -> m) -> Vector a -> m # ifolded :: IndexedFold Int (Vector a) a # ifoldr :: (Int -> a -> b -> b) -> b -> Vector a -> b # ifoldl :: (Int -> b -> a -> b) -> b -> Vector a -> b # ifoldr' :: (Int -> a -> b -> b) -> b -> Vector a -> b # ifoldl' :: (Int -> b -> a -> b) -> b -> Vector a -> b #
FoldableWithIndex Int Seq
Instance details Defined in Control.Lens.Indexed Methods ifoldMap :: Monoid m => (Int -> a -> m) -> Seq a -> m # ifolded :: IndexedFold Int (Seq a) a # ifoldr :: (Int -> a -> b -> b) -> b -> Seq a -> b # ifoldl :: (Int -> b -> a -> b) -> b -> Seq a -> b # ifoldr' :: (Int -> a -> b -> b) -> b -> Seq a -> b # ifoldl' :: (Int -> b -> a -> b) -> b -> Seq a -> b #
FoldableWithIndex Int IntMap
Instance details Defined in Control.Lens.Indexed Methods ifoldMap :: Monoid m => (Int -> a -> m) -> IntMap a -> m # ifolded :: IndexedFold Int (IntMap a) a # ifoldr :: (Int -> a -> b -> b) -> b -> IntMap a -> b # ifoldl :: (Int -> b -> a -> b) -> b -> IntMap a -> b # ifoldr' :: (Int -> a -> b -> b) -> b -> IntMap a -> b # ifoldl' :: (Int -> b -> a -> b) -> b -> IntMap a -> b #
TraversableWithIndex Int []
Instance details Defined in Control.Lens.Indexed Methods itraverse :: Applicative f => (Int -> a -> f b) -> [a] -> f [b] # itraversed :: IndexedTraversal Int [a] [b] a b #
TraversableWithIndex Int ZipList
Instance details Defined in Control.Lens.Indexed Methods itraverse :: Applicative f => (Int -> a -> f b) -> ZipList a -> f (ZipList b) # itraversed :: IndexedTraversal Int (ZipList a) (ZipList b) a b #
TraversableWithIndex Int NonEmpty
Instance details Defined in Control.Lens.Indexed Methods itraverse :: Applicative f => (Int -> a -> f b) -> NonEmpty a -> f (NonEmpty b) # itraversed :: IndexedTraversal Int (NonEmpty a) (NonEmpty b) a b #
TraversableWithIndex Int Vector
Instance details Defined in Control.Lens.Indexed Methods itraverse :: Applicative f => (Int -> a -> f b) -> Vector a -> f (Vector b) # itraversed :: IndexedTraversal Int (Vector a) (Vector b) a b #
TraversableWithIndex Int Seq
Instance details 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 #
TraversableWithIndex Int IntMap
Instance details Defined in Control.Lens.Indexed Methods itraverse :: Applicative f => (Int -> a -> f b) -> IntMap a -> f (IntMap b) # itraversed :: IndexedTraversal Int (IntMap a) (IntMap b) a b #
MVector MVector Int
Instance details Defined in Data.Vector.Unboxed.Base Methods basicLength :: MVector s Int -> Int # basicUnsafeSlice :: Int -> Int -> MVector s Int -> MVector s Int # basicOverlaps :: MVector s Int -> MVector s Int -> Bool # basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) Int) # basicInitialize :: PrimMonad m => MVector (PrimState m) Int -> m () # basicUnsafeReplicate :: PrimMonad m => Int -> Int -> m (MVector (PrimState m) Int) # basicUnsafeRead :: PrimMonad m => MVector (PrimState m) Int -> Int -> m Int # basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) Int -> Int -> Int -> m () # basicClear :: PrimMonad m => MVector (PrimState m) Int -> m () # basicSet :: PrimMonad m => MVector (PrimState m) Int -> Int -> m () # basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) Int -> MVector (PrimState m) Int -> m () # basicUnsafeMove :: PrimMonad m => MVector (PrimState m) Int -> MVector (PrimState m) Int -> m () # basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) Int -> Int -> m (MVector (PrimState m) Int) #
Generic1 (URec Int :: k -> Type)
Instance details Defined in GHC.Generics Associated Types type Rep1 (URec Int) :: k -> Type # Methods from1 :: URec Int a -> Rep1 (URec Int) a # to1 :: Rep1 (URec Int) a -> URec Int a #
FunctorWithIndex [Int] Tree
Instance details Defined in Control.Lens.Indexed Methods imap :: ([Int] -> a -> b) -> Tree a -> Tree b # imapped :: IndexedSetter [Int] (Tree a) (Tree b) a b #
FoldableWithIndex [Int] Tree
Instance details Defined in Control.Lens.Indexed Methods ifoldMap :: Monoid m => ([Int] -> a -> m) -> Tree a -> m # ifolded :: IndexedFold [Int] (Tree a) a # ifoldr :: ([Int] -> a -> b -> b) -> b -> Tree a -> b # ifoldl :: ([Int] -> b -> a -> b) -> b -> Tree a -> b # ifoldr' :: ([Int] -> a -> b -> b) -> b -> Tree a -> b # ifoldl' :: ([Int] -> b -> a -> b) -> b -> Tree a -> b #
TraversableWithIndex [Int] Tree
Instance details Defined in Control.Lens.Indexed Methods itraverse :: Applicative f => ([Int] -> a -> f b) -> Tree a -> f (Tree b) # itraversed :: IndexedTraversal [Int] (Tree a) (Tree b) a b #
Reifies Z Int
Instance details Defined in Data.Reflection Methods reflect :: proxy Z -> Int #
Reifies n Int => Reifies (D n :: Type) Int
Instance details Defined in Data.Reflection Methods reflect :: proxy (D n) -> Int #
Reifies n Int => Reifies (SD n :: Type) Int
Instance details Defined in Data.Reflection Methods reflect :: proxy (SD n) -> Int #
Reifies n Int => Reifies (PD n :: Type) Int
Instance details Defined in Data.Reflection Methods reflect :: proxy (PD n) -> Int #
Functor (URec Int :: Type -> Type)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods fmap :: (a -> b) -> URec Int a -> URec Int b # (<$) :: a -> URec Int b -> URec Int a #
Foldable (URec Int :: Type -> Type)	Since: base-4.9.0.0
Instance details 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 # toList :: URec Int a -> [a] # null :: URec Int a -> Bool # length :: URec Int a -> Int # elem :: Eq a => a -> URec Int a -> Bool # maximum :: Ord a => URec Int a -> a # minimum :: Ord a => URec Int a -> a # sum :: Num a => URec Int a -> a # product :: Num a => URec Int a -> a #
Traversable (URec Int :: Type -> Type)	Since: base-4.9.0.0
Instance details Defined in Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> URec Int a -> f (URec Int b) # sequenceA :: Applicative f => URec Int (f a) -> f (URec Int a) # mapM :: Monad m => (a -> m b) -> URec Int a -> m (URec Int b) # sequence :: Monad m => URec Int (m a) -> m (URec Int a) #
Eq (URec Int p)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods (==) :: URec Int p -> URec Int p -> Bool # (/=) :: URec Int p -> URec Int p -> Bool #
Ord (URec Int p)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods compare :: URec Int p -> URec Int p -> Ordering # (<) :: URec Int p -> URec Int p -> Bool # (<=) :: URec Int p -> URec Int p -> Bool # (>) :: URec Int p -> URec Int p -> Bool # (>=) :: URec Int p -> URec Int p -> Bool # max :: URec Int p -> URec Int p -> URec Int p # min :: URec Int p -> URec Int p -> URec Int p #
Show (URec Int p)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods showsPrec :: Int -> URec Int p -> ShowS # show :: URec Int p -> String # showList :: [URec Int p] -> ShowS #
Generic (URec Int p)
Instance details Defined in GHC.Generics Associated Types type Rep (URec Int p) :: Type -> Type # Methods from :: URec Int p -> Rep (URec Int p) x # to :: Rep (URec Int p) x -> URec Int p #
newtype Vector Int
Instance details Defined in Data.Vector.Unboxed.Base newtype Vector Int = V_Int (Vector Int)
data URec Int (p :: k)	Used for marking occurrences of `Int#` Since: base-4.9.0.0
Instance details Defined in GHC.Generics data URec Int (p :: k) = UInt { uInt# :: Int# }
newtype MVector s Int
Instance details Defined in Data.Vector.Unboxed.Base newtype MVector s Int = MV_Int (MVector s Int)
type Rep1 (URec Int :: k -> Type)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics type Rep1 (URec Int :: k -> Type) = D1 (MetaData "URec" "GHC.Generics" "base" False) (C1 (MetaCons "UInt" PrefixI True) (S1 (MetaSel (Just "uInt#") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (UInt :: k -> Type)))
type Rep (URec Int p)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics type Rep (URec Int p) = D1 (MetaData "URec" "GHC.Generics" "base" False) (C1 (MetaCons "UInt" PrefixI True) (S1 (MetaSel (Just "uInt#") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (UInt :: Type -> Type)))

data Int32 #

32-bit signed integer type

Instances

Bounded Int32	Since: base-2.1
Instance details Defined in GHC.Int Methods minBound :: Int32 # maxBound :: Int32 #
Enum Int32	Since: base-2.1
Instance details Defined in GHC.Int Methods succ :: Int32 -> Int32 # pred :: Int32 -> Int32 # toEnum :: Int -> Int32 # fromEnum :: Int32 -> Int # enumFrom :: Int32 -> [Int32] # enumFromThen :: Int32 -> Int32 -> [Int32] # enumFromTo :: Int32 -> Int32 -> [Int32] # enumFromThenTo :: Int32 -> Int32 -> Int32 -> [Int32] #
Eq Int32	Since: base-2.1
Instance details Defined in GHC.Int Methods (==) :: Int32 -> Int32 -> Bool # (/=) :: Int32 -> Int32 -> Bool #
Integral Int32	Since: base-2.1
Instance details Defined in GHC.Int Methods quot :: Int32 -> Int32 -> Int32 # rem :: Int32 -> Int32 -> Int32 # div :: Int32 -> Int32 -> Int32 # mod :: Int32 -> Int32 -> Int32 # quotRem :: Int32 -> Int32 -> (Int32, Int32) # divMod :: Int32 -> Int32 -> (Int32, Int32) # toInteger :: Int32 -> Integer #
Num Int32	Since: base-2.1
Instance details Defined in GHC.Int Methods (+) :: Int32 -> Int32 -> Int32 # (-) :: Int32 -> Int32 -> Int32 # (*) :: Int32 -> Int32 -> Int32 # negate :: Int32 -> Int32 # abs :: Int32 -> Int32 # signum :: Int32 -> Int32 # fromInteger :: Integer -> Int32 #
Ord Int32	Since: base-2.1
Instance details Defined in GHC.Int Methods compare :: Int32 -> Int32 -> Ordering # (<) :: Int32 -> Int32 -> Bool # (<=) :: Int32 -> Int32 -> Bool # (>) :: Int32 -> Int32 -> Bool # (>=) :: Int32 -> Int32 -> Bool # max :: Int32 -> Int32 -> Int32 # min :: Int32 -> Int32 -> Int32 #
Read Int32	Since: base-2.1
Instance details Defined in GHC.Int Methods readsPrec :: Int -> ReadS Int32 # readList :: ReadS [Int32] # readPrec :: ReadPrec Int32 # readListPrec :: ReadPrec [Int32] #
Real Int32	Since: base-2.1
Instance details Defined in GHC.Int Methods toRational :: Int32 -> Rational #
Show Int32	Since: base-2.1
Instance details Defined in GHC.Int Methods showsPrec :: Int -> Int32 -> ShowS # show :: Int32 -> String # showList :: [Int32] -> ShowS #
Ix Int32	Since: base-2.1
Instance details Defined in GHC.Int Methods range :: (Int32, Int32) -> [Int32] # index :: (Int32, Int32) -> Int32 -> Int # unsafeIndex :: (Int32, Int32) -> Int32 -> Int inRange :: (Int32, Int32) -> Int32 -> Bool # rangeSize :: (Int32, Int32) -> Int # unsafeRangeSize :: (Int32, Int32) -> Int
Lift Int32
Instance details Defined in Language.Haskell.TH.Syntax Methods lift :: Int32 -> Q Exp #
NFData Int32
Instance details Defined in Control.DeepSeq Methods rnf :: Int32 -> () #
Hashable Int32
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Int32 -> Int # hash :: Int32 -> Int #
Storable Int32	Since: base-2.1
Instance details Defined in Foreign.Storable Methods sizeOf :: Int32 -> Int # alignment :: Int32 -> Int # peekElemOff :: Ptr Int32 -> Int -> IO Int32 # pokeElemOff :: Ptr Int32 -> Int -> Int32 -> IO () # peekByteOff :: Ptr b -> Int -> IO Int32 # pokeByteOff :: Ptr b -> Int -> Int32 -> IO () # peek :: Ptr Int32 -> IO Int32 # poke :: Ptr Int32 -> Int32 -> IO () #
Bits Int32	Since: base-2.1
Instance details Defined in GHC.Int Methods (.&.) :: Int32 -> Int32 -> Int32 # (.\|.) :: Int32 -> Int32 -> Int32 # xor :: Int32 -> Int32 -> Int32 # complement :: Int32 -> Int32 # shift :: Int32 -> Int -> Int32 # rotate :: Int32 -> Int -> Int32 # zeroBits :: Int32 # bit :: Int -> Int32 # setBit :: Int32 -> Int -> Int32 # clearBit :: Int32 -> Int -> Int32 # complementBit :: Int32 -> Int -> Int32 # testBit :: Int32 -> Int -> Bool # bitSizeMaybe :: Int32 -> Maybe Int # bitSize :: Int32 -> Int # isSigned :: Int32 -> Bool # shiftL :: Int32 -> Int -> Int32 # unsafeShiftL :: Int32 -> Int -> Int32 # shiftR :: Int32 -> Int -> Int32 # unsafeShiftR :: Int32 -> Int -> Int32 # rotateL :: Int32 -> Int -> Int32 # rotateR :: Int32 -> Int -> Int32 # popCount :: Int32 -> Int #
FiniteBits Int32	Since: base-4.6.0.0
Instance details Defined in GHC.Int Methods finiteBitSize :: Int32 -> Int # countLeadingZeros :: Int32 -> Int # countTrailingZeros :: Int32 -> Int #
Unbox Int32
Instance details Defined in Data.Vector.Unboxed.Base
Prim Int32
Instance details Defined in Data.Primitive.Types Methods sizeOf# :: Int32 -> Int# # alignment# :: Int32 -> Int# # indexByteArray# :: ByteArray# -> Int# -> Int32 # readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (#State# s, Int32#) # writeByteArray# :: MutableByteArray# s -> Int# -> Int32 -> State# s -> State# s # setByteArray# :: MutableByteArray# s -> Int# -> Int# -> Int32 -> State# s -> State# s # indexOffAddr# :: Addr# -> Int# -> Int32 # readOffAddr# :: Addr# -> Int# -> State# s -> (#State# s, Int32#) # writeOffAddr# :: Addr# -> Int# -> Int32 -> State# s -> State# s # setOffAddr# :: Addr# -> Int# -> Int# -> Int32 -> State# s -> State# s #
Default Int32
Instance details Defined in Data.Default.Class Methods def :: Int32 #
IsGValue Int32
Instance details Defined in Data.GI.Base.GValue Methods toGValue :: Int32 -> IO GValue # fromGValue :: GValue -> IO Int32 #
Vector Vector Int32
Instance details Defined in Data.Vector.Unboxed.Base Methods basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) Int32 -> m (Vector Int32) # basicUnsafeThaw :: PrimMonad m => Vector Int32 -> m (Mutable Vector (PrimState m) Int32) # basicLength :: Vector Int32 -> Int # basicUnsafeSlice :: Int -> Int -> Vector Int32 -> Vector Int32 # basicUnsafeIndexM :: Monad m => Vector Int32 -> Int -> m Int32 # basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) Int32 -> Vector Int32 -> m () # elemseq :: Vector Int32 -> Int32 -> b -> b #
MVector MVector Int32
Instance details Defined in Data.Vector.Unboxed.Base Methods basicLength :: MVector s Int32 -> Int # basicUnsafeSlice :: Int -> Int -> MVector s Int32 -> MVector s Int32 # basicOverlaps :: MVector s Int32 -> MVector s Int32 -> Bool # basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) Int32) # basicInitialize :: PrimMonad m => MVector (PrimState m) Int32 -> m () # basicUnsafeReplicate :: PrimMonad m => Int -> Int32 -> m (MVector (PrimState m) Int32) # basicUnsafeRead :: PrimMonad m => MVector (PrimState m) Int32 -> Int -> m Int32 # basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) Int32 -> Int -> Int32 -> m () # basicClear :: PrimMonad m => MVector (PrimState m) Int32 -> m () # basicSet :: PrimMonad m => MVector (PrimState m) Int32 -> Int32 -> m () # basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) Int32 -> MVector (PrimState m) Int32 -> m () # basicUnsafeMove :: PrimMonad m => MVector (PrimState m) Int32 -> MVector (PrimState m) Int32 -> m () # basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) Int32 -> Int -> m (MVector (PrimState m) Int32) #
newtype Vector Int32
Instance details Defined in Data.Vector.Unboxed.Base newtype Vector Int32 = V_Int32 (Vector Int32)
newtype MVector s Int32
Instance details Defined in Data.Vector.Unboxed.Base newtype MVector s Int32 = MV_Int32 (MVector s Int32)

data Int64 #

64-bit signed integer type

Instances

Bounded Int64	Since: base-2.1
Instance details Defined in GHC.Int Methods minBound :: Int64 # maxBound :: Int64 #
Enum Int64	Since: base-2.1
Instance details Defined in GHC.Int Methods succ :: Int64 -> Int64 # pred :: Int64 -> Int64 # toEnum :: Int -> Int64 # fromEnum :: Int64 -> Int # enumFrom :: Int64 -> [Int64] # enumFromThen :: Int64 -> Int64 -> [Int64] # enumFromTo :: Int64 -> Int64 -> [Int64] # enumFromThenTo :: Int64 -> Int64 -> Int64 -> [Int64] #
Eq Int64	Since: base-2.1
Instance details Defined in GHC.Int Methods (==) :: Int64 -> Int64 -> Bool # (/=) :: Int64 -> Int64 -> Bool #
Integral Int64	Since: base-2.1
Instance details Defined in GHC.Int Methods quot :: Int64 -> Int64 -> Int64 # rem :: Int64 -> Int64 -> Int64 # div :: Int64 -> Int64 -> Int64 # mod :: Int64 -> Int64 -> Int64 # quotRem :: Int64 -> Int64 -> (Int64, Int64) # divMod :: Int64 -> Int64 -> (Int64, Int64) # toInteger :: Int64 -> Integer #
Num Int64	Since: base-2.1
Instance details Defined in GHC.Int Methods (+) :: Int64 -> Int64 -> Int64 # (-) :: Int64 -> Int64 -> Int64 # (*) :: Int64 -> Int64 -> Int64 # negate :: Int64 -> Int64 # abs :: Int64 -> Int64 # signum :: Int64 -> Int64 # fromInteger :: Integer -> Int64 #
Ord Int64	Since: base-2.1
Instance details Defined in GHC.Int Methods compare :: Int64 -> Int64 -> Ordering # (<) :: Int64 -> Int64 -> Bool # (<=) :: Int64 -> Int64 -> Bool # (>) :: Int64 -> Int64 -> Bool # (>=) :: Int64 -> Int64 -> Bool # max :: Int64 -> Int64 -> Int64 # min :: Int64 -> Int64 -> Int64 #
Read Int64	Since: base-2.1
Instance details Defined in GHC.Int Methods readsPrec :: Int -> ReadS Int64 # readList :: ReadS [Int64] # readPrec :: ReadPrec Int64 # readListPrec :: ReadPrec [Int64] #
Real Int64	Since: base-2.1
Instance details Defined in GHC.Int Methods toRational :: Int64 -> Rational #
Show Int64	Since: base-2.1
Instance details Defined in GHC.Int Methods showsPrec :: Int -> Int64 -> ShowS # show :: Int64 -> String # showList :: [Int64] -> ShowS #
Ix Int64	Since: base-2.1
Instance details Defined in GHC.Int Methods range :: (Int64, Int64) -> [Int64] # index :: (Int64, Int64) -> Int64 -> Int # unsafeIndex :: (Int64, Int64) -> Int64 -> Int inRange :: (Int64, Int64) -> Int64 -> Bool # rangeSize :: (Int64, Int64) -> Int # unsafeRangeSize :: (Int64, Int64) -> Int
Lift Int64
Instance details Defined in Language.Haskell.TH.Syntax Methods lift :: Int64 -> Q Exp #
NFData Int64
Instance details Defined in Control.DeepSeq Methods rnf :: Int64 -> () #
Hashable Int64
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Int64 -> Int # hash :: Int64 -> Int #
Storable Int64	Since: base-2.1
Instance details Defined in Foreign.Storable Methods sizeOf :: Int64 -> Int # alignment :: Int64 -> Int # peekElemOff :: Ptr Int64 -> Int -> IO Int64 # pokeElemOff :: Ptr Int64 -> Int -> Int64 -> IO () # peekByteOff :: Ptr b -> Int -> IO Int64 # pokeByteOff :: Ptr b -> Int -> Int64 -> IO () # peek :: Ptr Int64 -> IO Int64 # poke :: Ptr Int64 -> Int64 -> IO () #
Bits Int64	Since: base-2.1
Instance details Defined in GHC.Int Methods (.&.) :: Int64 -> Int64 -> Int64 # (.\|.) :: Int64 -> Int64 -> Int64 # xor :: Int64 -> Int64 -> Int64 # complement :: Int64 -> Int64 # shift :: Int64 -> Int -> Int64 # rotate :: Int64 -> Int -> Int64 # zeroBits :: Int64 # bit :: Int -> Int64 # setBit :: Int64 -> Int -> Int64 # clearBit :: Int64 -> Int -> Int64 # complementBit :: Int64 -> Int -> Int64 # testBit :: Int64 -> Int -> Bool # bitSizeMaybe :: Int64 -> Maybe Int # bitSize :: Int64 -> Int # isSigned :: Int64 -> Bool # shiftL :: Int64 -> Int -> Int64 # unsafeShiftL :: Int64 -> Int -> Int64 # shiftR :: Int64 -> Int -> Int64 # unsafeShiftR :: Int64 -> Int -> Int64 # rotateL :: Int64 -> Int -> Int64 # rotateR :: Int64 -> Int -> Int64 # popCount :: Int64 -> Int #
FiniteBits Int64	Since: base-4.6.0.0
Instance details Defined in GHC.Int Methods finiteBitSize :: Int64 -> Int # countLeadingZeros :: Int64 -> Int # countTrailingZeros :: Int64 -> Int #
Unbox Int64
Instance details Defined in Data.Vector.Unboxed.Base
Prim Int64
Instance details Defined in Data.Primitive.Types Methods sizeOf# :: Int64 -> Int# # alignment# :: Int64 -> Int# # indexByteArray# :: ByteArray# -> Int# -> Int64 # readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (#State# s, Int64#) # writeByteArray# :: MutableByteArray# s -> Int# -> Int64 -> State# s -> State# s # setByteArray# :: MutableByteArray# s -> Int# -> Int# -> Int64 -> State# s -> State# s # indexOffAddr# :: Addr# -> Int# -> Int64 # readOffAddr# :: Addr# -> Int# -> State# s -> (#State# s, Int64#) # writeOffAddr# :: Addr# -> Int# -> Int64 -> State# s -> State# s # setOffAddr# :: Addr# -> Int# -> Int# -> Int64 -> State# s -> State# s #
Default Int64
Instance details Defined in Data.Default.Class Methods def :: Int64 #
IsGValue Int64
Instance details Defined in Data.GI.Base.GValue Methods toGValue :: Int64 -> IO GValue # fromGValue :: GValue -> IO Int64 #
Vector Vector Int64
Instance details Defined in Data.Vector.Unboxed.Base Methods basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) Int64 -> m (Vector Int64) # basicUnsafeThaw :: PrimMonad m => Vector Int64 -> m (Mutable Vector (PrimState m) Int64) # basicLength :: Vector Int64 -> Int # basicUnsafeSlice :: Int -> Int -> Vector Int64 -> Vector Int64 # basicUnsafeIndexM :: Monad m => Vector Int64 -> Int -> m Int64 # basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) Int64 -> Vector Int64 -> m () # elemseq :: Vector Int64 -> Int64 -> b -> b #
MVector MVector Int64
Instance details Defined in Data.Vector.Unboxed.Base Methods basicLength :: MVector s Int64 -> Int # basicUnsafeSlice :: Int -> Int -> MVector s Int64 -> MVector s Int64 # basicOverlaps :: MVector s Int64 -> MVector s Int64 -> Bool # basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) Int64) # basicInitialize :: PrimMonad m => MVector (PrimState m) Int64 -> m () # basicUnsafeReplicate :: PrimMonad m => Int -> Int64 -> m (MVector (PrimState m) Int64) # basicUnsafeRead :: PrimMonad m => MVector (PrimState m) Int64 -> Int -> m Int64 # basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) Int64 -> Int -> Int64 -> m () # basicClear :: PrimMonad m => MVector (PrimState m) Int64 -> m () # basicSet :: PrimMonad m => MVector (PrimState m) Int64 -> Int64 -> m () # basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) Int64 -> MVector (PrimState m) Int64 -> m () # basicUnsafeMove :: PrimMonad m => MVector (PrimState m) Int64 -> MVector (PrimState m) Int64 -> m () # basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) Int64 -> Int -> m (MVector (PrimState m) Int64) #
newtype Vector Int64
Instance details Defined in Data.Vector.Unboxed.Base newtype Vector Int64 = V_Int64 (Vector Int64)
newtype MVector s Int64
Instance details Defined in Data.Vector.Unboxed.Base newtype MVector s Int64 = MV_Int64 (MVector s Int64)

data Integer #

Invariant: Jn# and Jp# are used iff value doesn't fit in S#

Useful properties resulting from the invariants:

```
abs (S# _) <= abs (Jp# _)
```
```
abs (S# _) <  abs (Jn# _)
```

Instances

Enum Integer	Since: base-2.1
Instance details Defined in GHC.Enum Methods succ :: Integer -> Integer # pred :: Integer -> Integer # toEnum :: Int -> Integer # fromEnum :: Integer -> Int # enumFrom :: Integer -> [Integer] # enumFromThen :: Integer -> Integer -> [Integer] # enumFromTo :: Integer -> Integer -> [Integer] # enumFromThenTo :: Integer -> Integer -> Integer -> [Integer] #
Eq Integer
Instance details Defined in GHC.Integer.Type Methods (==) :: Integer -> Integer -> Bool # (/=) :: Integer -> Integer -> Bool #
Integral Integer	Since: base-2.0.1
Instance details Defined in GHC.Real Methods quot :: Integer -> Integer -> Integer # rem :: Integer -> Integer -> Integer # div :: Integer -> Integer -> Integer # mod :: Integer -> Integer -> Integer # quotRem :: Integer -> Integer -> (Integer, Integer) # divMod :: Integer -> Integer -> (Integer, Integer) # toInteger :: Integer -> Integer #
Num Integer	Since: base-2.1
Instance details Defined in GHC.Num Methods (+) :: Integer -> Integer -> Integer # (-) :: Integer -> Integer -> Integer # (*) :: Integer -> Integer -> Integer # negate :: Integer -> Integer # abs :: Integer -> Integer # signum :: Integer -> Integer # fromInteger :: Integer -> Integer #
Ord Integer
Instance details Defined in GHC.Integer.Type Methods compare :: Integer -> Integer -> Ordering # (<) :: Integer -> Integer -> Bool # (<=) :: Integer -> Integer -> Bool # (>) :: Integer -> Integer -> Bool # (>=) :: Integer -> Integer -> Bool # max :: Integer -> Integer -> Integer # min :: Integer -> Integer -> Integer #
Read Integer	Since: base-2.1
Instance details Defined in GHC.Read Methods readsPrec :: Int -> ReadS Integer # readList :: ReadS [Integer] # readPrec :: ReadPrec Integer # readListPrec :: ReadPrec [Integer] #
Real Integer	Since: base-2.0.1
Instance details Defined in GHC.Real Methods toRational :: Integer -> Rational #
Show Integer	Since: base-2.1
Instance details Defined in GHC.Show Methods showsPrec :: Int -> Integer -> ShowS # show :: Integer -> String # showList :: [Integer] -> ShowS #
Ix Integer	Since: base-2.1
Instance details Defined in GHC.Arr Methods range :: (Integer, Integer) -> [Integer] # index :: (Integer, Integer) -> Integer -> Int # unsafeIndex :: (Integer, Integer) -> Integer -> Int inRange :: (Integer, Integer) -> Integer -> Bool # rangeSize :: (Integer, Integer) -> Int # unsafeRangeSize :: (Integer, Integer) -> Int
Lift Integer
Instance details Defined in Language.Haskell.TH.Syntax Methods lift :: Integer -> Q Exp #
NFData Integer
Instance details Defined in Control.DeepSeq Methods rnf :: Integer -> () #
Hashable Integer
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Integer -> Int # hash :: Integer -> Int #
Default Integer
Instance details Defined in Data.Default.Class Methods def :: Integer #
KnownNat n => Reifies (n :: Nat) Integer
Instance details Defined in Data.Reflection Methods reflect :: proxy n -> Integer #

data Maybe a #

The Maybe type encapsulates an optional value. A value of type Maybe a either contains a value of type a (represented as Just a), or it is empty (represented as Nothing). 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.

Constructors

Nothing
Just a

Instances

Monad Maybe	Since: base-2.1
Instance details Defined in GHC.Base Methods (>>=) :: Maybe a -> (a -> Maybe b) -> Maybe b # (>>) :: Maybe a -> Maybe b -> Maybe b # return :: a -> Maybe a # fail :: String -> Maybe a #
Functor Maybe	Since: base-2.1
Instance details Defined in GHC.Base Methods fmap :: (a -> b) -> Maybe a -> Maybe b # (<$) :: a -> Maybe b -> Maybe a #
Applicative Maybe	Since: base-2.1
Instance details Defined in GHC.Base Methods pure :: a -> Maybe a # (<>) :: Maybe (a -> b) -> Maybe a -> Maybe b # liftA2 :: (a -> b -> c) -> Maybe a -> Maybe b -> Maybe c # (>) :: Maybe a -> Maybe b -> Maybe b # (<*) :: Maybe a -> Maybe b -> Maybe a #
Foldable Maybe	Since: base-2.1
Instance details 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 # toList :: Maybe a -> [a] # null :: Maybe a -> Bool # length :: Maybe a -> Int # elem :: Eq a => a -> Maybe a -> Bool # maximum :: Ord a => Maybe a -> a # minimum :: Ord a => Maybe a -> a # sum :: Num a => Maybe a -> a # product :: Num a => Maybe a -> a #
Traversable Maybe	Since: base-2.1
Instance details Defined in Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> Maybe a -> f (Maybe b) # sequenceA :: Applicative f => Maybe (f a) -> f (Maybe a) # mapM :: Monad m => (a -> m b) -> Maybe a -> m (Maybe b) # sequence :: Monad m => Maybe (m a) -> m (Maybe a) #
MonadPlus Maybe	Since: base-2.1
Instance details Defined in GHC.Base Methods mzero :: Maybe a # mplus :: Maybe a -> Maybe a -> Maybe a #
Alternative Maybe	Since: base-2.1
Instance details Defined in GHC.Base Methods empty :: Maybe a # (<\|>) :: Maybe a -> Maybe a -> Maybe a # some :: Maybe a -> Maybe [a] # many :: Maybe a -> Maybe [a] #
Eq1 Maybe	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Classes Methods liftEq :: (a -> b -> Bool) -> Maybe a -> Maybe b -> Bool #
Ord1 Maybe	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Classes Methods liftCompare :: (a -> b -> Ordering) -> Maybe a -> Maybe b -> Ordering #
Read1 Maybe	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Classes Methods liftReadsPrec :: (Int -> ReadS a) -> ReadS [a] -> Int -> ReadS (Maybe a) # liftReadList :: (Int -> ReadS a) -> ReadS [a] -> ReadS [Maybe a] # liftReadPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec (Maybe a) # liftReadListPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec [Maybe a] #
Show1 Maybe	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Classes Methods liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> Maybe a -> ShowS # liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [Maybe a] -> ShowS #
NFData1 Maybe	Since: deepseq-1.4.3.0
Instance details Defined in Control.DeepSeq Methods liftRnf :: (a -> ()) -> Maybe a -> () #
Hashable1 Maybe
Instance details Defined in Data.Hashable.Class Methods liftHashWithSalt :: (Int -> a -> Int) -> Int -> Maybe a -> Int #
Keyed Maybe
Instance details Defined in Data.Key Methods mapWithKey :: (Key Maybe -> a -> b) -> Maybe a -> Maybe b #
Zip Maybe
Instance details Defined in Data.Key Methods zipWith :: (a -> b -> c) -> Maybe a -> Maybe b -> Maybe c # zip :: Maybe a -> Maybe b -> Maybe (a, b) # zap :: Maybe (a -> b) -> Maybe a -> Maybe b #
ZipWithKey Maybe
Instance details Defined in Data.Key Methods zipWithKey :: (Key Maybe -> a -> b -> c) -> Maybe a -> Maybe b -> Maybe c # zapWithKey :: Maybe (Key Maybe -> a -> b) -> Maybe a -> Maybe b #
Indexable Maybe
Instance details Defined in Data.Key Methods index :: Maybe a -> Key Maybe -> a #
Lookup Maybe
Instance details Defined in Data.Key Methods lookup :: Key Maybe -> Maybe a -> Maybe a #
FoldableWithKey Maybe
Instance details Defined in Data.Key Methods toKeyedList :: Maybe a -> [(Key Maybe, a)] # foldMapWithKey :: Monoid m => (Key Maybe -> a -> m) -> Maybe a -> m # foldrWithKey :: (Key Maybe -> a -> b -> b) -> b -> Maybe a -> b # foldlWithKey :: (b -> Key Maybe -> a -> b) -> b -> Maybe a -> b #
TraversableWithKey Maybe
Instance details 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
Instance details Defined in Data.Functor.Bind.Class Methods (<.>) :: Maybe (a -> b) -> Maybe a -> Maybe b # (.>) :: Maybe a -> Maybe b -> Maybe b # (<.) :: Maybe a -> Maybe b -> Maybe a # liftF2 :: (a -> b -> c) -> Maybe a -> Maybe b -> Maybe c #
Bind Maybe
Instance details Defined in Data.Functor.Bind.Class Methods (>>-) :: Maybe a -> (a -> Maybe b) -> Maybe b # join :: Maybe (Maybe a) -> Maybe a #
PTraversable Maybe
Instance details Defined in Data.Singletons.Prelude.Traversable Associated Types type Traverse arg arg1 :: f (t b) # type SequenceA arg :: f (t a) # type MapM arg arg1 :: m (t b) # type Sequence arg :: m (t a) #
STraversable Maybe
Instance details 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
Instance details Defined in Data.Singletons.Prelude.Foldable Associated Types type Fold arg :: m # type FoldMap arg arg1 :: m # type Foldr arg arg1 arg2 :: b # type Foldr' arg arg1 arg2 :: b # type Foldl arg arg1 arg2 :: b # type Foldl' arg arg1 arg2 :: b # type Foldr1 arg arg1 :: a # type Foldl1 arg arg1 :: a # type ToList arg :: [a] # type Null arg :: Bool # type Length arg :: Nat # type Elem arg arg1 :: Bool # type Maximum arg :: a # type Minimum arg :: a # type Sum arg :: a # type Product arg :: a #
SFoldable Maybe
Instance details 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
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Associated Types type Fmap arg arg1 :: f b # type arg <$ arg1 :: f a #
PApplicative Maybe
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Associated Types type Pure arg :: f a # type arg <> arg1 :: f b # type LiftA2 arg arg1 arg2 :: f c # type arg > arg1 :: f b # type arg <* arg1 :: f a #
PMonad Maybe
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Associated Types type arg >>= arg1 :: m b # type arg >> arg1 :: m b # type Return arg :: m a # type Fail arg :: m a #
PAlternative Maybe
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Associated Types type Empty :: f a # type arg <\|> arg1 :: f a #
PMonadPlus Maybe
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Associated Types type Mzero :: m a # type Mplus arg arg1 :: m a #
SFunctor Maybe
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods sFmap :: Sing t1 -> Sing t2 -> Sing (Apply (Apply FmapSym0 t1) t2) # (%<$) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (<$@#@$) t1) t2) #
SApplicative Maybe
Instance details 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
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods (%>>=) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (>>=@#@$) t1) t2) # (%>>) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (>>@#@$) t1) t2) # sReturn :: Sing t -> Sing (Apply ReturnSym0 t) # sFail :: Sing t -> Sing (Apply FailSym0 t) #
SAlternative Maybe
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods sEmpty :: Sing EmptySym0 # (%<\|>) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (<\|>@#@$) t1) t2) #
SMonadPlus Maybe
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods sMzero :: Sing MzeroSym0 # sMplus :: Sing t1 -> Sing t2 -> Sing (Apply (Apply MplusSym0 t1) t2) #
FunctorWithIndex () Maybe
Instance details Defined in Control.Lens.Indexed Methods imap :: (() -> a -> b) -> Maybe a -> Maybe b # imapped :: IndexedSetter () (Maybe a) (Maybe b) a b #
FoldableWithIndex () Maybe
Instance details Defined in Control.Lens.Indexed Methods ifoldMap :: Monoid m => (() -> a -> m) -> Maybe a -> m # ifolded :: IndexedFold () (Maybe a) a # ifoldr :: (() -> a -> b -> b) -> b -> Maybe a -> b # ifoldl :: (() -> b -> a -> b) -> b -> Maybe a -> b # ifoldr' :: (() -> a -> b -> b) -> b -> Maybe a -> b # ifoldl' :: (() -> b -> a -> b) -> b -> Maybe a -> b #
TraversableWithIndex () Maybe
Instance details 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
Instance details Defined in GHC.Maybe Methods (==) :: Maybe a -> Maybe a -> Bool # (/=) :: Maybe a -> Maybe a -> Bool #
Ord a => Ord (Maybe a)	Since: base-2.1
Instance details Defined in GHC.Maybe Methods compare :: Maybe a -> Maybe a -> Ordering # (<) :: Maybe a -> Maybe a -> Bool # (<=) :: Maybe a -> Maybe a -> Bool # (>) :: Maybe a -> Maybe a -> Bool # (>=) :: Maybe a -> Maybe a -> Bool # max :: Maybe a -> Maybe a -> Maybe a # min :: Maybe a -> Maybe a -> Maybe a #
Read a => Read (Maybe a)	Since: base-2.1
Instance details Defined in GHC.Read Methods readsPrec :: Int -> ReadS (Maybe a) # readList :: ReadS [Maybe a] # readPrec :: ReadPrec (Maybe a) # readListPrec :: ReadPrec [Maybe a] #
Show a => Show (Maybe a)	Since: base-2.1
Instance details Defined in GHC.Show Methods showsPrec :: Int -> Maybe a -> ShowS # show :: Maybe a -> String # showList :: [Maybe a] -> ShowS #
Generic (Maybe a)
Instance details Defined in GHC.Generics Associated Types type Rep (Maybe a) :: Type -> Type # Methods from :: Maybe a -> Rep (Maybe a) x # to :: Rep (Maybe a) x -> Maybe a #
Semigroup a => Semigroup (Maybe a)	Since: base-4.9.0.0
Instance details Defined in GHC.Base Methods (<>) :: Maybe a -> Maybe a -> Maybe a # sconcat :: NonEmpty (Maybe a) -> Maybe a # stimes :: Integral b => b -> Maybe a -> Maybe a #
Semigroup a => Monoid (Maybe a)	Lift a semigroup into `Maybe` forming a `Monoid` according to http://en.wikipedia.org/wiki/Monoid: "Any semigroup `S` may be turned into a monoid simply by adjoining an element `e` not in `S` and defining `ee = e` and `es = s = se` for all `s ∈ S`." Since 4.11.0: constraint on inner `a` value generalised from `Monoid` to `Semigroup`. Since: base-2.1*
Instance details Defined in GHC.Base Methods mempty :: Maybe a # mappend :: Maybe a -> Maybe a -> Maybe a # mconcat :: [Maybe a] -> Maybe a #
Lift a => Lift (Maybe a)
Instance details Defined in Language.Haskell.TH.Syntax Methods lift :: Maybe a -> Q Exp #
NFData a => NFData (Maybe a)
Instance details Defined in Control.DeepSeq Methods rnf :: Maybe a -> () #
Hashable a => Hashable (Maybe a)
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Maybe a -> Int # hash :: Maybe a -> Int #
SingKind a => SingKind (Maybe a)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Associated Types type DemoteRep (Maybe a) :: Type Methods fromSing :: Sing a0 -> DemoteRep (Maybe a)
MonoPointed (Maybe a)
Instance details Defined in Data.MonoTraversable Methods opoint :: Element (Maybe a) -> Maybe a #
MonoTraversable (Maybe a)
Instance details Defined in Data.MonoTraversable Methods otraverse :: Applicative f => (Element (Maybe a) -> f (Element (Maybe a))) -> Maybe a -> f (Maybe a) # omapM :: Applicative m => (Element (Maybe a) -> m (Element (Maybe a))) -> Maybe a -> m (Maybe a) #
MonoFoldable (Maybe a)
Instance details 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 # onull :: Maybe a -> Bool # olength :: Maybe a -> Int # 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) # oelem :: Element (Maybe a) -> Maybe a -> Bool # onotElem :: Element (Maybe a) -> Maybe a -> Bool #
MonoFunctor (Maybe a)
Instance details Defined in Data.MonoTraversable Methods omap :: (Element (Maybe a) -> Element (Maybe a)) -> Maybe a -> Maybe a #
Default (Maybe a)
Instance details Defined in Data.Default.Class Methods def :: Maybe a #
NullToNothing (Maybe a)
Instance details Defined in Data.GI.Base.BasicTypes Methods nullToNothing :: MonadIO m => IO (Maybe a) -> m (Maybe (UnMaybe (Maybe a))) #
IsGValue (Maybe String)
Instance details Defined in Data.GI.Base.GValue Methods toGValue :: Maybe String -> IO GValue # fromGValue :: GValue -> IO (Maybe String) #
IsGValue (Maybe Text)
Instance details Defined in Data.GI.Base.GValue Methods toGValue :: Maybe Text -> IO GValue # fromGValue :: GValue -> IO (Maybe Text) #
Ixed (Maybe a)
Instance details Defined in Control.Lens.At Methods ix :: Index (Maybe a) -> Traversal' (Maybe a) (IxValue (Maybe a)) #
At (Maybe a)
Instance details Defined in Control.Lens.At Methods at :: Index (Maybe a) -> Lens' (Maybe a) (Maybe (IxValue (Maybe a))) #
PMonoid (Maybe a)
Instance details Defined in Data.Singletons.Prelude.Monoid Associated Types type Mempty :: a # type Mappend arg arg1 :: a # type Mconcat arg :: a #
SSemigroup a => SMonoid (Maybe a)
Instance details Defined in Data.Singletons.Prelude.Monoid Methods sMempty :: Sing MemptySym0 # sMappend :: Sing t1 -> Sing t2 -> Sing (Apply (Apply MappendSym0 t1) t2) # sMconcat :: Sing t -> Sing (Apply MconcatSym0 t) #
PShow (Maybe a)
Instance details Defined in Data.Singletons.Prelude.Show Associated Types type ShowsPrec arg arg1 arg2 :: Symbol # type Show_ arg :: Symbol # type ShowList arg arg1 :: Symbol #
SShow a => SShow (Maybe a)
Instance details Defined in Data.Singletons.Prelude.Show Methods sShowsPrec :: Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply ShowsPrecSym0 t1) t2) t3) # sShow_ :: Sing t -> Sing (Apply Show_Sym0 t) # sShowList :: Sing t1 -> Sing t2 -> Sing (Apply (Apply ShowListSym0 t1) t2) #
PSemigroup (Maybe a)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Associated Types type arg <> arg1 :: a # type Sconcat arg :: a #
SSemigroup a => SSemigroup (Maybe a)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods (%<>) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (<>@#@$) t1) t2) # sSconcat :: Sing t -> Sing (Apply SconcatSym0 t) #
POrd (Maybe a)
Instance details Defined in Data.Singletons.Prelude.Ord Associated Types type Compare arg arg1 :: Ordering # type arg < arg1 :: Bool # type arg <= arg1 :: Bool # type arg > arg1 :: Bool # type arg >= arg1 :: Bool # type Max arg arg1 :: a # type Min arg arg1 :: a #
SOrd a => SOrd (Maybe a)
Instance details 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)
Instance details Defined in Data.Singletons.Prelude.Eq Methods (%==) :: Sing a0 -> Sing b -> Sing (a0 == b) # (%/=) :: Sing a0 -> Sing b -> Sing (a0 /= b) #
PEq (Maybe a)
Instance details Defined in Data.Singletons.Prelude.Eq Associated Types type x == y :: Bool # type x /= y :: Bool #
Generic1 Maybe
Instance details Defined in GHC.Generics Associated Types type Rep1 Maybe :: k -> Type # Methods from1 :: Maybe a -> Rep1 Maybe a # to1 :: Rep1 Maybe a -> Maybe a #
SingI (Nothing :: Maybe a)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods sing :: Sing Nothing
SingI a2 => SingI (Just a2 :: Maybe a1)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods sing :: Sing (Just a2)
SuppressUnusedWarnings (CatMaybesSym0 :: TyFun [Maybe a6989586621680040186] [a6989586621680040186] -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ListToMaybeSym0 :: TyFun [a6989586621680040187] (Maybe a6989586621680040187) -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (StripPrefixSym0 :: TyFun [a6989586621680442800] ([a6989586621680442800] ~> Maybe [a6989586621680442800]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (MaybeToListSym0 :: TyFun (Maybe a6989586621680040188) [a6989586621680040188] -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (IsNothingSym0 :: TyFun (Maybe a6989586621680040191) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (IsJustSym0 :: TyFun (Maybe a6989586621680040193) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FromJustSym0 :: TyFun (Maybe a6989586621680040190) a6989586621680040190 -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (MinInternalSym0 :: TyFun (Maybe a6989586621680716728) (MinInternal a6989586621680716728) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (MaxInternalSym0 :: TyFun (Maybe a6989586621680716042) (MaxInternal a6989586621680716042) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680040487Sym0 :: TyFun (Maybe a6989586621679943887) (Maybe a6989586621679943887 ~> Maybe a6989586621679943887) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Compare_6989586621679858323Sym0 :: TyFun (Maybe a3530822107858468865) (Maybe a3530822107858468865 ~> Ordering) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (OptionSym0 :: TyFun (Maybe a6989586621679056546) (Option a6989586621679056546) -> Type)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (LastSym0 :: TyFun (Maybe a6989586621679070381) (Last a6989586621679070381) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FirstSym0 :: TyFun (Maybe a6989586621679070391) (First a6989586621679070391) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ShowsPrec_6989586621680610638Sym0 :: TyFun Nat (Maybe a3530822107858468865 ~> (Symbol ~> Symbol)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Fail_6989586621680040362Sym0 :: TyFun Symbol (Maybe a6989586621679943821) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FromMaybeSym0 :: TyFun a6989586621680040189 (Maybe a6989586621680040189 ~> a6989586621680040189) -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ElemIndexSym0 :: TyFun a6989586621680316582 ([a6989586621680316582] ~> Maybe Nat) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Pure_6989586621680039607Sym0 :: TyFun a6989586621679943778 (Maybe a6989586621679943778) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680040481LSym0 :: TyFun k1 (Maybe k1) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (JustSym0 :: TyFun a3530822107858468865 (Maybe a3530822107858468865) -> Type)
Instance details Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (GetOptionSym0 :: TyFun (Option a6989586621679056546) (Maybe a6989586621679056546) -> Type)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (GetFirstSym0 :: TyFun (First a6989586621679070391) (Maybe a6989586621679070391) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (GetLastSym0 :: TyFun (Last a6989586621679070381) (Maybe a6989586621679070381) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FindSym0 :: TyFun (a6989586621680316583 ~> Bool) ([a6989586621680316583] ~> Maybe a6989586621680316583) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FindIndexSym0 :: TyFun (a6989586621680316580 ~> Bool) ([a6989586621680316580] ~> Maybe Nat) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SingI (CatMaybesSym0 :: TyFun [Maybe a] [a] -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing CatMaybesSym0 #
SingI (ListToMaybeSym0 :: TyFun [a] (Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing ListToMaybeSym0 #
SingI (MaybeToListSym0 :: TyFun (Maybe a) [a] -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing MaybeToListSym0 #
SingI (IsNothingSym0 :: TyFun (Maybe a) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing IsNothingSym0 #
SingI (IsJustSym0 :: TyFun (Maybe a) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing IsJustSym0 #
SingI (FromJustSym0 :: TyFun (Maybe a) a -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing FromJustSym0 #
SingI (OptionSym0 :: TyFun (Maybe a) (Option a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods sing :: Sing OptionSym0 #
SingI (LastSym0 :: TyFun (Maybe a) (Last a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monoid Methods sing :: Sing LastSym0 #
SingI (FirstSym0 :: TyFun (Maybe a) (First a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monoid Methods sing :: Sing FirstSym0 #
SingI (FromMaybeSym0 :: TyFun a (Maybe a ~> a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing FromMaybeSym0 #
SEq a => SingI (ElemIndexSym0 :: TyFun a ([a] ~> Maybe Nat) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing ElemIndexSym0 #
SingI (JustSym0 :: TyFun a (Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Instances Methods sing :: Sing JustSym0 #
SingI (FindSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing FindSym0 #
SingI (FindIndexSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe Nat) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing FindIndexSym0 #
SuppressUnusedWarnings (StripPrefixSym1 a6989586621680455510 :: TyFun [a6989586621680442800] (Maybe [a6989586621680442800]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FindSym1 a6989586621680326140 :: TyFun [a6989586621680316583] (Maybe a6989586621680316583) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FindIndexSym1 a6989586621680326500 :: TyFun [a6989586621680316580] (Maybe Nat) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ElemIndexSym1 a6989586621680326508 :: TyFun [a6989586621680316582] (Maybe Nat) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ShowsPrec_6989586621680610638Sym1 a6989586621680610635 a3530822107858468865 :: TyFun (Maybe a3530822107858468865) (Symbol ~> Symbol) -> Type)
Instance details Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FromMaybeSym1 a6989586621680040875 :: TyFun (Maybe a6989586621680040189) a6989586621680040189 -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680040487Sym1 a6989586621680040485 :: TyFun (Maybe a6989586621679943887) (Maybe a6989586621679943887) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680040351Sym0 :: TyFun (Maybe a6989586621679943817) (Maybe b6989586621679943818 ~> Maybe b6989586621679943818) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680040333Sym0 :: TyFun (Maybe a6989586621679943815) ((a6989586621679943815 ~> Maybe b6989586621679943816) ~> Maybe b6989586621679943816) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680040134Sym0 :: TyFun (Maybe a6989586621679943784) (Maybe b6989586621679943785 ~> Maybe b6989586621679943785) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Compare_6989586621679858323Sym1 a6989586621679858321 :: TyFun (Maybe a3530822107858468865) Ordering -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680039619Sym0 :: TyFun (Maybe (a6989586621679943779 ~> b6989586621679943780)) (Maybe a6989586621679943779 ~> Maybe b6989586621679943780) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Maybe_Sym0 :: TyFun b6989586621680037187 ((a6989586621680037188 ~> b6989586621680037187) ~> (Maybe a6989586621680037188 ~> b6989586621680037187)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (LookupSym0 :: TyFun a6989586621680316561 ([(a6989586621680316561, b6989586621680316562)] ~> Maybe b6989586621680316562) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680717533NSym0 :: TyFun k (TyFun k1 (Maybe k1) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680717533MSym0 :: TyFun k1 (TyFun k (Maybe k1) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680717506NSym0 :: TyFun k (TyFun k1 (Maybe k1) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680717506MSym0 :: TyFun k1 (TyFun k (Maybe k1) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680039478Sym0 :: TyFun a6989586621679943773 (Maybe b6989586621679943774 ~> Maybe a6989586621679943773) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (OptionalSym0 :: TyFun (f6989586621680959694 a6989586621680959695) (f6989586621680959694 (Maybe a6989586621680959695)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Applicative Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (MapMaybeSym0 :: TyFun (a6989586621680040184 ~> Maybe b6989586621680040185) ([a6989586621680040184] ~> [b6989586621680040185]) -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (UnfoldrSym0 :: TyFun (b6989586621680316639 ~> Maybe (a6989586621680316640, b6989586621680316639)) (b6989586621680316639 ~> [a6989586621680316640]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FindSym0 :: TyFun (a6989586621680725630 ~> Bool) (t6989586621680725629 a6989586621680725630 ~> Maybe a6989586621680725630) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Fmap_6989586621680039458Sym0 :: TyFun (a6989586621679943771 ~> b6989586621679943772) (Maybe a6989586621679943771 ~> Maybe b6989586621679943772) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SingI d => SingI (FindSym1 d :: TyFun [a] (Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing (FindSym1 d) #
SingI d => SingI (FindIndexSym1 d :: TyFun [a] (Maybe Nat) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing (FindIndexSym1 d) #
(SEq a, SingI d) => SingI (ElemIndexSym1 d :: TyFun [a] (Maybe Nat) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing (ElemIndexSym1 d) #
SingI d => SingI (FromMaybeSym1 d :: TyFun (Maybe a) a -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing (FromMaybeSym1 d) #
SingI (Maybe_Sym0 :: TyFun b ((a ~> b) ~> (Maybe a ~> b)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing Maybe_Sym0 #
SEq a => SingI (LookupSym0 :: TyFun a ([(a, b)] ~> Maybe b) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing LookupSym0 #
SAlternative f => SingI (OptionalSym0 :: TyFun (f a) (f (Maybe a)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Applicative Methods sing :: Sing OptionalSym0 #
SingI (MapMaybeSym0 :: TyFun (a ~> Maybe b) ([a] ~> [b]) -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing MapMaybeSym0 #
SingI (UnfoldrSym0 :: TyFun (b ~> Maybe (a, b)) (b ~> [a]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing UnfoldrSym0 #
SFoldable t => SingI (FindSym0 :: TyFun (a ~> Bool) (t a ~> Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods sing :: Sing FindSym0 #
SuppressUnusedWarnings (LookupSym1 a6989586621680325922 b6989586621680316562 :: TyFun [(a6989586621680316561, b6989586621680316562)] (Maybe b6989586621680316562) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680040351Sym1 a6989586621680040349 b6989586621679943818 :: TyFun (Maybe b6989586621679943818) (Maybe b6989586621679943818) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680040134Sym1 a6989586621680040132 b6989586621679943785 :: TyFun (Maybe b6989586621679943785) (Maybe b6989586621679943785) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680039619Sym1 a6989586621680039617 :: TyFun (Maybe a6989586621679943779) (Maybe b6989586621679943780) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680039478Sym1 a6989586621680039476 b6989586621679943774 :: TyFun (Maybe b6989586621679943774) (Maybe a6989586621679943773) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Fmap_6989586621680039458Sym1 a6989586621680039456 :: TyFun (Maybe a6989586621679943771) (Maybe b6989586621679943772) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680717533NSym1 x6989586621680717531 :: TyFun k1 (Maybe k1) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680717533MSym1 x6989586621680717531 :: TyFun k (Maybe k1) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680717506NSym1 x6989586621680717504 :: TyFun k1 (Maybe k1) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680717506MSym1 x6989586621680717504 :: TyFun k (Maybe k1) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FindSym1 a6989586621680726087 t6989586621680725629 :: TyFun (t6989586621680725629 a6989586621680725630) (Maybe a6989586621680725630) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621680674842Sym0 :: TyFun k (TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621680674754Sym0 :: TyFun k (TyFun (k1 ~> First a) (TyFun k1 (Maybe a) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Traverse_6989586621680970945Sym0 :: TyFun (a6989586621680959944 ~> f6989586621680959943 b6989586621680959945) (Maybe a6989586621680959944 ~> f6989586621680959943 (Maybe b6989586621680959945)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Maybe_Sym1 a6989586621680037415 a6989586621680037188 :: TyFun (a6989586621680037188 ~> b6989586621680037187) (Maybe a6989586621680037188 ~> b6989586621680037187) -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680040793RsSym0 :: TyFun (a6989586621680040184 ~> Maybe k1) (TyFun k (TyFun [a6989586621680040184] [k1] -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680726564MfSym0 :: TyFun (k2 ~> (k3 ~> k3)) (TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680726539MfSym0 :: TyFun (k3 ~> (k2 ~> k3)) (TyFun k (TyFun k3 (TyFun (Maybe k2) (Maybe k3) -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680040333Sym1 a6989586621680040331 b6989586621679943816 :: TyFun (a6989586621679943815 ~> Maybe b6989586621679943816) (Maybe b6989586621679943816) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (LiftA2_6989586621680039635Sym0 :: TyFun (a6989586621679943781 ~> (b6989586621679943782 ~> c6989586621679943783)) (Maybe a6989586621679943781 ~> (Maybe b6989586621679943782 ~> Maybe c6989586621679943783)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
(SEq a, SingI d) => SingI (LookupSym1 d b :: TyFun [(a, b)] (Maybe b) -> Type)
Instance details 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)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods sing :: Sing (FindSym1 d t) #
SingI d => SingI (Maybe_Sym1 d a :: TyFun (a ~> b) (Maybe a ~> b) -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing (Maybe_Sym1 d a) #
SuppressUnusedWarnings (Traverse_6989586621680970945Sym1 a6989586621680970943 :: TyFun (Maybe a6989586621680959944) (f6989586621680959943 (Maybe b6989586621680959945)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Maybe_Sym2 a6989586621680037416 a6989586621680037415 :: TyFun (Maybe a6989586621680037188) b6989586621680037187 -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (LiftA2_6989586621680039635Sym1 a6989586621680039632 :: TyFun (Maybe a6989586621679943781) (Maybe b6989586621679943782 ~> Maybe c6989586621679943783) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680726564MfSym1 f6989586621680726562 :: TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680726539MfSym1 f6989586621680726537 :: TyFun k (TyFun k3 (TyFun (Maybe k2) (Maybe k3) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621680674842Sym1 a6989586621680674840 :: TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621680674754Sym1 a6989586621680674752 :: TyFun (k1 ~> First a) (TyFun k1 (Maybe a) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () #
(SingI d1, SingI d2) => SingI (Maybe_Sym2 d1 d2 :: TyFun (Maybe a) b -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing (Maybe_Sym2 d1 d2) #
SuppressUnusedWarnings (Let6989586621680726564MfSym2 xs6989586621680726563 f6989586621680726562 :: TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (LiftA2_6989586621680039635Sym2 a6989586621680039633 a6989586621680039632 :: TyFun (Maybe b6989586621679943782) (Maybe c6989586621679943783) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680726539MfSym2 xs6989586621680726538 f6989586621680726537 :: TyFun k3 (TyFun (Maybe k2) (Maybe k3) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621680674842Sym2 k6989586621680674841 a6989586621680674840 :: TyFun k1 (Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621680674754Sym2 k6989586621680674753 a6989586621680674752 :: TyFun k1 (Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680726539MfSym3 a6989586621680726540 xs6989586621680726538 f6989586621680726537 :: TyFun (Maybe k2) (Maybe k3) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680726564MfSym3 a6989586621680726565 xs6989586621680726563 f6989586621680726562 :: TyFun k3 (Maybe k3) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
type Key Maybe
Instance details Defined in Data.Key type Key Maybe = ()
type Empty
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Empty = (Empty_6989586621680040469Sym0 :: Maybe a)
type Mzero
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Mzero = (Mzero_6989586621679945596Sym0 :: Maybe a)
type Product (arg :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Product (arg :: Maybe a) = Apply (Product_6989586621680726700Sym0 :: TyFun (Maybe a) a -> Type) arg
type Sum (arg :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Sum (arg :: Maybe a) = Apply (Sum_6989586621680726687Sym0 :: TyFun (Maybe a) a -> Type) arg
type Minimum (arg :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Minimum (arg :: Maybe a) = Apply (Minimum_6989586621680726674Sym0 :: TyFun (Maybe a) a -> Type) arg
type Maximum (arg :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Maximum (arg :: Maybe a) = Apply (Maximum_6989586621680726661Sym0 :: TyFun (Maybe a) a -> Type) arg
type Length (arg :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Length (arg :: Maybe a) = Apply (Length_6989586621680726632Sym0 :: TyFun (Maybe a) Nat -> Type) arg
type Null (arg :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Null (arg :: Maybe a) = Apply (Null_6989586621680726610Sym0 :: TyFun (Maybe a) Bool -> Type) arg
type ToList (arg :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Foldable type ToList (arg :: Maybe a) = Apply (ToList_6989586621680726589Sym0 :: TyFun (Maybe a) [a] -> Type) arg
type Fold (arg :: Maybe m)
Instance details Defined in Data.Singletons.Prelude.Foldable type Fold (arg :: Maybe m) = Apply (Fold_6989586621680726406Sym0 :: TyFun (Maybe m) m -> Type) arg
type Pure (a :: k1)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Pure (a :: k1) = Apply (Pure_6989586621680039607Sym0 :: TyFun k1 (Maybe k1) -> Type) a
type Fail a2
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Fail a2 = Apply (Fail_6989586621680040362Sym0 :: TyFun Symbol (Maybe a1) -> Type) a2
type Return (arg :: a)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Return (arg :: a) = Apply (Return_6989586621679945578Sym0 :: TyFun a (Maybe a) -> Type) arg
type Sequence (arg :: Maybe (m a))
Instance details Defined in Data.Singletons.Prelude.Traversable type Sequence (arg :: Maybe (m a)) = Apply (Sequence_6989586621680960784Sym0 :: TyFun (Maybe (m a)) (m (Maybe a)) -> Type) arg
type SequenceA (arg :: Maybe (f a))
Instance details Defined in Data.Singletons.Prelude.Traversable type SequenceA (arg :: Maybe (f a)) = Apply (SequenceA_6989586621680960756Sym0 :: TyFun (Maybe (f a)) (f (Maybe a)) -> Type) arg
type Elem (arg1 :: a) (arg2 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Elem (arg1 :: a) (arg2 :: Maybe a) = Apply (Apply (Elem_6989586621680726647Sym0 :: TyFun a (Maybe a ~> Bool) -> Type) arg1) arg2
type Foldl1 (arg1 :: a ~> (a ~> a)) (arg2 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Foldl1 (arg1 :: a ~> (a ~> a)) (arg2 :: Maybe a) = Apply (Apply (Foldl1_6989586621680726579Sym0 :: TyFun (a ~> (a ~> a)) (Maybe a ~> a) -> Type) arg1) arg2
type Foldr1 (arg1 :: a ~> (a ~> a)) (arg2 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Foldr1 (arg1 :: a ~> (a ~> a)) (arg2 :: Maybe a) = Apply (Apply (Foldr1_6989586621680726554Sym0 :: TyFun (a ~> (a ~> a)) (Maybe a ~> a) -> Type) arg1) arg2
type (a1 :: Maybe a6989586621679943887) <\|> (a2 :: Maybe a6989586621679943887)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type (a1 :: Maybe a6989586621679943887) <\|> (a2 :: Maybe a6989586621679943887) = Apply (Apply (TFHelper_6989586621680040487Sym0 :: TyFun (Maybe a6989586621679943887) (Maybe a6989586621679943887 ~> Maybe a6989586621679943887) -> Type) a1) a2
type Mplus (arg1 :: Maybe a) (arg2 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Mplus (arg1 :: Maybe a) (arg2 :: Maybe a) = Apply (Apply (Mplus_6989586621679945611Sym0 :: TyFun (Maybe a) (Maybe a ~> Maybe a) -> Type) arg1) arg2
type FoldMap (a1 :: a6989586621680725724 ~> k2) (a2 :: Maybe a6989586621680725724)
Instance details Defined in Data.Singletons.Prelude.Foldable type FoldMap (a1 :: a6989586621680725724 ~> k2) (a2 :: Maybe a6989586621680725724) = Apply (Apply (FoldMap_6989586621680726715Sym0 :: TyFun (a6989586621680725724 ~> k2) (Maybe a6989586621680725724 ~> k2) -> Type) a1) a2
type (a1 :: k1) <$ (a2 :: Maybe b6989586621679943774)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type (a1 :: k1) <$ (a2 :: Maybe b6989586621679943774) = Apply (Apply (TFHelper_6989586621680039478Sym0 :: TyFun k1 (Maybe b6989586621679943774 ~> Maybe k1) -> Type) a1) a2
type Fmap (a1 :: a6989586621679943771 ~> b6989586621679943772) (a2 :: Maybe a6989586621679943771)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Fmap (a1 :: a6989586621679943771 ~> b6989586621679943772) (a2 :: Maybe a6989586621679943771) = Apply (Apply (Fmap_6989586621680039458Sym0 :: TyFun (a6989586621679943771 ~> b6989586621679943772) (Maybe a6989586621679943771 ~> Maybe b6989586621679943772) -> Type) a1) a2
type (arg1 :: Maybe a) <* (arg2 :: Maybe b)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type (arg1 :: Maybe a) <* (arg2 :: Maybe b) = Apply (Apply (TFHelper_6989586621679945533Sym0 :: TyFun (Maybe a) (Maybe b ~> Maybe a) -> Type) arg1) arg2
type (a1 :: Maybe a6989586621679943784) *> (a2 :: Maybe b6989586621679943785)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type (a1 :: Maybe a6989586621679943784) *> (a2 :: Maybe b6989586621679943785) = Apply (Apply (TFHelper_6989586621680040134Sym0 :: TyFun (Maybe a6989586621679943784) (Maybe b6989586621679943785 ~> Maybe b6989586621679943785) -> Type) a1) a2
type (a1 :: Maybe (a6989586621679943779 ~> b6989586621679943780)) <*> (a2 :: Maybe a6989586621679943779)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type (a1 :: Maybe (a6989586621679943779 ~> b6989586621679943780)) <*> (a2 :: Maybe a6989586621679943779) = Apply (Apply (TFHelper_6989586621680039619Sym0 :: TyFun (Maybe (a6989586621679943779 ~> b6989586621679943780)) (Maybe a6989586621679943779 ~> Maybe b6989586621679943780) -> Type) a1) a2
type (a1 :: Maybe a6989586621679943817) >> (a2 :: Maybe b6989586621679943818)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type (a1 :: Maybe a6989586621679943817) >> (a2 :: Maybe b6989586621679943818) = Apply (Apply (TFHelper_6989586621680040351Sym0 :: TyFun (Maybe a6989586621679943817) (Maybe b6989586621679943818 ~> Maybe b6989586621679943818) -> Type) a1) a2
type (a1 :: Maybe a6989586621679943815) >>= (a2 :: a6989586621679943815 ~> Maybe b6989586621679943816)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type (a1 :: Maybe a6989586621679943815) >>= (a2 :: a6989586621679943815 ~> Maybe b6989586621679943816) = Apply (Apply (TFHelper_6989586621680040333Sym0 :: TyFun (Maybe a6989586621679943815) ((a6989586621679943815 ~> Maybe b6989586621679943816) ~> Maybe b6989586621679943816) -> Type) a1) a2
type MapM (arg1 :: a ~> m b) (arg2 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Traversable type MapM (arg1 :: a ~> m b) (arg2 :: Maybe a) = Apply (Apply (MapM_6989586621680960774Sym0 :: TyFun (a ~> m b) (Maybe a ~> m (Maybe b)) -> Type) arg1) arg2
type Traverse (a1 :: a6989586621680959944 ~> f6989586621680959943 b6989586621680959945) (a2 :: Maybe a6989586621680959944)
Instance details Defined in Data.Singletons.Prelude.Traversable type Traverse (a1 :: a6989586621680959944 ~> f6989586621680959943 b6989586621680959945) (a2 :: Maybe a6989586621680959944) = Apply (Apply (Traverse_6989586621680970945Sym0 :: TyFun (a6989586621680959944 ~> f6989586621680959943 b6989586621680959945) (Maybe a6989586621680959944 ~> f6989586621680959943 (Maybe b6989586621680959945)) -> Type) a1) a2
type Foldl' (arg1 :: b ~> (a ~> b)) (arg2 :: b) (arg3 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Foldl' (arg1 :: b ~> (a ~> b)) (arg2 :: b) (arg3 :: Maybe a) = Apply (Apply (Apply (Foldl'_6989586621680726528Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (Maybe a ~> b)) -> Type) arg1) arg2) arg3
type Foldl (a1 :: k2 ~> (a6989586621680725730 ~> k2)) (a2 :: k2) (a3 :: Maybe a6989586621680725730)
Instance details Defined in Data.Singletons.Prelude.Foldable type Foldl (a1 :: k2 ~> (a6989586621680725730 ~> k2)) (a2 :: k2) (a3 :: Maybe a6989586621680725730) = Apply (Apply (Apply (Foldl_6989586621680726750Sym0 :: TyFun (k2 ~> (a6989586621680725730 ~> k2)) (k2 ~> (Maybe a6989586621680725730 ~> k2)) -> Type) a1) a2) a3
type Foldr' (arg1 :: a ~> (b ~> b)) (arg2 :: b) (arg3 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Foldr' (arg1 :: a ~> (b ~> b)) (arg2 :: b) (arg3 :: Maybe a) = Apply (Apply (Apply (Foldr'_6989586621680726473Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (Maybe a ~> b)) -> Type) arg1) arg2) arg3
type Foldr (a1 :: a6989586621680725725 ~> (k2 ~> k2)) (a2 :: k2) (a3 :: Maybe a6989586621680725725)
Instance details Defined in Data.Singletons.Prelude.Foldable type Foldr (a1 :: a6989586621680725725 ~> (k2 ~> k2)) (a2 :: k2) (a3 :: Maybe a6989586621680725725) = Apply (Apply (Apply (Foldr_6989586621680726732Sym0 :: TyFun (a6989586621680725725 ~> (k2 ~> k2)) (k2 ~> (Maybe a6989586621680725725 ~> k2)) -> Type) a1) a2) a3
type LiftA2 (a1 :: a6989586621679943781 ~> (b6989586621679943782 ~> c6989586621679943783)) (a2 :: Maybe a6989586621679943781) (a3 :: Maybe b6989586621679943782)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type LiftA2 (a1 :: a6989586621679943781 ~> (b6989586621679943782 ~> c6989586621679943783)) (a2 :: Maybe a6989586621679943781) (a3 :: Maybe b6989586621679943782) = Apply (Apply (Apply (LiftA2_6989586621680039635Sym0 :: TyFun (a6989586621679943781 ~> (b6989586621679943782 ~> c6989586621679943783)) (Maybe a6989586621679943781 ~> (Maybe b6989586621679943782 ~> Maybe c6989586621679943783)) -> Type) a1) a2) a3
type Apply (IsNothingSym0 :: TyFun (Maybe a) Bool -> Type) (a6989586621680040910 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Maybe type Apply (IsNothingSym0 :: TyFun (Maybe a) Bool -> Type) (a6989586621680040910 :: Maybe a) = IsNothing a6989586621680040910
type Apply (IsJustSym0 :: TyFun (Maybe a) Bool -> Type) (a6989586621680040920 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Maybe type Apply (IsJustSym0 :: TyFun (Maybe a) Bool -> Type) (a6989586621680040920 :: Maybe a) = IsJust a6989586621680040920
type Apply (FromJustSym0 :: TyFun (Maybe a) a -> Type) (a6989586621680040894 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Maybe type Apply (FromJustSym0 :: TyFun (Maybe a) a -> Type) (a6989586621680040894 :: Maybe a) = FromJust a6989586621680040894
type Apply (Compare_6989586621679858323Sym1 a6989586621679858321 :: TyFun (Maybe a) Ordering -> Type) (a6989586621679858322 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Compare_6989586621679858323Sym1 a6989586621679858321 :: TyFun (Maybe a) Ordering -> Type) (a6989586621679858322 :: Maybe a) = Compare_6989586621679858323 a6989586621679858321 a6989586621679858322
type Apply (FromMaybeSym1 a6989586621680040875 :: TyFun (Maybe a) a -> Type) (a6989586621680040877 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Maybe type Apply (FromMaybeSym1 a6989586621680040875 :: TyFun (Maybe a) a -> Type) (a6989586621680040877 :: Maybe a) = FromMaybe a6989586621680040875 a6989586621680040877
type Apply (Maybe_Sym2 a6989586621680037416 a6989586621680037415 :: TyFun (Maybe a) b -> Type) (a6989586621680037417 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Maybe type Apply (Maybe_Sym2 a6989586621680037416 a6989586621680037415 :: TyFun (Maybe a) b -> Type) (a6989586621680037417 :: Maybe a) = Maybe_ a6989586621680037416 a6989586621680037415 a6989586621680037417
type Rep (Maybe a)	Since: base-4.6.0.0
Instance details Defined in GHC.Generics type Rep (Maybe a) = D1 (MetaData "Maybe" "GHC.Maybe" "base" False) (C1 (MetaCons "Nothing" PrefixI False) (U1 :: Type -> Type) :+: C1 (MetaCons "Just" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 a)))
data Sing (b :: Maybe a)
Instance details Defined in GHC.Generics data Sing (b :: Maybe a) where SNothing :: forall a (b :: Maybe a). Sing (Nothing :: Maybe a) SJust :: forall a (b :: Maybe a) (a1 :: a). Sing a1 -> Sing (Just a1)
type DemoteRep (Maybe a)
Instance details Defined in GHC.Generics type DemoteRep (Maybe a) = Maybe (DemoteRep a)
type Element (Maybe a)
Instance details Defined in Data.MonoTraversable type Element (Maybe a) = a
type Index (Maybe a)
Instance details Defined in Control.Lens.At type Index (Maybe a) = ()
type IxValue (Maybe a)
Instance details Defined in Control.Lens.At type IxValue (Maybe a) = a
type Mempty
Instance details Defined in Data.Singletons.Prelude.Monoid type Mempty = (Mempty_6989586621680665202Sym0 :: Maybe a)
data Sing (b :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Instances data Sing (b :: Maybe a) where SNothing :: forall a (b :: Maybe a). Sing (Nothing :: Maybe a) SJust :: forall a (b :: Maybe a) (n :: a). Sing n -> Sing (Just n)
type Demote (Maybe a)
Instance details Defined in Data.Singletons.Prelude.Instances type Demote (Maybe a) = Maybe (Demote a)
type Rep1 Maybe	Since: base-4.6.0.0
Instance details Defined in GHC.Generics type Rep1 Maybe = D1 (MetaData "Maybe" "GHC.Maybe" "base" False) (C1 (MetaCons "Nothing" PrefixI False) (U1 :: Type -> Type) :+: C1 (MetaCons "Just" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) Par1))
type Mconcat (arg :: [Maybe a])
Instance details Defined in Data.Singletons.Prelude.Monoid type Mconcat (arg :: [Maybe a]) = Apply (Mconcat_6989586621680665123Sym0 :: TyFun [Maybe a] (Maybe a) -> Type) arg
type Show_ (arg :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Show type Show_ (arg :: Maybe a) = Apply (Show__6989586621680581388Sym0 :: TyFun (Maybe a) Symbol -> Type) arg
type Sconcat (arg :: NonEmpty (Maybe a))
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type Sconcat (arg :: NonEmpty (Maybe a)) = Apply (Sconcat_6989586621680188294Sym0 :: TyFun (NonEmpty (Maybe a)) (Maybe a) -> Type) arg
type Mappend (arg1 :: Maybe a) (arg2 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Monoid type Mappend (arg1 :: Maybe a) (arg2 :: Maybe a) = Apply (Apply (Mappend_6989586621680665113Sym0 :: TyFun (Maybe a) (Maybe a ~> Maybe a) -> Type) arg1) arg2
type ShowList (arg1 :: [Maybe a]) arg2
Instance details Defined in Data.Singletons.Prelude.Show type ShowList (arg1 :: [Maybe a]) arg2 = Apply (Apply (ShowList_6989586621680581399Sym0 :: TyFun [Maybe a] (Symbol ~> Symbol) -> Type) arg1) arg2
type (a2 :: Maybe a1) <> (a3 :: Maybe a1)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type (a2 :: Maybe a1) <> (a3 :: Maybe a1) = Apply (Apply (TFHelper_6989586621680189295Sym0 :: TyFun (Maybe a1) (Maybe a1 ~> Maybe a1) -> Type) a2) a3
type Min (arg1 :: Maybe a) (arg2 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Ord type Min (arg1 :: Maybe a) (arg2 :: Maybe a) = Apply (Apply (Min_6989586621679832893Sym0 :: TyFun (Maybe a) (Maybe a ~> Maybe a) -> Type) arg1) arg2
type Max (arg1 :: Maybe a) (arg2 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Ord type Max (arg1 :: Maybe a) (arg2 :: Maybe a) = Apply (Apply (Max_6989586621679832875Sym0 :: TyFun (Maybe a) (Maybe a ~> Maybe a) -> Type) arg1) arg2
type (arg1 :: Maybe a) >= (arg2 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Ord type (arg1 :: Maybe a) >= (arg2 :: Maybe a) = Apply (Apply (TFHelper_6989586621679832857Sym0 :: TyFun (Maybe a) (Maybe a ~> Bool) -> Type) arg1) arg2
type (arg1 :: Maybe a) > (arg2 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Ord type (arg1 :: Maybe a) > (arg2 :: Maybe a) = Apply (Apply (TFHelper_6989586621679832839Sym0 :: TyFun (Maybe a) (Maybe a ~> Bool) -> Type) arg1) arg2
type (arg1 :: Maybe a) <= (arg2 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Ord type (arg1 :: Maybe a) <= (arg2 :: Maybe a) = Apply (Apply (TFHelper_6989586621679832817Sym0 :: TyFun (Maybe a) (Maybe a ~> Bool) -> Type) arg1) arg2
type (arg1 :: Maybe a) < (arg2 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Ord type (arg1 :: Maybe a) < (arg2 :: Maybe a) = Apply (Apply (TFHelper_6989586621679832797Sym0 :: TyFun (Maybe a) (Maybe a ~> Bool) -> Type) arg1) arg2
type Compare (a2 :: Maybe a1) (a3 :: Maybe a1)
Instance details Defined in Data.Singletons.Prelude.Ord type Compare (a2 :: Maybe a1) (a3 :: Maybe a1) = Apply (Apply (Compare_6989586621679858323Sym0 :: TyFun (Maybe a1) (Maybe a1 ~> Ordering) -> Type) a2) a3
type (x :: Maybe a) /= (y :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Eq type (x :: Maybe a) /= (y :: Maybe a) = Not (x == y)
type (a2 :: Maybe a1) == (b :: Maybe a1)
Instance details Defined in Data.Singletons.Prelude.Eq type (a2 :: Maybe a1) == (b :: Maybe a1) = Equals_6989586621679803918 a2 b
type ShowsPrec a2 (a3 :: Maybe a1) a4
Instance details Defined in Data.Singletons.Prelude.Show type ShowsPrec a2 (a3 :: Maybe a1) a4 = Apply (Apply (Apply (ShowsPrec_6989586621680610638Sym0 :: TyFun Nat (Maybe a1 ~> (Symbol ~> Symbol)) -> Type) a2) a3) a4
type Apply (Pure_6989586621680039607Sym0 :: TyFun a (Maybe a) -> Type) (a6989586621680039606 :: a)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (Pure_6989586621680039607Sym0 :: TyFun a (Maybe a) -> Type) (a6989586621680039606 :: a) = Pure_6989586621680039607 a6989586621680039606
type Apply (Fail_6989586621680040362Sym0 :: TyFun Symbol (Maybe a6989586621679943821) -> Type) (a6989586621680040361 :: Symbol)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (Fail_6989586621680040362Sym0 :: TyFun Symbol (Maybe a6989586621679943821) -> Type) (a6989586621680040361 :: Symbol) = (Fail_6989586621680040362 a6989586621680040361 :: Maybe a6989586621679943821)
type Apply (Let6989586621680040481LSym0 :: TyFun k1 (Maybe k1) -> Type) (wild_69895866216800370556989586621680040478 :: k1)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (Let6989586621680040481LSym0 :: TyFun k1 (Maybe k1) -> Type) (wild_69895866216800370556989586621680040478 :: k1) = Let6989586621680040481L wild_69895866216800370556989586621680040478
type Apply (JustSym0 :: TyFun a (Maybe a) -> Type) (t6989586621679738025 :: a)
Instance details Defined in Data.Singletons.Prelude.Instances type Apply (JustSym0 :: TyFun a (Maybe a) -> Type) (t6989586621679738025 :: a) = Just t6989586621679738025
type Apply (Let6989586621680717506MSym1 x6989586621680717504 :: TyFun k (Maybe k1) -> Type) (y6989586621680717505 :: k)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680717506MSym1 x6989586621680717504 :: TyFun k (Maybe k1) -> Type) (y6989586621680717505 :: k) = Let6989586621680717506M x6989586621680717504 y6989586621680717505
type Apply (Let6989586621680717506NSym1 x6989586621680717504 :: TyFun k1 (Maybe k1) -> Type) (y6989586621680717505 :: k1)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680717506NSym1 x6989586621680717504 :: TyFun k1 (Maybe k1) -> Type) (y6989586621680717505 :: k1) = Let6989586621680717506N x6989586621680717504 y6989586621680717505
type Apply (Let6989586621680717533MSym1 x6989586621680717531 :: TyFun k (Maybe k1) -> Type) (y6989586621680717532 :: k)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680717533MSym1 x6989586621680717531 :: TyFun k (Maybe k1) -> Type) (y6989586621680717532 :: k) = Let6989586621680717533M x6989586621680717531 y6989586621680717532
type Apply (Let6989586621680717533NSym1 x6989586621680717531 :: TyFun k1 (Maybe k1) -> Type) (y6989586621680717532 :: k1)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680717533NSym1 x6989586621680717531 :: TyFun k1 (Maybe k1) -> Type) (y6989586621680717532 :: k1) = Let6989586621680717533N x6989586621680717531 y6989586621680717532
type Apply (Lambda_6989586621680674754Sym2 k6989586621680674753 a6989586621680674752 :: TyFun k1 (Maybe a) -> Type) (t6989586621680674765 :: k1)
Instance details Defined in Data.Singletons.Prelude.Monoid type Apply (Lambda_6989586621680674754Sym2 k6989586621680674753 a6989586621680674752 :: TyFun k1 (Maybe a) -> Type) (t6989586621680674765 :: k1) = Lambda_6989586621680674754 k6989586621680674753 a6989586621680674752 t6989586621680674765
type Apply (Lambda_6989586621680674842Sym2 k6989586621680674841 a6989586621680674840 :: TyFun k1 (Maybe a) -> Type) (t6989586621680674853 :: k1)
Instance details Defined in Data.Singletons.Prelude.Monoid type Apply (Lambda_6989586621680674842Sym2 k6989586621680674841 a6989586621680674840 :: TyFun k1 (Maybe a) -> Type) (t6989586621680674853 :: k1) = Lambda_6989586621680674842 k6989586621680674841 a6989586621680674840 t6989586621680674853
type Apply (Let6989586621680726564MfSym3 a6989586621680726565 xs6989586621680726563 f6989586621680726562 :: TyFun k3 (Maybe k3) -> Type) (a6989586621680726566 :: k3)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680726564MfSym3 a6989586621680726565 xs6989586621680726563 f6989586621680726562 :: TyFun k3 (Maybe k3) -> Type) (a6989586621680726566 :: k3) = Let6989586621680726564Mf a6989586621680726565 xs6989586621680726563 f6989586621680726562 a6989586621680726566
type Apply (CatMaybesSym0 :: TyFun [Maybe a] [a] -> Type) (a6989586621680040830 :: [Maybe a])
Instance details Defined in Data.Singletons.Prelude.Maybe type Apply (CatMaybesSym0 :: TyFun [Maybe a] [a] -> Type) (a6989586621680040830 :: [Maybe a]) = CatMaybes a6989586621680040830
type Apply (MaybeToListSym0 :: TyFun (Maybe a) [a] -> Type) (a6989586621680040863 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Maybe type Apply (MaybeToListSym0 :: TyFun (Maybe a) [a] -> Type) (a6989586621680040863 :: Maybe a) = MaybeToList a6989586621680040863
type Apply (ListToMaybeSym0 :: TyFun [a] (Maybe a) -> Type) (a6989586621680040849 :: [a])
Instance details Defined in Data.Singletons.Prelude.Maybe type Apply (ListToMaybeSym0 :: TyFun [a] (Maybe a) -> Type) (a6989586621680040849 :: [a]) = ListToMaybe a6989586621680040849
type Apply (GetOptionSym0 :: TyFun (Option a) (Maybe a) -> Type) (a6989586621680204493 :: Option a)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply (GetOptionSym0 :: TyFun (Option a) (Maybe a) -> Type) (a6989586621680204493 :: Option a) = GetOption a6989586621680204493
type Apply (GetFirstSym0 :: TyFun (First a) (Maybe a) -> Type) (a6989586621680668650 :: First a)
Instance details Defined in Data.Singletons.Prelude.Monoid type Apply (GetFirstSym0 :: TyFun (First a) (Maybe a) -> Type) (a6989586621680668650 :: First a) = GetFirst a6989586621680668650
type Apply (GetLastSym0 :: TyFun (Last a) (Maybe a) -> Type) (a6989586621680668671 :: Last a)
Instance details Defined in Data.Singletons.Prelude.Monoid type Apply (GetLastSym0 :: TyFun (Last a) (Maybe a) -> Type) (a6989586621680668671 :: Last a) = GetLast a6989586621680668671
type Apply (OptionSym0 :: TyFun (Maybe a) (Option a) -> Type) (t6989586621680204496 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply (OptionSym0 :: TyFun (Maybe a) (Option a) -> Type) (t6989586621680204496 :: Maybe a) = Option t6989586621680204496
type Apply (FirstSym0 :: TyFun (Maybe a) (First a) -> Type) (t6989586621680668653 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Monoid type Apply (FirstSym0 :: TyFun (Maybe a) (First a) -> Type) (t6989586621680668653 :: Maybe a) = First t6989586621680668653
type Apply (LastSym0 :: TyFun (Maybe a) (Last a) -> Type) (t6989586621680668674 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Monoid type Apply (LastSym0 :: TyFun (Maybe a) (Last a) -> Type) (t6989586621680668674 :: Maybe a) = Last t6989586621680668674
type Apply (MinInternalSym0 :: TyFun (Maybe a) (MinInternal a) -> Type) (t6989586621680716927 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (MinInternalSym0 :: TyFun (Maybe a) (MinInternal a) -> Type) (t6989586621680716927 :: Maybe a) = MinInternal t6989586621680716927
type Apply (MaxInternalSym0 :: TyFun (Maybe a) (MaxInternal a) -> Type) (t6989586621680716720 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (MaxInternalSym0 :: TyFun (Maybe a) (MaxInternal a) -> Type) (t6989586621680716720 :: Maybe a) = MaxInternal t6989586621680716720
type Apply (StripPrefixSym1 a6989586621680455510 :: TyFun [a] (Maybe [a]) -> Type) (a6989586621680455511 :: [a])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (StripPrefixSym1 a6989586621680455510 :: TyFun [a] (Maybe [a]) -> Type) (a6989586621680455511 :: [a]) = StripPrefix a6989586621680455510 a6989586621680455511
type Apply (FindIndexSym1 a6989586621680326500 :: TyFun [a] (Maybe Nat) -> Type) (a6989586621680326501 :: [a])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (FindIndexSym1 a6989586621680326500 :: TyFun [a] (Maybe Nat) -> Type) (a6989586621680326501 :: [a]) = FindIndex a6989586621680326500 a6989586621680326501
type Apply (ElemIndexSym1 a6989586621680326508 :: TyFun [a] (Maybe Nat) -> Type) (a6989586621680326509 :: [a])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (ElemIndexSym1 a6989586621680326508 :: TyFun [a] (Maybe Nat) -> Type) (a6989586621680326509 :: [a]) = ElemIndex a6989586621680326508 a6989586621680326509
type Apply (FindSym1 a6989586621680326140 :: TyFun [a] (Maybe a) -> Type) (a6989586621680326141 :: [a])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (FindSym1 a6989586621680326140 :: TyFun [a] (Maybe a) -> Type) (a6989586621680326141 :: [a]) = Find a6989586621680326140 a6989586621680326141
type Apply (TFHelper_6989586621680040487Sym1 a6989586621680040485 :: TyFun (Maybe a) (Maybe a) -> Type) (a6989586621680040486 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680040487Sym1 a6989586621680040485 :: TyFun (Maybe a) (Maybe a) -> Type) (a6989586621680040486 :: Maybe a) = TFHelper_6989586621680040487 a6989586621680040485 a6989586621680040486
type Apply (OptionalSym0 :: TyFun (f a) (f (Maybe a)) -> Type) (a6989586621680960116 :: f a)
Instance details Defined in Data.Singletons.Prelude.Applicative type Apply (OptionalSym0 :: TyFun (f a) (f (Maybe a)) -> Type) (a6989586621680960116 :: f a) = Optional a6989586621680960116
type Apply (LookupSym1 a6989586621680325922 b :: TyFun [(a, b)] (Maybe b) -> Type) (a6989586621680325923 :: [(a, b)])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (LookupSym1 a6989586621680325922 b :: TyFun [(a, b)] (Maybe b) -> Type) (a6989586621680325923 :: [(a, b)]) = Lookup a6989586621680325922 a6989586621680325923
type Apply (FindSym1 a6989586621680726087 t :: TyFun (t a) (Maybe a) -> Type) (a6989586621680726088 :: t a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (FindSym1 a6989586621680726087 t :: TyFun (t a) (Maybe a) -> Type) (a6989586621680726088 :: t a) = Find a6989586621680726087 a6989586621680726088
type Apply (Fmap_6989586621680039458Sym1 a6989586621680039456 :: TyFun (Maybe a) (Maybe b) -> Type) (a6989586621680039457 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (Fmap_6989586621680039458Sym1 a6989586621680039456 :: TyFun (Maybe a) (Maybe b) -> Type) (a6989586621680039457 :: Maybe a) = Fmap_6989586621680039458 a6989586621680039456 a6989586621680039457
type Apply (TFHelper_6989586621680039478Sym1 a6989586621680039476 b :: TyFun (Maybe b) (Maybe a) -> Type) (a6989586621680039477 :: Maybe b)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680039478Sym1 a6989586621680039476 b :: TyFun (Maybe b) (Maybe a) -> Type) (a6989586621680039477 :: Maybe b) = TFHelper_6989586621680039478 a6989586621680039476 a6989586621680039477
type Apply (TFHelper_6989586621680039619Sym1 a6989586621680039617 :: TyFun (Maybe a) (Maybe b) -> Type) (a6989586621680039618 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680039619Sym1 a6989586621680039617 :: TyFun (Maybe a) (Maybe b) -> Type) (a6989586621680039618 :: Maybe a) = TFHelper_6989586621680039619 a6989586621680039617 a6989586621680039618
type Apply (TFHelper_6989586621680040134Sym1 a6989586621680040132 b :: TyFun (Maybe b) (Maybe b) -> Type) (a6989586621680040133 :: Maybe b)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680040134Sym1 a6989586621680040132 b :: TyFun (Maybe b) (Maybe b) -> Type) (a6989586621680040133 :: Maybe b) = TFHelper_6989586621680040134 a6989586621680040132 a6989586621680040133
type Apply (TFHelper_6989586621680040351Sym1 a6989586621680040349 b :: TyFun (Maybe b) (Maybe b) -> Type) (a6989586621680040350 :: Maybe b)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680040351Sym1 a6989586621680040349 b :: TyFun (Maybe b) (Maybe b) -> Type) (a6989586621680040350 :: Maybe b) = TFHelper_6989586621680040351 a6989586621680040349 a6989586621680040350
type Apply (Traverse_6989586621680970945Sym1 a6989586621680970943 :: TyFun (Maybe a) (f (Maybe b)) -> Type) (a6989586621680970944 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Traversable type Apply (Traverse_6989586621680970945Sym1 a6989586621680970943 :: TyFun (Maybe a) (f (Maybe b)) -> Type) (a6989586621680970944 :: Maybe a) = Traverse_6989586621680970945 a6989586621680970943 a6989586621680970944
type Apply (LiftA2_6989586621680039635Sym2 a6989586621680039633 a6989586621680039632 :: TyFun (Maybe b) (Maybe c) -> Type) (a6989586621680039634 :: Maybe b)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (LiftA2_6989586621680039635Sym2 a6989586621680039633 a6989586621680039632 :: TyFun (Maybe b) (Maybe c) -> Type) (a6989586621680039634 :: Maybe b) = LiftA2_6989586621680039635 a6989586621680039633 a6989586621680039632 a6989586621680039634
type Apply (Let6989586621680726539MfSym3 a6989586621680726540 xs6989586621680726538 f6989586621680726537 :: TyFun (Maybe k2) (Maybe k3) -> Type) (a6989586621680726541 :: Maybe k2)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680726539MfSym3 a6989586621680726540 xs6989586621680726538 f6989586621680726537 :: TyFun (Maybe k2) (Maybe k3) -> Type) (a6989586621680726541 :: Maybe k2) = Let6989586621680726539Mf a6989586621680726540 xs6989586621680726538 f6989586621680726537 a6989586621680726541
type Apply (TFHelper_6989586621680040333Sym1 a6989586621680040331 b :: TyFun (a ~> Maybe b) (Maybe b) -> Type) (a6989586621680040332 :: a ~> Maybe b)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680040333Sym1 a6989586621680040331 b :: TyFun (a ~> Maybe b) (Maybe b) -> Type) (a6989586621680040332 :: a ~> Maybe b) = TFHelper_6989586621680040333 a6989586621680040331 a6989586621680040332
type Apply (ElemIndexSym0 :: TyFun a6989586621680316582 ([a6989586621680316582] ~> Maybe Nat) -> Type) (a6989586621680326508 :: a6989586621680316582)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (ElemIndexSym0 :: TyFun a6989586621680316582 ([a6989586621680316582] ~> Maybe Nat) -> Type) (a6989586621680326508 :: a6989586621680316582) = ElemIndexSym1 a6989586621680326508
type Apply (ShowsPrec_6989586621680610638Sym0 :: TyFun Nat (Maybe a3530822107858468865 ~> (Symbol ~> Symbol)) -> Type) (a6989586621680610635 :: Nat)
Instance details Defined in Data.Singletons.Prelude.Show type Apply (ShowsPrec_6989586621680610638Sym0 :: TyFun Nat (Maybe a3530822107858468865 ~> (Symbol ~> Symbol)) -> Type) (a6989586621680610635 :: Nat) = (ShowsPrec_6989586621680610638Sym1 a6989586621680610635 a3530822107858468865 :: TyFun (Maybe a3530822107858468865) (Symbol ~> Symbol) -> Type)
type Apply (FromMaybeSym0 :: TyFun a6989586621680040189 (Maybe a6989586621680040189 ~> a6989586621680040189) -> Type) (a6989586621680040875 :: a6989586621680040189)
Instance details Defined in Data.Singletons.Prelude.Maybe type Apply (FromMaybeSym0 :: TyFun a6989586621680040189 (Maybe a6989586621680040189 ~> a6989586621680040189) -> Type) (a6989586621680040875 :: a6989586621680040189) = FromMaybeSym1 a6989586621680040875
type Apply (Let6989586621680717506MSym0 :: TyFun k1 (TyFun k (Maybe k1) -> Type) -> Type) (x6989586621680717504 :: k1)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680717506MSym0 :: TyFun k1 (TyFun k (Maybe k1) -> Type) -> Type) (x6989586621680717504 :: k1) = (Let6989586621680717506MSym1 x6989586621680717504 :: TyFun k (Maybe k1) -> Type)
type Apply (Let6989586621680717506NSym0 :: TyFun k (TyFun k1 (Maybe k1) -> Type) -> Type) (x6989586621680717504 :: k)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680717506NSym0 :: TyFun k (TyFun k1 (Maybe k1) -> Type) -> Type) (x6989586621680717504 :: k) = (Let6989586621680717506NSym1 x6989586621680717504 :: TyFun k1 (Maybe k1) -> Type)
type Apply (Let6989586621680717533MSym0 :: TyFun k1 (TyFun k (Maybe k1) -> Type) -> Type) (x6989586621680717531 :: k1)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680717533MSym0 :: TyFun k1 (TyFun k (Maybe k1) -> Type) -> Type) (x6989586621680717531 :: k1) = (Let6989586621680717533MSym1 x6989586621680717531 :: TyFun k (Maybe k1) -> Type)
type Apply (Let6989586621680717533NSym0 :: TyFun k (TyFun k1 (Maybe k1) -> Type) -> Type) (x6989586621680717531 :: k)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680717533NSym0 :: TyFun k (TyFun k1 (Maybe k1) -> Type) -> Type) (x6989586621680717531 :: k) = (Let6989586621680717533NSym1 x6989586621680717531 :: TyFun k1 (Maybe k1) -> Type)
type Apply (LookupSym0 :: TyFun a6989586621680316561 ([(a6989586621680316561, b6989586621680316562)] ~> Maybe b6989586621680316562) -> Type) (a6989586621680325922 :: a6989586621680316561)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (LookupSym0 :: TyFun a6989586621680316561 ([(a6989586621680316561, b6989586621680316562)] ~> Maybe b6989586621680316562) -> Type) (a6989586621680325922 :: a6989586621680316561) = (LookupSym1 a6989586621680325922 b6989586621680316562 :: TyFun [(a6989586621680316561, b6989586621680316562)] (Maybe b6989586621680316562) -> Type)
type Apply (TFHelper_6989586621680039478Sym0 :: TyFun a6989586621679943773 (Maybe b6989586621679943774 ~> Maybe a6989586621679943773) -> Type) (a6989586621680039476 :: a6989586621679943773)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680039478Sym0 :: TyFun a6989586621679943773 (Maybe b6989586621679943774 ~> Maybe a6989586621679943773) -> Type) (a6989586621680039476 :: a6989586621679943773) = (TFHelper_6989586621680039478Sym1 a6989586621680039476 b6989586621679943774 :: TyFun (Maybe b6989586621679943774) (Maybe a6989586621679943773) -> Type)
type Apply (Maybe_Sym0 :: TyFun b6989586621680037187 ((a6989586621680037188 ~> b6989586621680037187) ~> (Maybe a6989586621680037188 ~> b6989586621680037187)) -> Type) (a6989586621680037415 :: b6989586621680037187)
Instance details Defined in Data.Singletons.Prelude.Maybe type Apply (Maybe_Sym0 :: TyFun b6989586621680037187 ((a6989586621680037188 ~> b6989586621680037187) ~> (Maybe a6989586621680037188 ~> b6989586621680037187)) -> Type) (a6989586621680037415 :: b6989586621680037187) = (Maybe_Sym1 a6989586621680037415 a6989586621680037188 :: TyFun (a6989586621680037188 ~> b6989586621680037187) (Maybe a6989586621680037188 ~> b6989586621680037187) -> Type)
type Apply (Lambda_6989586621680674754Sym0 :: TyFun k (TyFun (k1 ~> First a) (TyFun k1 (Maybe a) -> Type) -> Type) -> Type) (a6989586621680674752 :: k)
Instance details Defined in Data.Singletons.Prelude.Monoid type Apply (Lambda_6989586621680674754Sym0 :: TyFun k (TyFun (k1 ~> First a) (TyFun k1 (Maybe a) -> Type) -> Type) -> Type) (a6989586621680674752 :: k) = (Lambda_6989586621680674754Sym1 a6989586621680674752 :: TyFun (k1 ~> First a) (TyFun k1 (Maybe a) -> Type) -> Type)
type Apply (Lambda_6989586621680674842Sym0 :: TyFun k (TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type) -> Type) (a6989586621680674840 :: k)
Instance details Defined in Data.Singletons.Prelude.Monoid type Apply (Lambda_6989586621680674842Sym0 :: TyFun k (TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type) -> Type) (a6989586621680674840 :: k) = (Lambda_6989586621680674842Sym1 a6989586621680674840 :: TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type)
type Apply (Let6989586621680726564MfSym1 f6989586621680726562 :: TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type) (xs6989586621680726563 :: k)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680726564MfSym1 f6989586621680726562 :: TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type) (xs6989586621680726563 :: k) = Let6989586621680726564MfSym2 f6989586621680726562 xs6989586621680726563
type Apply (Let6989586621680726539MfSym1 f6989586621680726537 :: TyFun k (TyFun k3 (TyFun (Maybe k2) (Maybe k3) -> Type) -> Type) -> Type) (xs6989586621680726538 :: k)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680726539MfSym1 f6989586621680726537 :: TyFun k (TyFun k3 (TyFun (Maybe k2) (Maybe k3) -> Type) -> Type) -> Type) (xs6989586621680726538 :: k) = Let6989586621680726539MfSym2 f6989586621680726537 xs6989586621680726538
type Apply (Let6989586621680726539MfSym2 xs6989586621680726538 f6989586621680726537 :: TyFun k3 (TyFun (Maybe k2) (Maybe k3) -> Type) -> Type) (a6989586621680726540 :: k3)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680726539MfSym2 xs6989586621680726538 f6989586621680726537 :: TyFun k3 (TyFun (Maybe k2) (Maybe k3) -> Type) -> Type) (a6989586621680726540 :: k3) = Let6989586621680726539MfSym3 xs6989586621680726538 f6989586621680726537 a6989586621680726540
type Apply (StripPrefixSym0 :: TyFun [a6989586621680442800] ([a6989586621680442800] ~> Maybe [a6989586621680442800]) -> Type) (a6989586621680455510 :: [a6989586621680442800])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (StripPrefixSym0 :: TyFun [a6989586621680442800] ([a6989586621680442800] ~> Maybe [a6989586621680442800]) -> Type) (a6989586621680455510 :: [a6989586621680442800]) = StripPrefixSym1 a6989586621680455510
type Apply (TFHelper_6989586621680040487Sym0 :: TyFun (Maybe a6989586621679943887) (Maybe a6989586621679943887 ~> Maybe a6989586621679943887) -> Type) (a6989586621680040485 :: Maybe a6989586621679943887)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680040487Sym0 :: TyFun (Maybe a6989586621679943887) (Maybe a6989586621679943887 ~> Maybe a6989586621679943887) -> Type) (a6989586621680040485 :: Maybe a6989586621679943887) = TFHelper_6989586621680040487Sym1 a6989586621680040485
type Apply (Compare_6989586621679858323Sym0 :: TyFun (Maybe a3530822107858468865) (Maybe a3530822107858468865 ~> Ordering) -> Type) (a6989586621679858321 :: Maybe a3530822107858468865)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Compare_6989586621679858323Sym0 :: TyFun (Maybe a3530822107858468865) (Maybe a3530822107858468865 ~> Ordering) -> Type) (a6989586621679858321 :: Maybe a3530822107858468865) = Compare_6989586621679858323Sym1 a6989586621679858321
type Apply (TFHelper_6989586621680039619Sym0 :: TyFun (Maybe (a6989586621679943779 ~> b6989586621679943780)) (Maybe a6989586621679943779 ~> Maybe b6989586621679943780) -> Type) (a6989586621680039617 :: Maybe (a6989586621679943779 ~> b6989586621679943780))
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680039619Sym0 :: TyFun (Maybe (a6989586621679943779 ~> b6989586621679943780)) (Maybe a6989586621679943779 ~> Maybe b6989586621679943780) -> Type) (a6989586621680039617 :: Maybe (a6989586621679943779 ~> b6989586621679943780)) = TFHelper_6989586621680039619Sym1 a6989586621680039617
type Apply (TFHelper_6989586621680040134Sym0 :: TyFun (Maybe a6989586621679943784) (Maybe b6989586621679943785 ~> Maybe b6989586621679943785) -> Type) (a6989586621680040132 :: Maybe a6989586621679943784)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680040134Sym0 :: TyFun (Maybe a6989586621679943784) (Maybe b6989586621679943785 ~> Maybe b6989586621679943785) -> Type) (a6989586621680040132 :: Maybe a6989586621679943784) = (TFHelper_6989586621680040134Sym1 a6989586621680040132 b6989586621679943785 :: TyFun (Maybe b6989586621679943785) (Maybe b6989586621679943785) -> Type)
type Apply (TFHelper_6989586621680040351Sym0 :: TyFun (Maybe a6989586621679943817) (Maybe b6989586621679943818 ~> Maybe b6989586621679943818) -> Type) (a6989586621680040349 :: Maybe a6989586621679943817)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680040351Sym0 :: TyFun (Maybe a6989586621679943817) (Maybe b6989586621679943818 ~> Maybe b6989586621679943818) -> Type) (a6989586621680040349 :: Maybe a6989586621679943817) = (TFHelper_6989586621680040351Sym1 a6989586621680040349 b6989586621679943818 :: TyFun (Maybe b6989586621679943818) (Maybe b6989586621679943818) -> Type)
type Apply (ShowsPrec_6989586621680610638Sym1 a6989586621680610635 a3530822107858468865 :: TyFun (Maybe a3530822107858468865) (Symbol ~> Symbol) -> Type) (a6989586621680610636 :: Maybe a3530822107858468865)
Instance details Defined in Data.Singletons.Prelude.Show type Apply (ShowsPrec_6989586621680610638Sym1 a6989586621680610635 a3530822107858468865 :: TyFun (Maybe a3530822107858468865) (Symbol ~> Symbol) -> Type) (a6989586621680610636 :: Maybe a3530822107858468865) = ShowsPrec_6989586621680610638Sym2 a6989586621680610635 a6989586621680610636
type Apply (TFHelper_6989586621680040333Sym0 :: TyFun (Maybe a6989586621679943815) ((a6989586621679943815 ~> Maybe b6989586621679943816) ~> Maybe b6989586621679943816) -> Type) (a6989586621680040331 :: Maybe a6989586621679943815)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680040333Sym0 :: TyFun (Maybe a6989586621679943815) ((a6989586621679943815 ~> Maybe b6989586621679943816) ~> Maybe b6989586621679943816) -> Type) (a6989586621680040331 :: Maybe a6989586621679943815) = (TFHelper_6989586621680040333Sym1 a6989586621680040331 b6989586621679943816 :: TyFun (a6989586621679943815 ~> Maybe b6989586621679943816) (Maybe b6989586621679943816) -> Type)
type Apply (LiftA2_6989586621680039635Sym1 a6989586621680039632 :: TyFun (Maybe a6989586621679943781) (Maybe b6989586621679943782 ~> Maybe c6989586621679943783) -> Type) (a6989586621680039633 :: Maybe a6989586621679943781)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (LiftA2_6989586621680039635Sym1 a6989586621680039632 :: TyFun (Maybe a6989586621679943781) (Maybe b6989586621679943782 ~> Maybe c6989586621679943783) -> Type) (a6989586621680039633 :: Maybe a6989586621679943781) = LiftA2_6989586621680039635Sym2 a6989586621680039632 a6989586621680039633
type Apply (Let6989586621680726564MfSym2 xs6989586621680726563 f6989586621680726562 :: TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) (a6989586621680726565 :: Maybe k2)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680726564MfSym2 xs6989586621680726563 f6989586621680726562 :: TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) (a6989586621680726565 :: Maybe k2) = Let6989586621680726564MfSym3 xs6989586621680726563 f6989586621680726562 a6989586621680726565
type Apply (FindSym0 :: TyFun (a6989586621680316583 ~> Bool) ([a6989586621680316583] ~> Maybe a6989586621680316583) -> Type) (a6989586621680326140 :: a6989586621680316583 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (FindSym0 :: TyFun (a6989586621680316583 ~> Bool) ([a6989586621680316583] ~> Maybe a6989586621680316583) -> Type) (a6989586621680326140 :: a6989586621680316583 ~> Bool) = FindSym1 a6989586621680326140
type Apply (FindIndexSym0 :: TyFun (a6989586621680316580 ~> Bool) ([a6989586621680316580] ~> Maybe Nat) -> Type) (a6989586621680326500 :: a6989586621680316580 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (FindIndexSym0 :: TyFun (a6989586621680316580 ~> Bool) ([a6989586621680316580] ~> Maybe Nat) -> Type) (a6989586621680326500 :: a6989586621680316580 ~> Bool) = FindIndexSym1 a6989586621680326500
type Apply (MapMaybeSym0 :: TyFun (a6989586621680040184 ~> Maybe b6989586621680040185) ([a6989586621680040184] ~> [b6989586621680040185]) -> Type) (a6989586621680040776 :: a6989586621680040184 ~> Maybe b6989586621680040185)
Instance details Defined in Data.Singletons.Prelude.Maybe type Apply (MapMaybeSym0 :: TyFun (a6989586621680040184 ~> Maybe b6989586621680040185) ([a6989586621680040184] ~> [b6989586621680040185]) -> Type) (a6989586621680040776 :: a6989586621680040184 ~> Maybe b6989586621680040185) = MapMaybeSym1 a6989586621680040776
type Apply (Fmap_6989586621680039458Sym0 :: TyFun (a6989586621679943771 ~> b6989586621679943772) (Maybe a6989586621679943771 ~> Maybe b6989586621679943772) -> Type) (a6989586621680039456 :: a6989586621679943771 ~> b6989586621679943772)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (Fmap_6989586621680039458Sym0 :: TyFun (a6989586621679943771 ~> b6989586621679943772) (Maybe a6989586621679943771 ~> Maybe b6989586621679943772) -> Type) (a6989586621680039456 :: a6989586621679943771 ~> b6989586621679943772) = Fmap_6989586621680039458Sym1 a6989586621680039456
type Apply (UnfoldrSym0 :: TyFun (b6989586621680316639 ~> Maybe (a6989586621680316640, b6989586621680316639)) (b6989586621680316639 ~> [a6989586621680316640]) -> Type) (a6989586621680326573 :: b6989586621680316639 ~> Maybe (a6989586621680316640, b6989586621680316639))
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (UnfoldrSym0 :: TyFun (b6989586621680316639 ~> Maybe (a6989586621680316640, b6989586621680316639)) (b6989586621680316639 ~> [a6989586621680316640]) -> Type) (a6989586621680326573 :: b6989586621680316639 ~> Maybe (a6989586621680316640, b6989586621680316639)) = UnfoldrSym1 a6989586621680326573
type Apply (FindSym0 :: TyFun (a6989586621680725630 ~> Bool) (t6989586621680725629 a6989586621680725630 ~> Maybe a6989586621680725630) -> Type) (a6989586621680726087 :: a6989586621680725630 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (FindSym0 :: TyFun (a6989586621680725630 ~> Bool) (t6989586621680725629 a6989586621680725630 ~> Maybe a6989586621680725630) -> Type) (a6989586621680726087 :: a6989586621680725630 ~> Bool) = (FindSym1 a6989586621680726087 t6989586621680725629 :: TyFun (t6989586621680725629 a6989586621680725630) (Maybe a6989586621680725630) -> Type)
type Apply (Let6989586621680040793RsSym0 :: TyFun (a6989586621680040184 ~> Maybe k1) (TyFun k (TyFun [a6989586621680040184] [k1] -> Type) -> Type) -> Type) (f6989586621680040786 :: a6989586621680040184 ~> Maybe k1)
Instance details Defined in Data.Singletons.Prelude.Maybe type Apply (Let6989586621680040793RsSym0 :: TyFun (a6989586621680040184 ~> Maybe k1) (TyFun k (TyFun [a6989586621680040184] [k1] -> Type) -> Type) -> Type) (f6989586621680040786 :: a6989586621680040184 ~> Maybe k1) = (Let6989586621680040793RsSym1 f6989586621680040786 :: TyFun k (TyFun [a6989586621680040184] [k1] -> Type) -> Type)
type Apply (Let6989586621680726539MfSym0 :: TyFun (k3 ~> (k2 ~> k3)) (TyFun k (TyFun k3 (TyFun (Maybe k2) (Maybe k3) -> Type) -> Type) -> Type) -> Type) (f6989586621680726537 :: k3 ~> (k2 ~> k3))
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680726539MfSym0 :: TyFun (k3 ~> (k2 ~> k3)) (TyFun k (TyFun k3 (TyFun (Maybe k2) (Maybe k3) -> Type) -> Type) -> Type) -> Type) (f6989586621680726537 :: k3 ~> (k2 ~> k3)) = (Let6989586621680726539MfSym1 f6989586621680726537 :: TyFun k (TyFun k3 (TyFun (Maybe k2) (Maybe k3) -> Type) -> Type) -> Type)
type Apply (Let6989586621680726564MfSym0 :: TyFun (k2 ~> (k3 ~> k3)) (TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type) -> Type) (f6989586621680726562 :: k2 ~> (k3 ~> k3))
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680726564MfSym0 :: TyFun (k2 ~> (k3 ~> k3)) (TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type) -> Type) (f6989586621680726562 :: k2 ~> (k3 ~> k3)) = (Let6989586621680726564MfSym1 f6989586621680726562 :: TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type)
type Apply (Traverse_6989586621680970945Sym0 :: TyFun (a6989586621680959944 ~> f6989586621680959943 b6989586621680959945) (Maybe a6989586621680959944 ~> f6989586621680959943 (Maybe b6989586621680959945)) -> Type) (a6989586621680970943 :: a6989586621680959944 ~> f6989586621680959943 b6989586621680959945)
Instance details Defined in Data.Singletons.Prelude.Traversable type Apply (Traverse_6989586621680970945Sym0 :: TyFun (a6989586621680959944 ~> f6989586621680959943 b6989586621680959945) (Maybe a6989586621680959944 ~> f6989586621680959943 (Maybe b6989586621680959945)) -> Type) (a6989586621680970943 :: a6989586621680959944 ~> f6989586621680959943 b6989586621680959945) = Traverse_6989586621680970945Sym1 a6989586621680970943
type Apply (Maybe_Sym1 a6989586621680037415 a6989586621680037188 :: TyFun (a6989586621680037188 ~> b6989586621680037187) (Maybe a6989586621680037188 ~> b6989586621680037187) -> Type) (a6989586621680037416 :: a6989586621680037188 ~> b6989586621680037187)
Instance details Defined in Data.Singletons.Prelude.Maybe type Apply (Maybe_Sym1 a6989586621680037415 a6989586621680037188 :: TyFun (a6989586621680037188 ~> b6989586621680037187) (Maybe a6989586621680037188 ~> b6989586621680037187) -> Type) (a6989586621680037416 :: a6989586621680037188 ~> b6989586621680037187) = Maybe_Sym2 a6989586621680037415 a6989586621680037416
type Apply (LiftA2_6989586621680039635Sym0 :: TyFun (a6989586621679943781 ~> (b6989586621679943782 ~> c6989586621679943783)) (Maybe a6989586621679943781 ~> (Maybe b6989586621679943782 ~> Maybe c6989586621679943783)) -> Type) (a6989586621680039632 :: a6989586621679943781 ~> (b6989586621679943782 ~> c6989586621679943783))
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (LiftA2_6989586621680039635Sym0 :: TyFun (a6989586621679943781 ~> (b6989586621679943782 ~> c6989586621679943783)) (Maybe a6989586621679943781 ~> (Maybe b6989586621679943782 ~> Maybe c6989586621679943783)) -> Type) (a6989586621680039632 :: a6989586621679943781 ~> (b6989586621679943782 ~> c6989586621679943783)) = LiftA2_6989586621680039635Sym1 a6989586621680039632
type Apply (Lambda_6989586621680674754Sym1 a6989586621680674752 :: TyFun (k1 ~> First a) (TyFun k1 (Maybe a) -> Type) -> Type) (k6989586621680674753 :: k1 ~> First a)
Instance details Defined in Data.Singletons.Prelude.Monoid type Apply (Lambda_6989586621680674754Sym1 a6989586621680674752 :: TyFun (k1 ~> First a) (TyFun k1 (Maybe a) -> Type) -> Type) (k6989586621680674753 :: k1 ~> First a) = Lambda_6989586621680674754Sym2 a6989586621680674752 k6989586621680674753
type Apply (Lambda_6989586621680674842Sym1 a6989586621680674840 :: TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type) (k6989586621680674841 :: k1 ~> Last a)
Instance details Defined in Data.Singletons.Prelude.Monoid type Apply (Lambda_6989586621680674842Sym1 a6989586621680674840 :: TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type) (k6989586621680674841 :: k1 ~> Last a) = Lambda_6989586621680674842Sym2 a6989586621680674840 k6989586621680674841

data Ordering #

Constructors

LT
EQ
GT

Instances

Bounded Ordering	Since: base-2.1
Instance details Defined in GHC.Enum Methods minBound :: Ordering # maxBound :: Ordering #
Enum Ordering	Since: base-2.1
Instance details Defined in GHC.Enum Methods succ :: Ordering -> Ordering # pred :: Ordering -> Ordering # toEnum :: Int -> Ordering # fromEnum :: Ordering -> Int # enumFrom :: Ordering -> [Ordering] # enumFromThen :: Ordering -> Ordering -> [Ordering] # enumFromTo :: Ordering -> Ordering -> [Ordering] # enumFromThenTo :: Ordering -> Ordering -> Ordering -> [Ordering] #
Eq Ordering
Instance details Defined in GHC.Classes Methods (==) :: Ordering -> Ordering -> Bool # (/=) :: Ordering -> Ordering -> Bool #
Ord Ordering
Instance details Defined in GHC.Classes Methods compare :: Ordering -> Ordering -> Ordering # (<) :: Ordering -> Ordering -> Bool # (<=) :: Ordering -> Ordering -> Bool # (>) :: Ordering -> Ordering -> Bool # (>=) :: Ordering -> Ordering -> Bool # max :: Ordering -> Ordering -> Ordering # min :: Ordering -> Ordering -> Ordering #
Read Ordering	Since: base-2.1
Instance details Defined in GHC.Read Methods readsPrec :: Int -> ReadS Ordering # readList :: ReadS [Ordering] # readPrec :: ReadPrec Ordering # readListPrec :: ReadPrec [Ordering] #
Show Ordering	Since: base-2.1
Instance details Defined in GHC.Show Methods showsPrec :: Int -> Ordering -> ShowS # show :: Ordering -> String # showList :: [Ordering] -> ShowS #
Ix Ordering	Since: base-2.1
Instance details Defined in GHC.Arr Methods range :: (Ordering, Ordering) -> [Ordering] # index :: (Ordering, Ordering) -> Ordering -> Int # unsafeIndex :: (Ordering, Ordering) -> Ordering -> Int inRange :: (Ordering, Ordering) -> Ordering -> Bool # rangeSize :: (Ordering, Ordering) -> Int # unsafeRangeSize :: (Ordering, Ordering) -> Int
Generic Ordering
Instance details Defined in GHC.Generics Associated Types type Rep Ordering :: Type -> Type # Methods from :: Ordering -> Rep Ordering x # to :: Rep Ordering x -> Ordering #
Semigroup Ordering	Since: base-4.9.0.0
Instance details Defined in GHC.Base Methods (<>) :: Ordering -> Ordering -> Ordering # sconcat :: NonEmpty Ordering -> Ordering # stimes :: Integral b => b -> Ordering -> Ordering #
Monoid Ordering	Since: base-2.1
Instance details Defined in GHC.Base Methods mempty :: Ordering # mappend :: Ordering -> Ordering -> Ordering # mconcat :: [Ordering] -> Ordering #
NFData Ordering
Instance details Defined in Control.DeepSeq Methods rnf :: Ordering -> () #
Hashable Ordering
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Ordering -> Int # hash :: Ordering -> Int #
Default Ordering
Instance details Defined in Data.Default.Class Methods def :: Ordering #
PMonoid Ordering
Instance details Defined in Data.Singletons.Prelude.Monoid Associated Types type Mempty :: a # type Mappend arg arg1 :: a # type Mconcat arg :: a #
SMonoid Ordering
Instance details Defined in Data.Singletons.Prelude.Monoid Methods sMempty :: Sing MemptySym0 # sMappend :: Sing t1 -> Sing t2 -> Sing (Apply (Apply MappendSym0 t1) t2) # sMconcat :: Sing t -> Sing (Apply MconcatSym0 t) #
PShow Ordering
Instance details Defined in Data.Singletons.Prelude.Show Associated Types type ShowsPrec arg arg1 arg2 :: Symbol # type Show_ arg :: Symbol # type ShowList arg arg1 :: Symbol #
SShow Ordering
Instance details Defined in Data.Singletons.Prelude.Show Methods sShowsPrec :: Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply ShowsPrecSym0 t1) t2) t3) # sShow_ :: Sing t -> Sing (Apply Show_Sym0 t) # sShowList :: Sing t1 -> Sing t2 -> Sing (Apply (Apply ShowListSym0 t1) t2) #
PSemigroup Ordering
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Associated Types type arg <> arg1 :: a # type Sconcat arg :: a #
SSemigroup Ordering
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods (%<>) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (<>@#@$) t1) t2) # sSconcat :: Sing t -> Sing (Apply SconcatSym0 t) #
PEnum Ordering
Instance details Defined in Data.Singletons.Prelude.Enum Associated Types type Succ arg :: a # type Pred arg :: a # type ToEnum arg :: a # type FromEnum arg :: Nat # type EnumFromTo arg arg1 :: [a] # type EnumFromThenTo arg arg1 arg2 :: [a] #
SEnum Ordering
Instance details 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
Instance details Defined in Data.Singletons.Prelude.Enum Associated Types type MinBound :: a # type MaxBound :: a #
SBounded Ordering
Instance details Defined in Data.Singletons.Prelude.Enum Methods sMinBound :: Sing MinBoundSym0 # sMaxBound :: Sing MaxBoundSym0 #
POrd Ordering
Instance details Defined in Data.Singletons.Prelude.Ord Associated Types type Compare arg arg1 :: Ordering # type arg < arg1 :: Bool # type arg <= arg1 :: Bool # type arg > arg1 :: Bool # type arg >= arg1 :: Bool # type Max arg arg1 :: a # type Min arg arg1 :: a #
SOrd Ordering
Instance details 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
Instance details Defined in Data.Singletons.Prelude.Eq Methods (%==) :: Sing a -> Sing b -> Sing (a == b) # (%/=) :: Sing a -> Sing b -> Sing (a /= b) #
PEq Ordering
Instance details Defined in Data.Singletons.Prelude.Eq Associated Types type x == y :: Bool # type x /= y :: Bool #
SuppressUnusedWarnings Compare_6989586621679858858Sym0
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings FromEnum_6989586621680096168Sym0
Instance details Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ThenCmpSym0
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings Compare_6989586621679858877Sym0
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ToEnum_6989586621680096159Sym0
Instance details Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ShowsPrec_6989586621680611474Sym0
Instance details Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings Compare_6989586621679858972Sym0
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings Compare_6989586621679474935Sym0 Source #
Instance details Defined in Termonad.Config.Vec Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings Compare_6989586621680214516Sym0
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings Compare_6989586621680214498Sym0
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings Compare_6989586621679858453Sym0
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SingI ThenCmpSym0
Instance details Defined in Data.Singletons.Prelude.Ord Methods sing :: Sing ThenCmpSym0 #
SuppressUnusedWarnings (Compare_6989586621679858858Sym1 a6989586621679858856 :: TyFun Bool Ordering -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Compare_6989586621679858357Sym0 :: TyFun [a3530822107858468865] ([a3530822107858468865] ~> Ordering) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Compare_6989586621679858323Sym0 :: TyFun (Maybe a3530822107858468865) (Maybe a3530822107858468865 ~> Ordering) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ThenCmpSym1 a6989586621679857897 :: TyFun Ordering Ordering -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Compare_6989586621679858877Sym1 a6989586621679858875 :: TyFun Ordering Ordering -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ShowsPrec_6989586621680611474Sym1 a6989586621680611471 :: TyFun Ordering (Symbol ~> Symbol) -> Type)
Instance details Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Compare_6989586621679858972Sym1 a6989586621679858970 :: TyFun () Ordering -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Compare_6989586621679474935Sym1 a6989586621679474933 :: TyFun Peano Ordering -> Type) Source #
Instance details Defined in Termonad.Config.Vec Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679832849Scrutinee_6989586621679832224Sym0 :: TyFun k1 (TyFun k1 Ordering -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679832829Scrutinee_6989586621679832222Sym0 :: TyFun k1 (TyFun k1 Ordering -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679832807Scrutinee_6989586621679832219Sym0 :: TyFun k1 (TyFun k1 Ordering -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679832788Scrutinee_6989586621679832209Sym0 :: TyFun k1 (TyFun k1 Ordering -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Compare_6989586621679832775Sym0 :: TyFun a6989586621679832158 (a6989586621679832158 ~> Ordering) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (CompareSym0 :: TyFun a6989586621679832158 (a6989586621679832158 ~> Ordering) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Compare_6989586621680214937Sym0 :: TyFun (Last a6989586621679056534) (Last a6989586621679056534 ~> Ordering) -> Type)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Compare_6989586621680214516Sym1 a6989586621680214514 :: TyFun Any Ordering -> Type)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Compare_6989586621680214498Sym1 a6989586621680214496 :: TyFun All Ordering -> Type)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Compare_6989586621679858453Sym1 a6989586621679858451 :: TyFun Void Ordering -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Compare_6989586621680214869Sym0 :: TyFun (Min a6989586621679056499) (Min a6989586621679056499 ~> Ordering) -> Type)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Compare_6989586621680214892Sym0 :: TyFun (Max a6989586621679056507) (Max a6989586621679056507 ~> Ordering) -> Type)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Compare_6989586621680214914Sym0 :: TyFun (First a6989586621679056525) (First a6989586621679056525 ~> Ordering) -> Type)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Compare_6989586621680214958Sym0 :: TyFun (WrappedMonoid m6989586621679056540) (WrappedMonoid m6989586621679056540 ~> Ordering) -> Type)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Compare_6989586621680214456Sym0 :: TyFun (Option a6989586621679056546) (Option a6989586621679056546 ~> Ordering) -> Type)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Compare_6989586621679858845Sym0 :: TyFun (Identity a6989586621679070357) (Identity a6989586621679070357 ~> Ordering) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Compare_6989586621680670296Sym0 :: TyFun (First a6989586621679070391) (First a6989586621679070391 ~> Ordering) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Compare_6989586621680670317Sym0 :: TyFun (Last a6989586621679070381) (Last a6989586621679070381 ~> Ordering) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Compare_6989586621680214477Sym0 :: TyFun (Dual a6989586621679078468) (Dual a6989586621679078468 ~> Ordering) -> Type)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Compare_6989586621680214539Sym0 :: TyFun (Sum a6989586621679078445) (Sum a6989586621679078445 ~> Ordering) -> Type)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Compare_6989586621680214626Sym0 :: TyFun (Product a6989586621679078453) (Product a6989586621679078453 ~> Ordering) -> Type)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Compare_6989586621679856604Sym0 :: TyFun (Down a6989586621679854521) (Down a6989586621679854521 ~> Ordering) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Compare_6989586621679858433Sym0 :: TyFun (NonEmpty a6989586621679070426) (NonEmpty a6989586621679070426 ~> Ordering) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ListsortBySym0 :: TyFun (a6989586621680578910 ~> (a6989586621680578910 ~> Ordering)) ([a6989586621680578910] ~> [a6989586621680578910]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (SortBySym0 :: TyFun (a6989586621680316588 ~> (a6989586621680316588 ~> Ordering)) ([a6989586621680316588] ~> [a6989586621680316588]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (MinimumBySym0 :: TyFun (a6989586621680316585 ~> (a6989586621680316585 ~> Ordering)) ([a6989586621680316585] ~> a6989586621680316585) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (MaximumBySym0 :: TyFun (a6989586621680316586 ~> (a6989586621680316586 ~> Ordering)) ([a6989586621680316586] ~> a6989586621680316586) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (InsertBySym0 :: TyFun (a6989586621680316587 ~> (a6989586621680316587 ~> Ordering)) (a6989586621680316587 ~> ([a6989586621680316587] ~> [a6989586621680316587])) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SingI d => SingI (ThenCmpSym1 d :: TyFun Ordering Ordering -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods sing :: Sing (ThenCmpSym1 d) #
SOrd a => SingI (CompareSym0 :: TyFun a (a ~> Ordering) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods sing :: Sing CompareSym0 #
SingI (ListsortBySym0 :: TyFun (a ~> (a ~> Ordering)) ([a] ~> [a]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods sing :: Sing ListsortBySym0 #
SingI (SortBySym0 :: TyFun (a ~> (a ~> Ordering)) ([a] ~> [a]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing SortBySym0 #
SingI (MinimumBySym0 :: TyFun (a ~> (a ~> Ordering)) ([a] ~> a) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing MinimumBySym0 #
SingI (MaximumBySym0 :: TyFun (a ~> (a ~> Ordering)) ([a] ~> a) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing MaximumBySym0 #
SingI (InsertBySym0 :: TyFun (a ~> (a ~> Ordering)) (a ~> ([a] ~> [a])) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing InsertBySym0 #
SuppressUnusedWarnings (Compare_6989586621679858357Sym1 a6989586621679858355 :: TyFun [a3530822107858468865] Ordering -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Compare_6989586621679858323Sym1 a6989586621679858321 :: TyFun (Maybe a3530822107858468865) Ordering -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Compare_6989586621679858404Sym0 :: TyFun (Either a6989586621679069776 b6989586621679069777) (Either a6989586621679069776 b6989586621679069777 ~> Ordering) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Compare_6989586621679858481Sym0 :: TyFun (a3530822107858468865, b3530822107858468866) ((a3530822107858468865, b3530822107858468866) ~> Ordering) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679832849Scrutinee_6989586621679832224Sym1 x6989586621679832847 :: TyFun k1 Ordering -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679832829Scrutinee_6989586621679832222Sym1 x6989586621679832827 :: TyFun k1 Ordering -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679832807Scrutinee_6989586621679832219Sym1 x6989586621679832805 :: TyFun k1 Ordering -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679832788Scrutinee_6989586621679832209Sym1 x6989586621679832786 :: TyFun k1 Ordering -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Compare_6989586621679832775Sym1 a6989586621679832773 :: TyFun a6989586621679832158 Ordering -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (CompareSym1 arg6989586621679832715 :: TyFun a6989586621679832158 Ordering -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Compare_6989586621680214937Sym1 a6989586621680214935 :: TyFun (Last a6989586621679056534) Ordering -> Type)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Compare_6989586621680214869Sym1 a6989586621680214867 :: TyFun (Min a6989586621679056499) Ordering -> Type)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Compare_6989586621680214892Sym1 a6989586621680214890 :: TyFun (Max a6989586621679056507) Ordering -> Type)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Compare_6989586621681114008Sym0 :: TyFun (Arg a6989586621681106452 b6989586621681106453) (Arg a6989586621681106452 b6989586621681106453 ~> Ordering) -> Type)
Instance details Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Compare_6989586621680214914Sym1 a6989586621680214912 :: TyFun (First a6989586621679056525) Ordering -> Type)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Compare_6989586621680214958Sym1 a6989586621680214956 :: TyFun (WrappedMonoid m6989586621679056540) Ordering -> Type)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Compare_6989586621680214456Sym1 a6989586621680214454 :: TyFun (Option a6989586621679056546) Ordering -> Type)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Compare_6989586621679858845Sym1 a6989586621679858843 :: TyFun (Identity a6989586621679070357) Ordering -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Compare_6989586621680670296Sym1 a6989586621680670294 :: TyFun (First a6989586621679070391) Ordering -> Type)
Instance details Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Compare_6989586621680670317Sym1 a6989586621680670315 :: TyFun (Last a6989586621679070381) Ordering -> Type)
Instance details Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Compare_6989586621680214477Sym1 a6989586621680214475 :: TyFun (Dual a6989586621679078468) Ordering -> Type)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Compare_6989586621680214539Sym1 a6989586621680214537 :: TyFun (Sum a6989586621679078445) Ordering -> Type)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Compare_6989586621680214626Sym1 a6989586621680214624 :: TyFun (Product a6989586621679078453) Ordering -> Type)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Compare_6989586621679856604Sym1 a6989586621679856602 :: TyFun (Down a6989586621679854521) Ordering -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Compare_6989586621679858433Sym1 a6989586621679858431 :: TyFun (NonEmpty a6989586621679070426) Ordering -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (MinimumBySym0 :: TyFun (a6989586621680725634 ~> (a6989586621680725634 ~> Ordering)) (t6989586621680725633 a6989586621680725634 ~> a6989586621680725634) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (MaximumBySym0 :: TyFun (a6989586621680725636 ~> (a6989586621680725636 ~> Ordering)) (t6989586621680725635 a6989586621680725636 ~> a6989586621680725636) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680726155Max'Sym0 :: TyFun (k2 ~> (k2 ~> Ordering)) (TyFun k1 (TyFun k2 (TyFun k2 k2 -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680726130Min'Sym0 :: TyFun (k2 ~> (k2 ~> Ordering)) (TyFun k1 (TyFun k2 (TyFun k2 k2 -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ComparingSym0 :: TyFun (b6989586621679832148 ~> a6989586621679832147) (b6989586621679832148 ~> (b6989586621679832148 ~> Ordering)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
(SOrd a, SingI d) => SingI (CompareSym1 d :: TyFun a Ordering -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods sing :: Sing (CompareSym1 d) #
SFoldable t => SingI (MinimumBySym0 :: TyFun (a ~> (a ~> Ordering)) (t a ~> a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods sing :: Sing MinimumBySym0 #
SFoldable t => SingI (MaximumBySym0 :: TyFun (a ~> (a ~> Ordering)) (t a ~> a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods sing :: Sing MaximumBySym0 #
SOrd a => SingI (ComparingSym0 :: TyFun (b ~> a) (b ~> (b ~> Ordering)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods sing :: Sing ComparingSym0 #
SuppressUnusedWarnings (Compare_6989586621679858404Sym1 a6989586621679858402 :: TyFun (Either a6989586621679069776 b6989586621679069777) Ordering -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Compare_6989586621679858481Sym1 a6989586621679858479 :: TyFun (a3530822107858468865, b3530822107858468866) Ordering -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Compare_6989586621679858527Sym0 :: TyFun (a3530822107858468865, b3530822107858468866, c3530822107858468867) ((a3530822107858468865, b3530822107858468866, c3530822107858468867) ~> Ordering) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ComparingSym1 a6989586621679832703 :: TyFun b6989586621679832148 (b6989586621679832148 ~> Ordering) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Compare_6989586621681114008Sym1 a6989586621681114004 :: TyFun (Arg a6989586621681106452 b6989586621681106453) Ordering -> Type)
Instance details Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Compare_6989586621680897429Sym0 :: TyFun (Const a6989586621680896150 b6989586621680896151) (Const a6989586621680896150 b6989586621680896151 ~> Ordering) -> Type)
Instance details Defined in Data.Singletons.Prelude.Const Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680326926MinBySym0 :: TyFun (k3 ~> (k3 ~> Ordering)) (TyFun k1 (TyFun k2 (TyFun k3 (TyFun k3 k3 -> Type) -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680326896MaxBySym0 :: TyFun (k3 ~> (k3 ~> Ordering)) (TyFun k1 (TyFun k2 (TyFun k3 (TyFun k3 k3 -> Type) -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
(SOrd a, SingI d) => SingI (ComparingSym1 d :: TyFun b (b ~> Ordering) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods sing :: Sing (ComparingSym1 d) #
SuppressUnusedWarnings (Compare_6989586621679858527Sym1 a6989586621679858525 :: TyFun (a3530822107858468865, b3530822107858468866, c3530822107858468867) Ordering -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Compare_6989586621679858581Sym0 :: TyFun (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868) ((a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868) ~> Ordering) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ComparingSym2 a6989586621679832704 a6989586621679832703 :: TyFun b6989586621679832148 Ordering -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Compare_6989586621680897429Sym1 a6989586621680897427 :: TyFun (Const a6989586621680896150 b6989586621680896151) Ordering -> Type)
Instance details Defined in Data.Singletons.Prelude.Const Methods suppressUnusedWarnings :: () #
(SOrd a, SingI d1, SingI d2) => SingI (ComparingSym2 d1 d2 :: TyFun b Ordering -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods sing :: Sing (ComparingSym2 d1 d2) #
SuppressUnusedWarnings (Compare_6989586621679858581Sym1 a6989586621679858579 :: TyFun (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868) Ordering -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Compare_6989586621679858646Sym0 :: TyFun (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869) ((a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869) ~> Ordering) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Compare_6989586621679858646Sym1 a6989586621679858644 :: TyFun (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869) Ordering -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Compare_6989586621679858724Sym0 :: TyFun (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869, f3530822107858468870) ((a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869, f3530822107858468870) ~> Ordering) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Compare_6989586621679858724Sym1 a6989586621679858722 :: TyFun (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869, f3530822107858468870) Ordering -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Compare_6989586621679858810Sym0 :: TyFun (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869, f3530822107858468870, g3530822107858468871) ((a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869, f3530822107858468870, g3530822107858468871) ~> Ordering) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Compare_6989586621679858810Sym1 a6989586621679858808 :: TyFun (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869, f3530822107858468870, g3530822107858468871) Ordering -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
type Rep Ordering	Since: base-4.6.0.0
Instance details Defined in GHC.Generics type Rep Ordering = D1 (MetaData "Ordering" "GHC.Types" "ghc-prim" False) (C1 (MetaCons "LT" PrefixI False) (U1 :: Type -> Type) :+: (C1 (MetaCons "EQ" PrefixI False) (U1 :: Type -> Type) :+: C1 (MetaCons "GT" PrefixI False) (U1 :: Type -> Type)))
type Mempty
Instance details Defined in Data.Singletons.Prelude.Monoid type Mempty = (Mempty_6989586621680665200Sym0 :: Ordering)
type MaxBound
Instance details Defined in Data.Singletons.Prelude.Enum type MaxBound = MaxBound_6989586621680038911Sym0
type MinBound
Instance details Defined in Data.Singletons.Prelude.Enum type MinBound = MinBound_6989586621680038896Sym0
data Sing (a :: Ordering)
Instance details Defined in Data.Singletons.Prelude.Instances data Sing (a :: Ordering) where SLT :: forall (a :: Ordering). Sing LT SEQ :: forall (a :: Ordering). Sing EQ SGT :: forall (a :: Ordering). Sing GT
type Demote Ordering
Instance details Defined in Data.Singletons.Prelude.Instances type Demote Ordering = Ordering
type Mconcat (arg :: [Ordering])
Instance details Defined in Data.Singletons.Prelude.Monoid type Mconcat (arg :: [Ordering]) = Apply (Mconcat_6989586621680665123Sym0 :: TyFun [Ordering] Ordering -> Type) arg
type Show_ (arg :: Ordering)
Instance details Defined in Data.Singletons.Prelude.Show type Show_ (arg :: Ordering) = Apply (Show__6989586621680581388Sym0 :: TyFun Ordering Symbol -> Type) arg
type Sconcat (arg :: NonEmpty Ordering)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type Sconcat (arg :: NonEmpty Ordering) = Apply (Sconcat_6989586621680188294Sym0 :: TyFun (NonEmpty Ordering) Ordering -> Type) arg
type FromEnum (a :: Ordering)
Instance details Defined in Data.Singletons.Prelude.Enum type FromEnum (a :: Ordering) = Apply FromEnum_6989586621680096168Sym0 a
type ToEnum a
Instance details Defined in Data.Singletons.Prelude.Enum type ToEnum a = Apply ToEnum_6989586621680096159Sym0 a
type Pred (arg :: Ordering)
Instance details Defined in Data.Singletons.Prelude.Enum type Pred (arg :: Ordering) = Apply (Pred_6989586621680050178Sym0 :: TyFun Ordering Ordering -> Type) arg
type Succ (arg :: Ordering)
Instance details Defined in Data.Singletons.Prelude.Enum type Succ (arg :: Ordering) = Apply (Succ_6989586621680050160Sym0 :: TyFun Ordering Ordering -> Type) arg
type Mappend (arg1 :: Ordering) (arg2 :: Ordering)
Instance details Defined in Data.Singletons.Prelude.Monoid type Mappend (arg1 :: Ordering) (arg2 :: Ordering) = Apply (Apply (Mappend_6989586621680665113Sym0 :: TyFun Ordering (Ordering ~> Ordering) -> Type) arg1) arg2
type ShowList (arg1 :: [Ordering]) arg2
Instance details Defined in Data.Singletons.Prelude.Show type ShowList (arg1 :: [Ordering]) arg2 = Apply (Apply (ShowList_6989586621680581399Sym0 :: TyFun [Ordering] (Symbol ~> Symbol) -> Type) arg1) arg2
type (a1 :: Ordering) <> (a2 :: Ordering)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type (a1 :: Ordering) <> (a2 :: Ordering) = Apply (Apply (TFHelper_6989586621680189210Sym0 :: TyFun Ordering (Ordering ~> Ordering) -> Type) a1) a2
type EnumFromTo (arg1 :: Ordering) (arg2 :: Ordering)
Instance details Defined in Data.Singletons.Prelude.Enum type EnumFromTo (arg1 :: Ordering) (arg2 :: Ordering) = Apply (Apply (EnumFromTo_6989586621680050202Sym0 :: TyFun Ordering (Ordering ~> [Ordering]) -> Type) arg1) arg2
type Min (arg1 :: Ordering) (arg2 :: Ordering)
Instance details Defined in Data.Singletons.Prelude.Ord type Min (arg1 :: Ordering) (arg2 :: Ordering) = Apply (Apply (Min_6989586621679832893Sym0 :: TyFun Ordering (Ordering ~> Ordering) -> Type) arg1) arg2
type Max (arg1 :: Ordering) (arg2 :: Ordering)
Instance details Defined in Data.Singletons.Prelude.Ord type Max (arg1 :: Ordering) (arg2 :: Ordering) = Apply (Apply (Max_6989586621679832875Sym0 :: TyFun Ordering (Ordering ~> Ordering) -> Type) arg1) arg2
type (arg1 :: Ordering) >= (arg2 :: Ordering)
Instance details Defined in Data.Singletons.Prelude.Ord type (arg1 :: Ordering) >= (arg2 :: Ordering) = Apply (Apply (TFHelper_6989586621679832857Sym0 :: TyFun Ordering (Ordering ~> Bool) -> Type) arg1) arg2
type (arg1 :: Ordering) > (arg2 :: Ordering)
Instance details Defined in Data.Singletons.Prelude.Ord type (arg1 :: Ordering) > (arg2 :: Ordering) = Apply (Apply (TFHelper_6989586621679832839Sym0 :: TyFun Ordering (Ordering ~> Bool) -> Type) arg1) arg2
type (arg1 :: Ordering) <= (arg2 :: Ordering)
Instance details Defined in Data.Singletons.Prelude.Ord type (arg1 :: Ordering) <= (arg2 :: Ordering) = Apply (Apply (TFHelper_6989586621679832817Sym0 :: TyFun Ordering (Ordering ~> Bool) -> Type) arg1) arg2
type (arg1 :: Ordering) < (arg2 :: Ordering)
Instance details Defined in Data.Singletons.Prelude.Ord type (arg1 :: Ordering) < (arg2 :: Ordering) = Apply (Apply (TFHelper_6989586621679832797Sym0 :: TyFun Ordering (Ordering ~> Bool) -> Type) arg1) arg2
type Compare (a1 :: Ordering) (a2 :: Ordering)
Instance details Defined in Data.Singletons.Prelude.Ord type Compare (a1 :: Ordering) (a2 :: Ordering) = Apply (Apply Compare_6989586621679858877Sym0 a1) a2
type (x :: Ordering) /= (y :: Ordering)
Instance details Defined in Data.Singletons.Prelude.Eq type (x :: Ordering) /= (y :: Ordering) = Not (x == y)
type (a :: Ordering) == (b :: Ordering)
Instance details Defined in Data.Singletons.Prelude.Eq type (a :: Ordering) == (b :: Ordering) = Equals_6989586621679804342 a b
type ShowsPrec a1 (a2 :: Ordering) a3
Instance details Defined in Data.Singletons.Prelude.Show type ShowsPrec a1 (a2 :: Ordering) a3 = Apply (Apply (Apply ShowsPrec_6989586621680611474Sym0 a1) a2) a3
type EnumFromThenTo (arg1 :: Ordering) (arg2 :: Ordering) (arg3 :: Ordering)
Instance details Defined in Data.Singletons.Prelude.Enum type EnumFromThenTo (arg1 :: Ordering) (arg2 :: Ordering) (arg3 :: Ordering) = Apply (Apply (Apply (EnumFromThenTo_6989586621680050226Sym0 :: TyFun Ordering (Ordering ~> (Ordering ~> [Ordering])) -> Type) arg1) arg2) arg3
type Apply ToEnum_6989586621680096159Sym0 (a6989586621680096157 :: Nat)
Instance details Defined in Data.Singletons.Prelude.Enum type Apply ToEnum_6989586621680096159Sym0 (a6989586621680096157 :: Nat) = ToEnum_6989586621680096159 a6989586621680096157
type Apply FromEnum_6989586621680096168Sym0 (a6989586621680096167 :: Ordering)
Instance details Defined in Data.Singletons.Prelude.Enum type Apply FromEnum_6989586621680096168Sym0 (a6989586621680096167 :: Ordering) = FromEnum_6989586621680096168 a6989586621680096167
type Apply (Compare_6989586621679858858Sym1 a6989586621679858856 :: TyFun Bool Ordering -> Type) (a6989586621679858857 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Compare_6989586621679858858Sym1 a6989586621679858856 :: TyFun Bool Ordering -> Type) (a6989586621679858857 :: Bool) = Compare_6989586621679858858 a6989586621679858856 a6989586621679858857
type Apply (ThenCmpSym1 a6989586621679857897 :: TyFun Ordering Ordering -> Type) (a6989586621679857899 :: Ordering)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (ThenCmpSym1 a6989586621679857897 :: TyFun Ordering Ordering -> Type) (a6989586621679857899 :: Ordering) = ThenCmp a6989586621679857897 a6989586621679857899
type Apply (Compare_6989586621679858877Sym1 a6989586621679858875 :: TyFun Ordering Ordering -> Type) (a6989586621679858876 :: Ordering)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Compare_6989586621679858877Sym1 a6989586621679858875 :: TyFun Ordering Ordering -> Type) (a6989586621679858876 :: Ordering) = Compare_6989586621679858877 a6989586621679858875 a6989586621679858876
type Apply (Compare_6989586621679858972Sym1 a6989586621679858970 :: TyFun () Ordering -> Type) (a6989586621679858971 :: ())
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Compare_6989586621679858972Sym1 a6989586621679858970 :: TyFun () Ordering -> Type) (a6989586621679858971 :: ()) = Compare_6989586621679858972 a6989586621679858970 a6989586621679858971
type Apply (Compare_6989586621679474935Sym1 a6989586621679474933 :: TyFun Peano Ordering -> Type) (a6989586621679474934 :: Peano) Source #
Instance details Defined in Termonad.Config.Vec type Apply (Compare_6989586621679474935Sym1 a6989586621679474933 :: TyFun Peano Ordering -> Type) (a6989586621679474934 :: Peano) = Compare_6989586621679474935 a6989586621679474933 a6989586621679474934
type Apply (Compare_6989586621680214516Sym1 a6989586621680214514 :: TyFun Any Ordering -> Type) (a6989586621680214515 :: Any)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply (Compare_6989586621680214516Sym1 a6989586621680214514 :: TyFun Any Ordering -> Type) (a6989586621680214515 :: Any) = Compare_6989586621680214516 a6989586621680214514 a6989586621680214515
type Apply (Compare_6989586621680214498Sym1 a6989586621680214496 :: TyFun All Ordering -> Type) (a6989586621680214497 :: All)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply (Compare_6989586621680214498Sym1 a6989586621680214496 :: TyFun All Ordering -> Type) (a6989586621680214497 :: All) = Compare_6989586621680214498 a6989586621680214496 a6989586621680214497
type Apply (Compare_6989586621679858453Sym1 a6989586621679858451 :: TyFun Void Ordering -> Type) (a6989586621679858452 :: Void)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Compare_6989586621679858453Sym1 a6989586621679858451 :: TyFun Void Ordering -> Type) (a6989586621679858452 :: Void) = Compare_6989586621679858453 a6989586621679858451 a6989586621679858452
type Apply (CompareSym1 arg6989586621679832715 :: TyFun a Ordering -> Type) (arg6989586621679832716 :: a)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (CompareSym1 arg6989586621679832715 :: TyFun a Ordering -> Type) (arg6989586621679832716 :: a) = Compare arg6989586621679832715 arg6989586621679832716
type Apply (Compare_6989586621679832775Sym1 a6989586621679832773 :: TyFun a Ordering -> Type) (a6989586621679832774 :: a)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Compare_6989586621679832775Sym1 a6989586621679832773 :: TyFun a Ordering -> Type) (a6989586621679832774 :: a) = Compare_6989586621679832775 a6989586621679832773 a6989586621679832774
type Apply (Let6989586621679832849Scrutinee_6989586621679832224Sym1 x6989586621679832847 :: TyFun k1 Ordering -> Type) (y6989586621679832848 :: k1)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Let6989586621679832849Scrutinee_6989586621679832224Sym1 x6989586621679832847 :: TyFun k1 Ordering -> Type) (y6989586621679832848 :: k1) = Let6989586621679832849Scrutinee_6989586621679832224 x6989586621679832847 y6989586621679832848
type Apply (Let6989586621679832829Scrutinee_6989586621679832222Sym1 x6989586621679832827 :: TyFun k1 Ordering -> Type) (y6989586621679832828 :: k1)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Let6989586621679832829Scrutinee_6989586621679832222Sym1 x6989586621679832827 :: TyFun k1 Ordering -> Type) (y6989586621679832828 :: k1) = Let6989586621679832829Scrutinee_6989586621679832222 x6989586621679832827 y6989586621679832828
type Apply (Let6989586621679832807Scrutinee_6989586621679832219Sym1 x6989586621679832805 :: TyFun k1 Ordering -> Type) (y6989586621679832806 :: k1)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Let6989586621679832807Scrutinee_6989586621679832219Sym1 x6989586621679832805 :: TyFun k1 Ordering -> Type) (y6989586621679832806 :: k1) = Let6989586621679832807Scrutinee_6989586621679832219 x6989586621679832805 y6989586621679832806
type Apply (Let6989586621679832788Scrutinee_6989586621679832209Sym1 x6989586621679832786 :: TyFun k1 Ordering -> Type) (y6989586621679832787 :: k1)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Let6989586621679832788Scrutinee_6989586621679832209Sym1 x6989586621679832786 :: TyFun k1 Ordering -> Type) (y6989586621679832787 :: k1) = Let6989586621679832788Scrutinee_6989586621679832209 x6989586621679832786 y6989586621679832787
type Apply (ComparingSym2 a6989586621679832704 a6989586621679832703 :: TyFun b Ordering -> Type) (a6989586621679832705 :: b)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (ComparingSym2 a6989586621679832704 a6989586621679832703 :: TyFun b Ordering -> Type) (a6989586621679832705 :: b) = Comparing a6989586621679832704 a6989586621679832703 a6989586621679832705
type Apply (Compare_6989586621679858357Sym1 a6989586621679858355 :: TyFun [a] Ordering -> Type) (a6989586621679858356 :: [a])
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Compare_6989586621679858357Sym1 a6989586621679858355 :: TyFun [a] Ordering -> Type) (a6989586621679858356 :: [a]) = Compare_6989586621679858357 a6989586621679858355 a6989586621679858356
type Apply (Compare_6989586621679858323Sym1 a6989586621679858321 :: TyFun (Maybe a) Ordering -> Type) (a6989586621679858322 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Compare_6989586621679858323Sym1 a6989586621679858321 :: TyFun (Maybe a) Ordering -> Type) (a6989586621679858322 :: Maybe a) = Compare_6989586621679858323 a6989586621679858321 a6989586621679858322
type Apply (Compare_6989586621680214937Sym1 a6989586621680214935 :: TyFun (Last a) Ordering -> Type) (a6989586621680214936 :: Last a)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply (Compare_6989586621680214937Sym1 a6989586621680214935 :: TyFun (Last a) Ordering -> Type) (a6989586621680214936 :: Last a) = Compare_6989586621680214937 a6989586621680214935 a6989586621680214936
type Apply (Compare_6989586621680214869Sym1 a6989586621680214867 :: TyFun (Min a) Ordering -> Type) (a6989586621680214868 :: Min a)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply (Compare_6989586621680214869Sym1 a6989586621680214867 :: TyFun (Min a) Ordering -> Type) (a6989586621680214868 :: Min a) = Compare_6989586621680214869 a6989586621680214867 a6989586621680214868
type Apply (Compare_6989586621680214892Sym1 a6989586621680214890 :: TyFun (Max a) Ordering -> Type) (a6989586621680214891 :: Max a)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply (Compare_6989586621680214892Sym1 a6989586621680214890 :: TyFun (Max a) Ordering -> Type) (a6989586621680214891 :: Max a) = Compare_6989586621680214892 a6989586621680214890 a6989586621680214891
type Apply (Compare_6989586621680214914Sym1 a6989586621680214912 :: TyFun (First a) Ordering -> Type) (a6989586621680214913 :: First a)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply (Compare_6989586621680214914Sym1 a6989586621680214912 :: TyFun (First a) Ordering -> Type) (a6989586621680214913 :: First a) = Compare_6989586621680214914 a6989586621680214912 a6989586621680214913
type Apply (Compare_6989586621680214958Sym1 a6989586621680214956 :: TyFun (WrappedMonoid m) Ordering -> Type) (a6989586621680214957 :: WrappedMonoid m)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply (Compare_6989586621680214958Sym1 a6989586621680214956 :: TyFun (WrappedMonoid m) Ordering -> Type) (a6989586621680214957 :: WrappedMonoid m) = Compare_6989586621680214958 a6989586621680214956 a6989586621680214957
type Apply (Compare_6989586621680214456Sym1 a6989586621680214454 :: TyFun (Option a) Ordering -> Type) (a6989586621680214455 :: Option a)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply (Compare_6989586621680214456Sym1 a6989586621680214454 :: TyFun (Option a) Ordering -> Type) (a6989586621680214455 :: Option a) = Compare_6989586621680214456 a6989586621680214454 a6989586621680214455
type Apply (Compare_6989586621679858845Sym1 a6989586621679858843 :: TyFun (Identity a) Ordering -> Type) (a6989586621679858844 :: Identity a)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Compare_6989586621679858845Sym1 a6989586621679858843 :: TyFun (Identity a) Ordering -> Type) (a6989586621679858844 :: Identity a) = Compare_6989586621679858845 a6989586621679858843 a6989586621679858844
type Apply (Compare_6989586621680670296Sym1 a6989586621680670294 :: TyFun (First a) Ordering -> Type) (a6989586621680670295 :: First a)
Instance details Defined in Data.Singletons.Prelude.Monoid type Apply (Compare_6989586621680670296Sym1 a6989586621680670294 :: TyFun (First a) Ordering -> Type) (a6989586621680670295 :: First a) = Compare_6989586621680670296 a6989586621680670294 a6989586621680670295
type Apply (Compare_6989586621680670317Sym1 a6989586621680670315 :: TyFun (Last a) Ordering -> Type) (a6989586621680670316 :: Last a)
Instance details Defined in Data.Singletons.Prelude.Monoid type Apply (Compare_6989586621680670317Sym1 a6989586621680670315 :: TyFun (Last a) Ordering -> Type) (a6989586621680670316 :: Last a) = Compare_6989586621680670317 a6989586621680670315 a6989586621680670316
type Apply (Compare_6989586621680214477Sym1 a6989586621680214475 :: TyFun (Dual a) Ordering -> Type) (a6989586621680214476 :: Dual a)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply (Compare_6989586621680214477Sym1 a6989586621680214475 :: TyFun (Dual a) Ordering -> Type) (a6989586621680214476 :: Dual a) = Compare_6989586621680214477 a6989586621680214475 a6989586621680214476
type Apply (Compare_6989586621680214539Sym1 a6989586621680214537 :: TyFun (Sum a) Ordering -> Type) (a6989586621680214538 :: Sum a)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply (Compare_6989586621680214539Sym1 a6989586621680214537 :: TyFun (Sum a) Ordering -> Type) (a6989586621680214538 :: Sum a) = Compare_6989586621680214539 a6989586621680214537 a6989586621680214538
type Apply (Compare_6989586621680214626Sym1 a6989586621680214624 :: TyFun (Product a) Ordering -> Type) (a6989586621680214625 :: Product a)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply (Compare_6989586621680214626Sym1 a6989586621680214624 :: TyFun (Product a) Ordering -> Type) (a6989586621680214625 :: Product a) = Compare_6989586621680214626 a6989586621680214624 a6989586621680214625
type Apply (Compare_6989586621679856604Sym1 a6989586621679856602 :: TyFun (Down a) Ordering -> Type) (a6989586621679856603 :: Down a)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Compare_6989586621679856604Sym1 a6989586621679856602 :: TyFun (Down a) Ordering -> Type) (a6989586621679856603 :: Down a) = Compare_6989586621679856604 a6989586621679856602 a6989586621679856603
type Apply (Compare_6989586621679858433Sym1 a6989586621679858431 :: TyFun (NonEmpty a) Ordering -> Type) (a6989586621679858432 :: NonEmpty a)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Compare_6989586621679858433Sym1 a6989586621679858431 :: TyFun (NonEmpty a) Ordering -> Type) (a6989586621679858432 :: NonEmpty a) = Compare_6989586621679858433 a6989586621679858431 a6989586621679858432
type Apply (Compare_6989586621679858404Sym1 a6989586621679858402 :: TyFun (Either a b) Ordering -> Type) (a6989586621679858403 :: Either a b)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Compare_6989586621679858404Sym1 a6989586621679858402 :: TyFun (Either a b) Ordering -> Type) (a6989586621679858403 :: Either a b) = Compare_6989586621679858404 a6989586621679858402 a6989586621679858403
type Apply (Compare_6989586621679858481Sym1 a6989586621679858479 :: TyFun (a, b) Ordering -> Type) (a6989586621679858480 :: (a, b))
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Compare_6989586621679858481Sym1 a6989586621679858479 :: TyFun (a, b) Ordering -> Type) (a6989586621679858480 :: (a, b)) = Compare_6989586621679858481 a6989586621679858479 a6989586621679858480
type Apply (Compare_6989586621681114008Sym1 a6989586621681114004 :: TyFun (Arg a b) Ordering -> Type) (a6989586621681114006 :: Arg a b)
Instance details Defined in Data.Singletons.Prelude.Semigroup type Apply (Compare_6989586621681114008Sym1 a6989586621681114004 :: TyFun (Arg a b) Ordering -> Type) (a6989586621681114006 :: Arg a b) = Compare_6989586621681114008 a6989586621681114004 a6989586621681114006
type Apply (Compare_6989586621679858527Sym1 a6989586621679858525 :: TyFun (a, b, c) Ordering -> Type) (a6989586621679858526 :: (a, b, c))
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Compare_6989586621679858527Sym1 a6989586621679858525 :: TyFun (a, b, c) Ordering -> Type) (a6989586621679858526 :: (a, b, c)) = Compare_6989586621679858527 a6989586621679858525 a6989586621679858526
type Apply (Compare_6989586621680897429Sym1 a6989586621680897427 :: TyFun (Const a b) Ordering -> Type) (a6989586621680897428 :: Const a b)
Instance details Defined in Data.Singletons.Prelude.Const type Apply (Compare_6989586621680897429Sym1 a6989586621680897427 :: TyFun (Const a b) Ordering -> Type) (a6989586621680897428 :: Const a b) = Compare_6989586621680897429 a6989586621680897427 a6989586621680897428
type Apply (Compare_6989586621679858581Sym1 a6989586621679858579 :: TyFun (a, b, c, d) Ordering -> Type) (a6989586621679858580 :: (a, b, c, d))
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Compare_6989586621679858581Sym1 a6989586621679858579 :: TyFun (a, b, c, d) Ordering -> Type) (a6989586621679858580 :: (a, b, c, d)) = Compare_6989586621679858581 a6989586621679858579 a6989586621679858580
type Apply (Compare_6989586621679858646Sym1 a6989586621679858644 :: TyFun (a, b, c, d, e) Ordering -> Type) (a6989586621679858645 :: (a, b, c, d, e))
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Compare_6989586621679858646Sym1 a6989586621679858644 :: TyFun (a, b, c, d, e) Ordering -> Type) (a6989586621679858645 :: (a, b, c, d, e)) = Compare_6989586621679858646 a6989586621679858644 a6989586621679858645
type Apply (Compare_6989586621679858724Sym1 a6989586621679858722 :: TyFun (a, b, c, d, e, f) Ordering -> Type) (a6989586621679858723 :: (a, b, c, d, e, f))
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Compare_6989586621679858724Sym1 a6989586621679858722 :: TyFun (a, b, c, d, e, f) Ordering -> Type) (a6989586621679858723 :: (a, b, c, d, e, f)) = Compare_6989586621679858724 a6989586621679858722 a6989586621679858723
type Apply (Compare_6989586621679858810Sym1 a6989586621679858808 :: TyFun (a, b, c, d, e, f, g) Ordering -> Type) (a6989586621679858809 :: (a, b, c, d, e, f, g))
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Compare_6989586621679858810Sym1 a6989586621679858808 :: TyFun (a, b, c, d, e, f, g) Ordering -> Type) (a6989586621679858809 :: (a, b, c, d, e, f, g)) = Compare_6989586621679858810 a6989586621679858808 a6989586621679858809
type Apply Compare_6989586621679858858Sym0 (a6989586621679858856 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply Compare_6989586621679858858Sym0 (a6989586621679858856 :: Bool) = Compare_6989586621679858858Sym1 a6989586621679858856
type Apply ThenCmpSym0 (a6989586621679857897 :: Ordering)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply ThenCmpSym0 (a6989586621679857897 :: Ordering) = ThenCmpSym1 a6989586621679857897
type Apply Compare_6989586621679858877Sym0 (a6989586621679858875 :: Ordering)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply Compare_6989586621679858877Sym0 (a6989586621679858875 :: Ordering) = Compare_6989586621679858877Sym1 a6989586621679858875
type Apply ShowsPrec_6989586621680611474Sym0 (a6989586621680611471 :: Nat)
Instance details Defined in Data.Singletons.Prelude.Show type Apply ShowsPrec_6989586621680611474Sym0 (a6989586621680611471 :: Nat) = ShowsPrec_6989586621680611474Sym1 a6989586621680611471
type Apply Compare_6989586621679858972Sym0 (a6989586621679858970 :: ())
Instance details Defined in Data.Singletons.Prelude.Ord type Apply Compare_6989586621679858972Sym0 (a6989586621679858970 :: ()) = Compare_6989586621679858972Sym1 a6989586621679858970
type Apply Compare_6989586621679474935Sym0 (a6989586621679474933 :: Peano) Source #
Instance details Defined in Termonad.Config.Vec type Apply Compare_6989586621679474935Sym0 (a6989586621679474933 :: Peano) = Compare_6989586621679474935Sym1 a6989586621679474933
type Apply Compare_6989586621680214516Sym0 (a6989586621680214514 :: Any)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply Compare_6989586621680214516Sym0 (a6989586621680214514 :: Any) = Compare_6989586621680214516Sym1 a6989586621680214514
type Apply Compare_6989586621680214498Sym0 (a6989586621680214496 :: All)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply Compare_6989586621680214498Sym0 (a6989586621680214496 :: All) = Compare_6989586621680214498Sym1 a6989586621680214496
type Apply Compare_6989586621679858453Sym0 (a6989586621679858451 :: Void)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply Compare_6989586621679858453Sym0 (a6989586621679858451 :: Void) = Compare_6989586621679858453Sym1 a6989586621679858451
type Apply (Let6989586621679832849Scrutinee_6989586621679832224Sym0 :: TyFun k1 (TyFun k1 Ordering -> Type) -> Type) (x6989586621679832847 :: k1)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Let6989586621679832849Scrutinee_6989586621679832224Sym0 :: TyFun k1 (TyFun k1 Ordering -> Type) -> Type) (x6989586621679832847 :: k1) = Let6989586621679832849Scrutinee_6989586621679832224Sym1 x6989586621679832847
type Apply (Let6989586621679832829Scrutinee_6989586621679832222Sym0 :: TyFun k1 (TyFun k1 Ordering -> Type) -> Type) (x6989586621679832827 :: k1)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Let6989586621679832829Scrutinee_6989586621679832222Sym0 :: TyFun k1 (TyFun k1 Ordering -> Type) -> Type) (x6989586621679832827 :: k1) = Let6989586621679832829Scrutinee_6989586621679832222Sym1 x6989586621679832827
type Apply (Let6989586621679832807Scrutinee_6989586621679832219Sym0 :: TyFun k1 (TyFun k1 Ordering -> Type) -> Type) (x6989586621679832805 :: k1)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Let6989586621679832807Scrutinee_6989586621679832219Sym0 :: TyFun k1 (TyFun k1 Ordering -> Type) -> Type) (x6989586621679832805 :: k1) = Let6989586621679832807Scrutinee_6989586621679832219Sym1 x6989586621679832805
type Apply (Let6989586621679832788Scrutinee_6989586621679832209Sym0 :: TyFun k1 (TyFun k1 Ordering -> Type) -> Type) (x6989586621679832786 :: k1)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Let6989586621679832788Scrutinee_6989586621679832209Sym0 :: TyFun k1 (TyFun k1 Ordering -> Type) -> Type) (x6989586621679832786 :: k1) = Let6989586621679832788Scrutinee_6989586621679832209Sym1 x6989586621679832786
type Apply (ShowsPrec_6989586621680611474Sym1 a6989586621680611471 :: TyFun Ordering (Symbol ~> Symbol) -> Type) (a6989586621680611472 :: Ordering)
Instance details Defined in Data.Singletons.Prelude.Show type Apply (ShowsPrec_6989586621680611474Sym1 a6989586621680611471 :: TyFun Ordering (Symbol ~> Symbol) -> Type) (a6989586621680611472 :: Ordering) = ShowsPrec_6989586621680611474Sym2 a6989586621680611471 a6989586621680611472
type Apply (CompareSym0 :: TyFun a6989586621679832158 (a6989586621679832158 ~> Ordering) -> Type) (arg6989586621679832715 :: a6989586621679832158)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (CompareSym0 :: TyFun a6989586621679832158 (a6989586621679832158 ~> Ordering) -> Type) (arg6989586621679832715 :: a6989586621679832158) = CompareSym1 arg6989586621679832715
type Apply (Compare_6989586621679832775Sym0 :: TyFun a6989586621679832158 (a6989586621679832158 ~> Ordering) -> Type) (a6989586621679832773 :: a6989586621679832158)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Compare_6989586621679832775Sym0 :: TyFun a6989586621679832158 (a6989586621679832158 ~> Ordering) -> Type) (a6989586621679832773 :: a6989586621679832158) = Compare_6989586621679832775Sym1 a6989586621679832773
type Apply (ComparingSym1 a6989586621679832703 :: TyFun b6989586621679832148 (b6989586621679832148 ~> Ordering) -> Type) (a6989586621679832704 :: b6989586621679832148)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (ComparingSym1 a6989586621679832703 :: TyFun b6989586621679832148 (b6989586621679832148 ~> Ordering) -> Type) (a6989586621679832704 :: b6989586621679832148) = ComparingSym2 a6989586621679832703 a6989586621679832704
type Apply (Compare_6989586621679858357Sym0 :: TyFun [a3530822107858468865] ([a3530822107858468865] ~> Ordering) -> Type) (a6989586621679858355 :: [a3530822107858468865])
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Compare_6989586621679858357Sym0 :: TyFun [a3530822107858468865] ([a3530822107858468865] ~> Ordering) -> Type) (a6989586621679858355 :: [a3530822107858468865]) = Compare_6989586621679858357Sym1 a6989586621679858355
type Apply (Compare_6989586621679858323Sym0 :: TyFun (Maybe a3530822107858468865) (Maybe a3530822107858468865 ~> Ordering) -> Type) (a6989586621679858321 :: Maybe a3530822107858468865)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Compare_6989586621679858323Sym0 :: TyFun (Maybe a3530822107858468865) (Maybe a3530822107858468865 ~> Ordering) -> Type) (a6989586621679858321 :: Maybe a3530822107858468865) = Compare_6989586621679858323Sym1 a6989586621679858321
type Apply (Compare_6989586621680214937Sym0 :: TyFun (Last a6989586621679056534) (Last a6989586621679056534 ~> Ordering) -> Type) (a6989586621680214935 :: Last a6989586621679056534)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply (Compare_6989586621680214937Sym0 :: TyFun (Last a6989586621679056534) (Last a6989586621679056534 ~> Ordering) -> Type) (a6989586621680214935 :: Last a6989586621679056534) = Compare_6989586621680214937Sym1 a6989586621680214935
type Apply (Compare_6989586621680214869Sym0 :: TyFun (Min a6989586621679056499) (Min a6989586621679056499 ~> Ordering) -> Type) (a6989586621680214867 :: Min a6989586621679056499)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply (Compare_6989586621680214869Sym0 :: TyFun (Min a6989586621679056499) (Min a6989586621679056499 ~> Ordering) -> Type) (a6989586621680214867 :: Min a6989586621679056499) = Compare_6989586621680214869Sym1 a6989586621680214867
type Apply (Compare_6989586621680214892Sym0 :: TyFun (Max a6989586621679056507) (Max a6989586621679056507 ~> Ordering) -> Type) (a6989586621680214890 :: Max a6989586621679056507)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply (Compare_6989586621680214892Sym0 :: TyFun (Max a6989586621679056507) (Max a6989586621679056507 ~> Ordering) -> Type) (a6989586621680214890 :: Max a6989586621679056507) = Compare_6989586621680214892Sym1 a6989586621680214890
type Apply (Compare_6989586621680214914Sym0 :: TyFun (First a6989586621679056525) (First a6989586621679056525 ~> Ordering) -> Type) (a6989586621680214912 :: First a6989586621679056525)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply (Compare_6989586621680214914Sym0 :: TyFun (First a6989586621679056525) (First a6989586621679056525 ~> Ordering) -> Type) (a6989586621680214912 :: First a6989586621679056525) = Compare_6989586621680214914Sym1 a6989586621680214912
type Apply (Compare_6989586621680214958Sym0 :: TyFun (WrappedMonoid m6989586621679056540) (WrappedMonoid m6989586621679056540 ~> Ordering) -> Type) (a6989586621680214956 :: WrappedMonoid m6989586621679056540)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply (Compare_6989586621680214958Sym0 :: TyFun (WrappedMonoid m6989586621679056540) (WrappedMonoid m6989586621679056540 ~> Ordering) -> Type) (a6989586621680214956 :: WrappedMonoid m6989586621679056540) = Compare_6989586621680214958Sym1 a6989586621680214956
type Apply (Compare_6989586621680214456Sym0 :: TyFun (Option a6989586621679056546) (Option a6989586621679056546 ~> Ordering) -> Type) (a6989586621680214454 :: Option a6989586621679056546)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply (Compare_6989586621680214456Sym0 :: TyFun (Option a6989586621679056546) (Option a6989586621679056546 ~> Ordering) -> Type) (a6989586621680214454 :: Option a6989586621679056546) = Compare_6989586621680214456Sym1 a6989586621680214454
type Apply (Compare_6989586621679858845Sym0 :: TyFun (Identity a6989586621679070357) (Identity a6989586621679070357 ~> Ordering) -> Type) (a6989586621679858843 :: Identity a6989586621679070357)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Compare_6989586621679858845Sym0 :: TyFun (Identity a6989586621679070357) (Identity a6989586621679070357 ~> Ordering) -> Type) (a6989586621679858843 :: Identity a6989586621679070357) = Compare_6989586621679858845Sym1 a6989586621679858843
type Apply (Compare_6989586621680670296Sym0 :: TyFun (First a6989586621679070391) (First a6989586621679070391 ~> Ordering) -> Type) (a6989586621680670294 :: First a6989586621679070391)
Instance details Defined in Data.Singletons.Prelude.Monoid type Apply (Compare_6989586621680670296Sym0 :: TyFun (First a6989586621679070391) (First a6989586621679070391 ~> Ordering) -> Type) (a6989586621680670294 :: First a6989586621679070391) = Compare_6989586621680670296Sym1 a6989586621680670294
type Apply (Compare_6989586621680670317Sym0 :: TyFun (Last a6989586621679070381) (Last a6989586621679070381 ~> Ordering) -> Type) (a6989586621680670315 :: Last a6989586621679070381)
Instance details Defined in Data.Singletons.Prelude.Monoid type Apply (Compare_6989586621680670317Sym0 :: TyFun (Last a6989586621679070381) (Last a6989586621679070381 ~> Ordering) -> Type) (a6989586621680670315 :: Last a6989586621679070381) = Compare_6989586621680670317Sym1 a6989586621680670315
type Apply (Compare_6989586621680214477Sym0 :: TyFun (Dual a6989586621679078468) (Dual a6989586621679078468 ~> Ordering) -> Type) (a6989586621680214475 :: Dual a6989586621679078468)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply (Compare_6989586621680214477Sym0 :: TyFun (Dual a6989586621679078468) (Dual a6989586621679078468 ~> Ordering) -> Type) (a6989586621680214475 :: Dual a6989586621679078468) = Compare_6989586621680214477Sym1 a6989586621680214475
type Apply (Compare_6989586621680214539Sym0 :: TyFun (Sum a6989586621679078445) (Sum a6989586621679078445 ~> Ordering) -> Type) (a6989586621680214537 :: Sum a6989586621679078445)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply (Compare_6989586621680214539Sym0 :: TyFun (Sum a6989586621679078445) (Sum a6989586621679078445 ~> Ordering) -> Type) (a6989586621680214537 :: Sum a6989586621679078445) = Compare_6989586621680214539Sym1 a6989586621680214537
type Apply (Compare_6989586621680214626Sym0 :: TyFun (Product a6989586621679078453) (Product a6989586621679078453 ~> Ordering) -> Type) (a6989586621680214624 :: Product a6989586621679078453)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply (Compare_6989586621680214626Sym0 :: TyFun (Product a6989586621679078453) (Product a6989586621679078453 ~> Ordering) -> Type) (a6989586621680214624 :: Product a6989586621679078453) = Compare_6989586621680214626Sym1 a6989586621680214624
type Apply (Compare_6989586621679856604Sym0 :: TyFun (Down a6989586621679854521) (Down a6989586621679854521 ~> Ordering) -> Type) (a6989586621679856602 :: Down a6989586621679854521)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Compare_6989586621679856604Sym0 :: TyFun (Down a6989586621679854521) (Down a6989586621679854521 ~> Ordering) -> Type) (a6989586621679856602 :: Down a6989586621679854521) = Compare_6989586621679856604Sym1 a6989586621679856602
type Apply (Compare_6989586621679858433Sym0 :: TyFun (NonEmpty a6989586621679070426) (NonEmpty a6989586621679070426 ~> Ordering) -> Type) (a6989586621679858431 :: NonEmpty a6989586621679070426)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Compare_6989586621679858433Sym0 :: TyFun (NonEmpty a6989586621679070426) (NonEmpty a6989586621679070426 ~> Ordering) -> Type) (a6989586621679858431 :: NonEmpty a6989586621679070426) = Compare_6989586621679858433Sym1 a6989586621679858431
type Apply (ListsortBySym0 :: TyFun (a6989586621680578910 ~> (a6989586621680578910 ~> Ordering)) ([a6989586621680578910] ~> [a6989586621680578910]) -> Type) (a6989586621680581958 :: a6989586621680578910 ~> (a6989586621680578910 ~> Ordering))
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation type Apply (ListsortBySym0 :: TyFun (a6989586621680578910 ~> (a6989586621680578910 ~> Ordering)) ([a6989586621680578910] ~> [a6989586621680578910]) -> Type) (a6989586621680581958 :: a6989586621680578910 ~> (a6989586621680578910 ~> Ordering)) = ListsortBySym1 a6989586621680581958
type Apply (SortBySym0 :: TyFun (a6989586621680316588 ~> (a6989586621680316588 ~> Ordering)) ([a6989586621680316588] ~> [a6989586621680316588]) -> Type) (a6989586621680326178 :: a6989586621680316588 ~> (a6989586621680316588 ~> Ordering))
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (SortBySym0 :: TyFun (a6989586621680316588 ~> (a6989586621680316588 ~> Ordering)) ([a6989586621680316588] ~> [a6989586621680316588]) -> Type) (a6989586621680326178 :: a6989586621680316588 ~> (a6989586621680316588 ~> Ordering)) = SortBySym1 a6989586621680326178
type Apply (MaximumBySym0 :: TyFun (a6989586621680316586 ~> (a6989586621680316586 ~> Ordering)) ([a6989586621680316586] ~> a6989586621680316586) -> Type) (a6989586621680326885 :: a6989586621680316586 ~> (a6989586621680316586 ~> Ordering))
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (MaximumBySym0 :: TyFun (a6989586621680316586 ~> (a6989586621680316586 ~> Ordering)) ([a6989586621680316586] ~> a6989586621680316586) -> Type) (a6989586621680326885 :: a6989586621680316586 ~> (a6989586621680316586 ~> Ordering)) = MaximumBySym1 a6989586621680326885
type Apply (MinimumBySym0 :: TyFun (a6989586621680316585 ~> (a6989586621680316585 ~> Ordering)) ([a6989586621680316585] ~> a6989586621680316585) -> Type) (a6989586621680326915 :: a6989586621680316585 ~> (a6989586621680316585 ~> Ordering))
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (MinimumBySym0 :: TyFun (a6989586621680316585 ~> (a6989586621680316585 ~> Ordering)) ([a6989586621680316585] ~> a6989586621680316585) -> Type) (a6989586621680326915 :: a6989586621680316585 ~> (a6989586621680316585 ~> Ordering)) = MinimumBySym1 a6989586621680326915
type Apply (InsertBySym0 :: TyFun (a6989586621680316587 ~> (a6989586621680316587 ~> Ordering)) (a6989586621680316587 ~> ([a6989586621680316587] ~> [a6989586621680316587])) -> Type) (a6989586621680326148 :: a6989586621680316587 ~> (a6989586621680316587 ~> Ordering))
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (InsertBySym0 :: TyFun (a6989586621680316587 ~> (a6989586621680316587 ~> Ordering)) (a6989586621680316587 ~> ([a6989586621680316587] ~> [a6989586621680316587])) -> Type) (a6989586621680326148 :: a6989586621680316587 ~> (a6989586621680316587 ~> Ordering)) = InsertBySym1 a6989586621680326148
type Apply (Let6989586621680726130Min'Sym0 :: TyFun (k1 ~> (k1 ~> Ordering)) (TyFun k2 (TyFun k1 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type) (cmp6989586621680726128 :: k1 ~> (k1 ~> Ordering))
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680726130Min'Sym0 :: TyFun (k1 ~> (k1 ~> Ordering)) (TyFun k2 (TyFun k1 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type) (cmp6989586621680726128 :: k1 ~> (k1 ~> Ordering)) = (Let6989586621680726130Min'Sym1 cmp6989586621680726128 :: TyFun k2 (TyFun k1 (TyFun k1 k1 -> Type) -> Type) -> Type)
type Apply (Let6989586621680726155Max'Sym0 :: TyFun (k1 ~> (k1 ~> Ordering)) (TyFun k2 (TyFun k1 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type) (cmp6989586621680726153 :: k1 ~> (k1 ~> Ordering))
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680726155Max'Sym0 :: TyFun (k1 ~> (k1 ~> Ordering)) (TyFun k2 (TyFun k1 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type) (cmp6989586621680726153 :: k1 ~> (k1 ~> Ordering)) = (Let6989586621680726155Max'Sym1 cmp6989586621680726153 :: TyFun k2 (TyFun k1 (TyFun k1 k1 -> Type) -> Type) -> Type)
type Apply (Compare_6989586621679858404Sym0 :: TyFun (Either a6989586621679069776 b6989586621679069777) (Either a6989586621679069776 b6989586621679069777 ~> Ordering) -> Type) (a6989586621679858402 :: Either a6989586621679069776 b6989586621679069777)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Compare_6989586621679858404Sym0 :: TyFun (Either a6989586621679069776 b6989586621679069777) (Either a6989586621679069776 b6989586621679069777 ~> Ordering) -> Type) (a6989586621679858402 :: Either a6989586621679069776 b6989586621679069777) = Compare_6989586621679858404Sym1 a6989586621679858402
type Apply (Compare_6989586621679858481Sym0 :: TyFun (a3530822107858468865, b3530822107858468866) ((a3530822107858468865, b3530822107858468866) ~> Ordering) -> Type) (a6989586621679858479 :: (a3530822107858468865, b3530822107858468866))
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Compare_6989586621679858481Sym0 :: TyFun (a3530822107858468865, b3530822107858468866) ((a3530822107858468865, b3530822107858468866) ~> Ordering) -> Type) (a6989586621679858479 :: (a3530822107858468865, b3530822107858468866)) = Compare_6989586621679858481Sym1 a6989586621679858479
type Apply (MaximumBySym0 :: TyFun (a6989586621680725636 ~> (a6989586621680725636 ~> Ordering)) (t6989586621680725635 a6989586621680725636 ~> a6989586621680725636) -> Type) (a6989586621680726147 :: a6989586621680725636 ~> (a6989586621680725636 ~> Ordering))
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (MaximumBySym0 :: TyFun (a6989586621680725636 ~> (a6989586621680725636 ~> Ordering)) (t6989586621680725635 a6989586621680725636 ~> a6989586621680725636) -> Type) (a6989586621680726147 :: a6989586621680725636 ~> (a6989586621680725636 ~> Ordering)) = (MaximumBySym1 a6989586621680726147 t6989586621680725635 :: TyFun (t6989586621680725635 a6989586621680725636) a6989586621680725636 -> Type)
type Apply (MinimumBySym0 :: TyFun (a6989586621680725634 ~> (a6989586621680725634 ~> Ordering)) (t6989586621680725633 a6989586621680725634 ~> a6989586621680725634) -> Type) (a6989586621680726122 :: a6989586621680725634 ~> (a6989586621680725634 ~> Ordering))
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (MinimumBySym0 :: TyFun (a6989586621680725634 ~> (a6989586621680725634 ~> Ordering)) (t6989586621680725633 a6989586621680725634 ~> a6989586621680725634) -> Type) (a6989586621680726122 :: a6989586621680725634 ~> (a6989586621680725634 ~> Ordering)) = (MinimumBySym1 a6989586621680726122 t6989586621680725633 :: TyFun (t6989586621680725633 a6989586621680725634) a6989586621680725634 -> Type)
type Apply (ComparingSym0 :: TyFun (b6989586621679832148 ~> a6989586621679832147) (b6989586621679832148 ~> (b6989586621679832148 ~> Ordering)) -> Type) (a6989586621679832703 :: b6989586621679832148 ~> a6989586621679832147)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (ComparingSym0 :: TyFun (b6989586621679832148 ~> a6989586621679832147) (b6989586621679832148 ~> (b6989586621679832148 ~> Ordering)) -> Type) (a6989586621679832703 :: b6989586621679832148 ~> a6989586621679832147) = ComparingSym1 a6989586621679832703
type Apply (Compare_6989586621681114008Sym0 :: TyFun (Arg a6989586621681106452 b6989586621681106453) (Arg a6989586621681106452 b6989586621681106453 ~> Ordering) -> Type) (a6989586621681114004 :: Arg a6989586621681106452 b6989586621681106453)
Instance details Defined in Data.Singletons.Prelude.Semigroup type Apply (Compare_6989586621681114008Sym0 :: TyFun (Arg a6989586621681106452 b6989586621681106453) (Arg a6989586621681106452 b6989586621681106453 ~> Ordering) -> Type) (a6989586621681114004 :: Arg a6989586621681106452 b6989586621681106453) = Compare_6989586621681114008Sym1 a6989586621681114004
type Apply (Let6989586621680326896MaxBySym0 :: TyFun (k1 ~> (k1 ~> Ordering)) (TyFun k2 (TyFun k3 (TyFun k1 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type) -> Type) (cmp6989586621680326889 :: k1 ~> (k1 ~> Ordering))
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680326896MaxBySym0 :: TyFun (k1 ~> (k1 ~> Ordering)) (TyFun k2 (TyFun k3 (TyFun k1 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type) -> Type) (cmp6989586621680326889 :: k1 ~> (k1 ~> Ordering)) = (Let6989586621680326896MaxBySym1 cmp6989586621680326889 :: TyFun k2 (TyFun k3 (TyFun k1 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type)
type Apply (Let6989586621680326926MinBySym0 :: TyFun (k1 ~> (k1 ~> Ordering)) (TyFun k2 (TyFun k3 (TyFun k1 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type) -> Type) (cmp6989586621680326919 :: k1 ~> (k1 ~> Ordering))
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680326926MinBySym0 :: TyFun (k1 ~> (k1 ~> Ordering)) (TyFun k2 (TyFun k3 (TyFun k1 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type) -> Type) (cmp6989586621680326919 :: k1 ~> (k1 ~> Ordering)) = (Let6989586621680326926MinBySym1 cmp6989586621680326919 :: TyFun k2 (TyFun k3 (TyFun k1 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type)
type Apply (Compare_6989586621679858527Sym0 :: TyFun (a3530822107858468865, b3530822107858468866, c3530822107858468867) ((a3530822107858468865, b3530822107858468866, c3530822107858468867) ~> Ordering) -> Type) (a6989586621679858525 :: (a3530822107858468865, b3530822107858468866, c3530822107858468867))
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Compare_6989586621679858527Sym0 :: TyFun (a3530822107858468865, b3530822107858468866, c3530822107858468867) ((a3530822107858468865, b3530822107858468866, c3530822107858468867) ~> Ordering) -> Type) (a6989586621679858525 :: (a3530822107858468865, b3530822107858468866, c3530822107858468867)) = Compare_6989586621679858527Sym1 a6989586621679858525
type Apply (Compare_6989586621680897429Sym0 :: TyFun (Const a6989586621680896150 b6989586621680896151) (Const a6989586621680896150 b6989586621680896151 ~> Ordering) -> Type) (a6989586621680897427 :: Const a6989586621680896150 b6989586621680896151)
Instance details Defined in Data.Singletons.Prelude.Const type Apply (Compare_6989586621680897429Sym0 :: TyFun (Const a6989586621680896150 b6989586621680896151) (Const a6989586621680896150 b6989586621680896151 ~> Ordering) -> Type) (a6989586621680897427 :: Const a6989586621680896150 b6989586621680896151) = Compare_6989586621680897429Sym1 a6989586621680897427
type Apply (Compare_6989586621679858581Sym0 :: TyFun (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868) ((a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868) ~> Ordering) -> Type) (a6989586621679858579 :: (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868))
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Compare_6989586621679858581Sym0 :: TyFun (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868) ((a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868) ~> Ordering) -> Type) (a6989586621679858579 :: (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868)) = Compare_6989586621679858581Sym1 a6989586621679858579
type Apply (Compare_6989586621679858646Sym0 :: TyFun (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869) ((a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869) ~> Ordering) -> Type) (a6989586621679858644 :: (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869))
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Compare_6989586621679858646Sym0 :: TyFun (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869) ((a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869) ~> Ordering) -> Type) (a6989586621679858644 :: (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869)) = Compare_6989586621679858646Sym1 a6989586621679858644
type Apply (Compare_6989586621679858724Sym0 :: TyFun (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869, f3530822107858468870) ((a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869, f3530822107858468870) ~> Ordering) -> Type) (a6989586621679858722 :: (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869, f3530822107858468870))
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Compare_6989586621679858724Sym0 :: TyFun (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869, f3530822107858468870) ((a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869, f3530822107858468870) ~> Ordering) -> Type) (a6989586621679858722 :: (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869, f3530822107858468870)) = Compare_6989586621679858724Sym1 a6989586621679858722
type Apply (Compare_6989586621679858810Sym0 :: TyFun (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869, f3530822107858468870, g3530822107858468871) ((a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869, f3530822107858468870, g3530822107858468871) ~> Ordering) -> Type) (a6989586621679858808 :: (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869, f3530822107858468870, g3530822107858468871))
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Compare_6989586621679858810Sym0 :: TyFun (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869, f3530822107858468870, g3530822107858468871) ((a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869, f3530822107858468870, g3530822107858468871) ~> Ordering) -> Type) (a6989586621679858808 :: (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869, f3530822107858468870, g3530822107858468871)) = Compare_6989586621679858810Sym1 a6989586621679858808

type Rational = Ratio Integer #

Arbitrary-precision rational numbers, represented as a ratio of two Integer values. A rational number may be constructed using the % operator.

data RealWorld :: Type #

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#.

data IO a #

A value of type IO a is a computation which, when performed, does some I/O before returning a value of type a.

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

Monad IO	Since: base-2.1
Instance details Defined in GHC.Base Methods (>>=) :: IO a -> (a -> IO b) -> IO b # (>>) :: IO a -> IO b -> IO b # return :: a -> IO a # fail :: String -> IO a #
Functor IO	Since: base-2.1
Instance details Defined in GHC.Base Methods fmap :: (a -> b) -> IO a -> IO b # (<$) :: a -> IO b -> IO a #
Applicative IO	Since: base-2.1
Instance details Defined in GHC.Base Methods pure :: a -> IO a # (<>) :: IO (a -> b) -> IO a -> IO b # liftA2 :: (a -> b -> c) -> IO a -> IO b -> IO c # (>) :: IO a -> IO b -> IO b # (<*) :: IO a -> IO b -> IO a #
MonadPlus IO	Since: base-4.9.0.0
Instance details Defined in GHC.Base Methods mzero :: IO a # mplus :: IO a -> IO a -> IO a #
Alternative IO	Since: base-4.9.0.0
Instance details Defined in GHC.Base Methods empty :: IO a # (<\|>) :: IO a -> IO a -> IO a # some :: IO a -> IO [a] # many :: IO a -> IO [a] #
MonadIO IO	Since: base-4.9.0.0
Instance details Defined in Control.Monad.IO.Class Methods liftIO :: IO a -> IO a #
MonadUnliftIO IO
Instance details Defined in Control.Monad.IO.Unlift Methods askUnliftIO :: IO (UnliftIO IO) # withRunInIO :: ((forall a. IO a -> IO a) -> IO b) -> IO b #
PrimMonad IO
Instance details Defined in Control.Monad.Primitive Associated Types type PrimState IO :: Type # Methods primitive :: (State# (PrimState IO) -> (#State# (PrimState IO), a#)) -> IO a #
Apply IO
Instance details Defined in Data.Functor.Bind.Class Methods (<.>) :: IO (a -> b) -> IO a -> IO b # (.>) :: IO a -> IO b -> IO b # (<.) :: IO a -> IO b -> IO a # liftF2 :: (a -> b -> c) -> IO a -> IO b -> IO c #
PrimBase IO
Instance details Defined in Control.Monad.Primitive Methods internal :: IO a -> State# (PrimState IO) -> (#State# (PrimState IO), a#) #
Bind IO
Instance details Defined in Data.Functor.Bind.Class Methods (>>-) :: IO a -> (a -> IO b) -> IO b # join :: IO (IO a) -> IO a #
Quasi IO
Instance details Defined in Language.Haskell.TH.Syntax Methods qNewName :: String -> IO Name # qReport :: Bool -> String -> IO () # qRecover :: IO a -> IO a -> IO a # qLookupName :: Bool -> String -> IO (Maybe Name) # qReify :: Name -> IO Info # qReifyFixity :: Name -> IO (Maybe Fixity) # qReifyInstances :: Name -> [Type] -> IO [Dec] # qReifyRoles :: Name -> IO [Role] # qReifyAnnotations :: Data a => AnnLookup -> IO [a] # qReifyModule :: Module -> IO ModuleInfo # qReifyConStrictness :: Name -> IO [DecidedStrictness] # qLocation :: IO Loc # qRunIO :: IO a -> IO a # qAddDependentFile :: FilePath -> IO () # qAddTempFile :: String -> IO FilePath # qAddTopDecls :: [Dec] -> IO () # qAddForeignFilePath :: ForeignSrcLang -> String -> IO () # qAddModFinalizer :: Q () -> IO () # qAddCorePlugin :: String -> IO () # qGetQ :: Typeable a => IO (Maybe a) # qPutQ :: Typeable a => a -> IO () # qIsExtEnabled :: Extension -> IO Bool # qExtsEnabled :: IO [Extension] #
DsMonad IO
Instance details Defined in Language.Haskell.TH.Desugar.Reify Methods localDeclarations :: IO [Dec] #
Semigroup a => Semigroup (IO a)	Since: base-4.10.0.0
Instance details Defined in GHC.Base Methods (<>) :: IO a -> IO a -> IO a # sconcat :: NonEmpty (IO a) -> IO a # stimes :: Integral b => b -> IO a -> IO a #
Monoid a => Monoid (IO a)	Since: base-4.9.0.0
Instance details Defined in GHC.Base Methods mempty :: IO a # mappend :: IO a -> IO a -> IO a # mconcat :: [IO a] -> IO a #
MonoPointed (IO a)
Instance details Defined in Data.MonoTraversable Methods opoint :: Element (IO a) -> IO a #
MonoFunctor (IO a)
Instance details Defined in Data.MonoTraversable Methods omap :: (Element (IO a) -> Element (IO a)) -> IO a -> IO a #
Default a => Default (IO a)
Instance details Defined in Data.Default.Class Methods def :: IO a #
type PrimState IO
Instance details Defined in Control.Monad.Primitive type PrimState IO = RealWorld
type Element (IO a)
Instance details Defined in Data.MonoTraversable type Element (IO a) = a

data Word #

A Word is an unsigned integral type, with the same size as Int.

Instances

Bounded Word	Since: base-2.1
Instance details Defined in GHC.Enum Methods minBound :: Word # maxBound :: Word #
Enum Word	Since: base-2.1
Instance details Defined in GHC.Enum Methods succ :: Word -> Word # pred :: Word -> Word # toEnum :: Int -> Word # fromEnum :: Word -> Int # enumFrom :: Word -> [Word] # enumFromThen :: Word -> Word -> [Word] # enumFromTo :: Word -> Word -> [Word] # enumFromThenTo :: Word -> Word -> Word -> [Word] #
Eq Word
Instance details Defined in GHC.Classes Methods (==) :: Word -> Word -> Bool # (/=) :: Word -> Word -> Bool #
Integral Word	Since: base-2.1
Instance details Defined in GHC.Real Methods quot :: Word -> Word -> Word # rem :: Word -> Word -> Word # div :: Word -> Word -> Word # mod :: Word -> Word -> Word # quotRem :: Word -> Word -> (Word, Word) # divMod :: Word -> Word -> (Word, Word) # toInteger :: Word -> Integer #
Num Word	Since: base-2.1
Instance details Defined in GHC.Num Methods (+) :: Word -> Word -> Word # (-) :: Word -> Word -> Word # (*) :: Word -> Word -> Word # negate :: Word -> Word # abs :: Word -> Word # signum :: Word -> Word # fromInteger :: Integer -> Word #
Ord Word
Instance details Defined in GHC.Classes Methods compare :: Word -> Word -> Ordering # (<) :: Word -> Word -> Bool # (<=) :: Word -> Word -> Bool # (>) :: Word -> Word -> Bool # (>=) :: Word -> Word -> Bool # max :: Word -> Word -> Word # min :: Word -> Word -> Word #
Read Word	Since: base-4.5.0.0
Instance details Defined in GHC.Read Methods readsPrec :: Int -> ReadS Word # readList :: ReadS [Word] # readPrec :: ReadPrec Word # readListPrec :: ReadPrec [Word] #
Real Word	Since: base-2.1
Instance details Defined in GHC.Real Methods toRational :: Word -> Rational #
Show Word	Since: base-2.1
Instance details Defined in GHC.Show Methods showsPrec :: Int -> Word -> ShowS # show :: Word -> String # showList :: [Word] -> ShowS #
Ix Word	Since: base-4.6.0.0
Instance details Defined in GHC.Arr Methods range :: (Word, Word) -> [Word] # index :: (Word, Word) -> Word -> Int # unsafeIndex :: (Word, Word) -> Word -> Int inRange :: (Word, Word) -> Word -> Bool # rangeSize :: (Word, Word) -> Int # unsafeRangeSize :: (Word, Word) -> Int
Lift Word
Instance details Defined in Language.Haskell.TH.Syntax Methods lift :: Word -> Q Exp #
NFData Word
Instance details Defined in Control.DeepSeq Methods rnf :: Word -> () #
Hashable Word
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Word -> Int # hash :: Word -> Int #
Storable Word	Since: base-2.1
Instance details Defined in Foreign.Storable Methods sizeOf :: Word -> Int # alignment :: Word -> Int # peekElemOff :: Ptr Word -> Int -> IO Word # pokeElemOff :: Ptr Word -> Int -> Word -> IO () # peekByteOff :: Ptr b -> Int -> IO Word # pokeByteOff :: Ptr b -> Int -> Word -> IO () # peek :: Ptr Word -> IO Word # poke :: Ptr Word -> Word -> IO () #
Unbox Word
Instance details Defined in Data.Vector.Unboxed.Base
Prim Word
Instance details Defined in Data.Primitive.Types Methods sizeOf# :: Word -> Int# # alignment# :: Word -> Int# # indexByteArray# :: ByteArray# -> Int# -> Word # readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (#State# s, Word#) # writeByteArray# :: MutableByteArray# s -> Int# -> Word -> State# s -> State# s # setByteArray# :: MutableByteArray# s -> Int# -> Int# -> Word -> State# s -> State# s # indexOffAddr# :: Addr# -> Int# -> Word # readOffAddr# :: Addr# -> Int# -> State# s -> (#State# s, Word#) # writeOffAddr# :: Addr# -> Int# -> Word -> State# s -> State# s # setOffAddr# :: Addr# -> Int# -> Int# -> Word -> State# s -> State# s #
Default Word
Instance details Defined in Data.Default.Class Methods def :: Word #
Vector Vector Word
Instance details Defined in Data.Vector.Unboxed.Base Methods basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) Word -> m (Vector Word) # basicUnsafeThaw :: PrimMonad m => Vector Word -> m (Mutable Vector (PrimState m) Word) # basicLength :: Vector Word -> Int # basicUnsafeSlice :: Int -> Int -> Vector Word -> Vector Word # basicUnsafeIndexM :: Monad m => Vector Word -> Int -> m Word # basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) Word -> Vector Word -> m () # elemseq :: Vector Word -> Word -> b -> b #
MVector MVector Word
Instance details Defined in Data.Vector.Unboxed.Base Methods basicLength :: MVector s Word -> Int # basicUnsafeSlice :: Int -> Int -> MVector s Word -> MVector s Word # basicOverlaps :: MVector s Word -> MVector s Word -> Bool # basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) Word) # basicInitialize :: PrimMonad m => MVector (PrimState m) Word -> m () # basicUnsafeReplicate :: PrimMonad m => Int -> Word -> m (MVector (PrimState m) Word) # basicUnsafeRead :: PrimMonad m => MVector (PrimState m) Word -> Int -> m Word # basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) Word -> Int -> Word -> m () # basicClear :: PrimMonad m => MVector (PrimState m) Word -> m () # basicSet :: PrimMonad m => MVector (PrimState m) Word -> Word -> m () # basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) Word -> MVector (PrimState m) Word -> m () # basicUnsafeMove :: PrimMonad m => MVector (PrimState m) Word -> MVector (PrimState m) Word -> m () # basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) Word -> Int -> m (MVector (PrimState m) Word) #
Generic1 (URec Word :: k -> Type)
Instance details Defined in GHC.Generics Associated Types type Rep1 (URec Word) :: k -> Type # Methods from1 :: URec Word a -> Rep1 (URec Word) a # to1 :: Rep1 (URec Word) a -> URec Word a #
Functor (URec Word :: Type -> Type)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods fmap :: (a -> b) -> URec Word a -> URec Word b # (<$) :: a -> URec Word b -> URec Word a #
Foldable (URec Word :: Type -> Type)	Since: base-4.9.0.0
Instance details 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] # null :: URec Word a -> Bool # 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 # sum :: Num a => URec Word a -> a # product :: Num a => URec Word a -> a #
Traversable (URec Word :: Type -> Type)	Since: base-4.9.0.0
Instance details Defined in Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> URec Word a -> f (URec Word b) # sequenceA :: Applicative f => URec Word (f a) -> f (URec Word a) # mapM :: Monad m => (a -> m b) -> URec Word a -> m (URec Word b) # sequence :: Monad m => URec Word (m a) -> m (URec Word a) #
Eq (URec Word p)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods (==) :: URec Word p -> URec Word p -> Bool # (/=) :: URec Word p -> URec Word p -> Bool #
Ord (URec Word p)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods compare :: URec Word p -> URec Word p -> Ordering # (<) :: URec Word p -> URec Word p -> Bool # (<=) :: URec Word p -> URec Word p -> Bool # (>) :: URec Word p -> URec Word p -> Bool # (>=) :: URec Word p -> URec Word p -> Bool # max :: URec Word p -> URec Word p -> URec Word p # min :: URec Word p -> URec Word p -> URec Word p #
Show (URec Word p)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods showsPrec :: Int -> URec Word p -> ShowS # show :: URec Word p -> String # showList :: [URec Word p] -> ShowS #
Generic (URec Word p)
Instance details Defined in GHC.Generics Associated Types type Rep (URec Word p) :: Type -> Type # Methods from :: URec Word p -> Rep (URec Word p) x # to :: Rep (URec Word p) x -> URec Word p #
newtype Vector Word
Instance details Defined in Data.Vector.Unboxed.Base newtype Vector Word = V_Word (Vector Word)
data URec Word (p :: k)	Used for marking occurrences of `Word#` Since: base-4.9.0.0
Instance details Defined in GHC.Generics data URec Word (p :: k) = UWord { uWord# :: Word# }
newtype MVector s Word
Instance details Defined in Data.Vector.Unboxed.Base newtype MVector s Word = MV_Word (MVector s Word)
type Rep1 (URec Word :: k -> Type)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics type Rep1 (URec Word :: k -> Type) = D1 (MetaData "URec" "GHC.Generics" "base" False) (C1 (MetaCons "UWord" PrefixI True) (S1 (MetaSel (Just "uWord#") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (UWord :: k -> Type)))
type Rep (URec Word p)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics type Rep (URec Word p) = D1 (MetaData "URec" "GHC.Generics" "base" False) (C1 (MetaCons "UWord" PrefixI True) (S1 (MetaSel (Just "uWord#") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (UWord :: Type -> Type)))

data Word8 #

8-bit unsigned integer type

Instances

Bounded Word8	Since: base-2.1
Instance details Defined in GHC.Word Methods minBound :: Word8 # maxBound :: Word8 #
Enum Word8	Since: base-2.1
Instance details Defined in GHC.Word Methods succ :: Word8 -> Word8 # pred :: Word8 -> Word8 # toEnum :: Int -> Word8 # fromEnum :: Word8 -> Int # enumFrom :: Word8 -> [Word8] # enumFromThen :: Word8 -> Word8 -> [Word8] # enumFromTo :: Word8 -> Word8 -> [Word8] # enumFromThenTo :: Word8 -> Word8 -> Word8 -> [Word8] #
Eq Word8	Since: base-2.1
Instance details Defined in GHC.Word Methods (==) :: Word8 -> Word8 -> Bool # (/=) :: Word8 -> Word8 -> Bool #
Integral Word8	Since: base-2.1
Instance details Defined in GHC.Word Methods quot :: Word8 -> Word8 -> Word8 # rem :: Word8 -> Word8 -> Word8 # div :: Word8 -> Word8 -> Word8 # mod :: Word8 -> Word8 -> Word8 # quotRem :: Word8 -> Word8 -> (Word8, Word8) # divMod :: Word8 -> Word8 -> (Word8, Word8) # toInteger :: Word8 -> Integer #
Num Word8	Since: base-2.1
Instance details Defined in GHC.Word Methods (+) :: Word8 -> Word8 -> Word8 # (-) :: Word8 -> Word8 -> Word8 # (*) :: Word8 -> Word8 -> Word8 # negate :: Word8 -> Word8 # abs :: Word8 -> Word8 # signum :: Word8 -> Word8 # fromInteger :: Integer -> Word8 #
Ord Word8	Since: base-2.1
Instance details Defined in GHC.Word Methods compare :: Word8 -> Word8 -> Ordering # (<) :: Word8 -> Word8 -> Bool # (<=) :: Word8 -> Word8 -> Bool # (>) :: Word8 -> Word8 -> Bool # (>=) :: Word8 -> Word8 -> Bool # max :: Word8 -> Word8 -> Word8 # min :: Word8 -> Word8 -> Word8 #
Read Word8	Since: base-2.1
Instance details Defined in GHC.Read Methods readsPrec :: Int -> ReadS Word8 # readList :: ReadS [Word8] # readPrec :: ReadPrec Word8 # readListPrec :: ReadPrec [Word8] #
Real Word8	Since: base-2.1
Instance details Defined in GHC.Word Methods toRational :: Word8 -> Rational #
Show Word8	Since: base-2.1
Instance details Defined in GHC.Word Methods showsPrec :: Int -> Word8 -> ShowS # show :: Word8 -> String # showList :: [Word8] -> ShowS #
Ix Word8	Since: base-2.1
Instance details Defined in GHC.Word Methods range :: (Word8, Word8) -> [Word8] # index :: (Word8, Word8) -> Word8 -> Int # unsafeIndex :: (Word8, Word8) -> Word8 -> Int inRange :: (Word8, Word8) -> Word8 -> Bool # rangeSize :: (Word8, Word8) -> Int # unsafeRangeSize :: (Word8, Word8) -> Int
Lift Word8
Instance details Defined in Language.Haskell.TH.Syntax Methods lift :: Word8 -> Q Exp #
NFData Word8
Instance details Defined in Control.DeepSeq Methods rnf :: Word8 -> () #
Hashable Word8
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Word8 -> Int # hash :: Word8 -> Int #
Storable Word8	Since: base-2.1
Instance details Defined in Foreign.Storable Methods sizeOf :: Word8 -> Int # alignment :: Word8 -> Int # peekElemOff :: Ptr Word8 -> Int -> IO Word8 # pokeElemOff :: Ptr Word8 -> Int -> Word8 -> IO () # peekByteOff :: Ptr b -> Int -> IO Word8 # pokeByteOff :: Ptr b -> Int -> Word8 -> IO () # peek :: Ptr Word8 -> IO Word8 # poke :: Ptr Word8 -> Word8 -> IO () #
Bits Word8	Since: base-2.1
Instance details Defined in GHC.Word Methods (.&.) :: Word8 -> Word8 -> Word8 # (.\|.) :: Word8 -> Word8 -> Word8 # xor :: Word8 -> Word8 -> Word8 # complement :: Word8 -> Word8 # shift :: Word8 -> Int -> Word8 # rotate :: Word8 -> Int -> Word8 # zeroBits :: Word8 # bit :: Int -> Word8 # setBit :: Word8 -> Int -> Word8 # clearBit :: Word8 -> Int -> Word8 # complementBit :: Word8 -> Int -> Word8 # testBit :: Word8 -> Int -> Bool # bitSizeMaybe :: Word8 -> Maybe Int # bitSize :: Word8 -> Int # isSigned :: Word8 -> Bool # shiftL :: Word8 -> Int -> Word8 # unsafeShiftL :: Word8 -> Int -> Word8 # shiftR :: Word8 -> Int -> Word8 # unsafeShiftR :: Word8 -> Int -> Word8 # rotateL :: Word8 -> Int -> Word8 # rotateR :: Word8 -> Int -> Word8 # popCount :: Word8 -> Int #
FiniteBits Word8	Since: base-4.6.0.0
Instance details Defined in GHC.Word Methods finiteBitSize :: Word8 -> Int # countLeadingZeros :: Word8 -> Int # countTrailingZeros :: Word8 -> Int #
Unbox Word8
Instance details Defined in Data.Vector.Unboxed.Base
Prim Word8
Instance details Defined in Data.Primitive.Types Methods sizeOf# :: Word8 -> Int# # alignment# :: Word8 -> Int# # indexByteArray# :: ByteArray# -> Int# -> Word8 # readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (#State# s, Word8#) # writeByteArray# :: MutableByteArray# s -> Int# -> Word8 -> State# s -> State# s # setByteArray# :: MutableByteArray# s -> Int# -> Int# -> Word8 -> State# s -> State# s # indexOffAddr# :: Addr# -> Int# -> Word8 # readOffAddr# :: Addr# -> Int# -> State# s -> (#State# s, Word8#) # writeOffAddr# :: Addr# -> Int# -> Word8 -> State# s -> State# s # setOffAddr# :: Addr# -> Int# -> Int# -> Word8 -> State# s -> State# s #
Default Word8
Instance details Defined in Data.Default.Class Methods def :: Word8 #
Vector Vector Word8
Instance details Defined in Data.Vector.Unboxed.Base Methods basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) Word8 -> m (Vector Word8) # basicUnsafeThaw :: PrimMonad m => Vector Word8 -> m (Mutable Vector (PrimState m) Word8) # basicLength :: Vector Word8 -> Int # basicUnsafeSlice :: Int -> Int -> Vector Word8 -> Vector Word8 # basicUnsafeIndexM :: Monad m => Vector Word8 -> Int -> m Word8 # basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) Word8 -> Vector Word8 -> m () # elemseq :: Vector Word8 -> Word8 -> b -> b #
MVector MVector Word8
Instance details Defined in Data.Vector.Unboxed.Base Methods basicLength :: MVector s Word8 -> Int # basicUnsafeSlice :: Int -> Int -> MVector s Word8 -> MVector s Word8 # basicOverlaps :: MVector s Word8 -> MVector s Word8 -> Bool # basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) Word8) # basicInitialize :: PrimMonad m => MVector (PrimState m) Word8 -> m () # basicUnsafeReplicate :: PrimMonad m => Int -> Word8 -> m (MVector (PrimState m) Word8) # basicUnsafeRead :: PrimMonad m => MVector (PrimState m) Word8 -> Int -> m Word8 # basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) Word8 -> Int -> Word8 -> m () # basicClear :: PrimMonad m => MVector (PrimState m) Word8 -> m () # basicSet :: PrimMonad m => MVector (PrimState m) Word8 -> Word8 -> m () # basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) Word8 -> MVector (PrimState m) Word8 -> m () # basicUnsafeMove :: PrimMonad m => MVector (PrimState m) Word8 -> MVector (PrimState m) Word8 -> m () # basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) Word8 -> Int -> m (MVector (PrimState m) Word8) #
newtype Vector Word8
Instance details Defined in Data.Vector.Unboxed.Base newtype Vector Word8 = V_Word8 (Vector Word8)
newtype MVector s Word8
Instance details Defined in Data.Vector.Unboxed.Base newtype MVector s Word8 = MV_Word8 (MVector s Word8)

data Word32 #

32-bit unsigned integer type

Instances

Bounded Word32	Since: base-2.1
Instance details Defined in GHC.Word Methods minBound :: Word32 # maxBound :: Word32 #
Enum Word32	Since: base-2.1
Instance details Defined in GHC.Word Methods succ :: Word32 -> Word32 # pred :: Word32 -> Word32 # toEnum :: Int -> Word32 # fromEnum :: Word32 -> Int # enumFrom :: Word32 -> [Word32] # enumFromThen :: Word32 -> Word32 -> [Word32] # enumFromTo :: Word32 -> Word32 -> [Word32] # enumFromThenTo :: Word32 -> Word32 -> Word32 -> [Word32] #
Eq Word32	Since: base-2.1
Instance details Defined in GHC.Word Methods (==) :: Word32 -> Word32 -> Bool # (/=) :: Word32 -> Word32 -> Bool #
Integral Word32	Since: base-2.1
Instance details Defined in GHC.Word Methods quot :: Word32 -> Word32 -> Word32 # rem :: Word32 -> Word32 -> Word32 # div :: Word32 -> Word32 -> Word32 # mod :: Word32 -> Word32 -> Word32 # quotRem :: Word32 -> Word32 -> (Word32, Word32) # divMod :: Word32 -> Word32 -> (Word32, Word32) # toInteger :: Word32 -> Integer #
Num Word32	Since: base-2.1
Instance details Defined in GHC.Word Methods (+) :: Word32 -> Word32 -> Word32 # (-) :: Word32 -> Word32 -> Word32 # (*) :: Word32 -> Word32 -> Word32 # negate :: Word32 -> Word32 # abs :: Word32 -> Word32 # signum :: Word32 -> Word32 # fromInteger :: Integer -> Word32 #
Ord Word32	Since: base-2.1
Instance details Defined in GHC.Word Methods compare :: Word32 -> Word32 -> Ordering # (<) :: Word32 -> Word32 -> Bool # (<=) :: Word32 -> Word32 -> Bool # (>) :: Word32 -> Word32 -> Bool # (>=) :: Word32 -> Word32 -> Bool # max :: Word32 -> Word32 -> Word32 # min :: Word32 -> Word32 -> Word32 #
Read Word32	Since: base-2.1
Instance details Defined in GHC.Read Methods readsPrec :: Int -> ReadS Word32 # readList :: ReadS [Word32] # readPrec :: ReadPrec Word32 # readListPrec :: ReadPrec [Word32] #
Real Word32	Since: base-2.1
Instance details Defined in GHC.Word Methods toRational :: Word32 -> Rational #
Show Word32	Since: base-2.1
Instance details Defined in GHC.Word Methods showsPrec :: Int -> Word32 -> ShowS # show :: Word32 -> String # showList :: [Word32] -> ShowS #
Ix Word32	Since: base-2.1
Instance details Defined in GHC.Word Methods range :: (Word32, Word32) -> [Word32] # index :: (Word32, Word32) -> Word32 -> Int # unsafeIndex :: (Word32, Word32) -> Word32 -> Int inRange :: (Word32, Word32) -> Word32 -> Bool # rangeSize :: (Word32, Word32) -> Int # unsafeRangeSize :: (Word32, Word32) -> Int
Lift Word32
Instance details Defined in Language.Haskell.TH.Syntax Methods lift :: Word32 -> Q Exp #
NFData Word32
Instance details Defined in Control.DeepSeq Methods rnf :: Word32 -> () #
Hashable Word32
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Word32 -> Int # hash :: Word32 -> Int #
Storable Word32	Since: base-2.1
Instance details Defined in Foreign.Storable Methods sizeOf :: Word32 -> Int # alignment :: Word32 -> Int # peekElemOff :: Ptr Word32 -> Int -> IO Word32 # pokeElemOff :: Ptr Word32 -> Int -> Word32 -> IO () # peekByteOff :: Ptr b -> Int -> IO Word32 # pokeByteOff :: Ptr b -> Int -> Word32 -> IO () # peek :: Ptr Word32 -> IO Word32 # poke :: Ptr Word32 -> Word32 -> IO () #
Bits Word32	Since: base-2.1
Instance details Defined in GHC.Word Methods (.&.) :: Word32 -> Word32 -> Word32 # (.\|.) :: Word32 -> Word32 -> Word32 # xor :: Word32 -> Word32 -> Word32 # complement :: Word32 -> Word32 # shift :: Word32 -> Int -> Word32 # rotate :: Word32 -> Int -> Word32 # zeroBits :: Word32 # bit :: Int -> Word32 # setBit :: Word32 -> Int -> Word32 # clearBit :: Word32 -> Int -> Word32 # complementBit :: Word32 -> Int -> Word32 # testBit :: Word32 -> Int -> Bool # bitSizeMaybe :: Word32 -> Maybe Int # bitSize :: Word32 -> Int # isSigned :: Word32 -> Bool # shiftL :: Word32 -> Int -> Word32 # unsafeShiftL :: Word32 -> Int -> Word32 # shiftR :: Word32 -> Int -> Word32 # unsafeShiftR :: Word32 -> Int -> Word32 # rotateL :: Word32 -> Int -> Word32 # rotateR :: Word32 -> Int -> Word32 # popCount :: Word32 -> Int #
FiniteBits Word32	Since: base-4.6.0.0
Instance details Defined in GHC.Word Methods finiteBitSize :: Word32 -> Int # countLeadingZeros :: Word32 -> Int # countTrailingZeros :: Word32 -> Int #
Unbox Word32
Instance details Defined in Data.Vector.Unboxed.Base
Prim Word32
Instance details Defined in Data.Primitive.Types Methods sizeOf# :: Word32 -> Int# # alignment# :: Word32 -> Int# # indexByteArray# :: ByteArray# -> Int# -> Word32 # readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (#State# s, Word32#) # writeByteArray# :: MutableByteArray# s -> Int# -> Word32 -> State# s -> State# s # setByteArray# :: MutableByteArray# s -> Int# -> Int# -> Word32 -> State# s -> State# s # indexOffAddr# :: Addr# -> Int# -> Word32 # readOffAddr# :: Addr# -> Int# -> State# s -> (#State# s, Word32#) # writeOffAddr# :: Addr# -> Int# -> Word32 -> State# s -> State# s # setOffAddr# :: Addr# -> Int# -> Int# -> Word32 -> State# s -> State# s #
Default Word32
Instance details Defined in Data.Default.Class Methods def :: Word32 #
IsGValue Word32
Instance details Defined in Data.GI.Base.GValue Methods toGValue :: Word32 -> IO GValue # fromGValue :: GValue -> IO Word32 #
Vector Vector Word32
Instance details Defined in Data.Vector.Unboxed.Base Methods basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) Word32 -> m (Vector Word32) # basicUnsafeThaw :: PrimMonad m => Vector Word32 -> m (Mutable Vector (PrimState m) Word32) # basicLength :: Vector Word32 -> Int # basicUnsafeSlice :: Int -> Int -> Vector Word32 -> Vector Word32 # basicUnsafeIndexM :: Monad m => Vector Word32 -> Int -> m Word32 # basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) Word32 -> Vector Word32 -> m () # elemseq :: Vector Word32 -> Word32 -> b -> b #
MVector MVector Word32
Instance details Defined in Data.Vector.Unboxed.Base Methods basicLength :: MVector s Word32 -> Int # basicUnsafeSlice :: Int -> Int -> MVector s Word32 -> MVector s Word32 # basicOverlaps :: MVector s Word32 -> MVector s Word32 -> Bool # basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) Word32) # basicInitialize :: PrimMonad m => MVector (PrimState m) Word32 -> m () # basicUnsafeReplicate :: PrimMonad m => Int -> Word32 -> m (MVector (PrimState m) Word32) # basicUnsafeRead :: PrimMonad m => MVector (PrimState m) Word32 -> Int -> m Word32 # basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) Word32 -> Int -> Word32 -> m () # basicClear :: PrimMonad m => MVector (PrimState m) Word32 -> m () # basicSet :: PrimMonad m => MVector (PrimState m) Word32 -> Word32 -> m () # basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) Word32 -> MVector (PrimState m) Word32 -> m () # basicUnsafeMove :: PrimMonad m => MVector (PrimState m) Word32 -> MVector (PrimState m) Word32 -> m () # basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) Word32 -> Int -> m (MVector (PrimState m) Word32) #
newtype Vector Word32
Instance details Defined in Data.Vector.Unboxed.Base newtype Vector Word32 = V_Word32 (Vector Word32)
newtype MVector s Word32
Instance details Defined in Data.Vector.Unboxed.Base newtype MVector s Word32 = MV_Word32 (MVector s Word32)

data Word64 #

64-bit unsigned integer type

Instances

Bounded Word64	Since: base-2.1
Instance details Defined in GHC.Word Methods minBound :: Word64 # maxBound :: Word64 #
Enum Word64	Since: base-2.1
Instance details Defined in GHC.Word Methods succ :: Word64 -> Word64 # pred :: Word64 -> Word64 # toEnum :: Int -> Word64 # fromEnum :: Word64 -> Int # enumFrom :: Word64 -> [Word64] # enumFromThen :: Word64 -> Word64 -> [Word64] # enumFromTo :: Word64 -> Word64 -> [Word64] # enumFromThenTo :: Word64 -> Word64 -> Word64 -> [Word64] #
Eq Word64	Since: base-2.1
Instance details Defined in GHC.Word Methods (==) :: Word64 -> Word64 -> Bool # (/=) :: Word64 -> Word64 -> Bool #
Integral Word64	Since: base-2.1
Instance details Defined in GHC.Word Methods quot :: Word64 -> Word64 -> Word64 # rem :: Word64 -> Word64 -> Word64 # div :: Word64 -> Word64 -> Word64 # mod :: Word64 -> Word64 -> Word64 # quotRem :: Word64 -> Word64 -> (Word64, Word64) # divMod :: Word64 -> Word64 -> (Word64, Word64) # toInteger :: Word64 -> Integer #
Num Word64	Since: base-2.1
Instance details Defined in GHC.Word Methods (+) :: Word64 -> Word64 -> Word64 # (-) :: Word64 -> Word64 -> Word64 # (*) :: Word64 -> Word64 -> Word64 # negate :: Word64 -> Word64 # abs :: Word64 -> Word64 # signum :: Word64 -> Word64 # fromInteger :: Integer -> Word64 #
Ord Word64	Since: base-2.1
Instance details Defined in GHC.Word Methods compare :: Word64 -> Word64 -> Ordering # (<) :: Word64 -> Word64 -> Bool # (<=) :: Word64 -> Word64 -> Bool # (>) :: Word64 -> Word64 -> Bool # (>=) :: Word64 -> Word64 -> Bool # max :: Word64 -> Word64 -> Word64 # min :: Word64 -> Word64 -> Word64 #
Read Word64	Since: base-2.1
Instance details Defined in GHC.Read Methods readsPrec :: Int -> ReadS Word64 # readList :: ReadS [Word64] # readPrec :: ReadPrec Word64 # readListPrec :: ReadPrec [Word64] #
Real Word64	Since: base-2.1
Instance details Defined in GHC.Word Methods toRational :: Word64 -> Rational #
Show Word64	Since: base-2.1
Instance details Defined in GHC.Word Methods showsPrec :: Int -> Word64 -> ShowS # show :: Word64 -> String # showList :: [Word64] -> ShowS #
Ix Word64	Since: base-2.1
Instance details Defined in GHC.Word Methods range :: (Word64, Word64) -> [Word64] # index :: (Word64, Word64) -> Word64 -> Int # unsafeIndex :: (Word64, Word64) -> Word64 -> Int inRange :: (Word64, Word64) -> Word64 -> Bool # rangeSize :: (Word64, Word64) -> Int # unsafeRangeSize :: (Word64, Word64) -> Int
Lift Word64
Instance details Defined in Language.Haskell.TH.Syntax Methods lift :: Word64 -> Q Exp #
NFData Word64
Instance details Defined in Control.DeepSeq Methods rnf :: Word64 -> () #
Hashable Word64
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Word64 -> Int # hash :: Word64 -> Int #
Storable Word64	Since: base-2.1
Instance details Defined in Foreign.Storable Methods sizeOf :: Word64 -> Int # alignment :: Word64 -> Int # peekElemOff :: Ptr Word64 -> Int -> IO Word64 # pokeElemOff :: Ptr Word64 -> Int -> Word64 -> IO () # peekByteOff :: Ptr b -> Int -> IO Word64 # pokeByteOff :: Ptr b -> Int -> Word64 -> IO () # peek :: Ptr Word64 -> IO Word64 # poke :: Ptr Word64 -> Word64 -> IO () #
Bits Word64	Since: base-2.1
Instance details Defined in GHC.Word Methods (.&.) :: Word64 -> Word64 -> Word64 # (.\|.) :: Word64 -> Word64 -> Word64 # xor :: Word64 -> Word64 -> Word64 # complement :: Word64 -> Word64 # shift :: Word64 -> Int -> Word64 # rotate :: Word64 -> Int -> Word64 # zeroBits :: Word64 # bit :: Int -> Word64 # setBit :: Word64 -> Int -> Word64 # clearBit :: Word64 -> Int -> Word64 # complementBit :: Word64 -> Int -> Word64 # testBit :: Word64 -> Int -> Bool # bitSizeMaybe :: Word64 -> Maybe Int # bitSize :: Word64 -> Int # isSigned :: Word64 -> Bool # shiftL :: Word64 -> Int -> Word64 # unsafeShiftL :: Word64 -> Int -> Word64 # shiftR :: Word64 -> Int -> Word64 # unsafeShiftR :: Word64 -> Int -> Word64 # rotateL :: Word64 -> Int -> Word64 # rotateR :: Word64 -> Int -> Word64 # popCount :: Word64 -> Int #
FiniteBits Word64	Since: base-4.6.0.0
Instance details Defined in GHC.Word Methods finiteBitSize :: Word64 -> Int # countLeadingZeros :: Word64 -> Int # countTrailingZeros :: Word64 -> Int #
Unbox Word64
Instance details Defined in Data.Vector.Unboxed.Base
Prim Word64
Instance details Defined in Data.Primitive.Types Methods sizeOf# :: Word64 -> Int# # alignment# :: Word64 -> Int# # indexByteArray# :: ByteArray# -> Int# -> Word64 # readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (#State# s, Word64#) # writeByteArray# :: MutableByteArray# s -> Int# -> Word64 -> State# s -> State# s # setByteArray# :: MutableByteArray# s -> Int# -> Int# -> Word64 -> State# s -> State# s # indexOffAddr# :: Addr# -> Int# -> Word64 # readOffAddr# :: Addr# -> Int# -> State# s -> (#State# s, Word64#) # writeOffAddr# :: Addr# -> Int# -> Word64 -> State# s -> State# s # setOffAddr# :: Addr# -> Int# -> Int# -> Word64 -> State# s -> State# s #
Default Word64
Instance details Defined in Data.Default.Class Methods def :: Word64 #
IsGValue Word64
Instance details Defined in Data.GI.Base.GValue Methods toGValue :: Word64 -> IO GValue # fromGValue :: GValue -> IO Word64 #
Vector Vector Word64
Instance details Defined in Data.Vector.Unboxed.Base Methods basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) Word64 -> m (Vector Word64) # basicUnsafeThaw :: PrimMonad m => Vector Word64 -> m (Mutable Vector (PrimState m) Word64) # basicLength :: Vector Word64 -> Int # basicUnsafeSlice :: Int -> Int -> Vector Word64 -> Vector Word64 # basicUnsafeIndexM :: Monad m => Vector Word64 -> Int -> m Word64 # basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) Word64 -> Vector Word64 -> m () # elemseq :: Vector Word64 -> Word64 -> b -> b #
MVector MVector Word64
Instance details Defined in Data.Vector.Unboxed.Base Methods basicLength :: MVector s Word64 -> Int # basicUnsafeSlice :: Int -> Int -> MVector s Word64 -> MVector s Word64 # basicOverlaps :: MVector s Word64 -> MVector s Word64 -> Bool # basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) Word64) # basicInitialize :: PrimMonad m => MVector (PrimState m) Word64 -> m () # basicUnsafeReplicate :: PrimMonad m => Int -> Word64 -> m (MVector (PrimState m) Word64) # basicUnsafeRead :: PrimMonad m => MVector (PrimState m) Word64 -> Int -> m Word64 # basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) Word64 -> Int -> Word64 -> m () # basicClear :: PrimMonad m => MVector (PrimState m) Word64 -> m () # basicSet :: PrimMonad m => MVector (PrimState m) Word64 -> Word64 -> m () # basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) Word64 -> MVector (PrimState m) Word64 -> m () # basicUnsafeMove :: PrimMonad m => MVector (PrimState m) Word64 -> MVector (PrimState m) Word64 -> m () # basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) Word64 -> Int -> m (MVector (PrimState m) Word64) #
newtype Vector Word64
Instance details Defined in Data.Vector.Unboxed.Base newtype Vector Word64 = V_Word64 (Vector Word64)
newtype MVector s Word64
Instance details Defined in Data.Vector.Unboxed.Base newtype MVector s Word64 = MV_Word64 (MVector s Word64)

data Either a b #

The Either type represents values with two possibilities: a value of type Either a b is either Left a or Right 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

Expand

The type Either String Int is the type of values which can be either a String 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
>>> s
Left "foo"
>>> let n = Right 3 :: Either String Int
>>> n
Right 3
>>> :type s
s :: Either String Int
>>> :type n
n :: 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) s
Left "foo"
>>> fmap (*2) n
Right 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)
>>> :}

>>> parseMultiple
Right 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)
>>> :}

>>> parseMultiple
Left "parse error"

Constructors

Left a
Right b

Instances

Bifunctor Either	Since: base-4.8.0.0
Instance details Defined in Data.Bifunctor Methods bimap :: (a -> b) -> (c -> d) -> Either a c -> Either b d # first :: (a -> b) -> Either a c -> Either b c # second :: (b -> c) -> Either a b -> Either a c #
Eq2 Either	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Classes Methods liftEq2 :: (a -> b -> Bool) -> (c -> d -> Bool) -> Either a c -> Either b d -> Bool #
Ord2 Either	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Classes Methods liftCompare2 :: (a -> b -> Ordering) -> (c -> d -> Ordering) -> Either a c -> Either b d -> Ordering #
Read2 Either	Since: base-4.9.0.0
Instance details 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
Instance details Defined in Data.Functor.Classes Methods liftShowsPrec2 :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> (Int -> b -> ShowS) -> ([b] -> ShowS) -> Int -> Either a b -> ShowS # liftShowList2 :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> (Int -> b -> ShowS) -> ([b] -> ShowS) -> [Either a b] -> ShowS #
NFData2 Either	Since: deepseq-1.4.3.0
Instance details Defined in Control.DeepSeq Methods liftRnf2 :: (a -> ()) -> (b -> ()) -> Either a b -> () #
Hashable2 Either
Instance details Defined in Data.Hashable.Class Methods liftHashWithSalt2 :: (Int -> a -> Int) -> (Int -> b -> Int) -> Int -> Either a b -> Int #
Swapped Either
Instance details Defined in Control.Lens.Iso Methods swapped :: Iso (Either a b) (Either c d) (Either b a) (Either d c) #
Monad (Either e)	Since: base-4.4.0.0
Instance details Defined in Data.Either Methods (>>=) :: Either e a -> (a -> Either e b) -> Either e b # (>>) :: Either e a -> Either e b -> Either e b # return :: a -> Either e a # fail :: String -> Either e a #
Functor (Either a)	Since: base-3.0
Instance details Defined in Data.Either Methods fmap :: (a0 -> b) -> Either a a0 -> Either a b # (<$) :: a0 -> Either a b -> Either a a0 #
Applicative (Either e)	Since: base-3.0
Instance details Defined in Data.Either Methods pure :: a -> Either e a # (<>) :: Either e (a -> b) -> Either e a -> Either e b # liftA2 :: (a -> b -> c) -> Either e a -> Either e b -> Either e c # (>) :: Either e a -> Either e b -> Either e b # (<*) :: Either e a -> Either e b -> Either e a #
Foldable (Either a)	Since: base-4.7.0.0
Instance details 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] # null :: Either a a0 -> Bool # 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 # sum :: Num a0 => Either a a0 -> a0 # product :: Num a0 => Either a a0 -> a0 #
Traversable (Either a)	Since: base-4.7.0.0
Instance details Defined in Data.Traversable Methods traverse :: Applicative f => (a0 -> f b) -> Either a a0 -> f (Either a b) # sequenceA :: Applicative f => Either a (f a0) -> f (Either a a0) # mapM :: Monad m => (a0 -> m b) -> Either a a0 -> m (Either a b) # sequence :: Monad m => Either a (m a0) -> m (Either a a0) #
Eq a => Eq1 (Either a)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Classes Methods liftEq :: (a0 -> b -> Bool) -> Either a a0 -> Either a b -> Bool #
Ord a => Ord1 (Either a)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Classes Methods liftCompare :: (a0 -> b -> Ordering) -> Either a a0 -> Either a b -> Ordering #
Read a => Read1 (Either a)	Since: base-4.9.0.0
Instance details 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
Instance details Defined in Data.Functor.Classes Methods liftShowsPrec :: (Int -> a0 -> ShowS) -> ([a0] -> ShowS) -> Int -> Either a a0 -> ShowS # liftShowList :: (Int -> a0 -> ShowS) -> ([a0] -> ShowS) -> [Either a a0] -> ShowS #
NFData a => NFData1 (Either a)	Since: deepseq-1.4.3.0
Instance details Defined in Control.DeepSeq Methods liftRnf :: (a0 -> ()) -> Either a a0 -> () #
Hashable a => Hashable1 (Either a)
Instance details Defined in Data.Hashable.Class Methods liftHashWithSalt :: (Int -> a0 -> Int) -> Int -> Either a a0 -> Int #
Apply (Either a)
Instance details Defined in Data.Functor.Bind.Class Methods (<.>) :: Either a (a0 -> b) -> Either a a0 -> Either a b # (.>) :: Either a a0 -> Either a b -> Either a b # (<.) :: Either a a0 -> Either a b -> Either a a0 # liftF2 :: (a0 -> b -> c) -> Either a a0 -> Either a b -> Either a c #
Bind (Either a)
Instance details Defined in Data.Functor.Bind.Class Methods (>>-) :: Either a a0 -> (a0 -> Either a b) -> Either a b # join :: Either a (Either a a0) -> Either a a0 #
PTraversable (Either a)
Instance details Defined in Data.Singletons.Prelude.Traversable Associated Types type Traverse arg arg1 :: f (t b) # type SequenceA arg :: f (t a) # type MapM arg arg1 :: m (t b) # type Sequence arg :: m (t a) #
STraversable (Either a)
Instance details 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)
Instance details Defined in Data.Singletons.Prelude.Foldable Associated Types type Fold arg :: m # type FoldMap arg arg1 :: m # type Foldr arg arg1 arg2 :: b # type Foldr' arg arg1 arg2 :: b # type Foldl arg arg1 arg2 :: b # type Foldl' arg arg1 arg2 :: b # type Foldr1 arg arg1 :: a # type Foldl1 arg arg1 :: a # type ToList arg :: [a] # type Null arg :: Bool # type Length arg :: Nat # type Elem arg arg1 :: Bool # type Maximum arg :: a # type Minimum arg :: a # type Sum arg :: a # type Product arg :: a #
SFoldable (Either a)
Instance details 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)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Associated Types type Fmap arg arg1 :: f b # type arg <$ arg1 :: f a #
PApplicative (Either e)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Associated Types type Pure arg :: f a # type arg <> arg1 :: f b # type LiftA2 arg arg1 arg2 :: f c # type arg > arg1 :: f b # type arg <* arg1 :: f a #
PMonad (Either e)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Associated Types type arg >>= arg1 :: m b # type arg >> arg1 :: m b # type Return arg :: m a # type Fail arg :: m a #
SFunctor (Either a)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods sFmap :: Sing t1 -> Sing t2 -> Sing (Apply (Apply FmapSym0 t1) t2) # (%<$) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (<$@#@$) t1) t2) #
SApplicative (Either e)
Instance details 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)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods (%>>=) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (>>=@#@$) t1) t2) # (%>>) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (>>@#@$) t1) t2) # sReturn :: Sing t -> Sing (Apply ReturnSym0 t) # sFail :: Sing t -> Sing (Apply FailSym0 t) #
Generic1 (Either a :: Type -> Type)
Instance details Defined in GHC.Generics Associated Types type Rep1 (Either a) :: k -> Type # Methods from1 :: Either a a0 -> Rep1 (Either a) a0 # to1 :: Rep1 (Either a) a0 -> Either a a0 #
(Eq a, Eq b) => Eq (Either a b)	Since: base-2.1
Instance details Defined in Data.Either Methods (==) :: Either a b -> Either a b -> Bool # (/=) :: Either a b -> Either a b -> Bool #
(Ord a, Ord b) => Ord (Either a b)	Since: base-2.1
Instance details Defined in Data.Either Methods compare :: Either a b -> Either a b -> Ordering # (<) :: Either a b -> Either a b -> Bool # (<=) :: Either a b -> Either a b -> Bool # (>) :: Either a b -> Either a b -> Bool # (>=) :: Either a b -> Either a b -> Bool # max :: Either a b -> Either a b -> Either a b # min :: Either a b -> Either a b -> Either a b #
(Read a, Read b) => Read (Either a b)	Since: base-3.0
Instance details Defined in Data.Either Methods readsPrec :: Int -> ReadS (Either a b) # readList :: ReadS [Either a b] # readPrec :: ReadPrec (Either a b) # readListPrec :: ReadPrec [Either a b] #
(Show a, Show b) => Show (Either a b)	Since: base-3.0
Instance details Defined in Data.Either Methods showsPrec :: Int -> Either a b -> ShowS # show :: Either a b -> String # showList :: [Either a b] -> ShowS #
Generic (Either a b)
Instance details Defined in GHC.Generics Associated Types type Rep (Either a b) :: Type -> Type # Methods from :: Either a b -> Rep (Either a b) x # to :: Rep (Either a b) x -> Either a b #
Semigroup (Either a b)	Since: base-4.9.0.0
Instance details Defined in Data.Either Methods (<>) :: Either a b -> Either a b -> Either a b # sconcat :: NonEmpty (Either a b) -> Either a b # stimes :: Integral b0 => b0 -> Either a b -> Either a b #
(Lift a, Lift b) => Lift (Either a b)
Instance details Defined in Language.Haskell.TH.Syntax Methods lift :: Either a b -> Q Exp #
(NFData a, NFData b) => NFData (Either a b)
Instance details Defined in Control.DeepSeq Methods rnf :: Either a b -> () #
(Hashable a, Hashable b) => Hashable (Either a b)
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Either a b -> Int # hash :: Either a b -> Int #
MonoPointed (Either a b)
Instance details Defined in Data.MonoTraversable Methods opoint :: Element (Either a b) -> Either a b #
MonoTraversable (Either a b)
Instance details Defined in Data.MonoTraversable Methods otraverse :: Applicative f => (Element (Either a b) -> f (Element (Either a b))) -> Either a b -> f (Either a b) # omapM :: Applicative m => (Element (Either a b) -> m (Element (Either a b))) -> Either a b -> m (Either a b) #
MonoFoldable (Either a b)
Instance details 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 # onull :: 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) # oelem :: Element (Either a b) -> Either a b -> Bool # onotElem :: Element (Either a b) -> Either a b -> Bool #
MonoFunctor (Either a b)
Instance details Defined in Data.MonoTraversable Methods omap :: (Element (Either a b) -> Element (Either a b)) -> Either a b -> Either a b #
PShow (Either a b)
Instance details Defined in Data.Singletons.Prelude.Show Associated Types type ShowsPrec arg arg1 arg2 :: Symbol # type Show_ arg :: Symbol # type ShowList arg arg1 :: Symbol #
(SShow a, SShow b) => SShow (Either a b)
Instance details Defined in Data.Singletons.Prelude.Show Methods sShowsPrec :: Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply ShowsPrecSym0 t1) t2) t3) # sShow_ :: Sing t -> Sing (Apply Show_Sym0 t) # sShowList :: Sing t1 -> Sing t2 -> Sing (Apply (Apply ShowListSym0 t1) t2) #
PSemigroup (Either a b)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Associated Types type arg <> arg1 :: a # type Sconcat arg :: a #
SSemigroup (Either a b)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods (%<>) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (<>@#@$) t1) t2) # sSconcat :: Sing t -> Sing (Apply SconcatSym0 t) #
POrd (Either a b)
Instance details Defined in Data.Singletons.Prelude.Ord Associated Types type Compare arg arg1 :: Ordering # type arg < arg1 :: Bool # type arg <= arg1 :: Bool # type arg > arg1 :: Bool # type arg >= arg1 :: Bool # type Max arg arg1 :: a # type Min arg arg1 :: a #
(SOrd a, SOrd b) => SOrd (Either a b)
Instance details 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)
Instance details Defined in Data.Singletons.Prelude.Eq Methods (%==) :: Sing a0 -> Sing b0 -> Sing (a0 == b0) # (%/=) :: Sing a0 -> Sing b0 -> Sing (a0 /= b0) #
PEq (Either a b)
Instance details Defined in Data.Singletons.Prelude.Eq Associated Types type x == y :: Bool # type x /= y :: Bool #
SuppressUnusedWarnings (RightsSym0 :: TyFun [Either a6989586621679849249 b6989586621679849250] [b6989586621679849250] -> Type)
Instance details Defined in Data.Singletons.Prelude.Either Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (PartitionEithersSym0 :: TyFun [Either a6989586621679849246 b6989586621679849248] ([a6989586621679849246], [b6989586621679849248]) -> Type)
Instance details Defined in Data.Singletons.Prelude.Either Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (LeftsSym0 :: TyFun [Either a6989586621679849251 b6989586621679849252] [a6989586621679849251] -> Type)
Instance details Defined in Data.Singletons.Prelude.Either Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (IsRightSym0 :: TyFun (Either a6989586621679849241 b6989586621679849242) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Either Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (IsLeftSym0 :: TyFun (Either a6989586621679849244 b6989586621679849245) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Either Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Compare_6989586621679858404Sym0 :: TyFun (Either a6989586621679069776 b6989586621679069777) (Either a6989586621679069776 b6989586621679069777 ~> Ordering) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ShowsPrec_6989586621680610896Sym0 :: TyFun Nat (Either a6989586621679069776 b6989586621679069777 ~> (Symbol ~> Symbol)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Pure_6989586621680040301Sym0 :: TyFun a6989586621679943778 (Either e6989586621680037026 a6989586621679943778) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (RightSym0 :: TyFun b6989586621679069777 (Either a6989586621679069776 b6989586621679069777) -> Type)
Instance details Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (LeftSym0 :: TyFun a6989586621679069776 (Either a6989586621679069776 b6989586621679069777) -> Type)
Instance details Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680189378ASym0 :: TyFun k1 (Either a6989586621679069776 k1) -> Type)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () #
SingI (RightsSym0 :: TyFun [Either a b] [b] -> Type)
Instance details Defined in Data.Singletons.Prelude.Either Methods sing :: Sing RightsSym0 #
SingI (PartitionEithersSym0 :: TyFun [Either a b] ([a], [b]) -> Type)
Instance details Defined in Data.Singletons.Prelude.Either Methods sing :: Sing PartitionEithersSym0 #
SingI (LeftsSym0 :: TyFun [Either a b] [a] -> Type)
Instance details Defined in Data.Singletons.Prelude.Either Methods sing :: Sing LeftsSym0 #
SingI (IsRightSym0 :: TyFun (Either a b) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Either Methods sing :: Sing IsRightSym0 #
SingI (IsLeftSym0 :: TyFun (Either a b) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Either Methods sing :: Sing IsLeftSym0 #
SingI (RightSym0 :: TyFun b (Either a b) -> Type)
Instance details Defined in Data.Singletons.Prelude.Instances Methods sing :: Sing RightSym0 #
SingI (LeftSym0 :: TyFun a (Either a b) -> Type)
Instance details Defined in Data.Singletons.Prelude.Instances Methods sing :: Sing LeftSym0 #
(FunctorWithIndex i f, FunctorWithIndex j g) => FunctorWithIndex (Either i j) (Sum f g)
Instance details Defined in Control.Lens.Indexed Methods imap :: (Either i j -> a -> b) -> Sum f g a -> Sum f g b # imapped :: IndexedSetter (Either i j) (Sum f g a) (Sum f g b) a b #
(FunctorWithIndex i f, FunctorWithIndex j g) => FunctorWithIndex (Either i j) (Product f g)
Instance details Defined in Control.Lens.Indexed Methods imap :: (Either i j -> a -> b) -> Product f g a -> Product f g b # imapped :: IndexedSetter (Either i j) (Product f g a) (Product f g b) a b #
(FunctorWithIndex i f, FunctorWithIndex j g) => FunctorWithIndex (Either i j) (f :+: g)
Instance details Defined in Control.Lens.Indexed Methods imap :: (Either i j -> a -> b) -> (f :+: g) a -> (f :+: g) b # imapped :: IndexedSetter (Either i j) ((f :+: g) a) ((f :+: g) b) a b #
(FunctorWithIndex i f, FunctorWithIndex j g) => FunctorWithIndex (Either i j) (f :*: g)
Instance details Defined in Control.Lens.Indexed Methods imap :: (Either i j -> a -> b) -> (f :: g) a -> (f :: g) b # imapped :: IndexedSetter (Either i j) ((f :: g) a) ((f :: g) b) a b #
(FoldableWithIndex i f, FoldableWithIndex j g) => FoldableWithIndex (Either i j) (Sum f g)
Instance details 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)
Instance details 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)
Instance details 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)
Instance details 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)
Instance details 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)
Instance details 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)
Instance details 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)
Instance details 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_6989586621680610896Sym1 a6989586621680610893 a6989586621679069776 b6989586621679069777 :: TyFun (Either a6989586621679069776 b6989586621679069777) (Symbol ~> Symbol) -> Type)
Instance details Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680040465Sym0 :: TyFun (Either e6989586621680037043 a6989586621679943815) ((a6989586621679943815 ~> Either e6989586621680037043 b6989586621679943816) ~> Either e6989586621680037043 b6989586621679943816) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680040319Sym0 :: TyFun (Either e6989586621680037026 (a6989586621679943779 ~> b6989586621679943780)) (Either e6989586621680037026 a6989586621679943779 ~> Either e6989586621680037026 b6989586621679943780) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Compare_6989586621679858404Sym1 a6989586621679858402 :: TyFun (Either a6989586621679069776 b6989586621679069777) Ordering -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680039597Sym0 :: TyFun a6989586621679943773 (Either a6989586621680037014 b6989586621679943774 ~> Either a6989586621680037014 a6989586621679943773) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Either_Sym0 :: TyFun (a6989586621679843316 ~> c6989586621679843318) ((b6989586621679843320 ~> c6989586621679843318) ~> (Either a6989586621679843316 b6989586621679843320 ~> c6989586621679843318)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Either Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Fmap_6989586621680039569Sym0 :: TyFun (a6989586621679943771 ~> b6989586621679943772) (Either a6989586621680037014 a6989586621679943771 ~> Either a6989586621680037014 b6989586621679943772) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SingI (Either_Sym0 :: TyFun (a ~> c) ((b ~> c) ~> (Either a b ~> c)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Either Methods sing :: Sing Either_Sym0 #
SuppressUnusedWarnings (TFHelper_6989586621680040319Sym1 a6989586621680040317 :: TyFun (Either e6989586621680037026 a6989586621679943779) (Either e6989586621680037026 b6989586621679943780) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680039597Sym1 a6989586621680039595 a6989586621680037014 b6989586621679943774 :: TyFun (Either a6989586621680037014 b6989586621679943774) (Either a6989586621680037014 a6989586621679943773) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Fmap_6989586621680039569Sym1 a6989586621680039567 a6989586621680037014 :: TyFun (Either a6989586621680037014 a6989586621679943771) (Either a6989586621680037014 b6989586621679943772) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Traverse_6989586621680970989Sym0 :: TyFun (a6989586621680959944 ~> f6989586621680959943 b6989586621680959945) (Either a6989586621680970283 a6989586621680959944 ~> f6989586621680959943 (Either a6989586621680970283 b6989586621680959945)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Either_Sym1 a6989586621679843466 b6989586621679843320 :: TyFun (b6989586621679843320 ~> c6989586621679843318) (Either a6989586621679843316 b6989586621679843320 ~> c6989586621679843318) -> Type)
Instance details Defined in Data.Singletons.Prelude.Either Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680040465Sym1 a6989586621680040463 b6989586621679943816 :: TyFun (a6989586621679943815 ~> Either e6989586621680037043 b6989586621679943816) (Either e6989586621680037043 b6989586621679943816) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SingI d => SingI (Either_Sym1 d b :: TyFun (b ~> c) (Either a b ~> c) -> Type)
Instance details Defined in Data.Singletons.Prelude.Either Methods sing :: Sing (Either_Sym1 d b) #
SuppressUnusedWarnings (Traverse_6989586621680970989Sym1 a6989586621680970987 a6989586621680970283 :: TyFun (Either a6989586621680970283 a6989586621680959944) (f6989586621680959943 (Either a6989586621680970283 b6989586621680959945)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Either_Sym2 a6989586621679843467 a6989586621679843466 :: TyFun (Either a6989586621679843316 b6989586621679843320) c6989586621679843318 -> Type)
Instance details Defined in Data.Singletons.Prelude.Either Methods suppressUnusedWarnings :: () #
(SingI d1, SingI d2) => SingI (Either_Sym2 d1 d2 :: TyFun (Either a b) c -> Type)
Instance details Defined in Data.Singletons.Prelude.Either Methods sing :: Sing (Either_Sym2 d1 d2) #
type Apply (IsRightSym0 :: TyFun (Either a b) Bool -> Type) (a6989586621679850561 :: Either a b)
Instance details Defined in Data.Singletons.Prelude.Either type Apply (IsRightSym0 :: TyFun (Either a b) Bool -> Type) (a6989586621679850561 :: Either a b) = IsRight a6989586621679850561
type Apply (IsLeftSym0 :: TyFun (Either a b) Bool -> Type) (a6989586621679850564 :: Either a b)
Instance details Defined in Data.Singletons.Prelude.Either type Apply (IsLeftSym0 :: TyFun (Either a b) Bool -> Type) (a6989586621679850564 :: Either a b) = IsLeft a6989586621679850564
type Apply (Compare_6989586621679858404Sym1 a6989586621679858402 :: TyFun (Either a b) Ordering -> Type) (a6989586621679858403 :: Either a b)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Compare_6989586621679858404Sym1 a6989586621679858402 :: TyFun (Either a b) Ordering -> Type) (a6989586621679858403 :: Either a b) = Compare_6989586621679858404 a6989586621679858402 a6989586621679858403
type Apply (Either_Sym2 a6989586621679843467 a6989586621679843466 :: TyFun (Either a b) c -> Type) (a6989586621679843468 :: Either a b)
Instance details Defined in Data.Singletons.Prelude.Either type Apply (Either_Sym2 a6989586621679843467 a6989586621679843466 :: TyFun (Either a b) c -> Type) (a6989586621679843468 :: Either a b) = Either_ a6989586621679843467 a6989586621679843466 a6989586621679843468
type Product (arg :: Either a1 a2)
Instance details Defined in Data.Singletons.Prelude.Foldable type Product (arg :: Either a1 a2) = Apply (Product_6989586621680726700Sym0 :: TyFun (Either a1 a2) a2 -> Type) arg
type Sum (arg :: Either a1 a2)
Instance details Defined in Data.Singletons.Prelude.Foldable type Sum (arg :: Either a1 a2) = Apply (Sum_6989586621680726687Sym0 :: TyFun (Either a1 a2) a2 -> Type) arg
type Minimum (arg :: Either a1 a2)
Instance details Defined in Data.Singletons.Prelude.Foldable type Minimum (arg :: Either a1 a2) = Apply (Minimum_6989586621680726674Sym0 :: TyFun (Either a1 a2) a2 -> Type) arg
type Maximum (arg :: Either a1 a2)
Instance details Defined in Data.Singletons.Prelude.Foldable type Maximum (arg :: Either a1 a2) = Apply (Maximum_6989586621680726661Sym0 :: TyFun (Either a1 a2) a2 -> Type) arg
type Length (a2 :: Either a1 a6989586621680725737)
Instance details Defined in Data.Singletons.Prelude.Foldable type Length (a2 :: Either a1 a6989586621680725737) = Apply (Length_6989586621680727072Sym0 :: TyFun (Either a1 a6989586621680725737) Nat -> Type) a2
type Null (a2 :: Either a1 a6989586621680725736)
Instance details Defined in Data.Singletons.Prelude.Foldable type Null (a2 :: Either a1 a6989586621680725736) = Apply (Null_6989586621680727081Sym0 :: TyFun (Either a1 a6989586621680725736) Bool -> Type) a2
type ToList (arg :: Either a1 a2)
Instance details Defined in Data.Singletons.Prelude.Foldable type ToList (arg :: Either a1 a2) = Apply (ToList_6989586621680726589Sym0 :: TyFun (Either a1 a2) [a2] -> Type) arg
type Fold (arg :: Either a m)
Instance details Defined in Data.Singletons.Prelude.Foldable type Fold (arg :: Either a m) = Apply (Fold_6989586621680726406Sym0 :: TyFun (Either a m) m -> Type) arg
type Pure (a :: k1)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Pure (a :: k1) = Apply (Pure_6989586621680040301Sym0 :: TyFun k1 (Either e k1) -> Type) a
type Fail arg
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Fail arg = Apply (Fail_6989586621679945585Sym0 :: TyFun Symbol (Either e a) -> Type) arg
type Return (arg :: a)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Return (arg :: a) = Apply (Return_6989586621679945578Sym0 :: TyFun a (Either e a) -> Type) arg
type Sequence (arg :: Either a1 (m a2))
Instance details Defined in Data.Singletons.Prelude.Traversable type Sequence (arg :: Either a1 (m a2)) = Apply (Sequence_6989586621680960784Sym0 :: TyFun (Either a1 (m a2)) (m (Either a1 a2)) -> Type) arg
type SequenceA (arg :: Either a1 (f a2))
Instance details Defined in Data.Singletons.Prelude.Traversable type SequenceA (arg :: Either a1 (f a2)) = Apply (SequenceA_6989586621680960756Sym0 :: TyFun (Either a1 (f a2)) (f (Either a1 a2)) -> Type) arg
type Elem (arg1 :: a1) (arg2 :: Either a2 a1)
Instance details Defined in Data.Singletons.Prelude.Foldable type Elem (arg1 :: a1) (arg2 :: Either a2 a1) = Apply (Apply (Elem_6989586621680726647Sym0 :: TyFun a1 (Either a2 a1 ~> Bool) -> Type) arg1) arg2
type Foldl1 (arg1 :: a1 ~> (a1 ~> a1)) (arg2 :: Either a2 a1)
Instance details Defined in Data.Singletons.Prelude.Foldable type Foldl1 (arg1 :: a1 ~> (a1 ~> a1)) (arg2 :: Either a2 a1) = Apply (Apply (Foldl1_6989586621680726579Sym0 :: TyFun (a1 ~> (a1 ~> a1)) (Either a2 a1 ~> a1) -> Type) arg1) arg2
type Foldr1 (arg1 :: a1 ~> (a1 ~> a1)) (arg2 :: Either a2 a1)
Instance details Defined in Data.Singletons.Prelude.Foldable type Foldr1 (arg1 :: a1 ~> (a1 ~> a1)) (arg2 :: Either a2 a1) = Apply (Apply (Foldr1_6989586621680726554Sym0 :: TyFun (a1 ~> (a1 ~> a1)) (Either a2 a1 ~> a1) -> Type) arg1) arg2
type FoldMap (a2 :: a6989586621680725724 ~> k2) (a3 :: Either a1 a6989586621680725724)
Instance details Defined in Data.Singletons.Prelude.Foldable type FoldMap (a2 :: a6989586621680725724 ~> k2) (a3 :: Either a1 a6989586621680725724) = Apply (Apply (FoldMap_6989586621680727047Sym0 :: TyFun (a6989586621680725724 ~> k2) (Either a1 a6989586621680725724 ~> k2) -> Type) a2) a3
type (a2 :: k1) <$ (a3 :: Either a1 b6989586621679943774)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type (a2 :: k1) <$ (a3 :: Either a1 b6989586621679943774) = Apply (Apply (TFHelper_6989586621680039597Sym0 :: TyFun k1 (Either a1 b6989586621679943774 ~> Either a1 k1) -> Type) a2) a3
type Fmap (a2 :: a6989586621679943771 ~> b6989586621679943772) (a3 :: Either a1 a6989586621679943771)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Fmap (a2 :: a6989586621679943771 ~> b6989586621679943772) (a3 :: Either a1 a6989586621679943771) = Apply (Apply (Fmap_6989586621680039569Sym0 :: TyFun (a6989586621679943771 ~> b6989586621679943772) (Either a1 a6989586621679943771 ~> Either a1 b6989586621679943772) -> Type) a2) a3
type (arg1 :: Either e a) <* (arg2 :: Either e b)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type (arg1 :: Either e a) <* (arg2 :: Either e b) = Apply (Apply (TFHelper_6989586621679945533Sym0 :: TyFun (Either e a) (Either e b ~> Either e a) -> Type) arg1) arg2
type (arg1 :: Either e a) *> (arg2 :: Either e b)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type (arg1 :: Either e a) *> (arg2 :: Either e b) = Apply (Apply (TFHelper_6989586621679945517Sym0 :: TyFun (Either e a) (Either e b ~> Either e b) -> Type) arg1) arg2
type (a1 :: Either e (a6989586621679943779 ~> b6989586621679943780)) <*> (a2 :: Either e a6989586621679943779)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type (a1 :: Either e (a6989586621679943779 ~> b6989586621679943780)) <*> (a2 :: Either e a6989586621679943779) = Apply (Apply (TFHelper_6989586621680040319Sym0 :: TyFun (Either e (a6989586621679943779 ~> b6989586621679943780)) (Either e a6989586621679943779 ~> Either e b6989586621679943780) -> Type) a1) a2
type (arg1 :: Either e a) >> (arg2 :: Either e b)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type (arg1 :: Either e a) >> (arg2 :: Either e b) = Apply (Apply (TFHelper_6989586621679945568Sym0 :: TyFun (Either e a) (Either e b ~> Either e b) -> Type) arg1) arg2
type (a1 :: Either e a6989586621679943815) >>= (a2 :: a6989586621679943815 ~> Either e b6989586621679943816)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type (a1 :: Either e a6989586621679943815) >>= (a2 :: a6989586621679943815 ~> Either e b6989586621679943816) = Apply (Apply (TFHelper_6989586621680040465Sym0 :: TyFun (Either e a6989586621679943815) ((a6989586621679943815 ~> Either e b6989586621679943816) ~> Either e b6989586621679943816) -> Type) a1) a2
type MapM (arg1 :: a1 ~> m b) (arg2 :: Either a2 a1)
Instance details Defined in Data.Singletons.Prelude.Traversable type MapM (arg1 :: a1 ~> m b) (arg2 :: Either a2 a1) = Apply (Apply (MapM_6989586621680960774Sym0 :: TyFun (a1 ~> m b) (Either a2 a1 ~> m (Either a2 b)) -> Type) arg1) arg2
type Traverse (a2 :: a6989586621680959944 ~> f6989586621680959943 b6989586621680959945) (a3 :: Either a1 a6989586621680959944)
Instance details Defined in Data.Singletons.Prelude.Traversable type Traverse (a2 :: a6989586621680959944 ~> f6989586621680959943 b6989586621680959945) (a3 :: Either a1 a6989586621680959944) = Apply (Apply (Traverse_6989586621680970989Sym0 :: TyFun (a6989586621680959944 ~> f6989586621680959943 b6989586621680959945) (Either a1 a6989586621680959944 ~> f6989586621680959943 (Either a1 b6989586621680959945)) -> Type) a2) a3
type Foldl' (arg1 :: b ~> (a1 ~> b)) (arg2 :: b) (arg3 :: Either a2 a1)
Instance details Defined in Data.Singletons.Prelude.Foldable type Foldl' (arg1 :: b ~> (a1 ~> b)) (arg2 :: b) (arg3 :: Either a2 a1) = Apply (Apply (Apply (Foldl'_6989586621680726528Sym0 :: TyFun (b ~> (a1 ~> b)) (b ~> (Either a2 a1 ~> b)) -> Type) arg1) arg2) arg3
type Foldl (arg1 :: b ~> (a1 ~> b)) (arg2 :: b) (arg3 :: Either a2 a1)
Instance details Defined in Data.Singletons.Prelude.Foldable type Foldl (arg1 :: b ~> (a1 ~> b)) (arg2 :: b) (arg3 :: Either a2 a1) = Apply (Apply (Apply (Foldl_6989586621680726498Sym0 :: TyFun (b ~> (a1 ~> b)) (b ~> (Either a2 a1 ~> b)) -> Type) arg1) arg2) arg3
type Foldr' (arg1 :: a1 ~> (b ~> b)) (arg2 :: b) (arg3 :: Either a2 a1)
Instance details Defined in Data.Singletons.Prelude.Foldable type Foldr' (arg1 :: a1 ~> (b ~> b)) (arg2 :: b) (arg3 :: Either a2 a1) = Apply (Apply (Apply (Foldr'_6989586621680726473Sym0 :: TyFun (a1 ~> (b ~> b)) (b ~> (Either a2 a1 ~> b)) -> Type) arg1) arg2) arg3
type Foldr (a2 :: a6989586621680725725 ~> (k2 ~> k2)) (a3 :: k2) (a4 :: Either a1 a6989586621680725725)
Instance details Defined in Data.Singletons.Prelude.Foldable type Foldr (a2 :: a6989586621680725725 ~> (k2 ~> k2)) (a3 :: k2) (a4 :: Either a1 a6989586621680725725) = Apply (Apply (Apply (Foldr_6989586621680727064Sym0 :: TyFun (a6989586621680725725 ~> (k2 ~> k2)) (k2 ~> (Either a1 a6989586621680725725 ~> k2)) -> Type) a2) a3) a4
type LiftA2 (arg1 :: a ~> (b ~> c)) (arg2 :: Either e a) (arg3 :: Either e b)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type LiftA2 (arg1 :: a ~> (b ~> c)) (arg2 :: Either e a) (arg3 :: Either e b) = Apply (Apply (Apply (LiftA2_6989586621679945504Sym0 :: TyFun (a ~> (b ~> c)) (Either e a ~> (Either e b ~> Either e c)) -> Type) arg1) arg2) arg3
type Rep1 (Either a :: Type -> Type)	Since: base-4.6.0.0
Instance details 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) (a6989586621679850605 :: [Either a b])
Instance details Defined in Data.Singletons.Prelude.Either type Apply (RightsSym0 :: TyFun [Either a b] [b] -> Type) (a6989586621679850605 :: [Either a b]) = Rights a6989586621679850605
type Apply (LeftsSym0 :: TyFun [Either a b] [a] -> Type) (a6989586621679850617 :: [Either a b])
Instance details Defined in Data.Singletons.Prelude.Either type Apply (LeftsSym0 :: TyFun [Either a b] [a] -> Type) (a6989586621679850617 :: [Either a b]) = Lefts a6989586621679850617
type Apply (Traverse_6989586621680970989Sym1 a6989586621680970987 a2 :: TyFun (Either a2 a1) (f (Either a2 b)) -> Type) (a6989586621680970988 :: Either a2 a1)
Instance details Defined in Data.Singletons.Prelude.Traversable type Apply (Traverse_6989586621680970989Sym1 a6989586621680970987 a2 :: TyFun (Either a2 a1) (f (Either a2 b)) -> Type) (a6989586621680970988 :: Either a2 a1) = Traverse_6989586621680970989 a6989586621680970987 a6989586621680970988
type Rep (Either a b)	Since: base-4.6.0.0
Instance details 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)
Instance details Defined in Data.MonoTraversable type Element (Either a b) = b
data Sing (c :: Either a b)
Instance details Defined in Data.Singletons.Prelude.Instances data Sing (c :: Either a b) where SLeft :: forall a b (c :: Either a b) (n :: a). Sing n -> Sing (Left n :: Either a b) SRight :: forall a b (c :: Either a b) (n :: b). Sing n -> Sing (Right n :: Either a b)
type Demote (Either a b)
Instance details Defined in Data.Singletons.Prelude.Instances type Demote (Either a b) = Either (Demote a) (Demote b)
type Show_ (arg :: Either a b)
Instance details Defined in Data.Singletons.Prelude.Show type Show_ (arg :: Either a b) = Apply (Show__6989586621680581388Sym0 :: TyFun (Either a b) Symbol -> Type) arg
type Sconcat (arg :: NonEmpty (Either a b))
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type Sconcat (arg :: NonEmpty (Either a b)) = Apply (Sconcat_6989586621680188294Sym0 :: TyFun (NonEmpty (Either a b)) (Either a b) -> Type) arg
type ShowList (arg1 :: [Either a b]) arg2
Instance details Defined in Data.Singletons.Prelude.Show type ShowList (arg1 :: [Either a b]) arg2 = Apply (Apply (ShowList_6989586621680581399Sym0 :: TyFun [Either a b] (Symbol ~> Symbol) -> Type) arg1) arg2
type (a2 :: Either a1 b) <> (a3 :: Either a1 b)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type (a2 :: Either a1 b) <> (a3 :: Either a1 b) = Apply (Apply (TFHelper_6989586621680189388Sym0 :: TyFun (Either a1 b) (Either a1 b ~> Either a1 b) -> Type) a2) a3
type Min (arg1 :: Either a b) (arg2 :: Either a b)
Instance details Defined in Data.Singletons.Prelude.Ord type Min (arg1 :: Either a b) (arg2 :: Either a b) = Apply (Apply (Min_6989586621679832893Sym0 :: TyFun (Either a b) (Either a b ~> Either a b) -> Type) arg1) arg2
type Max (arg1 :: Either a b) (arg2 :: Either a b)
Instance details Defined in Data.Singletons.Prelude.Ord type Max (arg1 :: Either a b) (arg2 :: Either a b) = Apply (Apply (Max_6989586621679832875Sym0 :: TyFun (Either a b) (Either a b ~> Either a b) -> Type) arg1) arg2
type (arg1 :: Either a b) >= (arg2 :: Either a b)
Instance details Defined in Data.Singletons.Prelude.Ord type (arg1 :: Either a b) >= (arg2 :: Either a b) = Apply (Apply (TFHelper_6989586621679832857Sym0 :: TyFun (Either a b) (Either a b ~> Bool) -> Type) arg1) arg2
type (arg1 :: Either a b) > (arg2 :: Either a b)
Instance details Defined in Data.Singletons.Prelude.Ord type (arg1 :: Either a b) > (arg2 :: Either a b) = Apply (Apply (TFHelper_6989586621679832839Sym0 :: TyFun (Either a b) (Either a b ~> Bool) -> Type) arg1) arg2
type (arg1 :: Either a b) <= (arg2 :: Either a b)
Instance details Defined in Data.Singletons.Prelude.Ord type (arg1 :: Either a b) <= (arg2 :: Either a b) = Apply (Apply (TFHelper_6989586621679832817Sym0 :: TyFun (Either a b) (Either a b ~> Bool) -> Type) arg1) arg2
type (arg1 :: Either a b) < (arg2 :: Either a b)
Instance details Defined in Data.Singletons.Prelude.Ord type (arg1 :: Either a b) < (arg2 :: Either a b) = Apply (Apply (TFHelper_6989586621679832797Sym0 :: TyFun (Either a b) (Either a b ~> Bool) -> Type) arg1) arg2
type Compare (a2 :: Either a1 b) (a3 :: Either a1 b)
Instance details Defined in Data.Singletons.Prelude.Ord type Compare (a2 :: Either a1 b) (a3 :: Either a1 b) = Apply (Apply (Compare_6989586621679858404Sym0 :: TyFun (Either a1 b) (Either a1 b ~> Ordering) -> Type) a2) a3
type (x :: Either a b) /= (y :: Either a b)
Instance details Defined in Data.Singletons.Prelude.Eq type (x :: Either a b) /= (y :: Either a b) = Not (x == y)
type (a2 :: Either a1 b1) == (b2 :: Either a1 b1)
Instance details Defined in Data.Singletons.Prelude.Eq type (a2 :: Either a1 b1) == (b2 :: Either a1 b1) = Equals_6989586621679803970 a2 b2
type ShowsPrec a2 (a3 :: Either a1 b) a4
Instance details Defined in Data.Singletons.Prelude.Show type ShowsPrec a2 (a3 :: Either a1 b) a4 = Apply (Apply (Apply (ShowsPrec_6989586621680610896Sym0 :: TyFun Nat (Either a1 b ~> (Symbol ~> Symbol)) -> Type) a2) a3) a4
type Apply (Pure_6989586621680040301Sym0 :: TyFun a (Either e6989586621680037026 a) -> Type) (a6989586621680040300 :: a)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (Pure_6989586621680040301Sym0 :: TyFun a (Either e6989586621680037026 a) -> Type) (a6989586621680040300 :: a) = (Pure_6989586621680040301 a6989586621680040300 :: Either e6989586621680037026 a)
type Apply (LeftSym0 :: TyFun a (Either a b6989586621679069777) -> Type) (t6989586621679738092 :: a)
Instance details Defined in Data.Singletons.Prelude.Instances type Apply (LeftSym0 :: TyFun a (Either a b6989586621679069777) -> Type) (t6989586621679738092 :: a) = (Left t6989586621679738092 :: Either a b6989586621679069777)
type Apply (RightSym0 :: TyFun b (Either a6989586621679069776 b) -> Type) (t6989586621679738094 :: b)
Instance details Defined in Data.Singletons.Prelude.Instances type Apply (RightSym0 :: TyFun b (Either a6989586621679069776 b) -> Type) (t6989586621679738094 :: b) = (Right t6989586621679738094 :: Either a6989586621679069776 b)
type Apply (Let6989586621680189378ASym0 :: TyFun k1 (Either a6989586621679069776 k1) -> Type) (wild_69895866216801875806989586621680189376 :: k1)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply (Let6989586621680189378ASym0 :: TyFun k1 (Either a6989586621679069776 k1) -> Type) (wild_69895866216801875806989586621680189376 :: k1) = (Let6989586621680189378A wild_69895866216801875806989586621680189376 :: Either a6989586621679069776 k1)
type Apply (ShowsPrec_6989586621680610896Sym0 :: TyFun Nat (Either a6989586621679069776 b6989586621679069777 ~> (Symbol ~> Symbol)) -> Type) (a6989586621680610893 :: Nat)
Instance details Defined in Data.Singletons.Prelude.Show type Apply (ShowsPrec_6989586621680610896Sym0 :: TyFun Nat (Either a6989586621679069776 b6989586621679069777 ~> (Symbol ~> Symbol)) -> Type) (a6989586621680610893 :: Nat) = (ShowsPrec_6989586621680610896Sym1 a6989586621680610893 a6989586621679069776 b6989586621679069777 :: TyFun (Either a6989586621679069776 b6989586621679069777) (Symbol ~> Symbol) -> Type)
type Apply (TFHelper_6989586621680039597Sym0 :: TyFun a6989586621679943773 (Either a6989586621680037014 b6989586621679943774 ~> Either a6989586621680037014 a6989586621679943773) -> Type) (a6989586621680039595 :: a6989586621679943773)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680039597Sym0 :: TyFun a6989586621679943773 (Either a6989586621680037014 b6989586621679943774 ~> Either a6989586621680037014 a6989586621679943773) -> Type) (a6989586621680039595 :: a6989586621679943773) = (TFHelper_6989586621680039597Sym1 a6989586621680039595 a6989586621680037014 b6989586621679943774 :: TyFun (Either a6989586621680037014 b6989586621679943774) (Either a6989586621680037014 a6989586621679943773) -> Type)
type Apply (PartitionEithersSym0 :: TyFun [Either a b] ([a], [b]) -> Type) (a6989586621679850568 :: [Either a b])
Instance details Defined in Data.Singletons.Prelude.Either type Apply (PartitionEithersSym0 :: TyFun [Either a b] ([a], [b]) -> Type) (a6989586621679850568 :: [Either a b]) = PartitionEithers a6989586621679850568
type Apply (Compare_6989586621679858404Sym0 :: TyFun (Either a6989586621679069776 b6989586621679069777) (Either a6989586621679069776 b6989586621679069777 ~> Ordering) -> Type) (a6989586621679858402 :: Either a6989586621679069776 b6989586621679069777)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Compare_6989586621679858404Sym0 :: TyFun (Either a6989586621679069776 b6989586621679069777) (Either a6989586621679069776 b6989586621679069777 ~> Ordering) -> Type) (a6989586621679858402 :: Either a6989586621679069776 b6989586621679069777) = Compare_6989586621679858404Sym1 a6989586621679858402
type Apply (Fmap_6989586621680039569Sym0 :: TyFun (a6989586621679943771 ~> b6989586621679943772) (Either a6989586621680037014 a6989586621679943771 ~> Either a6989586621680037014 b6989586621679943772) -> Type) (a6989586621680039567 :: a6989586621679943771 ~> b6989586621679943772)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (Fmap_6989586621680039569Sym0 :: TyFun (a6989586621679943771 ~> b6989586621679943772) (Either a6989586621680037014 a6989586621679943771 ~> Either a6989586621680037014 b6989586621679943772) -> Type) (a6989586621680039567 :: a6989586621679943771 ~> b6989586621679943772) = (Fmap_6989586621680039569Sym1 a6989586621680039567 a6989586621680037014 :: TyFun (Either a6989586621680037014 a6989586621679943771) (Either a6989586621680037014 b6989586621679943772) -> Type)
type Apply (TFHelper_6989586621680040319Sym0 :: TyFun (Either e6989586621680037026 (a6989586621679943779 ~> b6989586621679943780)) (Either e6989586621680037026 a6989586621679943779 ~> Either e6989586621680037026 b6989586621679943780) -> Type) (a6989586621680040317 :: Either e6989586621680037026 (a6989586621679943779 ~> b6989586621679943780))
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680040319Sym0 :: TyFun (Either e6989586621680037026 (a6989586621679943779 ~> b6989586621679943780)) (Either e6989586621680037026 a6989586621679943779 ~> Either e6989586621680037026 b6989586621679943780) -> Type) (a6989586621680040317 :: Either e6989586621680037026 (a6989586621679943779 ~> b6989586621679943780)) = TFHelper_6989586621680040319Sym1 a6989586621680040317
type Apply (ShowsPrec_6989586621680610896Sym1 a6989586621680610893 a6989586621679069776 b6989586621679069777 :: TyFun (Either a6989586621679069776 b6989586621679069777) (Symbol ~> Symbol) -> Type) (a6989586621680610894 :: Either a6989586621679069776 b6989586621679069777)
Instance details Defined in Data.Singletons.Prelude.Show type Apply (ShowsPrec_6989586621680610896Sym1 a6989586621680610893 a6989586621679069776 b6989586621679069777 :: TyFun (Either a6989586621679069776 b6989586621679069777) (Symbol ~> Symbol) -> Type) (a6989586621680610894 :: Either a6989586621679069776 b6989586621679069777) = ShowsPrec_6989586621680610896Sym2 a6989586621680610893 a6989586621680610894
type Apply (Either_Sym0 :: TyFun (a6989586621679843316 ~> c6989586621679843318) ((b6989586621679843320 ~> c6989586621679843318) ~> (Either a6989586621679843316 b6989586621679843320 ~> c6989586621679843318)) -> Type) (a6989586621679843466 :: a6989586621679843316 ~> c6989586621679843318)
Instance details Defined in Data.Singletons.Prelude.Either type Apply (Either_Sym0 :: TyFun (a6989586621679843316 ~> c6989586621679843318) ((b6989586621679843320 ~> c6989586621679843318) ~> (Either a6989586621679843316 b6989586621679843320 ~> c6989586621679843318)) -> Type) (a6989586621679843466 :: a6989586621679843316 ~> c6989586621679843318) = (Either_Sym1 a6989586621679843466 b6989586621679843320 :: TyFun (b6989586621679843320 ~> c6989586621679843318) (Either a6989586621679843316 b6989586621679843320 ~> c6989586621679843318) -> Type)
type Apply (TFHelper_6989586621680040465Sym0 :: TyFun (Either e6989586621680037043 a6989586621679943815) ((a6989586621679943815 ~> Either e6989586621680037043 b6989586621679943816) ~> Either e6989586621680037043 b6989586621679943816) -> Type) (a6989586621680040463 :: Either e6989586621680037043 a6989586621679943815)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680040465Sym0 :: TyFun (Either e6989586621680037043 a6989586621679943815) ((a6989586621679943815 ~> Either e6989586621680037043 b6989586621679943816) ~> Either e6989586621680037043 b6989586621679943816) -> Type) (a6989586621680040463 :: Either e6989586621680037043 a6989586621679943815) = (TFHelper_6989586621680040465Sym1 a6989586621680040463 b6989586621679943816 :: TyFun (a6989586621679943815 ~> Either e6989586621680037043 b6989586621679943816) (Either e6989586621680037043 b6989586621679943816) -> Type)
type Apply (Fmap_6989586621680039569Sym1 a6989586621680039567 a1 :: TyFun (Either a1 a2) (Either a1 b) -> Type) (a6989586621680039568 :: Either a1 a2)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (Fmap_6989586621680039569Sym1 a6989586621680039567 a1 :: TyFun (Either a1 a2) (Either a1 b) -> Type) (a6989586621680039568 :: Either a1 a2) = Fmap_6989586621680039569 a6989586621680039567 a6989586621680039568
type Apply (TFHelper_6989586621680039597Sym1 a6989586621680039595 a1 b :: TyFun (Either a1 b) (Either a1 a2) -> Type) (a6989586621680039596 :: Either a1 b)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680039597Sym1 a6989586621680039595 a1 b :: TyFun (Either a1 b) (Either a1 a2) -> Type) (a6989586621680039596 :: Either a1 b) = TFHelper_6989586621680039597 a6989586621680039595 a6989586621680039596
type Apply (TFHelper_6989586621680040319Sym1 a6989586621680040317 :: TyFun (Either e a) (Either e b) -> Type) (a6989586621680040318 :: Either e a)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680040319Sym1 a6989586621680040317 :: TyFun (Either e a) (Either e b) -> Type) (a6989586621680040318 :: Either e a) = TFHelper_6989586621680040319 a6989586621680040317 a6989586621680040318
type Apply (TFHelper_6989586621680040465Sym1 a6989586621680040463 b :: TyFun (a ~> Either e b) (Either e b) -> Type) (a6989586621680040464 :: a ~> Either e b)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680040465Sym1 a6989586621680040463 b :: TyFun (a ~> Either e b) (Either e b) -> Type) (a6989586621680040464 :: a ~> Either e b) = TFHelper_6989586621680040465 a6989586621680040463 a6989586621680040464
type Apply (Traverse_6989586621680970989Sym0 :: TyFun (a6989586621680959944 ~> f6989586621680959943 b6989586621680959945) (Either a6989586621680970283 a6989586621680959944 ~> f6989586621680959943 (Either a6989586621680970283 b6989586621680959945)) -> Type) (a6989586621680970987 :: a6989586621680959944 ~> f6989586621680959943 b6989586621680959945)
Instance details Defined in Data.Singletons.Prelude.Traversable type Apply (Traverse_6989586621680970989Sym0 :: TyFun (a6989586621680959944 ~> f6989586621680959943 b6989586621680959945) (Either a6989586621680970283 a6989586621680959944 ~> f6989586621680959943 (Either a6989586621680970283 b6989586621680959945)) -> Type) (a6989586621680970987 :: a6989586621680959944 ~> f6989586621680959943 b6989586621680959945) = (Traverse_6989586621680970989Sym1 a6989586621680970987 a6989586621680970283 :: TyFun (Either a6989586621680970283 a6989586621680959944) (f6989586621680959943 (Either a6989586621680970283 b6989586621680959945)) -> Type)
type Apply (Either_Sym1 a6989586621679843466 b6989586621679843320 :: TyFun (b6989586621679843320 ~> c6989586621679843318) (Either a6989586621679843316 b6989586621679843320 ~> c6989586621679843318) -> Type) (a6989586621679843467 :: b6989586621679843320 ~> c6989586621679843318)
Instance details Defined in Data.Singletons.Prelude.Either type Apply (Either_Sym1 a6989586621679843466 b6989586621679843320 :: TyFun (b6989586621679843320 ~> c6989586621679843318) (Either a6989586621679843316 b6989586621679843320 ~> c6989586621679843318) -> Type) (a6989586621679843467 :: b6989586621679843320 ~> c6989586621679843318) = Either_Sym2 a6989586621679843466 a6989586621679843467

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

Eq ByteString
Instance details Defined in Data.ByteString.Internal Methods (==) :: ByteString -> ByteString -> Bool # (/=) :: ByteString -> ByteString -> Bool #
Data ByteString
Instance details Defined in Data.ByteString.Internal Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> ByteString -> c ByteString # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c ByteString # toConstr :: ByteString -> Constr # dataTypeOf :: ByteString -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c ByteString) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c ByteString) # gmapT :: (forall b. Data b => b -> b) -> ByteString -> ByteString # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> ByteString -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> ByteString -> r # gmapQ :: (forall d. Data d => d -> u) -> ByteString -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> ByteString -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> ByteString -> m ByteString # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> ByteString -> m ByteString # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> ByteString -> m ByteString #
Ord ByteString
Instance details Defined in Data.ByteString.Internal Methods compare :: ByteString -> ByteString -> Ordering # (<) :: ByteString -> ByteString -> Bool # (<=) :: ByteString -> ByteString -> Bool # (>) :: ByteString -> ByteString -> Bool # (>=) :: ByteString -> ByteString -> Bool # max :: ByteString -> ByteString -> ByteString # min :: ByteString -> ByteString -> ByteString #
Read ByteString
Instance details Defined in Data.ByteString.Internal Methods readsPrec :: Int -> ReadS ByteString # readList :: ReadS [ByteString] # readPrec :: ReadPrec ByteString # readListPrec :: ReadPrec [ByteString] #
Show ByteString
Instance details Defined in Data.ByteString.Internal Methods showsPrec :: Int -> ByteString -> ShowS # show :: ByteString -> String # showList :: [ByteString] -> ShowS #
IsString ByteString
Instance details Defined in Data.ByteString.Internal Methods fromString :: String -> ByteString #
Semigroup ByteString
Instance details Defined in Data.ByteString.Internal Methods (<>) :: ByteString -> ByteString -> ByteString # sconcat :: NonEmpty ByteString -> ByteString # stimes :: Integral b => b -> ByteString -> ByteString #
Monoid ByteString
Instance details Defined in Data.ByteString.Internal Methods mempty :: ByteString # mappend :: ByteString -> ByteString -> ByteString # mconcat :: [ByteString] -> ByteString #
NFData ByteString
Instance details Defined in Data.ByteString.Internal Methods rnf :: ByteString -> () #
Hashable ByteString
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> ByteString -> Int # hash :: ByteString -> Int #
Chunk ByteString
Instance details Defined in Data.Attoparsec.Internal.Types Associated Types type ChunkElem ByteString :: Type # Methods nullChunk :: ByteString -> Bool # pappendChunk :: State ByteString -> ByteString -> State ByteString # atBufferEnd :: ByteString -> State ByteString -> Pos # bufferElemAt :: ByteString -> Pos -> State ByteString -> Maybe (ChunkElem ByteString, Int) # chunkElemToChar :: ByteString -> ChunkElem ByteString -> Char #
GrowingAppend ByteString
Instance details Defined in Data.MonoTraversable
MonoPointed ByteString
Instance details Defined in Data.MonoTraversable Methods opoint :: Element ByteString -> ByteString #
MonoTraversable ByteString
Instance details Defined in Data.MonoTraversable Methods otraverse :: Applicative f => (Element ByteString -> f (Element ByteString)) -> ByteString -> f ByteString # omapM :: Applicative m => (Element ByteString -> m (Element ByteString)) -> ByteString -> m ByteString #
MonoFoldable ByteString
Instance details Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element ByteString -> m) -> ByteString -> m # ofoldr :: (Element ByteString -> b -> b) -> b -> ByteString -> b # ofoldl' :: (a -> Element ByteString -> a) -> a -> ByteString -> a # otoList :: ByteString -> [Element ByteString] # oall :: (Element ByteString -> Bool) -> ByteString -> Bool # oany :: (Element ByteString -> Bool) -> ByteString -> Bool # onull :: ByteString -> Bool # olength :: ByteString -> Int # olength64 :: ByteString -> Int64 # ocompareLength :: Integral i => ByteString -> i -> Ordering # otraverse_ :: Applicative f => (Element ByteString -> f b) -> ByteString -> f () # ofor_ :: Applicative f => ByteString -> (Element ByteString -> f b) -> f () # omapM_ :: Applicative m => (Element ByteString -> m ()) -> ByteString -> m () # oforM_ :: Applicative m => ByteString -> (Element ByteString -> m ()) -> m () # ofoldlM :: Monad m => (a -> Element ByteString -> m a) -> a -> ByteString -> m a # ofoldMap1Ex :: Semigroup m => (Element ByteString -> m) -> ByteString -> m # ofoldr1Ex :: (Element ByteString -> Element ByteString -> Element ByteString) -> ByteString -> Element ByteString # ofoldl1Ex' :: (Element ByteString -> Element ByteString -> Element ByteString) -> ByteString -> Element ByteString # headEx :: ByteString -> Element ByteString # lastEx :: ByteString -> Element ByteString # unsafeHead :: ByteString -> Element ByteString # unsafeLast :: ByteString -> Element ByteString # maximumByEx :: (Element ByteString -> Element ByteString -> Ordering) -> ByteString -> Element ByteString # minimumByEx :: (Element ByteString -> Element ByteString -> Ordering) -> ByteString -> Element ByteString # oelem :: Element ByteString -> ByteString -> Bool # onotElem :: Element ByteString -> ByteString -> Bool #
MonoFunctor ByteString
Instance details Defined in Data.MonoTraversable Methods omap :: (Element ByteString -> Element ByteString) -> ByteString -> ByteString #
MonoZip ByteString
Instance details 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) #
IsSequence ByteString
Instance details Defined in Data.Sequences Methods fromList :: [Element ByteString] -> ByteString # lengthIndex :: ByteString -> Index ByteString # break :: (Element ByteString -> Bool) -> ByteString -> (ByteString, ByteString) # span :: (Element ByteString -> Bool) -> ByteString -> (ByteString, ByteString) # dropWhile :: (Element ByteString -> Bool) -> ByteString -> ByteString # takeWhile :: (Element ByteString -> Bool) -> ByteString -> ByteString # splitAt :: Index ByteString -> ByteString -> (ByteString, ByteString) # unsafeSplitAt :: Index ByteString -> ByteString -> (ByteString, ByteString) # take :: Index ByteString -> ByteString -> ByteString # unsafeTake :: Index ByteString -> ByteString -> ByteString # drop :: Index ByteString -> ByteString -> ByteString # unsafeDrop :: Index ByteString -> ByteString -> ByteString # dropEnd :: Index ByteString -> ByteString -> ByteString # partition :: (Element ByteString -> Bool) -> ByteString -> (ByteString, ByteString) # uncons :: ByteString -> Maybe (Element ByteString, ByteString) # unsnoc :: ByteString -> Maybe (ByteString, Element ByteString) # filter :: (Element ByteString -> Bool) -> ByteString -> ByteString # filterM :: Monad m => (Element ByteString -> m Bool) -> ByteString -> m ByteString # replicate :: Index ByteString -> Element ByteString -> ByteString # replicateM :: Monad m => Index ByteString -> m (Element ByteString) -> m ByteString # groupBy :: (Element ByteString -> Element ByteString -> Bool) -> ByteString -> [ByteString] # groupAllOn :: Eq b => (Element ByteString -> b) -> ByteString -> [ByteString] # subsequences :: ByteString -> [ByteString] # permutations :: ByteString -> [ByteString] # tailEx :: ByteString -> ByteString # tailMay :: ByteString -> Maybe ByteString # initEx :: ByteString -> ByteString # initMay :: ByteString -> Maybe ByteString # unsafeTail :: ByteString -> ByteString # unsafeInit :: ByteString -> ByteString # index :: ByteString -> Index ByteString -> Maybe (Element ByteString) # indexEx :: ByteString -> Index ByteString -> Element ByteString # unsafeIndex :: ByteString -> Index ByteString -> Element ByteString # splitWhen :: (Element ByteString -> Bool) -> ByteString -> [ByteString] #
SemiSequence ByteString
Instance details Defined in Data.Sequences Associated Types type Index ByteString :: Type # Methods intersperse :: Element ByteString -> ByteString -> ByteString # reverse :: ByteString -> ByteString # find :: (Element ByteString -> Bool) -> ByteString -> Maybe (Element ByteString) # sortBy :: (Element ByteString -> Element ByteString -> Ordering) -> ByteString -> ByteString # cons :: Element ByteString -> ByteString -> ByteString # snoc :: ByteString -> Element ByteString -> ByteString #
Ixed ByteString
Instance details Defined in Control.Lens.At Methods ix :: Index ByteString -> Traversal' ByteString (IxValue ByteString) #
ToBuilder ByteString Builder
Instance details Defined in Data.Builder Methods toBuilder :: ByteString -> Builder #
Utf8 Text ByteString
Instance details Defined in Data.Sequences Methods encodeUtf8 :: Text -> ByteString # decodeUtf8 :: ByteString -> Text #
LazySequence ByteString ByteString
Instance details Defined in Data.Sequences Methods toChunks :: ByteString0 -> [ByteString] # fromChunks :: [ByteString] -> ByteString0 # toStrict :: ByteString0 -> ByteString # fromStrict :: ByteString -> ByteString0 #
Strict ByteString ByteString
Instance details Defined in Control.Lens.Iso Methods strict :: Iso' ByteString0 ByteString #
type State ByteString
Instance details Defined in Data.Attoparsec.Internal.Types type State ByteString = Buffer
type ChunkElem ByteString
Instance details Defined in Data.Attoparsec.Internal.Types type ChunkElem ByteString = Word8
type Element ByteString
Instance details Defined in Data.MonoTraversable type Element ByteString = Word8
type Index ByteString
Instance details Defined in Data.Sequences type Index ByteString = Int
type Index ByteString
Instance details Defined in Control.Lens.At type Index ByteString = Int
type IxValue ByteString
Instance details Defined in Control.Lens.At type IxValue ByteString = Word8

class NFData a where #

A class of types that can be fully evaluated.

Since: deepseq-1.1.0.0

Minimal complete definition

Nothing

Methods

rnf :: a -> () #

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 Colour

Starting 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

rnf a = seq a ()

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
Instance details Defined in Control.DeepSeq Methods rnf :: Bool -> () #
NFData Char
Instance details Defined in Control.DeepSeq Methods rnf :: Char -> () #
NFData Double
Instance details Defined in Control.DeepSeq Methods rnf :: Double -> () #
NFData Float
Instance details Defined in Control.DeepSeq Methods rnf :: Float -> () #
NFData Int
Instance details Defined in Control.DeepSeq Methods rnf :: Int -> () #
NFData Int8
Instance details Defined in Control.DeepSeq Methods rnf :: Int8 -> () #
NFData Int16
Instance details Defined in Control.DeepSeq Methods rnf :: Int16 -> () #
NFData Int32
Instance details Defined in Control.DeepSeq Methods rnf :: Int32 -> () #
NFData Int64
Instance details Defined in Control.DeepSeq Methods rnf :: Int64 -> () #
NFData Integer
Instance details Defined in Control.DeepSeq Methods rnf :: Integer -> () #
NFData Natural	Since: deepseq-1.4.0.0
Instance details Defined in Control.DeepSeq Methods rnf :: Natural -> () #
NFData Ordering
Instance details Defined in Control.DeepSeq Methods rnf :: Ordering -> () #
NFData Word
Instance details Defined in Control.DeepSeq Methods rnf :: Word -> () #
NFData Word8
Instance details Defined in Control.DeepSeq Methods rnf :: Word8 -> () #
NFData Word16
Instance details Defined in Control.DeepSeq Methods rnf :: Word16 -> () #
NFData Word32
Instance details Defined in Control.DeepSeq Methods rnf :: Word32 -> () #
NFData Word64
Instance details Defined in Control.DeepSeq Methods rnf :: Word64 -> () #
NFData CallStack	Since: deepseq-1.4.2.0
Instance details Defined in Control.DeepSeq Methods rnf :: CallStack -> () #
NFData ()
Instance details Defined in Control.DeepSeq Methods rnf :: () -> () #
NFData TyCon	NOTE: Prior to `deepseq-1.4.4.0` this instance was only defined for `base-4.8.0.0` and later. Since: deepseq-1.4.0.0
Instance details Defined in Control.DeepSeq Methods rnf :: TyCon -> () #
NFData Doc
Instance details Defined in Text.PrettyPrint.HughesPJ Methods rnf :: Doc -> () #
NFData Version	Since: deepseq-1.3.0.0
Instance details Defined in Control.DeepSeq Methods rnf :: Version -> () #
NFData ByteString
Instance details Defined in Data.ByteString.Lazy.Internal Methods rnf :: ByteString -> () #
NFData ByteString
Instance details Defined in Data.ByteString.Internal Methods rnf :: ByteString -> () #
NFData Any	Since: deepseq-1.4.0.0
Instance details Defined in Control.DeepSeq Methods rnf :: Any -> () #
NFData All	Since: deepseq-1.4.0.0
Instance details Defined in Control.DeepSeq Methods rnf :: All -> () #
NFData UTCTime
Instance details Defined in Data.Time.Clock.Internal.UTCTime Methods rnf :: UTCTime -> () #
NFData ThreadId	Since: deepseq-1.4.0.0
Instance details Defined in Control.DeepSeq Methods rnf :: ThreadId -> () #
NFData Void	Defined as `rnf = absurd`. Since: deepseq-1.4.0.0
Instance details Defined in Control.DeepSeq Methods rnf :: Void -> () #
NFData Unique	Since: deepseq-1.4.0.0
Instance details Defined in Control.DeepSeq Methods rnf :: Unique -> () #
NFData ExitCode	Since: deepseq-1.4.2.0
Instance details Defined in Control.DeepSeq Methods rnf :: ExitCode -> () #
NFData MaskingState	Since: deepseq-1.4.4.0
Instance details Defined in Control.DeepSeq Methods rnf :: MaskingState -> () #
NFData TypeRep	NOTE: Prior to `deepseq-1.4.4.0` this instance was only defined for `base-4.8.0.0` and later. Since: deepseq-1.4.0.0
Instance details Defined in Control.DeepSeq Methods rnf :: TypeRep -> () #
NFData CChar	Since: deepseq-1.4.0.0
Instance details Defined in Control.DeepSeq Methods rnf :: CChar -> () #
NFData CSChar	Since: deepseq-1.4.0.0
Instance details Defined in Control.DeepSeq Methods rnf :: CSChar -> () #
NFData CUChar	Since: deepseq-1.4.0.0
Instance details Defined in Control.DeepSeq Methods rnf :: CUChar -> () #
NFData CShort	Since: deepseq-1.4.0.0
Instance details Defined in Control.DeepSeq Methods rnf :: CShort -> () #
NFData CUShort	Since: deepseq-1.4.0.0
Instance details Defined in Control.DeepSeq Methods rnf :: CUShort -> () #
NFData CInt	Since: deepseq-1.4.0.0
Instance details Defined in Control.DeepSeq Methods rnf :: CInt -> () #
NFData CUInt	Since: deepseq-1.4.0.0
Instance details Defined in Control.DeepSeq Methods rnf :: CUInt -> () #
NFData CLong	Since: deepseq-1.4.0.0
Instance details Defined in Control.DeepSeq Methods rnf :: CLong -> () #
NFData CULong	Since: deepseq-1.4.0.0
Instance details Defined in Control.DeepSeq Methods rnf :: CULong -> () #
NFData CLLong	Since: deepseq-1.4.0.0
Instance details Defined in Control.DeepSeq Methods rnf :: CLLong -> () #
NFData CULLong	Since: deepseq-1.4.0.0
Instance details Defined in Control.DeepSeq Methods rnf :: CULLong -> () #
NFData CBool	Since: deepseq-1.4.3.0
Instance details Defined in Control.DeepSeq Methods rnf :: CBool -> () #
NFData CFloat	Since: deepseq-1.4.0.0
Instance details Defined in Control.DeepSeq Methods rnf :: CFloat -> () #
NFData CDouble	Since: deepseq-1.4.0.0
Instance details Defined in Control.DeepSeq Methods rnf :: CDouble -> () #
NFData CPtrdiff	Since: deepseq-1.4.0.0
Instance details Defined in Control.DeepSeq Methods rnf :: CPtrdiff -> () #
NFData CSize	Since: deepseq-1.4.0.0
Instance details Defined in Control.DeepSeq Methods rnf :: CSize -> () #
NFData CWchar	Since: deepseq-1.4.0.0
Instance details Defined in Control.DeepSeq Methods rnf :: CWchar -> () #
NFData CSigAtomic	Since: deepseq-1.4.0.0
Instance details Defined in Control.DeepSeq Methods rnf :: CSigAtomic -> () #
NFData CClock	Since: deepseq-1.4.0.0
Instance details Defined in Control.DeepSeq Methods rnf :: CClock -> () #
NFData CTime	Since: deepseq-1.4.0.0
Instance details Defined in Control.DeepSeq Methods rnf :: CTime -> () #
NFData CUSeconds	Since: deepseq-1.4.0.0
Instance details Defined in Control.DeepSeq Methods rnf :: CUSeconds -> () #
NFData CSUSeconds	Since: deepseq-1.4.0.0
Instance details Defined in Control.DeepSeq Methods rnf :: CSUSeconds -> () #
NFData CFile	Since: deepseq-1.4.0.0
Instance details Defined in Control.DeepSeq Methods rnf :: CFile -> () #
NFData CFpos	Since: deepseq-1.4.0.0
Instance details Defined in Control.DeepSeq Methods rnf :: CFpos -> () #
NFData CJmpBuf	Since: deepseq-1.4.0.0
Instance details Defined in Control.DeepSeq Methods rnf :: CJmpBuf -> () #
NFData CIntPtr	Since: deepseq-1.4.0.0
Instance details Defined in Control.DeepSeq Methods rnf :: CIntPtr -> () #
NFData CUIntPtr	Since: deepseq-1.4.0.0
Instance details Defined in Control.DeepSeq Methods rnf :: CUIntPtr -> () #
NFData CIntMax	Since: deepseq-1.4.0.0
Instance details Defined in Control.DeepSeq Methods rnf :: CIntMax -> () #
NFData CUIntMax	Since: deepseq-1.4.0.0
Instance details Defined in Control.DeepSeq Methods rnf :: CUIntMax -> () #
NFData Fingerprint	Since: deepseq-1.4.0.0
Instance details Defined in Control.DeepSeq Methods rnf :: Fingerprint -> () #
NFData SrcLoc	Since: deepseq-1.4.2.0
Instance details Defined in Control.DeepSeq Methods rnf :: SrcLoc -> () #
NFData IntSet
Instance details Defined in Data.IntSet.Internal Methods rnf :: IntSet -> () #
NFData Day
Instance details Defined in Data.Time.Calendar.Days Methods rnf :: Day -> () #
NFData Name
Instance details Defined in Data.XML.Types Methods rnf :: Name -> () #
NFData Element
Instance details Defined in Text.XML Methods rnf :: Element -> () #
NFData TextDetails
Instance details Defined in Text.PrettyPrint.Annotated.HughesPJ Methods rnf :: TextDetails -> () #
NFData ZonedTime
Instance details Defined in Data.Time.LocalTime.Internal.ZonedTime Methods rnf :: ZonedTime -> () #
NFData LocalTime
Instance details Defined in Data.Time.LocalTime.Internal.LocalTime Methods rnf :: LocalTime -> () #
NFData TimeOfDay
Instance details Defined in Data.Time.LocalTime.Internal.TimeOfDay Methods rnf :: TimeOfDay -> () #
NFData TimeZone
Instance details Defined in Data.Time.LocalTime.Internal.TimeZone Methods rnf :: TimeZone -> () #
NFData UniversalTime
Instance details Defined in Data.Time.Clock.Internal.UniversalTime Methods rnf :: UniversalTime -> () #
NFData DiffTime
Instance details Defined in Data.Time.Clock.Internal.DiffTime Methods rnf :: DiffTime -> () #
NFData Event
Instance details Defined in Data.XML.Types Methods rnf :: Event -> () #
NFData Document
Instance details Defined in Text.XML Methods rnf :: Document -> () #
NFData Node
Instance details Defined in Text.XML Methods rnf :: Node -> () #
NFData ExternalID
Instance details Defined in Data.XML.Types Methods rnf :: ExternalID -> () #
NFData Doctype
Instance details Defined in Data.XML.Types Methods rnf :: Doctype -> () #
NFData Miscellaneous
Instance details Defined in Data.XML.Types Methods rnf :: Miscellaneous -> () #
NFData Instruction
Instance details Defined in Data.XML.Types Methods rnf :: Instruction -> () #
NFData Prologue
Instance details Defined in Data.XML.Types Methods rnf :: Prologue -> () #
NFData Document
Instance details Defined in Data.XML.Types Methods rnf :: Document -> () #
NFData Node
Instance details Defined in Data.XML.Types Methods rnf :: Node -> () #
NFData Element
Instance details Defined in Data.XML.Types Methods rnf :: Element -> () #
NFData Content
Instance details Defined in Data.XML.Types Methods rnf :: Content -> () #
NFData a => NFData [a]
Instance details Defined in Control.DeepSeq Methods rnf :: [a] -> () #
NFData a => NFData (Maybe a)
Instance details Defined in Control.DeepSeq Methods rnf :: Maybe a -> () #
NFData a => NFData (Ratio a)
Instance details Defined in Control.DeepSeq Methods rnf :: Ratio a -> () #
NFData (Ptr a)	Since: deepseq-1.4.2.0
Instance details Defined in Control.DeepSeq Methods rnf :: Ptr a -> () #
NFData (FunPtr a)	Since: deepseq-1.4.2.0
Instance details Defined in Control.DeepSeq Methods rnf :: FunPtr a -> () #
NFData a => NFData (Last a)	Since: deepseq-1.4.2.0
Instance details Defined in Control.DeepSeq Methods rnf :: Last a -> () #
NFData a => NFData (SCC a)
Instance details Defined in Data.Graph Methods rnf :: SCC a -> () #
NFData a => NFData (Complex a)
Instance details Defined in Control.DeepSeq Methods rnf :: Complex a -> () #
NFData (Fixed a)	Since: deepseq-1.3.0.0
Instance details Defined in Control.DeepSeq Methods rnf :: Fixed a -> () #
NFData a => NFData (Min a)	Since: deepseq-1.4.2.0
Instance details Defined in Control.DeepSeq Methods rnf :: Min a -> () #
NFData a => NFData (Max a)	Since: deepseq-1.4.2.0
Instance details Defined in Control.DeepSeq Methods rnf :: Max a -> () #
NFData a => NFData (First a)	Since: deepseq-1.4.2.0
Instance details Defined in Control.DeepSeq Methods rnf :: First a -> () #
NFData m => NFData (WrappedMonoid m)	Since: deepseq-1.4.2.0
Instance details Defined in Control.DeepSeq Methods rnf :: WrappedMonoid m -> () #
NFData a => NFData (Option a)	Since: deepseq-1.4.2.0
Instance details Defined in Control.DeepSeq Methods rnf :: Option a -> () #
NFData (StableName a)	Since: deepseq-1.4.0.0
Instance details Defined in Control.DeepSeq Methods rnf :: StableName a -> () #
NFData a => NFData (ZipList a)	Since: deepseq-1.4.0.0
Instance details Defined in Control.DeepSeq Methods rnf :: ZipList a -> () #
NFData a => NFData (Identity a)	Since: deepseq-1.4.0.0
Instance details Defined in Control.DeepSeq Methods rnf :: Identity a -> () #
NFData (IORef a)	NOTE: Only strict in the reference and not the referenced value. Since: deepseq-1.4.2.0
Instance details Defined in Control.DeepSeq Methods rnf :: IORef a -> () #
NFData a => NFData (First a)	Since: deepseq-1.4.0.0
Instance details Defined in Control.DeepSeq Methods rnf :: First a -> () #
NFData a => NFData (Last a)	Since: deepseq-1.4.0.0
Instance details Defined in Control.DeepSeq Methods rnf :: Last a -> () #
NFData a => NFData (Dual a)	Since: deepseq-1.4.0.0
Instance details Defined in Control.DeepSeq Methods rnf :: Dual a -> () #
NFData a => NFData (Sum a)	Since: deepseq-1.4.0.0
Instance details Defined in Control.DeepSeq Methods rnf :: Sum a -> () #
NFData a => NFData (Product a)	Since: deepseq-1.4.0.0
Instance details Defined in Control.DeepSeq Methods rnf :: Product a -> () #
NFData a => NFData (Down a)	Since: deepseq-1.4.0.0
Instance details Defined in Control.DeepSeq Methods rnf :: Down a -> () #
NFData (MVar a)	NOTE: Only strict in the reference and not the referenced value. Since: deepseq-1.4.2.0
Instance details Defined in Control.DeepSeq Methods rnf :: MVar a -> () #
NFData a => NFData (NonEmpty a)	Since: deepseq-1.4.2.0
Instance details Defined in Control.DeepSeq Methods rnf :: NonEmpty a -> () #
NFData a => NFData (Vector a)
Instance details Defined in Data.Vector Methods rnf :: Vector a -> () #
NFData a => NFData (HashSet a)
Instance details Defined in Data.HashSet Methods rnf :: HashSet a -> () #
NFData a => NFData (Set a)
Instance details Defined in Data.Set.Internal Methods rnf :: Set a -> () #
NFData a => NFData (Seq a)
Instance details Defined in Data.Sequence.Internal Methods rnf :: Seq a -> () #
NFData a => NFData (IntMap a)
Instance details Defined in Data.IntMap.Internal Methods rnf :: IntMap a -> () #
NFData a => NFData (DList a)
Instance details Defined in Data.DList Methods rnf :: DList a -> () #
NFData a => NFData (Tree a)
Instance details Defined in Data.Tree Methods rnf :: Tree a -> () #
NFData a => NFData (FingerTree a)
Instance details Defined in Data.Sequence.Internal Methods rnf :: FingerTree a -> () #
NFData a => NFData (Digit a)
Instance details Defined in Data.Sequence.Internal Methods rnf :: Digit a -> () #
NFData a => NFData (Node a)
Instance details Defined in Data.Sequence.Internal Methods rnf :: Node a -> () #
NFData a => NFData (Elem a)
Instance details Defined in Data.Sequence.Internal Methods rnf :: Elem a -> () #
NFData a => NFData (Hashed a)
Instance details Defined in Data.Hashable.Class Methods rnf :: Hashed a -> () #
NFData (Vector a)
Instance details Defined in Data.Vector.Primitive Methods rnf :: Vector a -> () #
NFData (Vector a)
Instance details Defined in Data.Vector.Storable Methods rnf :: Vector a -> () #
NFData (Vector a)
Instance details Defined in Data.Vector.Unboxed.Base Methods rnf :: Vector a -> () #
NFData a => NFData (Doc a)
Instance details Defined in Text.PrettyPrint.Annotated.HughesPJ Methods rnf :: Doc a -> () #
NFData a => NFData (AnnotDetails a)
Instance details Defined in Text.PrettyPrint.Annotated.HughesPJ Methods rnf :: AnnotDetails a -> () #
NFData (a -> b)	This instance is for convenience and consistency with `seq`. This assumes that WHNF is equivalent to NF for functions. Since: deepseq-1.3.0.0
Instance details Defined in Control.DeepSeq Methods rnf :: (a -> b) -> () #
(NFData a, NFData b) => NFData (Either a b)
Instance details Defined in Control.DeepSeq Methods rnf :: Either a b -> () #
(NFData a, NFData b) => NFData (a, b)
Instance details Defined in Control.DeepSeq Methods rnf :: (a, b) -> () #
(NFData k, NFData a) => NFData (Map k a)
Instance details Defined in Data.Map.Internal Methods rnf :: Map k a -> () #
(NFData k, NFData v) => NFData (HashMap k v)
Instance details Defined in Data.HashMap.Base Methods rnf :: HashMap k v -> () #
(NFData a, NFData b) => NFData (Array a b)
Instance details Defined in Control.DeepSeq Methods rnf :: Array a b -> () #
(NFData i, NFData r) => NFData (IResult i r)
Instance details Defined in Data.Attoparsec.Internal.Types Methods rnf :: IResult i r -> () #
(NFData a, NFData b) => NFData (Arg a b)	Since: deepseq-1.4.2.0
Instance details Defined in Control.DeepSeq Methods rnf :: Arg a b -> () #
NFData (Proxy a)	Since: deepseq-1.4.0.0
Instance details Defined in Control.DeepSeq Methods rnf :: Proxy a -> () #
NFData (STRef s a)	NOTE: Only strict in the reference and not the referenced value. Since: deepseq-1.4.2.0
Instance details Defined in Control.DeepSeq Methods rnf :: STRef s a -> () #
(NFData k, NFData v) => NFData (Leaf k v)
Instance details Defined in Data.HashMap.Base Methods rnf :: Leaf k v -> () #
NFData (MVector s a)
Instance details Defined in Data.Vector.Unboxed.Base Methods rnf :: MVector s a -> () #
NFData (MVector s a)
Instance details Defined in Data.Vector.Storable.Mutable Methods rnf :: MVector s a -> () #
NFData (MVector s a)
Instance details Defined in Data.Vector.Primitive.Mutable Methods rnf :: MVector s a -> () #
(NFData a1, NFData a2, NFData a3) => NFData (a1, a2, a3)
Instance details Defined in Control.DeepSeq Methods rnf :: (a1, a2, a3) -> () #
NFData a => NFData (Const a b)	Since: deepseq-1.4.0.0
Instance details Defined in Control.DeepSeq Methods rnf :: Const a b -> () #
NFData (a :~: b)	Since: deepseq-1.4.3.0
Instance details Defined in Control.DeepSeq Methods rnf :: (a :~: b) -> () #
NFData b => NFData (Tagged s b)
Instance details Defined in Data.Tagged Methods rnf :: Tagged s b -> () #
(NFData a1, NFData a2, NFData a3, NFData a4) => NFData (a1, a2, a3, a4)
Instance details Defined in Control.DeepSeq Methods rnf :: (a1, a2, a3, a4) -> () #
(NFData1 f, NFData1 g, NFData a) => NFData (Product f g a)	Since: deepseq-1.4.3.0
Instance details Defined in Control.DeepSeq Methods rnf :: Product f g a -> () #
(NFData1 f, NFData1 g, NFData a) => NFData (Sum f g a)	Since: deepseq-1.4.3.0
Instance details Defined in Control.DeepSeq Methods rnf :: Sum f g a -> () #
NFData (a :~~: b)	Since: deepseq-1.4.3.0
Instance details Defined in Control.DeepSeq Methods rnf :: (a :~~: b) -> () #
(NFData a1, NFData a2, NFData a3, NFData a4, NFData a5) => NFData (a1, a2, a3, a4, a5)
Instance details Defined in Control.DeepSeq Methods rnf :: (a1, a2, a3, a4, a5) -> () #
(NFData1 f, NFData1 g, NFData a) => NFData (Compose f g a)	Since: deepseq-1.4.3.0
Instance details Defined in Control.DeepSeq Methods rnf :: Compose f g a -> () #
(NFData a1, NFData a2, NFData a3, NFData a4, NFData a5, NFData a6) => NFData (a1, a2, a3, a4, a5, a6)
Instance details Defined in Control.DeepSeq Methods rnf :: (a1, a2, a3, a4, a5, a6) -> () #
(NFData a1, NFData a2, NFData a3, NFData a4, NFData a5, NFData a6, NFData a7) => NFData (a1, a2, a3, a4, a5, a6, a7)
Instance details Defined in Control.DeepSeq Methods rnf :: (a1, a2, a3, a4, a5, a6, a7) -> () #
(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)
Instance details Defined in Control.DeepSeq Methods rnf :: (a1, a2, a3, a4, a5, a6, a7, a8) -> () #
(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)
Instance details Defined in Control.DeepSeq Methods rnf :: (a1, a2, a3, a4, a5, a6, a7, a8, a9) -> () #

data Map k a #

A Map from keys k to values a.

Instances

Eq2 Map	Since: containers-0.5.9
Instance details Defined in Data.Map.Internal Methods liftEq2 :: (a -> b -> Bool) -> (c -> d -> Bool) -> Map a c -> Map b d -> Bool #
Ord2 Map	Since: containers-0.5.9
Instance details Defined in Data.Map.Internal Methods liftCompare2 :: (a -> b -> Ordering) -> (c -> d -> Ordering) -> Map a c -> Map b d -> Ordering #
Show2 Map	Since: containers-0.5.9
Instance details Defined in Data.Map.Internal Methods liftShowsPrec2 :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> (Int -> b -> ShowS) -> ([b] -> ShowS) -> Int -> Map a b -> ShowS # liftShowList2 :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> (Int -> b -> ShowS) -> ([b] -> ShowS) -> [Map a b] -> ShowS #
BiPolyMap Map
Instance details 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)
Instance details Defined in Control.Lens.Indexed Methods imap :: (k -> a -> b) -> Map k a -> Map k b # imapped :: IndexedSetter k (Map k a) (Map k b) a b #
FoldableWithIndex k (Map k)
Instance details Defined in Control.Lens.Indexed Methods ifoldMap :: Monoid m => (k -> a -> m) -> Map k a -> m # ifolded :: IndexedFold k (Map k a) a # ifoldr :: (k -> a -> b -> b) -> b -> Map k a -> b # ifoldl :: (k -> b -> a -> b) -> b -> Map k a -> b # ifoldr' :: (k -> a -> b -> b) -> b -> Map k a -> b # ifoldl' :: (k -> b -> a -> b) -> b -> Map k a -> b #
TraversableWithIndex k (Map k)
Instance details 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)
Instance details Defined in Data.Map.Internal Methods fmap :: (a -> b) -> Map k a -> Map k b # (<$) :: a -> Map k b -> Map k a #
Foldable (Map k)
Instance details 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 # toList :: Map k a -> [a] # null :: Map k a -> Bool # length :: Map k a -> Int # elem :: Eq a => a -> Map k a -> Bool # maximum :: Ord a => Map k a -> a # minimum :: Ord a => Map k a -> a # sum :: Num a => Map k a -> a # product :: Num a => Map k a -> a #
Traversable (Map k)
Instance details Defined in Data.Map.Internal Methods traverse :: Applicative f => (a -> f b) -> Map k a -> f (Map k b) # sequenceA :: Applicative f => Map k (f a) -> f (Map k a) # mapM :: Monad m => (a -> m b) -> Map k a -> m (Map k b) # sequence :: Monad m => Map k (m a) -> m (Map k a) #
Eq k => Eq1 (Map k)	Since: containers-0.5.9
Instance details Defined in Data.Map.Internal Methods liftEq :: (a -> b -> Bool) -> Map k a -> Map k b -> Bool #
Ord k => Ord1 (Map k)	Since: containers-0.5.9
Instance details Defined in Data.Map.Internal Methods liftCompare :: (a -> b -> Ordering) -> Map k a -> Map k b -> Ordering #
(Ord k, Read k) => Read1 (Map k)	Since: containers-0.5.9
Instance details Defined in Data.Map.Internal Methods liftReadsPrec :: (Int -> ReadS a) -> ReadS [a] -> Int -> ReadS (Map k a) # liftReadList :: (Int -> ReadS a) -> ReadS [a] -> ReadS [Map k a] # liftReadPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec (Map k a) # liftReadListPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec [Map k a] #
Show k => Show1 (Map k)	Since: containers-0.5.9
Instance details Defined in Data.Map.Internal Methods liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> Map k a -> ShowS # liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [Map k a] -> ShowS #
Ord key => PolyMap (Map key)	This instance uses the functions from Data.Map.Strict.
Instance details 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)
Instance details Defined in Data.Key Methods mapWithKey :: (Key (Map k) -> a -> b) -> Map k a -> Map k b #
Ord k => Zip (Map k)
Instance details Defined in Data.Key Methods zipWith :: (a -> b -> c) -> Map k a -> Map k b -> Map k c # zip :: Map k a -> Map k b -> Map k (a, b) # zap :: Map k (a -> b) -> Map k a -> Map k b #
Ord k => ZipWithKey (Map k)
Instance details Defined in Data.Key Methods zipWithKey :: (Key (Map k) -> a -> b -> c) -> Map k a -> Map k b -> Map k c # zapWithKey :: Map k (Key (Map k) -> a -> b) -> Map k a -> Map k b #
Ord k => Indexable (Map k)
Instance details Defined in Data.Key Methods index :: Map k a -> Key (Map k) -> a #
Ord k => Lookup (Map k)
Instance details Defined in Data.Key Methods lookup :: Key (Map k) -> Map k a -> Maybe a #
Ord k => Adjustable (Map k)
Instance details Defined in Data.Key Methods adjust :: (a -> a) -> Key (Map k) -> Map k a -> Map k a # replace :: Key (Map k) -> a -> Map k a -> Map k a #
FoldableWithKey (Map k)
Instance details Defined in Data.Key Methods toKeyedList :: Map k a -> [(Key (Map k), a)] # foldMapWithKey :: Monoid m => (Key (Map k) -> a -> m) -> Map k a -> m # foldrWithKey :: (Key (Map k) -> a -> b -> b) -> b -> Map k a -> b # foldlWithKey :: (b -> Key (Map k) -> a -> b) -> b -> Map k a -> b #
TraversableWithKey (Map k)
Instance details 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 `Applicative`, but it is an instance of `Apply`
Instance details Defined in Data.Functor.Bind.Class Methods (<.>) :: Map k (a -> b) -> Map k a -> Map k b # (.>) :: Map k a -> Map k b -> Map k b # (<.) :: Map k a -> Map k b -> Map k a # liftF2 :: (a -> b -> c) -> Map k a -> Map k b -> Map k c #
Ord k => Bind (Map k)	A `Map` is not a `Monad`, but it is an instance of `Bind`
Instance details Defined in Data.Functor.Bind.Class Methods (>>-) :: Map k a -> (a -> Map k b) -> Map k b # join :: Map k (Map k a) -> Map k a #
Ord k => IsList (Map k v)	Since: containers-0.5.6.2
Instance details Defined in Data.Map.Internal Associated Types type Item (Map k v) :: Type # Methods fromList :: [Item (Map k v)] -> Map k v # fromListN :: Int -> [Item (Map k v)] -> Map k v # toList :: Map k v -> [Item (Map k v)] #
(Eq k, Eq a) => Eq (Map k a)
Instance details Defined in Data.Map.Internal Methods (==) :: Map k a -> Map k a -> Bool # (/=) :: Map k a -> Map k a -> Bool #
(Data k, Data a, Ord k) => Data (Map k a)
Instance details 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)
Instance details Defined in Data.Map.Internal Methods compare :: Map k v -> Map k v -> Ordering # (<) :: Map k v -> Map k v -> Bool # (<=) :: Map k v -> Map k v -> Bool # (>) :: Map k v -> Map k v -> Bool # (>=) :: Map k v -> Map k v -> Bool # max :: Map k v -> Map k v -> Map k v # min :: Map k v -> Map k v -> Map k v #
(Ord k, Read k, Read e) => Read (Map k e)
Instance details Defined in Data.Map.Internal Methods readsPrec :: Int -> ReadS (Map k e) # readList :: ReadS [Map k e] # readPrec :: ReadPrec (Map k e) # readListPrec :: ReadPrec [Map k e] #
(Show k, Show a) => Show (Map k a)
Instance details Defined in Data.Map.Internal Methods showsPrec :: Int -> Map k a -> ShowS # show :: Map k a -> String # showList :: [Map k a] -> ShowS #
Ord k => Semigroup (Map k v)
Instance details Defined in Data.Map.Internal Methods (<>) :: Map k v -> Map k v -> Map k v # sconcat :: NonEmpty (Map k v) -> Map k v # stimes :: Integral b => b -> Map k v -> Map k v #
Ord k => Monoid (Map k v)
Instance details Defined in Data.Map.Internal Methods mempty :: Map k v # mappend :: Map k v -> Map k v -> Map k v # mconcat :: [Map k v] -> Map k v #
(NFData k, NFData a) => NFData (Map k a)
Instance details Defined in Data.Map.Internal Methods rnf :: Map k a -> () #
Ord k => GrowingAppend (Map k v)
Instance details Defined in Data.MonoTraversable
MonoTraversable (Map k v)
Instance details Defined in Data.MonoTraversable Methods otraverse :: Applicative f => (Element (Map k v) -> f (Element (Map k v))) -> Map k v -> f (Map k v) # omapM :: Applicative m => (Element (Map k v) -> m (Element (Map k v))) -> Map k v -> m (Map k v) #
MonoFoldable (Map k v)
Instance details 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 # onull :: Map k v -> Bool # olength :: Map k v -> Int # 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) # oelem :: Element (Map k v) -> Map k v -> Bool # onotElem :: Element (Map k v) -> Map k v -> Bool #
MonoFunctor (Map k v)
Instance details Defined in Data.MonoTraversable Methods omap :: (Element (Map k v) -> Element (Map k v)) -> Map k v -> Map k v #
Ord k => HasKeysSet (Map k v)
Instance details Defined in Data.Containers Associated Types type KeySet (Map k v) :: Type # Methods keysSet :: Map k v -> KeySet (Map k v) #
Ord key => IsMap (Map key value)	This instance uses the functions from Data.Map.Strict.
Instance details Defined in Data.Containers Associated Types type MapValue (Map key value) :: Type # 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.
Instance details 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)
Instance details Defined in Control.Lens.At Methods ix :: Index (Map k a) -> Traversal' (Map k a) (IxValue (Map k a)) #
Ord k => At (Map k a)
Instance details Defined in Control.Lens.At Methods at :: Index (Map k a) -> Lens' (Map k a) (Maybe (IxValue (Map k a))) #
Ord k => Wrapped (Map k a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (Map k a) :: Type # Methods _Wrapped' :: Iso' (Map k a) (Unwrapped (Map k a)) #
(t ~ Map k' a', Ord k) => Rewrapped (Map k a) t	Use `wrapping fromList`. unwrapping returns a sorted list.
Instance details Defined in Control.Lens.Wrapped
type BPMKeyConstraint Map key
Instance details Defined in Data.Containers type BPMKeyConstraint Map key = Ord key
type Key (Map k)
Instance details Defined in Data.Key type Key (Map k) = k
type Item (Map k v)
Instance details Defined in Data.Map.Internal type Item (Map k v) = (k, v)
type Element (Map k v)
Instance details Defined in Data.MonoTraversable type Element (Map k v) = v
type KeySet (Map k v)
Instance details Defined in Data.Containers type KeySet (Map k v) = Set k
type MapValue (Map key value)
Instance details Defined in Data.Containers type MapValue (Map key value) = value
type ContainerKey (Map k v)
Instance details Defined in Data.Containers type ContainerKey (Map k v) = k
type Index (Map k a)
Instance details Defined in Control.Lens.At type Index (Map k a) = k
type IxValue (Map k a)
Instance details Defined in Control.Lens.At type IxValue (Map k a) = a
type Unwrapped (Map k a)
Instance details Defined in Control.Lens.Wrapped type Unwrapped (Map k a) = [(k, a)]

not :: Bool -> Bool #

Boolean "not"

(||) :: Bool -> Bool -> Bool infixr 2 #

Boolean "or"

(&&) :: Bool -> Bool -> Bool infixr 3 #

Boolean "and"

error :: HasCallStack => [Char] -> a #

error stops execution and displays an error message.

type String = [Char] #

A String is a list of characters. String constants in Haskell are values of type String.

class (Alternative m, Monad m) => MonadPlus (m :: Type -> Type) where #

Monads that also support choice and failure.

Minimal complete definition

Nothing

Methods

mzero :: m a #

The identity of mplus. It should also satisfy the equations

mzero >>= f  =  mzero
v >> mzero   =  mzero

The default definition is

mzero = empty

mplus :: m a -> m a -> m a #

An associative operation. The default definition is

mplus = (<|>)

Instances

MonadPlus []	Since: base-2.1
Instance details Defined in GHC.Base Methods mzero :: [a] # mplus :: [a] -> [a] -> [a] #
MonadPlus Maybe	Since: base-2.1
Instance details Defined in GHC.Base Methods mzero :: Maybe a # mplus :: Maybe a -> Maybe a -> Maybe a #
MonadPlus IO	Since: base-4.9.0.0
Instance details Defined in GHC.Base Methods mzero :: IO a # mplus :: IO a -> IO a -> IO a #
MonadPlus Option	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods mzero :: Option a # mplus :: Option a -> Option a -> Option a #
MonadPlus STM	Since: base-4.3.0.0
Instance details Defined in GHC.Conc.Sync Methods mzero :: STM a # mplus :: STM a -> STM a -> STM a #
MonadPlus ReadPrec	Since: base-2.1
Instance details Defined in Text.ParserCombinators.ReadPrec Methods mzero :: ReadPrec a # mplus :: ReadPrec a -> ReadPrec a -> ReadPrec a #
MonadPlus ReadP	Since: base-2.1
Instance details Defined in Text.ParserCombinators.ReadP Methods mzero :: ReadP a # mplus :: ReadP a -> ReadP a -> ReadP a #
MonadPlus Vector
Instance details Defined in Data.Vector Methods mzero :: Vector a # mplus :: Vector a -> Vector a -> Vector a #
MonadPlus Seq
Instance details Defined in Data.Sequence.Internal Methods mzero :: Seq a # mplus :: Seq a -> Seq a -> Seq a #
MonadPlus DList
Instance details Defined in Data.DList Methods mzero :: DList a # mplus :: DList a -> DList a -> DList a #
MonadPlus SmallArray
Instance details Defined in Data.Primitive.SmallArray Methods mzero :: SmallArray a # mplus :: SmallArray a -> SmallArray a -> SmallArray a #
MonadPlus Array
Instance details Defined in Data.Primitive.Array Methods mzero :: Array a # mplus :: Array a -> Array a -> Array a #
MonadPlus P	Since: base-2.1
Instance details Defined in Text.ParserCombinators.ReadP Methods mzero :: P a # mplus :: P a -> P a -> P a #
MonadPlus (U1 :: Type -> Type)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods mzero :: U1 a # mplus :: U1 a -> U1 a -> U1 a #
MonadPlus (Parser i)
Instance details Defined in Data.Attoparsec.Internal.Types Methods mzero :: Parser i a # mplus :: Parser i a -> Parser i a -> Parser i a #
(ArrowApply a, ArrowPlus a) => MonadPlus (ArrowMonad a)	Since: base-4.6.0.0
Instance details Defined in Control.Arrow Methods mzero :: ArrowMonad a a0 # mplus :: ArrowMonad a a0 -> ArrowMonad a a0 -> ArrowMonad a a0 #
MonadPlus (Proxy :: Type -> Type)	Since: base-4.9.0.0
Instance details Defined in Data.Proxy Methods mzero :: Proxy a # mplus :: Proxy a -> Proxy a -> Proxy a #
Monad m => MonadPlus (MaybeT m)
Instance details Defined in Control.Monad.Trans.Maybe Methods mzero :: MaybeT m a # mplus :: MaybeT m a -> MaybeT m a -> MaybeT m a #
MonadPlus m => MonadPlus (ResourceT m)	Since 1.1.5
Instance details Defined in Control.Monad.Trans.Resource.Internal Methods mzero :: ResourceT m a # mplus :: ResourceT m a -> ResourceT m a -> ResourceT m a #
(Functor v, MonadPlus v) => MonadPlus (Free v)	This violates the MonadPlus laws, handle with care.
Instance details Defined in Control.Monad.Free Methods mzero :: Free v a # mplus :: Free v a -> Free v a -> Free v a #
MonadPlus m => MonadPlus (Yoneda m)
Instance details Defined in Data.Functor.Yoneda Methods mzero :: Yoneda m a # mplus :: Yoneda m a -> Yoneda m a -> Yoneda m a #
MonadPlus (ReifiedFold s)
Instance details Defined in Control.Lens.Reified Methods mzero :: ReifiedFold s a # mplus :: ReifiedFold s a -> ReifiedFold s a -> ReifiedFold s a #
Monad m => MonadPlus (ListT m)
Instance details Defined in Control.Monad.Trans.List Methods mzero :: ListT m a # mplus :: ListT m a -> ListT m a -> ListT m a #
MonadPlus f => MonadPlus (Rec1 f)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods mzero :: Rec1 f a # mplus :: Rec1 f a -> Rec1 f a -> Rec1 f a #
MonadPlus f => MonadPlus (Ap f)	Since: base-4.12.0.0
Instance details Defined in Data.Monoid Methods mzero :: Ap f a # mplus :: Ap f a -> Ap f a -> Ap f a #
MonadPlus f => MonadPlus (Alt f)	Since: base-4.8.0.0
Instance details Defined in Data.Semigroup.Internal Methods mzero :: Alt f a # mplus :: Alt f a -> Alt f a -> Alt f a #
MonadPlus m => MonadPlus (ReaderT r m)
Instance details Defined in Control.Monad.Trans.Reader Methods mzero :: ReaderT r m a # mplus :: ReaderT r m a -> ReaderT r m a -> ReaderT r m a #
MonadPlus m => MonadPlus (IdentityT m)
Instance details Defined in Control.Monad.Trans.Identity Methods mzero :: IdentityT m a # mplus :: IdentityT m a -> IdentityT m a -> IdentityT m a #
(Monoid w, MonadPlus m) => MonadPlus (WriterT w m)
Instance details Defined in Control.Monad.Trans.Writer.Strict Methods mzero :: WriterT w m a # mplus :: WriterT w m a -> WriterT w m a -> WriterT w m a #
(Monoid w, MonadPlus m) => MonadPlus (WriterT w m)
Instance details Defined in Control.Monad.Trans.Writer.Lazy Methods mzero :: WriterT w m a # mplus :: WriterT w m a -> WriterT w m a -> WriterT w m a #
MonadPlus m => MonadPlus (StateT s m)
Instance details Defined in Control.Monad.Trans.State.Strict Methods mzero :: StateT s m a # mplus :: StateT s m a -> StateT s m a -> StateT s m a #
MonadPlus m => MonadPlus (StateT s m)
Instance details Defined in Control.Monad.Trans.State.Lazy Methods mzero :: StateT s m a # mplus :: StateT s m a -> StateT s m a -> StateT s m a #
(Functor f, MonadPlus m) => MonadPlus (FreeT f m)
Instance details Defined in Control.Monad.Trans.Free Methods mzero :: FreeT f m a # mplus :: FreeT f m a -> FreeT f m a -> FreeT f m a #
(Monad m, Error e) => MonadPlus (ErrorT e m)
Instance details Defined in Control.Monad.Trans.Error Methods mzero :: ErrorT e m a # mplus :: ErrorT e m a -> ErrorT e m a -> ErrorT e m a #
(MonadPlus f, MonadPlus g) => MonadPlus (f :*: g)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods mzero :: (f :: g) a # mplus :: (f :: g) a -> (f :: g) a -> (f :: g) a #
(MonadPlus f, MonadPlus g) => MonadPlus (Product f g)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Product Methods mzero :: Product f g a # mplus :: Product f g a -> Product f g a -> Product f g a #
MonadPlus f => MonadPlus (M1 i c f)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods mzero :: M1 i c f a # mplus :: M1 i c f a -> M1 i c f a -> M1 i c f a #
(Monoid w, MonadPlus m) => MonadPlus (RWST r w s m)
Instance details Defined in Control.Monad.Trans.RWS.Strict Methods mzero :: RWST r w s m a # mplus :: RWST r w s m a -> RWST r w s m a -> RWST r w s m a #
(Monoid w, MonadPlus m) => MonadPlus (RWST r w s m)
Instance details Defined in Control.Monad.Trans.RWS.Lazy Methods mzero :: RWST r w s m a # mplus :: RWST r w s m a -> RWST r w s m a -> RWST r w s m a #

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:

```
some v = (:) <$> v <*> many v
```
```
many v = some v <|> pure []
```

Minimal complete definition

empty, (<|>)

Methods

empty :: f a #

The identity of <|>

(<|>) :: f a -> f a -> f a infixl 3 #

An associative binary operation

some :: f a -> f [a] #

One or more.

many :: f a -> f [a] #

Zero or more.

Instances

Alternative []	Since: base-2.1
Instance details Defined in GHC.Base Methods empty :: [a] # (<\|>) :: [a] -> [a] -> [a] # some :: [a] -> [[a]] # many :: [a] -> [[a]] #
Alternative Maybe	Since: base-2.1
Instance details Defined in GHC.Base Methods empty :: Maybe a # (<\|>) :: Maybe a -> Maybe a -> Maybe a # some :: Maybe a -> Maybe [a] # many :: Maybe a -> Maybe [a] #
Alternative IO	Since: base-4.9.0.0
Instance details Defined in GHC.Base Methods empty :: IO a # (<\|>) :: IO a -> IO a -> IO a # some :: IO a -> IO [a] # many :: IO a -> IO [a] #
Alternative Concurrently
Instance details Defined in Control.Concurrent.Async Methods empty :: Concurrently a # (<\|>) :: Concurrently a -> Concurrently a -> Concurrently a # some :: Concurrently a -> Concurrently [a] # many :: Concurrently a -> Concurrently [a] #
Alternative Option	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods empty :: Option a # (<\|>) :: Option a -> Option a -> Option a # some :: Option a -> Option [a] # many :: Option a -> Option [a] #
Alternative ZipList	Since: base-4.11.0.0
Instance details Defined in Control.Applicative Methods empty :: ZipList a # (<\|>) :: ZipList a -> ZipList a -> ZipList a # some :: ZipList a -> ZipList [a] # many :: ZipList a -> ZipList [a] #
Alternative STM	Since: base-4.8.0.0
Instance details Defined in GHC.Conc.Sync Methods empty :: STM a # (<\|>) :: STM a -> STM a -> STM a # some :: STM a -> STM [a] # many :: STM a -> STM [a] #
Alternative ReadPrec	Since: base-4.6.0.0
Instance details Defined in Text.ParserCombinators.ReadPrec Methods empty :: ReadPrec a # (<\|>) :: ReadPrec a -> ReadPrec a -> ReadPrec a # some :: ReadPrec a -> ReadPrec [a] # many :: ReadPrec a -> ReadPrec [a] #
Alternative ReadP	Since: base-4.6.0.0
Instance details Defined in Text.ParserCombinators.ReadP Methods empty :: ReadP a # (<\|>) :: ReadP a -> ReadP a -> ReadP a # some :: ReadP a -> ReadP [a] # many :: ReadP a -> ReadP [a] #
Alternative Vector
Instance details Defined in Data.Vector Methods empty :: Vector a # (<\|>) :: Vector a -> Vector a -> Vector a # some :: Vector a -> Vector [a] # many :: Vector a -> Vector [a] #
Alternative Seq	Since: containers-0.5.4
Instance details Defined in Data.Sequence.Internal Methods empty :: Seq a # (<\|>) :: Seq a -> Seq a -> Seq a # some :: Seq a -> Seq [a] # many :: Seq a -> Seq [a] #
Alternative DList
Instance details Defined in Data.DList Methods empty :: DList a # (<\|>) :: DList a -> DList a -> DList a # some :: DList a -> DList [a] # many :: DList a -> DList [a] #
Alternative SmallArray
Instance details Defined in Data.Primitive.SmallArray Methods empty :: SmallArray a # (<\|>) :: SmallArray a -> SmallArray a -> SmallArray a # some :: SmallArray a -> SmallArray [a] # many :: SmallArray a -> SmallArray [a] #
Alternative Array
Instance details Defined in Data.Primitive.Array Methods empty :: Array a # (<\|>) :: Array a -> Array a -> Array a # some :: Array a -> Array [a] # many :: Array a -> Array [a] #
Alternative P	Since: base-4.5.0.0
Instance details Defined in Text.ParserCombinators.ReadP Methods empty :: P a # (<\|>) :: P a -> P a -> P a # some :: P a -> P [a] # many :: P a -> P [a] #
Alternative (U1 :: Type -> Type)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods empty :: U1 a # (<\|>) :: U1 a -> U1 a -> U1 a # some :: U1 a -> U1 [a] # many :: U1 a -> U1 [a] #
Alternative (Parser i)
Instance details Defined in Data.Attoparsec.Internal.Types Methods empty :: Parser i a # (<\|>) :: Parser i a -> Parser i a -> Parser i a # some :: Parser i a -> Parser i [a] # many :: Parser i a -> Parser i [a] #
MonadPlus m => Alternative (WrappedMonad m)	Since: base-2.1
Instance details Defined in Control.Applicative Methods empty :: WrappedMonad m a # (<\|>) :: WrappedMonad m a -> WrappedMonad m a -> WrappedMonad m a # some :: WrappedMonad m a -> WrappedMonad m [a] # many :: WrappedMonad m a -> WrappedMonad m [a] #
ArrowPlus a => Alternative (ArrowMonad a)	Since: base-4.6.0.0
Instance details Defined in Control.Arrow Methods empty :: ArrowMonad a a0 # (<\|>) :: ArrowMonad a a0 -> ArrowMonad a a0 -> ArrowMonad a a0 # some :: ArrowMonad a a0 -> ArrowMonad a [a0] # many :: ArrowMonad a a0 -> ArrowMonad a [a0] #
Alternative (Proxy :: Type -> Type)	Since: base-4.9.0.0
Instance details Defined in Data.Proxy Methods empty :: Proxy a # (<\|>) :: Proxy a -> Proxy a -> Proxy a # some :: Proxy a -> Proxy [a] # many :: Proxy a -> Proxy [a] #
MonadUnliftIO m => Alternative (Conc m)	Since: unliftio-0.2.9.0
Instance details Defined in UnliftIO.Internals.Async Methods empty :: Conc m a # (<\|>) :: Conc m a -> Conc m a -> Conc m a # some :: Conc m a -> Conc m [a] # many :: Conc m a -> Conc m [a] #
MonadUnliftIO m => Alternative (Concurrently m)	Composing two unlifted `Concurrently` values using `Alternative` is the equivalent to using a `race` combinator, the asynchrounous sub-routine that returns a value first is the one that gets it's value returned, the slowest sub-routine gets cancelled and it's thread is killed. Since: unliftio-0.1.0.0
Instance details 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] #
(Functor m, Monad m) => Alternative (MaybeT m)
Instance details Defined in Control.Monad.Trans.Maybe Methods empty :: MaybeT m a # (<\|>) :: MaybeT m a -> MaybeT m a -> MaybeT m a # some :: MaybeT m a -> MaybeT m [a] # many :: MaybeT m a -> MaybeT m [a] #
Alternative m => Alternative (ResourceT m)	Since 1.1.5
Instance details Defined in Control.Monad.Trans.Resource.Internal Methods empty :: ResourceT m a # (<\|>) :: ResourceT m a -> ResourceT m a -> ResourceT m a # some :: ResourceT m a -> ResourceT m [a] # many :: ResourceT m a -> ResourceT m [a] #
Alternative v => Alternative (Free v)	This violates the Alternative laws, handle with care.
Instance details Defined in Control.Monad.Free Methods empty :: Free v a # (<\|>) :: Free v a -> Free v a -> Free v a # some :: Free v a -> Free v [a] # many :: Free v a -> Free v [a] #
Alternative f => Alternative (Yoneda f)
Instance details Defined in Data.Functor.Yoneda Methods empty :: Yoneda f a # (<\|>) :: Yoneda f a -> Yoneda f a -> Yoneda f a # some :: Yoneda f a -> Yoneda f [a] # many :: Yoneda f a -> Yoneda f [a] #
Alternative (ReifiedFold s)
Instance details Defined in Control.Lens.Reified Methods empty :: ReifiedFold s a # (<\|>) :: ReifiedFold s a -> ReifiedFold s a -> ReifiedFold s a # some :: ReifiedFold s a -> ReifiedFold s [a] # many :: ReifiedFold s a -> ReifiedFold s [a] #
Applicative m => Alternative (ListT m)
Instance details Defined in Control.Monad.Trans.List Methods empty :: ListT m a # (<\|>) :: ListT m a -> ListT m a -> ListT m a # some :: ListT m a -> ListT m [a] # many :: ListT m a -> ListT m [a] #
Alternative f => Alternative (WrappedApplicative f)
Instance details Defined in Data.Functor.Bind.Class Methods empty :: WrappedApplicative f a # (<\|>) :: WrappedApplicative f a -> WrappedApplicative f a -> WrappedApplicative f a # some :: WrappedApplicative f a -> WrappedApplicative f [a] # many :: WrappedApplicative f a -> WrappedApplicative f [a] #
Alternative f => Alternative (Rec1 f)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods empty :: Rec1 f a # (<\|>) :: Rec1 f a -> Rec1 f a -> Rec1 f a # some :: Rec1 f a -> Rec1 f [a] # many :: Rec1 f a -> Rec1 f [a] #
(ArrowZero a, ArrowPlus a) => Alternative (WrappedArrow a b)	Since: base-2.1
Instance details Defined in Control.Applicative Methods empty :: WrappedArrow a b a0 # (<\|>) :: WrappedArrow a b a0 -> WrappedArrow a b a0 -> WrappedArrow a b a0 # some :: WrappedArrow a b a0 -> WrappedArrow a b [a0] # many :: WrappedArrow a b a0 -> WrappedArrow a b [a0] #
Alternative f => Alternative (Ap f)	Since: base-4.12.0.0
Instance details Defined in Data.Monoid Methods empty :: Ap f a # (<\|>) :: Ap f a -> Ap f a -> Ap f a # some :: Ap f a -> Ap f [a] # many :: Ap f a -> Ap f [a] #
Alternative f => Alternative (Alt f)	Since: base-4.8.0.0
Instance details Defined in Data.Semigroup.Internal Methods empty :: Alt f a # (<\|>) :: Alt f a -> Alt f a -> Alt f a # some :: Alt f a -> Alt f [a] # many :: Alt f a -> Alt f [a] #
Alternative m => Alternative (ReaderT r m)
Instance details Defined in Control.Monad.Trans.Reader Methods empty :: ReaderT r m a # (<\|>) :: ReaderT r m a -> ReaderT r m a -> ReaderT r m a # some :: ReaderT r m a -> ReaderT r m [a] # many :: ReaderT r m a -> ReaderT r m [a] #
Alternative m => Alternative (IdentityT m)
Instance details Defined in Control.Monad.Trans.Identity Methods empty :: IdentityT m a # (<\|>) :: IdentityT m a -> IdentityT m a -> IdentityT m a # some :: IdentityT m a -> IdentityT m [a] # many :: IdentityT m a -> IdentityT m [a] #
(Monoid w, Alternative m) => Alternative (WriterT w m)
Instance details Defined in Control.Monad.Trans.Writer.Strict Methods empty :: WriterT w m a # (<\|>) :: WriterT w m a -> WriterT w m a -> WriterT w m a # some :: WriterT w m a -> WriterT w m [a] # many :: WriterT w m a -> WriterT w m [a] #
(Monoid w, Alternative m) => Alternative (WriterT w m)
Instance details Defined in Control.Monad.Trans.Writer.Lazy Methods empty :: WriterT w m a # (<\|>) :: WriterT w m a -> WriterT w m a -> WriterT w m a # some :: WriterT w m a -> WriterT w m [a] # many :: WriterT w m a -> WriterT w m [a] #
(Functor m, MonadPlus m) => Alternative (StateT s m)
Instance details Defined in Control.Monad.Trans.State.Strict Methods empty :: StateT s m a # (<\|>) :: StateT s m a -> StateT s m a -> StateT s m a # some :: StateT s m a -> StateT s m [a] # many :: StateT s m a -> StateT s m [a] #
(Functor m, MonadPlus m) => Alternative (StateT s m)
Instance details Defined in Control.Monad.Trans.State.Lazy Methods empty :: StateT s m a # (<\|>) :: StateT s m a -> StateT s m a -> StateT s m a # some :: StateT s m a -> StateT s m [a] # many :: StateT s m a -> StateT s m [a] #
(Functor f, MonadPlus m) => Alternative (FreeT f m)
Instance details Defined in Control.Monad.Trans.Free Methods empty :: FreeT f m a # (<\|>) :: FreeT f m a -> FreeT f m a -> FreeT f m a # some :: FreeT f m a -> FreeT f m [a] # many :: FreeT f m a -> FreeT f m [a] #
(Functor m, Monad m, Error e) => Alternative (ErrorT e m)
Instance details Defined in Control.Monad.Trans.Error Methods empty :: ErrorT e m a # (<\|>) :: ErrorT e m a -> ErrorT e m a -> ErrorT e m a # some :: ErrorT e m a -> ErrorT e m [a] # many :: ErrorT e m a -> ErrorT e m [a] #
(Alternative f, Alternative g) => Alternative (f :*: g)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods empty :: (f :: g) a # (<\|>) :: (f :: g) a -> (f :: g) a -> (f :: g) a # some :: (f :: g) a -> (f :: g) [a] # many :: (f :: g) a -> (f :: g) [a] #
(Alternative f, Alternative g) => Alternative (Product f g)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Product Methods empty :: Product f g a # (<\|>) :: Product f g a -> Product f g a -> Product f g a # some :: Product f g a -> Product f g [a] # many :: Product f g a -> Product f g [a] #
Alternative f => Alternative (M1 i c f)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods empty :: M1 i c f a # (<\|>) :: M1 i c f a -> M1 i c f a -> M1 i c f a # some :: M1 i c f a -> M1 i c f [a] # many :: M1 i c f a -> M1 i c f [a] #
(Alternative f, Applicative g) => Alternative (f :.: g)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods empty :: (f :.: g) a # (<\|>) :: (f :.: g) a -> (f :.: g) a -> (f :.: g) a # some :: (f :.: g) a -> (f :.: g) [a] # many :: (f :.: g) a -> (f :.: g) [a] #
(Alternative f, Applicative g) => Alternative (Compose f g)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Compose Methods empty :: Compose f g a # (<\|>) :: Compose f g a -> Compose f g a -> Compose f g a # some :: Compose f g a -> Compose f g [a] # many :: Compose f g a -> Compose f g [a] #
(Monoid w, Functor m, MonadPlus m) => Alternative (RWST r w s m)
Instance details Defined in Control.Monad.Trans.RWS.Strict Methods empty :: RWST r w s m a # (<\|>) :: RWST r w s m a -> RWST r w s m a -> RWST r w s m a # some :: RWST r w s m a -> RWST r w s m [a] # many :: RWST r w s m a -> RWST r w s m [a] #
(Monoid w, Functor m, MonadPlus m) => Alternative (RWST r w s m)
Instance details Defined in Control.Monad.Trans.RWS.Lazy Methods empty :: RWST r w s m a # (<\|>) :: RWST r w s m a -> RWST r w s m a -> RWST r w s m a # some :: RWST r w s m a -> RWST r w s m [a] # many :: RWST r w s m a -> RWST r w s m [a] #

(=<<) :: 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.

liftM :: Monad m => (a1 -> r) -> m a1 -> m r #

Promote a function to a monad.

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

ap :: Monad m => m (a -> b) -> m a -> m b #

In many situations, the liftM operations can be replaced by uses of ap, which promotes function application.

return f `ap` x1 `ap` ... `ap` xn

is equivalent to

liftMn f x1 x2 ... xn

const :: a -> b -> a #

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 f takes its (first) two arguments in the reverse order of f.

>>> 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 f yields the result of applying f until p holds.

asTypeOf :: a -> a -> a #

asTypeOf 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 second.

subtract :: Num a => a -> a -> a #

the same as flip (-).

Because - is treated specially in the Haskell grammar, (- e) is not a section, but an application of prefix negation. However, (subtract exp) is equivalent to the disallowed section.

curry :: ((a, b) -> c) -> a -> b -> c #

curry converts an uncurried function to a curried function.

Examples

Expand

>>> curry fst 1 2
1

uncurry :: (a -> b -> c) -> (a, b) -> c #

uncurry converts a curried function to a function on pairs.

Examples

Expand

>>> 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

Expand

Basic usage:

>>> maybe False odd (Just 3)
True

>>> maybe False odd Nothing
False

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
""

isJust :: Maybe a -> Bool #

The isJust function returns True iff its argument is of the form Just _.

Examples

Expand

Basic usage:

>>> isJust (Just 3)
True

>>> isJust (Just ())
True

>>> isJust Nothing
False

Only the outer constructor is taken into consideration:

>>> isJust (Just Nothing)
True

isNothing :: Maybe a -> Bool #

The isNothing function returns True iff its argument is Nothing.

Examples

Expand

Basic usage:

>>> isNothing (Just 3)
False

>>> isNothing (Just ())
False

>>> isNothing Nothing
True

Only the outer constructor is taken into consideration:

>>> isNothing (Just Nothing)
False

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

Expand

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

Expand

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 a where a is the first element of the list.

Examples

Expand

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 b. If this is Nothing, no element is added on to the result list. If it is Just b, then b is included in the result list.

Examples

Expand

Using mapMaybe f x is a shortcut for catMaybes $ map f x in most cases:

>>> 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]

repeat :: a -> [a] #

repeat x is an infinite list, with x the value of every element.

even :: Integral a => a -> Bool #

odd :: Integral a => a -> Bool #

(^) :: (Num a, Integral b) => a -> b -> a infixr 8 #

raise a number to a non-negative integral power

(^^) :: (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

Expand

Convert from a Maybe Int to a Maybe String using show:

>>> show <$> Nothing
Nothing
>>> show <$> Just 3
Just "3"

Convert from an Either Int Int to an Either Int String using show:

>>> show <$> Left 17
Left 17
>>> show <$> Right 17
Right "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 value discards or ignores the result of evaluation, such as the return value of an IO action.

Examples

Expand

Replace the contents of a Maybe Int with unit:

>>> void Nothing
Nothing
>>> void (Just 3)
Just ()

Replace the contents of an Either Int Int with unit, resulting in an Either 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 a, apply the first function to a; if it is Right b, apply the second function to b.

Examples

Expand

We create two values of type Either String Int, one using the Left 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) s
3
>>> either length (*2) n
6

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)

type FilePath = String #

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.

ioError :: IOError -> IO a #

Raise an IOException in the IO monad.

optional :: Alternative f => f a -> f (Maybe a) #

One or none.

for :: (Traversable t, Applicative f) => t a -> (a -> f b) -> f (t b) #

for is traverse with its arguments flipped. For a version that ignores the results see for_.

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.

Minimal complete definition

(ask | reader), local

Methods

ask :: m r #

Retrieves the monad environment.

Instances

MonadReader r m => MonadReader r (ResourceT m)
Instance details Defined in Control.Monad.Trans.Resource.Internal Methods ask :: ResourceT m r # local :: (r -> r) -> ResourceT m a -> ResourceT m a # reader :: (r -> a) -> ResourceT m a #
(Functor m, MonadReader e m) => MonadReader e (Free m)
Instance details Defined in Control.Monad.Free Methods ask :: Free m e # local :: (e -> e) -> Free m a -> Free m a # reader :: (e -> a) -> Free m a #
MonadReader r m => MonadReader r (MaybeT m)
Instance details Defined in Control.Monad.Reader.Class Methods ask :: MaybeT m r # local :: (r -> r) -> MaybeT m a -> MaybeT m a # reader :: (r -> a) -> MaybeT m a #
MonadReader r m => MonadReader r (ListT m)
Instance details Defined in Control.Monad.Reader.Class Methods ask :: ListT m r # local :: (r -> r) -> ListT m a -> ListT m a # reader :: (r -> a) -> ListT m a #
MonadReader s (ReifiedGetter s)
Instance details Defined in Control.Lens.Reified Methods ask :: ReifiedGetter s s # local :: (s -> s) -> ReifiedGetter s a -> ReifiedGetter s a # reader :: (s -> a) -> ReifiedGetter s a #
MonadReader s (ReifiedFold s)
Instance details Defined in Control.Lens.Reified Methods ask :: ReifiedFold s s # local :: (s -> s) -> ReifiedFold s a -> ReifiedFold s a # reader :: (s -> a) -> ReifiedFold s a #
(Representable f, Rep f ~ a) => MonadReader a (Co f)
Instance details Defined in Data.Functor.Rep Methods ask :: Co f a # local :: (a -> a) -> Co f a0 -> Co f a0 # reader :: (a -> a0) -> Co f a0 #
(Functor f, MonadReader r m) => MonadReader r (FreeT f m)
Instance details Defined in Control.Monad.Trans.Free Methods ask :: FreeT f m r # local :: (r -> r) -> FreeT f m a -> FreeT f m a # reader :: (r -> a) -> FreeT f m a #
(Monoid w, MonadReader r m) => MonadReader r (WriterT w m)
Instance details Defined in Control.Monad.Reader.Class Methods ask :: WriterT w m r # local :: (r -> r) -> WriterT w m a -> WriterT w m a # reader :: (r -> a) -> WriterT w m a #
(Monoid w, MonadReader r m) => MonadReader r (WriterT w m)
Instance details Defined in Control.Monad.Reader.Class Methods ask :: WriterT w m r # local :: (r -> r) -> WriterT w m a -> WriterT w m a # reader :: (r -> a) -> WriterT w m a #
MonadReader r m => MonadReader r (StateT s m)
Instance details Defined in Control.Monad.Reader.Class Methods ask :: StateT s m r # local :: (r -> r) -> StateT s m a -> StateT s m a # reader :: (r -> a) -> StateT s m a #
MonadReader r m => MonadReader r (StateT s m)
Instance details Defined in Control.Monad.Reader.Class Methods ask :: StateT s m r # local :: (r -> r) -> StateT s m a -> StateT s m a # reader :: (r -> a) -> StateT s m a #
Monad m => MonadReader r (ReaderT r m)
Instance details Defined in Control.Monad.Reader.Class Methods ask :: ReaderT r m r # local :: (r -> r) -> ReaderT r m a -> ReaderT r m a # reader :: (r -> a) -> ReaderT r m a #
MonadReader r m => MonadReader r (IdentityT m)
Instance details Defined in Control.Monad.Reader.Class Methods ask :: IdentityT m r # local :: (r -> r) -> IdentityT m a -> IdentityT m a # reader :: (r -> a) -> IdentityT m a #
MonadReader r m => MonadReader r (ExceptT e m)	Since: mtl-2.2
Instance details Defined in Control.Monad.Reader.Class Methods ask :: ExceptT e m r # local :: (r -> r) -> ExceptT e m a -> ExceptT e m a # reader :: (r -> a) -> ExceptT e m a #
(Error e, MonadReader r m) => MonadReader r (ErrorT e m)
Instance details Defined in Control.Monad.Reader.Class Methods ask :: ErrorT e m r # local :: (r -> r) -> ErrorT e m a -> ErrorT e m a # reader :: (r -> a) -> ErrorT e m a #
MonadReader r m => MonadReader r (ConduitT i o m)
Instance details Defined in Data.Conduit.Internal.Conduit Methods ask :: ConduitT i o m r # local :: (r -> r) -> ConduitT i o m a -> ConduitT i o m a # reader :: (r -> a) -> ConduitT i o m a #
MonadReader r ((->) r :: Type -> Type)
Instance details Defined in Control.Monad.Reader.Class Methods ask :: r -> r # local :: (r -> r) -> (r -> a) -> r -> a # reader :: (r -> a) -> r -> a #
MonadReader r' m => MonadReader r' (ContT r m)
Instance details Defined in Control.Monad.Reader.Class Methods ask :: ContT r m r' # local :: (r' -> r') -> ContT r m a -> ContT r m a # reader :: (r' -> a) -> ContT r m a #
(Monad m, Monoid w) => MonadReader r (RWST r w s m)
Instance details Defined in Control.Monad.Reader.Class Methods ask :: RWST r w s m r # local :: (r -> r) -> RWST r w s m a -> RWST r w s m a # reader :: (r -> a) -> RWST r w s m a #
(Monad m, Monoid w) => MonadReader r (RWST r w s m)
Instance details Defined in Control.Monad.Reader.Class Methods ask :: RWST r w s m r # local :: (r -> r) -> RWST r w s m a -> RWST r w s m a # reader :: (r -> a) -> RWST r w s m a #
MonadReader r m => MonadReader r (Pipe l i o u m)
Instance details Defined in Data.Conduit.Internal.Pipe Methods ask :: Pipe l i o u m r # local :: (r -> r) -> Pipe l i o u m a -> Pipe l i o u m a # reader :: (r -> a) -> Pipe l i o u m a #

class Hashable a where #

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 the hashWithSalt method 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 the hashWithSalt method 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 hashWithSalt must make use of the salt in its implementation.

hash :: a -> Int #

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

Hashable Bool
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Bool -> Int # hash :: Bool -> Int #
Hashable Char
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Char -> Int # hash :: Char -> Int #
Hashable Double
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Double -> Int # hash :: Double -> Int #
Hashable Float
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Float -> Int # hash :: Float -> Int #
Hashable Int
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Int -> Int # hash :: Int -> Int #
Hashable Int8
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Int8 -> Int # hash :: Int8 -> Int #
Hashable Int16
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Int16 -> Int # hash :: Int16 -> Int #
Hashable Int32
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Int32 -> Int # hash :: Int32 -> Int #
Hashable Int64
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Int64 -> Int # hash :: Int64 -> Int #
Hashable Integer
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Integer -> Int # hash :: Integer -> Int #
Hashable Natural
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Natural -> Int # hash :: Natural -> Int #
Hashable Ordering
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Ordering -> Int # hash :: Ordering -> Int #
Hashable Word
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Word -> Int # hash :: Word -> Int #
Hashable Word8
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Word8 -> Int # hash :: Word8 -> Int #
Hashable Word16
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Word16 -> Int # hash :: Word16 -> Int #
Hashable Word32
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Word32 -> Int # hash :: Word32 -> Int #
Hashable Word64
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Word64 -> Int # hash :: Word64 -> Int #
Hashable SomeTypeRep
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> SomeTypeRep -> Int # hash :: SomeTypeRep -> Int #
Hashable ()
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> () -> Int # hash :: () -> Int #
Hashable Version
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Version -> Int # hash :: Version -> Int #
Hashable ByteString
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> ByteString -> Int # hash :: ByteString -> Int #
Hashable ShortByteString
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> ShortByteString -> Int # hash :: ShortByteString -> Int #
Hashable ByteString
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> ByteString -> Int # hash :: ByteString -> Int #
Hashable Text
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Text -> Int # hash :: Text -> Int #
Hashable ThreadId
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> ThreadId -> Int # hash :: ThreadId -> Int #
Hashable Text
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Text -> Int # hash :: Text -> Int #
Hashable BigNat
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> BigNat -> Int # hash :: BigNat -> Int #
Hashable Void
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Void -> Int # hash :: Void -> Int #
Hashable Unique
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Unique -> Int # hash :: Unique -> Int #
Hashable WordPtr
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> WordPtr -> Int # hash :: WordPtr -> Int #
Hashable IntPtr
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> IntPtr -> Int # hash :: IntPtr -> Int #
Hashable a => Hashable [a]
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> [a] -> Int # hash :: [a] -> Int #
Hashable a => Hashable (Maybe a)
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Maybe a -> Int # hash :: Maybe a -> Int #
Hashable a => Hashable (Ratio a)
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Ratio a -> Int # hash :: Ratio a -> Int #
Hashable (Ptr a)
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Ptr a -> Int # hash :: Ptr a -> Int #
Hashable (FunPtr a)
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> FunPtr a -> Int # hash :: FunPtr a -> Int #
Hashable a => Hashable (Last a)
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Last a -> Int # hash :: Last a -> Int #
Hashable (Async a)
Instance details Defined in Control.Concurrent.Async Methods hashWithSalt :: Int -> Async a -> Int # hash :: Async a -> Int #
Hashable a => Hashable (Complex a)
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Complex a -> Int # hash :: Complex a -> Int #
Hashable (Fixed a)
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Fixed a -> Int # hash :: Fixed a -> Int #
Hashable a => Hashable (Min a)
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Min a -> Int # hash :: Min a -> Int #
Hashable a => Hashable (Max a)
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Max a -> Int # hash :: Max a -> Int #
Hashable a => Hashable (First a)
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> First a -> Int # hash :: First a -> Int #
Hashable a => Hashable (WrappedMonoid a)
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> WrappedMonoid a -> Int # hash :: WrappedMonoid a -> Int #
Hashable a => Hashable (Option a)
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Option a -> Int # hash :: Option a -> Int #
Hashable (StableName a)
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> StableName a -> Int # hash :: StableName a -> Int #
Hashable a => Hashable (Identity a)
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Identity a -> Int # hash :: Identity a -> Int #
Hashable a => Hashable (NonEmpty a)
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> NonEmpty a -> Int # hash :: NonEmpty a -> Int #
Hashable a => Hashable (HashSet a)
Instance details Defined in Data.HashSet Methods hashWithSalt :: Int -> HashSet a -> Int # hash :: HashSet a -> Int #
Hashable (Hashed a)
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Hashed a -> Int # hash :: Hashed a -> Int #
(Hashable a, Hashable b) => Hashable (Either a b)
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Either a b -> Int # hash :: Either a b -> Int #
Hashable (TypeRep a)
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> TypeRep a -> Int # hash :: TypeRep a -> Int #
(Hashable a1, Hashable a2) => Hashable (a1, a2)
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> (a1, a2) -> Int # hash :: (a1, a2) -> Int #
(Hashable k, Hashable v) => Hashable (HashMap k v)
Instance details Defined in Data.HashMap.Base Methods hashWithSalt :: Int -> HashMap k v -> Int # hash :: HashMap k v -> Int #
(Hashable a, Hashable b) => Hashable (Arg a b)
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Arg a b -> Int # hash :: Arg a b -> Int #
Hashable (Proxy a)
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Proxy a -> Int # hash :: Proxy a -> Int #
(Hashable a1, Hashable a2, Hashable a3) => Hashable (a1, a2, a3)
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> (a1, a2, a3) -> Int # hash :: (a1, a2, a3) -> Int #
Hashable a => Hashable (Const a b)
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Const a b -> Int # hash :: Const a b -> Int #
(Hashable a1, Hashable a2, Hashable a3, Hashable a4) => Hashable (a1, a2, a3, a4)
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> (a1, a2, a3, a4) -> Int # hash :: (a1, a2, a3, a4) -> Int #
(Hashable1 f, Hashable1 g, Hashable a) => Hashable (Product f g a)
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Product f g a -> Int # hash :: Product f g a -> Int #
(Hashable1 f, Hashable1 g, Hashable a) => Hashable (Sum f g a)
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Sum f g a -> Int # hash :: Sum f g a -> Int #
(Hashable a1, Hashable a2, Hashable a3, Hashable a4, Hashable a5) => Hashable (a1, a2, a3, a4, a5)
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> (a1, a2, a3, a4, a5) -> Int # hash :: (a1, a2, a3, a4, a5) -> Int #
(Hashable1 f, Hashable1 g, Hashable a) => Hashable (Compose f g a)	In general, `hash (Compose x) ≠ hash x`. However, `hashWithSalt` satisfies its variant of this equivalence.
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Compose f g a -> Int # hash :: Compose f g a -> Int #
(Hashable a1, Hashable a2, Hashable a3, Hashable a4, Hashable a5, Hashable a6) => Hashable (a1, a2, a3, a4, a5, a6)
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> (a1, a2, a3, a4, a5, a6) -> Int # hash :: (a1, a2, a3, a4, a5, a6) -> Int #
(Hashable a1, Hashable a2, Hashable a3, Hashable a4, Hashable a5, Hashable a6, Hashable a7) => Hashable (a1, a2, a3, a4, a5, a6, a7)
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> (a1, a2, a3, a4, a5, a6, a7) -> Int # hash :: (a1, a2, a3, a4, a5, a6, a7) -> Int #

data Text #

A space efficient, packed, unboxed Unicode text type.

Instances

Hashable Text
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Text -> Int # hash :: Text -> Int #
Chunk Text
Instance details Defined in Data.Attoparsec.Internal.Types Associated Types type ChunkElem Text :: Type # Methods nullChunk :: Text -> Bool # pappendChunk :: State Text -> Text -> State Text # atBufferEnd :: Text -> State Text -> Pos # bufferElemAt :: Text -> Pos -> State Text -> Maybe (ChunkElem Text, Int) # chunkElemToChar :: Text -> ChunkElem Text -> Char #
GrowingAppend Text
Instance details Defined in Data.MonoTraversable
MonoPointed Text
Instance details Defined in Data.MonoTraversable Methods opoint :: Element Text -> Text #
MonoTraversable Text
Instance details Defined in Data.MonoTraversable Methods otraverse :: Applicative f => (Element Text -> f (Element Text)) -> Text -> f Text # omapM :: Applicative m => (Element Text -> m (Element Text)) -> Text -> m Text #
MonoFoldable Text
Instance details Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element Text -> m) -> Text -> m # ofoldr :: (Element Text -> b -> b) -> b -> Text -> b # ofoldl' :: (a -> Element Text -> a) -> a -> Text -> a # otoList :: Text -> [Element Text] # oall :: (Element Text -> Bool) -> Text -> Bool # oany :: (Element Text -> Bool) -> Text -> Bool # onull :: Text -> Bool # olength :: Text -> Int # olength64 :: Text -> Int64 # ocompareLength :: Integral i => Text -> i -> Ordering # otraverse_ :: Applicative f => (Element Text -> f b) -> Text -> f () # ofor_ :: Applicative f => Text -> (Element Text -> f b) -> f () # omapM_ :: Applicative m => (Element Text -> m ()) -> Text -> m () # oforM_ :: Applicative m => Text -> (Element Text -> m ()) -> m () # ofoldlM :: Monad m => (a -> Element Text -> m a) -> a -> Text -> m a # ofoldMap1Ex :: Semigroup m => (Element Text -> m) -> Text -> m # ofoldr1Ex :: (Element Text -> Element Text -> Element Text) -> Text -> Element Text # ofoldl1Ex' :: (Element Text -> Element Text -> Element Text) -> Text -> Element Text # headEx :: Text -> Element Text # lastEx :: Text -> Element Text # unsafeHead :: Text -> Element Text # unsafeLast :: Text -> Element Text # maximumByEx :: (Element Text -> Element Text -> Ordering) -> Text -> Element Text # minimumByEx :: (Element Text -> Element Text -> Ordering) -> Text -> Element Text # oelem :: Element Text -> Text -> Bool # onotElem :: Element Text -> Text -> Bool #
MonoFunctor Text
Instance details Defined in Data.MonoTraversable Methods omap :: (Element Text -> Element Text) -> Text -> Text #
MonoZip Text
Instance details Defined in Data.Containers Methods ozipWith :: (Element Text -> Element Text -> Element Text) -> Text -> Text -> Text # ozip :: Text -> Text -> [(Element Text, Element Text)] # ounzip :: [(Element Text, Element Text)] -> (Text, Text) #
Textual Text
Instance details Defined in Data.Sequences Methods words :: Text -> [Text] # unwords :: (Element seq ~ Text, MonoFoldable seq) => seq -> Text # lines :: Text -> [Text] # unlines :: (Element seq ~ Text, MonoFoldable seq) => seq -> Text # toLower :: Text -> Text # toUpper :: Text -> Text # toCaseFold :: Text -> Text # breakWord :: Text -> (Text, Text) # breakLine :: Text -> (Text, Text) #
IsSequence Text
Instance details Defined in Data.Sequences Methods fromList :: [Element Text] -> Text # lengthIndex :: Text -> Index Text # break :: (Element Text -> Bool) -> Text -> (Text, Text) # span :: (Element Text -> Bool) -> Text -> (Text, Text) # dropWhile :: (Element Text -> Bool) -> Text -> Text # takeWhile :: (Element Text -> Bool) -> Text -> Text # splitAt :: Index Text -> Text -> (Text, Text) # unsafeSplitAt :: Index Text -> Text -> (Text, Text) # take :: Index Text -> Text -> Text # unsafeTake :: Index Text -> Text -> Text # drop :: Index Text -> Text -> Text # unsafeDrop :: Index Text -> Text -> Text # dropEnd :: Index Text -> Text -> Text # partition :: (Element Text -> Bool) -> Text -> (Text, Text) # uncons :: Text -> Maybe (Element Text, Text) # unsnoc :: Text -> Maybe (Text, Element Text) # filter :: (Element Text -> Bool) -> Text -> Text # filterM :: Monad m => (Element Text -> m Bool) -> Text -> m Text # replicate :: Index Text -> Element Text -> Text # replicateM :: Monad m => Index Text -> m (Element Text) -> m Text # groupBy :: (Element Text -> Element Text -> Bool) -> Text -> [Text] # groupAllOn :: Eq b => (Element Text -> b) -> Text -> [Text] # subsequences :: Text -> [Text] # permutations :: Text -> [Text] # tailEx :: Text -> Text # tailMay :: Text -> Maybe Text # initEx :: Text -> Text # initMay :: Text -> Maybe Text # unsafeTail :: Text -> Text # unsafeInit :: Text -> Text # index :: Text -> Index Text -> Maybe (Element Text) # indexEx :: Text -> Index Text -> Element Text # unsafeIndex :: Text -> Index Text -> Element Text # splitWhen :: (Element Text -> Bool) -> Text -> [Text] #
SemiSequence Text
Instance details Defined in Data.Sequences Associated Types type Index Text :: Type # Methods intersperse :: Element Text -> Text -> Text # reverse :: Text -> Text # find :: (Element Text -> Bool) -> Text -> Maybe (Element Text) # sortBy :: (Element Text -> Element Text -> Ordering) -> Text -> Text # cons :: Element Text -> Text -> Text # snoc :: Text -> Element Text -> Text #
Ixed Text
Instance details Defined in Control.Lens.At Methods ix :: Index Text -> Traversal' Text (IxValue Text) #
ToBuilder Text Builder
Instance details Defined in Data.Builder Methods toBuilder :: Text -> Builder #
ToBuilder Text Builder
Instance details Defined in Data.Builder Methods toBuilder :: Text -> Builder #
Utf8 Text ByteString
Instance details Defined in Data.Sequences Methods encodeUtf8 :: Text -> ByteString # decodeUtf8 :: ByteString -> Text #
LazySequence Text Text
Instance details Defined in Data.Sequences Methods toChunks :: Text -> [Text0] # fromChunks :: [Text0] -> Text # toStrict :: Text -> Text0 # fromStrict :: Text0 -> Text #
Strict Text Text
Instance details Defined in Control.Lens.Iso Methods strict :: Iso' Text Text0 #
IsGValue (Maybe Text)
Instance details Defined in Data.GI.Base.GValue Methods toGValue :: Maybe Text -> IO GValue # fromGValue :: GValue -> IO (Maybe Text) #
type State Text
Instance details Defined in Data.Attoparsec.Internal.Types type State Text = Buffer
type ChunkElem Text
Instance details Defined in Data.Attoparsec.Internal.Types type ChunkElem Text = Char
type Item Text
Instance details Defined in Data.Text type Item Text = Char
type Element Text
Instance details Defined in Data.MonoTraversable type Element Text = Char
type Index Text
Instance details Defined in Data.Sequences type Index Text = Int
type Index Text
Instance details Defined in Control.Lens.At type Index Text = Int
type IxValue Text
Instance details Defined in Control.Lens.At type IxValue Text = Char

data UTCTime #

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 utctDay :: Day the day utctDayTime :: DiffTime the time from midnight, 0 <= t < 86401s (because of leap-seconds)

Instances

Eq UTCTime
Instance details Defined in Data.Time.Clock.Internal.UTCTime Methods (==) :: UTCTime -> UTCTime -> Bool # (/=) :: UTCTime -> UTCTime -> Bool #
Data UTCTime
Instance details 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
Instance details Defined in Data.Time.Clock.Internal.UTCTime Methods compare :: UTCTime -> UTCTime -> Ordering # (<) :: UTCTime -> UTCTime -> Bool # (<=) :: UTCTime -> UTCTime -> Bool # (>) :: UTCTime -> UTCTime -> Bool # (>=) :: UTCTime -> UTCTime -> Bool # max :: UTCTime -> UTCTime -> UTCTime # min :: UTCTime -> UTCTime -> UTCTime #
NFData UTCTime
Instance details Defined in Data.Time.Clock.Internal.UTCTime Methods rnf :: UTCTime -> () #
FormatTime UTCTime
Instance details Defined in Data.Time.Format Methods formatCharacter :: Char -> Maybe (TimeLocale -> Maybe NumericPadOption -> Maybe Int -> UTCTime -> String) #
ParseTime UTCTime
Instance details Defined in Data.Time.Format.Parse Methods buildTime :: TimeLocale -> [(Char, String)] -> Maybe UTCTime #

data HashMap k v #

A map from keys to values. A map cannot contain duplicate keys; each key can map to at most one value.

Instances

Eq2 HashMap
Instance details Defined in Data.HashMap.Base Methods liftEq2 :: (a -> b -> Bool) -> (c -> d -> Bool) -> HashMap a c -> HashMap b d -> Bool #
Ord2 HashMap
Instance details Defined in Data.HashMap.Base Methods liftCompare2 :: (a -> b -> Ordering) -> (c -> d -> Ordering) -> HashMap a c -> HashMap b d -> Ordering #
Show2 HashMap
Instance details Defined in Data.HashMap.Base Methods liftShowsPrec2 :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> (Int -> b -> ShowS) -> ([b] -> ShowS) -> Int -> HashMap a b -> ShowS # liftShowList2 :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> (Int -> b -> ShowS) -> ([b] -> ShowS) -> [HashMap a b] -> ShowS #
BiPolyMap HashMap
Instance details 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
Instance details Defined in Data.HashMap.Base Methods liftHashWithSalt2 :: (Int -> a -> Int) -> (Int -> b -> Int) -> Int -> HashMap a b -> Int #
FunctorWithIndex k (HashMap k)
Instance details Defined in Control.Lens.Indexed Methods imap :: (k -> a -> b) -> HashMap k a -> HashMap k b # imapped :: IndexedSetter k (HashMap k a) (HashMap k b) a b #
FoldableWithIndex k (HashMap k)
Instance details Defined in Control.Lens.Indexed Methods ifoldMap :: Monoid m => (k -> a -> m) -> HashMap k a -> m # ifolded :: IndexedFold k (HashMap k a) a # ifoldr :: (k -> a -> b -> b) -> b -> HashMap k a -> b # ifoldl :: (k -> b -> a -> b) -> b -> HashMap k a -> b # ifoldr' :: (k -> a -> b -> b) -> b -> HashMap k a -> b # ifoldl' :: (k -> b -> a -> b) -> b -> HashMap k a -> b #
TraversableWithIndex k (HashMap k)
Instance details 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)
Instance details Defined in Data.HashMap.Base Methods fmap :: (a -> b) -> HashMap k a -> HashMap k b # (<$) :: a -> HashMap k b -> HashMap k a #
Foldable (HashMap k)
Instance details 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] # null :: HashMap k a -> Bool # 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 # sum :: Num a => HashMap k a -> a # product :: Num a => HashMap k a -> a #
Traversable (HashMap k)
Instance details Defined in Data.HashMap.Base Methods traverse :: Applicative f => (a -> f b) -> HashMap k a -> f (HashMap k b) # sequenceA :: Applicative f => HashMap k (f a) -> f (HashMap k a) # mapM :: Monad m => (a -> m b) -> HashMap k a -> m (HashMap k b) # sequence :: Monad m => HashMap k (m a) -> m (HashMap k a) #
Eq k => Eq1 (HashMap k)
Instance details Defined in Data.HashMap.Base Methods liftEq :: (a -> b -> Bool) -> HashMap k a -> HashMap k b -> Bool #
Ord k => Ord1 (HashMap k)
Instance details Defined in Data.HashMap.Base Methods liftCompare :: (a -> b -> Ordering) -> HashMap k a -> HashMap k b -> Ordering #
(Eq k, Hashable k, Read k) => Read1 (HashMap k)
Instance details Defined in Data.HashMap.Base Methods liftReadsPrec :: (Int -> ReadS a) -> ReadS [a] -> Int -> ReadS (HashMap k a) # liftReadList :: (Int -> ReadS a) -> ReadS [a] -> ReadS [HashMap k a] # liftReadPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec (HashMap k a) # liftReadListPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec [HashMap k a] #
Show k => Show1 (HashMap k)
Instance details Defined in Data.HashMap.Base Methods liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> HashMap k a -> ShowS # liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [HashMap k a] -> ShowS #
(Eq key, Hashable key) => PolyMap (HashMap key)	This instance uses the functions from Data.HashMap.Strict.
Instance details 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)
Instance details Defined in Data.HashMap.Base Methods liftHashWithSalt :: (Int -> a -> Int) -> Int -> HashMap k a -> Int #
Keyed (HashMap k)
Instance details Defined in Data.Key Methods mapWithKey :: (Key (HashMap k) -> a -> b) -> HashMap k a -> HashMap k b #
(Eq k, Hashable k) => Zip (HashMap k)
Instance details Defined in Data.Key Methods zipWith :: (a -> b -> c) -> HashMap k a -> HashMap k b -> HashMap k c # zip :: HashMap k a -> HashMap k b -> HashMap k (a, b) # zap :: HashMap k (a -> b) -> HashMap k a -> HashMap k b #
(Eq k, Hashable k) => ZipWithKey (HashMap k)
Instance details Defined in Data.Key Methods zipWithKey :: (Key (HashMap k) -> a -> b -> c) -> HashMap k a -> HashMap k b -> HashMap k c # zapWithKey :: HashMap k (Key (HashMap k) -> a -> b) -> HashMap k a -> HashMap k b #
(Eq k, Hashable k) => Indexable (HashMap k)
Instance details Defined in Data.Key Methods index :: HashMap k a -> Key (HashMap k) -> a #
(Eq k, Hashable k) => Lookup (HashMap k)
Instance details Defined in Data.Key Methods lookup :: Key (HashMap k) -> HashMap k a -> Maybe a #
FoldableWithKey (HashMap k)
Instance details Defined in Data.Key Methods toKeyedList :: HashMap k a -> [(Key (HashMap k), a)] # foldMapWithKey :: Monoid m => (Key (HashMap k) -> a -> m) -> HashMap k a -> m # foldrWithKey :: (Key (HashMap k) -> a -> b -> b) -> b -> HashMap k a -> b # foldlWithKey :: (b -> Key (HashMap k) -> a -> b) -> b -> HashMap k a -> b #
TraversableWithKey (HashMap k)
Instance details 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 `HashMap` is not `Applicative`, but it is an instance of `Apply`
Instance details Defined in Data.Functor.Bind.Class Methods (<.>) :: HashMap k (a -> b) -> HashMap k a -> HashMap k b # (.>) :: HashMap k a -> HashMap k b -> HashMap k b # (<.) :: HashMap k a -> HashMap k b -> HashMap k a # liftF2 :: (a -> b -> c) -> HashMap k a -> HashMap k b -> HashMap k c #
(Hashable k, Eq k) => Bind (HashMap k)	A `HashMap` is not a `Monad`, but it is an instance of `Bind`
Instance details Defined in Data.Functor.Bind.Class Methods (>>-) :: HashMap k a -> (a -> HashMap k b) -> HashMap k b # join :: HashMap k (HashMap k a) -> HashMap k a #
(Eq k, Hashable k) => IsList (HashMap k v)
Instance details Defined in Data.HashMap.Base Associated Types type Item (HashMap k v) :: Type # Methods fromList :: [Item (HashMap k v)] -> HashMap k v # fromListN :: Int -> [Item (HashMap k v)] -> HashMap k v # toList :: HashMap k v -> [Item (HashMap k v)] #
(Eq k, Eq v) => Eq (HashMap k v)
Instance details Defined in Data.HashMap.Base Methods (==) :: HashMap k v -> HashMap k v -> Bool # (/=) :: HashMap k v -> HashMap k v -> Bool #
(Data k, Data v, Eq k, Hashable k) => Data (HashMap k v)
Instance details 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 `HashMap` or an result of `compare`.is stable.
Instance details Defined in Data.HashMap.Base Methods compare :: HashMap k v -> HashMap k v -> Ordering # (<) :: HashMap k v -> HashMap k v -> Bool # (<=) :: HashMap k v -> HashMap k v -> Bool # (>) :: HashMap k v -> HashMap k v -> Bool # (>=) :: HashMap k v -> HashMap k v -> Bool # max :: HashMap k v -> HashMap k v -> HashMap k v # min :: HashMap k v -> HashMap k v -> HashMap k v #
(Eq k, Hashable k, Read k, Read e) => Read (HashMap k e)
Instance details Defined in Data.HashMap.Base Methods readsPrec :: Int -> ReadS (HashMap k e) # readList :: ReadS [HashMap k e] # readPrec :: ReadPrec (HashMap k e) # readListPrec :: ReadPrec [HashMap k e] #
(Show k, Show v) => Show (HashMap k v)
Instance details Defined in Data.HashMap.Base Methods showsPrec :: Int -> HashMap k v -> ShowS # show :: HashMap k v -> String # showList :: [HashMap k v] -> ShowS #
(Eq k, Hashable k) => Semigroup (HashMap k v)
Instance details Defined in Data.HashMap.Base Methods (<>) :: HashMap k v -> HashMap k v -> HashMap k v # sconcat :: NonEmpty (HashMap k v) -> HashMap k v # stimes :: Integral b => b -> HashMap k v -> HashMap k v #
(Eq k, Hashable k) => Monoid (HashMap k v)
Instance details Defined in Data.HashMap.Base Methods mempty :: HashMap k v # mappend :: HashMap k v -> HashMap k v -> HashMap k v # mconcat :: [HashMap k v] -> HashMap k v #
(NFData k, NFData v) => NFData (HashMap k v)
Instance details Defined in Data.HashMap.Base Methods rnf :: HashMap k v -> () #
(Hashable k, Hashable v) => Hashable (HashMap k v)
Instance details Defined in Data.HashMap.Base Methods hashWithSalt :: Int -> HashMap k v -> Int # hash :: HashMap k v -> Int #
(Eq k, Hashable k) => GrowingAppend (HashMap k v)
Instance details Defined in Data.MonoTraversable
MonoTraversable (HashMap k v)
Instance details Defined in Data.MonoTraversable Methods otraverse :: Applicative f => (Element (HashMap k v) -> f (Element (HashMap k v))) -> HashMap k v -> f (HashMap k v) # omapM :: Applicative m => (Element (HashMap k v) -> m (Element (HashMap k v))) -> HashMap k v -> m (HashMap k v) #
MonoFoldable (HashMap k v)
Instance details 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) # oelem :: Element (HashMap k v) -> HashMap k v -> Bool # onotElem :: Element (HashMap k v) -> HashMap k v -> Bool #
MonoFunctor (HashMap k v)
Instance details Defined in Data.MonoTraversable Methods omap :: (Element (HashMap k v) -> Element (HashMap k v)) -> HashMap k v -> HashMap k v #
(Hashable k, Eq k) => HasKeysSet (HashMap k v)
Instance details Defined in Data.Containers Associated Types type KeySet (HashMap k v) :: Type # Methods keysSet :: HashMap k v -> KeySet (HashMap k v) #
(Eq key, Hashable key) => IsMap (HashMap key value)	This instance uses the functions from Data.HashMap.Strict.
Instance details Defined in Data.Containers Associated Types type MapValue (HashMap key value) :: Type # 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.
Instance details 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)
Instance details Defined in Control.Lens.At Methods ix :: Index (HashMap k a) -> Traversal' (HashMap k a) (IxValue (HashMap k a)) #
(Eq k, Hashable k) => At (HashMap k a)
Instance details Defined in Control.Lens.At Methods at :: Index (HashMap k a) -> Lens' (HashMap k a) (Maybe (IxValue (HashMap k a))) #
(Hashable k, Eq k) => Wrapped (HashMap k a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (HashMap k a) :: Type # Methods _Wrapped' :: Iso' (HashMap k a) (Unwrapped (HashMap k a)) #
(t ~ HashMap k' a', Hashable k, Eq k) => Rewrapped (HashMap k a) t	Use `wrapping fromList`. Unwrapping returns some permutation of the list.
Instance details Defined in Control.Lens.Wrapped
type BPMKeyConstraint HashMap key
Instance details Defined in Data.Containers type BPMKeyConstraint HashMap key = (Hashable key, Eq key)
type Key (HashMap k)
Instance details Defined in Data.Key type Key (HashMap k) = k
type Item (HashMap k v)
Instance details Defined in Data.HashMap.Base type Item (HashMap k v) = (k, v)
type Element (HashMap k v)
Instance details Defined in Data.MonoTraversable type Element (HashMap k v) = v
type KeySet (HashMap k v)
Instance details Defined in Data.Containers type KeySet (HashMap k v) = HashSet k
type MapValue (HashMap key value)
Instance details Defined in Data.Containers type MapValue (HashMap key value) = value
type ContainerKey (HashMap key value)
Instance details Defined in Data.Containers type ContainerKey (HashMap key value) = key
type Index (HashMap k a)
Instance details Defined in Control.Lens.At type Index (HashMap k a) = k
type IxValue (HashMap k a)
Instance details Defined in Control.Lens.At type IxValue (HashMap k a) = a
type Unwrapped (HashMap k a)
Instance details Defined in Control.Lens.Wrapped type Unwrapped (HashMap k a) = [(k, a)]

data Handle #

Haskell defines operations to read and write characters from and to files, represented by values of type Handle. Each value of this type is a handle: a record used by the Haskell run-time system to manage I/O with file system objects. A handle has at least the following properties:

whether it manages input or output or both;
whether it is open, closed or semi-closed;
whether the object is seekable;
whether buffering is disabled, or enabled on a line or block basis;
a buffer (whose length may be zero).

Most handles will also have a current I/O position indicating where the next input or output operation will occur. A handle is readable if it manages only input or both input and output; likewise, it is writable if it manages only output or both input and output. A handle is open when first allocated. Once it is closed it can no longer be used for either input or output, though an implementation cannot re-use its storage while references remain to it. Handles are in the Show and Eq classes. The string produced by showing a handle is system dependent; it should include enough information to identify the handle for debugging. A handle is equal according to == only to itself; no attempt is made to compare the internal state of different handles for equality.

Instances

Eq Handle	Since: base-4.1.0.0
Instance details Defined in GHC.IO.Handle.Types Methods (==) :: Handle -> Handle -> Bool # (/=) :: Handle -> Handle -> Bool #
Show Handle	Since: base-4.1.0.0
Instance details Defined in GHC.IO.Handle.Types Methods showsPrec :: Int -> Handle -> ShowS # show :: Handle -> String # showList :: [Handle] -> ShowS #

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.

waitSTM :: Async a -> STM a #

A version of wait that can be used inside an STM transaction.

data Async a #

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
Instance details Defined in Control.Concurrent.Async Methods fmap :: (a -> b) -> Async a -> Async b # (<$) :: a -> Async b -> Async a #
Eq (Async a)
Instance details Defined in Control.Concurrent.Async Methods (==) :: Async a -> Async a -> Bool # (/=) :: Async a -> Async a -> Bool #
Ord (Async a)
Instance details Defined in Control.Concurrent.Async Methods compare :: Async a -> Async a -> Ordering # (<) :: Async a -> Async a -> Bool # (<=) :: Async a -> Async a -> Bool # (>) :: Async a -> Async a -> Bool # (>=) :: Async a -> Async a -> Bool # max :: Async a -> Async a -> Async a # min :: Async a -> Async a -> Async a #
Hashable (Async a)
Instance details Defined in Control.Concurrent.Async Methods hashWithSalt :: Int -> Async a -> Int # hash :: Async a -> Int #

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
Instance details Defined in Control.DeepSeq Methods liftRnf :: (a -> ()) -> WrappedMonoid a -> () #
Bounded m => Bounded (WrappedMonoid m)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods minBound :: WrappedMonoid m # maxBound :: WrappedMonoid m #
Enum a => Enum (WrappedMonoid a)	Since: base-4.9.0.0
Instance details 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
Instance details 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
Instance details 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
Instance details 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
Instance details 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
Instance details Defined in Data.Semigroup Methods showsPrec :: Int -> WrappedMonoid m -> ShowS # show :: WrappedMonoid m -> String # showList :: [WrappedMonoid m] -> ShowS #
Generic (WrappedMonoid m)
Instance details 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
Instance details 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
Instance details 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
Instance details Defined in Control.DeepSeq Methods rnf :: WrappedMonoid m -> () #
Hashable a => Hashable (WrappedMonoid a)
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> WrappedMonoid a -> Int # hash :: WrappedMonoid a -> Int #
Wrapped (WrappedMonoid a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (WrappedMonoid a) :: Type # Methods _Wrapped' :: Iso' (WrappedMonoid a) (Unwrapped (WrappedMonoid a)) #
Generic1 WrappedMonoid
Instance details 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
Instance details Defined in Control.Lens.Wrapped
SuppressUnusedWarnings (ToEnum_6989586621681119424Sym0 :: TyFun Nat (WrappedMonoid a6989586621681106535) -> Type)
Instance details Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ShowsPrec_6989586621681069764Sym0 :: TyFun Nat (WrappedMonoid m6989586621679056540 ~> (Symbol ~> Symbol)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (WrapMonoidSym0 :: TyFun m6989586621679056540 (WrappedMonoid m6989586621679056540) -> Type)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (UnwrapMonoidSym0 :: TyFun (WrappedMonoid m6989586621679056540) m6989586621679056540 -> Type)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Compare_6989586621680214958Sym0 :: TyFun (WrappedMonoid m6989586621679056540) (WrappedMonoid m6989586621679056540 ~> Ordering) -> Type)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621681119398Sym0 :: TyFun (WrappedMonoid m6989586621681106520) (WrappedMonoid m6989586621681106520 ~> WrappedMonoid m6989586621681106520) -> Type)
Instance details Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Succ_6989586621681119408Sym0 :: TyFun (WrappedMonoid a6989586621681106535) (WrappedMonoid a6989586621681106535) -> Type)
Instance details Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Pred_6989586621681119415Sym0 :: TyFun (WrappedMonoid a6989586621681106535) (WrappedMonoid a6989586621681106535) -> Type)
Instance details Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FromEnum_6989586621681119431Sym0 :: TyFun (WrappedMonoid a6989586621681106535) Nat -> Type)
Instance details Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (EnumFromTo_6989586621681119444Sym0 :: TyFun (WrappedMonoid a6989586621681106535) (WrappedMonoid a6989586621681106535 ~> [WrappedMonoid a6989586621681106535]) -> Type)
Instance details Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (EnumFromThenTo_6989586621681119460Sym0 :: TyFun (WrappedMonoid a6989586621681106535) (WrappedMonoid a6989586621681106535 ~> (WrappedMonoid a6989586621681106535 ~> [WrappedMonoid a6989586621681106535])) -> Type)
Instance details Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () #
SingI (WrapMonoidSym0 :: TyFun m (WrappedMonoid m) -> Type)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods sing :: Sing WrapMonoidSym0 #
SuppressUnusedWarnings (Compare_6989586621680214958Sym1 a6989586621680214956 :: TyFun (WrappedMonoid m6989586621679056540) Ordering -> Type)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621681119398Sym1 a6989586621681119396 :: TyFun (WrappedMonoid m6989586621681106520) (WrappedMonoid m6989586621681106520) -> Type)
Instance details Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ShowsPrec_6989586621681069764Sym1 a6989586621681069761 m6989586621679056540 :: TyFun (WrappedMonoid m6989586621679056540) (Symbol ~> Symbol) -> Type)
Instance details Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (EnumFromTo_6989586621681119444Sym1 a6989586621681119442 :: TyFun (WrappedMonoid a6989586621681106535) [WrappedMonoid a6989586621681106535] -> Type)
Instance details Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (EnumFromThenTo_6989586621681119460Sym1 a6989586621681119457 :: TyFun (WrappedMonoid a6989586621681106535) (WrappedMonoid a6989586621681106535 ~> [WrappedMonoid a6989586621681106535]) -> Type)
Instance details Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (EnumFromThenTo_6989586621681119460Sym2 a6989586621681119458 a6989586621681119457 :: TyFun (WrappedMonoid a6989586621681106535) [WrappedMonoid a6989586621681106535] -> Type)
Instance details Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () #
type Apply (FromEnum_6989586621681119431Sym0 :: TyFun (WrappedMonoid a) Nat -> Type) (a6989586621681119430 :: WrappedMonoid a)
Instance details Defined in Data.Singletons.Prelude.Semigroup type Apply (FromEnum_6989586621681119431Sym0 :: TyFun (WrappedMonoid a) Nat -> Type) (a6989586621681119430 :: WrappedMonoid a) = FromEnum_6989586621681119431 a6989586621681119430
type Apply (UnwrapMonoidSym0 :: TyFun (WrappedMonoid m) m -> Type) (a6989586621680204682 :: WrappedMonoid m)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply (UnwrapMonoidSym0 :: TyFun (WrappedMonoid m) m -> Type) (a6989586621680204682 :: WrappedMonoid m) = UnwrapMonoid a6989586621680204682
type Apply (Compare_6989586621680214958Sym1 a6989586621680214956 :: TyFun (WrappedMonoid m) Ordering -> Type) (a6989586621680214957 :: WrappedMonoid m)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply (Compare_6989586621680214958Sym1 a6989586621680214956 :: TyFun (WrappedMonoid m) Ordering -> Type) (a6989586621680214957 :: WrappedMonoid m) = Compare_6989586621680214958 a6989586621680214956 a6989586621680214957
type Rep (WrappedMonoid m)	Since: base-4.9.0.0
Instance details 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)
Instance details Defined in Control.Lens.Wrapped type Unwrapped (WrappedMonoid a) = a
type Mempty
Instance details Defined in Data.Singletons.Prelude.Semigroup type Mempty = (Mempty_6989586621681119402Sym0 :: WrappedMonoid m)
type MaxBound
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type MaxBound = (MaxBound_6989586621680210422Sym0 :: WrappedMonoid m)
type MinBound
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type MinBound = (MinBound_6989586621680210420Sym0 :: WrappedMonoid m)
data Sing (a :: WrappedMonoid m)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal data Sing (a :: WrappedMonoid m) where SWrapMonoid :: forall m (a :: WrappedMonoid m) (n :: m). {..} -> Sing (WrapMonoid n)
type Demote (WrappedMonoid m)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type Demote (WrappedMonoid m) = WrappedMonoid (Demote m)
type Rep1 WrappedMonoid	Since: base-4.9.0.0
Instance details 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])
Instance details Defined in Data.Singletons.Prelude.Semigroup type Mconcat (arg :: [WrappedMonoid m]) = Apply (Mconcat_6989586621680665123Sym0 :: TyFun [WrappedMonoid m] (WrappedMonoid m) -> Type) arg
type Show_ (arg :: WrappedMonoid m)
Instance details Defined in Data.Singletons.Prelude.Semigroup type Show_ (arg :: WrappedMonoid m) = Apply (Show__6989586621680581388Sym0 :: TyFun (WrappedMonoid m) Symbol -> Type) arg
type Sconcat (arg :: NonEmpty (WrappedMonoid m))
Instance details Defined in Data.Singletons.Prelude.Semigroup type Sconcat (arg :: NonEmpty (WrappedMonoid m)) = Apply (Sconcat_6989586621680188294Sym0 :: TyFun (NonEmpty (WrappedMonoid m)) (WrappedMonoid m) -> Type) arg
type FromEnum (a2 :: WrappedMonoid a1)
Instance details Defined in Data.Singletons.Prelude.Semigroup type FromEnum (a2 :: WrappedMonoid a1) = Apply (FromEnum_6989586621681119431Sym0 :: TyFun (WrappedMonoid a1) Nat -> Type) a2
type ToEnum a2
Instance details Defined in Data.Singletons.Prelude.Semigroup type ToEnum a2 = Apply (ToEnum_6989586621681119424Sym0 :: TyFun Nat (WrappedMonoid a1) -> Type) a2
type Pred (a2 :: WrappedMonoid a1)
Instance details Defined in Data.Singletons.Prelude.Semigroup type Pred (a2 :: WrappedMonoid a1) = Apply (Pred_6989586621681119415Sym0 :: TyFun (WrappedMonoid a1) (WrappedMonoid a1) -> Type) a2
type Succ (a2 :: WrappedMonoid a1)
Instance details Defined in Data.Singletons.Prelude.Semigroup type Succ (a2 :: WrappedMonoid a1) = Apply (Succ_6989586621681119408Sym0 :: TyFun (WrappedMonoid a1) (WrappedMonoid a1) -> Type) a2
type Mappend (arg1 :: WrappedMonoid m) (arg2 :: WrappedMonoid m)
Instance details Defined in Data.Singletons.Prelude.Semigroup type Mappend (arg1 :: WrappedMonoid m) (arg2 :: WrappedMonoid m) = Apply (Apply (Mappend_6989586621680665113Sym0 :: TyFun (WrappedMonoid m) (WrappedMonoid m ~> WrappedMonoid m) -> Type) arg1) arg2
type ShowList (arg1 :: [WrappedMonoid m]) arg2
Instance details Defined in Data.Singletons.Prelude.Semigroup type ShowList (arg1 :: [WrappedMonoid m]) arg2 = Apply (Apply (ShowList_6989586621680581399Sym0 :: TyFun [WrappedMonoid m] (Symbol ~> Symbol) -> Type) arg1) arg2
type (a1 :: WrappedMonoid m) <> (a2 :: WrappedMonoid m)
Instance details Defined in Data.Singletons.Prelude.Semigroup type (a1 :: WrappedMonoid m) <> (a2 :: WrappedMonoid m) = Apply (Apply (TFHelper_6989586621681119398Sym0 :: TyFun (WrappedMonoid m) (WrappedMonoid m ~> WrappedMonoid m) -> Type) a1) a2
type EnumFromTo (a2 :: WrappedMonoid a1) (a3 :: WrappedMonoid a1)
Instance details Defined in Data.Singletons.Prelude.Semigroup type EnumFromTo (a2 :: WrappedMonoid a1) (a3 :: WrappedMonoid a1) = Apply (Apply (EnumFromTo_6989586621681119444Sym0 :: TyFun (WrappedMonoid a1) (WrappedMonoid a1 ~> [WrappedMonoid a1]) -> Type) a2) a3
type Min (arg1 :: WrappedMonoid m) (arg2 :: WrappedMonoid m)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type Min (arg1 :: WrappedMonoid m) (arg2 :: WrappedMonoid m) = Apply (Apply (Min_6989586621679832893Sym0 :: TyFun (WrappedMonoid m) (WrappedMonoid m ~> WrappedMonoid m) -> Type) arg1) arg2
type Max (arg1 :: WrappedMonoid m) (arg2 :: WrappedMonoid m)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type Max (arg1 :: WrappedMonoid m) (arg2 :: WrappedMonoid m) = Apply (Apply (Max_6989586621679832875Sym0 :: TyFun (WrappedMonoid m) (WrappedMonoid m ~> WrappedMonoid m) -> Type) arg1) arg2
type (arg1 :: WrappedMonoid m) >= (arg2 :: WrappedMonoid m)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type (arg1 :: WrappedMonoid m) >= (arg2 :: WrappedMonoid m) = Apply (Apply (TFHelper_6989586621679832857Sym0 :: TyFun (WrappedMonoid m) (WrappedMonoid m ~> Bool) -> Type) arg1) arg2
type (arg1 :: WrappedMonoid m) > (arg2 :: WrappedMonoid m)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type (arg1 :: WrappedMonoid m) > (arg2 :: WrappedMonoid m) = Apply (Apply (TFHelper_6989586621679832839Sym0 :: TyFun (WrappedMonoid m) (WrappedMonoid m ~> Bool) -> Type) arg1) arg2
type (arg1 :: WrappedMonoid m) <= (arg2 :: WrappedMonoid m)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type (arg1 :: WrappedMonoid m) <= (arg2 :: WrappedMonoid m) = Apply (Apply (TFHelper_6989586621679832817Sym0 :: TyFun (WrappedMonoid m) (WrappedMonoid m ~> Bool) -> Type) arg1) arg2
type (arg1 :: WrappedMonoid m) < (arg2 :: WrappedMonoid m)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type (arg1 :: WrappedMonoid m) < (arg2 :: WrappedMonoid m) = Apply (Apply (TFHelper_6989586621679832797Sym0 :: TyFun (WrappedMonoid m) (WrappedMonoid m ~> Bool) -> Type) arg1) arg2
type Compare (a1 :: WrappedMonoid m) (a2 :: WrappedMonoid m)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type Compare (a1 :: WrappedMonoid m) (a2 :: WrappedMonoid m) = Apply (Apply (Compare_6989586621680214958Sym0 :: TyFun (WrappedMonoid m) (WrappedMonoid m ~> Ordering) -> Type) a1) a2
type (x :: WrappedMonoid m) /= (y :: WrappedMonoid m)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type (x :: WrappedMonoid m) /= (y :: WrappedMonoid m) = Not (x == y)
type (a :: WrappedMonoid m) == (b :: WrappedMonoid m)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type (a :: WrappedMonoid m) == (b :: WrappedMonoid m) = Equals_6989586621680212300 a b
type ShowsPrec a1 (a2 :: WrappedMonoid m) a3
Instance details Defined in Data.Singletons.Prelude.Semigroup type ShowsPrec a1 (a2 :: WrappedMonoid m) a3 = Apply (Apply (Apply (ShowsPrec_6989586621681069764Sym0 :: TyFun Nat (WrappedMonoid m ~> (Symbol ~> Symbol)) -> Type) a1) a2) a3
type EnumFromThenTo (a2 :: WrappedMonoid a1) (a3 :: WrappedMonoid a1) (a4 :: WrappedMonoid a1)
Instance details Defined in Data.Singletons.Prelude.Semigroup type EnumFromThenTo (a2 :: WrappedMonoid a1) (a3 :: WrappedMonoid a1) (a4 :: WrappedMonoid a1) = Apply (Apply (Apply (EnumFromThenTo_6989586621681119460Sym0 :: TyFun (WrappedMonoid a1) (WrappedMonoid a1 ~> (WrappedMonoid a1 ~> [WrappedMonoid a1])) -> Type) a2) a3) a4
type Apply (WrapMonoidSym0 :: TyFun m (WrappedMonoid m) -> Type) (t6989586621680204685 :: m)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply (WrapMonoidSym0 :: TyFun m (WrappedMonoid m) -> Type) (t6989586621680204685 :: m) = WrapMonoid t6989586621680204685
type Apply (ToEnum_6989586621681119424Sym0 :: TyFun Nat (WrappedMonoid a6989586621681106535) -> Type) (a6989586621681119423 :: Nat)
Instance details Defined in Data.Singletons.Prelude.Semigroup type Apply (ToEnum_6989586621681119424Sym0 :: TyFun Nat (WrappedMonoid a6989586621681106535) -> Type) (a6989586621681119423 :: Nat) = (ToEnum_6989586621681119424 a6989586621681119423 :: WrappedMonoid a6989586621681106535)
type Apply (Succ_6989586621681119408Sym0 :: TyFun (WrappedMonoid a) (WrappedMonoid a) -> Type) (a6989586621681119407 :: WrappedMonoid a)
Instance details Defined in Data.Singletons.Prelude.Semigroup type Apply (Succ_6989586621681119408Sym0 :: TyFun (WrappedMonoid a) (WrappedMonoid a) -> Type) (a6989586621681119407 :: WrappedMonoid a) = Succ_6989586621681119408 a6989586621681119407
type Apply (Pred_6989586621681119415Sym0 :: TyFun (WrappedMonoid a) (WrappedMonoid a) -> Type) (a6989586621681119414 :: WrappedMonoid a)
Instance details Defined in Data.Singletons.Prelude.Semigroup type Apply (Pred_6989586621681119415Sym0 :: TyFun (WrappedMonoid a) (WrappedMonoid a) -> Type) (a6989586621681119414 :: WrappedMonoid a) = Pred_6989586621681119415 a6989586621681119414
type Apply (EnumFromTo_6989586621681119444Sym1 a6989586621681119442 :: TyFun (WrappedMonoid a) [WrappedMonoid a] -> Type) (a6989586621681119443 :: WrappedMonoid a)
Instance details Defined in Data.Singletons.Prelude.Semigroup type Apply (EnumFromTo_6989586621681119444Sym1 a6989586621681119442 :: TyFun (WrappedMonoid a) [WrappedMonoid a] -> Type) (a6989586621681119443 :: WrappedMonoid a) = EnumFromTo_6989586621681119444 a6989586621681119442 a6989586621681119443
type Apply (TFHelper_6989586621681119398Sym1 a6989586621681119396 :: TyFun (WrappedMonoid m) (WrappedMonoid m) -> Type) (a6989586621681119397 :: WrappedMonoid m)
Instance details Defined in Data.Singletons.Prelude.Semigroup type Apply (TFHelper_6989586621681119398Sym1 a6989586621681119396 :: TyFun (WrappedMonoid m) (WrappedMonoid m) -> Type) (a6989586621681119397 :: WrappedMonoid m) = TFHelper_6989586621681119398 a6989586621681119396 a6989586621681119397
type Apply (EnumFromThenTo_6989586621681119460Sym2 a6989586621681119458 a6989586621681119457 :: TyFun (WrappedMonoid a) [WrappedMonoid a] -> Type) (a6989586621681119459 :: WrappedMonoid a)
Instance details Defined in Data.Singletons.Prelude.Semigroup type Apply (EnumFromThenTo_6989586621681119460Sym2 a6989586621681119458 a6989586621681119457 :: TyFun (WrappedMonoid a) [WrappedMonoid a] -> Type) (a6989586621681119459 :: WrappedMonoid a) = EnumFromThenTo_6989586621681119460 a6989586621681119458 a6989586621681119457 a6989586621681119459
type Apply (ShowsPrec_6989586621681069764Sym0 :: TyFun Nat (WrappedMonoid m6989586621679056540 ~> (Symbol ~> Symbol)) -> Type) (a6989586621681069761 :: Nat)
Instance details Defined in Data.Singletons.Prelude.Semigroup type Apply (ShowsPrec_6989586621681069764Sym0 :: TyFun Nat (WrappedMonoid m6989586621679056540 ~> (Symbol ~> Symbol)) -> Type) (a6989586621681069761 :: Nat) = (ShowsPrec_6989586621681069764Sym1 a6989586621681069761 m6989586621679056540 :: TyFun (WrappedMonoid m6989586621679056540) (Symbol ~> Symbol) -> Type)
type Apply (Compare_6989586621680214958Sym0 :: TyFun (WrappedMonoid m6989586621679056540) (WrappedMonoid m6989586621679056540 ~> Ordering) -> Type) (a6989586621680214956 :: WrappedMonoid m6989586621679056540)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply (Compare_6989586621680214958Sym0 :: TyFun (WrappedMonoid m6989586621679056540) (WrappedMonoid m6989586621679056540 ~> Ordering) -> Type) (a6989586621680214956 :: WrappedMonoid m6989586621679056540) = Compare_6989586621680214958Sym1 a6989586621680214956
type Apply (TFHelper_6989586621681119398Sym0 :: TyFun (WrappedMonoid m6989586621681106520) (WrappedMonoid m6989586621681106520 ~> WrappedMonoid m6989586621681106520) -> Type) (a6989586621681119396 :: WrappedMonoid m6989586621681106520)
Instance details Defined in Data.Singletons.Prelude.Semigroup type Apply (TFHelper_6989586621681119398Sym0 :: TyFun (WrappedMonoid m6989586621681106520) (WrappedMonoid m6989586621681106520 ~> WrappedMonoid m6989586621681106520) -> Type) (a6989586621681119396 :: WrappedMonoid m6989586621681106520) = TFHelper_6989586621681119398Sym1 a6989586621681119396
type Apply (EnumFromTo_6989586621681119444Sym0 :: TyFun (WrappedMonoid a6989586621681106535) (WrappedMonoid a6989586621681106535 ~> [WrappedMonoid a6989586621681106535]) -> Type) (a6989586621681119442 :: WrappedMonoid a6989586621681106535)
Instance details Defined in Data.Singletons.Prelude.Semigroup type Apply (EnumFromTo_6989586621681119444Sym0 :: TyFun (WrappedMonoid a6989586621681106535) (WrappedMonoid a6989586621681106535 ~> [WrappedMonoid a6989586621681106535]) -> Type) (a6989586621681119442 :: WrappedMonoid a6989586621681106535) = EnumFromTo_6989586621681119444Sym1 a6989586621681119442
type Apply (EnumFromThenTo_6989586621681119460Sym0 :: TyFun (WrappedMonoid a6989586621681106535) (WrappedMonoid a6989586621681106535 ~> (WrappedMonoid a6989586621681106535 ~> [WrappedMonoid a6989586621681106535])) -> Type) (a6989586621681119457 :: WrappedMonoid a6989586621681106535)
Instance details Defined in Data.Singletons.Prelude.Semigroup type Apply (EnumFromThenTo_6989586621681119460Sym0 :: TyFun (WrappedMonoid a6989586621681106535) (WrappedMonoid a6989586621681106535 ~> (WrappedMonoid a6989586621681106535 ~> [WrappedMonoid a6989586621681106535])) -> Type) (a6989586621681119457 :: WrappedMonoid a6989586621681106535) = EnumFromThenTo_6989586621681119460Sym1 a6989586621681119457
type Apply (ShowsPrec_6989586621681069764Sym1 a6989586621681069761 m6989586621679056540 :: TyFun (WrappedMonoid m6989586621679056540) (Symbol ~> Symbol) -> Type) (a6989586621681069762 :: WrappedMonoid m6989586621679056540)
Instance details Defined in Data.Singletons.Prelude.Semigroup type Apply (ShowsPrec_6989586621681069764Sym1 a6989586621681069761 m6989586621679056540 :: TyFun (WrappedMonoid m6989586621679056540) (Symbol ~> Symbol) -> Type) (a6989586621681069762 :: WrappedMonoid m6989586621679056540) = ShowsPrec_6989586621681069764Sym2 a6989586621681069761 a6989586621681069762
type Apply (EnumFromThenTo_6989586621681119460Sym1 a6989586621681119457 :: TyFun (WrappedMonoid a6989586621681106535) (WrappedMonoid a6989586621681106535 ~> [WrappedMonoid a6989586621681106535]) -> Type) (a6989586621681119458 :: WrappedMonoid a6989586621681106535)
Instance details Defined in Data.Singletons.Prelude.Semigroup type Apply (EnumFromThenTo_6989586621681119460Sym1 a6989586621681119457 :: TyFun (WrappedMonoid a6989586621681106535) (WrappedMonoid a6989586621681106535 ~> [WrappedMonoid a6989586621681106535]) -> Type) (a6989586621681119458 :: WrappedMonoid a6989586621681106535) = EnumFromThenTo_6989586621681119460Sym2 a6989586621681119457 a6989586621681119458

data Chan a #

Chan is an abstract type representing an unbounded FIFO channel.

Instances

Eq (Chan a)	Since: base-4.4.0.0
Instance details Defined in Control.Concurrent.Chan Methods (==) :: Chan a -> Chan a -> Bool # (/=) :: Chan a -> Chan a -> Bool #

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:

bimap id id ≡ id

If you supply first and second, ensure:

first id ≡ id
second id ≡ id

If you supply both, you should also ensure:

bimap f g ≡ first f . second g

These ensure by parametricity:

bimap  (f . g) (h . i) ≡ bimap f h . bimap g i
first  (f . g) ≡ first  f . first  g
second (f . g) ≡ second f . second g

Since: base-4.8.0.0

Minimal complete definition

bimap | first, second

Methods

bimap :: (a -> b) -> (c -> d) -> p a c -> p b d #

Map over both arguments at the same time.

bimap f g ≡ first f . second g

Examples

Expand

>>> bimap toUpper (+1) ('j', 3)
('J',4)

>>> bimap toUpper (+1) (Left 'j')
Left 'J'

>>> bimap toUpper (+1) (Right 3)
Right 4

first :: (a -> b) -> p a c -> p b c #

Map covariantly over the first argument.

first f ≡ bimap f id

Examples

Expand

>>> first toUpper ('j', 3)
('J',3)

>>> first toUpper (Left 'j')
Left 'J'

second :: (b -> c) -> p a b -> p a c #

Map covariantly over the second argument.

second ≡ bimap id

Examples

Expand

>>> second (+1) ('j', 3)
('j',4)

>>> second (+1) (Right 3)
Right 4

Instances

Bifunctor Either	Since: base-4.8.0.0
Instance details Defined in Data.Bifunctor Methods bimap :: (a -> b) -> (c -> d) -> Either a c -> Either b d # first :: (a -> b) -> Either a c -> Either b c # second :: (b -> c) -> Either a b -> Either a c #
Bifunctor (,)	Since: base-4.8.0.0
Instance details Defined in Data.Bifunctor Methods bimap :: (a -> b) -> (c -> d) -> (a, c) -> (b, d) # first :: (a -> b) -> (a, c) -> (b, c) # second :: (b -> c) -> (a, b) -> (a, c) #
Bifunctor Arg	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods bimap :: (a -> b) -> (c -> d) -> Arg a c -> Arg b d # first :: (a -> b) -> Arg a c -> Arg b c # second :: (b -> c) -> Arg a b -> Arg a c #
Bifunctor ((,,) x1)	Since: base-4.8.0.0
Instance details Defined in Data.Bifunctor Methods bimap :: (a -> b) -> (c -> d) -> (x1, a, c) -> (x1, b, d) # first :: (a -> b) -> (x1, a, c) -> (x1, b, c) # second :: (b -> c) -> (x1, a, b) -> (x1, a, c) #
Bifunctor (Const :: Type -> Type -> Type)	Since: base-4.8.0.0
Instance details Defined in Data.Bifunctor Methods bimap :: (a -> b) -> (c -> d) -> Const a c -> Const b d # first :: (a -> b) -> Const a c -> Const b c # second :: (b -> c) -> Const a b -> Const a c #
Functor f => Bifunctor (FreeF f)
Instance details Defined in Control.Monad.Trans.Free Methods bimap :: (a -> b) -> (c -> d) -> FreeF f a c -> FreeF f b d # first :: (a -> b) -> FreeF f a c -> FreeF f b c # second :: (b -> c) -> FreeF f a b -> FreeF f a c #
Functor f => Bifunctor (CofreeF f)
Instance details Defined in Control.Comonad.Trans.Cofree Methods bimap :: (a -> b) -> (c -> d) -> CofreeF f a c -> CofreeF f b d # first :: (a -> b) -> CofreeF f a c -> CofreeF f b c # second :: (b -> c) -> CofreeF f a b -> CofreeF f a c #
Bifunctor (Tagged :: Type -> Type -> Type)
Instance details Defined in Data.Tagged Methods bimap :: (a -> b) -> (c -> d) -> Tagged a c -> Tagged b d # first :: (a -> b) -> Tagged a c -> Tagged b c # second :: (b -> c) -> Tagged a b -> Tagged a c #
Bifunctor (K1 i :: Type -> Type -> Type)	Since: base-4.9.0.0
Instance details Defined in Data.Bifunctor Methods bimap :: (a -> b) -> (c -> d) -> K1 i a c -> K1 i b d # first :: (a -> b) -> K1 i a c -> K1 i b c # second :: (b -> c) -> K1 i a b -> K1 i a c #
Bifunctor ((,,,) x1 x2)	Since: base-4.8.0.0
Instance details Defined in Data.Bifunctor Methods bimap :: (a -> b) -> (c -> d) -> (x1, x2, a, c) -> (x1, x2, b, d) # first :: (a -> b) -> (x1, x2, a, c) -> (x1, x2, b, c) # second :: (b -> c) -> (x1, x2, a, b) -> (x1, x2, a, c) #
Bifunctor ((,,,,) x1 x2 x3)	Since: base-4.8.0.0
Instance details Defined in Data.Bifunctor Methods bimap :: (a -> b) -> (c -> d) -> (x1, x2, x3, a, c) -> (x1, x2, x3, b, d) # first :: (a -> b) -> (x1, x2, x3, a, c) -> (x1, x2, x3, b, c) # second :: (b -> c) -> (x1, x2, x3, a, b) -> (x1, x2, x3, a, c) #
Bifunctor p => Bifunctor (WrappedBifunctor p)
Instance details Defined in Data.Bifunctor.Wrapped Methods bimap :: (a -> b) -> (c -> d) -> WrappedBifunctor p a c -> WrappedBifunctor p b d # first :: (a -> b) -> WrappedBifunctor p a c -> WrappedBifunctor p b c # second :: (b -> c) -> WrappedBifunctor p a b -> WrappedBifunctor p a c #
Functor g => Bifunctor (Joker g :: Type -> Type -> Type)
Instance details Defined in Data.Bifunctor.Joker Methods bimap :: (a -> b) -> (c -> d) -> Joker g a c -> Joker g b d # first :: (a -> b) -> Joker g a c -> Joker g b c # second :: (b -> c) -> Joker g a b -> Joker g a c #
Bifunctor p => Bifunctor (Flip p)
Instance details Defined in Data.Bifunctor.Flip Methods bimap :: (a -> b) -> (c -> d) -> Flip p a c -> Flip p b d # first :: (a -> b) -> Flip p a c -> Flip p b c # second :: (b -> c) -> Flip p a b -> Flip p a c #
Functor f => Bifunctor (Clown f :: Type -> Type -> Type)
Instance details Defined in Data.Bifunctor.Clown Methods bimap :: (a -> b) -> (c -> d) -> Clown f a c -> Clown f b d # first :: (a -> b) -> Clown f a c -> Clown f b c # second :: (b -> c) -> Clown f a b -> Clown f a c #
Bifunctor ((,,,,,) x1 x2 x3 x4)	Since: base-4.8.0.0
Instance details Defined in Data.Bifunctor Methods bimap :: (a -> b) -> (c -> d) -> (x1, x2, x3, x4, a, c) -> (x1, x2, x3, x4, b, d) # first :: (a -> b) -> (x1, x2, x3, x4, a, c) -> (x1, x2, x3, x4, b, c) # second :: (b -> c) -> (x1, x2, x3, x4, a, b) -> (x1, x2, x3, x4, a, c) #
(Bifunctor p, Bifunctor q) => Bifunctor (Sum p q)
Instance details Defined in Data.Bifunctor.Sum Methods bimap :: (a -> b) -> (c -> d) -> Sum p q a c -> Sum p q b d # first :: (a -> b) -> Sum p q a c -> Sum p q b c # second :: (b -> c) -> Sum p q a b -> Sum p q a c #
(Bifunctor f, Bifunctor g) => Bifunctor (Product f g)
Instance details Defined in Data.Bifunctor.Product Methods bimap :: (a -> b) -> (c -> d) -> Product f g a c -> Product f g b d # first :: (a -> b) -> Product f g a c -> Product f g b c # second :: (b -> c) -> Product f g a b -> Product f g a c #
Bifunctor ((,,,,,,) x1 x2 x3 x4 x5)	Since: base-4.8.0.0
Instance details Defined in Data.Bifunctor Methods bimap :: (a -> b) -> (c -> d) -> (x1, x2, x3, x4, x5, a, c) -> (x1, x2, x3, x4, x5, b, d) # first :: (a -> b) -> (x1, x2, x3, x4, x5, a, c) -> (x1, x2, x3, x4, x5, b, c) # second :: (b -> c) -> (x1, x2, x3, x4, x5, a, b) -> (x1, x2, x3, x4, x5, a, c) #
(Functor f, Bifunctor p) => Bifunctor (Tannen f p)
Instance details Defined in Data.Bifunctor.Tannen Methods bimap :: (a -> b) -> (c -> d) -> Tannen f p a c -> Tannen f p b d # first :: (a -> b) -> Tannen f p a c -> Tannen f p b c # second :: (b -> c) -> Tannen f p a b -> Tannen f p a c #
(Bifunctor p, Functor f, Functor g) => Bifunctor (Biff p f g)
Instance details Defined in Data.Bifunctor.Biff Methods bimap :: (a -> b) -> (c -> d) -> Biff p f g a c -> Biff p f g b d # first :: (a -> b) -> Biff p f g a c -> Biff p f g b c # second :: (b -> c) -> Biff p f g a b -> Biff p f g a c #

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:

```
liftIO . return = return
```

liftIO (m >>= f) = liftIO m >>= (liftIO . f)

Methods

liftIO :: IO a -> m a #

Lift a computation from the IO monad.

Instances

MonadIO IO	Since: base-4.9.0.0
Instance details Defined in Control.Monad.IO.Class Methods liftIO :: IO a -> IO a #
MonadIO Q
Instance details Defined in Language.Haskell.TH.Syntax Methods liftIO :: IO a -> Q a #
MonadIO m => MonadIO (MaybeT m)
Instance details Defined in Control.Monad.Trans.Maybe Methods liftIO :: IO a -> MaybeT m a #
MonadIO m => MonadIO (ResourceT m)
Instance details Defined in Control.Monad.Trans.Resource.Internal Methods liftIO :: IO a -> ResourceT m a #
MonadIO m => MonadIO (ListT m)
Instance details Defined in Control.Monad.Trans.List Methods liftIO :: IO a -> ListT m a #
MonadIO q => MonadIO (DsM q)
Instance details Defined in Language.Haskell.TH.Desugar.Reify Methods liftIO :: IO a -> DsM q a #
MonadIO m => MonadIO (ReaderT r m)
Instance details Defined in Control.Monad.Trans.Reader Methods liftIO :: IO a -> ReaderT r m a #
MonadIO m => MonadIO (IdentityT m)
Instance details Defined in Control.Monad.Trans.Identity Methods liftIO :: IO a -> IdentityT m a #
(Monoid w, MonadIO m) => MonadIO (WriterT w m)
Instance details Defined in Control.Monad.Trans.Writer.Strict Methods liftIO :: IO a -> WriterT w m a #
(Monoid w, MonadIO m) => MonadIO (WriterT w m)
Instance details Defined in Control.Monad.Trans.Writer.Lazy Methods liftIO :: IO a -> WriterT w m a #
MonadIO m => MonadIO (StateT s m)
Instance details Defined in Control.Monad.Trans.State.Strict Methods liftIO :: IO a -> StateT s m a #
MonadIO m => MonadIO (StateT s m)
Instance details Defined in Control.Monad.Trans.State.Lazy Methods liftIO :: IO a -> StateT s m a #
(Functor f, MonadIO m) => MonadIO (FreeT f m)
Instance details Defined in Control.Monad.Trans.Free Methods liftIO :: IO a -> FreeT f m a #
(Error e, MonadIO m) => MonadIO (ErrorT e m)
Instance details Defined in Control.Monad.Trans.Error Methods liftIO :: IO a -> ErrorT e m a #
MonadIO m => MonadIO (ConduitT i o m)
Instance details Defined in Data.Conduit.Internal.Conduit Methods liftIO :: IO a -> ConduitT i o m a #
MonadIO m => MonadIO (ContT r m)
Instance details Defined in Control.Monad.Trans.Cont Methods liftIO :: IO a -> ContT r m a #
(Monoid w, MonadIO m) => MonadIO (RWST r w s m)
Instance details Defined in Control.Monad.Trans.RWS.Strict Methods liftIO :: IO a -> RWST r w s m a #
(Monoid w, MonadIO m) => MonadIO (RWST r w s m)
Instance details Defined in Control.Monad.Trans.RWS.Lazy Methods liftIO :: IO a -> RWST r w s m a #
MonadIO m => MonadIO (Pipe l i o u m)
Instance details Defined in Data.Conduit.Internal.Pipe Methods liftIO :: IO a -> Pipe l i o u m a #

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

Expand

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 socket
  forkFinally (echo client) (\_ -> hClose client)
  where
    echo :: Handle -> IO ()
    echo client = forever $
      hGetLine client >>= hPutStrLn client

(<=<) :: Monad m => (b -> m c) -> (a -> m b) -> a -> m c infixr 1 #

Right-to-left composition of Kleisli arrows. (>=>), with the arguments flipped.

Note how this operator resembles function composition (.):

(.)   ::            (b ->   c) -> (a ->   b) -> a ->   c
(<=<) :: Monad m => (b -> m c) -> (a -> m b) -> a -> m c

(>=>) :: 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) #

forM is mapM with its arguments flipped. For a version that ignores the results see forM_.

(***) :: 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.

newtype Identity a #

Identity functor and monad. (a non-strict monad)

Since: base-4.8.0.0

Constructors

Identity
Fields runIdentity :: a

Instances

Monad Identity	Since: base-4.8.0.0
Instance details Defined in Data.Functor.Identity Methods (>>=) :: Identity a -> (a -> Identity b) -> Identity b # (>>) :: Identity a -> Identity b -> Identity b # return :: a -> Identity a # fail :: String -> Identity a #
Functor Identity	Since: base-4.8.0.0
Instance details Defined in Data.Functor.Identity Methods fmap :: (a -> b) -> Identity a -> Identity b # (<$) :: a -> Identity b -> Identity a #
MonadFix Identity	Since: base-4.8.0.0
Instance details Defined in Data.Functor.Identity Methods mfix :: (a -> Identity a) -> Identity a #
Applicative Identity	Since: base-4.8.0.0
Instance details Defined in Data.Functor.Identity Methods pure :: a -> Identity a # (<>) :: Identity (a -> b) -> Identity a -> Identity b # liftA2 :: (a -> b -> c) -> Identity a -> Identity b -> Identity c # (>) :: Identity a -> Identity b -> Identity b # (<*) :: Identity a -> Identity b -> Identity a #
Foldable Identity	Since: base-4.8.0.0
Instance details 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 # toList :: Identity a -> [a] # null :: Identity a -> Bool # length :: Identity a -> Int # elem :: Eq a => a -> Identity a -> Bool # maximum :: Ord a => Identity a -> a # minimum :: Ord a => Identity a -> a # sum :: Num a => Identity a -> a # product :: Num a => Identity a -> a #
Traversable Identity	Since: base-4.9.0.0
Instance details Defined in Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> Identity a -> f (Identity b) # sequenceA :: Applicative f => Identity (f a) -> f (Identity a) # mapM :: Monad m => (a -> m b) -> Identity a -> m (Identity b) # sequence :: Monad m => Identity (m a) -> m (Identity a) #
Distributive Identity
Instance details Defined in Data.Distributive Methods distribute :: Functor f => f (Identity a) -> Identity (f a) # collect :: Functor f => (a -> Identity b) -> f a -> Identity (f b) # distributeM :: Monad m => m (Identity a) -> Identity (m a) # collectM :: Monad m => (a -> Identity b) -> m a -> Identity (m b) #
Representable Identity
Instance details Defined in Data.Functor.Rep Associated Types type Rep Identity :: Type # Methods tabulate :: (Rep Identity -> a) -> Identity a # index :: Identity a -> Rep Identity -> a #
Eq1 Identity	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Classes Methods liftEq :: (a -> b -> Bool) -> Identity a -> Identity b -> Bool #
Ord1 Identity	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Classes Methods liftCompare :: (a -> b -> Ordering) -> Identity a -> Identity b -> Ordering #
Read1 Identity	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Classes Methods liftReadsPrec :: (Int -> ReadS a) -> ReadS [a] -> Int -> ReadS (Identity a) # liftReadList :: (Int -> ReadS a) -> ReadS [a] -> ReadS [Identity a] # liftReadPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec (Identity a) # liftReadListPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec [Identity a] #
Show1 Identity	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Classes Methods liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> Identity a -> ShowS # liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [Identity a] -> ShowS #
Comonad Identity
Instance details Defined in Control.Comonad Methods extract :: Identity a -> a # duplicate :: Identity a -> Identity (Identity a) # extend :: (Identity a -> b) -> Identity a -> Identity b #
ComonadApply Identity
Instance details Defined in Control.Comonad Methods (<@>) :: Identity (a -> b) -> Identity a -> Identity b # (@>) :: Identity a -> Identity b -> Identity b # (<@) :: Identity a -> Identity b -> Identity a #
NFData1 Identity	Since: deepseq-1.4.3.0
Instance details Defined in Control.DeepSeq Methods liftRnf :: (a -> ()) -> Identity a -> () #
Hashable1 Identity
Instance details Defined in Data.Hashable.Class Methods liftHashWithSalt :: (Int -> a -> Int) -> Int -> Identity a -> Int #
Keyed Identity
Instance details Defined in Data.Key Methods mapWithKey :: (Key Identity -> a -> b) -> Identity a -> Identity b #
Zip Identity
Instance details Defined in Data.Key Methods zipWith :: (a -> b -> c) -> Identity a -> Identity b -> Identity c # zip :: Identity a -> Identity b -> Identity (a, b) # zap :: Identity (a -> b) -> Identity a -> Identity b #
ZipWithKey Identity
Instance details Defined in Data.Key Methods zipWithKey :: (Key Identity -> a -> b -> c) -> Identity a -> Identity b -> Identity c # zapWithKey :: Identity (Key Identity -> a -> b) -> Identity a -> Identity b #
Indexable Identity
Instance details Defined in Data.Key Methods index :: Identity a -> Key Identity -> a #
Lookup Identity
Instance details Defined in Data.Key Methods lookup :: Key Identity -> Identity a -> Maybe a #
Adjustable Identity
Instance details Defined in Data.Key Methods adjust :: (a -> a) -> Key Identity -> Identity a -> Identity a # replace :: Key Identity -> a -> Identity a -> Identity a #
FoldableWithKey Identity
Instance details Defined in Data.Key Methods toKeyedList :: Identity a -> [(Key Identity, a)] # foldMapWithKey :: Monoid m => (Key Identity -> a -> m) -> Identity a -> m # foldrWithKey :: (Key Identity -> a -> b -> b) -> b -> Identity a -> b # foldlWithKey :: (b -> Key Identity -> a -> b) -> b -> Identity a -> b #
FoldableWithKey1 Identity
Instance details Defined in Data.Key Methods foldMapWithKey1 :: Semigroup m => (Key Identity -> a -> m) -> Identity a -> m #
TraversableWithKey Identity
Instance details 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
Instance details Defined in Data.Key Methods traverseWithKey1 :: Apply f => (Key Identity -> a -> f b) -> Identity a -> f (Identity b) #
Apply Identity
Instance details Defined in Data.Functor.Bind.Class Methods (<.>) :: Identity (a -> b) -> Identity a -> Identity b # (.>) :: Identity a -> Identity b -> Identity b # (<.) :: Identity a -> Identity b -> Identity a # liftF2 :: (a -> b -> c) -> Identity a -> Identity b -> Identity c #
Bind Identity
Instance details Defined in Data.Functor.Bind.Class Methods (>>-) :: Identity a -> (a -> Identity b) -> Identity b # join :: Identity (Identity a) -> Identity a #
PTraversable Identity
Instance details Defined in Data.Singletons.Prelude.Traversable Associated Types type Traverse arg arg1 :: f (t b) # type SequenceA arg :: f (t a) # type MapM arg arg1 :: m (t b) # type Sequence arg :: m (t a) #
STraversable Identity
Instance details 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
Instance details Defined in Control.Lens.Indexed Methods imap :: (() -> a -> b) -> Identity a -> Identity b # imapped :: IndexedSetter () (Identity a) (Identity b) a b #
FoldableWithIndex () Identity
Instance details Defined in Control.Lens.Indexed Methods ifoldMap :: Monoid m => (() -> a -> m) -> Identity a -> m # ifolded :: IndexedFold () (Identity a) a # ifoldr :: (() -> a -> b -> b) -> b -> Identity a -> b # ifoldl :: (() -> b -> a -> b) -> b -> Identity a -> b # ifoldr' :: (() -> a -> b -> b) -> b -> Identity a -> b # ifoldl' :: (() -> b -> a -> b) -> b -> Identity a -> b #
TraversableWithIndex () Identity
Instance details 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
Instance details Defined in Control.Lens.Reified Methods sieve :: ReifiedGetter a b -> a -> Identity b #
Cosieve ReifiedGetter Identity
Instance details Defined in Control.Lens.Reified Methods cosieve :: ReifiedGetter a b -> Identity a -> b #
Bounded a => Bounded (Identity a)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Identity Methods minBound :: Identity a # maxBound :: Identity a #
Enum a => Enum (Identity a)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Identity Methods succ :: Identity a -> Identity a # pred :: Identity a -> Identity a # toEnum :: Int -> 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
Instance details Defined in Data.Functor.Identity Methods (==) :: Identity a -> Identity a -> Bool # (/=) :: Identity a -> Identity a -> Bool #
Floating a => Floating (Identity a)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Identity Methods pi :: Identity a # 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 # log1pexp :: Identity a -> Identity a # log1mexp :: Identity a -> Identity a #
Fractional a => Fractional (Identity a)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Identity Methods (/) :: Identity a -> Identity a -> Identity a # recip :: Identity a -> Identity a # fromRational :: Rational -> Identity a #
Integral a => Integral (Identity a)	Since: base-4.9.0.0
Instance details 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) # toInteger :: Identity a -> Integer #
Num a => Num (Identity a)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Identity Methods (+) :: Identity a -> Identity a -> Identity a # (-) :: Identity a -> Identity a -> Identity a # (*) :: Identity a -> Identity a -> Identity a # negate :: Identity a -> Identity a # abs :: Identity a -> Identity a # signum :: Identity a -> Identity a # fromInteger :: Integer -> Identity a #
Ord a => Ord (Identity a)	Since: base-4.8.0.0
Instance details Defined in Data.Functor.Identity Methods compare :: Identity a -> Identity a -> Ordering # (<) :: Identity a -> Identity a -> Bool # (<=) :: Identity a -> Identity a -> Bool # (>) :: Identity a -> Identity a -> Bool # (>=) :: Identity a -> Identity a -> Bool # max :: Identity a -> Identity a -> Identity a # min :: Identity a -> Identity a -> Identity a #
Read a => Read (Identity a)	This instance would be equivalent to the derived instances of the `Identity` newtype if the `runIdentity` field were removed Since: base-4.8.0.0
Instance details Defined in Data.Functor.Identity Methods readsPrec :: Int -> ReadS (Identity a) # readList :: ReadS [Identity a] # readPrec :: ReadPrec (Identity a) # readListPrec :: ReadPrec [Identity a] #
Real a => Real (Identity a)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Identity Methods toRational :: Identity a -> Rational #
RealFloat a => RealFloat (Identity a)	Since: base-4.9.0.0
Instance details 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 # isNaN :: Identity a -> Bool # isInfinite :: Identity a -> Bool # isDenormalized :: Identity a -> Bool # isNegativeZero :: Identity a -> Bool # isIEEE :: Identity a -> Bool # atan2 :: Identity a -> Identity a -> Identity a #
RealFrac a => RealFrac (Identity a)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Identity Methods properFraction :: Integral b => Identity a -> (b, Identity a) # truncate :: Integral b => Identity a -> b # round :: Integral b => Identity a -> b # ceiling :: Integral b => Identity a -> b # floor :: Integral b => Identity a -> b #
Show a => Show (Identity a)	This instance would be equivalent to the derived instances of the `Identity` newtype if the `runIdentity` field were removed Since: base-4.8.0.0
Instance details Defined in Data.Functor.Identity Methods showsPrec :: Int -> Identity a -> ShowS # show :: Identity a -> String # showList :: [Identity a] -> ShowS #
Ix a => Ix (Identity a)	Since: base-4.9.0.0
Instance details 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
Instance details Defined in Data.String Methods fromString :: String -> Identity a #
Generic (Identity a)
Instance details Defined in Data.Functor.Identity Associated Types type Rep (Identity a) :: Type -> Type # Methods from :: Identity a -> Rep (Identity a) x # to :: Rep (Identity a) x -> Identity a #
Semigroup a => Semigroup (Identity a)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Identity Methods (<>) :: Identity a -> Identity a -> Identity a # sconcat :: NonEmpty (Identity a) -> Identity a # stimes :: Integral b => b -> Identity a -> Identity a #
Monoid a => Monoid (Identity a)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Identity Methods mempty :: Identity a # mappend :: Identity a -> Identity a -> Identity a # mconcat :: [Identity a] -> Identity a #
NFData a => NFData (Identity a)	Since: deepseq-1.4.0.0
Instance details Defined in Control.DeepSeq Methods rnf :: Identity a -> () #
Hashable a => Hashable (Identity a)
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Identity a -> Int # hash :: Identity a -> Int #
Storable a => Storable (Identity a)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Identity Methods sizeOf :: Identity a -> Int # 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 () # peek :: Ptr (Identity a) -> IO (Identity a) # poke :: Ptr (Identity a) -> Identity a -> IO () #
Bits a => Bits (Identity a)	Since: base-4.9.0.0
Instance details 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 # zeroBits :: Identity a # bit :: 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 # rotateR :: Identity a -> Int -> Identity a # popCount :: Identity a -> Int #
FiniteBits a => FiniteBits (Identity a)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Identity Methods finiteBitSize :: Identity a -> Int # countLeadingZeros :: Identity a -> Int # countTrailingZeros :: Identity a -> Int #
MonoPointed (Identity a)
Instance details Defined in Data.MonoTraversable Methods opoint :: Element (Identity a) -> Identity a #
MonoTraversable (Identity a)
Instance details Defined in Data.MonoTraversable Methods otraverse :: Applicative f => (Element (Identity a) -> f (Element (Identity a))) -> Identity a -> f (Identity a) # omapM :: Applicative m => (Element (Identity a) -> m (Element (Identity a))) -> Identity a -> m (Identity a) #
MonoFoldable (Identity a)
Instance details 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 # onull :: 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) # oelem :: Element (Identity a) -> Identity a -> Bool # onotElem :: Element (Identity a) -> Identity a -> Bool #
MonoFunctor (Identity a)
Instance details Defined in Data.MonoTraversable Methods omap :: (Element (Identity a) -> Element (Identity a)) -> Identity a -> Identity a #
Ixed (Identity a)
Instance details Defined in Control.Lens.At Methods ix :: Index (Identity a) -> Traversal' (Identity a) (IxValue (Identity a)) #
Wrapped (Identity a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (Identity a) :: Type # Methods _Wrapped' :: Iso' (Identity a) (Unwrapped (Identity a)) #
PIsString (Identity a)
Instance details Defined in Data.Singletons.Prelude.IsString Associated Types type FromString arg :: a #
SIsString a => SIsString (Identity a)
Instance details Defined in Data.Singletons.Prelude.IsString Methods sFromString :: Sing t -> Sing (Apply FromStringSym0 t) #
PBounded (Identity a)
Instance details Defined in Data.Singletons.Prelude.Enum Associated Types type MinBound :: a # type MaxBound :: a #
SBounded a => SBounded (Identity a)
Instance details Defined in Data.Singletons.Prelude.Enum Methods sMinBound :: Sing MinBoundSym0 # sMaxBound :: Sing MaxBoundSym0 #
POrd (Identity a)
Instance details Defined in Data.Singletons.Prelude.Ord Associated Types type Compare arg arg1 :: Ordering # type arg < arg1 :: Bool # type arg <= arg1 :: Bool # type arg > arg1 :: Bool # type arg >= arg1 :: Bool # type Max arg arg1 :: a # type Min arg arg1 :: a #
SOrd a => SOrd (Identity a)
Instance details 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)
Instance details Defined in Data.Singletons.Prelude.Eq Methods (%==) :: Sing a0 -> Sing b -> Sing (a0 == b) # (%/=) :: Sing a0 -> Sing b -> Sing (a0 /= b) #
PEq (Identity a)
Instance details Defined in Data.Singletons.Prelude.Eq Associated Types type x == y :: Bool # type x /= y :: Bool #
Generic1 Identity
Instance details Defined in Data.Functor.Identity Associated Types type Rep1 Identity :: k -> Type # Methods from1 :: Identity a -> Rep1 Identity a # to1 :: Rep1 Identity a -> Identity a #
t ~ Identity b => Rewrapped (Identity a) t
Instance details Defined in Control.Lens.Wrapped
Field1 (Identity a) (Identity b) a b
Instance details Defined in Control.Lens.Tuple Methods _1 :: Lens (Identity a) (Identity b) a b #
SuppressUnusedWarnings (ToEnum_6989586621680896826Sym0 :: TyFun Nat (Identity a6989586621680896076) -> Type)
Instance details Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FromInteger_6989586621680896976Sym0 :: TyFun Nat (Identity a6989586621680896087) -> Type)
Instance details Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ShowsPrec_6989586621680897011Sym0 :: TyFun Nat (Identity a6989586621680896101 ~> (Symbol ~> Symbol)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FromString_6989586621680959424Sym0 :: TyFun Symbol (Identity a6989586621680959271) -> Type)
Instance details Defined in Data.Singletons.Prelude.IsString Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (IdentitySym0 :: TyFun a6989586621679070357 (Identity a6989586621679070357) -> Type)
Instance details Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Pure_6989586621680897292Sym0 :: TyFun a6989586621679943778 (Identity a6989586621679943778) -> Type)
Instance details Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Elem_6989586621680897085Sym0 :: TyFun a6989586621680725738 (Identity a6989586621680725738 ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (RunIdentitySym0 :: TyFun (Identity a6989586621679070357) a6989586621679070357 -> Type)
Instance details Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Compare_6989586621679858845Sym0 :: TyFun (Identity a6989586621679070357) (Identity a6989586621679070357 ~> Ordering) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ToList_6989586621680897283Sym0 :: TyFun (Identity a6989586621680725735) [a6989586621680725735] -> Type)
Instance details Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680896987Sym0 :: TyFun (Identity a6989586621680896098) (Identity a6989586621680896098 ~> Identity a6989586621680896098) -> Type)
Instance details Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680896941Sym0 :: TyFun (Identity a6989586621680896087) (Identity a6989586621680896087 ~> Identity a6989586621680896087) -> Type)
Instance details Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680896923Sym0 :: TyFun (Identity a6989586621680896087) (Identity a6989586621680896087 ~> Identity a6989586621680896087) -> Type)
Instance details Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680896899Sym0 :: TyFun (Identity a6989586621680896087) (Identity a6989586621680896087 ~> Identity a6989586621680896087) -> Type)
Instance details Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Sum_6989586621680897270Sym0 :: TyFun (Identity a6989586621680725741) a6989586621680725741 -> Type)
Instance details Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Succ_6989586621680896812Sym0 :: TyFun (Identity a6989586621680896076) (Identity a6989586621680896076) -> Type)
Instance details Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Signum_6989586621680896969Sym0 :: TyFun (Identity a6989586621680896087) (Identity a6989586621680896087) -> Type)
Instance details Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Product_6989586621680897263Sym0 :: TyFun (Identity a6989586621680725742) a6989586621680725742 -> Type)
Instance details Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Pred_6989586621680896819Sym0 :: TyFun (Identity a6989586621680896076) (Identity a6989586621680896076) -> Type)
Instance details Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Null_6989586621680897247Sym0 :: TyFun (Identity a6989586621680725736) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Negate_6989586621680896955Sym0 :: TyFun (Identity a6989586621680896087) (Identity a6989586621680896087) -> Type)
Instance details Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Minimum_6989586621680897241Sym0 :: TyFun (Identity a6989586621680725740) a6989586621680725740 -> Type)
Instance details Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Maximum_6989586621680897228Sym0 :: TyFun (Identity a6989586621680725739) a6989586621680725739 -> Type)
Instance details Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Length_6989586621680897221Sym0 :: TyFun (Identity a6989586621680725737) Nat -> Type)
Instance details Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FromEnum_6989586621680896833Sym0 :: TyFun (Identity a6989586621680896076) Nat -> Type)
Instance details Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (EnumFromTo_6989586621680896844Sym0 :: TyFun (Identity a6989586621680896076) (Identity a6989586621680896076 ~> [Identity a6989586621680896076]) -> Type)
Instance details Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (EnumFromThenTo_6989586621680896860Sym0 :: TyFun (Identity a6989586621680896076) (Identity a6989586621680896076 ~> (Identity a6989586621680896076 ~> [Identity a6989586621680896076])) -> Type)
Instance details Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Abs_6989586621680896962Sym0 :: TyFun (Identity a6989586621680896087) (Identity a6989586621680896087) -> Type)
Instance details Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Foldr1_6989586621680897208Sym0 :: TyFun (a6989586621680725733 ~> (a6989586621680725733 ~> a6989586621680725733)) (Identity a6989586621680725733 ~> a6989586621680725733) -> Type)
Instance details Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Foldl1_6989586621680897142Sym0 :: TyFun (a6989586621680725734 ~> (a6989586621680725734 ~> a6989586621680725734)) (Identity a6989586621680725734 ~> a6989586621680725734) -> Type)
Instance details Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () #
SingI (IdentitySym0 :: TyFun a (Identity a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Instances Methods sing :: Sing IdentitySym0 #
SuppressUnusedWarnings (TFHelper_6989586621680897061Sym0 :: TyFun a6989586621679943773 (Identity b6989586621679943774 ~> Identity a6989586621679943773) -> Type)
Instance details Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Compare_6989586621679858845Sym1 a6989586621679858843 :: TyFun (Identity a6989586621679070357) Ordering -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680897347Sym0 :: TyFun (Identity a6989586621679943815) ((a6989586621679943815 ~> Identity b6989586621679943816) ~> Identity b6989586621679943816) -> Type)
Instance details Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680896987Sym1 a6989586621680896985 :: TyFun (Identity a6989586621680896098) (Identity a6989586621680896098) -> Type)
Instance details Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680896941Sym1 a6989586621680896939 :: TyFun (Identity a6989586621680896087) (Identity a6989586621680896087) -> Type)
Instance details Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680896923Sym1 a6989586621680896921 :: TyFun (Identity a6989586621680896087) (Identity a6989586621680896087) -> Type)
Instance details Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680896899Sym1 a6989586621680896897 :: TyFun (Identity a6989586621680896087) (Identity a6989586621680896087) -> Type)
Instance details Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ShowsPrec_6989586621680897011Sym1 a6989586621680897008 a6989586621680896101 :: TyFun (Identity a6989586621680896101) (Symbol ~> Symbol) -> Type)
Instance details Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Foldr1_6989586621680897208Sym1 a6989586621680897206 :: TyFun (Identity a6989586621680725733) a6989586621680725733 -> Type)
Instance details Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Foldl1_6989586621680897142Sym1 a6989586621680897140 :: TyFun (Identity a6989586621680725734) a6989586621680725734 -> Type)
Instance details Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (EnumFromTo_6989586621680896844Sym1 a6989586621680896842 :: TyFun (Identity a6989586621680896076) [Identity a6989586621680896076] -> Type)
Instance details Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (EnumFromThenTo_6989586621680896860Sym1 a6989586621680896857 :: TyFun (Identity a6989586621680896076) (Identity a6989586621680896076 ~> [Identity a6989586621680896076]) -> Type)
Instance details Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Elem_6989586621680897085Sym1 a6989586621680897083 :: TyFun (Identity a6989586621680725738) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680897303Sym0 :: TyFun (Identity (a6989586621679943779 ~> b6989586621679943780)) (Identity a6989586621679943779 ~> Identity b6989586621679943780) -> Type)
Instance details Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Foldr_6989586621680897167Sym0 :: TyFun (a6989586621680725725 ~> (b6989586621680725726 ~> b6989586621680725726)) (b6989586621680725726 ~> (Identity a6989586621680725725 ~> b6989586621680725726)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Foldr'_6989586621680897193Sym0 :: TyFun (a6989586621680725727 ~> (b6989586621680725728 ~> b6989586621680725728)) (b6989586621680725728 ~> (Identity a6989586621680725727 ~> b6989586621680725728)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Foldl_6989586621680897101Sym0 :: TyFun (b6989586621680725729 ~> (a6989586621680725730 ~> b6989586621680725729)) (b6989586621680725729 ~> (Identity a6989586621680725730 ~> b6989586621680725729)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Foldl'_6989586621680897130Sym0 :: TyFun (b6989586621680725731 ~> (a6989586621680725732 ~> b6989586621680725731)) (b6989586621680725731 ~> (Identity a6989586621680725732 ~> b6989586621680725731)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FoldMap_6989586621680897073Sym0 :: TyFun (a6989586621680725724 ~> m6989586621680725723) (Identity a6989586621680725724 ~> m6989586621680725723) -> Type)
Instance details Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Fmap_6989586621680897042Sym0 :: TyFun (a6989586621679943771 ~> b6989586621679943772) (Identity a6989586621679943771 ~> Identity b6989586621679943772) -> Type)
Instance details Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Foldr_6989586621680897167Sym1 a6989586621680897164 :: TyFun b6989586621680725726 (Identity a6989586621680725725 ~> b6989586621680725726) -> Type)
Instance details Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Foldr'_6989586621680897193Sym1 a6989586621680897190 :: TyFun b6989586621680725728 (Identity a6989586621680725727 ~> b6989586621680725728) -> Type)
Instance details Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Foldl_6989586621680897101Sym1 a6989586621680897098 :: TyFun b6989586621680725729 (Identity a6989586621680725730 ~> b6989586621680725729) -> Type)
Instance details Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Foldl'_6989586621680897130Sym1 a6989586621680897127 :: TyFun b6989586621680725731 (Identity a6989586621680725732 ~> b6989586621680725731) -> Type)
Instance details Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680897303Sym1 a6989586621680897301 :: TyFun (Identity a6989586621679943779) (Identity b6989586621679943780) -> Type)
Instance details Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680897061Sym1 a6989586621680897059 b6989586621679943774 :: TyFun (Identity b6989586621679943774) (Identity a6989586621679943773) -> Type)
Instance details Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FoldMap_6989586621680897073Sym1 a6989586621680897071 :: TyFun (Identity a6989586621680725724) m6989586621680725723 -> Type)
Instance details Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Fmap_6989586621680897042Sym1 a6989586621680897040 :: TyFun (Identity a6989586621679943771) (Identity b6989586621679943772) -> Type)
Instance details Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (EnumFromThenTo_6989586621680896860Sym2 a6989586621680896858 a6989586621680896857 :: TyFun (Identity a6989586621680896076) [Identity a6989586621680896076] -> Type)
Instance details Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Traverse_6989586621680971087Sym0 :: TyFun (a6989586621680959944 ~> f6989586621680959943 b6989586621680959945) (Identity a6989586621680959944 ~> f6989586621680959943 (Identity b6989586621680959945)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680970873Scrutinee_6989586621680970385Sym0 :: TyFun (a6989586621680959944 ~> b6989586621680959945) (TyFun (t6989586621680959942 a6989586621680959944) (Identity (t6989586621680959942 b6989586621680959945)) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680897347Sym1 a6989586621680897345 b6989586621679943816 :: TyFun (a6989586621679943815 ~> Identity b6989586621679943816) (Identity b6989586621679943816) -> Type)
Instance details Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (LiftA2_6989586621680897328Sym0 :: TyFun (a6989586621679943781 ~> (b6989586621679943782 ~> c6989586621679943783)) (Identity a6989586621679943781 ~> (Identity b6989586621679943782 ~> Identity c6989586621679943783)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680970873Scrutinee_6989586621680970385Sym1 f6989586621680970871 :: TyFun (t6989586621680959942 a6989586621680959944) (Identity (t6989586621680959942 b6989586621680959945)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Traverse_6989586621680971087Sym1 a6989586621680971085 :: TyFun (Identity a6989586621680959944) (f6989586621680959943 (Identity b6989586621680959945)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (LiftA2_6989586621680897328Sym1 a6989586621680897325 :: TyFun (Identity a6989586621679943781) (Identity b6989586621679943782 ~> Identity c6989586621679943783) -> Type)
Instance details Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Foldr_6989586621680897167Sym2 a6989586621680897165 a6989586621680897164 :: TyFun (Identity a6989586621680725725) b6989586621680725726 -> Type)
Instance details Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Foldr'_6989586621680897193Sym2 a6989586621680897191 a6989586621680897190 :: TyFun (Identity a6989586621680725727) b6989586621680725728 -> Type)
Instance details Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Foldl_6989586621680897101Sym2 a6989586621680897099 a6989586621680897098 :: TyFun (Identity a6989586621680725730) b6989586621680725729 -> Type)
Instance details Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Foldl'_6989586621680897130Sym2 a6989586621680897128 a6989586621680897127 :: TyFun (Identity a6989586621680725732) b6989586621680725731 -> Type)
Instance details Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (LiftA2_6989586621680897328Sym2 a6989586621680897326 a6989586621680897325 :: TyFun (Identity b6989586621679943782) (Identity c6989586621679943783) -> Type)
Instance details Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () #
type Rep Identity
Instance details Defined in Data.Functor.Rep type Rep Identity = ()
type Key Identity
Instance details Defined in Data.Key type Key Identity = ()
type Product (a :: Identity k2)
Instance details Defined in Data.Singletons.Prelude.Identity type Product (a :: Identity k2) = Apply (Product_6989586621680897263Sym0 :: TyFun (Identity k2) k2 -> Type) a
type Sum (a :: Identity k2)
Instance details Defined in Data.Singletons.Prelude.Identity type Sum (a :: Identity k2) = Apply (Sum_6989586621680897270Sym0 :: TyFun (Identity k2) k2 -> Type) a
type Minimum (a :: Identity k2)
Instance details Defined in Data.Singletons.Prelude.Identity type Minimum (a :: Identity k2) = Apply (Minimum_6989586621680897241Sym0 :: TyFun (Identity k2) k2 -> Type) a
type Maximum (a :: Identity k2)
Instance details Defined in Data.Singletons.Prelude.Identity type Maximum (a :: Identity k2) = Apply (Maximum_6989586621680897228Sym0 :: TyFun (Identity k2) k2 -> Type) a
type Length (a :: Identity a6989586621680725737)
Instance details Defined in Data.Singletons.Prelude.Identity type Length (a :: Identity a6989586621680725737) = Apply (Length_6989586621680897221Sym0 :: TyFun (Identity a6989586621680725737) Nat -> Type) a
type Null (a :: Identity a6989586621680725736)
Instance details Defined in Data.Singletons.Prelude.Identity type Null (a :: Identity a6989586621680725736) = Apply (Null_6989586621680897247Sym0 :: TyFun (Identity a6989586621680725736) Bool -> Type) a
type ToList (a :: Identity a6989586621680725735)
Instance details Defined in Data.Singletons.Prelude.Identity type ToList (a :: Identity a6989586621680725735) = Apply (ToList_6989586621680897283Sym0 :: TyFun (Identity a6989586621680725735) [a6989586621680725735] -> Type) a
type Fold (arg :: Identity m)
Instance details Defined in Data.Singletons.Prelude.Identity type Fold (arg :: Identity m) = Apply (Fold_6989586621680726406Sym0 :: TyFun (Identity m) m -> Type) arg
type Pure (a :: k1)
Instance details Defined in Data.Singletons.Prelude.Identity type Pure (a :: k1) = Apply (Pure_6989586621680897292Sym0 :: TyFun k1 (Identity k1) -> Type) a
type Fail arg
Instance details Defined in Data.Singletons.Prelude.Identity type Fail arg = Apply (Fail_6989586621679945585Sym0 :: TyFun Symbol (Identity a) -> Type) arg
type Return (arg :: a)
Instance details Defined in Data.Singletons.Prelude.Identity type Return (arg :: a) = Apply (Return_6989586621679945578Sym0 :: TyFun a (Identity a) -> Type) arg
type Sequence (arg :: Identity (m a))
Instance details Defined in Data.Singletons.Prelude.Traversable type Sequence (arg :: Identity (m a)) = Apply (Sequence_6989586621680960784Sym0 :: TyFun (Identity (m a)) (m (Identity a)) -> Type) arg
type SequenceA (arg :: Identity (f a))
Instance details Defined in Data.Singletons.Prelude.Traversable type SequenceA (arg :: Identity (f a)) = Apply (SequenceA_6989586621680960756Sym0 :: TyFun (Identity (f a)) (f (Identity a)) -> Type) arg
type Elem (a1 :: k1) (a2 :: Identity k1)
Instance details Defined in Data.Singletons.Prelude.Identity type Elem (a1 :: k1) (a2 :: Identity k1) = Apply (Apply (Elem_6989586621680897085Sym0 :: TyFun k1 (Identity k1 ~> Bool) -> Type) a1) a2
type Foldl1 (a1 :: k2 ~> (k2 ~> k2)) (a2 :: Identity k2)
Instance details Defined in Data.Singletons.Prelude.Identity type Foldl1 (a1 :: k2 ~> (k2 ~> k2)) (a2 :: Identity k2) = Apply (Apply (Foldl1_6989586621680897142Sym0 :: TyFun (k2 ~> (k2 ~> k2)) (Identity k2 ~> k2) -> Type) a1) a2
type Foldr1 (a1 :: k2 ~> (k2 ~> k2)) (a2 :: Identity k2)
Instance details Defined in Data.Singletons.Prelude.Identity type Foldr1 (a1 :: k2 ~> (k2 ~> k2)) (a2 :: Identity k2) = Apply (Apply (Foldr1_6989586621680897208Sym0 :: TyFun (k2 ~> (k2 ~> k2)) (Identity k2 ~> k2) -> Type) a1) a2
type FoldMap (a1 :: a6989586621680725724 ~> k2) (a2 :: Identity a6989586621680725724)
Instance details Defined in Data.Singletons.Prelude.Identity type FoldMap (a1 :: a6989586621680725724 ~> k2) (a2 :: Identity a6989586621680725724) = Apply (Apply (FoldMap_6989586621680897073Sym0 :: TyFun (a6989586621680725724 ~> k2) (Identity a6989586621680725724 ~> k2) -> Type) a1) a2
type (a1 :: k1) <$ (a2 :: Identity b6989586621679943774)
Instance details Defined in Data.Singletons.Prelude.Identity type (a1 :: k1) <$ (a2 :: Identity b6989586621679943774) = Apply (Apply (TFHelper_6989586621680897061Sym0 :: TyFun k1 (Identity b6989586621679943774 ~> Identity k1) -> Type) a1) a2
type Fmap (a1 :: a6989586621679943771 ~> b6989586621679943772) (a2 :: Identity a6989586621679943771)
Instance details Defined in Data.Singletons.Prelude.Identity type Fmap (a1 :: a6989586621679943771 ~> b6989586621679943772) (a2 :: Identity a6989586621679943771) = Apply (Apply (Fmap_6989586621680897042Sym0 :: TyFun (a6989586621679943771 ~> b6989586621679943772) (Identity a6989586621679943771 ~> Identity b6989586621679943772) -> Type) a1) a2
type (arg1 :: Identity a) <* (arg2 :: Identity b)
Instance details Defined in Data.Singletons.Prelude.Identity type (arg1 :: Identity a) <* (arg2 :: Identity b) = Apply (Apply (TFHelper_6989586621679945533Sym0 :: TyFun (Identity a) (Identity b ~> Identity a) -> Type) arg1) arg2
type (arg1 :: Identity a) *> (arg2 :: Identity b)
Instance details Defined in Data.Singletons.Prelude.Identity type (arg1 :: Identity a) *> (arg2 :: Identity b) = Apply (Apply (TFHelper_6989586621679945517Sym0 :: TyFun (Identity a) (Identity b ~> Identity b) -> Type) arg1) arg2
type (a1 :: Identity (a6989586621679943779 ~> b6989586621679943780)) <*> (a2 :: Identity a6989586621679943779)
Instance details Defined in Data.Singletons.Prelude.Identity type (a1 :: Identity (a6989586621679943779 ~> b6989586621679943780)) <*> (a2 :: Identity a6989586621679943779) = Apply (Apply (TFHelper_6989586621680897303Sym0 :: TyFun (Identity (a6989586621679943779 ~> b6989586621679943780)) (Identity a6989586621679943779 ~> Identity b6989586621679943780) -> Type) a1) a2
type (arg1 :: Identity a) >> (arg2 :: Identity b)
Instance details Defined in Data.Singletons.Prelude.Identity type (arg1 :: Identity a) >> (arg2 :: Identity b) = Apply (Apply (TFHelper_6989586621679945568Sym0 :: TyFun (Identity a) (Identity b ~> Identity b) -> Type) arg1) arg2
type (a1 :: Identity a6989586621679943815) >>= (a2 :: a6989586621679943815 ~> Identity b6989586621679943816)
Instance details Defined in Data.Singletons.Prelude.Identity type (a1 :: Identity a6989586621679943815) >>= (a2 :: a6989586621679943815 ~> Identity b6989586621679943816) = Apply (Apply (TFHelper_6989586621680897347Sym0 :: TyFun (Identity a6989586621679943815) ((a6989586621679943815 ~> Identity b6989586621679943816) ~> Identity b6989586621679943816) -> Type) a1) a2
type MapM (arg1 :: a ~> m b) (arg2 :: Identity a)
Instance details Defined in Data.Singletons.Prelude.Traversable type MapM (arg1 :: a ~> m b) (arg2 :: Identity a) = Apply (Apply (MapM_6989586621680960774Sym0 :: TyFun (a ~> m b) (Identity a ~> m (Identity b)) -> Type) arg1) arg2
type Traverse (a1 :: a6989586621680959944 ~> f6989586621680959943 b6989586621680959945) (a2 :: Identity a6989586621680959944)
Instance details Defined in Data.Singletons.Prelude.Traversable type Traverse (a1 :: a6989586621680959944 ~> f6989586621680959943 b6989586621680959945) (a2 :: Identity a6989586621680959944) = Apply (Apply (Traverse_6989586621680971087Sym0 :: TyFun (a6989586621680959944 ~> f6989586621680959943 b6989586621680959945) (Identity a6989586621680959944 ~> f6989586621680959943 (Identity b6989586621680959945)) -> Type) a1) a2
type Foldl' (a1 :: k2 ~> (a6989586621680725732 ~> k2)) (a2 :: k2) (a3 :: Identity a6989586621680725732)
Instance details Defined in Data.Singletons.Prelude.Identity type Foldl' (a1 :: k2 ~> (a6989586621680725732 ~> k2)) (a2 :: k2) (a3 :: Identity a6989586621680725732) = Apply (Apply (Apply (Foldl'_6989586621680897130Sym0 :: TyFun (k2 ~> (a6989586621680725732 ~> k2)) (k2 ~> (Identity a6989586621680725732 ~> k2)) -> Type) a1) a2) a3
type Foldl (a1 :: k2 ~> (a6989586621680725730 ~> k2)) (a2 :: k2) (a3 :: Identity a6989586621680725730)
Instance details Defined in Data.Singletons.Prelude.Identity type Foldl (a1 :: k2 ~> (a6989586621680725730 ~> k2)) (a2 :: k2) (a3 :: Identity a6989586621680725730) = Apply (Apply (Apply (Foldl_6989586621680897101Sym0 :: TyFun (k2 ~> (a6989586621680725730 ~> k2)) (k2 ~> (Identity a6989586621680725730 ~> k2)) -> Type) a1) a2) a3
type Foldr' (a1 :: a6989586621680725727 ~> (k2 ~> k2)) (a2 :: k2) (a3 :: Identity a6989586621680725727)
Instance details Defined in Data.Singletons.Prelude.Identity type Foldr' (a1 :: a6989586621680725727 ~> (k2 ~> k2)) (a2 :: k2) (a3 :: Identity a6989586621680725727) = Apply (Apply (Apply (Foldr'_6989586621680897193Sym0 :: TyFun (a6989586621680725727 ~> (k2 ~> k2)) (k2 ~> (Identity a6989586621680725727 ~> k2)) -> Type) a1) a2) a3
type Foldr (a1 :: a6989586621680725725 ~> (k2 ~> k2)) (a2 :: k2) (a3 :: Identity a6989586621680725725)
Instance details Defined in Data.Singletons.Prelude.Identity type Foldr (a1 :: a6989586621680725725 ~> (k2 ~> k2)) (a2 :: k2) (a3 :: Identity a6989586621680725725) = Apply (Apply (Apply (Foldr_6989586621680897167Sym0 :: TyFun (a6989586621680725725 ~> (k2 ~> k2)) (k2 ~> (Identity a6989586621680725725 ~> k2)) -> Type) a1) a2) a3
type LiftA2 (a1 :: a6989586621679943781 ~> (b6989586621679943782 ~> c6989586621679943783)) (a2 :: Identity a6989586621679943781) (a3 :: Identity b6989586621679943782)
Instance details Defined in Data.Singletons.Prelude.Identity type LiftA2 (a1 :: a6989586621679943781 ~> (b6989586621679943782 ~> c6989586621679943783)) (a2 :: Identity a6989586621679943781) (a3 :: Identity b6989586621679943782) = Apply (Apply (Apply (LiftA2_6989586621680897328Sym0 :: TyFun (a6989586621679943781 ~> (b6989586621679943782 ~> c6989586621679943783)) (Identity a6989586621679943781 ~> (Identity b6989586621679943782 ~> Identity c6989586621679943783)) -> Type) a1) a2) a3
type Apply (Null_6989586621680897247Sym0 :: TyFun (Identity a) Bool -> Type) (a6989586621680897246 :: Identity a)
Instance details Defined in Data.Singletons.Prelude.Identity type Apply (Null_6989586621680897247Sym0 :: TyFun (Identity a) Bool -> Type) (a6989586621680897246 :: Identity a) = Null_6989586621680897247 a6989586621680897246
type Apply (FromEnum_6989586621680896833Sym0 :: TyFun (Identity a) Nat -> Type) (a6989586621680896832 :: Identity a)
Instance details Defined in Data.Singletons.Prelude.Identity type Apply (FromEnum_6989586621680896833Sym0 :: TyFun (Identity a) Nat -> Type) (a6989586621680896832 :: Identity a) = FromEnum_6989586621680896833 a6989586621680896832
type Apply (Length_6989586621680897221Sym0 :: TyFun (Identity a) Nat -> Type) (a6989586621680897220 :: Identity a)
Instance details Defined in Data.Singletons.Prelude.Identity type Apply (Length_6989586621680897221Sym0 :: TyFun (Identity a) Nat -> Type) (a6989586621680897220 :: Identity a) = Length_6989586621680897221 a6989586621680897220
type Apply (RunIdentitySym0 :: TyFun (Identity a) a -> Type) (a6989586621679738531 :: Identity a)
Instance details Defined in Data.Singletons.Prelude.Instances type Apply (RunIdentitySym0 :: TyFun (Identity a) a -> Type) (a6989586621679738531 :: Identity a) = RunIdentity a6989586621679738531
type Apply (Maximum_6989586621680897228Sym0 :: TyFun (Identity a) a -> Type) (a6989586621680897227 :: Identity a)
Instance details Defined in Data.Singletons.Prelude.Identity type Apply (Maximum_6989586621680897228Sym0 :: TyFun (Identity a) a -> Type) (a6989586621680897227 :: Identity a) = Maximum_6989586621680897228 a6989586621680897227
type Apply (Minimum_6989586621680897241Sym0 :: TyFun (Identity a) a -> Type) (a6989586621680897240 :: Identity a)
Instance details Defined in Data.Singletons.Prelude.Identity type Apply (Minimum_6989586621680897241Sym0 :: TyFun (Identity a) a -> Type) (a6989586621680897240 :: Identity a) = Minimum_6989586621680897241 a6989586621680897240
type Apply (Product_6989586621680897263Sym0 :: TyFun (Identity a) a -> Type) (a6989586621680897262 :: Identity a)
Instance details Defined in Data.Singletons.Prelude.Identity type Apply (Product_6989586621680897263Sym0 :: TyFun (Identity a) a -> Type) (a6989586621680897262 :: Identity a) = Product_6989586621680897263 a6989586621680897262
type Apply (Sum_6989586621680897270Sym0 :: TyFun (Identity a) a -> Type) (a6989586621680897269 :: Identity a)
Instance details Defined in Data.Singletons.Prelude.Identity type Apply (Sum_6989586621680897270Sym0 :: TyFun (Identity a) a -> Type) (a6989586621680897269 :: Identity a) = Sum_6989586621680897270 a6989586621680897269
type Apply (Elem_6989586621680897085Sym1 a6989586621680897083 :: TyFun (Identity a) Bool -> Type) (a6989586621680897084 :: Identity a)
Instance details Defined in Data.Singletons.Prelude.Identity type Apply (Elem_6989586621680897085Sym1 a6989586621680897083 :: TyFun (Identity a) Bool -> Type) (a6989586621680897084 :: Identity a) = Elem_6989586621680897085 a6989586621680897083 a6989586621680897084
type Apply (Compare_6989586621679858845Sym1 a6989586621679858843 :: TyFun (Identity a) Ordering -> Type) (a6989586621679858844 :: Identity a)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Compare_6989586621679858845Sym1 a6989586621679858843 :: TyFun (Identity a) Ordering -> Type) (a6989586621679858844 :: Identity a) = Compare_6989586621679858845 a6989586621679858843 a6989586621679858844
type Apply (Foldl1_6989586621680897142Sym1 a6989586621680897140 :: TyFun (Identity a) a -> Type) (a6989586621680897141 :: Identity a)
Instance details Defined in Data.Singletons.Prelude.Identity type Apply (Foldl1_6989586621680897142Sym1 a6989586621680897140 :: TyFun (Identity a) a -> Type) (a6989586621680897141 :: Identity a) = Foldl1_6989586621680897142 a6989586621680897140 a6989586621680897141
type Apply (Foldr1_6989586621680897208Sym1 a6989586621680897206 :: TyFun (Identity a) a -> Type) (a6989586621680897207 :: Identity a)
Instance details Defined in Data.Singletons.Prelude.Identity type Apply (Foldr1_6989586621680897208Sym1 a6989586621680897206 :: TyFun (Identity a) a -> Type) (a6989586621680897207 :: Identity a) = Foldr1_6989586621680897208 a6989586621680897206 a6989586621680897207
type Apply (FoldMap_6989586621680897073Sym1 a6989586621680897071 :: TyFun (Identity a) m -> Type) (a6989586621680897072 :: Identity a)
Instance details Defined in Data.Singletons.Prelude.Identity type Apply (FoldMap_6989586621680897073Sym1 a6989586621680897071 :: TyFun (Identity a) m -> Type) (a6989586621680897072 :: Identity a) = FoldMap_6989586621680897073 a6989586621680897071 a6989586621680897072
type Apply (Foldl_6989586621680897101Sym2 a6989586621680897099 a6989586621680897098 :: TyFun (Identity a) b -> Type) (a6989586621680897100 :: Identity a)
Instance details Defined in Data.Singletons.Prelude.Identity type Apply (Foldl_6989586621680897101Sym2 a6989586621680897099 a6989586621680897098 :: TyFun (Identity a) b -> Type) (a6989586621680897100 :: Identity a) = Foldl_6989586621680897101 a6989586621680897099 a6989586621680897098 a6989586621680897100
type Apply (Foldl'_6989586621680897130Sym2 a6989586621680897128 a6989586621680897127 :: TyFun (Identity a) b -> Type) (a6989586621680897129 :: Identity a)
Instance details Defined in Data.Singletons.Prelude.Identity type Apply (Foldl'_6989586621680897130Sym2 a6989586621680897128 a6989586621680897127 :: TyFun (Identity a) b -> Type) (a6989586621680897129 :: Identity a) = Foldl'_6989586621680897130 a6989586621680897128 a6989586621680897127 a6989586621680897129
type Apply (Foldr_6989586621680897167Sym2 a6989586621680897165 a6989586621680897164 :: TyFun (Identity a) b -> Type) (a6989586621680897166 :: Identity a)
Instance details Defined in Data.Singletons.Prelude.Identity type Apply (Foldr_6989586621680897167Sym2 a6989586621680897165 a6989586621680897164 :: TyFun (Identity a) b -> Type) (a6989586621680897166 :: Identity a) = Foldr_6989586621680897167 a6989586621680897165 a6989586621680897164 a6989586621680897166
type Apply (Foldr'_6989586621680897193Sym2 a6989586621680897191 a6989586621680897190 :: TyFun (Identity a) b -> Type) (a6989586621680897192 :: Identity a)
Instance details Defined in Data.Singletons.Prelude.Identity type Apply (Foldr'_6989586621680897193Sym2 a6989586621680897191 a6989586621680897190 :: TyFun (Identity a) b -> Type) (a6989586621680897192 :: Identity a) = Foldr'_6989586621680897193 a6989586621680897191 a6989586621680897190 a6989586621680897192
type Rep (Identity a)	Since: base-4.8.0.0
Instance details Defined in Data.Functor.Identity type Rep (Identity a) = D1 (MetaData "Identity" "Data.Functor.Identity" "base" True) (C1 (MetaCons "Identity" PrefixI True) (S1 (MetaSel (Just "runIdentity") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 a)))
type Element (Identity a)
Instance details Defined in Data.MonoTraversable type Element (Identity a) = a
type Index (Identity a)
Instance details Defined in Control.Lens.At type Index (Identity a) = ()
type IxValue (Identity a)
Instance details Defined in Control.Lens.At type IxValue (Identity a) = a
type Unwrapped (Identity a)
Instance details Defined in Control.Lens.Wrapped type Unwrapped (Identity a) = a
type Mempty
Instance details Defined in Data.Singletons.Prelude.Identity type Mempty = (Mempty_6989586621680896889Sym0 :: Identity a)
type MaxBound
Instance details Defined in Data.Singletons.Prelude.Enum type MaxBound = (MaxBound_6989586621680038598Sym0 :: Identity a)
type MinBound
Instance details Defined in Data.Singletons.Prelude.Enum type MinBound = (MinBound_6989586621680038582Sym0 :: Identity a)
data Sing (b :: Identity a)
Instance details Defined in Data.Singletons.Prelude.Instances data Sing (b :: Identity a) where SIdentity :: forall a (b :: Identity a) (n :: a). {..} -> Sing (Identity n)
type Demote (Identity a)
Instance details Defined in Data.Singletons.Prelude.Instances type Demote (Identity a) = Identity (Demote a)
type Rep1 Identity	Since: base-4.8.0.0
Instance details Defined in Data.Functor.Identity type Rep1 Identity = D1 (MetaData "Identity" "Data.Functor.Identity" "base" True) (C1 (MetaCons "Identity" PrefixI True) (S1 (MetaSel (Just "runIdentity") NoSourceUnpackedness NoSourceStrictness DecidedLazy) Par1))
type FromString a2
Instance details Defined in Data.Singletons.Prelude.IsString type FromString a2 = Apply (FromString_6989586621680959424Sym0 :: TyFun Symbol (Identity a1) -> Type) a2
type Mconcat (arg :: [Identity a])
Instance details Defined in Data.Singletons.Prelude.Identity type Mconcat (arg :: [Identity a]) = Apply (Mconcat_6989586621680665123Sym0 :: TyFun [Identity a] (Identity a) -> Type) arg
type Show_ (arg :: Identity a)
Instance details Defined in Data.Singletons.Prelude.Identity type Show_ (arg :: Identity a) = Apply (Show__6989586621680581388Sym0 :: TyFun (Identity a) Symbol -> Type) arg
type Sconcat (arg :: NonEmpty (Identity a))
Instance details Defined in Data.Singletons.Prelude.Identity type Sconcat (arg :: NonEmpty (Identity a)) = Apply (Sconcat_6989586621680188294Sym0 :: TyFun (NonEmpty (Identity a)) (Identity a) -> Type) arg
type FromEnum (a2 :: Identity a1)
Instance details Defined in Data.Singletons.Prelude.Identity type FromEnum (a2 :: Identity a1) = Apply (FromEnum_6989586621680896833Sym0 :: TyFun (Identity a1) Nat -> Type) a2
type ToEnum a2
Instance details Defined in Data.Singletons.Prelude.Identity type ToEnum a2 = Apply (ToEnum_6989586621680896826Sym0 :: TyFun Nat (Identity a1) -> Type) a2
type Pred (a2 :: Identity a1)
Instance details Defined in Data.Singletons.Prelude.Identity type Pred (a2 :: Identity a1) = Apply (Pred_6989586621680896819Sym0 :: TyFun (Identity a1) (Identity a1) -> Type) a2
type Succ (a2 :: Identity a1)
Instance details Defined in Data.Singletons.Prelude.Identity type Succ (a2 :: Identity a1) = Apply (Succ_6989586621680896812Sym0 :: TyFun (Identity a1) (Identity a1) -> Type) a2
type FromInteger a2
Instance details Defined in Data.Singletons.Prelude.Identity type FromInteger a2 = Apply (FromInteger_6989586621680896976Sym0 :: TyFun Nat (Identity a1) -> Type) a2
type Signum (a2 :: Identity a1)
Instance details Defined in Data.Singletons.Prelude.Identity type Signum (a2 :: Identity a1) = Apply (Signum_6989586621680896969Sym0 :: TyFun (Identity a1) (Identity a1) -> Type) a2
type Abs (a2 :: Identity a1)
Instance details Defined in Data.Singletons.Prelude.Identity type Abs (a2 :: Identity a1) = Apply (Abs_6989586621680896962Sym0 :: TyFun (Identity a1) (Identity a1) -> Type) a2
type Negate (a2 :: Identity a1)
Instance details Defined in Data.Singletons.Prelude.Identity type Negate (a2 :: Identity a1) = Apply (Negate_6989586621680896955Sym0 :: TyFun (Identity a1) (Identity a1) -> Type) a2
type Mappend (arg1 :: Identity a) (arg2 :: Identity a)
Instance details Defined in Data.Singletons.Prelude.Identity type Mappend (arg1 :: Identity a) (arg2 :: Identity a) = Apply (Apply (Mappend_6989586621680665113Sym0 :: TyFun (Identity a) (Identity a ~> Identity a) -> Type) arg1) arg2
type ShowList (arg1 :: [Identity a]) arg2
Instance details Defined in Data.Singletons.Prelude.Identity type ShowList (arg1 :: [Identity a]) arg2 = Apply (Apply (ShowList_6989586621680581399Sym0 :: TyFun [Identity a] (Symbol ~> Symbol) -> Type) arg1) arg2
type (a2 :: Identity a1) <> (a3 :: Identity a1)
Instance details Defined in Data.Singletons.Prelude.Identity type (a2 :: Identity a1) <> (a3 :: Identity a1) = Apply (Apply (TFHelper_6989586621680896987Sym0 :: TyFun (Identity a1) (Identity a1 ~> Identity a1) -> Type) a2) a3
type EnumFromTo (a2 :: Identity a1) (a3 :: Identity a1)
Instance details Defined in Data.Singletons.Prelude.Identity type EnumFromTo (a2 :: Identity a1) (a3 :: Identity a1) = Apply (Apply (EnumFromTo_6989586621680896844Sym0 :: TyFun (Identity a1) (Identity a1 ~> [Identity a1]) -> Type) a2) a3
type (a2 :: Identity a1) * (a3 :: Identity a1)
Instance details Defined in Data.Singletons.Prelude.Identity type (a2 :: Identity a1) * (a3 :: Identity a1) = Apply (Apply (TFHelper_6989586621680896941Sym0 :: TyFun (Identity a1) (Identity a1 ~> Identity a1) -> Type) a2) a3
type (a2 :: Identity a1) - (a3 :: Identity a1)
Instance details Defined in Data.Singletons.Prelude.Identity type (a2 :: Identity a1) - (a3 :: Identity a1) = Apply (Apply (TFHelper_6989586621680896923Sym0 :: TyFun (Identity a1) (Identity a1 ~> Identity a1) -> Type) a2) a3
type (a2 :: Identity a1) + (a3 :: Identity a1)
Instance details Defined in Data.Singletons.Prelude.Identity type (a2 :: Identity a1) + (a3 :: Identity a1) = Apply (Apply (TFHelper_6989586621680896899Sym0 :: TyFun (Identity a1) (Identity a1 ~> Identity a1) -> Type) a2) a3
type Min (arg1 :: Identity a) (arg2 :: Identity a)
Instance details Defined in Data.Singletons.Prelude.Ord type Min (arg1 :: Identity a) (arg2 :: Identity a) = Apply (Apply (Min_6989586621679832893Sym0 :: TyFun (Identity a) (Identity a ~> Identity a) -> Type) arg1) arg2
type Max (arg1 :: Identity a) (arg2 :: Identity a)
Instance details Defined in Data.Singletons.Prelude.Ord type Max (arg1 :: Identity a) (arg2 :: Identity a) = Apply (Apply (Max_6989586621679832875Sym0 :: TyFun (Identity a) (Identity a ~> Identity a) -> Type) arg1) arg2
type (arg1 :: Identity a) >= (arg2 :: Identity a)
Instance details Defined in Data.Singletons.Prelude.Ord type (arg1 :: Identity a) >= (arg2 :: Identity a) = Apply (Apply (TFHelper_6989586621679832857Sym0 :: TyFun (Identity a) (Identity a ~> Bool) -> Type) arg1) arg2
type (arg1 :: Identity a) > (arg2 :: Identity a)
Instance details Defined in Data.Singletons.Prelude.Ord type (arg1 :: Identity a) > (arg2 :: Identity a) = Apply (Apply (TFHelper_6989586621679832839Sym0 :: TyFun (Identity a) (Identity a ~> Bool) -> Type) arg1) arg2
type (arg1 :: Identity a) <= (arg2 :: Identity a)
Instance details Defined in Data.Singletons.Prelude.Ord type (arg1 :: Identity a) <= (arg2 :: Identity a) = Apply (Apply (TFHelper_6989586621679832817Sym0 :: TyFun (Identity a) (Identity a ~> Bool) -> Type) arg1) arg2
type (arg1 :: Identity a) < (arg2 :: Identity a)
Instance details Defined in Data.Singletons.Prelude.Ord type (arg1 :: Identity a) < (arg2 :: Identity a) = Apply (Apply (TFHelper_6989586621679832797Sym0 :: TyFun (Identity a) (Identity a ~> Bool) -> Type) arg1) arg2
type Compare (a2 :: Identity a1) (a3 :: Identity a1)
Instance details Defined in Data.Singletons.Prelude.Ord type Compare (a2 :: Identity a1) (a3 :: Identity a1) = Apply (Apply (Compare_6989586621679858845Sym0 :: TyFun (Identity a1) (Identity a1 ~> Ordering) -> Type) a2) a3
type (x :: Identity a) /= (y :: Identity a)
Instance details Defined in Data.Singletons.Prelude.Eq type (x :: Identity a) /= (y :: Identity a) = Not (x == y)
type (a2 :: Identity a1) == (b :: Identity a1)
Instance details Defined in Data.Singletons.Prelude.Eq type (a2 :: Identity a1) == (b :: Identity a1) = Equals_6989586621679804325 a2 b
type ShowsPrec a2 (a3 :: Identity a1) a4
Instance details Defined in Data.Singletons.Prelude.Identity type ShowsPrec a2 (a3 :: Identity a1) a4 = Apply (Apply (Apply (ShowsPrec_6989586621680897011Sym0 :: TyFun Nat (Identity a1 ~> (Symbol ~> Symbol)) -> Type) a2) a3) a4
type EnumFromThenTo (a2 :: Identity a1) (a3 :: Identity a1) (a4 :: Identity a1)
Instance details Defined in Data.Singletons.Prelude.Identity type EnumFromThenTo (a2 :: Identity a1) (a3 :: Identity a1) (a4 :: Identity a1) = Apply (Apply (Apply (EnumFromThenTo_6989586621680896860Sym0 :: TyFun (Identity a1) (Identity a1 ~> (Identity a1 ~> [Identity a1])) -> Type) a2) a3) a4
type Apply (FromString_6989586621680959424Sym0 :: TyFun Symbol (Identity a6989586621680959271) -> Type) (a6989586621680959423 :: Symbol)
Instance details Defined in Data.Singletons.Prelude.IsString type Apply (FromString_6989586621680959424Sym0 :: TyFun Symbol (Identity a6989586621680959271) -> Type) (a6989586621680959423 :: Symbol) = (FromString_6989586621680959424 a6989586621680959423 :: Identity a6989586621680959271)
type Apply (IdentitySym0 :: TyFun a (Identity a) -> Type) (t6989586621679738534 :: a)
Instance details Defined in Data.Singletons.Prelude.Instances type Apply (IdentitySym0 :: TyFun a (Identity a) -> Type) (t6989586621679738534 :: a) = Identity t6989586621679738534
type Apply (ToEnum_6989586621680896826Sym0 :: TyFun Nat (Identity a6989586621680896076) -> Type) (a6989586621680896825 :: Nat)
Instance details Defined in Data.Singletons.Prelude.Identity type Apply (ToEnum_6989586621680896826Sym0 :: TyFun Nat (Identity a6989586621680896076) -> Type) (a6989586621680896825 :: Nat) = (ToEnum_6989586621680896826 a6989586621680896825 :: Identity a6989586621680896076)
type Apply (FromInteger_6989586621680896976Sym0 :: TyFun Nat (Identity a6989586621680896087) -> Type) (a6989586621680896975 :: Nat)
Instance details Defined in Data.Singletons.Prelude.Identity type Apply (FromInteger_6989586621680896976Sym0 :: TyFun Nat (Identity a6989586621680896087) -> Type) (a6989586621680896975 :: Nat) = (FromInteger_6989586621680896976 a6989586621680896975 :: Identity a6989586621680896087)
type Apply (Pure_6989586621680897292Sym0 :: TyFun a (Identity a) -> Type) (a6989586621680897291 :: a)
Instance details Defined in Data.Singletons.Prelude.Identity type Apply (Pure_6989586621680897292Sym0 :: TyFun a (Identity a) -> Type) (a6989586621680897291 :: a) = Pure_6989586621680897292 a6989586621680897291
type Apply (ToList_6989586621680897283Sym0 :: TyFun (Identity a) [a] -> Type) (a6989586621680897282 :: Identity a)
Instance details Defined in Data.Singletons.Prelude.Identity type Apply (ToList_6989586621680897283Sym0 :: TyFun (Identity a) [a] -> Type) (a6989586621680897282 :: Identity a) = ToList_6989586621680897283 a6989586621680897282
type Apply (Succ_6989586621680896812Sym0 :: TyFun (Identity a) (Identity a) -> Type) (a6989586621680896811 :: Identity a)
Instance details Defined in Data.Singletons.Prelude.Identity type Apply (Succ_6989586621680896812Sym0 :: TyFun (Identity a) (Identity a) -> Type) (a6989586621680896811 :: Identity a) = Succ_6989586621680896812 a6989586621680896811
type Apply (Pred_6989586621680896819Sym0 :: TyFun (Identity a) (Identity a) -> Type) (a6989586621680896818 :: Identity a)
Instance details Defined in Data.Singletons.Prelude.Identity type Apply (Pred_6989586621680896819Sym0 :: TyFun (Identity a) (Identity a) -> Type) (a6989586621680896818 :: Identity a) = Pred_6989586621680896819 a6989586621680896818
type Apply (Negate_6989586621680896955Sym0 :: TyFun (Identity a) (Identity a) -> Type) (a6989586621680896954 :: Identity a)
Instance details Defined in Data.Singletons.Prelude.Identity type Apply (Negate_6989586621680896955Sym0 :: TyFun (Identity a) (Identity a) -> Type) (a6989586621680896954 :: Identity a) = Negate_6989586621680896955 a6989586621680896954
type Apply (Abs_6989586621680896962Sym0 :: TyFun (Identity a) (Identity a) -> Type) (a6989586621680896961 :: Identity a)
Instance details Defined in Data.Singletons.Prelude.Identity type Apply (Abs_6989586621680896962Sym0 :: TyFun (Identity a) (Identity a) -> Type) (a6989586621680896961 :: Identity a) = Abs_6989586621680896962 a6989586621680896961
type Apply (Signum_6989586621680896969Sym0 :: TyFun (Identity a) (Identity a) -> Type) (a6989586621680896968 :: Identity a)
Instance details Defined in Data.Singletons.Prelude.Identity type Apply (Signum_6989586621680896969Sym0 :: TyFun (Identity a) (Identity a) -> Type) (a6989586621680896968 :: Identity a) = Signum_6989586621680896969 a6989586621680896968
type Apply (EnumFromTo_6989586621680896844Sym1 a6989586621680896842 :: TyFun (Identity a) [Identity a] -> Type) (a6989586621680896843 :: Identity a)
Instance details Defined in Data.Singletons.Prelude.Identity type Apply (EnumFromTo_6989586621680896844Sym1 a6989586621680896842 :: TyFun (Identity a) [Identity a] -> Type) (a6989586621680896843 :: Identity a) = EnumFromTo_6989586621680896844 a6989586621680896842 a6989586621680896843
type Apply (TFHelper_6989586621680896899Sym1 a6989586621680896897 :: TyFun (Identity a) (Identity a) -> Type) (a6989586621680896898 :: Identity a)
Instance details Defined in Data.Singletons.Prelude.Identity type Apply (TFHelper_6989586621680896899Sym1 a6989586621680896897 :: TyFun (Identity a) (Identity a) -> Type) (a6989586621680896898 :: Identity a) = TFHelper_6989586621680896899 a6989586621680896897 a6989586621680896898
type Apply (TFHelper_6989586621680896923Sym1 a6989586621680896921 :: TyFun (Identity a) (Identity a) -> Type) (a6989586621680896922 :: Identity a)
Instance details Defined in Data.Singletons.Prelude.Identity type Apply (TFHelper_6989586621680896923Sym1 a6989586621680896921 :: TyFun (Identity a) (Identity a) -> Type) (a6989586621680896922 :: Identity a) = TFHelper_6989586621680896923 a6989586621680896921 a6989586621680896922
type Apply (TFHelper_6989586621680896941Sym1 a6989586621680896939 :: TyFun (Identity a) (Identity a) -> Type) (a6989586621680896940 :: Identity a)
Instance details Defined in Data.Singletons.Prelude.Identity type Apply (TFHelper_6989586621680896941Sym1 a6989586621680896939 :: TyFun (Identity a) (Identity a) -> Type) (a6989586621680896940 :: Identity a) = TFHelper_6989586621680896941 a6989586621680896939 a6989586621680896940
type Apply (TFHelper_6989586621680896987Sym1 a6989586621680896985 :: TyFun (Identity a) (Identity a) -> Type) (a6989586621680896986 :: Identity a)
Instance details Defined in Data.Singletons.Prelude.Identity type Apply (TFHelper_6989586621680896987Sym1 a6989586621680896985 :: TyFun (Identity a) (Identity a) -> Type) (a6989586621680896986 :: Identity a) = TFHelper_6989586621680896987 a6989586621680896985 a6989586621680896986
type Apply (EnumFromThenTo_6989586621680896860Sym2 a6989586621680896858 a6989586621680896857 :: TyFun (Identity a) [Identity a] -> Type) (a6989586621680896859 :: Identity a)
Instance details Defined in Data.Singletons.Prelude.Identity type Apply (EnumFromThenTo_6989586621680896860Sym2 a6989586621680896858 a6989586621680896857 :: TyFun (Identity a) [Identity a] -> Type) (a6989586621680896859 :: Identity a) = EnumFromThenTo_6989586621680896860 a6989586621680896858 a6989586621680896857 a6989586621680896859
type Apply (Fmap_6989586621680897042Sym1 a6989586621680897040 :: TyFun (Identity a) (Identity b) -> Type) (a6989586621680897041 :: Identity a)
Instance details Defined in Data.Singletons.Prelude.Identity type Apply (Fmap_6989586621680897042Sym1 a6989586621680897040 :: TyFun (Identity a) (Identity b) -> Type) (a6989586621680897041 :: Identity a) = Fmap_6989586621680897042 a6989586621680897040 a6989586621680897041
type Apply (TFHelper_6989586621680897061Sym1 a6989586621680897059 b :: TyFun (Identity b) (Identity a) -> Type) (a6989586621680897060 :: Identity b)
Instance details Defined in Data.Singletons.Prelude.Identity type Apply (TFHelper_6989586621680897061Sym1 a6989586621680897059 b :: TyFun (Identity b) (Identity a) -> Type) (a6989586621680897060 :: Identity b) = TFHelper_6989586621680897061 a6989586621680897059 a6989586621680897060
type Apply (TFHelper_6989586621680897303Sym1 a6989586621680897301 :: TyFun (Identity a) (Identity b) -> Type) (a6989586621680897302 :: Identity a)
Instance details Defined in Data.Singletons.Prelude.Identity type Apply (TFHelper_6989586621680897303Sym1 a6989586621680897301 :: TyFun (Identity a) (Identity b) -> Type) (a6989586621680897302 :: Identity a) = TFHelper_6989586621680897303 a6989586621680897301 a6989586621680897302
type Apply (Traverse_6989586621680971087Sym1 a6989586621680971085 :: TyFun (Identity a) (f (Identity b)) -> Type) (a6989586621680971086 :: Identity a)
Instance details Defined in Data.Singletons.Prelude.Traversable type Apply (Traverse_6989586621680971087Sym1 a6989586621680971085 :: TyFun (Identity a) (f (Identity b)) -> Type) (a6989586621680971086 :: Identity a) = Traverse_6989586621680971087 a6989586621680971085 a6989586621680971086
type Apply (Let6989586621680970873Scrutinee_6989586621680970385Sym1 f6989586621680970871 :: TyFun (t6989586621680959942 a6989586621680959944) (Identity (t6989586621680959942 b6989586621680959945)) -> Type) (x6989586621680970872 :: t6989586621680959942 a6989586621680959944)
Instance details Defined in Data.Singletons.Prelude.Traversable type Apply (Let6989586621680970873Scrutinee_6989586621680970385Sym1 f6989586621680970871 :: TyFun (t6989586621680959942 a6989586621680959944) (Identity (t6989586621680959942 b6989586621680959945)) -> Type) (x6989586621680970872 :: t6989586621680959942 a6989586621680959944) = Let6989586621680970873Scrutinee_6989586621680970385 f6989586621680970871 x6989586621680970872
type Apply (LiftA2_6989586621680897328Sym2 a6989586621680897326 a6989586621680897325 :: TyFun (Identity b) (Identity c) -> Type) (a6989586621680897327 :: Identity b)
Instance details Defined in Data.Singletons.Prelude.Identity type Apply (LiftA2_6989586621680897328Sym2 a6989586621680897326 a6989586621680897325 :: TyFun (Identity b) (Identity c) -> Type) (a6989586621680897327 :: Identity b) = LiftA2_6989586621680897328 a6989586621680897326 a6989586621680897325 a6989586621680897327
type Apply (TFHelper_6989586621680897347Sym1 a6989586621680897345 b :: TyFun (a ~> Identity b) (Identity b) -> Type) (a6989586621680897346 :: a ~> Identity b)
Instance details Defined in Data.Singletons.Prelude.Identity type Apply (TFHelper_6989586621680897347Sym1 a6989586621680897345 b :: TyFun (a ~> Identity b) (Identity b) -> Type) (a6989586621680897346 :: a ~> Identity b) = TFHelper_6989586621680897347 a6989586621680897345 a6989586621680897346
type Apply (ShowsPrec_6989586621680897011Sym0 :: TyFun Nat (Identity a6989586621680896101 ~> (Symbol ~> Symbol)) -> Type) (a6989586621680897008 :: Nat)
Instance details Defined in Data.Singletons.Prelude.Identity type Apply (ShowsPrec_6989586621680897011Sym0 :: TyFun Nat (Identity a6989586621680896101 ~> (Symbol ~> Symbol)) -> Type) (a6989586621680897008 :: Nat) = (ShowsPrec_6989586621680897011Sym1 a6989586621680897008 a6989586621680896101 :: TyFun (Identity a6989586621680896101) (Symbol ~> Symbol) -> Type)
type Apply (Elem_6989586621680897085Sym0 :: TyFun a6989586621680725738 (Identity a6989586621680725738 ~> Bool) -> Type) (a6989586621680897083 :: a6989586621680725738)
Instance details Defined in Data.Singletons.Prelude.Identity type Apply (Elem_6989586621680897085Sym0 :: TyFun a6989586621680725738 (Identity a6989586621680725738 ~> Bool) -> Type) (a6989586621680897083 :: a6989586621680725738) = Elem_6989586621680897085Sym1 a6989586621680897083
type Apply (TFHelper_6989586621680897061Sym0 :: TyFun a6989586621679943773 (Identity b6989586621679943774 ~> Identity a6989586621679943773) -> Type) (a6989586621680897059 :: a6989586621679943773)
Instance details Defined in Data.Singletons.Prelude.Identity type Apply (TFHelper_6989586621680897061Sym0 :: TyFun a6989586621679943773 (Identity b6989586621679943774 ~> Identity a6989586621679943773) -> Type) (a6989586621680897059 :: a6989586621679943773) = (TFHelper_6989586621680897061Sym1 a6989586621680897059 b6989586621679943774 :: TyFun (Identity b6989586621679943774) (Identity a6989586621679943773) -> Type)
type Apply (Foldl_6989586621680897101Sym1 a6989586621680897098 :: TyFun b6989586621680725729 (Identity a6989586621680725730 ~> b6989586621680725729) -> Type) (a6989586621680897099 :: b6989586621680725729)
Instance details Defined in Data.Singletons.Prelude.Identity type Apply (Foldl_6989586621680897101Sym1 a6989586621680897098 :: TyFun b6989586621680725729 (Identity a6989586621680725730 ~> b6989586621680725729) -> Type) (a6989586621680897099 :: b6989586621680725729) = Foldl_6989586621680897101Sym2 a6989586621680897098 a6989586621680897099
type Apply (Foldl'_6989586621680897130Sym1 a6989586621680897127 :: TyFun b6989586621680725731 (Identity a6989586621680725732 ~> b6989586621680725731) -> Type) (a6989586621680897128 :: b6989586621680725731)
Instance details Defined in Data.Singletons.Prelude.Identity type Apply (Foldl'_6989586621680897130Sym1 a6989586621680897127 :: TyFun b6989586621680725731 (Identity a6989586621680725732 ~> b6989586621680725731) -> Type) (a6989586621680897128 :: b6989586621680725731) = Foldl'_6989586621680897130Sym2 a6989586621680897127 a6989586621680897128
type Apply (Foldr_6989586621680897167Sym1 a6989586621680897164 :: TyFun b6989586621680725726 (Identity a6989586621680725725 ~> b6989586621680725726) -> Type) (a6989586621680897165 :: b6989586621680725726)
Instance details Defined in Data.Singletons.Prelude.Identity type Apply (Foldr_6989586621680897167Sym1 a6989586621680897164 :: TyFun b6989586621680725726 (Identity a6989586621680725725 ~> b6989586621680725726) -> Type) (a6989586621680897165 :: b6989586621680725726) = Foldr_6989586621680897167Sym2 a6989586621680897164 a6989586621680897165
type Apply (Foldr'_6989586621680897193Sym1 a6989586621680897190 :: TyFun b6989586621680725728 (Identity a6989586621680725727 ~> b6989586621680725728) -> Type) (a6989586621680897191 :: b6989586621680725728)
Instance details Defined in Data.Singletons.Prelude.Identity type Apply (Foldr'_6989586621680897193Sym1 a6989586621680897190 :: TyFun b6989586621680725728 (Identity a6989586621680725727 ~> b6989586621680725728) -> Type) (a6989586621680897191 :: b6989586621680725728) = Foldr'_6989586621680897193Sym2 a6989586621680897190 a6989586621680897191
type Apply (Compare_6989586621679858845Sym0 :: TyFun (Identity a6989586621679070357) (Identity a6989586621679070357 ~> Ordering) -> Type) (a6989586621679858843 :: Identity a6989586621679070357)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Compare_6989586621679858845Sym0 :: TyFun (Identity a6989586621679070357) (Identity a6989586621679070357 ~> Ordering) -> Type) (a6989586621679858843 :: Identity a6989586621679070357) = Compare_6989586621679858845Sym1 a6989586621679858843
type Apply (EnumFromTo_6989586621680896844Sym0 :: TyFun (Identity a6989586621680896076) (Identity a6989586621680896076 ~> [Identity a6989586621680896076]) -> Type) (a6989586621680896842 :: Identity a6989586621680896076)
Instance details Defined in Data.Singletons.Prelude.Identity type Apply (EnumFromTo_6989586621680896844Sym0 :: TyFun (Identity a6989586621680896076) (Identity a6989586621680896076 ~> [Identity a6989586621680896076]) -> Type) (a6989586621680896842 :: Identity a6989586621680896076) = EnumFromTo_6989586621680896844Sym1 a6989586621680896842
type Apply (EnumFromThenTo_6989586621680896860Sym0 :: TyFun (Identity a6989586621680896076) (Identity a6989586621680896076 ~> (Identity a6989586621680896076 ~> [Identity a6989586621680896076])) -> Type) (a6989586621680896857 :: Identity a6989586621680896076)
Instance details Defined in Data.Singletons.Prelude.Identity type Apply (EnumFromThenTo_6989586621680896860Sym0 :: TyFun (Identity a6989586621680896076) (Identity a6989586621680896076 ~> (Identity a6989586621680896076 ~> [Identity a6989586621680896076])) -> Type) (a6989586621680896857 :: Identity a6989586621680896076) = EnumFromThenTo_6989586621680896860Sym1 a6989586621680896857
type Apply (TFHelper_6989586621680896899Sym0 :: TyFun (Identity a6989586621680896087) (Identity a6989586621680896087 ~> Identity a6989586621680896087) -> Type) (a6989586621680896897 :: Identity a6989586621680896087)
Instance details Defined in Data.Singletons.Prelude.Identity type Apply (TFHelper_6989586621680896899Sym0 :: TyFun (Identity a6989586621680896087) (Identity a6989586621680896087 ~> Identity a6989586621680896087) -> Type) (a6989586621680896897 :: Identity a6989586621680896087) = TFHelper_6989586621680896899Sym1 a6989586621680896897
type Apply (TFHelper_6989586621680896923Sym0 :: TyFun (Identity a6989586621680896087) (Identity a6989586621680896087 ~> Identity a6989586621680896087) -> Type) (a6989586621680896921 :: Identity a6989586621680896087)
Instance details Defined in Data.Singletons.Prelude.Identity type Apply (TFHelper_6989586621680896923Sym0 :: TyFun (Identity a6989586621680896087) (Identity a6989586621680896087 ~> Identity a6989586621680896087) -> Type) (a6989586621680896921 :: Identity a6989586621680896087) = TFHelper_6989586621680896923Sym1 a6989586621680896921
type Apply (TFHelper_6989586621680896941Sym0 :: TyFun (Identity a6989586621680896087) (Identity a6989586621680896087 ~> Identity a6989586621680896087) -> Type) (a6989586621680896939 :: Identity a6989586621680896087)
Instance details Defined in Data.Singletons.Prelude.Identity type Apply (TFHelper_6989586621680896941Sym0 :: TyFun (Identity a6989586621680896087) (Identity a6989586621680896087 ~> Identity a6989586621680896087) -> Type) (a6989586621680896939 :: Identity a6989586621680896087) = TFHelper_6989586621680896941Sym1 a6989586621680896939
type Apply (TFHelper_6989586621680896987Sym0 :: TyFun (Identity a6989586621680896098) (Identity a6989586621680896098 ~> Identity a6989586621680896098) -> Type) (a6989586621680896985 :: Identity a6989586621680896098)
Instance details Defined in Data.Singletons.Prelude.Identity type Apply (TFHelper_6989586621680896987Sym0 :: TyFun (Identity a6989586621680896098) (Identity a6989586621680896098 ~> Identity a6989586621680896098) -> Type) (a6989586621680896985 :: Identity a6989586621680896098) = TFHelper_6989586621680896987Sym1 a6989586621680896985
type Apply (ShowsPrec_6989586621680897011Sym1 a6989586621680897008 a6989586621680896101 :: TyFun (Identity a6989586621680896101) (Symbol ~> Symbol) -> Type) (a6989586621680897009 :: Identity a6989586621680896101)
Instance details Defined in Data.Singletons.Prelude.Identity type Apply (ShowsPrec_6989586621680897011Sym1 a6989586621680897008 a6989586621680896101 :: TyFun (Identity a6989586621680896101) (Symbol ~> Symbol) -> Type) (a6989586621680897009 :: Identity a6989586621680896101) = ShowsPrec_6989586621680897011Sym2 a6989586621680897008 a6989586621680897009
type Apply (EnumFromThenTo_6989586621680896860Sym1 a6989586621680896857 :: TyFun (Identity a6989586621680896076) (Identity a6989586621680896076 ~> [Identity a6989586621680896076]) -> Type) (a6989586621680896858 :: Identity a6989586621680896076)
Instance details Defined in Data.Singletons.Prelude.Identity type Apply (EnumFromThenTo_6989586621680896860Sym1 a6989586621680896857 :: TyFun (Identity a6989586621680896076) (Identity a6989586621680896076 ~> [Identity a6989586621680896076]) -> Type) (a6989586621680896858 :: Identity a6989586621680896076) = EnumFromThenTo_6989586621680896860Sym2 a6989586621680896857 a6989586621680896858
type Apply (TFHelper_6989586621680897303Sym0 :: TyFun (Identity (a6989586621679943779 ~> b6989586621679943780)) (Identity a6989586621679943779 ~> Identity b6989586621679943780) -> Type) (a6989586621680897301 :: Identity (a6989586621679943779 ~> b6989586621679943780))
Instance details Defined in Data.Singletons.Prelude.Identity type Apply (TFHelper_6989586621680897303Sym0 :: TyFun (Identity (a6989586621679943779 ~> b6989586621679943780)) (Identity a6989586621679943779 ~> Identity b6989586621679943780) -> Type) (a6989586621680897301 :: Identity (a6989586621679943779 ~> b6989586621679943780)) = TFHelper_6989586621680897303Sym1 a6989586621680897301
type Apply (TFHelper_6989586621680897347Sym0 :: TyFun (Identity a6989586621679943815) ((a6989586621679943815 ~> Identity b6989586621679943816) ~> Identity b6989586621679943816) -> Type) (a6989586621680897345 :: Identity a6989586621679943815)
Instance details Defined in Data.Singletons.Prelude.Identity type Apply (TFHelper_6989586621680897347Sym0 :: TyFun (Identity a6989586621679943815) ((a6989586621679943815 ~> Identity b6989586621679943816) ~> Identity b6989586621679943816) -> Type) (a6989586621680897345 :: Identity a6989586621679943815) = (TFHelper_6989586621680897347Sym1 a6989586621680897345 b6989586621679943816 :: TyFun (a6989586621679943815 ~> Identity b6989586621679943816) (Identity b6989586621679943816) -> Type)
type Apply (LiftA2_6989586621680897328Sym1 a6989586621680897325 :: TyFun (Identity a6989586621679943781) (Identity b6989586621679943782 ~> Identity c6989586621679943783) -> Type) (a6989586621680897326 :: Identity a6989586621679943781)
Instance details Defined in Data.Singletons.Prelude.Identity type Apply (LiftA2_6989586621680897328Sym1 a6989586621680897325 :: TyFun (Identity a6989586621679943781) (Identity b6989586621679943782 ~> Identity c6989586621679943783) -> Type) (a6989586621680897326 :: Identity a6989586621679943781) = LiftA2_6989586621680897328Sym2 a6989586621680897325 a6989586621680897326
type Apply (Foldl1_6989586621680897142Sym0 :: TyFun (a6989586621680725734 ~> (a6989586621680725734 ~> a6989586621680725734)) (Identity a6989586621680725734 ~> a6989586621680725734) -> Type) (a6989586621680897140 :: a6989586621680725734 ~> (a6989586621680725734 ~> a6989586621680725734))
Instance details Defined in Data.Singletons.Prelude.Identity type Apply (Foldl1_6989586621680897142Sym0 :: TyFun (a6989586621680725734 ~> (a6989586621680725734 ~> a6989586621680725734)) (Identity a6989586621680725734 ~> a6989586621680725734) -> Type) (a6989586621680897140 :: a6989586621680725734 ~> (a6989586621680725734 ~> a6989586621680725734)) = Foldl1_6989586621680897142Sym1 a6989586621680897140
type Apply (Foldr1_6989586621680897208Sym0 :: TyFun (a6989586621680725733 ~> (a6989586621680725733 ~> a6989586621680725733)) (Identity a6989586621680725733 ~> a6989586621680725733) -> Type) (a6989586621680897206 :: a6989586621680725733 ~> (a6989586621680725733 ~> a6989586621680725733))
Instance details Defined in Data.Singletons.Prelude.Identity type Apply (Foldr1_6989586621680897208Sym0 :: TyFun (a6989586621680725733 ~> (a6989586621680725733 ~> a6989586621680725733)) (Identity a6989586621680725733 ~> a6989586621680725733) -> Type) (a6989586621680897206 :: a6989586621680725733 ~> (a6989586621680725733 ~> a6989586621680725733)) = Foldr1_6989586621680897208Sym1 a6989586621680897206
type Apply (Foldl_6989586621680897101Sym0 :: TyFun (b6989586621680725729 ~> (a6989586621680725730 ~> b6989586621680725729)) (b6989586621680725729 ~> (Identity a6989586621680725730 ~> b6989586621680725729)) -> Type) (a6989586621680897098 :: b6989586621680725729 ~> (a6989586621680725730 ~> b6989586621680725729))
Instance details Defined in Data.Singletons.Prelude.Identity type Apply (Foldl_6989586621680897101Sym0 :: TyFun (b6989586621680725729 ~> (a6989586621680725730 ~> b6989586621680725729)) (b6989586621680725729 ~> (Identity a6989586621680725730 ~> b6989586621680725729)) -> Type) (a6989586621680897098 :: b6989586621680725729 ~> (a6989586621680725730 ~> b6989586621680725729)) = Foldl_6989586621680897101Sym1 a6989586621680897098
type Apply (Foldl'_6989586621680897130Sym0 :: TyFun (b6989586621680725731 ~> (a6989586621680725732 ~> b6989586621680725731)) (b6989586621680725731 ~> (Identity a6989586621680725732 ~> b6989586621680725731)) -> Type) (a6989586621680897127 :: b6989586621680725731 ~> (a6989586621680725732 ~> b6989586621680725731))
Instance details Defined in Data.Singletons.Prelude.Identity type Apply (Foldl'_6989586621680897130Sym0 :: TyFun (b6989586621680725731 ~> (a6989586621680725732 ~> b6989586621680725731)) (b6989586621680725731 ~> (Identity a6989586621680725732 ~> b6989586621680725731)) -> Type) (a6989586621680897127 :: b6989586621680725731 ~> (a6989586621680725732 ~> b6989586621680725731)) = Foldl'_6989586621680897130Sym1 a6989586621680897127
type Apply (Foldr_6989586621680897167Sym0 :: TyFun (a6989586621680725725 ~> (b6989586621680725726 ~> b6989586621680725726)) (b6989586621680725726 ~> (Identity a6989586621680725725 ~> b6989586621680725726)) -> Type) (a6989586621680897164 :: a6989586621680725725 ~> (b6989586621680725726 ~> b6989586621680725726))
Instance details Defined in Data.Singletons.Prelude.Identity type Apply (Foldr_6989586621680897167Sym0 :: TyFun (a6989586621680725725 ~> (b6989586621680725726 ~> b6989586621680725726)) (b6989586621680725726 ~> (Identity a6989586621680725725 ~> b6989586621680725726)) -> Type) (a6989586621680897164 :: a6989586621680725725 ~> (b6989586621680725726 ~> b6989586621680725726)) = Foldr_6989586621680897167Sym1 a6989586621680897164
type Apply (Foldr'_6989586621680897193Sym0 :: TyFun (a6989586621680725727 ~> (b6989586621680725728 ~> b6989586621680725728)) (b6989586621680725728 ~> (Identity a6989586621680725727 ~> b6989586621680725728)) -> Type) (a6989586621680897190 :: a6989586621680725727 ~> (b6989586621680725728 ~> b6989586621680725728))
Instance details Defined in Data.Singletons.Prelude.Identity type Apply (Foldr'_6989586621680897193Sym0 :: TyFun (a6989586621680725727 ~> (b6989586621680725728 ~> b6989586621680725728)) (b6989586621680725728 ~> (Identity a6989586621680725727 ~> b6989586621680725728)) -> Type) (a6989586621680897190 :: a6989586621680725727 ~> (b6989586621680725728 ~> b6989586621680725728)) = Foldr'_6989586621680897193Sym1 a6989586621680897190
type Apply (Fmap_6989586621680897042Sym0 :: TyFun (a6989586621679943771 ~> b6989586621679943772) (Identity a6989586621679943771 ~> Identity b6989586621679943772) -> Type) (a6989586621680897040 :: a6989586621679943771 ~> b6989586621679943772)
Instance details Defined in Data.Singletons.Prelude.Identity type Apply (Fmap_6989586621680897042Sym0 :: TyFun (a6989586621679943771 ~> b6989586621679943772) (Identity a6989586621679943771 ~> Identity b6989586621679943772) -> Type) (a6989586621680897040 :: a6989586621679943771 ~> b6989586621679943772) = Fmap_6989586621680897042Sym1 a6989586621680897040
type Apply (FoldMap_6989586621680897073Sym0 :: TyFun (a6989586621680725724 ~> m6989586621680725723) (Identity a6989586621680725724 ~> m6989586621680725723) -> Type) (a6989586621680897071 :: a6989586621680725724 ~> m6989586621680725723)
Instance details Defined in Data.Singletons.Prelude.Identity type Apply (FoldMap_6989586621680897073Sym0 :: TyFun (a6989586621680725724 ~> m6989586621680725723) (Identity a6989586621680725724 ~> m6989586621680725723) -> Type) (a6989586621680897071 :: a6989586621680725724 ~> m6989586621680725723) = FoldMap_6989586621680897073Sym1 a6989586621680897071
type Apply (Let6989586621680970873Scrutinee_6989586621680970385Sym0 :: TyFun (a6989586621680959944 ~> b6989586621680959945) (TyFun (t6989586621680959942 a6989586621680959944) (Identity (t6989586621680959942 b6989586621680959945)) -> Type) -> Type) (f6989586621680970871 :: a6989586621680959944 ~> b6989586621680959945)
Instance details Defined in Data.Singletons.Prelude.Traversable type Apply (Let6989586621680970873Scrutinee_6989586621680970385Sym0 :: TyFun (a6989586621680959944 ~> b6989586621680959945) (TyFun (t6989586621680959942 a6989586621680959944) (Identity (t6989586621680959942 b6989586621680959945)) -> Type) -> Type) (f6989586621680970871 :: a6989586621680959944 ~> b6989586621680959945) = (Let6989586621680970873Scrutinee_6989586621680970385Sym1 f6989586621680970871 :: TyFun (t6989586621680959942 a6989586621680959944) (Identity (t6989586621680959942 b6989586621680959945)) -> Type)
type Apply (Traverse_6989586621680971087Sym0 :: TyFun (a6989586621680959944 ~> f6989586621680959943 b6989586621680959945) (Identity a6989586621680959944 ~> f6989586621680959943 (Identity b6989586621680959945)) -> Type) (a6989586621680971085 :: a6989586621680959944 ~> f6989586621680959943 b6989586621680959945)
Instance details Defined in Data.Singletons.Prelude.Traversable type Apply (Traverse_6989586621680971087Sym0 :: TyFun (a6989586621680959944 ~> f6989586621680959943 b6989586621680959945) (Identity a6989586621680959944 ~> f6989586621680959943 (Identity b6989586621680959945)) -> Type) (a6989586621680971085 :: a6989586621680959944 ~> f6989586621680959943 b6989586621680959945) = Traverse_6989586621680971087Sym1 a6989586621680971085
type Apply (LiftA2_6989586621680897328Sym0 :: TyFun (a6989586621679943781 ~> (b6989586621679943782 ~> c6989586621679943783)) (Identity a6989586621679943781 ~> (Identity b6989586621679943782 ~> Identity c6989586621679943783)) -> Type) (a6989586621680897325 :: a6989586621679943781 ~> (b6989586621679943782 ~> c6989586621679943783))
Instance details Defined in Data.Singletons.Prelude.Identity type Apply (LiftA2_6989586621680897328Sym0 :: TyFun (a6989586621679943781 ~> (b6989586621679943782 ~> c6989586621679943783)) (Identity a6989586621679943781 ~> (Identity b6989586621679943782 ~> Identity c6989586621679943783)) -> Type) (a6989586621680897325 :: a6989586621679943781 ~> (b6989586621679943782 ~> c6989586621679943783)) = LiftA2_6989586621680897328Sym1 a6989586621680897325

stderr :: Handle #

A handle managing output to the Haskell program's standard error channel.

stdin :: Handle #

A handle managing input from the Haskell program's standard input channel.

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.

eofErrorType :: IOErrorType #

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

writeTVar :: TVar a -> a -> STM () #

Write the supplied value into a TVar.

readTVar :: TVar a -> STM a #

Return the current value stored in a TVar.

newTVar :: a -> STM (TVar a) #

Create a new TVar holding a value supplied

data STM a #

A monad supporting atomic memory transactions.

Instances

Monad STM	Since: base-4.3.0.0
Instance details Defined in GHC.Conc.Sync Methods (>>=) :: STM a -> (a -> STM b) -> STM b # (>>) :: STM a -> STM b -> STM b # return :: a -> STM a # fail :: String -> STM a #
Functor STM	Since: base-4.3.0.0
Instance details Defined in GHC.Conc.Sync Methods fmap :: (a -> b) -> STM a -> STM b # (<$) :: a -> STM b -> STM a #
Applicative STM	Since: base-4.8.0.0
Instance details Defined in GHC.Conc.Sync Methods pure :: a -> STM a # (<>) :: STM (a -> b) -> STM a -> STM b # liftA2 :: (a -> b -> c) -> STM a -> STM b -> STM c # (>) :: STM a -> STM b -> STM b # (<*) :: STM a -> STM b -> STM a #
MonadPlus STM	Since: base-4.3.0.0
Instance details Defined in GHC.Conc.Sync Methods mzero :: STM a # mplus :: STM a -> STM a -> STM a #
Alternative STM	Since: base-4.8.0.0
Instance details Defined in GHC.Conc.Sync Methods empty :: STM a # (<\|>) :: STM a -> STM a -> STM a # some :: STM a -> STM [a] # many :: STM a -> STM [a] #

data TVar a #

Shared memory locations that support atomic memory transactions.

Instances

Eq (TVar a)	Since: base-4.8.0.0
Instance details Defined in GHC.Conc.Sync Methods (==) :: TVar a -> TVar a -> Bool # (/=) :: TVar a -> TVar a -> Bool #
PrimUnlifted (TVar a)	Since: primitive-0.6.4.0
Instance details Defined in Data.Primitive.UnliftedArray Methods toArrayArray# :: TVar a -> ArrayArray# # fromArrayArray# :: ArrayArray# -> TVar a #

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
Instance details Defined in GHC.IO.Exception Methods showsPrec :: Int -> SomeAsyncException -> ShowS # show :: SomeAsyncException -> String # showList :: [SomeAsyncException] -> ShowS #
Exception SomeAsyncException	Since: base-4.7.0.0
Instance details Defined in GHC.IO.Exception Methods toException :: SomeAsyncException -> SomeException # fromException :: SomeException -> Maybe SomeAsyncException # displayException :: SomeAsyncException -> String #

data IOErrorType #

An abstract type that contains a value for each variant of IOException.

Instances

Eq IOErrorType	Since: base-4.1.0.0
Instance details Defined in GHC.IO.Exception Methods (==) :: IOErrorType -> IOErrorType -> Bool # (/=) :: IOErrorType -> IOErrorType -> Bool #
Show IOErrorType	Since: base-4.1.0.0
Instance details Defined in GHC.IO.Exception Methods showsPrec :: Int -> IOErrorType -> ShowS # show :: IOErrorType -> String # showList :: [IOErrorType] -> ShowS #

stdout :: Handle #

A handle managing output to the Haskell program's standard output channel.

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 hFlush is issued, or the handle is closed.
block-buffering: the entire buffer is written out whenever it overflows, a hFlush is 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 hLookAhead operation 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 `n` items if the argument is `Just` `n` and is otherwise implementation-dependent.

Instances

Eq BufferMode	Since: base-4.2.0.0
Instance details Defined in GHC.IO.Handle.Types Methods (==) :: BufferMode -> BufferMode -> Bool # (/=) :: BufferMode -> BufferMode -> Bool #
Ord BufferMode	Since: base-4.2.0.0
Instance details 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
Instance details 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
Instance details Defined in GHC.IO.Handle.Types Methods showsPrec :: Int -> BufferMode -> ShowS # show :: BufferMode -> String # showList :: [BufferMode] -> ShowS #

data SeekMode #

A mode that determines the effect of hSeek hdl mode i.

Instances

Enum SeekMode	Since: base-4.2.0.0
Instance details Defined in GHC.IO.Device Methods succ :: SeekMode -> SeekMode # pred :: SeekMode -> SeekMode # toEnum :: Int -> SeekMode # fromEnum :: SeekMode -> Int # enumFrom :: SeekMode -> [SeekMode] # enumFromThen :: SeekMode -> SeekMode -> [SeekMode] # enumFromTo :: SeekMode -> SeekMode -> [SeekMode] # enumFromThenTo :: SeekMode -> SeekMode -> SeekMode -> [SeekMode] #
Eq SeekMode	Since: base-4.2.0.0
Instance details Defined in GHC.IO.Device Methods (==) :: SeekMode -> SeekMode -> Bool # (/=) :: SeekMode -> SeekMode -> Bool #
Ord SeekMode	Since: base-4.2.0.0
Instance details Defined in GHC.IO.Device Methods compare :: SeekMode -> SeekMode -> Ordering # (<) :: SeekMode -> SeekMode -> Bool # (<=) :: SeekMode -> SeekMode -> Bool # (>) :: SeekMode -> SeekMode -> Bool # (>=) :: SeekMode -> SeekMode -> Bool # max :: SeekMode -> SeekMode -> SeekMode # min :: SeekMode -> SeekMode -> SeekMode #
Read SeekMode	Since: base-4.2.0.0
Instance details Defined in GHC.IO.Device Methods readsPrec :: Int -> ReadS SeekMode # readList :: ReadS [SeekMode] # readPrec :: ReadPrec SeekMode # readListPrec :: ReadPrec [SeekMode] #
Show SeekMode	Since: base-4.2.0.0
Instance details Defined in GHC.IO.Device Methods showsPrec :: Int -> SeekMode -> ShowS # show :: SeekMode -> String # showList :: [SeekMode] -> ShowS #
Ix SeekMode	Since: base-4.2.0.0
Instance details Defined in GHC.IO.Device Methods range :: (SeekMode, SeekMode) -> [SeekMode] # index :: (SeekMode, SeekMode) -> SeekMode -> Int # unsafeIndex :: (SeekMode, SeekMode) -> SeekMode -> Int inRange :: (SeekMode, SeekMode) -> SeekMode -> Bool # rangeSize :: (SeekMode, SeekMode) -> Int # unsafeRangeSize :: (SeekMode, SeekMode) -> Int

data IORef a #

A mutable variable in the IO monad

Instances

NFData1 IORef	Since: deepseq-1.4.3.0
Instance details Defined in Control.DeepSeq Methods liftRnf :: (a -> ()) -> IORef a -> () #
Eq (IORef a)	^ Pointer equality. Since: base-4.1.0.0
Instance details Defined in GHC.IORef Methods (==) :: IORef a -> IORef a -> Bool # (/=) :: IORef a -> IORef a -> Bool #
NFData (IORef a)	NOTE: Only strict in the reference and not the referenced value. Since: deepseq-1.4.2.0
Instance details Defined in Control.DeepSeq Methods rnf :: IORef a -> () #
IsSequence a => MutablePushBack (IORef a)
Instance details Defined in Data.Mutable.Class Methods pushBack :: (PrimMonad m, PrimState m ~ MCState (IORef a)) => IORef a -> CollElement (IORef a) -> m () #
IsSequence a => MutablePopBack (IORef a)
Instance details Defined in Data.Mutable.Class Methods popBack :: (PrimMonad m, PrimState m ~ MCState (IORef a)) => IORef a -> m (Maybe (CollElement (IORef a))) #
IsSequence a => MutablePushFront (IORef a)
Instance details Defined in Data.Mutable.Class Methods pushFront :: (PrimMonad m, PrimState m ~ MCState (IORef a)) => IORef a -> CollElement (IORef a) -> m () #
IsSequence a => MutablePopFront (IORef a)
Instance details Defined in Data.Mutable.Class Methods popFront :: (PrimMonad m, PrimState m ~ MCState (IORef a)) => IORef a -> m (Maybe (CollElement (IORef a))) #
Monoid w => MutableCollection (IORef w)
Instance details Defined in Data.Mutable.Class Associated Types type CollElement (IORef w) :: Type # Methods newColl :: (PrimMonad m, PrimState m ~ MCState (IORef w)) => m (IORef w) #
MutableAtomicRef (IORef a)
Instance details 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 #
MutableRef (IORef a)
Instance details Defined in Data.Mutable.Class Associated Types type RefElement (IORef a) :: Type # Methods newRef :: (PrimMonad m, PrimState m ~ MCState (IORef a)) => RefElement (IORef a) -> m (IORef a) # readRef :: (PrimMonad m, PrimState m ~ MCState (IORef a)) => IORef a -> m (RefElement (IORef a)) # writeRef :: (PrimMonad m, PrimState m ~ MCState (IORef a)) => IORef a -> RefElement (IORef a) -> m () # modifyRef :: (PrimMonad m, PrimState m ~ MCState (IORef a)) => IORef a -> (RefElement (IORef a) -> RefElement (IORef a)) -> m () # modifyRef' :: (PrimMonad m, PrimState m ~ MCState (IORef a)) => IORef a -> (RefElement (IORef a) -> RefElement (IORef a)) -> m () #
MutableContainer (IORef a)
Instance details Defined in Data.Mutable.Class Associated Types type MCState (IORef a) :: Type #
type CollElement (IORef w)
Instance details Defined in Data.Mutable.Class type CollElement (IORef w) = Element w
type RefElement (IORef a)
Instance details Defined in Data.Mutable.Class type RefElement (IORef a) = a
type MCState (IORef a)
Instance details Defined in Data.Mutable.Class type MCState (IORef a) = PrimState IO

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
Instance details Defined in GHC.IO.Exception Methods (==) :: IOException -> IOException -> Bool # (/=) :: IOException -> IOException -> Bool #
Show IOException	Since: base-4.1.0.0
Instance details Defined in GHC.IO.Exception Methods showsPrec :: Int -> IOException -> ShowS # show :: IOException -> String # showList :: [IOException] -> ShowS #
Exception IOException	Since: base-4.1.0.0
Instance details Defined in GHC.IO.Exception Methods toException :: IOException -> SomeException # fromException :: SomeException -> Maybe IOException # displayException :: IOException -> String #
Error IOException
Instance details Defined in Control.Monad.Trans.Error Methods noMsg :: IOException # strMsg :: String -> IOException #

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 MyException

The 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 = frontendExceptionFromException

We 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

Exception AsyncCancelled
Instance details Defined in Control.Concurrent.Async Methods toException :: AsyncCancelled -> SomeException # fromException :: SomeException -> Maybe AsyncCancelled # displayException :: AsyncCancelled -> String #
Exception ExceptionInLinkedThread
Instance details Defined in Control.Concurrent.Async Methods toException :: ExceptionInLinkedThread -> SomeException # fromException :: SomeException -> Maybe ExceptionInLinkedThread # displayException :: ExceptionInLinkedThread -> String #
Exception Void	Since: base-4.8.0.0
Instance details Defined in Data.Void Methods toException :: Void -> SomeException # fromException :: SomeException -> Maybe Void # displayException :: Void -> String #
Exception BlockedIndefinitelyOnMVar	Since: base-4.1.0.0
Instance details Defined in GHC.IO.Exception Methods toException :: BlockedIndefinitelyOnMVar -> SomeException # fromException :: SomeException -> Maybe BlockedIndefinitelyOnMVar # displayException :: BlockedIndefinitelyOnMVar -> String #
Exception BlockedIndefinitelyOnSTM	Since: base-4.1.0.0
Instance details Defined in GHC.IO.Exception Methods toException :: BlockedIndefinitelyOnSTM -> SomeException # fromException :: SomeException -> Maybe BlockedIndefinitelyOnSTM # displayException :: BlockedIndefinitelyOnSTM -> String #
Exception Deadlock	Since: base-4.1.0.0
Instance details Defined in GHC.IO.Exception Methods toException :: Deadlock -> SomeException # fromException :: SomeException -> Maybe Deadlock # displayException :: Deadlock -> String #
Exception AllocationLimitExceeded	Since: base-4.8.0.0
Instance details Defined in GHC.IO.Exception Methods toException :: AllocationLimitExceeded -> SomeException # fromException :: SomeException -> Maybe AllocationLimitExceeded # displayException :: AllocationLimitExceeded -> String #
Exception CompactionFailed	Since: base-4.10.0.0
Instance details Defined in GHC.IO.Exception Methods toException :: CompactionFailed -> SomeException # fromException :: SomeException -> Maybe CompactionFailed # displayException :: CompactionFailed -> String #
Exception AssertionFailed	Since: base-4.1.0.0
Instance details Defined in GHC.IO.Exception Methods toException :: AssertionFailed -> SomeException # fromException :: SomeException -> Maybe AssertionFailed # displayException :: AssertionFailed -> String #
Exception SomeAsyncException	Since: base-4.7.0.0
Instance details Defined in GHC.IO.Exception Methods toException :: SomeAsyncException -> SomeException # fromException :: SomeException -> Maybe SomeAsyncException # displayException :: SomeAsyncException -> String #
Exception AsyncException	Since: base-4.7.0.0
Instance details Defined in GHC.IO.Exception Methods toException :: AsyncException -> SomeException # fromException :: SomeException -> Maybe AsyncException # displayException :: AsyncException -> String #
Exception ArrayException	Since: base-4.1.0.0
Instance details Defined in GHC.IO.Exception Methods toException :: ArrayException -> SomeException # fromException :: SomeException -> Maybe ArrayException # displayException :: ArrayException -> String #
Exception FixIOException	Since: base-4.11.0.0
Instance details Defined in GHC.IO.Exception Methods toException :: FixIOException -> SomeException # fromException :: SomeException -> Maybe FixIOException # displayException :: FixIOException -> String #
Exception ExitCode	Since: base-4.1.0.0
Instance details Defined in GHC.IO.Exception Methods toException :: ExitCode -> SomeException # fromException :: SomeException -> Maybe ExitCode # displayException :: ExitCode -> String #
Exception IOException	Since: base-4.1.0.0
Instance details Defined in GHC.IO.Exception Methods toException :: IOException -> SomeException # fromException :: SomeException -> Maybe IOException # displayException :: IOException -> String #
Exception ArithException	Since: base-4.0.0.0
Instance details Defined in GHC.Exception.Type Methods toException :: ArithException -> SomeException # fromException :: SomeException -> Maybe ArithException # displayException :: ArithException -> String #
Exception SomeException	Since: base-3.0
Instance details Defined in GHC.Exception.Type Methods toException :: SomeException -> SomeException # fromException :: SomeException -> Maybe SomeException # displayException :: SomeException -> String #
Exception StringException	Since: unliftio-0.1.0.0
Instance details Defined in UnliftIO.Exception Methods toException :: StringException -> SomeException # fromException :: SomeException -> Maybe StringException # displayException :: StringException -> String #
Exception AsyncExceptionWrapper	Since: unliftio-0.1.0.0
Instance details Defined in UnliftIO.Exception Methods toException :: AsyncExceptionWrapper -> SomeException # fromException :: SomeException -> Maybe AsyncExceptionWrapper # displayException :: AsyncExceptionWrapper -> String #
Exception SyncExceptionWrapper	Since: unliftio-0.1.0.0
Instance details Defined in UnliftIO.Exception Methods toException :: SyncExceptionWrapper -> SomeException # fromException :: SomeException -> Maybe SyncExceptionWrapper # displayException :: SyncExceptionWrapper -> String #
Exception ConcException
Instance details Defined in UnliftIO.Internals.Async Methods toException :: ConcException -> SomeException # fromException :: SomeException -> Maybe ConcException # displayException :: ConcException -> String #
Exception UnexpectedNullPointerReturn
Instance details Defined in Data.GI.Base.BasicTypes Methods toException :: UnexpectedNullPointerReturn -> SomeException # fromException :: SomeException -> Maybe UnexpectedNullPointerReturn # displayException :: UnexpectedNullPointerReturn -> String #
Exception InvalidAccess
Instance details Defined in Control.Monad.Trans.Resource.Internal Methods toException :: InvalidAccess -> SomeException # fromException :: SomeException -> Maybe InvalidAccess # displayException :: InvalidAccess -> String #
Exception ResourceCleanupException
Instance details Defined in Control.Monad.Trans.Resource.Internal Methods toException :: ResourceCleanupException -> SomeException # fromException :: SomeException -> Maybe ResourceCleanupException # displayException :: ResourceCleanupException -> String #
Exception XMLException
Instance details Defined in Text.XML Methods toException :: XMLException -> SomeException # fromException :: SomeException -> Maybe XMLException # displayException :: XMLException -> String #
Exception UnresolvedEntityException
Instance details Defined in Text.XML Methods toException :: UnresolvedEntityException -> SomeException # fromException :: SomeException -> Maybe UnresolvedEntityException # displayException :: UnresolvedEntityException -> String #
Exception NullError
Instance details Defined in Data.NonNull Methods toException :: NullError -> SomeException # fromException :: SomeException -> Maybe NullError # displayException :: NullError -> String #

asum :: (Foldable t, Alternative f) => t (f a) -> f a #

The sum of a collection of actions, generalizing concat.

asum [Just Hello, Nothing, Just World] Just Hello

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

Expand

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 should be the same pair as (lefts x, rights x):

>>> let list = [ Left "foo", Right 3, Left "bar", Right 7, Left "baz" ]
>>> partitionEithers list == (lefts list, rights list)
True

rights :: [Either a b] -> [b] #

Extracts from a list of Either all the Right elements. All the Right elements are extracted in order.

Examples

Expand

Basic usage:

>>> let list = [ Left "foo", Right 3, Left "bar", Right 7, Left "baz" ]
>>> rights list
[3,7]

lefts :: [Either a b] -> [a] #

Extracts from a list of Either all the Left elements. All the Left elements are extracted in order.

Examples

Expand

Basic usage:

>>> let list = [ Left "foo", Right 3, Left "bar", Right 7, Left "baz" ]
>>> lefts list
["foo","bar","baz"]

newtype Down a #

The Down type allows you to reverse sort order conveniently. A value of type Down a contains a value of type a (represented as Down a). If a has an Ord instance associated with it then comparing two values thus wrapped will give you the opposite of their normal sort order. This is particularly useful when sorting in generalised list comprehensions, as in: then sortWith by Down x

Since: base-4.6.0.0

Constructors

Down a

Instances

Monad Down	Since: base-4.11.0.0
Instance details Defined in Data.Ord Methods (>>=) :: Down a -> (a -> Down b) -> Down b # (>>) :: Down a -> Down b -> Down b # return :: a -> Down a # fail :: String -> Down a #
Functor Down	Since: base-4.11.0.0
Instance details Defined in Data.Ord Methods fmap :: (a -> b) -> Down a -> Down b # (<$) :: a -> Down b -> Down a #
Applicative Down	Since: base-4.11.0.0
Instance details Defined in Data.Ord Methods pure :: a -> Down a # (<>) :: Down (a -> b) -> Down a -> Down b # liftA2 :: (a -> b -> c) -> Down a -> Down b -> Down c # (>) :: Down a -> Down b -> Down b # (<*) :: Down a -> Down b -> Down a #
Foldable Down	Since: base-4.12.0.0
Instance details 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 # toList :: Down a -> [a] # null :: Down a -> Bool # length :: Down a -> Int # elem :: Eq a => a -> Down a -> Bool # maximum :: Ord a => Down a -> a # minimum :: Ord a => Down a -> a # sum :: Num a => Down a -> a # product :: Num a => Down a -> a #
Traversable Down	Since: base-4.12.0.0
Instance details Defined in Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> Down a -> f (Down b) # sequenceA :: Applicative f => Down (f a) -> f (Down a) # mapM :: Monad m => (a -> m b) -> Down a -> m (Down b) # sequence :: Monad m => Down (m a) -> m (Down a) #
Eq1 Down	Since: base-4.12.0.0
Instance details Defined in Data.Functor.Classes Methods liftEq :: (a -> b -> Bool) -> Down a -> Down b -> Bool #
Ord1 Down	Since: base-4.12.0.0
Instance details Defined in Data.Functor.Classes Methods liftCompare :: (a -> b -> Ordering) -> Down a -> Down b -> Ordering #
Read1 Down	Since: base-4.12.0.0
Instance details Defined in Data.Functor.Classes Methods liftReadsPrec :: (Int -> ReadS a) -> ReadS [a] -> Int -> ReadS (Down a) # liftReadList :: (Int -> ReadS a) -> ReadS [a] -> ReadS [Down a] # liftReadPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec (Down a) # liftReadListPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec [Down a] #
Show1 Down	Since: base-4.12.0.0
Instance details Defined in Data.Functor.Classes Methods liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> Down a -> ShowS # liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [Down a] -> ShowS #
NFData1 Down	Since: deepseq-1.4.3.0
Instance details Defined in Control.DeepSeq Methods liftRnf :: (a -> ()) -> Down a -> () #
Apply Down
Instance details Defined in Data.Functor.Bind.Class Methods (<.>) :: Down (a -> b) -> Down a -> Down b # (.>) :: Down a -> Down b -> Down b # (<.) :: Down a -> Down b -> Down a # liftF2 :: (a -> b -> c) -> Down a -> Down b -> Down c #
Bind Down
Instance details Defined in Data.Functor.Bind.Class Methods (>>-) :: Down a -> (a -> Down b) -> Down b # join :: Down (Down a) -> Down a #
Eq a => Eq (Down a)	Since: base-4.6.0.0
Instance details Defined in Data.Ord Methods (==) :: Down a -> Down a -> Bool # (/=) :: Down a -> Down a -> Bool #
Num a => Num (Down a)	Since: base-4.11.0.0
Instance details Defined in Data.Ord Methods (+) :: Down a -> Down a -> Down a # (-) :: Down a -> Down a -> Down a # (*) :: Down a -> Down a -> Down a # negate :: Down a -> Down a # abs :: Down a -> Down a # signum :: Down a -> Down a # fromInteger :: Integer -> Down a #
Ord a => Ord (Down a)	Since: base-4.6.0.0
Instance details Defined in Data.Ord Methods compare :: Down a -> Down a -> Ordering # (<) :: Down a -> Down a -> Bool # (<=) :: Down a -> Down a -> Bool # (>) :: Down a -> Down a -> Bool # (>=) :: Down a -> Down a -> Bool # max :: Down a -> Down a -> Down a # min :: Down a -> Down a -> Down a #
Read a => Read (Down a)	Since: base-4.7.0.0
Instance details Defined in Data.Ord Methods readsPrec :: Int -> ReadS (Down a) # readList :: ReadS [Down a] # readPrec :: ReadPrec (Down a) # readListPrec :: ReadPrec [Down a] #
Show a => Show (Down a)	Since: base-4.7.0.0
Instance details Defined in Data.Ord Methods showsPrec :: Int -> Down a -> ShowS # show :: Down a -> String # showList :: [Down a] -> ShowS #
Generic (Down a)
Instance details Defined in GHC.Generics Associated Types type Rep (Down a) :: Type -> Type # Methods from :: Down a -> Rep (Down a) x # to :: Rep (Down a) x -> Down a #
Semigroup a => Semigroup (Down a)	Since: base-4.11.0.0
Instance details Defined in Data.Ord Methods (<>) :: Down a -> Down a -> Down a # sconcat :: NonEmpty (Down a) -> Down a # stimes :: Integral b => b -> Down a -> Down a #
Monoid a => Monoid (Down a)	Since: base-4.11.0.0
Instance details Defined in Data.Ord Methods mempty :: Down a # mappend :: Down a -> Down a -> Down a # mconcat :: [Down a] -> Down a #
NFData a => NFData (Down a)	Since: deepseq-1.4.0.0
Instance details Defined in Control.DeepSeq Methods rnf :: Down a -> () #
Wrapped (Down a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (Down a) :: Type # Methods _Wrapped' :: Iso' (Down a) (Unwrapped (Down a)) #
PMonoid (Down a)
Instance details Defined in Data.Singletons.Prelude.Monoid Associated Types type Mempty :: a # type Mappend arg arg1 :: a # type Mconcat arg :: a #
SMonoid a => SMonoid (Down a)
Instance details Defined in Data.Singletons.Prelude.Monoid Methods sMempty :: Sing MemptySym0 # sMappend :: Sing t1 -> Sing t2 -> Sing (Apply (Apply MappendSym0 t1) t2) # sMconcat :: Sing t -> Sing (Apply MconcatSym0 t) #
PSemigroup (Down a)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Associated Types type arg <> arg1 :: a # type Sconcat arg :: a #
SSemigroup a => SSemigroup (Down a)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods (%<>) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (<>@#@$) t1) t2) # sSconcat :: Sing t -> Sing (Apply SconcatSym0 t) #
PNum (Down a)
Instance details Defined in Data.Singletons.Prelude.Num Associated Types type arg + arg1 :: a # type arg - arg1 :: a # type arg * arg1 :: a # type Negate arg :: a # type Abs arg :: a # type Signum arg :: a # type FromInteger arg :: a #
SNum a => SNum (Down a)
Instance details 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)
Instance details Defined in Data.Singletons.Prelude.Ord Associated Types type Compare arg arg1 :: Ordering # type arg < arg1 :: Bool # type arg <= arg1 :: Bool # type arg > arg1 :: Bool # type arg >= arg1 :: Bool # type Max arg arg1 :: a # type Min arg arg1 :: a #
SOrd a => SOrd (Down a)
Instance details 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
Instance details Defined in GHC.Generics Associated Types type Rep1 Down :: k -> Type # Methods from1 :: Down a -> Rep1 Down a # to1 :: Rep1 Down a -> Down a #
t ~ Down b => Rewrapped (Down a) t
Instance details Defined in Control.Lens.Wrapped
SuppressUnusedWarnings (DownSym0 :: TyFun a6989586621679087853 (Down a6989586621679087853) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Pure_6989586621680960441Sym0 :: TyFun a6989586621679943778 (Down a6989586621679943778) -> Type)
Instance details Defined in Data.Singletons.Prelude.Applicative Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Compare_6989586621679856604Sym0 :: TyFun (Down a6989586621679854521) (Down a6989586621679854521 ~> Ordering) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SingI (DownSym0 :: TyFun a (Down a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods sing :: Sing DownSym0 #
SuppressUnusedWarnings (TFHelper_6989586621680187800Sym0 :: TyFun a6989586621679943773 (Down b6989586621679943774 ~> Down a6989586621679943773) -> Type)
Instance details Defined in Data.Singletons.Prelude.Functor Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Compare_6989586621679856604Sym1 a6989586621679856602 :: TyFun (Down a6989586621679854521) Ordering -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621681077389Sym0 :: TyFun (Down a6989586621679943815) ((a6989586621679943815 ~> Down b6989586621679943816) ~> Down b6989586621679943816) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680960518Sym0 :: TyFun (Down (a6989586621679943779 ~> b6989586621679943780)) (Down a6989586621679943779 ~> Down b6989586621679943780) -> Type)
Instance details Defined in Data.Singletons.Prelude.Applicative Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Fmap_6989586621680187781Sym0 :: TyFun (a6989586621679943771 ~> b6989586621679943772) (Down a6989586621679943771 ~> Down b6989586621679943772) -> Type)
Instance details Defined in Data.Singletons.Prelude.Functor Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680187800Sym1 a6989586621680187798 b6989586621679943774 :: TyFun (Down b6989586621679943774) (Down a6989586621679943773) -> Type)
Instance details Defined in Data.Singletons.Prelude.Functor Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Fmap_6989586621680187781Sym1 a6989586621680187779 :: TyFun (Down a6989586621679943771) (Down b6989586621679943772) -> Type)
Instance details Defined in Data.Singletons.Prelude.Functor Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680960518Sym1 a6989586621680960516 :: TyFun (Down a6989586621679943779) (Down b6989586621679943780) -> Type)
Instance details Defined in Data.Singletons.Prelude.Applicative Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621681077389Sym1 a6989586621681077387 b6989586621679943816 :: TyFun (a6989586621679943815 ~> Down b6989586621679943816) (Down b6989586621679943816) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () #
type Pure (a :: k1)
Instance details Defined in Data.Singletons.Prelude.Applicative type Pure (a :: k1) = Apply (Pure_6989586621680960441Sym0 :: TyFun k1 (Down k1) -> Type) a
type Fail arg
Instance details Defined in Data.Singletons.Prelude.Monad type Fail arg = Apply (Fail_6989586621679945585Sym0 :: TyFun Symbol (Down a) -> Type) arg
type Return (arg :: a)
Instance details Defined in Data.Singletons.Prelude.Monad type Return (arg :: a) = Apply (Return_6989586621679945578Sym0 :: TyFun a (Down a) -> Type) arg
type (a1 :: k1) <$ (a2 :: Down b6989586621679943774)
Instance details Defined in Data.Singletons.Prelude.Functor type (a1 :: k1) <$ (a2 :: Down b6989586621679943774) = Apply (Apply (TFHelper_6989586621680187800Sym0 :: TyFun k1 (Down b6989586621679943774 ~> Down k1) -> Type) a1) a2
type Fmap (a1 :: a6989586621679943771 ~> b6989586621679943772) (a2 :: Down a6989586621679943771)
Instance details Defined in Data.Singletons.Prelude.Functor type Fmap (a1 :: a6989586621679943771 ~> b6989586621679943772) (a2 :: Down a6989586621679943771) = Apply (Apply (Fmap_6989586621680187781Sym0 :: TyFun (a6989586621679943771 ~> b6989586621679943772) (Down a6989586621679943771 ~> Down b6989586621679943772) -> Type) a1) a2
type (arg1 :: Down a) <* (arg2 :: Down b)
Instance details Defined in Data.Singletons.Prelude.Applicative type (arg1 :: Down a) <* (arg2 :: Down b) = Apply (Apply (TFHelper_6989586621679945533Sym0 :: TyFun (Down a) (Down b ~> Down a) -> Type) arg1) arg2
type (arg1 :: Down a) *> (arg2 :: Down b)
Instance details Defined in Data.Singletons.Prelude.Applicative type (arg1 :: Down a) *> (arg2 :: Down b) = Apply (Apply (TFHelper_6989586621679945517Sym0 :: TyFun (Down a) (Down b ~> Down b) -> Type) arg1) arg2
type (a1 :: Down (a6989586621679943779 ~> b6989586621679943780)) <*> (a2 :: Down a6989586621679943779)
Instance details Defined in Data.Singletons.Prelude.Applicative type (a1 :: Down (a6989586621679943779 ~> b6989586621679943780)) <*> (a2 :: Down a6989586621679943779) = Apply (Apply (TFHelper_6989586621680960518Sym0 :: TyFun (Down (a6989586621679943779 ~> b6989586621679943780)) (Down a6989586621679943779 ~> Down b6989586621679943780) -> Type) a1) a2
type (arg1 :: Down a) >> (arg2 :: Down b)
Instance details Defined in Data.Singletons.Prelude.Monad type (arg1 :: Down a) >> (arg2 :: Down b) = Apply (Apply (TFHelper_6989586621679945568Sym0 :: TyFun (Down a) (Down b ~> Down b) -> Type) arg1) arg2
type (a1 :: Down a6989586621679943815) >>= (a2 :: a6989586621679943815 ~> Down b6989586621679943816)
Instance details Defined in Data.Singletons.Prelude.Monad type (a1 :: Down a6989586621679943815) >>= (a2 :: a6989586621679943815 ~> Down b6989586621679943816) = Apply (Apply (TFHelper_6989586621681077389Sym0 :: TyFun (Down a6989586621679943815) ((a6989586621679943815 ~> Down b6989586621679943816) ~> Down b6989586621679943816) -> Type) a1) a2
type LiftA2 (arg1 :: a ~> (b ~> c)) (arg2 :: Down a) (arg3 :: Down b)
Instance details Defined in Data.Singletons.Prelude.Applicative type LiftA2 (arg1 :: a ~> (b ~> c)) (arg2 :: Down a) (arg3 :: Down b) = Apply (Apply (Apply (LiftA2_6989586621679945504Sym0 :: TyFun (a ~> (b ~> c)) (Down a ~> (Down b ~> Down c)) -> Type) arg1) arg2) arg3
type Apply (Compare_6989586621679856604Sym1 a6989586621679856602 :: TyFun (Down a) Ordering -> Type) (a6989586621679856603 :: Down a)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Compare_6989586621679856604Sym1 a6989586621679856602 :: TyFun (Down a) Ordering -> Type) (a6989586621679856603 :: Down a) = Compare_6989586621679856604 a6989586621679856602 a6989586621679856603
type Rep (Down a)	Since: base-4.12.0.0
Instance details Defined in GHC.Generics type Rep (Down a) = D1 (MetaData "Down" "Data.Ord" "base" True) (C1 (MetaCons "Down" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 a)))
type Unwrapped (Down a)
Instance details Defined in Control.Lens.Wrapped type Unwrapped (Down a) = a
type Mempty
Instance details Defined in Data.Singletons.Prelude.Monoid type Mempty = (Mempty_6989586621680674701Sym0 :: Down a)
data Sing (b :: Down a)
Instance details Defined in Data.Singletons.Prelude.Ord data Sing (b :: Down a) where SDown :: forall a (b :: Down a) (n :: a). Sing n -> Sing (Down n)
type Demote (Down a)
Instance details Defined in Data.Singletons.Prelude.Ord type Demote (Down a) = Down (Demote a)
type Rep1 Down	Since: base-4.12.0.0
Instance details Defined in GHC.Generics type Rep1 Down = D1 (MetaData "Down" "Data.Ord" "base" True) (C1 (MetaCons "Down" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) Par1))
type Mconcat (arg :: [Down a])
Instance details Defined in Data.Singletons.Prelude.Monoid type Mconcat (arg :: [Down a]) = Apply (Mconcat_6989586621680665123Sym0 :: TyFun [Down a] (Down a) -> Type) arg
type Sconcat (arg :: NonEmpty (Down a))
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type Sconcat (arg :: NonEmpty (Down a)) = Apply (Sconcat_6989586621680188294Sym0 :: TyFun (NonEmpty (Down a)) (Down a) -> Type) arg
type FromInteger a2
Instance details Defined in Data.Singletons.Prelude.Num type FromInteger a2 = Apply (FromInteger_6989586621679939785Sym0 :: TyFun Nat (Down a1) -> Type) a2
type Signum (a2 :: Down a1)
Instance details Defined in Data.Singletons.Prelude.Num type Signum (a2 :: Down a1) = Apply (Signum_6989586621679939768Sym0 :: TyFun (Down a1) (Down a1) -> Type) a2
type Abs (a2 :: Down a1)
Instance details Defined in Data.Singletons.Prelude.Num type Abs (a2 :: Down a1) = Apply (Abs_6989586621679939749Sym0 :: TyFun (Down a1) (Down a1) -> Type) a2
type Negate (a2 :: Down a1)
Instance details Defined in Data.Singletons.Prelude.Num type Negate (a2 :: Down a1) = Apply (Negate_6989586621679939731Sym0 :: TyFun (Down a1) (Down a1) -> Type) a2
type Mappend (arg1 :: Down a) (arg2 :: Down a)
Instance details Defined in Data.Singletons.Prelude.Monoid type Mappend (arg1 :: Down a) (arg2 :: Down a) = Apply (Apply (Mappend_6989586621680665113Sym0 :: TyFun (Down a) (Down a ~> Down a) -> Type) arg1) arg2
type (a2 :: Down a1) <> (a3 :: Down a1)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type (a2 :: Down a1) <> (a3 :: Down a1) = Apply (Apply (TFHelper_6989586621680189431Sym0 :: TyFun (Down a1) (Down a1 ~> Down a1) -> Type) a2) a3
type (a2 :: Down a1) * (a3 :: Down a1)
Instance details Defined in Data.Singletons.Prelude.Num type (a2 :: Down a1) * (a3 :: Down a1) = Apply (Apply (TFHelper_6989586621679939713Sym0 :: TyFun (Down a1) (Down a1 ~> Down a1) -> Type) a2) a3
type (a2 :: Down a1) - (a3 :: Down a1)
Instance details Defined in Data.Singletons.Prelude.Num type (a2 :: Down a1) - (a3 :: Down a1) = Apply (Apply (TFHelper_6989586621679939685Sym0 :: TyFun (Down a1) (Down a1 ~> Down a1) -> Type) a2) a3
type (a2 :: Down a1) + (a3 :: Down a1)
Instance details Defined in Data.Singletons.Prelude.Num type (a2 :: Down a1) + (a3 :: Down a1) = Apply (Apply (TFHelper_6989586621679939659Sym0 :: TyFun (Down a1) (Down a1 ~> Down a1) -> Type) a2) a3
type Min (arg1 :: Down a) (arg2 :: Down a)
Instance details Defined in Data.Singletons.Prelude.Ord type Min (arg1 :: Down a) (arg2 :: Down a) = Apply (Apply (Min_6989586621679832893Sym0 :: TyFun (Down a) (Down a ~> Down a) -> Type) arg1) arg2
type Max (arg1 :: Down a) (arg2 :: Down a)
Instance details Defined in Data.Singletons.Prelude.Ord type Max (arg1 :: Down a) (arg2 :: Down a) = Apply (Apply (Max_6989586621679832875Sym0 :: TyFun (Down a) (Down a ~> Down a) -> Type) arg1) arg2
type (arg1 :: Down a) >= (arg2 :: Down a)
Instance details Defined in Data.Singletons.Prelude.Ord type (arg1 :: Down a) >= (arg2 :: Down a) = Apply (Apply (TFHelper_6989586621679832857Sym0 :: TyFun (Down a) (Down a ~> Bool) -> Type) arg1) arg2
type (arg1 :: Down a) > (arg2 :: Down a)
Instance details Defined in Data.Singletons.Prelude.Ord type (arg1 :: Down a) > (arg2 :: Down a) = Apply (Apply (TFHelper_6989586621679832839Sym0 :: TyFun (Down a) (Down a ~> Bool) -> Type) arg1) arg2
type (arg1 :: Down a) <= (arg2 :: Down a)
Instance details Defined in Data.Singletons.Prelude.Ord type (arg1 :: Down a) <= (arg2 :: Down a) = Apply (Apply (TFHelper_6989586621679832817Sym0 :: TyFun (Down a) (Down a ~> Bool) -> Type) arg1) arg2
type (arg1 :: Down a) < (arg2 :: Down a)
Instance details Defined in Data.Singletons.Prelude.Ord type (arg1 :: Down a) < (arg2 :: Down a) = Apply (Apply (TFHelper_6989586621679832797Sym0 :: TyFun (Down a) (Down a ~> Bool) -> Type) arg1) arg2
type Compare (a2 :: Down a1) (a3 :: Down a1)
Instance details Defined in Data.Singletons.Prelude.Ord type Compare (a2 :: Down a1) (a3 :: Down a1) = Apply (Apply (Compare_6989586621679856604Sym0 :: TyFun (Down a1) (Down a1 ~> Ordering) -> Type) a2) a3
type (x :: Down a) /= (y :: Down a)
Instance details Defined in Data.Singletons.Prelude.Ord type (x :: Down a) /= (y :: Down a) = Not (x == y)
type (a2 :: Down a1) == (b :: Down a1)
Instance details Defined in Data.Singletons.Prelude.Ord type (a2 :: Down a1) == (b :: Down a1) = Equals_6989586621679856608 a2 b
type Apply (DownSym0 :: TyFun a (Down a) -> Type) (t6989586621679852650 :: a)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (DownSym0 :: TyFun a (Down a) -> Type) (t6989586621679852650 :: a) = Down t6989586621679852650
type Apply (Pure_6989586621680960441Sym0 :: TyFun a (Down a) -> Type) (a6989586621680960440 :: a)
Instance details Defined in Data.Singletons.Prelude.Applicative type Apply (Pure_6989586621680960441Sym0 :: TyFun a (Down a) -> Type) (a6989586621680960440 :: a) = Pure_6989586621680960441 a6989586621680960440
type Apply (Fmap_6989586621680187781Sym1 a6989586621680187779 :: TyFun (Down a) (Down b) -> Type) (a6989586621680187780 :: Down a)
Instance details Defined in Data.Singletons.Prelude.Functor type Apply (Fmap_6989586621680187781Sym1 a6989586621680187779 :: TyFun (Down a) (Down b) -> Type) (a6989586621680187780 :: Down a) = Fmap_6989586621680187781 a6989586621680187779 a6989586621680187780
type Apply (TFHelper_6989586621680187800Sym1 a6989586621680187798 b :: TyFun (Down b) (Down a) -> Type) (a6989586621680187799 :: Down b)
Instance details Defined in Data.Singletons.Prelude.Functor type Apply (TFHelper_6989586621680187800Sym1 a6989586621680187798 b :: TyFun (Down b) (Down a) -> Type) (a6989586621680187799 :: Down b) = TFHelper_6989586621680187800 a6989586621680187798 a6989586621680187799
type Apply (TFHelper_6989586621680960518Sym1 a6989586621680960516 :: TyFun (Down a) (Down b) -> Type) (a6989586621680960517 :: Down a)
Instance details Defined in Data.Singletons.Prelude.Applicative type Apply (TFHelper_6989586621680960518Sym1 a6989586621680960516 :: TyFun (Down a) (Down b) -> Type) (a6989586621680960517 :: Down a) = TFHelper_6989586621680960518 a6989586621680960516 a6989586621680960517
type Apply (TFHelper_6989586621681077389Sym1 a6989586621681077387 b :: TyFun (a ~> Down b) (Down b) -> Type) (a6989586621681077388 :: a ~> Down b)
Instance details Defined in Data.Singletons.Prelude.Monad type Apply (TFHelper_6989586621681077389Sym1 a6989586621681077387 b :: TyFun (a ~> Down b) (Down b) -> Type) (a6989586621681077388 :: a ~> Down b) = TFHelper_6989586621681077389 a6989586621681077387 a6989586621681077388
type Apply (TFHelper_6989586621680187800Sym0 :: TyFun a6989586621679943773 (Down b6989586621679943774 ~> Down a6989586621679943773) -> Type) (a6989586621680187798 :: a6989586621679943773)
Instance details Defined in Data.Singletons.Prelude.Functor type Apply (TFHelper_6989586621680187800Sym0 :: TyFun a6989586621679943773 (Down b6989586621679943774 ~> Down a6989586621679943773) -> Type) (a6989586621680187798 :: a6989586621679943773) = (TFHelper_6989586621680187800Sym1 a6989586621680187798 b6989586621679943774 :: TyFun (Down b6989586621679943774) (Down a6989586621679943773) -> Type)
type Apply (Compare_6989586621679856604Sym0 :: TyFun (Down a6989586621679854521) (Down a6989586621679854521 ~> Ordering) -> Type) (a6989586621679856602 :: Down a6989586621679854521)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Compare_6989586621679856604Sym0 :: TyFun (Down a6989586621679854521) (Down a6989586621679854521 ~> Ordering) -> Type) (a6989586621679856602 :: Down a6989586621679854521) = Compare_6989586621679856604Sym1 a6989586621679856602
type Apply (TFHelper_6989586621680960518Sym0 :: TyFun (Down (a6989586621679943779 ~> b6989586621679943780)) (Down a6989586621679943779 ~> Down b6989586621679943780) -> Type) (a6989586621680960516 :: Down (a6989586621679943779 ~> b6989586621679943780))
Instance details Defined in Data.Singletons.Prelude.Applicative type Apply (TFHelper_6989586621680960518Sym0 :: TyFun (Down (a6989586621679943779 ~> b6989586621679943780)) (Down a6989586621679943779 ~> Down b6989586621679943780) -> Type) (a6989586621680960516 :: Down (a6989586621679943779 ~> b6989586621679943780)) = TFHelper_6989586621680960518Sym1 a6989586621680960516
type Apply (TFHelper_6989586621681077389Sym0 :: TyFun (Down a6989586621679943815) ((a6989586621679943815 ~> Down b6989586621679943816) ~> Down b6989586621679943816) -> Type) (a6989586621681077387 :: Down a6989586621679943815)
Instance details Defined in Data.Singletons.Prelude.Monad type Apply (TFHelper_6989586621681077389Sym0 :: TyFun (Down a6989586621679943815) ((a6989586621679943815 ~> Down b6989586621679943816) ~> Down b6989586621679943816) -> Type) (a6989586621681077387 :: Down a6989586621679943815) = (TFHelper_6989586621681077389Sym1 a6989586621681077387 b6989586621679943816 :: TyFun (a6989586621679943815 ~> Down b6989586621679943816) (Down b6989586621679943816) -> Type)
type Apply (Fmap_6989586621680187781Sym0 :: TyFun (a6989586621679943771 ~> b6989586621679943772) (Down a6989586621679943771 ~> Down b6989586621679943772) -> Type) (a6989586621680187779 :: a6989586621679943771 ~> b6989586621679943772)
Instance details Defined in Data.Singletons.Prelude.Functor type Apply (Fmap_6989586621680187781Sym0 :: TyFun (a6989586621679943771 ~> b6989586621679943772) (Down a6989586621679943771 ~> Down b6989586621679943772) -> Type) (a6989586621680187779 :: a6989586621679943771 ~> b6989586621679943772) = Fmap_6989586621680187781Sym1 a6989586621680187779

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 is a safer alternative to the 'undefined :: a' idiom.

>>> Proxy :: Proxy (Void, Int -> Int)
Proxy

Proxy can even hold types of higher kinds,

>>> Proxy :: Proxy Either
Proxy

>>> Proxy :: Proxy Functor
Proxy

>>> Proxy :: Proxy complicatedStructure
Proxy

Constructors

Proxy

Instances

Generic1 (Proxy :: k -> Type)
Instance details Defined in GHC.Generics Associated Types type Rep1 Proxy :: k -> Type # Methods from1 :: Proxy a -> Rep1 Proxy a # to1 :: Rep1 Proxy a -> Proxy a #
FunctorWithIndex Void (Proxy :: Type -> Type)
Instance details Defined in Control.Lens.Indexed Methods imap :: (Void -> a -> b) -> Proxy a -> Proxy b # imapped :: IndexedSetter Void (Proxy a) (Proxy b) a b #
FoldableWithIndex Void (Proxy :: Type -> Type)
Instance details Defined in Control.Lens.Indexed Methods ifoldMap :: Monoid m => (Void -> a -> m) -> Proxy a -> m # ifolded :: IndexedFold Void (Proxy a) a # ifoldr :: (Void -> a -> b -> b) -> b -> Proxy a -> b # ifoldl :: (Void -> b -> a -> b) -> b -> Proxy a -> b # ifoldr' :: (Void -> a -> b -> b) -> b -> Proxy a -> b # ifoldl' :: (Void -> b -> a -> b) -> b -> Proxy a -> b #
TraversableWithIndex Void (Proxy :: Type -> Type)
Instance details 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
Instance details Defined in Data.Proxy Methods (>>=) :: Proxy a -> (a -> Proxy b) -> Proxy b # (>>) :: Proxy a -> Proxy b -> Proxy b # return :: a -> Proxy a # fail :: String -> Proxy a #
Functor (Proxy :: Type -> Type)	Since: base-4.7.0.0
Instance details Defined in Data.Proxy Methods fmap :: (a -> b) -> Proxy a -> Proxy b # (<$) :: a -> Proxy b -> Proxy a #
Applicative (Proxy :: Type -> Type)	Since: base-4.7.0.0
Instance details Defined in Data.Proxy Methods pure :: a -> Proxy a # (<>) :: Proxy (a -> b) -> Proxy a -> Proxy b # liftA2 :: (a -> b -> c) -> Proxy a -> Proxy b -> Proxy c # (>) :: Proxy a -> Proxy b -> Proxy b # (<*) :: Proxy a -> Proxy b -> Proxy a #
Foldable (Proxy :: Type -> Type)	Since: base-4.7.0.0
Instance details 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 # toList :: Proxy a -> [a] # null :: Proxy a -> Bool # length :: Proxy a -> Int # elem :: Eq a => a -> Proxy a -> Bool # maximum :: Ord a => Proxy a -> a # minimum :: Ord a => Proxy a -> a # sum :: Num a => Proxy a -> a # product :: Num a => Proxy a -> a #
Traversable (Proxy :: Type -> Type)	Since: base-4.7.0.0
Instance details Defined in Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> Proxy a -> f (Proxy b) # sequenceA :: Applicative f => Proxy (f a) -> f (Proxy a) # mapM :: Monad m => (a -> m b) -> Proxy a -> m (Proxy b) # sequence :: Monad m => Proxy (m a) -> m (Proxy a) #
MonadPlus (Proxy :: Type -> Type)	Since: base-4.9.0.0
Instance details Defined in Data.Proxy Methods mzero :: Proxy a # mplus :: Proxy a -> Proxy a -> Proxy a #
Alternative (Proxy :: Type -> Type)	Since: base-4.9.0.0
Instance details Defined in Data.Proxy Methods empty :: Proxy a # (<\|>) :: Proxy a -> Proxy a -> Proxy a # some :: Proxy a -> Proxy [a] # many :: Proxy a -> Proxy [a] #
Distributive (Proxy :: Type -> Type)
Instance details Defined in Data.Distributive Methods distribute :: Functor f => f (Proxy a) -> Proxy (f a) # collect :: Functor f => (a -> Proxy b) -> f a -> Proxy (f b) # distributeM :: Monad m => m (Proxy a) -> Proxy (m a) # collectM :: Monad m => (a -> Proxy b) -> m a -> Proxy (m b) #
Contravariant (Proxy :: Type -> Type)
Instance details Defined in Data.Functor.Contravariant Methods contramap :: (a -> b) -> Proxy b -> Proxy a # (>$) :: b -> Proxy b -> Proxy a #
Representable (Proxy :: Type -> Type)
Instance details Defined in Data.Functor.Rep Associated Types type Rep Proxy :: Type # Methods tabulate :: (Rep Proxy -> a) -> Proxy a # index :: Proxy a -> Rep Proxy -> a #
Eq1 (Proxy :: Type -> Type)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Classes Methods liftEq :: (a -> b -> Bool) -> Proxy a -> Proxy b -> Bool #
Ord1 (Proxy :: Type -> Type)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Classes Methods liftCompare :: (a -> b -> Ordering) -> Proxy a -> Proxy b -> Ordering #
Read1 (Proxy :: Type -> Type)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Classes Methods liftReadsPrec :: (Int -> ReadS a) -> ReadS [a] -> Int -> ReadS (Proxy a) # liftReadList :: (Int -> ReadS a) -> ReadS [a] -> ReadS [Proxy a] # liftReadPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec (Proxy a) # liftReadListPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec [Proxy a] #
Show1 (Proxy :: Type -> Type)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Classes Methods liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> Proxy a -> ShowS # liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [Proxy a] -> ShowS #
NFData1 (Proxy :: Type -> Type)	Since: deepseq-1.4.3.0
Instance details Defined in Control.DeepSeq Methods liftRnf :: (a -> ()) -> Proxy a -> () #
Hashable1 (Proxy :: Type -> Type)
Instance details Defined in Data.Hashable.Class Methods liftHashWithSalt :: (Int -> a -> Int) -> Int -> Proxy a -> Int #
Keyed (Proxy :: Type -> Type)
Instance details Defined in Data.Key Methods mapWithKey :: (Key Proxy -> a -> b) -> Proxy a -> Proxy b #
Zip (Proxy :: Type -> Type)
Instance details Defined in Data.Key Methods zipWith :: (a -> b -> c) -> Proxy a -> Proxy b -> Proxy c # zip :: Proxy a -> Proxy b -> Proxy (a, b) # zap :: Proxy (a -> b) -> Proxy a -> Proxy b #
ZipWithKey (Proxy :: Type -> Type)
Instance details Defined in Data.Key Methods zipWithKey :: (Key Proxy -> a -> b -> c) -> Proxy a -> Proxy b -> Proxy c # zapWithKey :: Proxy (Key Proxy -> a -> b) -> Proxy a -> Proxy b #
Indexable (Proxy :: Type -> Type)
Instance details Defined in Data.Key Methods index :: Proxy a -> Key Proxy -> a #
Lookup (Proxy :: Type -> Type)
Instance details Defined in Data.Key Methods lookup :: Key Proxy -> Proxy a -> Maybe a #
Adjustable (Proxy :: Type -> Type)
Instance details Defined in Data.Key Methods adjust :: (a -> a) -> Key Proxy -> Proxy a -> Proxy a # replace :: Key Proxy -> a -> Proxy a -> Proxy a #
FoldableWithKey (Proxy :: Type -> Type)
Instance details Defined in Data.Key Methods toKeyedList :: Proxy a -> [(Key Proxy, a)] # foldMapWithKey :: Monoid m => (Key Proxy -> a -> m) -> Proxy a -> m # foldrWithKey :: (Key Proxy -> a -> b -> b) -> b -> Proxy a -> b # foldlWithKey :: (b -> Key Proxy -> a -> b) -> b -> Proxy a -> b #
TraversableWithKey (Proxy :: Type -> Type)
Instance details 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)
Instance details Defined in Data.Functor.Bind.Class Methods (<.>) :: Proxy (a -> b) -> Proxy a -> Proxy b # (.>) :: Proxy a -> Proxy b -> Proxy b # (<.) :: Proxy a -> Proxy b -> Proxy a # liftF2 :: (a -> b -> c) -> Proxy a -> Proxy b -> Proxy c #
Bind (Proxy :: Type -> Type)
Instance details Defined in Data.Functor.Bind.Class Methods (>>-) :: Proxy a -> (a -> Proxy b) -> Proxy b # join :: Proxy (Proxy a) -> Proxy a #
Bounded (Proxy t)	Since: base-4.7.0.0
Instance details Defined in Data.Proxy Methods minBound :: Proxy t # maxBound :: Proxy t #
Enum (Proxy s)	Since: base-4.7.0.0
Instance details Defined in Data.Proxy Methods succ :: Proxy s -> Proxy s # pred :: Proxy s -> Proxy s # toEnum :: Int -> Proxy s # fromEnum :: Proxy s -> Int # enumFrom :: Proxy s -> [Proxy s] # enumFromThen :: Proxy s -> Proxy s -> [Proxy s] # enumFromTo :: Proxy s -> Proxy s -> [Proxy s] # enumFromThenTo :: Proxy s -> Proxy s -> Proxy s -> [Proxy s] #
Eq (Proxy s)	Since: base-4.7.0.0
Instance details Defined in Data.Proxy Methods (==) :: Proxy s -> Proxy s -> Bool # (/=) :: Proxy s -> Proxy s -> Bool #
Ord (Proxy s)	Since: base-4.7.0.0
Instance details Defined in Data.Proxy Methods compare :: Proxy s -> Proxy s -> Ordering # (<) :: Proxy s -> Proxy s -> Bool # (<=) :: Proxy s -> Proxy s -> Bool # (>) :: Proxy s -> Proxy s -> Bool # (>=) :: Proxy s -> Proxy s -> Bool # max :: Proxy s -> Proxy s -> Proxy s # min :: Proxy s -> Proxy s -> Proxy s #
Read (Proxy t)	Since: base-4.7.0.0
Instance details Defined in Data.Proxy Methods readsPrec :: Int -> ReadS (Proxy t) # readList :: ReadS [Proxy t] # readPrec :: ReadPrec (Proxy t) # readListPrec :: ReadPrec [Proxy t] #
Show (Proxy s)	Since: base-4.7.0.0
Instance details Defined in Data.Proxy Methods showsPrec :: Int -> Proxy s -> ShowS # show :: Proxy s -> String # showList :: [Proxy s] -> ShowS #
Ix (Proxy s)	Since: base-4.7.0.0
Instance details Defined in Data.Proxy Methods range :: (Proxy s, Proxy s) -> [Proxy s] # index :: (Proxy s, Proxy s) -> Proxy s -> Int # unsafeIndex :: (Proxy s, Proxy s) -> Proxy s -> Int inRange :: (Proxy s, Proxy s) -> Proxy s -> Bool # rangeSize :: (Proxy s, Proxy s) -> Int # unsafeRangeSize :: (Proxy s, Proxy s) -> Int
Generic (Proxy t)
Instance details Defined in GHC.Generics Associated Types type Rep (Proxy t) :: Type -> Type # Methods from :: Proxy t -> Rep (Proxy t) x # to :: Rep (Proxy t) x -> Proxy t #
Semigroup (Proxy s)	Since: base-4.9.0.0
Instance details Defined in Data.Proxy Methods (<>) :: Proxy s -> Proxy s -> Proxy s # sconcat :: NonEmpty (Proxy s) -> Proxy s # stimes :: Integral b => b -> Proxy s -> Proxy s #
Monoid (Proxy s)	Since: base-4.7.0.0
Instance details Defined in Data.Proxy Methods mempty :: Proxy s # mappend :: Proxy s -> Proxy s -> Proxy s # mconcat :: [Proxy s] -> Proxy s #
NFData (Proxy a)	Since: deepseq-1.4.0.0
Instance details Defined in Control.DeepSeq Methods rnf :: Proxy a -> () #
Hashable (Proxy a)
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Proxy a -> Int # hash :: Proxy a -> Int #
MonoPointed (Proxy a)	Since: mono-traversable-1.0.11.0
Instance details Defined in Data.MonoTraversable Methods opoint :: Element (Proxy a) -> Proxy a #
MonoTraversable (Proxy a)	Since: mono-traversable-1.0.11.0
Instance details Defined in Data.MonoTraversable Methods otraverse :: Applicative f => (Element (Proxy a) -> f (Element (Proxy a))) -> Proxy a -> f (Proxy a) # omapM :: Applicative m => (Element (Proxy a) -> m (Element (Proxy a))) -> Proxy a -> m (Proxy a) #
MonoFoldable (Proxy a)	Since: mono-traversable-1.0.11.0
Instance details Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element (Proxy a) -> m) -> Proxy a -> m # ofoldr :: (Element (Proxy a) -> b -> b) -> b -> Proxy a -> b # ofoldl' :: (a0 -> Element (Proxy a) -> a0) -> a0 -> Proxy a -> a0 # otoList :: Proxy a -> [Element (Proxy a)] # oall :: (Element (Proxy a) -> Bool) -> Proxy a -> Bool # oany :: (Element (Proxy a) -> Bool) -> Proxy a -> Bool # onull :: Proxy a -> Bool # olength :: Proxy a -> Int # olength64 :: Proxy a -> Int64 # ocompareLength :: Integral i => Proxy a -> i -> Ordering # otraverse_ :: Applicative f => (Element (Proxy a) -> f b) -> Proxy a -> f () # ofor_ :: Applicative f => Proxy a -> (Element (Proxy a) -> f b) -> f () # omapM_ :: Applicative m => (Element (Proxy a) -> m ()) -> Proxy a -> m () # oforM_ :: Applicative m => Proxy a -> (Element (Proxy a) -> m ()) -> m () # ofoldlM :: Monad m => (a0 -> Element (Proxy a) -> m a0) -> a0 -> Proxy a -> m a0 # ofoldMap1Ex :: Semigroup m => (Element (Proxy a) -> m) -> Proxy a -> m # ofoldr1Ex :: (Element (Proxy a) -> Element (Proxy a) -> Element (Proxy a)) -> Proxy a -> Element (Proxy a) # ofoldl1Ex' :: (Element (Proxy a) -> Element (Proxy a) -> Element (Proxy a)) -> Proxy a -> Element (Proxy a) # headEx :: Proxy a -> Element (Proxy a) # lastEx :: Proxy a -> Element (Proxy a) # unsafeHead :: Proxy a -> Element (Proxy a) # unsafeLast :: Proxy a -> Element (Proxy a) # maximumByEx :: (Element (Proxy a) -> Element (Proxy a) -> Ordering) -> Proxy a -> Element (Proxy a) # minimumByEx :: (Element (Proxy a) -> Element (Proxy a) -> Ordering) -> Proxy a -> Element (Proxy a) # oelem :: Element (Proxy a) -> Proxy a -> Bool # onotElem :: Element (Proxy a) -> Proxy a -> Bool #
MonoFunctor (Proxy a)	Since: mono-traversable-1.0.11.0
Instance details Defined in Data.MonoTraversable Methods omap :: (Element (Proxy a) -> Element (Proxy a)) -> Proxy a -> Proxy a #
type Rep1 (Proxy :: k -> Type)	Since: base-4.6.0.0
Instance details Defined in GHC.Generics type Rep1 (Proxy :: k -> Type) = D1 (MetaData "Proxy" "Data.Proxy" "base" False) (C1 (MetaCons "Proxy" PrefixI False) (U1 :: k -> Type))
type Rep (Proxy :: Type -> Type)
Instance details Defined in Data.Functor.Rep type Rep (Proxy :: Type -> Type) = Void
type Key (Proxy :: Type -> Type)
Instance details Defined in Data.Key type Key (Proxy :: Type -> Type) = Void
type Rep (Proxy t)	Since: base-4.6.0.0
Instance details Defined in GHC.Generics type Rep (Proxy t) = D1 (MetaData "Proxy" "Data.Proxy" "base" False) (C1 (MetaCons "Proxy" PrefixI False) (U1 :: Type -> Type))
type Element (Proxy a)
Instance details Defined in Data.MonoTraversable type Element (Proxy a) = a

data KProxy t #

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

(.) :: Category cat => cat b c -> cat a b -> cat a c infixr 9 #

morphism composition

id :: Category cat => cat a a #

the identity morphism

data IOMode #

See openFile

Constructors

ReadMode
WriteMode
AppendMode
ReadWriteMode

Instances

Enum IOMode	Since: base-4.2.0.0
Instance details Defined in GHC.IO.IOMode Methods succ :: IOMode -> IOMode # pred :: IOMode -> IOMode # toEnum :: Int -> IOMode # fromEnum :: IOMode -> Int # enumFrom :: IOMode -> [IOMode] # enumFromThen :: IOMode -> IOMode -> [IOMode] # enumFromTo :: IOMode -> IOMode -> [IOMode] # enumFromThenTo :: IOMode -> IOMode -> IOMode -> [IOMode] #
Eq IOMode	Since: base-4.2.0.0
Instance details Defined in GHC.IO.IOMode Methods (==) :: IOMode -> IOMode -> Bool # (/=) :: IOMode -> IOMode -> Bool #
Ord IOMode	Since: base-4.2.0.0
Instance details Defined in GHC.IO.IOMode Methods compare :: IOMode -> IOMode -> Ordering # (<) :: IOMode -> IOMode -> Bool # (<=) :: IOMode -> IOMode -> Bool # (>) :: IOMode -> IOMode -> Bool # (>=) :: IOMode -> IOMode -> Bool # max :: IOMode -> IOMode -> IOMode # min :: IOMode -> IOMode -> IOMode #
Read IOMode	Since: base-4.2.0.0
Instance details Defined in GHC.IO.IOMode Methods readsPrec :: Int -> ReadS IOMode # readList :: ReadS [IOMode] # readPrec :: ReadPrec IOMode # readListPrec :: ReadPrec [IOMode] #
Show IOMode	Since: base-4.2.0.0
Instance details Defined in GHC.IO.IOMode Methods showsPrec :: Int -> IOMode -> ShowS # show :: IOMode -> String # showList :: [IOMode] -> ShowS #
Ix IOMode	Since: base-4.2.0.0
Instance details Defined in GHC.IO.IOMode Methods range :: (IOMode, IOMode) -> [IOMode] # index :: (IOMode, IOMode) -> IOMode -> Int # unsafeIndex :: (IOMode, IOMode) -> IOMode -> Int inRange :: (IOMode, IOMode) -> IOMode -> Bool # rangeSize :: (IOMode, IOMode) -> Int # unsafeRangeSize :: (IOMode, IOMode) -> Int

class Storable a #

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 a, for some a 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

Storable Bool	Since: base-2.1
Instance details Defined in Foreign.Storable Methods sizeOf :: Bool -> Int # alignment :: Bool -> Int # peekElemOff :: Ptr Bool -> Int -> IO Bool # pokeElemOff :: Ptr Bool -> Int -> Bool -> IO () # peekByteOff :: Ptr b -> Int -> IO Bool # pokeByteOff :: Ptr b -> Int -> Bool -> IO () # peek :: Ptr Bool -> IO Bool # poke :: Ptr Bool -> Bool -> IO () #
Storable Char	Since: base-2.1
Instance details Defined in Foreign.Storable Methods sizeOf :: Char -> Int # alignment :: Char -> Int # peekElemOff :: Ptr Char -> Int -> IO Char # pokeElemOff :: Ptr Char -> Int -> Char -> IO () # peekByteOff :: Ptr b -> Int -> IO Char # pokeByteOff :: Ptr b -> Int -> Char -> IO () # peek :: Ptr Char -> IO Char # poke :: Ptr Char -> Char -> IO () #
Storable Double	Since: base-2.1
Instance details Defined in Foreign.Storable Methods sizeOf :: Double -> Int # alignment :: Double -> Int # peekElemOff :: Ptr Double -> Int -> IO Double # pokeElemOff :: Ptr Double -> Int -> Double -> IO () # peekByteOff :: Ptr b -> Int -> IO Double # pokeByteOff :: Ptr b -> Int -> Double -> IO () # peek :: Ptr Double -> IO Double # poke :: Ptr Double -> Double -> IO () #
Storable Float	Since: base-2.1
Instance details Defined in Foreign.Storable Methods sizeOf :: Float -> Int # alignment :: Float -> Int # peekElemOff :: Ptr Float -> Int -> IO Float # pokeElemOff :: Ptr Float -> Int -> Float -> IO () # peekByteOff :: Ptr b -> Int -> IO Float # pokeByteOff :: Ptr b -> Int -> Float -> IO () # peek :: Ptr Float -> IO Float # poke :: Ptr Float -> Float -> IO () #
Storable Int	Since: base-2.1
Instance details Defined in Foreign.Storable Methods sizeOf :: Int -> Int # alignment :: Int -> Int # peekElemOff :: Ptr Int -> Int -> IO Int # pokeElemOff :: Ptr Int -> Int -> Int -> IO () # peekByteOff :: Ptr b -> Int -> IO Int # pokeByteOff :: Ptr b -> Int -> Int -> IO () # peek :: Ptr Int -> IO Int # poke :: Ptr Int -> Int -> IO () #
Storable Int8	Since: base-2.1
Instance details Defined in Foreign.Storable Methods sizeOf :: Int8 -> Int # alignment :: Int8 -> Int # peekElemOff :: Ptr Int8 -> Int -> IO Int8 # pokeElemOff :: Ptr Int8 -> Int -> Int8 -> IO () # peekByteOff :: Ptr b -> Int -> IO Int8 # pokeByteOff :: Ptr b -> Int -> Int8 -> IO () # peek :: Ptr Int8 -> IO Int8 # poke :: Ptr Int8 -> Int8 -> IO () #
Storable Int16	Since: base-2.1
Instance details Defined in Foreign.Storable Methods sizeOf :: Int16 -> Int # alignment :: Int16 -> Int # peekElemOff :: Ptr Int16 -> Int -> IO Int16 # pokeElemOff :: Ptr Int16 -> Int -> Int16 -> IO () # peekByteOff :: Ptr b -> Int -> IO Int16 # pokeByteOff :: Ptr b -> Int -> Int16 -> IO () # peek :: Ptr Int16 -> IO Int16 # poke :: Ptr Int16 -> Int16 -> IO () #
Storable Int32	Since: base-2.1
Instance details Defined in Foreign.Storable Methods sizeOf :: Int32 -> Int # alignment :: Int32 -> Int # peekElemOff :: Ptr Int32 -> Int -> IO Int32 # pokeElemOff :: Ptr Int32 -> Int -> Int32 -> IO () # peekByteOff :: Ptr b -> Int -> IO Int32 # pokeByteOff :: Ptr b -> Int -> Int32 -> IO () # peek :: Ptr Int32 -> IO Int32 # poke :: Ptr Int32 -> Int32 -> IO () #
Storable Int64	Since: base-2.1
Instance details Defined in Foreign.Storable Methods sizeOf :: Int64 -> Int # alignment :: Int64 -> Int # peekElemOff :: Ptr Int64 -> Int -> IO Int64 # pokeElemOff :: Ptr Int64 -> Int -> Int64 -> IO () # peekByteOff :: Ptr b -> Int -> IO Int64 # pokeByteOff :: Ptr b -> Int -> Int64 -> IO () # peek :: Ptr Int64 -> IO Int64 # poke :: Ptr Int64 -> Int64 -> IO () #
Storable Word	Since: base-2.1
Instance details Defined in Foreign.Storable Methods sizeOf :: Word -> Int # alignment :: Word -> Int # peekElemOff :: Ptr Word -> Int -> IO Word # pokeElemOff :: Ptr Word -> Int -> Word -> IO () # peekByteOff :: Ptr b -> Int -> IO Word # pokeByteOff :: Ptr b -> Int -> Word -> IO () # peek :: Ptr Word -> IO Word # poke :: Ptr Word -> Word -> IO () #
Storable Word8	Since: base-2.1
Instance details Defined in Foreign.Storable Methods sizeOf :: Word8 -> Int # alignment :: Word8 -> Int # peekElemOff :: Ptr Word8 -> Int -> IO Word8 # pokeElemOff :: Ptr Word8 -> Int -> Word8 -> IO () # peekByteOff :: Ptr b -> Int -> IO Word8 # pokeByteOff :: Ptr b -> Int -> Word8 -> IO () # peek :: Ptr Word8 -> IO Word8 # poke :: Ptr Word8 -> Word8 -> IO () #
Storable Word16	Since: base-2.1
Instance details Defined in Foreign.Storable Methods sizeOf :: Word16 -> Int # alignment :: Word16 -> Int # peekElemOff :: Ptr Word16 -> Int -> IO Word16 # pokeElemOff :: Ptr Word16 -> Int -> Word16 -> IO () # peekByteOff :: Ptr b -> Int -> IO Word16 # pokeByteOff :: Ptr b -> Int -> Word16 -> IO () # peek :: Ptr Word16 -> IO Word16 # poke :: Ptr Word16 -> Word16 -> IO () #
Storable Word32	Since: base-2.1
Instance details Defined in Foreign.Storable Methods sizeOf :: Word32 -> Int # alignment :: Word32 -> Int # peekElemOff :: Ptr Word32 -> Int -> IO Word32 # pokeElemOff :: Ptr Word32 -> Int -> Word32 -> IO () # peekByteOff :: Ptr b -> Int -> IO Word32 # pokeByteOff :: Ptr b -> Int -> Word32 -> IO () # peek :: Ptr Word32 -> IO Word32 # poke :: Ptr Word32 -> Word32 -> IO () #
Storable Word64	Since: base-2.1
Instance details Defined in Foreign.Storable Methods sizeOf :: Word64 -> Int # alignment :: Word64 -> Int # peekElemOff :: Ptr Word64 -> Int -> IO Word64 # pokeElemOff :: Ptr Word64 -> Int -> Word64 -> IO () # peekByteOff :: Ptr b -> Int -> IO Word64 # pokeByteOff :: Ptr b -> Int -> Word64 -> IO () # peek :: Ptr Word64 -> IO Word64 # poke :: Ptr Word64 -> Word64 -> IO () #
Storable ()	Since: base-4.9.0.0
Instance details Defined in Foreign.Storable Methods sizeOf :: () -> Int # alignment :: () -> Int # peekElemOff :: Ptr () -> Int -> IO () # pokeElemOff :: Ptr () -> Int -> () -> IO () # peekByteOff :: Ptr b -> Int -> IO () # pokeByteOff :: Ptr b -> Int -> () -> IO () # peek :: Ptr () -> IO () # poke :: Ptr () -> () -> IO () #
Storable CChar
Instance details Defined in Foreign.C.Types Methods sizeOf :: CChar -> Int # alignment :: CChar -> Int # peekElemOff :: Ptr CChar -> Int -> IO CChar # pokeElemOff :: Ptr CChar -> Int -> CChar -> IO () # peekByteOff :: Ptr b -> Int -> IO CChar # pokeByteOff :: Ptr b -> Int -> CChar -> IO () # peek :: Ptr CChar -> IO CChar # poke :: Ptr CChar -> CChar -> IO () #
Storable CSChar
Instance details Defined in Foreign.C.Types Methods sizeOf :: CSChar -> Int # alignment :: CSChar -> Int # peekElemOff :: Ptr CSChar -> Int -> IO CSChar # pokeElemOff :: Ptr CSChar -> Int -> CSChar -> IO () # peekByteOff :: Ptr b -> Int -> IO CSChar # pokeByteOff :: Ptr b -> Int -> CSChar -> IO () # peek :: Ptr CSChar -> IO CSChar # poke :: Ptr CSChar -> CSChar -> IO () #
Storable CUChar
Instance details Defined in Foreign.C.Types Methods sizeOf :: CUChar -> Int # alignment :: CUChar -> Int # peekElemOff :: Ptr CUChar -> Int -> IO CUChar # pokeElemOff :: Ptr CUChar -> Int -> CUChar -> IO () # peekByteOff :: Ptr b -> Int -> IO CUChar # pokeByteOff :: Ptr b -> Int -> CUChar -> IO () # peek :: Ptr CUChar -> IO CUChar # poke :: Ptr CUChar -> CUChar -> IO () #
Storable CShort
Instance details Defined in Foreign.C.Types Methods sizeOf :: CShort -> Int # alignment :: CShort -> Int # peekElemOff :: Ptr CShort -> Int -> IO CShort # pokeElemOff :: Ptr CShort -> Int -> CShort -> IO () # peekByteOff :: Ptr b -> Int -> IO CShort # pokeByteOff :: Ptr b -> Int -> CShort -> IO () # peek :: Ptr CShort -> IO CShort # poke :: Ptr CShort -> CShort -> IO () #
Storable CUShort
Instance details Defined in Foreign.C.Types Methods sizeOf :: CUShort -> Int # alignment :: CUShort -> Int # peekElemOff :: Ptr CUShort -> Int -> IO CUShort # pokeElemOff :: Ptr CUShort -> Int -> CUShort -> IO () # peekByteOff :: Ptr b -> Int -> IO CUShort # pokeByteOff :: Ptr b -> Int -> CUShort -> IO () # peek :: Ptr CUShort -> IO CUShort # poke :: Ptr CUShort -> CUShort -> IO () #
Storable CInt
Instance details Defined in Foreign.C.Types Methods sizeOf :: CInt -> Int # alignment :: CInt -> Int # peekElemOff :: Ptr CInt -> Int -> IO CInt # pokeElemOff :: Ptr CInt -> Int -> CInt -> IO () # peekByteOff :: Ptr b -> Int -> IO CInt # pokeByteOff :: Ptr b -> Int -> CInt -> IO () # peek :: Ptr CInt -> IO CInt # poke :: Ptr CInt -> CInt -> IO () #
Storable CUInt
Instance details Defined in Foreign.C.Types Methods sizeOf :: CUInt -> Int # alignment :: CUInt -> Int # peekElemOff :: Ptr CUInt -> Int -> IO CUInt # pokeElemOff :: Ptr CUInt -> Int -> CUInt -> IO () # peekByteOff :: Ptr b -> Int -> IO CUInt # pokeByteOff :: Ptr b -> Int -> CUInt -> IO () # peek :: Ptr CUInt -> IO CUInt # poke :: Ptr CUInt -> CUInt -> IO () #
Storable CLong
Instance details Defined in Foreign.C.Types Methods sizeOf :: CLong -> Int # alignment :: CLong -> Int # peekElemOff :: Ptr CLong -> Int -> IO CLong # pokeElemOff :: Ptr CLong -> Int -> CLong -> IO () # peekByteOff :: Ptr b -> Int -> IO CLong # pokeByteOff :: Ptr b -> Int -> CLong -> IO () # peek :: Ptr CLong -> IO CLong # poke :: Ptr CLong -> CLong -> IO () #
Storable CULong
Instance details Defined in Foreign.C.Types Methods sizeOf :: CULong -> Int # alignment :: CULong -> Int # peekElemOff :: Ptr CULong -> Int -> IO CULong # pokeElemOff :: Ptr CULong -> Int -> CULong -> IO () # peekByteOff :: Ptr b -> Int -> IO CULong # pokeByteOff :: Ptr b -> Int -> CULong -> IO () # peek :: Ptr CULong -> IO CULong # poke :: Ptr CULong -> CULong -> IO () #
Storable CLLong
Instance details Defined in Foreign.C.Types Methods sizeOf :: CLLong -> Int # alignment :: CLLong -> Int # peekElemOff :: Ptr CLLong -> Int -> IO CLLong # pokeElemOff :: Ptr CLLong -> Int -> CLLong -> IO () # peekByteOff :: Ptr b -> Int -> IO CLLong # pokeByteOff :: Ptr b -> Int -> CLLong -> IO () # peek :: Ptr CLLong -> IO CLLong # poke :: Ptr CLLong -> CLLong -> IO () #
Storable CULLong
Instance details Defined in Foreign.C.Types Methods sizeOf :: CULLong -> Int # alignment :: CULLong -> Int # peekElemOff :: Ptr CULLong -> Int -> IO CULLong # pokeElemOff :: Ptr CULLong -> Int -> CULLong -> IO () # peekByteOff :: Ptr b -> Int -> IO CULLong # pokeByteOff :: Ptr b -> Int -> CULLong -> IO () # peek :: Ptr CULLong -> IO CULLong # poke :: Ptr CULLong -> CULLong -> IO () #
Storable CBool
Instance details Defined in Foreign.C.Types Methods sizeOf :: CBool -> Int # alignment :: CBool -> Int # peekElemOff :: Ptr CBool -> Int -> IO CBool # pokeElemOff :: Ptr CBool -> Int -> CBool -> IO () # peekByteOff :: Ptr b -> Int -> IO CBool # pokeByteOff :: Ptr b -> Int -> CBool -> IO () # peek :: Ptr CBool -> IO CBool # poke :: Ptr CBool -> CBool -> IO () #
Storable CFloat
Instance details Defined in Foreign.C.Types Methods sizeOf :: CFloat -> Int # alignment :: CFloat -> Int # peekElemOff :: Ptr CFloat -> Int -> IO CFloat # pokeElemOff :: Ptr CFloat -> Int -> CFloat -> IO () # peekByteOff :: Ptr b -> Int -> IO CFloat # pokeByteOff :: Ptr b -> Int -> CFloat -> IO () # peek :: Ptr CFloat -> IO CFloat # poke :: Ptr CFloat -> CFloat -> IO () #
Storable CDouble
Instance details Defined in Foreign.C.Types Methods sizeOf :: CDouble -> Int # alignment :: CDouble -> Int # peekElemOff :: Ptr CDouble -> Int -> IO CDouble # pokeElemOff :: Ptr CDouble -> Int -> CDouble -> IO () # peekByteOff :: Ptr b -> Int -> IO CDouble # pokeByteOff :: Ptr b -> Int -> CDouble -> IO () # peek :: Ptr CDouble -> IO CDouble # poke :: Ptr CDouble -> CDouble -> IO () #
Storable CPtrdiff
Instance details Defined in Foreign.C.Types Methods sizeOf :: CPtrdiff -> Int # alignment :: CPtrdiff -> Int # peekElemOff :: Ptr CPtrdiff -> Int -> IO CPtrdiff # pokeElemOff :: Ptr CPtrdiff -> Int -> CPtrdiff -> IO () # peekByteOff :: Ptr b -> Int -> IO CPtrdiff # pokeByteOff :: Ptr b -> Int -> CPtrdiff -> IO () # peek :: Ptr CPtrdiff -> IO CPtrdiff # poke :: Ptr CPtrdiff -> CPtrdiff -> IO () #
Storable CSize
Instance details Defined in Foreign.C.Types Methods sizeOf :: CSize -> Int # alignment :: CSize -> Int # peekElemOff :: Ptr CSize -> Int -> IO CSize # pokeElemOff :: Ptr CSize -> Int -> CSize -> IO () # peekByteOff :: Ptr b -> Int -> IO CSize # pokeByteOff :: Ptr b -> Int -> CSize -> IO () # peek :: Ptr CSize -> IO CSize # poke :: Ptr CSize -> CSize -> IO () #
Storable CWchar
Instance details Defined in Foreign.C.Types Methods sizeOf :: CWchar -> Int # alignment :: CWchar -> Int # peekElemOff :: Ptr CWchar -> Int -> IO CWchar # pokeElemOff :: Ptr CWchar -> Int -> CWchar -> IO () # peekByteOff :: Ptr b -> Int -> IO CWchar # pokeByteOff :: Ptr b -> Int -> CWchar -> IO () # peek :: Ptr CWchar -> IO CWchar # poke :: Ptr CWchar -> CWchar -> IO () #
Storable CSigAtomic
Instance details Defined in Foreign.C.Types Methods sizeOf :: CSigAtomic -> Int # alignment :: CSigAtomic -> Int # peekElemOff :: Ptr CSigAtomic -> Int -> IO CSigAtomic # pokeElemOff :: Ptr CSigAtomic -> Int -> CSigAtomic -> IO () # peekByteOff :: Ptr b -> Int -> IO CSigAtomic # pokeByteOff :: Ptr b -> Int -> CSigAtomic -> IO () # peek :: Ptr CSigAtomic -> IO CSigAtomic # poke :: Ptr CSigAtomic -> CSigAtomic -> IO () #
Storable CClock
Instance details Defined in Foreign.C.Types Methods sizeOf :: CClock -> Int # alignment :: CClock -> Int # peekElemOff :: Ptr CClock -> Int -> IO CClock # pokeElemOff :: Ptr CClock -> Int -> CClock -> IO () # peekByteOff :: Ptr b -> Int -> IO CClock # pokeByteOff :: Ptr b -> Int -> CClock -> IO () # peek :: Ptr CClock -> IO CClock # poke :: Ptr CClock -> CClock -> IO () #
Storable CTime
Instance details Defined in Foreign.C.Types Methods sizeOf :: CTime -> Int # alignment :: CTime -> Int # peekElemOff :: Ptr CTime -> Int -> IO CTime # pokeElemOff :: Ptr CTime -> Int -> CTime -> IO () # peekByteOff :: Ptr b -> Int -> IO CTime # pokeByteOff :: Ptr b -> Int -> CTime -> IO () # peek :: Ptr CTime -> IO CTime # poke :: Ptr CTime -> CTime -> IO () #
Storable CUSeconds
Instance details Defined in Foreign.C.Types Methods sizeOf :: CUSeconds -> Int # alignment :: CUSeconds -> Int # peekElemOff :: Ptr CUSeconds -> Int -> IO CUSeconds # pokeElemOff :: Ptr CUSeconds -> Int -> CUSeconds -> IO () # peekByteOff :: Ptr b -> Int -> IO CUSeconds # pokeByteOff :: Ptr b -> Int -> CUSeconds -> IO () # peek :: Ptr CUSeconds -> IO CUSeconds # poke :: Ptr CUSeconds -> CUSeconds -> IO () #
Storable CSUSeconds
Instance details Defined in Foreign.C.Types Methods sizeOf :: CSUSeconds -> Int # alignment :: CSUSeconds -> Int # peekElemOff :: Ptr CSUSeconds -> Int -> IO CSUSeconds # pokeElemOff :: Ptr CSUSeconds -> Int -> CSUSeconds -> IO () # peekByteOff :: Ptr b -> Int -> IO CSUSeconds # pokeByteOff :: Ptr b -> Int -> CSUSeconds -> IO () # peek :: Ptr CSUSeconds -> IO CSUSeconds # poke :: Ptr CSUSeconds -> CSUSeconds -> IO () #
Storable CIntPtr
Instance details Defined in Foreign.C.Types Methods sizeOf :: CIntPtr -> Int # alignment :: CIntPtr -> Int # peekElemOff :: Ptr CIntPtr -> Int -> IO CIntPtr # pokeElemOff :: Ptr CIntPtr -> Int -> CIntPtr -> IO () # peekByteOff :: Ptr b -> Int -> IO CIntPtr # pokeByteOff :: Ptr b -> Int -> CIntPtr -> IO () # peek :: Ptr CIntPtr -> IO CIntPtr # poke :: Ptr CIntPtr -> CIntPtr -> IO () #
Storable CUIntPtr
Instance details Defined in Foreign.C.Types Methods sizeOf :: CUIntPtr -> Int # alignment :: CUIntPtr -> Int # peekElemOff :: Ptr CUIntPtr -> Int -> IO CUIntPtr # pokeElemOff :: Ptr CUIntPtr -> Int -> CUIntPtr -> IO () # peekByteOff :: Ptr b -> Int -> IO CUIntPtr # pokeByteOff :: Ptr b -> Int -> CUIntPtr -> IO () # peek :: Ptr CUIntPtr -> IO CUIntPtr # poke :: Ptr CUIntPtr -> CUIntPtr -> IO () #
Storable CIntMax
Instance details Defined in Foreign.C.Types Methods sizeOf :: CIntMax -> Int # alignment :: CIntMax -> Int # peekElemOff :: Ptr CIntMax -> Int -> IO CIntMax # pokeElemOff :: Ptr CIntMax -> Int -> CIntMax -> IO () # peekByteOff :: Ptr b -> Int -> IO CIntMax # pokeByteOff :: Ptr b -> Int -> CIntMax -> IO () # peek :: Ptr CIntMax -> IO CIntMax # poke :: Ptr CIntMax -> CIntMax -> IO () #
Storable CUIntMax
Instance details Defined in Foreign.C.Types Methods sizeOf :: CUIntMax -> Int # alignment :: CUIntMax -> Int # peekElemOff :: Ptr CUIntMax -> Int -> IO CUIntMax # pokeElemOff :: Ptr CUIntMax -> Int -> CUIntMax -> IO () # peekByteOff :: Ptr b -> Int -> IO CUIntMax # pokeByteOff :: Ptr b -> Int -> CUIntMax -> IO () # peek :: Ptr CUIntMax -> IO CUIntMax # poke :: Ptr CUIntMax -> CUIntMax -> IO () #
Storable Fingerprint	Since: base-4.4.0.0
Instance details Defined in Foreign.Storable Methods sizeOf :: Fingerprint -> Int # alignment :: Fingerprint -> Int # peekElemOff :: Ptr Fingerprint -> Int -> IO Fingerprint # pokeElemOff :: Ptr Fingerprint -> Int -> Fingerprint -> IO () # peekByteOff :: Ptr b -> Int -> IO Fingerprint # pokeByteOff :: Ptr b -> Int -> Fingerprint -> IO () # peek :: Ptr Fingerprint -> IO Fingerprint # poke :: Ptr Fingerprint -> Fingerprint -> IO () #
(Storable a, Integral a) => Storable (Ratio a)	Since: base-4.8.0.0
Instance details Defined in Foreign.Storable Methods sizeOf :: Ratio a -> Int # alignment :: Ratio a -> Int # peekElemOff :: Ptr (Ratio a) -> Int -> IO (Ratio a) # pokeElemOff :: Ptr (Ratio a) -> Int -> Ratio a -> IO () # peekByteOff :: Ptr b -> Int -> IO (Ratio a) # pokeByteOff :: Ptr b -> Int -> Ratio a -> IO () # peek :: Ptr (Ratio a) -> IO (Ratio a) # poke :: Ptr (Ratio a) -> Ratio a -> IO () #
Storable (StablePtr a)	Since: base-2.1
Instance details Defined in Foreign.Storable Methods sizeOf :: StablePtr a -> Int # alignment :: StablePtr a -> Int # peekElemOff :: Ptr (StablePtr a) -> Int -> IO (StablePtr a) # pokeElemOff :: Ptr (StablePtr a) -> Int -> StablePtr a -> IO () # peekByteOff :: Ptr b -> Int -> IO (StablePtr a) # pokeByteOff :: Ptr b -> Int -> StablePtr a -> IO () # peek :: Ptr (StablePtr a) -> IO (StablePtr a) # poke :: Ptr (StablePtr a) -> StablePtr a -> IO () #
Storable (Ptr a)	Since: base-2.1
Instance details Defined in Foreign.Storable Methods sizeOf :: Ptr a -> Int # alignment :: Ptr a -> Int # peekElemOff :: Ptr (Ptr a) -> Int -> IO (Ptr a) # pokeElemOff :: Ptr (Ptr a) -> Int -> Ptr a -> IO () # peekByteOff :: Ptr b -> Int -> IO (Ptr a) # pokeByteOff :: Ptr b -> Int -> Ptr a -> IO () # peek :: Ptr (Ptr a) -> IO (Ptr a) # poke :: Ptr (Ptr a) -> Ptr a -> IO () #
Storable (FunPtr a)	Since: base-2.1
Instance details Defined in Foreign.Storable Methods sizeOf :: FunPtr a -> Int # alignment :: FunPtr a -> Int # peekElemOff :: Ptr (FunPtr a) -> Int -> IO (FunPtr a) # pokeElemOff :: Ptr (FunPtr a) -> Int -> FunPtr a -> IO () # peekByteOff :: Ptr b -> Int -> IO (FunPtr a) # pokeByteOff :: Ptr b -> Int -> FunPtr a -> IO () # peek :: Ptr (FunPtr a) -> IO (FunPtr a) # poke :: Ptr (FunPtr a) -> FunPtr a -> IO () #
Storable a => Storable (Complex a)	Since: base-4.8.0.0
Instance details Defined in Data.Complex Methods sizeOf :: Complex a -> Int # alignment :: Complex a -> Int # peekElemOff :: Ptr (Complex a) -> Int -> IO (Complex a) # pokeElemOff :: Ptr (Complex a) -> Int -> Complex a -> IO () # peekByteOff :: Ptr b -> Int -> IO (Complex a) # pokeByteOff :: Ptr b -> Int -> Complex a -> IO () # peek :: Ptr (Complex a) -> IO (Complex a) # poke :: Ptr (Complex a) -> Complex a -> IO () #
Storable a => Storable (Identity a)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Identity Methods sizeOf :: Identity a -> Int # 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 () # peek :: Ptr (Identity a) -> IO (Identity a) # poke :: Ptr (Identity a) -> Identity a -> IO () #
Prim a => Storable (PrimStorable a)
Instance details Defined in Data.Primitive.Types Methods sizeOf :: PrimStorable a -> Int # alignment :: PrimStorable a -> Int # peekElemOff :: Ptr (PrimStorable a) -> Int -> IO (PrimStorable a) # pokeElemOff :: Ptr (PrimStorable a) -> Int -> PrimStorable a -> IO () # peekByteOff :: Ptr b -> Int -> IO (PrimStorable a) # pokeByteOff :: Ptr b -> Int -> PrimStorable a -> IO () # peek :: Ptr (PrimStorable a) -> IO (PrimStorable a) # poke :: Ptr (PrimStorable a) -> PrimStorable a -> IO () #
Storable a => Storable (Const a b)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Const Methods sizeOf :: Const a b -> Int # alignment :: Const a b -> Int # peekElemOff :: Ptr (Const a b) -> Int -> IO (Const a b) # pokeElemOff :: Ptr (Const a b) -> Int -> Const a b -> IO () # peekByteOff :: Ptr b0 -> Int -> IO (Const a b) # pokeByteOff :: Ptr b0 -> Int -> Const a b -> IO () # peek :: Ptr (Const a b) -> IO (Const a b) # poke :: Ptr (Const a b) -> Const a b -> IO () #
Storable a => Storable (Tagged s a)
Instance details Defined in Data.Tagged Methods sizeOf :: Tagged s a -> Int # alignment :: Tagged s a -> Int # peekElemOff :: Ptr (Tagged s a) -> Int -> IO (Tagged s a) # pokeElemOff :: Ptr (Tagged s a) -> Int -> Tagged s a -> IO () # peekByteOff :: Ptr b -> Int -> IO (Tagged s a) # pokeByteOff :: Ptr b -> Int -> Tagged s a -> IO () # peek :: Ptr (Tagged s a) -> IO (Tagged s a) # poke :: Ptr (Tagged s a) -> Tagged s a -> IO () #

data STRef s a #

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

NFData2 STRef	Since: deepseq-1.4.3.0
Instance details Defined in Control.DeepSeq Methods liftRnf2 :: (a -> ()) -> (b -> ()) -> STRef a b -> () #
NFData1 (STRef s)	Since: deepseq-1.4.3.0
Instance details Defined in Control.DeepSeq Methods liftRnf :: (a -> ()) -> STRef s a -> () #
Eq (STRef s a)	Pointer equality. Since: base-2.1
Instance details Defined in GHC.STRef Methods (==) :: STRef s a -> STRef s a -> Bool # (/=) :: STRef s a -> STRef s a -> Bool #
NFData (STRef s a)	NOTE: Only strict in the reference and not the referenced value. Since: deepseq-1.4.2.0
Instance details Defined in Control.DeepSeq Methods rnf :: STRef s a -> () #
IsSequence a => MutablePushBack (STRef s a)
Instance details Defined in Data.Mutable.Class Methods pushBack :: (PrimMonad m, PrimState m ~ MCState (STRef s a)) => STRef s a -> CollElement (STRef s a) -> m () #
IsSequence a => MutablePopBack (STRef s a)
Instance details Defined in Data.Mutable.Class Methods popBack :: (PrimMonad m, PrimState m ~ MCState (STRef s a)) => STRef s a -> m (Maybe (CollElement (STRef s a))) #
IsSequence a => MutablePushFront (STRef s a)
Instance details Defined in Data.Mutable.Class Methods pushFront :: (PrimMonad m, PrimState m ~ MCState (STRef s a)) => STRef s a -> CollElement (STRef s a) -> m () #
IsSequence a => MutablePopFront (STRef s a)
Instance details Defined in Data.Mutable.Class Methods popFront :: (PrimMonad m, PrimState m ~ MCState (STRef s a)) => STRef s a -> m (Maybe (CollElement (STRef s a))) #
Monoid w => MutableCollection (STRef s w)
Instance details Defined in Data.Mutable.Class Associated Types type CollElement (STRef s w) :: Type # Methods newColl :: (PrimMonad m, PrimState m ~ MCState (STRef s w)) => m (STRef s w) #
MutableRef (STRef s a)
Instance details Defined in Data.Mutable.Class Associated Types type RefElement (STRef s a) :: Type # Methods newRef :: (PrimMonad m, PrimState m ~ MCState (STRef s a)) => RefElement (STRef s a) -> m (STRef s a) # readRef :: (PrimMonad m, PrimState m ~ MCState (STRef s a)) => STRef s a -> m (RefElement (STRef s a)) # writeRef :: (PrimMonad m, PrimState m ~ MCState (STRef s a)) => STRef s a -> RefElement (STRef s a) -> m () # modifyRef :: (PrimMonad m, PrimState m ~ MCState (STRef s a)) => STRef s a -> (RefElement (STRef s a) -> RefElement (STRef s a)) -> m () # modifyRef' :: (PrimMonad m, PrimState m ~ MCState (STRef s a)) => STRef s a -> (RefElement (STRef s a) -> RefElement (STRef s a)) -> m () #
MutableContainer (STRef s a)
Instance details Defined in Data.Mutable.Class Associated Types type MCState (STRef s a) :: Type #
type CollElement (STRef s w)
Instance details Defined in Data.Mutable.Class type CollElement (STRef s w) = Element w
type RefElement (STRef s a)
Instance details Defined in Data.Mutable.Class type RefElement (STRef s a) = a
type MCState (STRef s a)
Instance details Defined in Data.Mutable.Class type MCState (STRef s a) = s

bool :: a -> a -> Bool -> a #

Case analysis for the Bool type. bool x y p evaluates to x 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

Expand

Basic usage:

>>> bool "foo" "bar" True
"bar"
>>> bool "foo" "bar" False
"foo"

Confirm that bool x y p and if p then y else x are equivalent:

>>> let p = True; x = "bar"; y = "foo"
>>> bool x y p == if p then y else x
True
>>> let p = False
>>> bool x y p == if p then y else x
True

Since: base-4.7.0.0

(&) :: a -> (a -> b) -> b infixl 1 #

& is a reverse application operator. This provides notational convenience. Its precedence is one higher than that of the forward application operator $, which allows & to be nested in $.

>>> 5 & (+1) & show
"6"

Since: base-4.8.0.0

on :: (b -> b -> c) -> (a -> b) -> a -> a -> c infixl 0 #

on b u x y runs the binary function b on the results of applying unary function u to two arguments x and y. From the opposite perspective, it transforms two inputs and combines the outputs.

((+) `on` f) x y = f x + f y

Typical usage: sortBy (compare `on` fst).

Algebraic properties:

(*) `on` id = (*) -- (if (*) ∉ {⊥, const ⊥})

```
((*) `on` f) `on` g = (*) `on` (f . g)
```
```
flip on f . flip on g = flip on (g . f)
```

($>) :: Functor f => f a -> b -> f b infixl 4 #

Flipped version of <$.

Examples

Expand

Replace the contents of a Maybe Int with a constant String:

>>> Nothing $> "foo"
Nothing
>>> Just 90210 $> "foo"
Just "foo"

Replace the contents of an Either Int Int with a constant String, 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

(<&>) :: Functor f => f a -> (a -> b) -> f b infixl 1 #

Flipped version of <$>.

(<&>) = flip fmap

Examples

Expand

Apply (+1) to a list, a Just and a Right:

>>> Just 2 <&> (+1)
Just 3

>>> [1,2,3] <&> (+1)
[2,3,4]

>>> Right 3 <&> (+1)
Right 4

Since: base-4.11.0.0

swap :: (a, b) -> (b, a) #

Swap the components of a pair.

data MVar a #

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
Instance details Defined in Control.DeepSeq Methods liftRnf :: (a -> ()) -> MVar a -> () #
Eq (MVar a)	Since: base-4.1.0.0
Instance details Defined in GHC.MVar Methods (==) :: MVar a -> MVar a -> Bool # (/=) :: MVar a -> MVar a -> Bool #
NFData (MVar a)	NOTE: Only strict in the reference and not the referenced value. Since: deepseq-1.4.2.0
Instance details Defined in Control.DeepSeq Methods rnf :: MVar a -> () #
PrimUnlifted (MVar a)	Since: primitive-0.6.4.0
Instance details Defined in Data.Primitive.UnliftedArray Methods toArrayArray# :: MVar a -> ArrayArray# # fromArrayArray# :: ArrayArray# -> MVar a #

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 #

Lift a function to actions. This function may be used as a value for fmap in a Functor instance.

(<**>) :: 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
Instance details Defined in GHC.Exception.Type Methods showsPrec :: Int -> SomeException -> ShowS # show :: SomeException -> String # showList :: [SomeException] -> ShowS #
Exception SomeException	Since: base-3.0
Instance details 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

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 #

Boxed vectors, supporting efficient slicing.

Instances

Monad Vector
Instance details Defined in Data.Vector Methods (>>=) :: Vector a -> (a -> Vector b) -> Vector b # (>>) :: Vector a -> Vector b -> Vector b # return :: a -> Vector a # fail :: String -> Vector a #
Functor Vector
Instance details Defined in Data.Vector Methods fmap :: (a -> b) -> Vector a -> Vector b # (<$) :: a -> Vector b -> Vector a #
Applicative Vector
Instance details Defined in Data.Vector Methods pure :: a -> Vector a # (<>) :: Vector (a -> b) -> Vector a -> Vector b # liftA2 :: (a -> b -> c) -> Vector a -> Vector b -> Vector c # (>) :: Vector a -> Vector b -> Vector b # (<*) :: Vector a -> Vector b -> Vector a #
Foldable Vector
Instance details 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 # toList :: Vector a -> [a] # null :: Vector a -> Bool # length :: Vector a -> Int # elem :: Eq a => a -> Vector a -> Bool # maximum :: Ord a => Vector a -> a # minimum :: Ord a => Vector a -> a # sum :: Num a => Vector a -> a # product :: Num a => Vector a -> a #
Traversable Vector
Instance details Defined in Data.Vector Methods traverse :: Applicative f => (a -> f b) -> Vector a -> f (Vector b) # sequenceA :: Applicative f => Vector (f a) -> f (Vector a) # mapM :: Monad m => (a -> m b) -> Vector a -> m (Vector b) # sequence :: Monad m => Vector (m a) -> m (Vector a) #
MonadPlus Vector
Instance details Defined in Data.Vector Methods mzero :: Vector a # mplus :: Vector a -> Vector a -> Vector a #
Alternative Vector
Instance details Defined in Data.Vector Methods empty :: Vector a # (<\|>) :: Vector a -> Vector a -> Vector a # some :: Vector a -> Vector [a] # many :: Vector a -> Vector [a] #
Eq1 Vector
Instance details Defined in Data.Vector Methods liftEq :: (a -> b -> Bool) -> Vector a -> Vector b -> Bool #
Ord1 Vector
Instance details Defined in Data.Vector Methods liftCompare :: (a -> b -> Ordering) -> Vector a -> Vector b -> Ordering #
Read1 Vector
Instance details Defined in Data.Vector Methods liftReadsPrec :: (Int -> ReadS a) -> ReadS [a] -> Int -> ReadS (Vector a) # liftReadList :: (Int -> ReadS a) -> ReadS [a] -> ReadS [Vector a] # liftReadPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec (Vector a) # liftReadListPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec [Vector a] #
Show1 Vector
Instance details Defined in Data.Vector Methods liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> Vector a -> ShowS # liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [Vector a] -> ShowS #
MonadZip Vector
Instance details Defined in Data.Vector Methods mzip :: Vector a -> Vector b -> Vector (a, b) # mzipWith :: (a -> b -> c) -> Vector a -> Vector b -> Vector c # munzip :: Vector (a, b) -> (Vector a, Vector b) #
Zip Vector
Instance details Defined in Data.ChunkedZip Methods zipWith :: (a -> b -> c) -> Vector a -> Vector b -> Vector c # zip :: Vector a -> Vector b -> Vector (a, b) # zap :: Vector (a -> b) -> Vector a -> Vector b # unzip :: Vector (a, b) -> (Vector a, Vector b) #
Zip3 Vector
Instance details Defined in Data.ChunkedZip Methods zipWith3 :: (a -> b -> c -> d) -> Vector a -> Vector b -> Vector c -> Vector d # zip3 :: Vector a -> Vector b -> Vector c -> Vector (a, b, c) # zap3 :: Vector (a -> b -> c) -> Vector a -> Vector b -> Vector c # unzip3 :: Vector (a, b, c) -> (Vector a, Vector b, Vector c) #
Zip4 Vector
Instance details Defined in Data.ChunkedZip Methods zipWith4 :: (a -> b -> c -> d -> e) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e # zip4 :: Vector a -> Vector b -> Vector c -> Vector d -> Vector (a, b, c, d) # zap4 :: Vector (a -> b -> c -> d) -> Vector a -> Vector b -> Vector c -> Vector d # unzip4 :: Vector (a, b, c, d) -> (Vector a, Vector b, Vector c, Vector d) #
Zip5 Vector
Instance details Defined in Data.ChunkedZip Methods zipWith5 :: (a -> b -> c -> d -> e -> g) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e -> Vector g # zip5 :: Vector a -> Vector b -> Vector c -> Vector d -> Vector e -> Vector (a, b, c, d, e) # zap5 :: Vector (a -> b -> c -> d -> e) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e # unzip5 :: Vector (a, b, c, d, e) -> (Vector a, Vector b, Vector c, Vector d, Vector e) #
Zip6 Vector
Instance details Defined in Data.ChunkedZip Methods zipWith6 :: (a -> b -> c -> d -> e -> g -> h) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e -> Vector g -> Vector h # zip6 :: Vector a -> Vector b -> Vector c -> Vector d -> Vector e -> Vector g -> Vector (a, b, c, d, e, g) # zap6 :: Vector (a -> b -> c -> d -> e -> g) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e -> Vector g # unzip6 :: Vector (a, b, c, d, e, g) -> (Vector a, Vector b, Vector c, Vector d, Vector e, Vector g) #
Vector Vector a
Instance details Defined in Data.Vector Methods basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) a -> m (Vector a) # basicUnsafeThaw :: PrimMonad m => Vector a -> m (Mutable Vector (PrimState m) a) # basicLength :: Vector a -> Int # basicUnsafeSlice :: Int -> Int -> Vector a -> Vector a # basicUnsafeIndexM :: Monad m => Vector a -> Int -> m a # basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) a -> Vector a -> m () # elemseq :: Vector a -> a -> b -> b #
FunctorWithIndex Int Vector
Instance details Defined in Control.Lens.Indexed Methods imap :: (Int -> a -> b) -> Vector a -> Vector b # imapped :: IndexedSetter Int (Vector a) (Vector b) a b #
FoldableWithIndex Int Vector
Instance details Defined in Control.Lens.Indexed Methods ifoldMap :: Monoid m => (Int -> a -> m) -> Vector a -> m # ifolded :: IndexedFold Int (Vector a) a # ifoldr :: (Int -> a -> b -> b) -> b -> Vector a -> b # ifoldl :: (Int -> b -> a -> b) -> b -> Vector a -> b # ifoldr' :: (Int -> a -> b -> b) -> b -> Vector a -> b # ifoldl' :: (Int -> b -> a -> b) -> b -> Vector a -> b #
TraversableWithIndex Int Vector
Instance details Defined in Control.Lens.Indexed Methods itraverse :: Applicative f => (Int -> a -> f b) -> Vector a -> f (Vector b) # itraversed :: IndexedTraversal Int (Vector a) (Vector b) a b #
IsList (Vector a)
Instance details Defined in Data.Vector Associated Types type Item (Vector a) :: Type # Methods fromList :: [Item (Vector a)] -> Vector a # fromListN :: Int -> [Item (Vector a)] -> Vector a # toList :: Vector a -> [Item (Vector a)] #
Eq a => Eq (Vector a)
Instance details Defined in Data.Vector Methods (==) :: Vector a -> Vector a -> Bool # (/=) :: Vector a -> Vector a -> Bool #
Data a => Data (Vector a)
Instance details Defined in Data.Vector Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Vector a -> c (Vector a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Vector a) # toConstr :: Vector a -> Constr # dataTypeOf :: Vector a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Vector a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Vector a)) # gmapT :: (forall b. Data b => b -> b) -> Vector a -> Vector a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Vector a -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Vector a -> r # gmapQ :: (forall d. Data d => d -> u) -> Vector a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Vector a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Vector a -> m (Vector a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Vector a -> m (Vector a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Vector a -> m (Vector a) #
Ord a => Ord (Vector a)
Instance details Defined in Data.Vector Methods compare :: Vector a -> Vector a -> Ordering # (<) :: Vector a -> Vector a -> Bool # (<=) :: Vector a -> Vector a -> Bool # (>) :: Vector a -> Vector a -> Bool # (>=) :: Vector a -> Vector a -> Bool # max :: Vector a -> Vector a -> Vector a # min :: Vector a -> Vector a -> Vector a #
Read a => Read (Vector a)
Instance details Defined in Data.Vector Methods readsPrec :: Int -> ReadS (Vector a) # readList :: ReadS [Vector a] # readPrec :: ReadPrec (Vector a) # readListPrec :: ReadPrec [Vector a] #
Show a => Show (Vector a)
Instance details Defined in Data.Vector Methods showsPrec :: Int -> Vector a -> ShowS # show :: Vector a -> String # showList :: [Vector a] -> ShowS #
Semigroup (Vector a)
Instance details Defined in Data.Vector Methods (<>) :: Vector a -> Vector a -> Vector a # sconcat :: NonEmpty (Vector a) -> Vector a # stimes :: Integral b => b -> Vector a -> Vector a #
Monoid (Vector a)
Instance details Defined in Data.Vector Methods mempty :: Vector a # mappend :: Vector a -> Vector a -> Vector a # mconcat :: [Vector a] -> Vector a #
NFData a => NFData (Vector a)
Instance details Defined in Data.Vector Methods rnf :: Vector a -> () #
GrowingAppend (Vector a)
Instance details Defined in Data.MonoTraversable
MonoPointed (Vector a)
Instance details Defined in Data.MonoTraversable Methods opoint :: Element (Vector a) -> Vector a #
MonoTraversable (Vector a)
Instance details Defined in Data.MonoTraversable Methods otraverse :: Applicative f => (Element (Vector a) -> f (Element (Vector a))) -> Vector a -> f (Vector a) # omapM :: Applicative m => (Element (Vector a) -> m (Element (Vector a))) -> Vector a -> m (Vector a) #
MonoFoldable (Vector a)
Instance details Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element (Vector a) -> m) -> Vector a -> m # ofoldr :: (Element (Vector a) -> b -> b) -> b -> Vector a -> b # ofoldl' :: (a0 -> Element (Vector a) -> a0) -> a0 -> Vector a -> a0 # otoList :: Vector a -> [Element (Vector a)] # oall :: (Element (Vector a) -> Bool) -> Vector a -> Bool # oany :: (Element (Vector a) -> Bool) -> Vector a -> Bool # onull :: Vector a -> Bool # olength :: Vector a -> Int # olength64 :: Vector a -> Int64 # ocompareLength :: Integral i => Vector a -> i -> Ordering # otraverse_ :: Applicative f => (Element (Vector a) -> f b) -> Vector a -> f () # ofor_ :: Applicative f => Vector a -> (Element (Vector a) -> f b) -> f () # omapM_ :: Applicative m => (Element (Vector a) -> m ()) -> Vector a -> m () # oforM_ :: Applicative m => Vector a -> (Element (Vector a) -> m ()) -> m () # ofoldlM :: Monad m => (a0 -> Element (Vector a) -> m a0) -> a0 -> Vector a -> m a0 # ofoldMap1Ex :: Semigroup m => (Element (Vector a) -> m) -> Vector a -> m # ofoldr1Ex :: (Element (Vector a) -> Element (Vector a) -> Element (Vector a)) -> Vector a -> Element (Vector a) # ofoldl1Ex' :: (Element (Vector a) -> Element (Vector a) -> Element (Vector a)) -> Vector a -> Element (Vector a) # headEx :: Vector a -> Element (Vector a) # lastEx :: Vector a -> Element (Vector a) # unsafeHead :: Vector a -> Element (Vector a) # unsafeLast :: Vector a -> Element (Vector a) # maximumByEx :: (Element (Vector a) -> Element (Vector a) -> Ordering) -> Vector a -> Element (Vector a) # minimumByEx :: (Element (Vector a) -> Element (Vector a) -> Ordering) -> Vector a -> Element (Vector a) # oelem :: Element (Vector a) -> Vector a -> Bool # onotElem :: Element (Vector a) -> Vector a -> Bool #
MonoFunctor (Vector a)
Instance details Defined in Data.MonoTraversable Methods omap :: (Element (Vector a) -> Element (Vector a)) -> Vector a -> Vector a #
IsSequence (Vector a)
Instance details Defined in Data.Sequences Methods fromList :: [Element (Vector a)] -> Vector a # lengthIndex :: Vector a -> Index (Vector a) # break :: (Element (Vector a) -> Bool) -> Vector a -> (Vector a, Vector a) # span :: (Element (Vector a) -> Bool) -> Vector a -> (Vector a, Vector a) # dropWhile :: (Element (Vector a) -> Bool) -> Vector a -> Vector a # takeWhile :: (Element (Vector a) -> Bool) -> Vector a -> Vector a # splitAt :: Index (Vector a) -> Vector a -> (Vector a, Vector a) # unsafeSplitAt :: Index (Vector a) -> Vector a -> (Vector a, Vector a) # take :: Index (Vector a) -> Vector a -> Vector a # unsafeTake :: Index (Vector a) -> Vector a -> Vector a # drop :: Index (Vector a) -> Vector a -> Vector a # unsafeDrop :: Index (Vector a) -> Vector a -> Vector a # dropEnd :: Index (Vector a) -> Vector a -> Vector a # partition :: (Element (Vector a) -> Bool) -> Vector a -> (Vector a, Vector a) # uncons :: Vector a -> Maybe (Element (Vector a), Vector a) # unsnoc :: Vector a -> Maybe (Vector a, Element (Vector a)) # filter :: (Element (Vector a) -> Bool) -> Vector a -> Vector a # filterM :: Monad m => (Element (Vector a) -> m Bool) -> Vector a -> m (Vector a) # replicate :: Index (Vector a) -> Element (Vector a) -> Vector a # replicateM :: Monad m => Index (Vector a) -> m (Element (Vector a)) -> m (Vector a) # groupBy :: (Element (Vector a) -> Element (Vector a) -> Bool) -> Vector a -> [Vector a] # groupAllOn :: Eq b => (Element (Vector a) -> b) -> Vector a -> [Vector a] # subsequences :: Vector a -> [Vector a] # permutations :: Vector a -> [Vector a] # tailEx :: Vector a -> Vector a # tailMay :: Vector a -> Maybe (Vector a) # initEx :: Vector a -> Vector a # initMay :: Vector a -> Maybe (Vector a) # unsafeTail :: Vector a -> Vector a # unsafeInit :: Vector a -> Vector a # index :: Vector a -> Index (Vector a) -> Maybe (Element (Vector a)) # indexEx :: Vector a -> Index (Vector a) -> Element (Vector a) # unsafeIndex :: Vector a -> Index (Vector a) -> Element (Vector a) # splitWhen :: (Element (Vector a) -> Bool) -> Vector a -> [Vector a] #
SemiSequence (Vector a)
Instance details Defined in Data.Sequences Associated Types type Index (Vector a) :: Type # Methods intersperse :: Element (Vector a) -> Vector a -> Vector a # reverse :: Vector a -> Vector a # find :: (Element (Vector a) -> Bool) -> Vector a -> Maybe (Element (Vector a)) # sortBy :: (Element (Vector a) -> Element (Vector a) -> Ordering) -> Vector a -> Vector a # cons :: Element (Vector a) -> Vector a -> Vector a # snoc :: Vector a -> Element (Vector a) -> Vector a #
Ixed (Vector a)
Instance details Defined in Control.Lens.At Methods ix :: Index (Vector a) -> Traversal' (Vector a) (IxValue (Vector a)) #
Wrapped (Vector a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (Vector a) :: Type # Methods _Wrapped' :: Iso' (Vector a) (Unwrapped (Vector a)) #
t ~ Vector a' => Rewrapped (Vector a) t
Instance details Defined in Control.Lens.Wrapped
type Key Vector
Instance details Defined in Data.Vector.Instances type Key Vector = Int
type Mutable Vector
Instance details Defined in Data.Vector type Mutable Vector = MVector
type Item (Vector a)
Instance details Defined in Data.Vector type Item (Vector a) = a
type Element (Vector a)
Instance details Defined in Data.MonoTraversable type Element (Vector a) = a
type Index (Vector a)
Instance details Defined in Data.Sequences type Index (Vector a) = Int
type Index (Vector a)
Instance details Defined in Control.Lens.At type Index (Vector a) = Int
type IxValue (Vector a)
Instance details Defined in Control.Lens.At type IxValue (Vector a) = a
type Unwrapped (Vector a)
Instance details Defined in Control.Lens.Wrapped type Unwrapped (Vector a) = [a]

class (Vector Vector a, MVector MVector a) => Unbox a #

Instances

Unbox Bool
Instance details Defined in Data.Vector.Unboxed.Base
Unbox Char
Instance details Defined in Data.Vector.Unboxed.Base
Unbox Double
Instance details Defined in Data.Vector.Unboxed.Base
Unbox Float
Instance details Defined in Data.Vector.Unboxed.Base
Unbox Int
Instance details Defined in Data.Vector.Unboxed.Base
Unbox Int8
Instance details Defined in Data.Vector.Unboxed.Base
Unbox Int16
Instance details Defined in Data.Vector.Unboxed.Base
Unbox Int32
Instance details Defined in Data.Vector.Unboxed.Base
Unbox Int64
Instance details Defined in Data.Vector.Unboxed.Base
Unbox Word
Instance details Defined in Data.Vector.Unboxed.Base
Unbox Word8
Instance details Defined in Data.Vector.Unboxed.Base
Unbox Word16
Instance details Defined in Data.Vector.Unboxed.Base
Unbox Word32
Instance details Defined in Data.Vector.Unboxed.Base
Unbox Word64
Instance details Defined in Data.Vector.Unboxed.Base
Unbox ()
Instance details Defined in Data.Vector.Unboxed.Base
Unbox a => Unbox (Complex a)
Instance details Defined in Data.Vector.Unboxed.Base
(Unbox a, Unbox b) => Unbox (a, b)
Instance details Defined in Data.Vector.Unboxed.Base
(Unbox a, Unbox b, Unbox c) => Unbox (a, b, c)
Instance details Defined in Data.Vector.Unboxed.Base
(Unbox a, Unbox b, Unbox c, Unbox d) => Unbox (a, b, c, d)
Instance details Defined in Data.Vector.Unboxed.Base
(Unbox a, Unbox b, Unbox c, Unbox d, Unbox e) => Unbox (a, b, c, d, e)
Instance details Defined in Data.Vector.Unboxed.Base
(Unbox a, Unbox b, Unbox c, Unbox d, Unbox e, Unbox f) => Unbox (a, b, c, d, e, f)
Instance details Defined in Data.Vector.Unboxed.Base

data HashSet a #

A set of values. A set cannot contain duplicate values.

Instances

Foldable HashSet
Instance details 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 # toList :: HashSet a -> [a] # null :: HashSet a -> Bool # length :: HashSet a -> Int # elem :: Eq a => a -> HashSet a -> Bool # maximum :: Ord a => HashSet a -> a # minimum :: Ord a => HashSet a -> a # sum :: Num a => HashSet a -> a # product :: Num a => HashSet a -> a #
Eq1 HashSet
Instance details Defined in Data.HashSet Methods liftEq :: (a -> b -> Bool) -> HashSet a -> HashSet b -> Bool #
Ord1 HashSet
Instance details Defined in Data.HashSet Methods liftCompare :: (a -> b -> Ordering) -> HashSet a -> HashSet b -> Ordering #
Show1 HashSet
Instance details Defined in Data.HashSet Methods liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> HashSet a -> ShowS # liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [HashSet a] -> ShowS #
Hashable1 HashSet
Instance details Defined in Data.HashSet Methods liftHashWithSalt :: (Int -> a -> Int) -> Int -> HashSet a -> Int #
(Eq a, Hashable a) => IsList (HashSet a)
Instance details Defined in Data.HashSet Associated Types type Item (HashSet a) :: Type # Methods fromList :: [Item (HashSet a)] -> HashSet a # fromListN :: Int -> [Item (HashSet a)] -> HashSet a # toList :: HashSet a -> [Item (HashSet a)] #
Eq a => Eq (HashSet a)
Instance details Defined in Data.HashSet Methods (==) :: HashSet a -> HashSet a -> Bool # (/=) :: HashSet a -> HashSet a -> Bool #
(Data a, Eq a, Hashable a) => Data (HashSet a)
Instance details 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)
Instance details Defined in Data.HashSet Methods compare :: HashSet a -> HashSet a -> Ordering # (<) :: HashSet a -> HashSet a -> Bool # (<=) :: HashSet a -> HashSet a -> Bool # (>) :: HashSet a -> HashSet a -> Bool # (>=) :: HashSet a -> HashSet a -> Bool # max :: HashSet a -> HashSet a -> HashSet a # min :: HashSet a -> HashSet a -> HashSet a #
(Eq a, Hashable a, Read a) => Read (HashSet a)
Instance details Defined in Data.HashSet Methods readsPrec :: Int -> ReadS (HashSet a) # readList :: ReadS [HashSet a] # readPrec :: ReadPrec (HashSet a) # readListPrec :: ReadPrec [HashSet a] #
Show a => Show (HashSet a)
Instance details Defined in Data.HashSet Methods showsPrec :: Int -> HashSet a -> ShowS # show :: HashSet a -> String # showList :: [HashSet a] -> ShowS #
(Hashable a, Eq a) => Semigroup (HashSet a)
Instance details Defined in Data.HashSet Methods (<>) :: HashSet a -> HashSet a -> HashSet a # sconcat :: NonEmpty (HashSet a) -> HashSet a # stimes :: Integral b => b -> HashSet a -> HashSet a #
(Hashable a, Eq a) => Monoid (HashSet a)
Instance details Defined in Data.HashSet Methods mempty :: HashSet a # mappend :: HashSet a -> HashSet a -> HashSet a # mconcat :: [HashSet a] -> HashSet a #
NFData a => NFData (HashSet a)
Instance details Defined in Data.HashSet Methods rnf :: HashSet a -> () #
Hashable a => Hashable (HashSet a)
Instance details Defined in Data.HashSet Methods hashWithSalt :: Int -> HashSet a -> Int # hash :: HashSet a -> Int #
(Eq v, Hashable v) => GrowingAppend (HashSet v)
Instance details Defined in Data.MonoTraversable
Hashable a => MonoPointed (HashSet a)
Instance details Defined in Data.MonoTraversable Methods opoint :: Element (HashSet a) -> HashSet a #
MonoFoldable (HashSet e)
Instance details 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 # onull :: HashSet e -> Bool # olength :: HashSet e -> Int # 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) # oelem :: Element (HashSet e) -> HashSet e -> Bool # onotElem :: Element (HashSet e) -> HashSet e -> Bool #
(Eq element, Hashable element) => IsSet (HashSet element)
Instance details 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)
Instance details 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)
Instance details Defined in Control.Lens.At Methods contains :: Index (HashSet a) -> Lens' (HashSet a) Bool #
(Eq k, Hashable k) => Ixed (HashSet k)
Instance details Defined in Control.Lens.At Methods ix :: Index (HashSet k) -> Traversal' (HashSet k) (IxValue (HashSet k)) #
(Eq k, Hashable k) => At (HashSet k)
Instance details Defined in Control.Lens.At Methods at :: Index (HashSet k) -> Lens' (HashSet k) (Maybe (IxValue (HashSet k))) #
(Hashable a, Eq a) => Wrapped (HashSet a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (HashSet a) :: Type # Methods _Wrapped' :: Iso' (HashSet a) (Unwrapped (HashSet a)) #
(t ~ HashSet a', Hashable a, Eq a) => Rewrapped (HashSet a) t	Use `wrapping fromList`. Unwrapping returns some permutation of the list.
Instance details Defined in Control.Lens.Wrapped
type Item (HashSet a)
Instance details Defined in Data.HashSet type Item (HashSet a) = a
type Element (HashSet e)
Instance details Defined in Data.MonoTraversable type Element (HashSet e) = e
type ContainerKey (HashSet element)
Instance details Defined in Data.Containers type ContainerKey (HashSet element) = element
type Index (HashSet a)
Instance details Defined in Control.Lens.At type Index (HashSet a) = a
type IxValue (HashSet k)
Instance details Defined in Control.Lens.At type IxValue (HashSet k) = ()
type Unwrapped (HashSet a)
Instance details Defined in Control.Lens.Wrapped type Unwrapped (HashSet a) = [a]

(<.>) :: 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 </> file) will access the same file as 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` x

Combined:

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"

data Set a #

A set of values a.

Instances

Foldable Set
Instance details 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 # toList :: Set a -> [a] # null :: Set a -> Bool # length :: Set a -> Int # elem :: Eq a => a -> Set a -> Bool # maximum :: Ord a => Set a -> a # minimum :: Ord a => Set a -> a # sum :: Num a => Set a -> a # product :: Num a => Set a -> a #
Eq1 Set	Since: containers-0.5.9
Instance details Defined in Data.Set.Internal Methods liftEq :: (a -> b -> Bool) -> Set a -> Set b -> Bool #
Ord1 Set	Since: containers-0.5.9
Instance details Defined in Data.Set.Internal Methods liftCompare :: (a -> b -> Ordering) -> Set a -> Set b -> Ordering #
Show1 Set	Since: containers-0.5.9
Instance details Defined in Data.Set.Internal Methods liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> Set a -> ShowS # liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [Set a] -> ShowS #
Ord a => IsList (Set a)	Since: containers-0.5.6.2
Instance details Defined in Data.Set.Internal Associated Types type Item (Set a) :: Type # Methods fromList :: [Item (Set a)] -> Set a # fromListN :: Int -> [Item (Set a)] -> Set a # toList :: Set a -> [Item (Set a)] #
Eq a => Eq (Set a)
Instance details Defined in Data.Set.Internal Methods (==) :: Set a -> Set a -> Bool # (/=) :: Set a -> Set a -> Bool #
(Data a, Ord a) => Data (Set a)
Instance details 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) # toConstr :: Set a -> Constr # 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)
Instance details Defined in Data.Set.Internal Methods compare :: Set a -> Set a -> Ordering # (<) :: Set a -> Set a -> Bool # (<=) :: Set a -> Set a -> Bool # (>) :: Set a -> Set a -> Bool # (>=) :: Set a -> Set a -> Bool # max :: Set a -> Set a -> Set a # min :: Set a -> Set a -> Set a #
(Read a, Ord a) => Read (Set a)
Instance details Defined in Data.Set.Internal Methods readsPrec :: Int -> ReadS (Set a) # readList :: ReadS [Set a] # readPrec :: ReadPrec (Set a) # readListPrec :: ReadPrec [Set a] #
Show a => Show (Set a)
Instance details Defined in Data.Set.Internal Methods showsPrec :: Int -> Set a -> ShowS # show :: Set a -> String # showList :: [Set a] -> ShowS #
Ord a => Semigroup (Set a)	Since: containers-0.5.7
Instance details Defined in Data.Set.Internal Methods (<>) :: Set a -> Set a -> Set a # sconcat :: NonEmpty (Set a) -> Set a # stimes :: Integral b => b -> Set a -> Set a #
Ord a => Monoid (Set a)
Instance details Defined in Data.Set.Internal Methods mempty :: Set a # mappend :: Set a -> Set a -> Set a # mconcat :: [Set a] -> Set a #
NFData a => NFData (Set a)
Instance details Defined in Data.Set.Internal Methods rnf :: Set a -> () #
Ord v => GrowingAppend (Set v)
Instance details Defined in Data.MonoTraversable
MonoPointed (Set a)
Instance details Defined in Data.MonoTraversable Methods opoint :: Element (Set a) -> Set a #
Ord e => MonoFoldable (Set e)
Instance details 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 # onull :: Set e -> Bool # olength :: Set e -> Int # olength64 :: Set e -> Int64 # 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) # oelem :: Element (Set e) -> Set e -> Bool # onotElem :: Element (Set e) -> Set e -> Bool #
Ord element => IsSet (Set element)
Instance details Defined in Data.Containers Methods insertSet :: Element (Set element) -> Set element -> Set element # deleteSet :: Element (Set element) -> Set element -> Set element # singletonSet :: Element (Set element) -> Set element # setFromList :: [Element (Set element)] -> Set element # setToList :: Set element -> [Element (Set element)] #
Ord element => SetContainer (Set element)
Instance details 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)
Instance details Defined in Control.Lens.At Methods contains :: Index (Set a) -> Lens' (Set a) Bool #
Ord k => Ixed (Set k)
Instance details Defined in Control.Lens.At Methods ix :: Index (Set k) -> Traversal' (Set k) (IxValue (Set k)) #
Ord k => At (Set k)
Instance details Defined in Control.Lens.At Methods at :: Index (Set k) -> Lens' (Set k) (Maybe (IxValue (Set k))) #
Ord a => Wrapped (Set a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (Set a) :: Type # Methods _Wrapped' :: Iso' (Set a) (Unwrapped (Set a)) #
(t ~ Set a', Ord a) => Rewrapped (Set a) t	Use `wrapping fromList`. unwrapping returns a sorted list.
Instance details Defined in Control.Lens.Wrapped
type Item (Set a)
Instance details Defined in Data.Set.Internal type Item (Set a) = a
type Element (Set e)
Instance details Defined in Data.MonoTraversable type Element (Set e) = e
type ContainerKey (Set element)
Instance details Defined in Data.Containers type ContainerKey (Set element) = element
type Index (Set a)
Instance details Defined in Control.Lens.At type Index (Set a) = a
type IxValue (Set k)
Instance details Defined in Control.Lens.At type IxValue (Set k) = ()
type Unwrapped (Set a)
Instance details Defined in Control.Lens.Wrapped type Unwrapped (Set a) = [a]

data Seq a #

General-purpose finite sequences.

Instances

Monad Seq
Instance details Defined in Data.Sequence.Internal Methods (>>=) :: Seq a -> (a -> Seq b) -> Seq b # (>>) :: Seq a -> Seq b -> Seq b # return :: a -> Seq a # fail :: String -> Seq a #
Functor Seq
Instance details Defined in Data.Sequence.Internal Methods fmap :: (a -> b) -> Seq a -> Seq b # (<$) :: a -> Seq b -> Seq a #
MonadFix Seq	Since: containers-0.5.11
Instance details Defined in Data.Sequence.Internal Methods mfix :: (a -> Seq a) -> Seq a #
Applicative Seq	Since: containers-0.5.4
Instance details Defined in Data.Sequence.Internal Methods pure :: a -> Seq a # (<>) :: Seq (a -> b) -> Seq a -> Seq b # liftA2 :: (a -> b -> c) -> Seq a -> Seq b -> Seq c # (>) :: Seq a -> Seq b -> Seq b # (<*) :: Seq a -> Seq b -> Seq a #
Foldable Seq
Instance details 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 # toList :: Seq a -> [a] # null :: Seq a -> Bool # length :: Seq a -> Int # elem :: Eq a => a -> Seq a -> Bool # maximum :: Ord a => Seq a -> a # minimum :: Ord a => Seq a -> a # sum :: Num a => Seq a -> a # product :: Num a => Seq a -> a #
Traversable Seq
Instance details Defined in Data.Sequence.Internal Methods traverse :: Applicative f => (a -> f b) -> Seq a -> f (Seq b) # sequenceA :: Applicative f => Seq (f a) -> f (Seq a) # mapM :: Monad m => (a -> m b) -> Seq a -> m (Seq b) # sequence :: Monad m => Seq (m a) -> m (Seq a) #
MonadPlus Seq
Instance details Defined in Data.Sequence.Internal Methods mzero :: Seq a # mplus :: Seq a -> Seq a -> Seq a #
Alternative Seq	Since: containers-0.5.4
Instance details Defined in Data.Sequence.Internal Methods empty :: Seq a # (<\|>) :: Seq a -> Seq a -> Seq a # some :: Seq a -> Seq [a] # many :: Seq a -> Seq [a] #
Eq1 Seq	Since: containers-0.5.9
Instance details Defined in Data.Sequence.Internal Methods liftEq :: (a -> b -> Bool) -> Seq a -> Seq b -> Bool #
Ord1 Seq	Since: containers-0.5.9
Instance details Defined in Data.Sequence.Internal Methods liftCompare :: (a -> b -> Ordering) -> Seq a -> Seq b -> Ordering #
Read1 Seq	Since: containers-0.5.9
Instance details Defined in Data.Sequence.Internal Methods liftReadsPrec :: (Int -> ReadS a) -> ReadS [a] -> Int -> ReadS (Seq a) # liftReadList :: (Int -> ReadS a) -> ReadS [a] -> ReadS [Seq a] # liftReadPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec (Seq a) # liftReadListPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec [Seq a] #
Show1 Seq	Since: containers-0.5.9
Instance details Defined in Data.Sequence.Internal Methods liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> Seq a -> ShowS # liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [Seq a] -> ShowS #
MonadZip Seq	`mzipWith` = `zipWith` `munzip` = `unzip`
Instance details Defined in Data.Sequence.Internal Methods mzip :: Seq a -> Seq b -> Seq (a, b) # mzipWith :: (a -> b -> c) -> Seq a -> Seq b -> Seq c # munzip :: Seq (a, b) -> (Seq a, Seq b) #
Zip Seq
Instance details Defined in Data.ChunkedZip Methods zipWith :: (a -> b -> c) -> Seq a -> Seq b -> Seq c # zip :: Seq a -> Seq b -> Seq (a, b) # zap :: Seq (a -> b) -> Seq a -> Seq b # unzip :: Seq (a, b) -> (Seq a, Seq b) #
Zip3 Seq
Instance details Defined in Data.ChunkedZip Methods zipWith3 :: (a -> b -> c -> d) -> Seq a -> Seq b -> Seq c -> Seq d # zip3 :: Seq a -> Seq b -> Seq c -> Seq (a, b, c) # zap3 :: Seq (a -> b -> c) -> Seq a -> Seq b -> Seq c # unzip3 :: Seq (a, b, c) -> (Seq a, Seq b, Seq c) #
Zip4 Seq
Instance details Defined in Data.ChunkedZip Methods zipWith4 :: (a -> b -> c -> d -> e) -> Seq a -> Seq b -> Seq c -> Seq d -> Seq e # zip4 :: Seq a -> Seq b -> Seq c -> Seq d -> Seq (a, b, c, d) # zap4 :: Seq (a -> b -> c -> d) -> Seq a -> Seq b -> Seq c -> Seq d # unzip4 :: Seq (a, b, c, d) -> (Seq a, Seq b, Seq c, Seq d) #
Keyed Seq
Instance details Defined in Data.Key Methods mapWithKey :: (Key Seq -> a -> b) -> Seq a -> Seq b #
Zip Seq
Instance details Defined in Data.Key Methods zipWith :: (a -> b -> c) -> Seq a -> Seq b -> Seq c # zip :: Seq a -> Seq b -> Seq (a, b) # zap :: Seq (a -> b) -> Seq a -> Seq b #
ZipWithKey Seq
Instance details Defined in Data.Key Methods zipWithKey :: (Key Seq -> a -> b -> c) -> Seq a -> Seq b -> Seq c # zapWithKey :: Seq (Key Seq -> a -> b) -> Seq a -> Seq b #
Indexable Seq
Instance details Defined in Data.Key Methods index :: Seq a -> Key Seq -> a #
Lookup Seq
Instance details Defined in Data.Key Methods lookup :: Key Seq -> Seq a -> Maybe a #
Adjustable Seq
Instance details Defined in Data.Key Methods adjust :: (a -> a) -> Key Seq -> Seq a -> Seq a # replace :: Key Seq -> a -> Seq a -> Seq a #
FoldableWithKey Seq
Instance details Defined in Data.Key Methods toKeyedList :: Seq a -> [(Key Seq, a)] # foldMapWithKey :: Monoid m => (Key Seq -> a -> m) -> Seq a -> m # foldrWithKey :: (Key Seq -> a -> b -> b) -> b -> Seq a -> b # foldlWithKey :: (b -> Key Seq -> a -> b) -> b -> Seq a -> b #
TraversableWithKey Seq
Instance details 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
Instance details Defined in Data.Functor.Bind.Class Methods (<.>) :: Seq (a -> b) -> Seq a -> Seq b # (.>) :: Seq a -> Seq b -> Seq b # (<.) :: Seq a -> Seq b -> Seq a # liftF2 :: (a -> b -> c) -> Seq a -> Seq b -> Seq c #
Bind Seq
Instance details Defined in Data.Functor.Bind.Class Methods (>>-) :: Seq a -> (a -> Seq b) -> Seq b # join :: Seq (Seq a) -> Seq a #
UnzipWith Seq
Instance details Defined in Data.Sequence.Internal Methods unzipWith' :: (x -> (a, b)) -> Seq x -> (Seq a, Seq b)
FunctorWithIndex Int Seq	The position in the `Seq` is available as the index.
Instance details Defined in Control.Lens.Indexed Methods imap :: (Int -> a -> b) -> Seq a -> Seq b # imapped :: IndexedSetter Int (Seq a) (Seq b) a b #
FoldableWithIndex Int Seq
Instance details Defined in Control.Lens.Indexed Methods ifoldMap :: Monoid m => (Int -> a -> m) -> Seq a -> m # ifolded :: IndexedFold Int (Seq a) a # ifoldr :: (Int -> a -> b -> b) -> b -> Seq a -> b # ifoldl :: (Int -> b -> a -> b) -> b -> Seq a -> b # ifoldr' :: (Int -> a -> b -> b) -> b -> Seq a -> b # ifoldl' :: (Int -> b -> a -> b) -> b -> Seq a -> b #
TraversableWithIndex Int Seq
Instance details 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)
Instance details Defined in Data.Sequence.Internal Associated Types type Item (Seq a) :: Type # Methods fromList :: [Item (Seq a)] -> Seq a # fromListN :: Int -> [Item (Seq a)] -> Seq a # toList :: Seq a -> [Item (Seq a)] #
Eq a => Eq (Seq a)
Instance details Defined in Data.Sequence.Internal Methods (==) :: Seq a -> Seq a -> Bool # (/=) :: Seq a -> Seq a -> Bool #
Data a => Data (Seq a)
Instance details 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) # toConstr :: Seq a -> Constr # 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)
Instance details Defined in Data.Sequence.Internal Methods compare :: Seq a -> Seq a -> Ordering # (<) :: Seq a -> Seq a -> Bool # (<=) :: Seq a -> Seq a -> Bool # (>) :: Seq a -> Seq a -> Bool # (>=) :: Seq a -> Seq a -> Bool # max :: Seq a -> Seq a -> Seq a # min :: Seq a -> Seq a -> Seq a #
Read a => Read (Seq a)
Instance details Defined in Data.Sequence.Internal Methods readsPrec :: Int -> ReadS (Seq a) # readList :: ReadS [Seq a] # readPrec :: ReadPrec (Seq a) # readListPrec :: ReadPrec [Seq a] #
Show a => Show (Seq a)
Instance details Defined in Data.Sequence.Internal Methods showsPrec :: Int -> Seq a -> ShowS # show :: Seq a -> String # showList :: [Seq a] -> ShowS #
a ~ Char => IsString (Seq a)	Since: containers-0.5.7
Instance details Defined in Data.Sequence.Internal Methods fromString :: String -> Seq a #
Semigroup (Seq a)	Since: containers-0.5.7
Instance details Defined in Data.Sequence.Internal Methods (<>) :: Seq a -> Seq a -> Seq a # sconcat :: NonEmpty (Seq a) -> Seq a # stimes :: Integral b => b -> Seq a -> Seq a #
Monoid (Seq a)
Instance details Defined in Data.Sequence.Internal Methods mempty :: Seq a # mappend :: Seq a -> Seq a -> Seq a # mconcat :: [Seq a] -> Seq a #
NFData a => NFData (Seq a)
Instance details Defined in Data.Sequence.Internal Methods rnf :: Seq a -> () #
GrowingAppend (Seq a)
Instance details Defined in Data.MonoTraversable
MonoPointed (Seq a)
Instance details Defined in Data.MonoTraversable Methods opoint :: Element (Seq a) -> Seq a #
MonoTraversable (Seq a)
Instance details Defined in Data.MonoTraversable Methods otraverse :: Applicative f => (Element (Seq a) -> f (Element (Seq a))) -> Seq a -> f (Seq a) # omapM :: Applicative m => (Element (Seq a) -> m (Element (Seq a))) -> Seq a -> m (Seq a) #
MonoFoldable (Seq a)
Instance details 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 # onull :: Seq a -> Bool # olength :: Seq a -> Int # olength64 :: Seq a -> Int64 # 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) # oelem :: Element (Seq a) -> Seq a -> Bool # onotElem :: Element (Seq a) -> Seq a -> Bool #
MonoFunctor (Seq a)
Instance details Defined in Data.MonoTraversable Methods omap :: (Element (Seq a) -> Element (Seq a)) -> Seq a -> Seq a #
IsSequence (Seq a)
Instance details 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] # tailEx :: Seq a -> Seq a # tailMay :: Seq a -> Maybe (Seq a) # initEx :: Seq a -> 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)
Instance details Defined in Data.Sequences Associated Types type Index (Seq a) :: Type # Methods intersperse :: Element (Seq a) -> Seq a -> Seq a # reverse :: Seq a -> Seq a # find :: (Element (Seq a) -> Bool) -> Seq a -> Maybe (Element (Seq a)) # sortBy :: (Element (Seq a) -> Element (Seq a) -> Ordering) -> Seq a -> Seq a # cons :: Element (Seq a) -> Seq a -> Seq a # snoc :: Seq a -> Element (Seq a) -> Seq a #
Ixed (Seq a)
Instance details Defined in Control.Lens.At Methods ix :: Index (Seq a) -> Traversal' (Seq a) (IxValue (Seq a)) #
Wrapped (Seq a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (Seq a) :: Type # Methods _Wrapped' :: Iso' (Seq a) (Unwrapped (Seq a)) #
t ~ Seq a' => Rewrapped (Seq a) t
Instance details Defined in Control.Lens.Wrapped
type Key Seq
Instance details Defined in Data.Key type Key Seq = Int
type Item (Seq a)
Instance details Defined in Data.Sequence.Internal type Item (Seq a) = a
type Element (Seq a)
Instance details Defined in Data.MonoTraversable type Element (Seq a) = a
type Index (Seq a)
Instance details Defined in Data.Sequences type Index (Seq a) = Int
type Index (Seq a)
Instance details Defined in Control.Lens.At type Index (Seq a) = Int
type IxValue (Seq a)
Instance details Defined in Control.Lens.At type IxValue (Seq a) = a
type Unwrapped (Seq a)
Instance details Defined in Control.Lens.Wrapped type Unwrapped (Seq a) = [a]

data IntSet #

A set of integers.

Instances

IsList IntSet	Since: containers-0.5.6.2
Instance details Defined in Data.IntSet.Internal Associated Types type Item IntSet :: Type # Methods fromList :: [Item IntSet] -> IntSet # fromListN :: Int -> [Item IntSet] -> IntSet # toList :: IntSet -> [Item IntSet] #
Eq IntSet
Instance details Defined in Data.IntSet.Internal Methods (==) :: IntSet -> IntSet -> Bool # (/=) :: IntSet -> IntSet -> Bool #
Data IntSet
Instance details Defined in Data.IntSet.Internal Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> IntSet -> c IntSet # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c IntSet # toConstr :: IntSet -> Constr # dataTypeOf :: IntSet -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c IntSet) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c IntSet) # gmapT :: (forall b. Data b => b -> b) -> IntSet -> IntSet # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> IntSet -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> IntSet -> r # gmapQ :: (forall d. Data d => d -> u) -> IntSet -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> IntSet -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> IntSet -> m IntSet # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> IntSet -> m IntSet # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> IntSet -> m IntSet #
Ord IntSet
Instance details Defined in Data.IntSet.Internal Methods compare :: IntSet -> IntSet -> Ordering # (<) :: IntSet -> IntSet -> Bool # (<=) :: IntSet -> IntSet -> Bool # (>) :: IntSet -> IntSet -> Bool # (>=) :: IntSet -> IntSet -> Bool # max :: IntSet -> IntSet -> IntSet # min :: IntSet -> IntSet -> IntSet #
Read IntSet
Instance details Defined in Data.IntSet.Internal Methods readsPrec :: Int -> ReadS IntSet # readList :: ReadS [IntSet] # readPrec :: ReadPrec IntSet # readListPrec :: ReadPrec [IntSet] #
Show IntSet
Instance details Defined in Data.IntSet.Internal Methods showsPrec :: Int -> IntSet -> ShowS # show :: IntSet -> String # showList :: [IntSet] -> ShowS #
Semigroup IntSet	Since: containers-0.5.7
Instance details Defined in Data.IntSet.Internal Methods (<>) :: IntSet -> IntSet -> IntSet # sconcat :: NonEmpty IntSet -> IntSet # stimes :: Integral b => b -> IntSet -> IntSet #
Monoid IntSet
Instance details Defined in Data.IntSet.Internal Methods mempty :: IntSet # mappend :: IntSet -> IntSet -> IntSet # mconcat :: [IntSet] -> IntSet #
NFData IntSet
Instance details Defined in Data.IntSet.Internal Methods rnf :: IntSet -> () #
GrowingAppend IntSet
Instance details Defined in Data.MonoTraversable
MonoPointed IntSet
Instance details Defined in Data.MonoTraversable Methods opoint :: Element IntSet -> IntSet #
MonoFoldable IntSet
Instance details Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element IntSet -> m) -> IntSet -> m # ofoldr :: (Element IntSet -> b -> b) -> b -> IntSet -> b # ofoldl' :: (a -> Element IntSet -> a) -> a -> IntSet -> a # otoList :: IntSet -> [Element IntSet] # oall :: (Element IntSet -> Bool) -> IntSet -> Bool # oany :: (Element IntSet -> Bool) -> IntSet -> Bool # onull :: IntSet -> Bool # olength :: IntSet -> Int # olength64 :: IntSet -> Int64 # ocompareLength :: Integral i => IntSet -> i -> Ordering # otraverse_ :: Applicative f => (Element IntSet -> f b) -> IntSet -> f () # ofor_ :: Applicative f => IntSet -> (Element IntSet -> f b) -> f () # omapM_ :: Applicative m => (Element IntSet -> m ()) -> IntSet -> m () # oforM_ :: Applicative m => IntSet -> (Element IntSet -> m ()) -> m () # ofoldlM :: Monad m => (a -> Element IntSet -> m a) -> a -> IntSet -> m a # ofoldMap1Ex :: Semigroup m => (Element IntSet -> m) -> IntSet -> m # ofoldr1Ex :: (Element IntSet -> Element IntSet -> Element IntSet) -> IntSet -> Element IntSet # ofoldl1Ex' :: (Element IntSet -> Element IntSet -> Element IntSet) -> IntSet -> Element IntSet # headEx :: IntSet -> Element IntSet # lastEx :: IntSet -> Element IntSet # unsafeHead :: IntSet -> Element IntSet # unsafeLast :: IntSet -> Element IntSet # maximumByEx :: (Element IntSet -> Element IntSet -> Ordering) -> IntSet -> Element IntSet # minimumByEx :: (Element IntSet -> Element IntSet -> Ordering) -> IntSet -> Element IntSet # oelem :: Element IntSet -> IntSet -> Bool # onotElem :: Element IntSet -> IntSet -> Bool #
IsSet IntSet
Instance details Defined in Data.Containers Methods insertSet :: Element IntSet -> IntSet -> IntSet # deleteSet :: Element IntSet -> IntSet -> IntSet # singletonSet :: Element IntSet -> IntSet # setFromList :: [Element IntSet] -> IntSet # setToList :: IntSet -> [Element IntSet] #
SetContainer IntSet
Instance details 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] #
Contains IntSet
Instance details Defined in Control.Lens.At Methods contains :: Index IntSet -> Lens' IntSet Bool #
Ixed IntSet
Instance details Defined in Control.Lens.At Methods ix :: Index IntSet -> Traversal' IntSet (IxValue IntSet) #
At IntSet
Instance details Defined in Control.Lens.At Methods at :: Index IntSet -> Lens' IntSet (Maybe (IxValue IntSet)) #
Wrapped IntSet
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped IntSet :: Type # Methods _Wrapped' :: Iso' IntSet (Unwrapped IntSet) #
t ~ IntSet => Rewrapped IntSet t	Use `wrapping fromList`. unwrapping returns a sorted list.
Instance details Defined in Control.Lens.Wrapped
type Item IntSet
Instance details Defined in Data.IntSet.Internal type Item IntSet = Key
type Element IntSet
Instance details Defined in Data.MonoTraversable type Element IntSet = Int
type ContainerKey IntSet
Instance details Defined in Data.Containers type ContainerKey IntSet = Int
type Index IntSet
Instance details Defined in Control.Lens.At type Index IntSet = Int
type IxValue IntSet
Instance details Defined in Control.Lens.At type IxValue IntSet = ()
type Unwrapped IntSet
Instance details Defined in Control.Lens.Wrapped type Unwrapped IntSet = [Int]

data IntMap a #

A map of integers to values a.

Instances

Functor IntMap
Instance details Defined in Data.IntMap.Internal Methods fmap :: (a -> b) -> IntMap a -> IntMap b # (<$) :: a -> IntMap b -> IntMap a #
Foldable IntMap
Instance details 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 # toList :: IntMap a -> [a] # null :: IntMap a -> Bool # length :: IntMap a -> Int # elem :: Eq a => a -> IntMap a -> Bool # maximum :: Ord a => IntMap a -> a # minimum :: Ord a => IntMap a -> a # sum :: Num a => IntMap a -> a # product :: Num a => IntMap a -> a #
Traversable IntMap
Instance details Defined in Data.IntMap.Internal Methods traverse :: Applicative f => (a -> f b) -> IntMap a -> f (IntMap b) # sequenceA :: Applicative f => IntMap (f a) -> f (IntMap a) # mapM :: Monad m => (a -> m b) -> IntMap a -> m (IntMap b) # sequence :: Monad m => IntMap (m a) -> m (IntMap a) #
Eq1 IntMap	Since: containers-0.5.9
Instance details Defined in Data.IntMap.Internal Methods liftEq :: (a -> b -> Bool) -> IntMap a -> IntMap b -> Bool #
Ord1 IntMap	Since: containers-0.5.9
Instance details Defined in Data.IntMap.Internal Methods liftCompare :: (a -> b -> Ordering) -> IntMap a -> IntMap b -> Ordering #
Read1 IntMap	Since: containers-0.5.9
Instance details Defined in Data.IntMap.Internal Methods liftReadsPrec :: (Int -> ReadS a) -> ReadS [a] -> Int -> ReadS (IntMap a) # liftReadList :: (Int -> ReadS a) -> ReadS [a] -> ReadS [IntMap a] # liftReadPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec (IntMap a) # liftReadListPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec [IntMap a] #
Show1 IntMap	Since: containers-0.5.9
Instance details Defined in Data.IntMap.Internal Methods liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> IntMap a -> ShowS # liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [IntMap a] -> ShowS #
Zip IntMap
Instance details Defined in Data.ChunkedZip Methods zipWith :: (a -> b -> c) -> IntMap a -> IntMap b -> IntMap c # zip :: IntMap a -> IntMap b -> IntMap (a, b) # zap :: IntMap (a -> b) -> IntMap a -> IntMap b # unzip :: IntMap (a, b) -> (IntMap a, IntMap b) #
PolyMap IntMap	This instance uses the functions from Data.IntMap.Strict.
Instance details 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 #
Keyed IntMap
Instance details Defined in Data.Key Methods mapWithKey :: (Key IntMap -> a -> b) -> IntMap a -> IntMap b #
Zip IntMap
Instance details Defined in Data.Key Methods zipWith :: (a -> b -> c) -> IntMap a -> IntMap b -> IntMap c # zip :: IntMap a -> IntMap b -> IntMap (a, b) # zap :: IntMap (a -> b) -> IntMap a -> IntMap b #
ZipWithKey IntMap
Instance details Defined in Data.Key Methods zipWithKey :: (Key IntMap -> a -> b -> c) -> IntMap a -> IntMap b -> IntMap c # zapWithKey :: IntMap (Key IntMap -> a -> b) -> IntMap a -> IntMap b #
Indexable IntMap
Instance details Defined in Data.Key Methods index :: IntMap a -> Key IntMap -> a #
Lookup IntMap
Instance details Defined in Data.Key Methods lookup :: Key IntMap -> IntMap a -> Maybe a #
Adjustable IntMap
Instance details Defined in Data.Key Methods adjust :: (a -> a) -> Key IntMap -> IntMap a -> IntMap a # replace :: Key IntMap -> a -> IntMap a -> IntMap a #
FoldableWithKey IntMap
Instance details Defined in Data.Key Methods toKeyedList :: IntMap a -> [(Key IntMap, a)] # foldMapWithKey :: Monoid m => (Key IntMap -> a -> m) -> IntMap a -> m # foldrWithKey :: (Key IntMap -> a -> b -> b) -> b -> IntMap a -> b # foldlWithKey :: (b -> Key IntMap -> a -> b) -> b -> IntMap a -> b #
TraversableWithKey IntMap
Instance details Defined in Data.Key Methods traverseWithKey :: Applicative f => (Key IntMap -> a -> f b) -> IntMap a -> f (IntMap b) # mapWithKeyM :: Monad m => (Key IntMap -> a -> m b) -> IntMap a -> m (IntMap b) #
Apply IntMap	An IntMap is not `Applicative`, but it is an instance of `Apply`
Instance details Defined in Data.Functor.Bind.Class Methods (<.>) :: IntMap (a -> b) -> IntMap a -> IntMap b # (.>) :: IntMap a -> IntMap b -> IntMap b # (<.) :: IntMap a -> IntMap b -> IntMap a # liftF2 :: (a -> b -> c) -> IntMap a -> IntMap b -> IntMap c #
Bind IntMap	An `IntMap` is not a `Monad`, but it is an instance of `Bind`
Instance details Defined in Data.Functor.Bind.Class Methods (>>-) :: IntMap a -> (a -> IntMap b) -> IntMap b # join :: IntMap (IntMap a) -> IntMap a #
FunctorWithIndex Int IntMap
Instance details Defined in Control.Lens.Indexed Methods imap :: (Int -> a -> b) -> IntMap a -> IntMap b # imapped :: IndexedSetter Int (IntMap a) (IntMap b) a b #
FoldableWithIndex Int IntMap
Instance details Defined in Control.Lens.Indexed Methods ifoldMap :: Monoid m => (Int -> a -> m) -> IntMap a -> m # ifolded :: IndexedFold Int (IntMap a) a # ifoldr :: (Int -> a -> b -> b) -> b -> IntMap a -> b # ifoldl :: (Int -> b -> a -> b) -> b -> IntMap a -> b # ifoldr' :: (Int -> a -> b -> b) -> b -> IntMap a -> b # ifoldl' :: (Int -> b -> a -> b) -> b -> IntMap a -> b #
TraversableWithIndex Int IntMap
Instance details Defined in Control.Lens.Indexed Methods itraverse :: Applicative f => (Int -> a -> f b) -> IntMap a -> f (IntMap b) # itraversed :: IndexedTraversal Int (IntMap a) (IntMap b) a b #
IsList (IntMap a)	Since: containers-0.5.6.2
Instance details Defined in Data.IntMap.Internal Associated Types type Item (IntMap a) :: Type # Methods fromList :: [Item (IntMap a)] -> IntMap a # fromListN :: Int -> [Item (IntMap a)] -> IntMap a # toList :: IntMap a -> [Item (IntMap a)] #
Eq a => Eq (IntMap a)
Instance details Defined in Data.IntMap.Internal Methods (==) :: IntMap a -> IntMap a -> Bool # (/=) :: IntMap a -> IntMap a -> Bool #
Data a => Data (IntMap a)
Instance details Defined in Data.IntMap.Internal Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> IntMap a -> c (IntMap a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (IntMap a) # toConstr :: IntMap a -> Constr # dataTypeOf :: IntMap a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (IntMap a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (IntMap a)) # gmapT :: (forall b. Data b => b -> b) -> IntMap a -> IntMap a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> IntMap a -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> IntMap a -> r # gmapQ :: (forall d. Data d => d -> u) -> IntMap a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> IntMap a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> IntMap a -> m (IntMap a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> IntMap a -> m (IntMap a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> IntMap a -> m (IntMap a) #
Ord a => Ord (IntMap a)
Instance details Defined in Data.IntMap.Internal Methods compare :: IntMap a -> IntMap a -> Ordering # (<) :: IntMap a -> IntMap a -> Bool # (<=) :: IntMap a -> IntMap a -> Bool # (>) :: IntMap a -> IntMap a -> Bool # (>=) :: IntMap a -> IntMap a -> Bool # max :: IntMap a -> IntMap a -> IntMap a # min :: IntMap a -> IntMap a -> IntMap a #
Read e => Read (IntMap e)
Instance details Defined in Data.IntMap.Internal Methods readsPrec :: Int -> ReadS (IntMap e) # readList :: ReadS [IntMap e] # readPrec :: ReadPrec (IntMap e) # readListPrec :: ReadPrec [IntMap e] #
Show a => Show (IntMap a)
Instance details Defined in Data.IntMap.Internal Methods showsPrec :: Int -> IntMap a -> ShowS # show :: IntMap a -> String # showList :: [IntMap a] -> ShowS #
Semigroup (IntMap a)	Since: containers-0.5.7
Instance details Defined in Data.IntMap.Internal Methods (<>) :: IntMap a -> IntMap a -> IntMap a # sconcat :: NonEmpty (IntMap a) -> IntMap a # stimes :: Integral b => b -> IntMap a -> IntMap a #
Monoid (IntMap a)
Instance details Defined in Data.IntMap.Internal Methods mempty :: IntMap a # mappend :: IntMap a -> IntMap a -> IntMap a # mconcat :: [IntMap a] -> IntMap a #
NFData a => NFData (IntMap a)
Instance details Defined in Data.IntMap.Internal Methods rnf :: IntMap a -> () #
GrowingAppend (IntMap v)
Instance details Defined in Data.MonoTraversable
MonoTraversable (IntMap a)
Instance details Defined in Data.MonoTraversable Methods otraverse :: Applicative f => (Element (IntMap a) -> f (Element (IntMap a))) -> IntMap a -> f (IntMap a) # omapM :: Applicative m => (Element (IntMap a) -> m (Element (IntMap a))) -> IntMap a -> m (IntMap a) #
MonoFoldable (IntMap a)
Instance details Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element (IntMap a) -> m) -> IntMap a -> m # ofoldr :: (Element (IntMap a) -> b -> b) -> b -> IntMap a -> b # ofoldl' :: (a0 -> Element (IntMap a) -> a0) -> a0 -> IntMap a -> a0 # otoList :: IntMap a -> [Element (IntMap a)] # oall :: (Element (IntMap a) -> Bool) -> IntMap a -> Bool # oany :: (Element (IntMap a) -> Bool) -> IntMap a -> Bool # onull :: IntMap a -> Bool # olength :: IntMap a -> Int # olength64 :: IntMap a -> Int64 # ocompareLength :: Integral i => IntMap a -> i -> Ordering # otraverse_ :: Applicative f => (Element (IntMap a) -> f b) -> IntMap a -> f () # ofor_ :: Applicative f => IntMap a -> (Element (IntMap a) -> f b) -> f () # omapM_ :: Applicative m => (Element (IntMap a) -> m ()) -> IntMap a -> m () # oforM_ :: Applicative m => IntMap a -> (Element (IntMap a) -> m ()) -> m () # ofoldlM :: Monad m => (a0 -> Element (IntMap a) -> m a0) -> a0 -> IntMap a -> m a0 # ofoldMap1Ex :: Semigroup m => (Element (IntMap a) -> m) -> IntMap a -> m # ofoldr1Ex :: (Element (IntMap a) -> Element (IntMap a) -> Element (IntMap a)) -> IntMap a -> Element (IntMap a) # ofoldl1Ex' :: (Element (IntMap a) -> Element (IntMap a) -> Element (IntMap a)) -> IntMap a -> Element (IntMap a) # headEx :: IntMap a -> Element (IntMap a) # lastEx :: IntMap a -> Element (IntMap a) # unsafeHead :: IntMap a -> Element (IntMap a) # unsafeLast :: IntMap a -> Element (IntMap a) # maximumByEx :: (Element (IntMap a) -> Element (IntMap a) -> Ordering) -> IntMap a -> Element (IntMap a) # minimumByEx :: (Element (IntMap a) -> Element (IntMap a) -> Ordering) -> IntMap a -> Element (IntMap a) # oelem :: Element (IntMap a) -> IntMap a -> Bool # onotElem :: Element (IntMap a) -> IntMap a -> Bool #
MonoFunctor (IntMap a)
Instance details Defined in Data.MonoTraversable Methods omap :: (Element (IntMap a) -> Element (IntMap a)) -> IntMap a -> IntMap a #
HasKeysSet (IntMap v)
Instance details Defined in Data.Containers Associated Types type KeySet (IntMap v) :: Type # Methods keysSet :: IntMap v -> KeySet (IntMap v) #
IsMap (IntMap value)	This instance uses the functions from Data.IntMap.Strict.
Instance details Defined in Data.Containers Associated Types type MapValue (IntMap value) :: Type # 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 #
SetContainer (IntMap value)	This instance uses the functions from Data.IntMap.Strict.
Instance details 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)] #
Ixed (IntMap a)
Instance details Defined in Control.Lens.At Methods ix :: Index (IntMap a) -> Traversal' (IntMap a) (IxValue (IntMap a)) #
At (IntMap a)
Instance details Defined in Control.Lens.At Methods at :: Index (IntMap a) -> Lens' (IntMap a) (Maybe (IxValue (IntMap a))) #
Wrapped (IntMap a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (IntMap a) :: Type # Methods _Wrapped' :: Iso' (IntMap a) (Unwrapped (IntMap a)) #
t ~ IntMap a' => Rewrapped (IntMap a) t	Use `wrapping fromList`. unwrapping returns a sorted list.
Instance details Defined in Control.Lens.Wrapped
type Key IntMap
Instance details Defined in Data.Key type Key IntMap = Int
type Item (IntMap a)
Instance details Defined in Data.IntMap.Internal type Item (IntMap a) = (Key, a)
type Element (IntMap a)
Instance details Defined in Data.MonoTraversable type Element (IntMap a) = a
type KeySet (IntMap v)
Instance details Defined in Data.Containers type KeySet (IntMap v) = IntSet
type MapValue (IntMap value)
Instance details Defined in Data.Containers type MapValue (IntMap value) = value
type ContainerKey (IntMap value)
Instance details Defined in Data.Containers type ContainerKey (IntMap value) = Int
type Index (IntMap a)
Instance details Defined in Control.Lens.At type Index (IntMap a) = Int
type IxValue (IntMap a)
Instance details Defined in Control.Lens.At type IxValue (IntMap a) = a
type Unwrapped (IntMap a)
Instance details Defined in Control.Lens.Wrapped type Unwrapped (IntMap a) = [(Int, 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 #

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

Methods

builderToLazy :: builder -> lazy #

Since 0.1.0.0

flushBuilder :: builder #

Since 0.1.0.0

Instances

Builder Builder Text
Instance details Defined in Data.Builder Methods builderToLazy :: Builder -> Text # flushBuilder :: Builder #
Builder Builder ByteString
Instance details Defined in Data.Builder Methods builderToLazy :: Builder -> ByteString # flushBuilder :: Builder #

class ToBuilder value builder where #

Since 0.1.0.0

Methods

toBuilder :: value -> builder #

Since 0.1.0.0

Instances

ToBuilder Char Builder
Instance details Defined in Data.Builder Methods toBuilder :: Char -> Builder #
ToBuilder Char Builder
Instance details Defined in Data.Builder Methods toBuilder :: Char -> Builder #
ToBuilder ByteString Builder
Instance details Defined in Data.Builder Methods toBuilder :: ByteString -> Builder #
ToBuilder ByteString Builder
Instance details Defined in Data.Builder Methods toBuilder :: ByteString -> Builder #
ToBuilder Builder Builder
Instance details Defined in Data.Builder Methods toBuilder :: Builder -> Builder #
ToBuilder Builder Builder
Instance details Defined in Data.Builder Methods toBuilder :: Builder -> Builder #
ToBuilder Text Builder
Instance details Defined in Data.Builder Methods toBuilder :: Text -> Builder #
ToBuilder Text Builder
Instance details Defined in Data.Builder Methods toBuilder :: Text -> Builder #
ToBuilder Text Builder
Instance details Defined in Data.Builder Methods toBuilder :: Text -> Builder #
ToBuilder Text Builder
Instance details Defined in Data.Builder Methods toBuilder :: Text -> Builder #
a ~ Char => ToBuilder [a] Builder
Instance details Defined in Data.Builder Methods toBuilder :: [a] -> Builder #
a ~ Char => ToBuilder [a] Builder
Instance details Defined in Data.Builder Methods toBuilder :: [a] -> Builder #

newChan :: MonadIO m => m (Chan a) #

Lifted newChan.

Since: unliftio-0.1.0.0

writeChan :: MonadIO m => Chan a -> a -> m () #

Lifted writeChan.

Since: unliftio-0.1.0.0

readChan :: MonadIO m => Chan a -> m a #

Lifted readChan.

Since: unliftio-0.1.0.0

dupChan :: MonadIO m => Chan a -> m (Chan a) #

Lifted dupChan.

Since: unliftio-0.1.0.0

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
Instance details Defined in UnliftIO.Exception Methods showsPrec :: Int -> StringException -> ShowS # show :: StringException -> String # showList :: [StringException] -> ShowS #
Exception StringException	Since: unliftio-0.1.0.0
Instance details Defined in UnliftIO.Exception Methods toException :: StringException -> SomeException # fromException :: SomeException -> Maybe StringException # displayException :: StringException -> String #

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
Instance details Defined in UnliftIO.Exception Methods showsPrec :: Int -> AsyncExceptionWrapper -> ShowS # show :: AsyncExceptionWrapper -> String # showList :: [AsyncExceptionWrapper] -> ShowS #
Exception AsyncExceptionWrapper	Since: unliftio-0.1.0.0
Instance details Defined in UnliftIO.Exception Methods toException :: AsyncExceptionWrapper -> SomeException # fromException :: SomeException -> Maybe AsyncExceptionWrapper # displayException :: AsyncExceptionWrapper -> String #

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
Instance details Defined in UnliftIO.Exception Methods showsPrec :: Int -> SyncExceptionWrapper -> ShowS # show :: SyncExceptionWrapper -> String # showList :: [SyncExceptionWrapper] -> ShowS #
Exception SyncExceptionWrapper	Since: unliftio-0.1.0.0
Instance details Defined in UnliftIO.Exception Methods toException :: SyncExceptionWrapper -> SomeException # fromException :: SomeException -> Maybe SyncExceptionWrapper # displayException :: SyncExceptionWrapper -> String #

data Handler (m :: Type -> Type) a where #

Generalized version of Handler.

Since: unliftio-0.1.0.0

Constructors

Handler :: forall (m :: Type -> Type) a e. Exception e => (e -> m a) -> Handler m a

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 #

catchJust is like catch but it takes an extra argument which is an exception predicate, a function which selects which type of exceptions we're interested in.

Since: unliftio-0.1.0.0

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

evaluate :: MonadIO m => a -> m a #

Lifted version of evaluate.

Since: unliftio-0.1.0.0

evaluateDeep :: (MonadIO m, NFData a) => a -> m a #

Deeply evaluate a value using evaluate and NFData.

Since: unliftio-0.1.0.0

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 #

Unwrap an Either value, throwing its Left value as a runtime exception via throwIO if present.

Since: unliftio-0.1.0.0

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

hClose :: MonadIO m => Handle -> m () #

Lifted version of hClose

Since: unliftio-0.2.1.0

hFlush :: MonadIO m => Handle -> m () #

Lifted version of hFlush

Since: unliftio-0.2.1.0

hFileSize :: MonadIO m => Handle -> m Integer #

Lifted version of hFileSize

Since: unliftio-0.2.1.0

hSetFileSize :: MonadIO m => Handle -> Integer -> m () #

Lifted version of hSetFileSize

Since: unliftio-0.2.1.0

hIsEOF :: MonadIO m => Handle -> m Bool #

Lifted version of hIsEOF

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

hTell :: MonadIO m => Handle -> m Integer #

Lifted version of hTell

Since: unliftio-0.2.1.0

hIsOpen :: MonadIO m => Handle -> m Bool #

Lifted version of hIsOpen

Since: unliftio-0.2.1.0

hIsClosed :: MonadIO m => Handle -> m Bool #

Lifted version of hIsClosed

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

hSetEcho :: MonadIO m => Handle -> Bool -> m () #

Lifted version of hSetEcho

Since: unliftio-0.2.1.0

hGetEcho :: MonadIO m => Handle -> m Bool #

Lifted version of hGetEcho

Since: unliftio-0.2.1.0

hWaitForInput :: MonadIO m => Handle -> Int -> m Bool #

Lifted version of hWaitForInput

Since: unliftio-0.2.1.0

hReady :: MonadIO m => Handle -> m Bool #

Lifted version of hReady

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

newIORef :: MonadIO m => a -> m (IORef a) #

Lifted newIORef.

Since: unliftio-0.1.0.0

readIORef :: MonadIO m => IORef a -> m a #

Lifted readIORef.

Since: unliftio-0.1.0.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

Eq ConcException
Instance details Defined in UnliftIO.Internals.Async Methods (==) :: ConcException -> ConcException -> Bool # (/=) :: ConcException -> ConcException -> Bool #
Ord ConcException
Instance details Defined in UnliftIO.Internals.Async Methods compare :: ConcException -> ConcException -> Ordering # (<) :: ConcException -> ConcException -> Bool # (<=) :: ConcException -> ConcException -> Bool # (>) :: ConcException -> ConcException -> Bool # (>=) :: ConcException -> ConcException -> Bool # max :: ConcException -> ConcException -> ConcException # min :: ConcException -> ConcException -> ConcException #
Show ConcException
Instance details Defined in UnliftIO.Internals.Async Methods showsPrec :: Int -> ConcException -> ShowS # show :: ConcException -> String # showList :: [ConcException] -> ShowS #
Generic ConcException
Instance details Defined in UnliftIO.Internals.Async Associated Types type Rep ConcException :: Type -> Type # Methods from :: ConcException -> Rep ConcException x # to :: Rep ConcException x -> ConcException #
Exception ConcException
Instance details Defined in UnliftIO.Internals.Async Methods toException :: ConcException -> SomeException # fromException :: SomeException -> Maybe ConcException # displayException :: ConcException -> String #
type Rep ConcException
Instance details Defined in UnliftIO.Internals.Async type Rep ConcException = D1 (MetaData "ConcException" "UnliftIO.Internals.Async" "unliftio-0.2.10-4SEpalRGjHQK717rpqXvlz" False) (C1 (MetaCons "EmptyWithNoAlternative" PrefixI False) (U1 :: Type -> Type))

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)
Instance details Defined in UnliftIO.Internals.Async Methods fmap :: (a -> b) -> Conc m a -> Conc m b # (<$) :: a -> Conc m b -> Conc m a #
MonadUnliftIO m => Applicative (Conc m)	Since: unliftio-0.2.9.0
Instance details Defined in UnliftIO.Internals.Async Methods pure :: a -> Conc m a # (<>) :: Conc m (a -> b) -> Conc m a -> Conc m b # liftA2 :: (a -> b -> c) -> Conc m a -> Conc m b -> Conc m c # (>) :: Conc m a -> Conc m b -> Conc m b # (<*) :: Conc m a -> Conc m b -> Conc m a #
MonadUnliftIO m => Alternative (Conc m)	Since: unliftio-0.2.9.0
Instance details Defined in UnliftIO.Internals.Async Methods empty :: Conc m a # (<\|>) :: Conc m a -> Conc m a -> Conc m a # some :: Conc m a -> Conc m [a] # many :: Conc m a -> Conc m [a] #
(MonadUnliftIO m, Semigroup a) => Semigroup (Conc m a)	Since: unliftio-0.2.9.0
Instance details Defined in UnliftIO.Internals.Async Methods (<>) :: Conc m a -> Conc m a -> Conc m a # sconcat :: NonEmpty (Conc m a) -> Conc m a # stimes :: Integral b => b -> Conc m a -> Conc m a #
(Monoid a, MonadUnliftIO m) => Monoid (Conc m a)	Since: unliftio-0.2.9.0
Instance details Defined in UnliftIO.Internals.Async Methods mempty :: Conc m a # mappend :: Conc m a -> Conc m a -> Conc m a # mconcat :: [Conc m a] -> Conc m a #

newtype Concurrently (m :: Type -> Type) a #

Unlifted Concurrently.

Since: unliftio-0.1.0.0

Constructors

Concurrently
Fields runConcurrently :: m a

Instances

Monad m => Functor (Concurrently m)	Since: unliftio-0.1.0.0
Instance details 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
Instance details 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 `Concurrently` values using `Alternative` is the equivalent to using a `race` combinator, the asynchrounous sub-routine that returns a value first is the one that gets it's value returned, the slowest sub-routine gets cancelled and it's thread is killed. Since: unliftio-0.1.0.0
Instance details 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 `async` for `base >= 4.9`. Since: unliftio-0.1.0.0
Instance details 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
Instance details 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

asyncOn :: MonadUnliftIO m => Int -> m a -> m (Async a) #

Unlifted asyncOn.

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

wait :: MonadIO m => Async a -> m a #

Lifted wait.

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

cancel :: MonadIO m => Async a -> m () #

Lifted cancel.

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

waitAny :: MonadIO m => [Async a] -> m (Async a, a) #

Lifted waitAny.

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

waitBoth :: MonadIO m => Async a -> Async b -> m (a, b) #

Lifted waitBoth.

Since: unliftio-0.1.0.0

link :: MonadIO m => Async a -> m () #

Lifted link.

Since: unliftio-0.1.0.0

link2 :: MonadIO m => Async a -> Async b -> m () #

Lifted link2.

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

conc :: m a -> Conc m a #

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

pooledMapConcurrentlyN #

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

Expand

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

pooledForConcurrentlyN #

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

pooledMapConcurrentlyN_ #

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

pooledForConcurrentlyN_ #

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

pooledReplicateConcurrently #

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

newMVar :: MonadIO m => a -> m (MVar a) #

Lifted newMVar.

Since: unliftio-0.1.0.0

takeMVar :: MonadIO m => MVar a -> m a #

Lifted takeMVar.

Since: unliftio-0.1.0.0

putMVar :: MonadIO m => MVar a -> a -> m () #

Lifted putMVar.

Since: unliftio-0.1.0.0

readMVar :: MonadIO m => MVar a -> m a #

Lifted readMVar.

Since: unliftio-0.1.0.0

swapMVar :: MonadIO m => MVar a -> a -> m a #

Lifted swapMVar.

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

data Memoized a #

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

Instances

Monad Memoized
Instance details Defined in UnliftIO.Memoize Methods (>>=) :: Memoized a -> (a -> Memoized b) -> Memoized b # (>>) :: Memoized a -> Memoized b -> Memoized b # return :: a -> Memoized a # fail :: String -> Memoized a #
Functor Memoized
Instance details Defined in UnliftIO.Memoize Methods fmap :: (a -> b) -> Memoized a -> Memoized b # (<$) :: a -> Memoized b -> Memoized a #
Applicative Memoized
Instance details Defined in UnliftIO.Memoize Methods pure :: a -> Memoized a # (<>) :: Memoized (a -> b) -> Memoized a -> Memoized b # liftA2 :: (a -> b -> c) -> Memoized a -> Memoized b -> Memoized c # (>) :: Memoized a -> Memoized b -> Memoized b # (<*) :: Memoized a -> Memoized b -> Memoized a #
Show (Memoized a)
Instance details Defined in UnliftIO.Memoize Methods showsPrec :: Int -> Memoized a -> ShowS # show :: Memoized a -> String # showList :: [Memoized a] -> ShowS #

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

retrySTM :: STM a #

Renamed retry for unqualified export

Since: unliftio-0.2.1.0

checkSTM :: Bool -> STM () #

Renamed check for unqualified export

Since: unliftio-0.2.1.0

newTVarIO :: MonadIO m => a -> m (TVar a) #

Lifted version of newTVarIO

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

withSystemTempFile #

Arguments

:: MonadUnliftIO m
=> String	File name template. See `openTempFile`.
-> (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

withSystemTempDirectory #

Arguments

:: MonadUnliftIO m
=> String	Directory name template. See `openTempFile`.
-> (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

withTempFile #

Arguments

:: MonadUnliftIO m
=> FilePath	Temp dir to create the file in.
-> String	File name template. See `openTempFile`.
-> (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

withTempDirectory #

Arguments

:: MonadUnliftIO m
=> FilePath	Temp directory to create the directory in.
-> String	Directory name template. See `openTempFile`.
-> (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

timeout :: MonadUnliftIO m => Int -> m a -> m (Maybe a) #

Unlifted timeout.

Since: unliftio-0.1.0.0

wrappedWithRunInIO #

Arguments

:: MonadUnliftIO n
=> (n b -> m b)	The wrapper, for instance `IdentityT`.
-> (forall a. m a -> n a)	The inverse, for instance `runIdentityT`.
-> ((forall a. m a -> IO a) -> IO b)	The actual function to invoke `withRunInIO` with.
-> 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

Expand

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 unAppT

Since: 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

Constructors

UnliftIO
Fields unliftIO :: forall a. m a -> IO a

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

askUnliftIO | withRunInIO

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
Instance details Defined in Control.Monad.IO.Unlift Methods askUnliftIO :: IO (UnliftIO IO) # withRunInIO :: ((forall a. IO a -> IO a) -> IO b) -> IO b #
MonadUnliftIO m => MonadUnliftIO (ResourceT m)	Since: resourcet-1.1.10
Instance details Defined in Control.Monad.Trans.Resource.Internal Methods askUnliftIO :: ResourceT m (UnliftIO (ResourceT m)) # withRunInIO :: ((forall a. ResourceT m a -> IO a) -> IO b) -> ResourceT m b #
MonadUnliftIO m => MonadUnliftIO (ReaderT r m)
Instance details Defined in Control.Monad.IO.Unlift Methods askUnliftIO :: ReaderT r m (UnliftIO (ReaderT r m)) # withRunInIO :: ((forall a. ReaderT r m a -> IO a) -> IO b) -> ReaderT r m b #
MonadUnliftIO m => MonadUnliftIO (IdentityT m)
Instance details Defined in Control.Monad.IO.Unlift Methods askUnliftIO :: IdentityT m (UnliftIO (IdentityT m)) # withRunInIO :: ((forall a. IdentityT m a -> IO a) -> IO b) -> IdentityT m b #

data TBChan a #

TBChan is an abstract type representing a bounded FIFO channel.

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.

data TBMChan a #

TBMChan is an abstract type representing a bounded closeable FIFO channel.

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.

data TBMQueue a #

TBMQueue is an abstract type representing a bounded closeable FIFO queue.

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.

data TMChan a #

TMChan is an abstract type representing a closeable FIFO channel.

newTMChan :: STM (TMChan a) #

Build and returns a new instance of TMChan.

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.

data TMQueue a #

TMQueue is an abstract type representing a closeable FIFO queue.

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.

data TBQueue a #

TBQueue is an abstract type representing a bounded FIFO channel.

Since: stm-2.4

Instances

Eq (TBQueue a)
Instance details Defined in Control.Concurrent.STM.TBQueue Methods (==) :: TBQueue a -> TBQueue a -> Bool # (/=) :: TBQueue a -> TBQueue a -> Bool #

newTBQueue #

Arguments

:: Natural	maximum number of elements the queue can hold
-> STM (TBQueue a)

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.

isEmptyTBQueue :: TBQueue a -> STM Bool #

Returns True if the supplied TBQueue is empty.

isFullTBQueue :: TBQueue a -> STM Bool #

Returns True if the supplied TBQueue is full.

Since: stm-2.4.3

data TChan a #

TChan is an abstract type representing an unbounded FIFO channel.

Instances

Eq (TChan a)
Instance details Defined in Control.Concurrent.STM.TChan Methods (==) :: TChan a -> TChan a -> Bool # (/=) :: TChan a -> TChan a -> Bool #

newTChan :: STM (TChan a) #

Build and return a new instance of TChan

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 message

The 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.

readTChan :: TChan a -> STM a #

Read the next value from the 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.

isEmptyTChan :: TChan a -> STM Bool #

Returns True if the supplied TChan is empty.

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

data TMVar a #

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.

Instances

Eq (TMVar a)
Instance details Defined in Control.Concurrent.STM.TMVar Methods (==) :: TMVar a -> TMVar a -> Bool # (/=) :: TMVar a -> TMVar a -> Bool #

newTMVar :: a -> STM (TMVar a) #

Create a TMVar which contains the supplied value.

newEmptyTMVar :: STM (TMVar a) #

Create a TMVar which is initially empty.

takeTMVar :: TMVar a -> STM a #

Return the contents of the TMVar. If the TMVar is currently empty, the transaction will retry. After a takeTMVar, the TMVar is left 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 a if the TMVar was full with contents a. After tryTakeTMVar, the TMVar is left empty.

putTMVar :: TMVar a -> a -> STM () #

Put a value into a TMVar. If the TMVar is currently full, putTMVar will retry.

tryPutTMVar :: TMVar a -> a -> STM Bool #

A version of putTMVar that does not retry. The tryPutTMVar function attempts to put the value a into the TMVar, returning True if it was successful, or False otherwise.

readTMVar :: TMVar a -> STM a #

This is a combination of takeTMVar and putTMVar; ie. it takes the value from the TMVar, puts it back, and also returns it.

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

swapTMVar :: TMVar a -> a -> STM a #

Swap the contents of a TMVar for a new value.

isEmptyTMVar :: TMVar a -> STM Bool #

Check whether a given TMVar is empty.

data TQueue a #

TQueue is an abstract type representing an unbounded FIFO channel.

Since: stm-2.4

Instances

Eq (TQueue a)
Instance details Defined in Control.Concurrent.STM.TQueue Methods (==) :: TQueue a -> TQueue a -> Bool # (/=) :: TQueue a -> TQueue a -> Bool #

newTQueue :: STM (TQueue a) #

Build and returns a new instance of TQueue

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.

isEmptyTQueue :: TQueue a -> STM Bool #

Returns True if the supplied TQueue is empty.

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

swapTVar :: TVar a -> a -> STM a #

Swap the contents of a TVar for a new value.

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

sayString :: MonadIO m => String -> m () #

Same as say, but operates on a String. Note that this will force the entire String into memory at once, and will fail for infinite Strings.

Since: say-0.1.0.0

sayShow :: (MonadIO m, Show a) => a -> m () #

Same as say, but for instances of Show.

If your Show instance generates infinite output, this will fail. However, an infinite result for show would generally be considered an invalid instance anyway.

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

hSay :: MonadIO m => Handle -> Text -> m () #

Same as say, but data is sent to the provided Handle.

Since: say-0.1.0.0

hSayString :: MonadIO m => Handle -> String -> m () #

Same as sayString, but data is sent to the provided Handle.

Since: say-0.1.0.0

hSayShow :: (MonadIO m, Show a) => Handle -> a -> m () #

Same as sayShow, but data is sent to the provided Handle.

Since: say-0.1.0.0

newMutVar :: PrimMonad m => a -> m (MutVar (PrimState m) a) #

Create a new MutVar with the specified initial value

readMutVar :: PrimMonad m => MutVar (PrimState m) a -> m a #

Read the value of a MutVar

writeMutVar :: PrimMonad m => MutVar (PrimState m) a -> a -> m () #

Write a new value into a MutVar

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 Prim a #

Class of types supporting primitive array operations

Minimal complete definition

sizeOf#, alignment#, indexByteArray#, readByteArray#, writeByteArray#, setByteArray#, indexOffAddr#, readOffAddr#, writeOffAddr#, setOffAddr#

Instances

Prim Char
Instance details Defined in Data.Primitive.Types Methods sizeOf# :: Char -> Int# # alignment# :: Char -> Int# # indexByteArray# :: ByteArray# -> Int# -> Char # readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (#State# s, Char#) # writeByteArray# :: MutableByteArray# s -> Int# -> Char -> State# s -> State# s # setByteArray# :: MutableByteArray# s -> Int# -> Int# -> Char -> State# s -> State# s # indexOffAddr# :: Addr# -> Int# -> Char # readOffAddr# :: Addr# -> Int# -> State# s -> (#State# s, Char#) # writeOffAddr# :: Addr# -> Int# -> Char -> State# s -> State# s # setOffAddr# :: Addr# -> Int# -> Int# -> Char -> State# s -> State# s #
Prim Double
Instance details Defined in Data.Primitive.Types Methods sizeOf# :: Double -> Int# # alignment# :: Double -> Int# # indexByteArray# :: ByteArray# -> Int# -> Double # readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (#State# s, Double#) # writeByteArray# :: MutableByteArray# s -> Int# -> Double -> State# s -> State# s # setByteArray# :: MutableByteArray# s -> Int# -> Int# -> Double -> State# s -> State# s # indexOffAddr# :: Addr# -> Int# -> Double # readOffAddr# :: Addr# -> Int# -> State# s -> (#State# s, Double#) # writeOffAddr# :: Addr# -> Int# -> Double -> State# s -> State# s # setOffAddr# :: Addr# -> Int# -> Int# -> Double -> State# s -> State# s #
Prim Float
Instance details Defined in Data.Primitive.Types Methods sizeOf# :: Float -> Int# # alignment# :: Float -> Int# # indexByteArray# :: ByteArray# -> Int# -> Float # readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (#State# s, Float#) # writeByteArray# :: MutableByteArray# s -> Int# -> Float -> State# s -> State# s # setByteArray# :: MutableByteArray# s -> Int# -> Int# -> Float -> State# s -> State# s # indexOffAddr# :: Addr# -> Int# -> Float # readOffAddr# :: Addr# -> Int# -> State# s -> (#State# s, Float#) # writeOffAddr# :: Addr# -> Int# -> Float -> State# s -> State# s # setOffAddr# :: Addr# -> Int# -> Int# -> Float -> State# s -> State# s #
Prim Int
Instance details Defined in Data.Primitive.Types Methods sizeOf# :: Int -> Int# # alignment# :: Int -> Int# # indexByteArray# :: ByteArray# -> Int# -> Int # readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (#State# s, Int#) # writeByteArray# :: MutableByteArray# s -> Int# -> Int -> State# s -> State# s # setByteArray# :: MutableByteArray# s -> Int# -> Int# -> Int -> State# s -> State# s # indexOffAddr# :: Addr# -> Int# -> Int # readOffAddr# :: Addr# -> Int# -> State# s -> (#State# s, Int#) # writeOffAddr# :: Addr# -> Int# -> Int -> State# s -> State# s # setOffAddr# :: Addr# -> Int# -> Int# -> Int -> State# s -> State# s #
Prim Int8
Instance details Defined in Data.Primitive.Types Methods sizeOf# :: Int8 -> Int# # alignment# :: Int8 -> Int# # indexByteArray# :: ByteArray# -> Int# -> Int8 # readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (#State# s, Int8#) # writeByteArray# :: MutableByteArray# s -> Int# -> Int8 -> State# s -> State# s # setByteArray# :: MutableByteArray# s -> Int# -> Int# -> Int8 -> State# s -> State# s # indexOffAddr# :: Addr# -> Int# -> Int8 # readOffAddr# :: Addr# -> Int# -> State# s -> (#State# s, Int8#) # writeOffAddr# :: Addr# -> Int# -> Int8 -> State# s -> State# s # setOffAddr# :: Addr# -> Int# -> Int# -> Int8 -> State# s -> State# s #
Prim Int16
Instance details Defined in Data.Primitive.Types Methods sizeOf# :: Int16 -> Int# # alignment# :: Int16 -> Int# # indexByteArray# :: ByteArray# -> Int# -> Int16 # readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (#State# s, Int16#) # writeByteArray# :: MutableByteArray# s -> Int# -> Int16 -> State# s -> State# s # setByteArray# :: MutableByteArray# s -> Int# -> Int# -> Int16 -> State# s -> State# s # indexOffAddr# :: Addr# -> Int# -> Int16 # readOffAddr# :: Addr# -> Int# -> State# s -> (#State# s, Int16#) # writeOffAddr# :: Addr# -> Int# -> Int16 -> State# s -> State# s # setOffAddr# :: Addr# -> Int# -> Int# -> Int16 -> State# s -> State# s #
Prim Int32
Instance details Defined in Data.Primitive.Types Methods sizeOf# :: Int32 -> Int# # alignment# :: Int32 -> Int# # indexByteArray# :: ByteArray# -> Int# -> Int32 # readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (#State# s, Int32#) # writeByteArray# :: MutableByteArray# s -> Int# -> Int32 -> State# s -> State# s # setByteArray# :: MutableByteArray# s -> Int# -> Int# -> Int32 -> State# s -> State# s # indexOffAddr# :: Addr# -> Int# -> Int32 # readOffAddr# :: Addr# -> Int# -> State# s -> (#State# s, Int32#) # writeOffAddr# :: Addr# -> Int# -> Int32 -> State# s -> State# s # setOffAddr# :: Addr# -> Int# -> Int# -> Int32 -> State# s -> State# s #
Prim Int64
Instance details Defined in Data.Primitive.Types Methods sizeOf# :: Int64 -> Int# # alignment# :: Int64 -> Int# # indexByteArray# :: ByteArray# -> Int# -> Int64 # readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (#State# s, Int64#) # writeByteArray# :: MutableByteArray# s -> Int# -> Int64 -> State# s -> State# s # setByteArray# :: MutableByteArray# s -> Int# -> Int# -> Int64 -> State# s -> State# s # indexOffAddr# :: Addr# -> Int# -> Int64 # readOffAddr# :: Addr# -> Int# -> State# s -> (#State# s, Int64#) # writeOffAddr# :: Addr# -> Int# -> Int64 -> State# s -> State# s # setOffAddr# :: Addr# -> Int# -> Int# -> Int64 -> State# s -> State# s #
Prim Word
Instance details Defined in Data.Primitive.Types Methods sizeOf# :: Word -> Int# # alignment# :: Word -> Int# # indexByteArray# :: ByteArray# -> Int# -> Word # readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (#State# s, Word#) # writeByteArray# :: MutableByteArray# s -> Int# -> Word -> State# s -> State# s # setByteArray# :: MutableByteArray# s -> Int# -> Int# -> Word -> State# s -> State# s # indexOffAddr# :: Addr# -> Int# -> Word # readOffAddr# :: Addr# -> Int# -> State# s -> (#State# s, Word#) # writeOffAddr# :: Addr# -> Int# -> Word -> State# s -> State# s # setOffAddr# :: Addr# -> Int# -> Int# -> Word -> State# s -> State# s #
Prim Word8
Instance details Defined in Data.Primitive.Types Methods sizeOf# :: Word8 -> Int# # alignment# :: Word8 -> Int# # indexByteArray# :: ByteArray# -> Int# -> Word8 # readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (#State# s, Word8#) # writeByteArray# :: MutableByteArray# s -> Int# -> Word8 -> State# s -> State# s # setByteArray# :: MutableByteArray# s -> Int# -> Int# -> Word8 -> State# s -> State# s # indexOffAddr# :: Addr# -> Int# -> Word8 # readOffAddr# :: Addr# -> Int# -> State# s -> (#State# s, Word8#) # writeOffAddr# :: Addr# -> Int# -> Word8 -> State# s -> State# s # setOffAddr# :: Addr# -> Int# -> Int# -> Word8 -> State# s -> State# s #
Prim Word16
Instance details Defined in Data.Primitive.Types Methods sizeOf# :: Word16 -> Int# # alignment# :: Word16 -> Int# # indexByteArray# :: ByteArray# -> Int# -> Word16 # readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (#State# s, Word16#) # writeByteArray# :: MutableByteArray# s -> Int# -> Word16 -> State# s -> State# s # setByteArray# :: MutableByteArray# s -> Int# -> Int# -> Word16 -> State# s -> State# s # indexOffAddr# :: Addr# -> Int# -> Word16 # readOffAddr# :: Addr# -> Int# -> State# s -> (#State# s, Word16#) # writeOffAddr# :: Addr# -> Int# -> Word16 -> State# s -> State# s # setOffAddr# :: Addr# -> Int# -> Int# -> Word16 -> State# s -> State# s #
Prim Word32
Instance details Defined in Data.Primitive.Types Methods sizeOf# :: Word32 -> Int# # alignment# :: Word32 -> Int# # indexByteArray# :: ByteArray# -> Int# -> Word32 # readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (#State# s, Word32#) # writeByteArray# :: MutableByteArray# s -> Int# -> Word32 -> State# s -> State# s # setByteArray# :: MutableByteArray# s -> Int# -> Int# -> Word32 -> State# s -> State# s # indexOffAddr# :: Addr# -> Int# -> Word32 # readOffAddr# :: Addr# -> Int# -> State# s -> (#State# s, Word32#) # writeOffAddr# :: Addr# -> Int# -> Word32 -> State# s -> State# s # setOffAddr# :: Addr# -> Int# -> Int# -> Word32 -> State# s -> State# s #
Prim Word64
Instance details Defined in Data.Primitive.Types Methods sizeOf# :: Word64 -> Int# # alignment# :: Word64 -> Int# # indexByteArray# :: ByteArray# -> Int# -> Word64 # readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (#State# s, Word64#) # writeByteArray# :: MutableByteArray# s -> Int# -> Word64 -> State# s -> State# s # setByteArray# :: MutableByteArray# s -> Int# -> Int# -> Word64 -> State# s -> State# s # indexOffAddr# :: Addr# -> Int# -> Word64 # readOffAddr# :: Addr# -> Int# -> State# s -> (#State# s, Word64#) # writeOffAddr# :: Addr# -> Int# -> Word64 -> State# s -> State# s # setOffAddr# :: Addr# -> Int# -> Int# -> Word64 -> State# s -> State# s #
Prim CDev
Instance details Defined in Data.Primitive.Types Methods sizeOf# :: CDev -> Int# # alignment# :: CDev -> Int# # indexByteArray# :: ByteArray# -> Int# -> CDev # readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (#State# s, CDev#) # writeByteArray# :: MutableByteArray# s -> Int# -> CDev -> State# s -> State# s # setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CDev -> State# s -> State# s # indexOffAddr# :: Addr# -> Int# -> CDev # readOffAddr# :: Addr# -> Int# -> State# s -> (#State# s, CDev#) # writeOffAddr# :: Addr# -> Int# -> CDev -> State# s -> State# s # setOffAddr# :: Addr# -> Int# -> Int# -> CDev -> State# s -> State# s #
Prim CIno
Instance details Defined in Data.Primitive.Types Methods sizeOf# :: CIno -> Int# # alignment# :: CIno -> Int# # indexByteArray# :: ByteArray# -> Int# -> CIno # readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (#State# s, CIno#) # writeByteArray# :: MutableByteArray# s -> Int# -> CIno -> State# s -> State# s # setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CIno -> State# s -> State# s # indexOffAddr# :: Addr# -> Int# -> CIno # readOffAddr# :: Addr# -> Int# -> State# s -> (#State# s, CIno#) # writeOffAddr# :: Addr# -> Int# -> CIno -> State# s -> State# s # setOffAddr# :: Addr# -> Int# -> Int# -> CIno -> State# s -> State# s #
Prim CMode
Instance details Defined in Data.Primitive.Types Methods sizeOf# :: CMode -> Int# # alignment# :: CMode -> Int# # indexByteArray# :: ByteArray# -> Int# -> CMode # readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (#State# s, CMode#) # writeByteArray# :: MutableByteArray# s -> Int# -> CMode -> State# s -> State# s # setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CMode -> State# s -> State# s # indexOffAddr# :: Addr# -> Int# -> CMode # readOffAddr# :: Addr# -> Int# -> State# s -> (#State# s, CMode#) # writeOffAddr# :: Addr# -> Int# -> CMode -> State# s -> State# s # setOffAddr# :: Addr# -> Int# -> Int# -> CMode -> State# s -> State# s #
Prim COff
Instance details Defined in Data.Primitive.Types Methods sizeOf# :: COff -> Int# # alignment# :: COff -> Int# # indexByteArray# :: ByteArray# -> Int# -> COff # readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (#State# s, COff#) # writeByteArray# :: MutableByteArray# s -> Int# -> COff -> State# s -> State# s # setByteArray# :: MutableByteArray# s -> Int# -> Int# -> COff -> State# s -> State# s # indexOffAddr# :: Addr# -> Int# -> COff # readOffAddr# :: Addr# -> Int# -> State# s -> (#State# s, COff#) # writeOffAddr# :: Addr# -> Int# -> COff -> State# s -> State# s # setOffAddr# :: Addr# -> Int# -> Int# -> COff -> State# s -> State# s #
Prim CPid
Instance details Defined in Data.Primitive.Types Methods sizeOf# :: CPid -> Int# # alignment# :: CPid -> Int# # indexByteArray# :: ByteArray# -> Int# -> CPid # readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (#State# s, CPid#) # writeByteArray# :: MutableByteArray# s -> Int# -> CPid -> State# s -> State# s # setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CPid -> State# s -> State# s # indexOffAddr# :: Addr# -> Int# -> CPid # readOffAddr# :: Addr# -> Int# -> State# s -> (#State# s, CPid#) # writeOffAddr# :: Addr# -> Int# -> CPid -> State# s -> State# s # setOffAddr# :: Addr# -> Int# -> Int# -> CPid -> State# s -> State# s #
Prim CSsize
Instance details Defined in Data.Primitive.Types Methods sizeOf# :: CSsize -> Int# # alignment# :: CSsize -> Int# # indexByteArray# :: ByteArray# -> Int# -> CSsize # readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (#State# s, CSsize#) # writeByteArray# :: MutableByteArray# s -> Int# -> CSsize -> State# s -> State# s # setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CSsize -> State# s -> State# s # indexOffAddr# :: Addr# -> Int# -> CSsize # readOffAddr# :: Addr# -> Int# -> State# s -> (#State# s, CSsize#) # writeOffAddr# :: Addr# -> Int# -> CSsize -> State# s -> State# s # setOffAddr# :: Addr# -> Int# -> Int# -> CSsize -> State# s -> State# s #
Prim CGid
Instance details Defined in Data.Primitive.Types Methods sizeOf# :: CGid -> Int# # alignment# :: CGid -> Int# # indexByteArray# :: ByteArray# -> Int# -> CGid # readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (#State# s, CGid#) # writeByteArray# :: MutableByteArray# s -> Int# -> CGid -> State# s -> State# s # setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CGid -> State# s -> State# s # indexOffAddr# :: Addr# -> Int# -> CGid # readOffAddr# :: Addr# -> Int# -> State# s -> (#State# s, CGid#) # writeOffAddr# :: Addr# -> Int# -> CGid -> State# s -> State# s # setOffAddr# :: Addr# -> Int# -> Int# -> CGid -> State# s -> State# s #
Prim CNlink
Instance details Defined in Data.Primitive.Types Methods sizeOf# :: CNlink -> Int# # alignment# :: CNlink -> Int# # indexByteArray# :: ByteArray# -> Int# -> CNlink # readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (#State# s, CNlink#) # writeByteArray# :: MutableByteArray# s -> Int# -> CNlink -> State# s -> State# s # setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CNlink -> State# s -> State# s # indexOffAddr# :: Addr# -> Int# -> CNlink # readOffAddr# :: Addr# -> Int# -> State# s -> (#State# s, CNlink#) # writeOffAddr# :: Addr# -> Int# -> CNlink -> State# s -> State# s # setOffAddr# :: Addr# -> Int# -> Int# -> CNlink -> State# s -> State# s #
Prim CUid
Instance details Defined in Data.Primitive.Types Methods sizeOf# :: CUid -> Int# # alignment# :: CUid -> Int# # indexByteArray# :: ByteArray# -> Int# -> CUid # readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (#State# s, CUid#) # writeByteArray# :: MutableByteArray# s -> Int# -> CUid -> State# s -> State# s # setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CUid -> State# s -> State# s # indexOffAddr# :: Addr# -> Int# -> CUid # readOffAddr# :: Addr# -> Int# -> State# s -> (#State# s, CUid#) # writeOffAddr# :: Addr# -> Int# -> CUid -> State# s -> State# s # setOffAddr# :: Addr# -> Int# -> Int# -> CUid -> State# s -> State# s #
Prim CCc
Instance details Defined in Data.Primitive.Types Methods sizeOf# :: CCc -> Int# # alignment# :: CCc -> Int# # indexByteArray# :: ByteArray# -> Int# -> CCc # readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (#State# s, CCc#) # writeByteArray# :: MutableByteArray# s -> Int# -> CCc -> State# s -> State# s # setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CCc -> State# s -> State# s # indexOffAddr# :: Addr# -> Int# -> CCc # readOffAddr# :: Addr# -> Int# -> State# s -> (#State# s, CCc#) # writeOffAddr# :: Addr# -> Int# -> CCc -> State# s -> State# s # setOffAddr# :: Addr# -> Int# -> Int# -> CCc -> State# s -> State# s #
Prim CSpeed
Instance details Defined in Data.Primitive.Types Methods sizeOf# :: CSpeed -> Int# # alignment# :: CSpeed -> Int# # indexByteArray# :: ByteArray# -> Int# -> CSpeed # readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (#State# s, CSpeed#) # writeByteArray# :: MutableByteArray# s -> Int# -> CSpeed -> State# s -> State# s # setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CSpeed -> State# s -> State# s # indexOffAddr# :: Addr# -> Int# -> CSpeed # readOffAddr# :: Addr# -> Int# -> State# s -> (#State# s, CSpeed#) # writeOffAddr# :: Addr# -> Int# -> CSpeed -> State# s -> State# s # setOffAddr# :: Addr# -> Int# -> Int# -> CSpeed -> State# s -> State# s #
Prim CTcflag
Instance details Defined in Data.Primitive.Types Methods sizeOf# :: CTcflag -> Int# # alignment# :: CTcflag -> Int# # indexByteArray# :: ByteArray# -> Int# -> CTcflag # readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (#State# s, CTcflag#) # writeByteArray# :: MutableByteArray# s -> Int# -> CTcflag -> State# s -> State# s # setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CTcflag -> State# s -> State# s # indexOffAddr# :: Addr# -> Int# -> CTcflag # readOffAddr# :: Addr# -> Int# -> State# s -> (#State# s, CTcflag#) # writeOffAddr# :: Addr# -> Int# -> CTcflag -> State# s -> State# s # setOffAddr# :: Addr# -> Int# -> Int# -> CTcflag -> State# s -> State# s #
Prim CRLim
Instance details Defined in Data.Primitive.Types Methods sizeOf# :: CRLim -> Int# # alignment# :: CRLim -> Int# # indexByteArray# :: ByteArray# -> Int# -> CRLim # readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (#State# s, CRLim#) # writeByteArray# :: MutableByteArray# s -> Int# -> CRLim -> State# s -> State# s # setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CRLim -> State# s -> State# s # indexOffAddr# :: Addr# -> Int# -> CRLim # readOffAddr# :: Addr# -> Int# -> State# s -> (#State# s, CRLim#) # writeOffAddr# :: Addr# -> Int# -> CRLim -> State# s -> State# s # setOffAddr# :: Addr# -> Int# -> Int# -> CRLim -> State# s -> State# s #
Prim CBlkSize
Instance details Defined in Data.Primitive.Types Methods sizeOf# :: CBlkSize -> Int# # alignment# :: CBlkSize -> Int# # indexByteArray# :: ByteArray# -> Int# -> CBlkSize # readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (#State# s, CBlkSize#) # writeByteArray# :: MutableByteArray# s -> Int# -> CBlkSize -> State# s -> State# s # setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CBlkSize -> State# s -> State# s # indexOffAddr# :: Addr# -> Int# -> CBlkSize # readOffAddr# :: Addr# -> Int# -> State# s -> (#State# s, CBlkSize#) # writeOffAddr# :: Addr# -> Int# -> CBlkSize -> State# s -> State# s # setOffAddr# :: Addr# -> Int# -> Int# -> CBlkSize -> State# s -> State# s #
Prim CBlkCnt
Instance details Defined in Data.Primitive.Types Methods sizeOf# :: CBlkCnt -> Int# # alignment# :: CBlkCnt -> Int# # indexByteArray# :: ByteArray# -> Int# -> CBlkCnt # readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (#State# s, CBlkCnt#) # writeByteArray# :: MutableByteArray# s -> Int# -> CBlkCnt -> State# s -> State# s # setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CBlkCnt -> State# s -> State# s # indexOffAddr# :: Addr# -> Int# -> CBlkCnt # readOffAddr# :: Addr# -> Int# -> State# s -> (#State# s, CBlkCnt#) # writeOffAddr# :: Addr# -> Int# -> CBlkCnt -> State# s -> State# s # setOffAddr# :: Addr# -> Int# -> Int# -> CBlkCnt -> State# s -> State# s #
Prim CClockId
Instance details Defined in Data.Primitive.Types Methods sizeOf# :: CClockId -> Int# # alignment# :: CClockId -> Int# # indexByteArray# :: ByteArray# -> Int# -> CClockId # readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (#State# s, CClockId#) # writeByteArray# :: MutableByteArray# s -> Int# -> CClockId -> State# s -> State# s # setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CClockId -> State# s -> State# s # indexOffAddr# :: Addr# -> Int# -> CClockId # readOffAddr# :: Addr# -> Int# -> State# s -> (#State# s, CClockId#) # writeOffAddr# :: Addr# -> Int# -> CClockId -> State# s -> State# s # setOffAddr# :: Addr# -> Int# -> Int# -> CClockId -> State# s -> State# s #
Prim CFsBlkCnt
Instance details Defined in Data.Primitive.Types Methods sizeOf# :: CFsBlkCnt -> Int# # alignment# :: CFsBlkCnt -> Int# # indexByteArray# :: ByteArray# -> Int# -> CFsBlkCnt # readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (#State# s, CFsBlkCnt#) # writeByteArray# :: MutableByteArray# s -> Int# -> CFsBlkCnt -> State# s -> State# s # setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CFsBlkCnt -> State# s -> State# s # indexOffAddr# :: Addr# -> Int# -> CFsBlkCnt # readOffAddr# :: Addr# -> Int# -> State# s -> (#State# s, CFsBlkCnt#) # writeOffAddr# :: Addr# -> Int# -> CFsBlkCnt -> State# s -> State# s # setOffAddr# :: Addr# -> Int# -> Int# -> CFsBlkCnt -> State# s -> State# s #
Prim CFsFilCnt
Instance details Defined in Data.Primitive.Types Methods sizeOf# :: CFsFilCnt -> Int# # alignment# :: CFsFilCnt -> Int# # indexByteArray# :: ByteArray# -> Int# -> CFsFilCnt # readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (#State# s, CFsFilCnt#) # writeByteArray# :: MutableByteArray# s -> Int# -> CFsFilCnt -> State# s -> State# s # setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CFsFilCnt -> State# s -> State# s # indexOffAddr# :: Addr# -> Int# -> CFsFilCnt # readOffAddr# :: Addr# -> Int# -> State# s -> (#State# s, CFsFilCnt#) # writeOffAddr# :: Addr# -> Int# -> CFsFilCnt -> State# s -> State# s # setOffAddr# :: Addr# -> Int# -> Int# -> CFsFilCnt -> State# s -> State# s #
Prim CId
Instance details Defined in Data.Primitive.Types Methods sizeOf# :: CId -> Int# # alignment# :: CId -> Int# # indexByteArray# :: ByteArray# -> Int# -> CId # readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (#State# s, CId#) # writeByteArray# :: MutableByteArray# s -> Int# -> CId -> State# s -> State# s # setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CId -> State# s -> State# s # indexOffAddr# :: Addr# -> Int# -> CId # readOffAddr# :: Addr# -> Int# -> State# s -> (#State# s, CId#) # writeOffAddr# :: Addr# -> Int# -> CId -> State# s -> State# s # setOffAddr# :: Addr# -> Int# -> Int# -> CId -> State# s -> State# s #
Prim CKey
Instance details Defined in Data.Primitive.Types Methods sizeOf# :: CKey -> Int# # alignment# :: CKey -> Int# # indexByteArray# :: ByteArray# -> Int# -> CKey # readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (#State# s, CKey#) # writeByteArray# :: MutableByteArray# s -> Int# -> CKey -> State# s -> State# s # setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CKey -> State# s -> State# s # indexOffAddr# :: Addr# -> Int# -> CKey # readOffAddr# :: Addr# -> Int# -> State# s -> (#State# s, CKey#) # writeOffAddr# :: Addr# -> Int# -> CKey -> State# s -> State# s # setOffAddr# :: Addr# -> Int# -> Int# -> CKey -> State# s -> State# s #
Prim CTimer
Instance details Defined in Data.Primitive.Types Methods sizeOf# :: CTimer -> Int# # alignment# :: CTimer -> Int# # indexByteArray# :: ByteArray# -> Int# -> CTimer # readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (#State# s, CTimer#) # writeByteArray# :: MutableByteArray# s -> Int# -> CTimer -> State# s -> State# s # setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CTimer -> State# s -> State# s # indexOffAddr# :: Addr# -> Int# -> CTimer # readOffAddr# :: Addr# -> Int# -> State# s -> (#State# s, CTimer#) # writeOffAddr# :: Addr# -> Int# -> CTimer -> State# s -> State# s # setOffAddr# :: Addr# -> Int# -> Int# -> CTimer -> State# s -> State# s #
Prim Fd
Instance details Defined in Data.Primitive.Types Methods sizeOf# :: Fd -> Int# # alignment# :: Fd -> Int# # indexByteArray# :: ByteArray# -> Int# -> Fd # readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (#State# s, Fd#) # writeByteArray# :: MutableByteArray# s -> Int# -> Fd -> State# s -> State# s # setByteArray# :: MutableByteArray# s -> Int# -> Int# -> Fd -> State# s -> State# s # indexOffAddr# :: Addr# -> Int# -> Fd # readOffAddr# :: Addr# -> Int# -> State# s -> (#State# s, Fd#) # writeOffAddr# :: Addr# -> Int# -> Fd -> State# s -> State# s # setOffAddr# :: Addr# -> Int# -> Int# -> Fd -> State# s -> State# s #
Prim CChar
Instance details Defined in Data.Primitive.Types Methods sizeOf# :: CChar -> Int# # alignment# :: CChar -> Int# # indexByteArray# :: ByteArray# -> Int# -> CChar # readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (#State# s, CChar#) # writeByteArray# :: MutableByteArray# s -> Int# -> CChar -> State# s -> State# s # setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CChar -> State# s -> State# s # indexOffAddr# :: Addr# -> Int# -> CChar # readOffAddr# :: Addr# -> Int# -> State# s -> (#State# s, CChar#) # writeOffAddr# :: Addr# -> Int# -> CChar -> State# s -> State# s # setOffAddr# :: Addr# -> Int# -> Int# -> CChar -> State# s -> State# s #
Prim CSChar
Instance details Defined in Data.Primitive.Types Methods sizeOf# :: CSChar -> Int# # alignment# :: CSChar -> Int# # indexByteArray# :: ByteArray# -> Int# -> CSChar # readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (#State# s, CSChar#) # writeByteArray# :: MutableByteArray# s -> Int# -> CSChar -> State# s -> State# s # setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CSChar -> State# s -> State# s # indexOffAddr# :: Addr# -> Int# -> CSChar # readOffAddr# :: Addr# -> Int# -> State# s -> (#State# s, CSChar#) # writeOffAddr# :: Addr# -> Int# -> CSChar -> State# s -> State# s # setOffAddr# :: Addr# -> Int# -> Int# -> CSChar -> State# s -> State# s #
Prim CUChar
Instance details Defined in Data.Primitive.Types Methods sizeOf# :: CUChar -> Int# # alignment# :: CUChar -> Int# # indexByteArray# :: ByteArray# -> Int# -> CUChar # readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (#State# s, CUChar#) # writeByteArray# :: MutableByteArray# s -> Int# -> CUChar -> State# s -> State# s # setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CUChar -> State# s -> State# s # indexOffAddr# :: Addr# -> Int# -> CUChar # readOffAddr# :: Addr# -> Int# -> State# s -> (#State# s, CUChar#) # writeOffAddr# :: Addr# -> Int# -> CUChar -> State# s -> State# s # setOffAddr# :: Addr# -> Int# -> Int# -> CUChar -> State# s -> State# s #
Prim CShort
Instance details Defined in Data.Primitive.Types Methods sizeOf# :: CShort -> Int# # alignment# :: CShort -> Int# # indexByteArray# :: ByteArray# -> Int# -> CShort # readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (#State# s, CShort#) # writeByteArray# :: MutableByteArray# s -> Int# -> CShort -> State# s -> State# s # setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CShort -> State# s -> State# s # indexOffAddr# :: Addr# -> Int# -> CShort # readOffAddr# :: Addr# -> Int# -> State# s -> (#State# s, CShort#) # writeOffAddr# :: Addr# -> Int# -> CShort -> State# s -> State# s # setOffAddr# :: Addr# -> Int# -> Int# -> CShort -> State# s -> State# s #
Prim CUShort
Instance details Defined in Data.Primitive.Types Methods sizeOf# :: CUShort -> Int# # alignment# :: CUShort -> Int# # indexByteArray# :: ByteArray# -> Int# -> CUShort # readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (#State# s, CUShort#) # writeByteArray# :: MutableByteArray# s -> Int# -> CUShort -> State# s -> State# s # setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CUShort -> State# s -> State# s # indexOffAddr# :: Addr# -> Int# -> CUShort # readOffAddr# :: Addr# -> Int# -> State# s -> (#State# s, CUShort#) # writeOffAddr# :: Addr# -> Int# -> CUShort -> State# s -> State# s # setOffAddr# :: Addr# -> Int# -> Int# -> CUShort -> State# s -> State# s #
Prim CInt
Instance details Defined in Data.Primitive.Types Methods sizeOf# :: CInt -> Int# # alignment# :: CInt -> Int# # indexByteArray# :: ByteArray# -> Int# -> CInt # readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (#State# s, CInt#) # writeByteArray# :: MutableByteArray# s -> Int# -> CInt -> State# s -> State# s # setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CInt -> State# s -> State# s # indexOffAddr# :: Addr# -> Int# -> CInt # readOffAddr# :: Addr# -> Int# -> State# s -> (#State# s, CInt#) # writeOffAddr# :: Addr# -> Int# -> CInt -> State# s -> State# s # setOffAddr# :: Addr# -> Int# -> Int# -> CInt -> State# s -> State# s #
Prim CUInt
Instance details Defined in Data.Primitive.Types Methods sizeOf# :: CUInt -> Int# # alignment# :: CUInt -> Int# # indexByteArray# :: ByteArray# -> Int# -> CUInt # readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (#State# s, CUInt#) # writeByteArray# :: MutableByteArray# s -> Int# -> CUInt -> State# s -> State# s # setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CUInt -> State# s -> State# s # indexOffAddr# :: Addr# -> Int# -> CUInt # readOffAddr# :: Addr# -> Int# -> State# s -> (#State# s, CUInt#) # writeOffAddr# :: Addr# -> Int# -> CUInt -> State# s -> State# s # setOffAddr# :: Addr# -> Int# -> Int# -> CUInt -> State# s -> State# s #
Prim CLong
Instance details Defined in Data.Primitive.Types Methods sizeOf# :: CLong -> Int# # alignment# :: CLong -> Int# # indexByteArray# :: ByteArray# -> Int# -> CLong # readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (#State# s, CLong#) # writeByteArray# :: MutableByteArray# s -> Int# -> CLong -> State# s -> State# s # setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CLong -> State# s -> State# s # indexOffAddr# :: Addr# -> Int# -> CLong # readOffAddr# :: Addr# -> Int# -> State# s -> (#State# s, CLong#) # writeOffAddr# :: Addr# -> Int# -> CLong -> State# s -> State# s # setOffAddr# :: Addr# -> Int# -> Int# -> CLong -> State# s -> State# s #
Prim CULong
Instance details Defined in Data.Primitive.Types Methods sizeOf# :: CULong -> Int# # alignment# :: CULong -> Int# # indexByteArray# :: ByteArray# -> Int# -> CULong # readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (#State# s, CULong#) # writeByteArray# :: MutableByteArray# s -> Int# -> CULong -> State# s -> State# s # setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CULong -> State# s -> State# s # indexOffAddr# :: Addr# -> Int# -> CULong # readOffAddr# :: Addr# -> Int# -> State# s -> (#State# s, CULong#) # writeOffAddr# :: Addr# -> Int# -> CULong -> State# s -> State# s # setOffAddr# :: Addr# -> Int# -> Int# -> CULong -> State# s -> State# s #
Prim CLLong
Instance details Defined in Data.Primitive.Types Methods sizeOf# :: CLLong -> Int# # alignment# :: CLLong -> Int# # indexByteArray# :: ByteArray# -> Int# -> CLLong # readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (#State# s, CLLong#) # writeByteArray# :: MutableByteArray# s -> Int# -> CLLong -> State# s -> State# s # setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CLLong -> State# s -> State# s # indexOffAddr# :: Addr# -> Int# -> CLLong # readOffAddr# :: Addr# -> Int# -> State# s -> (#State# s, CLLong#) # writeOffAddr# :: Addr# -> Int# -> CLLong -> State# s -> State# s # setOffAddr# :: Addr# -> Int# -> Int# -> CLLong -> State# s -> State# s #
Prim CULLong
Instance details Defined in Data.Primitive.Types Methods sizeOf# :: CULLong -> Int# # alignment# :: CULLong -> Int# # indexByteArray# :: ByteArray# -> Int# -> CULLong # readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (#State# s, CULLong#) # writeByteArray# :: MutableByteArray# s -> Int# -> CULLong -> State# s -> State# s # setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CULLong -> State# s -> State# s # indexOffAddr# :: Addr# -> Int# -> CULLong # readOffAddr# :: Addr# -> Int# -> State# s -> (#State# s, CULLong#) # writeOffAddr# :: Addr# -> Int# -> CULLong -> State# s -> State# s # setOffAddr# :: Addr# -> Int# -> Int# -> CULLong -> State# s -> State# s #
Prim CBool
Instance details Defined in Data.Primitive.Types Methods sizeOf# :: CBool -> Int# # alignment# :: CBool -> Int# # indexByteArray# :: ByteArray# -> Int# -> CBool # readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (#State# s, CBool#) # writeByteArray# :: MutableByteArray# s -> Int# -> CBool -> State# s -> State# s # setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CBool -> State# s -> State# s # indexOffAddr# :: Addr# -> Int# -> CBool # readOffAddr# :: Addr# -> Int# -> State# s -> (#State# s, CBool#) # writeOffAddr# :: Addr# -> Int# -> CBool -> State# s -> State# s # setOffAddr# :: Addr# -> Int# -> Int# -> CBool -> State# s -> State# s #
Prim CFloat
Instance details Defined in Data.Primitive.Types Methods sizeOf# :: CFloat -> Int# # alignment# :: CFloat -> Int# # indexByteArray# :: ByteArray# -> Int# -> CFloat # readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (#State# s, CFloat#) # writeByteArray# :: MutableByteArray# s -> Int# -> CFloat -> State# s -> State# s # setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CFloat -> State# s -> State# s # indexOffAddr# :: Addr# -> Int# -> CFloat # readOffAddr# :: Addr# -> Int# -> State# s -> (#State# s, CFloat#) # writeOffAddr# :: Addr# -> Int# -> CFloat -> State# s -> State# s # setOffAddr# :: Addr# -> Int# -> Int# -> CFloat -> State# s -> State# s #
Prim CDouble
Instance details Defined in Data.Primitive.Types Methods sizeOf# :: CDouble -> Int# # alignment# :: CDouble -> Int# # indexByteArray# :: ByteArray# -> Int# -> CDouble # readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (#State# s, CDouble#) # writeByteArray# :: MutableByteArray# s -> Int# -> CDouble -> State# s -> State# s # setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CDouble -> State# s -> State# s # indexOffAddr# :: Addr# -> Int# -> CDouble # readOffAddr# :: Addr# -> Int# -> State# s -> (#State# s, CDouble#) # writeOffAddr# :: Addr# -> Int# -> CDouble -> State# s -> State# s # setOffAddr# :: Addr# -> Int# -> Int# -> CDouble -> State# s -> State# s #
Prim CPtrdiff
Instance details Defined in Data.Primitive.Types Methods sizeOf# :: CPtrdiff -> Int# # alignment# :: CPtrdiff -> Int# # indexByteArray# :: ByteArray# -> Int# -> CPtrdiff # readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (#State# s, CPtrdiff#) # writeByteArray# :: MutableByteArray# s -> Int# -> CPtrdiff -> State# s -> State# s # setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CPtrdiff -> State# s -> State# s # indexOffAddr# :: Addr# -> Int# -> CPtrdiff # readOffAddr# :: Addr# -> Int# -> State# s -> (#State# s, CPtrdiff#) # writeOffAddr# :: Addr# -> Int# -> CPtrdiff -> State# s -> State# s # setOffAddr# :: Addr# -> Int# -> Int# -> CPtrdiff -> State# s -> State# s #
Prim CSize
Instance details Defined in Data.Primitive.Types Methods sizeOf# :: CSize -> Int# # alignment# :: CSize -> Int# # indexByteArray# :: ByteArray# -> Int# -> CSize # readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (#State# s, CSize#) # writeByteArray# :: MutableByteArray# s -> Int# -> CSize -> State# s -> State# s # setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CSize -> State# s -> State# s # indexOffAddr# :: Addr# -> Int# -> CSize # readOffAddr# :: Addr# -> Int# -> State# s -> (#State# s, CSize#) # writeOffAddr# :: Addr# -> Int# -> CSize -> State# s -> State# s # setOffAddr# :: Addr# -> Int# -> Int# -> CSize -> State# s -> State# s #
Prim CWchar
Instance details Defined in Data.Primitive.Types Methods sizeOf# :: CWchar -> Int# # alignment# :: CWchar -> Int# # indexByteArray# :: ByteArray# -> Int# -> CWchar # readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (#State# s, CWchar#) # writeByteArray# :: MutableByteArray# s -> Int# -> CWchar -> State# s -> State# s # setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CWchar -> State# s -> State# s # indexOffAddr# :: Addr# -> Int# -> CWchar # readOffAddr# :: Addr# -> Int# -> State# s -> (#State# s, CWchar#) # writeOffAddr# :: Addr# -> Int# -> CWchar -> State# s -> State# s # setOffAddr# :: Addr# -> Int# -> Int# -> CWchar -> State# s -> State# s #
Prim CSigAtomic
Instance details Defined in Data.Primitive.Types Methods sizeOf# :: CSigAtomic -> Int# # alignment# :: CSigAtomic -> Int# # indexByteArray# :: ByteArray# -> Int# -> CSigAtomic # readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (#State# s, CSigAtomic#) # writeByteArray# :: MutableByteArray# s -> Int# -> CSigAtomic -> State# s -> State# s # setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CSigAtomic -> State# s -> State# s # indexOffAddr# :: Addr# -> Int# -> CSigAtomic # readOffAddr# :: Addr# -> Int# -> State# s -> (#State# s, CSigAtomic#) # writeOffAddr# :: Addr# -> Int# -> CSigAtomic -> State# s -> State# s # setOffAddr# :: Addr# -> Int# -> Int# -> CSigAtomic -> State# s -> State# s #
Prim CClock
Instance details Defined in Data.Primitive.Types Methods sizeOf# :: CClock -> Int# # alignment# :: CClock -> Int# # indexByteArray# :: ByteArray# -> Int# -> CClock # readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (#State# s, CClock#) # writeByteArray# :: MutableByteArray# s -> Int# -> CClock -> State# s -> State# s # setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CClock -> State# s -> State# s # indexOffAddr# :: Addr# -> Int# -> CClock # readOffAddr# :: Addr# -> Int# -> State# s -> (#State# s, CClock#) # writeOffAddr# :: Addr# -> Int# -> CClock -> State# s -> State# s # setOffAddr# :: Addr# -> Int# -> Int# -> CClock -> State# s -> State# s #
Prim CTime
Instance details Defined in Data.Primitive.Types Methods sizeOf# :: CTime -> Int# # alignment# :: CTime -> Int# # indexByteArray# :: ByteArray# -> Int# -> CTime # readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (#State# s, CTime#) # writeByteArray# :: MutableByteArray# s -> Int# -> CTime -> State# s -> State# s # setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CTime -> State# s -> State# s # indexOffAddr# :: Addr# -> Int# -> CTime # readOffAddr# :: Addr# -> Int# -> State# s -> (#State# s, CTime#) # writeOffAddr# :: Addr# -> Int# -> CTime -> State# s -> State# s # setOffAddr# :: Addr# -> Int# -> Int# -> CTime -> State# s -> State# s #
Prim CUSeconds
Instance details Defined in Data.Primitive.Types Methods sizeOf# :: CUSeconds -> Int# # alignment# :: CUSeconds -> Int# # indexByteArray# :: ByteArray# -> Int# -> CUSeconds # readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (#State# s, CUSeconds#) # writeByteArray# :: MutableByteArray# s -> Int# -> CUSeconds -> State# s -> State# s # setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CUSeconds -> State# s -> State# s # indexOffAddr# :: Addr# -> Int# -> CUSeconds # readOffAddr# :: Addr# -> Int# -> State# s -> (#State# s, CUSeconds#) # writeOffAddr# :: Addr# -> Int# -> CUSeconds -> State# s -> State# s # setOffAddr# :: Addr# -> Int# -> Int# -> CUSeconds -> State# s -> State# s #
Prim CSUSeconds
Instance details Defined in Data.Primitive.Types Methods sizeOf# :: CSUSeconds -> Int# # alignment# :: CSUSeconds -> Int# # indexByteArray# :: ByteArray# -> Int# -> CSUSeconds # readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (#State# s, CSUSeconds#) # writeByteArray# :: MutableByteArray# s -> Int# -> CSUSeconds -> State# s -> State# s # setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CSUSeconds -> State# s -> State# s # indexOffAddr# :: Addr# -> Int# -> CSUSeconds # readOffAddr# :: Addr# -> Int# -> State# s -> (#State# s, CSUSeconds#) # writeOffAddr# :: Addr# -> Int# -> CSUSeconds -> State# s -> State# s # setOffAddr# :: Addr# -> Int# -> Int# -> CSUSeconds -> State# s -> State# s #
Prim CIntPtr
Instance details Defined in Data.Primitive.Types Methods sizeOf# :: CIntPtr -> Int# # alignment# :: CIntPtr -> Int# # indexByteArray# :: ByteArray# -> Int# -> CIntPtr # readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (#State# s, CIntPtr#) # writeByteArray# :: MutableByteArray# s -> Int# -> CIntPtr -> State# s -> State# s # setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CIntPtr -> State# s -> State# s # indexOffAddr# :: Addr# -> Int# -> CIntPtr # readOffAddr# :: Addr# -> Int# -> State# s -> (#State# s, CIntPtr#) # writeOffAddr# :: Addr# -> Int# -> CIntPtr -> State# s -> State# s # setOffAddr# :: Addr# -> Int# -> Int# -> CIntPtr -> State# s -> State# s #
Prim CUIntPtr
Instance details Defined in Data.Primitive.Types Methods sizeOf# :: CUIntPtr -> Int# # alignment# :: CUIntPtr -> Int# # indexByteArray# :: ByteArray# -> Int# -> CUIntPtr # readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (#State# s, CUIntPtr#) # writeByteArray# :: MutableByteArray# s -> Int# -> CUIntPtr -> State# s -> State# s # setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CUIntPtr -> State# s -> State# s # indexOffAddr# :: Addr# -> Int# -> CUIntPtr # readOffAddr# :: Addr# -> Int# -> State# s -> (#State# s, CUIntPtr#) # writeOffAddr# :: Addr# -> Int# -> CUIntPtr -> State# s -> State# s # setOffAddr# :: Addr# -> Int# -> Int# -> CUIntPtr -> State# s -> State# s #
Prim CIntMax
Instance details Defined in Data.Primitive.Types Methods sizeOf# :: CIntMax -> Int# # alignment# :: CIntMax -> Int# # indexByteArray# :: ByteArray# -> Int# -> CIntMax # readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (#State# s, CIntMax#) # writeByteArray# :: MutableByteArray# s -> Int# -> CIntMax -> State# s -> State# s # setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CIntMax -> State# s -> State# s # indexOffAddr# :: Addr# -> Int# -> CIntMax # readOffAddr# :: Addr# -> Int# -> State# s -> (#State# s, CIntMax#) # writeOffAddr# :: Addr# -> Int# -> CIntMax -> State# s -> State# s # setOffAddr# :: Addr# -> Int# -> Int# -> CIntMax -> State# s -> State# s #
Prim CUIntMax
Instance details Defined in Data.Primitive.Types Methods sizeOf# :: CUIntMax -> Int# # alignment# :: CUIntMax -> Int# # indexByteArray# :: ByteArray# -> Int# -> CUIntMax # readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (#State# s, CUIntMax#) # writeByteArray# :: MutableByteArray# s -> Int# -> CUIntMax -> State# s -> State# s # setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CUIntMax -> State# s -> State# s # indexOffAddr# :: Addr# -> Int# -> CUIntMax # readOffAddr# :: Addr# -> Int# -> State# s -> (#State# s, CUIntMax#) # writeOffAddr# :: Addr# -> Int# -> CUIntMax -> State# s -> State# s # setOffAddr# :: Addr# -> Int# -> Int# -> CUIntMax -> State# s -> State# s #
Prim Addr
Instance details Defined in Data.Primitive.Types Methods sizeOf# :: Addr -> Int# # alignment# :: Addr -> Int# # indexByteArray# :: ByteArray# -> Int# -> Addr # readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (#State# s, Addr#) # writeByteArray# :: MutableByteArray# s -> Int# -> Addr -> State# s -> State# s # setByteArray# :: MutableByteArray# s -> Int# -> Int# -> Addr -> State# s -> State# s # indexOffAddr# :: Addr# -> Int# -> Addr # readOffAddr# :: Addr# -> Int# -> State# s -> (#State# s, Addr#) # writeOffAddr# :: Addr# -> Int# -> Addr -> State# s -> State# s # setOffAddr# :: Addr# -> Int# -> Int# -> Addr -> State# s -> State# s #
Prim (Ptr a)
Instance details Defined in Data.Primitive.Types Methods sizeOf# :: Ptr a -> Int# # alignment# :: Ptr a -> Int# # indexByteArray# :: ByteArray# -> Int# -> Ptr a # readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (#State# s, Ptr a#) # writeByteArray# :: MutableByteArray# s -> Int# -> Ptr a -> State# s -> State# s # setByteArray# :: MutableByteArray# s -> Int# -> Int# -> Ptr a -> State# s -> State# s # indexOffAddr# :: Addr# -> Int# -> Ptr a # readOffAddr# :: Addr# -> Int# -> State# s -> (#State# s, Ptr a#) # writeOffAddr# :: Addr# -> Int# -> Ptr a -> State# s -> State# s # setOffAddr# :: Addr# -> Int# -> Int# -> Ptr a -> State# s -> State# s #
Prim (FunPtr a)
Instance details Defined in Data.Primitive.Types Methods sizeOf# :: FunPtr a -> Int# # alignment# :: FunPtr a -> Int# # indexByteArray# :: ByteArray# -> Int# -> FunPtr a # readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (#State# s, FunPtr a#) # writeByteArray# :: MutableByteArray# s -> Int# -> FunPtr a -> State# s -> State# s # setByteArray# :: MutableByteArray# s -> Int# -> Int# -> FunPtr a -> State# s -> State# s # indexOffAddr# :: Addr# -> Int# -> FunPtr a # readOffAddr# :: Addr# -> Int# -> State# s -> (#State# s, FunPtr a#) # writeOffAddr# :: Addr# -> Int# -> FunPtr a -> State# s -> State# s # setOffAddr# :: Addr# -> Int# -> Int# -> FunPtr a -> State# s -> State# s #

data MutVar s a #

A MutVar behaves like a single-element mutable array associated with a primitive state token.

Constructors

MutVar (MutVar# s a)

Instances

Eq (MutVar s a)
Instance details Defined in Data.Primitive.MutVar Methods (==) :: MutVar s a -> MutVar s a -> Bool # (/=) :: MutVar s a -> MutVar s a -> Bool #
IsSequence a => MutablePushBack (MutVar s a)
Instance details Defined in Data.Mutable.Class Methods pushBack :: (PrimMonad m, PrimState m ~ MCState (MutVar s a)) => MutVar s a -> CollElement (MutVar s a) -> m () #
IsSequence a => MutablePopBack (MutVar s a)
Instance details Defined in Data.Mutable.Class Methods popBack :: (PrimMonad m, PrimState m ~ MCState (MutVar s a)) => MutVar s a -> m (Maybe (CollElement (MutVar s a))) #
IsSequence a => MutablePushFront (MutVar s a)
Instance details Defined in Data.Mutable.Class Methods pushFront :: (PrimMonad m, PrimState m ~ MCState (MutVar s a)) => MutVar s a -> CollElement (MutVar s a) -> m () #
IsSequence a => MutablePopFront (MutVar s a)
Instance details Defined in Data.Mutable.Class Methods popFront :: (PrimMonad m, PrimState m ~ MCState (MutVar s a)) => MutVar s a -> m (Maybe (CollElement (MutVar s a))) #
Monoid w => MutableCollection (MutVar s w)
Instance details Defined in Data.Mutable.Class Associated Types type CollElement (MutVar s w) :: Type # Methods newColl :: (PrimMonad m, PrimState m ~ MCState (MutVar s w)) => m (MutVar s w) #
MutableAtomicRef (MutVar s a)
Instance details 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 #
MutableRef (MutVar s a)
Instance details Defined in Data.Mutable.Class Associated Types type RefElement (MutVar s a) :: Type # Methods newRef :: (PrimMonad m, PrimState m ~ MCState (MutVar s a)) => RefElement (MutVar s a) -> m (MutVar s a) # readRef :: (PrimMonad m, PrimState m ~ MCState (MutVar s a)) => MutVar s a -> m (RefElement (MutVar s a)) # writeRef :: (PrimMonad m, PrimState m ~ MCState (MutVar s a)) => MutVar s a -> RefElement (MutVar s a) -> m () # modifyRef :: (PrimMonad m, PrimState m ~ MCState (MutVar s a)) => MutVar s a -> (RefElement (MutVar s a) -> RefElement (MutVar s a)) -> m () # modifyRef' :: (PrimMonad m, PrimState m ~ MCState (MutVar s a)) => MutVar s a -> (RefElement (MutVar s a) -> RefElement (MutVar s a)) -> m () #
MutableContainer (MutVar s a)
Instance details Defined in Data.Mutable.Class Associated Types type MCState (MutVar s a) :: Type #
PrimUnlifted (MutVar s a)
Instance details Defined in Data.Primitive.UnliftedArray Methods toArrayArray# :: MutVar s a -> ArrayArray# # fromArrayArray# :: ArrayArray# -> MutVar s a #
type CollElement (MutVar s w)
Instance details Defined in Data.Mutable.Class type CollElement (MutVar s w) = Element w
type RefElement (MutVar s a)
Instance details Defined in Data.Mutable.Class type RefElement (MutVar s a) = a
type MCState (MutVar s a)
Instance details Defined in Data.Mutable.Class type MCState (MutVar s a) = s

class Monad m => PrimMonad (m :: Type -> Type) #

Class of monads which can perform primitive state-transformer actions

Minimal complete definition

primitive

Associated Types

type PrimState (m :: Type -> Type) :: Type #

State token type

Instances

PrimMonad IO
Instance details Defined in Control.Monad.Primitive Associated Types type PrimState IO :: Type # Methods primitive :: (State# (PrimState IO) -> (#State# (PrimState IO), a#)) -> IO a #
PrimMonad (ST s)
Instance details Defined in Control.Monad.Primitive Associated Types type PrimState (ST s) :: Type # Methods primitive :: (State# (PrimState (ST s)) -> (#State# (PrimState (ST s)), a#)) -> ST s a #
PrimMonad m => PrimMonad (MaybeT m)
Instance details Defined in Control.Monad.Primitive Associated Types type PrimState (MaybeT m) :: Type # Methods primitive :: (State# (PrimState (MaybeT m)) -> (#State# (PrimState (MaybeT m)), a#)) -> MaybeT m a #
PrimMonad m => PrimMonad (ResourceT m)
Instance details Defined in Control.Monad.Trans.Resource.Internal Associated Types type PrimState (ResourceT m) :: Type # Methods primitive :: (State# (PrimState (ResourceT m)) -> (#State# (PrimState (ResourceT m)), a#)) -> ResourceT m a #
PrimMonad m => PrimMonad (ListT m)
Instance details Defined in Control.Monad.Primitive Associated Types type PrimState (ListT m) :: Type # Methods primitive :: (State# (PrimState (ListT m)) -> (#State# (PrimState (ListT m)), a#)) -> ListT m a #
PrimMonad m => PrimMonad (ReaderT r m)
Instance details Defined in Control.Monad.Primitive Associated Types type PrimState (ReaderT r m) :: Type # Methods primitive :: (State# (PrimState (ReaderT r m)) -> (#State# (PrimState (ReaderT r m)), a#)) -> ReaderT r m a #
PrimMonad m => PrimMonad (IdentityT m)
Instance details Defined in Control.Monad.Primitive Associated Types type PrimState (IdentityT m) :: Type # Methods primitive :: (State# (PrimState (IdentityT m)) -> (#State# (PrimState (IdentityT m)), a#)) -> IdentityT m a #
(Monoid w, PrimMonad m) => PrimMonad (WriterT w m)
Instance details Defined in Control.Monad.Primitive Associated Types type PrimState (WriterT w m) :: Type # Methods primitive :: (State# (PrimState (WriterT w m)) -> (#State# (PrimState (WriterT w m)), a#)) -> WriterT w m a #
(Monoid w, PrimMonad m) => PrimMonad (WriterT w m)
Instance details Defined in Control.Monad.Primitive Associated Types type PrimState (WriterT w m) :: Type # Methods primitive :: (State# (PrimState (WriterT w m)) -> (#State# (PrimState (WriterT w m)), a#)) -> WriterT w m a #
PrimMonad m => PrimMonad (StateT s m)
Instance details Defined in Control.Monad.Primitive Associated Types type PrimState (StateT s m) :: Type # Methods primitive :: (State# (PrimState (StateT s m)) -> (#State# (PrimState (StateT s m)), a#)) -> StateT s m a #
PrimMonad m => PrimMonad (StateT s m)
Instance details Defined in Control.Monad.Primitive Associated Types type PrimState (StateT s m) :: Type # Methods primitive :: (State# (PrimState (StateT s m)) -> (#State# (PrimState (StateT s m)), a#)) -> StateT s m a #
PrimMonad m => PrimMonad (ExceptT e m)
Instance details Defined in Control.Monad.Primitive Associated Types type PrimState (ExceptT e m) :: Type # Methods primitive :: (State# (PrimState (ExceptT e m)) -> (#State# (PrimState (ExceptT e m)), a#)) -> ExceptT e m a #
(Error e, PrimMonad m) => PrimMonad (ErrorT e m)
Instance details Defined in Control.Monad.Primitive Associated Types type PrimState (ErrorT e m) :: Type # Methods primitive :: (State# (PrimState (ErrorT e m)) -> (#State# (PrimState (ErrorT e m)), a#)) -> ErrorT e m a #
(Monoid w, PrimMonad m) => PrimMonad (AccumT w m)	Since: primitive-0.6.3.0
Instance details Defined in Control.Monad.Primitive Associated Types type PrimState (AccumT w m) :: Type # Methods primitive :: (State# (PrimState (AccumT w m)) -> (#State# (PrimState (AccumT w m)), a#)) -> AccumT w m a #
PrimMonad m => PrimMonad (SelectT r m)
Instance details Defined in Control.Monad.Primitive Associated Types type PrimState (SelectT r m) :: Type # Methods primitive :: (State# (PrimState (SelectT r m)) -> (#State# (PrimState (SelectT r m)), a#)) -> SelectT r m a #
PrimMonad m => PrimMonad (ConduitT i o m)
Instance details Defined in Data.Conduit.Internal.Conduit Associated Types type PrimState (ConduitT i o m) :: Type # Methods primitive :: (State# (PrimState (ConduitT i o m)) -> (#State# (PrimState (ConduitT i o m)), a#)) -> ConduitT i o m a #
PrimMonad m => PrimMonad (ContT r m)	Since: primitive-0.6.3.0
Instance details Defined in Control.Monad.Primitive Associated Types type PrimState (ContT r m) :: Type # Methods primitive :: (State# (PrimState (ContT r m)) -> (#State# (PrimState (ContT r m)), a#)) -> ContT r m a #
(Monoid w, PrimMonad m) => PrimMonad (RWST r w s m)
Instance details Defined in Control.Monad.Primitive Associated Types type PrimState (RWST r w s m) :: Type # Methods primitive :: (State# (PrimState (RWST r w s m)) -> (#State# (PrimState (RWST r w s m)), a#)) -> RWST r w s m a #
(Monoid w, PrimMonad m) => PrimMonad (RWST r w s m)
Instance details Defined in Control.Monad.Primitive Associated Types type PrimState (RWST r w s m) :: Type # Methods primitive :: (State# (PrimState (RWST r w s m)) -> (#State# (PrimState (RWST r w s m)), a#)) -> RWST r w s m a #
PrimMonad m => PrimMonad (Pipe l i o u m)
Instance details Defined in Data.Conduit.Internal.Pipe Associated Types type PrimState (Pipe l i o u m) :: Type # Methods primitive :: (State# (PrimState (Pipe l i o u m)) -> (#State# (PrimState (Pipe l i o u m)), a#)) -> Pipe l i o u m a #

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)
Instance details Defined in Data.Mutable.Class Methods pushBack :: (PrimMonad m, PrimState m ~ MCState (IORef a)) => IORef a -> CollElement (IORef a) -> m () #
IsSequence a => MutablePushBack (STRef s a)
Instance details Defined in Data.Mutable.Class Methods pushBack :: (PrimMonad m, PrimState m ~ MCState (STRef s a)) => STRef s a -> CollElement (STRef s a) -> m () #
IsSequence a => MutablePushBack (MutVar s a)
Instance details Defined in Data.Mutable.Class Methods pushBack :: (PrimMonad m, PrimState m ~ MCState (MutVar s a)) => MutVar s a -> CollElement (MutVar s a) -> m () #
IsSequence seq => MutablePushBack (BRef s seq)
Instance details Defined in Data.Mutable.BRef Methods pushBack :: (PrimMonad m, PrimState m ~ MCState (BRef s seq)) => BRef s seq -> CollElement (BRef s seq) -> m () #
MutablePushBack (DLList s a)
Instance details Defined in Data.Mutable.DLList Methods pushBack :: (PrimMonad m, PrimState m ~ MCState (DLList s a)) => DLList s a -> CollElement (DLList s a) -> m () #
MVector v a => MutablePushBack (Deque v s a)
Instance details Defined in Data.Mutable.Deque Methods pushBack :: (PrimMonad m, PrimState m ~ MCState (Deque v s a)) => Deque v s a -> CollElement (Deque v s a) -> m () #

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)
Instance details Defined in Data.Mutable.Class Methods popBack :: (PrimMonad m, PrimState m ~ MCState (IORef a)) => IORef a -> m (Maybe (CollElement (IORef a))) #
IsSequence a => MutablePopBack (STRef s a)
Instance details Defined in Data.Mutable.Class Methods popBack :: (PrimMonad m, PrimState m ~ MCState (STRef s a)) => STRef s a -> m (Maybe (CollElement (STRef s a))) #
IsSequence a => MutablePopBack (MutVar s a)
Instance details Defined in Data.Mutable.Class Methods popBack :: (PrimMonad m, PrimState m ~ MCState (MutVar s a)) => MutVar s a -> m (Maybe (CollElement (MutVar s a))) #
IsSequence seq => MutablePopBack (BRef s seq)
Instance details Defined in Data.Mutable.BRef Methods popBack :: (PrimMonad m, PrimState m ~ MCState (BRef s seq)) => BRef s seq -> m (Maybe (CollElement (BRef s seq))) #
MutablePopBack (DLList s a)
Instance details Defined in Data.Mutable.DLList Methods popBack :: (PrimMonad m, PrimState m ~ MCState (DLList s a)) => DLList s a -> m (Maybe (CollElement (DLList s a))) #
MVector v a => MutablePopBack (Deque v s a)
Instance details Defined in Data.Mutable.Deque Methods popBack :: (PrimMonad m, PrimState m ~ MCState (Deque v s a)) => Deque v s a -> m (Maybe (CollElement (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)
Instance details Defined in Data.Mutable.Class Methods pushFront :: (PrimMonad m, PrimState m ~ MCState (IORef a)) => IORef a -> CollElement (IORef a) -> m () #
IsSequence a => MutablePushFront (STRef s a)
Instance details Defined in Data.Mutable.Class Methods pushFront :: (PrimMonad m, PrimState m ~ MCState (STRef s a)) => STRef s a -> CollElement (STRef s a) -> m () #
IsSequence a => MutablePushFront (MutVar s a)
Instance details Defined in Data.Mutable.Class Methods pushFront :: (PrimMonad m, PrimState m ~ MCState (MutVar s a)) => MutVar s a -> CollElement (MutVar s a) -> m () #
IsSequence seq => MutablePushFront (BRef s seq)
Instance details Defined in Data.Mutable.BRef Methods pushFront :: (PrimMonad m, PrimState m ~ MCState (BRef s seq)) => BRef s seq -> CollElement (BRef s seq) -> m () #
MutablePushFront (DLList s a)
Instance details Defined in Data.Mutable.DLList Methods pushFront :: (PrimMonad m, PrimState m ~ MCState (DLList s a)) => DLList s a -> CollElement (DLList s a) -> m () #
MVector v a => MutablePushFront (Deque v s a)
Instance details Defined in Data.Mutable.Deque Methods pushFront :: (PrimMonad m, PrimState m ~ MCState (Deque v s a)) => Deque v s a -> CollElement (Deque v s a) -> m () #

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)
Instance details Defined in Data.Mutable.Class Methods popFront :: (PrimMonad m, PrimState m ~ MCState (IORef a)) => IORef a -> m (Maybe (CollElement (IORef a))) #
IsSequence a => MutablePopFront (STRef s a)
Instance details Defined in Data.Mutable.Class Methods popFront :: (PrimMonad m, PrimState m ~ MCState (STRef s a)) => STRef s a -> m (Maybe (CollElement (STRef s a))) #
IsSequence a => MutablePopFront (MutVar s a)
Instance details Defined in Data.Mutable.Class Methods popFront :: (PrimMonad m, PrimState m ~ MCState (MutVar s a)) => MutVar s a -> m (Maybe (CollElement (MutVar s a))) #
IsSequence seq => MutablePopFront (BRef s seq)
Instance details Defined in Data.Mutable.BRef Methods popFront :: (PrimMonad m, PrimState m ~ MCState (BRef s seq)) => BRef s seq -> m (Maybe (CollElement (BRef s seq))) #
MutablePopFront (DLList s a)
Instance details Defined in Data.Mutable.DLList Methods popFront :: (PrimMonad m, PrimState m ~ MCState (DLList s a)) => DLList s a -> m (Maybe (CollElement (DLList s a))) #
MVector v a => MutablePopFront (Deque v s a)
Instance details Defined in Data.Mutable.Deque Methods popFront :: (PrimMonad m, PrimState m ~ MCState (Deque v s a)) => Deque v s a -> m (Maybe (CollElement (Deque v s a))) #

class MutableContainer c => MutableCollection c where #

Containers which contain 0 or more values.

Since 0.2.0

Associated Types

type CollElement c :: Type #

The type of each value in the collection.

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)
Instance details Defined in Data.Mutable.Class Associated Types type CollElement (IORef w) :: Type # Methods newColl :: (PrimMonad m, PrimState m ~ MCState (IORef w)) => m (IORef w) #
Monoid w => MutableCollection (STRef s w)
Instance details Defined in Data.Mutable.Class Associated Types type CollElement (STRef s w) :: Type # Methods newColl :: (PrimMonad m, PrimState m ~ MCState (STRef s w)) => m (STRef s w) #
Monoid w => MutableCollection (MutVar s w)
Instance details Defined in Data.Mutable.Class Associated Types type CollElement (MutVar s w) :: Type # Methods newColl :: (PrimMonad m, PrimState m ~ MCState (MutVar s w)) => m (MutVar s w) #
Monoid w => MutableCollection (BRef s w)
Instance details Defined in Data.Mutable.BRef Associated Types type CollElement (BRef s w) :: Type # Methods newColl :: (PrimMonad m, PrimState m ~ MCState (BRef s w)) => m (BRef s w) #
MutableCollection (DLList s a)
Instance details Defined in Data.Mutable.DLList Associated Types type CollElement (DLList s a) :: Type # Methods newColl :: (PrimMonad m, PrimState m ~ MCState (DLList s a)) => m (DLList s a) #
MVector v a => MutableCollection (Deque v s a)
Instance details Defined in Data.Mutable.Deque Associated Types type CollElement (Deque v s a) :: Type # Methods newColl :: (PrimMonad m, PrimState m ~ MCState (Deque v s a)) => m (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)
Instance details 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)
Instance details 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

MutableRef (IORef a)
Instance details Defined in Data.Mutable.Class Associated Types type RefElement (IORef a) :: Type # Methods newRef :: (PrimMonad m, PrimState m ~ MCState (IORef a)) => RefElement (IORef a) -> m (IORef a) # readRef :: (PrimMonad m, PrimState m ~ MCState (IORef a)) => IORef a -> m (RefElement (IORef a)) # writeRef :: (PrimMonad m, PrimState m ~ MCState (IORef a)) => IORef a -> RefElement (IORef a) -> m () # modifyRef :: (PrimMonad m, PrimState m ~ MCState (IORef a)) => IORef a -> (RefElement (IORef a) -> RefElement (IORef a)) -> m () # modifyRef' :: (PrimMonad m, PrimState m ~ MCState (IORef a)) => IORef a -> (RefElement (IORef a) -> RefElement (IORef a)) -> m () #
MutableRef (STRef s a)
Instance details Defined in Data.Mutable.Class Associated Types type RefElement (STRef s a) :: Type # Methods newRef :: (PrimMonad m, PrimState m ~ MCState (STRef s a)) => RefElement (STRef s a) -> m (STRef s a) # readRef :: (PrimMonad m, PrimState m ~ MCState (STRef s a)) => STRef s a -> m (RefElement (STRef s a)) # writeRef :: (PrimMonad m, PrimState m ~ MCState (STRef s a)) => STRef s a -> RefElement (STRef s a) -> m () # modifyRef :: (PrimMonad m, PrimState m ~ MCState (STRef s a)) => STRef s a -> (RefElement (STRef s a) -> RefElement (STRef s a)) -> m () # modifyRef' :: (PrimMonad m, PrimState m ~ MCState (STRef s a)) => STRef s a -> (RefElement (STRef s a) -> RefElement (STRef s a)) -> m () #
MutableRef (MutVar s a)
Instance details Defined in Data.Mutable.Class Associated Types type RefElement (MutVar s a) :: Type # Methods newRef :: (PrimMonad m, PrimState m ~ MCState (MutVar s a)) => RefElement (MutVar s a) -> m (MutVar s a) # readRef :: (PrimMonad m, PrimState m ~ MCState (MutVar s a)) => MutVar s a -> m (RefElement (MutVar s a)) # writeRef :: (PrimMonad m, PrimState m ~ MCState (MutVar s a)) => MutVar s a -> RefElement (MutVar s a) -> m () # modifyRef :: (PrimMonad m, PrimState m ~ MCState (MutVar s a)) => MutVar s a -> (RefElement (MutVar s a) -> RefElement (MutVar s a)) -> m () # modifyRef' :: (PrimMonad m, PrimState m ~ MCState (MutVar s a)) => MutVar s a -> (RefElement (MutVar s a) -> RefElement (MutVar s a)) -> m () #
MutableRef (BRef s a)
Instance details Defined in Data.Mutable.BRef Associated Types type RefElement (BRef s a) :: Type # Methods newRef :: (PrimMonad m, PrimState m ~ MCState (BRef s a)) => RefElement (BRef s a) -> m (BRef s a) # readRef :: (PrimMonad m, PrimState m ~ MCState (BRef s a)) => BRef s a -> m (RefElement (BRef s a)) # writeRef :: (PrimMonad m, PrimState m ~ MCState (BRef s a)) => BRef s a -> RefElement (BRef s a) -> m () # modifyRef :: (PrimMonad m, PrimState m ~ MCState (BRef s a)) => BRef s a -> (RefElement (BRef s a) -> RefElement (BRef s a)) -> m () # modifyRef' :: (PrimMonad m, PrimState m ~ MCState (BRef s a)) => BRef s a -> (RefElement (BRef s a) -> RefElement (BRef s a)) -> m () #
Prim a => MutableRef (PRef s a)
Instance details 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 () #
Storable a => MutableRef (SRef s a)
Instance details 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 () #
Unbox a => MutableRef (URef s a)
Instance details 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 () #

class MutableContainer c #

The parent typeclass for all mutable containers.

Since 0.2.0

Associated Types

type MCState c :: Type #

Associated type giving the primitive state token for the given container, much like PrimState from primitive.

Since 0.2.0

Instances

MutableContainer (IORef a)
Instance details Defined in Data.Mutable.Class Associated Types type MCState (IORef a) :: Type #
MutableContainer (STRef s a)
Instance details Defined in Data.Mutable.Class Associated Types type MCState (STRef s a) :: Type #
MutableContainer (MutVar s a)
Instance details Defined in Data.Mutable.Class Associated Types type MCState (MutVar s a) :: Type #
MutableContainer (BRef s a)
Instance details Defined in Data.Mutable.BRef Associated Types type MCState (BRef s a) :: Type #
MutableContainer (DLList s a)
Instance details Defined in Data.Mutable.DLList Associated Types type MCState (DLList s a) :: Type #
MutableContainer (PRef s a)
Instance details Defined in Data.Mutable.PRef Associated Types type MCState (PRef s a) :: Type #
MutableContainer (SRef s a)
Instance details Defined in Data.Mutable.SRef Associated Types type MCState (SRef s a) :: Type #
MutableContainer (URef s a)
Instance details Defined in Data.Mutable.URef Associated Types type MCState (URef s a) :: Type #
MutableContainer (Deque v s a)
Instance details Defined in Data.Mutable.Deque Associated Types type MCState (Deque v s a) :: Type #

asIORef :: IORef a -> IORef a #

Since 0.2.0

asSTRef :: STRef s a -> STRef s a #

Since 0.2.0

asMutVar :: MutVar s a -> MutVar s a #

Since 0.2.0

type IOBRef = BRef (PrimState IO) #

A boxed IO vector reference.

data BRef s a #

A boxed vector reference, supporting any monad.

Since 0.2.0

Instances

IsSequence seq => MutablePushBack (BRef s seq)
Instance details Defined in Data.Mutable.BRef Methods pushBack :: (PrimMonad m, PrimState m ~ MCState (BRef s seq)) => BRef s seq -> CollElement (BRef s seq) -> m () #
IsSequence seq => MutablePopBack (BRef s seq)
Instance details Defined in Data.Mutable.BRef Methods popBack :: (PrimMonad m, PrimState m ~ MCState (BRef s seq)) => BRef s seq -> m (Maybe (CollElement (BRef s seq))) #
IsSequence seq => MutablePushFront (BRef s seq)
Instance details Defined in Data.Mutable.BRef Methods pushFront :: (PrimMonad m, PrimState m ~ MCState (BRef s seq)) => BRef s seq -> CollElement (BRef s seq) -> m () #
IsSequence seq => MutablePopFront (BRef s seq)
Instance details Defined in Data.Mutable.BRef Methods popFront :: (PrimMonad m, PrimState m ~ MCState (BRef s seq)) => BRef s seq -> m (Maybe (CollElement (BRef s seq))) #
Monoid w => MutableCollection (BRef s w)
Instance details Defined in Data.Mutable.BRef Associated Types type CollElement (BRef s w) :: Type # Methods newColl :: (PrimMonad m, PrimState m ~ MCState (BRef s w)) => m (BRef s w) #
MutableRef (BRef s a)
Instance details Defined in Data.Mutable.BRef Associated Types type RefElement (BRef s a) :: Type # Methods newRef :: (PrimMonad m, PrimState m ~ MCState (BRef s a)) => RefElement (BRef s a) -> m (BRef s a) # readRef :: (PrimMonad m, PrimState m ~ MCState (BRef s a)) => BRef s a -> m (RefElement (BRef s a)) # writeRef :: (PrimMonad m, PrimState m ~ MCState (BRef s a)) => BRef s a -> RefElement (BRef s a) -> m () # modifyRef :: (PrimMonad m, PrimState m ~ MCState (BRef s a)) => BRef s a -> (RefElement (BRef s a) -> RefElement (BRef s a)) -> m () # modifyRef' :: (PrimMonad m, PrimState m ~ MCState (BRef s a)) => BRef s a -> (RefElement (BRef s a) -> RefElement (BRef s a)) -> m () #
MutableContainer (BRef s a)
Instance details Defined in Data.Mutable.BRef Associated Types type MCState (BRef s a) :: Type #
type CollElement (BRef s w)
Instance details Defined in Data.Mutable.BRef type CollElement (BRef s w) = Element w
type RefElement (BRef s a)
Instance details Defined in Data.Mutable.BRef type RefElement (BRef s a) = a
type MCState (BRef s a)
Instance details Defined in Data.Mutable.BRef type MCState (BRef s a) = s

asBRef :: BRef s a -> BRef s a #

Since 0.2.0

data DLList s a #

A doubly-linked list.

Since 0.3.0

Instances

MutablePushBack (DLList s a)
Instance details Defined in Data.Mutable.DLList Methods pushBack :: (PrimMonad m, PrimState m ~ MCState (DLList s a)) => DLList s a -> CollElement (DLList s a) -> m () #
MutablePopBack (DLList s a)
Instance details Defined in Data.Mutable.DLList Methods popBack :: (PrimMonad m, PrimState m ~ MCState (DLList s a)) => DLList s a -> m (Maybe (CollElement (DLList s a))) #
MutablePushFront (DLList s a)
Instance details Defined in Data.Mutable.DLList Methods pushFront :: (PrimMonad m, PrimState m ~ MCState (DLList s a)) => DLList s a -> CollElement (DLList s a) -> m () #
MutablePopFront (DLList s a)
Instance details Defined in Data.Mutable.DLList Methods popFront :: (PrimMonad m, PrimState m ~ MCState (DLList s a)) => DLList s a -> m (Maybe (CollElement (DLList s a))) #
MutableCollection (DLList s a)
Instance details Defined in Data.Mutable.DLList Associated Types type CollElement (DLList s a) :: Type # Methods newColl :: (PrimMonad m, PrimState m ~ MCState (DLList s a)) => m (DLList s a) #
MutableContainer (DLList s a)
Instance details Defined in Data.Mutable.DLList Associated Types type MCState (DLList s a) :: Type #
type CollElement (DLList s a)
Instance details Defined in Data.Mutable.DLList type CollElement (DLList s a) = a
type MCState (DLList s a)
Instance details Defined in Data.Mutable.DLList type MCState (DLList s a) = s

asDLList :: DLList s a -> DLList s a #

Since 0.2.0

type BDeque = Deque MVector #

A Deque specialized to boxed vectors.

Since 0.2.0

type SDeque = Deque MVector #

A Deque specialized to storable vectors.

Since 0.2.0

type UDeque = Deque MVector #

A Deque specialized to unboxed vectors.

Since 0.2.0

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)
Instance details Defined in Data.Mutable.Deque Methods pushBack :: (PrimMonad m, PrimState m ~ MCState (Deque v s a)) => Deque v s a -> CollElement (Deque v s a) -> m () #
MVector v a => MutablePopBack (Deque v s a)
Instance details Defined in Data.Mutable.Deque Methods popBack :: (PrimMonad m, PrimState m ~ MCState (Deque v s a)) => Deque v s a -> m (Maybe (CollElement (Deque v s a))) #
MVector v a => MutablePushFront (Deque v s a)
Instance details Defined in Data.Mutable.Deque Methods pushFront :: (PrimMonad m, PrimState m ~ MCState (Deque v s a)) => Deque v s a -> CollElement (Deque v s a) -> m () #
MVector v a => MutablePopFront (Deque v s a)
Instance details Defined in Data.Mutable.Deque Methods popFront :: (PrimMonad m, PrimState m ~ MCState (Deque v s a)) => Deque v s a -> m (Maybe (CollElement (Deque v s a))) #
MVector v a => MutableCollection (Deque v s a)
Instance details Defined in Data.Mutable.Deque Associated Types type CollElement (Deque v s a) :: Type # Methods newColl :: (PrimMonad m, PrimState m ~ MCState (Deque v s a)) => m (Deque v s a) #
MutableContainer (Deque v s a)
Instance details Defined in Data.Mutable.Deque Associated Types type MCState (Deque v s a) :: Type #
type CollElement (Deque v s a)
Instance details Defined in Data.Mutable.Deque type CollElement (Deque v s a) = a
type MCState (Deque v s a)
Instance details Defined in Data.Mutable.Deque type MCState (Deque v s a) = s

asUDeque :: UDeque s a -> UDeque s a #

Since 0.2.0

asSDeque :: SDeque s a -> SDeque s a #

Since 0.2.0

asBDeque :: BDeque s a -> BDeque s a #

Since 0.2.0

type IOPRef = PRef (PrimState IO) #

A primitive ByteArray IO reference.

data PRef s a #

A primitive ByteArray reference, supporting any monad.

Since 0.2.0

Instances

Prim a => MutableRef (PRef s a)
Instance details 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)
Instance details Defined in Data.Mutable.PRef Associated Types type MCState (PRef s a) :: Type #
type RefElement (PRef s a)
Instance details Defined in Data.Mutable.PRef type RefElement (PRef s a) = a
type MCState (PRef s a)
Instance details Defined in Data.Mutable.PRef type MCState (PRef s a) = s

asPRef :: PRef s a -> PRef s a #

Since 0.2.0

type IOSRef = SRef (PrimState IO) #

A storable IO vector reference.

data SRef s a #

A storable vector reference, supporting any monad.

Since 0.2.0

Instances

Storable a => MutableRef (SRef s a)
Instance details 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)
Instance details Defined in Data.Mutable.SRef Associated Types type MCState (SRef s a) :: Type #
type RefElement (SRef s a)
Instance details Defined in Data.Mutable.SRef type RefElement (SRef s a) = a
type MCState (SRef s a)
Instance details Defined in Data.Mutable.SRef type MCState (SRef s a) = s

asSRef :: SRef s a -> SRef s a #

Since 0.2.0

type IOURef = URef (PrimState IO) #

An unboxed IO vector reference.

data URef s a #

An unboxed vector reference, supporting any monad.

Since 0.2.0

Instances

Unbox a => MutableRef (URef s a)
Instance details 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)
Instance details Defined in Data.Mutable.URef Associated Types type MCState (URef s a) :: Type #
type RefElement (URef s a)
Instance details Defined in Data.Mutable.URef type RefElement (URef s a) = a
type MCState (URef s a)
Instance details Defined in Data.Mutable.URef type MCState (URef s a) = s

asURef :: URef s a -> URef s a #

Since 0.2.0

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

GrowingAppend ByteString
Instance details Defined in Data.MonoTraversable
GrowingAppend ByteString
Instance details Defined in Data.MonoTraversable
GrowingAppend Text
Instance details Defined in Data.MonoTraversable
GrowingAppend Text
Instance details Defined in Data.MonoTraversable
GrowingAppend IntSet
Instance details Defined in Data.MonoTraversable
GrowingAppend [a]
Instance details Defined in Data.MonoTraversable
GrowingAppend (NonEmpty a)
Instance details Defined in Data.MonoTraversable
GrowingAppend (Vector a)
Instance details Defined in Data.MonoTraversable
(Eq v, Hashable v) => GrowingAppend (HashSet v)
Instance details Defined in Data.MonoTraversable
Ord v => GrowingAppend (Set v)
Instance details Defined in Data.MonoTraversable
GrowingAppend (Seq a)
Instance details Defined in Data.MonoTraversable
GrowingAppend (IntMap v)
Instance details Defined in Data.MonoTraversable
GrowingAppend mono => GrowingAppend (NonNull mono)
Instance details Defined in Data.NonNull
GrowingAppend (FocusList a)
Instance details Defined in Data.FocusList
Storable a => GrowingAppend (Vector a)
Instance details Defined in Data.MonoTraversable
Unbox a => GrowingAppend (Vector a)
Instance details Defined in Data.MonoTraversable
Ord k => GrowingAppend (Map k v)
Instance details Defined in Data.MonoTraversable
(Eq k, Hashable k) => GrowingAppend (HashMap k v)
Instance details Defined in Data.MonoTraversable

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:

oextend oextract      = id
oextract . oextend f  = f
oextend f . oextend g = oextend (f . oextend g)

As an intuition, oextend f uses f 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.

oextend :: (mono -> Element mono) -> mono -> mono #

Extend a mono -> Element mono function to be a mono -> mono; that is, builds a new mono from the old one by using pieces glimpsed from the given function.

Instances

IsSequence mono => MonoComonad (NonNull mono)
Instance details Defined in Data.NonNull Methods oextract :: NonNull mono -> Element (NonNull mono) # oextend :: (NonNull mono -> Element (NonNull mono)) -> NonNull mono -> NonNull mono #
MonoComonad (ViewL a)
Instance details Defined in Data.MonoTraversable Methods oextract :: ViewL a -> Element (ViewL a) # oextend :: (ViewL a -> Element (ViewL a)) -> ViewL a -> ViewL a #
MonoComonad (ViewR a)
Instance details Defined in Data.MonoTraversable Methods oextract :: ViewR a -> Element (ViewR a) # oextend :: (ViewR a -> Element (ViewR a)) -> ViewR a -> ViewR a #

class MonoPointed mono where #

Typeclass for monomorphic containers that an element can be lifted into.

For any MonoFunctor, the following law holds:

omap f . 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

MonoPointed ByteString
Instance details Defined in Data.MonoTraversable Methods opoint :: Element ByteString -> ByteString #
MonoPointed ByteString
Instance details Defined in Data.MonoTraversable Methods opoint :: Element ByteString -> ByteString #
MonoPointed Text
Instance details Defined in Data.MonoTraversable Methods opoint :: Element Text -> Text #
MonoPointed Text
Instance details Defined in Data.MonoTraversable Methods opoint :: Element Text -> Text #
MonoPointed IntSet
Instance details Defined in Data.MonoTraversable Methods opoint :: Element IntSet -> IntSet #
MonoPointed [a]
Instance details Defined in Data.MonoTraversable Methods opoint :: Element [a] -> [a] #
MonoPointed (Maybe a)
Instance details Defined in Data.MonoTraversable Methods opoint :: Element (Maybe a) -> Maybe a #
MonoPointed (IO a)
Instance details Defined in Data.MonoTraversable Methods opoint :: Element (IO a) -> IO a #
MonoPointed (Par1 a)	Since: mono-traversable-1.0.11.0
Instance details Defined in Data.MonoTraversable Methods opoint :: Element (Par1 a) -> Par1 a #
MonoPointed (Option a)
Instance details Defined in Data.MonoTraversable Methods opoint :: Element (Option a) -> Option a #
MonoPointed (ZipList a)
Instance details Defined in Data.MonoTraversable Methods opoint :: Element (ZipList a) -> ZipList a #
MonoPointed (Identity a)
Instance details Defined in Data.MonoTraversable Methods opoint :: Element (Identity a) -> Identity a #
MonoPointed (NonEmpty a)
Instance details Defined in Data.MonoTraversable Methods opoint :: Element (NonEmpty a) -> NonEmpty a #
MonoPointed (Vector a)
Instance details Defined in Data.MonoTraversable Methods opoint :: Element (Vector a) -> Vector a #
Hashable a => MonoPointed (HashSet a)
Instance details Defined in Data.MonoTraversable Methods opoint :: Element (HashSet a) -> HashSet a #
MonoPointed (Set a)
Instance details Defined in Data.MonoTraversable Methods opoint :: Element (Set a) -> Set a #
MonoPointed (Seq a)
Instance details Defined in Data.MonoTraversable Methods opoint :: Element (Seq a) -> Seq a #
MonoPointed mono => MonoPointed (NonNull mono)
Instance details Defined in Data.NonNull Methods opoint :: Element (NonNull mono) -> NonNull mono #
MonoPointed (Tree a)
Instance details Defined in Data.MonoTraversable Methods opoint :: Element (Tree a) -> Tree a #
MonoPointed (ViewL a)
Instance details Defined in Data.MonoTraversable Methods opoint :: Element (ViewL a) -> ViewL a #
MonoPointed (ViewR a)
Instance details Defined in Data.MonoTraversable Methods opoint :: Element (ViewR a) -> ViewR a #
Storable a => MonoPointed (Vector a)
Instance details Defined in Data.MonoTraversable Methods opoint :: Element (Vector a) -> Vector a #
Unbox a => MonoPointed (Vector a)
Instance details Defined in Data.MonoTraversable Methods opoint :: Element (Vector a) -> Vector a #
MonoPointed (r -> a)
Instance details Defined in Data.MonoTraversable Methods opoint :: Element (r -> a) -> r -> a #
MonoPointed (Either a b)
Instance details Defined in Data.MonoTraversable Methods opoint :: Element (Either a b) -> Either a b #
MonoPointed (U1 a)	Since: mono-traversable-1.0.11.0
Instance details Defined in Data.MonoTraversable Methods opoint :: Element (U1 a) -> U1 a #
Monoid a => MonoPointed (a, b)
Instance details Defined in Data.MonoTraversable Methods opoint :: Element (a, b) -> (a, b) #
Monad m => MonoPointed (WrappedMonad m a)
Instance details Defined in Data.MonoTraversable Methods opoint :: Element (WrappedMonad m a) -> WrappedMonad m a #
MonoPointed (Proxy a)	Since: mono-traversable-1.0.11.0
Instance details Defined in Data.MonoTraversable Methods opoint :: Element (Proxy a) -> Proxy a #
Applicative f => MonoPointed (MaybeT f a)
Instance details Defined in Data.MonoTraversable Methods opoint :: Element (MaybeT f a) -> MaybeT f a #
Applicative m => MonoPointed (ListT m a)
Instance details Defined in Data.MonoTraversable Methods opoint :: Element (ListT m a) -> ListT m a #
SingI n => MonoPointed (Vec n a) Source #
Instance details Defined in Termonad.Config.Vec Methods opoint :: Element (Vec n a) -> Vec n a #
Applicative f => MonoPointed (Rec1 f a)	Since: mono-traversable-1.0.11.0
Instance details Defined in Data.MonoTraversable Methods opoint :: Element (Rec1 f a) -> Rec1 f a #
Arrow a => MonoPointed (WrappedArrow a b c)
Instance details Defined in Data.MonoTraversable Methods opoint :: Element (WrappedArrow a b c) -> WrappedArrow a b c #
Monoid m => MonoPointed (Const m a)
Instance details Defined in Data.MonoTraversable Methods opoint :: Element (Const m a) -> Const m a #
Applicative m => MonoPointed (ReaderT r m a)
Instance details Defined in Data.MonoTraversable Methods opoint :: Element (ReaderT r m a) -> ReaderT r m a #
Applicative m => MonoPointed (IdentityT m a)
Instance details Defined in Data.MonoTraversable Methods opoint :: Element (IdentityT m a) -> IdentityT m a #
(Monoid w, Applicative m) => MonoPointed (WriterT w m a)
Instance details Defined in Data.MonoTraversable Methods opoint :: Element (WriterT w m a) -> WriterT w m a #
(Monoid w, Applicative m) => MonoPointed (WriterT w m a)
Instance details Defined in Data.MonoTraversable Methods opoint :: Element (WriterT w m a) -> WriterT w m a #
Applicative m => MonoPointed (StateT s m a)
Instance details Defined in Data.MonoTraversable Methods opoint :: Element (StateT s m a) -> StateT s m a #
Applicative m => MonoPointed (StateT s m a)
Instance details Defined in Data.MonoTraversable Methods opoint :: Element (StateT s m a) -> StateT s m a #
(Applicative f, Applicative g) => MonoPointed ((f :+: g) a)	Since: mono-traversable-1.0.11.0
Instance details Defined in Data.MonoTraversable Methods opoint :: Element ((f :+: g) a) -> (f :+: g) a #
(Applicative f, Applicative g) => MonoPointed ((f :*: g) a)	Since: mono-traversable-1.0.11.0
Instance details Defined in Data.MonoTraversable Methods opoint :: Element ((f :: g) a) -> (f :: g) a #
(Applicative f, Applicative g) => MonoPointed (Product f g a)
Instance details Defined in Data.MonoTraversable Methods opoint :: Element (Product f g a) -> Product f g a #
MonoPointed (ContT r m a)
Instance details Defined in Data.MonoTraversable Methods opoint :: Element (ContT r m a) -> ContT r m a #
Applicative f => MonoPointed (M1 i c f a)	Since: mono-traversable-1.0.11.0
Instance details Defined in Data.MonoTraversable Methods opoint :: Element (M1 i c f a) -> M1 i c f a #
(Applicative f, Applicative g) => MonoPointed ((f :.: g) a)	Since: mono-traversable-1.0.11.0
Instance details Defined in Data.MonoTraversable Methods opoint :: Element ((f :.: g) a) -> (f :.: g) a #
(Applicative f, Applicative g) => MonoPointed (Compose f g a)
Instance details Defined in Data.MonoTraversable Methods opoint :: Element (Compose f g a) -> Compose f g a #
(Monoid w, Applicative m) => MonoPointed (RWST r w s m a)
Instance details Defined in Data.MonoTraversable Methods opoint :: Element (RWST r w s m a) -> RWST r w s m a #
(Monoid w, Applicative m) => MonoPointed (RWST r w s m a)
Instance details Defined in Data.MonoTraversable Methods opoint :: Element (RWST r w s m a) -> RWST r w s m a #

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

MonoTraversable ByteString
Instance details Defined in Data.MonoTraversable Methods otraverse :: Applicative f => (Element ByteString -> f (Element ByteString)) -> ByteString -> f ByteString # omapM :: Applicative m => (Element ByteString -> m (Element ByteString)) -> ByteString -> m ByteString #
MonoTraversable ByteString
Instance details Defined in Data.MonoTraversable Methods otraverse :: Applicative f => (Element ByteString -> f (Element ByteString)) -> ByteString -> f ByteString # omapM :: Applicative m => (Element ByteString -> m (Element ByteString)) -> ByteString -> m ByteString #
MonoTraversable Text
Instance details Defined in Data.MonoTraversable Methods otraverse :: Applicative f => (Element Text -> f (Element Text)) -> Text -> f Text # omapM :: Applicative m => (Element Text -> m (Element Text)) -> Text -> m Text #
MonoTraversable Text
Instance details Defined in Data.MonoTraversable Methods otraverse :: Applicative f => (Element Text -> f (Element Text)) -> Text -> f Text # omapM :: Applicative m => (Element Text -> m (Element Text)) -> Text -> m Text #
MonoTraversable [a]
Instance details Defined in Data.MonoTraversable Methods otraverse :: Applicative f => (Element [a] -> f (Element [a])) -> [a] -> f [a] # omapM :: Applicative m => (Element [a] -> m (Element [a])) -> [a] -> m [a] #
MonoTraversable (Maybe a)
Instance details Defined in Data.MonoTraversable Methods otraverse :: Applicative f => (Element (Maybe a) -> f (Element (Maybe a))) -> Maybe a -> f (Maybe a) # omapM :: Applicative m => (Element (Maybe a) -> m (Element (Maybe a))) -> Maybe a -> m (Maybe a) #
MonoTraversable (Par1 a)	Since: mono-traversable-1.0.11.0
Instance details Defined in Data.MonoTraversable Methods otraverse :: Applicative f => (Element (Par1 a) -> f (Element (Par1 a))) -> Par1 a -> f (Par1 a) # omapM :: Applicative m => (Element (Par1 a) -> m (Element (Par1 a))) -> Par1 a -> m (Par1 a) #
MonoTraversable (Option a)
Instance details Defined in Data.MonoTraversable Methods otraverse :: Applicative f => (Element (Option a) -> f (Element (Option a))) -> Option a -> f (Option a) # omapM :: Applicative m => (Element (Option a) -> m (Element (Option a))) -> Option a -> m (Option a) #
MonoTraversable (Identity a)
Instance details Defined in Data.MonoTraversable Methods otraverse :: Applicative f => (Element (Identity a) -> f (Element (Identity a))) -> Identity a -> f (Identity a) # omapM :: Applicative m => (Element (Identity a) -> m (Element (Identity a))) -> Identity a -> m (Identity a) #
MonoTraversable (NonEmpty a)
Instance details Defined in Data.MonoTraversable Methods otraverse :: Applicative f => (Element (NonEmpty a) -> f (Element (NonEmpty a))) -> NonEmpty a -> f (NonEmpty a) # omapM :: Applicative m => (Element (NonEmpty a) -> m (Element (NonEmpty a))) -> NonEmpty a -> m (NonEmpty a) #
MonoTraversable (Vector a)
Instance details Defined in Data.MonoTraversable Methods otraverse :: Applicative f => (Element (Vector a) -> f (Element (Vector a))) -> Vector a -> f (Vector a) # omapM :: Applicative m => (Element (Vector a) -> m (Element (Vector a))) -> Vector a -> m (Vector a) #
MonoTraversable (Seq a)
Instance details Defined in Data.MonoTraversable Methods otraverse :: Applicative f => (Element (Seq a) -> f (Element (Seq a))) -> Seq a -> f (Seq a) # omapM :: Applicative m => (Element (Seq a) -> m (Element (Seq a))) -> Seq a -> m (Seq a) #
MonoTraversable (IntMap a)
Instance details Defined in Data.MonoTraversable Methods otraverse :: Applicative f => (Element (IntMap a) -> f (Element (IntMap a))) -> IntMap a -> f (IntMap a) # omapM :: Applicative m => (Element (IntMap a) -> m (Element (IntMap a))) -> IntMap a -> m (IntMap a) #
MonoTraversable mono => MonoTraversable (NonNull mono)
Instance details Defined in Data.NonNull Methods otraverse :: Applicative f => (Element (NonNull mono) -> f (Element (NonNull mono))) -> NonNull mono -> f (NonNull mono) # omapM :: Applicative m => (Element (NonNull mono) -> m (Element (NonNull mono))) -> NonNull mono -> m (NonNull mono) #
MonoTraversable (Tree a)
Instance details Defined in Data.MonoTraversable Methods otraverse :: Applicative f => (Element (Tree a) -> f (Element (Tree a))) -> Tree a -> f (Tree a) # omapM :: Applicative m => (Element (Tree a) -> m (Element (Tree a))) -> Tree a -> m (Tree a) #
MonoTraversable (ViewL a)
Instance details Defined in Data.MonoTraversable Methods otraverse :: Applicative f => (Element (ViewL a) -> f (Element (ViewL a))) -> ViewL a -> f (ViewL a) # omapM :: Applicative m => (Element (ViewL a) -> m (Element (ViewL a))) -> ViewL a -> m (ViewL a) #
MonoTraversable (ViewR a)
Instance details Defined in Data.MonoTraversable Methods otraverse :: Applicative f => (Element (ViewR a) -> f (Element (ViewR a))) -> ViewR a -> f (ViewR a) # omapM :: Applicative m => (Element (ViewR a) -> m (Element (ViewR a))) -> ViewR a -> m (ViewR a) #
MonoTraversable (FocusList a)
Instance details Defined in Data.FocusList Methods otraverse :: Applicative f => (Element (FocusList a) -> f (Element (FocusList a))) -> FocusList a -> f (FocusList a) # omapM :: Applicative m => (Element (FocusList a) -> m (Element (FocusList a))) -> FocusList a -> m (FocusList a) #
Storable a => MonoTraversable (Vector a)
Instance details Defined in Data.MonoTraversable Methods otraverse :: Applicative f => (Element (Vector a) -> f (Element (Vector a))) -> Vector a -> f (Vector a) # omapM :: Applicative m => (Element (Vector a) -> m (Element (Vector a))) -> Vector a -> m (Vector a) #
Unbox a => MonoTraversable (Vector a)
Instance details Defined in Data.MonoTraversable Methods otraverse :: Applicative f => (Element (Vector a) -> f (Element (Vector a))) -> Vector a -> f (Vector a) # omapM :: Applicative m => (Element (Vector a) -> m (Element (Vector a))) -> Vector a -> m (Vector a) #
MonoTraversable (Either a b)
Instance details Defined in Data.MonoTraversable Methods otraverse :: Applicative f => (Element (Either a b) -> f (Element (Either a b))) -> Either a b -> f (Either a b) # omapM :: Applicative m => (Element (Either a b) -> m (Element (Either a b))) -> Either a b -> m (Either a b) #
MonoTraversable (V1 a)	Since: mono-traversable-1.0.11.0
Instance details Defined in Data.MonoTraversable Methods otraverse :: Applicative f => (Element (V1 a) -> f (Element (V1 a))) -> V1 a -> f (V1 a) # omapM :: Applicative m => (Element (V1 a) -> m (Element (V1 a))) -> V1 a -> m (V1 a) #
MonoTraversable (U1 a)	Since: mono-traversable-1.0.11.0
Instance details Defined in Data.MonoTraversable Methods otraverse :: Applicative f => (Element (U1 a) -> f (Element (U1 a))) -> U1 a -> f (U1 a) # omapM :: Applicative m => (Element (U1 a) -> m (Element (U1 a))) -> U1 a -> m (U1 a) #
MonoTraversable (a, b)
Instance details Defined in Data.MonoTraversable Methods otraverse :: Applicative f => (Element (a, b) -> f (Element (a, b))) -> (a, b) -> f (a, b) # omapM :: Applicative m => (Element (a, b) -> m (Element (a, b))) -> (a, b) -> m (a, b) #
MonoTraversable (Map k v)
Instance details Defined in Data.MonoTraversable Methods otraverse :: Applicative f => (Element (Map k v) -> f (Element (Map k v))) -> Map k v -> f (Map k v) # omapM :: Applicative m => (Element (Map k v) -> m (Element (Map k v))) -> Map k v -> m (Map k v) #
MonoTraversable (HashMap k v)
Instance details Defined in Data.MonoTraversable Methods otraverse :: Applicative f => (Element (HashMap k v) -> f (Element (HashMap k v))) -> HashMap k v -> f (HashMap k v) # omapM :: Applicative m => (Element (HashMap k v) -> m (Element (HashMap k v))) -> HashMap k v -> m (HashMap k v) #
MonoTraversable (Proxy a)	Since: mono-traversable-1.0.11.0
Instance details Defined in Data.MonoTraversable Methods otraverse :: Applicative f => (Element (Proxy a) -> f (Element (Proxy a))) -> Proxy a -> f (Proxy a) # omapM :: Applicative m => (Element (Proxy a) -> m (Element (Proxy a))) -> Proxy a -> m (Proxy a) #
Traversable f => MonoTraversable (MaybeT f a)
Instance details Defined in Data.MonoTraversable Methods otraverse :: Applicative f0 => (Element (MaybeT f a) -> f0 (Element (MaybeT f a))) -> MaybeT f a -> f0 (MaybeT f a) # omapM :: Applicative m => (Element (MaybeT f a) -> m (Element (MaybeT f a))) -> MaybeT f a -> m (MaybeT f a) #
Traversable f => MonoTraversable (ListT f a)
Instance details Defined in Data.MonoTraversable Methods otraverse :: Applicative f0 => (Element (ListT f a) -> f0 (Element (ListT f a))) -> ListT f a -> f0 (ListT f a) # omapM :: Applicative m => (Element (ListT f a) -> m (Element (ListT f a))) -> ListT f a -> m (ListT f a) #
Traversable f => MonoTraversable (Rec1 f a)	Since: mono-traversable-1.0.11.0
Instance details Defined in Data.MonoTraversable Methods otraverse :: Applicative f0 => (Element (Rec1 f a) -> f0 (Element (Rec1 f a))) -> Rec1 f a -> f0 (Rec1 f a) # omapM :: Applicative m => (Element (Rec1 f a) -> m (Element (Rec1 f a))) -> Rec1 f a -> m (Rec1 f a) #
MonoTraversable (Const m a)
Instance details Defined in Data.MonoTraversable Methods otraverse :: Applicative f => (Element (Const m a) -> f (Element (Const m a))) -> Const m a -> f (Const m a) # omapM :: Applicative m0 => (Element (Const m a) -> m0 (Element (Const m a))) -> Const m a -> m0 (Const m a) #
Traversable f => MonoTraversable (IdentityT f a)
Instance details Defined in Data.MonoTraversable Methods otraverse :: Applicative f0 => (Element (IdentityT f a) -> f0 (Element (IdentityT f a))) -> IdentityT f a -> f0 (IdentityT f a) # omapM :: Applicative m => (Element (IdentityT f a) -> m (Element (IdentityT f a))) -> IdentityT f a -> m (IdentityT f a) #
Traversable f => MonoTraversable (WriterT w f a)
Instance details Defined in Data.MonoTraversable Methods otraverse :: Applicative f0 => (Element (WriterT w f a) -> f0 (Element (WriterT w f a))) -> WriterT w f a -> f0 (WriterT w f a) # omapM :: Applicative m => (Element (WriterT w f a) -> m (Element (WriterT w f a))) -> WriterT w f a -> m (WriterT w f a) #
Traversable f => MonoTraversable (WriterT w f a)
Instance details Defined in Data.MonoTraversable Methods otraverse :: Applicative f0 => (Element (WriterT w f a) -> f0 (Element (WriterT w f a))) -> WriterT w f a -> f0 (WriterT w f a) # omapM :: Applicative m => (Element (WriterT w f a) -> m (Element (WriterT w f a))) -> WriterT w f a -> m (WriterT w f a) #
MonoTraversable (K1 i c a)	Since: mono-traversable-1.0.11.0
Instance details Defined in Data.MonoTraversable Methods otraverse :: Applicative f => (Element (K1 i c a) -> f (Element (K1 i c a))) -> K1 i c a -> f (K1 i c a) # omapM :: Applicative m => (Element (K1 i c a) -> m (Element (K1 i c a))) -> K1 i c a -> m (K1 i c a) #
(Traversable f, Traversable g) => MonoTraversable ((f :+: g) a)	Since: mono-traversable-1.0.11.0
Instance details Defined in Data.MonoTraversable Methods otraverse :: Applicative f0 => (Element ((f :+: g) a) -> f0 (Element ((f :+: g) a))) -> (f :+: g) a -> f0 ((f :+: g) a) # omapM :: Applicative m => (Element ((f :+: g) a) -> m (Element ((f :+: g) a))) -> (f :+: g) a -> m ((f :+: g) a) #
(Traversable f, Traversable g) => MonoTraversable ((f :*: g) a)	Since: mono-traversable-1.0.11.0
Instance details Defined in Data.MonoTraversable Methods otraverse :: Applicative f0 => (Element ((f :: g) a) -> f0 (Element ((f :: g) a))) -> (f :: g) a -> f0 ((f :: g) a) # omapM :: Applicative m => (Element ((f :: g) a) -> m (Element ((f :: g) a))) -> (f :: g) a -> m ((f :: g) a) #
(Traversable f, Traversable g) => MonoTraversable (Product f g a)
Instance details Defined in Data.MonoTraversable Methods otraverse :: Applicative f0 => (Element (Product f g a) -> f0 (Element (Product f g a))) -> Product f g a -> f0 (Product f g a) # omapM :: Applicative m => (Element (Product f g a) -> m (Element (Product f g a))) -> Product f g a -> m (Product f g a) #
Traversable f => MonoTraversable (M1 i c f a)	Since: mono-traversable-1.0.11.0
Instance details Defined in Data.MonoTraversable Methods otraverse :: Applicative f0 => (Element (M1 i c f a) -> f0 (Element (M1 i c f a))) -> M1 i c f a -> f0 (M1 i c f a) # omapM :: Applicative m => (Element (M1 i c f a) -> m (Element (M1 i c f a))) -> M1 i c f a -> m (M1 i c f a) #
(Traversable f, Traversable g) => MonoTraversable ((f :.: g) a)	Since: mono-traversable-1.0.11.0
Instance details Defined in Data.MonoTraversable Methods otraverse :: Applicative f0 => (Element ((f :.: g) a) -> f0 (Element ((f :.: g) a))) -> (f :.: g) a -> f0 ((f :.: g) a) # omapM :: Applicative m => (Element ((f :.: g) a) -> m (Element ((f :.: g) a))) -> (f :.: g) a -> m ((f :.: g) a) #
(Traversable f, Traversable g) => MonoTraversable (Compose f g a)
Instance details Defined in Data.MonoTraversable Methods otraverse :: Applicative f0 => (Element (Compose f g a) -> f0 (Element (Compose f g a))) -> Compose f g a -> f0 (Compose f g a) # omapM :: Applicative m => (Element (Compose f g a) -> m (Element (Compose f g a))) -> Compose f g a -> m (Compose f g a) #

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?

onull :: mono -> Bool #

Is the monomorphic container empty?

olength :: mono -> Int #

Length of a monomorphic container, returns a Int.

olength64 :: mono -> Int64 #

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 () #

oforM_ is omapM_ with its arguments flipped.

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

MonoFoldable ByteString
Instance details Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element ByteString -> m) -> ByteString -> m # ofoldr :: (Element ByteString -> b -> b) -> b -> ByteString -> b # ofoldl' :: (a -> Element ByteString -> a) -> a -> ByteString -> a # otoList :: ByteString -> [Element ByteString] # oall :: (Element ByteString -> Bool) -> ByteString -> Bool # oany :: (Element ByteString -> Bool) -> ByteString -> Bool # onull :: ByteString -> Bool # olength :: ByteString -> Int # olength64 :: ByteString -> Int64 # ocompareLength :: Integral i => ByteString -> i -> Ordering # otraverse_ :: Applicative f => (Element ByteString -> f b) -> ByteString -> f () # ofor_ :: Applicative f => ByteString -> (Element ByteString -> f b) -> f () # omapM_ :: Applicative m => (Element ByteString -> m ()) -> ByteString -> m () # oforM_ :: Applicative m => ByteString -> (Element ByteString -> m ()) -> m () # ofoldlM :: Monad m => (a -> Element ByteString -> m a) -> a -> ByteString -> m a # ofoldMap1Ex :: Semigroup m => (Element ByteString -> m) -> ByteString -> m # ofoldr1Ex :: (Element ByteString -> Element ByteString -> Element ByteString) -> ByteString -> Element ByteString # ofoldl1Ex' :: (Element ByteString -> Element ByteString -> Element ByteString) -> ByteString -> Element ByteString # headEx :: ByteString -> Element ByteString # lastEx :: ByteString -> Element ByteString # unsafeHead :: ByteString -> Element ByteString # unsafeLast :: ByteString -> Element ByteString # maximumByEx :: (Element ByteString -> Element ByteString -> Ordering) -> ByteString -> Element ByteString # minimumByEx :: (Element ByteString -> Element ByteString -> Ordering) -> ByteString -> Element ByteString # oelem :: Element ByteString -> ByteString -> Bool # onotElem :: Element ByteString -> ByteString -> Bool #
MonoFoldable ByteString
Instance details Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element ByteString -> m) -> ByteString -> m # ofoldr :: (Element ByteString -> b -> b) -> b -> ByteString -> b # ofoldl' :: (a -> Element ByteString -> a) -> a -> ByteString -> a # otoList :: ByteString -> [Element ByteString] # oall :: (Element ByteString -> Bool) -> ByteString -> Bool # oany :: (Element ByteString -> Bool) -> ByteString -> Bool # onull :: ByteString -> Bool # olength :: ByteString -> Int # olength64 :: ByteString -> Int64 # ocompareLength :: Integral i => ByteString -> i -> Ordering # otraverse_ :: Applicative f => (Element ByteString -> f b) -> ByteString -> f () # ofor_ :: Applicative f => ByteString -> (Element ByteString -> f b) -> f () # omapM_ :: Applicative m => (Element ByteString -> m ()) -> ByteString -> m () # oforM_ :: Applicative m => ByteString -> (Element ByteString -> m ()) -> m () # ofoldlM :: Monad m => (a -> Element ByteString -> m a) -> a -> ByteString -> m a # ofoldMap1Ex :: Semigroup m => (Element ByteString -> m) -> ByteString -> m # ofoldr1Ex :: (Element ByteString -> Element ByteString -> Element ByteString) -> ByteString -> Element ByteString # ofoldl1Ex' :: (Element ByteString -> Element ByteString -> Element ByteString) -> ByteString -> Element ByteString # headEx :: ByteString -> Element ByteString # lastEx :: ByteString -> Element ByteString # unsafeHead :: ByteString -> Element ByteString # unsafeLast :: ByteString -> Element ByteString # maximumByEx :: (Element ByteString -> Element ByteString -> Ordering) -> ByteString -> Element ByteString # minimumByEx :: (Element ByteString -> Element ByteString -> Ordering) -> ByteString -> Element ByteString # oelem :: Element ByteString -> ByteString -> Bool # onotElem :: Element ByteString -> ByteString -> Bool #
MonoFoldable Text
Instance details Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element Text -> m) -> Text -> m # ofoldr :: (Element Text -> b -> b) -> b -> Text -> b # ofoldl' :: (a -> Element Text -> a) -> a -> Text -> a # otoList :: Text -> [Element Text] # oall :: (Element Text -> Bool) -> Text -> Bool # oany :: (Element Text -> Bool) -> Text -> Bool # onull :: Text -> Bool # olength :: Text -> Int # olength64 :: Text -> Int64 # ocompareLength :: Integral i => Text -> i -> Ordering # otraverse_ :: Applicative f => (Element Text -> f b) -> Text -> f () # ofor_ :: Applicative f => Text -> (Element Text -> f b) -> f () # omapM_ :: Applicative m => (Element Text -> m ()) -> Text -> m () # oforM_ :: Applicative m => Text -> (Element Text -> m ()) -> m () # ofoldlM :: Monad m => (a -> Element Text -> m a) -> a -> Text -> m a # ofoldMap1Ex :: Semigroup m => (Element Text -> m) -> Text -> m # ofoldr1Ex :: (Element Text -> Element Text -> Element Text) -> Text -> Element Text # ofoldl1Ex' :: (Element Text -> Element Text -> Element Text) -> Text -> Element Text # headEx :: Text -> Element Text # lastEx :: Text -> Element Text # unsafeHead :: Text -> Element Text # unsafeLast :: Text -> Element Text # maximumByEx :: (Element Text -> Element Text -> Ordering) -> Text -> Element Text # minimumByEx :: (Element Text -> Element Text -> Ordering) -> Text -> Element Text # oelem :: Element Text -> Text -> Bool # onotElem :: Element Text -> Text -> Bool #
MonoFoldable Text
Instance details Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element Text -> m) -> Text -> m # ofoldr :: (Element Text -> b -> b) -> b -> Text -> b # ofoldl' :: (a -> Element Text -> a) -> a -> Text -> a # otoList :: Text -> [Element Text] # oall :: (Element Text -> Bool) -> Text -> Bool # oany :: (Element Text -> Bool) -> Text -> Bool # onull :: Text -> Bool # olength :: Text -> Int # olength64 :: Text -> Int64 # ocompareLength :: Integral i => Text -> i -> Ordering # otraverse_ :: Applicative f => (Element Text -> f b) -> Text -> f () # ofor_ :: Applicative f => Text -> (Element Text -> f b) -> f () # omapM_ :: Applicative m => (Element Text -> m ()) -> Text -> m () # oforM_ :: Applicative m => Text -> (Element Text -> m ()) -> m () # ofoldlM :: Monad m => (a -> Element Text -> m a) -> a -> Text -> m a # ofoldMap1Ex :: Semigroup m => (Element Text -> m) -> Text -> m # ofoldr1Ex :: (Element Text -> Element Text -> Element Text) -> Text -> Element Text # ofoldl1Ex' :: (Element Text -> Element Text -> Element Text) -> Text -> Element Text # headEx :: Text -> Element Text # lastEx :: Text -> Element Text # unsafeHead :: Text -> Element Text # unsafeLast :: Text -> Element Text # maximumByEx :: (Element Text -> Element Text -> Ordering) -> Text -> Element Text # minimumByEx :: (Element Text -> Element Text -> Ordering) -> Text -> Element Text # oelem :: Element Text -> Text -> Bool # onotElem :: Element Text -> Text -> Bool #
MonoFoldable IntSet
Instance details Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element IntSet -> m) -> IntSet -> m # ofoldr :: (Element IntSet -> b -> b) -> b -> IntSet -> b # ofoldl' :: (a -> Element IntSet -> a) -> a -> IntSet -> a # otoList :: IntSet -> [Element IntSet] # oall :: (Element IntSet -> Bool) -> IntSet -> Bool # oany :: (Element IntSet -> Bool) -> IntSet -> Bool # onull :: IntSet -> Bool # olength :: IntSet -> Int # olength64 :: IntSet -> Int64 # ocompareLength :: Integral i => IntSet -> i -> Ordering # otraverse_ :: Applicative f => (Element IntSet -> f b) -> IntSet -> f () # ofor_ :: Applicative f => IntSet -> (Element IntSet -> f b) -> f () # omapM_ :: Applicative m => (Element IntSet -> m ()) -> IntSet -> m () # oforM_ :: Applicative m => IntSet -> (Element IntSet -> m ()) -> m () # ofoldlM :: Monad m => (a -> Element IntSet -> m a) -> a -> IntSet -> m a # ofoldMap1Ex :: Semigroup m => (Element IntSet -> m) -> IntSet -> m # ofoldr1Ex :: (Element IntSet -> Element IntSet -> Element IntSet) -> IntSet -> Element IntSet # ofoldl1Ex' :: (Element IntSet -> Element IntSet -> Element IntSet) -> IntSet -> Element IntSet # headEx :: IntSet -> Element IntSet # lastEx :: IntSet -> Element IntSet # unsafeHead :: IntSet -> Element IntSet # unsafeLast :: IntSet -> Element IntSet # maximumByEx :: (Element IntSet -> Element IntSet -> Ordering) -> IntSet -> Element IntSet # minimumByEx :: (Element IntSet -> Element IntSet -> Ordering) -> IntSet -> Element IntSet # oelem :: Element IntSet -> IntSet -> Bool # onotElem :: Element IntSet -> IntSet -> Bool #
MonoFoldable [a]
Instance details Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element [a] -> m) -> [a] -> m # ofoldr :: (Element [a] -> b -> b) -> b -> [a] -> b # ofoldl' :: (a0 -> Element [a] -> a0) -> a0 -> [a] -> a0 # otoList :: [a] -> [Element [a]] # oall :: (Element [a] -> Bool) -> [a] -> Bool # oany :: (Element [a] -> Bool) -> [a] -> Bool # onull :: [a] -> Bool # olength :: [a] -> Int # olength64 :: [a] -> Int64 # ocompareLength :: Integral i => [a] -> i -> Ordering # otraverse_ :: Applicative f => (Element [a] -> f b) -> [a] -> f () # ofor_ :: Applicative f => [a] -> (Element [a] -> f b) -> f () # omapM_ :: Applicative m => (Element [a] -> m ()) -> [a] -> m () # oforM_ :: Applicative m => [a] -> (Element [a] -> m ()) -> m () # ofoldlM :: Monad m => (a0 -> Element [a] -> m a0) -> a0 -> [a] -> m a0 # ofoldMap1Ex :: Semigroup m => (Element [a] -> m) -> [a] -> m # ofoldr1Ex :: (Element [a] -> Element [a] -> Element [a]) -> [a] -> Element [a] # ofoldl1Ex' :: (Element [a] -> Element [a] -> Element [a]) -> [a] -> Element [a] # headEx :: [a] -> Element [a] # lastEx :: [a] -> Element [a] # unsafeHead :: [a] -> Element [a] # unsafeLast :: [a] -> Element [a] # maximumByEx :: (Element [a] -> Element [a] -> Ordering) -> [a] -> Element [a] # minimumByEx :: (Element [a] -> Element [a] -> Ordering) -> [a] -> Element [a] # oelem :: Element [a] -> [a] -> Bool # onotElem :: Element [a] -> [a] -> Bool #
MonoFoldable (Maybe a)
Instance details 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 # onull :: Maybe a -> Bool # olength :: Maybe a -> Int # 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) # oelem :: Element (Maybe a) -> Maybe a -> Bool # onotElem :: Element (Maybe a) -> Maybe a -> Bool #
MonoFoldable (Par1 a)	Since: mono-traversable-1.0.11.0
Instance details Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element (Par1 a) -> m) -> Par1 a -> m # ofoldr :: (Element (Par1 a) -> b -> b) -> b -> Par1 a -> b # ofoldl' :: (a0 -> Element (Par1 a) -> a0) -> a0 -> Par1 a -> a0 # otoList :: Par1 a -> [Element (Par1 a)] # oall :: (Element (Par1 a) -> Bool) -> Par1 a -> Bool # oany :: (Element (Par1 a) -> Bool) -> Par1 a -> Bool # onull :: Par1 a -> Bool # olength :: Par1 a -> Int # olength64 :: Par1 a -> Int64 # ocompareLength :: Integral i => Par1 a -> i -> Ordering # otraverse_ :: Applicative f => (Element (Par1 a) -> f b) -> Par1 a -> f () # ofor_ :: Applicative f => Par1 a -> (Element (Par1 a) -> f b) -> f () # omapM_ :: Applicative m => (Element (Par1 a) -> m ()) -> Par1 a -> m () # oforM_ :: Applicative m => Par1 a -> (Element (Par1 a) -> m ()) -> m () # ofoldlM :: Monad m => (a0 -> Element (Par1 a) -> m a0) -> a0 -> Par1 a -> m a0 # ofoldMap1Ex :: Semigroup m => (Element (Par1 a) -> m) -> Par1 a -> m # ofoldr1Ex :: (Element (Par1 a) -> Element (Par1 a) -> Element (Par1 a)) -> Par1 a -> Element (Par1 a) # ofoldl1Ex' :: (Element (Par1 a) -> Element (Par1 a) -> Element (Par1 a)) -> Par1 a -> Element (Par1 a) # headEx :: Par1 a -> Element (Par1 a) # lastEx :: Par1 a -> Element (Par1 a) # unsafeHead :: Par1 a -> Element (Par1 a) # unsafeLast :: Par1 a -> Element (Par1 a) # maximumByEx :: (Element (Par1 a) -> Element (Par1 a) -> Ordering) -> Par1 a -> Element (Par1 a) # minimumByEx :: (Element (Par1 a) -> Element (Par1 a) -> Ordering) -> Par1 a -> Element (Par1 a) # oelem :: Element (Par1 a) -> Par1 a -> Bool # onotElem :: Element (Par1 a) -> Par1 a -> Bool #
MonoFoldable (Option a)
Instance details Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element (Option a) -> m) -> Option a -> m # ofoldr :: (Element (Option a) -> b -> b) -> b -> Option a -> b # ofoldl' :: (a0 -> Element (Option a) -> a0) -> a0 -> Option a -> a0 # otoList :: Option a -> [Element (Option a)] # oall :: (Element (Option a) -> Bool) -> Option a -> Bool # oany :: (Element (Option a) -> Bool) -> Option a -> Bool # onull :: Option a -> Bool # olength :: Option a -> Int # olength64 :: Option a -> Int64 # ocompareLength :: Integral i => Option a -> i -> Ordering # otraverse_ :: Applicative f => (Element (Option a) -> f b) -> Option a -> f () # ofor_ :: Applicative f => Option a -> (Element (Option a) -> f b) -> f () # omapM_ :: Applicative m => (Element (Option a) -> m ()) -> Option a -> m () # oforM_ :: Applicative m => Option a -> (Element (Option a) -> m ()) -> m () # ofoldlM :: Monad m => (a0 -> Element (Option a) -> m a0) -> a0 -> Option a -> m a0 # ofoldMap1Ex :: Semigroup m => (Element (Option a) -> m) -> Option a -> m # ofoldr1Ex :: (Element (Option a) -> Element (Option a) -> Element (Option a)) -> Option a -> Element (Option a) # ofoldl1Ex' :: (Element (Option a) -> Element (Option a) -> Element (Option a)) -> Option a -> Element (Option a) # headEx :: Option a -> Element (Option a) # lastEx :: Option a -> Element (Option a) # unsafeHead :: Option a -> Element (Option a) # unsafeLast :: Option a -> Element (Option a) # maximumByEx :: (Element (Option a) -> Element (Option a) -> Ordering) -> Option a -> Element (Option a) # minimumByEx :: (Element (Option a) -> Element (Option a) -> Ordering) -> Option a -> Element (Option a) # oelem :: Element (Option a) -> Option a -> Bool # onotElem :: Element (Option a) -> Option a -> Bool #
MonoFoldable (Identity a)
Instance details 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 # onull :: 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) # oelem :: Element (Identity a) -> Identity a -> Bool # onotElem :: Element (Identity a) -> Identity a -> Bool #
MonoFoldable (NonEmpty a)
Instance details Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element (NonEmpty a) -> m) -> NonEmpty a -> m # ofoldr :: (Element (NonEmpty a) -> b -> b) -> b -> NonEmpty a -> b # ofoldl' :: (a0 -> Element (NonEmpty a) -> a0) -> a0 -> NonEmpty a -> a0 # otoList :: NonEmpty a -> [Element (NonEmpty a)] # oall :: (Element (NonEmpty a) -> Bool) -> NonEmpty a -> Bool # oany :: (Element (NonEmpty a) -> Bool) -> NonEmpty a -> Bool # onull :: NonEmpty a -> Bool # olength :: NonEmpty a -> Int # olength64 :: NonEmpty a -> Int64 # ocompareLength :: Integral i => NonEmpty a -> i -> Ordering # otraverse_ :: Applicative f => (Element (NonEmpty a) -> f b) -> NonEmpty a -> f () # ofor_ :: Applicative f => NonEmpty a -> (Element (NonEmpty a) -> f b) -> f () # omapM_ :: Applicative m => (Element (NonEmpty a) -> m ()) -> NonEmpty a -> m () # oforM_ :: Applicative m => NonEmpty a -> (Element (NonEmpty a) -> m ()) -> m () # ofoldlM :: Monad m => (a0 -> Element (NonEmpty a) -> m a0) -> a0 -> NonEmpty a -> m a0 # ofoldMap1Ex :: Semigroup m => (Element (NonEmpty a) -> m) -> NonEmpty a -> m # ofoldr1Ex :: (Element (NonEmpty a) -> Element (NonEmpty a) -> Element (NonEmpty a)) -> NonEmpty a -> Element (NonEmpty a) # ofoldl1Ex' :: (Element (NonEmpty a) -> Element (NonEmpty a) -> Element (NonEmpty a)) -> NonEmpty a -> Element (NonEmpty a) # headEx :: NonEmpty a -> Element (NonEmpty a) # lastEx :: NonEmpty a -> Element (NonEmpty a) # unsafeHead :: NonEmpty a -> Element (NonEmpty a) # unsafeLast :: NonEmpty a -> Element (NonEmpty a) # maximumByEx :: (Element (NonEmpty a) -> Element (NonEmpty a) -> Ordering) -> NonEmpty a -> Element (NonEmpty a) # minimumByEx :: (Element (NonEmpty a) -> Element (NonEmpty a) -> Ordering) -> NonEmpty a -> Element (NonEmpty a) # oelem :: Element (NonEmpty a) -> NonEmpty a -> Bool # onotElem :: Element (NonEmpty a) -> NonEmpty a -> Bool #
MonoFoldable (Vector a)
Instance details Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element (Vector a) -> m) -> Vector a -> m # ofoldr :: (Element (Vector a) -> b -> b) -> b -> Vector a -> b # ofoldl' :: (a0 -> Element (Vector a) -> a0) -> a0 -> Vector a -> a0 # otoList :: Vector a -> [Element (Vector a)] # oall :: (Element (Vector a) -> Bool) -> Vector a -> Bool # oany :: (Element (Vector a) -> Bool) -> Vector a -> Bool # onull :: Vector a -> Bool # olength :: Vector a -> Int # olength64 :: Vector a -> Int64 # ocompareLength :: Integral i => Vector a -> i -> Ordering # otraverse_ :: Applicative f => (Element (Vector a) -> f b) -> Vector a -> f () # ofor_ :: Applicative f => Vector a -> (Element (Vector a) -> f b) -> f () # omapM_ :: Applicative m => (Element (Vector a) -> m ()) -> Vector a -> m () # oforM_ :: Applicative m => Vector a -> (Element (Vector a) -> m ()) -> m () # ofoldlM :: Monad m => (a0 -> Element (Vector a) -> m a0) -> a0 -> Vector a -> m a0 # ofoldMap1Ex :: Semigroup m => (Element (Vector a) -> m) -> Vector a -> m # ofoldr1Ex :: (Element (Vector a) -> Element (Vector a) -> Element (Vector a)) -> Vector a -> Element (Vector a) # ofoldl1Ex' :: (Element (Vector a) -> Element (Vector a) -> Element (Vector a)) -> Vector a -> Element (Vector a) # headEx :: Vector a -> Element (Vector a) # lastEx :: Vector a -> Element (Vector a) # unsafeHead :: Vector a -> Element (Vector a) # unsafeLast :: Vector a -> Element (Vector a) # maximumByEx :: (Element (Vector a) -> Element (Vector a) -> Ordering) -> Vector a -> Element (Vector a) # minimumByEx :: (Element (Vector a) -> Element (Vector a) -> Ordering) -> Vector a -> Element (Vector a) # oelem :: Element (Vector a) -> Vector a -> Bool # onotElem :: Element (Vector a) -> Vector a -> Bool #
MonoFoldable (HashSet e)
Instance details 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 # onull :: HashSet e -> Bool # olength :: HashSet e -> Int # 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) # oelem :: Element (HashSet e) -> HashSet e -> Bool # onotElem :: Element (HashSet e) -> HashSet e -> Bool #
Ord e => MonoFoldable (Set e)
Instance details 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 # onull :: Set e -> Bool # olength :: Set e -> Int # olength64 :: Set e -> Int64 # 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) # oelem :: Element (Set e) -> Set e -> Bool # onotElem :: Element (Set e) -> Set e -> Bool #
MonoFoldable (Seq a)
Instance details 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 # onull :: Seq a -> Bool # olength :: Seq a -> Int # olength64 :: Seq a -> Int64 # 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) # oelem :: Element (Seq a) -> Seq a -> Bool # onotElem :: Element (Seq a) -> Seq a -> Bool #
MonoFoldable (IntMap a)
Instance details Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element (IntMap a) -> m) -> IntMap a -> m # ofoldr :: (Element (IntMap a) -> b -> b) -> b -> IntMap a -> b # ofoldl' :: (a0 -> Element (IntMap a) -> a0) -> a0 -> IntMap a -> a0 # otoList :: IntMap a -> [Element (IntMap a)] # oall :: (Element (IntMap a) -> Bool) -> IntMap a -> Bool # oany :: (Element (IntMap a) -> Bool) -> IntMap a -> Bool # onull :: IntMap a -> Bool # olength :: IntMap a -> Int # olength64 :: IntMap a -> Int64 # ocompareLength :: Integral i => IntMap a -> i -> Ordering # otraverse_ :: Applicative f => (Element (IntMap a) -> f b) -> IntMap a -> f () # ofor_ :: Applicative f => IntMap a -> (Element (IntMap a) -> f b) -> f () # omapM_ :: Applicative m => (Element (IntMap a) -> m ()) -> IntMap a -> m () # oforM_ :: Applicative m => IntMap a -> (Element (IntMap a) -> m ()) -> m () # ofoldlM :: Monad m => (a0 -> Element (IntMap a) -> m a0) -> a0 -> IntMap a -> m a0 # ofoldMap1Ex :: Semigroup m => (Element (IntMap a) -> m) -> IntMap a -> m # ofoldr1Ex :: (Element (IntMap a) -> Element (IntMap a) -> Element (IntMap a)) -> IntMap a -> Element (IntMap a) # ofoldl1Ex' :: (Element (IntMap a) -> Element (IntMap a) -> Element (IntMap a)) -> IntMap a -> Element (IntMap a) # headEx :: IntMap a -> Element (IntMap a) # lastEx :: IntMap a -> Element (IntMap a) # unsafeHead :: IntMap a -> Element (IntMap a) # unsafeLast :: IntMap a -> Element (IntMap a) # maximumByEx :: (Element (IntMap a) -> Element (IntMap a) -> Ordering) -> IntMap a -> Element (IntMap a) # minimumByEx :: (Element (IntMap a) -> Element (IntMap a) -> Ordering) -> IntMap a -> Element (IntMap a) # oelem :: Element (IntMap a) -> IntMap a -> Bool # onotElem :: Element (IntMap a) -> IntMap a -> Bool #
MonoFoldable mono => MonoFoldable (NonNull mono)
Instance details 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 #
MonoFoldable (Tree a)
Instance details Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element (Tree a) -> m) -> Tree a -> m # ofoldr :: (Element (Tree a) -> b -> b) -> b -> Tree a -> b # ofoldl' :: (a0 -> Element (Tree a) -> a0) -> a0 -> Tree a -> a0 # otoList :: Tree a -> [Element (Tree a)] # oall :: (Element (Tree a) -> Bool) -> Tree a -> Bool # oany :: (Element (Tree a) -> Bool) -> Tree a -> Bool # onull :: Tree a -> Bool # olength :: Tree a -> Int # olength64 :: Tree a -> Int64 # ocompareLength :: Integral i => Tree a -> i -> Ordering # otraverse_ :: Applicative f => (Element (Tree a) -> f b) -> Tree a -> f () # ofor_ :: Applicative f => Tree a -> (Element (Tree a) -> f b) -> f () # omapM_ :: Applicative m => (Element (Tree a) -> m ()) -> Tree a -> m () # oforM_ :: Applicative m => Tree a -> (Element (Tree a) -> m ()) -> m () # ofoldlM :: Monad m => (a0 -> Element (Tree a) -> m a0) -> a0 -> Tree a -> m a0 # ofoldMap1Ex :: Semigroup m => (Element (Tree a) -> m) -> Tree a -> m # ofoldr1Ex :: (Element (Tree a) -> Element (Tree a) -> Element (Tree a)) -> Tree a -> Element (Tree a) # ofoldl1Ex' :: (Element (Tree a) -> Element (Tree a) -> Element (Tree a)) -> Tree a -> Element (Tree a) # headEx :: Tree a -> Element (Tree a) # lastEx :: Tree a -> Element (Tree a) # unsafeHead :: Tree a -> Element (Tree a) # unsafeLast :: Tree a -> Element (Tree a) # maximumByEx :: (Element (Tree a) -> Element (Tree a) -> Ordering) -> Tree a -> Element (Tree a) # minimumByEx :: (Element (Tree a) -> Element (Tree a) -> Ordering) -> Tree a -> Element (Tree a) # oelem :: Element (Tree a) -> Tree a -> Bool # onotElem :: Element (Tree a) -> Tree a -> Bool #
MonoFoldable (ViewL a)
Instance details Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element (ViewL a) -> m) -> ViewL a -> m # ofoldr :: (Element (ViewL a) -> b -> b) -> b -> ViewL a -> b # ofoldl' :: (a0 -> Element (ViewL a) -> a0) -> a0 -> ViewL a -> a0 # otoList :: ViewL a -> [Element (ViewL a)] # oall :: (Element (ViewL a) -> Bool) -> ViewL a -> Bool # oany :: (Element (ViewL a) -> Bool) -> ViewL a -> Bool # onull :: ViewL a -> Bool # olength :: ViewL a -> Int # olength64 :: ViewL a -> Int64 # ocompareLength :: Integral i => ViewL a -> i -> Ordering # otraverse_ :: Applicative f => (Element (ViewL a) -> f b) -> ViewL a -> f () # ofor_ :: Applicative f => ViewL a -> (Element (ViewL a) -> f b) -> f () # omapM_ :: Applicative m => (Element (ViewL a) -> m ()) -> ViewL a -> m () # oforM_ :: Applicative m => ViewL a -> (Element (ViewL a) -> m ()) -> m () # ofoldlM :: Monad m => (a0 -> Element (ViewL a) -> m a0) -> a0 -> ViewL a -> m a0 # ofoldMap1Ex :: Semigroup m => (Element (ViewL a) -> m) -> ViewL a -> m # ofoldr1Ex :: (Element (ViewL a) -> Element (ViewL a) -> Element (ViewL a)) -> ViewL a -> Element (ViewL a) # ofoldl1Ex' :: (Element (ViewL a) -> Element (ViewL a) -> Element (ViewL a)) -> ViewL a -> Element (ViewL a) # headEx :: ViewL a -> Element (ViewL a) # lastEx :: ViewL a -> Element (ViewL a) # unsafeHead :: ViewL a -> Element (ViewL a) # unsafeLast :: ViewL a -> Element (ViewL a) # maximumByEx :: (Element (ViewL a) -> Element (ViewL a) -> Ordering) -> ViewL a -> Element (ViewL a) # minimumByEx :: (Element (ViewL a) -> Element (ViewL a) -> Ordering) -> ViewL a -> Element (ViewL a) # oelem :: Element (ViewL a) -> ViewL a -> Bool # onotElem :: Element (ViewL a) -> ViewL a -> Bool #
MonoFoldable (ViewR a)
Instance details Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element (ViewR a) -> m) -> ViewR a -> m # ofoldr :: (Element (ViewR a) -> b -> b) -> b -> ViewR a -> b # ofoldl' :: (a0 -> Element (ViewR a) -> a0) -> a0 -> ViewR a -> a0 # otoList :: ViewR a -> [Element (ViewR a)] # oall :: (Element (ViewR a) -> Bool) -> ViewR a -> Bool # oany :: (Element (ViewR a) -> Bool) -> ViewR a -> Bool # onull :: ViewR a -> Bool # olength :: ViewR a -> Int # olength64 :: ViewR a -> Int64 # ocompareLength :: Integral i => ViewR a -> i -> Ordering # otraverse_ :: Applicative f => (Element (ViewR a) -> f b) -> ViewR a -> f () # ofor_ :: Applicative f => ViewR a -> (Element (ViewR a) -> f b) -> f () # omapM_ :: Applicative m => (Element (ViewR a) -> m ()) -> ViewR a -> m () # oforM_ :: Applicative m => ViewR a -> (Element (ViewR a) -> m ()) -> m () # ofoldlM :: Monad m => (a0 -> Element (ViewR a) -> m a0) -> a0 -> ViewR a -> m a0 # ofoldMap1Ex :: Semigroup m => (Element (ViewR a) -> m) -> ViewR a -> m # ofoldr1Ex :: (Element (ViewR a) -> Element (ViewR a) -> Element (ViewR a)) -> ViewR a -> Element (ViewR a) # ofoldl1Ex' :: (Element (ViewR a) -> Element (ViewR a) -> Element (ViewR a)) -> ViewR a -> Element (ViewR a) # headEx :: ViewR a -> Element (ViewR a) # lastEx :: ViewR a -> Element (ViewR a) # unsafeHead :: ViewR a -> Element (ViewR a) # unsafeLast :: ViewR a -> Element (ViewR a) # maximumByEx :: (Element (ViewR a) -> Element (ViewR a) -> Ordering) -> ViewR a -> Element (ViewR a) # minimumByEx :: (Element (ViewR a) -> Element (ViewR a) -> Ordering) -> ViewR a -> Element (ViewR a) # oelem :: Element (ViewR a) -> ViewR a -> Bool # onotElem :: Element (ViewR a) -> ViewR a -> Bool #
MonoFoldable (FocusList a)
Instance details Defined in Data.FocusList Methods ofoldMap :: Monoid m => (Element (FocusList a) -> m) -> FocusList a -> m # ofoldr :: (Element (FocusList a) -> b -> b) -> b -> FocusList a -> b # ofoldl' :: (a0 -> Element (FocusList a) -> a0) -> a0 -> FocusList a -> a0 # otoList :: FocusList a -> [Element (FocusList a)] # oall :: (Element (FocusList a) -> Bool) -> FocusList a -> Bool # oany :: (Element (FocusList a) -> Bool) -> FocusList a -> Bool # onull :: FocusList a -> Bool # olength :: FocusList a -> Int # olength64 :: FocusList a -> Int64 # ocompareLength :: Integral i => FocusList a -> i -> Ordering # otraverse_ :: Applicative f => (Element (FocusList a) -> f b) -> FocusList a -> f () # ofor_ :: Applicative f => FocusList a -> (Element (FocusList a) -> f b) -> f () # omapM_ :: Applicative m => (Element (FocusList a) -> m ()) -> FocusList a -> m () # oforM_ :: Applicative m => FocusList a -> (Element (FocusList a) -> m ()) -> m () # ofoldlM :: Monad m => (a0 -> Element (FocusList a) -> m a0) -> a0 -> FocusList a -> m a0 # ofoldMap1Ex :: Semigroup m => (Element (FocusList a) -> m) -> FocusList a -> m # ofoldr1Ex :: (Element (FocusList a) -> Element (FocusList a) -> Element (FocusList a)) -> FocusList a -> Element (FocusList a) # ofoldl1Ex' :: (Element (FocusList a) -> Element (FocusList a) -> Element (FocusList a)) -> FocusList a -> Element (FocusList a) # headEx :: FocusList a -> Element (FocusList a) # lastEx :: FocusList a -> Element (FocusList a) # unsafeHead :: FocusList a -> Element (FocusList a) # unsafeLast :: FocusList a -> Element (FocusList a) # maximumByEx :: (Element (FocusList a) -> Element (FocusList a) -> Ordering) -> FocusList a -> Element (FocusList a) # minimumByEx :: (Element (FocusList a) -> Element (FocusList a) -> Ordering) -> FocusList a -> Element (FocusList a) # oelem :: Element (FocusList a) -> FocusList a -> Bool # onotElem :: Element (FocusList a) -> FocusList a -> Bool #
Storable a => MonoFoldable (Vector a)
Instance details Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element (Vector a) -> m) -> Vector a -> m # ofoldr :: (Element (Vector a) -> b -> b) -> b -> Vector a -> b # ofoldl' :: (a0 -> Element (Vector a) -> a0) -> a0 -> Vector a -> a0 # otoList :: Vector a -> [Element (Vector a)] # oall :: (Element (Vector a) -> Bool) -> Vector a -> Bool # oany :: (Element (Vector a) -> Bool) -> Vector a -> Bool # onull :: Vector a -> Bool # olength :: Vector a -> Int # olength64 :: Vector a -> Int64 # ocompareLength :: Integral i => Vector a -> i -> Ordering # otraverse_ :: Applicative f => (Element (Vector a) -> f b) -> Vector a -> f () # ofor_ :: Applicative f => Vector a -> (Element (Vector a) -> f b) -> f () # omapM_ :: Applicative m => (Element (Vector a) -> m ()) -> Vector a -> m () # oforM_ :: Applicative m => Vector a -> (Element (Vector a) -> m ()) -> m () # ofoldlM :: Monad m => (a0 -> Element (Vector a) -> m a0) -> a0 -> Vector a -> m a0 # ofoldMap1Ex :: Semigroup m => (Element (Vector a) -> m) -> Vector a -> m # ofoldr1Ex :: (Element (Vector a) -> Element (Vector a) -> Element (Vector a)) -> Vector a -> Element (Vector a) # ofoldl1Ex' :: (Element (Vector a) -> Element (Vector a) -> Element (Vector a)) -> Vector a -> Element (Vector a) # headEx :: Vector a -> Element (Vector a) # lastEx :: Vector a -> Element (Vector a) # unsafeHead :: Vector a -> Element (Vector a) # unsafeLast :: Vector a -> Element (Vector a) # maximumByEx :: (Element (Vector a) -> Element (Vector a) -> Ordering) -> Vector a -> Element (Vector a) # minimumByEx :: (Element (Vector a) -> Element (Vector a) -> Ordering) -> Vector a -> Element (Vector a) # oelem :: Element (Vector a) -> Vector a -> Bool # onotElem :: Element (Vector a) -> Vector a -> Bool #
Unbox a => MonoFoldable (Vector a)
Instance details Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element (Vector a) -> m) -> Vector a -> m # ofoldr :: (Element (Vector a) -> b -> b) -> b -> Vector a -> b # ofoldl' :: (a0 -> Element (Vector a) -> a0) -> a0 -> Vector a -> a0 # otoList :: Vector a -> [Element (Vector a)] # oall :: (Element (Vector a) -> Bool) -> Vector a -> Bool # oany :: (Element (Vector a) -> Bool) -> Vector a -> Bool # onull :: Vector a -> Bool # olength :: Vector a -> Int # olength64 :: Vector a -> Int64 # ocompareLength :: Integral i => Vector a -> i -> Ordering # otraverse_ :: Applicative f => (Element (Vector a) -> f b) -> Vector a -> f () # ofor_ :: Applicative f => Vector a -> (Element (Vector a) -> f b) -> f () # omapM_ :: Applicative m => (Element (Vector a) -> m ()) -> Vector a -> m () # oforM_ :: Applicative m => Vector a -> (Element (Vector a) -> m ()) -> m () # ofoldlM :: Monad m => (a0 -> Element (Vector a) -> m a0) -> a0 -> Vector a -> m a0 # ofoldMap1Ex :: Semigroup m => (Element (Vector a) -> m) -> Vector a -> m # ofoldr1Ex :: (Element (Vector a) -> Element (Vector a) -> Element (Vector a)) -> Vector a -> Element (Vector a) # ofoldl1Ex' :: (Element (Vector a) -> Element (Vector a) -> Element (Vector a)) -> Vector a -> Element (Vector a) # headEx :: Vector a -> Element (Vector a) # lastEx :: Vector a -> Element (Vector a) # unsafeHead :: Vector a -> Element (Vector a) # unsafeLast :: Vector a -> Element (Vector a) # maximumByEx :: (Element (Vector a) -> Element (Vector a) -> Ordering) -> Vector a -> Element (Vector a) # minimumByEx :: (Element (Vector a) -> Element (Vector a) -> Ordering) -> Vector a -> Element (Vector a) # oelem :: Element (Vector a) -> Vector a -> Bool # onotElem :: Element (Vector a) -> Vector a -> Bool #
MonoFoldable (Either a b)
Instance details 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 # onull :: 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) # oelem :: Element (Either a b) -> Either a b -> Bool # onotElem :: Element (Either a b) -> Either a b -> Bool #
MonoFoldable (V1 a)	Since: mono-traversable-1.0.11.0
Instance details Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element (V1 a) -> m) -> V1 a -> m # ofoldr :: (Element (V1 a) -> b -> b) -> b -> V1 a -> b # ofoldl' :: (a0 -> Element (V1 a) -> a0) -> a0 -> V1 a -> a0 # otoList :: V1 a -> [Element (V1 a)] # oall :: (Element (V1 a) -> Bool) -> V1 a -> Bool # oany :: (Element (V1 a) -> Bool) -> V1 a -> Bool # onull :: V1 a -> Bool # olength :: V1 a -> Int # olength64 :: V1 a -> Int64 # ocompareLength :: Integral i => V1 a -> i -> Ordering # otraverse_ :: Applicative f => (Element (V1 a) -> f b) -> V1 a -> f () # ofor_ :: Applicative f => V1 a -> (Element (V1 a) -> f b) -> f () # omapM_ :: Applicative m => (Element (V1 a) -> m ()) -> V1 a -> m () # oforM_ :: Applicative m => V1 a -> (Element (V1 a) -> m ()) -> m () # ofoldlM :: Monad m => (a0 -> Element (V1 a) -> m a0) -> a0 -> V1 a -> m a0 # ofoldMap1Ex :: Semigroup m => (Element (V1 a) -> m) -> V1 a -> m # ofoldr1Ex :: (Element (V1 a) -> Element (V1 a) -> Element (V1 a)) -> V1 a -> Element (V1 a) # ofoldl1Ex' :: (Element (V1 a) -> Element (V1 a) -> Element (V1 a)) -> V1 a -> Element (V1 a) # headEx :: V1 a -> Element (V1 a) # lastEx :: V1 a -> Element (V1 a) # unsafeHead :: V1 a -> Element (V1 a) # unsafeLast :: V1 a -> Element (V1 a) # maximumByEx :: (Element (V1 a) -> Element (V1 a) -> Ordering) -> V1 a -> Element (V1 a) # minimumByEx :: (Element (V1 a) -> Element (V1 a) -> Ordering) -> V1 a -> Element (V1 a) # oelem :: Element (V1 a) -> V1 a -> Bool # onotElem :: Element (V1 a) -> V1 a -> Bool #
MonoFoldable (U1 a)	Since: mono-traversable-1.0.11.0
Instance details Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element (U1 a) -> m) -> U1 a -> m # ofoldr :: (Element (U1 a) -> b -> b) -> b -> U1 a -> b # ofoldl' :: (a0 -> Element (U1 a) -> a0) -> a0 -> U1 a -> a0 # otoList :: U1 a -> [Element (U1 a)] # oall :: (Element (U1 a) -> Bool) -> U1 a -> Bool # oany :: (Element (U1 a) -> Bool) -> U1 a -> Bool # onull :: U1 a -> Bool # olength :: U1 a -> Int # olength64 :: U1 a -> Int64 # ocompareLength :: Integral i => U1 a -> i -> Ordering # otraverse_ :: Applicative f => (Element (U1 a) -> f b) -> U1 a -> f () # ofor_ :: Applicative f => U1 a -> (Element (U1 a) -> f b) -> f () # omapM_ :: Applicative m => (Element (U1 a) -> m ()) -> U1 a -> m () # oforM_ :: Applicative m => U1 a -> (Element (U1 a) -> m ()) -> m () # ofoldlM :: Monad m => (a0 -> Element (U1 a) -> m a0) -> a0 -> U1 a -> m a0 # ofoldMap1Ex :: Semigroup m => (Element (U1 a) -> m) -> U1 a -> m # ofoldr1Ex :: (Element (U1 a) -> Element (U1 a) -> Element (U1 a)) -> U1 a -> Element (U1 a) # ofoldl1Ex' :: (Element (U1 a) -> Element (U1 a) -> Element (U1 a)) -> U1 a -> Element (U1 a) # headEx :: U1 a -> Element (U1 a) # lastEx :: U1 a -> Element (U1 a) # unsafeHead :: U1 a -> Element (U1 a) # unsafeLast :: U1 a -> Element (U1 a) # maximumByEx :: (Element (U1 a) -> Element (U1 a) -> Ordering) -> U1 a -> Element (U1 a) # minimumByEx :: (Element (U1 a) -> Element (U1 a) -> Ordering) -> U1 a -> Element (U1 a) # oelem :: Element (U1 a) -> U1 a -> Bool # onotElem :: Element (U1 a) -> U1 a -> Bool #
MonoFoldable (a, b)
Instance details Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element (a, b) -> m) -> (a, b) -> m # ofoldr :: (Element (a, b) -> b0 -> b0) -> b0 -> (a, b) -> b0 # ofoldl' :: (a0 -> Element (a, b) -> a0) -> a0 -> (a, b) -> a0 # otoList :: (a, b) -> [Element (a, b)] # oall :: (Element (a, b) -> Bool) -> (a, b) -> Bool # oany :: (Element (a, b) -> Bool) -> (a, b) -> Bool # onull :: (a, b) -> Bool # olength :: (a, b) -> Int # olength64 :: (a, b) -> Int64 # ocompareLength :: Integral i => (a, b) -> i -> Ordering # otraverse_ :: Applicative f => (Element (a, b) -> f b0) -> (a, b) -> f () # ofor_ :: Applicative f => (a, b) -> (Element (a, b) -> f b0) -> f () # omapM_ :: Applicative m => (Element (a, b) -> m ()) -> (a, b) -> m () # oforM_ :: Applicative m => (a, b) -> (Element (a, b) -> m ()) -> m () # ofoldlM :: Monad m => (a0 -> Element (a, b) -> m a0) -> a0 -> (a, b) -> m a0 # ofoldMap1Ex :: Semigroup m => (Element (a, b) -> m) -> (a, b) -> m # ofoldr1Ex :: (Element (a, b) -> Element (a, b) -> Element (a, b)) -> (a, b) -> Element (a, b) # ofoldl1Ex' :: (Element (a, b) -> Element (a, b) -> Element (a, b)) -> (a, b) -> Element (a, b) # headEx :: (a, b) -> Element (a, b) # lastEx :: (a, b) -> Element (a, b) # unsafeHead :: (a, b) -> Element (a, b) # unsafeLast :: (a, b) -> Element (a, b) # maximumByEx :: (Element (a, b) -> Element (a, b) -> Ordering) -> (a, b) -> Element (a, b) # minimumByEx :: (Element (a, b) -> Element (a, b) -> Ordering) -> (a, b) -> Element (a, b) # oelem :: Element (a, b) -> (a, b) -> Bool # onotElem :: Element (a, b) -> (a, b) -> Bool #
MonoFoldable (Map k v)
Instance details 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 # onull :: Map k v -> Bool # olength :: Map k v -> Int # 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) # oelem :: Element (Map k v) -> Map k v -> Bool # onotElem :: Element (Map k v) -> Map k v -> Bool #
MonoFoldable (HashMap k v)
Instance details 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) # oelem :: Element (HashMap k v) -> HashMap k v -> Bool # onotElem :: Element (HashMap k v) -> HashMap k v -> Bool #
MonoFoldable (Proxy a)	Since: mono-traversable-1.0.11.0
Instance details Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element (Proxy a) -> m) -> Proxy a -> m # ofoldr :: (Element (Proxy a) -> b -> b) -> b -> Proxy a -> b # ofoldl' :: (a0 -> Element (Proxy a) -> a0) -> a0 -> Proxy a -> a0 # otoList :: Proxy a -> [Element (Proxy a)] # oall :: (Element (Proxy a) -> Bool) -> Proxy a -> Bool # oany :: (Element (Proxy a) -> Bool) -> Proxy a -> Bool # onull :: Proxy a -> Bool # olength :: Proxy a -> Int # olength64 :: Proxy a -> Int64 # ocompareLength :: Integral i => Proxy a -> i -> Ordering # otraverse_ :: Applicative f => (Element (Proxy a) -> f b) -> Proxy a -> f () # ofor_ :: Applicative f => Proxy a -> (Element (Proxy a) -> f b) -> f () # omapM_ :: Applicative m => (Element (Proxy a) -> m ()) -> Proxy a -> m () # oforM_ :: Applicative m => Proxy a -> (Element (Proxy a) -> m ()) -> m () # ofoldlM :: Monad m => (a0 -> Element (Proxy a) -> m a0) -> a0 -> Proxy a -> m a0 # ofoldMap1Ex :: Semigroup m => (Element (Proxy a) -> m) -> Proxy a -> m # ofoldr1Ex :: (Element (Proxy a) -> Element (Proxy a) -> Element (Proxy a)) -> Proxy a -> Element (Proxy a) # ofoldl1Ex' :: (Element (Proxy a) -> Element (Proxy a) -> Element (Proxy a)) -> Proxy a -> Element (Proxy a) # headEx :: Proxy a -> Element (Proxy a) # lastEx :: Proxy a -> Element (Proxy a) # unsafeHead :: Proxy a -> Element (Proxy a) # unsafeLast :: Proxy a -> Element (Proxy a) # maximumByEx :: (Element (Proxy a) -> Element (Proxy a) -> Ordering) -> Proxy a -> Element (Proxy a) # minimumByEx :: (Element (Proxy a) -> Element (Proxy a) -> Ordering) -> Proxy a -> Element (Proxy a) # oelem :: Element (Proxy a) -> Proxy a -> Bool # onotElem :: Element (Proxy a) -> Proxy a -> Bool #
Foldable f => MonoFoldable (MaybeT f a)
Instance details Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element (MaybeT f a) -> m) -> MaybeT f a -> m # ofoldr :: (Element (MaybeT f a) -> b -> b) -> b -> MaybeT f a -> b # ofoldl' :: (a0 -> Element (MaybeT f a) -> a0) -> a0 -> MaybeT f a -> a0 # otoList :: MaybeT f a -> [Element (MaybeT f a)] # oall :: (Element (MaybeT f a) -> Bool) -> MaybeT f a -> Bool # oany :: (Element (MaybeT f a) -> Bool) -> MaybeT f a -> Bool # onull :: MaybeT f a -> Bool # olength :: MaybeT f a -> Int # olength64 :: MaybeT f a -> Int64 # ocompareLength :: Integral i => MaybeT f a -> i -> Ordering # otraverse_ :: Applicative f0 => (Element (MaybeT f a) -> f0 b) -> MaybeT f a -> f0 () # ofor_ :: Applicative f0 => MaybeT f a -> (Element (MaybeT f a) -> f0 b) -> f0 () # omapM_ :: Applicative m => (Element (MaybeT f a) -> m ()) -> MaybeT f a -> m () # oforM_ :: Applicative m => MaybeT f a -> (Element (MaybeT f a) -> m ()) -> m () # ofoldlM :: Monad m => (a0 -> Element (MaybeT f a) -> m a0) -> a0 -> MaybeT f a -> m a0 # ofoldMap1Ex :: Semigroup m => (Element (MaybeT f a) -> m) -> MaybeT f a -> m # ofoldr1Ex :: (Element (MaybeT f a) -> Element (MaybeT f a) -> Element (MaybeT f a)) -> MaybeT f a -> Element (MaybeT f a) # ofoldl1Ex' :: (Element (MaybeT f a) -> Element (MaybeT f a) -> Element (MaybeT f a)) -> MaybeT f a -> Element (MaybeT f a) # headEx :: MaybeT f a -> Element (MaybeT f a) # lastEx :: MaybeT f a -> Element (MaybeT f a) # unsafeHead :: MaybeT f a -> Element (MaybeT f a) # unsafeLast :: MaybeT f a -> Element (MaybeT f a) # maximumByEx :: (Element (MaybeT f a) -> Element (MaybeT f a) -> Ordering) -> MaybeT f a -> Element (MaybeT f a) # minimumByEx :: (Element (MaybeT f a) -> Element (MaybeT f a) -> Ordering) -> MaybeT f a -> Element (MaybeT f a) # oelem :: Element (MaybeT f a) -> MaybeT f a -> Bool # onotElem :: Element (MaybeT f a) -> MaybeT f a -> Bool #
Foldable f => MonoFoldable (ListT f a)
Instance details Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element (ListT f a) -> m) -> ListT f a -> m # ofoldr :: (Element (ListT f a) -> b -> b) -> b -> ListT f a -> b # ofoldl' :: (a0 -> Element (ListT f a) -> a0) -> a0 -> ListT f a -> a0 # otoList :: ListT f a -> [Element (ListT f a)] # oall :: (Element (ListT f a) -> Bool) -> ListT f a -> Bool # oany :: (Element (ListT f a) -> Bool) -> ListT f a -> Bool # onull :: ListT f a -> Bool # olength :: ListT f a -> Int # olength64 :: ListT f a -> Int64 # ocompareLength :: Integral i => ListT f a -> i -> Ordering # otraverse_ :: Applicative f0 => (Element (ListT f a) -> f0 b) -> ListT f a -> f0 () # ofor_ :: Applicative f0 => ListT f a -> (Element (ListT f a) -> f0 b) -> f0 () # omapM_ :: Applicative m => (Element (ListT f a) -> m ()) -> ListT f a -> m () # oforM_ :: Applicative m => ListT f a -> (Element (ListT f a) -> m ()) -> m () # ofoldlM :: Monad m => (a0 -> Element (ListT f a) -> m a0) -> a0 -> ListT f a -> m a0 # ofoldMap1Ex :: Semigroup m => (Element (ListT f a) -> m) -> ListT f a -> m # ofoldr1Ex :: (Element (ListT f a) -> Element (ListT f a) -> Element (ListT f a)) -> ListT f a -> Element (ListT f a) # ofoldl1Ex' :: (Element (ListT f a) -> Element (ListT f a) -> Element (ListT f a)) -> ListT f a -> Element (ListT f a) # headEx :: ListT f a -> Element (ListT f a) # lastEx :: ListT f a -> Element (ListT f a) # unsafeHead :: ListT f a -> Element (ListT f a) # unsafeLast :: ListT f a -> Element (ListT f a) # maximumByEx :: (Element (ListT f a) -> Element (ListT f a) -> Ordering) -> ListT f a -> Element (ListT f a) # minimumByEx :: (Element (ListT f a) -> Element (ListT f a) -> Ordering) -> ListT f a -> Element (ListT f a) # oelem :: Element (ListT f a) -> ListT f a -> Bool # onotElem :: Element (ListT f a) -> ListT f a -> Bool #
SingI ns => MonoFoldable (Matrix ns a) Source #
Instance details Defined in Termonad.Config.Vec Methods ofoldMap :: Monoid m => (Element (Matrix ns a) -> m) -> Matrix ns a -> m # ofoldr :: (Element (Matrix ns a) -> b -> b) -> b -> Matrix ns a -> b # ofoldl' :: (a0 -> Element (Matrix ns a) -> a0) -> a0 -> Matrix ns a -> a0 # otoList :: Matrix ns a -> [Element (Matrix ns a)] # oall :: (Element (Matrix ns a) -> Bool) -> Matrix ns a -> Bool # oany :: (Element (Matrix ns a) -> Bool) -> Matrix ns a -> Bool # onull :: Matrix ns a -> Bool # olength :: Matrix ns a -> Int # olength64 :: Matrix ns a -> Int64 # ocompareLength :: Integral i => Matrix ns a -> i -> Ordering # otraverse_ :: Applicative f => (Element (Matrix ns a) -> f b) -> Matrix ns a -> f () # ofor_ :: Applicative f => Matrix ns a -> (Element (Matrix ns a) -> f b) -> f () # omapM_ :: Applicative m => (Element (Matrix ns a) -> m ()) -> Matrix ns a -> m () # oforM_ :: Applicative m => Matrix ns a -> (Element (Matrix ns a) -> m ()) -> m () # ofoldlM :: Monad m => (a0 -> Element (Matrix ns a) -> m a0) -> a0 -> Matrix ns a -> m a0 # ofoldMap1Ex :: Semigroup m => (Element (Matrix ns a) -> m) -> Matrix ns a -> m # ofoldr1Ex :: (Element (Matrix ns a) -> Element (Matrix ns a) -> Element (Matrix ns a)) -> Matrix ns a -> Element (Matrix ns a) # ofoldl1Ex' :: (Element (Matrix ns a) -> Element (Matrix ns a) -> Element (Matrix ns a)) -> Matrix ns a -> Element (Matrix ns a) # headEx :: Matrix ns a -> Element (Matrix ns a) # lastEx :: Matrix ns a -> Element (Matrix ns a) # unsafeHead :: Matrix ns a -> Element (Matrix ns a) # unsafeLast :: Matrix ns a -> Element (Matrix ns a) # maximumByEx :: (Element (Matrix ns a) -> Element (Matrix ns a) -> Ordering) -> Matrix ns a -> Element (Matrix ns a) # minimumByEx :: (Element (Matrix ns a) -> Element (Matrix ns a) -> Ordering) -> Matrix ns a -> Element (Matrix ns a) # oelem :: Element (Matrix ns a) -> Matrix ns a -> Bool # onotElem :: Element (Matrix ns a) -> Matrix ns a -> Bool #
MonoFoldable (Vec n a) Source #
Instance details Defined in Termonad.Config.Vec Methods ofoldMap :: Monoid m => (Element (Vec n a) -> m) -> Vec n a -> m # ofoldr :: (Element (Vec n a) -> b -> b) -> b -> Vec n a -> b # ofoldl' :: (a0 -> Element (Vec n a) -> a0) -> a0 -> Vec n a -> a0 # otoList :: Vec n a -> [Element (Vec n a)] # oall :: (Element (Vec n a) -> Bool) -> Vec n a -> Bool # oany :: (Element (Vec n a) -> Bool) -> Vec n a -> Bool # onull :: Vec n a -> Bool # olength :: Vec n a -> Int # olength64 :: Vec n a -> Int64 # ocompareLength :: Integral i => Vec n a -> i -> Ordering # otraverse_ :: Applicative f => (Element (Vec n a) -> f b) -> Vec n a -> f () # ofor_ :: Applicative f => Vec n a -> (Element (Vec n a) -> f b) -> f () # omapM_ :: Applicative m => (Element (Vec n a) -> m ()) -> Vec n a -> m () # oforM_ :: Applicative m => Vec n a -> (Element (Vec n a) -> m ()) -> m () # ofoldlM :: Monad m => (a0 -> Element (Vec n a) -> m a0) -> a0 -> Vec n a -> m a0 # ofoldMap1Ex :: Semigroup m => (Element (Vec n a) -> m) -> Vec n a -> m # ofoldr1Ex :: (Element (Vec n a) -> Element (Vec n a) -> Element (Vec n a)) -> Vec n a -> Element (Vec n a) # ofoldl1Ex' :: (Element (Vec n a) -> Element (Vec n a) -> Element (Vec n a)) -> Vec n a -> Element (Vec n a) # headEx :: Vec n a -> Element (Vec n a) # lastEx :: Vec n a -> Element (Vec n a) # unsafeHead :: Vec n a -> Element (Vec n a) # unsafeLast :: Vec n a -> Element (Vec n a) # maximumByEx :: (Element (Vec n a) -> Element (Vec n a) -> Ordering) -> Vec n a -> Element (Vec n a) # minimumByEx :: (Element (Vec n a) -> Element (Vec n a) -> Ordering) -> Vec n a -> Element (Vec n a) # oelem :: Element (Vec n a) -> Vec n a -> Bool # onotElem :: Element (Vec n a) -> Vec n a -> Bool #
Foldable f => MonoFoldable (Rec1 f a)	Since: mono-traversable-1.0.11.0
Instance details Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element (Rec1 f a) -> m) -> Rec1 f a -> m # ofoldr :: (Element (Rec1 f a) -> b -> b) -> b -> Rec1 f a -> b # ofoldl' :: (a0 -> Element (Rec1 f a) -> a0) -> a0 -> Rec1 f a -> a0 # otoList :: Rec1 f a -> [Element (Rec1 f a)] # oall :: (Element (Rec1 f a) -> Bool) -> Rec1 f a -> Bool # oany :: (Element (Rec1 f a) -> Bool) -> Rec1 f a -> Bool # onull :: Rec1 f a -> Bool # olength :: Rec1 f a -> Int # olength64 :: Rec1 f a -> Int64 # ocompareLength :: Integral i => Rec1 f a -> i -> Ordering # otraverse_ :: Applicative f0 => (Element (Rec1 f a) -> f0 b) -> Rec1 f a -> f0 () # ofor_ :: Applicative f0 => Rec1 f a -> (Element (Rec1 f a) -> f0 b) -> f0 () # omapM_ :: Applicative m => (Element (Rec1 f a) -> m ()) -> Rec1 f a -> m () # oforM_ :: Applicative m => Rec1 f a -> (Element (Rec1 f a) -> m ()) -> m () # ofoldlM :: Monad m => (a0 -> Element (Rec1 f a) -> m a0) -> a0 -> Rec1 f a -> m a0 # ofoldMap1Ex :: Semigroup m => (Element (Rec1 f a) -> m) -> Rec1 f a -> m # ofoldr1Ex :: (Element (Rec1 f a) -> Element (Rec1 f a) -> Element (Rec1 f a)) -> Rec1 f a -> Element (Rec1 f a) # ofoldl1Ex' :: (Element (Rec1 f a) -> Element (Rec1 f a) -> Element (Rec1 f a)) -> Rec1 f a -> Element (Rec1 f a) # headEx :: Rec1 f a -> Element (Rec1 f a) # lastEx :: Rec1 f a -> Element (Rec1 f a) # unsafeHead :: Rec1 f a -> Element (Rec1 f a) # unsafeLast :: Rec1 f a -> Element (Rec1 f a) # maximumByEx :: (Element (Rec1 f a) -> Element (Rec1 f a) -> Ordering) -> Rec1 f a -> Element (Rec1 f a) # minimumByEx :: (Element (Rec1 f a) -> Element (Rec1 f a) -> Ordering) -> Rec1 f a -> Element (Rec1 f a) # oelem :: Element (Rec1 f a) -> Rec1 f a -> Bool # onotElem :: Element (Rec1 f a) -> Rec1 f a -> Bool #
MonoFoldable (Const m a)
Instance details Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m0 => (Element (Const m a) -> m0) -> Const m a -> m0 # ofoldr :: (Element (Const m a) -> b -> b) -> b -> Const m a -> b # ofoldl' :: (a0 -> Element (Const m a) -> a0) -> a0 -> Const m a -> a0 # otoList :: Const m a -> [Element (Const m a)] # oall :: (Element (Const m a) -> Bool) -> Const m a -> Bool # oany :: (Element (Const m a) -> Bool) -> Const m a -> Bool # onull :: Const m a -> Bool # olength :: Const m a -> Int # olength64 :: Const m a -> Int64 # ocompareLength :: Integral i => Const m a -> i -> Ordering # otraverse_ :: Applicative f => (Element (Const m a) -> f b) -> Const m a -> f () # ofor_ :: Applicative f => Const m a -> (Element (Const m a) -> f b) -> f () # omapM_ :: Applicative m0 => (Element (Const m a) -> m0 ()) -> Const m a -> m0 () # oforM_ :: Applicative m0 => Const m a -> (Element (Const m a) -> m0 ()) -> m0 () # ofoldlM :: Monad m0 => (a0 -> Element (Const m a) -> m0 a0) -> a0 -> Const m a -> m0 a0 # ofoldMap1Ex :: Semigroup m0 => (Element (Const m a) -> m0) -> Const m a -> m0 # ofoldr1Ex :: (Element (Const m a) -> Element (Const m a) -> Element (Const m a)) -> Const m a -> Element (Const m a) # ofoldl1Ex' :: (Element (Const m a) -> Element (Const m a) -> Element (Const m a)) -> Const m a -> Element (Const m a) # headEx :: Const m a -> Element (Const m a) # lastEx :: Const m a -> Element (Const m a) # unsafeHead :: Const m a -> Element (Const m a) # unsafeLast :: Const m a -> Element (Const m a) # maximumByEx :: (Element (Const m a) -> Element (Const m a) -> Ordering) -> Const m a -> Element (Const m a) # minimumByEx :: (Element (Const m a) -> Element (Const m a) -> Ordering) -> Const m a -> Element (Const m a) # oelem :: Element (Const m a) -> Const m a -> Bool # onotElem :: Element (Const m a) -> Const m a -> Bool #
Foldable f => MonoFoldable (IdentityT f a)
Instance details Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element (IdentityT f a) -> m) -> IdentityT f a -> m # ofoldr :: (Element (IdentityT f a) -> b -> b) -> b -> IdentityT f a -> b # ofoldl' :: (a0 -> Element (IdentityT f a) -> a0) -> a0 -> IdentityT f a -> a0 # otoList :: IdentityT f a -> [Element (IdentityT f a)] # oall :: (Element (IdentityT f a) -> Bool) -> IdentityT f a -> Bool # oany :: (Element (IdentityT f a) -> Bool) -> IdentityT f a -> Bool # onull :: IdentityT f a -> Bool # olength :: IdentityT f a -> Int # olength64 :: IdentityT f a -> Int64 # ocompareLength :: Integral i => IdentityT f a -> i -> Ordering # otraverse_ :: Applicative f0 => (Element (IdentityT f a) -> f0 b) -> IdentityT f a -> f0 () # ofor_ :: Applicative f0 => IdentityT f a -> (Element (IdentityT f a) -> f0 b) -> f0 () # omapM_ :: Applicative m => (Element (IdentityT f a) -> m ()) -> IdentityT f a -> m () # oforM_ :: Applicative m => IdentityT f a -> (Element (IdentityT f a) -> m ()) -> m () # ofoldlM :: Monad m => (a0 -> Element (IdentityT f a) -> m a0) -> a0 -> IdentityT f a -> m a0 # ofoldMap1Ex :: Semigroup m => (Element (IdentityT f a) -> m) -> IdentityT f a -> m # ofoldr1Ex :: (Element (IdentityT f a) -> Element (IdentityT f a) -> Element (IdentityT f a)) -> IdentityT f a -> Element (IdentityT f a) # ofoldl1Ex' :: (Element (IdentityT f a) -> Element (IdentityT f a) -> Element (IdentityT f a)) -> IdentityT f a -> Element (IdentityT f a) # headEx :: IdentityT f a -> Element (IdentityT f a) # lastEx :: IdentityT f a -> Element (IdentityT f a) # unsafeHead :: IdentityT f a -> Element (IdentityT f a) # unsafeLast :: IdentityT f a -> Element (IdentityT f a) # maximumByEx :: (Element (IdentityT f a) -> Element (IdentityT f a) -> Ordering) -> IdentityT f a -> Element (IdentityT f a) # minimumByEx :: (Element (IdentityT f a) -> Element (IdentityT f a) -> Ordering) -> IdentityT f a -> Element (IdentityT f a) # oelem :: Element (IdentityT f a) -> IdentityT f a -> Bool # onotElem :: Element (IdentityT f a) -> IdentityT f a -> Bool #
Foldable f => MonoFoldable (WriterT w f a)
Instance details Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element (WriterT w f a) -> m) -> WriterT w f a -> m # ofoldr :: (Element (WriterT w f a) -> b -> b) -> b -> WriterT w f a -> b # ofoldl' :: (a0 -> Element (WriterT w f a) -> a0) -> a0 -> WriterT w f a -> a0 # otoList :: WriterT w f a -> [Element (WriterT w f a)] # oall :: (Element (WriterT w f a) -> Bool) -> WriterT w f a -> Bool # oany :: (Element (WriterT w f a) -> Bool) -> WriterT w f a -> Bool # onull :: WriterT w f a -> Bool # olength :: WriterT w f a -> Int # olength64 :: WriterT w f a -> Int64 # ocompareLength :: Integral i => WriterT w f a -> i -> Ordering # otraverse_ :: Applicative f0 => (Element (WriterT w f a) -> f0 b) -> WriterT w f a -> f0 () # ofor_ :: Applicative f0 => WriterT w f a -> (Element (WriterT w f a) -> f0 b) -> f0 () # omapM_ :: Applicative m => (Element (WriterT w f a) -> m ()) -> WriterT w f a -> m () # oforM_ :: Applicative m => WriterT w f a -> (Element (WriterT w f a) -> m ()) -> m () # ofoldlM :: Monad m => (a0 -> Element (WriterT w f a) -> m a0) -> a0 -> WriterT w f a -> m a0 # ofoldMap1Ex :: Semigroup m => (Element (WriterT w f a) -> m) -> WriterT w f a -> m # ofoldr1Ex :: (Element (WriterT w f a) -> Element (WriterT w f a) -> Element (WriterT w f a)) -> WriterT w f a -> Element (WriterT w f a) # ofoldl1Ex' :: (Element (WriterT w f a) -> Element (WriterT w f a) -> Element (WriterT w f a)) -> WriterT w f a -> Element (WriterT w f a) # headEx :: WriterT w f a -> Element (WriterT w f a) # lastEx :: WriterT w f a -> Element (WriterT w f a) # unsafeHead :: WriterT w f a -> Element (WriterT w f a) # unsafeLast :: WriterT w f a -> Element (WriterT w f a) # maximumByEx :: (Element (WriterT w f a) -> Element (WriterT w f a) -> Ordering) -> WriterT w f a -> Element (WriterT w f a) # minimumByEx :: (Element (WriterT w f a) -> Element (WriterT w f a) -> Ordering) -> WriterT w f a -> Element (WriterT w f a) # oelem :: Element (WriterT w f a) -> WriterT w f a -> Bool # onotElem :: Element (WriterT w f a) -> WriterT w f a -> Bool #
Foldable f => MonoFoldable (WriterT w f a)
Instance details Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element (WriterT w f a) -> m) -> WriterT w f a -> m # ofoldr :: (Element (WriterT w f a) -> b -> b) -> b -> WriterT w f a -> b # ofoldl' :: (a0 -> Element (WriterT w f a) -> a0) -> a0 -> WriterT w f a -> a0 # otoList :: WriterT w f a -> [Element (WriterT w f a)] # oall :: (Element (WriterT w f a) -> Bool) -> WriterT w f a -> Bool # oany :: (Element (WriterT w f a) -> Bool) -> WriterT w f a -> Bool # onull :: WriterT w f a -> Bool # olength :: WriterT w f a -> Int # olength64 :: WriterT w f a -> Int64 # ocompareLength :: Integral i => WriterT w f a -> i -> Ordering # otraverse_ :: Applicative f0 => (Element (WriterT w f a) -> f0 b) -> WriterT w f a -> f0 () # ofor_ :: Applicative f0 => WriterT w f a -> (Element (WriterT w f a) -> f0 b) -> f0 () # omapM_ :: Applicative m => (Element (WriterT w f a) -> m ()) -> WriterT w f a -> m () # oforM_ :: Applicative m => WriterT w f a -> (Element (WriterT w f a) -> m ()) -> m () # ofoldlM :: Monad m => (a0 -> Element (WriterT w f a) -> m a0) -> a0 -> WriterT w f a -> m a0 # ofoldMap1Ex :: Semigroup m => (Element (WriterT w f a) -> m) -> WriterT w f a -> m # ofoldr1Ex :: (Element (WriterT w f a) -> Element (WriterT w f a) -> Element (WriterT w f a)) -> WriterT w f a -> Element (WriterT w f a) # ofoldl1Ex' :: (Element (WriterT w f a) -> Element (WriterT w f a) -> Element (WriterT w f a)) -> WriterT w f a -> Element (WriterT w f a) # headEx :: WriterT w f a -> Element (WriterT w f a) # lastEx :: WriterT w f a -> Element (WriterT w f a) # unsafeHead :: WriterT w f a -> Element (WriterT w f a) # unsafeLast :: WriterT w f a -> Element (WriterT w f a) # maximumByEx :: (Element (WriterT w f a) -> Element (WriterT w f a) -> Ordering) -> WriterT w f a -> Element (WriterT w f a) # minimumByEx :: (Element (WriterT w f a) -> Element (WriterT w f a) -> Ordering) -> WriterT w f a -> Element (WriterT w f a) # oelem :: Element (WriterT w f a) -> WriterT w f a -> Bool # onotElem :: Element (WriterT w f a) -> WriterT w f a -> Bool #
MonoFoldable (K1 i c a)	Since: mono-traversable-1.0.11.0
Instance details Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element (K1 i c a) -> m) -> K1 i c a -> m # ofoldr :: (Element (K1 i c a) -> b -> b) -> b -> K1 i c a -> b # ofoldl' :: (a0 -> Element (K1 i c a) -> a0) -> a0 -> K1 i c a -> a0 # otoList :: K1 i c a -> [Element (K1 i c a)] # oall :: (Element (K1 i c a) -> Bool) -> K1 i c a -> Bool # oany :: (Element (K1 i c a) -> Bool) -> K1 i c a -> Bool # onull :: K1 i c a -> Bool # olength :: K1 i c a -> Int # olength64 :: K1 i c a -> Int64 # ocompareLength :: Integral i0 => K1 i c a -> i0 -> Ordering # otraverse_ :: Applicative f => (Element (K1 i c a) -> f b) -> K1 i c a -> f () # ofor_ :: Applicative f => K1 i c a -> (Element (K1 i c a) -> f b) -> f () # omapM_ :: Applicative m => (Element (K1 i c a) -> m ()) -> K1 i c a -> m () # oforM_ :: Applicative m => K1 i c a -> (Element (K1 i c a) -> m ()) -> m () # ofoldlM :: Monad m => (a0 -> Element (K1 i c a) -> m a0) -> a0 -> K1 i c a -> m a0 # ofoldMap1Ex :: Semigroup m => (Element (K1 i c a) -> m) -> K1 i c a -> m # ofoldr1Ex :: (Element (K1 i c a) -> Element (K1 i c a) -> Element (K1 i c a)) -> K1 i c a -> Element (K1 i c a) # ofoldl1Ex' :: (Element (K1 i c a) -> Element (K1 i c a) -> Element (K1 i c a)) -> K1 i c a -> Element (K1 i c a) # headEx :: K1 i c a -> Element (K1 i c a) # lastEx :: K1 i c a -> Element (K1 i c a) # unsafeHead :: K1 i c a -> Element (K1 i c a) # unsafeLast :: K1 i c a -> Element (K1 i c a) # maximumByEx :: (Element (K1 i c a) -> Element (K1 i c a) -> Ordering) -> K1 i c a -> Element (K1 i c a) # minimumByEx :: (Element (K1 i c a) -> Element (K1 i c a) -> Ordering) -> K1 i c a -> Element (K1 i c a) # oelem :: Element (K1 i c a) -> K1 i c a -> Bool # onotElem :: Element (K1 i c a) -> K1 i c a -> Bool #
(Foldable f, Foldable g) => MonoFoldable ((f :+: g) a)	Since: mono-traversable-1.0.11.0
Instance details Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element ((f :+: g) a) -> m) -> (f :+: g) a -> m # ofoldr :: (Element ((f :+: g) a) -> b -> b) -> b -> (f :+: g) a -> b # ofoldl' :: (a0 -> Element ((f :+: g) a) -> a0) -> a0 -> (f :+: g) a -> a0 # otoList :: (f :+: g) a -> [Element ((f :+: g) a)] # oall :: (Element ((f :+: g) a) -> Bool) -> (f :+: g) a -> Bool # oany :: (Element ((f :+: g) a) -> Bool) -> (f :+: g) a -> Bool # onull :: (f :+: g) a -> Bool # olength :: (f :+: g) a -> Int # olength64 :: (f :+: g) a -> Int64 # ocompareLength :: Integral i => (f :+: g) a -> i -> Ordering # otraverse_ :: Applicative f0 => (Element ((f :+: g) a) -> f0 b) -> (f :+: g) a -> f0 () # ofor_ :: Applicative f0 => (f :+: g) a -> (Element ((f :+: g) a) -> f0 b) -> f0 () # omapM_ :: Applicative m => (Element ((f :+: g) a) -> m ()) -> (f :+: g) a -> m () # oforM_ :: Applicative m => (f :+: g) a -> (Element ((f :+: g) a) -> m ()) -> m () # ofoldlM :: Monad m => (a0 -> Element ((f :+: g) a) -> m a0) -> a0 -> (f :+: g) a -> m a0 # ofoldMap1Ex :: Semigroup m => (Element ((f :+: g) a) -> m) -> (f :+: g) a -> m # ofoldr1Ex :: (Element ((f :+: g) a) -> Element ((f :+: g) a) -> Element ((f :+: g) a)) -> (f :+: g) a -> Element ((f :+: g) a) # ofoldl1Ex' :: (Element ((f :+: g) a) -> Element ((f :+: g) a) -> Element ((f :+: g) a)) -> (f :+: g) a -> Element ((f :+: g) a) # headEx :: (f :+: g) a -> Element ((f :+: g) a) # lastEx :: (f :+: g) a -> Element ((f :+: g) a) # unsafeHead :: (f :+: g) a -> Element ((f :+: g) a) # unsafeLast :: (f :+: g) a -> Element ((f :+: g) a) # maximumByEx :: (Element ((f :+: g) a) -> Element ((f :+: g) a) -> Ordering) -> (f :+: g) a -> Element ((f :+: g) a) # minimumByEx :: (Element ((f :+: g) a) -> Element ((f :+: g) a) -> Ordering) -> (f :+: g) a -> Element ((f :+: g) a) # oelem :: Element ((f :+: g) a) -> (f :+: g) a -> Bool # onotElem :: Element ((f :+: g) a) -> (f :+: g) a -> Bool #
(Foldable f, Foldable g) => MonoFoldable ((f :*: g) a)	Since: mono-traversable-1.0.11.0
Instance details Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element ((f :: g) a) -> m) -> (f :: g) a -> m # ofoldr :: (Element ((f :: g) a) -> b -> b) -> b -> (f :: g) a -> b # ofoldl' :: (a0 -> Element ((f :: g) a) -> a0) -> a0 -> (f :: g) a -> a0 # otoList :: (f :: g) a -> [Element ((f :: g) a)] # oall :: (Element ((f :: g) a) -> Bool) -> (f :: g) a -> Bool # oany :: (Element ((f :: g) a) -> Bool) -> (f :: g) a -> Bool # onull :: (f :: g) a -> Bool # olength :: (f :: g) a -> Int # olength64 :: (f :: g) a -> Int64 # ocompareLength :: Integral i => (f :: g) a -> i -> Ordering # otraverse_ :: Applicative f0 => (Element ((f :: g) a) -> f0 b) -> (f :: g) a -> f0 () # ofor_ :: Applicative f0 => (f :: g) a -> (Element ((f :: g) a) -> f0 b) -> f0 () # omapM_ :: Applicative m => (Element ((f :: g) a) -> m ()) -> (f :: g) a -> m () # oforM_ :: Applicative m => (f :: g) a -> (Element ((f :: g) a) -> m ()) -> m () # ofoldlM :: Monad m => (a0 -> Element ((f :: g) a) -> m a0) -> a0 -> (f :: g) a -> m a0 # ofoldMap1Ex :: Semigroup m => (Element ((f :: g) a) -> m) -> (f :: g) a -> m # ofoldr1Ex :: (Element ((f :: g) a) -> Element ((f :: g) a) -> Element ((f :: g) a)) -> (f :: g) a -> Element ((f :: g) a) # ofoldl1Ex' :: (Element ((f :: g) a) -> Element ((f :: g) a) -> Element ((f :: g) a)) -> (f :: g) a -> Element ((f :: g) a) # headEx :: (f :: g) a -> Element ((f :: g) a) # lastEx :: (f :: g) a -> Element ((f :: g) a) # unsafeHead :: (f :: g) a -> Element ((f :: g) a) # unsafeLast :: (f :: g) a -> Element ((f :: g) a) # maximumByEx :: (Element ((f :: g) a) -> Element ((f :: g) a) -> Ordering) -> (f :: g) a -> Element ((f :: g) a) # minimumByEx :: (Element ((f :: g) a) -> Element ((f :: g) a) -> Ordering) -> (f :: g) a -> Element ((f :: g) a) # oelem :: Element ((f :: g) a) -> (f :: g) a -> Bool # onotElem :: Element ((f :: g) a) -> (f :: g) a -> Bool #
(Foldable f, Foldable g) => MonoFoldable (Product f g a)
Instance details Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element (Product f g a) -> m) -> Product f g a -> m # ofoldr :: (Element (Product f g a) -> b -> b) -> b -> Product f g a -> b # ofoldl' :: (a0 -> Element (Product f g a) -> a0) -> a0 -> Product f g a -> a0 # otoList :: Product f g a -> [Element (Product f g a)] # oall :: (Element (Product f g a) -> Bool) -> Product f g a -> Bool # oany :: (Element (Product f g a) -> Bool) -> Product f g a -> Bool # onull :: Product f g a -> Bool # olength :: Product f g a -> Int # olength64 :: Product f g a -> Int64 # ocompareLength :: Integral i => Product f g a -> i -> Ordering # otraverse_ :: Applicative f0 => (Element (Product f g a) -> f0 b) -> Product f g a -> f0 () # ofor_ :: Applicative f0 => Product f g a -> (Element (Product f g a) -> f0 b) -> f0 () # omapM_ :: Applicative m => (Element (Product f g a) -> m ()) -> Product f g a -> m () # oforM_ :: Applicative m => Product f g a -> (Element (Product f g a) -> m ()) -> m () # ofoldlM :: Monad m => (a0 -> Element (Product f g a) -> m a0) -> a0 -> Product f g a -> m a0 # ofoldMap1Ex :: Semigroup m => (Element (Product f g a) -> m) -> Product f g a -> m # ofoldr1Ex :: (Element (Product f g a) -> Element (Product f g a) -> Element (Product f g a)) -> Product f g a -> Element (Product f g a) # ofoldl1Ex' :: (Element (Product f g a) -> Element (Product f g a) -> Element (Product f g a)) -> Product f g a -> Element (Product f g a) # headEx :: Product f g a -> Element (Product f g a) # lastEx :: Product f g a -> Element (Product f g a) # unsafeHead :: Product f g a -> Element (Product f g a) # unsafeLast :: Product f g a -> Element (Product f g a) # maximumByEx :: (Element (Product f g a) -> Element (Product f g a) -> Ordering) -> Product f g a -> Element (Product f g a) # minimumByEx :: (Element (Product f g a) -> Element (Product f g a) -> Ordering) -> Product f g a -> Element (Product f g a) # oelem :: Element (Product f g a) -> Product f g a -> Bool # onotElem :: Element (Product f g a) -> Product f g a -> Bool #
Foldable f => MonoFoldable (M1 i c f a)	Since: mono-traversable-1.0.11.0
Instance details Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element (M1 i c f a) -> m) -> M1 i c f a -> m # ofoldr :: (Element (M1 i c f a) -> b -> b) -> b -> M1 i c f a -> b # ofoldl' :: (a0 -> Element (M1 i c f a) -> a0) -> a0 -> M1 i c f a -> a0 # otoList :: M1 i c f a -> [Element (M1 i c f a)] # oall :: (Element (M1 i c f a) -> Bool) -> M1 i c f a -> Bool # oany :: (Element (M1 i c f a) -> Bool) -> M1 i c f a -> Bool # onull :: M1 i c f a -> Bool # olength :: M1 i c f a -> Int # olength64 :: M1 i c f a -> Int64 # ocompareLength :: Integral i0 => M1 i c f a -> i0 -> Ordering # otraverse_ :: Applicative f0 => (Element (M1 i c f a) -> f0 b) -> M1 i c f a -> f0 () # ofor_ :: Applicative f0 => M1 i c f a -> (Element (M1 i c f a) -> f0 b) -> f0 () # omapM_ :: Applicative m => (Element (M1 i c f a) -> m ()) -> M1 i c f a -> m () # oforM_ :: Applicative m => M1 i c f a -> (Element (M1 i c f a) -> m ()) -> m () # ofoldlM :: Monad m => (a0 -> Element (M1 i c f a) -> m a0) -> a0 -> M1 i c f a -> m a0 # ofoldMap1Ex :: Semigroup m => (Element (M1 i c f a) -> m) -> M1 i c f a -> m # ofoldr1Ex :: (Element (M1 i c f a) -> Element (M1 i c f a) -> Element (M1 i c f a)) -> M1 i c f a -> Element (M1 i c f a) # ofoldl1Ex' :: (Element (M1 i c f a) -> Element (M1 i c f a) -> Element (M1 i c f a)) -> M1 i c f a -> Element (M1 i c f a) # headEx :: M1 i c f a -> Element (M1 i c f a) # lastEx :: M1 i c f a -> Element (M1 i c f a) # unsafeHead :: M1 i c f a -> Element (M1 i c f a) # unsafeLast :: M1 i c f a -> Element (M1 i c f a) # maximumByEx :: (Element (M1 i c f a) -> Element (M1 i c f a) -> Ordering) -> M1 i c f a -> Element (M1 i c f a) # minimumByEx :: (Element (M1 i c f a) -> Element (M1 i c f a) -> Ordering) -> M1 i c f a -> Element (M1 i c f a) # oelem :: Element (M1 i c f a) -> M1 i c f a -> Bool # onotElem :: Element (M1 i c f a) -> M1 i c f a -> Bool #
(Foldable f, Foldable g) => MonoFoldable ((f :.: g) a)	Since: mono-traversable-1.0.11.0
Instance details Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element ((f :.: g) a) -> m) -> (f :.: g) a -> m # ofoldr :: (Element ((f :.: g) a) -> b -> b) -> b -> (f :.: g) a -> b # ofoldl' :: (a0 -> Element ((f :.: g) a) -> a0) -> a0 -> (f :.: g) a -> a0 # otoList :: (f :.: g) a -> [Element ((f :.: g) a)] # oall :: (Element ((f :.: g) a) -> Bool) -> (f :.: g) a -> Bool # oany :: (Element ((f :.: g) a) -> Bool) -> (f :.: g) a -> Bool # onull :: (f :.: g) a -> Bool # olength :: (f :.: g) a -> Int # olength64 :: (f :.: g) a -> Int64 # ocompareLength :: Integral i => (f :.: g) a -> i -> Ordering # otraverse_ :: Applicative f0 => (Element ((f :.: g) a) -> f0 b) -> (f :.: g) a -> f0 () # ofor_ :: Applicative f0 => (f :.: g) a -> (Element ((f :.: g) a) -> f0 b) -> f0 () # omapM_ :: Applicative m => (Element ((f :.: g) a) -> m ()) -> (f :.: g) a -> m () # oforM_ :: Applicative m => (f :.: g) a -> (Element ((f :.: g) a) -> m ()) -> m () # ofoldlM :: Monad m => (a0 -> Element ((f :.: g) a) -> m a0) -> a0 -> (f :.: g) a -> m a0 # ofoldMap1Ex :: Semigroup m => (Element ((f :.: g) a) -> m) -> (f :.: g) a -> m # ofoldr1Ex :: (Element ((f :.: g) a) -> Element ((f :.: g) a) -> Element ((f :.: g) a)) -> (f :.: g) a -> Element ((f :.: g) a) # ofoldl1Ex' :: (Element ((f :.: g) a) -> Element ((f :.: g) a) -> Element ((f :.: g) a)) -> (f :.: g) a -> Element ((f :.: g) a) # headEx :: (f :.: g) a -> Element ((f :.: g) a) # lastEx :: (f :.: g) a -> Element ((f :.: g) a) # unsafeHead :: (f :.: g) a -> Element ((f :.: g) a) # unsafeLast :: (f :.: g) a -> Element ((f :.: g) a) # maximumByEx :: (Element ((f :.: g) a) -> Element ((f :.: g) a) -> Ordering) -> (f :.: g) a -> Element ((f :.: g) a) # minimumByEx :: (Element ((f :.: g) a) -> Element ((f :.: g) a) -> Ordering) -> (f :.: g) a -> Element ((f :.: g) a) # oelem :: Element ((f :.: g) a) -> (f :.: g) a -> Bool # onotElem :: Element ((f :.: g) a) -> (f :.: g) a -> Bool #
(Foldable f, Foldable g) => MonoFoldable (Compose f g a)
Instance details Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element (Compose f g a) -> m) -> Compose f g a -> m # ofoldr :: (Element (Compose f g a) -> b -> b) -> b -> Compose f g a -> b # ofoldl' :: (a0 -> Element (Compose f g a) -> a0) -> a0 -> Compose f g a -> a0 # otoList :: Compose f g a -> [Element (Compose f g a)] # oall :: (Element (Compose f g a) -> Bool) -> Compose f g a -> Bool # oany :: (Element (Compose f g a) -> Bool) -> Compose f g a -> Bool # onull :: Compose f g a -> Bool # olength :: Compose f g a -> Int # olength64 :: Compose f g a -> Int64 # ocompareLength :: Integral i => Compose f g a -> i -> Ordering # otraverse_ :: Applicative f0 => (Element (Compose f g a) -> f0 b) -> Compose f g a -> f0 () # ofor_ :: Applicative f0 => Compose f g a -> (Element (Compose f g a) -> f0 b) -> f0 () # omapM_ :: Applicative m => (Element (Compose f g a) -> m ()) -> Compose f g a -> m () # oforM_ :: Applicative m => Compose f g a -> (Element (Compose f g a) -> m ()) -> m () # ofoldlM :: Monad m => (a0 -> Element (Compose f g a) -> m a0) -> a0 -> Compose f g a -> m a0 # ofoldMap1Ex :: Semigroup m => (Element (Compose f g a) -> m) -> Compose f g a -> m # ofoldr1Ex :: (Element (Compose f g a) -> Element (Compose f g a) -> Element (Compose f g a)) -> Compose f g a -> Element (Compose f g a) # ofoldl1Ex' :: (Element (Compose f g a) -> Element (Compose f g a) -> Element (Compose f g a)) -> Compose f g a -> Element (Compose f g a) # headEx :: Compose f g a -> Element (Compose f g a) # lastEx :: Compose f g a -> Element (Compose f g a) # unsafeHead :: Compose f g a -> Element (Compose f g a) # unsafeLast :: Compose f g a -> Element (Compose f g a) # maximumByEx :: (Element (Compose f g a) -> Element (Compose f g a) -> Ordering) -> Compose f g a -> Element (Compose f g a) # minimumByEx :: (Element (Compose f g a) -> Element (Compose f g a) -> Ordering) -> Compose f g a -> Element (Compose f g a) # oelem :: Element (Compose f g a) -> Compose f g a -> Bool # onotElem :: Element (Compose f g a) -> Compose f g a -> Bool #

class MonoFunctor mono where #

Monomorphic containers that can be mapped over.

Minimal complete definition

Nothing

Methods

omap :: (Element mono -> Element mono) -> mono -> mono #

Map over a monomorphic container

Instances

MonoFunctor ByteString
Instance details Defined in Data.MonoTraversable Methods omap :: (Element ByteString -> Element ByteString) -> ByteString -> ByteString #
MonoFunctor ByteString
Instance details Defined in Data.MonoTraversable Methods omap :: (Element ByteString -> Element ByteString) -> ByteString -> ByteString #
MonoFunctor Text
Instance details Defined in Data.MonoTraversable Methods omap :: (Element Text -> Element Text) -> Text -> Text #
MonoFunctor Text
Instance details Defined in Data.MonoTraversable Methods omap :: (Element Text -> Element Text) -> Text -> Text #
MonoFunctor [a]
Instance details Defined in Data.MonoTraversable Methods omap :: (Element [a] -> Element [a]) -> [a] -> [a] #
MonoFunctor (Maybe a)
Instance details Defined in Data.MonoTraversable Methods omap :: (Element (Maybe a) -> Element (Maybe a)) -> Maybe a -> Maybe a #
MonoFunctor (IO a)
Instance details Defined in Data.MonoTraversable Methods omap :: (Element (IO a) -> Element (IO a)) -> IO a -> IO a #
MonoFunctor (Par1 a)	Since: mono-traversable-1.0.11.0
Instance details Defined in Data.MonoTraversable Methods omap :: (Element (Par1 a) -> Element (Par1 a)) -> Par1 a -> Par1 a #
MonoFunctor (Option a)
Instance details Defined in Data.MonoTraversable Methods omap :: (Element (Option a) -> Element (Option a)) -> Option a -> Option a #
MonoFunctor (ZipList a)
Instance details Defined in Data.MonoTraversable Methods omap :: (Element (ZipList a) -> Element (ZipList a)) -> ZipList a -> ZipList a #
MonoFunctor (Identity a)
Instance details Defined in Data.MonoTraversable Methods omap :: (Element (Identity a) -> Element (Identity a)) -> Identity a -> Identity a #
MonoFunctor (NonEmpty a)
Instance details Defined in Data.MonoTraversable Methods omap :: (Element (NonEmpty a) -> Element (NonEmpty a)) -> NonEmpty a -> NonEmpty a #
MonoFunctor (Vector a)
Instance details Defined in Data.MonoTraversable Methods omap :: (Element (Vector a) -> Element (Vector a)) -> Vector a -> Vector a #
MonoFunctor (Seq a)
Instance details Defined in Data.MonoTraversable Methods omap :: (Element (Seq a) -> Element (Seq a)) -> Seq a -> Seq a #
MonoFunctor (IntMap a)
Instance details Defined in Data.MonoTraversable Methods omap :: (Element (IntMap a) -> Element (IntMap a)) -> IntMap a -> IntMap a #
MonoFunctor mono => MonoFunctor (NonNull mono)
Instance details Defined in Data.NonNull Methods omap :: (Element (NonNull mono) -> Element (NonNull mono)) -> NonNull mono -> NonNull mono #
MonoFunctor (Tree a)
Instance details Defined in Data.MonoTraversable Methods omap :: (Element (Tree a) -> Element (Tree a)) -> Tree a -> Tree a #
MonoFunctor (ViewL a)
Instance details Defined in Data.MonoTraversable Methods omap :: (Element (ViewL a) -> Element (ViewL a)) -> ViewL a -> ViewL a #
MonoFunctor (ViewR a)
Instance details Defined in Data.MonoTraversable Methods omap :: (Element (ViewR a) -> Element (ViewR a)) -> ViewR a -> ViewR a #
MonoFunctor (FocusList a)
Instance details Defined in Data.FocusList Methods omap :: (Element (FocusList a) -> Element (FocusList a)) -> FocusList a -> FocusList a #
Storable a => MonoFunctor (Vector a)
Instance details Defined in Data.MonoTraversable Methods omap :: (Element (Vector a) -> Element (Vector a)) -> Vector a -> Vector a #
Unbox a => MonoFunctor (Vector a)
Instance details Defined in Data.MonoTraversable Methods omap :: (Element (Vector a) -> Element (Vector a)) -> Vector a -> Vector a #
MonoFunctor (r -> a)
Instance details Defined in Data.MonoTraversable Methods omap :: (Element (r -> a) -> Element (r -> a)) -> (r -> a) -> r -> a #
MonoFunctor (Either a b)
Instance details Defined in Data.MonoTraversable Methods omap :: (Element (Either a b) -> Element (Either a b)) -> Either a b -> Either a b #
MonoFunctor (V1 a)	Since: mono-traversable-1.0.11.0
Instance details Defined in Data.MonoTraversable Methods omap :: (Element (V1 a) -> Element (V1 a)) -> V1 a -> V1 a #
MonoFunctor (U1 a)	Since: mono-traversable-1.0.11.0
Instance details Defined in Data.MonoTraversable Methods omap :: (Element (U1 a) -> Element (U1 a)) -> U1 a -> U1 a #
MonoFunctor (a, b)
Instance details Defined in Data.MonoTraversable Methods omap :: (Element (a, b) -> Element (a, b)) -> (a, b) -> (a, b) #
MonoFunctor (Map k v)
Instance details Defined in Data.MonoTraversable Methods omap :: (Element (Map k v) -> Element (Map k v)) -> Map k v -> Map k v #
MonoFunctor (HashMap k v)
Instance details Defined in Data.MonoTraversable Methods omap :: (Element (HashMap k v) -> Element (HashMap k v)) -> HashMap k v -> HashMap k v #
MonoFunctor (Arg a b)
Instance details Defined in Data.MonoTraversable Methods omap :: (Element (Arg a b) -> Element (Arg a b)) -> Arg a b -> Arg a b #
Monad m => MonoFunctor (WrappedMonad m a)
Instance details Defined in Data.MonoTraversable Methods omap :: (Element (WrappedMonad m a) -> Element (WrappedMonad m a)) -> WrappedMonad m a -> WrappedMonad m a #
MonoFunctor (Proxy a)	Since: mono-traversable-1.0.11.0
Instance details Defined in Data.MonoTraversable Methods omap :: (Element (Proxy a) -> Element (Proxy a)) -> Proxy a -> Proxy a #
Functor m => MonoFunctor (MaybeT m a)
Instance details Defined in Data.MonoTraversable Methods omap :: (Element (MaybeT m a) -> Element (MaybeT m a)) -> MaybeT m a -> MaybeT m a #
Functor m => MonoFunctor (ListT m a)
Instance details Defined in Data.MonoTraversable Methods omap :: (Element (ListT m a) -> Element (ListT m a)) -> ListT m a -> ListT m a #
MonoFunctor (Vec n a) Source #
Instance details Defined in Termonad.Config.Vec Methods omap :: (Element (Vec n a) -> Element (Vec n a)) -> Vec n a -> Vec n a #
Functor f => MonoFunctor (Rec1 f a)	Since: mono-traversable-1.0.11.0
Instance details Defined in Data.MonoTraversable Methods omap :: (Element (Rec1 f a) -> Element (Rec1 f a)) -> Rec1 f a -> Rec1 f a #
Arrow a => MonoFunctor (WrappedArrow a b c)
Instance details Defined in Data.MonoTraversable Methods omap :: (Element (WrappedArrow a b c) -> Element (WrappedArrow a b c)) -> WrappedArrow a b c -> WrappedArrow a b c #
MonoFunctor (Const m a)
Instance details Defined in Data.MonoTraversable Methods omap :: (Element (Const m a) -> Element (Const m a)) -> Const m a -> Const m a #
Functor m => MonoFunctor (ReaderT r m a)
Instance details Defined in Data.MonoTraversable Methods omap :: (Element (ReaderT r m a) -> Element (ReaderT r m a)) -> ReaderT r m a -> ReaderT r m a #
Functor m => MonoFunctor (IdentityT m a)
Instance details Defined in Data.MonoTraversable Methods omap :: (Element (IdentityT m a) -> Element (IdentityT m a)) -> IdentityT m a -> IdentityT m a #
Functor m => MonoFunctor (WriterT w m a)
Instance details Defined in Data.MonoTraversable Methods omap :: (Element (WriterT w m a) -> Element (WriterT w m a)) -> WriterT w m a -> WriterT w m a #
Functor m => MonoFunctor (WriterT w m a)
Instance details Defined in Data.MonoTraversable Methods omap :: (Element (WriterT w m a) -> Element (WriterT w m a)) -> WriterT w m a -> WriterT w m a #
Functor m => MonoFunctor (StateT s m a)
Instance details Defined in Data.MonoTraversable Methods omap :: (Element (StateT s m a) -> Element (StateT s m a)) -> StateT s m a -> StateT s m a #
Functor m => MonoFunctor (StateT s m a)
Instance details Defined in Data.MonoTraversable Methods omap :: (Element (StateT s m a) -> Element (StateT s m a)) -> StateT s m a -> StateT s m a #
MonoFunctor (K1 i c a)	Since: mono-traversable-1.0.11.0
Instance details Defined in Data.MonoTraversable Methods omap :: (Element (K1 i c a) -> Element (K1 i c a)) -> K1 i c a -> K1 i c a #
(Functor f, Functor g) => MonoFunctor ((f :+: g) a)	Since: mono-traversable-1.0.11.0
Instance details Defined in Data.MonoTraversable Methods omap :: (Element ((f :+: g) a) -> Element ((f :+: g) a)) -> (f :+: g) a -> (f :+: g) a #
(Functor f, Functor g) => MonoFunctor ((f :*: g) a)	Since: mono-traversable-1.0.11.0
Instance details Defined in Data.MonoTraversable Methods omap :: (Element ((f :: g) a) -> Element ((f :: g) a)) -> (f :: g) a -> (f :: g) a #
(Functor f, Functor g) => MonoFunctor (Product f g a)
Instance details Defined in Data.MonoTraversable Methods omap :: (Element (Product f g a) -> Element (Product f g a)) -> Product f g a -> Product f g a #
Functor m => MonoFunctor (ContT r m a)
Instance details Defined in Data.MonoTraversable Methods omap :: (Element (ContT r m a) -> Element (ContT r m a)) -> ContT r m a -> ContT r m a #
Functor f => MonoFunctor (M1 i c f a)	Since: mono-traversable-1.0.11.0
Instance details Defined in Data.MonoTraversable Methods omap :: (Element (M1 i c f a) -> Element (M1 i c f a)) -> M1 i c f a -> M1 i c f a #
(Functor f, Functor g) => MonoFunctor ((f :.: g) a)	Since: mono-traversable-1.0.11.0
Instance details Defined in Data.MonoTraversable Methods omap :: (Element ((f :.: g) a) -> Element ((f :.: g) a)) -> (f :.: g) a -> (f :.: g) a #
(Functor f, Functor g) => MonoFunctor (Compose f g a)
Instance details Defined in Data.MonoTraversable Methods omap :: (Element (Compose f g a) -> Element (Compose f g a)) -> Compose f g a -> Compose f g a #
Functor m => MonoFunctor (RWST r w s m a)
Instance details Defined in Data.MonoTraversable Methods omap :: (Element (RWST r w s m a) -> Element (RWST r w s m a)) -> RWST r w s m a -> RWST r w s m a #
Functor m => MonoFunctor (RWST r w s m a)
Instance details Defined in Data.MonoTraversable Methods omap :: (Element (RWST r w s m a) -> Element (RWST r w s m a)) -> RWST r w s m a -> RWST r w s m a #

type family Element mono :: Type #

Type family for getting the type of the elements of a monomorphic container.

Instances

type Element ByteString
Instance details Defined in Data.MonoTraversable type Element ByteString = Word8
type Element ByteString
Instance details Defined in Data.MonoTraversable type Element ByteString = Word8
type Element Text
Instance details Defined in Data.MonoTraversable type Element Text = Char
type Element Text
Instance details Defined in Data.MonoTraversable type Element Text = Char
type Element IntSet
Instance details Defined in Data.MonoTraversable type Element IntSet = Int
type Element [a]
Instance details Defined in Data.MonoTraversable type Element [a] = a
type Element (Maybe a)
Instance details Defined in Data.MonoTraversable type Element (Maybe a) = a
type Element (IO a)
Instance details Defined in Data.MonoTraversable type Element (IO a) = a
type Element (Par1 a)
Instance details Defined in Data.MonoTraversable type Element (Par1 a) = a
type Element (Option a)
Instance details Defined in Data.MonoTraversable type Element (Option a) = a
type Element (ZipList a)
Instance details Defined in Data.MonoTraversable type Element (ZipList a) = a
type Element (Identity a)
Instance details Defined in Data.MonoTraversable type Element (Identity a) = a
type Element (NonEmpty a)
Instance details Defined in Data.MonoTraversable type Element (NonEmpty a) = a
type Element (Vector a)
Instance details Defined in Data.MonoTraversable type Element (Vector a) = a
type Element (HashSet e)
Instance details Defined in Data.MonoTraversable type Element (HashSet e) = e
type Element (Set e)
Instance details Defined in Data.MonoTraversable type Element (Set e) = e
type Element (Seq a)
Instance details Defined in Data.MonoTraversable type Element (Seq a) = a
type Element (IntMap a)
Instance details Defined in Data.MonoTraversable type Element (IntMap a) = a
type Element (NonNull mono)
Instance details Defined in Data.NonNull type Element (NonNull mono) = Element mono
type Element (DList a)
Instance details Defined in Data.MonoTraversable.Instances type Element (DList a) = a
type Element (Tree a)
Instance details Defined in Data.MonoTraversable type Element (Tree a) = a
type Element (ViewL a)
Instance details Defined in Data.MonoTraversable type Element (ViewL a) = a
type Element (ViewR a)
Instance details Defined in Data.MonoTraversable type Element (ViewR a) = a
type Element (FocusList a)
Instance details Defined in Data.FocusList type Element (FocusList a) = a
type Element (Vector a)
Instance details Defined in Data.MonoTraversable type Element (Vector a) = a
type Element (Vector a)
Instance details Defined in Data.MonoTraversable type Element (Vector a) = a
type Element (r -> a)
Instance details Defined in Data.MonoTraversable type Element (r -> a) = a
type Element (Either a b)
Instance details Defined in Data.MonoTraversable type Element (Either a b) = b
type Element (V1 a)
Instance details Defined in Data.MonoTraversable type Element (V1 a) = a
type Element (U1 a)
Instance details Defined in Data.MonoTraversable type Element (U1 a) = a
type Element (a, b)
Instance details Defined in Data.MonoTraversable type Element (a, b) = b
type Element (Map k v)
Instance details Defined in Data.MonoTraversable type Element (Map k v) = v
type Element (HashMap k v)
Instance details Defined in Data.MonoTraversable type Element (HashMap k v) = v
type Element (Arg a b)
Instance details Defined in Data.MonoTraversable type Element (Arg a b) = b
type Element (WrappedMonad m a)
Instance details Defined in Data.MonoTraversable type Element (WrappedMonad m a) = a
type Element (Proxy a)
Instance details Defined in Data.MonoTraversable type Element (Proxy a) = a
type Element (MaybeT m a)
Instance details Defined in Data.MonoTraversable type Element (MaybeT m a) = a
type Element (ListT m a)
Instance details Defined in Data.MonoTraversable type Element (ListT m a) = a
type Element (WrappedApplicative f a)
Instance details Defined in Data.MonoTraversable.Instances type Element (WrappedApplicative f a) = a
type Element (MaybeApply f a)
Instance details Defined in Data.MonoTraversable.Instances type Element (MaybeApply f a) = a
type Element (Matrix ns a) Source #
Instance details Defined in Termonad.Config.Vec type Element (Matrix ns a) = a
type Element (Vec n a) Source #
Instance details Defined in Termonad.Config.Vec type Element (Vec n a) = a
type Element (Rec1 f a)
Instance details Defined in Data.MonoTraversable type Element (Rec1 f a) = a
type Element (WrappedArrow a b c)
Instance details Defined in Data.MonoTraversable type Element (WrappedArrow a b c) = c
type Element (Const m a)
Instance details Defined in Data.MonoTraversable type Element (Const m a) = a
type Element (ReaderT r m a)
Instance details Defined in Data.MonoTraversable type Element (ReaderT r m a) = a
type Element (TracedT m w a)
Instance details Defined in Data.MonoTraversable.Instances type Element (TracedT m w a) = a
type Element (StoreT s w a)
Instance details Defined in Data.MonoTraversable.Instances type Element (StoreT s w a) = a
type Element (EnvT e w a)
Instance details Defined in Data.MonoTraversable.Instances type Element (EnvT e w a) = a
type Element (IdentityT m a)
Instance details Defined in Data.MonoTraversable type Element (IdentityT m a) = a
type Element (WriterT w m a)
Instance details Defined in Data.MonoTraversable type Element (WriterT w m a) = a
type Element (WriterT w m a)
Instance details Defined in Data.MonoTraversable type Element (WriterT w m a) = a
type Element (StateT s m a)
Instance details Defined in Data.MonoTraversable type Element (StateT s m a) = a
type Element (StateT s m a)
Instance details Defined in Data.MonoTraversable type Element (StateT s m a) = a
type Element (Static f a b)
Instance details Defined in Data.MonoTraversable.Instances type Element (Static f a b) = b
type Element (K1 i c a)
Instance details Defined in Data.MonoTraversable type Element (K1 i c a) = a
type Element ((f :+: g) a)
Instance details Defined in Data.MonoTraversable type Element ((f :+: g) a) = a
type Element ((f :*: g) a)
Instance details Defined in Data.MonoTraversable type Element ((f :*: g) a) = a
type Element (Product f g a)
Instance details Defined in Data.MonoTraversable type Element (Product f g a) = a
type Element (Cokleisli w a b)
Instance details Defined in Data.MonoTraversable.Instances type Element (Cokleisli w a b) = b
type Element (ContT r m a)
Instance details Defined in Data.MonoTraversable type Element (ContT r m a) = a
type Element (M1 i c f a)
Instance details Defined in Data.MonoTraversable type Element (M1 i c f a) = a
type Element ((f :.: g) a)
Instance details Defined in Data.MonoTraversable type Element ((f :.: g) a) = a
type Element (Compose f g a)
Instance details Defined in Data.MonoTraversable type Element (Compose f g a) = a
type Element (RWST r w s m a)
Instance details Defined in Data.MonoTraversable type Element (RWST r w s m a) = a
type Element (RWST r w s m a)
Instance details Defined in Data.MonoTraversable type Element (RWST r w s m a) = a

replaceElem :: (MonoFunctor mono, Eq (Element mono)) => Element mono -> Element mono -> mono -> mono #

replaceElem old new replaces all old elements with new.

Since: mono-traversable-1.0.1

replaceElemStrictText :: Char -> Char -> Text -> Text #

replaceElemLazyText :: Char -> Char -> Text -> Text #

headMay :: MonoFoldable mono => mono -> Maybe (Element mono) #

Safe version of headEx.

Returns Nothing instead of throwing an exception when encountering an empty monomorphic container.

lastMay :: MonoFoldable mono => mono -> Maybe (Element mono) #

Safe version of lastEx.

Returns Nothing instead of throwing an exception when encountering an empty monomorphic container.

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: mono-traversable-0.6.0

oor :: (Element mono ~ Bool, MonoFoldable mono) => mono -> Bool #

Are any of the elements True?

Since: mono-traversable-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) #

Safe version of maximumEx.

Returns Nothing instead of throwing an exception when encountering an empty monomorphic container.

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) #

Safe version of minimumEx.

Returns Nothing instead of throwing an exception when encountering an empty monomorphic container.

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 #

ofor is otraverse with its arguments flipped.

oforM :: (MonoTraversable mono, Applicative f) => mono -> (Element mono -> f (Element mono)) -> f mono #

oforM is omapM with its arguments flipped.

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: mono-traversable-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: mono-traversable-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.

Associated Types

type KeySet set :: Type #

Type of the key set.

Methods

keysSet :: set -> KeySet set #

Convert a map into a set of its keys.

Instances

HasKeysSet (IntMap v)
Instance details Defined in Data.Containers Associated Types type KeySet (IntMap v) :: Type # Methods keysSet :: IntMap v -> KeySet (IntMap v) #
Ord k => HasKeysSet (Map k v)
Instance details Defined in Data.Containers Associated Types type KeySet (Map k v) :: Type # Methods keysSet :: Map k v -> KeySet (Map k v) #
(Hashable k, Eq k) => HasKeysSet (HashMap k v)
Instance details Defined in Data.Containers Associated Types type KeySet (HashMap k v) :: Type # Methods keysSet :: HashMap k v -> KeySet (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.

ounzip :: [(Element mono, Element mono)] -> (mono, mono) #

Take a list of pairs of elements and return a MonoZip of the first components and a MonoZip of the second components.

Instances

MonoZip ByteString
Instance details 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
Instance details 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
Instance details Defined in Data.Containers Methods ozipWith :: (Element Text -> Element Text -> Element Text) -> Text -> Text -> Text # ozip :: Text -> Text -> [(Element Text, Element Text)] # ounzip :: [(Element Text, Element Text)] -> (Text, Text) #
MonoZip Text
Instance details Defined in Data.Containers Methods ozipWith :: (Element Text -> Element Text -> Element Text) -> Text -> Text -> Text # ozip :: Text -> Text -> [(Element Text, Element Text)] # ounzip :: [(Element Text, Element Text)] -> (Text, 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
Instance details Defined in Data.Containers Methods insertSet :: Element IntSet -> IntSet -> IntSet # deleteSet :: Element IntSet -> IntSet -> IntSet # singletonSet :: Element IntSet -> IntSet # setFromList :: [Element IntSet] -> IntSet # setToList :: IntSet -> [Element IntSet] #
(Eq element, Hashable element) => IsSet (HashSet element)
Instance details 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)
Instance details Defined in Data.Containers Methods insertSet :: Element (Set element) -> Set element -> Set element # deleteSet :: Element (Set element) -> Set element -> Set element # singletonSet :: Element (Set element) -> Set element # setFromList :: [Element (Set element)] -> Set element # setToList :: Set element -> [Element (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

type MapValue map :: Type #

In some cases, MapValue and Element will be different, e.g., the IsMap instance of associated lists.

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.

insertWith #

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.

insertWithKey #

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.

insertLookupWithKey #

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.

adjustMap #

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.

adjustWithKey #

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.

updateMap #

Arguments

:: (MapValue map -> Maybe (MapValue map))	function that accepts the previous value and returns the new value or `Nothing`
-> 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.

updateWithKey #

Arguments

:: (ContainerKey map -> MapValue map -> Maybe (MapValue map))	function that accepts the key and the previous value and returns the new value or `Nothing`
-> ContainerKey map	key
-> map	input map
-> map	resulting map

Equivalent to updateMap, but the function accepts the key, as well as the previous value.

updateLookupWithKey #

Arguments

:: (ContainerKey map -> MapValue map -> Maybe (MapValue map))	function that accepts the key and the previous value and returns the new value or `Nothing`
-> 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.

alterMap #

Arguments

:: (Maybe (MapValue map) -> Maybe (MapValue map))	function that accepts the previous value and returns the new value or `Nothing`
-> 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.

unionWith #

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.

unionWithKey #

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

unionsWith #

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.

mapWithKey #

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.

omapKeysWith #

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)]
Instance details Defined in Data.Containers Associated Types type MapValue [(key, value)] :: Type # 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.
Instance details Defined in Data.Containers Associated Types type MapValue (IntMap value) :: Type # 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.
Instance details Defined in Data.Containers Associated Types type MapValue (Map key value) :: Type # 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.
Instance details Defined in Data.Containers Associated Types type MapValue (HashMap key value) :: Type # 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

mapKeysWith #

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
Instance details 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
Instance details 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.
Instance details 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.
Instance details 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.
Instance details 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

member, notMember, union, difference, intersection, keys

Associated Types

type ContainerKey set :: Type #

The type of the key

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.

union :: set -> set -> set #

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
Instance details 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)]
Instance details 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)
Instance details 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)
Instance details 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.
Instance details 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.
Instance details 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.
Instance details 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
Instance details Defined in Data.Sequences Methods encodeUtf8 :: Text -> ByteString # decodeUtf8 :: ByteString -> Text #
Utf8 Text ByteString
Instance details Defined in Data.Sequences Methods encodeUtf8 :: Text -> ByteString # decodeUtf8 :: ByteString -> Text #
(c ~ Char, w ~ Word8) => Utf8 [c] [w]
Instance details Defined in Data.Sequences Methods encodeUtf8 :: [c] -> [w] # decodeUtf8 :: [w] -> [c] #

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

Methods

toChunks :: lazy -> [strict] #

fromChunks :: [strict] -> lazy #

toStrict :: lazy -> strict #

fromStrict :: strict -> lazy #

Instances

LazySequence ByteString ByteString
Instance details Defined in Data.Sequences Methods toChunks :: ByteString0 -> [ByteString] # fromChunks :: [ByteString] -> ByteString0 # toStrict :: ByteString0 -> ByteString # fromStrict :: ByteString -> ByteString0 #
LazySequence Text Text
Instance details Defined in Data.Sequences Methods toChunks :: Text -> [Text0] # fromChunks :: [Text0] -> Text # toStrict :: Text -> Text0 # fromStrict :: Text0 -> Text #

class (IsSequence t, IsString t, Element t ~ Char) => Textual t where #

A typeclass for sequences whose elements are Chars.

Minimal complete definition

words, unwords, lines, unlines, toLower, toUpper, toCaseFold

Methods

words :: t -> [t] #

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"

lines :: t -> [t] #

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"

toLower :: t -> t #

Convert a textual sequence to lower-case.

> toLower "HELLO WORLD"
"hello world"

toUpper :: t -> t #

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

breakWord :: t -> (t, t) #

Split a textual sequence into two parts, split at the first space.

> breakWord "hello world"
("hello","world")

breakLine :: t -> (t, t) #

Split a textual sequence into two parts, split at the newline.

> breakLine "abc\ndef"
("abc","def")

Instances

Textual Text
Instance details Defined in Data.Sequences Methods words :: Text -> [Text] # unwords :: (Element seq ~ Text, MonoFoldable seq) => seq -> Text # lines :: Text -> [Text] # unlines :: (Element seq ~ Text, MonoFoldable seq) => seq -> Text # toLower :: Text -> Text # toUpper :: Text -> Text # toCaseFold :: Text -> Text # breakWord :: Text -> (Text, Text) # breakLine :: Text -> (Text, Text) #
Textual Text
Instance details Defined in Data.Sequences Methods words :: Text -> [Text] # unwords :: (Element seq ~ Text, MonoFoldable seq) => seq -> Text # lines :: Text -> [Text] # unlines :: (Element seq ~ Text, MonoFoldable seq) => seq -> Text # toLower :: Text -> Text # toUpper :: Text -> Text # toCaseFold :: Text -> Text # breakWord :: Text -> (Text, Text) # breakLine :: Text -> (Text, Text) #
c ~ Char => Textual [c]
Instance details Defined in Data.Sequences Methods words :: [c] -> [[c]] # unwords :: (Element seq ~ [c], MonoFoldable seq) => seq -> [c] # lines :: [c] -> [[c]] # unlines :: (Element seq ~ [c], MonoFoldable seq) => seq -> [c] # toLower :: [c] -> [c] # toUpper :: [c] -> [c] # toCaseFold :: [c] -> [c] # breakWord :: [c] -> ([c], [c]) # breakLine :: [c] -> ([c], [c]) #

class (Monoid seq, MonoTraversable seq, SemiSequence seq, MonoPointed seq) => IsSequence seq where #

Sequence Laws:

fromList . otoList = id
fromList (x <> y) = fromList x <> fromList y
otoList (fromList x <> fromList y) = 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 p is equivalent to span (not . p)

> break (> 3) (fromList [1,2,3,4,1,2,3,4] :: Vector Int)
(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 is equivalent to (takeWhile p xs, dropWhile p xs)

> span (< 3) (fromList [1,2,3,4,1,2,3,4] :: Vector Int)
(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 se returns a tuple where the first element is the prefix of the sequence se with length n, and the second element is the remainder of the sequence.

> splitAt 6 "Hello world!"
("Hello ","world!")

> splitAt 3 (fromList [1,2,3,4,5] :: Vector Int)
(fromList [1,2,3],fromList [4,5])

unsafeSplitAt :: Index seq -> seq -> (seq, seq) #

Equivalent to splitAt.

take :: Index seq -> seq -> seq #

take n returns the prefix of a sequence of length n, or the sequence itself if n > olength seq.

> take 3 "abcdefg"
"abc"
> take 4 (fromList [1,2,3,4,5,6] :: Vector Int)
fromList [1,2,3,4]

unsafeTake :: Index seq -> seq -> seq #

Equivalent to take.

drop :: Index seq -> seq -> seq #

drop n returns the suffix of a sequence after the first n elements, or an empty sequence if n > olength seq.

> drop 3 "abcdefg"
"defg"
> drop 4 (fromList [1,2,3,4,5,6] :: Vector Int)
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.

> dropEnd 3 "abcdefg"
"abcd"
> dropEnd 4 (fromList [1,2,3,4,5,6] :: Vector Int)
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.

partition p se = (filter p 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] :: Vector Int)
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] :: Vector Int)
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 x is a sequence of length n with x as the value of every element.

> replicate 10 a :: 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"]

tailEx :: seq -> seq #

Unsafe

Get the tail of a sequence, throw an exception if the sequence is empty.

> tailEx [1,2,3]
[2,3]

tailMay :: seq -> Maybe seq #

Safe version of tailEx.

Returns Nothing instead of throwing an exception when encountering an empty monomorphic container.

Since: mono-traversable-1.0.0

initEx :: seq -> seq #

Unsafe

Get the init of a sequence, throw an exception if the sequence is empty.

> initEx [1,2,3]
[1,2]

initMay :: seq -> Maybe seq #

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] :: Vector Int) 1
Just 2
> index (fromList [1,2,3] :: Vector Int) 4
Nothing

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

IsSequence ByteString
Instance details Defined in Data.Sequences Methods fromList :: [Element ByteString] -> ByteString # lengthIndex :: ByteString -> Index ByteString # break :: (Element ByteString -> Bool) -> ByteString -> (ByteString, ByteString) # span :: (Element ByteString -> Bool) -> ByteString -> (ByteString, ByteString) # dropWhile :: (Element ByteString -> Bool) -> ByteString -> ByteString # takeWhile :: (Element ByteString -> Bool) -> ByteString -> ByteString # splitAt :: Index ByteString -> ByteString -> (ByteString, ByteString) # unsafeSplitAt :: Index ByteString -> ByteString -> (ByteString, ByteString) # take :: Index ByteString -> ByteString -> ByteString # unsafeTake :: Index ByteString -> ByteString -> ByteString # drop :: Index ByteString -> ByteString -> ByteString # unsafeDrop :: Index ByteString -> ByteString -> ByteString # dropEnd :: Index ByteString -> ByteString -> ByteString # partition :: (Element ByteString -> Bool) -> ByteString -> (ByteString, ByteString) # uncons :: ByteString -> Maybe (Element ByteString, ByteString) # unsnoc :: ByteString -> Maybe (ByteString, Element ByteString) # filter :: (Element ByteString -> Bool) -> ByteString -> ByteString # filterM :: Monad m => (Element ByteString -> m Bool) -> ByteString -> m ByteString # replicate :: Index ByteString -> Element ByteString -> ByteString # replicateM :: Monad m => Index ByteString -> m (Element ByteString) -> m ByteString # groupBy :: (Element ByteString -> Element ByteString -> Bool) -> ByteString -> [ByteString] # groupAllOn :: Eq b => (Element ByteString -> b) -> ByteString -> [ByteString] # subsequences :: ByteString -> [ByteString] # permutations :: ByteString -> [ByteString] # tailEx :: ByteString -> ByteString # tailMay :: ByteString -> Maybe ByteString # initEx :: ByteString -> ByteString # initMay :: ByteString -> Maybe ByteString # unsafeTail :: ByteString -> ByteString # unsafeInit :: ByteString -> ByteString # index :: ByteString -> Index ByteString -> Maybe (Element ByteString) # indexEx :: ByteString -> Index ByteString -> Element ByteString # unsafeIndex :: ByteString -> Index ByteString -> Element ByteString # splitWhen :: (Element ByteString -> Bool) -> ByteString -> [ByteString] #
IsSequence ByteString
Instance details Defined in Data.Sequences Methods fromList :: [Element ByteString] -> ByteString # lengthIndex :: ByteString -> Index ByteString # break :: (Element ByteString -> Bool) -> ByteString -> (ByteString, ByteString) # span :: (Element ByteString -> Bool) -> ByteString -> (ByteString, ByteString) # dropWhile :: (Element ByteString -> Bool) -> ByteString -> ByteString # takeWhile :: (Element ByteString -> Bool) -> ByteString -> ByteString # splitAt :: Index ByteString -> ByteString -> (ByteString, ByteString) # unsafeSplitAt :: Index ByteString -> ByteString -> (ByteString, ByteString) # take :: Index ByteString -> ByteString -> ByteString # unsafeTake :: Index ByteString -> ByteString -> ByteString # drop :: Index ByteString -> ByteString -> ByteString # unsafeDrop :: Index ByteString -> ByteString -> ByteString # dropEnd :: Index ByteString -> ByteString -> ByteString # partition :: (Element ByteString -> Bool) -> ByteString -> (ByteString, ByteString) # uncons :: ByteString -> Maybe (Element ByteString, ByteString) # unsnoc :: ByteString -> Maybe (ByteString, Element ByteString) # filter :: (Element ByteString -> Bool) -> ByteString -> ByteString # filterM :: Monad m => (Element ByteString -> m Bool) -> ByteString -> m ByteString # replicate :: Index ByteString -> Element ByteString -> ByteString # replicateM :: Monad m => Index ByteString -> m (Element ByteString) -> m ByteString # groupBy :: (Element ByteString -> Element ByteString -> Bool) -> ByteString -> [ByteString] # groupAllOn :: Eq b => (Element ByteString -> b) -> ByteString -> [ByteString] # subsequences :: ByteString -> [ByteString] # permutations :: ByteString -> [ByteString] # tailEx :: ByteString -> ByteString # tailMay :: ByteString -> Maybe ByteString # initEx :: ByteString -> ByteString # initMay :: ByteString -> Maybe ByteString # unsafeTail :: ByteString -> ByteString # unsafeInit :: ByteString -> ByteString # index :: ByteString -> Index ByteString -> Maybe (Element ByteString) # indexEx :: ByteString -> Index ByteString -> Element ByteString # unsafeIndex :: ByteString -> Index ByteString -> Element ByteString # splitWhen :: (Element ByteString -> Bool) -> ByteString -> [ByteString] #
IsSequence Text
Instance details Defined in Data.Sequences Methods fromList :: [Element Text] -> Text # lengthIndex :: Text -> Index Text # break :: (Element Text -> Bool) -> Text -> (Text, Text) # span :: (Element Text -> Bool) -> Text -> (Text, Text) # dropWhile :: (Element Text -> Bool) -> Text -> Text # takeWhile :: (Element Text -> Bool) -> Text -> Text # splitAt :: Index Text -> Text -> (Text, Text) # unsafeSplitAt :: Index Text -> Text -> (Text, Text) # take :: Index Text -> Text -> Text # unsafeTake :: Index Text -> Text -> Text # drop :: Index Text -> Text -> Text # unsafeDrop :: Index Text -> Text -> Text # dropEnd :: Index Text -> Text -> Text # partition :: (Element Text -> Bool) -> Text -> (Text, Text) # uncons :: Text -> Maybe (Element Text, Text) # unsnoc :: Text -> Maybe (Text, Element Text) # filter :: (Element Text -> Bool) -> Text -> Text # filterM :: Monad m => (Element Text -> m Bool) -> Text -> m Text # replicate :: Index Text -> Element Text -> Text # replicateM :: Monad m => Index Text -> m (Element Text) -> m Text # groupBy :: (Element Text -> Element Text -> Bool) -> Text -> [Text] # groupAllOn :: Eq b => (Element Text -> b) -> Text -> [Text] # subsequences :: Text -> [Text] # permutations :: Text -> [Text] # tailEx :: Text -> Text # tailMay :: Text -> Maybe Text # initEx :: Text -> Text # initMay :: Text -> Maybe Text # unsafeTail :: Text -> Text # unsafeInit :: Text -> Text # index :: Text -> Index Text -> Maybe (Element Text) # indexEx :: Text -> Index Text -> Element Text # unsafeIndex :: Text -> Index Text -> Element Text # splitWhen :: (Element Text -> Bool) -> Text -> [Text] #
IsSequence Text
Instance details Defined in Data.Sequences Methods fromList :: [Element Text] -> Text # lengthIndex :: Text -> Index Text # break :: (Element Text -> Bool) -> Text -> (Text, Text) # span :: (Element Text -> Bool) -> Text -> (Text, Text) # dropWhile :: (Element Text -> Bool) -> Text -> Text # takeWhile :: (Element Text -> Bool) -> Text -> Text # splitAt :: Index Text -> Text -> (Text, Text) # unsafeSplitAt :: Index Text -> Text -> (Text, Text) # take :: Index Text -> Text -> Text # unsafeTake :: Index Text -> Text -> Text # drop :: Index Text -> Text -> Text # unsafeDrop :: Index Text -> Text -> Text # dropEnd :: Index Text -> Text -> Text # partition :: (Element Text -> Bool) -> Text -> (Text, Text) # uncons :: Text -> Maybe (Element Text, Text) # unsnoc :: Text -> Maybe (Text, Element Text) # filter :: (Element Text -> Bool) -> Text -> Text # filterM :: Monad m => (Element Text -> m Bool) -> Text -> m Text # replicate :: Index Text -> Element Text -> Text # replicateM :: Monad m => Index Text -> m (Element Text) -> m Text # groupBy :: (Element Text -> Element Text -> Bool) -> Text -> [Text] # groupAllOn :: Eq b => (Element Text -> b) -> Text -> [Text] # subsequences :: Text -> [Text] # permutations :: Text -> [Text] # tailEx :: Text -> Text # tailMay :: Text -> Maybe Text # initEx :: Text -> Text # initMay :: Text -> Maybe Text # unsafeTail :: Text -> Text # unsafeInit :: Text -> Text # index :: Text -> Index Text -> Maybe (Element Text) # indexEx :: Text -> Index Text -> Element Text # unsafeIndex :: Text -> Index Text -> Element Text # splitWhen :: (Element Text -> Bool) -> Text -> [Text] #
IsSequence [a]
Instance details Defined in Data.Sequences Methods fromList :: [Element [a]] -> [a] # lengthIndex :: [a] -> Index [a] # break :: (Element [a] -> Bool) -> [a] -> ([a], [a]) # span :: (Element [a] -> Bool) -> [a] -> ([a], [a]) # dropWhile :: (Element [a] -> Bool) -> [a] -> [a] # takeWhile :: (Element [a] -> Bool) -> [a] -> [a] # splitAt :: Index [a] -> [a] -> ([a], [a]) # unsafeSplitAt :: Index [a] -> [a] -> ([a], [a]) # take :: Index [a] -> [a] -> [a] # unsafeTake :: Index [a] -> [a] -> [a] # drop :: Index [a] -> [a] -> [a] # unsafeDrop :: Index [a] -> [a] -> [a] # dropEnd :: Index [a] -> [a] -> [a] # partition :: (Element [a] -> Bool) -> [a] -> ([a], [a]) # uncons :: [a] -> Maybe (Element [a], [a]) # unsnoc :: [a] -> Maybe ([a], Element [a]) # filter :: (Element [a] -> Bool) -> [a] -> [a] # filterM :: Monad m => (Element [a] -> m Bool) -> [a] -> m [a] # replicate :: Index [a] -> Element [a] -> [a] # replicateM :: Monad m => Index [a] -> m (Element [a]) -> m [a] # groupBy :: (Element [a] -> Element [a] -> Bool) -> [a] -> [[a]] # groupAllOn :: Eq b => (Element [a] -> b) -> [a] -> [[a]] # subsequences :: [a] -> [[a]] # permutations :: [a] -> [[a]] # tailEx :: [a] -> [a] # tailMay :: [a] -> Maybe [a] # initEx :: [a] -> [a] # initMay :: [a] -> Maybe [a] # unsafeTail :: [a] -> [a] # unsafeInit :: [a] -> [a] # index :: [a] -> Index [a] -> Maybe (Element [a]) # indexEx :: [a] -> Index [a] -> Element [a] # unsafeIndex :: [a] -> Index [a] -> Element [a] # splitWhen :: (Element [a] -> Bool) -> [a] -> [[a]] #
IsSequence (Vector a)
Instance details Defined in Data.Sequences Methods fromList :: [Element (Vector a)] -> Vector a # lengthIndex :: Vector a -> Index (Vector a) # break :: (Element (Vector a) -> Bool) -> Vector a -> (Vector a, Vector a) # span :: (Element (Vector a) -> Bool) -> Vector a -> (Vector a, Vector a) # dropWhile :: (Element (Vector a) -> Bool) -> Vector a -> Vector a # takeWhile :: (Element (Vector a) -> Bool) -> Vector a -> Vector a # splitAt :: Index (Vector a) -> Vector a -> (Vector a, Vector a) # unsafeSplitAt :: Index (Vector a) -> Vector a -> (Vector a, Vector a) # take :: Index (Vector a) -> Vector a -> Vector a # unsafeTake :: Index (Vector a) -> Vector a -> Vector a # drop :: Index (Vector a) -> Vector a -> Vector a # unsafeDrop :: Index (Vector a) -> Vector a -> Vector a # dropEnd :: Index (Vector a) -> Vector a -> Vector a # partition :: (Element (Vector a) -> Bool) -> Vector a -> (Vector a, Vector a) # uncons :: Vector a -> Maybe (Element (Vector a), Vector a) # unsnoc :: Vector a -> Maybe (Vector a, Element (Vector a)) # filter :: (Element (Vector a) -> Bool) -> Vector a -> Vector a # filterM :: Monad m => (Element (Vector a) -> m Bool) -> Vector a -> m (Vector a) # replicate :: Index (Vector a) -> Element (Vector a) -> Vector a # replicateM :: Monad m => Index (Vector a) -> m (Element (Vector a)) -> m (Vector a) # groupBy :: (Element (Vector a) -> Element (Vector a) -> Bool) -> Vector a -> [Vector a] # groupAllOn :: Eq b => (Element (Vector a) -> b) -> Vector a -> [Vector a] # subsequences :: Vector a -> [Vector a] # permutations :: Vector a -> [Vector a] # tailEx :: Vector a -> Vector a # tailMay :: Vector a -> Maybe (Vector a) # initEx :: Vector a -> Vector a # initMay :: Vector a -> Maybe (Vector a) # unsafeTail :: Vector a -> Vector a # unsafeInit :: Vector a -> Vector a # index :: Vector a -> Index (Vector a) -> Maybe (Element (Vector a)) # indexEx :: Vector a -> Index (Vector a) -> Element (Vector a) # unsafeIndex :: Vector a -> Index (Vector a) -> Element (Vector a) # splitWhen :: (Element (Vector a) -> Bool) -> Vector a -> [Vector a] #
IsSequence (Seq a)
Instance details 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] # tailEx :: Seq a -> Seq a # tailMay :: Seq a -> Maybe (Seq a) # initEx :: Seq a -> 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] #
Storable a => IsSequence (Vector a)
Instance details Defined in Data.Sequences Methods fromList :: [Element (Vector a)] -> Vector a # lengthIndex :: Vector a -> Index (Vector a) # break :: (Element (Vector a) -> Bool) -> Vector a -> (Vector a, Vector a) # span :: (Element (Vector a) -> Bool) -> Vector a -> (Vector a, Vector a) # dropWhile :: (Element (Vector a) -> Bool) -> Vector a -> Vector a # takeWhile :: (Element (Vector a) -> Bool) -> Vector a -> Vector a # splitAt :: Index (Vector a) -> Vector a -> (Vector a, Vector a) # unsafeSplitAt :: Index (Vector a) -> Vector a -> (Vector a, Vector a) # take :: Index (Vector a) -> Vector a -> Vector a # unsafeTake :: Index (Vector a) -> Vector a -> Vector a # drop :: Index (Vector a) -> Vector a -> Vector a # unsafeDrop :: Index (Vector a) -> Vector a -> Vector a # dropEnd :: Index (Vector a) -> Vector a -> Vector a # partition :: (Element (Vector a) -> Bool) -> Vector a -> (Vector a, Vector a) # uncons :: Vector a -> Maybe (Element (Vector a), Vector a) # unsnoc :: Vector a -> Maybe (Vector a, Element (Vector a)) # filter :: (Element (Vector a) -> Bool) -> Vector a -> Vector a # filterM :: Monad m => (Element (Vector a) -> m Bool) -> Vector a -> m (Vector a) # replicate :: Index (Vector a) -> Element (Vector a) -> Vector a # replicateM :: Monad m => Index (Vector a) -> m (Element (Vector a)) -> m (Vector a) # groupBy :: (Element (Vector a) -> Element (Vector a) -> Bool) -> Vector a -> [Vector a] # groupAllOn :: Eq b => (Element (Vector a) -> b) -> Vector a -> [Vector a] # subsequences :: Vector a -> [Vector a] # permutations :: Vector a -> [Vector a] # tailEx :: Vector a -> Vector a # tailMay :: Vector a -> Maybe (Vector a) # initEx :: Vector a -> Vector a # initMay :: Vector a -> Maybe (Vector a) # unsafeTail :: Vector a -> Vector a # unsafeInit :: Vector a -> Vector a # index :: Vector a -> Index (Vector a) -> Maybe (Element (Vector a)) # indexEx :: Vector a -> Index (Vector a) -> Element (Vector a) # unsafeIndex :: Vector a -> Index (Vector a) -> Element (Vector a) # splitWhen :: (Element (Vector a) -> Bool) -> Vector a -> [Vector a] #
Unbox a => IsSequence (Vector a)
Instance details Defined in Data.Sequences Methods fromList :: [Element (Vector a)] -> Vector a # lengthIndex :: Vector a -> Index (Vector a) # break :: (Element (Vector a) -> Bool) -> Vector a -> (Vector a, Vector a) # span :: (Element (Vector a) -> Bool) -> Vector a -> (Vector a, Vector a) # dropWhile :: (Element (Vector a) -> Bool) -> Vector a -> Vector a # takeWhile :: (Element (Vector a) -> Bool) -> Vector a -> Vector a # splitAt :: Index (Vector a) -> Vector a -> (Vector a, Vector a) # unsafeSplitAt :: Index (Vector a) -> Vector a -> (Vector a, Vector a) # take :: Index (Vector a) -> Vector a -> Vector a # unsafeTake :: Index (Vector a) -> Vector a -> Vector a # drop :: Index (Vector a) -> Vector a -> Vector a # unsafeDrop :: Index (Vector a) -> Vector a -> Vector a # dropEnd :: Index (Vector a) -> Vector a -> Vector a # partition :: (Element (Vector a) -> Bool) -> Vector a -> (Vector a, Vector a) # uncons :: Vector a -> Maybe (Element (Vector a), Vector a) # unsnoc :: Vector a -> Maybe (Vector a, Element (Vector a)) # filter :: (Element (Vector a) -> Bool) -> Vector a -> Vector a # filterM :: Monad m => (Element (Vector a) -> m Bool) -> Vector a -> m (Vector a) # replicate :: Index (Vector a) -> Element (Vector a) -> Vector a # replicateM :: Monad m => Index (Vector a) -> m (Element (Vector a)) -> m (Vector a) # groupBy :: (Element (Vector a) -> Element (Vector a) -> Bool) -> Vector a -> [Vector a] # groupAllOn :: Eq b => (Element (Vector a) -> b) -> Vector a -> [Vector a] # subsequences :: Vector a -> [Vector a] # permutations :: Vector a -> [Vector a] # tailEx :: Vector a -> Vector a # tailMay :: Vector a -> Maybe (Vector a) # initEx :: Vector a -> Vector a # initMay :: Vector a -> Maybe (Vector a) # unsafeTail :: Vector a -> Vector a # unsafeInit :: Vector a -> Vector a # index :: Vector a -> Index (Vector a) -> Maybe (Element (Vector a)) # indexEx :: Vector a -> Index (Vector a) -> Element (Vector a) # unsafeIndex :: Vector a -> Index (Vector a) -> Element (Vector a) # splitWhen :: (Element (Vector a) -> Bool) -> Vector a -> [Vector a] #

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.

Associated Types

type Index seq :: Type #

The type of the index of a sequence.

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 :: seq -> seq #

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]
Just 5

> 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 = case compare x y of LT -> GT; EQ -> EQ; GT -> LT
> sortBy compare' [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

SemiSequence ByteString
Instance details Defined in Data.Sequences Associated Types type Index ByteString :: Type # Methods intersperse :: Element ByteString -> ByteString -> ByteString # reverse :: ByteString -> ByteString # find :: (Element ByteString -> Bool) -> ByteString -> Maybe (Element ByteString) # sortBy :: (Element ByteString -> Element ByteString -> Ordering) -> ByteString -> ByteString # cons :: Element ByteString -> ByteString -> ByteString # snoc :: ByteString -> Element ByteString -> ByteString #
SemiSequence ByteString
Instance details Defined in Data.Sequences Associated Types type Index ByteString :: Type # Methods intersperse :: Element ByteString -> ByteString -> ByteString # reverse :: ByteString -> ByteString # find :: (Element ByteString -> Bool) -> ByteString -> Maybe (Element ByteString) # sortBy :: (Element ByteString -> Element ByteString -> Ordering) -> ByteString -> ByteString # cons :: Element ByteString -> ByteString -> ByteString # snoc :: ByteString -> Element ByteString -> ByteString #
SemiSequence Text
Instance details Defined in Data.Sequences Associated Types type Index Text :: Type # Methods intersperse :: Element Text -> Text -> Text # reverse :: Text -> Text # find :: (Element Text -> Bool) -> Text -> Maybe (Element Text) # sortBy :: (Element Text -> Element Text -> Ordering) -> Text -> Text # cons :: Element Text -> Text -> Text # snoc :: Text -> Element Text -> Text #
SemiSequence Text
Instance details Defined in Data.Sequences Associated Types type Index Text :: Type # Methods intersperse :: Element Text -> Text -> Text # reverse :: Text -> Text # find :: (Element Text -> Bool) -> Text -> Maybe (Element Text) # sortBy :: (Element Text -> Element Text -> Ordering) -> Text -> Text # cons :: Element Text -> Text -> Text # snoc :: Text -> Element Text -> Text #
SemiSequence [a]
Instance details Defined in Data.Sequences Associated Types type Index [a] :: Type # Methods intersperse :: Element [a] -> [a] -> [a] # reverse :: [a] -> [a] # find :: (Element [a] -> Bool) -> [a] -> Maybe (Element [a]) # sortBy :: (Element [a] -> Element [a] -> Ordering) -> [a] -> [a] # cons :: Element [a] -> [a] -> [a] # snoc :: [a] -> Element [a] -> [a] #
SemiSequence (NonEmpty a)
Instance details Defined in Data.Sequences Associated Types type Index (NonEmpty a) :: Type # Methods intersperse :: Element (NonEmpty a) -> NonEmpty a -> NonEmpty a # reverse :: NonEmpty a -> NonEmpty a # find :: (Element (NonEmpty a) -> Bool) -> NonEmpty a -> Maybe (Element (NonEmpty a)) # sortBy :: (Element (NonEmpty a) -> Element (NonEmpty a) -> Ordering) -> NonEmpty a -> NonEmpty a # cons :: Element (NonEmpty a) -> NonEmpty a -> NonEmpty a # snoc :: NonEmpty a -> Element (NonEmpty a) -> NonEmpty a #
SemiSequence (Vector a)
Instance details Defined in Data.Sequences Associated Types type Index (Vector a) :: Type # Methods intersperse :: Element (Vector a) -> Vector a -> Vector a # reverse :: Vector a -> Vector a # find :: (Element (Vector a) -> Bool) -> Vector a -> Maybe (Element (Vector a)) # sortBy :: (Element (Vector a) -> Element (Vector a) -> Ordering) -> Vector a -> Vector a # cons :: Element (Vector a) -> Vector a -> Vector a # snoc :: Vector a -> Element (Vector a) -> Vector a #
SemiSequence (Seq a)
Instance details Defined in Data.Sequences Associated Types type Index (Seq a) :: Type # Methods intersperse :: Element (Seq a) -> Seq a -> Seq a # reverse :: Seq a -> Seq a # find :: (Element (Seq a) -> Bool) -> Seq a -> Maybe (Element (Seq a)) # sortBy :: (Element (Seq a) -> Element (Seq a) -> Ordering) -> Seq a -> Seq a # cons :: Element (Seq a) -> Seq a -> Seq a # snoc :: Seq a -> Element (Seq a) -> Seq a #
SemiSequence seq => SemiSequence (NonNull seq)
Instance details Defined in Data.NonNull Associated Types type Index (NonNull seq) :: Type # 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 #
SemiSequence (FocusList a)
Instance details Defined in Data.FocusList Associated Types type Index (FocusList a) :: Type # Methods intersperse :: Element (FocusList a) -> FocusList a -> FocusList a # reverse :: FocusList a -> FocusList a # find :: (Element (FocusList a) -> Bool) -> FocusList a -> Maybe (Element (FocusList a)) # sortBy :: (Element (FocusList a) -> Element (FocusList a) -> Ordering) -> FocusList a -> FocusList a # cons :: Element (FocusList a) -> FocusList a -> FocusList a # snoc :: FocusList a -> Element (FocusList a) -> FocusList a #
Storable a => SemiSequence (Vector a)
Instance details Defined in Data.Sequences Associated Types type Index (Vector a) :: Type # Methods intersperse :: Element (Vector a) -> Vector a -> Vector a # reverse :: Vector a -> Vector a # find :: (Element (Vector a) -> Bool) -> Vector a -> Maybe (Element (Vector a)) # sortBy :: (Element (Vector a) -> Element (Vector a) -> Ordering) -> Vector a -> Vector a # cons :: Element (Vector a) -> Vector a -> Vector a # snoc :: Vector a -> Element (Vector a) -> Vector a #
Unbox a => SemiSequence (Vector a)
Instance details Defined in Data.Sequences Associated Types type Index (Vector a) :: Type # Methods intersperse :: Element (Vector a) -> Vector a -> Vector a # reverse :: Vector a -> Vector a # find :: (Element (Vector a) -> Bool) -> Vector a -> Maybe (Element (Vector a)) # sortBy :: (Element (Vector a) -> Element (Vector a) -> Ordering) -> Vector a -> Vector a # cons :: Element (Vector a) -> Vector a -> Vector a # snoc :: Vector a -> Element (Vector a) -> Vector a #

singleton :: MonoPointed seq => Element seq -> seq #

Create a sequence from a single element.

> singleton a :: String
"a"
> singleton a :: Vector Char
fromList "a"

defaultFind :: MonoFoldable seq => (Element seq -> Bool) -> seq -> Maybe (Element seq) #

Use Data.List's implementation of find.

defaultIntersperse :: IsSequence seq => Element seq -> seq -> seq #

Use Data.List's implementation of intersperse.

defaultReverse :: IsSequence seq => seq -> seq #

Use Data.List's implementation of reverse.

defaultSortBy :: IsSequence seq => (Element seq -> Element seq -> Ordering) -> seq -> seq #

Use Data.List's implementation of sortBy.

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 #

Use Data.List's : to prepend an element to a sequence.

defaultSnoc :: IsSequence seq => seq -> Element seq -> seq #

Use Data.List's ++ to append an element to a sequence.

tailDef :: IsSequence seq => seq -> seq #

like Data.List.tail, but an input of mempty returns mempty

initDef :: IsSequence seq => seq -> seq #

like Data.List.init, but an input of mempty returns mempty

splitElem :: (IsSequence seq, Eq (Element seq)) => Element seq -> seq -> [seq] #

splitElem splits a sequence into components delimited by separator element. It's equivalent to splitWhen with equality predicate:

splitElem sep === splitWhen (== sep)

Since 0.9.3

splitSeq :: (IsSequence seq, Eq (Element seq)) => seq -> seq -> [seq] #

splitSeq splits a sequence into components delimited by separator subsequence. splitSeq 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 mempty is another special case: it splits just before each element, and in line with splitWhen 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 new replaces all old 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.

group :: (IsSequence seq, Eq (Element seq)) => seq -> [seq] #

Equivalent to groupBy (==)

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] #

replaceSeqStrictText :: Text -> Text -> Text -> Text #

splitSeqLazyText :: Text -> Text -> [Text] #

replaceSeqLazyText :: Text -> 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

data NonNull mono #

A monomorphic container that is not null.

Instances

Eq mono => Eq (NonNull mono)
Instance details Defined in Data.NonNull Methods (==) :: NonNull mono -> NonNull mono -> Bool # (/=) :: NonNull mono -> NonNull mono -> Bool #
Data mono => Data (NonNull mono)
Instance details 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)
Instance details Defined in Data.NonNull Methods compare :: NonNull mono -> NonNull mono -> Ordering # (<) :: NonNull mono -> NonNull mono -> Bool # (<=) :: NonNull mono -> NonNull mono -> Bool # (>) :: NonNull mono -> NonNull mono -> Bool # (>=) :: NonNull mono -> NonNull mono -> Bool # max :: NonNull mono -> NonNull mono -> NonNull mono # min :: NonNull mono -> NonNull mono -> NonNull mono #
Read mono => Read (NonNull mono)
Instance details Defined in Data.NonNull Methods readsPrec :: Int -> ReadS (NonNull mono) # readList :: ReadS [NonNull mono] # readPrec :: ReadPrec (NonNull mono) # readListPrec :: ReadPrec [NonNull mono] #
Show mono => Show (NonNull mono)
Instance details Defined in Data.NonNull Methods showsPrec :: Int -> NonNull mono -> ShowS # show :: NonNull mono -> String # showList :: [NonNull mono] -> ShowS #
(Semigroup mono, GrowingAppend mono) => Semigroup (NonNull mono)
Instance details Defined in Data.NonNull Methods (<>) :: NonNull mono -> NonNull mono -> NonNull mono # sconcat :: NonEmpty (NonNull mono) -> NonNull mono # stimes :: Integral b => b -> NonNull mono -> NonNull mono #
GrowingAppend mono => GrowingAppend (NonNull mono)
Instance details Defined in Data.NonNull
IsSequence mono => MonoComonad (NonNull mono)
Instance details Defined in Data.NonNull Methods oextract :: NonNull mono -> Element (NonNull mono) # oextend :: (NonNull mono -> Element (NonNull mono)) -> NonNull mono -> NonNull mono #
MonoPointed mono => MonoPointed (NonNull mono)
Instance details Defined in Data.NonNull Methods opoint :: Element (NonNull mono) -> NonNull mono #
MonoTraversable mono => MonoTraversable (NonNull mono)
Instance details Defined in Data.NonNull Methods otraverse :: Applicative f => (Element (NonNull mono) -> f (Element (NonNull mono))) -> NonNull mono -> f (NonNull mono) # omapM :: Applicative m => (Element (NonNull mono) -> m (Element (NonNull mono))) -> NonNull mono -> m (NonNull mono) #
MonoFoldable mono => MonoFoldable (NonNull mono)
Instance details 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)
Instance details Defined in Data.NonNull Methods omap :: (Element (NonNull mono) -> Element (NonNull mono)) -> NonNull mono -> NonNull mono #
SemiSequence seq => SemiSequence (NonNull seq)
Instance details Defined in Data.NonNull Associated Types type Index (NonNull seq) :: Type # 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)
Instance details Defined in Data.NonNull type Element (NonNull mono) = Element mono
type Index (NonNull seq)
Instance details Defined in Data.NonNull type Index (NonNull seq) = Index seq

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 fromNullable or nonNull if 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 NonEmpty List. fronNonEmpty will 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.filter, but works on non-nullable sequences.

nfilterM :: (Monad m, IsSequence seq) => (Element seq -> m Bool) -> NonNull seq -> m seq #

Equivalent to Data.Sequences.filterM, but works on non-nullable sequences.

nReplicate :: IsSequence seq => Index seq -> Element seq -> NonNull seq #

Equivalent to Data.Sequences.replicate

i must be > 0

i <= 0 is treated the same as providing 1

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 #

Return the first element of a monomorphic container.

Safe version of headEx, only works on monomorphic containers wrapped in a NonNull.

last :: MonoFoldable mono => NonNull mono -> Element mono #

Return the last element of a monomorphic container.

Safe version of lastEx, only works on monomorphic containers wrapped in a NonNull.

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

Expand

> let xs = ncons ("hello", 1 :: Integer) [(" world", 2)]
> ofoldMap1 fst xs
"hello world"

ofold1 :: (MonoFoldable mono, Semigroup (Element mono)) => NonNull mono -> Element mono #

Join a monomorphic container, whose elements are Semigroups, together.

Safe, only works on monomorphic containers wrapped in a NonNull.

Examples

Expand

> let xs = ncons "a" ["b", "c"]
> xs
NonNull {toNullable = ["a","b","c"]}

> ofold1 xs
"abc"

ofoldr1 :: MonoFoldable mono => (Element mono -> Element mono -> Element mono) -> NonNull mono -> Element mono #

Right-associative fold of a monomorphic container with no base element.

Safe version of ofoldr1Ex, only works on monomorphic containers wrapped in a NonNull.

foldr1 f = Prelude.foldr1 f . otoList

Examples

Expand

> let xs = ncons "a" ["b", "c"]
> ofoldr1 (++) xs
"abc"

ofoldl1' :: MonoFoldable mono => (Element mono -> Element mono -> Element mono) -> NonNull mono -> Element mono #

Strict left-associative fold of a monomorphic container with no base element.

Safe version of ofoldl1Ex', only works on monomorphic containers wrapped in a NonNull.

foldl1' f = Prelude.foldl1' f . otoList

Examples

Expand

> let xs = ncons "a" ["b", "c"]
> ofoldl1' (++) xs
"abc"

maximum :: (MonoFoldable mono, Ord (Element mono)) => NonNull mono -> Element mono #

Get the maximum element of a monomorphic container.

Safe version of maximumEx, only works on monomorphic containers wrapped in a NonNull.

Examples

Expand

> let xs = ncons 1 [2, 3 :: Int]
> maximum xs
3

minimum :: (MonoFoldable mono, Ord (Element mono)) => NonNull mono -> Element mono #

Get the minimum element of a monomorphic container.

Safe version of minimumEx, only works on monomorphic containers wrapped in a NonNull.

Examples

Expand

> let xs = ncons 1 [2, 3 :: Int]
> minimum xs
1

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) #

fmap over the underlying container in a NonNull.

Since: mono-traversable-1.0.6.0

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 () #

link2 generalized to any MonadIO

Since: classy-prelude-1.0.0

linkAsync :: MonadIO m => Async a -> m () #

link generalized to any MonadIO

Since: classy-prelude-1.0.0

waitCatchAsync :: MonadIO m => Async a -> m (Either SomeException a) #

waitCatchSTM for any MonadIO

Since: classy-prelude-1.0.0

pollAsync :: MonadIO m => Async a -> m (Maybe (Either SomeException a)) #

pollSTM for any MonadIO

Since: classy-prelude-1.0.0

waitAsync :: MonadIO m => Async a -> m a #

waitSTM 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

asDList :: DList a -> DList a #

Force type to a DList

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

orElseSTM :: STM a -> STM a -> STM a #

Synonym for orElse.

ordNubBy :: Ord b => (a -> b) -> (a -> a -> Bool) -> [a] -> [a] #

same behavior as nubBy, but requires Ord and is O(n log n)

https://github.com/nh2/haskell-ordnub

ordNub :: Ord a => [a] -> [a] #

same behavior as nub, but requires Ord and is O(n log n)

https://github.com/nh2/haskell-ordnub

hashNub :: (Hashable a, Eq a) => [a] -> [a] #

same behavior as nub, but requires Hashable & Eq and is O(n log n)

https://github.com/nh2/haskell-ordnub

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

traceM :: Monad m => String -> m () #

Since 0.5.9

traceId :: String -> String #

Since 0.5.9

traceShow :: Show a => a -> b -> b #

trace :: String -> a -> a #

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.

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 #

An alias for intersection.

(\\) :: SetContainer a => a -> a -> a infixl 9 #

An alias for difference.

(++) :: Monoid m => m -> m -> m infixr 5 #

map :: Functor f => (a -> b) -> f a -> f b #

readMay :: (Element c ~ Char, MonoFoldable c, Read a) => c -> Maybe a #

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̇.

tlshow :: Show a => a -> LText #

tshow :: Show a => a -> Text #

newtype Day #

The Modified Julian Day is a standard count of days, with zero being the day 1858-11-17.

Constructors

ModifiedJulianDay
Fields toModifiedJulianDay :: Integer

Instances

Enum Day
Instance details Defined in Data.Time.Calendar.Days Methods succ :: Day -> Day # pred :: Day -> Day # toEnum :: Int -> Day # fromEnum :: Day -> Int # enumFrom :: Day -> [Day] # enumFromThen :: Day -> Day -> [Day] # enumFromTo :: Day -> Day -> [Day] # enumFromThenTo :: Day -> Day -> Day -> [Day] #
Eq Day
Instance details Defined in Data.Time.Calendar.Days Methods (==) :: Day -> Day -> Bool # (/=) :: Day -> Day -> Bool #
Data Day
Instance details 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 # toConstr :: Day -> Constr # 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
Instance details Defined in Data.Time.Calendar.Days Methods compare :: Day -> Day -> Ordering # (<) :: Day -> Day -> Bool # (<=) :: Day -> Day -> Bool # (>) :: Day -> Day -> Bool # (>=) :: Day -> Day -> Bool # max :: Day -> Day -> Day # min :: Day -> Day -> Day #
Ix Day
Instance details Defined in Data.Time.Calendar.Days Methods range :: (Day, Day) -> [Day] # index :: (Day, Day) -> Day -> Int # unsafeIndex :: (Day, Day) -> Day -> Int inRange :: (Day, Day) -> Day -> Bool # rangeSize :: (Day, Day) -> Int # unsafeRangeSize :: (Day, Day) -> Int
NFData Day
Instance details Defined in Data.Time.Calendar.Days Methods rnf :: Day -> () #
FormatTime Day
Instance details Defined in Data.Time.Format Methods formatCharacter :: Char -> Maybe (TimeLocale -> Maybe NumericPadOption -> Maybe Int -> Day -> String) #
ParseTime Day
Instance details Defined in Data.Time.Format.Parse Methods buildTime :: TimeLocale -> [(Char, String)] -> Maybe Day #

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.

parseTimeM #

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 -HHMM or -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.

parseTime #

Arguments

:: ParseTime t
=> TimeLocale	Time locale.
-> String	Format string.
-> String	Input string.
-> Maybe t	The time value, or `Nothing` if the input could not be parsed using the given format.

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 dateTimeFmt locale (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 timeFmt locale (e.g. %H:%M:%S)
%r: as time12Fmt locale (e.g. %I:%M:%S %p)
%P: day-half of day from (amPm locale), converted to lowercase, am, pm
%p: day-half of day from (amPm locale), 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, %Q omits the decimal point unless padding is specified.

`UTCTime` and `ZonedTime`

For 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.%q and %s%Q the decimals are positive, not negative. For example, 0.9 seconds before the Unix epoch is formatted as -1.1 with %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 dateFmt locale (e.g. %m/%d/%y)
%Y: year, no padding. Note %0Y and %_Y pad to four chars
%y: year of century, 0-padded to two chars, 00 - 99
%C: century, no padding. Note %0C and %_C pad to two chars
%B: month name, long form (fst from months locale), January - December
%b, %h: month name, short form (snd from months locale), 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 %0f and %_f pad 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 (snd from wDays locale), Sun - Sat
%A: day of week, long form (fst from wDays locale), 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.

primToIO :: (PrimBase m, PrimState m ~ RealWorld) => m a -> IO a #

Convert a PrimBase with a RealWorld state token to IO

primToST :: PrimBase m => m a -> ST (PrimState m) a #

Convert a PrimBase to ST

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 :: Type -> Type) a #

The reader monad transformer, which adds a read-only environment to the given monad.

The return function ignores the environment, while >>= passes the inherited environment to both subcomputations.

Constructors

ReaderT
Fields runReaderT :: r -> m a

Instances

Monad m => MonadReader r (ReaderT r m)
Instance details Defined in Control.Monad.Reader.Class Methods ask :: ReaderT r m r # local :: (r -> r) -> ReaderT r m a -> ReaderT r m a # reader :: (r -> a) -> ReaderT r m a #
MonadTrans (ReaderT r)
Instance details Defined in Control.Monad.Trans.Reader Methods lift :: Monad m => m a -> ReaderT r m a #
Monad m => Monad (ReaderT r m)
Instance details Defined in Control.Monad.Trans.Reader Methods (>>=) :: ReaderT r m a -> (a -> ReaderT r m b) -> ReaderT r m b # (>>) :: ReaderT r m a -> ReaderT r m b -> ReaderT r m b # return :: a -> ReaderT r m a # fail :: String -> ReaderT r m a #
Functor m => Functor (ReaderT r m)
Instance details Defined in Control.Monad.Trans.Reader Methods fmap :: (a -> b) -> ReaderT r m a -> ReaderT r m b # (<$) :: a -> ReaderT r m b -> ReaderT r m a #
MonadFix m => MonadFix (ReaderT r m)
Instance details Defined in Control.Monad.Trans.Reader Methods mfix :: (a -> ReaderT r m a) -> ReaderT r m a #
MonadFail m => MonadFail (ReaderT r m)
Instance details Defined in Control.Monad.Trans.Reader Methods fail :: String -> ReaderT r m a #
Applicative m => Applicative (ReaderT r m)
Instance details Defined in Control.Monad.Trans.Reader Methods pure :: a -> ReaderT r m a # (<>) :: ReaderT r m (a -> b) -> ReaderT r m a -> ReaderT r m b # liftA2 :: (a -> b -> c) -> ReaderT r m a -> ReaderT r m b -> ReaderT r m c # (>) :: ReaderT r m a -> ReaderT r m b -> ReaderT r m b # (<*) :: ReaderT r m a -> ReaderT r m b -> ReaderT r m a #
MonadPlus m => MonadPlus (ReaderT r m)
Instance details Defined in Control.Monad.Trans.Reader Methods mzero :: ReaderT r m a # mplus :: ReaderT r m a -> ReaderT r m a -> ReaderT r m a #
Alternative m => Alternative (ReaderT r m)
Instance details Defined in Control.Monad.Trans.Reader Methods empty :: ReaderT r m a # (<\|>) :: ReaderT r m a -> ReaderT r m a -> ReaderT r m a # some :: ReaderT r m a -> ReaderT r m [a] # many :: ReaderT r m a -> ReaderT r m [a] #
Distributive g => Distributive (ReaderT e g)
Instance details Defined in Data.Distributive Methods distribute :: Functor f => f (ReaderT e g a) -> ReaderT e g (f a) # collect :: Functor f => (a -> ReaderT e g b) -> f a -> ReaderT e g (f b) # distributeM :: Monad m => m (ReaderT e g a) -> ReaderT e g (m a) # collectM :: Monad m => (a -> ReaderT e g b) -> m a -> ReaderT e g (m b) #
Contravariant m => Contravariant (ReaderT r m)
Instance details Defined in Control.Monad.Trans.Reader Methods contramap :: (a -> b) -> ReaderT r m b -> ReaderT r m a # (>$) :: b -> ReaderT r m b -> ReaderT r m a #
Representable m => Representable (ReaderT e m)
Instance details Defined in Data.Functor.Rep Associated Types type Rep (ReaderT e m) :: Type # Methods tabulate :: (Rep (ReaderT e m) -> a) -> ReaderT e m a # index :: ReaderT e m a -> Rep (ReaderT e m) -> a #
MonadZip m => MonadZip (ReaderT r m)
Instance details Defined in Control.Monad.Trans.Reader Methods mzip :: ReaderT r m a -> ReaderT r m b -> ReaderT r m (a, b) # mzipWith :: (a -> b -> c) -> ReaderT r m a -> ReaderT r m b -> ReaderT r m c # munzip :: ReaderT r m (a, b) -> (ReaderT r m a, ReaderT r m b) #
MonadIO m => MonadIO (ReaderT r m)
Instance details Defined in Control.Monad.Trans.Reader Methods liftIO :: IO a -> ReaderT r m a #
Zip m => Zip (ReaderT e m)
Instance details Defined in Data.ChunkedZip Methods zipWith :: (a -> b -> c) -> ReaderT e m a -> ReaderT e m b -> ReaderT e m c # zip :: ReaderT e m a -> ReaderT e m b -> ReaderT e m (a, b) # zap :: ReaderT e m (a -> b) -> ReaderT e m a -> ReaderT e m b # unzip :: ReaderT e m (a, b) -> (ReaderT e m a, ReaderT e m b) #
MonadUnliftIO m => MonadUnliftIO (ReaderT r m)
Instance details Defined in Control.Monad.IO.Unlift Methods askUnliftIO :: ReaderT r m (UnliftIO (ReaderT r m)) # withRunInIO :: ((forall a. ReaderT r m a -> IO a) -> IO b) -> ReaderT r m b #
PrimMonad m => PrimMonad (ReaderT r m)
Instance details Defined in Control.Monad.Primitive Associated Types type PrimState (ReaderT r m) :: Type # Methods primitive :: (State# (PrimState (ReaderT r m)) -> (#State# (PrimState (ReaderT r m)), a#)) -> ReaderT r m a #
MonadResource m => MonadResource (ReaderT r m)
Instance details Defined in Control.Monad.Trans.Resource.Internal Methods liftResourceT :: ResourceT IO a -> ReaderT r m a #
Keyed m => Keyed (ReaderT e m)
Instance details Defined in Data.Key Methods mapWithKey :: (Key (ReaderT e m) -> a -> b) -> ReaderT e m a -> ReaderT e m b #
Zip m => Zip (ReaderT e m)
Instance details Defined in Data.Key Methods zipWith :: (a -> b -> c) -> ReaderT e m a -> ReaderT e m b -> ReaderT e m c # zip :: ReaderT e m a -> ReaderT e m b -> ReaderT e m (a, b) # zap :: ReaderT e m (a -> b) -> ReaderT e m a -> ReaderT e m b #
ZipWithKey m => ZipWithKey (ReaderT e m)
Instance details Defined in Data.Key Methods zipWithKey :: (Key (ReaderT e m) -> a -> b -> c) -> ReaderT e m a -> ReaderT e m b -> ReaderT e m c # zapWithKey :: ReaderT e m (Key (ReaderT e m) -> a -> b) -> ReaderT e m a -> ReaderT e m b #
Indexable m => Indexable (ReaderT e m)
Instance details Defined in Data.Key Methods index :: ReaderT e m a -> Key (ReaderT e m) -> a #
Lookup m => Lookup (ReaderT e m)
Instance details Defined in Data.Key Methods lookup :: Key (ReaderT e m) -> ReaderT e m a -> Maybe a #
Apply m => Apply (ReaderT e m)
Instance details Defined in Data.Functor.Bind.Class Methods (<.>) :: ReaderT e m (a -> b) -> ReaderT e m a -> ReaderT e m b # (.>) :: ReaderT e m a -> ReaderT e m b -> ReaderT e m b # (<.) :: ReaderT e m a -> ReaderT e m b -> ReaderT e m a # liftF2 :: (a -> b -> c) -> ReaderT e m a -> ReaderT e m b -> ReaderT e m c #
Bind m => Bind (ReaderT e m)
Instance details Defined in Data.Functor.Bind.Class Methods (>>-) :: ReaderT e m a -> (a -> ReaderT e m b) -> ReaderT e m b # join :: ReaderT e m (ReaderT e m a) -> ReaderT e m a #
DsMonad m => DsMonad (ReaderT r m)
Instance details Defined in Language.Haskell.TH.Desugar.Reify Methods localDeclarations :: ReaderT r m [Dec] #
FunctorWithIndex i m => FunctorWithIndex (e, i) (ReaderT e m)
Instance details Defined in Control.Lens.Indexed Methods imap :: ((e, i) -> a -> b) -> ReaderT e m a -> ReaderT e m b # imapped :: IndexedSetter (e, i) (ReaderT e m a) (ReaderT e m b) a b #
Zoom m n s t => Zoom (ReaderT e m) (ReaderT e n) s t
Instance details Defined in Control.Lens.Zoom Methods zoom :: LensLike' (Zoomed (ReaderT e m) c) t s -> ReaderT e m c -> ReaderT e n c #
Monad m => Magnify (ReaderT b m) (ReaderT a m) b a
Instance details Defined in Control.Lens.Zoom Methods magnify :: LensLike' (Magnified (ReaderT b m) c) a b -> ReaderT b m c -> ReaderT a m c #
Applicative m => MonoPointed (ReaderT r m a)
Instance details Defined in Data.MonoTraversable Methods opoint :: Element (ReaderT r m a) -> ReaderT r m a #
Functor m => MonoFunctor (ReaderT r m a)
Instance details Defined in Data.MonoTraversable Methods omap :: (Element (ReaderT r m a) -> Element (ReaderT r m a)) -> ReaderT r m a -> ReaderT r m a #
Wrapped (ReaderT r m a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (ReaderT r m a) :: Type # Methods _Wrapped' :: Iso' (ReaderT r m a) (Unwrapped (ReaderT r m a)) #
t ~ ReaderT s n b => Rewrapped (ReaderT r m a) t
Instance details Defined in Control.Lens.Wrapped
type Rep (ReaderT e m)
Instance details Defined in Data.Functor.Rep type Rep (ReaderT e m) = (e, Rep m)
type PrimState (ReaderT r m)
Instance details Defined in Control.Monad.Primitive type PrimState (ReaderT r m) = PrimState m
type Key (ReaderT e m)
Instance details Defined in Data.Key type Key (ReaderT e m) = (e, Key m)
type Zoomed (ReaderT e m)
Instance details Defined in Control.Lens.Zoom type Zoomed (ReaderT e m) = Zoomed m
type Magnified (ReaderT b m)
Instance details Defined in Control.Lens.Zoom type Magnified (ReaderT b m) = Effect m
type Element (ReaderT r m a)
Instance details Defined in Data.MonoTraversable type Element (ReaderT r m a) = a
type Unwrapped (ReaderT r m a)
Instance details Defined in Control.Lens.Wrapped type Unwrapped (ReaderT r m a) = r -> m a

asks #

Arguments

:: MonadReader r m
=> (r -> a)	The selector function to apply to the environment.
-> m a

Retrieves a function of the current environment.

data DList a #

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 y

Instances

Monad DList
Instance details Defined in Data.DList Methods (>>=) :: DList a -> (a -> DList b) -> DList b # (>>) :: DList a -> DList b -> DList b # return :: a -> DList a # fail :: String -> DList a #
Functor DList
Instance details Defined in Data.DList Methods fmap :: (a -> b) -> DList a -> DList b # (<$) :: a -> DList b -> DList a #
Applicative DList
Instance details Defined in Data.DList Methods pure :: a -> DList a # (<>) :: DList (a -> b) -> DList a -> DList b # liftA2 :: (a -> b -> c) -> DList a -> DList b -> DList c # (>) :: DList a -> DList b -> DList b # (<*) :: DList a -> DList b -> DList a #
Foldable DList
Instance details 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 # toList :: DList a -> [a] # null :: DList a -> Bool # length :: DList a -> Int # elem :: Eq a => a -> DList a -> Bool # maximum :: Ord a => DList a -> a # minimum :: Ord a => DList a -> a # sum :: Num a => DList a -> a # product :: Num a => DList a -> a #
MonadPlus DList
Instance details Defined in Data.DList Methods mzero :: DList a # mplus :: DList a -> DList a -> DList a #
Alternative DList
Instance details Defined in Data.DList Methods empty :: DList a # (<\|>) :: DList a -> DList a -> DList a # some :: DList a -> DList [a] # many :: DList a -> DList [a] #
IsList (DList a)
Instance details Defined in Data.DList Associated Types type Item (DList a) :: Type # Methods fromList :: [Item (DList a)] -> DList a # fromListN :: Int -> [Item (DList a)] -> DList a # toList :: DList a -> [Item (DList a)] #
Eq a => Eq (DList a)
Instance details Defined in Data.DList Methods (==) :: DList a -> DList a -> Bool # (/=) :: DList a -> DList a -> Bool #
Ord a => Ord (DList a)
Instance details Defined in Data.DList Methods compare :: DList a -> DList a -> Ordering # (<) :: DList a -> DList a -> Bool # (<=) :: DList a -> DList a -> Bool # (>) :: DList a -> DList a -> Bool # (>=) :: DList a -> DList a -> Bool # max :: DList a -> DList a -> DList a # min :: DList a -> DList a -> DList a #
Read a => Read (DList a)
Instance details Defined in Data.DList Methods readsPrec :: Int -> ReadS (DList a) # readList :: ReadS [DList a] # readPrec :: ReadPrec (DList a) # readListPrec :: ReadPrec [DList a] #
Show a => Show (DList a)
Instance details Defined in Data.DList Methods showsPrec :: Int -> DList a -> ShowS # show :: DList a -> String # showList :: [DList a] -> ShowS #
a ~ Char => IsString (DList a)
Instance details Defined in Data.DList Methods fromString :: String -> DList a #
Semigroup (DList a)
Instance details Defined in Data.DList Methods (<>) :: DList a -> DList a -> DList a # sconcat :: NonEmpty (DList a) -> DList a # stimes :: Integral b => b -> DList a -> DList a #
Monoid (DList a)
Instance details Defined in Data.DList Methods mempty :: DList a # mappend :: DList a -> DList a -> DList a # mconcat :: [DList a] -> DList a #
NFData a => NFData (DList a)
Instance details Defined in Data.DList Methods rnf :: DList a -> () #
type Item (DList a)
Instance details Defined in Data.DList type Item (DList a) = a
type Element (DList a)
Instance details Defined in Data.MonoTraversable.Instances type Element (DList a) = a
type Index (DList a)
Instance details Defined in Data.MonoTraversable.Instances type Index (DList a) = Int

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

force :: NFData a => a -> a #

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 h

Since: 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.

whenJust :: Monoid m => Maybe a -> (a -> m) -> m Source #

Documentation

Examples

Examples

Examples

Generic NFData deriving

Compatibility with previous deepseq versions

Examples

Examples

Examples

Examples

Examples

Examples

Examples

Examples

Examples

Examples

Examples

Examples

Examples

Examples

Examples

Examples

Examples

Examples

Examples

Examples

Examples

Examples

Example usage

Example

Examples

Examples

Examples

Examples

Examples

Examples

<modifier>

<width>

<specifier>

TimeZone

LocalTime

TimeOfDay

UTCTime and ZonedTime

Day

`Generic` `NFData` deriving

Compatibility with previous `deepseq` versions

`<modifier>`

`<width>`

`<specifier>`

`TimeZone`

`LocalTime`

`TimeOfDay`

`UTCTime` and `ZonedTime`

`Day`