| Safe Haskell | None |
|---|---|
| Language | GHC2021 |
Shrun.Prelude
Description
Custom prelude. The idea is to:
- Re-export useful prelude functions/types
- Export various functions/types from base
- Export new functions meant to address prelude limitations (e.g. total replacements for partial functions).
This is not a comprehensive replacement for Prelude, just the functionality needed for this application. Thus it is natural to add new functionality/exports here over time.
Synopsis
- headMaybe :: Foldable f => f a -> Maybe a
- fromFoldable :: Foldable f => a -> f a -> a
- (<<$>>) :: (Functor f, Functor g) => (a -> b) -> f (g a) -> f (g b)
- (<<&>>) :: (Functor f, Functor g) => f (g a) -> (a -> b) -> f (g b)
- (.>) :: (a -> b) -> (b -> c) -> a -> c
- unsafeConvertIntegral :: (Bits a, Bits b, HasCallStack, Integral a, Integral b, Show a, Typeable a, Typeable b) => a -> b
- todo :: HasCallStack => a
- setUncaughtExceptionHandlerDisplay :: IO ()
- showt :: Show a => a -> Text
- displayExceptiont :: Exception e => e -> Text
- type List = []
- type Tuple2 = (,)
- type Tuple3 = (,,)
- module Control.Monad.Fail
- module Control.Monad.IO.Class
- module Control.Monad.Trans
- module Data.Eq
- module Optics.Core.Extras
- void :: Functor f => f a -> f ()
- data Bool
- data Char
- data Double
- data Float
- data Int
- data Ordering
- data Maybe a
- class a ~# b => (a :: k) ~ (b :: k)
- data Natural
- data Integer
- data Void
- data ExitCode
- class Foldable (t :: Type -> Type) where
- data Size = B
- data NonEmpty a = a :| [a]
- finally :: (HasCallStack, MonadMask m) => m a -> m b -> m a
- class Generic a
- class Show a where
- class Bounded a where
- class Enum a where
- class (Real a, Enum a) => Integral a
- data IO a
- class Eq a => Ord a where
- type String = [Char]
- type Type = TYPE LiftedRep
- type Constraint = CONSTRAINT LiftedRep
- ($) :: (a -> b) -> a -> b
- otherwise :: Bool
- (++) :: [a] -> [a] -> [a]
- join :: Monad m => m (m a) -> m a
- class Applicative m => Monad (m :: Type -> Type) where
- (>>=) :: m a -> (a -> m b) -> m b
- class Functor (f :: Type -> Type) where
- fmap :: (a -> b) -> f a -> f b
- class Functor f => Applicative (f :: Type -> Type) where
- class Semigroup a => Monoid a where
- class Semigroup a where
- (<>) :: a -> a -> a
- class Monad m => MonadReader r (m :: Type -> Type) | m -> r where
- data ReaderT r (m :: Type -> Type) a
- id :: a -> a
- data Either a b
- fst :: (a, b) -> a
- snd :: (a, b) -> b
- data Value
- class Applicative f => Alternative (f :: Type -> Type) where
- data ByteString
- class (Functor t, Foldable t) => Traversable (t :: Type -> Type) where
- traverse :: Applicative f => (a -> f b) -> t a -> f (t b)
- filter :: (a -> Bool) -> [a] -> [a]
- typeMismatch :: Value -> DecodeM a
- decode :: DecodeTOML a => Text -> Either TOMLError a
- unless :: Applicative f => Bool -> f () -> f ()
- ($>) :: Functor f => f a -> b -> f b
- fromMaybe :: a -> Maybe a -> a
- absurd :: Void -> a
- when :: Applicative f => Bool -> f () -> f ()
- data Proxy (t :: k) = Proxy
- data Text
- (<$>) :: Functor f => (a -> b) -> f a -> f b
- seq :: a -> b -> b
- class FromInteger a where
- afromInteger :: Integer -> a
- class Num a where
- data Handle
- class (forall a. Functor (p a)) => Bifunctor (p :: Type -> Type -> Type)
- error :: HasCallStack => [Char] -> a
- bracket :: (HasCallStack, MonadMask m) => m a -> (a -> m c) -> (a -> m b) -> m b
- for :: (Traversable t, Applicative f) => t a -> (a -> f b) -> f (t b)
- class (Typeable e, Show e) => Exception e where
- fromException :: SomeException -> Maybe e
- displayException :: e -> String
- forever :: Applicative f => f a -> f b
- class Monad m => MonadHandleWriter (m :: Type -> Type) where
- threadDelay :: Int -> IO ()
- class MonadCatch m => MonadMask (m :: Type -> Type) where
- mask :: HasCallStack => ((forall a. m a -> m a) -> m b) -> m b
- try :: (HasCallStack, MonadCatch m, Exception e) => m a -> m (Either e a)
- class Monad m => MonadTerminal (m :: Type -> Type) where
- traverse_ :: (Foldable t, Applicative f) => (a -> f b) -> t a -> f ()
- for_ :: (Foldable t, Applicative f) => t a -> (a -> f b) -> f ()
- const :: a -> b -> a
- zip :: [a] -> [b] -> [(a, b)]
- print :: Show a => a -> IO ()
- getField :: DecodeTOML a => Text -> Decoder a
- (&&) :: Bool -> Bool -> Bool
- (||) :: Bool -> Bool -> Bool
- not :: Bool -> Bool
- type HasCallStack = ?callStack :: CallStack
- data SomeException
- undefined :: HasCallStack => a
- (<**>) :: Applicative f => f a -> f (a -> b) -> f b
- (=<<) :: Monad m => (a -> m b) -> m a -> m b
- (.) :: (b -> c) -> (a -> b) -> a -> c
- flip :: (a -> b -> c) -> b -> a -> c
- maybe :: b -> (a -> b) -> Maybe a -> b
- replicate :: Int -> a -> [a]
- any :: Foldable t => (a -> Bool) -> t a -> Bool
- truncate :: (RealFrac a, Integral b) => a -> b
- (%) :: forall k l m (is :: IxList) (js :: IxList) (ks :: IxList) s t u v a b. (JoinKinds k l m, AppendIndices is js ks) => Optic k is s t u v -> Optic l js u v a b -> Optic m ks s t a b
- (<&>) :: Functor f => f a -> (a -> b) -> f b
- (&) :: a -> (a -> b) -> b
- data TVar a
- data IOMode
- to :: (s -> a) -> Getter s a
- type FilePath = String
- catchAny :: (HasCallStack, MonadCatch m) => m a -> (SomeException -> m a) -> m a
- data IORef a
- class Monad m => MonadIORef (m :: Type -> Type) where
- newIORef :: HasCallStack => a -> m (IORef a)
- readIORef :: HasCallStack => IORef a -> m a
- writeIORef :: HasCallStack => IORef a -> a -> m ()
- modifyIORef' :: HasCallStack => IORef a -> (a -> a) -> m ()
- atomicModifyIORef' :: HasCallStack => IORef a -> (a -> (a, b)) -> m b
- (>=>) :: Monad m => (a -> m b) -> (b -> m c) -> a -> m c
- (<=<) :: Monad m => (b -> m c) -> (a -> m b) -> a -> m c
- exitFailure :: (HasCallStack, MonadThrow m) => m a
- class Monad m => MonadEnv (m :: Type -> Type) where
- withArgs :: HasCallStack => [String] -> m a -> m a
- data Decoder a
- pack :: String -> Text
- unpack :: Text -> String
- asks :: MonadReader r m => (r -> a) -> m a
- data ConsoleRegion
- data RegionLayout = Linear
- class MonadThrow m => MonadCatch (m :: Type -> Type)
- class Monad m => MonadThrow (m :: Type -> Type)
- throwM :: (HasCallStack, MonadThrow m, Exception e) => e -> m a
- decodeUtf8 :: ByteString -> Either UnicodeException Text
- decodeUtf8Lenient :: ByteString -> Text
- data Process stdin stdout stderr
- data Seq a where
- class Monad m => MonadPathWriter (m :: Type -> Type) where
- removeFile :: OsPath -> m ()
- type OsPath = OsString
- class Monad m => MonadPathReader (m :: Type -> Type) where
- getFileSize :: OsPath -> m Integer
- doesFileExist :: OsPath -> m Bool
- doesDirectoryExist :: OsPath -> m Bool
- (</>) :: OsPath -> OsPath -> OsPath
- class Monad m => MonadThread (m :: Type -> Type)
- class Monad m => MonadAsync (m :: Type -> Type)
- tryAny :: (HasCallStack, MonadCatch m) => m a -> m (Either SomeException a)
- throwCS :: forall m e a. (Exception e, HasCallStack, MonadThrow m) => e -> m a
- catchCS :: forall m e a. (Exception e, HasCallStack, MonadCatch m) => m a -> (e -> m a) -> m a
- osp :: QuasiQuoter
- getXdgConfig :: (HasCallStack, MonadPathReader m) => OsPath -> m OsPath
- getXdgState :: (HasCallStack, MonadPathReader m) => OsPath -> m OsPath
- removeFileIfExists :: (HasCallStack, MonadPathReader m, MonadPathWriter m) => OsPath -> m ()
- removeDirectoryIfExists :: (HasCallStack, MonadPathReader m, MonadPathWriter m) => OsPath -> m ()
- hPutUtf8 :: (HasCallStack, MonadHandleWriter m) => Handle -> Text -> m ()
- class Monad m => MonadHandleReader (m :: Type -> Type)
- class Monad m => MonadFileWriter (m :: Type -> Type)
- writeFileUtf8 :: (HasCallStack, MonadFileWriter m) => OsPath -> Text -> m ()
- appendFileUtf8 :: (HasCallStack, MonadFileWriter m) => OsPath -> Text -> m ()
- class Monad m => MonadFileReader (m :: Type -> Type)
- readFileUtf8Lenient :: (HasCallStack, MonadFileReader m) => OsPath -> m Text
- readFileUtf8ThrowM :: (HasCallStack, MonadFileReader m, MonadThrow m) => OsPath -> m Text
- class Monad m => MonadOptparse (m :: Type -> Type) where
- execParser :: HasCallStack => ParserInfo a -> m a
- data TBQueue a
- class Monad m => MonadSTM (m :: Type -> Type)
- newTVarA :: (HasCallStack, MonadSTM m) => a -> m (TVar a)
- readTVarA :: (HasCallStack, MonadSTM m) => TVar a -> m a
- writeTVarA :: (HasCallStack, MonadSTM m) => TVar a -> a -> m ()
- modifyTVarA' :: (HasCallStack, MonadSTM m) => TVar a -> (a -> a) -> m ()
- newTBQueueA :: (HasCallStack, MonadSTM m) => Natural -> m (TBQueue a)
- readTBQueueA :: (HasCallStack, MonadSTM m) => TBQueue a -> m a
- writeTBQueueA :: (HasCallStack, MonadSTM m) => TBQueue a -> a -> m ()
- flushTBQueueA :: (HasCallStack, MonadSTM m) => TBQueue a -> m [a]
- putText :: (HasCallStack, MonadTerminal m) => Text -> m ()
- putTextLn :: (HasCallStack, MonadTerminal m) => Text -> m ()
- class Monad m => MonadTime (m :: Type -> Type)
- class Monad m => MonadTypedProcess (m :: Type -> Type)
- decodeWith :: Decoder a -> Text -> Either TOMLError a
- type Prism s t a b = Optic A_Prism NoIx s t a b
- type Lens s t a b = Optic A_Lens NoIx s t a b
- type Getter s a = Optic' A_Getter NoIx s a
- review :: forall k (is :: IxList) t b. Is k A_Review => Optic' k is t b -> b -> t
- preview :: forall k (is :: IxList) s a. Is k An_AffineFold => Optic' k is s a -> s -> Maybe a
- (^?) :: forall k s (is :: IxList) a. Is k An_AffineFold => s -> Optic' k is s a -> Maybe a
- prism :: (b -> t) -> (s -> Either t a) -> Prism s t a b
- view :: forall k (is :: IxList) s a. Is k A_Getter => Optic' k is s a -> s -> a
- _2 :: Field2 s t a b => Lens s t a b
- (^.) :: forall k s (is :: IxList) a. Is k A_Getter => s -> Optic' k is s a -> a
- (.~) :: forall k (is :: IxList) s t a b. Is k A_Setter => Optic k is s t a b -> b -> s -> t
- type Iso' s a = Optic' An_Iso NoIx s a
- (?~) :: forall k (is :: IxList) s t a b. Is k A_Setter => Optic k is s t a (Maybe b) -> b -> s -> t
- _1 :: Field1 s t a b => Lens s t a b
- _Left :: Prism (Either a b) (Either c b) a c
- type Prism' s a = Optic' A_Prism NoIx s a
- type Lens' s a = Optic' A_Lens NoIx s a
- type Optic' k (is :: IxList) s a = Optic k is s s a a
- set' :: forall k (is :: IxList) s t a b. Is k A_Setter => Optic k is s t a b -> b -> s -> t
- _3 :: Field3 s t a b => Lens s t a b
- (#) :: forall k (is :: IxList) t b. Is k A_Review => Optic' k is t b -> b -> t
- _Right :: Prism (Either a b) (Either a c) b c
- _Just :: Prism (Maybe a) (Maybe b) a b
- _Nothing :: Prism' (Maybe a) ()
- iso :: (s -> a) -> (b -> t) -> Iso s t a b
- newtype Bytes (s :: Size) n = MkBytes n
- pattern IsEmpty :: Seq a
- data NESeq a where
- class LabelOptic (name :: Symbol) k s t a b | name s -> k a, name t -> k b, name s b -> t, name t a -> s where
- labelOptic :: Optic k NoIx s t a b
- type NoIx = '[] :: [Type]
- data An_AffineFold
- data A_Getter
- data A_Setter
- data An_AffineTraversal
- data A_Lens
- data An_Iso
- class Is k l
- type AffineTraversal' s a = Optic' An_AffineTraversal NoIx s a
- lensVL :: LensVL s t a b -> Lens s t a b
- (%?) :: forall (is :: IxList) (js :: IxList) (ks :: IxList) k k' l m s t u v a b. (AppendIndices is js ks, JoinKinds k A_Prism k', JoinKinds k' l m) => Optic k is s t (Maybe u) (Maybe v) -> Optic l js u v a b -> Optic m ks s t a b
- over' :: forall k (is :: IxList) s t a b. Is k A_Setter => Optic k is s t a b -> (a -> b) -> s -> t
- (%!~) :: forall k (is :: IxList) s t a b. Is k A_Setter => Optic k is s t a b -> (a -> b) -> s -> t
- _MkBytes :: forall (s :: Size) n. Iso' (Bytes s n) n
- data TOMLError
- renderTOMLError :: TOMLError -> Text
- class DecodeTOML a where
- tomlDecoder :: Decoder a
- makeDecoder :: (Value -> DecodeM a) -> Decoder a
- runDecoder :: Decoder a -> Value -> DecodeM a
- invalidValue :: Text -> Value -> DecodeM a
- getFieldWith :: Decoder a -> Text -> Decoder a
- getFieldOpt :: DecodeTOML a => Text -> Decoder (Maybe a)
- getFieldOptWith :: Decoder a -> Text -> Decoder (Maybe a)
- getArrayOf :: Decoder a -> Decoder [a]
Total versions of partial functions
headMaybe :: Foldable f => f a -> Maybe a Source #
Safe head.
>>>headMaybe [1,2,3]Just 1
>>>headMaybe []Nothing
Misc utilities
fromFoldable :: Foldable f => a -> f a -> a Source #
From foldable.
(<<$>>) :: (Functor f, Functor g) => (a -> b) -> f (g a) -> f (g b) infixl 4 Source #
Lifted fmap.
>>>not <<$>> [Just True, Nothing, Just False][Just False,Nothing,Just True]
unsafeConvertIntegral :: (Bits a, Bits b, HasCallStack, Integral a, Integral b, Show a, Typeable a, Typeable b) => a -> b Source #
Like fromIntegral, except:
- The conversion is only between integral types.
- Errors rather than silently rounds for bounds issues.
todo :: HasCallStack => a Source #
Warning: todo remains in code
setUncaughtExceptionHandlerDisplay :: IO () Source #
TODO: We have a weird error on OSX that is caused by the CPP in app/Main.hs:
error: non-portable path to file '".stack-workdistaarch64-osxghc-9.8.2buildShrunautogen/cabal_macros.h"'; specified path differs in case from file name on disk [-Werror,-Wnonportable-include-path] #include ".stack-workdistaarch64-osxghc-9.8.2buildshrunautogen/cabal_macros.h" ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ".stack-workdistaarch64-osxghc-9.8.2buildShrunautogen/cabal_macros.h"
There are multiple solutions:
- Attempt to disable -Wnonportable-include-path (see also https://github.com/IHaskell/IHaskell/issues/942).
- Move the CPP here (seems fine here (maybe because it's not an exe?)).
In any case, once we move completely to GHC 9.10+, we can remove this branch.
Text replacements for String functions.
displayExceptiont :: Exception e => e -> Text Source #
Text version of displayException.
Anti-punning aliases
Prelude exports
module Control.Monad.Fail
module Control.Monad.IO.Class
module Control.Monad.Trans
module Data.Eq
module Optics.Core.Extras
void :: Functor f => f a -> f () #
void valueIO action.
Examples
Replace the contents of a Maybe Int
>>>void NothingNothing>>>void (Just 3)Just ()
Replace the contents of an Either Int IntEither Int ()
>>>void (Left 8675309)Left 8675309>>>void (Right 8675309)Right ()
Replace every element of a list with unit:
>>>void [1,2,3][(),(),()]
Replace the second element of a pair with unit:
>>>void (1,2)(1,())
Discard the result of an IO action:
>>>mapM print [1,2]1 2 [(),()]>>>void $ mapM print [1,2]1 2
Instances
The character type Char represents Unicode codespace
and its elements are code points as in definitions
D9 and D10 of the Unicode Standard.
Character literals in Haskell are single-quoted: 'Q', 'Я' or 'Ω'.
To represent a single quote itself use '\'', and to represent a backslash
use '\\'. The full grammar can be found in the section 2.6 of the
Haskell 2010 Language Report.
To specify a character by its code point one can use decimal, hexadecimal
or octal notation: '\65', '\x41' and '\o101' are all alternative forms
of 'A'. The largest code point is '\x10ffff'.
There is a special escape syntax for ASCII control characters:
| Escape | Alternatives | Meaning |
|---|---|---|
'\NUL' | '\0' | null character |
'\SOH' | '\1' | start of heading |
'\STX' | '\2' | start of text |
'\ETX' | '\3' | end of text |
'\EOT' | '\4' | end of transmission |
'\ENQ' | '\5' | enquiry |
'\ACK' | '\6' | acknowledge |
'\BEL' | '\7', '\a' | bell (alert) |
'\BS' | '\8', '\b' | backspace |
'\HT' | '\9', '\t' | horizontal tab |
'\LF' | '\10', '\n' | line feed (new line) |
'\VT' | '\11', '\v' | vertical tab |
'\FF' | '\12', '\f' | form feed |
'\CR' | '\13', '\r' | carriage return |
'\SO' | '\14' | shift out |
'\SI' | '\15' | shift in |
'\DLE' | '\16' | data link escape |
'\DC1' | '\17' | device control 1 |
'\DC2' | '\18' | device control 2 |
'\DC3' | '\19' | device control 3 |
'\DC4' | '\20' | device control 4 |
'\NAK' | '\21' | negative acknowledge |
'\SYN' | '\22' | synchronous idle |
'\ETB' | '\23' | end of transmission block |
'\CAN' | '\24' | cancel |
'\EM' | '\25' | end of medium |
'\SUB' | '\26' | substitute |
'\ESC' | '\27' | escape |
'\FS' | '\28' | file separator |
'\GS' | '\29' | group separator |
'\RS' | '\30' | record separator |
'\US' | '\31' | unit separator |
'\SP' | '\32', ' ' | space |
'\DEL' | '\127' | delete |
Instances
| Data Char | Since: base-4.0.0.0 | ||||
Defined in Data.Data Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Char -> c Char # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Char # dataTypeOf :: Char -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Char) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Char) # gmapT :: (forall b. Data b => b -> b) -> Char -> Char # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Char -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Char -> r # gmapQ :: (forall d. Data d => d -> u) -> Char -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Char -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Char -> m Char # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Char -> m Char # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Char -> m Char # | |||||
| Storable Char | Since: base-2.1 | ||||
Defined in Foreign.Storable | |||||
| Bounded Char | Since: base-2.1 | ||||
| Enum Char | Since: base-2.1 | ||||
| Ix Char | Since: base-2.1 | ||||
| Read Char | Since: base-2.1 | ||||
| Show Char | Since: base-2.1 | ||||
| IsChar Char | Since: base-2.1 | ||||
| PrintfArg Char | Since: base-2.1 | ||||
Defined in Text.Printf | |||||
| Outputable String | |||||
| ToRegionContent String | |||||
Defined in System.Console.Regions Methods | |||||
| IsAtom String | |||||
| IsValue String | |||||
| IsVariant String | |||||
| NFData Char | |||||
Defined in Control.DeepSeq | |||||
| Eq Char | |||||
| Ord Char | |||||
| Hashable Char | |||||
| TraversableStream String | |||||
| VisualStream String | |||||
| Pretty String | |||||
| Pretty Char | Instead of
| ||||
| Uniform Char | |||||
Defined in System.Random.Internal Methods uniformM :: StatefulGen g m => g -> m Char Source # | |||||
| UniformRange Char | |||||
Defined in System.Random.Internal | |||||
| DecodeTOML String | |||||
Defined in TOML.Decode Methods | |||||
| DecodeTOML Char | |||||
Defined in TOML.Decode Methods | |||||
| Unbox Char | |||||
Defined in Data.Vector.Unboxed.Base | |||||
| TestCoercion SChar | Since: base-4.18.0.0 | ||||
Defined in GHC.TypeLits | |||||
| TestEquality SChar | Since: base-4.18.0.0 | ||||
Defined in GHC.TypeLits | |||||
| Lift Char | |||||
| Vector Vector Char | |||||
Defined in Data.Vector.Unboxed.Base Methods basicUnsafeFreeze :: Mutable Vector s Char -> ST s (Vector Char) Source # basicUnsafeThaw :: Vector Char -> ST s (Mutable Vector s Char) Source # basicLength :: Vector Char -> Int Source # basicUnsafeSlice :: Int -> Int -> Vector Char -> Vector Char Source # basicUnsafeIndexM :: Vector Char -> Int -> Box Char Source # basicUnsafeCopy :: Mutable Vector s Char -> Vector Char -> ST s () Source # | |||||
| MVector MVector Char | |||||
Defined in Data.Vector.Unboxed.Base Methods basicLength :: MVector s Char -> Int Source # basicUnsafeSlice :: Int -> Int -> MVector s Char -> MVector s Char Source # basicOverlaps :: MVector s Char -> MVector s Char -> Bool Source # basicUnsafeNew :: Int -> ST s (MVector s Char) Source # basicInitialize :: MVector s Char -> ST s () Source # basicUnsafeReplicate :: Int -> Char -> ST s (MVector s Char) Source # basicUnsafeRead :: MVector s Char -> Int -> ST s Char Source # basicUnsafeWrite :: MVector s Char -> Int -> Char -> ST s () Source # basicClear :: MVector s Char -> ST s () Source # basicSet :: MVector s Char -> Char -> ST s () Source # basicUnsafeCopy :: MVector s Char -> MVector s Char -> ST s () Source # basicUnsafeMove :: MVector s Char -> MVector s Char -> ST s () Source # basicUnsafeGrow :: MVector s Char -> Int -> ST s (MVector s Char) Source # | |||||
| KnownSymbol n => Reifies (n :: Symbol) String | |||||
Defined in Data.Reflection | |||||
| Generic1 (URec Char :: k -> Type) | |||||
Defined in GHC.Generics Associated Types
| |||||
| Foldable (UChar :: Type -> Type) | Since: base-4.9.0.0 | ||||
Defined in Data.Foldable Methods fold :: Monoid m => UChar m -> m # foldMap :: Monoid m => (a -> m) -> UChar a -> m # foldMap' :: Monoid m => (a -> m) -> UChar a -> m # foldr :: (a -> b -> b) -> b -> UChar a -> b # foldr' :: (a -> b -> b) -> b -> UChar a -> b # foldl :: (b -> a -> b) -> b -> UChar a -> b # foldl' :: (b -> a -> b) -> b -> UChar a -> b # foldr1 :: (a -> a -> a) -> UChar a -> a # foldl1 :: (a -> a -> a) -> UChar a -> a # elem :: Eq a => a -> UChar a -> Bool # maximum :: Ord a => UChar a -> a # minimum :: Ord a => UChar a -> a # | |||||
| Traversable (UChar :: Type -> Type) | Since: base-4.9.0.0 | ||||
| Functor (URec Char :: Type -> Type) | Since: base-4.9.0.0 | ||||
| Generic (URec Char p) | |||||
Defined in GHC.Generics Associated Types
| |||||
| Show (URec Char p) | Since: base-4.9.0.0 | ||||
| Eq (URec Char p) | Since: base-4.9.0.0 | ||||
| Ord (URec Char p) | Since: base-4.9.0.0 | ||||
Defined in GHC.Generics | |||||
| newtype Vector Char | |||||
| data URec Char (p :: k) | Used for marking occurrences of Since: base-4.9.0.0 | ||||
| newtype MVector s Char | |||||
| type Compare (a :: Char) (b :: Char) | |||||
Defined in Data.Type.Ord | |||||
| type Rep1 (URec Char :: k -> Type) | Since: base-4.9.0.0 | ||||
Defined in GHC.Generics | |||||
| type Rep (URec Char p) | Since: base-4.9.0.0 | ||||
Defined in GHC.Generics | |||||
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
| MGroup Double | Since: algebra-simple-0.1 | ||||
| MMonoid Double | Since: algebra-simple-0.1 | ||||
Defined in Numeric.Algebra.Multiplicative.MMonoid | |||||
| MSemigroup Double | Since: algebra-simple-0.1 | ||||
| Normed Double | Since: algebra-simple-0.1 | ||||
| FromInteger Double | Since: algebra-simple-0.1 | ||||
Defined in Numeric.Literal.Integer Methods afromInteger :: Integer -> Double Source # | |||||
| Data Double | Since: base-4.0.0.0 | ||||
Defined in Data.Data Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Double -> c Double # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Double # toConstr :: Double -> Constr # dataTypeOf :: Double -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Double) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Double) # gmapT :: (forall b. Data b => b -> b) -> Double -> Double # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Double -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Double -> r # gmapQ :: (forall d. Data d => d -> u) -> Double -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Double -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Double -> m Double # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Double -> m Double # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Double -> m Double # | |||||
| Storable Double | Since: base-2.1 | ||||
| Floating Double | Since: base-2.1 | ||||
| RealFloat Double | Since: base-2.1 | ||||
Defined in GHC.Float Methods floatRadix :: Double -> Integer # floatDigits :: Double -> Int # floatRange :: Double -> (Int, Int) # decodeFloat :: Double -> (Integer, Int) # encodeFloat :: Integer -> Int -> Double # significand :: Double -> Double # scaleFloat :: Int -> Double -> Double # isInfinite :: Double -> Bool # isDenormalized :: Double -> Bool # isNegativeZero :: Double -> Bool # | |||||
| Read Double | Since: base-2.1 | ||||
| PrintfArg Double | Since: base-2.1 | ||||
Defined in Text.Printf | |||||
| IsAtom Double | |||||
| IsValue Double | |||||
| IsVariant Double | |||||
| NFData Double | |||||
Defined in Control.DeepSeq | |||||
| Eq Double | Note that due to the presence of
Also note that
| ||||
| Ord Double | IEEE 754 IEEE 754-2008, section 5.11 requires that if at least one of arguments of
IEEE 754-2008, section 5.10 defines Thus, users must be extremely cautious when using Moving further, the behaviour of IEEE 754-2008 compliant | ||||
| Hashable Double | Note: prior to The Since: hashable-1.3.0.0 | ||||
| Pretty Double |
| ||||
| UniformRange Double | |||||
Defined in System.Random.Internal | |||||
| DecodeTOML Double | |||||
Defined in TOML.Decode Methods | |||||
| Unbox Double | |||||
Defined in Data.Vector.Unboxed.Base | |||||
| Lift Double | |||||
| Vector Vector Double | |||||
Defined in Data.Vector.Unboxed.Base Methods basicUnsafeFreeze :: Mutable Vector s Double -> ST s (Vector Double) Source # basicUnsafeThaw :: Vector Double -> ST s (Mutable Vector s Double) Source # basicLength :: Vector Double -> Int Source # basicUnsafeSlice :: Int -> Int -> Vector Double -> Vector Double Source # basicUnsafeIndexM :: Vector Double -> Int -> Box Double Source # basicUnsafeCopy :: Mutable Vector s Double -> Vector Double -> ST s () Source # | |||||
| MVector MVector Double | |||||
Defined in Data.Vector.Unboxed.Base Methods basicLength :: MVector s Double -> Int Source # basicUnsafeSlice :: Int -> Int -> MVector s Double -> MVector s Double Source # basicOverlaps :: MVector s Double -> MVector s Double -> Bool Source # basicUnsafeNew :: Int -> ST s (MVector s Double) Source # basicInitialize :: MVector s Double -> ST s () Source # basicUnsafeReplicate :: Int -> Double -> ST s (MVector s Double) Source # basicUnsafeRead :: MVector s Double -> Int -> ST s Double Source # basicUnsafeWrite :: MVector s Double -> Int -> Double -> ST s () Source # basicClear :: MVector s Double -> ST s () Source # basicSet :: MVector s Double -> Double -> ST s () Source # basicUnsafeCopy :: MVector s Double -> MVector s Double -> ST s () Source # basicUnsafeMove :: MVector s Double -> MVector s Double -> ST s () Source # basicUnsafeGrow :: MVector s Double -> Int -> ST s (MVector s Double) Source # | |||||
| Generic1 (URec Double :: k -> Type) | |||||
Defined in GHC.Generics Associated Types
| |||||
| Foldable (UDouble :: Type -> Type) | Since: base-4.9.0.0 | ||||
Defined in Data.Foldable Methods fold :: Monoid m => UDouble m -> m # foldMap :: Monoid m => (a -> m) -> UDouble a -> m # foldMap' :: Monoid m => (a -> m) -> UDouble a -> m # foldr :: (a -> b -> b) -> b -> UDouble a -> b # foldr' :: (a -> b -> b) -> b -> UDouble a -> b # foldl :: (b -> a -> b) -> b -> UDouble a -> b # foldl' :: (b -> a -> b) -> b -> UDouble a -> b # foldr1 :: (a -> a -> a) -> UDouble a -> a # foldl1 :: (a -> a -> a) -> UDouble a -> a # elem :: Eq a => a -> UDouble a -> Bool # maximum :: Ord a => UDouble a -> a # minimum :: Ord a => UDouble a -> a # | |||||
| Traversable (UDouble :: Type -> Type) | Since: base-4.9.0.0 | ||||
| Functor (URec Double :: Type -> Type) | Since: base-4.9.0.0 | ||||
| Generic (URec Double p) | |||||
Defined in GHC.Generics Associated Types
| |||||
| Show (URec Double p) | Since: base-4.9.0.0 | ||||
| Eq (URec Double p) | Since: base-4.9.0.0 | ||||
| Ord (URec Double p) | Since: base-4.9.0.0 | ||||
Defined in GHC.Generics Methods compare :: URec Double p -> URec Double p -> Ordering # (<) :: URec Double p -> URec Double p -> Bool # (<=) :: URec Double p -> URec Double p -> Bool # (>) :: URec Double p -> URec Double p -> Bool # (>=) :: URec Double p -> URec Double p -> Bool # | |||||
| type BaseFormatter Double | |||||
Defined in Data.Bytes.Formatting.Base | |||||
| newtype Vector Double | |||||
| data URec Double (p :: k) | Used for marking occurrences of Since: base-4.9.0.0 | ||||
| newtype MVector s Double | |||||
| type Rep1 (URec Double :: k -> Type) | Since: base-4.9.0.0 | ||||
Defined in GHC.Generics | |||||
| type Rep (URec Double p) | Since: base-4.9.0.0 | ||||
Defined in GHC.Generics | |||||
Single-precision floating point numbers. It is desirable that this type be at least equal in range and precision to the IEEE single-precision type.
Instances
| MGroup Float | Since: algebra-simple-0.1 | ||||
| MMonoid Float | Since: algebra-simple-0.1 | ||||
Defined in Numeric.Algebra.Multiplicative.MMonoid | |||||
| MSemigroup Float | Since: algebra-simple-0.1 | ||||
| Normed Float | Since: algebra-simple-0.1 | ||||
| FromInteger Float | Since: algebra-simple-0.1 | ||||
Defined in Numeric.Literal.Integer Methods afromInteger :: Integer -> Float Source # | |||||
| Data Float | Since: base-4.0.0.0 | ||||
Defined in Data.Data Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Float -> c Float # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Float # dataTypeOf :: Float -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Float) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Float) # gmapT :: (forall b. Data b => b -> b) -> Float -> Float # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Float -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Float -> r # gmapQ :: (forall d. Data d => d -> u) -> Float -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Float -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Float -> m Float # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Float -> m Float # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Float -> m Float # | |||||
| Storable Float | Since: base-2.1 | ||||
| Floating Float | Since: base-2.1 | ||||
| RealFloat Float | Since: base-2.1 | ||||
Defined in GHC.Float Methods floatRadix :: Float -> Integer # floatDigits :: Float -> Int # floatRange :: Float -> (Int, Int) # decodeFloat :: Float -> (Integer, Int) # encodeFloat :: Integer -> Int -> Float # significand :: Float -> Float # scaleFloat :: Int -> Float -> Float # isInfinite :: Float -> Bool # isDenormalized :: Float -> Bool # isNegativeZero :: Float -> Bool # | |||||
| Read Float | Since: base-2.1 | ||||
| PrintfArg Float | Since: base-2.1 | ||||
Defined in Text.Printf | |||||
| NFData Float | |||||
Defined in Control.DeepSeq | |||||
| Eq Float | Note that due to the presence of
Also note that
| ||||
| Ord Float | See | ||||
| Hashable Float | Note: prior to The Since: hashable-1.3.0.0 | ||||
| Pretty Float |
| ||||
| UniformRange Float | |||||
Defined in System.Random.Internal | |||||
| DecodeTOML Float | |||||
Defined in TOML.Decode Methods | |||||
| Unbox Float | |||||
Defined in Data.Vector.Unboxed.Base | |||||
| Lift Float | |||||
| Vector Vector Float | |||||
Defined in Data.Vector.Unboxed.Base Methods basicUnsafeFreeze :: Mutable Vector s Float -> ST s (Vector Float) Source # basicUnsafeThaw :: Vector Float -> ST s (Mutable Vector s Float) Source # basicLength :: Vector Float -> Int Source # basicUnsafeSlice :: Int -> Int -> Vector Float -> Vector Float Source # basicUnsafeIndexM :: Vector Float -> Int -> Box Float Source # basicUnsafeCopy :: Mutable Vector s Float -> Vector Float -> ST s () Source # | |||||
| MVector MVector Float | |||||
Defined in Data.Vector.Unboxed.Base Methods basicLength :: MVector s Float -> Int Source # basicUnsafeSlice :: Int -> Int -> MVector s Float -> MVector s Float Source # basicOverlaps :: MVector s Float -> MVector s Float -> Bool Source # basicUnsafeNew :: Int -> ST s (MVector s Float) Source # basicInitialize :: MVector s Float -> ST s () Source # basicUnsafeReplicate :: Int -> Float -> ST s (MVector s Float) Source # basicUnsafeRead :: MVector s Float -> Int -> ST s Float Source # basicUnsafeWrite :: MVector s Float -> Int -> Float -> ST s () Source # basicClear :: MVector s Float -> ST s () Source # basicSet :: MVector s Float -> Float -> ST s () Source # basicUnsafeCopy :: MVector s Float -> MVector s Float -> ST s () Source # basicUnsafeMove :: MVector s Float -> MVector s Float -> ST s () Source # basicUnsafeGrow :: MVector s Float -> Int -> ST s (MVector s Float) Source # | |||||
| Generic1 (URec Float :: k -> Type) | |||||
Defined in GHC.Generics Associated Types
| |||||
| Foldable (UFloat :: Type -> Type) | Since: base-4.9.0.0 | ||||
Defined in Data.Foldable Methods fold :: Monoid m => UFloat m -> m # foldMap :: Monoid m => (a -> m) -> UFloat a -> m # foldMap' :: Monoid m => (a -> m) -> UFloat a -> m # foldr :: (a -> b -> b) -> b -> UFloat a -> b # foldr' :: (a -> b -> b) -> b -> UFloat a -> b # foldl :: (b -> a -> b) -> b -> UFloat a -> b # foldl' :: (b -> a -> b) -> b -> UFloat a -> b # foldr1 :: (a -> a -> a) -> UFloat a -> a # foldl1 :: (a -> a -> a) -> UFloat a -> a # elem :: Eq a => a -> UFloat a -> Bool # maximum :: Ord a => UFloat a -> a # minimum :: Ord a => UFloat a -> a # | |||||
| Traversable (UFloat :: Type -> Type) | Since: base-4.9.0.0 | ||||
| Functor (URec Float :: Type -> Type) | Since: base-4.9.0.0 | ||||
| Generic (URec Float p) | |||||
Defined in GHC.Generics Associated Types
| |||||
| Show (URec Float p) | |||||
| Eq (URec Float p) | |||||
| Ord (URec Float p) | |||||
Defined in GHC.Generics | |||||
| type BaseFormatter Float | |||||
Defined in Data.Bytes.Formatting.Base | |||||
| newtype Vector Float | |||||
| data URec Float (p :: k) | Used for marking occurrences of Since: base-4.9.0.0 | ||||
| newtype MVector s Float | |||||
| type Rep1 (URec Float :: k -> Type) | Since: base-4.9.0.0 | ||||
Defined in GHC.Generics | |||||
| type Rep (URec Float p) | |||||
Defined in GHC.Generics | |||||
A fixed-precision integer type with at least the range [-2^29 .. 2^29-1].
The exact range for a given implementation can be determined by using
minBound and maxBound from the Bounded class.
Instances
| MGroup Int | Since: algebra-simple-0.1 | ||||
| MMonoid Int | Since: algebra-simple-0.1 | ||||
Defined in Numeric.Algebra.Multiplicative.MMonoid | |||||
| MSemigroup Int | Since: algebra-simple-0.1 | ||||
| Normed Int | Since: algebra-simple-0.1 | ||||
| FromInteger Int | Since: algebra-simple-0.1 | ||||
Defined in Numeric.Literal.Integer Methods afromInteger :: Integer -> Int Source # | |||||
| Data Int | Since: base-4.0.0.0 | ||||
Defined in Data.Data Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Int -> c Int # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Int # dataTypeOf :: Int -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Int) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Int) # gmapT :: (forall b. Data b => b -> b) -> Int -> Int # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Int -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Int -> r # gmapQ :: (forall d. Data d => d -> u) -> Int -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Int -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Int -> m Int # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Int -> m Int # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Int -> m Int # | |||||
| Storable Int | Since: base-2.1 | ||||
Defined in Foreign.Storable | |||||
| Bits Int | Since: base-2.1 | ||||
Defined in GHC.Bits | |||||
| FiniteBits Int | Since: base-4.6.0.0 | ||||
Defined in GHC.Bits Methods finiteBitSize :: Int -> Int # countLeadingZeros :: Int -> Int # countTrailingZeros :: Int -> Int # | |||||
| Bounded Int | Since: base-2.1 | ||||
| Enum Int | Since: base-2.1 | ||||
| Ix Int | Since: base-2.1 | ||||
| Num Int | Since: base-2.1 | ||||
| Read Int | Since: base-2.1 | ||||
| Integral Int | Since: base-2.0.1 | ||||
| Real Int | Since: base-2.0.1 | ||||
Defined in GHC.Real Methods toRational :: Int -> Rational # | |||||
| Show Int | Since: base-2.1 | ||||
| PrintfArg Int | Since: base-2.1 | ||||
Defined in Text.Printf | |||||
| NFData Int | |||||
Defined in Control.DeepSeq | |||||
| Eq Int | |||||
| Ord Int | |||||
| Hashable Int | |||||
| Pretty Int |
| ||||
| Uniform Int | |||||
Defined in System.Random.Internal Methods uniformM :: StatefulGen g m => g -> m Int Source # | |||||
| UniformRange Int | |||||
Defined in System.Random.Internal | |||||
| DecodeTOML Int | |||||
Defined in TOML.Decode Methods tomlDecoder :: Decoder Int Source # | |||||
| ByteSource Int | |||||
Defined in Data.UUID.Types.Internal.Builder | |||||
| Unbox Int | |||||
Defined in Data.Vector.Unboxed.Base | |||||
| Lift Int | |||||
| Vector Vector Int | |||||
Defined in Data.Vector.Unboxed.Base Methods basicUnsafeFreeze :: Mutable Vector s Int -> ST s (Vector Int) Source # basicUnsafeThaw :: Vector Int -> ST s (Mutable Vector s Int) Source # basicLength :: Vector Int -> Int Source # basicUnsafeSlice :: Int -> Int -> Vector Int -> Vector Int Source # basicUnsafeIndexM :: Vector Int -> Int -> Box Int Source # basicUnsafeCopy :: Mutable Vector s Int -> Vector Int -> ST s () Source # | |||||
| MVector MVector Int | |||||
Defined in Data.Vector.Unboxed.Base Methods basicLength :: MVector s Int -> Int Source # basicUnsafeSlice :: Int -> Int -> MVector s Int -> MVector s Int Source # basicOverlaps :: MVector s Int -> MVector s Int -> Bool Source # basicUnsafeNew :: Int -> ST s (MVector s Int) Source # basicInitialize :: MVector s Int -> ST s () Source # basicUnsafeReplicate :: Int -> Int -> ST s (MVector s Int) Source # basicUnsafeRead :: MVector s Int -> Int -> ST s Int Source # basicUnsafeWrite :: MVector s Int -> Int -> Int -> ST s () Source # basicClear :: MVector s Int -> ST s () Source # basicSet :: MVector s Int -> Int -> ST s () Source # basicUnsafeCopy :: MVector s Int -> MVector s Int -> ST s () Source # basicUnsafeMove :: MVector s Int -> MVector s Int -> ST s () Source # basicUnsafeGrow :: MVector s Int -> Int -> ST s (MVector s Int) Source # | |||||
| Reifies Z Int | |||||
| Reifies n Int => Reifies (D n :: Type) Int | |||||
| Reifies n Int => Reifies (PD n :: Type) Int | |||||
| Reifies n Int => Reifies (SD n :: Type) Int | |||||
| Each Int (NonEmpty a) (NonEmpty b) a b |
| ||||
Defined in Optics.Each.Core | |||||
| Each Int (IntMap a) (IntMap b) a b |
| ||||
Defined in Optics.Each.Core | |||||
| Each Int (Seq a) (Seq b) a b |
| ||||
Defined in Optics.Each.Core | |||||
| Each Int [a] [b] a b |
| ||||
Defined in Optics.Each.Core Methods each :: IxTraversal Int [a] [b] a b Source # | |||||
| Generic1 (URec Int :: k -> Type) | |||||
Defined in GHC.Generics Associated Types
| |||||
| (a ~ a1, b ~ b1) => Each Int (a, a1) (b, b1) a b |
| ||||
Defined in Optics.Each.Core Methods each :: IxTraversal Int (a, a1) (b, b1) a b Source # | |||||
| (a ~ a1, a ~ a2, b ~ b1, b ~ b2) => Each Int (a, a1, a2) (b, b1, b2) a b |
| ||||
Defined in Optics.Each.Core Methods each :: IxTraversal Int (a, a1, a2) (b, b1, b2) a b Source # | |||||
| (a ~ a1, a ~ a2, a ~ a3, b ~ b1, b ~ b2, b ~ b3) => Each Int (a, a1, a2, a3) (b, b1, b2, b3) a b |
| ||||
Defined in Optics.Each.Core Methods each :: IxTraversal Int (a, a1, a2, a3) (b, b1, b2, b3) a b Source # | |||||
| (a ~ a1, a ~ a2, a ~ a3, a ~ a4, b ~ b1, b ~ b2, b ~ b3, b ~ b4) => Each Int (a, a1, a2, a3, a4) (b, b1, b2, b3, b4) a b |
| ||||
Defined in Optics.Each.Core Methods each :: IxTraversal Int (a, a1, a2, a3, a4) (b, b1, b2, b3, b4) a b Source # | |||||
| (a ~ a1, a ~ a2, a ~ a3, a ~ a4, a ~ a5, b ~ b1, b ~ b2, b ~ b3, b ~ b4, b ~ b5) => Each Int (a, a1, a2, a3, a4, a5) (b, b1, b2, b3, b4, b5) a b |
| ||||
Defined in Optics.Each.Core Methods each :: IxTraversal Int (a, a1, a2, a3, a4, a5) (b, b1, b2, b3, b4, b5) a b Source # | |||||
| (a ~ a1, a ~ a2, a ~ a3, a ~ a4, a ~ a5, a ~ a6, b ~ b1, b ~ b2, b ~ b3, b ~ b4, b ~ b5, b ~ b6) => Each Int (a, a1, a2, a3, a4, a5, a6) (b, b1, b2, b3, b4, b5, b6) a b |
| ||||
Defined in Optics.Each.Core Methods each :: IxTraversal Int (a, a1, a2, a3, a4, a5, a6) (b, b1, b2, b3, b4, b5, b6) a b Source # | |||||
| (a ~ a1, a ~ a2, a ~ a3, a ~ a4, a ~ a5, a ~ a6, a ~ a7, b ~ b1, b ~ b2, b ~ b3, b ~ b4, b ~ b5, b ~ b6, b ~ b7) => Each Int (a, a1, a2, a3, a4, a5, a6, a7) (b, b1, b2, b3, b4, b5, b6, b7) a b |
| ||||
Defined in Optics.Each.Core Methods each :: IxTraversal Int (a, a1, a2, a3, a4, a5, a6, a7) (b, b1, b2, b3, b4, b5, b6, b7) a b Source # | |||||
| (a ~ a1, a ~ a2, a ~ a3, a ~ a4, a ~ a5, a ~ a6, a ~ a7, a ~ a8, b ~ b1, b ~ b2, b ~ b3, b ~ b4, b ~ b5, b ~ b6, b ~ b7, b ~ b8) => Each Int (a, a1, a2, a3, a4, a5, a6, a7, a8) (b, b1, b2, b3, b4, b5, b6, b7, b8) a b |
| ||||
Defined in Optics.Each.Core Methods each :: IxTraversal Int (a, a1, a2, a3, a4, a5, a6, a7, a8) (b, b1, b2, b3, b4, b5, b6, b7, b8) a b Source # | |||||
| (a ~ a1, a ~ a2, a ~ a3, a ~ a4, a ~ a5, a ~ a6, a ~ a7, a ~ a8, a ~ a9, b ~ b1, b ~ b2, b ~ b3, b ~ b4, b ~ b5, b ~ b6, b ~ b7, b ~ b8, b ~ b9) => Each Int (a, a1, a2, a3, a4, a5, a6, a7, a8, a9) (b, b1, b2, b3, b4, b5, b6, b7, b8, b9) a b |
| ||||
Defined in Optics.Each.Core Methods each :: IxTraversal Int (a, a1, a2, a3, a4, a5, a6, a7, a8, a9) (b, b1, b2, b3, b4, b5, b6, b7, b8, b9) a b Source # | |||||
| Foldable (UInt :: Type -> Type) | Since: base-4.9.0.0 | ||||
Defined in Data.Foldable Methods fold :: Monoid m => UInt m -> m # foldMap :: Monoid m => (a -> m) -> UInt a -> m # foldMap' :: Monoid m => (a -> m) -> UInt a -> m # foldr :: (a -> b -> b) -> b -> UInt a -> b # foldr' :: (a -> b -> b) -> b -> UInt a -> b # foldl :: (b -> a -> b) -> b -> UInt a -> b # foldl' :: (b -> a -> b) -> b -> UInt a -> b # foldr1 :: (a -> a -> a) -> UInt a -> a # foldl1 :: (a -> a -> a) -> UInt a -> a # elem :: Eq a => a -> UInt a -> Bool # maximum :: Ord a => UInt a -> a # | |||||
| Traversable (UInt :: Type -> Type) | Since: base-4.9.0.0 | ||||
| Each [Int] (Tree a) (Tree b) a b |
| ||||
Defined in Optics.Each.Core | |||||
| Functor (URec Int :: Type -> Type) | Since: base-4.9.0.0 | ||||
| Generic (URec Int p) | |||||
Defined in GHC.Generics Associated Types
| |||||
| Show (URec Int p) | Since: base-4.9.0.0 | ||||
| Eq (URec Int p) | Since: base-4.9.0.0 | ||||
| Ord (URec Int p) | Since: base-4.9.0.0 | ||||
| type BaseFormatter Int | |||||
Defined in Data.Bytes.Formatting.Base | |||||
| newtype Vector Int | |||||
| data URec Int (p :: k) | Used for marking occurrences of Since: base-4.9.0.0 | ||||
| type ByteSink Int g | |||||
Defined in Data.UUID.Types.Internal.Builder type ByteSink Int g = Takes4Bytes g | |||||
| newtype MVector s Int | |||||
| type Rep1 (URec Int :: k -> Type) | Since: base-4.9.0.0 | ||||
Defined in GHC.Generics | |||||
| type Rep (URec Int p) | Since: base-4.9.0.0 | ||||
Defined in GHC.Generics | |||||
Instances
| Data Ordering | Since: base-4.0.0.0 |
Defined in Data.Data Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Ordering -> c Ordering # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Ordering # toConstr :: Ordering -> Constr # dataTypeOf :: Ordering -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Ordering) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Ordering) # gmapT :: (forall b. Data b => b -> b) -> Ordering -> Ordering # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Ordering -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Ordering -> r # gmapQ :: (forall d. Data d => d -> u) -> Ordering -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Ordering -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Ordering -> m Ordering # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Ordering -> m Ordering # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Ordering -> m Ordering # | |
| Monoid Ordering | Since: base-2.1 |
| Semigroup Ordering | Since: base-4.9.0.0 |
| Bounded Ordering | Since: base-2.1 |
| Enum Ordering | Since: base-2.1 |
| Generic Ordering | |
Defined in GHC.Generics | |
| Ix Ordering | Since: base-2.1 |
Defined in GHC.Ix 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 # | |
| Read Ordering | Since: base-2.1 |
| Show Ordering | Since: base-2.1 |
| NFData Ordering | |
Defined in Control.DeepSeq | |
| Eq Ordering | |
| Ord Ordering | |
Defined in GHC.Classes | |
| Hashable Ordering | |
| AsEmpty Ordering | |
| DecodeTOML Ordering | |
Defined in TOML.Decode Methods | |
| type Rep Ordering | Since: base-4.6.0.0 |
The Maybe type encapsulates an optional value. A value of type
Maybe aa (represented as Just aNothing). Using Maybe is a good way to
deal with errors or exceptional cases without resorting to drastic
measures such as error.
The Maybe type is also a monad. It is a simple kind of error
monad, where all errors are represented by Nothing. A richer
error monad can be built using the Either type.
Instances
| MonadFail Maybe | Since: base-4.9.0.0 | ||||
Defined in Control.Monad.Fail | |||||
| MonadFix Maybe | Since: base-2.1 | ||||
Defined in Control.Monad.Fix | |||||
| MonadZip Maybe | Since: base-4.8.0.0 | ||||
| Foldable Maybe | Since: base-2.1 | ||||
Defined in Data.Foldable Methods fold :: Monoid m => Maybe m -> m # foldMap :: Monoid m => (a -> m) -> Maybe a -> m # foldMap' :: Monoid m => (a -> m) -> Maybe a -> m # foldr :: (a -> b -> b) -> b -> Maybe a -> b # foldr' :: (a -> b -> b) -> b -> Maybe a -> b # foldl :: (b -> a -> b) -> b -> Maybe a -> b # foldl' :: (b -> a -> b) -> b -> Maybe a -> b # foldr1 :: (a -> a -> a) -> Maybe a -> a # foldl1 :: (a -> a -> a) -> Maybe a -> a # elem :: Eq a => a -> Maybe a -> Bool # maximum :: Ord a => Maybe a -> a # minimum :: Ord a => Maybe a -> a # | |||||
| Eq1 Maybe | Since: base-4.9.0.0 | ||||
| Ord1 Maybe | Since: base-4.9.0.0 | ||||
Defined in Data.Functor.Classes | |||||
| Read1 Maybe | Since: base-4.9.0.0 | ||||
Defined in Data.Functor.Classes | |||||
| Show1 Maybe | Since: base-4.9.0.0 | ||||
| Traversable Maybe | Since: base-2.1 | ||||
| Alternative Maybe | Picks the leftmost Since: base-2.1 | ||||
| Applicative Maybe | Since: base-2.1 | ||||
| Functor Maybe | Since: base-2.1 | ||||
| Monad Maybe | Since: base-2.1 | ||||
| MonadPlus Maybe | Picks the leftmost Since: base-2.1 | ||||
| NFData1 Maybe | Since: deepseq-1.4.3.0 | ||||
Defined in Control.DeepSeq | |||||
| MonadThrow Maybe | |||||
Defined in Control.Monad.Catch Methods throwM :: (HasCallStack, Exception e) => e -> Maybe a # | |||||
| Hashable1 Maybe | |||||
Defined in Data.Hashable.Class | |||||
| Generic1 Maybe | |||||
Defined in GHC.Generics | |||||
| MonadError () Maybe | Since: mtl-2.2.2 | ||||
Defined in Control.Monad.Error.Class | |||||
| Lift a => Lift (Maybe a :: Type) | |||||
| Each () (Maybe a) (Maybe b) a b |
| ||||
Defined in Optics.Each.Core | |||||
| Data a => Data (Maybe a) | Since: base-4.0.0.0 | ||||
Defined in Data.Data Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Maybe a -> c (Maybe a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Maybe a) # toConstr :: Maybe a -> Constr # dataTypeOf :: Maybe a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Maybe a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Maybe a)) # gmapT :: (forall b. Data b => b -> b) -> Maybe a -> Maybe a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Maybe a -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Maybe a -> r # gmapQ :: (forall d. Data d => d -> u) -> Maybe a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Maybe a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Maybe a -> m (Maybe a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Maybe a -> m (Maybe a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Maybe a -> m (Maybe a) # | |||||
| Semigroup a => Monoid (Maybe a) | Lift a semigroup into Since 4.11.0: constraint on inner Since: base-2.1 | ||||
| Semigroup a => Semigroup (Maybe a) | Since: base-4.9.0.0 | ||||
| Generic (Maybe a) | |||||
Defined in GHC.Generics Associated Types
| |||||
| SingKind a => SingKind (Maybe a) | Since: base-4.9.0.0 | ||||
Defined in GHC.Generics Associated Types
| |||||
| Read a => Read (Maybe a) | Since: base-2.1 | ||||
| Show a => Show (Maybe a) | Since: base-2.1 | ||||
| NFData a => NFData (Maybe a) | |||||
Defined in Control.DeepSeq | |||||
| Eq a => Eq (Maybe a) | Since: base-2.1 | ||||
| Ord a => Ord (Maybe a) | Since: base-2.1 | ||||
| Hashable a => Hashable (Maybe a) | |||||
| At (Maybe a) | |||||
| Ixed (Maybe a) | |||||
Defined in Control.Lens.At | |||||
| MonoFoldable (Maybe a) | |||||
Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element (Maybe a) -> m) -> Maybe a -> m Source # ofoldr :: (Element (Maybe a) -> b -> b) -> b -> Maybe a -> b Source # ofoldl' :: (a0 -> Element (Maybe a) -> a0) -> a0 -> Maybe a -> a0 Source # otoList :: Maybe a -> [Element (Maybe a)] Source # oall :: (Element (Maybe a) -> Bool) -> Maybe a -> Bool Source # oany :: (Element (Maybe a) -> Bool) -> Maybe a -> Bool Source # onull :: Maybe a -> Bool Source # olength :: Maybe a -> Int Source # olength64 :: Maybe a -> Int64 Source # ocompareLength :: Integral i => Maybe a -> i -> Ordering Source # otraverse_ :: Applicative f => (Element (Maybe a) -> f b) -> Maybe a -> f () Source # ofor_ :: Applicative f => Maybe a -> (Element (Maybe a) -> f b) -> f () Source # omapM_ :: Applicative m => (Element (Maybe a) -> m ()) -> Maybe a -> m () Source # oforM_ :: Applicative m => Maybe a -> (Element (Maybe a) -> m ()) -> m () Source # ofoldlM :: Monad m => (a0 -> Element (Maybe a) -> m a0) -> a0 -> Maybe a -> m a0 Source # ofoldMap1Ex :: Semigroup m => (Element (Maybe a) -> m) -> Maybe a -> m Source # ofoldr1Ex :: (Element (Maybe a) -> Element (Maybe a) -> Element (Maybe a)) -> Maybe a -> Element (Maybe a) Source # ofoldl1Ex' :: (Element (Maybe a) -> Element (Maybe a) -> Element (Maybe a)) -> Maybe a -> Element (Maybe a) Source # headEx :: Maybe a -> Element (Maybe a) Source # lastEx :: Maybe a -> Element (Maybe a) Source # unsafeHead :: Maybe a -> Element (Maybe a) Source # unsafeLast :: Maybe a -> Element (Maybe a) Source # maximumByEx :: (Element (Maybe a) -> Element (Maybe a) -> Ordering) -> Maybe a -> Element (Maybe a) Source # minimumByEx :: (Element (Maybe a) -> Element (Maybe a) -> Ordering) -> Maybe a -> Element (Maybe a) Source # | |||||
| MonoFunctor (Maybe a) | |||||
| MonoPointed (Maybe a) | |||||
| MonoTraversable (Maybe a) | |||||
| At (Maybe a) | |||||
| Ixed (Maybe a) | |||||
| AsEmpty (Maybe a) | |||||
| Pretty a => Pretty (Maybe a) | Ignore
| ||||
| Default (Maybe a) Source # | |||||
Defined in Shrun.Configuration.Default | |||||
| DecodeTOML a => DecodeTOML (Maybe a) | Since TOML doesn't support literal NULLs, this will only ever return | ||||
Defined in TOML.Decode Methods tomlDecoder :: Decoder (Maybe a) Source # | |||||
| SingI ('Nothing :: Maybe a) | Since: base-4.9.0.0 | ||||
Defined in GHC.Generics | |||||
| SingI a2 => SingI ('Just a2 :: Maybe a1) | Since: base-4.9.0.0 | ||||
Defined in GHC.Generics | |||||
| type Rep1 Maybe | Since: base-4.6.0.0 | ||||
| type DemoteRep (Maybe a) | |||||
Defined in GHC.Generics | |||||
| type Rep (Maybe a) | Since: base-4.6.0.0 | ||||
Defined in GHC.Generics | |||||
| data Sing (b :: Maybe a) | |||||
| type Index (Maybe a) | |||||
Defined in Control.Lens.At | |||||
| type IxValue (Maybe a) | |||||
Defined in Control.Lens.At | |||||
| type Element (Maybe a) | |||||
Defined in Data.MonoTraversable | |||||
| type Index (Maybe a) | |||||
Defined in Optics.At.Core | |||||
| type IxKind (Maybe a) | |||||
Defined in Optics.At.Core | |||||
| type IxValue (Maybe a) | |||||
Defined in Optics.At.Core | |||||
class a ~# b => (a :: k) ~ (b :: k) infix 4 #
Lifted, homogeneous equality. By lifted, we mean that it
can be bogus (deferred type error). By homogeneous, the two
types a and b must have the same kinds.
Natural number
Invariant: numbers <= 0xffffffffffffffff use the NS constructor
Instances
| MGroup Natural | Since: algebra-simple-0.1 |
| MMonoid Natural | Since: algebra-simple-0.1 |
Defined in Numeric.Algebra.Multiplicative.MMonoid | |
| MSemigroup Natural | Since: algebra-simple-0.1 |
| Normed Natural | Since: algebra-simple-0.1 |
| FromInteger Natural | WARNING: Partial Since: algebra-simple-0.1 |
Defined in Numeric.Literal.Integer Methods afromInteger :: Integer -> Natural Source # | |
| Data Natural | Since: base-4.8.0.0 |
Defined in Data.Data Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Natural -> c Natural # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Natural # toConstr :: Natural -> Constr # dataTypeOf :: Natural -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Natural) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Natural) # gmapT :: (forall b. Data b => b -> b) -> Natural -> Natural # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Natural -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Natural -> r # gmapQ :: (forall d. Data d => d -> u) -> Natural -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Natural -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Natural -> m Natural # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Natural -> m Natural # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Natural -> m Natural # | |
| Bits Natural | Since: base-4.8.0 |
Defined in GHC.Bits Methods (.&.) :: Natural -> Natural -> Natural # (.|.) :: Natural -> Natural -> Natural # xor :: Natural -> Natural -> Natural # complement :: Natural -> Natural # shift :: Natural -> Int -> Natural # rotate :: Natural -> Int -> Natural # setBit :: Natural -> Int -> Natural # clearBit :: Natural -> Int -> Natural # complementBit :: Natural -> Int -> Natural # testBit :: Natural -> Int -> Bool # bitSizeMaybe :: Natural -> Maybe Int # shiftL :: Natural -> Int -> Natural # unsafeShiftL :: Natural -> Int -> Natural # shiftR :: Natural -> Int -> Natural # unsafeShiftR :: Natural -> Int -> Natural # rotateL :: Natural -> Int -> Natural # | |
| Enum Natural | Since: base-4.8.0.0 |
| Ix Natural | Since: base-4.8.0.0 |
Defined in GHC.Ix | |
| Num Natural | Note that Since: base-4.8.0.0 |
| Read Natural | Since: base-4.8.0.0 |
| Integral Natural | Since: base-4.8.0.0 |
Defined in GHC.Real | |
| Real Natural | Since: base-4.8.0.0 |
Defined in GHC.Real Methods toRational :: Natural -> Rational # | |
| Show Natural | Since: base-4.8.0.0 |
| PrintfArg Natural | Since: base-4.8.0.0 |
Defined in Text.Printf | |
| NFData Natural | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| Eq Natural | |
| Ord Natural | |
| Hashable Natural | |
| Pretty Natural | |
| UniformRange Natural | |
Defined in System.Random.Internal | |
| DecodeTOML Natural | |
Defined in TOML.Decode Methods | |
| MSemiSpace TimeSpec Natural | Since: effects-time-0.1 |
| MSemiSpace RelativeTime Natural | Since: relative-time-0.1 |
Defined in Data.Time.Relative Methods (.*) :: RelativeTime -> Natural -> RelativeTime Source # | |
| MSpace TimeSpec Natural | Since: effects-time-0.1 |
| MSpace RelativeTime Natural | Since: relative-time-0.1 |
Defined in Data.Time.Relative Methods (.%) :: RelativeTime -> Natural -> RelativeTime Source # | |
| Semimodule TimeSpec Natural | Since: effects-time-0.1 |
Defined in Effects.Time | |
| Semimodule RelativeTime Natural | Since: relative-time-0.1 |
Defined in Data.Time.Relative | |
| SemivectorSpace TimeSpec Natural | Since: effects-time-0.1 |
Defined in Effects.Time | |
| SemivectorSpace RelativeTime Natural | Since: relative-time-0.1 |
Defined in Data.Time.Relative | |
| KnownNat n => HasResolution (n :: Nat) | For example, |
Defined in Data.Fixed Methods resolution :: p n -> Integer # | |
| TestCoercion SNat | Since: base-4.18.0.0 |
Defined in GHC.TypeNats | |
| TestEquality SNat | Since: base-4.18.0.0 |
Defined in GHC.TypeNats | |
| Lift Natural | |
| KnownNat n => Reifies (n :: Nat) Integer | |
Defined in Data.Reflection | |
| MGroup (Ratio Natural) | Since: algebra-simple-0.1 |
| MMonoid (Ratio Natural) | Since: algebra-simple-0.1 |
| MSemigroup (Ratio Natural) | Since: algebra-simple-0.1 |
| Normed (Ratio Natural) | Since: algebra-simple-0.1 |
| FromInteger (Ratio Natural) | WARNING: Partial Since: algebra-simple-0.1 |
Defined in Numeric.Literal.Integer | |
| (path ~ GPositionPath con epath, When (IsLeft epath) (HideReps g h), GFieldProd path g h a b) => GPositionSum ('PathLeaf epath) (M1 C ('MetaCons con fix hs) g) (M1 C ('MetaCons con fix hs) h) a b | |
| (GPositionSum path1 g1 h1 a b, GPositionSum path2 g2 h2 a b) => GPositionSum ('PathTree path1 path2) (g1 :+: g2) (h1 :+: h2) a b | |
Defined in Optics.Internal.Generic | |
| type BaseFormatter Natural | |
Defined in Data.Bytes.Formatting.Base | |
| type Compare (a :: Natural) (b :: Natural) | |
Defined in Data.Type.Ord | |
Arbitrary precision integers. In contrast with fixed-size integral types
such as Int, the Integer type represents the entire infinite range of
integers.
Integers are stored in a kind of sign-magnitude form, hence do not expect two's complement form when using bit operations.
If the value is small (fit into an Int), IS constructor is used.
Otherwise IP and IN constructors are used to store a BigNat
representing respectively the positive or the negative value magnitude.
Instances
| MGroup Integer | Since: algebra-simple-0.1 |
| MMonoid Integer | Since: algebra-simple-0.1 |
Defined in Numeric.Algebra.Multiplicative.MMonoid | |
| MSemigroup Integer | Since: algebra-simple-0.1 |
| Normed Integer | Since: algebra-simple-0.1 |
| FromInteger Integer | Since: algebra-simple-0.1 |
Defined in Numeric.Literal.Integer Methods afromInteger :: Integer -> Integer Source # | |
| Data Integer | Since: base-4.0.0.0 |
Defined in Data.Data Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Integer -> c Integer # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Integer # toConstr :: Integer -> Constr # dataTypeOf :: Integer -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Integer) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Integer) # gmapT :: (forall b. Data b => b -> b) -> Integer -> Integer # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Integer -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Integer -> r # gmapQ :: (forall d. Data d => d -> u) -> Integer -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Integer -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Integer -> m Integer # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Integer -> m Integer # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Integer -> m Integer # | |
| Bits Integer | Since: base-2.1 |
Defined in GHC.Bits Methods (.&.) :: Integer -> Integer -> Integer # (.|.) :: Integer -> Integer -> Integer # xor :: Integer -> Integer -> Integer # complement :: Integer -> Integer # shift :: Integer -> Int -> Integer # rotate :: Integer -> Int -> Integer # setBit :: Integer -> Int -> Integer # clearBit :: Integer -> Int -> Integer # complementBit :: Integer -> Int -> Integer # testBit :: Integer -> Int -> Bool # bitSizeMaybe :: Integer -> Maybe Int # shiftL :: Integer -> Int -> Integer # unsafeShiftL :: Integer -> Int -> Integer # shiftR :: Integer -> Int -> Integer # unsafeShiftR :: Integer -> Int -> Integer # rotateL :: Integer -> Int -> Integer # | |
| Enum Integer | Since: base-2.1 |
| Ix Integer | Since: base-2.1 |
Defined in GHC.Ix | |
| Num Integer | Since: base-2.1 |
| Read Integer | Since: base-2.1 |
| Integral Integer | Since: base-2.0.1 |
Defined in GHC.Real | |
| Real Integer | Since: base-2.0.1 |
Defined in GHC.Real Methods toRational :: Integer -> Rational # | |
| Show Integer | Since: base-2.1 |
| PrintfArg Integer | Since: base-2.1 |
Defined in Text.Printf | |
| NFData Integer | |
Defined in Control.DeepSeq | |
| Eq Integer | |
| Ord Integer | |
| Hashable Integer | |
| Pretty Integer |
|
| UniformRange Integer | |
Defined in System.Random.Internal | |
| DecodeTOML Integer | |
Defined in TOML.Decode Methods | |
| Lift Integer | |
| KnownNat n => Reifies (n :: Nat) Integer | |
Defined in Data.Reflection | |
| MGroup (Ratio Integer) | Since: algebra-simple-0.1 |
| MMonoid (Ratio Integer) | Since: algebra-simple-0.1 |
| MSemigroup (Ratio Integer) | Since: algebra-simple-0.1 |
| Normed (Ratio Integer) | Since: algebra-simple-0.1 |
| FromInteger (Ratio Integer) | Since: algebra-simple-0.1 |
Defined in Numeric.Literal.Integer | |
| type BaseFormatter Integer | |
Defined in Data.Bytes.Formatting.Base | |
Uninhabited data type
Since: base-4.8.0.0
Instances
| Data Void | Since: base-4.8.0.0 |
Defined in Data.Data Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Void -> c Void # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Void # dataTypeOf :: Void -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Void) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Void) # gmapT :: (forall b. Data b => b -> b) -> Void -> Void # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Void -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Void -> r # gmapQ :: (forall d. Data d => d -> u) -> Void -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Void -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Void -> m Void # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Void -> m Void # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Void -> m Void # | |
| Semigroup Void | Since: base-4.9.0.0 |
| Exception Void | Since: base-4.8.0.0 |
Defined in GHC.Exception.Type Methods toException :: Void -> SomeException # fromException :: SomeException -> Maybe Void # displayException :: Void -> String # | |
| Generic Void | |
| Ix Void | Since: base-4.8.0.0 |
| Read Void | Reading a Since: base-4.8.0.0 |
| Show Void | Since: base-4.8.0.0 |
| NFData Void | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| Eq Void | Since: base-4.8.0.0 |
| Ord Void | Since: base-4.8.0.0 |
| Hashable Void | |
| ShowErrorComponent Void | |
Defined in Text.Megaparsec.Error | |
| Pretty Void | Finding a good example for printing something that does not exist is hard, so here is an example of printing a list full of nothing.
|
| DecodeTOML Void | |
Defined in TOML.Decode Methods | |
| Lift Void | Since: template-haskell-2.15.0.0 |
| type Rep Void | Since: base-4.8.0.0 |
Defines the exit codes that a program can return.
Constructors
| ExitSuccess | indicates successful termination; |
| ExitFailure Int | indicates program failure with an exit code. The exact interpretation of the code is operating-system dependent. In particular, some values may be prohibited (e.g. 0 on a POSIX-compliant system). |
Instances
| Exception ExitCode | Since: base-4.1.0.0 | ||||
Defined in GHC.IO.Exception Methods toException :: ExitCode -> SomeException # fromException :: SomeException -> Maybe ExitCode # displayException :: ExitCode -> String # | |||||
| Generic ExitCode | |||||
Defined in GHC.IO.Exception Associated Types
| |||||
| Read ExitCode | |||||
| Show ExitCode | |||||
| NFData ExitCode | Since: deepseq-1.4.2.0 | ||||
Defined in Control.DeepSeq | |||||
| Eq ExitCode | |||||
| Ord ExitCode | |||||
Defined in GHC.IO.Exception | |||||
| type Rep ExitCode | |||||
Defined in GHC.IO.Exception type Rep ExitCode = D1 ('MetaData "ExitCode" "GHC.IO.Exception" "base" 'False) (C1 ('MetaCons "ExitSuccess" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "ExitFailure" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Int))) | |||||
class Foldable (t :: Type -> Type) where #
The Foldable class represents data structures that can be reduced to a summary value one element at a time. Strict left-associative folds are a good fit for space-efficient reduction, while lazy right-associative folds are a good fit for corecursive iteration, or for folds that short-circuit after processing an initial subsequence of the structure's elements.
Instances can be derived automatically by enabling the DeriveFoldable
extension. For example, a derived instance for a binary tree might be:
{-# LANGUAGE DeriveFoldable #-}
data Tree a = Empty
| Leaf a
| Node (Tree a) a (Tree a)
deriving FoldableA more detailed description can be found in the Overview section of Data.Foldable.
For the class laws see the Laws section of Data.Foldable.
Methods
fold :: Monoid m => t m -> m #
Given a structure with elements whose type is a Monoid, combine them
via the monoid's ( operator. This fold is right-associative and
lazy in the accumulator. When you need a strict left-associative fold,
use <>)foldMap' instead, with id as the map.
Examples
Basic usage:
>>>fold [[1, 2, 3], [4, 5], [6], []][1,2,3,4,5,6]
>>>fold $ Node (Leaf (Sum 1)) (Sum 3) (Leaf (Sum 5))Sum {getSum = 9}
Folds of unbounded structures do not terminate when the monoid's
( operator is strict:<>)
>>>fold (repeat Nothing)* Hangs forever *
Lazy corecursive folds of unbounded structures are fine:
>>>take 12 $ fold $ map (\i -> [i..i+2]) [0..][0,1,2,1,2,3,2,3,4,3,4,5]>>>sum $ take 4000000 $ fold $ map (\i -> [i..i+2]) [0..]2666668666666
foldr :: (a -> b -> b) -> b -> t a -> b #
Right-associative fold of a structure, lazy in the accumulator.
In the case of lists, foldr, when applied to a binary operator, a
starting value (typically the right-identity of the operator), and a
list, reduces the list using the binary operator, from right to left:
foldr f z [x1, x2, ..., xn] == x1 `f` (x2 `f` ... (xn `f` z)...)
Note that since the head of the resulting expression is produced by an
application of the operator to the first element of the list, given an
operator lazy in its right argument, foldr can produce a terminating
expression from an unbounded list.
For a general Foldable structure this should be semantically identical
to,
foldr f z =foldrf z .toList
Examples
Basic usage:
>>>foldr (||) False [False, True, False]True
>>>foldr (||) False []False
>>>foldr (\c acc -> acc ++ [c]) "foo" ['a', 'b', 'c', 'd']"foodcba"
Infinite structures
⚠️ Applying foldr to infinite structures usually doesn't terminate.
It may still terminate under one of the following conditions:
- the folding function is short-circuiting
- the folding function is lazy on its second argument
Short-circuiting
( short-circuits on ||)True values, so the following terminates
because there is a True value finitely far from the left side:
>>>foldr (||) False (True : repeat False)True
But the following doesn't terminate:
>>>foldr (||) False (repeat False ++ [True])* Hangs forever *
Laziness in the second argument
Applying foldr to infinite structures terminates when the operator is
lazy in its second argument (the initial accumulator is never used in
this case, and so could be left undefined, but [] is more clear):
>>>take 5 $ foldr (\i acc -> i : fmap (+3) acc) [] (repeat 1)[1,4,7,10,13]
foldl' :: (b -> a -> b) -> b -> t a -> b #
Left-associative fold of a structure but with strict application of the operator.
This ensures that each step of the fold is forced to Weak Head Normal
Form before being applied, avoiding the collection of thunks that would
otherwise occur. This is often what you want to strictly reduce a
finite structure to a single strict result (e.g. sum).
For a general Foldable structure this should be semantically identical
to,
foldl' f z =foldl'f z .toList
Since: base-4.6.0.0
List of elements of a structure, from left to right. If the entire list is intended to be reduced via a fold, just fold the structure directly bypassing the list.
Examples
Basic usage:
>>>toList Nothing[]
>>>toList (Just 42)[42]
>>>toList (Left "foo")[]
>>>toList (Node (Leaf 5) 17 (Node Empty 12 (Leaf 8)))[5,17,12,8]
For lists, toList is the identity:
>>>toList [1, 2, 3][1,2,3]
Since: base-4.8.0.0
Returns the size/length of a finite structure as an Int. The
default implementation just counts elements starting with the leftmost.
Instances for structures that can compute the element count faster
than via element-by-element counting, should provide a specialised
implementation.
Examples
Basic usage:
>>>length []0
>>>length ['a', 'b', 'c']3>>>length [1..]* Hangs forever *
Since: base-4.8.0.0
Instances
| Foldable KeyMap | |
Defined in Data.Aeson.KeyMap Methods fold :: Monoid m => KeyMap m -> m # foldMap :: Monoid m => (a -> m) -> KeyMap a -> m # foldMap' :: Monoid m => (a -> m) -> KeyMap a -> m # foldr :: (a -> b -> b) -> b -> KeyMap a -> b # foldr' :: (a -> b -> b) -> b -> KeyMap a -> b # foldl :: (b -> a -> b) -> b -> KeyMap a -> b # foldl' :: (b -> a -> b) -> b -> KeyMap a -> b # foldr1 :: (a -> a -> a) -> KeyMap a -> a # foldl1 :: (a -> a -> a) -> KeyMap a -> a # elem :: Eq a => a -> KeyMap a -> Bool # maximum :: Ord a => KeyMap a -> a # minimum :: Ord a => KeyMap a -> a # | |
| Foldable IResult | |
Defined in Data.Aeson.Types.Internal Methods fold :: Monoid m => IResult m -> m # foldMap :: Monoid m => (a -> m) -> IResult a -> m # foldMap' :: Monoid m => (a -> m) -> IResult a -> m # foldr :: (a -> b -> b) -> b -> IResult a -> b # foldr' :: (a -> b -> b) -> b -> IResult a -> b # foldl :: (b -> a -> b) -> b -> IResult a -> b # foldl' :: (b -> a -> b) -> b -> IResult a -> b # foldr1 :: (a -> a -> a) -> IResult a -> a # foldl1 :: (a -> a -> a) -> IResult a -> a # elem :: Eq a => a -> IResult a -> Bool # maximum :: Ord a => IResult a -> a # minimum :: Ord a => IResult a -> a # | |
| Foldable Result | |
Defined in Data.Aeson.Types.Internal Methods fold :: Monoid m => Result m -> m # foldMap :: Monoid m => (a -> m) -> Result a -> m # foldMap' :: Monoid m => (a -> m) -> Result a -> m # foldr :: (a -> b -> b) -> b -> Result a -> b # foldr' :: (a -> b -> b) -> b -> Result a -> b # foldl :: (b -> a -> b) -> b -> Result a -> b # foldl' :: (b -> a -> b) -> b -> Result a -> b # foldr1 :: (a -> a -> a) -> Result a -> a # foldl1 :: (a -> a -> a) -> Result a -> a # elem :: Eq a => a -> Result a -> Bool # maximum :: Ord a => Result a -> a # minimum :: Ord a => Result a -> a # | |
| Foldable ZipList | Since: base-4.9.0.0 |
Defined in Control.Applicative Methods fold :: Monoid m => ZipList m -> m # foldMap :: Monoid m => (a -> m) -> ZipList a -> m # foldMap' :: Monoid m => (a -> m) -> ZipList a -> m # foldr :: (a -> b -> b) -> b -> ZipList a -> b # foldr' :: (a -> b -> b) -> b -> ZipList a -> b # foldl :: (b -> a -> b) -> b -> ZipList a -> b # foldl' :: (b -> a -> b) -> b -> ZipList a -> b # foldr1 :: (a -> a -> a) -> ZipList a -> a # foldl1 :: (a -> a -> a) -> ZipList a -> a # elem :: Eq a => a -> ZipList a -> Bool # maximum :: Ord a => ZipList a -> a # minimum :: Ord a => ZipList a -> a # | |
| Foldable Complex | Since: base-4.9.0.0 |
Defined in Data.Complex Methods fold :: Monoid m => Complex m -> m # foldMap :: Monoid m => (a -> m) -> Complex a -> m # foldMap' :: Monoid m => (a -> m) -> Complex a -> m # foldr :: (a -> b -> b) -> b -> Complex a -> b # foldr' :: (a -> b -> b) -> b -> Complex a -> b # foldl :: (b -> a -> b) -> b -> Complex a -> b # foldl' :: (b -> a -> b) -> b -> Complex a -> b # foldr1 :: (a -> a -> a) -> Complex a -> a # foldl1 :: (a -> a -> a) -> Complex a -> a # elem :: Eq a => a -> Complex a -> Bool # maximum :: Ord a => Complex a -> a # minimum :: Ord a => Complex a -> a # | |
| Foldable Identity | Since: base-4.8.0.0 |
Defined in Data.Functor.Identity Methods fold :: Monoid m => Identity m -> m # foldMap :: Monoid m => (a -> m) -> Identity a -> m # foldMap' :: Monoid m => (a -> m) -> Identity a -> m # foldr :: (a -> b -> b) -> b -> Identity a -> b # foldr' :: (a -> b -> b) -> b -> Identity a -> b # foldl :: (b -> a -> b) -> b -> Identity a -> b # foldl' :: (b -> a -> b) -> b -> Identity a -> b # foldr1 :: (a -> a -> a) -> Identity a -> a # foldl1 :: (a -> a -> a) -> Identity a -> a # elem :: Eq a => a -> Identity a -> Bool # maximum :: Ord a => Identity a -> a # minimum :: Ord a => Identity a -> a # | |
| Foldable First | Since: base-4.8.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => First m -> m # foldMap :: Monoid m => (a -> m) -> First a -> m # foldMap' :: Monoid m => (a -> m) -> First a -> m # foldr :: (a -> b -> b) -> b -> First a -> b # foldr' :: (a -> b -> b) -> b -> First a -> b # foldl :: (b -> a -> b) -> b -> First a -> b # foldl' :: (b -> a -> b) -> b -> First a -> b # foldr1 :: (a -> a -> a) -> First a -> a # foldl1 :: (a -> a -> a) -> First a -> a # elem :: Eq a => a -> First a -> Bool # maximum :: Ord a => First a -> a # minimum :: Ord a => First a -> a # | |
| Foldable Last | Since: base-4.8.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => Last m -> m # foldMap :: Monoid m => (a -> m) -> Last a -> m # foldMap' :: Monoid m => (a -> m) -> Last a -> m # foldr :: (a -> b -> b) -> b -> Last a -> b # foldr' :: (a -> b -> b) -> b -> Last a -> b # foldl :: (b -> a -> b) -> b -> Last a -> b # foldl' :: (b -> a -> b) -> b -> Last a -> b # foldr1 :: (a -> a -> a) -> Last a -> a # foldl1 :: (a -> a -> a) -> Last a -> a # elem :: Eq a => a -> Last a -> Bool # maximum :: Ord a => Last a -> a # | |
| Foldable Down | Since: base-4.12.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => Down m -> m # foldMap :: Monoid m => (a -> m) -> Down a -> m # foldMap' :: Monoid m => (a -> m) -> Down a -> m # foldr :: (a -> b -> b) -> b -> Down a -> b # foldr' :: (a -> b -> b) -> b -> Down a -> b # foldl :: (b -> a -> b) -> b -> Down a -> b # foldl' :: (b -> a -> b) -> b -> Down a -> b # foldr1 :: (a -> a -> a) -> Down a -> a # foldl1 :: (a -> a -> a) -> Down a -> a # elem :: Eq a => a -> Down a -> Bool # maximum :: Ord a => Down a -> a # | |
| Foldable First | Since: base-4.9.0.0 |
Defined in Data.Semigroup Methods fold :: Monoid m => First m -> m # foldMap :: Monoid m => (a -> m) -> First a -> m # foldMap' :: Monoid m => (a -> m) -> First a -> m # foldr :: (a -> b -> b) -> b -> First a -> b # foldr' :: (a -> b -> b) -> b -> First a -> b # foldl :: (b -> a -> b) -> b -> First a -> b # foldl' :: (b -> a -> b) -> b -> First a -> b # foldr1 :: (a -> a -> a) -> First a -> a # foldl1 :: (a -> a -> a) -> First a -> a # elem :: Eq a => a -> First a -> Bool # maximum :: Ord a => First a -> a # minimum :: Ord a => First a -> a # | |
| Foldable Last | Since: base-4.9.0.0 |
Defined in Data.Semigroup Methods fold :: Monoid m => Last m -> m # foldMap :: Monoid m => (a -> m) -> Last a -> m # foldMap' :: Monoid m => (a -> m) -> Last a -> m # foldr :: (a -> b -> b) -> b -> Last a -> b # foldr' :: (a -> b -> b) -> b -> Last a -> b # foldl :: (b -> a -> b) -> b -> Last a -> b # foldl' :: (b -> a -> b) -> b -> Last a -> b # foldr1 :: (a -> a -> a) -> Last a -> a # foldl1 :: (a -> a -> a) -> Last a -> a # elem :: Eq a => a -> Last a -> Bool # maximum :: Ord a => Last a -> a # | |
| Foldable Max | Since: base-4.9.0.0 |
Defined in Data.Semigroup Methods fold :: Monoid m => Max m -> m # foldMap :: Monoid m => (a -> m) -> Max a -> m # foldMap' :: Monoid m => (a -> m) -> Max a -> m # foldr :: (a -> b -> b) -> b -> Max a -> b # foldr' :: (a -> b -> b) -> b -> Max a -> b # foldl :: (b -> a -> b) -> b -> Max a -> b # foldl' :: (b -> a -> b) -> b -> Max a -> b # foldr1 :: (a -> a -> a) -> Max a -> a # foldl1 :: (a -> a -> a) -> Max a -> a # elem :: Eq a => a -> Max a -> Bool # maximum :: Ord a => Max a -> a # | |
| Foldable Min | Since: base-4.9.0.0 |
Defined in Data.Semigroup Methods fold :: Monoid m => Min m -> m # foldMap :: Monoid m => (a -> m) -> Min a -> m # foldMap' :: Monoid m => (a -> m) -> Min a -> m # foldr :: (a -> b -> b) -> b -> Min a -> b # foldr' :: (a -> b -> b) -> b -> Min a -> b # foldl :: (b -> a -> b) -> b -> Min a -> b # foldl' :: (b -> a -> b) -> b -> Min a -> b # foldr1 :: (a -> a -> a) -> Min a -> a # foldl1 :: (a -> a -> a) -> Min a -> a # elem :: Eq a => a -> Min a -> Bool # maximum :: Ord a => Min a -> a # | |
| Foldable Dual | Since: base-4.8.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => Dual m -> m # foldMap :: Monoid m => (a -> m) -> Dual a -> m # foldMap' :: Monoid m => (a -> m) -> Dual a -> m # foldr :: (a -> b -> b) -> b -> Dual a -> b # foldr' :: (a -> b -> b) -> b -> Dual a -> b # foldl :: (b -> a -> b) -> b -> Dual a -> b # foldl' :: (b -> a -> b) -> b -> Dual a -> b # foldr1 :: (a -> a -> a) -> Dual a -> a # foldl1 :: (a -> a -> a) -> Dual a -> a # elem :: Eq a => a -> Dual a -> Bool # maximum :: Ord a => Dual a -> a # | |
| Foldable Product | Since: base-4.8.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => Product m -> m # foldMap :: Monoid m => (a -> m) -> Product a -> m # foldMap' :: Monoid m => (a -> m) -> Product a -> m # foldr :: (a -> b -> b) -> b -> Product a -> b # foldr' :: (a -> b -> b) -> b -> Product a -> b # foldl :: (b -> a -> b) -> b -> Product a -> b # foldl' :: (b -> a -> b) -> b -> Product a -> b # foldr1 :: (a -> a -> a) -> Product a -> a # foldl1 :: (a -> a -> a) -> Product a -> a # elem :: Eq a => a -> Product a -> Bool # maximum :: Ord a => Product a -> a # minimum :: Ord a => Product a -> a # | |
| Foldable Sum | Since: base-4.8.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => Sum m -> m # foldMap :: Monoid m => (a -> m) -> Sum a -> m # foldMap' :: Monoid m => (a -> m) -> Sum a -> m # foldr :: (a -> b -> b) -> b -> Sum a -> b # foldr' :: (a -> b -> b) -> b -> Sum a -> b # foldl :: (b -> a -> b) -> b -> Sum a -> b # foldl' :: (b -> a -> b) -> b -> Sum a -> b # foldr1 :: (a -> a -> a) -> Sum a -> a # foldl1 :: (a -> a -> a) -> Sum a -> a # elem :: Eq a => a -> Sum a -> Bool # maximum :: Ord a => Sum a -> a # | |
| Foldable NonEmpty | Since: base-4.9.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => NonEmpty m -> m # foldMap :: Monoid m => (a -> m) -> NonEmpty a -> m # foldMap' :: Monoid m => (a -> m) -> NonEmpty a -> m # foldr :: (a -> b -> b) -> b -> NonEmpty a -> b # foldr' :: (a -> b -> b) -> b -> NonEmpty a -> b # foldl :: (b -> a -> b) -> b -> NonEmpty a -> b # foldl' :: (b -> a -> b) -> b -> NonEmpty a -> b # foldr1 :: (a -> a -> a) -> NonEmpty a -> a # foldl1 :: (a -> a -> a) -> NonEmpty a -> a # elem :: Eq a => a -> NonEmpty a -> Bool # maximum :: Ord a => NonEmpty a -> a # minimum :: Ord a => NonEmpty a -> a # | |
| Foldable Par1 | Since: base-4.9.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => Par1 m -> m # foldMap :: Monoid m => (a -> m) -> Par1 a -> m # foldMap' :: Monoid m => (a -> m) -> Par1 a -> m # foldr :: (a -> b -> b) -> b -> Par1 a -> b # foldr' :: (a -> b -> b) -> b -> Par1 a -> b # foldl :: (b -> a -> b) -> b -> Par1 a -> b # foldl' :: (b -> a -> b) -> b -> Par1 a -> b # foldr1 :: (a -> a -> a) -> Par1 a -> a # foldl1 :: (a -> a -> a) -> Par1 a -> a # elem :: Eq a => a -> Par1 a -> Bool # maximum :: Ord a => Par1 a -> a # | |
| Foldable SCC | Since: containers-0.5.9 |
Defined in Data.Graph Methods fold :: Monoid m => SCC m -> m # foldMap :: Monoid m => (a -> m) -> SCC a -> m # foldMap' :: Monoid m => (a -> m) -> SCC a -> m # foldr :: (a -> b -> b) -> b -> SCC a -> b # foldr' :: (a -> b -> b) -> b -> SCC a -> b # foldl :: (b -> a -> b) -> b -> SCC a -> b # foldl' :: (b -> a -> b) -> b -> SCC a -> b # foldr1 :: (a -> a -> a) -> SCC a -> a # foldl1 :: (a -> a -> a) -> SCC a -> a # elem :: Eq a => a -> SCC a -> Bool # maximum :: Ord a => SCC a -> a # | |
| Foldable IntMap | Folds in order of increasing key. |
Defined in Data.IntMap.Internal Methods fold :: Monoid m => IntMap m -> m # foldMap :: Monoid m => (a -> m) -> IntMap a -> m # foldMap' :: Monoid m => (a -> m) -> IntMap a -> m # foldr :: (a -> b -> b) -> b -> IntMap a -> b # foldr' :: (a -> b -> b) -> b -> IntMap a -> b # foldl :: (b -> a -> b) -> b -> IntMap a -> b # foldl' :: (b -> a -> b) -> b -> IntMap a -> b # foldr1 :: (a -> a -> a) -> IntMap a -> a # foldl1 :: (a -> a -> a) -> IntMap a -> a # elem :: Eq a => a -> IntMap a -> Bool # maximum :: Ord a => IntMap a -> a # minimum :: Ord a => IntMap a -> a # | |
| Foldable Digit | |
Defined in Data.Sequence.Internal Methods fold :: Monoid m => Digit m -> m # foldMap :: Monoid m => (a -> m) -> Digit a -> m # foldMap' :: Monoid m => (a -> m) -> Digit a -> m # foldr :: (a -> b -> b) -> b -> Digit a -> b # foldr' :: (a -> b -> b) -> b -> Digit a -> b # foldl :: (b -> a -> b) -> b -> Digit a -> b # foldl' :: (b -> a -> b) -> b -> Digit a -> b # foldr1 :: (a -> a -> a) -> Digit a -> a # foldl1 :: (a -> a -> a) -> Digit a -> a # elem :: Eq a => a -> Digit a -> Bool # maximum :: Ord a => Digit a -> a # minimum :: Ord a => Digit a -> a # | |
| Foldable Elem | |
Defined in Data.Sequence.Internal Methods fold :: Monoid m => Elem m -> m # foldMap :: Monoid m => (a -> m) -> Elem a -> m # foldMap' :: Monoid m => (a -> m) -> Elem a -> m # foldr :: (a -> b -> b) -> b -> Elem a -> b # foldr' :: (a -> b -> b) -> b -> Elem a -> b # foldl :: (b -> a -> b) -> b -> Elem a -> b # foldl' :: (b -> a -> b) -> b -> Elem a -> b # foldr1 :: (a -> a -> a) -> Elem a -> a # foldl1 :: (a -> a -> a) -> Elem a -> a # elem :: Eq a => a -> Elem a -> Bool # maximum :: Ord a => Elem a -> a # | |
| Foldable FingerTree | |
Defined in Data.Sequence.Internal Methods fold :: Monoid m => FingerTree m -> m # foldMap :: Monoid m => (a -> m) -> FingerTree a -> m # foldMap' :: Monoid m => (a -> m) -> FingerTree a -> m # foldr :: (a -> b -> b) -> b -> FingerTree a -> b # foldr' :: (a -> b -> b) -> b -> FingerTree a -> b # foldl :: (b -> a -> b) -> b -> FingerTree a -> b # foldl' :: (b -> a -> b) -> b -> FingerTree a -> b # foldr1 :: (a -> a -> a) -> FingerTree a -> a # foldl1 :: (a -> a -> a) -> FingerTree a -> a # toList :: FingerTree a -> [a] # null :: FingerTree a -> Bool # length :: FingerTree a -> Int # elem :: Eq a => a -> FingerTree a -> Bool # maximum :: Ord a => FingerTree a -> a # minimum :: Ord a => FingerTree a -> a # sum :: Num a => FingerTree a -> a # product :: Num a => FingerTree a -> a # | |
| Foldable Node | |
Defined in Data.Sequence.Internal Methods fold :: Monoid m => Node m -> m # foldMap :: Monoid m => (a -> m) -> Node a -> m # foldMap' :: Monoid m => (a -> m) -> Node a -> m # foldr :: (a -> b -> b) -> b -> Node a -> b # foldr' :: (a -> b -> b) -> b -> Node a -> b # foldl :: (b -> a -> b) -> b -> Node a -> b # foldl' :: (b -> a -> b) -> b -> Node a -> b # foldr1 :: (a -> a -> a) -> Node a -> a # foldl1 :: (a -> a -> a) -> Node a -> a # elem :: Eq a => a -> Node a -> Bool # maximum :: Ord a => Node a -> a # | |
| Foldable Seq | |
Defined in Data.Sequence.Internal Methods fold :: Monoid m => Seq m -> m # foldMap :: Monoid m => (a -> m) -> Seq a -> m # foldMap' :: Monoid m => (a -> m) -> Seq a -> m # foldr :: (a -> b -> b) -> b -> Seq a -> b # foldr' :: (a -> b -> b) -> b -> Seq a -> b # foldl :: (b -> a -> b) -> b -> Seq a -> b # foldl' :: (b -> a -> b) -> b -> Seq a -> b # foldr1 :: (a -> a -> a) -> Seq a -> a # foldl1 :: (a -> a -> a) -> Seq a -> a # elem :: Eq a => a -> Seq a -> Bool # maximum :: Ord a => Seq a -> a # | |
| Foldable ViewL | |
Defined in Data.Sequence.Internal Methods fold :: Monoid m => ViewL m -> m # foldMap :: Monoid m => (a -> m) -> ViewL a -> m # foldMap' :: Monoid m => (a -> m) -> ViewL a -> m # foldr :: (a -> b -> b) -> b -> ViewL a -> b # foldr' :: (a -> b -> b) -> b -> ViewL a -> b # foldl :: (b -> a -> b) -> b -> ViewL a -> b # foldl' :: (b -> a -> b) -> b -> ViewL a -> b # foldr1 :: (a -> a -> a) -> ViewL a -> a # foldl1 :: (a -> a -> a) -> ViewL a -> a # elem :: Eq a => a -> ViewL a -> Bool # maximum :: Ord a => ViewL a -> a # minimum :: Ord a => ViewL a -> a # | |
| Foldable ViewR | |
Defined in Data.Sequence.Internal Methods fold :: Monoid m => ViewR m -> m # foldMap :: Monoid m => (a -> m) -> ViewR a -> m # foldMap' :: Monoid m => (a -> m) -> ViewR a -> m # foldr :: (a -> b -> b) -> b -> ViewR a -> b # foldr' :: (a -> b -> b) -> b -> ViewR a -> b # foldl :: (b -> a -> b) -> b -> ViewR a -> b # foldl' :: (b -> a -> b) -> b -> ViewR a -> b # foldr1 :: (a -> a -> a) -> ViewR a -> a # foldl1 :: (a -> a -> a) -> ViewR a -> a # elem :: Eq a => a -> ViewR a -> Bool # maximum :: Ord a => ViewR a -> a # minimum :: Ord a => ViewR a -> a # | |
| Foldable Set | Folds in order of increasing key. |
Defined in Data.Set.Internal Methods fold :: Monoid m => Set m -> m # foldMap :: Monoid m => (a -> m) -> Set a -> m # foldMap' :: Monoid m => (a -> m) -> Set a -> m # foldr :: (a -> b -> b) -> b -> Set a -> b # foldr' :: (a -> b -> b) -> b -> Set a -> b # foldl :: (b -> a -> b) -> b -> Set a -> b # foldl' :: (b -> a -> b) -> b -> Set a -> b # foldr1 :: (a -> a -> a) -> Set a -> a # foldl1 :: (a -> a -> a) -> Set a -> a # elem :: Eq a => a -> Set a -> Bool # maximum :: Ord a => Set a -> a # | |
| Foldable Tree | Folds in preorder |
Defined in Data.Tree Methods fold :: Monoid m => Tree m -> m # foldMap :: Monoid m => (a -> m) -> Tree a -> m # foldMap' :: Monoid m => (a -> m) -> Tree a -> m # foldr :: (a -> b -> b) -> b -> Tree a -> b # foldr' :: (a -> b -> b) -> b -> Tree a -> b # foldl :: (b -> a -> b) -> b -> Tree a -> b # foldl' :: (b -> a -> b) -> b -> Tree a -> b # foldr1 :: (a -> a -> a) -> Tree a -> a # foldl1 :: (a -> a -> a) -> Tree a -> a # elem :: Eq a => a -> Tree a -> Bool # maximum :: Ord a => Tree a -> a # | |
| Foldable DNonEmpty | |
Defined in Data.DList.DNonEmpty.Internal Methods fold :: Monoid m => DNonEmpty m -> m # foldMap :: Monoid m => (a -> m) -> DNonEmpty a -> m # foldMap' :: Monoid m => (a -> m) -> DNonEmpty a -> m # foldr :: (a -> b -> b) -> b -> DNonEmpty a -> b # foldr' :: (a -> b -> b) -> b -> DNonEmpty a -> b # foldl :: (b -> a -> b) -> b -> DNonEmpty a -> b # foldl' :: (b -> a -> b) -> b -> DNonEmpty a -> b # foldr1 :: (a -> a -> a) -> DNonEmpty a -> a # foldl1 :: (a -> a -> a) -> DNonEmpty a -> a # toList :: DNonEmpty a -> [a] # length :: DNonEmpty a -> Int # elem :: Eq a => a -> DNonEmpty a -> Bool # maximum :: Ord a => DNonEmpty a -> a # minimum :: Ord a => DNonEmpty a -> a # | |
| Foldable DList | |
Defined in Data.DList.Internal Methods fold :: Monoid m => DList m -> m # foldMap :: Monoid m => (a -> m) -> DList a -> m # foldMap' :: Monoid m => (a -> m) -> DList a -> m # foldr :: (a -> b -> b) -> b -> DList a -> b # foldr' :: (a -> b -> b) -> b -> DList a -> b # foldl :: (b -> a -> b) -> b -> DList a -> b # foldl' :: (b -> a -> b) -> b -> DList a -> b # foldr1 :: (a -> a -> a) -> DList a -> a # foldl1 :: (a -> a -> a) -> DList a -> a # elem :: Eq a => a -> DList a -> Bool # maximum :: Ord a => DList a -> a # minimum :: Ord a => DList a -> a # | |
| Foldable Hashed | |
Defined in Data.Hashable.Class Methods fold :: Monoid m => Hashed m -> m # foldMap :: Monoid m => (a -> m) -> Hashed a -> m # foldMap' :: Monoid m => (a -> m) -> Hashed a -> m # foldr :: (a -> b -> b) -> b -> Hashed a -> b # foldr' :: (a -> b -> b) -> b -> Hashed a -> b # foldl :: (b -> a -> b) -> b -> Hashed a -> b # foldl' :: (b -> a -> b) -> b -> Hashed a -> b # foldr1 :: (a -> a -> a) -> Hashed a -> a # foldl1 :: (a -> a -> a) -> Hashed a -> a # elem :: Eq a => a -> Hashed a -> Bool # maximum :: Ord a => Hashed a -> a # minimum :: Ord a => Hashed a -> a # | |
| Foldable NEIntMap | Traverses elements in order of ascending keys. WARNING: |
Defined in Data.IntMap.NonEmpty.Internal Methods fold :: Monoid m => NEIntMap m -> m # foldMap :: Monoid m => (a -> m) -> NEIntMap a -> m # foldMap' :: Monoid m => (a -> m) -> NEIntMap a -> m # foldr :: (a -> b -> b) -> b -> NEIntMap a -> b # foldr' :: (a -> b -> b) -> b -> NEIntMap a -> b # foldl :: (b -> a -> b) -> b -> NEIntMap a -> b # foldl' :: (b -> a -> b) -> b -> NEIntMap a -> b # foldr1 :: (a -> a -> a) -> NEIntMap a -> a # foldl1 :: (a -> a -> a) -> NEIntMap a -> a # elem :: Eq a => a -> NEIntMap a -> Bool # maximum :: Ord a => NEIntMap a -> a # minimum :: Ord a => NEIntMap a -> a # | |
| Foldable NESeq |
|
Defined in Data.Sequence.NonEmpty.Internal Methods fold :: Monoid m => NESeq m -> m # foldMap :: Monoid m => (a -> m) -> NESeq a -> m # foldMap' :: Monoid m => (a -> m) -> NESeq a -> m # foldr :: (a -> b -> b) -> b -> NESeq a -> b # foldr' :: (a -> b -> b) -> b -> NESeq a -> b # foldl :: (b -> a -> b) -> b -> NESeq a -> b # foldl' :: (b -> a -> b) -> b -> NESeq a -> b # foldr1 :: (a -> a -> a) -> NESeq a -> a # foldl1 :: (a -> a -> a) -> NESeq a -> a # elem :: Eq a => a -> NESeq a -> Bool # maximum :: Ord a => NESeq a -> a # minimum :: Ord a => NESeq a -> a # | |
| Foldable NESet | Traverses elements in ascending order |
Defined in Data.Set.NonEmpty.Internal Methods fold :: Monoid m => NESet m -> m # foldMap :: Monoid m => (a -> m) -> NESet a -> m # foldMap' :: Monoid m => (a -> m) -> NESet a -> m # foldr :: (a -> b -> b) -> b -> NESet a -> b # foldr' :: (a -> b -> b) -> b -> NESet a -> b # foldl :: (b -> a -> b) -> b -> NESet a -> b # foldl' :: (b -> a -> b) -> b -> NESet a -> b # foldr1 :: (a -> a -> a) -> NESet a -> a # foldl1 :: (a -> a -> a) -> NESet a -> a # elem :: Eq a => a -> NESet a -> Bool # maximum :: Ord a => NESet a -> a # minimum :: Ord a => NESet a -> a # | |
| Foldable SimpleDocStream | Collect all annotations from a document. |
Defined in Prettyprinter.Internal Methods fold :: Monoid m => SimpleDocStream m -> m # foldMap :: Monoid m => (a -> m) -> SimpleDocStream a -> m # foldMap' :: Monoid m => (a -> m) -> SimpleDocStream a -> m # foldr :: (a -> b -> b) -> b -> SimpleDocStream a -> b # foldr' :: (a -> b -> b) -> b -> SimpleDocStream a -> b # foldl :: (b -> a -> b) -> b -> SimpleDocStream a -> b # foldl' :: (b -> a -> b) -> b -> SimpleDocStream a -> b # foldr1 :: (a -> a -> a) -> SimpleDocStream a -> a # foldl1 :: (a -> a -> a) -> SimpleDocStream a -> a # toList :: SimpleDocStream a -> [a] # null :: SimpleDocStream a -> Bool # length :: SimpleDocStream a -> Int # elem :: Eq a => a -> SimpleDocStream a -> Bool # maximum :: Ord a => SimpleDocStream a -> a # minimum :: Ord a => SimpleDocStream a -> a # sum :: Num a => SimpleDocStream a -> a # product :: Num a => SimpleDocStream a -> a # | |
| Foldable Array | |
Defined in Data.Primitive.Array Methods fold :: Monoid m => Array m -> m # foldMap :: Monoid m => (a -> m) -> Array a -> m # foldMap' :: Monoid m => (a -> m) -> Array a -> m # foldr :: (a -> b -> b) -> b -> Array a -> b # foldr' :: (a -> b -> b) -> b -> Array a -> b # foldl :: (b -> a -> b) -> b -> Array a -> b # foldl' :: (b -> a -> b) -> b -> Array a -> b # foldr1 :: (a -> a -> a) -> Array a -> a # foldl1 :: (a -> a -> a) -> Array a -> a # elem :: Eq a => a -> Array a -> Bool # maximum :: Ord a => Array a -> a # minimum :: Ord a => Array a -> a # | |
| Foldable SmallArray | |
Defined in Data.Primitive.SmallArray Methods fold :: Monoid m => SmallArray m -> m # foldMap :: Monoid m => (a -> m) -> SmallArray a -> m # foldMap' :: Monoid m => (a -> m) -> SmallArray a -> m # foldr :: (a -> b -> b) -> b -> SmallArray a -> b # foldr' :: (a -> b -> b) -> b -> SmallArray a -> b # foldl :: (b -> a -> b) -> b -> SmallArray a -> b # foldl' :: (b -> a -> b) -> b -> SmallArray a -> b # foldr1 :: (a -> a -> a) -> SmallArray a -> a # foldl1 :: (a -> a -> a) -> SmallArray a -> a # toList :: SmallArray a -> [a] # null :: SmallArray a -> Bool # length :: SmallArray a -> Int # elem :: Eq a => a -> SmallArray a -> Bool # maximum :: Ord a => SmallArray a -> a # minimum :: Ord a => SmallArray a -> a # sum :: Num a => SmallArray a -> a # product :: Num a => SmallArray a -> a # | |
| Foldable WithDisabled Source # | |
Defined in Shrun.Configuration.Data.WithDisabled Methods fold :: Monoid m => WithDisabled m -> m # foldMap :: Monoid m => (a -> m) -> WithDisabled a -> m # foldMap' :: Monoid m => (a -> m) -> WithDisabled a -> m # foldr :: (a -> b -> b) -> b -> WithDisabled a -> b # foldr' :: (a -> b -> b) -> b -> WithDisabled a -> b # foldl :: (b -> a -> b) -> b -> WithDisabled a -> b # foldl' :: (b -> a -> b) -> b -> WithDisabled a -> b # foldr1 :: (a -> a -> a) -> WithDisabled a -> a # foldl1 :: (a -> a -> a) -> WithDisabled a -> a # toList :: WithDisabled a -> [a] # null :: WithDisabled a -> Bool # length :: WithDisabled a -> Int # elem :: Eq a => a -> WithDisabled a -> Bool # maximum :: Ord a => WithDisabled a -> a # minimum :: Ord a => WithDisabled a -> a # sum :: Num a => WithDisabled a -> a # product :: Num a => WithDisabled a -> a # | |
| Foldable Maybe | |
Defined in Data.Strict.Maybe Methods fold :: Monoid m => Maybe m -> m # foldMap :: Monoid m => (a -> m) -> Maybe a -> m # foldMap' :: Monoid m => (a -> m) -> Maybe a -> m # foldr :: (a -> b -> b) -> b -> Maybe a -> b # foldr' :: (a -> b -> b) -> b -> Maybe a -> b # foldl :: (b -> a -> b) -> b -> Maybe a -> b # foldl' :: (b -> a -> b) -> b -> Maybe a -> b # foldr1 :: (a -> a -> a) -> Maybe a -> a # foldl1 :: (a -> a -> a) -> Maybe a -> a # elem :: Eq a => a -> Maybe a -> Bool # maximum :: Ord a => Maybe a -> a # minimum :: Ord a => Maybe a -> a # | |
| Foldable TyVarBndr | |
Defined in Language.Haskell.TH.Syntax Methods fold :: Monoid m => TyVarBndr m -> m # foldMap :: Monoid m => (a -> m) -> TyVarBndr a -> m # foldMap' :: Monoid m => (a -> m) -> TyVarBndr a -> m # foldr :: (a -> b -> b) -> b -> TyVarBndr a -> b # foldr' :: (a -> b -> b) -> b -> TyVarBndr a -> b # foldl :: (b -> a -> b) -> b -> TyVarBndr a -> b # foldl' :: (b -> a -> b) -> b -> TyVarBndr a -> b # foldr1 :: (a -> a -> a) -> TyVarBndr a -> a # foldl1 :: (a -> a -> a) -> TyVarBndr a -> a # toList :: TyVarBndr a -> [a] # length :: TyVarBndr a -> Int # elem :: Eq a => a -> TyVarBndr a -> Bool # maximum :: Ord a => TyVarBndr a -> a # minimum :: Ord a => TyVarBndr a -> a # | |
| Foldable Window | |
Defined in System.Console.Terminal.Common Methods fold :: Monoid m => Window m -> m # foldMap :: Monoid m => (a -> m) -> Window a -> m # foldMap' :: Monoid m => (a -> m) -> Window a -> m # foldr :: (a -> b -> b) -> b -> Window a -> b # foldr' :: (a -> b -> b) -> b -> Window a -> b # foldl :: (b -> a -> b) -> b -> Window a -> b # foldl' :: (b -> a -> b) -> b -> Window a -> b # foldr1 :: (a -> a -> a) -> Window a -> a # foldl1 :: (a -> a -> a) -> Window a -> a # elem :: Eq a => a -> Window a -> Bool # maximum :: Ord a => Window a -> a # minimum :: Ord a => Window a -> a # | |
| Foldable HashSet | |
Defined in Data.HashSet.Internal Methods fold :: Monoid m => HashSet m -> m # foldMap :: Monoid m => (a -> m) -> HashSet a -> m # foldMap' :: Monoid m => (a -> m) -> HashSet a -> m # foldr :: (a -> b -> b) -> b -> HashSet a -> b # foldr' :: (a -> b -> b) -> b -> HashSet a -> b # foldl :: (b -> a -> b) -> b -> HashSet a -> b # foldl' :: (b -> a -> b) -> b -> HashSet a -> b # foldr1 :: (a -> a -> a) -> HashSet a -> a # foldl1 :: (a -> a -> a) -> HashSet a -> a # elem :: Eq a => a -> HashSet a -> Bool # maximum :: Ord a => HashSet a -> a # minimum :: Ord a => HashSet a -> a # | |
| Foldable Vector | |
Defined in Data.Vector Methods fold :: Monoid m => Vector m -> m # foldMap :: Monoid m => (a -> m) -> Vector a -> m # foldMap' :: Monoid m => (a -> m) -> Vector a -> m # foldr :: (a -> b -> b) -> b -> Vector a -> b # foldr' :: (a -> b -> b) -> b -> Vector a -> b # foldl :: (b -> a -> b) -> b -> Vector a -> b # foldl' :: (b -> a -> b) -> b -> Vector a -> b # foldr1 :: (a -> a -> a) -> Vector a -> a # foldl1 :: (a -> a -> a) -> Vector a -> a # elem :: Eq a => a -> Vector a -> Bool # maximum :: Ord a => Vector a -> a # minimum :: Ord a => Vector a -> a # | |
| Foldable Maybe | Since: base-2.1 |
Defined in Data.Foldable Methods fold :: Monoid m => Maybe m -> m # foldMap :: Monoid m => (a -> m) -> Maybe a -> m # foldMap' :: Monoid m => (a -> m) -> Maybe a -> m # foldr :: (a -> b -> b) -> b -> Maybe a -> b # foldr' :: (a -> b -> b) -> b -> Maybe a -> b # foldl :: (b -> a -> b) -> b -> Maybe a -> b # foldl' :: (b -> a -> b) -> b -> Maybe a -> b # foldr1 :: (a -> a -> a) -> Maybe a -> a # foldl1 :: (a -> a -> a) -> Maybe a -> a # elem :: Eq a => a -> Maybe a -> Bool # maximum :: Ord a => Maybe a -> a # minimum :: Ord a => Maybe a -> a # | |
| Foldable Solo | Since: base-4.15 |
Defined in Data.Foldable Methods fold :: Monoid m => Solo m -> m # foldMap :: Monoid m => (a -> m) -> Solo a -> m # foldMap' :: Monoid m => (a -> m) -> Solo a -> m # foldr :: (a -> b -> b) -> b -> Solo a -> b # foldr' :: (a -> b -> b) -> b -> Solo a -> b # foldl :: (b -> a -> b) -> b -> Solo a -> b # foldl' :: (b -> a -> b) -> b -> Solo a -> b # foldr1 :: (a -> a -> a) -> Solo a -> a # foldl1 :: (a -> a -> a) -> Solo a -> a # elem :: Eq a => a -> Solo a -> Bool # maximum :: Ord a => Solo a -> a # | |
| Foldable [] | Since: base-2.1 |
Defined in Data.Foldable Methods fold :: Monoid m => [m] -> m # foldMap :: Monoid m => (a -> m) -> [a] -> m # foldMap' :: Monoid m => (a -> m) -> [a] -> m # foldr :: (a -> b -> b) -> b -> [a] -> b # foldr' :: (a -> b -> b) -> b -> [a] -> b # foldl :: (b -> a -> b) -> b -> [a] -> b # foldl' :: (b -> a -> b) -> b -> [a] -> b # foldr1 :: (a -> a -> a) -> [a] -> a # foldl1 :: (a -> a -> a) -> [a] -> a # elem :: Eq a => a -> [a] -> Bool # maximum :: Ord a => [a] -> a # | |
| Foldable (Either a) | Since: base-4.7.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => Either a m -> m # foldMap :: Monoid m => (a0 -> m) -> Either a a0 -> m # foldMap' :: Monoid m => (a0 -> m) -> Either a a0 -> m # foldr :: (a0 -> b -> b) -> b -> Either a a0 -> b # foldr' :: (a0 -> b -> b) -> b -> Either a a0 -> b # foldl :: (b -> a0 -> b) -> b -> Either a a0 -> b # foldl' :: (b -> a0 -> b) -> b -> Either a a0 -> b # foldr1 :: (a0 -> a0 -> a0) -> Either a a0 -> a0 # foldl1 :: (a0 -> a0 -> a0) -> Either a a0 -> a0 # toList :: Either a a0 -> [a0] # length :: Either a a0 -> Int # elem :: Eq a0 => a0 -> Either a a0 -> Bool # maximum :: Ord a0 => Either a a0 -> a0 # minimum :: Ord a0 => Either a a0 -> a0 # | |
| Foldable (Proxy :: Type -> Type) | Since: base-4.7.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => Proxy m -> m # foldMap :: Monoid m => (a -> m) -> Proxy a -> m # foldMap' :: Monoid m => (a -> m) -> Proxy a -> m # foldr :: (a -> b -> b) -> b -> Proxy a -> b # foldr' :: (a -> b -> b) -> b -> Proxy a -> b # foldl :: (b -> a -> b) -> b -> Proxy a -> b # foldl' :: (b -> a -> b) -> b -> Proxy a -> b # foldr1 :: (a -> a -> a) -> Proxy a -> a # foldl1 :: (a -> a -> a) -> Proxy a -> a # elem :: Eq a => a -> Proxy a -> Bool # maximum :: Ord a => Proxy a -> a # minimum :: Ord a => Proxy a -> a # | |
| Foldable (Arg a) | Since: base-4.9.0.0 |
Defined in Data.Semigroup Methods fold :: Monoid m => Arg a m -> m # foldMap :: Monoid m => (a0 -> m) -> Arg a a0 -> m # foldMap' :: Monoid m => (a0 -> m) -> Arg a a0 -> m # foldr :: (a0 -> b -> b) -> b -> Arg a a0 -> b # foldr' :: (a0 -> b -> b) -> b -> Arg a a0 -> b # foldl :: (b -> a0 -> b) -> b -> Arg a a0 -> b # foldl' :: (b -> a0 -> b) -> b -> Arg a a0 -> b # foldr1 :: (a0 -> a0 -> a0) -> Arg a a0 -> a0 # foldl1 :: (a0 -> a0 -> a0) -> Arg a a0 -> a0 # elem :: Eq a0 => a0 -> Arg a a0 -> Bool # maximum :: Ord a0 => Arg a a0 -> a0 # minimum :: Ord a0 => Arg a a0 -> a0 # | |
| Foldable (Array i) | Since: base-4.8.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => Array i m -> m # foldMap :: Monoid m => (a -> m) -> Array i a -> m # foldMap' :: Monoid m => (a -> m) -> Array i a -> m # foldr :: (a -> b -> b) -> b -> Array i a -> b # foldr' :: (a -> b -> b) -> b -> Array i a -> b # foldl :: (b -> a -> b) -> b -> Array i a -> b # foldl' :: (b -> a -> b) -> b -> Array i a -> b # foldr1 :: (a -> a -> a) -> Array i a -> a # foldl1 :: (a -> a -> a) -> Array i a -> a # elem :: Eq a => a -> Array i a -> Bool # maximum :: Ord a => Array i a -> a # minimum :: Ord a => Array i a -> a # | |
| Foldable (U1 :: Type -> Type) | Since: base-4.9.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => U1 m -> m # foldMap :: Monoid m => (a -> m) -> U1 a -> m # foldMap' :: Monoid m => (a -> m) -> U1 a -> m # foldr :: (a -> b -> b) -> b -> U1 a -> b # foldr' :: (a -> b -> b) -> b -> U1 a -> b # foldl :: (b -> a -> b) -> b -> U1 a -> b # foldl' :: (b -> a -> b) -> b -> U1 a -> b # foldr1 :: (a -> a -> a) -> U1 a -> a # foldl1 :: (a -> a -> a) -> U1 a -> a # elem :: Eq a => a -> U1 a -> Bool # maximum :: Ord a => U1 a -> a # | |
| Foldable (UAddr :: Type -> Type) | Since: base-4.9.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => UAddr m -> m # foldMap :: Monoid m => (a -> m) -> UAddr a -> m # foldMap' :: Monoid m => (a -> m) -> UAddr a -> m # foldr :: (a -> b -> b) -> b -> UAddr a -> b # foldr' :: (a -> b -> b) -> b -> UAddr a -> b # foldl :: (b -> a -> b) -> b -> UAddr a -> b # foldl' :: (b -> a -> b) -> b -> UAddr a -> b # foldr1 :: (a -> a -> a) -> UAddr a -> a # foldl1 :: (a -> a -> a) -> UAddr a -> a # elem :: Eq a => a -> UAddr a -> Bool # maximum :: Ord a => UAddr a -> a # minimum :: Ord a => UAddr a -> a # | |
| Foldable (UChar :: Type -> Type) | Since: base-4.9.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => UChar m -> m # foldMap :: Monoid m => (a -> m) -> UChar a -> m # foldMap' :: Monoid m => (a -> m) -> UChar a -> m # foldr :: (a -> b -> b) -> b -> UChar a -> b # foldr' :: (a -> b -> b) -> b -> UChar a -> b # foldl :: (b -> a -> b) -> b -> UChar a -> b # foldl' :: (b -> a -> b) -> b -> UChar a -> b # foldr1 :: (a -> a -> a) -> UChar a -> a # foldl1 :: (a -> a -> a) -> UChar a -> a # elem :: Eq a => a -> UChar a -> Bool # maximum :: Ord a => UChar a -> a # minimum :: Ord a => UChar a -> a # | |
| Foldable (UDouble :: Type -> Type) | Since: base-4.9.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => UDouble m -> m # foldMap :: Monoid m => (a -> m) -> UDouble a -> m # foldMap' :: Monoid m => (a -> m) -> UDouble a -> m # foldr :: (a -> b -> b) -> b -> UDouble a -> b # foldr' :: (a -> b -> b) -> b -> UDouble a -> b # foldl :: (b -> a -> b) -> b -> UDouble a -> b # foldl' :: (b -> a -> b) -> b -> UDouble a -> b # foldr1 :: (a -> a -> a) -> UDouble a -> a # foldl1 :: (a -> a -> a) -> UDouble a -> a # elem :: Eq a => a -> UDouble a -> Bool # maximum :: Ord a => UDouble a -> a # minimum :: Ord a => UDouble a -> a # | |
| Foldable (UFloat :: Type -> Type) | Since: base-4.9.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => UFloat m -> m # foldMap :: Monoid m => (a -> m) -> UFloat a -> m # foldMap' :: Monoid m => (a -> m) -> UFloat a -> m # foldr :: (a -> b -> b) -> b -> UFloat a -> b # foldr' :: (a -> b -> b) -> b -> UFloat a -> b # foldl :: (b -> a -> b) -> b -> UFloat a -> b # foldl' :: (b -> a -> b) -> b -> UFloat a -> b # foldr1 :: (a -> a -> a) -> UFloat a -> a # foldl1 :: (a -> a -> a) -> UFloat a -> a # elem :: Eq a => a -> UFloat a -> Bool # maximum :: Ord a => UFloat a -> a # minimum :: Ord a => UFloat a -> a # | |
| Foldable (UInt :: Type -> Type) | Since: base-4.9.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => UInt m -> m # foldMap :: Monoid m => (a -> m) -> UInt a -> m # foldMap' :: Monoid m => (a -> m) -> UInt a -> m # foldr :: (a -> b -> b) -> b -> UInt a -> b # foldr' :: (a -> b -> b) -> b -> UInt a -> b # foldl :: (b -> a -> b) -> b -> UInt a -> b # foldl' :: (b -> a -> b) -> b -> UInt a -> b # foldr1 :: (a -> a -> a) -> UInt a -> a # foldl1 :: (a -> a -> a) -> UInt a -> a # elem :: Eq a => a -> UInt a -> Bool # maximum :: Ord a => UInt a -> a # | |
| Foldable (UWord :: Type -> Type) | Since: base-4.9.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => UWord m -> m # foldMap :: Monoid m => (a -> m) -> UWord a -> m # foldMap' :: Monoid m => (a -> m) -> UWord a -> m # foldr :: (a -> b -> b) -> b -> UWord a -> b # foldr' :: (a -> b -> b) -> b -> UWord a -> b # foldl :: (b -> a -> b) -> b -> UWord a -> b # foldl' :: (b -> a -> b) -> b -> UWord a -> b # foldr1 :: (a -> a -> a) -> UWord a -> a # foldl1 :: (a -> a -> a) -> UWord a -> a # elem :: Eq a => a -> UWord a -> Bool # maximum :: Ord a => UWord a -> a # minimum :: Ord a => UWord a -> a # | |
| Foldable (V1 :: Type -> Type) | Since: base-4.9.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => V1 m -> m # foldMap :: Monoid m => (a -> m) -> V1 a -> m # foldMap' :: Monoid m => (a -> m) -> V1 a -> m # foldr :: (a -> b -> b) -> b -> V1 a -> b # foldr' :: (a -> b -> b) -> b -> V1 a -> b # foldl :: (b -> a -> b) -> b -> V1 a -> b # foldl' :: (b -> a -> b) -> b -> V1 a -> b # foldr1 :: (a -> a -> a) -> V1 a -> a # foldl1 :: (a -> a -> a) -> V1 a -> a # elem :: Eq a => a -> V1 a -> Bool # maximum :: Ord a => V1 a -> a # | |
| Foldable (Map k) | Folds in order of increasing key. |
Defined in Data.Map.Internal Methods fold :: Monoid m => Map k m -> m # foldMap :: Monoid m => (a -> m) -> Map k a -> m # foldMap' :: Monoid m => (a -> m) -> Map k a -> m # foldr :: (a -> b -> b) -> b -> Map k a -> b # foldr' :: (a -> b -> b) -> b -> Map k a -> b # foldl :: (b -> a -> b) -> b -> Map k a -> b # foldl' :: (b -> a -> b) -> b -> Map k a -> b # foldr1 :: (a -> a -> a) -> Map k a -> a # foldl1 :: (a -> a -> a) -> Map k a -> a # elem :: Eq a => a -> Map k a -> Bool # maximum :: Ord a => Map k a -> a # minimum :: Ord a => Map k a -> a # | |
| Foldable f => Foldable (Cofree f) | |
Defined in Control.Comonad.Cofree Methods fold :: Monoid m => Cofree f m -> m # foldMap :: Monoid m => (a -> m) -> Cofree f a -> m # foldMap' :: Monoid m => (a -> m) -> Cofree f a -> m # foldr :: (a -> b -> b) -> b -> Cofree f a -> b # foldr' :: (a -> b -> b) -> b -> Cofree f a -> b # foldl :: (b -> a -> b) -> b -> Cofree f a -> b # foldl' :: (b -> a -> b) -> b -> Cofree f a -> b # foldr1 :: (a -> a -> a) -> Cofree f a -> a # foldl1 :: (a -> a -> a) -> Cofree f a -> a # elem :: Eq a => a -> Cofree f a -> Bool # maximum :: Ord a => Cofree f a -> a # minimum :: Ord a => Cofree f a -> a # | |
| Foldable f => Foldable (Free f) | |
Defined in Control.Monad.Free Methods fold :: Monoid m => Free f m -> m # foldMap :: Monoid m => (a -> m) -> Free f a -> m # foldMap' :: Monoid m => (a -> m) -> Free f a -> m # foldr :: (a -> b -> b) -> b -> Free f a -> b # foldr' :: (a -> b -> b) -> b -> Free f a -> b # foldl :: (b -> a -> b) -> b -> Free f a -> b # foldl' :: (b -> a -> b) -> b -> Free f a -> b # foldr1 :: (a -> a -> a) -> Free f a -> a # foldl1 :: (a -> a -> a) -> Free f a -> a # elem :: Eq a => a -> Free f a -> Bool # maximum :: Ord a => Free f a -> a # minimum :: Ord a => Free f a -> a # | |
| Foldable f => Foldable (Yoneda f) | |
Defined in Data.Functor.Yoneda Methods fold :: Monoid m => Yoneda f m -> m # foldMap :: Monoid m => (a -> m) -> Yoneda f a -> m # foldMap' :: Monoid m => (a -> m) -> Yoneda f a -> m # foldr :: (a -> b -> b) -> b -> Yoneda f a -> b # foldr' :: (a -> b -> b) -> b -> Yoneda f a -> b # foldl :: (b -> a -> b) -> b -> Yoneda f a -> b # foldl' :: (b -> a -> b) -> b -> Yoneda f a -> b # foldr1 :: (a -> a -> a) -> Yoneda f a -> a # foldl1 :: (a -> a -> a) -> Yoneda f a -> a # elem :: Eq a => a -> Yoneda f a -> Bool # maximum :: Ord a => Yoneda f a -> a # minimum :: Ord a => Yoneda f a -> a # | |
| MonoFoldable mono => Foldable (WrappedMono mono) | |
Defined in Data.MonoTraversable Methods fold :: Monoid m => WrappedMono mono m -> m # foldMap :: Monoid m => (a -> m) -> WrappedMono mono a -> m # foldMap' :: Monoid m => (a -> m) -> WrappedMono mono a -> m # foldr :: (a -> b -> b) -> b -> WrappedMono mono a -> b # foldr' :: (a -> b -> b) -> b -> WrappedMono mono a -> b # foldl :: (b -> a -> b) -> b -> WrappedMono mono a -> b # foldl' :: (b -> a -> b) -> b -> WrappedMono mono a -> b # foldr1 :: (a -> a -> a) -> WrappedMono mono a -> a # foldl1 :: (a -> a -> a) -> WrappedMono mono a -> a # toList :: WrappedMono mono a -> [a] # null :: WrappedMono mono a -> Bool # length :: WrappedMono mono a -> Int # elem :: Eq a => a -> WrappedMono mono a -> Bool # maximum :: Ord a => WrappedMono mono a -> a # minimum :: Ord a => WrappedMono mono a -> a # sum :: Num a => WrappedMono mono a -> a # product :: Num a => WrappedMono mono a -> a # | |
| Foldable f => Foldable (WrappedPoly f) | |
Defined in Data.MonoTraversable Methods fold :: Monoid m => WrappedPoly f m -> m # foldMap :: Monoid m => (a -> m) -> WrappedPoly f a -> m # foldMap' :: Monoid m => (a -> m) -> WrappedPoly f a -> m # foldr :: (a -> b -> b) -> b -> WrappedPoly f a -> b # foldr' :: (a -> b -> b) -> b -> WrappedPoly f a -> b # foldl :: (b -> a -> b) -> b -> WrappedPoly f a -> b # foldl' :: (b -> a -> b) -> b -> WrappedPoly f a -> b # foldr1 :: (a -> a -> a) -> WrappedPoly f a -> a # foldl1 :: (a -> a -> a) -> WrappedPoly f a -> a # toList :: WrappedPoly f a -> [a] # null :: WrappedPoly f a -> Bool # length :: WrappedPoly f a -> Int # elem :: Eq a => a -> WrappedPoly f a -> Bool # maximum :: Ord a => WrappedPoly f a -> a # minimum :: Ord a => WrappedPoly f a -> a # sum :: Num a => WrappedPoly f a -> a # product :: Num a => WrappedPoly f a -> a # | |
| Foldable (NEMap k) | Traverses elements in order of ascending keys |
Defined in Data.Map.NonEmpty.Internal Methods fold :: Monoid m => NEMap k m -> m # foldMap :: Monoid m => (a -> m) -> NEMap k a -> m # foldMap' :: Monoid m => (a -> m) -> NEMap k a -> m # foldr :: (a -> b -> b) -> b -> NEMap k a -> b # foldr' :: (a -> b -> b) -> b -> NEMap k a -> b # foldl :: (b -> a -> b) -> b -> NEMap k a -> b # foldl' :: (b -> a -> b) -> b -> NEMap k a -> b # foldr1 :: (a -> a -> a) -> NEMap k a -> a # foldl1 :: (a -> a -> a) -> NEMap k a -> a # elem :: Eq a => a -> NEMap k a -> Bool # maximum :: Ord a => NEMap k a -> a # minimum :: Ord a => NEMap k a -> a # | |
| Foldable (Either e) | |
Defined in Data.Strict.Either Methods fold :: Monoid m => Either e m -> m # foldMap :: Monoid m => (a -> m) -> Either e a -> m # foldMap' :: Monoid m => (a -> m) -> Either e a -> m # foldr :: (a -> b -> b) -> b -> Either e a -> b # foldr' :: (a -> b -> b) -> b -> Either e a -> b # foldl :: (b -> a -> b) -> b -> Either e a -> b # foldl' :: (b -> a -> b) -> b -> Either e a -> b # foldr1 :: (a -> a -> a) -> Either e a -> a # foldl1 :: (a -> a -> a) -> Either e a -> a # elem :: Eq a => a -> Either e a -> Bool # maximum :: Ord a => Either e a -> a # minimum :: Ord a => Either e a -> a # | |
| Foldable (These a) | |
Defined in Data.Strict.These Methods fold :: Monoid m => These a m -> m # foldMap :: Monoid m => (a0 -> m) -> These a a0 -> m # foldMap' :: Monoid m => (a0 -> m) -> These a a0 -> m # foldr :: (a0 -> b -> b) -> b -> These a a0 -> b # foldr' :: (a0 -> b -> b) -> b -> These a a0 -> b # foldl :: (b -> a0 -> b) -> b -> These a a0 -> b # foldl' :: (b -> a0 -> b) -> b -> These a a0 -> b # foldr1 :: (a0 -> a0 -> a0) -> These a a0 -> a0 # foldl1 :: (a0 -> a0 -> a0) -> These a a0 -> a0 # toList :: These a a0 -> [a0] # elem :: Eq a0 => a0 -> These a a0 -> Bool # maximum :: Ord a0 => These a a0 -> a0 # minimum :: Ord a0 => These a a0 -> a0 # | |
| Foldable (Pair e) | |
Defined in Data.Strict.Tuple Methods fold :: Monoid m => Pair e m -> m # foldMap :: Monoid m => (a -> m) -> Pair e a -> m # foldMap' :: Monoid m => (a -> m) -> Pair e a -> m # foldr :: (a -> b -> b) -> b -> Pair e a -> b # foldr' :: (a -> b -> b) -> b -> Pair e a -> b # foldl :: (b -> a -> b) -> b -> Pair e a -> b # foldl' :: (b -> a -> b) -> b -> Pair e a -> b # foldr1 :: (a -> a -> a) -> Pair e a -> a # foldl1 :: (a -> a -> a) -> Pair e a -> a # elem :: Eq a => a -> Pair e a -> Bool # maximum :: Ord a => Pair e a -> a # minimum :: Ord a => Pair e a -> a # | |
| Foldable (These a) | |
Defined in Data.These Methods fold :: Monoid m => These a m -> m # foldMap :: Monoid m => (a0 -> m) -> These a a0 -> m # foldMap' :: Monoid m => (a0 -> m) -> These a a0 -> m # foldr :: (a0 -> b -> b) -> b -> These a a0 -> b # foldr' :: (a0 -> b -> b) -> b -> These a a0 -> b # foldl :: (b -> a0 -> b) -> b -> These a a0 -> b # foldl' :: (b -> a0 -> b) -> b -> These a a0 -> b # foldr1 :: (a0 -> a0 -> a0) -> These a a0 -> a0 # foldl1 :: (a0 -> a0 -> a0) -> These a a0 -> a0 # toList :: These a a0 -> [a0] # elem :: Eq a0 => a0 -> These a a0 -> Bool # maximum :: Ord a0 => These a a0 -> a0 # minimum :: Ord a0 => These a a0 -> a0 # | |
| Foldable f => Foldable (Lift f) | |
Defined in Control.Applicative.Lift Methods fold :: Monoid m => Lift f m -> m # foldMap :: Monoid m => (a -> m) -> Lift f a -> m # foldMap' :: Monoid m => (a -> m) -> Lift f a -> m # foldr :: (a -> b -> b) -> b -> Lift f a -> b # foldr' :: (a -> b -> b) -> b -> Lift f a -> b # foldl :: (b -> a -> b) -> b -> Lift f a -> b # foldl' :: (b -> a -> b) -> b -> Lift f a -> b # foldr1 :: (a -> a -> a) -> Lift f a -> a # foldl1 :: (a -> a -> a) -> Lift f a -> a # elem :: Eq a => a -> Lift f a -> Bool # maximum :: Ord a => Lift f a -> a # minimum :: Ord a => Lift f a -> a # | |
| Foldable f => Foldable (MaybeT f) | |
Defined in Control.Monad.Trans.Maybe Methods fold :: Monoid m => MaybeT f m -> m # foldMap :: Monoid m => (a -> m) -> MaybeT f a -> m # foldMap' :: Monoid m => (a -> m) -> MaybeT f a -> m # foldr :: (a -> b -> b) -> b -> MaybeT f a -> b # foldr' :: (a -> b -> b) -> b -> MaybeT f a -> b # foldl :: (b -> a -> b) -> b -> MaybeT f a -> b # foldl' :: (b -> a -> b) -> b -> MaybeT f a -> b # foldr1 :: (a -> a -> a) -> MaybeT f a -> a # foldl1 :: (a -> a -> a) -> MaybeT f a -> a # elem :: Eq a => a -> MaybeT f a -> Bool # maximum :: Ord a => MaybeT f a -> a # minimum :: Ord a => MaybeT f a -> a # | |
| Foldable (HashMap k) | |
Defined in Data.HashMap.Internal Methods fold :: Monoid m => HashMap k m -> m # foldMap :: Monoid m => (a -> m) -> HashMap k a -> m # foldMap' :: Monoid m => (a -> m) -> HashMap k a -> m # foldr :: (a -> b -> b) -> b -> HashMap k a -> b # foldr' :: (a -> b -> b) -> b -> HashMap k a -> b # foldl :: (b -> a -> b) -> b -> HashMap k a -> b # foldl' :: (b -> a -> b) -> b -> HashMap k a -> b # foldr1 :: (a -> a -> a) -> HashMap k a -> a # foldl1 :: (a -> a -> a) -> HashMap k a -> a # toList :: HashMap k a -> [a] # length :: HashMap k a -> Int # elem :: Eq a => a -> HashMap k a -> Bool # maximum :: Ord a => HashMap k a -> a # minimum :: Ord a => HashMap k a -> a # | |
| Foldable ((,) a) | Since: base-4.7.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => (a, m) -> m # foldMap :: Monoid m => (a0 -> m) -> (a, a0) -> m # foldMap' :: Monoid m => (a0 -> m) -> (a, a0) -> m # foldr :: (a0 -> b -> b) -> b -> (a, a0) -> b # foldr' :: (a0 -> b -> b) -> b -> (a, a0) -> b # foldl :: (b -> a0 -> b) -> b -> (a, a0) -> b # foldl' :: (b -> a0 -> b) -> b -> (a, a0) -> b # foldr1 :: (a0 -> a0 -> a0) -> (a, a0) -> a0 # foldl1 :: (a0 -> a0 -> a0) -> (a, a0) -> a0 # elem :: Eq a0 => a0 -> (a, a0) -> Bool # maximum :: Ord a0 => (a, a0) -> a0 # minimum :: Ord a0 => (a, a0) -> a0 # | |
| Foldable (Const m :: Type -> Type) | Since: base-4.7.0.0 |
Defined in Data.Functor.Const Methods fold :: Monoid m0 => Const m m0 -> m0 # foldMap :: Monoid m0 => (a -> m0) -> Const m a -> m0 # foldMap' :: Monoid m0 => (a -> m0) -> Const m a -> m0 # foldr :: (a -> b -> b) -> b -> Const m a -> b # foldr' :: (a -> b -> b) -> b -> Const m a -> b # foldl :: (b -> a -> b) -> b -> Const m a -> b # foldl' :: (b -> a -> b) -> b -> Const m a -> b # foldr1 :: (a -> a -> a) -> Const m a -> a # foldl1 :: (a -> a -> a) -> Const m a -> a # elem :: Eq a => a -> Const m a -> Bool # maximum :: Ord a => Const m a -> a # minimum :: Ord a => Const m a -> a # | |
| Foldable f => Foldable (Ap f) | Since: base-4.12.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => Ap f m -> m # foldMap :: Monoid m => (a -> m) -> Ap f a -> m # foldMap' :: Monoid m => (a -> m) -> Ap f a -> m # foldr :: (a -> b -> b) -> b -> Ap f a -> b # foldr' :: (a -> b -> b) -> b -> Ap f a -> b # foldl :: (b -> a -> b) -> b -> Ap f a -> b # foldl' :: (b -> a -> b) -> b -> Ap f a -> b # foldr1 :: (a -> a -> a) -> Ap f a -> a # foldl1 :: (a -> a -> a) -> Ap f a -> a # elem :: Eq a => a -> Ap f a -> Bool # maximum :: Ord a => Ap f a -> a # | |
| Foldable f => Foldable (Alt f) | Since: base-4.12.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => Alt f m -> m # foldMap :: Monoid m => (a -> m) -> Alt f a -> m # foldMap' :: Monoid m => (a -> m) -> Alt f a -> m # foldr :: (a -> b -> b) -> b -> Alt f a -> b # foldr' :: (a -> b -> b) -> b -> Alt f a -> b # foldl :: (b -> a -> b) -> b -> Alt f a -> b # foldl' :: (b -> a -> b) -> b -> Alt f a -> b # foldr1 :: (a -> a -> a) -> Alt f a -> a # foldl1 :: (a -> a -> a) -> Alt f a -> a # elem :: Eq a => a -> Alt f a -> Bool # maximum :: Ord a => Alt f a -> a # minimum :: Ord a => Alt f a -> a # | |
| Foldable f => Foldable (Rec1 f) | Since: base-4.9.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => Rec1 f m -> m # foldMap :: Monoid m => (a -> m) -> Rec1 f a -> m # foldMap' :: Monoid m => (a -> m) -> Rec1 f a -> m # foldr :: (a -> b -> b) -> b -> Rec1 f a -> b # foldr' :: (a -> b -> b) -> b -> Rec1 f a -> b # foldl :: (b -> a -> b) -> b -> Rec1 f a -> b # foldl' :: (b -> a -> b) -> b -> Rec1 f a -> b # foldr1 :: (a -> a -> a) -> Rec1 f a -> a # foldl1 :: (a -> a -> a) -> Rec1 f a -> a # elem :: Eq a => a -> Rec1 f a -> Bool # maximum :: Ord a => Rec1 f a -> a # minimum :: Ord a => Rec1 f a -> a # | |
| Bifoldable p => Foldable (Fix p) | |
Defined in Data.Bifunctor.Fix Methods fold :: Monoid m => Fix p m -> m # foldMap :: Monoid m => (a -> m) -> Fix p a -> m # foldMap' :: Monoid m => (a -> m) -> Fix p a -> m # foldr :: (a -> b -> b) -> b -> Fix p a -> b # foldr' :: (a -> b -> b) -> b -> Fix p a -> b # foldl :: (b -> a -> b) -> b -> Fix p a -> b # foldl' :: (b -> a -> b) -> b -> Fix p a -> b # foldr1 :: (a -> a -> a) -> Fix p a -> a # foldl1 :: (a -> a -> a) -> Fix p a -> a # elem :: Eq a => a -> Fix p a -> Bool # maximum :: Ord a => Fix p a -> a # minimum :: Ord a => Fix p a -> a # | |
| Bifoldable p => Foldable (Join p) | |
Defined in Data.Bifunctor.Join Methods fold :: Monoid m => Join p m -> m # foldMap :: Monoid m => (a -> m) -> Join p a -> m # foldMap' :: Monoid m => (a -> m) -> Join p a -> m # foldr :: (a -> b -> b) -> b -> Join p a -> b # foldr' :: (a -> b -> b) -> b -> Join p a -> b # foldl :: (b -> a -> b) -> b -> Join p a -> b # foldl' :: (b -> a -> b) -> b -> Join p a -> b # foldr1 :: (a -> a -> a) -> Join p a -> a # foldl1 :: (a -> a -> a) -> Join p a -> a # elem :: Eq a => a -> Join p a -> Bool # maximum :: Ord a => Join p a -> a # minimum :: Ord a => Join p a -> a # | |
| Foldable f => Foldable (CofreeF f a) | |
Defined in Control.Comonad.Trans.Cofree Methods fold :: Monoid m => CofreeF f a m -> m # foldMap :: Monoid m => (a0 -> m) -> CofreeF f a a0 -> m # foldMap' :: Monoid m => (a0 -> m) -> CofreeF f a a0 -> m # foldr :: (a0 -> b -> b) -> b -> CofreeF f a a0 -> b # foldr' :: (a0 -> b -> b) -> b -> CofreeF f a a0 -> b # foldl :: (b -> a0 -> b) -> b -> CofreeF f a a0 -> b # foldl' :: (b -> a0 -> b) -> b -> CofreeF f a a0 -> b # foldr1 :: (a0 -> a0 -> a0) -> CofreeF f a a0 -> a0 # foldl1 :: (a0 -> a0 -> a0) -> CofreeF f a a0 -> a0 # toList :: CofreeF f a a0 -> [a0] # null :: CofreeF f a a0 -> Bool # length :: CofreeF f a a0 -> Int # elem :: Eq a0 => a0 -> CofreeF f a a0 -> Bool # maximum :: Ord a0 => CofreeF f a a0 -> a0 # minimum :: Ord a0 => CofreeF f a a0 -> a0 # | |
| (Foldable f, Foldable w) => Foldable (CofreeT f w) | |
Defined in Control.Comonad.Trans.Cofree Methods fold :: Monoid m => CofreeT f w m -> m # foldMap :: Monoid m => (a -> m) -> CofreeT f w a -> m # foldMap' :: Monoid m => (a -> m) -> CofreeT f w a -> m # foldr :: (a -> b -> b) -> b -> CofreeT f w a -> b # foldr' :: (a -> b -> b) -> b -> CofreeT f w a -> b # foldl :: (b -> a -> b) -> b -> CofreeT f w a -> b # foldl' :: (b -> a -> b) -> b -> CofreeT f w a -> b # foldr1 :: (a -> a -> a) -> CofreeT f w a -> a # foldl1 :: (a -> a -> a) -> CofreeT f w a -> a # toList :: CofreeT f w a -> [a] # null :: CofreeT f w a -> Bool # length :: CofreeT f w a -> Int # elem :: Eq a => a -> CofreeT f w a -> Bool # maximum :: Ord a => CofreeT f w a -> a # minimum :: Ord a => CofreeT f w a -> a # | |
| Foldable f => Foldable (FreeF f a) | |
Defined in Control.Monad.Trans.Free Methods fold :: Monoid m => FreeF f a m -> m # foldMap :: Monoid m => (a0 -> m) -> FreeF f a a0 -> m # foldMap' :: Monoid m => (a0 -> m) -> FreeF f a a0 -> m # foldr :: (a0 -> b -> b) -> b -> FreeF f a a0 -> b # foldr' :: (a0 -> b -> b) -> b -> FreeF f a a0 -> b # foldl :: (b -> a0 -> b) -> b -> FreeF f a a0 -> b # foldl' :: (b -> a0 -> b) -> b -> FreeF f a a0 -> b # foldr1 :: (a0 -> a0 -> a0) -> FreeF f a a0 -> a0 # foldl1 :: (a0 -> a0 -> a0) -> FreeF f a a0 -> a0 # toList :: FreeF f a a0 -> [a0] # null :: FreeF f a a0 -> Bool # length :: FreeF f a a0 -> Int # elem :: Eq a0 => a0 -> FreeF f a a0 -> Bool # maximum :: Ord a0 => FreeF f a a0 -> a0 # minimum :: Ord a0 => FreeF f a a0 -> a0 # | |
| (Foldable m, Foldable f) => Foldable (FreeT f m) | |
Defined in Control.Monad.Trans.Free Methods fold :: Monoid m0 => FreeT f m m0 -> m0 # foldMap :: Monoid m0 => (a -> m0) -> FreeT f m a -> m0 # foldMap' :: Monoid m0 => (a -> m0) -> FreeT f m a -> m0 # foldr :: (a -> b -> b) -> b -> FreeT f m a -> b # foldr' :: (a -> b -> b) -> b -> FreeT f m a -> b # foldl :: (b -> a -> b) -> b -> FreeT f m a -> b # foldl' :: (b -> a -> b) -> b -> FreeT f m a -> b # foldr1 :: (a -> a -> a) -> FreeT f m a -> a # foldl1 :: (a -> a -> a) -> FreeT f m a -> a # toList :: FreeT f m a -> [a] # length :: FreeT f m a -> Int # elem :: Eq a => a -> FreeT f m a -> Bool # maximum :: Ord a => FreeT f m a -> a # minimum :: Ord a => FreeT f m a -> a # | |
| Foldable (Tagged s) | |
Defined in Data.Tagged Methods fold :: Monoid m => Tagged s m -> m # foldMap :: Monoid m => (a -> m) -> Tagged s a -> m # foldMap' :: Monoid m => (a -> m) -> Tagged s a -> m # foldr :: (a -> b -> b) -> b -> Tagged s a -> b # foldr' :: (a -> b -> b) -> b -> Tagged s a -> b # foldl :: (b -> a -> b) -> b -> Tagged s a -> b # foldl' :: (b -> a -> b) -> b -> Tagged s a -> b # foldr1 :: (a -> a -> a) -> Tagged s a -> a # foldl1 :: (a -> a -> a) -> Tagged s a -> a # elem :: Eq a => a -> Tagged s a -> Bool # maximum :: Ord a => Tagged s a -> a # minimum :: Ord a => Tagged s a -> a # | |
| (Foldable f, Foldable g) => Foldable (These1 f g) | |
Defined in Data.Functor.These Methods fold :: Monoid m => These1 f g m -> m # foldMap :: Monoid m => (a -> m) -> These1 f g a -> m # foldMap' :: Monoid m => (a -> m) -> These1 f g a -> m # foldr :: (a -> b -> b) -> b -> These1 f g a -> b # foldr' :: (a -> b -> b) -> b -> These1 f g a -> b # foldl :: (b -> a -> b) -> b -> These1 f g a -> b # foldl' :: (b -> a -> b) -> b -> These1 f g a -> b # foldr1 :: (a -> a -> a) -> These1 f g a -> a # foldl1 :: (a -> a -> a) -> These1 f g a -> a # toList :: These1 f g a -> [a] # null :: These1 f g a -> Bool # length :: These1 f g a -> Int # elem :: Eq a => a -> These1 f g a -> Bool # maximum :: Ord a => These1 f g a -> a # minimum :: Ord a => These1 f g a -> a # | |
| Foldable f => Foldable (Backwards f) | Derived instance. |
Defined in Control.Applicative.Backwards Methods fold :: Monoid m => Backwards f m -> m # foldMap :: Monoid m => (a -> m) -> Backwards f a -> m # foldMap' :: Monoid m => (a -> m) -> Backwards f a -> m # foldr :: (a -> b -> b) -> b -> Backwards f a -> b # foldr' :: (a -> b -> b) -> b -> Backwards f a -> b # foldl :: (b -> a -> b) -> b -> Backwards f a -> b # foldl' :: (b -> a -> b) -> b -> Backwards f a -> b # foldr1 :: (a -> a -> a) -> Backwards f a -> a # foldl1 :: (a -> a -> a) -> Backwards f a -> a # toList :: Backwards f a -> [a] # null :: Backwards f a -> Bool # length :: Backwards f a -> Int # elem :: Eq a => a -> Backwards f a -> Bool # maximum :: Ord a => Backwards f a -> a # minimum :: Ord a => Backwards f a -> a # | |
| Foldable f => Foldable (ExceptT e f) | |
Defined in Control.Monad.Trans.Except Methods fold :: Monoid m => ExceptT e f m -> m # foldMap :: Monoid m => (a -> m) -> ExceptT e f a -> m # foldMap' :: Monoid m => (a -> m) -> ExceptT e f a -> m # foldr :: (a -> b -> b) -> b -> ExceptT e f a -> b # foldr' :: (a -> b -> b) -> b -> ExceptT e f a -> b # foldl :: (b -> a -> b) -> b -> ExceptT e f a -> b # foldl' :: (b -> a -> b) -> b -> ExceptT e f a -> b # foldr1 :: (a -> a -> a) -> ExceptT e f a -> a # foldl1 :: (a -> a -> a) -> ExceptT e f a -> a # toList :: ExceptT e f a -> [a] # null :: ExceptT e f a -> Bool # length :: ExceptT e f a -> Int # elem :: Eq a => a -> ExceptT e f a -> Bool # maximum :: Ord a => ExceptT e f a -> a # minimum :: Ord a => ExceptT e f a -> a # | |
| Foldable f => Foldable (IdentityT f) | |
Defined in Control.Monad.Trans.Identity Methods fold :: Monoid m => IdentityT f m -> m # foldMap :: Monoid m => (a -> m) -> IdentityT f a -> m # foldMap' :: Monoid m => (a -> m) -> IdentityT f a -> m # foldr :: (a -> b -> b) -> b -> IdentityT f a -> b # foldr' :: (a -> b -> b) -> b -> IdentityT f a -> b # foldl :: (b -> a -> b) -> b -> IdentityT f a -> b # foldl' :: (b -> a -> b) -> b -> IdentityT f a -> b # foldr1 :: (a -> a -> a) -> IdentityT f a -> a # foldl1 :: (a -> a -> a) -> IdentityT f a -> a # toList :: IdentityT f a -> [a] # null :: IdentityT f a -> Bool # length :: IdentityT f a -> Int # elem :: Eq a => a -> IdentityT f a -> Bool # maximum :: Ord a => IdentityT f a -> a # minimum :: Ord a => IdentityT f a -> a # | |
| Foldable f => Foldable (WriterT w f) | |
Defined in Control.Monad.Trans.Writer.Lazy Methods fold :: Monoid m => WriterT w f m -> m # foldMap :: Monoid m => (a -> m) -> WriterT w f a -> m # foldMap' :: Monoid m => (a -> m) -> WriterT w f a -> m # foldr :: (a -> b -> b) -> b -> WriterT w f a -> b # foldr' :: (a -> b -> b) -> b -> WriterT w f a -> b # foldl :: (b -> a -> b) -> b -> WriterT w f a -> b # foldl' :: (b -> a -> b) -> b -> WriterT w f a -> b # foldr1 :: (a -> a -> a) -> WriterT w f a -> a # foldl1 :: (a -> a -> a) -> WriterT w f a -> a # toList :: WriterT w f a -> [a] # null :: WriterT w f a -> Bool # length :: WriterT w f a -> Int # elem :: Eq a => a -> WriterT w f a -> Bool # maximum :: Ord a => WriterT w f a -> a # minimum :: Ord a => WriterT w f a -> a # | |
| Foldable f => Foldable (WriterT w f) | |
Defined in Control.Monad.Trans.Writer.Strict Methods fold :: Monoid m => WriterT w f m -> m # foldMap :: Monoid m => (a -> m) -> WriterT w f a -> m # foldMap' :: Monoid m => (a -> m) -> WriterT w f a -> m # foldr :: (a -> b -> b) -> b -> WriterT w f a -> b # foldr' :: (a -> b -> b) -> b -> WriterT w f a -> b # foldl :: (b -> a -> b) -> b -> WriterT w f a -> b # foldl' :: (b -> a -> b) -> b -> WriterT w f a -> b # foldr1 :: (a -> a -> a) -> WriterT w f a -> a # foldl1 :: (a -> a -> a) -> WriterT w f a -> a # toList :: WriterT w f a -> [a] # null :: WriterT w f a -> Bool # length :: WriterT w f a -> Int # elem :: Eq a => a -> WriterT w f a -> Bool # maximum :: Ord a => WriterT w f a -> a # minimum :: Ord a => WriterT w f a -> a # | |
| Foldable (Constant a :: Type -> Type) | |
Defined in Data.Functor.Constant Methods fold :: Monoid m => Constant a m -> m # foldMap :: Monoid m => (a0 -> m) -> Constant a a0 -> m # foldMap' :: Monoid m => (a0 -> m) -> Constant a a0 -> m # foldr :: (a0 -> b -> b) -> b -> Constant a a0 -> b # foldr' :: (a0 -> b -> b) -> b -> Constant a a0 -> b # foldl :: (b -> a0 -> b) -> b -> Constant a a0 -> b # foldl' :: (b -> a0 -> b) -> b -> Constant a a0 -> b # foldr1 :: (a0 -> a0 -> a0) -> Constant a a0 -> a0 # foldl1 :: (a0 -> a0 -> a0) -> Constant a a0 -> a0 # toList :: Constant a a0 -> [a0] # null :: Constant a a0 -> Bool # length :: Constant a a0 -> Int # elem :: Eq a0 => a0 -> Constant a a0 -> Bool # maximum :: Ord a0 => Constant a a0 -> a0 # minimum :: Ord a0 => Constant a a0 -> a0 # | |
| Foldable f => Foldable (Reverse f) | Fold from right to left. |
Defined in Data.Functor.Reverse Methods fold :: Monoid m => Reverse f m -> m # foldMap :: Monoid m => (a -> m) -> Reverse f a -> m # foldMap' :: Monoid m => (a -> m) -> Reverse f a -> m # foldr :: (a -> b -> b) -> b -> Reverse f a -> b # foldr' :: (a -> b -> b) -> b -> Reverse f a -> b # foldl :: (b -> a -> b) -> b -> Reverse f a -> b # foldl' :: (b -> a -> b) -> b -> Reverse f a -> b # foldr1 :: (a -> a -> a) -> Reverse f a -> a # foldl1 :: (a -> a -> a) -> Reverse f a -> a # toList :: Reverse f a -> [a] # length :: Reverse f a -> Int # elem :: Eq a => a -> Reverse f a -> Bool # maximum :: Ord a => Reverse f a -> a # minimum :: Ord a => Reverse f a -> a # | |
| (Foldable f, Foldable g) => Foldable (Product f g) | Since: base-4.9.0.0 |
Defined in Data.Functor.Product Methods fold :: Monoid m => Product f g m -> m # foldMap :: Monoid m => (a -> m) -> Product f g a -> m # foldMap' :: Monoid m => (a -> m) -> Product f g a -> m # foldr :: (a -> b -> b) -> b -> Product f g a -> b # foldr' :: (a -> b -> b) -> b -> Product f g a -> b # foldl :: (b -> a -> b) -> b -> Product f g a -> b # foldl' :: (b -> a -> b) -> b -> Product f g a -> b # foldr1 :: (a -> a -> a) -> Product f g a -> a # foldl1 :: (a -> a -> a) -> Product f g a -> a # toList :: Product f g a -> [a] # null :: Product f g a -> Bool # length :: Product f g a -> Int # elem :: Eq a => a -> Product f g a -> Bool # maximum :: Ord a => Product f g a -> a # minimum :: Ord a => Product f g a -> a # | |
| (Foldable f, Foldable g) => Foldable (Sum f g) | Since: base-4.9.0.0 |
Defined in Data.Functor.Sum Methods fold :: Monoid m => Sum f g m -> m # foldMap :: Monoid m => (a -> m) -> Sum f g a -> m # foldMap' :: Monoid m => (a -> m) -> Sum f g a -> m # foldr :: (a -> b -> b) -> b -> Sum f g a -> b # foldr' :: (a -> b -> b) -> b -> Sum f g a -> b # foldl :: (b -> a -> b) -> b -> Sum f g a -> b # foldl' :: (b -> a -> b) -> b -> Sum f g a -> b # foldr1 :: (a -> a -> a) -> Sum f g a -> a # foldl1 :: (a -> a -> a) -> Sum f g a -> a # elem :: Eq a => a -> Sum f g a -> Bool # maximum :: Ord a => Sum f g a -> a # minimum :: Ord a => Sum f g a -> a # | |
| (Foldable f, Foldable g) => Foldable (f :*: g) | Since: base-4.9.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => (f :*: g) m -> m # foldMap :: Monoid m => (a -> m) -> (f :*: g) a -> m # foldMap' :: Monoid m => (a -> m) -> (f :*: g) a -> m # foldr :: (a -> b -> b) -> b -> (f :*: g) a -> b # foldr' :: (a -> b -> b) -> b -> (f :*: g) a -> b # foldl :: (b -> a -> b) -> b -> (f :*: g) a -> b # foldl' :: (b -> a -> b) -> b -> (f :*: g) a -> b # foldr1 :: (a -> a -> a) -> (f :*: g) a -> a # foldl1 :: (a -> a -> a) -> (f :*: g) a -> a # toList :: (f :*: g) a -> [a] # length :: (f :*: g) a -> Int # elem :: Eq a => a -> (f :*: g) a -> Bool # maximum :: Ord a => (f :*: g) a -> a # minimum :: Ord a => (f :*: g) a -> a # | |
| (Foldable f, Foldable g) => Foldable (f :+: g) | Since: base-4.9.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => (f :+: g) m -> m # foldMap :: Monoid m => (a -> m) -> (f :+: g) a -> m # foldMap' :: Monoid m => (a -> m) -> (f :+: g) a -> m # foldr :: (a -> b -> b) -> b -> (f :+: g) a -> b # foldr' :: (a -> b -> b) -> b -> (f :+: g) a -> b # foldl :: (b -> a -> b) -> b -> (f :+: g) a -> b # foldl' :: (b -> a -> b) -> b -> (f :+: g) a -> b # foldr1 :: (a -> a -> a) -> (f :+: g) a -> a # foldl1 :: (a -> a -> a) -> (f :+: g) a -> a # toList :: (f :+: g) a -> [a] # length :: (f :+: g) a -> Int # elem :: Eq a => a -> (f :+: g) a -> Bool # maximum :: Ord a => (f :+: g) a -> a # minimum :: Ord a => (f :+: g) a -> a # | |
| Foldable (K1 i c :: Type -> Type) | Since: base-4.9.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => K1 i c m -> m # foldMap :: Monoid m => (a -> m) -> K1 i c a -> m # foldMap' :: Monoid m => (a -> m) -> K1 i c a -> m # foldr :: (a -> b -> b) -> b -> K1 i c a -> b # foldr' :: (a -> b -> b) -> b -> K1 i c a -> b # foldl :: (b -> a -> b) -> b -> K1 i c a -> b # foldl' :: (b -> a -> b) -> b -> K1 i c a -> b # foldr1 :: (a -> a -> a) -> K1 i c a -> a # foldl1 :: (a -> a -> a) -> K1 i c a -> a # elem :: Eq a => a -> K1 i c a -> Bool # maximum :: Ord a => K1 i c a -> a # minimum :: Ord a => K1 i c a -> a # | |
| (Foldable f, Foldable g) => Foldable (Compose f g) | Since: base-4.9.0.0 |
Defined in Data.Functor.Compose Methods fold :: Monoid m => Compose f g m -> m # foldMap :: Monoid m => (a -> m) -> Compose f g a -> m # foldMap' :: Monoid m => (a -> m) -> Compose f g a -> m # foldr :: (a -> b -> b) -> b -> Compose f g a -> b # foldr' :: (a -> b -> b) -> b -> Compose f g a -> b # foldl :: (b -> a -> b) -> b -> Compose f g a -> b # foldl' :: (b -> a -> b) -> b -> Compose f g a -> b # foldr1 :: (a -> a -> a) -> Compose f g a -> a # foldl1 :: (a -> a -> a) -> Compose f g a -> a # toList :: Compose f g a -> [a] # null :: Compose f g a -> Bool # length :: Compose f g a -> Int # elem :: Eq a => a -> Compose f g a -> Bool # maximum :: Ord a => Compose f g a -> a # minimum :: Ord a => Compose f g a -> a # | |
| (Foldable f, Foldable g) => Foldable (f :.: g) | Since: base-4.9.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => (f :.: g) m -> m # foldMap :: Monoid m => (a -> m) -> (f :.: g) a -> m # foldMap' :: Monoid m => (a -> m) -> (f :.: g) a -> m # foldr :: (a -> b -> b) -> b -> (f :.: g) a -> b # foldr' :: (a -> b -> b) -> b -> (f :.: g) a -> b # foldl :: (b -> a -> b) -> b -> (f :.: g) a -> b # foldl' :: (b -> a -> b) -> b -> (f :.: g) a -> b # foldr1 :: (a -> a -> a) -> (f :.: g) a -> a # foldl1 :: (a -> a -> a) -> (f :.: g) a -> a # toList :: (f :.: g) a -> [a] # length :: (f :.: g) a -> Int # elem :: Eq a => a -> (f :.: g) a -> Bool # maximum :: Ord a => (f :.: g) a -> a # minimum :: Ord a => (f :.: g) a -> a # | |
| Foldable f => Foldable (M1 i c f) | Since: base-4.9.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => M1 i c f m -> m # foldMap :: Monoid m => (a -> m) -> M1 i c f a -> m # foldMap' :: Monoid m => (a -> m) -> M1 i c f a -> m # foldr :: (a -> b -> b) -> b -> M1 i c f a -> b # foldr' :: (a -> b -> b) -> b -> M1 i c f a -> b # foldl :: (b -> a -> b) -> b -> M1 i c f a -> b # foldl' :: (b -> a -> b) -> b -> M1 i c f a -> b # foldr1 :: (a -> a -> a) -> M1 i c f a -> a # foldl1 :: (a -> a -> a) -> M1 i c f a -> a # elem :: Eq a => a -> M1 i c f a -> Bool # maximum :: Ord a => M1 i c f a -> a # minimum :: Ord a => M1 i c f a -> a # | |
| Foldable (Clown f a :: Type -> Type) | |
Defined in Data.Bifunctor.Clown Methods fold :: Monoid m => Clown f a m -> m # foldMap :: Monoid m => (a0 -> m) -> Clown f a a0 -> m # foldMap' :: Monoid m => (a0 -> m) -> Clown f a a0 -> m # foldr :: (a0 -> b -> b) -> b -> Clown f a a0 -> b # foldr' :: (a0 -> b -> b) -> b -> Clown f a a0 -> b # foldl :: (b -> a0 -> b) -> b -> Clown f a a0 -> b # foldl' :: (b -> a0 -> b) -> b -> Clown f a a0 -> b # foldr1 :: (a0 -> a0 -> a0) -> Clown f a a0 -> a0 # foldl1 :: (a0 -> a0 -> a0) -> Clown f a a0 -> a0 # toList :: Clown f a a0 -> [a0] # null :: Clown f a a0 -> Bool # length :: Clown f a a0 -> Int # elem :: Eq a0 => a0 -> Clown f a a0 -> Bool # maximum :: Ord a0 => Clown f a a0 -> a0 # minimum :: Ord a0 => Clown f a a0 -> a0 # | |
| Bifoldable p => Foldable (Flip p a) | |
Defined in Data.Bifunctor.Flip Methods fold :: Monoid m => Flip p a m -> m # foldMap :: Monoid m => (a0 -> m) -> Flip p a a0 -> m # foldMap' :: Monoid m => (a0 -> m) -> Flip p a a0 -> m # foldr :: (a0 -> b -> b) -> b -> Flip p a a0 -> b # foldr' :: (a0 -> b -> b) -> b -> Flip p a a0 -> b # foldl :: (b -> a0 -> b) -> b -> Flip p a a0 -> b # foldl' :: (b -> a0 -> b) -> b -> Flip p a a0 -> b # foldr1 :: (a0 -> a0 -> a0) -> Flip p a a0 -> a0 # foldl1 :: (a0 -> a0 -> a0) -> Flip p a a0 -> a0 # toList :: Flip p a a0 -> [a0] # length :: Flip p a a0 -> Int # elem :: Eq a0 => a0 -> Flip p a a0 -> Bool # maximum :: Ord a0 => Flip p a a0 -> a0 # minimum :: Ord a0 => Flip p a a0 -> a0 # | |
| Foldable g => Foldable (Joker g a) | |
Defined in Data.Bifunctor.Joker Methods fold :: Monoid m => Joker g a m -> m # foldMap :: Monoid m => (a0 -> m) -> Joker g a a0 -> m # foldMap' :: Monoid m => (a0 -> m) -> Joker g a a0 -> m # foldr :: (a0 -> b -> b) -> b -> Joker g a a0 -> b # foldr' :: (a0 -> b -> b) -> b -> Joker g a a0 -> b # foldl :: (b -> a0 -> b) -> b -> Joker g a a0 -> b # foldl' :: (b -> a0 -> b) -> b -> Joker g a a0 -> b # foldr1 :: (a0 -> a0 -> a0) -> Joker g a a0 -> a0 # foldl1 :: (a0 -> a0 -> a0) -> Joker g a a0 -> a0 # toList :: Joker g a a0 -> [a0] # null :: Joker g a a0 -> Bool # length :: Joker g a a0 -> Int # elem :: Eq a0 => a0 -> Joker g a a0 -> Bool # maximum :: Ord a0 => Joker g a a0 -> a0 # minimum :: Ord a0 => Joker g a a0 -> a0 # | |
| Bifoldable p => Foldable (WrappedBifunctor p a) | |
Defined in Data.Bifunctor.Wrapped Methods fold :: Monoid m => WrappedBifunctor p a m -> m # foldMap :: Monoid m => (a0 -> m) -> WrappedBifunctor p a a0 -> m # foldMap' :: Monoid m => (a0 -> m) -> WrappedBifunctor p a a0 -> m # foldr :: (a0 -> b -> b) -> b -> WrappedBifunctor p a a0 -> b # foldr' :: (a0 -> b -> b) -> b -> WrappedBifunctor p a a0 -> b # foldl :: (b -> a0 -> b) -> b -> WrappedBifunctor p a a0 -> b # foldl' :: (b -> a0 -> b) -> b -> WrappedBifunctor p a a0 -> b # foldr1 :: (a0 -> a0 -> a0) -> WrappedBifunctor p a a0 -> a0 # foldl1 :: (a0 -> a0 -> a0) -> WrappedBifunctor p a a0 -> a0 # toList :: WrappedBifunctor p a a0 -> [a0] # null :: WrappedBifunctor p a a0 -> Bool # length :: WrappedBifunctor p a a0 -> Int # elem :: Eq a0 => a0 -> WrappedBifunctor p a a0 -> Bool # maximum :: Ord a0 => WrappedBifunctor p a a0 -> a0 # minimum :: Ord a0 => WrappedBifunctor p a a0 -> a0 # sum :: Num a0 => WrappedBifunctor p a a0 -> a0 # product :: Num a0 => WrappedBifunctor p a a0 -> a0 # | |
| (Foldable (f a), Foldable (g a)) => Foldable (Product f g a) | |
Defined in Data.Bifunctor.Product Methods fold :: Monoid m => Product f g a m -> m # foldMap :: Monoid m => (a0 -> m) -> Product f g a a0 -> m # foldMap' :: Monoid m => (a0 -> m) -> Product f g a a0 -> m # foldr :: (a0 -> b -> b) -> b -> Product f g a a0 -> b # foldr' :: (a0 -> b -> b) -> b -> Product f g a a0 -> b # foldl :: (b -> a0 -> b) -> b -> Product f g a a0 -> b # foldl' :: (b -> a0 -> b) -> b -> Product f g a a0 -> b # foldr1 :: (a0 -> a0 -> a0) -> Product f g a a0 -> a0 # foldl1 :: (a0 -> a0 -> a0) -> Product f g a a0 -> a0 # toList :: Product f g a a0 -> [a0] # null :: Product f g a a0 -> Bool # length :: Product f g a a0 -> Int # elem :: Eq a0 => a0 -> Product f g a a0 -> Bool # maximum :: Ord a0 => Product f g a a0 -> a0 # minimum :: Ord a0 => Product f g a a0 -> a0 # | |
| (Foldable (f a), Foldable (g a)) => Foldable (Sum f g a) | |
Defined in Data.Bifunctor.Sum Methods fold :: Monoid m => Sum f g a m -> m # foldMap :: Monoid m => (a0 -> m) -> Sum f g a a0 -> m # foldMap' :: Monoid m => (a0 -> m) -> Sum f g a a0 -> m # foldr :: (a0 -> b -> b) -> b -> Sum f g a a0 -> b # foldr' :: (a0 -> b -> b) -> b -> Sum f g a a0 -> b # foldl :: (b -> a0 -> b) -> b -> Sum f g a a0 -> b # foldl' :: (b -> a0 -> b) -> b -> Sum f g a a0 -> b # foldr1 :: (a0 -> a0 -> a0) -> Sum f g a a0 -> a0 # foldl1 :: (a0 -> a0 -> a0) -> Sum f g a a0 -> a0 # toList :: Sum f g a a0 -> [a0] # null :: Sum f g a a0 -> Bool # length :: Sum f g a a0 -> Int # elem :: Eq a0 => a0 -> Sum f g a a0 -> Bool # maximum :: Ord a0 => Sum f g a a0 -> a0 # minimum :: Ord a0 => Sum f g a a0 -> a0 # | |
| (Foldable f, Bifoldable p) => Foldable (Tannen f p a) | |
Defined in Data.Bifunctor.Tannen Methods fold :: Monoid m => Tannen f p a m -> m # foldMap :: Monoid m => (a0 -> m) -> Tannen f p a a0 -> m # foldMap' :: Monoid m => (a0 -> m) -> Tannen f p a a0 -> m # foldr :: (a0 -> b -> b) -> b -> Tannen f p a a0 -> b # foldr' :: (a0 -> b -> b) -> b -> Tannen f p a a0 -> b # foldl :: (b -> a0 -> b) -> b -> Tannen f p a a0 -> b # foldl' :: (b -> a0 -> b) -> b -> Tannen f p a a0 -> b # foldr1 :: (a0 -> a0 -> a0) -> Tannen f p a a0 -> a0 # foldl1 :: (a0 -> a0 -> a0) -> Tannen f p a a0 -> a0 # toList :: Tannen f p a a0 -> [a0] # null :: Tannen f p a a0 -> Bool # length :: Tannen f p a a0 -> Int # elem :: Eq a0 => a0 -> Tannen f p a a0 -> Bool # maximum :: Ord a0 => Tannen f p a a0 -> a0 # minimum :: Ord a0 => Tannen f p a a0 -> a0 # | |
| (Bifoldable p, Foldable g) => Foldable (Biff p f g a) | |
Defined in Data.Bifunctor.Biff Methods fold :: Monoid m => Biff p f g a m -> m # foldMap :: Monoid m => (a0 -> m) -> Biff p f g a a0 -> m # foldMap' :: Monoid m => (a0 -> m) -> Biff p f g a a0 -> m # foldr :: (a0 -> b -> b) -> b -> Biff p f g a a0 -> b # foldr' :: (a0 -> b -> b) -> b -> Biff p f g a a0 -> b # foldl :: (b -> a0 -> b) -> b -> Biff p f g a a0 -> b # foldl' :: (b -> a0 -> b) -> b -> Biff p f g a a0 -> b # foldr1 :: (a0 -> a0 -> a0) -> Biff p f g a a0 -> a0 # foldl1 :: (a0 -> a0 -> a0) -> Biff p f g a a0 -> a0 # toList :: Biff p f g a a0 -> [a0] # null :: Biff p f g a a0 -> Bool # length :: Biff p f g a a0 -> Int # elem :: Eq a0 => a0 -> Biff p f g a a0 -> Bool # maximum :: Ord a0 => Biff p f g a a0 -> a0 # minimum :: Ord a0 => Biff p f g a a0 -> a0 # | |
Byte units.
Since: si-bytes-0.1
Constructors
| B | Bytes Since: si-bytes-0.1 |
Instances
| Bounded Size | Since: si-bytes-0.1 | ||||
| Enum Size | Since: si-bytes-0.1 | ||||
| Generic Size | |||||
Defined in Data.Bytes.Size Associated Types
| |||||
| Show Size | Since: si-bytes-0.1 | ||||
| NFData Size | Since: si-bytes-0.1 | ||||
Defined in Data.Bytes.Size | |||||
| Eq Size | Since: si-bytes-0.1 | ||||
| Ord Size | Since: si-bytes-0.1 | ||||
| Hashable Size | Since: si-bytes-0.1 | ||||
| Parser Size | Since: si-bytes-0.1 | ||||
| TestEquality SSize | Since: si-bytes-0.1 | ||||
Defined in Data.Bytes.Size | |||||
| type Rep Size | Since: si-bytes-0.1 | ||||
Defined in Data.Bytes.Size type Rep Size = D1 ('MetaData "Size" "Data.Bytes.Size" "si-bytes-0.1-d13f5301c58f6493bc77bbec789b3c261bf5d8e740a3eb2c2beea532db7cf08a" 'False) (((C1 ('MetaCons "B" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "K" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "M" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "G" 'PrefixI 'False) (U1 :: Type -> Type))) :+: ((C1 ('MetaCons "T" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "P" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "E" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "Z" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "Y" 'PrefixI 'False) (U1 :: Type -> Type))))) | |||||
Non-empty (and non-strict) list type.
Since: base-4.9.0.0
Constructors
| a :| [a] infixr 5 |
Instances
| MonadFix NonEmpty | Since: base-4.9.0.0 | ||||
Defined in Control.Monad.Fix | |||||
| MonadZip NonEmpty | Since: base-4.9.0.0 | ||||
| Foldable NonEmpty | Since: base-4.9.0.0 | ||||
Defined in Data.Foldable Methods fold :: Monoid m => NonEmpty m -> m # foldMap :: Monoid m => (a -> m) -> NonEmpty a -> m # foldMap' :: Monoid m => (a -> m) -> NonEmpty a -> m # foldr :: (a -> b -> b) -> b -> NonEmpty a -> b # foldr' :: (a -> b -> b) -> b -> NonEmpty a -> b # foldl :: (b -> a -> b) -> b -> NonEmpty a -> b # foldl' :: (b -> a -> b) -> b -> NonEmpty a -> b # foldr1 :: (a -> a -> a) -> NonEmpty a -> a # foldl1 :: (a -> a -> a) -> NonEmpty a -> a # elem :: Eq a => a -> NonEmpty a -> Bool # maximum :: Ord a => NonEmpty a -> a # minimum :: Ord a => NonEmpty a -> a # | |||||
| Foldable1 NonEmpty | Since: base-4.18.0.0 | ||||
Defined in Data.Foldable1 Methods fold1 :: Semigroup m => NonEmpty m -> m # foldMap1 :: Semigroup m => (a -> m) -> NonEmpty a -> m # foldMap1' :: Semigroup m => (a -> m) -> NonEmpty a -> m # toNonEmpty :: NonEmpty a -> NonEmpty a # maximum :: Ord a => NonEmpty a -> a # minimum :: Ord a => NonEmpty a -> a # foldrMap1 :: (a -> b) -> (a -> b -> b) -> NonEmpty a -> b # foldlMap1' :: (a -> b) -> (b -> a -> b) -> NonEmpty a -> b # foldlMap1 :: (a -> b) -> (b -> a -> b) -> NonEmpty a -> b # foldrMap1' :: (a -> b) -> (a -> b -> b) -> NonEmpty a -> b # | |||||
| Eq1 NonEmpty | Since: base-4.10.0.0 | ||||
| Ord1 NonEmpty | Since: base-4.10.0.0 | ||||
Defined in Data.Functor.Classes | |||||
| Read1 NonEmpty | Since: base-4.10.0.0 | ||||
Defined in Data.Functor.Classes | |||||
| Show1 NonEmpty | Since: base-4.10.0.0 | ||||
| Traversable NonEmpty | Since: base-4.9.0.0 | ||||
| Applicative NonEmpty | Since: base-4.9.0.0 | ||||
| Functor NonEmpty | Since: base-4.9.0.0 | ||||
| Monad NonEmpty | Since: base-4.9.0.0 | ||||
| NFData1 NonEmpty | Since: deepseq-1.4.3.0 | ||||
Defined in Control.DeepSeq | |||||
| Hashable1 NonEmpty | Since: hashable-1.3.1.0 | ||||
Defined in Data.Hashable.Class | |||||
| Generic1 NonEmpty | |||||
Defined in GHC.Generics Associated Types
| |||||
| Lift a => Lift (NonEmpty a :: Type) | Since: template-haskell-2.15.0.0 | ||||
| Each Int (NonEmpty a) (NonEmpty b) a b |
| ||||
Defined in Optics.Each.Core | |||||
| Data a => Data (NonEmpty a) | Since: base-4.9.0.0 | ||||
Defined in Data.Data Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> NonEmpty a -> c (NonEmpty a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (NonEmpty a) # toConstr :: NonEmpty a -> Constr # dataTypeOf :: NonEmpty a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (NonEmpty a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (NonEmpty a)) # gmapT :: (forall b. Data b => b -> b) -> NonEmpty a -> NonEmpty a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> NonEmpty a -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> NonEmpty a -> r # gmapQ :: (forall d. Data d => d -> u) -> NonEmpty a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> NonEmpty a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> NonEmpty a -> m (NonEmpty a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> NonEmpty a -> m (NonEmpty a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> NonEmpty a -> m (NonEmpty a) # | |||||
| Semigroup (NonEmpty a) | Since: base-4.9.0.0 | ||||
| Generic (NonEmpty a) | |||||
Defined in GHC.Generics Associated Types
| |||||
| IsList (NonEmpty a) | Since: base-4.9.0.0 | ||||
| Read a => Read (NonEmpty a) | Since: base-4.11.0.0 | ||||
| Show a => Show (NonEmpty a) | Since: base-4.11.0.0 | ||||
| NFData a => NFData (NonEmpty a) | Since: deepseq-1.4.2.0 | ||||
Defined in Control.DeepSeq | |||||
| Eq a => Eq (NonEmpty a) | Since: base-4.9.0.0 | ||||
| Ord a => Ord (NonEmpty a) | Since: base-4.9.0.0 | ||||
| Hashable a => Hashable (NonEmpty a) | |||||
| Ixed (NonEmpty a) | |||||
Defined in Control.Lens.At | |||||
| Wrapped (NonEmpty a) | |||||
| GrowingAppend (NonEmpty a) | |||||
Defined in Data.MonoTraversable | |||||
| MonoFoldable (NonEmpty a) | |||||
Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element (NonEmpty a) -> m) -> NonEmpty a -> m Source # ofoldr :: (Element (NonEmpty a) -> b -> b) -> b -> NonEmpty a -> b Source # ofoldl' :: (a0 -> Element (NonEmpty a) -> a0) -> a0 -> NonEmpty a -> a0 Source # otoList :: NonEmpty a -> [Element (NonEmpty a)] Source # oall :: (Element (NonEmpty a) -> Bool) -> NonEmpty a -> Bool Source # oany :: (Element (NonEmpty a) -> Bool) -> NonEmpty a -> Bool Source # onull :: NonEmpty a -> Bool Source # olength :: NonEmpty a -> Int Source # olength64 :: NonEmpty a -> Int64 Source # ocompareLength :: Integral i => NonEmpty a -> i -> Ordering Source # otraverse_ :: Applicative f => (Element (NonEmpty a) -> f b) -> NonEmpty a -> f () Source # ofor_ :: Applicative f => NonEmpty a -> (Element (NonEmpty a) -> f b) -> f () Source # omapM_ :: Applicative m => (Element (NonEmpty a) -> m ()) -> NonEmpty a -> m () Source # oforM_ :: Applicative m => NonEmpty a -> (Element (NonEmpty a) -> m ()) -> m () Source # ofoldlM :: Monad m => (a0 -> Element (NonEmpty a) -> m a0) -> a0 -> NonEmpty a -> m a0 Source # ofoldMap1Ex :: Semigroup m => (Element (NonEmpty a) -> m) -> NonEmpty a -> m Source # ofoldr1Ex :: (Element (NonEmpty a) -> Element (NonEmpty a) -> Element (NonEmpty a)) -> NonEmpty a -> Element (NonEmpty a) Source # ofoldl1Ex' :: (Element (NonEmpty a) -> Element (NonEmpty a) -> Element (NonEmpty a)) -> NonEmpty a -> Element (NonEmpty a) Source # headEx :: NonEmpty a -> Element (NonEmpty a) Source # lastEx :: NonEmpty a -> Element (NonEmpty a) Source # unsafeHead :: NonEmpty a -> Element (NonEmpty a) Source # unsafeLast :: NonEmpty a -> Element (NonEmpty a) Source # maximumByEx :: (Element (NonEmpty a) -> Element (NonEmpty a) -> Ordering) -> NonEmpty a -> Element (NonEmpty a) Source # minimumByEx :: (Element (NonEmpty a) -> Element (NonEmpty a) -> Ordering) -> NonEmpty a -> Element (NonEmpty a) Source # oelem :: Element (NonEmpty a) -> NonEmpty a -> Bool Source # onotElem :: Element (NonEmpty a) -> NonEmpty a -> Bool Source # | |||||
| MonoFunctor (NonEmpty a) | |||||
| MonoPointed (NonEmpty a) | |||||
| MonoTraversable (NonEmpty a) | |||||
| SemiSequence (NonEmpty a) | |||||
Defined in Data.Sequences Methods intersperse :: Element (NonEmpty a) -> NonEmpty a -> NonEmpty a Source # reverse :: NonEmpty a -> NonEmpty a Source # find :: (Element (NonEmpty a) -> Bool) -> NonEmpty a -> Maybe (Element (NonEmpty a)) Source # sortBy :: (Element (NonEmpty a) -> Element (NonEmpty a) -> Ordering) -> NonEmpty a -> NonEmpty a Source # cons :: Element (NonEmpty a) -> NonEmpty a -> NonEmpty a Source # snoc :: NonEmpty a -> Element (NonEmpty a) -> NonEmpty a Source # | |||||
| Ixed (NonEmpty a) | |||||
| Pretty a => Pretty (NonEmpty a) | |||||
| DecodeTOML a => DecodeTOML (NonEmpty a) | |||||
Defined in TOML.Decode Methods tomlDecoder :: Decoder (NonEmpty a) Source # | |||||
| t ~ NonEmpty b => Rewrapped (NonEmpty a) t | |||||
Defined in Control.Lens.Wrapped | |||||
| type Rep1 NonEmpty | Since: base-4.6.0.0 | ||||
Defined in GHC.Generics type Rep1 NonEmpty = D1 ('MetaData "NonEmpty" "GHC.Base" "base" 'False) (C1 ('MetaCons ":|" ('InfixI 'RightAssociative 5) 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 []))) | |||||
| type Rep (NonEmpty a) | Since: base-4.6.0.0 | ||||
Defined in GHC.Generics type Rep (NonEmpty a) = D1 ('MetaData "NonEmpty" "GHC.Base" "base" 'False) (C1 ('MetaCons ":|" ('InfixI 'RightAssociative 5) 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [a]))) | |||||
| type Item (NonEmpty a) | |||||
Defined in GHC.IsList | |||||
| type Index (NonEmpty a) | |||||
Defined in Control.Lens.At | |||||
| type IxValue (NonEmpty a) | |||||
Defined in Control.Lens.At | |||||
| type Unwrapped (NonEmpty a) | |||||
Defined in Control.Lens.Wrapped | |||||
| type Element (NonEmpty a) | |||||
Defined in Data.MonoTraversable | |||||
| type Index (NonEmpty a) | |||||
Defined in Data.Sequences | |||||
| type Index (NonEmpty a) | |||||
Defined in Optics.At.Core | |||||
| type IxKind (NonEmpty a) | |||||
Defined in Optics.At.Core | |||||
| type IxValue (NonEmpty a) | |||||
Defined in Optics.At.Core | |||||
finally :: (HasCallStack, MonadMask m) => m a -> m b -> m a #
Perform an action with a finalizer action that is run, even if an error occurs.
Representable types of kind *.
This class is derivable in GHC with the DeriveGeneric flag on.
A Generic instance must satisfy the following laws:
from.to≡idto.from≡id
Instances
| Generic Value | |||||
Defined in Data.Aeson.Types.Internal Associated Types
| |||||
| Generic All | |||||
Defined in Data.Semigroup.Internal Associated Types
| |||||
| Generic Any | |||||
Defined in Data.Semigroup.Internal Associated Types
| |||||
| Generic Version | |||||
Defined in Data.Version Associated Types
| |||||
| Generic Void | |||||
| Generic ByteOrder | |||||
Defined in GHC.ByteOrder | |||||
| Generic Fingerprint | |||||
Defined in GHC.Generics Associated Types
| |||||
| Generic Associativity | |||||
Defined in GHC.Generics Associated Types
| |||||
| Generic DecidedStrictness | |||||
Defined in GHC.Generics Associated Types
Methods from :: DecidedStrictness -> Rep DecidedStrictness x # to :: Rep DecidedStrictness x -> DecidedStrictness # | |||||
| Generic Fixity | |||||
Defined in GHC.Generics Associated Types
| |||||
| Generic SourceStrictness | |||||
Defined in GHC.Generics Associated Types
Methods from :: SourceStrictness -> Rep SourceStrictness x # to :: Rep SourceStrictness x -> SourceStrictness # | |||||
| Generic SourceUnpackedness | |||||
Defined in GHC.Generics Associated Types
Methods from :: SourceUnpackedness -> Rep SourceUnpackedness x # to :: Rep SourceUnpackedness x -> SourceUnpackedness # | |||||
| Generic ExitCode | |||||
Defined in GHC.IO.Exception Associated Types
| |||||
| Generic CCFlags | |||||
Defined in GHC.RTS.Flags Associated Types
| |||||
| Generic ConcFlags | |||||
Defined in GHC.RTS.Flags Associated Types
| |||||
| Generic DebugFlags | |||||
Defined in GHC.RTS.Flags Associated Types
| |||||
| Generic DoCostCentres | |||||
Defined in GHC.RTS.Flags Associated Types
| |||||
| Generic DoHeapProfile | |||||
Defined in GHC.RTS.Flags Associated Types
| |||||
| Generic DoTrace | |||||
Defined in GHC.RTS.Flags Associated Types
| |||||
| Generic GCFlags | |||||
Defined in GHC.RTS.Flags Associated Types
| |||||
| Generic GiveGCStats | |||||
Defined in GHC.RTS.Flags Associated Types
| |||||
| Generic MiscFlags | |||||
Defined in GHC.RTS.Flags Associated Types
| |||||
| Generic ParFlags | |||||
Defined in GHC.RTS.Flags Associated Types
| |||||
| Generic ProfFlags | |||||
Defined in GHC.RTS.Flags Associated Types
| |||||
| Generic RTSFlags | |||||
Defined in GHC.RTS.Flags Associated Types
| |||||
| Generic TickyFlags | |||||
Defined in GHC.RTS.Flags Associated Types
| |||||
| Generic TraceFlags | |||||
Defined in GHC.RTS.Flags Associated Types
| |||||
| Generic SrcLoc | |||||
Defined in GHC.Generics Associated Types
| |||||
| Generic GCDetails | |||||
Defined in GHC.Stats Associated Types
| |||||
| Generic RTSStats | |||||
Defined in GHC.Stats Associated Types
| |||||
| Generic GeneralCategory | |||||
Defined in GHC.Generics Associated Types
Methods from :: GeneralCategory -> Rep GeneralCategory x # to :: Rep GeneralCategory x -> GeneralCategory # | |||||
| Generic ShortByteString | |||||
Defined in Data.ByteString.Short.Internal Associated Types
Methods from :: ShortByteString -> Rep ShortByteString x # to :: Rep ShortByteString x -> ShortByteString # | |||||
| Generic Type | |||||
Defined in DBus.Internal.Types Associated Types
| |||||
| Generic CopyDirConfig | |||||
Defined in Effects.FileSystem.PathWriter Associated Types
| |||||
| Generic Overwrite | |||||
Defined in Effects.FileSystem.PathWriter Associated Types
| |||||
| Generic TargetName | |||||
Defined in Effects.FileSystem.PathWriter Associated Types
| |||||
| Generic TimeSpec | |||||
Defined in Effects.Time Associated Types
| |||||
| Generic PathType | |||||
Defined in Effects.System.PosixCompat Associated Types
| |||||
| Generic OsChar | |||||
Defined in System.OsString.Internal.Types.Hidden Associated Types
| |||||
| Generic OsString | |||||
Defined in System.OsString.Internal.Types.Hidden Associated Types
| |||||
| Generic PosixChar | |||||
Defined in System.OsString.Internal.Types.Hidden Associated Types
| |||||
| Generic PosixString | |||||
Defined in System.OsString.Internal.Types.Hidden Associated Types
| |||||
| Generic WindowsChar | |||||
Defined in System.OsString.Internal.Types.Hidden Associated Types
| |||||
| Generic WindowsString | |||||
Defined in System.OsString.Internal.Types.Hidden Associated Types
| |||||
| Generic ForeignSrcLang | |||||
Defined in GHC.ForeignSrcLang.Type Associated Types
Methods from :: ForeignSrcLang -> Rep ForeignSrcLang x # to :: Rep ForeignSrcLang x -> ForeignSrcLang # | |||||
| Generic Extension | |||||
Defined in GHC.LanguageExtensions.Type Associated Types
| |||||
| Generic Ordering | |||||
Defined in GHC.Generics | |||||
| Generic InvalidPosException | |||||
Defined in Text.Megaparsec.Pos Associated Types
Methods from :: InvalidPosException -> Rep InvalidPosException x # to :: Rep InvalidPosException x -> InvalidPosException # | |||||
| Generic Pos | |||||
Defined in Text.Megaparsec.Pos Associated Types
| |||||
| Generic SourcePos | |||||
Defined in Text.Megaparsec.Pos Associated Types
| |||||
| Generic URI | |||||
Defined in Network.URI Associated Types
| |||||
| Generic URIAuth | |||||
Defined in Network.URI Associated Types
| |||||
| Generic OsChar | |||||
Defined in System.OsString.Internal.Types Associated Types
| |||||
| Generic OsString | |||||
Defined in System.OsString.Internal.Types Associated Types
| |||||
| Generic PosixChar | |||||
Defined in System.OsString.Internal.Types Associated Types
| |||||
| Generic PosixString | |||||
Defined in System.OsString.Internal.Types Associated Types
| |||||
| Generic WindowsChar | |||||
Defined in System.OsString.Internal.Types Associated Types
| |||||
| Generic WindowsString | |||||
Defined in System.OsString.Internal.Types Associated Types
| |||||
| Generic Mode | |||||
Defined in Text.PrettyPrint.Annotated.HughesPJ Associated Types
| |||||
| Generic Style | |||||
Defined in Text.PrettyPrint.Annotated.HughesPJ Associated Types
| |||||
| Generic TextDetails | |||||
Defined in Text.PrettyPrint.Annotated.HughesPJ Associated Types
| |||||
| Generic Doc | |||||
Defined in Text.PrettyPrint.HughesPJ Associated Types
| |||||
| Generic RelativeTime | |||||
Defined in Data.Time.Relative Associated Types
| |||||
| Generic Direction | |||||
Defined in Data.Bytes.Network.Direction Associated Types
| |||||
| Generic Size | |||||
Defined in Data.Bytes.Size Associated Types
| |||||
| Generic AnnLookup | |||||
Defined in Language.Haskell.TH.Syntax Associated Types
| |||||
| Generic AnnTarget | |||||
Defined in Language.Haskell.TH.Syntax Associated Types
| |||||
| Generic Bang | |||||
Defined in Language.Haskell.TH.Syntax Associated Types
| |||||
| Generic BndrVis | |||||
Defined in Language.Haskell.TH.Syntax | |||||
| Generic Body | |||||
Defined in Language.Haskell.TH.Syntax Associated Types
| |||||
| Generic Bytes | |||||
Defined in Language.Haskell.TH.Syntax Associated Types
| |||||
| Generic Callconv | |||||
Defined in Language.Haskell.TH.Syntax Associated Types
| |||||
| Generic Clause | |||||
Defined in Language.Haskell.TH.Syntax Associated Types
| |||||
| Generic Con | |||||
Defined in Language.Haskell.TH.Syntax Associated Types
| |||||
| Generic Dec | |||||
Defined in Language.Haskell.TH.Syntax Associated Types
| |||||
| Generic DecidedStrictness | |||||
Defined in Language.Haskell.TH.Syntax Associated Types
Methods from :: DecidedStrictness -> Rep DecidedStrictness x # to :: Rep DecidedStrictness x -> DecidedStrictness # | |||||
| Generic DerivClause | |||||
Defined in Language.Haskell.TH.Syntax Associated Types
| |||||
| Generic DerivStrategy | |||||
Defined in Language.Haskell.TH.Syntax Associated Types
| |||||
| Generic DocLoc | |||||
Defined in Language.Haskell.TH.Syntax Associated Types
| |||||
| Generic Exp | |||||
Defined in Language.Haskell.TH.Syntax Associated Types
| |||||
| Generic FamilyResultSig | |||||
Defined in Language.Haskell.TH.Syntax Associated Types
Methods from :: FamilyResultSig -> Rep FamilyResultSig x # to :: Rep FamilyResultSig x -> FamilyResultSig # | |||||
| Generic Fixity | |||||
Defined in Language.Haskell.TH.Syntax Associated Types
| |||||
| Generic FixityDirection | |||||
Defined in Language.Haskell.TH.Syntax Associated Types
Methods from :: FixityDirection -> Rep FixityDirection x # to :: Rep FixityDirection x -> FixityDirection # | |||||
| Generic Foreign | |||||
Defined in Language.Haskell.TH.Syntax Associated Types
| |||||
| Generic FunDep | |||||
Defined in Language.Haskell.TH.Syntax Associated Types
| |||||
| Generic Guard | |||||
Defined in Language.Haskell.TH.Syntax Associated Types
| |||||
| Generic Info | |||||
Defined in Language.Haskell.TH.Syntax Associated Types
| |||||
| Generic InjectivityAnn | |||||
Defined in Language.Haskell.TH.Syntax Associated Types
Methods from :: InjectivityAnn -> Rep InjectivityAnn x # to :: Rep InjectivityAnn x -> InjectivityAnn # | |||||
| Generic Inline | |||||
Defined in Language.Haskell.TH.Syntax Associated Types
| |||||
| Generic Lit | |||||
Defined in Language.Haskell.TH.Syntax Associated Types
| |||||
| Generic Loc | |||||
Defined in Language.Haskell.TH.Syntax Associated Types
| |||||
| Generic Match | |||||
Defined in Language.Haskell.TH.Syntax Associated Types
| |||||
| Generic ModName | |||||
Defined in Language.Haskell.TH.Syntax Associated Types
| |||||
| Generic Module | |||||
Defined in Language.Haskell.TH.Syntax Associated Types
| |||||
| Generic ModuleInfo | |||||
Defined in Language.Haskell.TH.Syntax Associated Types
| |||||
| Generic Name | |||||
Defined in Language.Haskell.TH.Syntax Associated Types
| |||||
| Generic NameFlavour | |||||
Defined in Language.Haskell.TH.Syntax Associated Types
| |||||
| Generic NameSpace | |||||
Defined in Language.Haskell.TH.Syntax Associated Types
| |||||
| Generic OccName | |||||
Defined in Language.Haskell.TH.Syntax Associated Types
| |||||
| Generic Overlap | |||||
Defined in Language.Haskell.TH.Syntax Associated Types
| |||||
| Generic Pat | |||||
Defined in Language.Haskell.TH.Syntax Associated Types
| |||||
| Generic PatSynArgs | |||||
Defined in Language.Haskell.TH.Syntax Associated Types
| |||||
| Generic PatSynDir | |||||
Defined in Language.Haskell.TH.Syntax Associated Types
| |||||
| Generic Phases | |||||
Defined in Language.Haskell.TH.Syntax Associated Types
| |||||
| Generic PkgName | |||||
Defined in Language.Haskell.TH.Syntax Associated Types
| |||||
| Generic Pragma | |||||
Defined in Language.Haskell.TH.Syntax Associated Types
| |||||
| Generic Range | |||||
Defined in Language.Haskell.TH.Syntax Associated Types
| |||||
| Generic Role | |||||
Defined in Language.Haskell.TH.Syntax Associated Types
| |||||
| Generic RuleBndr | |||||
Defined in Language.Haskell.TH.Syntax Associated Types
| |||||
| Generic RuleMatch | |||||
Defined in Language.Haskell.TH.Syntax | |||||
| Generic Safety | |||||
Defined in Language.Haskell.TH.Syntax Associated Types
| |||||
| Generic SourceStrictness | |||||
Defined in Language.Haskell.TH.Syntax Associated Types
Methods from :: SourceStrictness -> Rep SourceStrictness x # to :: Rep SourceStrictness x -> SourceStrictness # | |||||
| Generic SourceUnpackedness | |||||
Defined in Language.Haskell.TH.Syntax Associated Types
Methods from :: SourceUnpackedness -> Rep SourceUnpackedness x # to :: Rep SourceUnpackedness x -> SourceUnpackedness # | |||||
| Generic Specificity | |||||
Defined in Language.Haskell.TH.Syntax Associated Types
| |||||
| Generic Stmt | |||||
Defined in Language.Haskell.TH.Syntax Associated Types
| |||||
| Generic TyLit | |||||
Defined in Language.Haskell.TH.Syntax Associated Types
| |||||
| Generic TySynEqn | |||||
Defined in Language.Haskell.TH.Syntax Associated Types
| |||||
| Generic Type | |||||
Defined in Language.Haskell.TH.Syntax Associated Types
| |||||
| Generic TypeFamilyHead | |||||
Defined in Language.Haskell.TH.Syntax Associated Types
Methods from :: TypeFamilyHead -> Rep TypeFamilyHead x # to :: Rep TypeFamilyHead x -> TypeFamilyHead # | |||||
| Generic ConstructorInfo | |||||
Defined in Language.Haskell.TH.Datatype Associated Types
Methods from :: ConstructorInfo -> Rep ConstructorInfo x # to :: Rep ConstructorInfo x -> ConstructorInfo # | |||||
| Generic ConstructorVariant | |||||
Defined in Language.Haskell.TH.Datatype Associated Types
Methods from :: ConstructorVariant -> Rep ConstructorVariant x # to :: Rep ConstructorVariant x -> ConstructorVariant # | |||||
| Generic DatatypeInfo | |||||
Defined in Language.Haskell.TH.Datatype Associated Types
| |||||
| Generic DatatypeVariant | |||||
Defined in Language.Haskell.TH.Datatype Associated Types
Methods from :: DatatypeVariant -> Rep DatatypeVariant x # to :: Rep DatatypeVariant x -> DatatypeVariant # | |||||
| Generic FieldStrictness | |||||
Defined in Language.Haskell.TH.Datatype Associated Types
Methods from :: FieldStrictness -> Rep FieldStrictness x # to :: Rep FieldStrictness x -> FieldStrictness # | |||||
| Generic Strictness | |||||
Defined in Language.Haskell.TH.Datatype Associated Types
| |||||
| Generic Unpackedness | |||||
Defined in Language.Haskell.TH.Datatype Associated Types
| |||||
| Generic ConcException | |||||
Defined in UnliftIO.Internals.Async Associated Types
| |||||
| Generic Content | |||||
Defined in Data.XML.Types Associated Types
| |||||
| Generic Doctype | |||||
Defined in Data.XML.Types Associated Types
| |||||
| Generic Document | |||||
Defined in Data.XML.Types Associated Types
| |||||
| Generic Element | |||||
Defined in Data.XML.Types Associated Types
| |||||
| Generic Event | |||||
Defined in Data.XML.Types Associated Types
| |||||
| Generic ExternalID | |||||
Defined in Data.XML.Types Associated Types
| |||||
| Generic Instruction | |||||
Defined in Data.XML.Types Associated Types
| |||||
| Generic Miscellaneous | |||||
Defined in Data.XML.Types Associated Types
| |||||
| Generic Name | |||||
Defined in Data.XML.Types Associated Types
| |||||
| Generic Node | |||||
Defined in Data.XML.Types Associated Types
| |||||
| Generic Prologue | |||||
Defined in Data.XML.Types Associated Types
| |||||
| Generic () | |||||
| Generic Bool | |||||
Defined in GHC.Generics | |||||
| Generic (ZipList a) | |||||
Defined in Control.Applicative Associated Types
| |||||
| Generic (Complex a) | |||||
Defined in Data.Complex Associated Types
| |||||
| Generic (Identity a) | |||||
Defined in Data.Functor.Identity Associated Types
| |||||
| Generic (First a) | |||||
Defined in Data.Monoid Associated Types
| |||||
| Generic (Last a) | |||||
Defined in Data.Monoid Associated Types
| |||||
| Generic (Down a) | |||||
Defined in GHC.Generics Associated Types
| |||||
| Generic (First a) | |||||
Defined in Data.Semigroup Associated Types
| |||||
| Generic (Last a) | |||||
Defined in Data.Semigroup Associated Types
| |||||
| Generic (Max a) | |||||
Defined in Data.Semigroup Associated Types
| |||||
| Generic (Min a) | |||||
Defined in Data.Semigroup Associated Types
| |||||
| Generic (WrappedMonoid m) | |||||
Defined in Data.Semigroup Associated Types
Methods from :: WrappedMonoid m -> Rep (WrappedMonoid m) x # to :: Rep (WrappedMonoid m) x -> WrappedMonoid m # | |||||
| Generic (Dual a) | |||||
Defined in Data.Semigroup.Internal Associated Types
| |||||
| Generic (Endo a) | |||||
Defined in Data.Semigroup.Internal Associated Types
| |||||
| Generic (Product a) | |||||
Defined in Data.Semigroup.Internal Associated Types
| |||||
| Generic (Sum a) | |||||
Defined in Data.Semigroup.Internal Associated Types
| |||||
| Generic (NonEmpty a) | |||||
Defined in GHC.Generics Associated Types
| |||||
| Generic (Par1 p) | |||||
Defined in GHC.Generics Associated Types
| |||||
| Generic (SCC vertex) | |||||
Defined in Data.Graph Associated Types
| |||||
| Generic (Digit a) | |||||
Defined in Data.Sequence.Internal Associated Types
| |||||
| Generic (Elem a) | |||||
Defined in Data.Sequence.Internal Associated Types
| |||||
| Generic (FingerTree a) | |||||
Defined in Data.Sequence.Internal Associated Types
| |||||
| Generic (Node a) | |||||
Defined in Data.Sequence.Internal Associated Types
| |||||
| Generic (ViewL a) | |||||
Defined in Data.Sequence.Internal Associated Types
| |||||
| Generic (ViewR a) | |||||
Defined in Data.Sequence.Internal Associated Types
| |||||
| Generic (Tree a) | |||||
Defined in Data.Tree Associated Types
| |||||
| Generic (Fix f) | |||||
| Generic (ExceptionCS e) | |||||
Defined in Effects.Exception.Annotation.CallStack.Legacy Associated Types
Methods from :: ExceptionCS e -> Rep (ExceptionCS e) x # to :: Rep (ExceptionCS e) x -> ExceptionCS e # | |||||
| Generic (ErrorFancy e) | |||||
Defined in Text.Megaparsec.Error Associated Types
| |||||
| Generic (ErrorItem t) | |||||
Defined in Text.Megaparsec.Error Associated Types
| |||||
| Generic (PosState s) | |||||
Defined in Text.Megaparsec.State Associated Types
| |||||
| Generic (Doc a) | |||||
Defined in Text.PrettyPrint.Annotated.HughesPJ Associated Types
| |||||
| Generic (Doc ann) | |||||
Defined in Prettyprinter.Internal Associated Types
| |||||
| Generic (SimpleDocStream ann) | |||||
Defined in Prettyprinter.Internal Associated Types
Methods from :: SimpleDocStream ann -> Rep (SimpleDocStream ann) x # to :: Rep (SimpleDocStream ann) x -> SimpleDocStream ann # | |||||
| Generic (CommandP p) Source # | |||||
Defined in Shrun.Data.Command Associated Types
| |||||
| Generic (NonZero a) | |||||
Defined in Numeric.Data.NonZero.Internal Associated Types
| |||||
| Generic (Positive a) | |||||
Defined in Numeric.Data.Positive.Internal Associated Types
| |||||
| Generic (Maybe a) | |||||
Defined in Data.Strict.Maybe Associated Types
| |||||
| Generic (TyVarBndr flag) | |||||
Defined in Language.Haskell.TH.Syntax Associated Types
| |||||
| Generic (Window a) | |||||
Defined in System.Console.Terminal.Common Associated Types
| |||||
| Generic a => Generic (RecordInstance a) | |||||
Defined in Data.Text.Display.Generic Associated Types
Methods from :: RecordInstance a -> Rep (RecordInstance a) x # to :: Rep (RecordInstance a) x -> RecordInstance a # | |||||
| Generic (Maybe a) | |||||
Defined in GHC.Generics Associated Types
| |||||
| Generic (Solo a) | |||||
Defined in GHC.Generics Associated Types
| |||||
| Generic [a] | |||||
Defined in GHC.Generics Associated Types
| |||||
| Generic (WrappedMonad m a) | |||||
Defined in Control.Applicative Associated Types
Methods from :: WrappedMonad m a -> Rep (WrappedMonad m a) x # to :: Rep (WrappedMonad m a) x -> WrappedMonad m a # | |||||
| Generic (Either a b) | |||||
Defined in GHC.Generics Associated Types
| |||||
| Generic (Proxy t) | |||||
Defined in GHC.Generics | |||||
| Generic (Arg a b) | |||||
Defined in Data.Semigroup Associated Types
| |||||
| Generic (U1 p) | |||||
| Generic (V1 p) | |||||
| Generic (Cofree f a) | |||||
Defined in Control.Comonad.Cofree Associated Types
| |||||
| Generic (Free f a) | |||||
Defined in Control.Monad.Free Associated Types
| |||||
| Generic (ParseError s e) | |||||
Defined in Text.Megaparsec.Error Associated Types
Methods from :: ParseError s e -> Rep (ParseError s e) x # to :: Rep (ParseError s e) x -> ParseError s e # | |||||
| Generic (ParseErrorBundle s e) | |||||
Defined in Text.Megaparsec.Error Associated Types
Methods from :: ParseErrorBundle s e -> Rep (ParseErrorBundle s e) x # to :: Rep (ParseErrorBundle s e) x -> ParseErrorBundle s e # | |||||
| Generic (State s e) | |||||
Defined in Text.Megaparsec.State Associated Types
| |||||
| Generic (Bytes s n) | |||||
Defined in Data.Bytes.Internal Associated Types
| |||||
| Generic (Either a b) | |||||
Defined in Data.Strict.Either Associated Types
| |||||
| Generic (These a b) | |||||
Defined in Data.Strict.These Associated Types
| |||||
| Generic (Pair a b) | |||||
Defined in Data.Strict.Tuple Associated Types
| |||||
| Generic (These a b) | |||||
Defined in Data.These Associated Types
| |||||
| Generic (Lift f a) | |||||
Defined in Control.Applicative.Lift Associated Types
| |||||
| Generic (MaybeT m a) | |||||
Defined in Control.Monad.Trans.Maybe Associated Types
| |||||
| Generic (a, b) | |||||
Defined in GHC.Generics Associated Types
| |||||
| Generic (WrappedArrow a b c) | |||||
Defined in Control.Applicative Associated Types
Methods from :: WrappedArrow a b c -> Rep (WrappedArrow a b c) x # to :: Rep (WrappedArrow a b c) x -> WrappedArrow a b c # | |||||
| Generic (Kleisli m a b) | |||||
Defined in Control.Arrow Associated Types
| |||||
| Generic (Const a b) | |||||
Defined in Data.Functor.Const Associated Types
| |||||
| Generic (Ap f a) | |||||
Defined in Data.Monoid Associated Types
| |||||
| Generic (Alt f a) | |||||
Defined in Data.Semigroup.Internal Associated Types
| |||||
| Generic (Rec1 f p) | |||||
Defined in GHC.Generics Associated Types
| |||||
| Generic (URec (Ptr ()) p) | |||||
Defined in GHC.Generics Associated Types
| |||||
| Generic (URec Char p) | |||||
Defined in GHC.Generics Associated Types
| |||||
| Generic (URec Double p) | |||||
Defined in GHC.Generics Associated Types
| |||||
| Generic (URec Float p) | |||||
Defined in GHC.Generics Associated Types
| |||||
| Generic (URec Int p) | |||||
Defined in GHC.Generics Associated Types
| |||||
| Generic (URec Word p) | |||||
Defined in GHC.Generics Associated Types
| |||||
| Generic (Fix p a) | |||||
Defined in Data.Bifunctor.Fix Associated Types
| |||||
| Generic (Join p a) | |||||
Defined in Data.Bifunctor.Join Associated Types
| |||||
| Generic (CofreeF f a b) | |||||
Defined in Control.Comonad.Trans.Cofree Associated Types
| |||||
| Generic (FreeF f a b) | |||||
Defined in Control.Monad.Trans.Free Associated Types
| |||||
| Generic (NetBytes d s n) | |||||
Defined in Data.Bytes.Network.Internal Associated Types
| |||||
| Generic (Tagged s b) | |||||
Defined in Data.Tagged Associated Types
| |||||
| Generic (These1 f g a) | |||||
Defined in Data.Functor.These Associated Types
| |||||
| Generic (Backwards f a) | |||||
Defined in Control.Applicative.Backwards Associated Types
| |||||
| Generic (AccumT w m a) | |||||
Defined in Control.Monad.Trans.Accum Associated Types
| |||||
| Generic (ExceptT e m a) | |||||
Defined in Control.Monad.Trans.Except Associated Types
| |||||
| Generic (IdentityT f a) | |||||
Defined in Control.Monad.Trans.Identity Associated Types
| |||||
| Generic (ReaderT r m a) | |||||
Defined in Control.Monad.Trans.Reader Associated Types
| |||||
| Generic (SelectT r m a) | |||||
Defined in Control.Monad.Trans.Select Associated Types
| |||||
| Generic (StateT s m a) | |||||
Defined in Control.Monad.Trans.State.Lazy Associated Types
| |||||
| Generic (StateT s m a) | |||||
Defined in Control.Monad.Trans.State.Strict Associated Types
| |||||
| Generic (WriterT w m a) | |||||
Defined in Control.Monad.Trans.Writer.CPS Associated Types
| |||||
| Generic (WriterT w m a) | |||||
Defined in Control.Monad.Trans.Writer.Lazy Associated Types
| |||||
| Generic (WriterT w m a) | |||||
Defined in Control.Monad.Trans.Writer.Strict Associated Types
| |||||
| Generic (Constant a b) | |||||
Defined in Data.Functor.Constant Associated Types
| |||||
| Generic (Reverse f a) | |||||
Defined in Data.Functor.Reverse Associated Types
| |||||
| Generic (a, b, c) | |||||
Defined in GHC.Generics Associated Types
| |||||
| Generic (Product f g a) | |||||
Defined in Data.Functor.Product Associated Types
| |||||
| Generic (Sum f g a) | |||||
Defined in Data.Functor.Sum Associated Types
| |||||
| Generic ((f :*: g) p) | |||||
Defined in GHC.Generics Associated Types
| |||||
| Generic ((f :+: g) p) | |||||
Defined in GHC.Generics Associated Types
| |||||
| Generic (K1 i c p) | |||||
Defined in GHC.Generics Associated Types
| |||||
| Generic (ContT r m a) | |||||
Defined in Control.Monad.Trans.Cont Associated Types
| |||||
| Generic (a, b, c, d) | |||||
Defined in GHC.Generics Associated Types
| |||||
| Generic (Compose f g a) | |||||
Defined in Data.Functor.Compose Associated Types
| |||||
| Generic ((f :.: g) p) | |||||
Defined in GHC.Generics Associated Types
| |||||
| Generic (M1 i c f p) | |||||
Defined in GHC.Generics Associated Types
| |||||
| Generic (Clown f a b) | |||||
Defined in Data.Bifunctor.Clown Associated Types
| |||||
| Generic (Flip p a b) | |||||
Defined in Data.Bifunctor.Flip Associated Types
| |||||
| Generic (Joker g a b) | |||||
Defined in Data.Bifunctor.Joker Associated Types
| |||||
| Generic (WrappedBifunctor p a b) | |||||
Defined in Data.Bifunctor.Wrapped Associated Types
Methods from :: WrappedBifunctor p a b -> Rep (WrappedBifunctor p a b) x # to :: Rep (WrappedBifunctor p a b) x -> WrappedBifunctor p a b # | |||||
| Generic (RWST r w s m a) | |||||
Defined in Control.Monad.Trans.RWS.CPS Associated Types
| |||||
| Generic (RWST r w s m a) | |||||
Defined in Control.Monad.Trans.RWS.Lazy Associated Types
| |||||
| Generic (RWST r w s m a) | |||||
Defined in Control.Monad.Trans.RWS.Strict Associated Types
| |||||
| Generic (a, b, c, d, e) | |||||
Defined in GHC.Generics Associated Types
| |||||
| Generic (Product f g a b) | |||||
Defined in Data.Bifunctor.Product Associated Types
| |||||
| Generic (Sum p q a b) | |||||
Defined in Data.Bifunctor.Sum Associated Types
| |||||
| Generic (a, b, c, d, e, f) | |||||
Defined in GHC.Generics Associated Types
| |||||
| Generic (Tannen f p a b) | |||||
Defined in Data.Bifunctor.Tannen Associated Types
| |||||
| Generic (a, b, c, d, e, f, g) | |||||
Defined in GHC.Generics Associated Types
| |||||
| Generic (a, b, c, d, e, f, g, h) | |||||
Defined in GHC.Generics Associated Types
| |||||
| Generic (Biff p f g a b) | |||||
Defined in Data.Bifunctor.Biff Associated Types
| |||||
| Generic (a, b, c, d, e, f, g, h, i) | |||||
Defined in GHC.Generics Associated Types
| |||||
| Generic (a, b, c, d, e, f, g, h, i, j) | |||||
Defined in GHC.Generics Associated Types
| |||||
| Generic (a, b, c, d, e, f, g, h, i, j, k) | |||||
Defined in GHC.Generics Associated Types
| |||||
| Generic (a, b, c, d, e, f, g, h, i, j, k, l) | |||||
Defined in GHC.Generics Associated Types
| |||||
| Generic (a, b, c, d, e, f, g, h, i, j, k, l, m) | |||||
Defined in GHC.Generics Associated Types
| |||||
| Generic (a, b, c, d, e, f, g, h, i, j, k, l, m, n) | |||||
Defined in GHC.Generics Associated Types
| |||||
| Generic (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) | |||||
Defined in GHC.Generics Associated Types
| |||||
Conversion of values to readable Strings.
Derived instances of Show have the following properties, which
are compatible with derived instances of Read:
- The result of
showis a syntactically correct Haskell expression containing only constants, given the fixity declarations in force at the point where the type is declared. It contains only the constructor names defined in the data type, parentheses, and spaces. When labelled constructor fields are used, braces, commas, field names, and equal signs are also used. - If the constructor is defined to be an infix operator, then
showsPrecwill produce infix applications of the constructor. - the representation will be enclosed in parentheses if the
precedence of the top-level constructor in
xis less thand(associativity is ignored). Thus, ifdis0then the result is never surrounded in parentheses; ifdis11it is always surrounded in parentheses, unless it is an atomic expression. - If the constructor is defined using record syntax, then
showwill produce the record-syntax form, with the fields given in the same order as the original declaration.
For example, given the declarations
infixr 5 :^: data Tree a = Leaf a | Tree a :^: Tree a
the derived instance of Show is equivalent to
instance (Show a) => Show (Tree a) where
showsPrec d (Leaf m) = showParen (d > app_prec) $
showString "Leaf " . showsPrec (app_prec+1) m
where app_prec = 10
showsPrec d (u :^: v) = showParen (d > up_prec) $
showsPrec (up_prec+1) u .
showString " :^: " .
showsPrec (up_prec+1) v
where up_prec = 5Note that right-associativity of :^: is ignored. For example,
show(Leaf 1 :^: Leaf 2 :^: Leaf 3)"Leaf 1 :^: (Leaf 2 :^: Leaf 3)".
Methods
Arguments
| :: Int | the operator precedence of the enclosing
context (a number from |
| -> a | the value to be converted to a |
| -> ShowS |
Instances
| Show AesonException | |
Defined in Data.Aeson.Types.Internal Methods showsPrec :: Int -> AesonException -> ShowS # show :: AesonException -> String # showList :: [AesonException] -> ShowS # | |
| Show DotNetTime | |
Defined in Data.Aeson.Types.Internal Methods showsPrec :: Int -> DotNetTime -> ShowS # show :: DotNetTime -> String # showList :: [DotNetTime] -> ShowS # | |
| Show JSONPathElement | |
Defined in Data.Aeson.Types.Internal Methods showsPrec :: Int -> JSONPathElement -> ShowS # show :: JSONPathElement -> String # showList :: [JSONPathElement] -> ShowS # | |
| Show Options | |
| Show SumEncoding | |
Defined in Data.Aeson.Types.Internal Methods showsPrec :: Int -> SumEncoding -> ShowS # show :: SumEncoding -> String # showList :: [SumEncoding] -> ShowS # | |
| Show Value | Since version 1.5.6.0 version object values are printed in lexicographic key order
|
| Show AsyncCancelled | |
Defined in Control.Concurrent.Async.Internal Methods showsPrec :: Int -> AsyncCancelled -> ShowS # show :: AsyncCancelled -> String # showList :: [AsyncCancelled] -> ShowS # | |
| Show ExceptionInLinkedThread | |
Defined in Control.Concurrent.Async.Internal Methods showsPrec :: Int -> ExceptionInLinkedThread -> ShowS # show :: ExceptionInLinkedThread -> String # showList :: [ExceptionInLinkedThread] -> ShowS # | |
| Show NestedAtomically | Since: base-4.0 |
Defined in Control.Exception.Base Methods showsPrec :: Int -> NestedAtomically -> ShowS # show :: NestedAtomically -> String # showList :: [NestedAtomically] -> ShowS # | |
| Show NoMatchingContinuationPrompt | Since: base-4.18 |
Defined in Control.Exception.Base Methods showsPrec :: Int -> NoMatchingContinuationPrompt -> ShowS # show :: NoMatchingContinuationPrompt -> String # showList :: [NoMatchingContinuationPrompt] -> ShowS # | |
| Show NoMethodError | Since: base-4.0 |
Defined in Control.Exception.Base Methods showsPrec :: Int -> NoMethodError -> ShowS # show :: NoMethodError -> String # showList :: [NoMethodError] -> ShowS # | |
| Show NonTermination | Since: base-4.0 |
Defined in Control.Exception.Base Methods showsPrec :: Int -> NonTermination -> ShowS # show :: NonTermination -> String # showList :: [NonTermination] -> ShowS # | |
| Show PatternMatchFail | Since: base-4.0 |
Defined in Control.Exception.Base Methods showsPrec :: Int -> PatternMatchFail -> ShowS # show :: PatternMatchFail -> String # showList :: [PatternMatchFail] -> ShowS # | |
| Show RecConError | Since: base-4.0 |
Defined in Control.Exception.Base Methods showsPrec :: Int -> RecConError -> ShowS # show :: RecConError -> String # showList :: [RecConError] -> ShowS # | |
| Show RecSelError | Since: base-4.0 |
Defined in Control.Exception.Base Methods showsPrec :: Int -> RecSelError -> ShowS # show :: RecSelError -> String # showList :: [RecSelError] -> ShowS # | |
| Show RecUpdError | Since: base-4.0 |
Defined in Control.Exception.Base Methods showsPrec :: Int -> RecUpdError -> ShowS # show :: RecUpdError -> String # showList :: [RecUpdError] -> ShowS # | |
| Show TypeError | Since: base-4.9.0.0 |
| Show ByteArray | Since: base-4.17.0.0 |
| Show Constr | Since: base-4.0.0.0 |
| Show ConstrRep | Since: base-4.0.0.0 |
| Show DataRep | Since: base-4.0.0.0 |
| Show DataType | Since: base-4.0.0.0 |
| Show Fixity | Since: base-4.0.0.0 |
| Show Dynamic | Since: base-2.1 |
| Show All | Since: base-2.1 |
| Show Any | Since: base-2.1 |
| Show SomeTypeRep | Since: base-4.10.0.0 |
Defined in Data.Typeable.Internal Methods showsPrec :: Int -> SomeTypeRep -> ShowS # show :: SomeTypeRep -> String # showList :: [SomeTypeRep] -> ShowS # | |
| Show Version | Since: base-2.1 |
| Show CBool | |
| Show CChar | |
| Show CClock | |
| Show CDouble | |
| Show CFloat | |
| Show CInt | |
| Show CIntMax | |
| Show CIntPtr | |
| Show CLLong | |
| Show CLong | |
| Show CPtrdiff | |
| Show CSChar | |
| Show CSUSeconds | |
Defined in Foreign.C.Types Methods showsPrec :: Int -> CSUSeconds -> ShowS # show :: CSUSeconds -> String # showList :: [CSUSeconds] -> ShowS # | |
| Show CShort | |
| Show CSigAtomic | |
Defined in Foreign.C.Types Methods showsPrec :: Int -> CSigAtomic -> ShowS # show :: CSigAtomic -> String # showList :: [CSigAtomic] -> ShowS # | |
| Show CSize | |
| Show CTime | |
| Show CUChar | |
| Show CUInt | |
| Show CUIntMax | |
| Show CUIntPtr | |
| Show CULLong | |
| Show CULong | |
| Show CUSeconds | |
| Show CUShort | |
| Show CWchar | |
| Show IntPtr | |
| Show WordPtr | |
| Show Void | Since: base-4.8.0.0 |
| Show ByteOrder | Since: base-4.11.0.0 |
| Show BlockReason | Since: base-4.3.0.0 |
Defined in GHC.Conc.Sync Methods showsPrec :: Int -> BlockReason -> ShowS # show :: BlockReason -> String # showList :: [BlockReason] -> ShowS # | |
| Show ThreadId | Since: base-4.2.0.0 |
| Show ThreadStatus | Since: base-4.3.0.0 |
Defined in GHC.Conc.Sync Methods showsPrec :: Int -> ThreadStatus -> ShowS # show :: ThreadStatus -> String # showList :: [ThreadStatus] -> ShowS # | |
| Show ErrorCall | Since: base-4.0.0.0 |
| Show ArithException | Since: base-4.0.0.0 |
Defined in GHC.Exception.Type Methods showsPrec :: Int -> ArithException -> ShowS # show :: ArithException -> String # showList :: [ArithException] -> ShowS # | |
| Show SomeException | Since: base-3.0 |
Defined in GHC.Exception.Type Methods showsPrec :: Int -> SomeException -> ShowS # show :: SomeException -> String # showList :: [SomeException] -> ShowS # | |
| Show Fingerprint | Since: base-4.7.0.0 |
Defined in GHC.Fingerprint.Type Methods showsPrec :: Int -> Fingerprint -> ShowS # show :: Fingerprint -> String # showList :: [Fingerprint] -> ShowS # | |
| Show Associativity | Since: base-4.6.0.0 |
Defined in GHC.Generics Methods showsPrec :: Int -> Associativity -> ShowS # show :: Associativity -> String # showList :: [Associativity] -> ShowS # | |
| Show DecidedStrictness | Since: base-4.9.0.0 |
Defined in GHC.Generics Methods showsPrec :: Int -> DecidedStrictness -> ShowS # show :: DecidedStrictness -> String # showList :: [DecidedStrictness] -> ShowS # | |
| Show Fixity | Since: base-4.6.0.0 |
| Show SourceStrictness | Since: base-4.9.0.0 |
Defined in GHC.Generics Methods showsPrec :: Int -> SourceStrictness -> ShowS # show :: SourceStrictness -> String # showList :: [SourceStrictness] -> ShowS # | |
| Show SourceUnpackedness | Since: base-4.9.0.0 |
Defined in GHC.Generics Methods showsPrec :: Int -> SourceUnpackedness -> ShowS # show :: SourceUnpackedness -> String # showList :: [SourceUnpackedness] -> ShowS # | |
| Show MaskingState | Since: base-4.3.0.0 |
Defined in GHC.IO Methods showsPrec :: Int -> MaskingState -> ShowS # show :: MaskingState -> String # showList :: [MaskingState] -> ShowS # | |
| Show SeekMode | Since: base-4.2.0.0 |
| Show CodingFailureMode | Since: base-4.4.0.0 |
Defined in GHC.IO.Encoding.Failure Methods showsPrec :: Int -> CodingFailureMode -> ShowS # show :: CodingFailureMode -> String # showList :: [CodingFailureMode] -> ShowS # | |
| Show CodingProgress | Since: base-4.4.0.0 |
Defined in GHC.IO.Encoding.Types Methods showsPrec :: Int -> CodingProgress -> ShowS # show :: CodingProgress -> String # showList :: [CodingProgress] -> ShowS # | |
| Show TextEncoding | Since: base-4.3.0.0 |
Defined in GHC.IO.Encoding.Types Methods showsPrec :: Int -> TextEncoding -> ShowS # show :: TextEncoding -> String # showList :: [TextEncoding] -> ShowS # | |
| Show AllocationLimitExceeded | Since: base-4.7.1.0 |
Defined in GHC.IO.Exception Methods showsPrec :: Int -> AllocationLimitExceeded -> ShowS # show :: AllocationLimitExceeded -> String # showList :: [AllocationLimitExceeded] -> ShowS # | |
| Show ArrayException | Since: base-4.1.0.0 |
Defined in GHC.IO.Exception Methods showsPrec :: Int -> ArrayException -> ShowS # show :: ArrayException -> String # showList :: [ArrayException] -> ShowS # | |
| Show AssertionFailed | Since: base-4.1.0.0 |
Defined in GHC.IO.Exception Methods showsPrec :: Int -> AssertionFailed -> ShowS # show :: AssertionFailed -> String # showList :: [AssertionFailed] -> ShowS # | |
| Show AsyncException | Since: base-4.1.0.0 |
Defined in GHC.IO.Exception Methods showsPrec :: Int -> AsyncException -> ShowS # show :: AsyncException -> String # showList :: [AsyncException] -> ShowS # | |
| Show BlockedIndefinitelyOnMVar | Since: base-4.1.0.0 |
Defined in GHC.IO.Exception Methods showsPrec :: Int -> BlockedIndefinitelyOnMVar -> ShowS # show :: BlockedIndefinitelyOnMVar -> String # showList :: [BlockedIndefinitelyOnMVar] -> ShowS # | |
| Show BlockedIndefinitelyOnSTM | Since: base-4.1.0.0 |
Defined in GHC.IO.Exception Methods showsPrec :: Int -> BlockedIndefinitelyOnSTM -> ShowS # show :: BlockedIndefinitelyOnSTM -> String # showList :: [BlockedIndefinitelyOnSTM] -> ShowS # | |
| Show CompactionFailed | Since: base-4.10.0.0 |
Defined in GHC.IO.Exception Methods showsPrec :: Int -> CompactionFailed -> ShowS # show :: CompactionFailed -> String # showList :: [CompactionFailed] -> ShowS # | |
| Show Deadlock | Since: base-4.1.0.0 |
| Show ExitCode | |
| Show FixIOException | Since: base-4.11.0.0 |
Defined in GHC.IO.Exception Methods showsPrec :: Int -> FixIOException -> ShowS # show :: FixIOException -> String # showList :: [FixIOException] -> ShowS # | |
| Show IOErrorType | Since: base-4.1.0.0 |
Defined in GHC.IO.Exception Methods showsPrec :: Int -> IOErrorType -> ShowS # show :: IOErrorType -> String # showList :: [IOErrorType] -> ShowS # | |
| Show IOException | Since: base-4.1.0.0 |
Defined in GHC.IO.Exception Methods showsPrec :: Int -> IOException -> ShowS # show :: IOException -> String # showList :: [IOException] -> ShowS # | |
| Show SomeAsyncException | Since: base-4.7.0.0 |
Defined in GHC.IO.Exception Methods showsPrec :: Int -> SomeAsyncException -> ShowS # show :: SomeAsyncException -> String # showList :: [SomeAsyncException] -> ShowS # | |
| Show FD | Since: base-4.1.0.0 |
| Show HandlePosn | Since: base-4.1.0.0 |
Defined in GHC.IO.Handle Methods showsPrec :: Int -> HandlePosn -> ShowS # show :: HandlePosn -> String # showList :: [HandlePosn] -> ShowS # | |
| Show BufferMode | Since: base-4.2.0.0 |
Defined in GHC.IO.Handle.Types Methods showsPrec :: Int -> BufferMode -> ShowS # show :: BufferMode -> String # showList :: [BufferMode] -> ShowS # | |
| Show Handle | Since: base-4.1.0.0 |
| Show HandleType | Since: base-4.1.0.0 |
Defined in GHC.IO.Handle.Types Methods showsPrec :: Int -> HandleType -> ShowS # show :: HandleType -> String # showList :: [HandleType] -> ShowS # | |
| Show Newline | Since: base-4.3.0.0 |
| Show NewlineMode | Since: base-4.3.0.0 |
Defined in GHC.IO.Handle.Types Methods showsPrec :: Int -> NewlineMode -> ShowS # show :: NewlineMode -> String # showList :: [NewlineMode] -> ShowS # | |
| Show IOMode | Since: base-4.2.0.0 |
| Show IOPortException | |
| Show InfoProv | |
| Show Int16 | Since: base-2.1 |
| Show Int32 | Since: base-2.1 |
| Show Int64 | Since: base-2.1 |
| Show Int8 | Since: base-2.1 |
| Show CCFlags | Since: base-4.8.0.0 |
| Show ConcFlags | Since: base-4.8.0.0 |
| Show DebugFlags | Since: base-4.8.0.0 |
Defined in GHC.RTS.Flags Methods showsPrec :: Int -> DebugFlags -> ShowS # show :: DebugFlags -> String # showList :: [DebugFlags] -> ShowS # | |
| Show DoCostCentres | Since: base-4.8.0.0 |
Defined in GHC.RTS.Flags Methods showsPrec :: Int -> DoCostCentres -> ShowS # show :: DoCostCentres -> String # showList :: [DoCostCentres] -> ShowS # | |
| Show DoHeapProfile | Since: base-4.8.0.0 |
Defined in GHC.RTS.Flags Methods showsPrec :: Int -> DoHeapProfile -> ShowS # show :: DoHeapProfile -> String # showList :: [DoHeapProfile] -> ShowS # | |
| Show DoTrace | Since: base-4.8.0.0 |
| Show GCFlags | Since: base-4.8.0.0 |
| Show GiveGCStats | Since: base-4.8.0.0 |
Defined in GHC.RTS.Flags Methods showsPrec :: Int -> GiveGCStats -> ShowS # show :: GiveGCStats -> String # showList :: [GiveGCStats] -> ShowS # | |
| Show IoSubSystem | |
Defined in GHC.RTS.Flags Methods showsPrec :: Int -> IoSubSystem -> ShowS # show :: IoSubSystem -> String # showList :: [IoSubSystem] -> ShowS # | |
| Show MiscFlags | Since: base-4.8.0.0 |
| Show ParFlags | Since: base-4.8.0.0 |
| Show ProfFlags | Since: base-4.8.0.0 |
| Show RTSFlags | Since: base-4.8.0.0 |
| Show TickyFlags | Since: base-4.8.0.0 |
Defined in GHC.RTS.Flags Methods showsPrec :: Int -> TickyFlags -> ShowS # show :: TickyFlags -> String # showList :: [TickyFlags] -> ShowS # | |
| Show TraceFlags | Since: base-4.8.0.0 |
Defined in GHC.RTS.Flags Methods showsPrec :: Int -> TraceFlags -> ShowS # show :: TraceFlags -> String # showList :: [TraceFlags] -> ShowS # | |
| Show FractionalExponentBase | |
Defined in GHC.Real Methods showsPrec :: Int -> FractionalExponentBase -> ShowS # show :: FractionalExponentBase -> String # showList :: [FractionalExponentBase] -> ShowS # | |
| Show StackEntry | |
Defined in GHC.Stack.CloneStack Methods showsPrec :: Int -> StackEntry -> ShowS # show :: StackEntry -> String # showList :: [StackEntry] -> ShowS # | |
| Show CallStack | Since: base-4.9.0.0 |
| Show SrcLoc | Since: base-4.9.0.0 |
| Show StaticPtrInfo | Since: base-4.8.0.0 |
Defined in GHC.StaticPtr Methods showsPrec :: Int -> StaticPtrInfo -> ShowS # show :: StaticPtrInfo -> String # showList :: [StaticPtrInfo] -> ShowS # | |
| Show GCDetails | Since: base-4.10.0.0 |
| Show RTSStats | Since: base-4.10.0.0 |
| Show SomeChar | |
| Show SomeSymbol | Since: base-4.7.0.0 |
Defined in GHC.TypeLits Methods showsPrec :: Int -> SomeSymbol -> ShowS # show :: SomeSymbol -> String # showList :: [SomeSymbol] -> ShowS # | |
| Show SomeNat | Since: base-4.7.0.0 |
| Show GeneralCategory | Since: base-2.1 |
Defined in GHC.Unicode Methods showsPrec :: Int -> GeneralCategory -> ShowS # show :: GeneralCategory -> String # showList :: [GeneralCategory] -> ShowS # | |
| Show Word16 | Since: base-2.1 |
| Show Word32 | Since: base-2.1 |
| Show Word64 | Since: base-2.1 |
| Show Word8 | Since: base-2.1 |
| Show CBlkCnt | |
| Show CBlkSize | |
| Show CCc | |
| Show CClockId | |
| Show CDev | |
| Show CFsBlkCnt | |
| Show CFsFilCnt | |
| Show CGid | |
| Show CId | |
| Show CIno | |
| Show CKey | |
| Show CMode | |
| Show CNfds | |
| Show CNlink | |
| Show COff | |
| Show CPid | |
| Show CRLim | |
| Show CSocklen | |
| Show CSpeed | |
| Show CSsize | |
| Show CTcflag | |
| Show CTimer | |
| Show CUid | |
| Show Fd | |
| Show Timeout | Since: base-4.0 |
| Show Lexeme | Since: base-2.1 |
| Show Number | Since: base-4.6.0.0 |
| Show FormatMode | |
| Show ByteString | |
Defined in Data.ByteString.Internal.Type Methods showsPrec :: Int -> ByteString -> ShowS # show :: ByteString -> String # showList :: [ByteString] -> ShowS # | |
| Show SizeOverflowException | |
Defined in Data.ByteString.Internal.Type Methods showsPrec :: Int -> SizeOverflowException -> ShowS # show :: SizeOverflowException -> String # showList :: [SizeOverflowException] -> ShowS # | |
| Show ByteString | |
Defined in Data.ByteString.Lazy.Internal Methods showsPrec :: Int -> ByteString -> ShowS # show :: ByteString -> String # showList :: [ByteString] -> ShowS # | |
| Show ShortByteString | |
Defined in Data.ByteString.Short.Internal Methods showsPrec :: Int -> ShortByteString -> ShowS # show :: ShortByteString -> String # showList :: [ShortByteString] -> ShowS # | |
| Show LineUpdate | |
| Show IntSet | |
| Show BitQueue | |
| Show BitQueueB | |
| Show UUID | |
| Show ClientError | |
Defined in DBus.Client Methods showsPrec :: Int -> ClientError -> ShowS # show :: ClientError -> String # showList :: [ClientError] -> ShowS # | |
| Show MatchRule | |
| Show MethodExc | |
| Show ReleaseNameReply | |
Defined in DBus.Client Methods showsPrec :: Int -> ReleaseNameReply -> ShowS # show :: ReleaseNameReply -> String # showList :: [ReleaseNameReply] -> ShowS # | |
| Show RequestNameFlag | |
Defined in DBus.Client Methods showsPrec :: Int -> RequestNameFlag -> ShowS # show :: RequestNameFlag -> String # showList :: [RequestNameFlag] -> ShowS # | |
| Show RequestNameReply | |
Defined in DBus.Client Methods showsPrec :: Int -> RequestNameReply -> ShowS # show :: RequestNameReply -> String # showList :: [RequestNameReply] -> ShowS # | |
| Show Address | |
| Show HeaderField | |
Defined in DBus.Internal.Message Methods showsPrec :: Int -> HeaderField -> ShowS # show :: HeaderField -> String # showList :: [HeaderField] -> ShowS # | |
| Show MethodCall | |
Defined in DBus.Internal.Message Methods showsPrec :: Int -> MethodCall -> ShowS # show :: MethodCall -> String # showList :: [MethodCall] -> ShowS # | |
| Show MethodError | |
Defined in DBus.Internal.Message Methods showsPrec :: Int -> MethodError -> ShowS # show :: MethodError -> String # showList :: [MethodError] -> ShowS # | |
| Show MethodReturn | |
Defined in DBus.Internal.Message Methods showsPrec :: Int -> MethodReturn -> ShowS # show :: MethodReturn -> String # showList :: [MethodReturn] -> ShowS # | |
| Show ReceivedMessage | |
Defined in DBus.Internal.Message Methods showsPrec :: Int -> ReceivedMessage -> ShowS # show :: ReceivedMessage -> String # showList :: [ReceivedMessage] -> ShowS # | |
| Show Signal | |
| Show UnknownMessage | |
Defined in DBus.Internal.Message Methods showsPrec :: Int -> UnknownMessage -> ShowS # show :: UnknownMessage -> String # showList :: [UnknownMessage] -> ShowS # | |
| Show Array | |
| Show Atom | |
| Show BusName | |
| Show Dictionary | |
Defined in DBus.Internal.Types Methods showsPrec :: Int -> Dictionary -> ShowS # show :: Dictionary -> String # showList :: [Dictionary] -> ShowS # | |
| Show ErrorName | |
| Show InterfaceName | |
Defined in DBus.Internal.Types Methods showsPrec :: Int -> InterfaceName -> ShowS # show :: InterfaceName -> String # showList :: [InterfaceName] -> ShowS # | |
| Show MemberName | |
Defined in DBus.Internal.Types Methods showsPrec :: Int -> MemberName -> ShowS # show :: MemberName -> String # showList :: [MemberName] -> ShowS # | |
| Show ObjectPath | |
Defined in DBus.Internal.Types Methods showsPrec :: Int -> ObjectPath -> ShowS # show :: ObjectPath -> String # showList :: [ObjectPath] -> ShowS # | |
| Show Serial | |
| Show SigParseError | |
Defined in DBus.Internal.Types Methods showsPrec :: Int -> SigParseError -> ShowS # show :: SigParseError -> String # showList :: [SigParseError] -> ShowS # | |
| Show Signature | |
| Show Structure | |
| Show Type | |
| Show Value | |
| Show Variant | |
| Show Endianness | |
Defined in DBus.Internal.Wire Methods showsPrec :: Int -> Endianness -> ShowS # show :: Endianness -> String # showList :: [Endianness] -> ShowS # | |
| Show MarshalError | |
Defined in DBus.Internal.Wire Methods showsPrec :: Int -> MarshalError -> ShowS # show :: MarshalError -> String # showList :: [MarshalError] -> ShowS # | |
| Show UnmarshalError | |
Defined in DBus.Internal.Wire Methods showsPrec :: Int -> UnmarshalError -> ShowS # show :: UnmarshalError -> String # showList :: [UnmarshalError] -> ShowS # | |
| Show Direction | |
| Show Interface | |
| Show Method | |
| Show MethodArg | |
| Show Object | |
| Show Property | |
| Show Signal | |
| Show SignalArg | |
| Show SocketError | |
Defined in DBus.Socket Methods showsPrec :: Int -> SocketError -> ShowS # show :: SocketError -> String # showList :: [SocketError] -> ShowS # | |
| Show TransportError | |
Defined in DBus.Transport Methods showsPrec :: Int -> TransportError -> ShowS # show :: TransportError -> String # showList :: [TransportError] -> ShowS # | |
| Show FileType | |
| Show Permissions | |
Defined in System.Directory.Internal.Common Methods showsPrec :: Int -> Permissions -> ShowS # show :: Permissions -> String # showList :: [Permissions] -> ShowS # | |
| Show XdgDirectory | |
Defined in System.Directory.Internal.Common Methods showsPrec :: Int -> XdgDirectory -> ShowS # show :: XdgDirectory -> String # showList :: [XdgDirectory] -> ShowS # | |
| Show XdgDirectoryList | |
Defined in System.Directory.Internal.Common Methods showsPrec :: Int -> XdgDirectoryList -> ShowS # show :: XdgDirectoryList -> String # showList :: [XdgDirectoryList] -> ShowS # | |
| Show CopyDirConfig | Since: effects-fs-0.1 |
Defined in Effects.FileSystem.PathWriter Methods showsPrec :: Int -> CopyDirConfig -> ShowS # show :: CopyDirConfig -> String # showList :: [CopyDirConfig] -> ShowS # | |
| Show Overwrite | Since: effects-fs-0.1 |
| Show TargetName | Since: effects-fs-0.1 |
Defined in Effects.FileSystem.PathWriter Methods showsPrec :: Int -> TargetName -> ShowS # show :: TargetName -> String # showList :: [TargetName] -> ShowS # | |
| Show TimeSpec | Since: effects-time-0.1 |
| Show PathType | Since: effects-unix-compat-0.1 |
| Show Action | |
| Show Body | |
| Show Capability | |
Defined in DBus.Notify Methods showsPrec :: Int -> Capability -> ShowS # show :: Capability -> String # showList :: [Capability] -> ShowS # | |
| Show Category | |
| Show Hint | |
| Show Icon | |
| Show Image | |
| Show Note | |
| Show Timeout | |
| Show UrgencyLevel | |
Defined in DBus.Notify Methods showsPrec :: Int -> UrgencyLevel -> ShowS # show :: UrgencyLevel -> String # showList :: [UrgencyLevel] -> ShowS # | |
| Show OsChar | |
| Show OsString | On windows, decodes as UCS-2. On unix prints the raw bytes without decoding. |
| Show PosixChar | |
| Show PosixString | Prints the raw bytes without decoding. |
Defined in System.OsString.Internal.Types.Hidden Methods showsPrec :: Int -> PosixString -> ShowS # show :: PosixString -> String # showList :: [PosixString] -> ShowS # | |
| Show WindowsChar | |
Defined in System.OsString.Internal.Types.Hidden Methods showsPrec :: Int -> WindowsChar -> ShowS # show :: WindowsChar -> String # showList :: [WindowsChar] -> ShowS # | |
| Show WindowsString | Decodes as UCS-2. |
Defined in System.OsString.Internal.Types.Hidden Methods showsPrec :: Int -> WindowsString -> ShowS # show :: WindowsString -> String # showList :: [WindowsString] -> ShowS # | |
| Show ForeignSrcLang | |
Defined in GHC.ForeignSrcLang.Type Methods showsPrec :: Int -> ForeignSrcLang -> ShowS # show :: ForeignSrcLang -> String # showList :: [ForeignSrcLang] -> ShowS # | |
| Show Extension | |
| Show KindRep | |
| Show Module | Since: base-4.9.0.0 |
| Show Ordering | Since: base-2.1 |
| Show TrName | Since: base-4.9.0.0 |
| Show TyCon | Since: base-2.1 |
| Show TypeLitSort | Since: base-4.11.0.0 |
Defined in GHC.Show Methods showsPrec :: Int -> TypeLitSort -> ShowS # show :: TypeLitSort -> String # showList :: [TypeLitSort] -> ShowS # | |
| Show InvalidPosException | |
Defined in Text.Megaparsec.Pos Methods showsPrec :: Int -> InvalidPosException -> ShowS # show :: InvalidPosException -> String # showList :: [InvalidPosException] -> ShowS # | |
| Show Pos | |
| Show SourcePos | |
| Show NullError | |
| Show AddrInfo | |
| Show AddrInfoFlag | |
Defined in Network.Socket.Info Methods showsPrec :: Int -> AddrInfoFlag -> ShowS # show :: AddrInfoFlag -> String # showList :: [AddrInfoFlag] -> ShowS # | |
| Show NameInfoFlag | |
Defined in Network.Socket.Info Methods showsPrec :: Int -> NameInfoFlag -> ShowS # show :: NameInfoFlag -> String # showList :: [NameInfoFlag] -> ShowS # | |
| Show URI | |
| Show URIAuth | |
| Show NEIntSet | |
| Show Richness | |
| Show Parenthetic | |
| Show ParserHelp | |
Defined in Options.Applicative.Help.Types Methods showsPrec :: Int -> ParserHelp -> ShowS # show :: ParserHelp -> String # showList :: [ParserHelp] -> ShowS # | |
| Show AltNodeType | |
Defined in Options.Applicative.Types Methods showsPrec :: Int -> AltNodeType -> ShowS # show :: AltNodeType -> String # showList :: [AltNodeType] -> ShowS # | |
| Show ArgPolicy | |
| Show ArgumentReachability | |
Defined in Options.Applicative.Types Methods showsPrec :: Int -> ArgumentReachability -> ShowS # show :: ArgumentReachability -> String # showList :: [ArgumentReachability] -> ShowS # | |
| Show Backtracking | |
Defined in Options.Applicative.Types Methods showsPrec :: Int -> Backtracking -> ShowS # show :: Backtracking -> String # showList :: [Backtracking] -> ShowS # | |
| Show CompletionResult | |
Defined in Options.Applicative.Types Methods showsPrec :: Int -> CompletionResult -> ShowS # show :: CompletionResult -> String # showList :: [CompletionResult] -> ShowS # | |
| Show IsCmdStart | |
Defined in Options.Applicative.Types Methods showsPrec :: Int -> IsCmdStart -> ShowS # show :: IsCmdStart -> String # showList :: [IsCmdStart] -> ShowS # | |
| Show OptName | |
| Show OptProperties | |
Defined in Options.Applicative.Types Methods showsPrec :: Int -> OptProperties -> ShowS # show :: OptProperties -> String # showList :: [OptProperties] -> ShowS # | |
| Show OptVisibility | |
Defined in Options.Applicative.Types Methods showsPrec :: Int -> OptVisibility -> ShowS # show :: OptVisibility -> String # showList :: [OptVisibility] -> ShowS # | |
| Show ParserPrefs | |
Defined in Options.Applicative.Types Methods showsPrec :: Int -> ParserPrefs -> ShowS # show :: ParserPrefs -> String # showList :: [ParserPrefs] -> ShowS # | |
| Show OsChar | |
| Show OsString | On windows, decodes as UCS-2. On unix prints the raw bytes without decoding. |
| Show PosixChar | |
| Show PosixString | Prints the raw bytes without decoding. |
Defined in System.OsString.Internal.Types Methods showsPrec :: Int -> PosixString -> ShowS # show :: PosixString -> String # showList :: [PosixString] -> ShowS # | |
| Show WindowsChar | |
Defined in System.OsString.Internal.Types Methods showsPrec :: Int -> WindowsChar -> ShowS # show :: WindowsChar -> String # showList :: [WindowsChar] -> ShowS # | |
| Show WindowsString | Decodes as UCS-2. |
Defined in System.OsString.Internal.Types Methods showsPrec :: Int -> WindowsString -> ShowS # show :: WindowsString -> String # showList :: [WindowsString] -> ShowS # | |
| Show Mode | |
| Show Style | |
| Show TextDetails | |
Defined in Text.PrettyPrint.Annotated.HughesPJ Methods showsPrec :: Int -> TextDetails -> ShowS # show :: TextDetails -> String # showList :: [TextDetails] -> ShowS # | |
| Show Doc | |
| Show FusionDepth | |
Defined in Prettyprinter.Internal Methods showsPrec :: Int -> FusionDepth -> ShowS # show :: FusionDepth -> String # showList :: [FusionDepth] -> ShowS # | |
| Show LayoutOptions | |
Defined in Prettyprinter.Internal Methods showsPrec :: Int -> LayoutOptions -> ShowS # show :: LayoutOptions -> String # showList :: [LayoutOptions] -> ShowS # | |
| Show PageWidth | |
| Show AnsiStyle | |
| Show Bold | |
| Show Color | |
| Show Intensity | |
| Show Italicized | |
Defined in Prettyprinter.Render.Terminal.Internal Methods showsPrec :: Int -> Italicized -> ShowS # show :: Italicized -> String # showList :: [Italicized] -> ShowS # | |
| Show Layer | |
| Show Underlined | |
Defined in Prettyprinter.Render.Terminal.Internal Methods showsPrec :: Int -> Underlined -> ShowS # show :: Underlined -> String # showList :: [Underlined] -> ShowS # | |
| Show CmdSpec | |
| Show CreateProcess | |
Defined in System.Process.Common Methods showsPrec :: Int -> CreateProcess -> ShowS # show :: CreateProcess -> String # showList :: [CreateProcess] -> ShowS # | |
| Show StdStream | |
| Show StdGen | |
| Show Format | Since: relative-time-0.1 |
| Show FormatStyle | Since: relative-time-0.1 |
Defined in Data.Time.Relative Methods showsPrec :: Int -> FormatStyle -> ShowS # show :: FormatStyle -> String # showList :: [FormatStyle] -> ShowS # | |
| Show FormatVerbosity | Since: relative-time-0.1 |
Defined in Data.Time.Relative Methods showsPrec :: Int -> FormatVerbosity -> ShowS # show :: FormatVerbosity -> String # showList :: [FormatVerbosity] -> ShowS # | |
| Show RelativeTime | Since: relative-time-0.1 |
Defined in Data.Time.Relative Methods showsPrec :: Int -> RelativeTime -> ShowS # show :: RelativeTime -> String # showList :: [RelativeTime] -> ShowS # | |
| Show InvalidAccess | |
Defined in Control.Monad.Trans.Resource.Internal Methods showsPrec :: Int -> InvalidAccess -> ShowS # show :: InvalidAccess -> String # showList :: [InvalidAccess] -> ShowS # | |
| Show ResourceCleanupException | |
Defined in Control.Monad.Trans.Resource.Internal Methods showsPrec :: Int -> ResourceCleanupException -> ShowS # show :: ResourceCleanupException -> String # showList :: [ResourceCleanupException] -> ShowS # | |
| Show AsyncExceptionWrapper | |
Defined in Control.Exception.Safe Methods showsPrec :: Int -> AsyncExceptionWrapper -> ShowS # show :: AsyncExceptionWrapper -> String # showList :: [AsyncExceptionWrapper] -> ShowS # | |
| Show StringException | |
Defined in Control.Exception.Safe Methods showsPrec :: Int -> StringException -> ShowS # show :: StringException -> String # showList :: [StringException] -> ShowS # | |
| Show SyncExceptionWrapper | |
Defined in Control.Exception.Safe Methods showsPrec :: Int -> SyncExceptionWrapper -> ShowS # show :: SyncExceptionWrapper -> String # showList :: [SyncExceptionWrapper] -> ShowS # | |
| Show Scientific | See |
Defined in Data.Scientific Methods showsPrec :: Int -> Scientific -> ShowS # show :: Scientific -> String # showList :: [Scientific] -> ShowS # | |
| Show Args Source # | |
| Show ReportReadErrorsSwitch Source # | |
Defined in Shrun.Configuration.Data.CommandLogging Methods showsPrec :: Int -> ReportReadErrorsSwitch -> ShowS # show :: ReportReadErrorsSwitch -> String # showList :: [ReportReadErrorsSwitch] -> ShowS # | |
| Show PollInterval Source # | |
Defined in Shrun.Configuration.Data.CommandLogging.PollInterval Methods showsPrec :: Int -> PollInterval -> ShowS # show :: PollInterval -> String # showList :: [PollInterval] -> ShowS # | |
| Show ReadSize Source # | |
| Show KeyHideSwitch Source # | |
Defined in Shrun.Configuration.Data.CommonLogging.KeyHideSwitch Methods showsPrec :: Int -> KeyHideSwitch -> ShowS # show :: KeyHideSwitch -> String # showList :: [KeyHideSwitch] -> ShowS # | |
| Show ConsoleLogCmdSwitch Source # | |
Defined in Shrun.Configuration.Data.ConsoleLogging Methods showsPrec :: Int -> ConsoleLogCmdSwitch -> ShowS # show :: ConsoleLogCmdSwitch -> String # showList :: [ConsoleLogCmdSwitch] -> ShowS # | |
| Show TimerFormat Source # | |
Defined in Shrun.Configuration.Data.ConsoleLogging.TimerFormat Methods showsPrec :: Int -> TimerFormat -> ShowS # show :: TimerFormat -> String # showList :: [TimerFormat] -> ShowS # | |
| Show Timeout Source # | |
| Show DeleteOnSuccessSwitch Source # | |
Defined in Shrun.Configuration.Data.FileLogging Methods showsPrec :: Int -> DeleteOnSuccessSwitch -> ShowS # show :: DeleteOnSuccessSwitch -> String # showList :: [DeleteOnSuccessSwitch] -> ShowS # | |
| Show FileMode Source # | |
| Show FilePathDefault Source # | |
Defined in Shrun.Configuration.Data.FileLogging.FilePathDefault Methods showsPrec :: Int -> FilePathDefault -> ShowS # show :: FilePathDefault -> String # showList :: [FilePathDefault] -> ShowS # | |
| Show FileSizeMode Source # | |
Defined in Shrun.Configuration.Data.FileLogging.FileSizeMode Methods showsPrec :: Int -> FileSizeMode -> ShowS # show :: FileSizeMode -> String # showList :: [FileSizeMode] -> ShowS # | |
| Show MergedConfig Source # | |
Defined in Shrun.Configuration.Data.MergedConfig Methods showsPrec :: Int -> MergedConfig -> ShowS # show :: MergedConfig -> String # showList :: [MergedConfig] -> ShowS # | |
| Show LineTruncation Source # | |
Defined in Shrun.Configuration.Data.Truncation Methods showsPrec :: Int -> LineTruncation -> ShowS # show :: LineTruncation -> String # showList :: [LineTruncation] -> ShowS # | |
| Show TruncRegion Source # | |
Defined in Shrun.Configuration.Data.Truncation Methods showsPrec :: Int -> TruncRegion -> ShowS # show :: TruncRegion -> String # showList :: [TruncRegion] -> ShowS # | |
| Show CyclicKeyError Source # | |
Defined in Shrun.Configuration.Legend Methods showsPrec :: Int -> CyclicKeyError -> ShowS # show :: CyclicKeyError -> String # showList :: [CyclicKeyError] -> ShowS # | |
| Show DuplicateKeyError Source # | |
Defined in Shrun.Configuration.Legend Methods showsPrec :: Int -> DuplicateKeyError -> ShowS # show :: DuplicateKeyError -> String # showList :: [DuplicateKeyError] -> ShowS # | |
| Show Toml Source # | |
| Show KeyVal Source # | |
| Show UnlinedText Source # | |
Defined in Shrun.Data.Text Methods showsPrec :: Int -> UnlinedText -> ShowS # show :: UnlinedText -> String # showList :: [UnlinedText] -> ShowS # | |
| Show CommandResult Source # | |
Defined in Shrun.IO.Types Methods showsPrec :: Int -> CommandResult -> ShowS # show :: CommandResult -> String # showList :: [CommandResult] -> ShowS # | |
| Show ReadHandleResult Source # | |
Defined in Shrun.IO.Types Methods showsPrec :: Int -> ReadHandleResult -> ShowS # show :: ReadHandleResult -> String # showList :: [ReadHandleResult] -> ShowS # | |
| Show Stderr Source # | |
| Show Log Source # | |
| Show LogLevel Source # | |
| Show ConsoleLog Source # | |
Defined in Shrun.Logging.Types.Internal Methods showsPrec :: Int -> ConsoleLog -> ShowS # show :: ConsoleLog -> String # showList :: [ConsoleLog] -> ShowS # | |
| Show FileLog Source # | |
| Show LogMode Source # | |
| Show NotifyException Source # | |
Defined in Shrun.Notify.MonadNotify Methods showsPrec :: Int -> NotifyException -> ShowS # show :: NotifyException -> String # showList :: [NotifyException] -> ShowS # | |
| Show ShrunNote Source # | |
| Show LinuxNotifySystemMismatch Source # | |
Defined in Shrun.Notify.Types Methods showsPrec :: Int -> LinuxNotifySystemMismatch -> ShowS # show :: LinuxNotifySystemMismatch -> String # showList :: [LinuxNotifySystemMismatch] -> ShowS # | |
| Show NotifyAction Source # | |
Defined in Shrun.Notify.Types Methods showsPrec :: Int -> NotifyAction -> ShowS # show :: NotifyAction -> String # showList :: [NotifyAction] -> ShowS # | |
| Show NotifySystemArgs Source # | |
Defined in Shrun.Notify.Types Methods showsPrec :: Int -> NotifySystemArgs -> ShowS # show :: NotifySystemArgs -> String # showList :: [NotifySystemArgs] -> ShowS # | |
| Show NotifySystemMerged Source # | |
Defined in Shrun.Notify.Types Methods showsPrec :: Int -> NotifySystemMerged -> ShowS # show :: NotifySystemMerged -> String # showList :: [NotifySystemMerged] -> ShowS # | |
| Show NotifySystemToml Source # | |
Defined in Shrun.Notify.Types Methods showsPrec :: Int -> NotifySystemToml -> ShowS # show :: NotifySystemToml -> String # showList :: [NotifySystemToml] -> ShowS # | |
| Show NotifyTimeout Source # | |
Defined in Shrun.Notify.Types Methods showsPrec :: Int -> NotifyTimeout -> ShowS # show :: NotifyTimeout -> String # showList :: [NotifyTimeout] -> ShowS # | |
| Show OsxNotifySystemMismatch Source # | |
Defined in Shrun.Notify.Types Methods showsPrec :: Int -> OsxNotifySystemMismatch -> ShowS # show :: OsxNotifySystemMismatch -> String # showList :: [OsxNotifySystemMismatch] -> ShowS # | |
| Show CaseFormat | Since: si-bytes-0.1 |
Defined in Data.Bytes.Formatting.Base Methods showsPrec :: Int -> CaseFormat -> ShowS # show :: CaseFormat -> String # showList :: [CaseFormat] -> ShowS # | |
| Show DirectedFormatter | Since: si-bytes-0.1 |
Defined in Data.Bytes.Formatting.Direction Methods showsPrec :: Int -> DirectedFormatter -> ShowS # show :: DirectedFormatter -> String # showList :: [DirectedFormatter] -> ShowS # | |
| Show DirectionFormat | Since: si-bytes-0.1 |
Defined in Data.Bytes.Formatting.Direction Methods showsPrec :: Int -> DirectionFormat -> ShowS # show :: DirectionFormat -> String # showList :: [DirectionFormat] -> ShowS # | |
| Show SizeFormat | Since: si-bytes-0.1 |
Defined in Data.Bytes.Formatting.Size Methods showsPrec :: Int -> SizeFormat -> ShowS # show :: SizeFormat -> String # showList :: [SizeFormat] -> ShowS # | |
| Show SizedFormatter | Since: si-bytes-0.1 |
Defined in Data.Bytes.Formatting.Size Methods showsPrec :: Int -> SizedFormatter -> ShowS # show :: SizedFormatter -> String # showList :: [SizedFormatter] -> ShowS # | |
| Show Direction | Since: si-bytes-0.1 |
| Show Size | Since: si-bytes-0.1 |
| Show ForallVisFlag | |
Defined in Language.Haskell.TH.Ppr Methods showsPrec :: Int -> ForallVisFlag -> ShowS # show :: ForallVisFlag -> String # showList :: [ForallVisFlag] -> ShowS # | |
| Show Doc | |
| Show AnnLookup | |
| Show AnnTarget | |
| Show Bang | |
| Show BndrVis | |
| Show Body | |
| Show Bytes | |
| Show Callconv | |
| Show Clause | |
| Show Con | |
| Show Dec | |
| Show DecidedStrictness | |
Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> DecidedStrictness -> ShowS # show :: DecidedStrictness -> String # showList :: [DecidedStrictness] -> ShowS # | |
| Show DerivClause | |
Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> DerivClause -> ShowS # show :: DerivClause -> String # showList :: [DerivClause] -> ShowS # | |
| Show DerivStrategy | |
Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> DerivStrategy -> ShowS # show :: DerivStrategy -> String # showList :: [DerivStrategy] -> ShowS # | |
| Show DocLoc | |
| Show Exp | |
| Show FamilyResultSig | |
Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> FamilyResultSig -> ShowS # show :: FamilyResultSig -> String # showList :: [FamilyResultSig] -> ShowS # | |
| Show Fixity | |
| Show FixityDirection | |
Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> FixityDirection -> ShowS # show :: FixityDirection -> String # showList :: [FixityDirection] -> ShowS # | |
| Show Foreign | |
| Show FunDep | |
| Show Guard | |
| Show Info | |
| Show InjectivityAnn | |
Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> InjectivityAnn -> ShowS # show :: InjectivityAnn -> String # showList :: [InjectivityAnn] -> ShowS # | |
| Show Inline | |
| Show Lit | |
| Show Loc | |
| Show Match | |
| Show ModName | |
| Show Module | |
| Show ModuleInfo | |
Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> ModuleInfo -> ShowS # show :: ModuleInfo -> String # showList :: [ModuleInfo] -> ShowS # | |
| Show Name | |
| Show NameFlavour | |
Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> NameFlavour -> ShowS # show :: NameFlavour -> String # showList :: [NameFlavour] -> ShowS # | |
| Show NameSpace | |
| Show OccName | |
| Show Overlap | |
| Show Pat | |
| Show PatSynArgs | |
Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> PatSynArgs -> ShowS # show :: PatSynArgs -> String # showList :: [PatSynArgs] -> ShowS # | |
| Show PatSynDir | |
| Show Phases | |
| Show PkgName | |
| Show Pragma | |
| Show Range | |
| Show Role | |
| Show RuleBndr | |
| Show RuleMatch | |
| Show Safety | |
| Show SourceStrictness | |
Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> SourceStrictness -> ShowS # show :: SourceStrictness -> String # showList :: [SourceStrictness] -> ShowS # | |
| Show SourceUnpackedness | |
Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> SourceUnpackedness -> ShowS # show :: SourceUnpackedness -> String # showList :: [SourceUnpackedness] -> ShowS # | |
| Show Specificity | |
Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> Specificity -> ShowS # show :: Specificity -> String # showList :: [Specificity] -> ShowS # | |
| Show Stmt | |
| Show TyLit | |
| Show TySynEqn | |
| Show Type | |
| Show TypeFamilyHead | |
Defined in Language.Haskell.TH.Syntax Methods showsPrec :: Int -> TypeFamilyHead -> ShowS # show :: TypeFamilyHead -> String # showList :: [TypeFamilyHead] -> ShowS # | |
| Show Decoding | |
| Show UnicodeException | |
Defined in Data.Text.Encoding.Error Methods showsPrec :: Int -> UnicodeException -> ShowS # show :: UnicodeException -> String # showList :: [UnicodeException] -> ShowS # | |
| Show I8 | |
| Show Builder | |
| Show PartialUtf8CodePoint | |
| Show Utf8State | |
| Show DecoderState | |
Defined in Data.Text.Internal.Encoding.Utf8 Methods showsPrec :: Int -> DecoderState -> ShowS # show :: DecoderState -> String # showList :: [DecoderState] -> ShowS # | |
| Show Size | |
| Show FPFormat | |
| Show Iter | |
| Show ShortText | |
| Show ConstructorInfo | |
Defined in Language.Haskell.TH.Datatype Methods showsPrec :: Int -> ConstructorInfo -> ShowS # show :: ConstructorInfo -> String # showList :: [ConstructorInfo] -> ShowS # | |
| Show ConstructorVariant | |
Defined in Language.Haskell.TH.Datatype Methods showsPrec :: Int -> ConstructorVariant -> ShowS # show :: ConstructorVariant -> String # showList :: [ConstructorVariant] -> ShowS # | |
| Show DatatypeInfo | |
Defined in Language.Haskell.TH.Datatype Methods showsPrec :: Int -> DatatypeInfo -> ShowS # show :: DatatypeInfo -> String # showList :: [DatatypeInfo] -> ShowS # | |
| Show DatatypeVariant | |
Defined in Language.Haskell.TH.Datatype Methods showsPrec :: Int -> DatatypeVariant -> ShowS # show :: DatatypeVariant -> String # showList :: [DatatypeVariant] -> ShowS # | |
| Show FieldStrictness | |
Defined in Language.Haskell.TH.Datatype Methods showsPrec :: Int -> FieldStrictness -> ShowS # show :: FieldStrictness -> String # showList :: [FieldStrictness] -> ShowS # | |
| Show Strictness | |
Defined in Language.Haskell.TH.Datatype Methods showsPrec :: Int -> Strictness -> ShowS # show :: Strictness -> String # showList :: [Strictness] -> ShowS # | |
| Show Unpackedness | |
Defined in Language.Haskell.TH.Datatype Methods showsPrec :: Int -> Unpackedness -> ShowS # show :: Unpackedness -> String # showList :: [Unpackedness] -> ShowS # | |
| Show LocalTime | |
| Show ZonedTime | For the time zone, this only shows the name, or offset if the name is empty. |
| Show ContextItem | |
Defined in TOML.Error Methods showsPrec :: Int -> ContextItem -> ShowS # show :: ContextItem -> String # showList :: [ContextItem] -> ShowS # | |
| Show DecodeError | |
Defined in TOML.Error Methods showsPrec :: Int -> DecodeError -> ShowS # show :: DecodeError -> String # showList :: [DecodeError] -> ShowS # | |
| Show NormalizeError | |
Defined in TOML.Error Methods showsPrec :: Int -> NormalizeError -> ShowS # show :: NormalizeError -> String # showList :: [NormalizeError] -> ShowS # | |
| Show TOMLError | |
| Show Value | |
| Show ByteStringOutputException | |
Defined in System.Process.Typed.Internal Methods showsPrec :: Int -> ByteStringOutputException -> ShowS # show :: ByteStringOutputException -> String # showList :: [ByteStringOutputException] -> ShowS # | |
| Show ExitCodeException | |
Defined in System.Process.Typed.Internal Methods showsPrec :: Int -> ExitCodeException -> ShowS # show :: ExitCodeException -> String # showList :: [ExitCodeException] -> ShowS # | |
| Show ConcException | |
Defined in UnliftIO.Internals.Async Methods showsPrec :: Int -> ConcException -> ShowS # show :: ConcException -> String # showList :: [ConcException] -> ShowS # | |
| Show SubHashPath | |
Defined in Data.HashMap.Internal.Debug Methods showsPrec :: Int -> SubHashPath -> ShowS # show :: SubHashPath -> String # showList :: [SubHashPath] -> ShowS # | |
| Show UUID | Pretty prints a
|
| Show UnpackedUUID | |
| Show Content | |
| Show Doctype | |
| Show Document | |
| Show Element | |
| Show Event | |
| Show ExternalID | |
Defined in Data.XML.Types Methods showsPrec :: Int -> ExternalID -> ShowS # show :: ExternalID -> String # showList :: [ExternalID] -> ShowS # | |
| Show Instruction | |
Defined in Data.XML.Types Methods showsPrec :: Int -> Instruction -> ShowS # show :: Instruction -> String # showList :: [Instruction] -> ShowS # | |
| Show Miscellaneous | |
Defined in Data.XML.Types Methods showsPrec :: Int -> Miscellaneous -> ShowS # show :: Miscellaneous -> String # showList :: [Miscellaneous] -> ShowS # | |
| Show Name | |
| Show Node | |
| Show Prologue | |
| Show Integer | Since: base-2.1 |
| Show Natural | Since: base-4.8.0.0 |
| Show () | Since: base-2.1 |
| Show Bool | Since: base-2.1 |
| Show Char | Since: base-2.1 |
| Show Int | Since: base-2.1 |
| Show Levity | Since: base-4.15.0.0 |
| Show RuntimeRep | Since: base-4.11.0.0 |
Defined in GHC.Show Methods showsPrec :: Int -> RuntimeRep -> ShowS # show :: RuntimeRep -> String # showList :: [RuntimeRep] -> ShowS # | |
| Show VecCount | Since: base-4.11.0.0 |
| Show VecElem | Since: base-4.11.0.0 |
| Show Word | Since: base-2.1 |
| Show v => Show (KeyMap v) | |
| Show a => Show (IResult a) | |
| Show a => Show (Result a) | |
| Show a => Show (ZipList a) | Since: base-4.7.0.0 |
| Show a => Show (And a) | Since: base-4.16 |
| Show a => Show (Iff a) | Since: base-4.16 |
| Show a => Show (Ior a) | Since: base-4.16 |
| Show a => Show (Xor a) | Since: base-4.16 |
| Show a => Show (Complex a) | Since: base-2.1 |
| Show a => Show (Identity a) | This instance would be equivalent to the derived instances of the
Since: base-4.8.0.0 |
| Show a => Show (First a) | Since: base-2.1 |
| Show a => Show (Last a) | Since: base-2.1 |
| Show a => Show (Down a) | This instance would be equivalent to the derived instances of the
Since: base-4.7.0.0 |
| Show a => Show (First a) | Since: base-4.9.0.0 |
| Show a => Show (Last a) | Since: base-4.9.0.0 |
| Show a => Show (Max a) | Since: base-4.9.0.0 |
| Show a => Show (Min a) | Since: base-4.9.0.0 |
| Show m => Show (WrappedMonoid m) | Since: base-4.9.0.0 |
Defined in Data.Semigroup Methods showsPrec :: Int -> WrappedMonoid m -> ShowS # show :: WrappedMonoid m -> String # showList :: [WrappedMonoid m] -> ShowS # | |
| Show a => Show (Dual a) | Since: base-2.1 |
| Show a => Show (Product a) | Since: base-2.1 |
| Show a => Show (Sum a) | Since: base-2.1 |
| Show (ConstPtr a) | |
| Show a => Show (NonEmpty a) | Since: base-4.11.0.0 |
| Show (ForeignPtr a) | Since: base-2.1 |
Defined in GHC.ForeignPtr Methods showsPrec :: Int -> ForeignPtr a -> ShowS # show :: ForeignPtr a -> String # showList :: [ForeignPtr a] -> ShowS # | |
| Show p => Show (Par1 p) | Since: base-4.7.0.0 |
| Show (FunPtr a) | Since: base-2.1 |
| Show (Ptr a) | Since: base-2.1 |
| Show a => Show (Ratio a) | Since: base-2.0.1 |
| Show (SChar c) | Since: base-4.18.0.0 |
| Show (SSymbol s) | Since: base-4.18.0.0 |
| Show (SNat n) | Since: base-4.18.0.0 |
| Show a => Show (Flush a) | |
| Show vertex => Show (SCC vertex) | Since: containers-0.5.9 |
| Show a => Show (IntMap a) | |
| Show a => Show (Seq a) | |
| Show a => Show (ViewL a) | |
| Show a => Show (ViewR a) | |
| Show a => Show (Intersection a) | |
Defined in Data.Set.Internal Methods showsPrec :: Int -> Intersection a -> ShowS # show :: Intersection a -> String # showList :: [Intersection a] -> ShowS # | |
| Show a => Show (Set a) | |
| Show a => Show (Tree a) | |
| Show1 f => Show (Fix f) | |
| (Functor f, Show1 f) => Show (Mu f) | |
| (Functor f, Show1 f) => Show (Nu f) | |
| Show a => Show (DNonEmpty a) | |
| Show a => Show (DList a) | |
| Exception e => Show (ExceptionCS e) | Alias for Since: effects-exceptions-0.1 |
Defined in Effects.Exception.Annotation.CallStack.Legacy Methods showsPrec :: Int -> ExceptionCS e -> ShowS # show :: ExceptionCS e -> String # showList :: [ExceptionCS e] -> ShowS # | |
| Show a => Show (ExitCase a) | |
| Show a => Show (Hashed a) | |
| Show e => Show (ErrorFancy e) | |
Defined in Text.Megaparsec.Error Methods showsPrec :: Int -> ErrorFancy e -> ShowS # show :: ErrorFancy e -> String # showList :: [ErrorFancy e] -> ShowS # | |
| Show t => Show (ErrorItem t) | |
| Show s => Show (PosState s) | |
| Show mono => Show (NonNull mono) | |
| Show a => Show (NEIntMap a) | |
| Show a => Show (NESeq a) | |
| Show a => Show (NESet a) | |
| Show a => Show (Chunk a) | |
| Show a => Show (OptTree a) | |
| Show (Option a) | |
| Show h => Show (ParserFailure h) | |
Defined in Options.Applicative.Types Methods showsPrec :: Int -> ParserFailure h -> ShowS # show :: ParserFailure h -> String # showList :: [ParserFailure h] -> ShowS # | |
| Show a => Show (ParserResult a) | |
Defined in Options.Applicative.Types Methods showsPrec :: Int -> ParserResult a -> ShowS # show :: ParserResult a -> String # showList :: [ParserResult a] -> ShowS # | |
| Show a => Show (AnnotDetails a) | |
Defined in Text.PrettyPrint.Annotated.HughesPJ Methods showsPrec :: Int -> AnnotDetails a -> ShowS # show :: AnnotDetails a -> String # showList :: [AnnotDetails a] -> ShowS # | |
| Show (Doc a) | |
| Show a => Show (Span a) | |
| Show (Doc ann) |
|
| Show ann => Show (SimpleDocStream ann) | |
Defined in Prettyprinter.Internal Methods showsPrec :: Int -> SimpleDocStream ann -> ShowS # show :: SimpleDocStream ann -> String # showList :: [SimpleDocStream ann] -> ShowS # | |
| Show a => Show (Array a) | |
| (Show a, Prim a) => Show (PrimArray a) | Since: primitive-0.6.4.0 |
| Show a => Show (SmallArray a) | |
Defined in Data.Primitive.SmallArray Methods showsPrec :: Int -> SmallArray a -> ShowS # show :: SmallArray a -> String # showList :: [SmallArray a] -> ShowS # | |
| Show g => Show (StateGen g) | |
| Show g => Show (AtomicGen g) | |
| Show g => Show (IOGen g) | |
| Show g => Show (STGen g) | |
| Show g => Show (TGen g) | |
| Show (CommandLoggingP 'ConfigPhaseArgs) Source # | |
Defined in Shrun.Configuration.Data.CommandLogging Methods showsPrec :: Int -> CommandLoggingP 'ConfigPhaseArgs -> ShowS # show :: CommandLoggingP 'ConfigPhaseArgs -> String # showList :: [CommandLoggingP 'ConfigPhaseArgs] -> ShowS # | |
| Show (CommandLoggingP 'ConfigPhaseMerged) Source # | |
Defined in Shrun.Configuration.Data.CommandLogging Methods showsPrec :: Int -> CommandLoggingP 'ConfigPhaseMerged -> ShowS # show :: CommandLoggingP 'ConfigPhaseMerged -> String # showList :: [CommandLoggingP 'ConfigPhaseMerged] -> ShowS # | |
| Show (CommandLoggingP 'ConfigPhaseToml) Source # | |
Defined in Shrun.Configuration.Data.CommandLogging Methods showsPrec :: Int -> CommandLoggingP 'ConfigPhaseToml -> ShowS # show :: CommandLoggingP 'ConfigPhaseToml -> String # showList :: [CommandLoggingP 'ConfigPhaseToml] -> ShowS # | |
| Show (CommonLoggingP 'ConfigPhaseArgs) Source # | |
Defined in Shrun.Configuration.Data.CommonLogging Methods showsPrec :: Int -> CommonLoggingP 'ConfigPhaseArgs -> ShowS # show :: CommonLoggingP 'ConfigPhaseArgs -> String # showList :: [CommonLoggingP 'ConfigPhaseArgs] -> ShowS # | |
| Show (CommonLoggingP 'ConfigPhaseMerged) Source # | |
Defined in Shrun.Configuration.Data.CommonLogging Methods showsPrec :: Int -> CommonLoggingP 'ConfigPhaseMerged -> ShowS # show :: CommonLoggingP 'ConfigPhaseMerged -> String # showList :: [CommonLoggingP 'ConfigPhaseMerged] -> ShowS # | |
| Show (CommonLoggingP 'ConfigPhaseToml) Source # | |
Defined in Shrun.Configuration.Data.CommonLogging Methods showsPrec :: Int -> CommonLoggingP 'ConfigPhaseToml -> ShowS # show :: CommonLoggingP 'ConfigPhaseToml -> String # showList :: [CommonLoggingP 'ConfigPhaseToml] -> ShowS # | |
| Show (ConsoleLoggingP 'ConfigPhaseArgs) Source # | |
Defined in Shrun.Configuration.Data.ConsoleLogging Methods showsPrec :: Int -> ConsoleLoggingP 'ConfigPhaseArgs -> ShowS # show :: ConsoleLoggingP 'ConfigPhaseArgs -> String # showList :: [ConsoleLoggingP 'ConfigPhaseArgs] -> ShowS # | |
| Show (ConsoleLoggingP 'ConfigPhaseMerged) Source # | |
Defined in Shrun.Configuration.Data.ConsoleLogging Methods showsPrec :: Int -> ConsoleLoggingP 'ConfigPhaseMerged -> ShowS # show :: ConsoleLoggingP 'ConfigPhaseMerged -> String # showList :: [ConsoleLoggingP 'ConfigPhaseMerged] -> ShowS # | |
| Show (ConsoleLoggingP 'ConfigPhaseToml) Source # | |
Defined in Shrun.Configuration.Data.ConsoleLogging Methods showsPrec :: Int -> ConsoleLoggingP 'ConfigPhaseToml -> ShowS # show :: ConsoleLoggingP 'ConfigPhaseToml -> String # showList :: [ConsoleLoggingP 'ConfigPhaseToml] -> ShowS # | |
| Show (CoreConfigP 'ConfigPhaseArgs) Source # | |
Defined in Shrun.Configuration.Data.Core Methods showsPrec :: Int -> CoreConfigP 'ConfigPhaseArgs -> ShowS # show :: CoreConfigP 'ConfigPhaseArgs -> String # showList :: [CoreConfigP 'ConfigPhaseArgs] -> ShowS # | |
| Show (CoreConfigP 'ConfigPhaseMerged) Source # | |
Defined in Shrun.Configuration.Data.Core Methods showsPrec :: Int -> CoreConfigP 'ConfigPhaseMerged -> ShowS # show :: CoreConfigP 'ConfigPhaseMerged -> String # showList :: [CoreConfigP 'ConfigPhaseMerged] -> ShowS # | |
| Show (CoreConfigP 'ConfigPhaseToml) Source # | |
Defined in Shrun.Configuration.Data.Core Methods showsPrec :: Int -> CoreConfigP 'ConfigPhaseToml -> ShowS # show :: CoreConfigP 'ConfigPhaseToml -> String # showList :: [CoreConfigP 'ConfigPhaseToml] -> ShowS # | |
| Show (FileLoggingP 'ConfigPhaseArgs) Source # | |
Defined in Shrun.Configuration.Data.FileLogging Methods showsPrec :: Int -> FileLoggingP 'ConfigPhaseArgs -> ShowS # show :: FileLoggingP 'ConfigPhaseArgs -> String # showList :: [FileLoggingP 'ConfigPhaseArgs] -> ShowS # | |
| Show (FileLoggingP 'ConfigPhaseMerged) Source # | |
Defined in Shrun.Configuration.Data.FileLogging Methods showsPrec :: Int -> FileLoggingP 'ConfigPhaseMerged -> ShowS # show :: FileLoggingP 'ConfigPhaseMerged -> String # showList :: [FileLoggingP 'ConfigPhaseMerged] -> ShowS # | |
| Show (FileLoggingP 'ConfigPhaseToml) Source # | |
Defined in Shrun.Configuration.Data.FileLogging Methods showsPrec :: Int -> FileLoggingP 'ConfigPhaseToml -> ShowS # show :: FileLoggingP 'ConfigPhaseToml -> String # showList :: [FileLoggingP 'ConfigPhaseToml] -> ShowS # | |
| Show (NotifyP 'ConfigPhaseArgs) Source # | |
Defined in Shrun.Configuration.Data.Notify | |
| Show (NotifyP 'ConfigPhaseMerged) Source # | |
Defined in Shrun.Configuration.Data.Notify | |
| Show (NotifyP 'ConfigPhaseToml) Source # | |
Defined in Shrun.Configuration.Data.Notify | |
| Show (StripControl t) Source # | |
Defined in Shrun.Configuration.Data.StripControl Methods showsPrec :: Int -> StripControl t -> ShowS # show :: StripControl t -> String # showList :: [StripControl t] -> ShowS # | |
| Show (Truncation a) Source # | |
Defined in Shrun.Configuration.Data.Truncation Methods showsPrec :: Int -> Truncation a -> ShowS # show :: Truncation a -> String # showList :: [Truncation a] -> ShowS # | |
| Show a => Show (WithDisabled a) Source # | |
Defined in Shrun.Configuration.Data.WithDisabled Methods showsPrec :: Int -> WithDisabled a -> ShowS # show :: WithDisabled a -> String # showList :: [WithDisabled a] -> ShowS # | |
| Show (CommandP p) Source # | |
| Show n => Show (SomeSize n) | Since: si-bytes-0.1 |
| Show (SDirection d) | Since: si-bytes-0.1 |
Defined in Data.Bytes.Network.Direction Methods showsPrec :: Int -> SDirection d -> ShowS # show :: SDirection d -> String # showList :: [SDirection d] -> ShowS # | |
| Show n => Show (SomeNet n) | Since: si-bytes-0.1 |
| Show (SSize s) | Since: si-bytes-0.1 |
| Show a => Show (NonZero a) | Since: smart-math-0.1 |
| Show a => Show (Positive a) | Since: smart-math-0.1 |
| Show a => Show (Maybe a) | |
| Show flag => Show (TyVarBndr flag) | |
| Show a => Show (Window a) | |
| Show a => Show (Array a) | |
| Show k => Show (Error k) | |
| Show k => Show (Validity k) | |
| Show a => Show (HashSet a) | |
| Show a => Show (Vector a) | |
| (Show a, Prim a) => Show (Vector a) | |
| (Show a, Storable a) => Show (Vector a) | |
| Show a => Show (Maybe a) | Since: base-2.1 |
| Show a => Show (Solo a) | Since: base-4.15 |
| Show a => Show [a] | Since: base-2.1 |
| (Show a, Show b) => Show (Either a b) | Since: base-3.0 |
| HasResolution a => Show (Fixed a) | Since: base-2.1 |
| Show (Proxy s) | Since: base-4.7.0.0 |
| (Show a, Show b) => Show (Arg a b) | Since: base-4.9.0.0 |
| Show (TypeRep a) | |
| (Ix a, Show a, Show b) => Show (Array a b) | Since: base-2.1 |
| Show (U1 p) | Since: base-4.9.0.0 |
| Show (V1 p) | Since: base-4.9.0.0 |
| Show (ST s a) | Since: base-2.1 |
| (Show k, Show a) => Show (Map k a) | |
| (Show1 f, Show a) => Show (Cofree f a) | |
| (Show1 f, Show a) => Show (Free f a) | |
| Show (f a) => Show (Yoneda f a) | |
| (Show (Token s), Show e) => Show (ParseError s e) | |
Defined in Text.Megaparsec.Error Methods showsPrec :: Int -> ParseError s e -> ShowS # show :: ParseError s e -> String # showList :: [ParseError s e] -> ShowS # | |
| (Show s, Show (Token s), Show e) => Show (ParseErrorBundle s e) | |
Defined in Text.Megaparsec.Error Methods showsPrec :: Int -> ParseErrorBundle s e -> ShowS # show :: ParseErrorBundle s e -> String # showList :: [ParseErrorBundle s e] -> ShowS # | |
| (Show (ParseError s e), Show s) => Show (State s e) | |
| (Show k, Show a) => Show (NEMap k a) | |
| Show n => Show (Bytes s n) | Since: si-bytes-0.1 |
| Show n => Show (SomeNetDir s n) | Since: si-bytes-0.1 |
Defined in Data.Bytes.Network.Internal Methods showsPrec :: Int -> SomeNetDir s n -> ShowS # show :: SomeNetDir s n -> String # showList :: [SomeNetDir s n] -> ShowS # | |
| Show n => Show (SomeNetSize d n) | Since: si-bytes-0.1 |
Defined in Data.Bytes.Network.Internal Methods showsPrec :: Int -> SomeNetSize d n -> ShowS # show :: SomeNetSize d n -> String # showList :: [SomeNetSize d n] -> ShowS # | |
| (Show a, Show b) => Show (Either a b) | |
| (Show a, Show b) => Show (These a b) | |
| (Show a, Show b) => Show (Pair a b) | |
| (Show a, Show b) => Show (These a b) | |
| (Show1 f, Show a) => Show (Lift f a) | |
| (Show1 m, Show a) => Show (MaybeT m a) | |
| (Show k, Show v) => Show (HashMap k v) | |
| (Show a, Show b) => Show (a, b) | Since: base-2.1 |
| Show a => Show (Const a b) | This instance would be equivalent to the derived instances of the
Since: base-4.8.0.0 |
| Show (f a) => Show (Ap f a) | Since: base-4.12.0.0 |
| Show (f a) => Show (Alt f a) | Since: base-4.8.0.0 |
| Show (Coercion a b) | Since: base-4.7.0.0 |
| Show (a :~: b) | Since: base-4.7.0.0 |
| Show (OrderingI a b) | |
| Show (f p) => Show (Rec1 f p) | Since: base-4.7.0.0 |
| Show (URec Char p) | Since: base-4.9.0.0 |
| Show (URec Double p) | Since: base-4.9.0.0 |
| Show (URec Float p) | |
| Show (URec Int p) | Since: base-4.9.0.0 |
| Show (URec Word p) | Since: base-4.9.0.0 |
| Show (p (Fix p a) a) => Show (Fix p a) | |
| Show (p a a) => Show (Join p a) | |
| (Show a, Show (f b)) => Show (CofreeF f a b) | |
| Show (w (CofreeF f a (CofreeT f w a))) => Show (CofreeT f w a) | |
| (Show a, Show (f b)) => Show (FreeF f a b) | |
| (Show1 f, Show1 m, Show a) => Show (FreeT f m a) | |
| Show n => Show (NetBytes d s n) | Since: si-bytes-0.1 |
| Show b => Show (Tagged s b) | |
| (Show (f a), Show (g a), Show a) => Show (These1 f g a) | |
| (Show1 f, Show a) => Show (Backwards f a) | |
| (Show e, Show1 m, Show a) => Show (ExceptT e m a) | |
| (Show1 f, Show a) => Show (IdentityT f a) | |
| (Show w, Show1 m, Show a) => Show (WriterT w m a) | |
| (Show w, Show1 m, Show a) => Show (WriterT w m a) | |
| Show a => Show (Constant a b) | |
| (Show1 f, Show a) => Show (Reverse f a) | |
| Show (Process stdin stdout stderr) | |
| Show (ProcessConfig stdin stdout stderr) | |
Defined in System.Process.Typed.Internal Methods showsPrec :: Int -> ProcessConfig stdin stdout stderr -> ShowS # show :: ProcessConfig stdin stdout stderr -> String # showList :: [ProcessConfig stdin stdout stderr] -> ShowS # | |
| (Show a, Show b, Show c) => Show (a, b, c) | Since: base-2.1 |
| (Show (f a), Show (g a)) => Show (Product f g a) | Since: base-4.18.0.0 |
| (Show (f a), Show (g a)) => Show (Sum f g a) | Since: base-4.18.0.0 |
| Show (a :~~: b) | Since: base-4.10.0.0 |
| (Show (f p), Show (g p)) => Show ((f :*: g) p) | Since: base-4.7.0.0 |
| (Show (f p), Show (g p)) => Show ((f :+: g) p) | Since: base-4.7.0.0 |
| Show c => Show (K1 i c p) | Since: base-4.7.0.0 |
| (Show a, Show b, Show c, Show d) => Show (a, b, c, d) | Since: base-2.1 |
| Show (f (g a)) => Show (Compose f g a) | Since: base-4.18.0.0 |
| Show (f (g p)) => Show ((f :.: g) p) | Since: base-4.7.0.0 |
| Show (f p) => Show (M1 i c f p) | Since: base-4.7.0.0 |
| Show (f a) => Show (Clown f a b) | |
| Show (p b a) => Show (Flip p a b) | |
| Show (g b) => Show (Joker g a b) | |
| Show (p a b) => Show (WrappedBifunctor p a b) | |
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 a, Show b, Show c, Show d, Show e) => Show (a, b, c, d, e) | Since: base-2.1 |
| (Show (f a b), Show (g a b)) => Show (Product f g a b) | |
| (Show (p a b), Show (q a b)) => Show (Sum p q a b) | |
| (Show a, Show b, Show c, Show d, Show e, Show f) => Show (a, b, c, d, e, f) | Since: base-2.1 |
| Show (f (p a b)) => Show (Tannen f p a b) | |
| (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 |
| (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 |
| Show (p (f a) (g b)) => Show (Biff p f g a b) | |
| (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 |
| (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 |
| (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 |
| (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 |
| (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 |
| (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 |
| (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 |
The Bounded class is used to name the upper and lower limits of a
type. Ord is not a superclass of Bounded since types that are not
totally ordered may also have upper and lower bounds.
The Bounded class may be derived for any enumeration type;
minBound is the first constructor listed in the data declaration
and maxBound is the last.
Bounded may also be derived for single-constructor datatypes whose
constituent types are in Bounded.
Instances
| Bounded All | Since: base-2.1 |
| Bounded Any | Since: base-2.1 |
| Bounded CBool | |
| Bounded CChar | |
| Bounded CInt | |
| Bounded CIntMax | |
| Bounded CIntPtr | |
| Bounded CLLong | |
| Bounded CLong | |
| Bounded CPtrdiff | |
| Bounded CSChar | |
| Bounded CShort | |
| Bounded CSigAtomic | |
Defined in Foreign.C.Types | |
| Bounded CSize | |
| Bounded CUChar | |
| Bounded CUInt | |
| Bounded CUIntMax | |
| Bounded CUIntPtr | |
| Bounded CULLong | |
| Bounded CULong | |
| Bounded CUShort | |
| Bounded CWchar | |
| Bounded IntPtr | |
| Bounded WordPtr | |
| Bounded ByteOrder | Since: base-4.11.0.0 |
| Bounded Associativity | Since: base-4.9.0.0 |
Defined in GHC.Generics | |
| Bounded DecidedStrictness | Since: base-4.9.0.0 |
Defined in GHC.Generics | |
| Bounded SourceStrictness | Since: base-4.9.0.0 |
Defined in GHC.Generics | |
| Bounded SourceUnpackedness | Since: base-4.9.0.0 |
Defined in GHC.Generics | |
| Bounded Int16 | Since: base-2.1 |
| Bounded Int32 | Since: base-2.1 |
| Bounded Int64 | Since: base-2.1 |
| Bounded Int8 | Since: base-2.1 |
| Bounded GeneralCategory | Since: base-2.1 |
Defined in GHC.Unicode | |
| Bounded Word16 | Since: base-2.1 |
| Bounded Word32 | Since: base-2.1 |
| Bounded Word64 | Since: base-2.1 |
| Bounded Word8 | Since: base-2.1 |
| Bounded CBlkCnt | |
| Bounded CBlkSize | |
| Bounded CClockId | |
| Bounded CDev | |
| Bounded CFsBlkCnt | |
| Bounded CFsFilCnt | |
| Bounded CGid | |
| Bounded CId | |
| Bounded CIno | |
| Bounded CKey | |
| Bounded CMode | |
| Bounded CNfds | |
| Bounded CNlink | |
| Bounded COff | |
| Bounded CPid | |
| Bounded CRLim | |
| Bounded CSocklen | |
| Bounded CSsize | |
| Bounded CTcflag | |
| Bounded CUid | |
| Bounded Fd | |
| Bounded FileType | |
| Bounded XdgDirectory | |
Defined in System.Directory.Internal.Common | |
| Bounded XdgDirectoryList | |
Defined in System.Directory.Internal.Common | |
| Bounded PathType | Since: effects-unix-compat-0.1 |
| Bounded Extension | |
| Bounded Ordering | Since: base-2.1 |
| Bounded KeyHideSwitch Source # | |
| Bounded LogLevel Source # | |
| Bounded LogMode Source # | |
| Bounded Size | Since: si-bytes-0.1 |
| Bounded I8 | |
| Bounded FPFormat | |
| Bounded () | Since: base-2.1 |
| Bounded Bool | Since: base-2.1 |
| Bounded Char | Since: base-2.1 |
| Bounded Int | Since: base-2.1 |
| Bounded Levity | Since: base-4.16.0.0 |
| Bounded VecCount | Since: base-4.10.0.0 |
| Bounded VecElem | Since: base-4.10.0.0 |
| Bounded Word | Since: base-2.1 |
| Bounded a => Bounded (And a) | Since: base-4.16 |
| Bounded a => Bounded (Iff a) | Since: base-4.16 |
| Bounded a => Bounded (Ior a) | Since: base-4.16 |
| Bounded a => Bounded (Xor a) | Since: base-4.16 |
| Bounded a => Bounded (Identity a) | Since: base-4.9.0.0 |
| Bounded a => Bounded (Down a) | Swaps Since: base-4.14.0.0 |
| Bounded a => Bounded (First a) | Since: base-4.9.0.0 |
| Bounded a => Bounded (Last a) | Since: base-4.9.0.0 |
| Bounded a => Bounded (Max a) | Since: base-4.9.0.0 |
| Bounded a => Bounded (Min a) | Since: base-4.9.0.0 |
| Bounded m => Bounded (WrappedMonoid m) | Since: base-4.9.0.0 |
Defined in Data.Semigroup | |
| Bounded a => Bounded (Dual a) | Since: base-2.1 |
| Bounded a => Bounded (Product a) | Since: base-2.1 |
| Bounded a => Bounded (Sum a) | Since: base-2.1 |
| Bounded (StripControl t) Source # | |
Defined in Shrun.Configuration.Data.StripControl | |
| Bounded a => Bounded (Solo a) | |
| Bounded (Proxy t) | Since: base-4.7.0.0 |
| Bounded n => Bounded (Bytes s n) | Since: si-bytes-0.1 |
| (Bounded a, Bounded b) => Bounded (Pair a b) | |
| (Bounded a, Bounded b) => Bounded (a, b) | Since: base-2.1 |
| Bounded a => Bounded (Const a b) | Since: base-4.9.0.0 |
| (Applicative f, Bounded a) => Bounded (Ap f a) | Since: base-4.12.0.0 |
| Coercible a b => Bounded (Coercion a b) | Since: base-4.7.0.0 |
| a ~ b => Bounded (a :~: b) | Since: base-4.7.0.0 |
| Bounded b => Bounded (Tagged s b) | |
| (Bounded a, Bounded b, Bounded c) => Bounded (a, b, c) | Since: base-2.1 |
| a ~~ b => Bounded (a :~~: b) | Since: base-4.10.0.0 |
| (Bounded a, Bounded b, Bounded c, Bounded d) => Bounded (a, b, c, d) | Since: base-2.1 |
| Bounded (f (g a)) => Bounded (Compose f g a) | Since: base-4.19.0.0 |
| (Bounded a, Bounded b, Bounded c, Bounded d, Bounded e) => Bounded (a, b, c, d, e) | Since: base-2.1 |
| (Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f) => Bounded (a, b, c, d, e, f) | Since: base-2.1 |
| (Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g) => Bounded (a, b, c, d, e, f, g) | Since: base-2.1 |
| (Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g, Bounded h) => Bounded (a, b, c, d, e, f, g, h) | Since: base-2.1 |
| (Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g, Bounded h, Bounded i) => Bounded (a, b, c, d, e, f, g, h, i) | Since: base-2.1 |
| (Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g, Bounded h, Bounded i, Bounded j) => Bounded (a, b, c, d, e, f, g, h, i, j) | Since: base-2.1 |
| (Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g, Bounded h, Bounded i, Bounded j, Bounded k) => Bounded (a, b, c, d, e, f, g, h, i, j, k) | Since: base-2.1 |
| (Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g, Bounded h, Bounded i, Bounded j, Bounded k, Bounded l) => Bounded (a, b, c, d, e, f, g, h, i, j, k, l) | Since: base-2.1 |
| (Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g, Bounded h, Bounded i, Bounded j, Bounded k, Bounded l, Bounded m) => Bounded (a, b, c, d, e, f, g, h, i, j, k, l, m) | Since: base-2.1 |
| (Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g, Bounded h, Bounded i, Bounded j, Bounded k, Bounded l, Bounded m, Bounded n) => Bounded (a, b, c, d, e, f, g, h, i, j, k, l, m, n) | Since: base-2.1 |
| (Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g, Bounded h, Bounded i, Bounded j, Bounded k, Bounded l, Bounded m, Bounded n, Bounded o) => Bounded (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) | Since: base-2.1 |
Class Enum defines operations on sequentially ordered types.
The enumFrom... methods are used in Haskell's translation of
arithmetic sequences.
Instances of Enum may be derived for any enumeration type (types
whose constructors have no fields). The nullary constructors are
assumed to be numbered left-to-right by fromEnum from 0 through n-1.
See Chapter 10 of the Haskell Report for more details.
For any type that is an instance of class Bounded as well as Enum,
the following should hold:
- The calls
succmaxBoundpredminBound fromEnumandtoEnumshould give a runtime error if the result value is not representable in the result type. For example,toEnum7 ::BoolenumFromandenumFromThenshould be defined with an implicit bound, thus:
enumFrom x = enumFromTo x maxBound
enumFromThen x y = enumFromThenTo x y bound
where
bound | fromEnum y >= fromEnum x = maxBound
| otherwise = minBoundInstances
| Enum CBool | |
Defined in Foreign.C.Types | |
| Enum CChar | |
Defined in Foreign.C.Types | |
| Enum CClock | |
Defined in Foreign.C.Types | |
| Enum CDouble | |
| Enum CFloat | |
Defined in Foreign.C.Types | |
| Enum CInt | |
| Enum CIntMax | |
| Enum CIntPtr | |
| Enum CLLong | |
Defined in Foreign.C.Types | |
| Enum CLong | |
Defined in Foreign.C.Types | |
| Enum CPtrdiff | |
| Enum CSChar | |
Defined in Foreign.C.Types | |
| Enum CSUSeconds | |
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 CShort | |
Defined in Foreign.C.Types | |
| Enum CSigAtomic | |
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 CSize | |
Defined in Foreign.C.Types | |
| Enum CTime | |
Defined in Foreign.C.Types | |
| Enum CUChar | |
Defined in Foreign.C.Types | |
| Enum CUInt | |
Defined in Foreign.C.Types | |
| Enum CUIntMax | |
| Enum CUIntPtr | |
| Enum CULLong | |
| Enum CULong | |
Defined in Foreign.C.Types | |
| Enum CUSeconds | |
Defined in Foreign.C.Types Methods succ :: CUSeconds -> CUSeconds # pred :: CUSeconds -> CUSeconds # fromEnum :: CUSeconds -> Int # enumFrom :: CUSeconds -> [CUSeconds] # enumFromThen :: CUSeconds -> CUSeconds -> [CUSeconds] # enumFromTo :: CUSeconds -> CUSeconds -> [CUSeconds] # enumFromThenTo :: CUSeconds -> CUSeconds -> CUSeconds -> [CUSeconds] # | |
| Enum CUShort | |
| Enum CWchar | |
Defined in Foreign.C.Types | |
| Enum IntPtr | |
Defined in Foreign.Ptr | |
| Enum WordPtr | |
| Enum ByteOrder | Since: base-4.11.0.0 |
Defined in GHC.ByteOrder Methods succ :: ByteOrder -> ByteOrder # pred :: ByteOrder -> ByteOrder # fromEnum :: ByteOrder -> Int # enumFrom :: ByteOrder -> [ByteOrder] # enumFromThen :: ByteOrder -> ByteOrder -> [ByteOrder] # enumFromTo :: ByteOrder -> ByteOrder -> [ByteOrder] # enumFromThenTo :: ByteOrder -> ByteOrder -> ByteOrder -> [ByteOrder] # | |
| Enum Associativity | Since: base-4.9.0.0 |
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 DecidedStrictness | Since: base-4.9.0.0 |
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 SourceStrictness | Since: base-4.9.0.0 |
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 SourceUnpackedness | Since: base-4.9.0.0 |
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 SeekMode | Since: base-4.2.0.0 |
| Enum IOMode | Since: base-4.2.0.0 |
Defined in GHC.IO.IOMode | |
| Enum Int16 | Since: base-2.1 |
| Enum Int32 | Since: base-2.1 |
| Enum Int64 | Since: base-2.1 |
| Enum Int8 | Since: base-2.1 |
| Enum DoCostCentres | Since: base-4.8.0.0 |
Defined in GHC.RTS.Flags Methods succ :: DoCostCentres -> DoCostCentres # pred :: DoCostCentres -> DoCostCentres # toEnum :: Int -> DoCostCentres # fromEnum :: DoCostCentres -> Int # enumFrom :: DoCostCentres -> [DoCostCentres] # enumFromThen :: DoCostCentres -> DoCostCentres -> [DoCostCentres] # enumFromTo :: DoCostCentres -> DoCostCentres -> [DoCostCentres] # enumFromThenTo :: DoCostCentres -> DoCostCentres -> DoCostCentres -> [DoCostCentres] # | |
| Enum DoHeapProfile | Since: base-4.8.0.0 |
Defined in GHC.RTS.Flags Methods succ :: DoHeapProfile -> DoHeapProfile # pred :: DoHeapProfile -> DoHeapProfile # toEnum :: Int -> DoHeapProfile # fromEnum :: DoHeapProfile -> Int # enumFrom :: DoHeapProfile -> [DoHeapProfile] # enumFromThen :: DoHeapProfile -> DoHeapProfile -> [DoHeapProfile] # enumFromTo :: DoHeapProfile -> DoHeapProfile -> [DoHeapProfile] # enumFromThenTo :: DoHeapProfile -> DoHeapProfile -> DoHeapProfile -> [DoHeapProfile] # | |
| Enum DoTrace | Since: base-4.8.0.0 |
| Enum GiveGCStats | Since: base-4.8.0.0 |
Defined in GHC.RTS.Flags Methods succ :: GiveGCStats -> GiveGCStats # pred :: GiveGCStats -> GiveGCStats # toEnum :: Int -> GiveGCStats # fromEnum :: GiveGCStats -> Int # enumFrom :: GiveGCStats -> [GiveGCStats] # enumFromThen :: GiveGCStats -> GiveGCStats -> [GiveGCStats] # enumFromTo :: GiveGCStats -> GiveGCStats -> [GiveGCStats] # enumFromThenTo :: GiveGCStats -> GiveGCStats -> GiveGCStats -> [GiveGCStats] # | |
| Enum IoSubSystem | Since: base-4.9.0.0 |
Defined in GHC.RTS.Flags Methods succ :: IoSubSystem -> IoSubSystem # pred :: IoSubSystem -> IoSubSystem # toEnum :: Int -> IoSubSystem # fromEnum :: IoSubSystem -> Int # enumFrom :: IoSubSystem -> [IoSubSystem] # enumFromThen :: IoSubSystem -> IoSubSystem -> [IoSubSystem] # enumFromTo :: IoSubSystem -> IoSubSystem -> [IoSubSystem] # enumFromThenTo :: IoSubSystem -> IoSubSystem -> IoSubSystem -> [IoSubSystem] # | |
| Enum GeneralCategory | Since: base-2.1 |
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 Word16 | Since: base-2.1 |
Defined in GHC.Word | |
| Enum Word32 | Since: base-2.1 |
Defined in GHC.Word | |
| Enum Word64 | Since: base-2.1 |
Defined in GHC.Word | |
| Enum Word8 | Since: base-2.1 |
| Enum CBlkCnt | |
| Enum CBlkSize | |
Defined in System.Posix.Types | |
| Enum CCc | |
| Enum CClockId | |
Defined in System.Posix.Types | |
| Enum CDev | |
| Enum CFsBlkCnt | |
Defined in System.Posix.Types Methods succ :: CFsBlkCnt -> CFsBlkCnt # pred :: CFsBlkCnt -> CFsBlkCnt # fromEnum :: CFsBlkCnt -> Int # enumFrom :: CFsBlkCnt -> [CFsBlkCnt] # enumFromThen :: CFsBlkCnt -> CFsBlkCnt -> [CFsBlkCnt] # enumFromTo :: CFsBlkCnt -> CFsBlkCnt -> [CFsBlkCnt] # enumFromThenTo :: CFsBlkCnt -> CFsBlkCnt -> CFsBlkCnt -> [CFsBlkCnt] # | |
| Enum CFsFilCnt | |
Defined in System.Posix.Types Methods succ :: CFsFilCnt -> CFsFilCnt # pred :: CFsFilCnt -> CFsFilCnt # fromEnum :: CFsFilCnt -> Int # enumFrom :: CFsFilCnt -> [CFsFilCnt] # enumFromThen :: CFsFilCnt -> CFsFilCnt -> [CFsFilCnt] # enumFromTo :: CFsFilCnt -> CFsFilCnt -> [CFsFilCnt] # enumFromThenTo :: CFsFilCnt -> CFsFilCnt -> CFsFilCnt -> [CFsFilCnt] # | |
| Enum CGid | |
| Enum CId | |
| Enum CIno | |
| Enum CKey | |
| Enum CMode | |
Defined in System.Posix.Types | |
| Enum CNfds | |
Defined in System.Posix.Types | |
| Enum CNlink | |
Defined in System.Posix.Types | |
| Enum COff | |
| Enum CPid | |
| Enum CRLim | |
Defined in System.Posix.Types | |
| Enum CSocklen | |
Defined in System.Posix.Types | |
| Enum CSpeed | |
Defined in System.Posix.Types | |
| Enum CSsize | |
Defined in System.Posix.Types | |
| Enum CTcflag | |
| Enum CUid | |
| Enum Fd | |
| Enum FileType | |
Defined in System.Directory.Internal.Common | |
| Enum XdgDirectory | |
Defined in System.Directory.Internal.Common Methods succ :: XdgDirectory -> XdgDirectory # pred :: XdgDirectory -> XdgDirectory # toEnum :: Int -> XdgDirectory # fromEnum :: XdgDirectory -> Int # enumFrom :: XdgDirectory -> [XdgDirectory] # enumFromThen :: XdgDirectory -> XdgDirectory -> [XdgDirectory] # enumFromTo :: XdgDirectory -> XdgDirectory -> [XdgDirectory] # enumFromThenTo :: XdgDirectory -> XdgDirectory -> XdgDirectory -> [XdgDirectory] # | |
| Enum XdgDirectoryList | |
Defined in System.Directory.Internal.Common Methods succ :: XdgDirectoryList -> XdgDirectoryList # pred :: XdgDirectoryList -> XdgDirectoryList # toEnum :: Int -> XdgDirectoryList # fromEnum :: XdgDirectoryList -> Int # enumFrom :: XdgDirectoryList -> [XdgDirectoryList] # enumFromThen :: XdgDirectoryList -> XdgDirectoryList -> [XdgDirectoryList] # enumFromTo :: XdgDirectoryList -> XdgDirectoryList -> [XdgDirectoryList] # enumFromThenTo :: XdgDirectoryList -> XdgDirectoryList -> XdgDirectoryList -> [XdgDirectoryList] # | |
| Enum PathType | Since: effects-unix-compat-0.1 |
Defined in Effects.System.PosixCompat | |
| Enum UrgencyLevel | |
Defined in DBus.Notify Methods succ :: UrgencyLevel -> UrgencyLevel # pred :: UrgencyLevel -> UrgencyLevel # toEnum :: Int -> UrgencyLevel # fromEnum :: UrgencyLevel -> Int # enumFrom :: UrgencyLevel -> [UrgencyLevel] # enumFromThen :: UrgencyLevel -> UrgencyLevel -> [UrgencyLevel] # enumFromTo :: UrgencyLevel -> UrgencyLevel -> [UrgencyLevel] # enumFromThenTo :: UrgencyLevel -> UrgencyLevel -> UrgencyLevel -> [UrgencyLevel] # | |
| Enum Extension | |
Defined in GHC.LanguageExtensions.Type Methods succ :: Extension -> Extension # pred :: Extension -> Extension # fromEnum :: Extension -> Int # enumFrom :: Extension -> [Extension] # enumFromThen :: Extension -> Extension -> [Extension] # enumFromTo :: Extension -> Extension -> [Extension] # enumFromThenTo :: Extension -> Extension -> Extension -> [Extension] # | |
| Enum Ordering | Since: base-2.1 |
| Enum Color | |
Defined in System.Console.Pretty | |
| Enum Style | |
Defined in System.Console.Pretty | |
| Enum KeyHideSwitch Source # | |
Defined in Shrun.Configuration.Data.CommonLogging.KeyHideSwitch Methods succ :: KeyHideSwitch -> KeyHideSwitch # pred :: KeyHideSwitch -> KeyHideSwitch # toEnum :: Int -> KeyHideSwitch # fromEnum :: KeyHideSwitch -> Int # enumFrom :: KeyHideSwitch -> [KeyHideSwitch] # enumFromThen :: KeyHideSwitch -> KeyHideSwitch -> [KeyHideSwitch] # enumFromTo :: KeyHideSwitch -> KeyHideSwitch -> [KeyHideSwitch] # enumFromThenTo :: KeyHideSwitch -> KeyHideSwitch -> KeyHideSwitch -> [KeyHideSwitch] # | |
| Enum LogLevel Source # | |
Defined in Shrun.Logging.Types | |
| Enum LogMode Source # | |
| Enum Size | Since: si-bytes-0.1 |
| Enum I8 | |
| Enum FPFormat | |
Defined in Data.Text.Lazy.Builder.RealFloat | |
| Enum Integer | Since: base-2.1 |
| Enum Natural | Since: base-4.8.0.0 |
| Enum () | Since: base-2.1 |
| Enum Bool | Since: base-2.1 |
| Enum Char | Since: base-2.1 |
| Enum Int | Since: base-2.1 |
| Enum Levity | Since: base-4.16.0.0 |
Defined in GHC.Enum | |
| Enum VecCount | Since: base-4.10.0.0 |
| Enum VecElem | Since: base-4.10.0.0 |
| Enum Word | Since: base-2.1 |
| Enum a => Enum (And a) | Since: base-4.16 |
| Enum a => Enum (Iff a) | Since: base-4.16 |
| Enum a => Enum (Ior a) | Since: base-4.16 |
| Enum a => Enum (Xor a) | Since: base-4.16 |
| Enum a => Enum (Identity a) | Since: base-4.9.0.0 |
Defined in Data.Functor.Identity Methods succ :: Identity a -> Identity a # pred :: Identity a -> Identity a # fromEnum :: Identity a -> Int # enumFrom :: Identity a -> [Identity a] # enumFromThen :: Identity a -> Identity a -> [Identity a] # enumFromTo :: Identity a -> Identity a -> [Identity a] # enumFromThenTo :: Identity a -> Identity a -> Identity a -> [Identity a] # | |
| (Enum a, Bounded a, Eq a) => Enum (Down a) | Swaps Since: base-4.18.0.0 |
Defined in Data.Ord | |
| Enum a => Enum (First a) | Since: base-4.9.0.0 |
| Enum a => Enum (Last a) | Since: base-4.9.0.0 |
Defined in Data.Semigroup | |
| Enum a => Enum (Max a) | Since: base-4.9.0.0 |
| Enum a => Enum (Min a) | Since: base-4.9.0.0 |
| Enum a => Enum (WrappedMonoid a) | Since: base-4.9.0.0 |
Defined in Data.Semigroup Methods succ :: WrappedMonoid a -> WrappedMonoid a # pred :: WrappedMonoid a -> WrappedMonoid a # toEnum :: Int -> WrappedMonoid a # fromEnum :: WrappedMonoid a -> Int # enumFrom :: WrappedMonoid a -> [WrappedMonoid a] # enumFromThen :: WrappedMonoid a -> WrappedMonoid a -> [WrappedMonoid a] # enumFromTo :: WrappedMonoid a -> WrappedMonoid a -> [WrappedMonoid a] # enumFromThenTo :: WrappedMonoid a -> WrappedMonoid a -> WrappedMonoid a -> [WrappedMonoid a] # | |
| Integral a => Enum (Ratio a) | Since: base-2.0.1 |
| Enum (StripControl t) Source # | |
Defined in Shrun.Configuration.Data.StripControl Methods succ :: StripControl t -> StripControl t # pred :: StripControl t -> StripControl t # toEnum :: Int -> StripControl t # fromEnum :: StripControl t -> Int # enumFrom :: StripControl t -> [StripControl t] # enumFromThen :: StripControl t -> StripControl t -> [StripControl t] # enumFromTo :: StripControl t -> StripControl t -> [StripControl t] # enumFromThenTo :: StripControl t -> StripControl t -> StripControl t -> [StripControl t] # | |
| Enum a => Enum (Solo a) | |
Defined in GHC.Enum | |
| Enum (Fixed a) | Recall that, for numeric types, succ (0.000 :: Milli) == 0.001 and likewise pred (0.000 :: Milli) == -0.001 In other words, succ (0.000000000000 :: Pico) == 0.000000000001 and similarly pred (0.000000000000 :: Pico) == -0.000000000001 This is worth bearing in mind when defining [1..10] :: [Pico] evaluates to However, this is not true. On the contrary, similarly to the above
implementations of [1.000000000000, 1.00000000001, 1.00000000002, ..., 10.000000000000] and contains Since: base-2.1 |
| Enum (Proxy s) | Since: base-4.7.0.0 |
| Enum a => Enum (Const a b) | Since: base-4.9.0.0 |
Defined in Data.Functor.Const Methods succ :: Const a b -> Const a b # pred :: Const a b -> Const a b # fromEnum :: Const a b -> Int # enumFrom :: Const a b -> [Const a b] # enumFromThen :: Const a b -> Const a b -> [Const a b] # enumFromTo :: Const a b -> Const a b -> [Const a b] # enumFromThenTo :: Const a b -> Const a b -> Const a b -> [Const a b] # | |
| Enum (f a) => Enum (Ap f a) | Since: base-4.12.0.0 |
Defined in Data.Monoid | |
| Enum (f a) => Enum (Alt f a) | Since: base-4.8.0.0 |
| Coercible a b => Enum (Coercion a b) | Since: base-4.7.0.0 |
Defined in Data.Type.Coercion Methods succ :: Coercion a b -> Coercion a b # pred :: Coercion a b -> Coercion a b # toEnum :: Int -> Coercion a b # fromEnum :: Coercion a b -> Int # enumFrom :: Coercion a b -> [Coercion a b] # enumFromThen :: Coercion a b -> Coercion a b -> [Coercion a b] # enumFromTo :: Coercion a b -> Coercion a b -> [Coercion a b] # enumFromThenTo :: Coercion a b -> Coercion a b -> Coercion a b -> [Coercion a b] # | |
| a ~ b => Enum (a :~: b) | Since: base-4.7.0.0 |
Defined in Data.Type.Equality Methods succ :: (a :~: b) -> a :~: b # pred :: (a :~: b) -> 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) | |
Defined in Data.Tagged Methods succ :: Tagged s a -> Tagged s a # pred :: Tagged s a -> 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 |
Defined in Data.Type.Equality Methods succ :: (a :~~: b) -> a :~~: b # pred :: (a :~~: b) -> 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 (f (g a)) => Enum (Compose f g a) | Since: base-4.19.0.0 |
Defined in Data.Functor.Compose Methods succ :: Compose f g a -> Compose f g a # pred :: Compose f g a -> Compose f g a # toEnum :: Int -> Compose f g a # fromEnum :: Compose f g a -> Int # enumFrom :: Compose f g a -> [Compose f g a] # enumFromThen :: Compose f g a -> Compose f g a -> [Compose f g a] # enumFromTo :: Compose f g a -> Compose f g a -> [Compose f g a] # enumFromThenTo :: Compose f g a -> Compose f g a -> Compose f g a -> [Compose f g a] # | |
class (Real a, Enum a) => Integral a #
Integral numbers, supporting integer division.
The Haskell Report defines no laws for Integral. However, Integral
instances are customarily expected to define a Euclidean domain and have the
following properties for the div/mod and quot/rem pairs, given
suitable Euclidean functions f and g:
x=y * quot x y + rem x ywithrem x y=fromInteger 0org (rem x y)<g yx=y * div x y + mod x ywithmod x y=fromInteger 0orf (mod x y)<f y
An example of a suitable Euclidean function, for Integer's instance, is
abs.
In addition, toInteger should be total, and fromInteger should be a left
inverse for it, i.e. fromInteger (toInteger i) = i.
Instances
| Integral CBool | |
| Integral CChar | |
| Integral CInt | |
| Integral CIntMax | |
Defined in Foreign.C.Types | |
| Integral CIntPtr | |
Defined in Foreign.C.Types | |
| Integral CLLong | |
Defined in Foreign.C.Types | |
| Integral CLong | |
| Integral CPtrdiff | |
Defined in Foreign.C.Types | |
| Integral CSChar | |
Defined in Foreign.C.Types | |
| Integral CShort | |
Defined in Foreign.C.Types | |
| Integral CSigAtomic | |
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 CSize | |
| Integral CUChar | |
Defined in Foreign.C.Types | |
| Integral CUInt | |
| Integral CUIntMax | |
Defined in Foreign.C.Types | |
| Integral CUIntPtr | |
Defined in Foreign.C.Types | |
| Integral CULLong | |
Defined in Foreign.C.Types | |
| Integral CULong | |
Defined in Foreign.C.Types | |
| Integral CUShort | |
Defined in Foreign.C.Types | |
| Integral CWchar | |
Defined in Foreign.C.Types | |
| Integral IntPtr | |
Defined in Foreign.Ptr | |
| Integral WordPtr | |
Defined in Foreign.Ptr | |
| Integral Int16 | Since: base-2.1 |
| Integral Int32 | Since: base-2.1 |
| Integral Int64 | Since: base-2.1 |
| Integral Int8 | Since: base-2.1 |
| Integral Word16 | Since: base-2.1 |
| Integral Word32 | Since: base-2.1 |
| Integral Word64 | Since: base-2.1 |
| Integral Word8 | Since: base-2.1 |
| Integral CBlkCnt | |
Defined in System.Posix.Types | |
| Integral CBlkSize | |
Defined in System.Posix.Types | |
| Integral CClockId | |
Defined in System.Posix.Types | |
| Integral CDev | |
| Integral CFsBlkCnt | |
Defined in System.Posix.Types Methods quot :: CFsBlkCnt -> CFsBlkCnt -> CFsBlkCnt # rem :: CFsBlkCnt -> CFsBlkCnt -> CFsBlkCnt # div :: CFsBlkCnt -> CFsBlkCnt -> CFsBlkCnt # mod :: CFsBlkCnt -> CFsBlkCnt -> CFsBlkCnt # quotRem :: CFsBlkCnt -> CFsBlkCnt -> (CFsBlkCnt, CFsBlkCnt) # divMod :: CFsBlkCnt -> CFsBlkCnt -> (CFsBlkCnt, CFsBlkCnt) # | |
| Integral CFsFilCnt | |
Defined in System.Posix.Types Methods quot :: CFsFilCnt -> CFsFilCnt -> CFsFilCnt # rem :: CFsFilCnt -> CFsFilCnt -> CFsFilCnt # div :: CFsFilCnt -> CFsFilCnt -> CFsFilCnt # mod :: CFsFilCnt -> CFsFilCnt -> CFsFilCnt # quotRem :: CFsFilCnt -> CFsFilCnt -> (CFsFilCnt, CFsFilCnt) # divMod :: CFsFilCnt -> CFsFilCnt -> (CFsFilCnt, CFsFilCnt) # | |
| Integral CGid | |
| Integral CId | |
| Integral CIno | |
| Integral CKey | |
| Integral CMode | |
| Integral CNfds | |
| Integral CNlink | |
Defined in System.Posix.Types | |
| Integral COff | |
| Integral CPid | |
| Integral CRLim | |
| Integral CSocklen | |
Defined in System.Posix.Types | |
| Integral CSsize | |
Defined in System.Posix.Types | |
| Integral CTcflag | |
Defined in System.Posix.Types | |
| Integral CUid | |
| Integral Fd | |
| Integral I8 | |
| Integral Integer | Since: base-2.0.1 |
Defined in GHC.Real | |
| Integral Natural | Since: base-4.8.0.0 |
Defined in GHC.Real | |
| Integral Int | Since: base-2.0.1 |
| Integral Word | Since: base-2.1 |
| Integral a => Integral (Identity a) | Since: base-4.9.0.0 |
Defined in Data.Functor.Identity Methods quot :: Identity a -> Identity a -> Identity a # rem :: Identity a -> Identity a -> Identity a # div :: Identity a -> Identity a -> Identity a # mod :: Identity a -> Identity a -> Identity a # quotRem :: Identity a -> Identity a -> (Identity a, Identity a) # divMod :: Identity a -> Identity a -> (Identity a, Identity a) # | |
| Integral a => Integral (Const a b) | Since: base-4.9.0.0 |
Defined in Data.Functor.Const Methods quot :: Const a b -> Const a b -> Const a b # rem :: Const a b -> Const a b -> Const a b # div :: Const a b -> Const a b -> Const a b # mod :: Const a b -> Const a b -> Const a b # quotRem :: Const a b -> Const a b -> (Const a b, Const a b) # divMod :: Const a b -> Const a b -> (Const a b, Const a b) # | |
| Integral a => Integral (Tagged s a) | |
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) # | |
| Integral (f (g a)) => Integral (Compose f g a) | Since: base-4.19.0.0 |
Defined in Data.Functor.Compose Methods quot :: Compose f g a -> Compose f g a -> Compose f g a # rem :: Compose f g a -> Compose f g a -> Compose f g a # div :: Compose f g a -> Compose f g a -> Compose f g a # mod :: Compose f g a -> Compose f g a -> Compose f g a # quotRem :: Compose f g a -> Compose f g a -> (Compose f g a, Compose f g a) # divMod :: Compose f g a -> Compose f g a -> (Compose f g a, Compose f g a) # | |
A value of type IO aa.
There is really only one way to "perform" an I/O action: bind it to
Main.main in your program. When your program is run, the I/O will
be performed. It isn't possible to perform I/O from an arbitrary
function, unless that function is itself in the IO monad and called
at some point, directly or indirectly, from Main.main.
IO is a monad, so IO actions can be combined using either the do-notation
or the >> and >>= operations from the Monad
class.
Instances
| MonadFail IO | Since: base-4.9.0.0 | ||||
Defined in Control.Monad.Fail | |||||
| MonadFix IO | Since: base-2.1 | ||||
Defined in Control.Monad.Fix | |||||
| MonadIO IO | Since: base-4.9.0.0 | ||||
Defined in Control.Monad.IO.Class | |||||
| Alternative IO | Takes the first non-throwing Since: base-4.9.0.0 | ||||
| Applicative IO | Since: base-2.1 | ||||
| Functor IO | Since: base-2.1 | ||||
| Monad IO | Since: base-2.1 | ||||
| MonadPlus IO | Takes the first non-throwing Since: base-4.9.0.0 | ||||
| GHCiSandboxIO IO | Since: base-4.4.0.0 | ||||
Defined in GHC.GHCi Methods ghciStepIO :: IO a -> IO a # | |||||
| LiftRegion IO | |||||
Defined in System.Console.Regions Methods liftRegion :: STM a -> IO a Source # | |||||
| MonadAsync IO | Since: effects-async-0.1 | ||||
Defined in Effects.Concurrent.Async Methods withAsync :: HasCallStack => IO a -> (Async a -> IO b) -> IO b Source # withAsyncBound :: HasCallStack => IO a -> (Async a -> IO b) -> IO b Source # withAsyncOn :: HasCallStack => Int -> IO a -> (Async a -> IO b) -> IO b Source # withAsyncWithUnmask :: HasCallStack => ((forall c. IO c -> IO c) -> IO a) -> (Async a -> IO b) -> IO b Source # withAsyncOnWithUnmask :: HasCallStack => Int -> ((forall c. IO c -> IO c) -> IO a) -> (Async a -> IO b) -> IO b Source # wait :: HasCallStack => Async a -> IO a Source # poll :: HasCallStack => Async a -> IO (Maybe (Either SomeException a)) Source # waitCatch :: HasCallStack => Async a -> IO (Either SomeException a) Source # cancel :: HasCallStack => Async a -> IO () Source # uninterruptibleCancel :: HasCallStack => Async a -> IO () Source # cancelWith :: (Exception e, HasCallStack) => Async a -> e -> IO () Source # race :: HasCallStack => IO a -> IO b -> IO (Either a b) Source # concurrently :: HasCallStack => IO a -> IO b -> IO (a, b) Source # concurrently_ :: HasCallStack => IO a -> IO b -> IO () Source # waitAny :: HasCallStack => [Async a] -> IO (Async a, a) Source # waitAnyCatch :: HasCallStack => [Async a] -> IO (Async a, Either SomeException a) Source # waitAnyCancel :: HasCallStack => [Async a] -> IO (Async a, a) Source # waitAnyCatchCancel :: HasCallStack => [Async a] -> IO (Async a, Either SomeException a) Source # waitEither :: HasCallStack => Async a -> Async b -> IO (Either a b) Source # waitEitherCatch :: HasCallStack => Async a -> Async b -> IO (Either (Either SomeException a) (Either SomeException b)) Source # waitEitherCancel :: HasCallStack => Async a -> Async b -> IO (Either a b) Source # waitEitherCatchCancel :: HasCallStack => Async a -> Async b -> IO (Either (Either SomeException a) (Either SomeException b)) Source # waitEither_ :: HasCallStack => Async a -> Async b -> IO () Source # waitBoth :: HasCallStack => Async a -> Async b -> IO (a, b) Source # async :: HasCallStack => IO a -> IO (Async a) Source # asyncBound :: HasCallStack => IO a -> IO (Async a) Source # asyncOn :: HasCallStack => Int -> IO a -> IO (Async a) Source # asyncWithUnmask :: HasCallStack => ((forall b. IO b -> IO b) -> IO a) -> IO (Async a) Source # asyncOnWithUnmask :: HasCallStack => Int -> ((forall b. IO b -> IO b) -> IO a) -> IO (Async a) Source # link :: HasCallStack => Async a -> IO () Source # linkOnly :: HasCallStack => (SomeException -> Bool) -> Async a -> IO () Source # link2 :: HasCallStack => Async a -> Async b -> IO () Source # link2Only :: HasCallStack => (SomeException -> Bool) -> Async a -> Async b -> IO () Source # pooledMapConcurrentlyN :: (HasCallStack, Traversable t) => Positive Int -> (a -> IO b) -> t a -> IO (t b) Source # pooledMapConcurrently :: (HasCallStack, Traversable t) => (a -> IO b) -> t a -> IO (t b) Source # pooledMapConcurrentlyN_ :: (Foldable f, HasCallStack) => Positive Int -> (a -> IO b) -> f a -> IO () Source # pooledMapConcurrently_ :: (Foldable f, HasCallStack) => (a -> IO b) -> f a -> IO () Source # | |||||
| MonadEnv IO | Since: effects-env-0.1 | ||||
Defined in Effects.System.Environment Methods getArgs :: IO [String] Source # getProgName :: IO String Source # executablePath :: Maybe (IO (Maybe FilePath)) Source # getExecutablePath :: IO FilePath Source # getEnv :: String -> IO String Source # lookupEnv :: String -> IO (Maybe String) Source # setEnv :: String -> String -> IO () Source # unsetEnv :: String -> IO () Source # withArgs :: HasCallStack => [String] -> IO a -> IO a Source # withProgName :: HasCallStack => String -> IO a -> IO a Source # | |||||
| MonadGlobalException IO | Since: effects-exceptions-0.1 | ||||
Defined in Effects.Exception.Annotation.Common Methods setUncaughtExceptionHandler :: (SomeException -> IO ()) -> IO () Source # getUncaughtExceptionHandler :: IO (SomeException -> IO ()) Source # | |||||
| MonadFileReader IO | Since: effects-fs-0.1 | ||||
Defined in Effects.FileSystem.FileReader Methods readBinaryFile :: OsPath -> IO ByteString Source # | |||||
| MonadFileWriter IO | Since: effects-fs-0.1 | ||||
Defined in Effects.FileSystem.FileWriter Methods writeBinaryFile :: OsPath -> ByteString -> IO () Source # appendBinaryFile :: OsPath -> ByteString -> IO () Source # | |||||
| MonadHandleReader IO | Since: effects-fs-0.1 | ||||
Defined in Effects.FileSystem.HandleReader Methods hIsEOF :: Handle -> IO Bool Source # hGetBuffering :: Handle -> IO BufferMode Source # hIsOpen :: Handle -> IO Bool Source # hIsClosed :: Handle -> IO Bool Source # hIsReadable :: Handle -> IO Bool Source # hIsWritable :: Handle -> IO Bool Source # hIsSeekable :: Handle -> IO Bool Source # hIsTerminalDevice :: Handle -> IO Bool Source # hGetEcho :: Handle -> IO Bool Source # hWaitForInput :: Handle -> Int -> IO Bool Source # hReady :: Handle -> IO Bool Source # hGetChar :: Handle -> IO Char Source # hGetLine :: Handle -> IO ByteString Source # hGetContents :: Handle -> IO ByteString Source # hGet :: Handle -> Int -> IO ByteString Source # hGetSome :: Handle -> Int -> IO ByteString Source # hGetNonBlocking :: Handle -> Int -> IO ByteString Source # | |||||
| MonadHandleWriter IO | Since: effects-fs-0.1 | ||||
Defined in Effects.FileSystem.HandleWriter Methods openBinaryFile :: OsPath -> IOMode -> IO Handle Source # withBinaryFile :: HasCallStack => OsPath -> IOMode -> (Handle -> IO a) -> IO a Source # hClose :: Handle -> IO () Source # hFlush :: Handle -> IO () Source # hSetFileSize :: Handle -> Integer -> IO () Source # hSetBuffering :: Handle -> BufferMode -> IO () Source # hSeek :: Handle -> SeekMode -> Integer -> IO () Source # hTell :: Handle -> IO Integer Source # hSetEcho :: Handle -> Bool -> IO () Source # hPut :: Handle -> ByteString -> IO () Source # hPutNonBlocking :: Handle -> ByteString -> IO ByteString Source # | |||||
| MonadPathReader IO | |||||
Defined in Effects.FileSystem.PathReader Methods listDirectory :: OsPath -> IO [OsPath] Source # getDirectoryContents :: OsPath -> IO [OsPath] Source # getCurrentDirectory :: IO OsPath Source # getHomeDirectory :: IO OsPath Source # getXdgDirectory :: XdgDirectory -> OsPath -> IO OsPath Source # getXdgDirectoryList :: XdgDirectoryList -> IO [OsPath] Source # getAppUserDataDirectory :: OsPath -> IO OsPath Source # getUserDocumentsDirectory :: IO OsPath Source # getTemporaryDirectory :: IO OsPath Source # getFileSize :: OsPath -> IO Integer Source # canonicalizePath :: OsPath -> IO OsPath Source # makeAbsolute :: OsPath -> IO OsPath Source # makeRelativeToCurrentDirectory :: OsPath -> IO OsPath Source # doesPathExist :: OsPath -> IO Bool Source # doesFileExist :: OsPath -> IO Bool Source # doesDirectoryExist :: OsPath -> IO Bool Source # findExecutable :: OsPath -> IO (Maybe OsPath) Source # findExecutables :: OsPath -> IO [OsPath] Source # findExecutablesInDirectories :: [OsPath] -> OsPath -> IO [OsPath] Source # findFileWith :: (OsPath -> IO Bool) -> [OsPath] -> OsPath -> IO (Maybe OsPath) Source # findFilesWith :: (OsPath -> IO Bool) -> [OsPath] -> OsPath -> IO [OsPath] Source # pathIsSymbolicLink :: OsPath -> IO Bool Source # getSymbolicLinkTarget :: OsPath -> IO OsPath Source # getPermissions :: OsPath -> IO Permissions Source # | |||||
| MonadPathWriter IO | Since: effects-fs-0.1 | ||||
Defined in Effects.FileSystem.PathWriter Methods createDirectory :: OsPath -> IO () Source # createDirectoryIfMissing :: Bool -> OsPath -> IO () Source # removeDirectory :: OsPath -> IO () Source # removeDirectoryRecursive :: OsPath -> IO () Source # removePathForcibly :: OsPath -> IO () Source # renameDirectory :: OsPath -> OsPath -> IO () Source # setCurrentDirectory :: OsPath -> IO () Source # withCurrentDirectory :: HasCallStack => OsPath -> IO a -> IO a Source # removeFile :: OsPath -> IO () Source # renameFile :: OsPath -> OsPath -> IO () Source # renamePath :: OsPath -> OsPath -> IO () Source # copyFile :: OsPath -> OsPath -> IO () Source # copyFileWithMetadata :: OsPath -> OsPath -> IO () Source # createFileLink :: OsPath -> OsPath -> IO () Source # createDirectoryLink :: OsPath -> OsPath -> IO () Source # removeDirectoryLink :: OsPath -> IO () Source # setPermissions :: OsPath -> Permissions -> IO () Source # copyPermissions :: OsPath -> OsPath -> IO () Source # | |||||
| MonadIORef IO | Since: effects-ioref-0.1 | ||||
Defined in Effects.IORef Methods newIORef :: HasCallStack => a -> IO (IORef a) Source # readIORef :: HasCallStack => IORef a -> IO a Source # writeIORef :: HasCallStack => IORef a -> a -> IO () Source # atomicWriteIORef :: HasCallStack => IORef a -> a -> IO () Source # modifyIORef' :: HasCallStack => IORef a -> (a -> a) -> IO () Source # atomicModifyIORef' :: HasCallStack => IORef a -> (a -> (a, b)) -> IO b Source # | |||||
| MonadOptparse IO | Since: effects-optparse-0.1 | ||||
Defined in Effects.Optparse Methods execParser :: HasCallStack => ParserInfo a -> IO a Source # customExecParser :: HasCallStack => ParserPrefs -> ParserInfo a -> IO a Source # handleParseResult :: HasCallStack => ParserResult a -> IO a Source # | |||||
| MonadSTM IO | Since: effects-stm-0.1 | ||||
Defined in Effects.Concurrent.STM Methods atomically :: HasCallStack => STM a -> IO a Source # | |||||
| MonadTerminal IO | Since: effects-terminal-0.1 | ||||
Defined in Effects.System.Terminal | |||||
| MonadQSem IO | Since: effects-thread-0.1 | ||||
| MonadQSemN IO | Since: effects-thread-0.1 | ||||
| MonadThread IO | Since: effects-thread-0.1 | ||||
Defined in Effects.Concurrent.Thread Methods threadDelay :: Int -> IO () Source # throwTo :: (Exception e, HasCallStack) => ThreadId -> e -> IO () Source # getNumCapabilities :: IO Int Source # setNumCapabilities :: Int -> IO () Source # threadCapability :: ThreadId -> IO (Int, Bool) Source # myThreadId :: IO ThreadId Source # | |||||
| MonadTime IO | Since: effects-time-0.1 | ||||
Defined in Effects.Time | |||||
| MonadTypedProcess IO | Since: effects-typed-process-0.1 | ||||
Defined in Effects.Process.Typed Methods runProcess :: HasCallStack => ProcessConfig stdin stdout stderr -> IO ExitCode Source # readProcess :: HasCallStack => ProcessConfig stdin stdoutIgnored stderrIgnored -> IO (ExitCode, ByteString, ByteString) Source # readProcessStdout :: HasCallStack => ProcessConfig stdin stdoutIgnored stderr -> IO (ExitCode, ByteString) Source # readProcessStderr :: HasCallStack => ProcessConfig stdin stdout stderrIgnored -> IO (ExitCode, ByteString) Source # readProcessInterleaved :: HasCallStack => ProcessConfig stdin stdoutIgnored stderrIgnored -> IO (ExitCode, ByteString) Source # withProcessWait :: HasCallStack => ProcessConfig stdin stdout stderr -> (Process stdin stdout stderr -> IO a) -> IO a Source # withProcessTerm :: HasCallStack => ProcessConfig stdin stdout stderr -> (Process stdin stdout stderr -> IO a) -> IO a Source # startProcess :: HasCallStack => ProcessConfig stdin stdout stderr -> IO (Process stdin stdout stderr) Source # stopProcess :: HasCallStack => Process stdin stdout stderr -> IO () Source # runProcess_ :: HasCallStack => ProcessConfig stdin stdout stderr -> IO () Source # readProcess_ :: HasCallStack => ProcessConfig stdin stdoutIgnored stderrIgnored -> IO (ByteString, ByteString) Source # readProcessStdout_ :: HasCallStack => ProcessConfig stdin stdoutIgnored stderr -> IO ByteString Source # readProcessStderr_ :: HasCallStack => ProcessConfig stdin stdout stderrIgnored -> IO ByteString Source # readProcessInterleaved_ :: HasCallStack => ProcessConfig stdin stdoutIgnored stderrIgnored -> IO ByteString Source # withProcessWait_ :: HasCallStack => ProcessConfig stdin stdout stderr -> (Process stdin stdout stderr -> IO a) -> IO a Source # withProcessTerm_ :: HasCallStack => ProcessConfig stdin stdout stderr -> (Process stdin stdout stderr -> IO a) -> IO a Source # waitExitCode :: HasCallStack => Process stdin stdout stderr -> IO ExitCode Source # getExitCode :: HasCallStack => Process stdin stdout stderr -> IO (Maybe ExitCode) Source # checkExitCode :: HasCallStack => Process stdin stdout stderr -> IO () Source # | |||||
| MonadPosixCompat IO | Since: effects-unix-compat-0.1 | ||||
Defined in Effects.System.PosixCompat Methods setFileMode :: FilePath -> FileMode -> IO () Source # setFdMode :: Fd -> FileMode -> IO () Source # setFileCreationMask :: FileMode -> IO FileMode Source # fileAccess :: FilePath -> Bool -> Bool -> Bool -> IO Bool Source # fileExist :: FilePath -> IO Bool Source # getFileStatus :: FilePath -> IO FileStatus Source # getFdStatus :: Fd -> IO FileStatus Source # getSymbolicLinkStatus :: FilePath -> IO FileStatus Source # createNamedPipe :: FilePath -> FileMode -> IO () Source # createDevice :: FilePath -> FileMode -> DeviceID -> IO () Source # createLink :: FilePath -> FilePath -> IO () Source # removeLink :: FilePath -> IO () Source # createSymbolicLink :: FilePath -> FilePath -> IO () Source # readSymbolicLink :: FilePath -> IO FilePath Source # rename :: FilePath -> FilePath -> IO () Source # setOwnerAndGroup :: FilePath -> UserID -> GroupID -> IO () Source # setFdOwnerAndGroup :: Fd -> UserID -> GroupID -> IO () Source # setSymbolicLinkOwnerAndGroup :: FilePath -> UserID -> GroupID -> IO () Source # setFileTimes :: FilePath -> EpochTime -> EpochTime -> IO () Source # touchFile :: FilePath -> IO () Source # setFileSize :: FilePath -> FileOffset -> IO () Source # setFdSize :: Fd -> FileOffset -> IO () Source # | |||||
| MonadCatch IO | |||||
Defined in Control.Monad.Catch | |||||
| MonadMask IO | |||||
Defined in Control.Monad.Catch Methods mask :: HasCallStack => ((forall a. IO a -> IO a) -> IO b) -> IO b # uninterruptibleMask :: HasCallStack => ((forall a. IO a -> IO a) -> IO b) -> IO b # generalBracket :: HasCallStack => IO a -> (a -> ExitCase b -> IO c) -> (a -> IO b) -> IO (b, c) # | |||||
| MonadThrow IO | |||||
Defined in Control.Monad.Catch Methods throwM :: (HasCallStack, Exception e) => e -> IO a # | |||||
| PrimBase IO | |||||
| PrimMonad IO | |||||
| MonadRegionLogger IO Source # | |||||
Defined in Shrun.Logging.MonadRegionLogger Associated Types
| |||||
| MonadAppleScript IO Source # | |||||
Defined in Shrun.Notify.MonadAppleScript | |||||
| MonadDBus IO Source # | |||||
Defined in Shrun.Notify.MonadDBus | |||||
| MonadNotifySend IO Source # | |||||
Defined in Shrun.Notify.MonadNotifySend | |||||
| Quasi IO | |||||
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) # qReifyFixity :: Name -> IO (Maybe Fixity) # qReifyType :: Name -> IO Type # qReifyInstances :: Name -> [Type] -> IO [Dec] # qReifyRoles :: Name -> IO [Role] # qReifyAnnotations :: Data a => AnnLookup -> IO [a] # qReifyModule :: Module -> IO ModuleInfo # qReifyConStrictness :: Name -> IO [DecidedStrictness] # qGetPackageRoot :: IO FilePath # 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] # | |||||
| Quote IO | |||||
| MonadError IOException IO | |||||
Defined in Control.Monad.Error.Class | |||||
| Monoid a => Monoid (IO a) | Since: base-4.9.0.0 | ||||
| Semigroup a => Semigroup (IO a) | Since: base-4.10.0.0 | ||||
| a ~ () => HPrintfType (IO a) | Since: base-4.7.0.0 | ||||
Defined in Text.Printf | |||||
| a ~ () => PrintfType (IO a) | Since: base-4.7.0.0 | ||||
Defined in Text.Printf | |||||
| IsValue a => AutoMethod (DBusR (Either Reply a)) | |||||
| IsValue a => AutoMethod (DBusR a) | |||||
| IsValue a => AutoMethod (IO (Either Reply a)) | |||||
| IsValue a => AutoMethod (IO a) | |||||
| MonoFunctor (IO a) | |||||
| MonoPointed (IO a) | |||||
| type PrimState IO | |||||
Defined in Control.Monad.Primitive | |||||
| type Region IO Source # | |||||
Defined in Shrun.Logging.MonadRegionLogger | |||||
| type Element (IO a) | |||||
Defined in Data.MonoTraversable | |||||
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.
Ord, as defined by the Haskell report, implements a total order and has the
following properties:
- Comparability
x <= y || y <= x=True- Transitivity
- if
x <= y && y <= z=True, thenx <= z=True - Reflexivity
x <= x=True- Antisymmetry
- if
x <= y && y <= x=True, thenx == y=True
The following operator interactions are expected to hold:
x >= y=y <= xx < y=x <= y && x /= yx > y=y < xx < y=compare x y == LTx > y=compare x y == GTx == y=compare x y == EQmin x y == if x <= y then x else y=Truemax x y == if x >= y then x else y=True
Note that (7.) and (8.) do not require min and max to return either of
their arguments. The result is merely required to equal one of the
arguments in terms of (==).
Minimal complete definition: either compare or <=.
Using compare can be more efficient for complex types.
Methods
(<) :: a -> a -> Bool infix 4 #
(<=) :: a -> a -> Bool infix 4 #
Instances
| Ord DotNetTime | |
Defined in Data.Aeson.Types.Internal Methods compare :: DotNetTime -> DotNetTime -> Ordering # (<) :: DotNetTime -> DotNetTime -> Bool # (<=) :: DotNetTime -> DotNetTime -> Bool # (>) :: DotNetTime -> DotNetTime -> Bool # (>=) :: DotNetTime -> DotNetTime -> Bool # max :: DotNetTime -> DotNetTime -> DotNetTime # min :: DotNetTime -> DotNetTime -> DotNetTime # | |
| Ord JSONPathElement | |
Defined in Data.Aeson.Types.Internal Methods compare :: JSONPathElement -> JSONPathElement -> Ordering # (<) :: JSONPathElement -> JSONPathElement -> Bool # (<=) :: JSONPathElement -> JSONPathElement -> Bool # (>) :: JSONPathElement -> JSONPathElement -> Bool # (>=) :: JSONPathElement -> JSONPathElement -> Bool # max :: JSONPathElement -> JSONPathElement -> JSONPathElement # min :: JSONPathElement -> JSONPathElement -> JSONPathElement # | |
| Ord Value | The ordering is total, consistent with Since: aeson-1.5.2.0 |
| 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: base-4.17.0.0 |
| Ord All | Since: base-2.1 |
| Ord Any | Since: base-2.1 |
| Ord SomeTypeRep | |
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 Unique | |
| Ord Version | Since: base-2.1 |
| Ord CBool | |
| Ord CChar | |
| Ord CClock | |
| Ord CDouble | |
| Ord CFloat | |
| Ord CInt | |
| Ord CIntMax | |
| Ord CIntPtr | |
| Ord CLLong | |
| Ord CLong | |
| Ord CPtrdiff | |
Defined in Foreign.C.Types | |
| Ord CSChar | |
| Ord CSUSeconds | |
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 CShort | |
| Ord CSigAtomic | |
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 CSize | |
| Ord CTime | |
| Ord CUChar | |
| Ord CUInt | |
| Ord CUIntMax | |
Defined in Foreign.C.Types | |
| Ord CUIntPtr | |
Defined in Foreign.C.Types | |
| Ord CULLong | |
| Ord CULong | |
| Ord CUSeconds | |
| Ord CUShort | |
| Ord CWchar | |
| Ord IntPtr | |
| Ord WordPtr | |
| Ord Void | Since: base-4.8.0.0 |
| Ord ByteOrder | Since: base-4.11.0.0 |
| Ord BlockReason | Since: base-4.3.0.0 |
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 ThreadId | Since: base-4.2.0.0 |
Defined in GHC.Conc.Sync | |
| Ord ThreadStatus | Since: base-4.3.0.0 |
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 TimeoutKey | |
Defined in GHC.Event.TimeOut Methods compare :: TimeoutKey -> TimeoutKey -> Ordering # (<) :: TimeoutKey -> TimeoutKey -> Bool # (<=) :: TimeoutKey -> TimeoutKey -> Bool # (>) :: TimeoutKey -> TimeoutKey -> Bool # (>=) :: TimeoutKey -> TimeoutKey -> Bool # max :: TimeoutKey -> TimeoutKey -> TimeoutKey # min :: TimeoutKey -> TimeoutKey -> TimeoutKey # | |
| Ord ErrorCall | Since: base-4.7.0.0 |
| Ord ArithException | Since: base-3.0 |
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 Fingerprint | Since: base-4.4.0.0 |
Defined in GHC.Fingerprint.Type Methods compare :: Fingerprint -> Fingerprint -> Ordering # (<) :: Fingerprint -> Fingerprint -> Bool # (<=) :: Fingerprint -> Fingerprint -> Bool # (>) :: Fingerprint -> Fingerprint -> Bool # (>=) :: Fingerprint -> Fingerprint -> Bool # max :: Fingerprint -> Fingerprint -> Fingerprint # min :: Fingerprint -> Fingerprint -> Fingerprint # | |
| Ord Associativity | Since: base-4.6.0.0 |
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 DecidedStrictness | Since: base-4.9.0.0 |
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 Fixity | Since: base-4.6.0.0 |
| Ord SourceStrictness | Since: base-4.9.0.0 |
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 SourceUnpackedness | Since: base-4.9.0.0 |
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 SeekMode | Since: base-4.2.0.0 |
Defined in GHC.IO.Device | |
| Ord ArrayException | Since: base-4.2.0.0 |
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 AsyncException | Since: base-4.2.0.0 |
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 ExitCode | |
Defined in GHC.IO.Exception | |
| Ord BufferMode | Since: base-4.2.0.0 |
Defined in GHC.IO.Handle.Types Methods compare :: BufferMode -> BufferMode -> Ordering # (<) :: BufferMode -> BufferMode -> Bool # (<=) :: BufferMode -> BufferMode -> Bool # (>) :: BufferMode -> BufferMode -> Bool # (>=) :: BufferMode -> BufferMode -> Bool # max :: BufferMode -> BufferMode -> BufferMode # min :: BufferMode -> BufferMode -> BufferMode # | |
| Ord Newline | Since: base-4.3.0.0 |
| Ord NewlineMode | Since: base-4.3.0.0 |
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 IOMode | Since: base-4.2.0.0 |
| Ord Int16 | Since: base-2.1 |
| Ord Int32 | Since: base-2.1 |
| Ord Int64 | Since: base-2.1 |
| Ord Int8 | Since: base-2.1 |
| Ord SomeChar | |
Defined in GHC.TypeLits | |
| Ord SomeSymbol | Since: base-4.7.0.0 |
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 |
| Ord GeneralCategory | Since: base-2.1 |
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 Word16 | Since: base-2.1 |
| Ord Word32 | Since: base-2.1 |
| Ord Word64 | Since: base-2.1 |
| Ord Word8 | Since: base-2.1 |
| Ord CBlkCnt | |
| Ord CBlkSize | |
Defined in System.Posix.Types | |
| Ord CCc | |
| Ord CClockId | |
Defined in System.Posix.Types | |
| Ord CDev | |
| Ord CFsBlkCnt | |
| Ord CFsFilCnt | |
| Ord CGid | |
| Ord CId | |
| Ord CIno | |
| Ord CKey | |
| Ord CMode | |
| Ord CNfds | |
| Ord CNlink | |
| Ord COff | |
| Ord CPid | |
| Ord CRLim | |
| Ord CSocklen | |
Defined in System.Posix.Types | |
| Ord CSpeed | |
| Ord CSsize | |
| Ord CTcflag | |
| Ord CTimer | |
| Ord CUid | |
| Ord Fd | |
| Ord ByteString | |
Defined in Data.ByteString.Internal.Type 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 | |
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 ShortByteString | Lexicographic order. |
Defined in Data.ByteString.Short.Internal Methods compare :: ShortByteString -> ShortByteString -> Ordering # (<) :: ShortByteString -> ShortByteString -> Bool # (<=) :: ShortByteString -> ShortByteString -> Bool # (>) :: ShortByteString -> ShortByteString -> Bool # (>=) :: ShortByteString -> ShortByteString -> Bool # max :: ShortByteString -> ShortByteString -> ShortByteString # min :: ShortByteString -> ShortByteString -> ShortByteString # | |
| Ord IntSet | |
| Ord UUID | |
| Ord Atom | |
| Ord BusName | |
| Ord ErrorName | |
| Ord InterfaceName | |
Defined in DBus.Internal.Types Methods compare :: InterfaceName -> InterfaceName -> Ordering # (<) :: InterfaceName -> InterfaceName -> Bool # (<=) :: InterfaceName -> InterfaceName -> Bool # (>) :: InterfaceName -> InterfaceName -> Bool # (>=) :: InterfaceName -> InterfaceName -> Bool # max :: InterfaceName -> InterfaceName -> InterfaceName # min :: InterfaceName -> InterfaceName -> InterfaceName # | |
| Ord MemberName | |
Defined in DBus.Internal.Types Methods compare :: MemberName -> MemberName -> Ordering # (<) :: MemberName -> MemberName -> Bool # (<=) :: MemberName -> MemberName -> Bool # (>) :: MemberName -> MemberName -> Bool # (>=) :: MemberName -> MemberName -> Bool # max :: MemberName -> MemberName -> MemberName # min :: MemberName -> MemberName -> MemberName # | |
| Ord ObjectPath | |
Defined in DBus.Internal.Types Methods compare :: ObjectPath -> ObjectPath -> Ordering # (<) :: ObjectPath -> ObjectPath -> Bool # (<=) :: ObjectPath -> ObjectPath -> Bool # (>) :: ObjectPath -> ObjectPath -> Bool # (>=) :: ObjectPath -> ObjectPath -> Bool # max :: ObjectPath -> ObjectPath -> ObjectPath # min :: ObjectPath -> ObjectPath -> ObjectPath # | |
| Ord Serial | |
| Ord Signature | |
| Ord Type | |
| Ord FileType | |
Defined in System.Directory.Internal.Common | |
| Ord Permissions | |
Defined in System.Directory.Internal.Common Methods compare :: Permissions -> Permissions -> Ordering # (<) :: Permissions -> Permissions -> Bool # (<=) :: Permissions -> Permissions -> Bool # (>) :: Permissions -> Permissions -> Bool # (>=) :: Permissions -> Permissions -> Bool # max :: Permissions -> Permissions -> Permissions # min :: Permissions -> Permissions -> Permissions # | |
| Ord XdgDirectory | |
Defined in System.Directory.Internal.Common Methods compare :: XdgDirectory -> XdgDirectory -> Ordering # (<) :: XdgDirectory -> XdgDirectory -> Bool # (<=) :: XdgDirectory -> XdgDirectory -> Bool # (>) :: XdgDirectory -> XdgDirectory -> Bool # (>=) :: XdgDirectory -> XdgDirectory -> Bool # max :: XdgDirectory -> XdgDirectory -> XdgDirectory # min :: XdgDirectory -> XdgDirectory -> XdgDirectory # | |
| Ord XdgDirectoryList | |
Defined in System.Directory.Internal.Common Methods compare :: XdgDirectoryList -> XdgDirectoryList -> Ordering # (<) :: XdgDirectoryList -> XdgDirectoryList -> Bool # (<=) :: XdgDirectoryList -> XdgDirectoryList -> Bool # (>) :: XdgDirectoryList -> XdgDirectoryList -> Bool # (>=) :: XdgDirectoryList -> XdgDirectoryList -> Bool # max :: XdgDirectoryList -> XdgDirectoryList -> XdgDirectoryList # min :: XdgDirectoryList -> XdgDirectoryList -> XdgDirectoryList # | |
| Ord TimeSpec | Since: effects-time-0.1 |
Defined in Effects.Time | |
| Ord PathType | Since: effects-unix-compat-0.1 |
Defined in Effects.System.PosixCompat | |
| Ord UrgencyLevel | |
Defined in DBus.Notify Methods compare :: UrgencyLevel -> UrgencyLevel -> Ordering # (<) :: UrgencyLevel -> UrgencyLevel -> Bool # (<=) :: UrgencyLevel -> UrgencyLevel -> Bool # (>) :: UrgencyLevel -> UrgencyLevel -> Bool # (>=) :: UrgencyLevel -> UrgencyLevel -> Bool # max :: UrgencyLevel -> UrgencyLevel -> UrgencyLevel # min :: UrgencyLevel -> UrgencyLevel -> UrgencyLevel # | |
| Ord OsChar | Byte ordering of the internal representation. |
Defined in System.OsString.Internal.Types.Hidden | |
| Ord OsString | Byte ordering of the internal representation. |
Defined in System.OsString.Internal.Types.Hidden | |
| Ord PosixChar | |
Defined in System.OsString.Internal.Types.Hidden | |
| Ord PosixString | |
Defined in System.OsString.Internal.Types.Hidden Methods compare :: PosixString -> PosixString -> Ordering # (<) :: PosixString -> PosixString -> Bool # (<=) :: PosixString -> PosixString -> Bool # (>) :: PosixString -> PosixString -> Bool # (>=) :: PosixString -> PosixString -> Bool # max :: PosixString -> PosixString -> PosixString # min :: PosixString -> PosixString -> PosixString # | |
| Ord WindowsChar | |
Defined in System.OsString.Internal.Types.Hidden Methods compare :: WindowsChar -> WindowsChar -> Ordering # (<) :: WindowsChar -> WindowsChar -> Bool # (<=) :: WindowsChar -> WindowsChar -> Bool # (>) :: WindowsChar -> WindowsChar -> Bool # (>=) :: WindowsChar -> WindowsChar -> Bool # max :: WindowsChar -> WindowsChar -> WindowsChar # min :: WindowsChar -> WindowsChar -> WindowsChar # | |
| Ord WindowsString | |
Defined in System.OsString.Internal.Types.Hidden Methods compare :: WindowsString -> WindowsString -> Ordering # (<) :: WindowsString -> WindowsString -> Bool # (<=) :: WindowsString -> WindowsString -> Bool # (>) :: WindowsString -> WindowsString -> Bool # (>=) :: WindowsString -> WindowsString -> Bool # max :: WindowsString -> WindowsString -> WindowsString # min :: WindowsString -> WindowsString -> WindowsString # | |
| Ord BigNat | |
| Ord Extension | |
| Ord Ordering | |
Defined in GHC.Classes | |
| Ord TyCon | |
| Ord Pos | |
| Ord SourcePos | |
| Ord URI | |
| Ord URIAuth | |
| Ord NEIntSet | |
Defined in Data.IntSet.NonEmpty.Internal | |
| Ord Richness | |
Defined in Options.Applicative.BashCompletion | |
| Ord Parenthetic | |
Defined in Options.Applicative.Help.Core | |
| Ord ArgPolicy | |
| Ord OptName | |
Defined in Options.Applicative.Types | |
| Ord OptVisibility | |
Defined in Options.Applicative.Types Methods compare :: OptVisibility -> OptVisibility -> Ordering # (<) :: OptVisibility -> OptVisibility -> Bool # (<=) :: OptVisibility -> OptVisibility -> Bool # (>) :: OptVisibility -> OptVisibility -> Bool # (>=) :: OptVisibility -> OptVisibility -> Bool # max :: OptVisibility -> OptVisibility -> OptVisibility # min :: OptVisibility -> OptVisibility -> OptVisibility # | |
| Ord OsChar | Byte ordering of the internal representation. |
| Ord OsString | Byte ordering of the internal representation. |
Defined in System.OsString.Internal.Types | |
| Ord PosixChar | |
| Ord PosixString | |
Defined in System.OsString.Internal.Types Methods compare :: PosixString -> PosixString -> Ordering # (<) :: PosixString -> PosixString -> Bool # (<=) :: PosixString -> PosixString -> Bool # (>) :: PosixString -> PosixString -> Bool # (>=) :: PosixString -> PosixString -> Bool # max :: PosixString -> PosixString -> PosixString # min :: PosixString -> PosixString -> PosixString # | |
| Ord WindowsChar | |
Defined in System.OsString.Internal.Types Methods compare :: WindowsChar -> WindowsChar -> Ordering # (<) :: WindowsChar -> WindowsChar -> Bool # (<=) :: WindowsChar -> WindowsChar -> Bool # (>) :: WindowsChar -> WindowsChar -> Bool # (>=) :: WindowsChar -> WindowsChar -> Bool # max :: WindowsChar -> WindowsChar -> WindowsChar # min :: WindowsChar -> WindowsChar -> WindowsChar # | |
| Ord WindowsString | |
Defined in System.OsString.Internal.Types Methods compare :: WindowsString -> WindowsString -> Ordering # (<) :: WindowsString -> WindowsString -> Bool # (<=) :: WindowsString -> WindowsString -> Bool # (>) :: WindowsString -> WindowsString -> Bool # (>=) :: WindowsString -> WindowsString -> Bool # max :: WindowsString -> WindowsString -> WindowsString # min :: WindowsString -> WindowsString -> WindowsString # | |
| Ord FusionDepth | |
Defined in Prettyprinter.Internal Methods compare :: FusionDepth -> FusionDepth -> Ordering # (<) :: FusionDepth -> FusionDepth -> Bool # (<=) :: FusionDepth -> FusionDepth -> Bool # (>) :: FusionDepth -> FusionDepth -> Bool # (>=) :: FusionDepth -> FusionDepth -> Bool # max :: FusionDepth -> FusionDepth -> FusionDepth # min :: FusionDepth -> FusionDepth -> FusionDepth # | |
| Ord LayoutOptions | |
Defined in Prettyprinter.Internal Methods compare :: LayoutOptions -> LayoutOptions -> Ordering # (<) :: LayoutOptions -> LayoutOptions -> Bool # (<=) :: LayoutOptions -> LayoutOptions -> Bool # (>) :: LayoutOptions -> LayoutOptions -> Bool # (>=) :: LayoutOptions -> LayoutOptions -> Bool # max :: LayoutOptions -> LayoutOptions -> LayoutOptions # min :: LayoutOptions -> LayoutOptions -> LayoutOptions # | |
| Ord PageWidth | |
| Ord AnsiStyle | |
Defined in Prettyprinter.Render.Terminal.Internal | |
| Ord Bold | |
| Ord Color | |
| Ord Intensity | |
Defined in Prettyprinter.Render.Terminal.Internal | |
| Ord Italicized | |
Defined in Prettyprinter.Render.Terminal.Internal Methods compare :: Italicized -> Italicized -> Ordering # (<) :: Italicized -> Italicized -> Bool # (<=) :: Italicized -> Italicized -> Bool # (>) :: Italicized -> Italicized -> Bool # (>=) :: Italicized -> Italicized -> Bool # max :: Italicized -> Italicized -> Italicized # min :: Italicized -> Italicized -> Italicized # | |
| Ord Layer | |
| Ord Underlined | |
Defined in Prettyprinter.Render.Terminal.Internal Methods compare :: Underlined -> Underlined -> Ordering # (<) :: Underlined -> Underlined -> Bool # (<=) :: Underlined -> Underlined -> Bool # (>) :: Underlined -> Underlined -> Bool # (>=) :: Underlined -> Underlined -> Bool # max :: Underlined -> Underlined -> Underlined # min :: Underlined -> Underlined -> Underlined # | |
| Ord RelativeTime | Since: relative-time-0.1 |
Defined in Data.Time.Relative Methods compare :: RelativeTime -> RelativeTime -> Ordering # (<) :: RelativeTime -> RelativeTime -> Bool # (<=) :: RelativeTime -> RelativeTime -> Bool # (>) :: RelativeTime -> RelativeTime -> Bool # (>=) :: RelativeTime -> RelativeTime -> Bool # max :: RelativeTime -> RelativeTime -> RelativeTime # min :: RelativeTime -> RelativeTime -> RelativeTime # | |
| Ord Scientific | Scientific numbers can be safely compared for ordering. No magnitude |
Defined in Data.Scientific Methods compare :: Scientific -> Scientific -> Ordering # (<) :: Scientific -> Scientific -> Bool # (<=) :: Scientific -> Scientific -> Bool # (>) :: Scientific -> Scientific -> Bool # (>=) :: Scientific -> Scientific -> Bool # max :: Scientific -> Scientific -> Scientific # min :: Scientific -> Scientific -> Scientific # | |
| Ord PollInterval Source # | |
Defined in Shrun.Configuration.Data.CommandLogging.PollInterval Methods compare :: PollInterval -> PollInterval -> Ordering # (<) :: PollInterval -> PollInterval -> Bool # (<=) :: PollInterval -> PollInterval -> Bool # (>) :: PollInterval -> PollInterval -> Bool # (>=) :: PollInterval -> PollInterval -> Bool # max :: PollInterval -> PollInterval -> PollInterval # min :: PollInterval -> PollInterval -> PollInterval # | |
| Ord KeyHideSwitch Source # | |
Defined in Shrun.Configuration.Data.CommonLogging.KeyHideSwitch Methods compare :: KeyHideSwitch -> KeyHideSwitch -> Ordering # (<) :: KeyHideSwitch -> KeyHideSwitch -> Bool # (<=) :: KeyHideSwitch -> KeyHideSwitch -> Bool # (>) :: KeyHideSwitch -> KeyHideSwitch -> Bool # (>=) :: KeyHideSwitch -> KeyHideSwitch -> Bool # max :: KeyHideSwitch -> KeyHideSwitch -> KeyHideSwitch # min :: KeyHideSwitch -> KeyHideSwitch -> KeyHideSwitch # | |
| Ord Timeout Source # | |
Defined in Shrun.Configuration.Data.Core.Timeout | |
| Ord Size | Since: si-bytes-0.1 |
| Ord AnnLookup | |
| Ord AnnTarget | |
| Ord Bang | |
| Ord BndrVis | |
Defined in Language.Haskell.TH.Syntax | |
| Ord Body | |
| Ord Bytes | |
| Ord Callconv | |
Defined in Language.Haskell.TH.Syntax | |
| Ord Clause | |
| Ord Con | |
| Ord Dec | |
| Ord DecidedStrictness | |
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 DerivClause | |
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 | |
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 DocLoc | |
| Ord Exp | |
| Ord FamilyResultSig | |
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 Fixity | |
| Ord FixityDirection | |
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 Foreign | |
Defined in Language.Haskell.TH.Syntax | |
| Ord FunDep | |
| Ord Guard | |
| Ord Info | |
| Ord InjectivityAnn | |
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 Inline | |
| Ord Lit | |
| Ord Loc | |
| Ord Match | |
| Ord ModName | |
Defined in Language.Haskell.TH.Syntax | |
| Ord Module | |
| Ord ModuleInfo | |
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 Name | |
| Ord NameFlavour | |
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 | |
| Ord OccName | |
Defined in Language.Haskell.TH.Syntax | |
| Ord Overlap | |
Defined in Language.Haskell.TH.Syntax | |
| Ord Pat | |
| Ord PatSynArgs | |
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 PatSynDir | |
| Ord Phases | |
| Ord PkgName | |
Defined in Language.Haskell.TH.Syntax | |
| Ord Pragma | |
| Ord Range | |
| Ord Role | |
| Ord RuleBndr | |
Defined in Language.Haskell.TH.Syntax | |
| Ord RuleMatch | |
| Ord Safety | |
| Ord SourceStrictness | |
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 SourceUnpackedness | |
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 Specificity | |
Defined in Language.Haskell.TH.Syntax Methods compare :: Specificity -> Specificity -> Ordering # (<) :: Specificity -> Specificity -> Bool # (<=) :: Specificity -> Specificity -> Bool # (>) :: Specificity -> Specificity -> Bool # (>=) :: Specificity -> Specificity -> Bool # max :: Specificity -> Specificity -> Specificity # min :: Specificity -> Specificity -> Specificity # | |
| Ord Stmt | |
| Ord TyLit | |
| Ord TySynEqn | |
Defined in Language.Haskell.TH.Syntax | |
| Ord Type | |
| Ord TypeFamilyHead | |
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 I8 | |
| Ord Builder | |
Defined in Data.Text.Internal.Builder | |
| Ord B | |
| Ord ShortText | |
| Ord ConstructorVariant | |
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 DatatypeVariant | |
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 FieldStrictness | |
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 Strictness | |
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 Unpackedness | |
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 UTCTime | |
Defined in Data.Time.Clock.Internal.UTCTime | |
| Ord LocalTime | |
Defined in Data.Time.LocalTime.Internal.LocalTime | |
| Ord ConcException | |
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 UUID | |
| Ord UnpackedUUID | |
Defined in Data.UUID.Types.Internal | |
| Ord Content | |
| Ord Doctype | |
| Ord Document | |
Defined in Data.XML.Types | |
| Ord Element | |
| Ord Event | |
| Ord ExternalID | |
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 Instruction | |
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 Miscellaneous | |
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 Name | |
| Ord Node | |
| Ord Prologue | |
Defined in Data.XML.Types | |
| Ord Integer | |
| Ord Natural | |
| Ord () | |
| Ord Bool | |
| Ord Char | |
| Ord Double | IEEE 754 IEEE 754-2008, section 5.11 requires that if at least one of arguments of
IEEE 754-2008, section 5.10 defines Thus, users must be extremely cautious when using Moving further, the behaviour of IEEE 754-2008 compliant |
| Ord Float | See |
| Ord Int | |
| Ord Word | |
| Ord v => Ord (KeyMap v) | |
Defined in Data.Aeson.KeyMap | |
| Ord (Async a) | |
Defined in Control.Concurrent.Async.Internal | |
| Ord a => Ord (ZipList a) | Since: base-4.7.0.0 |
| Ord a => Ord (Identity a) | Since: base-4.8.0.0 |
Defined in Data.Functor.Identity | |
| Ord a => Ord (First a) | Since: base-2.1 |
| Ord a => Ord (Last a) | Since: base-2.1 |
| Ord a => Ord (Down a) | Since: base-4.6.0.0 |
| Ord a => Ord (First a) | Since: base-4.9.0.0 |
| Ord a => Ord (Last a) | Since: base-4.9.0.0 |
| Ord a => Ord (Max a) | Since: base-4.9.0.0 |
| Ord a => Ord (Min a) | Since: base-4.9.0.0 |
| Ord m => Ord (WrappedMonoid m) | Since: base-4.9.0.0 |
Defined in Data.Semigroup Methods compare :: WrappedMonoid m -> WrappedMonoid m -> Ordering # (<) :: WrappedMonoid m -> WrappedMonoid m -> Bool # (<=) :: WrappedMonoid m -> WrappedMonoid m -> Bool # (>) :: WrappedMonoid m -> WrappedMonoid m -> Bool # (>=) :: WrappedMonoid m -> WrappedMonoid m -> Bool # max :: WrappedMonoid m -> WrappedMonoid m -> WrappedMonoid m # min :: WrappedMonoid m -> WrappedMonoid m -> WrappedMonoid m # | |
| Ord a => Ord (Dual a) | Since: base-2.1 |
| Ord a => Ord (Product a) | Since: base-2.1 |
| Ord a => Ord (Sum a) | Since: base-2.1 |
| Ord (ConstPtr a) | |
| Ord a => Ord (NonEmpty a) | Since: base-4.9.0.0 |
| Ord (ForeignPtr a) | Since: base-2.1 |
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 p => Ord (Par1 p) | Since: base-4.7.0.0 |
| Ord (FunPtr a) | |
Defined in GHC.Ptr | |
| Ord (Ptr a) | Since: base-2.1 |
| Integral a => Ord (Ratio a) | Since: base-2.0.1 |
| Ord (SChar c) | Since: base-4.19.0.0 |
| Ord (SSymbol s) | Since: base-4.19.0.0 |
| Ord (SNat n) | Since: base-4.19.0.0 |
| Ord a => Ord (Flush a) | |
Defined in Data.Conduit.Internal.Conduit | |
| Ord a => Ord (IntMap a) | |
Defined in Data.IntMap.Internal | |
| Ord a => Ord (Seq a) | |
| Ord a => Ord (ViewL a) | |
Defined in Data.Sequence.Internal | |
| Ord a => Ord (ViewR a) | |
Defined in Data.Sequence.Internal | |
| Ord a => Ord (Intersection a) | |
Defined in Data.Set.Internal Methods compare :: Intersection a -> Intersection a -> Ordering # (<) :: Intersection a -> Intersection a -> Bool # (<=) :: Intersection a -> Intersection a -> Bool # (>) :: Intersection a -> Intersection a -> Bool # (>=) :: Intersection a -> Intersection a -> Bool # max :: Intersection a -> Intersection a -> Intersection a # min :: Intersection a -> Intersection a -> Intersection a # | |
| Ord a => Ord (Set a) | |
| Ord a => Ord (Tree a) | Since: containers-0.6.5 |
| Ord1 f => Ord (Fix f) | |
| (Functor f, Ord1 f) => Ord (Mu f) | |
| (Functor f, Ord1 f) => Ord (Nu f) | |
| Ord a => Ord (DNonEmpty a) | |
Defined in Data.DList.DNonEmpty.Internal | |
| Ord a => Ord (DList a) | |
| Ord a => Ord (Hashed a) | |
Defined in Data.Hashable.Class | |
| Ord e => Ord (ErrorFancy e) | |
Defined in Text.Megaparsec.Error Methods compare :: ErrorFancy e -> ErrorFancy e -> Ordering # (<) :: ErrorFancy e -> ErrorFancy e -> Bool # (<=) :: ErrorFancy e -> ErrorFancy e -> Bool # (>) :: ErrorFancy e -> ErrorFancy e -> Bool # (>=) :: ErrorFancy e -> ErrorFancy e -> Bool # max :: ErrorFancy e -> ErrorFancy e -> ErrorFancy e # min :: ErrorFancy e -> ErrorFancy e -> ErrorFancy e # | |
| Ord t => Ord (ErrorItem t) | |
Defined in Text.Megaparsec.Error | |
| Ord mono => Ord (NonNull mono) | |
Defined in Data.NonNull | |
| Ord a => Ord (NEIntMap a) | |
Defined in Data.IntMap.NonEmpty.Internal | |
| Ord a => Ord (NESeq a) | |
Defined in Data.Sequence.NonEmpty.Internal | |
| Ord a => Ord (NESet a) | |
Defined in Data.Set.NonEmpty.Internal | |
| Ord ann => Ord (SimpleDocStream ann) | |
Defined in Prettyprinter.Internal Methods compare :: SimpleDocStream ann -> SimpleDocStream ann -> Ordering # (<) :: SimpleDocStream ann -> SimpleDocStream ann -> Bool # (<=) :: SimpleDocStream ann -> SimpleDocStream ann -> Bool # (>) :: SimpleDocStream ann -> SimpleDocStream ann -> Bool # (>=) :: SimpleDocStream ann -> SimpleDocStream ann -> Bool # max :: SimpleDocStream ann -> SimpleDocStream ann -> SimpleDocStream ann # min :: SimpleDocStream ann -> SimpleDocStream ann -> SimpleDocStream ann # | |
| Ord a => Ord (Array a) | Lexicographic ordering. Subject to change between major versions. |
Defined in Data.Primitive.Array | |
| (Ord a, Prim a) => Ord (PrimArray a) | Lexicographic ordering. Subject to change between major versions. Since: primitive-0.6.4.0 |
Defined in Data.Primitive.PrimArray | |
| Ord a => Ord (SmallArray a) | Lexicographic ordering. Subject to change between major versions. |
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 g => Ord (StateGen g) | |
Defined in System.Random.Internal | |
| Ord g => Ord (AtomicGen g) | |
Defined in System.Random.Stateful | |
| Ord g => Ord (IOGen g) | |
Defined in System.Random.Stateful | |
| Ord g => Ord (STGen g) | |
Defined in System.Random.Stateful | |
| Ord g => Ord (TGen g) | |
| Ord (StripControl t) Source # | |
Defined in Shrun.Configuration.Data.StripControl Methods compare :: StripControl t -> StripControl t -> Ordering # (<) :: StripControl t -> StripControl t -> Bool # (<=) :: StripControl t -> StripControl t -> Bool # (>) :: StripControl t -> StripControl t -> Bool # (>=) :: StripControl t -> StripControl t -> Bool # max :: StripControl t -> StripControl t -> StripControl t # min :: StripControl t -> StripControl t -> StripControl t # | |
| Ord (Truncation a) Source # | |
Defined in Shrun.Configuration.Data.Truncation Methods compare :: Truncation a -> Truncation a -> Ordering # (<) :: Truncation a -> Truncation a -> Bool # (<=) :: Truncation a -> Truncation a -> Bool # (>) :: Truncation a -> Truncation a -> Bool # (>=) :: Truncation a -> Truncation a -> Bool # max :: Truncation a -> Truncation a -> Truncation a # min :: Truncation a -> Truncation a -> Truncation a # | |
| (FromInteger n, MGroup n, Ord n) => Ord (SomeSize n) | Since: si-bytes-0.1 |
Defined in Data.Bytes.Internal | |
| Ord a => Ord (NonZero a) | Since: smart-math-0.1 |
| Ord a => Ord (Positive a) | Since: smart-math-0.1 |
Defined in Numeric.Data.Positive.Internal | |
| Ord a => Ord (Maybe a) | |
| Ord flag => Ord (TyVarBndr flag) | |
Defined in Language.Haskell.TH.Syntax Methods compare :: TyVarBndr flag -> TyVarBndr flag -> Ordering # (<) :: TyVarBndr flag -> TyVarBndr flag -> Bool # (<=) :: TyVarBndr flag -> TyVarBndr flag -> Bool # (>) :: TyVarBndr flag -> TyVarBndr flag -> Bool # (>=) :: TyVarBndr flag -> TyVarBndr flag -> Bool # | |
| Ord a => Ord (Stream a) | |
Defined in Data.Text.Internal.Fusion.Types | |
| Ord a => Ord (HashSet a) | |
| Ord a => Ord (Vector a) | |
Defined in Data.Vector | |
| (Prim a, Ord a) => Ord (Vector a) | |
Defined in Data.Vector.Primitive | |
| (Storable a, Ord a) => Ord (Vector a) | |
Defined in Data.Vector.Storable | |
| Ord a => Ord (Maybe a) | Since: base-2.1 |
| Ord a => Ord (Solo a) | |
| Ord a => Ord [a] | |
| (Ord a, Ord b) => Ord (Either a b) | Since: base-2.1 |
| Ord (Fixed a) | Since: base-2.1 |
| Ord (Proxy s) | Since: base-4.7.0.0 |
| Ord a => Ord (Arg a b) | Since: base-4.9.0.0 |
| Ord (TypeRep a) | Since: base-4.4.0.0 |
| (Ix i, Ord e) => Ord (Array i e) | Since: base-2.1 |
| Ord (U1 p) | Since: base-4.7.0.0 |
| Ord (V1 p) | Since: base-4.9.0.0 |
| (Ord k, Ord v) => Ord (Map k v) | |
| (Ord1 f, Ord a) => Ord (Cofree f a) | |
Defined in Control.Comonad.Cofree | |
| (Ord1 f, Ord a) => Ord (Free f a) | |
Defined in Control.Monad.Free | |
| (Ord1 f, Ord a) => Ord (Yoneda f a) | |
Defined in Data.Functor.Yoneda | |
| (Ord k, Ord a) => Ord (NEMap k a) | |
| Ord n => Ord (Bytes s n) | Since: si-bytes-0.1 |
| (FromInteger n, MGroup n, Ord n) => Ord (SomeNetSize d n) | Since: si-bytes-0.1 |
Defined in Data.Bytes.Network.Internal Methods compare :: SomeNetSize d n -> SomeNetSize d n -> Ordering # (<) :: SomeNetSize d n -> SomeNetSize d n -> Bool # (<=) :: SomeNetSize d n -> SomeNetSize d n -> Bool # (>) :: SomeNetSize d n -> SomeNetSize d n -> Bool # (>=) :: SomeNetSize d n -> SomeNetSize d n -> Bool # max :: SomeNetSize d n -> SomeNetSize d n -> SomeNetSize d n # min :: SomeNetSize d n -> SomeNetSize d n -> SomeNetSize d n # | |
| (Ord a, Ord b) => Ord (Either a b) | |
| (Ord a, Ord b) => Ord (These a b) | |
| (Ord a, Ord b) => Ord (Pair a b) | |
Defined in Data.Strict.Tuple | |
| (Ord a, Ord b) => Ord (These a b) | |
| (Ord1 f, Ord a) => Ord (Lift f a) | |
Defined in Control.Applicative.Lift | |
| (Ord1 m, Ord a) => Ord (MaybeT m a) | |
Defined in Control.Monad.Trans.Maybe | |
| (Ord k, Ord v) => Ord (HashMap k v) | The ordering is total and consistent with the |
Defined in Data.HashMap.Internal | |
| (Ord a, Ord b) => Ord (a, b) | |
| Ord a => Ord (Const a b) | Since: base-4.9.0.0 |
| Ord (f a) => Ord (Ap f a) | Since: base-4.12.0.0 |
| Ord (f a) => Ord (Alt f a) | Since: base-4.8.0.0 |
Defined in Data.Semigroup.Internal | |
| Ord (Coercion a b) | Since: base-4.7.0.0 |
Defined in Data.Type.Coercion | |
| Ord (a :~: b) | Since: base-4.7.0.0 |
Defined in Data.Type.Equality | |
| (Generic1 f, Ord (Rep1 f a)) => Ord (Generically1 f a) | Since: base-4.18.0.0 |
Defined in GHC.Generics Methods compare :: Generically1 f a -> Generically1 f a -> Ordering # (<) :: Generically1 f a -> Generically1 f a -> Bool # (<=) :: Generically1 f a -> Generically1 f a -> Bool # (>) :: Generically1 f a -> Generically1 f a -> Bool # (>=) :: Generically1 f a -> Generically1 f a -> Bool # max :: Generically1 f a -> Generically1 f a -> Generically1 f a # min :: Generically1 f a -> Generically1 f a -> Generically1 f a # | |
| Ord (f p) => Ord (Rec1 f p) | Since: base-4.7.0.0 |
Defined in GHC.Generics | |
| Ord (URec (Ptr ()) p) | Since: base-4.9.0.0 |
Defined in GHC.Generics Methods compare :: URec (Ptr ()) p -> URec (Ptr ()) p -> Ordering # (<) :: URec (Ptr ()) p -> URec (Ptr ()) p -> Bool # (<=) :: URec (Ptr ()) p -> URec (Ptr ()) p -> Bool # (>) :: URec (Ptr ()) p -> URec (Ptr ()) p -> Bool # (>=) :: URec (Ptr ()) p -> URec (Ptr ()) p -> Bool # max :: URec (Ptr ()) p -> URec (Ptr ()) p -> URec (Ptr ()) p # min :: URec (Ptr ()) p -> URec (Ptr ()) p -> URec (Ptr ()) p # | |
| Ord (URec Char p) | Since: base-4.9.0.0 |
Defined in GHC.Generics | |
| Ord (URec Double p) | Since: base-4.9.0.0 |
Defined in GHC.Generics Methods compare :: URec Double p -> URec Double p -> Ordering # (<) :: URec Double p -> URec Double p -> Bool # (<=) :: URec Double p -> URec Double p -> Bool # (>) :: URec Double p -> URec Double p -> Bool # (>=) :: URec Double p -> URec Double p -> Bool # | |
| Ord (URec Float p) | |
Defined in GHC.Generics | |
| Ord (URec Int p) | Since: base-4.9.0.0 |
| Ord (URec Word p) | Since: base-4.9.0.0 |
Defined in GHC.Generics | |
| Ord (p (Fix p a) a) => Ord (Fix p a) | |
| Ord (p a a) => Ord (Join p a) | |
Defined in Data.Bifunctor.Join | |
| (Ord a, Ord (f b)) => Ord (CofreeF f a b) | |
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 # | |
| Ord (w (CofreeF f a (CofreeT f w a))) => Ord (CofreeT f w a) | |
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 # | |
| (Ord a, Ord (f b)) => Ord (FreeF f a b) | |
Defined in Control.Monad.Trans.Free | |
| (Ord1 f, Ord1 m, Ord a) => Ord (FreeT f m a) | |
Defined in Control.Monad.Trans.Free | |
| Ord n => Ord (NetBytes d s n) | Since: si-bytes-0.1 |
Defined in Data.Bytes.Network.Internal Methods compare :: NetBytes d s n -> NetBytes d s n -> Ordering # (<) :: NetBytes d s n -> NetBytes d s n -> Bool # (<=) :: NetBytes d s n -> NetBytes d s n -> Bool # (>) :: NetBytes d s n -> NetBytes d s n -> Bool # (>=) :: NetBytes d s n -> NetBytes d s n -> Bool # | |
| Ord b => Ord (Tagged s b) | |
| (Ord (f a), Ord (g a), Ord a) => Ord (These1 f g a) | |
Defined in Data.Functor.These | |
| (Ord1 f, Ord a) => Ord (Backwards f a) | |
Defined in Control.Applicative.Backwards Methods compare :: Backwards f a -> Backwards f a -> Ordering # (<) :: Backwards f a -> Backwards f a -> Bool # (<=) :: Backwards f a -> Backwards f a -> Bool # (>) :: Backwards f a -> Backwards f a -> Bool # (>=) :: Backwards f a -> Backwards f a -> Bool # | |
| (Ord e, Ord1 m, Ord a) => Ord (ExceptT e m a) | |
Defined in Control.Monad.Trans.Except Methods compare :: ExceptT e m a -> ExceptT e m a -> Ordering # (<) :: ExceptT e m a -> ExceptT e m a -> Bool # (<=) :: ExceptT e m a -> ExceptT e m a -> Bool # (>) :: ExceptT e m a -> ExceptT e m a -> Bool # (>=) :: ExceptT e m a -> ExceptT e m a -> Bool # | |
| (Ord1 f, Ord a) => Ord (IdentityT f a) | |
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 # | |
| (Ord w, Ord1 m, Ord a) => Ord (WriterT w m a) | |
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 # | |
| (Ord w, Ord1 m, Ord a) => Ord (WriterT w m a) | |
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 # | |
| Ord a => Ord (Constant a b) | |
Defined in Data.Functor.Constant | |
| (Ord1 f, Ord a) => Ord (Reverse f a) | |
Defined in Data.Functor.Reverse | |
| (Ord a, Ord b, Ord c) => Ord (a, b, c) | |
| (Ord (f a), Ord (g a)) => Ord (Product f g a) | Since: base-4.18.0.0 |
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 # | |
| (Ord (f a), Ord (g a)) => Ord (Sum f g a) | Since: base-4.18.0.0 |
| Ord (a :~~: b) | Since: base-4.10.0.0 |
| (Ord (f p), Ord (g p)) => Ord ((f :*: g) p) | Since: base-4.7.0.0 |
Defined in GHC.Generics | |
| (Ord (f p), Ord (g p)) => Ord ((f :+: g) p) | Since: base-4.7.0.0 |
Defined in GHC.Generics | |
| Ord c => Ord (K1 i c p) | Since: base-4.7.0.0 |
Defined in GHC.Generics | |
| (Ord a, Ord b, Ord c, Ord d) => Ord (a, b, c, d) | |
Defined in GHC.Classes | |
| Ord (f (g a)) => Ord (Compose f g a) | Since: base-4.18.0.0 |
Defined in Data.Functor.Compose Methods compare :: Compose f g a -> Compose f g a -> Ordering # (<) :: Compose f g a -> Compose f g a -> Bool # (<=) :: Compose f g a -> Compose f g a -> Bool # (>) :: Compose f g a -> Compose f g a -> Bool # (>=) :: Compose f g a -> Compose f g a -> Bool # | |
| Ord (f (g p)) => Ord ((f :.: g) p) | Since: base-4.7.0.0 |
Defined in GHC.Generics | |
| Ord (f p) => Ord (M1 i c f p) | Since: base-4.7.0.0 |
| Ord (f a) => Ord (Clown f a b) | |
Defined in Data.Bifunctor.Clown | |
| Ord (p b a) => Ord (Flip p a b) | |
Defined in Data.Bifunctor.Flip | |
| Ord (g b) => Ord (Joker g a b) | |
Defined in Data.Bifunctor.Joker | |
| Ord (p a b) => Ord (WrappedBifunctor p a b) | |
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 a, Ord b, Ord c, Ord d, Ord e) => Ord (a, b, c, d, e) | |
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) # | |
| (Ord (f a b), Ord (g a b)) => Ord (Product f g a b) | |
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 (p a b), Ord (q a b)) => Ord (Sum p q a b) | |
Defined in Data.Bifunctor.Sum | |
| (Ord a, Ord b, Ord c, Ord d, Ord e, Ord f) => Ord (a, b, c, d, e, f) | |
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 (f (p a b)) => Ord (Tannen f p a b) | |
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 # | |
| (Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g) => Ord (a, b, c, d, e, f, g) | |
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 a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h) => Ord (a, b, c, d, e, f, g, h) | |
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 (p (f a) (g b)) => Ord (Biff p f g a b) | |
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 # | |
| (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) | |
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 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) | |
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) | |
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) | |
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) | |
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) | |
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) | |
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) # | |
String is an alias for a list of characters.
String constants in Haskell are values of type String.
That means if you write a string literal like "hello world",
it will have the type [Char], which is the same as String.
Note: You can ask the compiler to automatically infer different types
with the -XOverloadedStrings language extension, for example
"hello world" :: Text. See IsString for more information.
Because String is just a list of characters, you can use normal list functions
to do basic string manipulation. See Data.List for operations on lists.
Performance considerations
[Char] is a relatively memory-inefficient type.
It is a linked list of boxed word-size characters, internally it looks something like:
╭─────┬───┬──╮ ╭─────┬───┬──╮ ╭─────┬───┬──╮ ╭────╮
│ (:) │ │ ─┼─>│ (:) │ │ ─┼─>│ (:) │ │ ─┼─>│ [] │
╰─────┴─┼─┴──╯ ╰─────┴─┼─┴──╯ ╰─────┴─┼─┴──╯ ╰────╯
v v v
'a' 'b' 'c'The String "abc" will use 5*3+1 = 16 (in general 5n+1)
words of space in memory.
Furthermore, operations like (++) (string concatenation) are O(n)
(in the left argument).
For historical reasons, the base library uses String in a lot of places
for the conceptual simplicity, but library code dealing with user-data
should use the text
package for Unicode text, or the the
bytestring package
for binary data.
type Constraint = CONSTRAINT LiftedRep #
The kind of lifted constraints
($) :: (a -> b) -> a -> b infixr 0 #
($)
Applying ($)f and an argument x gives the same result as applying f to x directly. The definition is akin to this:
($) :: (a -> b) -> a -> b ($) f x = f x
This is ida -> a to (a -> b) -> (a -> b) which by the associativity of (->)
is the same as (a -> b) -> a -> b.
On the face of it, this may appear pointless! But it's actually one of the most useful and important operators in Haskell.
The order of operations is very different between ($) and normal function application. Normal function application has precedence 10 - higher than any operator - and associates to the left. So these two definitions are equivalent:
expr = min 5 1 + 5 expr = ((min 5) 1) + 5
($) has precedence 0 (the lowest) and associates to the right, so these are equivalent:
expr = min 5 $ 1 + 5 expr = (min 5) (1 + 5)
Examples
A common use cases of ($) is to avoid parentheses in complex expressions.
For example, instead of using nested parentheses in the following Haskell function:
-- | Sum numbers in a string: strSum "100 5 -7" == 98 strSum ::String->IntstrSum s =sum(mapMaybereadMaybe(wordss))
we can deploy the function application operator:
-- | Sum numbers in a string: strSum "100 5 -7" == 98 strSum ::String->IntstrSum s =sum$mapMaybereadMaybe$wordss
($) is also used as a section (a partially applied operator), in order to indicate that we wish to apply some yet-unspecified function to a given value. For example, to apply the argument 5 to a list of functions:
applyFive :: [Int] applyFive = map ($ 5) [(+1), (2^)] >>> [6, 32]
Technical Remark (Representation Polymorphism)
($) is fully representation-polymorphic. This allows it to also be used with arguments of unlifted and even unboxed kinds, such as unboxed integers:
fastMod :: Int -> Int -> Int fastMod (I# x) (I# m) = I# $ remInt# x m
(++) :: [a] -> [a] -> [a] infixr 5 #
(++) appends two lists, i.e.,
[x1, ..., xm] ++ [y1, ..., yn] == [x1, ..., xm, y1, ..., yn] [x1, ..., xm] ++ [y1, ...] == [x1, ..., xm, y1, ...]
If the first list is not finite, the result is the first list.
Performance considerations
This function takes linear time in the number of elements of the
first list. Thus it is better to associate repeated
applications of (++) to the right (which is the default behaviour):
xs ++ (ys ++ zs) or simply xs ++ ys ++ zs, but not (xs ++ ys) ++ zs.
For the same reason concat = foldr (++) []
has linear performance, while foldl (++) [] is prone
to quadratic slowdown
Examples
>>>[1, 2, 3] ++ [4, 5, 6][1,2,3,4,5,6]
>>>[] ++ [1, 2, 3][1,2,3]
>>>[3, 2, 1] ++ [][3,2,1]
join :: Monad m => m (m a) -> m a #
The join function is the conventional monad join operator. It
is used to remove one level of monadic structure, projecting its
bound argument into the outer level.
'join bssdo expression
do bs <- bss bs
Examples
A common use of join is to run an IO computation returned from
an STM transaction, since STM transactions
can't perform IO directly. Recall that
atomically :: STM a -> IO a
is used to run STM transactions atomically. So, by
specializing the types of atomically and join to
atomically:: STM (IO b) -> IO (IO b)join:: IO (IO b) -> IO b
we can compose them as
join.atomically:: STM (IO b) -> IO b
class Applicative m => Monad (m :: Type -> Type) where #
The Monad class defines the basic operations over a monad,
a concept from a branch of mathematics known as category theory.
From the perspective of a Haskell programmer, however, it is best to
think of a monad as an abstract datatype of actions.
Haskell's do expressions provide a convenient syntax for writing
monadic expressions.
Instances of Monad should satisfy the following:
- Left identity
returna>>=k = k a- Right identity
m>>=return= m- Associativity
m>>=(\x -> k x>>=h) = (m>>=k)>>=h
Furthermore, the Monad and Applicative operations should relate as follows:
The above laws imply:
and that pure and (<*>) satisfy the applicative functor laws.
The instances of Monad for lists, Maybe and IO
defined in the Prelude satisfy these laws.
Methods
(>>=) :: m a -> (a -> m b) -> m b infixl 1 #
Sequentially compose two actions, passing any value produced by the first as an argument to the second.
'as ' can be understood as the >>= bsdo expression
do a <- as bs a
Instances
| Monad IResult | |
| Monad Parser | |
| Monad Result | |
| Monad Complex | Since: base-4.9.0.0 |
| Monad Identity | Since: base-4.8.0.0 |
| Monad First | Since: base-4.8.0.0 |
| Monad Last | Since: base-4.8.0.0 |
| Monad Down | Since: base-4.11.0.0 |
| Monad First | Since: base-4.9.0.0 |
| Monad Last | Since: base-4.9.0.0 |
| Monad Max | Since: base-4.9.0.0 |
| Monad Min | Since: base-4.9.0.0 |
| Monad Dual | Since: base-4.8.0.0 |
| Monad Product | Since: base-4.8.0.0 |
| Monad Sum | Since: base-4.8.0.0 |
| Monad NonEmpty | Since: base-4.9.0.0 |
| Monad STM | Since: base-4.3.0.0 |
| Monad NoIO | Since: base-4.4.0.0 |
| Monad Par1 | Since: base-4.9.0.0 |
| Monad P | Since: base-2.1 |
| Monad ReadP | Since: base-2.1 |
| Monad ReadPrec | Since: base-2.1 |
| Monad Put | |
| Monad Seq | |
| Monad Tree | |
| Monad DNonEmpty | |
| Monad DList | |
| Monad ExceptionCS | Since: effects-exceptions-0.1 |
Defined in Effects.Exception.Annotation.CallStack.Legacy Methods (>>=) :: ExceptionCS a -> (a -> ExceptionCS b) -> ExceptionCS b # (>>) :: ExceptionCS a -> ExceptionCS b -> ExceptionCS b # return :: a -> ExceptionCS a # | |
| Monad IO | Since: base-2.1 |
| Monad NESeq | |
| Monad Chunk | |
| Monad ComplResult | |
| Monad Completion | |
Defined in Options.Applicative.Internal Methods (>>=) :: Completion a -> (a -> Completion b) -> Completion b # (>>) :: Completion a -> Completion b -> Completion b # return :: a -> Completion a # | |
| Monad P | |
| Monad ParserM | |
| Monad ParserResult | |
Defined in Options.Applicative.Types Methods (>>=) :: ParserResult a -> (a -> ParserResult b) -> ParserResult b # (>>) :: ParserResult a -> ParserResult b -> ParserResult b # return :: a -> ParserResult a # | |
| Monad ReadM | |
| Monad Array | |
| Monad SmallArray | |
Defined in Data.Primitive.SmallArray Methods (>>=) :: SmallArray a -> (a -> SmallArray b) -> SmallArray b # (>>) :: SmallArray a -> SmallArray b -> SmallArray b # return :: a -> SmallArray a # | |
| Monad WithDisabled Source # | |
Defined in Shrun.Configuration.Data.WithDisabled Methods (>>=) :: WithDisabled a -> (a -> WithDisabled b) -> WithDisabled b # (>>) :: WithDisabled a -> WithDisabled b -> WithDisabled b # return :: a -> WithDisabled a # | |
| Monad PprM | |
| Monad Q | |
| Monad DecodeM | |
| Monad Decoder | |
| Monad NormalizeM | |
| Monad Vector | |
| Monad Maybe | Since: base-2.1 |
| Monad Solo | Since: base-4.15 |
| Monad [] | Since: base-2.1 |
| Representable f => Monad (Co f) | |
| Monad m => Monad (WrappedMonad m) | Since: base-4.7.0.0 |
Defined in Control.Applicative Methods (>>=) :: WrappedMonad m a -> (a -> WrappedMonad m b) -> WrappedMonad m b # (>>) :: WrappedMonad m a -> WrappedMonad m b -> WrappedMonad m b # return :: a -> WrappedMonad m a # | |
| ArrowApply a => Monad (ArrowMonad a) | Since: base-2.1 |
Defined in Control.Arrow Methods (>>=) :: ArrowMonad a a0 -> (a0 -> ArrowMonad a b) -> ArrowMonad a b # (>>) :: ArrowMonad a a0 -> ArrowMonad a b -> ArrowMonad a b # return :: a0 -> ArrowMonad a a0 # | |
| Monad (Either e) | Since: base-4.4.0.0 |
| Monad (Proxy :: Type -> Type) | Since: base-4.7.0.0 |
| Monad (U1 :: Type -> Type) | Since: base-4.9.0.0 |
| Monad (ST s) | Since: base-2.1 |
| Monad (SetM s) | |
| Monad (ErrorM e) | |
| Monad (Wire s) | |
| Monad (Render s) | |
| Alternative f => Monad (Cofree f) | |
| Functor f => Monad (Free f) | |
| Monad m => Monad (Yoneda m) | |
| Monad (ReifiedFold s) | |
Defined in Control.Lens.Reified Methods (>>=) :: ReifiedFold s a -> (a -> ReifiedFold s b) -> ReifiedFold s b # (>>) :: ReifiedFold s a -> ReifiedFold s b -> ReifiedFold s b # return :: a -> ReifiedFold s a # | |
| Monad (ReifiedGetter s) | |
Defined in Control.Lens.Reified Methods (>>=) :: ReifiedGetter s a -> (a -> ReifiedGetter s b) -> ReifiedGetter s b # (>>) :: ReifiedGetter s a -> ReifiedGetter s b -> ReifiedGetter s b # return :: a -> ReifiedGetter s a # | |
| Monad f => Monad (WrappedPoly f) | |
Defined in Data.MonoTraversable Methods (>>=) :: WrappedPoly f a -> (a -> WrappedPoly f b) -> WrappedPoly f b # (>>) :: WrappedPoly f a -> WrappedPoly f b -> WrappedPoly f b # return :: a -> WrappedPoly f a # | |
| Monad m => Monad (ListT m) | |
| Monad m => Monad (NondetT m) | |
| Monad m => Monad (ResourceT m) | |
| Monad (Bytes s) | Since: si-bytes-0.1 |
| Semigroup a => Monad (These a) | |
| Monad (IParser t) | |
| Semigroup a => Monad (These a) | |
| Monad m => Monad (MaybeT m) | |
| Monoid a => Monad ((,) a) | Since: base-4.9.0.0 |
| Monad m => Monad (Kleisli m a) | Since: base-4.14.0.0 |
| Monad m => Monad (StateT s m) | Since: base-4.18.0.0 |
| Monad f => Monad (Ap f) | Since: base-4.12.0.0 |
| Monad f => Monad (Alt f) | Since: base-4.8.0.0 |
| Monad f => Monad (Rec1 f) | Since: base-4.9.0.0 |
| (Applicative f, Monad f) => Monad (WhenMissing f x) | Equivalent to Since: containers-0.5.9 |
Defined in Data.IntMap.Internal Methods (>>=) :: WhenMissing f x a -> (a -> WhenMissing f x b) -> WhenMissing f x b # (>>) :: WhenMissing f x a -> WhenMissing f x b -> WhenMissing f x b # return :: a -> WhenMissing f x a # | |
| Monad m => Monad (ErrorT e m) | |
| (Alternative f, Monad w) => Monad (CofreeT f w) | |
| (Functor f, Monad m) => Monad (FreeT f m) | |
| Monad (Indexed i a) | |
| Monad (t m) => Monad (LiftingAccum t m) | Since: mtl-2.3 |
Defined in Control.Monad.Accum Methods (>>=) :: LiftingAccum t m a -> (a -> LiftingAccum t m b) -> LiftingAccum t m b # (>>) :: LiftingAccum t m a -> LiftingAccum t m b -> LiftingAccum t m b # return :: a -> LiftingAccum t m a # | |
| Monad (t m) => Monad (LiftingSelect t m) | Since: mtl-2.3 |
Defined in Control.Monad.Select Methods (>>=) :: LiftingSelect t m a -> (a -> LiftingSelect t m b) -> LiftingSelect t m b # (>>) :: LiftingSelect t m a -> LiftingSelect t m b -> LiftingSelect t m b # return :: a -> LiftingSelect t m a # | |
| (Monad (Rep p), Representable p) => Monad (Prep p) | |
| Monad m => Monad (ShellT env m) Source # | |
| Monad (NetBytes d s) | Since: si-bytes-0.1 |
| Monad (Tagged s) | |
| (Monoid w, Functor m, Monad m) => Monad (AccumT w m) | |
| Monad m => Monad (ExceptT e m) | |
| Monad m => Monad (IdentityT m) | |
| Monad m => Monad (ReaderT r m) | |
| Monad m => Monad (SelectT r m) | |
| Monad m => Monad (StateT s m) | |
| Monad m => Monad (StateT s m) | |
| Monad m => Monad (WriterT w m) | |
| (Monoid w, Monad m) => Monad (WriterT w m) | |
| (Monoid w, Monad m) => Monad (WriterT w m) | |
| Monad m => Monad (Reverse m) | Derived instance. |
| (Monoid a, Monoid b) => Monad ((,,) a b) | Since: base-4.14.0.0 |
| (Monad f, Monad g) => Monad (Product f g) | Since: base-4.9.0.0 |
| (Monad f, Monad g) => Monad (f :*: g) | Since: base-4.9.0.0 |
| Monad (ConduitT i o m) | |
| (Monad f, Applicative f) => Monad (WhenMatched f x y) | Equivalent to Since: containers-0.5.9 |
Defined in Data.IntMap.Internal Methods (>>=) :: WhenMatched f x y a -> (a -> WhenMatched f x y b) -> WhenMatched f x y b # (>>) :: WhenMatched f x y a -> WhenMatched f x y b -> WhenMatched f x y b # return :: a -> WhenMatched f x y a # | |
| (Applicative f, Monad f) => Monad (WhenMissing f k x) | Equivalent to Since: containers-0.5.9 |
Defined in Data.Map.Internal Methods (>>=) :: WhenMissing f k x a -> (a -> WhenMissing f k x b) -> WhenMissing f k x b # (>>) :: WhenMissing f k x a -> WhenMissing f k x b -> WhenMissing f k x b # return :: a -> WhenMissing f k x a # | |
| Stream s => Monad (ParsecT e s m) |
|
| Monad (ContT r m) | |
| (Monoid a, Monoid b, Monoid c) => Monad ((,,,) a b c) | Since: base-4.14.0.0 |
| Monad ((->) r) | Since: base-2.1 |
| Monad f => Monad (M1 i c f) | Since: base-4.9.0.0 |
| (Monad f, Applicative f) => Monad (WhenMatched f k x y) | Equivalent to Since: containers-0.5.9 |
Defined in Data.Map.Internal Methods (>>=) :: WhenMatched f k x y a -> (a -> WhenMatched f k x y b) -> WhenMatched f k x y b # (>>) :: WhenMatched f k x y a -> WhenMatched f k x y b -> WhenMatched f k x y b # return :: a -> WhenMatched f k x y a # | |
| Monad m => Monad (RWST r w s m) | |
| (Monoid w, Monad m) => Monad (RWST r w s m) | |
| (Monoid w, Monad m) => Monad (RWST r w s m) | |
| Monad m => Monad (Pipe l i o u m) | |
class Functor (f :: Type -> Type) where #
A type f is a Functor if it provides a function fmap which, given any types a and b
lets you apply any function from (a -> b) to turn an f a into an f b, preserving the
structure of f. Furthermore f needs to adhere to the following:
Note, that the second law follows from the free theorem of the type fmap and
the first law, so you need only check that the former condition holds.
See https://www.schoolofhaskell.com/user/edwardk/snippets/fmap or
https://github.com/quchen/articles/blob/master/second_functor_law.md
for an explanation.
Methods
fmap :: (a -> b) -> f a -> f b #
fmap is used to apply a function of type (a -> b) to a value of type f a,
where f is a functor, to produce a value of type f b.
Note that for any type constructor with more than one parameter (e.g., Either),
only the last type parameter can be modified with fmap (e.g., b in `Either a b`).
Some type constructors with two parameters or more have a Bifunctor
Examples
Convert from a Maybe IntMaybe String
using show:
>>>fmap show NothingNothing>>>fmap show (Just 3)Just "3"
Convert from an Either Int IntEither Int String using show:
>>>fmap show (Left 17)Left 17>>>fmap show (Right 17)Right "17"
Double each element of a list:
>>>fmap (*2) [1,2,3][2,4,6]
Apply even to the second element of a pair:
>>>fmap even (2,2)(2,True)
It may seem surprising that the function is only applied to the last element of the tuple
compared to the list example above which applies it to every element in the list.
To understand, remember that tuples are type constructors with multiple type parameters:
a tuple of 3 elements (a,b,c) can also be written (,,) a b c and its Functor instance
is defined for Functor ((,,) a b) (i.e., only the third parameter is free to be mapped over
with fmap).
It explains why fmap can be used with tuples containing values of different types as in the
following example:
>>>fmap even ("hello", 1.0, 4)("hello",1.0,True)
Instances
| Functor KeyMap | |
| Functor IResult | |
| Functor Parser | |
| Functor Result | |
| Functor Async | |
| Functor Concurrently | |
Defined in Control.Concurrent.Async.Internal Methods fmap :: (a -> b) -> Concurrently a -> Concurrently b # (<$) :: a -> Concurrently b -> Concurrently a # | |
| Functor ZipList | Since: base-2.1 |
| Functor Handler | Since: base-4.6.0.0 |
| Functor Complex | Since: base-4.9.0.0 |
| Functor Identity | Since: base-4.8.0.0 |
| Functor First | Since: base-4.8.0.0 |
| Functor Last | Since: base-4.8.0.0 |
| Functor Down | Since: base-4.11.0.0 |
| Functor First | Since: base-4.9.0.0 |
| Functor Last | Since: base-4.9.0.0 |
| Functor Max | Since: base-4.9.0.0 |
| Functor Min | Since: base-4.9.0.0 |
| Functor Dual | Since: base-4.8.0.0 |
| Functor Product | Since: base-4.8.0.0 |
| Functor Sum | Since: base-4.8.0.0 |
| Functor NonEmpty | Since: base-4.9.0.0 |
| Functor STM | Since: base-4.3.0.0 |
| Functor NoIO | Since: base-4.8.0.0 |
| Functor Par1 | Since: base-4.9.0.0 |
| Functor ArgDescr | Since: base-4.7.0.0 |
| Functor ArgOrder | Since: base-4.7.0.0 |
| Functor OptDescr | Since: base-4.7.0.0 |
| Functor P | Since: base-4.8.0.0 |
Defined in Text.ParserCombinators.ReadP | |
| Functor ReadP | Since: base-2.1 |
| Functor ReadPrec | Since: base-2.1 |
| Functor Put | |
| Functor Flush | |
| Functor SCC | Since: containers-0.5.4 |
| Functor IntMap | |
| Functor Digit | |
| Functor Elem | |
| Functor FingerTree | |
Defined in Data.Sequence.Internal Methods fmap :: (a -> b) -> FingerTree a -> FingerTree b # (<$) :: a -> FingerTree b -> FingerTree a # | |
| Functor Node | |
| Functor Seq | |
| Functor ViewL | |
| Functor ViewR | |
| Functor Tree | |
| Functor DNonEmpty | |
| Functor DList | |
| Functor ExceptionCS | Since: effects-exceptions-0.1 |
Defined in Effects.Exception.Annotation.CallStack.Legacy Methods fmap :: (a -> b) -> ExceptionCS a -> ExceptionCS b # (<$) :: a -> ExceptionCS b -> ExceptionCS a # | |
| Functor IO | Since: base-2.1 |
| Functor ErrorFancy | |
Defined in Text.Megaparsec.Error Methods fmap :: (a -> b) -> ErrorFancy a -> ErrorFancy b # (<$) :: a -> ErrorFancy b -> ErrorFancy a # | |
| Functor ErrorItem | |
| Functor NEIntMap | |
| Functor NESeq | |
| Functor Identity' | |
| Functor Chunk | |
| Functor ComplResult | |
Defined in Options.Applicative.Internal | |
| Functor Completion | |
Defined in Options.Applicative.Internal Methods fmap :: (a -> b) -> Completion a -> Completion b # (<$) :: a -> Completion b -> Completion a # | |
| Functor P | |
| Functor CReader | |
| Functor OptReader | |
| Functor Option | |
| Functor Parser | |
| Functor ParserFailure | |
Defined in Options.Applicative.Types Methods fmap :: (a -> b) -> ParserFailure a -> ParserFailure b # (<$) :: a -> ParserFailure b -> ParserFailure a # | |
| Functor ParserInfo | |
Defined in Options.Applicative.Types Methods fmap :: (a -> b) -> ParserInfo a -> ParserInfo b # (<$) :: a -> ParserInfo b -> ParserInfo a # | |
| Functor ParserM | |
| Functor ParserResult | |
Defined in Options.Applicative.Types Methods fmap :: (a -> b) -> ParserResult a -> ParserResult b # (<$) :: a -> ParserResult b -> ParserResult a # | |
| Functor ReadM | |
| Functor AnnotDetails | |
Defined in Text.PrettyPrint.Annotated.HughesPJ Methods fmap :: (a -> b) -> AnnotDetails a -> AnnotDetails b # (<$) :: a -> AnnotDetails b -> AnnotDetails a # | |
| Functor Doc | |
| Functor Span | |
| Functor Doc | Alter the document’s annotations. This instance makes |
| Functor FlattenResult | |
Defined in Prettyprinter.Internal | |
| Functor SimpleDocStream | Alter the document’s annotations. This instance makes |
Defined in Prettyprinter.Internal Methods fmap :: (a -> b) -> SimpleDocStream a -> SimpleDocStream b # (<$) :: a -> SimpleDocStream b -> SimpleDocStream a # | |
| Functor Array | |
| Functor SmallArray | |
Defined in Data.Primitive.SmallArray Methods fmap :: (a -> b) -> SmallArray a -> SmallArray b # (<$) :: a -> SmallArray b -> SmallArray a # | |
| Functor WithDisabled Source # | |
Defined in Shrun.Configuration.Data.WithDisabled Methods fmap :: (a -> b) -> WithDisabled a -> WithDisabled b # (<$) :: a -> WithDisabled b -> WithDisabled a # | |
| Functor SomeSize | Since: si-bytes-0.1 |
| Functor SomeNet | Since: si-bytes-0.1 |
| Functor Maybe | |
| Functor PprM | |
| Functor Q | |
| Functor TyVarBndr | |
| Functor Window | |
| Functor DecodeM | |
| Functor Decoder | |
| Functor NormalizeM | |
Defined in TOML.Parser | |
| Functor Cleanup | |
| Functor Flat | |
| Functor FlatApp | |
| Functor Vector | |
| Functor Maybe | Since: base-2.1 |
| Functor Solo | Since: base-4.15 |
| Functor [] | Since: base-2.1 |
| Functor f => Functor (Co f) | |
| Functor (ConcurrentlyE e) | |
Defined in Control.Concurrent.Async.Internal Methods fmap :: (a -> b) -> ConcurrentlyE e a -> ConcurrentlyE e b # (<$) :: a -> ConcurrentlyE e b -> ConcurrentlyE e a # | |
| Monad m => Functor (WrappedMonad m) | Since: base-2.1 |
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 |
Defined in Control.Arrow Methods fmap :: (a0 -> b) -> ArrowMonad a a0 -> ArrowMonad a b # (<$) :: a0 -> ArrowMonad a b -> ArrowMonad a a0 # | |
| Functor (Either a) | Since: base-3.0 |
| Functor (StateL s) | Since: base-4.0 |
Defined in Data.Functor.Utils | |
| Functor (StateR s) | Since: base-4.0 |
Defined in Data.Functor.Utils | |
| Functor (Proxy :: Type -> Type) | Since: base-4.7.0.0 |
| Functor (Arg a) | Since: base-4.9.0.0 |
| Functor (Array i) | Since: base-2.1 |
| Functor (U1 :: Type -> Type) | Since: base-4.9.0.0 |
| Functor (V1 :: Type -> Type) | Since: base-4.9.0.0 |
| Functor (ST s) | Since: base-2.1 |
| Monad m => Functor (ZipSource m) | |
| Functor (SetM s) | |
Defined in Data.Graph | |
| Functor (Map k) | |
| Functor (ErrorM e) | |
Defined in DBus.Internal.Wire | |
| Functor (Wire s) | |
Defined in DBus.Internal.Wire | |
| Functor (Render s) | |
Defined in DBus.Introspection.Render | |
| Functor m => Functor (Concurrently m) | Since: effects-async-0.1 |
Defined in Effects.Concurrent.Async Methods fmap :: (a -> b) -> Concurrently m a -> Concurrently m b # (<$) :: a -> Concurrently m b -> Concurrently m a # | |
| Monad m => Functor (Handler m) | |
| Functor f => Functor (Cofree f) | |
| Functor f => Functor (Free f) | |
| Functor (Yoneda f) | |
| Functor f => Functor (Indexing f) | |
| Functor f => Functor (Indexing64 f) | |
Defined in Control.Lens.Internal.Indexed Methods fmap :: (a -> b) -> Indexing64 f a -> Indexing64 f b # (<$) :: a -> Indexing64 f b -> Indexing64 f a # | |
| Functor (ReifiedFold s) | |
Defined in Control.Lens.Reified Methods fmap :: (a -> b) -> ReifiedFold s a -> ReifiedFold s b # (<$) :: a -> ReifiedFold s b -> ReifiedFold s a # | |
| Functor (ReifiedGetter s) | |
Defined in Control.Lens.Reified Methods fmap :: (a -> b) -> ReifiedGetter s a -> ReifiedGetter s b # (<$) :: a -> ReifiedGetter s b -> ReifiedGetter s a # | |
| Functor f => Functor (WrappedPoly f) | |
Defined in Data.MonoTraversable Methods fmap :: (a -> b) -> WrappedPoly f a -> WrappedPoly f b # (<$) :: a -> WrappedPoly f b -> WrappedPoly f a # | |
| Functor (NEMap k) | |
| Functor f => Functor (OrT f) | |
| Monad m => Functor (ListT m) | |
| Monad m => Functor (NondetT m) | |
| Functor m => Functor (ResourceT m) | |
| Functor (Bytes s) | Since: si-bytes-0.1 |
| Functor (SomeNetDir s) | Since: si-bytes-0.1 |
Defined in Data.Bytes.Network.Internal Methods fmap :: (a -> b) -> SomeNetDir s a -> SomeNetDir s b # (<$) :: a -> SomeNetDir s b -> SomeNetDir s a # | |
| Functor (SomeNetSize d) | Since: si-bytes-0.1 |
Defined in Data.Bytes.Network.Internal Methods fmap :: (a -> b) -> SomeNetSize d a -> SomeNetSize d b # (<$) :: a -> SomeNetSize d b -> SomeNetSize d a # | |
| Functor (Either a) | |
| Functor (These a) | |
| Functor (Pair e) | |
| Functor (IParser t) | |
| Functor (These a) | |
| Functor f => Functor (Lift f) | |
| Functor m => Functor (MaybeT m) | |
| Functor (StreamSpec streamType) | |
Defined in System.Process.Typed.Internal Methods fmap :: (a -> b) -> StreamSpec streamType a -> StreamSpec streamType b # (<$) :: a -> StreamSpec streamType b -> StreamSpec streamType a # | |
| Functor m => Functor (Conc m) | |
| Monad m => Functor (Concurrently m) | Since: unliftio-0.1.0.0 |
Defined in UnliftIO.Internals.Async Methods fmap :: (a -> b) -> Concurrently m a -> Concurrently m b # (<$) :: a -> Concurrently m b -> Concurrently m a # | |
| Functor (HashMap k) | |
| Functor ((,) a) | Since: base-2.1 |
| Arrow a => Functor (WrappedArrow a b) | Since: base-2.1 |
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 m => Functor (Kleisli m a) | Since: base-4.14.0.0 |
| Functor (Const m :: Type -> Type) | Since: base-2.1 |
| Monad m => Functor (StateT s m) | Since: base-4.18.0.0 |
Defined in Data.Functor.Utils | |
| Functor f => Functor (Ap f) | Since: base-4.12.0.0 |
| Functor f => Functor (Alt f) | Since: base-4.8.0.0 |
| (Generic1 f, Functor (Rep1 f)) => Functor (Generically1 f) | Since: base-4.17.0.0 |
Defined in GHC.Generics Methods fmap :: (a -> b) -> Generically1 f a -> Generically1 f b # (<$) :: a -> Generically1 f b -> Generically1 f a # | |
| Functor f => Functor (Rec1 f) | Since: base-4.9.0.0 |
| Functor (URec (Ptr ()) :: Type -> Type) | Since: base-4.9.0.0 |
| Functor (URec Char :: Type -> Type) | Since: base-4.9.0.0 |
| Functor (URec Double :: Type -> Type) | Since: base-4.9.0.0 |
| Functor (URec Float :: Type -> Type) | Since: base-4.9.0.0 |
| Functor (URec Int :: Type -> Type) | Since: base-4.9.0.0 |
| Functor (URec Word :: Type -> Type) | Since: base-4.9.0.0 |
| Bifunctor p => Functor (Fix p) | |
| Bifunctor p => Functor (Join p) | |
| Monad m => Functor (ZipSink i m) | |
| (Applicative f, Monad f) => Functor (WhenMissing f x) | Since: containers-0.5.9 |
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 # | |
| Monad m => Functor (ErrorT e m) | |
Defined in DBus.Internal.Wire | |
| Functor f => Functor (CofreeF f a) | |
| (Functor f, Functor w) => Functor (CofreeT f w) | |
| Functor f => Functor (FreeF f a) | |
| (Functor f, Functor m) => Functor (FreeT f m) | |
| Functor (Context a b) | |
| Functor (Tagged i a) | |
| Functor (Day f g) | |
| Functor (Indexed i a) | |
| Functor (ReifiedIndexedFold i s) | |
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 (ReifiedIndexedGetter i s) | |
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 (Reply e s) | |
| Functor (Result s e) | |
| Functor (t m) => Functor (LiftingAccum t m) | Since: mtl-2.3 |
Defined in Control.Monad.Accum Methods fmap :: (a -> b) -> LiftingAccum t m a -> LiftingAccum t m b # (<$) :: a -> LiftingAccum t m b -> LiftingAccum t m a # | |
| Functor (t m) => Functor (LiftingSelect t m) | Since: mtl-2.3 |
Defined in Control.Monad.Select Methods fmap :: (a -> b) -> LiftingSelect t m a -> LiftingSelect t m b # (<$) :: a -> LiftingSelect t m b -> LiftingSelect t m a # | |
| Functor f => Functor (Indexing f) | |
| Profunctor p => Functor (Coprep p) | |
| Profunctor p => Functor (Prep p) | |
| Functor m => Functor (ShellT env m) Source # | |
| Functor (NetBytes d s) | Since: si-bytes-0.1 |
| Functor (Tagged s) | |
| (Functor f, Functor g) => Functor (These1 f g) | |
| Functor f => Functor (Backwards f) | Derived instance. |
| Functor m => Functor (AccumT w m) | |
| Functor m => Functor (ExceptT e m) | |
| Functor m => Functor (IdentityT m) | |
| Functor m => Functor (ReaderT r m) | |
| Functor m => Functor (SelectT r m) | |
| Functor m => Functor (StateT s m) | |
| Functor m => Functor (StateT s m) | |
| Functor m => Functor (WriterT w m) | |
| Functor m => Functor (WriterT w m) | |
| Functor m => Functor (WriterT w m) | |
| Functor (Constant a :: Type -> Type) | |
| Functor f => Functor (Reverse f) | Derived instance. |
| Functor ((,,) a b) | Since: base-4.14.0.0 |
| (Functor f, Functor g) => Functor (Product f g) | Since: base-4.9.0.0 |
| (Functor f, Functor g) => Functor (Sum f g) | Since: base-4.9.0.0 |
| (Functor f, Functor g) => Functor (f :*: g) | Since: base-4.9.0.0 |
| (Functor f, Functor g) => Functor (f :+: g) | Since: base-4.9.0.0 |
| Functor (K1 i c :: Type -> Type) | Since: base-4.9.0.0 |
| Functor (ConduitT i o m) | |
| Functor (ZipConduit i o m) | |
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 |
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 |
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 (ParsecT e s m) | |
| Functor (ContT r m) | |
| Functor ((,,,) a b c) | Since: base-4.14.0.0 |
| Functor ((->) r) | Since: base-2.1 |
| (Functor f, Functor g) => Functor (Compose f g) | Since: base-4.9.0.0 |
| (Functor f, Functor g) => Functor (f :.: g) | Since: base-4.9.0.0 |
| Functor f => Functor (M1 i c f) | Since: base-4.9.0.0 |
| Functor (Clown f a :: Type -> Type) | |
| Bifunctor p => Functor (Flip p a) | |
| Functor g => Functor (Joker g a) | |
| Bifunctor p => Functor (WrappedBifunctor p a) | |
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 f => Functor (WhenMatched f k x y) | Since: containers-0.5.9 |
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 # | |
| Functor (Market a b i s) | |
| Reifies s (ReifiedApplicative f) => Functor (ReflectedApplicative f s) | |
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 # | |
| Functor m => Functor (RWST r w s m) | |
| Functor m => Functor (RWST r w s m) | |
| Functor m => Functor (RWST r w s m) | |
| Functor ((,,,,) a b c d) | Since: base-4.18.0.0 |
| (Functor (f a), Functor (g a)) => Functor (Product f g a) | |
| (Functor (f a), Functor (g a)) => Functor (Sum f g a) | |
| Monad m => Functor (Pipe l i o u m) | |
| Functor ((,,,,,) a b c d e) | Since: base-4.18.0.0 |
| (Functor f, Bifunctor p) => Functor (Tannen f p a) | |
| Profunctor p => Functor (Procompose p q a) | |
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) | |
| Functor ((,,,,,,) a b c d e f) | Since: base-4.18.0.0 |
| (Bifunctor p, Functor g) => Functor (Biff p f g a) | |
class Functor f => Applicative (f :: Type -> Type) where #
A functor with application, providing operations to
A minimal complete definition must include implementations of pure
and of either <*> or liftA2. If it defines both, then they must behave
the same as their default definitions:
(<*>) =liftA2id
liftA2f x y = f<$>x<*>y
Further, any definition must satisfy the following:
- Identity
pureid<*>v = v- Composition
pure(.)<*>u<*>v<*>w = u<*>(v<*>w)- Homomorphism
puref<*>purex =pure(f x)- Interchange
u
<*>purey =pure($y)<*>u
The other methods have the following default definitions, which may be overridden with equivalent specialized implementations:
As a consequence of these laws, the Functor instance for f will satisfy
It may be useful to note that supposing
forall x y. p (q x y) = f x . g y
it follows from the above that
liftA2p (liftA2q u v) =liftA2f u .liftA2g v
If f is also a Monad, it should satisfy
(which implies that pure and <*> satisfy the applicative functor laws).
Methods
Lift a value.
(<*>) :: f (a -> b) -> f a -> f b infixl 4 #
Sequential application.
A few functors support an implementation of <*> that is more
efficient than the default one.
Example
Used in combination with (, <$>)( can be used to build a record.<*>)
>>>data MyState = MyState {arg1 :: Foo, arg2 :: Bar, arg3 :: Baz}
>>>produceFoo :: Applicative f => f Foo
>>>produceBar :: Applicative f => f Bar>>>produceBaz :: Applicative f => f Baz
>>>mkState :: Applicative f => f MyState>>>mkState = MyState <$> produceFoo <*> produceBar <*> produceBaz
liftA2 :: (a -> b -> c) -> f a -> f b -> f c #
Lift a binary function to actions.
Some functors support an implementation of liftA2 that is more
efficient than the default one. In particular, if fmap is an
expensive operation, it is likely better to use liftA2 than to
fmap over the structure and then use <*>.
This became a typeclass method in 4.10.0.0. Prior to that, it was
a function defined in terms of <*> and fmap.
Example
>>>liftA2 (,) (Just 3) (Just 5)Just (3,5)
(*>) :: f a -> f b -> f b infixl 4 #
Sequence actions, discarding the value of the first argument.
Examples
If used in conjunction with the Applicative instance for Maybe,
you can chain Maybe computations, with a possible "early return"
in case of Nothing.
>>>Just 2 *> Just 3Just 3
>>>Nothing *> Just 3Nothing
Of course a more interesting use case would be to have effectful computations instead of just returning pure values.
>>>import Data.Char>>>import Text.ParserCombinators.ReadP>>>let p = string "my name is " *> munch1 isAlpha <* eof>>>readP_to_S p "my name is Simon"[("Simon","")]
Instances
| Applicative IResult | |
| Applicative Parser | |
| Applicative Result | |
| Applicative Concurrently | |
Defined in Control.Concurrent.Async.Internal 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 ZipList | f <$> ZipList xs1 <*> ... <*> ZipList xsN
= ZipList (zipWithN f xs1 ... xsN)where (\a b c -> stimes c [a, b]) <$> ZipList "abcd" <*> ZipList "567" <*> ZipList [1..]
= ZipList (zipWith3 (\a b c -> stimes c [a, b]) "abcd" "567" [1..])
= ZipList {getZipList = ["a5","b6b6","c7c7c7"]}Since: base-2.1 |
| Applicative Complex | Since: base-4.9.0.0 |
| Applicative Identity | Since: base-4.8.0.0 |
| Applicative First | Since: base-4.8.0.0 |
| Applicative Last | Since: base-4.8.0.0 |
| Applicative Down | Since: base-4.11.0.0 |
| Applicative First | Since: base-4.9.0.0 |
| Applicative Last | Since: base-4.9.0.0 |
| Applicative Max | Since: base-4.9.0.0 |
| Applicative Min | Since: base-4.9.0.0 |
| Applicative Dual | Since: base-4.8.0.0 |
| Applicative Product | Since: base-4.8.0.0 |
| Applicative Sum | Since: base-4.8.0.0 |
| Applicative NonEmpty | Since: base-4.9.0.0 |
| Applicative STM | Since: base-4.8.0.0 |
| Applicative NoIO | Since: base-4.8.0.0 |
| Applicative Par1 | Since: base-4.9.0.0 |
| Applicative P | Since: base-4.5.0.0 |
| Applicative ReadP | Since: base-4.6.0.0 |
| Applicative ReadPrec | Since: base-4.6.0.0 |
| Applicative Put | |
| Applicative Seq | Since: containers-0.5.4 |
| Applicative Tree | |
| Applicative DNonEmpty | |
Defined in Data.DList.DNonEmpty.Internal | |
| Applicative DList | |
| Applicative ExceptionCS | Since: effects-exceptions-0.1 |
Defined in Effects.Exception.Annotation.CallStack.Legacy Methods pure :: a -> ExceptionCS a # (<*>) :: ExceptionCS (a -> b) -> ExceptionCS a -> ExceptionCS b # liftA2 :: (a -> b -> c) -> ExceptionCS a -> ExceptionCS b -> ExceptionCS c # (*>) :: ExceptionCS a -> ExceptionCS b -> ExceptionCS b # (<*) :: ExceptionCS a -> ExceptionCS b -> ExceptionCS a # | |
| Applicative IO | Since: base-2.1 |
| Applicative NESeq | |
| Applicative Identity' | |
| Applicative Chunk | |
| Applicative ComplResult | |
Defined in Options.Applicative.Internal | |
| Applicative Completion | |
Defined in Options.Applicative.Internal Methods pure :: a -> Completion a # (<*>) :: Completion (a -> b) -> Completion a -> Completion b # liftA2 :: (a -> b -> c) -> Completion a -> Completion b -> Completion c # (*>) :: Completion a -> Completion b -> Completion b # (<*) :: Completion a -> Completion b -> Completion a # | |
| Applicative P | |
| Applicative Parser | |
| Applicative ParserM | |
| Applicative ParserResult | |
Defined in Options.Applicative.Types Methods pure :: a -> ParserResult a # (<*>) :: ParserResult (a -> b) -> ParserResult a -> ParserResult b # liftA2 :: (a -> b -> c) -> ParserResult a -> ParserResult b -> ParserResult c # (*>) :: ParserResult a -> ParserResult b -> ParserResult b # (<*) :: ParserResult a -> ParserResult b -> ParserResult a # | |
| Applicative ReadM | |
| Applicative Array | |
| Applicative SmallArray | |
Defined in Data.Primitive.SmallArray Methods pure :: a -> SmallArray a # (<*>) :: SmallArray (a -> b) -> SmallArray a -> SmallArray b # liftA2 :: (a -> b -> c) -> SmallArray a -> SmallArray b -> SmallArray c # (*>) :: SmallArray a -> SmallArray b -> SmallArray b # (<*) :: SmallArray a -> SmallArray b -> SmallArray a # | |
| Applicative WithDisabled Source # | |
Defined in Shrun.Configuration.Data.WithDisabled Methods pure :: a -> WithDisabled a # (<*>) :: WithDisabled (a -> b) -> WithDisabled a -> WithDisabled b # liftA2 :: (a -> b -> c) -> WithDisabled a -> WithDisabled b -> WithDisabled c # (*>) :: WithDisabled a -> WithDisabled b -> WithDisabled b # (<*) :: WithDisabled a -> WithDisabled b -> WithDisabled a # | |
| Applicative PprM | |
| Applicative Q | |
| Applicative DecodeM | |
| Applicative Decoder | |
| Applicative NormalizeM | |
Defined in TOML.Parser | |
| Applicative Cleanup | |
| Applicative Flat | |
| Applicative FlatApp | |
| Applicative Vector | |
| Applicative Maybe | Since: base-2.1 |
| Applicative Solo | Since: base-4.15 |
| Applicative [] | Since: base-2.1 |
| Representable f => Applicative (Co f) | |
| Applicative (ConcurrentlyE e) | |
Defined in Control.Concurrent.Async.Internal Methods pure :: a -> ConcurrentlyE e a # (<*>) :: ConcurrentlyE e (a -> b) -> ConcurrentlyE e a -> ConcurrentlyE e b # liftA2 :: (a -> b -> c) -> ConcurrentlyE e a -> ConcurrentlyE e b -> ConcurrentlyE e c # (*>) :: ConcurrentlyE e a -> ConcurrentlyE e b -> ConcurrentlyE e b # (<*) :: ConcurrentlyE e a -> ConcurrentlyE e b -> ConcurrentlyE e a # | |
| Monad m => Applicative (WrappedMonad m) | Since: base-2.1 |
Defined in Control.Applicative Methods pure :: a -> WrappedMonad m a # (<*>) :: WrappedMonad m (a -> b) -> WrappedMonad m a -> WrappedMonad m b # liftA2 :: (a -> b -> c) -> WrappedMonad m a -> WrappedMonad m b -> WrappedMonad m c # (*>) :: WrappedMonad m a -> WrappedMonad m b -> WrappedMonad m b # (<*) :: WrappedMonad m a -> WrappedMonad m b -> WrappedMonad m a # | |
| Arrow a => Applicative (ArrowMonad a) | Since: base-4.6.0.0 |
Defined in Control.Arrow Methods pure :: a0 -> ArrowMonad a a0 # (<*>) :: ArrowMonad a (a0 -> b) -> ArrowMonad a a0 -> ArrowMonad a b # liftA2 :: (a0 -> b -> c) -> ArrowMonad a a0 -> ArrowMonad a b -> ArrowMonad a c # (*>) :: ArrowMonad a a0 -> ArrowMonad a b -> ArrowMonad a b # (<*) :: ArrowMonad a a0 -> ArrowMonad a b -> ArrowMonad a a0 # | |
| Applicative (Either e) | Since: base-3.0 |
| Applicative (StateL s) | Since: base-4.0 |
| Applicative (StateR s) | Since: base-4.0 |
| Applicative (Proxy :: Type -> Type) | Since: base-4.7.0.0 |
| Applicative (U1 :: Type -> Type) | Since: base-4.9.0.0 |
| Applicative (ST s) | Since: base-4.4.0.0 |
| Monad m => Applicative (ZipSource m) | |
Defined in Data.Conduit.Internal.Conduit | |
| Applicative (SetM s) | |
| Applicative (ErrorM e) | |
| Applicative (Wire s) | |
| Applicative (Render s) | |
| MonadAsync m => Applicative (Concurrently m) | Since: effects-async-0.1 |
Defined in Effects.Concurrent.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 # | |
| Alternative f => Applicative (Cofree f) | |
| Functor f => Applicative (Free f) | |
| Applicative f => Applicative (Yoneda f) | |
| Applicative f => Applicative (Indexing f) | |
Defined in Control.Lens.Internal.Indexed | |
| Applicative f => Applicative (Indexing64 f) | |
Defined in Control.Lens.Internal.Indexed Methods pure :: a -> Indexing64 f a # (<*>) :: Indexing64 f (a -> b) -> Indexing64 f a -> Indexing64 f b # liftA2 :: (a -> b -> c) -> Indexing64 f a -> Indexing64 f b -> Indexing64 f c # (*>) :: Indexing64 f a -> Indexing64 f b -> Indexing64 f b # (<*) :: Indexing64 f a -> Indexing64 f b -> Indexing64 f a # | |
| Applicative (ReifiedFold s) | |
Defined in Control.Lens.Reified Methods pure :: a -> ReifiedFold s a # (<*>) :: ReifiedFold s (a -> b) -> ReifiedFold s a -> ReifiedFold s b # liftA2 :: (a -> b -> c) -> ReifiedFold s a -> ReifiedFold s b -> ReifiedFold s c # (*>) :: ReifiedFold s a -> ReifiedFold s b -> ReifiedFold s b # (<*) :: ReifiedFold s a -> ReifiedFold s b -> ReifiedFold s a # | |
| Applicative (ReifiedGetter s) | |
Defined in Control.Lens.Reified Methods pure :: a -> ReifiedGetter s a # (<*>) :: ReifiedGetter s (a -> b) -> ReifiedGetter s a -> ReifiedGetter s b # liftA2 :: (a -> b -> c) -> ReifiedGetter s a -> ReifiedGetter s b -> ReifiedGetter s c # (*>) :: ReifiedGetter s a -> ReifiedGetter s b -> ReifiedGetter s b # (<*) :: ReifiedGetter s a -> ReifiedGetter s b -> ReifiedGetter s a # | |
| Applicative f => Applicative (WrappedPoly f) | |
Defined in Data.MonoTraversable Methods pure :: a -> WrappedPoly f a # (<*>) :: WrappedPoly f (a -> b) -> WrappedPoly f a -> WrappedPoly f b # liftA2 :: (a -> b -> c) -> WrappedPoly f a -> WrappedPoly f b -> WrappedPoly f c # (*>) :: WrappedPoly f a -> WrappedPoly f b -> WrappedPoly f b # (<*) :: WrappedPoly f a -> WrappedPoly f b -> WrappedPoly f a # | |
| Applicative f => Applicative (OrT f) | |
| Monad m => Applicative (ListT m) | |
| Monad m => Applicative (NondetT m) | |
Defined in Options.Applicative.Internal | |
| Applicative m => Applicative (ResourceT m) | |
Defined in Control.Monad.Trans.Resource.Internal | |
| Applicative (Bytes s) | Since: si-bytes-0.1 |
| Semigroup a => Applicative (These a) | |
| Applicative (IParser t) | |
| Semigroup a => Applicative (These a) | |
| Applicative f => Applicative (Lift f) | A combination is |
| (Functor m, Monad m) => Applicative (MaybeT m) | |
| MonadUnliftIO m => Applicative (Conc m) | Since: unliftio-0.2.9.0 |
| MonadUnliftIO m => Applicative (Concurrently m) | Since: unliftio-0.1.0.0 |
Defined in UnliftIO.Internals.Async Methods pure :: a -> Concurrently m a # (<*>) :: Concurrently m (a -> b) -> Concurrently m a -> Concurrently m b # liftA2 :: (a -> b -> c) -> Concurrently m a -> Concurrently m b -> Concurrently m c # (*>) :: Concurrently m a -> Concurrently m b -> Concurrently m b # (<*) :: Concurrently m a -> Concurrently m b -> Concurrently m a # | |
| Monoid a => Applicative ((,) a) | For tuples, the ("hello ", (+15)) <*> ("world!", 2002)
("hello world!",2017)Since: base-2.1 |
| Arrow a => Applicative (WrappedArrow a b) | Since: base-2.1 |
Defined in Control.Applicative Methods pure :: a0 -> WrappedArrow a b a0 # (<*>) :: WrappedArrow a b (a0 -> b0) -> WrappedArrow a b a0 -> WrappedArrow a b b0 # liftA2 :: (a0 -> b0 -> c) -> WrappedArrow a b a0 -> WrappedArrow a b b0 -> WrappedArrow a b c # (*>) :: WrappedArrow a b a0 -> WrappedArrow a b b0 -> WrappedArrow a b b0 # (<*) :: WrappedArrow a b a0 -> WrappedArrow a b b0 -> WrappedArrow a b a0 # | |
| Applicative m => Applicative (Kleisli m a) | Since: base-4.14.0.0 |
Defined in Control.Arrow | |
| Monoid m => Applicative (Const m :: Type -> Type) | Since: base-2.0.1 |
| Monad m => Applicative (StateT s m) | Since: base-4.18.0.0 |
Defined in Data.Functor.Utils | |
| Applicative f => Applicative (Ap f) | Since: base-4.12.0.0 |
| Applicative f => Applicative (Alt f) | Since: base-4.8.0.0 |
| (Generic1 f, Applicative (Rep1 f)) => Applicative (Generically1 f) | Since: base-4.17.0.0 |
Defined in GHC.Generics Methods pure :: a -> Generically1 f a # (<*>) :: Generically1 f (a -> b) -> Generically1 f a -> Generically1 f b # liftA2 :: (a -> b -> c) -> Generically1 f a -> Generically1 f b -> Generically1 f c # (*>) :: Generically1 f a -> Generically1 f b -> Generically1 f b # (<*) :: Generically1 f a -> Generically1 f b -> Generically1 f a # | |
| Applicative f => Applicative (Rec1 f) | Since: base-4.9.0.0 |
| Biapplicative p => Applicative (Fix p) | |
| Biapplicative p => Applicative (Join p) | |
| Monad m => Applicative (ZipSink i m) | |
Defined in Data.Conduit.Internal.Conduit | |
| (Applicative f, Monad f) => Applicative (WhenMissing f x) | Equivalent to Since: containers-0.5.9 |
Defined in Data.IntMap.Internal Methods pure :: a -> WhenMissing f x a # (<*>) :: WhenMissing f x (a -> b) -> WhenMissing f x a -> WhenMissing f x b # liftA2 :: (a -> b -> c) -> WhenMissing f x a -> WhenMissing f x b -> WhenMissing f x c # (*>) :: WhenMissing f x a -> WhenMissing f x b -> WhenMissing f x b # (<*) :: WhenMissing f x a -> WhenMissing f x b -> WhenMissing f x a # | |
| Monad m => Applicative (ErrorT e m) | |
Defined in DBus.Internal.Wire | |
| (Alternative f, Applicative w) => Applicative (CofreeT f w) | |
Defined in Control.Comonad.Trans.Cofree | |
| (Functor f, Monad m) => Applicative (FreeT f m) | |
Defined in Control.Monad.Trans.Free | |
| (Applicative f, Applicative g) => Applicative (Day f g) | |
| Applicative (Indexed i a) | |
Defined in Control.Lens.Internal.Indexed | |
| Applicative (t m) => Applicative (LiftingAccum t m) | Since: mtl-2.3 |
Defined in Control.Monad.Accum Methods pure :: a -> LiftingAccum t m a # (<*>) :: LiftingAccum t m (a -> b) -> LiftingAccum t m a -> LiftingAccum t m b # liftA2 :: (a -> b -> c) -> LiftingAccum t m a -> LiftingAccum t m b -> LiftingAccum t m c # (*>) :: LiftingAccum t m a -> LiftingAccum t m b -> LiftingAccum t m b # (<*) :: LiftingAccum t m a -> LiftingAccum t m b -> LiftingAccum t m a # | |
| Applicative (t m) => Applicative (LiftingSelect t m) | Since: mtl-2.3 |
Defined in Control.Monad.Select Methods pure :: a -> LiftingSelect t m a # (<*>) :: LiftingSelect t m (a -> b) -> LiftingSelect t m a -> LiftingSelect t m b # liftA2 :: (a -> b -> c) -> LiftingSelect t m a -> LiftingSelect t m b -> LiftingSelect t m c # (*>) :: LiftingSelect t m a -> LiftingSelect t m b -> LiftingSelect t m b # (<*) :: LiftingSelect t m a -> LiftingSelect t m b -> LiftingSelect t m a # | |
| Applicative f => Applicative (Indexing f) | |
Defined in Optics.Internal.Indexed | |
| (Applicative (Rep p), Representable p) => Applicative (Prep p) | |
| Applicative m => Applicative (ShellT env m) Source # | |
| Applicative (NetBytes d s) | Since: si-bytes-0.1 |
Defined in Data.Bytes.Network.Internal | |
| Applicative (Tagged s) | |
| Applicative f => Applicative (Backwards f) | Apply |
Defined in Control.Applicative.Backwards | |
| (Monoid w, Functor m, Monad m) => Applicative (AccumT w m) | |
Defined in Control.Monad.Trans.Accum | |
| (Functor m, Monad m) => Applicative (ExceptT e m) | |
Defined in Control.Monad.Trans.Except | |
| Applicative m => Applicative (IdentityT m) | |
Defined in Control.Monad.Trans.Identity | |
| Applicative m => Applicative (ReaderT r m) | |
Defined in Control.Monad.Trans.Reader | |
| (Functor m, Monad m) => Applicative (SelectT r m) | |
Defined in Control.Monad.Trans.Select | |
| (Functor m, Monad m) => Applicative (StateT s m) | |
Defined in Control.Monad.Trans.State.Lazy | |
| (Functor m, Monad m) => Applicative (StateT s m) | |
Defined in Control.Monad.Trans.State.Strict | |
| (Functor m, Monad m) => Applicative (WriterT w m) | |
Defined in Control.Monad.Trans.Writer.CPS | |
| (Monoid w, Applicative m) => Applicative (WriterT w m) | |
Defined in Control.Monad.Trans.Writer.Lazy | |
| (Monoid w, Applicative m) => Applicative (WriterT w m) | |
Defined in Control.Monad.Trans.Writer.Strict | |
| Monoid a => Applicative (Constant a :: Type -> Type) | |
Defined in Data.Functor.Constant | |
| Applicative f => Applicative (Reverse f) | Derived instance. |
| (Monoid a, Monoid b) => Applicative ((,,) a b) | Since: base-4.14.0.0 |
| (Applicative f, Applicative g) => Applicative (Product f g) | Since: base-4.9.0.0 |
Defined in Data.Functor.Product | |
| (Applicative f, Applicative g) => Applicative (f :*: g) | Since: base-4.9.0.0 |
| Monoid c => Applicative (K1 i c :: Type -> Type) | Since: base-4.12.0.0 |
| Applicative (ConduitT i o m) | |
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) | |
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 Since: containers-0.5.9 |
Defined in Data.IntMap.Internal Methods pure :: a -> WhenMatched f x y a # (<*>) :: WhenMatched f x y (a -> b) -> WhenMatched f x y a -> WhenMatched f x y b # liftA2 :: (a -> b -> c) -> WhenMatched f x y a -> WhenMatched f x y b -> WhenMatched f x y c # (*>) :: WhenMatched f x y a -> WhenMatched f x y b -> WhenMatched f x y b # (<*) :: WhenMatched f x y a -> WhenMatched f x y b -> WhenMatched f x y a # | |
| (Applicative f, Monad f) => Applicative (WhenMissing f k x) | Equivalent to Since: containers-0.5.9 |
Defined in Data.Map.Internal Methods pure :: a -> WhenMissing f k x a # (<*>) :: WhenMissing f k x (a -> b) -> WhenMissing f k x a -> WhenMissing f k x b # liftA2 :: (a -> b -> c) -> WhenMissing f k x a -> WhenMissing f k x b -> WhenMissing f k x c # (*>) :: WhenMissing f k x a -> WhenMissing f k x b -> WhenMissing f k x b # (<*) :: WhenMissing f k x a -> WhenMissing f k x b -> WhenMissing f k x a # | |
| Stream s => Applicative (ParsecT e s m) |
|
Defined in Text.Megaparsec.Internal Methods pure :: a -> ParsecT e s m a # (<*>) :: ParsecT e s m (a -> b) -> ParsecT e s m a -> ParsecT e s m b # liftA2 :: (a -> b -> c) -> ParsecT e s m a -> ParsecT e s m b -> ParsecT e s m c # (*>) :: ParsecT e s m a -> ParsecT e s m b -> ParsecT e s m b # (<*) :: ParsecT e s m a -> ParsecT e s m b -> ParsecT e s m a # | |
| Applicative (ContT r m) | |
Defined in Control.Monad.Trans.Cont | |
| (Monoid a, Monoid b, Monoid c) => Applicative ((,,,) a b c) | Since: base-4.14.0.0 |
Defined in GHC.Base | |
| Applicative ((->) r) | Since: base-2.1 |
| (Applicative f, Applicative g) => Applicative (Compose f g) | Since: base-4.9.0.0 |
Defined in Data.Functor.Compose | |
| (Applicative f, Applicative g) => Applicative (f :.: g) | Since: base-4.9.0.0 |
| Applicative f => Applicative (M1 i c f) | Since: base-4.9.0.0 |
| (Monad f, Applicative f) => Applicative (WhenMatched f k x y) | Equivalent to Since: containers-0.5.9 |
Defined in Data.Map.Internal Methods pure :: a -> WhenMatched f k x y a # (<*>) :: WhenMatched f k x y (a -> b) -> WhenMatched f k x y a -> WhenMatched f k x y b # liftA2 :: (a -> b -> c) -> WhenMatched f k x y a -> WhenMatched f k x y b -> WhenMatched f k x y c # (*>) :: WhenMatched f k x y a -> WhenMatched f k x y b -> WhenMatched f k x y b # (<*) :: WhenMatched f k x y a -> WhenMatched f k x y b -> WhenMatched f k x y a # | |
| Reifies s (ReifiedApplicative f) => Applicative (ReflectedApplicative f s) | |
Defined in Data.Reflection Methods pure :: a -> ReflectedApplicative f s a # (<*>) :: ReflectedApplicative f s (a -> b) -> ReflectedApplicative f s a -> ReflectedApplicative f s b # liftA2 :: (a -> b -> c) -> ReflectedApplicative f s a -> ReflectedApplicative f s b -> ReflectedApplicative f s c # (*>) :: ReflectedApplicative f s a -> ReflectedApplicative f s b -> ReflectedApplicative f s b # (<*) :: ReflectedApplicative f s a -> ReflectedApplicative f s b -> ReflectedApplicative f s a # | |
| (Functor m, Monad m) => Applicative (RWST r w s m) | |
Defined in Control.Monad.Trans.RWS.CPS | |
| (Monoid w, Functor m, Monad m) => Applicative (RWST r w s m) | |
Defined in Control.Monad.Trans.RWS.Lazy | |
| (Monoid w, Functor m, Monad m) => Applicative (RWST r w s m) | |
Defined in Control.Monad.Trans.RWS.Strict | |
| Monad m => Applicative (Pipe l i o u m) | |
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 Semigroup a => Monoid a where #
The class of monoids (types with an associative binary operation that has an identity). Instances should satisfy the following:
- Right identity
x<>mempty= x- Left identity
mempty<>x = x- Associativity
x(<>(y<>z) = (x<>y)<>zSemigrouplaw)- Concatenation
mconcat=foldr(<>)mempty
You can alternatively define mconcat instead of mempty, in which case the
laws are:
- Unit
mconcat(purex) = x- Multiplication
mconcat(joinxss) =mconcat(fmapmconcatxss)- Subclass
mconcat(toListxs) =sconcatxs
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.
Methods
Identity of mappend
Examples
>>>"Hello world" <> mempty"Hello world"
>>>mempty <> [1, 2, 3][1,2,3]
Fold a list using the monoid.
For most types, the default definition for mconcat will be
used, but the function is included in the class definition so
that an optimized version can be provided for specific types.
>>>mconcat ["Hello", " ", "Haskell", "!"]"Hello Haskell!"
Instances
| Monoid ByteArray | Since: base-4.17.0.0 |
| Monoid All | Since: base-2.1 |
| Monoid Any | Since: base-2.1 |
| Monoid Builder | |
| Monoid ByteString | |
Defined in Data.ByteString.Internal.Type Methods mempty :: ByteString # mappend :: ByteString -> ByteString -> ByteString # mconcat :: [ByteString] -> ByteString # | |
| Monoid ByteString | |
Defined in Data.ByteString.Lazy.Internal Methods mempty :: ByteString # mappend :: ByteString -> ByteString -> ByteString # mconcat :: [ByteString] -> ByteString # | |
| Monoid ShortByteString | |
Defined in Data.ByteString.Short.Internal Methods mappend :: ShortByteString -> ShortByteString -> ShortByteString # mconcat :: [ShortByteString] -> ShortByteString # | |
| Monoid IntSet | |
| Monoid OsString | "String-Concatenation" for |
| Monoid PosixString | |
Defined in System.OsString.Internal.Types.Hidden Methods mempty :: PosixString # mappend :: PosixString -> PosixString -> PosixString # mconcat :: [PosixString] -> PosixString # | |
| Monoid WindowsString | |
Defined in System.OsString.Internal.Types.Hidden Methods mempty :: WindowsString # mappend :: WindowsString -> WindowsString -> WindowsString # mconcat :: [WindowsString] -> WindowsString # | |
| Monoid Ordering | Since: base-2.1 |
| Monoid PrefsMod | |
| Monoid ParserHelp | |
Defined in Options.Applicative.Help.Types Methods mempty :: ParserHelp # mappend :: ParserHelp -> ParserHelp -> ParserHelp # mconcat :: [ParserHelp] -> ParserHelp # | |
| Monoid Completer | |
| Monoid ParseError | |
Defined in Options.Applicative.Types Methods mempty :: ParseError # mappend :: ParseError -> ParseError -> ParseError # mconcat :: [ParseError] -> ParseError # | |
| Monoid OsString | "String-Concatenation" for |
| Monoid PosixString | |
Defined in System.OsString.Internal.Types Methods mempty :: PosixString # mappend :: PosixString -> PosixString -> PosixString # mconcat :: [PosixString] -> PosixString # | |
| Monoid WindowsString | |
Defined in System.OsString.Internal.Types Methods mempty :: WindowsString # mappend :: WindowsString -> WindowsString -> WindowsString # mconcat :: [WindowsString] -> WindowsString # | |
| Monoid Doc | |
| Monoid AnsiStyle |
|
| Monoid UnlinedText Source # | |
Defined in Shrun.Data.Text Methods mempty :: UnlinedText # mappend :: UnlinedText -> UnlinedText -> UnlinedText # mconcat :: [UnlinedText] -> UnlinedText # | |
| Monoid ReadHandleResult Source # | |
Defined in Shrun.IO.Types Methods mappend :: ReadHandleResult -> ReadHandleResult -> ReadHandleResult # mconcat :: [ReadHandleResult] -> ReadHandleResult # | |
| Monoid Builder | |
| Monoid StrictBuilder | |
Defined in Data.Text.Internal.StrictBuilder Methods mempty :: StrictBuilder # mappend :: StrictBuilder -> StrictBuilder -> StrictBuilder # mconcat :: [StrictBuilder] -> StrictBuilder # | |
| Monoid ShortText | |
| Monoid () | Since: base-2.1 |
| Monoid (KeyMap v) | |
| Monoid (IResult a) | |
| Monoid (Parser a) | |
| Monoid (Result a) | |
| (Semigroup a, Monoid a) => Monoid (Concurrently a) | Since: async-2.1.0 |
Defined in Control.Concurrent.Async.Internal Methods mempty :: Concurrently a # mappend :: Concurrently a -> Concurrently a -> Concurrently a # mconcat :: [Concurrently a] -> Concurrently a # | |
| FiniteBits a => Monoid (And a) | This constraint is arguably too strong. However,
as some types (such as Since: base-4.16 |
| FiniteBits a => Monoid (Iff a) | This constraint is arguably
too strong. However, as some types (such as Since: base-4.16 |
| Bits a => Monoid (Ior a) | Since: base-4.16 |
| Bits a => Monoid (Xor a) | Since: base-4.16 |
| Monoid (Comparison a) |
mempty :: Comparison a mempty = Comparison _ _ -> EQ |
Defined in Data.Functor.Contravariant Methods mempty :: Comparison a # mappend :: Comparison a -> Comparison a -> Comparison a # mconcat :: [Comparison a] -> Comparison a # | |
| Monoid (Equivalence a) |
mempty :: Equivalence a mempty = Equivalence _ _ -> True |
Defined in Data.Functor.Contravariant Methods mempty :: Equivalence a # mappend :: Equivalence a -> Equivalence a -> Equivalence a # mconcat :: [Equivalence a] -> Equivalence a # | |
| Monoid (Predicate a) |
mempty :: Predicate a mempty = _ -> True |
| Monoid a => Monoid (Identity a) | Since: base-4.9.0.0 |
| Ord a => Monoid (Max a) | Since: base-4.8.0.0 |
| Ord a => Monoid (Min a) | Since: base-4.8.0.0 |
| Monoid (First a) | Since: base-2.1 |
| Monoid (Last a) | Since: base-2.1 |
| Monoid a => Monoid (Down a) | Since: base-4.11.0.0 |
| (Ord a, Bounded a) => Monoid (Max a) | Since: base-4.9.0.0 |
| (Ord a, Bounded a) => Monoid (Min a) | Since: base-4.9.0.0 |
| Monoid m => Monoid (WrappedMonoid m) | Since: base-4.9.0.0 |
Defined in Data.Semigroup Methods mempty :: WrappedMonoid m # mappend :: WrappedMonoid m -> WrappedMonoid m -> WrappedMonoid m # mconcat :: [WrappedMonoid m] -> WrappedMonoid m # | |
| Monoid a => Monoid (Dual a) | Since: base-2.1 |
| Monoid (Endo a) | Since: base-2.1 |
| Num a => Monoid (Product a) | Since: base-2.1 |
| Num a => Monoid (Sum a) | Since: base-2.1 |
| Monoid a => Monoid (STM a) | Since: base-4.17.0.0 |
| (Generic a, Monoid (Rep a ())) => Monoid (Generically a) | Since: base-4.17.0.0 |
Defined in GHC.Generics Methods mempty :: Generically a # mappend :: Generically a -> Generically a -> Generically a # mconcat :: [Generically a] -> Generically a # | |
| Monoid p => Monoid (Par1 p) | Since: base-4.12.0.0 |
| Monoid (IntMap a) | |
| Monoid (Seq a) | |
| Monoid (MergeSet a) | |
| Ord a => Monoid (Set a) | |
| Monoid (DList a) | |
| Monoid a => Monoid (IO a) | Since: base-4.9.0.0 |
| Ord t => Monoid (Hints t) | |
| Monoid (Leftmost a) | |
| Monoid (Rightmost a) | |
| Monoid (InfoMod a) | |
| Monoid (DefaultProp a) | |
Defined in Options.Applicative.Builder.Internal Methods mempty :: DefaultProp a # mappend :: DefaultProp a -> DefaultProp a -> DefaultProp a # mconcat :: [DefaultProp a] -> DefaultProp a # | |
| Semigroup a => Monoid (Chunk a) | |
| Monoid (Doc a) | |
| Monoid (Doc ann) |
|
| Monoid (Array a) | |
| Monoid (PrimArray a) | Since: primitive-0.6.4.0 |
| Monoid (SmallArray a) | |
Defined in Data.Primitive.SmallArray Methods mempty :: SmallArray a # mappend :: SmallArray a -> SmallArray a -> SmallArray a # mconcat :: [SmallArray a] -> SmallArray a # | |
| Monoid (WithDisabled a) Source # | |
Defined in Shrun.Configuration.Data.WithDisabled Methods mempty :: WithDisabled a # mappend :: WithDisabled a -> WithDisabled a -> WithDisabled a # mconcat :: [WithDisabled a] -> WithDisabled a # | |
| Semigroup a => Monoid (Maybe a) | |
| Monoid a => Monoid (Q a) | Since: template-haskell-2.17.0.0 |
| Monoid (Validity k) | |
| (Hashable a, Eq a) => Monoid (HashSet a) | \(O(n+m)\) To obtain good performance, the smaller set must be presented as the first argument. Examples
|
| Monoid (Vector a) | |
| Prim a => Monoid (Vector a) | |
| Storable a => Monoid (Vector a) | |
| Semigroup a => Monoid (Maybe a) | Lift a semigroup into Since 4.11.0: constraint on inner Since: base-2.1 |
| Monoid a => Monoid (Solo a) | Since: base-4.15 |
| Monoid [a] | Since: base-2.1 |
| (Semigroup a, Monoid a) => Monoid (ConcurrentlyE e a) | |
Defined in Control.Concurrent.Async.Internal Methods mempty :: ConcurrentlyE e a # mappend :: ConcurrentlyE e a -> ConcurrentlyE e a -> ConcurrentlyE e a # mconcat :: [ConcurrentlyE e a] -> ConcurrentlyE e a # | |
| Monoid a => Monoid (Op a b) |
mempty :: Op a b mempty = Op _ -> mempty |
| Monoid (Proxy s) | Since: base-4.7.0.0 |
| Monoid (U1 p) | Since: base-4.12.0.0 |
| Monoid a => Monoid (ST s a) | Since: base-4.11.0.0 |
| Ord k => Monoid (Map k v) | |
| (MonadAsync m, Monoid a) => Monoid (Concurrently m a) | Since: effects-async-0.1 |
Defined in Effects.Concurrent.Async Methods mempty :: Concurrently m a # mappend :: Concurrently m a -> Concurrently m a -> Concurrently m a # mconcat :: [Concurrently m a] -> Concurrently m a # | |
| Monoid (f a) => Monoid (Indexing f a) |
|
| Monoid (ReifiedFold s a) | |
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 # | |
| (Stream s, Ord e) => Monoid (ParseError s e) | |
Defined in Text.Megaparsec.Error Methods mempty :: ParseError s e # mappend :: ParseError s e -> ParseError s e -> ParseError s e # mconcat :: [ParseError s e] -> ParseError s e # | |
| Applicative f => Monoid (Traversed f a) | |
| Monoid (Mod f a) | |
| (Monoid a, Monoid b) => Monoid (Pair a b) | |
| (Monoid a, MonadUnliftIO m) => Monoid (Conc m a) | Since: unliftio-0.2.9.0 |
| (Semigroup a, Monoid a, MonadUnliftIO m) => Monoid (Concurrently m a) | Since: unliftio-0.1.0.0 |
Defined in UnliftIO.Internals.Async Methods mempty :: Concurrently m a # mappend :: Concurrently m a -> Concurrently m a -> Concurrently m a # mconcat :: [Concurrently m a] -> Concurrently m a # | |
| (Eq k, Hashable k) => Monoid (HashMap k v) | If a key occurs in both maps, the mapping from the first will be the mapping in the result. Examples
|
| (Monoid a, Monoid b) => Monoid (a, b) | Since: base-2.1 |
| Monoid b => Monoid (a -> b) | Since: base-2.1 |
| Monoid a => Monoid (Const a b) | Since: base-4.9.0.0 |
| (Applicative f, Monoid a) => Monoid (Ap f a) | Since: base-4.12.0.0 |
| Alternative f => Monoid (Alt f a) | Since: base-4.8.0.0 |
| Monoid (f p) => Monoid (Rec1 f p) | Since: base-4.12.0.0 |
| Monoid (ReifiedIndexedFold i s a) | |
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) | |
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) | |
| Monoid a => Monoid (Constant a b) | |
| (Monoid a, Monoid b, Monoid c) => Monoid (a, b, c) | Since: base-2.1 |
| (Monoid (f a), Monoid (g a)) => Monoid (Product f g a) | Since: base-4.16.0.0 |
| (Monoid (f p), Monoid (g p)) => Monoid ((f :*: g) p) | Since: base-4.12.0.0 |
| Monoid c => Monoid (K1 i c p) | Since: base-4.12.0.0 |
| Monad m => Monoid (ConduitT i o m ()) | |
| (Stream s, Monoid a) => Monoid (ParsecT e s m a) | Since: megaparsec-5.3.0 |
| (Monoid a, Monoid b, Monoid c, Monoid d) => Monoid (a, b, c, d) | Since: base-2.1 |
| Monoid (f (g a)) => Monoid (Compose f g a) | Since: base-4.16.0.0 |
| Monoid (f (g p)) => Monoid ((f :.: g) p) | Since: base-4.12.0.0 |
| Monoid (f p) => Monoid (M1 i c f p) | Since: base-4.12.0.0 |
| (Monoid a, Monoid b, Monoid c, Monoid d, Monoid e) => Monoid (a, b, c, d, e) | Since: base-2.1 |
| Monad m => Monoid (Pipe l i o u m ()) | |
The class of semigroups (types with an associative binary operation).
Instances should satisfy the following:
You can alternatively define sconcat instead of (<>), in which case the
laws are:
Since: base-4.9.0.0
Methods
(<>) :: a -> a -> a infixr 6 #
An associative operation.
Examples
>>>[1,2,3] <> [4,5,6][1,2,3,4,5,6]
>>>Just [1, 2, 3] <> Just [4, 5, 6]Just [1,2,3,4,5,6]
>>>putStr "Hello, " <> putStrLn "World!"Hello, World!
Instances
| Semigroup ByteArray | Since: base-4.17.0.0 |
| Semigroup All | Since: base-4.9.0.0 |
| Semigroup Any | Since: base-4.9.0.0 |
| Semigroup Void | Since: base-4.9.0.0 |
| Semigroup Builder | |
| Semigroup ByteString | |
Defined in Data.ByteString.Internal.Type Methods (<>) :: ByteString -> ByteString -> ByteString # sconcat :: NonEmpty ByteString -> ByteString # stimes :: Integral b => b -> ByteString -> ByteString # | |
| Semigroup ByteString | |
Defined in Data.ByteString.Lazy.Internal Methods (<>) :: ByteString -> ByteString -> ByteString # sconcat :: NonEmpty ByteString -> ByteString # stimes :: Integral b => b -> ByteString -> ByteString # | |
| Semigroup ShortByteString | |
Defined in Data.ByteString.Short.Internal Methods (<>) :: ShortByteString -> ShortByteString -> ShortByteString # sconcat :: NonEmpty ShortByteString -> ShortByteString # stimes :: Integral b => b -> ShortByteString -> ShortByteString # | |
| Semigroup IntSet | Since: containers-0.5.7 |
| Semigroup OsString | |
| Semigroup PosixString | |
Defined in System.OsString.Internal.Types.Hidden Methods (<>) :: PosixString -> PosixString -> PosixString # sconcat :: NonEmpty PosixString -> PosixString # stimes :: Integral b => b -> PosixString -> PosixString # | |
| Semigroup WindowsString | |
Defined in System.OsString.Internal.Types.Hidden Methods (<>) :: WindowsString -> WindowsString -> WindowsString # sconcat :: NonEmpty WindowsString -> WindowsString # stimes :: Integral b => b -> WindowsString -> WindowsString # | |
| Semigroup Ordering | Since: base-4.9.0.0 |
| Semigroup Pos | |
| Semigroup NEIntSet | Left-biased union |
| Semigroup PrefsMod | |
| Semigroup ParserHelp | |
Defined in Options.Applicative.Help.Types Methods (<>) :: ParserHelp -> ParserHelp -> ParserHelp # sconcat :: NonEmpty ParserHelp -> ParserHelp # stimes :: Integral b => b -> ParserHelp -> ParserHelp # | |
| Semigroup Completer | |
| Semigroup ParseError | |
Defined in Options.Applicative.Types Methods (<>) :: ParseError -> ParseError -> ParseError # sconcat :: NonEmpty ParseError -> ParseError # stimes :: Integral b => b -> ParseError -> ParseError # | |
| Semigroup OsString | |
| Semigroup PosixString | |
Defined in System.OsString.Internal.Types Methods (<>) :: PosixString -> PosixString -> PosixString # sconcat :: NonEmpty PosixString -> PosixString # stimes :: Integral b => b -> PosixString -> PosixString # | |
| Semigroup WindowsString | |
Defined in System.OsString.Internal.Types Methods (<>) :: WindowsString -> WindowsString -> WindowsString # sconcat :: NonEmpty WindowsString -> WindowsString # stimes :: Integral b => b -> WindowsString -> WindowsString # | |
| Semigroup Doc | |
| Semigroup AnsiStyle | Keep the first decision for each of foreground color, background color, boldness, italication, and underlining. If a certain style is not set, the terminal’s default will be used. Example:
is red because the first color wins, and not bold because (or if) that’s the terminal’s default. |
| Semigroup UnlinedText Source # | |
Defined in Shrun.Data.Text Methods (<>) :: UnlinedText -> UnlinedText -> UnlinedText # sconcat :: NonEmpty UnlinedText -> UnlinedText # stimes :: Integral b => b -> UnlinedText -> UnlinedText # | |
| Semigroup ReadHandleResult Source # | |
Defined in Shrun.IO.Types Methods (<>) :: ReadHandleResult -> ReadHandleResult -> ReadHandleResult # sconcat :: NonEmpty ReadHandleResult -> ReadHandleResult # stimes :: Integral b => b -> ReadHandleResult -> ReadHandleResult # | |
| Semigroup Builder | |
| Semigroup StrictBuilder | Concatenation of |
Defined in Data.Text.Internal.StrictBuilder Methods (<>) :: StrictBuilder -> StrictBuilder -> StrictBuilder # sconcat :: NonEmpty StrictBuilder -> StrictBuilder # stimes :: Integral b => b -> StrictBuilder -> StrictBuilder # | |
| Semigroup ShortText | |
| Semigroup () | Since: base-4.9.0.0 |
| Semigroup (KeyMap v) | |
| Semigroup (IResult a) | |
| Semigroup (Parser a) | |
| Semigroup (Result a) | |
| Semigroup a => Semigroup (Concurrently a) | Only defined by Since: async-2.1.0 |
Defined in Control.Concurrent.Async.Internal Methods (<>) :: Concurrently a -> Concurrently a -> Concurrently a # sconcat :: NonEmpty (Concurrently a) -> Concurrently a # stimes :: Integral b => b -> Concurrently a -> Concurrently a # | |
| Bits a => Semigroup (And a) | Since: base-4.16 |
| FiniteBits a => Semigroup (Iff a) | This constraint is arguably
too strong. However, as some types (such as Since: base-4.16 |
| Bits a => Semigroup (Ior a) | Since: base-4.16 |
| Bits a => Semigroup (Xor a) | Since: base-4.16 |
| Semigroup (FromMaybe b) | |
| Semigroup a => Semigroup (JoinWith a) | |
| Semigroup (NonEmptyDList a) | |
| Semigroup (Comparison a) |
(<>) :: Comparison a -> Comparison a -> Comparison a Comparison cmp <> Comparison cmp' = Comparison a a' -> cmp a a' <> cmp a a' |
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) |
(<>) :: Equivalence a -> Equivalence a -> Equivalence a Equivalence equiv <> Equivalence equiv' = Equivalence a b -> equiv a b && equiv' a b |
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 # | |
| Semigroup (Predicate a) |
(<>) :: Predicate a -> Predicate a -> Predicate a Predicate pred <> Predicate pred' = Predicate a -> pred a && pred' a |
| Semigroup a => Semigroup (Identity a) | Since: base-4.9.0.0 |
| Ord a => Semigroup (Max a) | Since: base-4.11.0.0 |
| Ord a => Semigroup (Min a) | Since: base-4.11.0.0 |
| Semigroup (First a) | Since: base-4.9.0.0 |
| Semigroup (Last a) | Since: base-4.9.0.0 |
| Semigroup a => Semigroup (Down a) | Since: base-4.11.0.0 |
| Semigroup (First a) | Since: base-4.9.0.0 |
| Semigroup (Last a) | Since: base-4.9.0.0 |
| Ord a => Semigroup (Max a) | Since: base-4.9.0.0 |
| Ord a => Semigroup (Min a) | Since: base-4.9.0.0 |
| Monoid m => Semigroup (WrappedMonoid m) | Since: base-4.9.0.0 |
Defined in Data.Semigroup Methods (<>) :: WrappedMonoid m -> WrappedMonoid m -> WrappedMonoid m # sconcat :: NonEmpty (WrappedMonoid m) -> WrappedMonoid m # stimes :: Integral b => b -> WrappedMonoid m -> WrappedMonoid m # | |
| Semigroup a => Semigroup (Dual a) | Since: base-4.9.0.0 |
| Semigroup (Endo a) | Since: base-4.9.0.0 |
| Num a => Semigroup (Product a) | Since: base-4.9.0.0 |
| Num a => Semigroup (Sum a) | Since: base-4.9.0.0 |
| Semigroup (NonEmpty a) | Since: base-4.9.0.0 |
| Semigroup a => Semigroup (STM a) | Since: base-4.17.0.0 |
| (Generic a, Semigroup (Rep a ())) => Semigroup (Generically a) | Since: base-4.17.0.0 |
Defined in GHC.Generics Methods (<>) :: Generically a -> Generically a -> Generically a # sconcat :: NonEmpty (Generically a) -> Generically a # stimes :: Integral b => b -> Generically a -> Generically a # | |
| Semigroup p => Semigroup (Par1 p) | Since: base-4.12.0.0 |
| Semigroup (IntMap a) | Since: containers-0.5.7 |
| Semigroup (Seq a) | Since: containers-0.5.7 |
| Ord a => Semigroup (Intersection a) | |
Defined in Data.Set.Internal Methods (<>) :: Intersection a -> Intersection a -> Intersection a # sconcat :: NonEmpty (Intersection a) -> Intersection a # stimes :: Integral b => b -> Intersection a -> Intersection a # | |
| Semigroup (MergeSet a) | |
| Ord a => Semigroup (Set a) | Since: containers-0.5.7 |
| Semigroup (DNonEmpty a) | |
| Semigroup (DList a) | |
| Semigroup a => Semigroup (IO a) | Since: base-4.10.0.0 |
| Ord t => Semigroup (Hints t) | |
| (Semigroup mono, GrowingAppend mono) => Semigroup (NonNull mono) | |
| Semigroup (NEIntMap a) | Left-biased union |
| Semigroup (NESeq a) | |
| Semigroup (MergeNESet a) | |
Defined in Data.Set.NonEmpty.Internal Methods (<>) :: MergeNESet a -> MergeNESet a -> MergeNESet a # sconcat :: NonEmpty (MergeNESet a) -> MergeNESet a # stimes :: Integral b => b -> MergeNESet a -> MergeNESet a # | |
| Ord a => Semigroup (NESet a) | Left-biased union |
| Semigroup (Leftmost a) | |
| Semigroup (Rightmost a) | |
| Semigroup (InfoMod a) | |
| Semigroup (DefaultProp a) | |
Defined in Options.Applicative.Builder.Internal Methods (<>) :: DefaultProp a -> DefaultProp a -> DefaultProp a # sconcat :: NonEmpty (DefaultProp a) -> DefaultProp a # stimes :: Integral b => b -> DefaultProp a -> DefaultProp a # | |
| Semigroup a => Semigroup (Chunk a) | |
| Semigroup (Doc a) | |
| Semigroup (Doc ann) | x
|
| Semigroup (Array a) | Since: primitive-0.6.3.0 |
| Semigroup (PrimArray a) | Since: primitive-0.6.4.0 |
| Semigroup (SmallArray a) | Since: primitive-0.6.3.0 |
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 (WithDisabled a) Source # | |
Defined in Shrun.Configuration.Data.WithDisabled Methods (<>) :: WithDisabled a -> WithDisabled a -> WithDisabled a # sconcat :: NonEmpty (WithDisabled a) -> WithDisabled a # stimes :: Integral b => b -> WithDisabled a -> WithDisabled a # | |
| Semigroup a => Semigroup (Maybe a) | |
| Semigroup a => Semigroup (Q a) | Since: template-haskell-2.17.0.0 |
| Semigroup (Validity k) | |
| (Hashable a, Eq a) => Semigroup (HashSet a) | \(O(n+m)\) To obtain good performance, the smaller set must be presented as the first argument. Examples
|
| Semigroup (Vector a) | |
| Prim a => Semigroup (Vector a) | |
| Storable a => Semigroup (Vector a) | |
| Semigroup a => Semigroup (Maybe a) | Since: base-4.9.0.0 |
| Semigroup a => Semigroup (Solo a) | Since: base-4.15 |
| Semigroup [a] | Since: base-4.9.0.0 |
| Semigroup a => Semigroup (ConcurrentlyE e a) | Either the combination of the successful results, or the first failure. |
Defined in Control.Concurrent.Async.Internal Methods (<>) :: ConcurrentlyE e a -> ConcurrentlyE e a -> ConcurrentlyE e a # sconcat :: NonEmpty (ConcurrentlyE e a) -> ConcurrentlyE e a # stimes :: Integral b => b -> ConcurrentlyE e a -> ConcurrentlyE e a # | |
| Semigroup (Either a b) | Since: base-4.9.0.0 |
| Semigroup a => Semigroup (Op a b) |
(<>) :: Op a b -> Op a b -> Op a b Op f <> Op g = Op a -> f a <> g a |
| Semigroup (Proxy s) | Since: base-4.9.0.0 |
| Semigroup (U1 p) | Since: base-4.12.0.0 |
| Semigroup (V1 p) | Since: base-4.12.0.0 |
| Semigroup a => Semigroup (ST s a) | Since: base-4.11.0.0 |
| Ord k => Semigroup (Map k v) | |
| (MonadAsync m, Semigroup a) => Semigroup (Concurrently m a) | Since: effects-async-0.1 |
Defined in Effects.Concurrent.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 (f a) => Semigroup (Indexing f a) | |
| Semigroup (ReifiedFold s a) | |
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 # | |
| (Stream s, Ord e) => Semigroup (ParseError s e) | |
Defined in Text.Megaparsec.Error Methods (<>) :: ParseError s e -> ParseError s e -> ParseError s e # sconcat :: NonEmpty (ParseError s e) -> ParseError s e # stimes :: Integral b => b -> ParseError s e -> ParseError s e # | |
| Ord k => Semigroup (NEMap k a) | Left-biased union |
| Applicative f => Semigroup (Traversed f a) | |
| Semigroup (Mod f a) | Since: optparse-applicative-0.13.0.0 |
| Semigroup (Either a b) | |
| (Semigroup a, Semigroup b) => Semigroup (These a b) | |
| (Semigroup a, Semigroup b) => Semigroup (Pair a b) | |
| (Semigroup a, Semigroup b) => Semigroup (These a b) | |
| (MonadUnliftIO m, Semigroup a) => Semigroup (Conc m a) | Since: unliftio-0.2.9.0 |
| (MonadUnliftIO m, Semigroup a) => Semigroup (Concurrently m a) | Only defined by Since: unliftio-0.1.0.0 |
Defined in UnliftIO.Internals.Async Methods (<>) :: Concurrently m a -> Concurrently m a -> Concurrently m a # sconcat :: NonEmpty (Concurrently m a) -> Concurrently m a # stimes :: Integral b => b -> Concurrently m a -> Concurrently m a # | |
| (Eq k, Hashable k) => Semigroup (HashMap k v) | If a key occurs in both maps, the mapping from the first will be the mapping in the result. Examples
|
| (Semigroup a, Semigroup b) => Semigroup (a, b) | Since: base-4.9.0.0 |
| Semigroup b => Semigroup (a -> b) | Since: base-4.9.0.0 |
| Semigroup a => Semigroup (Const a b) | Since: base-4.9.0.0 |
| (Applicative f, Semigroup a) => Semigroup (Ap f a) | Since: base-4.12.0.0 |
| Alternative f => Semigroup (Alt f a) | Since: base-4.9.0.0 |
| Semigroup (f p) => Semigroup (Rec1 f p) | Since: base-4.12.0.0 |
| Semigroup (ReifiedIndexedFold i s a) | |
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) | |
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) | |
| Semigroup a => Semigroup (Constant a b) | |
| (Semigroup a, Semigroup b, Semigroup c) => Semigroup (a, b, c) | Since: base-4.9.0.0 |
| (Semigroup (f a), Semigroup (g a)) => Semigroup (Product f g a) | Since: base-4.16.0.0 |
| (Semigroup (f p), Semigroup (g p)) => Semigroup ((f :*: g) p) | Since: base-4.12.0.0 |
| Semigroup c => Semigroup (K1 i c p) | Since: base-4.12.0.0 |
| Monad m => Semigroup (ConduitT i o m ()) | |
| (Stream s, Semigroup a) => Semigroup (ParsecT e s m a) | Since: megaparsec-5.3.0 |
| (Semigroup a, Semigroup b, Semigroup c, Semigroup d) => Semigroup (a, b, c, d) | Since: base-4.9.0.0 |
| Semigroup (f (g a)) => Semigroup (Compose f g a) | Since: base-4.16.0.0 |
| Semigroup (f (g p)) => Semigroup ((f :.: g) p) | Since: base-4.12.0.0 |
| Semigroup (f p) => Semigroup (M1 i c f p) | Since: base-4.12.0.0 |
| (Semigroup a, Semigroup b, Semigroup c, Semigroup d, Semigroup e) => Semigroup (a, b, c, d, e) | Since: base-4.9.0.0 |
| Monad m => Semigroup (Pipe l i o u m ()) | |
class Monad m => MonadReader r (m :: Type -> Type) | m -> r where #
See examples in Control.Monad.Reader.
Note, the partially applied function type (->) r is a simple reader monad.
See the instance declaration below.
Methods
Retrieves the monad environment.
Arguments
| :: (r -> r) | The function to modify the environment. |
| -> m a |
|
| -> m a |
Executes a computation in a modified environment.
Instances
| (Representable f, Rep f ~ a) => MonadReader a (Co f) | |
| MonadReader e m => MonadReader e (Free m) | |
| MonadReader r m => MonadReader r (ResourceT m) | |
| MonadReader r m => MonadReader r (MaybeT m) | |
| MonadReader s (ReifiedFold s) | |
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 # | |
| MonadReader s (ReifiedGetter s) | |
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 # | |
| Monad m => MonadReader env (ShellT env m) Source # | |
| (Functor f, MonadReader r m) => MonadReader r (FreeT f m) | |
| (Monoid w, MonadReader r m) => MonadReader r (AccumT w m) | Since: mtl-2.3 |
| MonadReader r m => MonadReader r (ExceptT e m) | Since: mtl-2.2 |
| MonadReader r m => MonadReader r (IdentityT m) | |
| Monad m => MonadReader r (ReaderT r m) | |
| MonadReader r m => MonadReader r (StateT s m) | |
| MonadReader r m => MonadReader r (StateT s m) | |
| (Monoid w, MonadReader r m) => MonadReader r (WriterT w m) | Since: mtl-2.3 |
| (Monoid w, MonadReader r m) => MonadReader r (WriterT w m) | |
| (Monoid w, MonadReader r m) => MonadReader r (WriterT w m) | |
| MonadReader r' m => MonadReader r' (SelectT r m) | Since: mtl-2.3 |
| MonadReader r m => MonadReader r (ConduitT i o m) | |
| (Stream s, MonadReader r m) => MonadReader r (ParsecT e s m) | |
| MonadReader r ((->) r) | |
| MonadReader r' m => MonadReader r' (ContT r m) | |
| (Monad m, Monoid w) => MonadReader r (RWST r w s m) | Since: mtl-2.3 |
| (Monad m, Monoid w) => MonadReader r (RWST r w s m) | |
| (Monad m, Monoid w) => MonadReader r (RWST r w s m) | |
| MonadReader r m => MonadReader r (Pipe l i o u m) | |
data 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.
Instances
| Generic1 (ReaderT r m :: Type -> Type) | |||||
Defined in Control.Monad.Trans.Reader Associated Types
| |||||
| MonadAccum w m => MonadAccum w (ReaderT r m) | Since: mtl-2.3 | ||||
| MonadError e m => MonadError e (ReaderT r m) | |||||
Defined in Control.Monad.Error.Class Methods throwError :: e -> ReaderT r m a # catchError :: ReaderT r m a -> (e -> ReaderT r m a) -> ReaderT r m a # | |||||
| Monad m => MonadReader r (ReaderT r m) | |||||
| MonadSelect r' m => MonadSelect r' (ReaderT r m) | Provides a read-only environment of type Since: mtl-2.3 | ||||
Defined in Control.Monad.Select | |||||
| MonadState s m => MonadState s (ReaderT r m) | |||||
| MonadWriter w m => MonadWriter w (ReaderT r m) | |||||
| IsValue a => AutoMethod (DBusR (Either Reply a)) | |||||
| IsValue a => AutoMethod (DBusR a) | |||||
| MonadTrans (ReaderT r) | |||||
Defined in Control.Monad.Trans.Reader | |||||
| Representable m => Representable (ReaderT e m) | |||||
| MonadFail m => MonadFail (ReaderT r m) | |||||
Defined in Control.Monad.Trans.Reader | |||||
| MonadFix m => MonadFix (ReaderT r m) | |||||
Defined in Control.Monad.Trans.Reader | |||||
| MonadIO m => MonadIO (ReaderT r m) | |||||
Defined in Control.Monad.Trans.Reader | |||||
| MonadZip m => MonadZip (ReaderT r m) | |||||
| Contravariant m => Contravariant (ReaderT r m) | |||||
| Alternative m => Alternative (ReaderT r m) | |||||
| Applicative m => Applicative (ReaderT r m) | |||||
Defined in Control.Monad.Trans.Reader | |||||
| Functor m => Functor (ReaderT r m) | |||||
| Monad m => Monad (ReaderT r m) | |||||
| MonadPlus m => MonadPlus (ReaderT r m) | |||||
| MonadAsync m => MonadAsync (ReaderT env m) | Since: effects-async-0.1 | ||||
Defined in Effects.Concurrent.Async Methods withAsync :: HasCallStack => ReaderT env m a -> (Async a -> ReaderT env m b) -> ReaderT env m b Source # withAsyncBound :: HasCallStack => ReaderT env m a -> (Async a -> ReaderT env m b) -> ReaderT env m b Source # withAsyncOn :: HasCallStack => Int -> ReaderT env m a -> (Async a -> ReaderT env m b) -> ReaderT env m b Source # withAsyncWithUnmask :: HasCallStack => ((forall c. ReaderT env m c -> ReaderT env m c) -> ReaderT env m a) -> (Async a -> ReaderT env m b) -> ReaderT env m b Source # withAsyncOnWithUnmask :: HasCallStack => Int -> ((forall c. ReaderT env m c -> ReaderT env m c) -> ReaderT env m a) -> (Async a -> ReaderT env m b) -> ReaderT env m b Source # wait :: HasCallStack => Async a -> ReaderT env m a Source # poll :: HasCallStack => Async a -> ReaderT env m (Maybe (Either SomeException a)) Source # waitCatch :: HasCallStack => Async a -> ReaderT env m (Either SomeException a) Source # cancel :: HasCallStack => Async a -> ReaderT env m () Source # uninterruptibleCancel :: HasCallStack => Async a -> ReaderT env m () Source # cancelWith :: (Exception e, HasCallStack) => Async a -> e -> ReaderT env m () Source # race :: HasCallStack => ReaderT env m a -> ReaderT env m b -> ReaderT env m (Either a b) Source # concurrently :: HasCallStack => ReaderT env m a -> ReaderT env m b -> ReaderT env m (a, b) Source # concurrently_ :: HasCallStack => ReaderT env m a -> ReaderT env m b -> ReaderT env m () Source # waitAny :: HasCallStack => [Async a] -> ReaderT env m (Async a, a) Source # waitAnyCatch :: HasCallStack => [Async a] -> ReaderT env m (Async a, Either SomeException a) Source # waitAnyCancel :: HasCallStack => [Async a] -> ReaderT env m (Async a, a) Source # waitAnyCatchCancel :: HasCallStack => [Async a] -> ReaderT env m (Async a, Either SomeException a) Source # waitEither :: HasCallStack => Async a -> Async b -> ReaderT env m (Either a b) Source # waitEitherCatch :: HasCallStack => Async a -> Async b -> ReaderT env m (Either (Either SomeException a) (Either SomeException b)) Source # waitEitherCancel :: HasCallStack => Async a -> Async b -> ReaderT env m (Either a b) Source # waitEitherCatchCancel :: HasCallStack => Async a -> Async b -> ReaderT env m (Either (Either SomeException a) (Either SomeException b)) Source # waitEither_ :: HasCallStack => Async a -> Async b -> ReaderT env m () Source # waitBoth :: HasCallStack => Async a -> Async b -> ReaderT env m (a, b) Source # async :: HasCallStack => ReaderT env m a -> ReaderT env m (Async a) Source # asyncBound :: HasCallStack => ReaderT env m a -> ReaderT env m (Async a) Source # asyncOn :: HasCallStack => Int -> ReaderT env m a -> ReaderT env m (Async a) Source # asyncWithUnmask :: HasCallStack => ((forall b. ReaderT env m b -> ReaderT env m b) -> ReaderT env m a) -> ReaderT env m (Async a) Source # asyncOnWithUnmask :: HasCallStack => Int -> ((forall b. ReaderT env m b -> ReaderT env m b) -> ReaderT env m a) -> ReaderT env m (Async a) Source # link :: HasCallStack => Async a -> ReaderT env m () Source # linkOnly :: HasCallStack => (SomeException -> Bool) -> Async a -> ReaderT env m () Source # link2 :: HasCallStack => Async a -> Async b -> ReaderT env m () Source # link2Only :: HasCallStack => (SomeException -> Bool) -> Async a -> Async b -> ReaderT env m () Source # pooledMapConcurrentlyN :: (HasCallStack, Traversable t) => Positive Int -> (a -> ReaderT env m b) -> t a -> ReaderT env m (t b) Source # pooledMapConcurrently :: (HasCallStack, Traversable t) => (a -> ReaderT env m b) -> t a -> ReaderT env m (t b) Source # pooledMapConcurrentlyN_ :: (Foldable f, HasCallStack) => Positive Int -> (a -> ReaderT env m b) -> f a -> ReaderT env m () Source # pooledMapConcurrently_ :: (Foldable f, HasCallStack) => (a -> ReaderT env m b) -> f a -> ReaderT env m () Source # | |||||
| MonadEnv m => MonadEnv (ReaderT env m) | Since: effects-env-0.1 | ||||
Defined in Effects.System.Environment Methods getArgs :: ReaderT env m [String] Source # getProgName :: ReaderT env m String Source # executablePath :: Maybe (ReaderT env m (Maybe FilePath)) Source # getExecutablePath :: ReaderT env m FilePath Source # getEnv :: String -> ReaderT env m String Source # lookupEnv :: String -> ReaderT env m (Maybe String) Source # setEnv :: String -> String -> ReaderT env m () Source # unsetEnv :: String -> ReaderT env m () Source # withArgs :: HasCallStack => [String] -> ReaderT env m a -> ReaderT env m a Source # withProgName :: HasCallStack => String -> ReaderT env m a -> ReaderT env m a Source # | |||||
| MonadGlobalException m => MonadGlobalException (ReaderT env m) | Since: effects-exceptions-0.1 | ||||
Defined in Effects.Exception.Annotation.Common Methods setUncaughtExceptionHandler :: (SomeException -> ReaderT env m ()) -> ReaderT env m () Source # getUncaughtExceptionHandler :: ReaderT env m (SomeException -> ReaderT env m ()) Source # | |||||
| MonadFileReader m => MonadFileReader (ReaderT e m) | Since: effects-fs-0.1 | ||||
Defined in Effects.FileSystem.FileReader Methods readBinaryFile :: OsPath -> ReaderT e m ByteString Source # | |||||
| MonadFileWriter m => MonadFileWriter (ReaderT env m) | Since: effects-fs-0.1 | ||||
Defined in Effects.FileSystem.FileWriter Methods writeBinaryFile :: OsPath -> ByteString -> ReaderT env m () Source # appendBinaryFile :: OsPath -> ByteString -> ReaderT env m () Source # | |||||
| MonadHandleReader m => MonadHandleReader (ReaderT e m) | Since: effects-fs-0.1 | ||||
Defined in Effects.FileSystem.HandleReader Methods hIsEOF :: Handle -> ReaderT e m Bool Source # hGetBuffering :: Handle -> ReaderT e m BufferMode Source # hIsOpen :: Handle -> ReaderT e m Bool Source # hIsClosed :: Handle -> ReaderT e m Bool Source # hIsReadable :: Handle -> ReaderT e m Bool Source # hIsWritable :: Handle -> ReaderT e m Bool Source # hIsSeekable :: Handle -> ReaderT e m Bool Source # hIsTerminalDevice :: Handle -> ReaderT e m Bool Source # hGetEcho :: Handle -> ReaderT e m Bool Source # hWaitForInput :: Handle -> Int -> ReaderT e m Bool Source # hReady :: Handle -> ReaderT e m Bool Source # hGetChar :: Handle -> ReaderT e m Char Source # hGetLine :: Handle -> ReaderT e m ByteString Source # hGetContents :: Handle -> ReaderT e m ByteString Source # hGet :: Handle -> Int -> ReaderT e m ByteString Source # hGetSome :: Handle -> Int -> ReaderT e m ByteString Source # hGetNonBlocking :: Handle -> Int -> ReaderT e m ByteString Source # | |||||
| MonadHandleWriter m => MonadHandleWriter (ReaderT env m) | Since: effects-fs-0.1 | ||||
Defined in Effects.FileSystem.HandleWriter Methods openBinaryFile :: OsPath -> IOMode -> ReaderT env m Handle Source # withBinaryFile :: HasCallStack => OsPath -> IOMode -> (Handle -> ReaderT env m a) -> ReaderT env m a Source # hClose :: Handle -> ReaderT env m () Source # hFlush :: Handle -> ReaderT env m () Source # hSetFileSize :: Handle -> Integer -> ReaderT env m () Source # hSetBuffering :: Handle -> BufferMode -> ReaderT env m () Source # hSeek :: Handle -> SeekMode -> Integer -> ReaderT env m () Source # hTell :: Handle -> ReaderT env m Integer Source # hSetEcho :: Handle -> Bool -> ReaderT env m () Source # hPut :: Handle -> ByteString -> ReaderT env m () Source # hPutNonBlocking :: Handle -> ByteString -> ReaderT env m ByteString Source # | |||||
| MonadPathReader m => MonadPathReader (ReaderT env m) | |||||
Defined in Effects.FileSystem.PathReader Methods listDirectory :: OsPath -> ReaderT env m [OsPath] Source # getDirectoryContents :: OsPath -> ReaderT env m [OsPath] Source # getCurrentDirectory :: ReaderT env m OsPath Source # getHomeDirectory :: ReaderT env m OsPath Source # getXdgDirectory :: XdgDirectory -> OsPath -> ReaderT env m OsPath Source # getXdgDirectoryList :: XdgDirectoryList -> ReaderT env m [OsPath] Source # getAppUserDataDirectory :: OsPath -> ReaderT env m OsPath Source # getUserDocumentsDirectory :: ReaderT env m OsPath Source # getTemporaryDirectory :: ReaderT env m OsPath Source # getFileSize :: OsPath -> ReaderT env m Integer Source # canonicalizePath :: OsPath -> ReaderT env m OsPath Source # makeAbsolute :: OsPath -> ReaderT env m OsPath Source # makeRelativeToCurrentDirectory :: OsPath -> ReaderT env m OsPath Source # doesPathExist :: OsPath -> ReaderT env m Bool Source # doesFileExist :: OsPath -> ReaderT env m Bool Source # doesDirectoryExist :: OsPath -> ReaderT env m Bool Source # findExecutable :: OsPath -> ReaderT env m (Maybe OsPath) Source # findExecutables :: OsPath -> ReaderT env m [OsPath] Source # findExecutablesInDirectories :: [OsPath] -> OsPath -> ReaderT env m [OsPath] Source # findFileWith :: (OsPath -> ReaderT env m Bool) -> [OsPath] -> OsPath -> ReaderT env m (Maybe OsPath) Source # findFilesWith :: (OsPath -> ReaderT env m Bool) -> [OsPath] -> OsPath -> ReaderT env m [OsPath] Source # pathIsSymbolicLink :: OsPath -> ReaderT env m Bool Source # getSymbolicLinkTarget :: OsPath -> ReaderT env m OsPath Source # getPermissions :: OsPath -> ReaderT env m Permissions Source # getAccessTime :: OsPath -> ReaderT env m UTCTime Source # getModificationTime :: OsPath -> ReaderT env m UTCTime Source # | |||||
| MonadPathWriter m => MonadPathWriter (ReaderT env m) | Since: effects-fs-0.1 | ||||
Defined in Effects.FileSystem.PathWriter Methods createDirectory :: OsPath -> ReaderT env m () Source # createDirectoryIfMissing :: Bool -> OsPath -> ReaderT env m () Source # removeDirectory :: OsPath -> ReaderT env m () Source # removeDirectoryRecursive :: OsPath -> ReaderT env m () Source # removePathForcibly :: OsPath -> ReaderT env m () Source # renameDirectory :: OsPath -> OsPath -> ReaderT env m () Source # setCurrentDirectory :: OsPath -> ReaderT env m () Source # withCurrentDirectory :: HasCallStack => OsPath -> ReaderT env m a -> ReaderT env m a Source # removeFile :: OsPath -> ReaderT env m () Source # renameFile :: OsPath -> OsPath -> ReaderT env m () Source # renamePath :: OsPath -> OsPath -> ReaderT env m () Source # copyFile :: OsPath -> OsPath -> ReaderT env m () Source # copyFileWithMetadata :: OsPath -> OsPath -> ReaderT env m () Source # createFileLink :: OsPath -> OsPath -> ReaderT env m () Source # createDirectoryLink :: OsPath -> OsPath -> ReaderT env m () Source # removeDirectoryLink :: OsPath -> ReaderT env m () Source # setPermissions :: OsPath -> Permissions -> ReaderT env m () Source # copyPermissions :: OsPath -> OsPath -> ReaderT env m () Source # setAccessTime :: OsPath -> UTCTime -> ReaderT env m () Source # setModificationTime :: OsPath -> UTCTime -> ReaderT env m () Source # | |||||
| MonadIORef m => MonadIORef (ReaderT e m) | Since: effects-ioref-0.1 | ||||
Defined in Effects.IORef Methods newIORef :: HasCallStack => a -> ReaderT e m (IORef a) Source # readIORef :: HasCallStack => IORef a -> ReaderT e m a Source # writeIORef :: HasCallStack => IORef a -> a -> ReaderT e m () Source # atomicWriteIORef :: HasCallStack => IORef a -> a -> ReaderT e m () Source # modifyIORef' :: HasCallStack => IORef a -> (a -> a) -> ReaderT e m () Source # atomicModifyIORef' :: HasCallStack => IORef a -> (a -> (a, b)) -> ReaderT e m b Source # | |||||
| MonadOptparse m => MonadOptparse (ReaderT env m) | Since: effects-optparse-0.1 | ||||
Defined in Effects.Optparse Methods execParser :: HasCallStack => ParserInfo a -> ReaderT env m a Source # customExecParser :: HasCallStack => ParserPrefs -> ParserInfo a -> ReaderT env m a Source # handleParseResult :: HasCallStack => ParserResult a -> ReaderT env m a Source # | |||||
| MonadSTM m => MonadSTM (ReaderT e m) | Since: effects-stm-0.1 | ||||
Defined in Effects.Concurrent.STM Methods atomically :: HasCallStack => STM a -> ReaderT e m a Source # | |||||
| MonadTerminal m => MonadTerminal (ReaderT e m) | Since: effects-terminal-0.1 | ||||
Defined in Effects.System.Terminal Methods putStr :: String -> ReaderT e m () Source # putStrLn :: String -> ReaderT e m () Source # putBinary :: ByteString -> ReaderT e m () Source # getChar :: ReaderT e m Char Source # getLine :: ReaderT e m String Source # getContents' :: ReaderT e m String Source # getTerminalSize :: ReaderT e m (Window Natural) Source # supportsPretty :: ReaderT e m Bool Source # | |||||
| MonadQSem m => MonadQSem (ReaderT e m) | Since: effects-thread-0.1 | ||||
| MonadQSemN m => MonadQSemN (ReaderT e m) | Since: effects-thread-0.1 | ||||
| MonadThread m => MonadThread (ReaderT e m) | Since: effects-thread-0.1 | ||||
Defined in Effects.Concurrent.Thread Methods threadDelay :: Int -> ReaderT e m () Source # throwTo :: (Exception e0, HasCallStack) => ThreadId -> e0 -> ReaderT e m () Source # getNumCapabilities :: ReaderT e m Int Source # setNumCapabilities :: Int -> ReaderT e m () Source # threadCapability :: ThreadId -> ReaderT e m (Int, Bool) Source # myThreadId :: ReaderT e m ThreadId Source # labelThread :: ThreadId -> String -> ReaderT e m () Source # threadLabel :: ThreadId -> ReaderT e m (Maybe String) Source # | |||||
| MonadTime m => MonadTime (ReaderT e m) | Since: effects-time-0.1 | ||||
Defined in Effects.Time Methods getSystemZonedTime :: ReaderT e m ZonedTime Source # getMonotonicTime :: ReaderT e m Double Source # | |||||
| MonadTypedProcess m => MonadTypedProcess (ReaderT env m) | Since: effects-typed-process-0.1 | ||||
Defined in Effects.Process.Typed Methods runProcess :: HasCallStack => ProcessConfig stdin stdout stderr -> ReaderT env m ExitCode Source # readProcess :: HasCallStack => ProcessConfig stdin stdoutIgnored stderrIgnored -> ReaderT env m (ExitCode, ByteString, ByteString) Source # readProcessStdout :: HasCallStack => ProcessConfig stdin stdoutIgnored stderr -> ReaderT env m (ExitCode, ByteString) Source # readProcessStderr :: HasCallStack => ProcessConfig stdin stdout stderrIgnored -> ReaderT env m (ExitCode, ByteString) Source # readProcessInterleaved :: HasCallStack => ProcessConfig stdin stdoutIgnored stderrIgnored -> ReaderT env m (ExitCode, ByteString) Source # withProcessWait :: HasCallStack => ProcessConfig stdin stdout stderr -> (Process stdin stdout stderr -> ReaderT env m a) -> ReaderT env m a Source # withProcessTerm :: HasCallStack => ProcessConfig stdin stdout stderr -> (Process stdin stdout stderr -> ReaderT env m a) -> ReaderT env m a Source # startProcess :: HasCallStack => ProcessConfig stdin stdout stderr -> ReaderT env m (Process stdin stdout stderr) Source # stopProcess :: HasCallStack => Process stdin stdout stderr -> ReaderT env m () Source # runProcess_ :: HasCallStack => ProcessConfig stdin stdout stderr -> ReaderT env m () Source # readProcess_ :: HasCallStack => ProcessConfig stdin stdoutIgnored stderrIgnored -> ReaderT env m (ByteString, ByteString) Source # readProcessStdout_ :: HasCallStack => ProcessConfig stdin stdoutIgnored stderr -> ReaderT env m ByteString Source # readProcessStderr_ :: HasCallStack => ProcessConfig stdin stdout stderrIgnored -> ReaderT env m ByteString Source # readProcessInterleaved_ :: HasCallStack => ProcessConfig stdin stdoutIgnored stderrIgnored -> ReaderT env m ByteString Source # withProcessWait_ :: HasCallStack => ProcessConfig stdin stdout stderr -> (Process stdin stdout stderr -> ReaderT env m a) -> ReaderT env m a Source # withProcessTerm_ :: HasCallStack => ProcessConfig stdin stdout stderr -> (Process stdin stdout stderr -> ReaderT env m a) -> ReaderT env m a Source # waitExitCode :: HasCallStack => Process stdin stdout stderr -> ReaderT env m ExitCode Source # getExitCode :: HasCallStack => Process stdin stdout stderr -> ReaderT env m (Maybe ExitCode) Source # checkExitCode :: HasCallStack => Process stdin stdout stderr -> ReaderT env m () Source # | |||||
| MonadPosixCompat m => MonadPosixCompat (ReaderT e m) | Since: effects-unix-compat-0.1 | ||||
Defined in Effects.System.PosixCompat Methods setFileMode :: FilePath -> FileMode -> ReaderT e m () Source # setFdMode :: Fd -> FileMode -> ReaderT e m () Source # setFileCreationMask :: FileMode -> ReaderT e m FileMode Source # fileAccess :: FilePath -> Bool -> Bool -> Bool -> ReaderT e m Bool Source # fileExist :: FilePath -> ReaderT e m Bool Source # getFileStatus :: FilePath -> ReaderT e m FileStatus Source # getFdStatus :: Fd -> ReaderT e m FileStatus Source # getSymbolicLinkStatus :: FilePath -> ReaderT e m FileStatus Source # createNamedPipe :: FilePath -> FileMode -> ReaderT e m () Source # createDevice :: FilePath -> FileMode -> DeviceID -> ReaderT e m () Source # createLink :: FilePath -> FilePath -> ReaderT e m () Source # removeLink :: FilePath -> ReaderT e m () Source # createSymbolicLink :: FilePath -> FilePath -> ReaderT e m () Source # readSymbolicLink :: FilePath -> ReaderT e m FilePath Source # rename :: FilePath -> FilePath -> ReaderT e m () Source # setOwnerAndGroup :: FilePath -> UserID -> GroupID -> ReaderT e m () Source # setFdOwnerAndGroup :: Fd -> UserID -> GroupID -> ReaderT e m () Source # setSymbolicLinkOwnerAndGroup :: FilePath -> UserID -> GroupID -> ReaderT e m () Source # setFileTimes :: FilePath -> EpochTime -> EpochTime -> ReaderT e m () Source # touchFile :: FilePath -> ReaderT e m () Source # setFileSize :: FilePath -> FileOffset -> ReaderT e m () Source # setFdSize :: Fd -> FileOffset -> ReaderT e m () Source # getPathVar :: FilePath -> PathVar -> ReaderT e m Limit Source # | |||||
| MonadCatch m => MonadCatch (ReaderT r m) | |||||
Defined in Control.Monad.Catch | |||||
| MonadMask m => MonadMask (ReaderT r m) | |||||
Defined in Control.Monad.Catch Methods mask :: HasCallStack => ((forall a. ReaderT r m a -> ReaderT r m a) -> ReaderT r m b) -> ReaderT r m b # uninterruptibleMask :: HasCallStack => ((forall a. ReaderT r m a -> ReaderT r m a) -> ReaderT r m b) -> ReaderT r m b # generalBracket :: HasCallStack => ReaderT r m a -> (a -> ExitCase b -> ReaderT r m c) -> (a -> ReaderT r m b) -> ReaderT r m (b, c) # | |||||
| MonadThrow m => MonadThrow (ReaderT r m) | |||||
Defined in Control.Monad.Catch Methods throwM :: (HasCallStack, Exception e) => e -> ReaderT r m a # | |||||
| MonadCont m => MonadCont (ReaderT r m) | |||||
| PrimMonad m => PrimMonad (ReaderT r m) | |||||
| MonadResource m => MonadResource (ReaderT r m) | |||||
Defined in Control.Monad.Trans.Resource.Internal | |||||
| MonadRegionLogger m => MonadRegionLogger (ReaderT env m) Source # | |||||
Defined in Shrun.Logging.MonadRegionLogger Associated Types
Methods logGlobal :: Text -> ReaderT env m () Source # logRegion :: LogMode -> Region (ReaderT env m) -> Text -> ReaderT env m () Source # withRegion :: HasCallStack => RegionLayout -> (Region (ReaderT env m) -> ReaderT env m a) -> ReaderT env m a Source # displayRegions :: HasCallStack => ReaderT env m a -> ReaderT env m a Source # | |||||
| MonadAppleScript m => MonadAppleScript (ReaderT env m) Source # | |||||
Defined in Shrun.Notify.MonadAppleScript | |||||
| MonadDBus m => MonadDBus (ReaderT env m) Source # | |||||
Defined in Shrun.Notify.MonadDBus | |||||
| MonadNotifySend m => MonadNotifySend (ReaderT env m) Source # | |||||
Defined in Shrun.Notify.MonadNotifySend | |||||
| Monad m => Magnify (ReaderT b m) (ReaderT a m) b a | |||||
| Zoom m n s t => Zoom (ReaderT e m) (ReaderT e n) s t | |||||
| Generic (ReaderT r m a) | |||||
Defined in Control.Monad.Trans.Reader Associated Types
| |||||
| Wrapped (ReaderT r m a) | |||||
| Functor m => MonoFunctor (ReaderT r m a) | |||||
| Applicative m => MonoPointed (ReaderT r m a) | |||||
| t ~ ReaderT s n b => Rewrapped (ReaderT r m a) t | |||||
Defined in Control.Lens.Wrapped | |||||
| type Rep1 (ReaderT r m :: Type -> Type) | |||||
Defined in Control.Monad.Trans.Reader type Rep1 (ReaderT r m :: Type -> Type) = D1 ('MetaData "ReaderT" "Control.Monad.Trans.Reader" "transformers-0.6.1.0-inplace" 'True) (C1 ('MetaCons "ReaderT" 'PrefixI 'True) (S1 ('MetaSel ('Just "runReaderT") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) ((FUN 'Many r :: Type -> Type) :.: Rec1 m))) | |||||
| type Rep (ReaderT e m) | |||||
Defined in Data.Functor.Rep | |||||
| type Magnified (ReaderT b m) | |||||
Defined in Control.Lens.Zoom | |||||
| type Zoomed (ReaderT e m) | |||||
Defined in Control.Lens.Zoom | |||||
| type PrimState (ReaderT r m) | |||||
Defined in Control.Monad.Primitive | |||||
| type Region (ReaderT env m) Source # | |||||
Defined in Shrun.Logging.MonadRegionLogger | |||||
| type Rep (ReaderT r m a) | |||||
Defined in Control.Monad.Trans.Reader | |||||
| type Unwrapped (ReaderT r m a) | |||||
Defined in Control.Lens.Wrapped | |||||
| type Element (ReaderT r m a) | |||||
Defined in Data.MonoTraversable | |||||
Identity function.
id x = x
This function might seem useless at first glance, but it can be very useful in a higher order context.
Examples
>>>length $ filter id [True, True, False, True]3
>>>Just (Just 3) >>= idJust 3
>>>foldr id 0 [(^3), (*5), (+2)]1000
The Either type represents values with two possibilities: a value of
type Either a bLeft aRight b
The Either type is sometimes used to represent a value which is
either correct or an error; by convention, the Left constructor is
used to hold an error value and the Right constructor is used to
hold a correct value (mnemonic: "right" also means "correct").
Examples
The type Either String IntString or an Int. The Left constructor can be used only on
Strings, and the Right constructor can be used only on Ints:
>>>let s = Left "foo" :: Either String Int>>>sLeft "foo">>>let n = Right 3 :: Either String Int>>>nRight 3>>>:type ss :: Either String Int>>>:type nn :: Either String Int
The fmap from our Functor instance will ignore Left values, but
will apply the supplied function to values contained in a Right:
>>>let s = Left "foo" :: Either String Int>>>let n = Right 3 :: Either String Int>>>fmap (*2) sLeft "foo">>>fmap (*2) nRight 6
The Monad instance for Either allows us to chain together multiple
actions which may fail, and fail overall if any of the individual
steps failed. First we'll write a function that can either parse an
Int from a Char, or fail.
>>>import Data.Char ( digitToInt, isDigit )>>>:{let parseEither :: Char -> Either String Int parseEither c | isDigit c = Right (digitToInt c) | otherwise = Left "parse error">>>:}
The following should work, since both '1' and '2' can be
parsed as Ints.
>>>:{let parseMultiple :: Either String Int parseMultiple = do x <- parseEither '1' y <- parseEither '2' return (x + y)>>>:}
>>>parseMultipleRight 3
But the following should fail overall, since the first operation where
we attempt to parse 'm' as an Int will fail:
>>>:{let parseMultiple :: Either String Int parseMultiple = do x <- parseEither 'm' y <- parseEither '2' return (x + y)>>>:}
>>>parseMultipleLeft "parse error"
Instances
| Bifoldable Either | Since: base-4.10.0.0 | ||||
| Bifoldable1 Either | |||||
Defined in Data.Bifoldable1 | |||||
| Bifunctor Either | Since: base-4.8.0.0 | ||||
| Bitraversable Either | Since: base-4.10.0.0 | ||||
Defined in Data.Bitraversable Methods bitraverse :: Applicative f => (a -> f c) -> (b -> f d) -> Either a b -> f (Either c d) # | |||||
| Eq2 Either | Since: base-4.9.0.0 | ||||
| Ord2 Either | Since: base-4.9.0.0 | ||||
Defined in Data.Functor.Classes | |||||
| Read2 Either | Since: base-4.9.0.0 | ||||
Defined in Data.Functor.Classes Methods liftReadsPrec2 :: (Int -> ReadS a) -> ReadS [a] -> (Int -> ReadS b) -> ReadS [b] -> Int -> ReadS (Either a b) # liftReadList2 :: (Int -> ReadS a) -> ReadS [a] -> (Int -> ReadS b) -> ReadS [b] -> ReadS [Either a b] # liftReadPrec2 :: ReadPrec a -> ReadPrec [a] -> ReadPrec b -> ReadPrec [b] -> ReadPrec (Either a b) # liftReadListPrec2 :: ReadPrec a -> ReadPrec [a] -> ReadPrec b -> ReadPrec [b] -> ReadPrec [Either a b] # | |||||
| Show2 Either | Since: base-4.9.0.0 | ||||
| NFData2 Either | Since: deepseq-1.4.3.0 | ||||
Defined in Control.DeepSeq | |||||
| Hashable2 Either | |||||
| Swapped Either | |||||
| Generic1 (Either a :: Type -> Type) | |||||
Defined in GHC.Generics Associated Types
| |||||
| MonadError e (Either e) | |||||
Defined in Control.Monad.Error.Class | |||||
| (Lift a, Lift b) => Lift (Either a b :: Type) | |||||
| MonadFix (Either e) | Since: base-4.3.0.0 | ||||
Defined in Control.Monad.Fix | |||||
| Foldable (Either a) | Since: base-4.7.0.0 | ||||
Defined in Data.Foldable Methods fold :: Monoid m => Either a m -> m # foldMap :: Monoid m => (a0 -> m) -> Either a a0 -> m # foldMap' :: Monoid m => (a0 -> m) -> Either a a0 -> m # foldr :: (a0 -> b -> b) -> b -> Either a a0 -> b # foldr' :: (a0 -> b -> b) -> b -> Either a a0 -> b # foldl :: (b -> a0 -> b) -> b -> Either a a0 -> b # foldl' :: (b -> a0 -> b) -> b -> Either a a0 -> b # foldr1 :: (a0 -> a0 -> a0) -> Either a a0 -> a0 # foldl1 :: (a0 -> a0 -> a0) -> Either a a0 -> a0 # toList :: Either a a0 -> [a0] # length :: Either a a0 -> Int # elem :: Eq a0 => a0 -> Either a a0 -> Bool # maximum :: Ord a0 => Either a a0 -> a0 # minimum :: Ord a0 => Either a a0 -> a0 # | |||||
| Eq a => Eq1 (Either a) | Since: base-4.9.0.0 | ||||
| Ord a => Ord1 (Either a) | Since: base-4.9.0.0 | ||||
Defined in Data.Functor.Classes | |||||
| Read a => Read1 (Either a) | Since: base-4.9.0.0 | ||||
Defined in Data.Functor.Classes Methods liftReadsPrec :: (Int -> ReadS a0) -> ReadS [a0] -> Int -> ReadS (Either a a0) # liftReadList :: (Int -> ReadS a0) -> ReadS [a0] -> ReadS [Either a a0] # liftReadPrec :: ReadPrec a0 -> ReadPrec [a0] -> ReadPrec (Either a a0) # liftReadListPrec :: ReadPrec a0 -> ReadPrec [a0] -> ReadPrec [Either a a0] # | |||||
| Show a => Show1 (Either a) | Since: base-4.9.0.0 | ||||
| Traversable (Either a) | Since: base-4.7.0.0 | ||||
Defined in Data.Traversable | |||||
| Applicative (Either e) | Since: base-3.0 | ||||
| Functor (Either a) | Since: base-3.0 | ||||
| Monad (Either e) | Since: base-4.4.0.0 | ||||
| IsValue a => AutoMethod (DBusR (Either Reply a)) | |||||
| IsValue a => AutoMethod (IO (Either Reply a)) | |||||
| NFData a => NFData1 (Either a) | Since: deepseq-1.4.3.0 | ||||
Defined in Control.DeepSeq | |||||
| e ~ SomeException => MonadCatch (Either e) | Since: exceptions-0.8.3 | ||||
Defined in Control.Monad.Catch | |||||
| e ~ SomeException => MonadMask (Either e) | Since: exceptions-0.8.3 | ||||
Defined in Control.Monad.Catch Methods mask :: HasCallStack => ((forall a. Either e a -> Either e a) -> Either e b) -> Either e b # uninterruptibleMask :: HasCallStack => ((forall a. Either e a -> Either e a) -> Either e b) -> Either e b # generalBracket :: HasCallStack => Either e a -> (a -> ExitCase b -> Either e c) -> (a -> Either e b) -> Either e (b, c) # | |||||
| e ~ SomeException => MonadThrow (Either e) | |||||
Defined in Control.Monad.Catch Methods throwM :: (HasCallStack, Exception e0) => e0 -> Either e a # | |||||
| Hashable a => Hashable1 (Either a) | |||||
Defined in Data.Hashable.Class | |||||
| (Data a, Data b) => Data (Either a b) | Since: base-4.0.0.0 | ||||
Defined in Data.Data Methods gfoldl :: (forall d b0. Data d => c (d -> b0) -> d -> c b0) -> (forall g. g -> c g) -> Either a b -> c (Either a b) # gunfold :: (forall b0 r. Data b0 => c (b0 -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Either a b) # toConstr :: Either a b -> Constr # dataTypeOf :: Either a b -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Either a b)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Either a b)) # gmapT :: (forall b0. Data b0 => b0 -> b0) -> Either a b -> Either a b # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Either a b -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Either a b -> r # gmapQ :: (forall d. Data d => d -> u) -> Either a b -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Either a b -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Either a b -> m (Either a b) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Either a b -> m (Either a b) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Either a b -> m (Either a b) # | |||||
| Semigroup (Either a b) | Since: base-4.9.0.0 | ||||
| Generic (Either a b) | |||||
Defined in GHC.Generics Associated Types
| |||||
| (Read a, Read b) => Read (Either a b) | Since: base-3.0 | ||||
| (Show a, Show b) => Show (Either a b) | Since: base-3.0 | ||||
| (NFData a, NFData b) => NFData (Either a b) | |||||
Defined in Control.DeepSeq | |||||
| (Eq a, Eq b) => Eq (Either a b) | Since: base-2.1 | ||||
| (Ord a, Ord b) => Ord (Either a b) | Since: base-2.1 | ||||
| (Hashable a, Hashable b) => Hashable (Either a b) | |||||
| MonoFoldable (Either a b) | |||||
Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element (Either a b) -> m) -> Either a b -> m Source # ofoldr :: (Element (Either a b) -> b0 -> b0) -> b0 -> Either a b -> b0 Source # ofoldl' :: (a0 -> Element (Either a b) -> a0) -> a0 -> Either a b -> a0 Source # otoList :: Either a b -> [Element (Either a b)] Source # oall :: (Element (Either a b) -> Bool) -> Either a b -> Bool Source # oany :: (Element (Either a b) -> Bool) -> Either a b -> Bool Source # onull :: Either a b -> Bool Source # olength :: Either a b -> Int Source # olength64 :: Either a b -> Int64 Source # ocompareLength :: Integral i => Either a b -> i -> Ordering Source # otraverse_ :: Applicative f => (Element (Either a b) -> f b0) -> Either a b -> f () Source # ofor_ :: Applicative f => Either a b -> (Element (Either a b) -> f b0) -> f () Source # omapM_ :: Applicative m => (Element (Either a b) -> m ()) -> Either a b -> m () Source # oforM_ :: Applicative m => Either a b -> (Element (Either a b) -> m ()) -> m () Source # ofoldlM :: Monad m => (a0 -> Element (Either a b) -> m a0) -> a0 -> Either a b -> m a0 Source # ofoldMap1Ex :: Semigroup m => (Element (Either a b) -> m) -> Either a b -> m Source # ofoldr1Ex :: (Element (Either a b) -> Element (Either a b) -> Element (Either a b)) -> Either a b -> Element (Either a b) Source # ofoldl1Ex' :: (Element (Either a b) -> Element (Either a b) -> Element (Either a b)) -> Either a b -> Element (Either a b) Source # headEx :: Either a b -> Element (Either a b) Source # lastEx :: Either a b -> Element (Either a b) Source # unsafeHead :: Either a b -> Element (Either a b) Source # unsafeLast :: Either a b -> Element (Either a b) Source # maximumByEx :: (Element (Either a b) -> Element (Either a b) -> Ordering) -> Either a b -> Element (Either a b) Source # minimumByEx :: (Element (Either a b) -> Element (Either a b) -> Ordering) -> Either a b -> Element (Either a b) Source # oelem :: Element (Either a b) -> Either a b -> Bool Source # onotElem :: Element (Either a b) -> Either a b -> Bool Source # | |||||
| MonoFunctor (Either a b) | |||||
| MonoPointed (Either a b) | |||||
| MonoTraversable (Either a b) | |||||
| (DecodeTOML a, DecodeTOML b) => DecodeTOML (Either a b) | |||||
Defined in TOML.Decode Methods tomlDecoder :: Decoder (Either a b) Source # | |||||
| Each (Either () ()) (Complex a) (Complex b) a b |
| ||||
Defined in Optics.Each.Core | |||||
| (a ~ a', b ~ b') => Each (Either () ()) (Either a a') (Either b b') a b |
| ||||
Defined in Optics.Each.Core | |||||
| type Rep1 (Either a :: Type -> Type) | Since: base-4.6.0.0 | ||||
Defined in GHC.Generics type Rep1 (Either a :: Type -> Type) = D1 ('MetaData "Either" "Data.Either" "base" 'False) (C1 ('MetaCons "Left" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a)) :+: C1 ('MetaCons "Right" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1)) | |||||
| type Rep (Either a b) | Since: base-4.6.0.0 | ||||
Defined in GHC.Generics type Rep (Either a b) = D1 ('MetaData "Either" "Data.Either" "base" 'False) (C1 ('MetaCons "Left" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a)) :+: C1 ('MetaCons "Right" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 b))) | |||||
| type Element (Either a b) | |||||
Defined in Data.MonoTraversable | |||||
Instances
| Show Value | |
| Eq Value | |
| DecodeTOML Value | |
Defined in TOML.Decode Methods | |
class Applicative f => Alternative (f :: Type -> Type) where #
A monoid on applicative functors.
If defined, some and many should be the least solutions
of the equations:
Instances
| Alternative IResult | |
| Alternative Parser | |
| Alternative Result | |
| Alternative Concurrently |
|
Defined in Control.Concurrent.Async.Internal Methods empty :: Concurrently a # (<|>) :: Concurrently a -> Concurrently a -> Concurrently a # some :: Concurrently a -> Concurrently [a] # many :: Concurrently a -> Concurrently [a] # | |
| Alternative ZipList | Since: base-4.11.0.0 |
| Alternative STM | Takes the first non- Since: base-4.8.0.0 |
| Alternative P | Since: base-4.5.0.0 |
| Alternative ReadP | Since: base-4.6.0.0 |
| Alternative ReadPrec | Since: base-4.6.0.0 |
| Alternative Seq | Since: containers-0.5.4 |
| Alternative DList | |
| Alternative IO | Takes the first non-throwing Since: base-4.9.0.0 |
| Alternative Chunk | |
| Alternative Completion | |
Defined in Options.Applicative.Internal Methods empty :: Completion a # (<|>) :: Completion a -> Completion a -> Completion a # some :: Completion a -> Completion [a] # many :: Completion a -> Completion [a] # | |
| Alternative P | |
| Alternative Parser | |
| Alternative ReadM | |
| Alternative Array | |
| Alternative SmallArray | |
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 DecodeM | |
| Alternative Decoder | |
| Alternative Vector | |
| Alternative Maybe | Picks the leftmost Since: base-2.1 |
| Alternative [] | Combines lists by concatenation, starting from the empty list. Since: base-2.1 |
| MonadPlus m => Alternative (WrappedMonad m) | Since: base-2.1 |
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 |
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 |
| Alternative (U1 :: Type -> Type) | Since: base-4.9.0.0 |
| (MonadAsync m, MonadThread m) => Alternative (Concurrently m) | Since: effects-async-0.1 |
Defined in Effects.Concurrent.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] # | |
| Alternative v => Alternative (Free v) | This violates the Alternative laws, handle with care. |
| Alternative f => Alternative (Yoneda f) | |
| Alternative (ReifiedFold s) | |
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] # | |
| Monad m => Alternative (ListT m) | |
| Monad m => Alternative (NondetT m) | |
| Alternative m => Alternative (ResourceT m) | Since 1.1.5 |
| Alternative f => Alternative (Lift f) | A combination is |
| (Functor m, Monad m) => Alternative (MaybeT m) | |
| MonadUnliftIO m => Alternative (Conc m) | Since: unliftio-0.2.9.0 |
| MonadUnliftIO m => Alternative (Concurrently m) | Composing two unlifted Since: unliftio-0.1.0.0 |
Defined in UnliftIO.Internals.Async Methods empty :: Concurrently m a # (<|>) :: Concurrently m a -> Concurrently m a -> Concurrently m a # some :: Concurrently m a -> Concurrently m [a] # many :: Concurrently m a -> Concurrently m [a] # | |
| (ArrowZero a, ArrowPlus a) => Alternative (WrappedArrow a b) | Since: base-2.1 |
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 m => Alternative (Kleisli m a) | Since: base-4.14.0.0 |
| Alternative f => Alternative (Ap f) | Since: base-4.12.0.0 |
| Alternative f => Alternative (Alt f) | Since: base-4.8.0.0 |
| (Generic1 f, Alternative (Rep1 f)) => Alternative (Generically1 f) | Since: base-4.17.0.0 |
Defined in GHC.Generics Methods empty :: Generically1 f a # (<|>) :: Generically1 f a -> Generically1 f a -> Generically1 f a # some :: Generically1 f a -> Generically1 f [a] # many :: Generically1 f a -> Generically1 f [a] # | |
| Alternative f => Alternative (Rec1 f) | Since: base-4.9.0.0 |
| (Functor f, MonadPlus m) => Alternative (FreeT f m) | |
| Alternative f => Alternative (Backwards f) | Try alternatives in the same order as |
| (Monoid w, Functor m, MonadPlus m) => Alternative (AccumT w m) | |
| (Functor m, Monad m, Monoid e) => Alternative (ExceptT e m) | |
| Alternative m => Alternative (IdentityT m) | |
| Alternative m => Alternative (ReaderT r m) | |
| (Functor m, MonadPlus m) => Alternative (SelectT r m) | |
| (Functor m, MonadPlus m) => Alternative (StateT s m) | |
| (Functor m, MonadPlus m) => Alternative (StateT s m) | |
| (Functor m, MonadPlus m) => Alternative (WriterT w m) | |
| (Monoid w, Alternative m) => Alternative (WriterT w m) | |
| (Monoid w, Alternative m) => Alternative (WriterT w m) | |
| Alternative f => Alternative (Reverse f) | Derived instance. |
| (Alternative f, Alternative g) => Alternative (Product f g) | Since: base-4.9.0.0 |
| (Alternative f, Alternative g) => Alternative (f :*: g) | Since: base-4.9.0.0 |
| (Ord e, Stream s) => Alternative (ParsecT e s m) |
|
| (Alternative f, Applicative g) => Alternative (Compose f g) | Since: base-4.9.0.0 |
| (Alternative f, Applicative g) => Alternative (f :.: g) | Since: base-4.9.0.0 |
| Alternative f => Alternative (M1 i c f) | Since: base-4.9.0.0 |
| (Functor m, MonadPlus m) => Alternative (RWST r w s m) | |
| (Monoid w, Functor m, MonadPlus m) => Alternative (RWST r w s m) | |
| (Monoid w, Functor m, MonadPlus m) => Alternative (RWST r w s m) | |
data ByteString #
A space-efficient representation of a Word8 vector, supporting many
efficient operations.
A ByteString contains 8-bit bytes, or by using the operations from
Data.ByteString.Char8 it can be interpreted as containing 8-bit
characters.
Instances
| Data ByteString | |||||||||
Defined in Data.ByteString.Internal.Type 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 :: forall r r'. (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 # | |||||||||
| IsString ByteString | Beware: | ||||||||
Defined in Data.ByteString.Internal.Type Methods fromString :: String -> ByteString # | |||||||||
| Monoid ByteString | |||||||||
Defined in Data.ByteString.Internal.Type Methods mempty :: ByteString # mappend :: ByteString -> ByteString -> ByteString # mconcat :: [ByteString] -> ByteString # | |||||||||
| Semigroup ByteString | |||||||||
Defined in Data.ByteString.Internal.Type Methods (<>) :: ByteString -> ByteString -> ByteString # sconcat :: NonEmpty ByteString -> ByteString # stimes :: Integral b => b -> ByteString -> ByteString # | |||||||||
| IsList ByteString | Since: bytestring-0.10.12.0 | ||||||||
Defined in Data.ByteString.Internal.Type Associated Types
Methods fromList :: [Item ByteString] -> ByteString # fromListN :: Int -> [Item ByteString] -> ByteString # toList :: ByteString -> [Item ByteString] # | |||||||||
| Read ByteString | |||||||||
Defined in Data.ByteString.Internal.Type Methods readsPrec :: Int -> ReadS ByteString # readList :: ReadS [ByteString] # readPrec :: ReadPrec ByteString # readListPrec :: ReadPrec [ByteString] # | |||||||||
| Show ByteString | |||||||||
Defined in Data.ByteString.Internal.Type Methods showsPrec :: Int -> ByteString -> ShowS # show :: ByteString -> String # showList :: [ByteString] -> ShowS # | |||||||||
| IsValue ByteString | |||||||||
Defined in DBus.Internal.Types | |||||||||
| IsVariant ByteString | |||||||||
Defined in DBus.Internal.Types Methods toVariant :: ByteString -> Variant Source # fromVariant :: Variant -> Maybe ByteString Source # | |||||||||
| NFData ByteString | |||||||||
Defined in Data.ByteString.Internal.Type Methods rnf :: ByteString -> () # | |||||||||
| Eq ByteString | |||||||||
Defined in Data.ByteString.Internal.Type | |||||||||
| Ord ByteString | |||||||||
Defined in Data.ByteString.Internal.Type 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 # | |||||||||
| Hashable ByteString | |||||||||
Defined in Data.Hashable.Class | |||||||||
| Ixed ByteString | |||||||||
Defined in Control.Lens.At Methods ix :: Index ByteString -> Traversal' ByteString (IxValue ByteString) Source # | |||||||||
| Stream ByteString | |||||||||
Defined in Text.Megaparsec.Stream Associated Types
Methods tokenToChunk :: Proxy ByteString -> Token ByteString -> Tokens ByteString Source # tokensToChunk :: Proxy ByteString -> [Token ByteString] -> Tokens ByteString Source # chunkToTokens :: Proxy ByteString -> Tokens ByteString -> [Token ByteString] Source # chunkLength :: Proxy ByteString -> Tokens ByteString -> Int Source # chunkEmpty :: Proxy ByteString -> Tokens ByteString -> Bool Source # take1_ :: ByteString -> Maybe (Token ByteString, ByteString) Source # takeN_ :: Int -> ByteString -> Maybe (Tokens ByteString, ByteString) Source # takeWhile_ :: (Token ByteString -> Bool) -> ByteString -> (Tokens ByteString, ByteString) Source # | |||||||||
| TraversableStream ByteString | |||||||||
Defined in Text.Megaparsec.Stream Methods reachOffset :: Int -> PosState ByteString -> (Maybe String, PosState ByteString) Source # reachOffsetNoLine :: Int -> PosState ByteString -> PosState ByteString Source # | |||||||||
| VisualStream ByteString | |||||||||
Defined in Text.Megaparsec.Stream Methods showTokens :: Proxy ByteString -> NonEmpty (Token ByteString) -> String Source # tokensLength :: Proxy ByteString -> NonEmpty (Token ByteString) -> Int Source # | |||||||||
| GrowingAppend ByteString | |||||||||
Defined in Data.MonoTraversable | |||||||||
| MonoFoldable ByteString | |||||||||
Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element ByteString -> m) -> ByteString -> m Source # ofoldr :: (Element ByteString -> b -> b) -> b -> ByteString -> b Source # ofoldl' :: (a -> Element ByteString -> a) -> a -> ByteString -> a Source # otoList :: ByteString -> [Element ByteString] Source # oall :: (Element ByteString -> Bool) -> ByteString -> Bool Source # oany :: (Element ByteString -> Bool) -> ByteString -> Bool Source # onull :: ByteString -> Bool Source # olength :: ByteString -> Int Source # olength64 :: ByteString -> Int64 Source # ocompareLength :: Integral i => ByteString -> i -> Ordering Source # otraverse_ :: Applicative f => (Element ByteString -> f b) -> ByteString -> f () Source # ofor_ :: Applicative f => ByteString -> (Element ByteString -> f b) -> f () Source # omapM_ :: Applicative m => (Element ByteString -> m ()) -> ByteString -> m () Source # oforM_ :: Applicative m => ByteString -> (Element ByteString -> m ()) -> m () Source # ofoldlM :: Monad m => (a -> Element ByteString -> m a) -> a -> ByteString -> m a Source # ofoldMap1Ex :: Semigroup m => (Element ByteString -> m) -> ByteString -> m Source # ofoldr1Ex :: (Element ByteString -> Element ByteString -> Element ByteString) -> ByteString -> Element ByteString Source # ofoldl1Ex' :: (Element ByteString -> Element ByteString -> Element ByteString) -> ByteString -> Element ByteString Source # headEx :: ByteString -> Element ByteString Source # lastEx :: ByteString -> Element ByteString Source # unsafeHead :: ByteString -> Element ByteString Source # unsafeLast :: ByteString -> Element ByteString Source # maximumByEx :: (Element ByteString -> Element ByteString -> Ordering) -> ByteString -> Element ByteString Source # minimumByEx :: (Element ByteString -> Element ByteString -> Ordering) -> ByteString -> Element ByteString Source # oelem :: Element ByteString -> ByteString -> Bool Source # onotElem :: Element ByteString -> ByteString -> Bool Source # | |||||||||
| MonoFunctor ByteString | |||||||||
Defined in Data.MonoTraversable Methods omap :: (Element ByteString -> Element ByteString) -> ByteString -> ByteString Source # | |||||||||
| MonoPointed ByteString | |||||||||
Defined in Data.MonoTraversable Methods opoint :: Element ByteString -> ByteString Source # | |||||||||
| MonoTraversable ByteString | |||||||||
Defined in Data.MonoTraversable Methods otraverse :: Applicative f => (Element ByteString -> f (Element ByteString)) -> ByteString -> f ByteString Source # omapM :: Applicative m => (Element ByteString -> m (Element ByteString)) -> ByteString -> m ByteString Source # | |||||||||
| IsSequence ByteString | |||||||||
Defined in Data.Sequences Methods fromList :: [Element ByteString] -> ByteString Source # lengthIndex :: ByteString -> Index ByteString Source # break :: (Element ByteString -> Bool) -> ByteString -> (ByteString, ByteString) Source # span :: (Element ByteString -> Bool) -> ByteString -> (ByteString, ByteString) Source # dropWhile :: (Element ByteString -> Bool) -> ByteString -> ByteString Source # takeWhile :: (Element ByteString -> Bool) -> ByteString -> ByteString Source # splitAt :: Index ByteString -> ByteString -> (ByteString, ByteString) Source # unsafeSplitAt :: Index ByteString -> ByteString -> (ByteString, ByteString) Source # take :: Index ByteString -> ByteString -> ByteString Source # unsafeTake :: Index ByteString -> ByteString -> ByteString Source # drop :: Index ByteString -> ByteString -> ByteString Source # unsafeDrop :: Index ByteString -> ByteString -> ByteString Source # dropEnd :: Index ByteString -> ByteString -> ByteString Source # partition :: (Element ByteString -> Bool) -> ByteString -> (ByteString, ByteString) Source # uncons :: ByteString -> Maybe (Element ByteString, ByteString) Source # unsnoc :: ByteString -> Maybe (ByteString, Element ByteString) Source # filter :: (Element ByteString -> Bool) -> ByteString -> ByteString Source # filterM :: Monad m => (Element ByteString -> m Bool) -> ByteString -> m ByteString Source # replicate :: Index ByteString -> Element ByteString -> ByteString Source # replicateM :: Monad m => Index ByteString -> m (Element ByteString) -> m ByteString Source # groupBy :: (Element ByteString -> Element ByteString -> Bool) -> ByteString -> [ByteString] Source # groupAllOn :: Eq b => (Element ByteString -> b) -> ByteString -> [ByteString] Source # subsequences :: ByteString -> [ByteString] Source # permutations :: ByteString -> [ByteString] Source # tailEx :: ByteString -> ByteString Source # tailMay :: ByteString -> Maybe ByteString Source # initEx :: ByteString -> ByteString Source # initMay :: ByteString -> Maybe ByteString Source # unsafeTail :: ByteString -> ByteString Source # unsafeInit :: ByteString -> ByteString Source # index :: ByteString -> Index ByteString -> Maybe (Element ByteString) Source # indexEx :: ByteString -> Index ByteString -> Element ByteString Source # unsafeIndex :: ByteString -> Index ByteString -> Element ByteString Source # splitWhen :: (Element ByteString -> Bool) -> ByteString -> [ByteString] Source # tails :: ByteString -> [ByteString] Source # inits :: ByteString -> [ByteString] Source # initTails :: ByteString -> [(ByteString, ByteString)] Source # | |||||||||
| SemiSequence ByteString | |||||||||
Defined in Data.Sequences Associated Types
Methods intersperse :: Element ByteString -> ByteString -> ByteString Source # reverse :: ByteString -> ByteString Source # find :: (Element ByteString -> Bool) -> ByteString -> Maybe (Element ByteString) Source # sortBy :: (Element ByteString -> Element ByteString -> Ordering) -> ByteString -> ByteString Source # cons :: Element ByteString -> ByteString -> ByteString Source # snoc :: ByteString -> Element ByteString -> ByteString Source # | |||||||||
| LazySequence ByteString ByteString | |||||||||
Defined in Data.Sequences Methods toChunks :: ByteString -> [ByteString] Source # fromChunks :: [ByteString] -> ByteString Source # toStrict :: ByteString -> ByteString Source # fromStrict :: ByteString -> ByteString Source # | |||||||||
| Utf8 Text ByteString | |||||||||
Defined in Data.Sequences | |||||||||
| Lift ByteString | Since: bytestring-0.11.2.0 | ||||||||
Defined in Data.ByteString.Internal.Type Methods lift :: Quote m => ByteString -> m Exp # liftTyped :: forall (m :: Type -> Type). Quote m => ByteString -> Code m ByteString # | |||||||||
| Stream (NoShareInput ByteString) | |||||||||
Defined in Text.Megaparsec.Stream Associated Types
Methods tokenToChunk :: Proxy (NoShareInput ByteString) -> Token (NoShareInput ByteString) -> Tokens (NoShareInput ByteString) Source # tokensToChunk :: Proxy (NoShareInput ByteString) -> [Token (NoShareInput ByteString)] -> Tokens (NoShareInput ByteString) Source # chunkToTokens :: Proxy (NoShareInput ByteString) -> Tokens (NoShareInput ByteString) -> [Token (NoShareInput ByteString)] Source # chunkLength :: Proxy (NoShareInput ByteString) -> Tokens (NoShareInput ByteString) -> Int Source # chunkEmpty :: Proxy (NoShareInput ByteString) -> Tokens (NoShareInput ByteString) -> Bool Source # take1_ :: NoShareInput ByteString -> Maybe (Token (NoShareInput ByteString), NoShareInput ByteString) Source # takeN_ :: Int -> NoShareInput ByteString -> Maybe (Tokens (NoShareInput ByteString), NoShareInput ByteString) Source # takeWhile_ :: (Token (NoShareInput ByteString) -> Bool) -> NoShareInput ByteString -> (Tokens (NoShareInput ByteString), NoShareInput ByteString) Source # | |||||||||
| Stream (ShareInput ByteString) | |||||||||
Defined in Text.Megaparsec.Stream Associated Types
Methods tokenToChunk :: Proxy (ShareInput ByteString) -> Token (ShareInput ByteString) -> Tokens (ShareInput ByteString) Source # tokensToChunk :: Proxy (ShareInput ByteString) -> [Token (ShareInput ByteString)] -> Tokens (ShareInput ByteString) Source # chunkToTokens :: Proxy (ShareInput ByteString) -> Tokens (ShareInput ByteString) -> [Token (ShareInput ByteString)] Source # chunkLength :: Proxy (ShareInput ByteString) -> Tokens (ShareInput ByteString) -> Int Source # chunkEmpty :: Proxy (ShareInput ByteString) -> Tokens (ShareInput ByteString) -> Bool Source # take1_ :: ShareInput ByteString -> Maybe (Token (ShareInput ByteString), ShareInput ByteString) Source # takeN_ :: Int -> ShareInput ByteString -> Maybe (Tokens (ShareInput ByteString), ShareInput ByteString) Source # takeWhile_ :: (Token (ShareInput ByteString) -> Bool) -> ShareInput ByteString -> (Tokens (ShareInput ByteString), ShareInput ByteString) Source # | |||||||||
| type Item ByteString | |||||||||
Defined in Data.ByteString.Internal.Type | |||||||||
| type Index ByteString | |||||||||
Defined in Control.Lens.At | |||||||||
| type IxValue ByteString | |||||||||
Defined in Control.Lens.At | |||||||||
| type Token ByteString | |||||||||
Defined in Text.Megaparsec.Stream | |||||||||
| type Tokens ByteString | |||||||||
Defined in Text.Megaparsec.Stream | |||||||||
| type Element ByteString | |||||||||
Defined in Data.MonoTraversable | |||||||||
| type Index ByteString | |||||||||
Defined in Data.Sequences | |||||||||
| type Token (NoShareInput ByteString) | |||||||||
Defined in Text.Megaparsec.Stream | |||||||||
| type Token (ShareInput ByteString) | |||||||||
Defined in Text.Megaparsec.Stream | |||||||||
| type Tokens (NoShareInput ByteString) | |||||||||
Defined in Text.Megaparsec.Stream | |||||||||
| type Tokens (ShareInput ByteString) | |||||||||
Defined in Text.Megaparsec.Stream | |||||||||
class (Functor t, Foldable t) => Traversable (t :: Type -> Type) where #
Functors representing data structures that can be transformed to
structures of the same shape by performing an Applicative (or,
therefore, Monad) action on each element from left to right.
A more detailed description of what same shape means, the various methods, how traversals are constructed, and example advanced use-cases can be found in the Overview section of Data.Traversable.
For the class laws see the Laws section of Data.Traversable.
Methods
traverse :: Applicative f => (a -> f b) -> t a -> f (t b) #
Map each element of a structure to an action, evaluate these actions
from left to right, and collect the results. For a version that ignores
the results see traverse_.
Examples
Basic usage:
In the first two examples we show each evaluated action mapping to the output structure.
>>>traverse Just [1,2,3,4]Just [1,2,3,4]
>>>traverse id [Right 1, Right 2, Right 3, Right 4]Right [1,2,3,4]
In the next examples, we show that Nothing and Left values short
circuit the created structure.
>>>traverse (const Nothing) [1,2,3,4]Nothing
>>>traverse (\x -> if odd x then Just x else Nothing) [1,2,3,4]Nothing
>>>traverse id [Right 1, Right 2, Right 3, Right 4, Left 0]Left 0
Instances
| Traversable KeyMap | |
| Traversable IResult | |
| Traversable Result | |
| Traversable ZipList | Since: base-4.9.0.0 |
| Traversable Complex | Since: base-4.9.0.0 |
| Traversable Identity | Since: base-4.9.0.0 |
| Traversable First | Since: base-4.8.0.0 |
| Traversable Last | Since: base-4.8.0.0 |
| Traversable Down | Since: base-4.12.0.0 |
| Traversable First | Since: base-4.9.0.0 |
| Traversable Last | Since: base-4.9.0.0 |
| Traversable Max | Since: base-4.9.0.0 |
| Traversable Min | Since: base-4.9.0.0 |
| Traversable Dual | Since: base-4.8.0.0 |
| Traversable Product | Since: base-4.8.0.0 |
| Traversable Sum | Since: base-4.8.0.0 |
| Traversable NonEmpty | Since: base-4.9.0.0 |
| Traversable Par1 | Since: base-4.9.0.0 |
| Traversable SCC | Since: containers-0.5.9 |
| Traversable IntMap | Traverses in order of increasing key. |
| Traversable Digit | |
| Traversable Elem | |
| Traversable FingerTree | |
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 Node | |
| Traversable Seq | |
| Traversable ViewL | |
| Traversable ViewR | |
| Traversable Tree | |
| Traversable DList | |
| Traversable NEIntMap | Traverses elements in order of ascending keys WARNING: Different than for the |
Defined in Data.IntMap.NonEmpty.Internal | |
| Traversable NESeq | |
| Traversable SimpleDocStream | Transform a document based on its annotations, possibly leveraging
|
Defined in Prettyprinter.Internal Methods traverse :: Applicative f => (a -> f b) -> SimpleDocStream a -> f (SimpleDocStream b) # sequenceA :: Applicative f => SimpleDocStream (f a) -> f (SimpleDocStream a) # mapM :: Monad m => (a -> m b) -> SimpleDocStream a -> m (SimpleDocStream b) # sequence :: Monad m => SimpleDocStream (m a) -> m (SimpleDocStream a) # | |
| Traversable Array | |
| Traversable SmallArray | |
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 Maybe | |
| Traversable TyVarBndr | |
Defined in Language.Haskell.TH.Syntax | |
| Traversable Window | |
| Traversable Vector | |
| Traversable Maybe | Since: base-2.1 |
| Traversable Solo | Since: base-4.15 |
| Traversable [] | Since: base-2.1 |
Defined in Data.Traversable | |
| Traversable (Either a) | Since: base-4.7.0.0 |
Defined in Data.Traversable | |
| Traversable (Proxy :: Type -> Type) | Since: base-4.7.0.0 |
| Traversable (Arg a) | Since: base-4.9.0.0 |
| Ix i => Traversable (Array i) | Since: base-2.1 |
| Traversable (U1 :: Type -> Type) | Since: base-4.9.0.0 |
| Traversable (UAddr :: Type -> Type) | Since: base-4.9.0.0 |
| Traversable (UChar :: Type -> Type) | Since: base-4.9.0.0 |
| Traversable (UDouble :: Type -> Type) | Since: base-4.9.0.0 |
| Traversable (UFloat :: Type -> Type) | Since: base-4.9.0.0 |
| Traversable (UInt :: Type -> Type) | Since: base-4.9.0.0 |
| Traversable (UWord :: Type -> Type) | Since: base-4.9.0.0 |
| Traversable (V1 :: Type -> Type) | Since: base-4.9.0.0 |
| Traversable (Map k) | Traverses in order of increasing key. |
| Traversable f => Traversable (Cofree f) | |
Defined in Control.Comonad.Cofree | |
| Traversable f => Traversable (Free f) | |
| Traversable f => Traversable (Yoneda f) | |
Defined in Data.Functor.Yoneda | |
| Traversable (NEMap k) | Traverses elements in order of ascending keys |
| Traversable (Either e) | |
| Traversable (These a) | |
| Traversable (Pair e) | |
| Traversable (These a) | |
| Traversable f => Traversable (Lift f) | |
| Traversable f => Traversable (MaybeT f) | |
Defined in Control.Monad.Trans.Maybe | |
| Traversable (HashMap k) | |
Defined in Data.HashMap.Internal | |
| Traversable ((,) a) | Since: base-4.7.0.0 |
Defined in Data.Traversable | |
| Traversable (Const m :: Type -> Type) | Since: base-4.7.0.0 |
| Traversable f => Traversable (Ap f) | Since: base-4.12.0.0 |
| Traversable f => Traversable (Alt f) | Since: base-4.12.0.0 |
| Traversable f => Traversable (Rec1 f) | Since: base-4.9.0.0 |
| Bitraversable p => Traversable (Fix p) | |
| Bitraversable p => Traversable (Join p) | |
| Traversable f => Traversable (CofreeF f a) | |
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) | |
Defined in Control.Comonad.Trans.Cofree | |
| Traversable f => Traversable (FreeF f a) | |
Defined in Control.Monad.Trans.Free | |
| (Monad m, Traversable m, Traversable f) => Traversable (FreeT f m) | |
Defined in Control.Monad.Trans.Free | |
| Traversable (Tagged s) | |
| (Traversable f, Traversable g) => Traversable (These1 f g) | |
Defined in Data.Functor.These | |
| Traversable f => Traversable (Backwards f) | Derived instance. |
Defined in Control.Applicative.Backwards | |
| Traversable f => Traversable (ExceptT e f) | |
Defined in Control.Monad.Trans.Except | |
| Traversable f => Traversable (IdentityT f) | |
Defined in Control.Monad.Trans.Identity | |
| Traversable f => Traversable (WriterT w f) | |
Defined in Control.Monad.Trans.Writer.Lazy | |
| Traversable f => Traversable (WriterT w f) | |
Defined in Control.Monad.Trans.Writer.Strict | |
| Traversable (Constant a :: Type -> Type) | |
Defined in Data.Functor.Constant | |
| Traversable f => Traversable (Reverse f) | Traverse from right to left. |
Defined in Data.Functor.Reverse | |
| (Traversable f, Traversable g) => Traversable (Product f g) | Since: base-4.9.0.0 |
Defined in Data.Functor.Product | |
| (Traversable f, Traversable g) => Traversable (Sum f g) | Since: base-4.9.0.0 |
| (Traversable f, Traversable g) => Traversable (f :*: g) | Since: base-4.9.0.0 |
Defined in Data.Traversable | |
| (Traversable f, Traversable g) => Traversable (f :+: g) | Since: base-4.9.0.0 |
Defined in Data.Traversable | |
| Traversable (K1 i c :: Type -> Type) | Since: base-4.9.0.0 |
| (Traversable f, Traversable g) => Traversable (Compose f g) | Since: base-4.9.0.0 |
Defined in Data.Functor.Compose | |
| (Traversable f, Traversable g) => Traversable (f :.: g) | Since: base-4.9.0.0 |
Defined in Data.Traversable | |
| Traversable f => Traversable (M1 i c f) | Since: base-4.9.0.0 |
| Traversable (Clown f a :: Type -> Type) | |
Defined in Data.Bifunctor.Clown | |
| Bitraversable p => Traversable (Flip p a) | |
Defined in Data.Bifunctor.Flip | |
| Traversable g => Traversable (Joker g a) | |
Defined in Data.Bifunctor.Joker | |
| Bitraversable p => Traversable (WrappedBifunctor p a) | |
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 (f a), Traversable (g a)) => Traversable (Product f g a) | |
Defined in Data.Bifunctor.Product Methods traverse :: Applicative f0 => (a0 -> f0 b) -> Product f g a a0 -> f0 (Product f g a b) # sequenceA :: Applicative f0 => Product f g a (f0 a0) -> f0 (Product f g a a0) # mapM :: Monad m => (a0 -> m b) -> Product f g a a0 -> m (Product f g a b) # sequence :: Monad m => Product f g a (m a0) -> m (Product f g a a0) # | |
| (Traversable (f a), Traversable (g a)) => Traversable (Sum f g a) | |
Defined in Data.Bifunctor.Sum | |
| (Traversable f, Bitraversable p) => Traversable (Tannen f p a) | |
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) | |
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) # | |
filter :: (a -> Bool) -> [a] -> [a] #
\(\mathcal{O}(n)\). filter, applied to a predicate and a list, returns
the list of those elements that satisfy the predicate; i.e.,
filter p xs = [ x | x <- xs, p x]
Examples
>>>filter odd [1, 2, 3][1,3]
>>>filter (\l -> length l > 3) ["Hello", ", ", "World", "!"]["Hello","World"]
>>>filter (/= 3) [1, 2, 3, 4, 3, 2, 1][1,2,4,2,1]
typeMismatch :: Value -> DecodeM a Source #
Throw an error indicating that the given Value isn't the correct type of value.
makeDecoder $ \v ->
case v of
String s -> ...
_ -> typeMismatch v
unless :: Applicative f => Bool -> f () -> f () #
The reverse of when.
($>) :: Functor f => f a -> b -> f b infixl 4 #
Flipped version of <$.
Examples
Replace the contents of a Maybe IntString:
>>>Nothing $> "foo"Nothing>>>Just 90210 $> "foo"Just "foo"
Replace the contents of an Either Int IntString, resulting in an Either
Int String
>>>Left 8675309 $> "foo"Left 8675309>>>Right 8675309 $> "foo"Right "foo"
Replace each element of a list with a constant String:
>>>[1,2,3] $> "foo"["foo","foo","foo"]
Replace the second element of a pair with a constant String:
>>>(1,2) $> "foo"(1,"foo")
Since: base-4.7.0.0
fromMaybe :: a -> Maybe a -> a #
The fromMaybe function takes a default value and a Maybe
value. If the Maybe is Nothing, it returns the default value;
otherwise, it returns the value contained in the Maybe.
Examples
Basic usage:
>>>fromMaybe "" (Just "Hello, World!")"Hello, World!"
>>>fromMaybe "" Nothing""
Read an integer from a string using readMaybe. If we fail to
parse an integer, we want to return 0 by default:
>>>import Text.Read ( readMaybe )>>>fromMaybe 0 (readMaybe "5")5>>>fromMaybe 0 (readMaybe "")0
Since Void values logically don't exist, this witnesses the
logical reasoning tool of "ex falso quodlibet".
>>>let x :: Either Void Int; x = Right 5>>>:{case x of Right r -> r Left l -> absurd l :} 5
Since: base-4.8.0.0
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.
Proxy is a type that holds no data, but has a phantom parameter of
arbitrary type (or even kind). Its use is to provide type information, even
though there is no value available of that type (or it may be too costly to
create one).
Historically, Proxy :: Proxy aundefined :: a
>>>Proxy :: Proxy (Void, Int -> Int)Proxy
Proxy can even hold types of higher kinds,
>>>Proxy :: Proxy EitherProxy
>>>Proxy :: Proxy FunctorProxy
>>>Proxy :: Proxy complicatedStructureProxy
Constructors
| Proxy |
Instances
| Generic1 (Proxy :: k -> Type) | |
Defined in GHC.Generics | |
| Representable (Proxy :: Type -> Type) | |
| MonadZip (Proxy :: Type -> Type) | Since: base-4.9.0.0 |
| Foldable (Proxy :: Type -> Type) | Since: base-4.7.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => Proxy m -> m # foldMap :: Monoid m => (a -> m) -> Proxy a -> m # foldMap' :: Monoid m => (a -> m) -> Proxy a -> m # foldr :: (a -> b -> b) -> b -> Proxy a -> b # foldr' :: (a -> b -> b) -> b -> Proxy a -> b # foldl :: (b -> a -> b) -> b -> Proxy a -> b # foldl' :: (b -> a -> b) -> b -> Proxy a -> b # foldr1 :: (a -> a -> a) -> Proxy a -> a # foldl1 :: (a -> a -> a) -> Proxy a -> a # elem :: Eq a => a -> Proxy a -> Bool # maximum :: Ord a => Proxy a -> a # minimum :: Ord a => Proxy a -> a # | |
| Eq1 (Proxy :: Type -> Type) | Since: base-4.9.0.0 |
| Ord1 (Proxy :: Type -> Type) | Since: base-4.9.0.0 |
Defined in Data.Functor.Classes | |
| Read1 (Proxy :: Type -> Type) | Since: base-4.9.0.0 |
Defined in Data.Functor.Classes | |
| Show1 (Proxy :: Type -> Type) | Since: base-4.9.0.0 |
| Contravariant (Proxy :: Type -> Type) | |
| Traversable (Proxy :: Type -> Type) | Since: base-4.7.0.0 |
| Alternative (Proxy :: Type -> Type) | Since: base-4.9.0.0 |
| Applicative (Proxy :: Type -> Type) | Since: base-4.7.0.0 |
| Functor (Proxy :: Type -> Type) | Since: base-4.7.0.0 |
| Monad (Proxy :: Type -> Type) | Since: base-4.7.0.0 |
| MonadPlus (Proxy :: Type -> Type) | Since: base-4.9.0.0 |
| NFData1 (Proxy :: Type -> Type) | Since: deepseq-1.4.3.0 |
Defined in Control.DeepSeq | |
| Hashable1 (Proxy :: Type -> Type) | |
Defined in Data.Hashable.Class | |
| Data t => Data (Proxy t) | Since: base-4.7.0.0 |
Defined in Data.Data Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Proxy t -> c (Proxy t) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Proxy t) # toConstr :: Proxy t -> Constr # dataTypeOf :: Proxy t -> DataType # dataCast1 :: Typeable t0 => (forall d. Data d => c (t0 d)) -> Maybe (c (Proxy t)) # dataCast2 :: Typeable t0 => (forall d e. (Data d, Data e) => c (t0 d e)) -> Maybe (c (Proxy t)) # gmapT :: (forall b. Data b => b -> b) -> Proxy t -> Proxy t # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Proxy t -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Proxy t -> r # gmapQ :: (forall d. Data d => d -> u) -> Proxy t -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Proxy t -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Proxy t -> m (Proxy t) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Proxy t -> m (Proxy t) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Proxy t -> m (Proxy t) # | |
| Monoid (Proxy s) | Since: base-4.7.0.0 |
| Semigroup (Proxy s) | Since: base-4.9.0.0 |
| Bounded (Proxy t) | Since: base-4.7.0.0 |
| Enum (Proxy s) | Since: base-4.7.0.0 |
| Generic (Proxy t) | |
Defined in GHC.Generics | |
| Ix (Proxy s) | Since: base-4.7.0.0 |
Defined in Data.Proxy | |
| Read (Proxy t) | Since: base-4.7.0.0 |
| Show (Proxy s) | Since: base-4.7.0.0 |
| NFData (Proxy a) | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| Eq (Proxy s) | Since: base-4.7.0.0 |
| Ord (Proxy s) | Since: base-4.7.0.0 |
| Hashable (Proxy a) | |
| MonoFoldable (Proxy a) | Since: mono-traversable-1.0.11.0 |
Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element (Proxy a) -> m) -> Proxy a -> m Source # ofoldr :: (Element (Proxy a) -> b -> b) -> b -> Proxy a -> b Source # ofoldl' :: (a0 -> Element (Proxy a) -> a0) -> a0 -> Proxy a -> a0 Source # otoList :: Proxy a -> [Element (Proxy a)] Source # oall :: (Element (Proxy a) -> Bool) -> Proxy a -> Bool Source # oany :: (Element (Proxy a) -> Bool) -> Proxy a -> Bool Source # onull :: Proxy a -> Bool Source # olength :: Proxy a -> Int Source # olength64 :: Proxy a -> Int64 Source # ocompareLength :: Integral i => Proxy a -> i -> Ordering Source # otraverse_ :: Applicative f => (Element (Proxy a) -> f b) -> Proxy a -> f () Source # ofor_ :: Applicative f => Proxy a -> (Element (Proxy a) -> f b) -> f () Source # omapM_ :: Applicative m => (Element (Proxy a) -> m ()) -> Proxy a -> m () Source # oforM_ :: Applicative m => Proxy a -> (Element (Proxy a) -> m ()) -> m () Source # ofoldlM :: Monad m => (a0 -> Element (Proxy a) -> m a0) -> a0 -> Proxy a -> m a0 Source # ofoldMap1Ex :: Semigroup m => (Element (Proxy a) -> m) -> Proxy a -> m Source # ofoldr1Ex :: (Element (Proxy a) -> Element (Proxy a) -> Element (Proxy a)) -> Proxy a -> Element (Proxy a) Source # ofoldl1Ex' :: (Element (Proxy a) -> Element (Proxy a) -> Element (Proxy a)) -> Proxy a -> Element (Proxy a) Source # headEx :: Proxy a -> Element (Proxy a) Source # lastEx :: Proxy a -> Element (Proxy a) Source # unsafeHead :: Proxy a -> Element (Proxy a) Source # unsafeLast :: Proxy a -> Element (Proxy a) Source # maximumByEx :: (Element (Proxy a) -> Element (Proxy a) -> Ordering) -> Proxy a -> Element (Proxy a) Source # minimumByEx :: (Element (Proxy a) -> Element (Proxy a) -> Ordering) -> Proxy a -> Element (Proxy a) Source # | |
| MonoFunctor (Proxy a) | Since: mono-traversable-1.0.11.0 |
| MonoPointed (Proxy a) | Since: mono-traversable-1.0.11.0 |
| MonoTraversable (Proxy a) | Since: mono-traversable-1.0.11.0 |
| DecodeTOML (Proxy a) | |
Defined in TOML.Decode Methods tomlDecoder :: Decoder (Proxy a) Source # | |
| type Rep1 (Proxy :: k -> Type) | Since: base-4.6.0.0 |
| type Rep (Proxy :: Type -> Type) | |
| type Rep (Proxy t) | Since: base-4.6.0.0 |
| type Element (Proxy a) | |
Defined in Data.MonoTraversable | |
A space efficient, packed, unboxed Unicode text type.
Instances
| Outputable Text | |||||||||
| ToRegionContent Text | |||||||||
Defined in System.Console.Regions Methods toRegionContent :: Text -> RegionContent Source # | |||||||||
| IsAtom Text | |||||||||
| IsValue Text | |||||||||
| IsVariant Text | |||||||||
| Hashable Text | |||||||||
| Ixed Text | |||||||||
Defined in Control.Lens.At | |||||||||
| Stream Text | |||||||||
Defined in Text.Megaparsec.Stream Associated Types
Methods tokenToChunk :: Proxy Text -> Token Text -> Tokens Text Source # tokensToChunk :: Proxy Text -> [Token Text] -> Tokens Text Source # chunkToTokens :: Proxy Text -> Tokens Text -> [Token Text] Source # chunkLength :: Proxy Text -> Tokens Text -> Int Source # chunkEmpty :: Proxy Text -> Tokens Text -> Bool Source # take1_ :: Text -> Maybe (Token Text, Text) Source # takeN_ :: Int -> Text -> Maybe (Tokens Text, Text) Source # takeWhile_ :: (Token Text -> Bool) -> Text -> (Tokens Text, Text) Source # | |||||||||
| TraversableStream Text | |||||||||
| VisualStream Text | |||||||||
| GrowingAppend Text | |||||||||
Defined in Data.MonoTraversable | |||||||||
| MonoFoldable Text | |||||||||
Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element Text -> m) -> Text -> m Source # ofoldr :: (Element Text -> b -> b) -> b -> Text -> b Source # ofoldl' :: (a -> Element Text -> a) -> a -> Text -> a Source # otoList :: Text -> [Element Text] Source # oall :: (Element Text -> Bool) -> Text -> Bool Source # oany :: (Element Text -> Bool) -> Text -> Bool Source # onull :: Text -> Bool Source # olength :: Text -> Int Source # olength64 :: Text -> Int64 Source # ocompareLength :: Integral i => Text -> i -> Ordering Source # otraverse_ :: Applicative f => (Element Text -> f b) -> Text -> f () Source # ofor_ :: Applicative f => Text -> (Element Text -> f b) -> f () Source # omapM_ :: Applicative m => (Element Text -> m ()) -> Text -> m () Source # oforM_ :: Applicative m => Text -> (Element Text -> m ()) -> m () Source # ofoldlM :: Monad m => (a -> Element Text -> m a) -> a -> Text -> m a Source # ofoldMap1Ex :: Semigroup m => (Element Text -> m) -> Text -> m Source # ofoldr1Ex :: (Element Text -> Element Text -> Element Text) -> Text -> Element Text Source # ofoldl1Ex' :: (Element Text -> Element Text -> Element Text) -> Text -> Element Text Source # headEx :: Text -> Element Text Source # lastEx :: Text -> Element Text Source # unsafeHead :: Text -> Element Text Source # unsafeLast :: Text -> Element Text Source # maximumByEx :: (Element Text -> Element Text -> Ordering) -> Text -> Element Text Source # minimumByEx :: (Element Text -> Element Text -> Ordering) -> Text -> Element Text Source # | |||||||||
| MonoFunctor Text | |||||||||
| MonoPointed Text | |||||||||
| MonoTraversable Text | |||||||||
| IsSequence Text | |||||||||
Defined in Data.Sequences Methods fromList :: [Element Text] -> Text Source # lengthIndex :: Text -> Index Text Source # break :: (Element Text -> Bool) -> Text -> (Text, Text) Source # span :: (Element Text -> Bool) -> Text -> (Text, Text) Source # dropWhile :: (Element Text -> Bool) -> Text -> Text Source # takeWhile :: (Element Text -> Bool) -> Text -> Text Source # splitAt :: Index Text -> Text -> (Text, Text) Source # unsafeSplitAt :: Index Text -> Text -> (Text, Text) Source # take :: Index Text -> Text -> Text Source # unsafeTake :: Index Text -> Text -> Text Source # drop :: Index Text -> Text -> Text Source # unsafeDrop :: Index Text -> Text -> Text Source # dropEnd :: Index Text -> Text -> Text Source # partition :: (Element Text -> Bool) -> Text -> (Text, Text) Source # uncons :: Text -> Maybe (Element Text, Text) Source # unsnoc :: Text -> Maybe (Text, Element Text) Source # filter :: (Element Text -> Bool) -> Text -> Text Source # filterM :: Monad m => (Element Text -> m Bool) -> Text -> m Text Source # replicate :: Index Text -> Element Text -> Text Source # replicateM :: Monad m => Index Text -> m (Element Text) -> m Text Source # groupBy :: (Element Text -> Element Text -> Bool) -> Text -> [Text] Source # groupAllOn :: Eq b => (Element Text -> b) -> Text -> [Text] Source # subsequences :: Text -> [Text] Source # permutations :: Text -> [Text] Source # tailEx :: Text -> Text Source # tailMay :: Text -> Maybe Text Source # initEx :: Text -> Text Source # initMay :: Text -> Maybe Text Source # unsafeTail :: Text -> Text Source # unsafeInit :: Text -> Text Source # index :: Text -> Index Text -> Maybe (Element Text) Source # indexEx :: Text -> Index Text -> Element Text Source # unsafeIndex :: Text -> Index Text -> Element Text Source # splitWhen :: (Element Text -> Bool) -> Text -> [Text] Source # tails :: Text -> [Text] Source # | |||||||||
| SemiSequence Text | |||||||||
Defined in Data.Sequences | |||||||||
| Textual Text | |||||||||
Defined in Data.Sequences Methods words :: Text -> [Text] Source # unwords :: (Element seq ~ Text, MonoFoldable seq) => seq -> Text Source # lines :: Text -> [Text] Source # unlines :: (Element seq ~ Text, MonoFoldable seq) => seq -> Text Source # toLower :: Text -> Text Source # toUpper :: Text -> Text Source # toCaseFold :: Text -> Text Source # | |||||||||
| Pretty Text | |||||||||
| Pretty Text | Automatically converts all newlines to
Note that
Manually use | ||||||||
| DecodeTOML Text | |||||||||
Defined in TOML.Decode Methods | |||||||||
| LazySequence Text Text | |||||||||
| Utf8 Text ByteString | |||||||||
Defined in Data.Sequences | |||||||||
| ToRegionContent (STM Text) | Makes a STM action be run to get the content of a region. Any change to the values that action reads will result in an immediate refresh of the display. | ||||||||
Defined in System.Console.Regions Methods toRegionContent :: STM Text -> RegionContent Source # | |||||||||
| Stream (NoShareInput Text) | |||||||||
Defined in Text.Megaparsec.Stream Associated Types
Methods tokenToChunk :: Proxy (NoShareInput Text) -> Token (NoShareInput Text) -> Tokens (NoShareInput Text) Source # tokensToChunk :: Proxy (NoShareInput Text) -> [Token (NoShareInput Text)] -> Tokens (NoShareInput Text) Source # chunkToTokens :: Proxy (NoShareInput Text) -> Tokens (NoShareInput Text) -> [Token (NoShareInput Text)] Source # chunkLength :: Proxy (NoShareInput Text) -> Tokens (NoShareInput Text) -> Int Source # chunkEmpty :: Proxy (NoShareInput Text) -> Tokens (NoShareInput Text) -> Bool Source # take1_ :: NoShareInput Text -> Maybe (Token (NoShareInput Text), NoShareInput Text) Source # takeN_ :: Int -> NoShareInput Text -> Maybe (Tokens (NoShareInput Text), NoShareInput Text) Source # takeWhile_ :: (Token (NoShareInput Text) -> Bool) -> NoShareInput Text -> (Tokens (NoShareInput Text), NoShareInput Text) Source # | |||||||||
| Stream (ShareInput Text) | |||||||||
Defined in Text.Megaparsec.Stream Associated Types
Methods tokenToChunk :: Proxy (ShareInput Text) -> Token (ShareInput Text) -> Tokens (ShareInput Text) Source # tokensToChunk :: Proxy (ShareInput Text) -> [Token (ShareInput Text)] -> Tokens (ShareInput Text) Source # chunkToTokens :: Proxy (ShareInput Text) -> Tokens (ShareInput Text) -> [Token (ShareInput Text)] Source # chunkLength :: Proxy (ShareInput Text) -> Tokens (ShareInput Text) -> Int Source # chunkEmpty :: Proxy (ShareInput Text) -> Tokens (ShareInput Text) -> Bool Source # take1_ :: ShareInput Text -> Maybe (Token (ShareInput Text), ShareInput Text) Source # takeN_ :: Int -> ShareInput Text -> Maybe (Tokens (ShareInput Text), ShareInput Text) Source # takeWhile_ :: (Token (ShareInput Text) -> Bool) -> ShareInput Text -> (Tokens (ShareInput Text), ShareInput Text) Source # | |||||||||
| type Item Text | |||||||||
| type Index Text | |||||||||
Defined in Control.Lens.At | |||||||||
| type IxValue Text | |||||||||
Defined in Control.Lens.At | |||||||||
| type Token Text | |||||||||
Defined in Text.Megaparsec.Stream | |||||||||
| type Tokens Text | |||||||||
Defined in Text.Megaparsec.Stream | |||||||||
| type Element Text | |||||||||
Defined in Data.MonoTraversable | |||||||||
| type Index Text | |||||||||
Defined in Data.Sequences | |||||||||
| type Token (NoShareInput Text) | |||||||||
Defined in Text.Megaparsec.Stream | |||||||||
| type Token (ShareInput Text) | |||||||||
Defined in Text.Megaparsec.Stream | |||||||||
| type Tokens (NoShareInput Text) | |||||||||
Defined in Text.Megaparsec.Stream | |||||||||
| type Tokens (ShareInput Text) | |||||||||
Defined in Text.Megaparsec.Stream | |||||||||
(<$>) :: Functor f => (a -> b) -> f a -> f b infixl 4 #
An infix synonym for fmap.
The name of this operator is an allusion to $.
Note the similarities between their types:
($) :: (a -> b) -> a -> b (<$>) :: Functor f => (a -> b) -> f a -> f b
Whereas $ is function application, <$> is function
application lifted over a Functor.
Examples
Convert from a Maybe IntMaybe
Stringshow:
>>>show <$> NothingNothing>>>show <$> Just 3Just "3"
Convert from an Either Int IntEither IntString using show:
>>>show <$> Left 17Left 17>>>show <$> Right 17Right "17"
Double each element of a list:
>>>(*2) <$> [1,2,3][2,4,6]
Apply even to the second element of a pair:
>>>even <$> (2,2)(2,True)
The value of seq a ba 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 ba 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.
class FromInteger a where Source #
Replaces base's fromInteger functionality for when we do not have a
Num instance.
1_000 :: Num a => a -- becomes afromInteger 1_000 :: FromInteger a => a
Note that fromInteger's deficiencies are inherited e.g. Natural is
partial, bounded types have over/underflow issues.
Since: algebra-simple-0.1
Instances
| FromInteger Int16 | Since: algebra-simple-0.1 |
Defined in Numeric.Literal.Integer Methods afromInteger :: Integer -> Int16 Source # | |
| FromInteger Int32 | Since: algebra-simple-0.1 |
Defined in Numeric.Literal.Integer Methods afromInteger :: Integer -> Int32 Source # | |
| FromInteger Int64 | Since: algebra-simple-0.1 |
Defined in Numeric.Literal.Integer Methods afromInteger :: Integer -> Int64 Source # | |
| FromInteger Int8 | Since: algebra-simple-0.1 |
Defined in Numeric.Literal.Integer Methods afromInteger :: Integer -> Int8 Source # | |
| FromInteger Word16 | Since: algebra-simple-0.1 |
Defined in Numeric.Literal.Integer Methods afromInteger :: Integer -> Word16 Source # | |
| FromInteger Word32 | Since: algebra-simple-0.1 |
Defined in Numeric.Literal.Integer Methods afromInteger :: Integer -> Word32 Source # | |
| FromInteger Word64 | Since: algebra-simple-0.1 |
Defined in Numeric.Literal.Integer Methods afromInteger :: Integer -> Word64 Source # | |
| FromInteger Word8 | Since: algebra-simple-0.1 |
Defined in Numeric.Literal.Integer Methods afromInteger :: Integer -> Word8 Source # | |
| FromInteger RelativeTime | WARNING: Partial Since: relative-time-0.1 |
Defined in Data.Time.Relative Methods afromInteger :: Integer -> RelativeTime Source # | |
| FromInteger NotifyTimeout Source # | |
Defined in Shrun.Notify.Types Methods afromInteger :: Integer -> NotifyTimeout Source # | |
| FromInteger Integer | Since: algebra-simple-0.1 |
Defined in Numeric.Literal.Integer Methods afromInteger :: Integer -> Integer Source # | |
| FromInteger Natural | WARNING: Partial Since: algebra-simple-0.1 |
Defined in Numeric.Literal.Integer Methods afromInteger :: Integer -> Natural Source # | |
| FromInteger Double | Since: algebra-simple-0.1 |
Defined in Numeric.Literal.Integer Methods afromInteger :: Integer -> Double Source # | |
| FromInteger Float | Since: algebra-simple-0.1 |
Defined in Numeric.Literal.Integer Methods afromInteger :: Integer -> Float Source # | |
| FromInteger Int | Since: algebra-simple-0.1 |
Defined in Numeric.Literal.Integer Methods afromInteger :: Integer -> Int Source # | |
| FromInteger Word | Since: algebra-simple-0.1 |
Defined in Numeric.Literal.Integer Methods afromInteger :: Integer -> Word Source # | |
| RealFloat a => FromInteger (Complex a) | Since: algebra-simple-0.1 |
Defined in Numeric.Literal.Integer Methods afromInteger :: Integer -> Complex a Source # | |
| FromInteger (Ratio Integer) | Since: algebra-simple-0.1 |
Defined in Numeric.Literal.Integer | |
| FromInteger (Ratio Natural) | WARNING: Partial Since: algebra-simple-0.1 |
Defined in Numeric.Literal.Integer | |
| FromInteger n => FromInteger (SomeSize n) | Fixed size Since: si-bytes-0.1 |
Defined in Data.Bytes.Internal Methods afromInteger :: Integer -> SomeSize n Source # | |
| (FromInteger a, Num a, Ord a) => FromInteger (NonZero a) | WARNING: Partial Since: smart-math-0.1 |
Defined in Numeric.Data.NonZero.Internal Methods afromInteger :: Integer -> NonZero a Source # | |
| (Num a, Ord a, Show a) => FromInteger (Positive a) | WARNING: Partial Since: smart-math-0.1 |
Defined in Numeric.Data.Positive.Internal Methods afromInteger :: Integer -> Positive a Source # | |
| FromInteger n => FromInteger (Bytes s n) | Since: si-bytes-0.1 |
Defined in Data.Bytes.Internal Methods afromInteger :: Integer -> Bytes s n Source # | |
| FromInteger n => FromInteger (SomeNetSize d n) | Fixed size Since: si-bytes-0.1 |
Defined in Data.Bytes.Network.Internal Methods afromInteger :: Integer -> SomeNetSize d n Source # | |
| FromInteger n => FromInteger (NetBytes d s n) | Since: si-bytes-0.1 |
Defined in Data.Bytes.Network.Internal Methods afromInteger :: Integer -> NetBytes d s n Source # | |
Basic numeric class.
The Haskell Report defines no laws for Num. However, ( and +)( are
customarily expected to define a ring and have the following properties:*)
- Associativity of
(+) (x + y) + z=x + (y + z)- Commutativity of
(+) x + y=y + xfromInteger0x + fromInteger 0=xnegategives the additive inversex + negate x=fromInteger 0- Associativity of
(*) (x * y) * z=x * (y * z)fromInteger1x * fromInteger 1=xandfromInteger 1 * x=x- Distributivity of
(with respect to*)(+) a * (b + c)=(a * b) + (a * c)and(b + c) * a=(b * a) + (c * a)- Coherence with
toInteger - if the type also implements
Integral, thenfromIntegeris a left inverse fortoInteger, i.e.fromInteger (toInteger i) == i
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.
Instances
| Num CBool | |
| Num CChar | |
| Num CClock | |
| Num CDouble | |
| Num CFloat | |
| Num CInt | |
| Num CIntMax | |
| Num CIntPtr | |
| Num CLLong | |
| Num CLong | |
| Num CPtrdiff | |
| Num CSChar | |
| Num CSUSeconds | |
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 CShort | |
| Num CSigAtomic | |
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 CSize | |
| Num CTime | |
| Num CUChar | |
| Num CUInt | |
| Num CUIntMax | |
| Num CUIntPtr | |
| Num CULLong | |
| Num CULong | |
| Num CUSeconds | |
Defined in Foreign.C.Types | |
| Num CUShort | |
| Num CWchar | |
| Num IntPtr | |
| Num WordPtr | |
| Num Int16 | Since: base-2.1 |
| Num Int32 | Since: base-2.1 |
| Num Int64 | Since: base-2.1 |
| Num Int8 | Since: base-2.1 |
| Num Word16 | Since: base-2.1 |
| Num Word32 | Since: base-2.1 |
| Num Word64 | Since: base-2.1 |
| Num Word8 | Since: base-2.1 |
| Num CBlkCnt | |
| Num CBlkSize | |
| Num CCc | |
| Num CClockId | |
| Num CDev | |
| Num CFsBlkCnt | |
Defined in System.Posix.Types | |
| Num CFsFilCnt | |
Defined in System.Posix.Types | |
| Num CGid | |
| Num CId | |
| Num CIno | |
| Num CKey | |
| Num CMode | |
| Num CNfds | |
| Num CNlink | |
| Num COff | |
| Num CPid | |
| Num CRLim | |
| Num CSocklen | |
| Num CSpeed | |
| Num CSsize | |
| Num CTcflag | |
| Num CUid | |
| Num Fd | |
| Num Scientific | WARNING: |
Defined in Data.Scientific Methods (+) :: Scientific -> Scientific -> Scientific # (-) :: Scientific -> Scientific -> Scientific # (*) :: Scientific -> Scientific -> Scientific # negate :: Scientific -> Scientific # abs :: Scientific -> Scientific # signum :: Scientific -> Scientific # fromInteger :: Integer -> Scientific # | |
| Num PollInterval Source # | |
Defined in Shrun.Configuration.Data.CommandLogging.PollInterval Methods (+) :: PollInterval -> PollInterval -> PollInterval # (-) :: PollInterval -> PollInterval -> PollInterval # (*) :: PollInterval -> PollInterval -> PollInterval # negate :: PollInterval -> PollInterval # abs :: PollInterval -> PollInterval # signum :: PollInterval -> PollInterval # fromInteger :: Integer -> PollInterval # | |
| Num Timeout Source # | |
| Num I8 | |
| Num Size | |
| Num B | |
| Num Integer | Since: base-2.1 |
| Num Natural | Note that Since: base-4.8.0.0 |
| Num Int | Since: base-2.1 |
| Num Word | Since: base-2.1 |
| RealFloat a => Num (Complex a) | Since: base-2.1 |
| Num a => Num (Identity a) | Since: base-4.9.0.0 |
Defined in Data.Functor.Identity | |
| Num a => Num (Down a) | Since: base-4.11.0.0 |
| Num a => Num (Max a) | Since: base-4.9.0.0 |
| Num a => Num (Min a) | Since: base-4.9.0.0 |
| Num a => Num (Product a) | Since: base-4.7.0.0 |
Defined in Data.Semigroup.Internal | |
| Num a => Num (Sum a) | Since: base-4.7.0.0 |
| Integral a => Num (Ratio a) | Since: base-2.0.1 |
| Num (Truncation a) Source # | |
Defined in Shrun.Configuration.Data.Truncation Methods (+) :: Truncation a -> Truncation a -> Truncation a # (-) :: Truncation a -> Truncation a -> Truncation a # (*) :: Truncation a -> Truncation a -> Truncation a # negate :: Truncation a -> Truncation a # abs :: Truncation a -> Truncation a # signum :: Truncation a -> Truncation a # fromInteger :: Integer -> Truncation a # | |
| HasResolution a => Num (Fixed a) | Multiplication is not associative or distributive:
Since: base-2.1 |
| Num a => Num (Op a b) | |
| Num a => Num (Const a b) | Since: base-4.9.0.0 |
Defined in Data.Functor.Const | |
| (Applicative f, Num a) => Num (Ap f a) | Note that even if the underlying Commutativity:
Additive inverse:
Distributivity:
Since: base-4.12.0.0 |
| Num (f a) => Num (Alt f a) | Since: base-4.8.0.0 |
| Num a => Num (Tagged s a) | |
Defined in Data.Tagged | |
| Num (f (g a)) => Num (Compose f g a) | Since: base-4.19.0.0 |
Defined in Data.Functor.Compose Methods (+) :: Compose f g a -> Compose f g a -> Compose f g a # (-) :: Compose f g a -> Compose f g a -> Compose f g a # (*) :: Compose f g a -> Compose f g a -> Compose f g a # negate :: Compose f g a -> Compose f g a # abs :: Compose f g a -> Compose f g a # signum :: Compose f g a -> Compose f g a # fromInteger :: Integer -> Compose f g a # | |
Haskell defines operations to read and write characters from and to files,
represented by values of type Handle. Each value of this type is a
handle: a record used by the Haskell run-time system to manage I/O
with file system objects. A handle has at least the following properties:
- whether it manages input or output or both;
- whether it is open, closed or semi-closed;
- whether the object is seekable;
- whether buffering is disabled, or enabled on a line or block basis;
- a buffer (whose length may be zero).
Most handles will also have a current I/O position indicating where the next
input or output operation will occur. A handle is readable if it
manages only input or both input and output; likewise, it is writable if
it manages only output or both input and output. A handle is open when
first allocated.
Once it is closed it can no longer be used for either input or output,
though an implementation cannot re-use its storage while references
remain to it. Handles are in the Show and Eq classes. The string
produced by showing a handle is system dependent; it should include
enough information to identify the handle for debugging. A handle is
equal according to == only to itself; no attempt
is made to compare the internal state of different handles for equality.
Instances
class (forall a. Functor (p a)) => Bifunctor (p :: Type -> Type -> Type) #
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. A partially applied Bifunctor
must be a Functor and the second method must agree with fmap.
From this it follows that:
secondid=id
If you supply bimap, you should ensure that:
bimapidid≡id
If you supply first and second, ensure:
firstid≡idsecondid≡id
If you supply both, you should also ensure:
bimapf g ≡firstf.secondg
These ensure by parametricity:
bimap(f.g) (h.i) ≡bimapf h.bimapg ifirst(f.g) ≡firstf.firstgsecond(f.g) ≡secondf.secondg
Since 4.18.0.0 Functor is a superclass of 'Bifunctor.
Since: base-4.8.0.0
Instances
| Bifunctor ConcurrentlyE | |
Defined in Control.Concurrent.Async.Internal Methods bimap :: (a -> b) -> (c -> d) -> ConcurrentlyE a c -> ConcurrentlyE b d # first :: (a -> b) -> ConcurrentlyE a c -> ConcurrentlyE b c # second :: (b -> c) -> ConcurrentlyE a b -> ConcurrentlyE a c # | |
| Bifunctor Either | Since: base-4.8.0.0 |
| Bifunctor Arg | Since: base-4.9.0.0 |
| Bifunctor Either | |
| Bifunctor These | |
| Bifunctor Pair | |
| Bifunctor These | |
| Bifunctor (,) | Class laws for tuples hold only up to laziness. Both
Since: base-4.8.0.0 |
| Bifunctor (Const :: Type -> Type -> Type) | Since: base-4.8.0.0 |
| Functor f => Bifunctor (CofreeF f) | |
| Functor f => Bifunctor (FreeF f) | |
| Bifunctor (Tagged :: Type -> Type -> Type) | |
| Bifunctor (Constant :: Type -> Type -> Type) | |
| Bifunctor ((,,) x1) | Since: base-4.8.0.0 |
| Bifunctor (K1 i :: Type -> Type -> Type) | Since: base-4.9.0.0 |
| Bifunctor ((,,,) x1 x2) | Since: base-4.8.0.0 |
| Functor f => Bifunctor (Clown f :: Type -> Type -> Type) | |
| Bifunctor p => Bifunctor (Flip p) | |
| Functor g => Bifunctor (Joker g :: Type -> Type -> Type) | |
| Bifunctor p => Bifunctor (WrappedBifunctor p) | |
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 # | |
| Bifunctor ((,,,,) x1 x2 x3) | Since: base-4.8.0.0 |
| (Bifunctor f, Bifunctor g) => Bifunctor (Product f g) | |
| (Bifunctor p, Bifunctor q) => Bifunctor (Sum p q) | |
| Bifunctor ((,,,,,) x1 x2 x3 x4) | Since: base-4.8.0.0 |
| (Functor f, Bifunctor p) => Bifunctor (Tannen f p) | |
| Bifunctor ((,,,,,,) x1 x2 x3 x4 x5) | Since: base-4.8.0.0 |
| (Bifunctor p, Functor f, Functor g) => Bifunctor (Biff p f g) | |
error :: HasCallStack => [Char] -> a #
error stops execution and displays an error message.
bracket :: (HasCallStack, MonadMask m) => m a -> (a -> m c) -> (a -> m b) -> m b #
Generalized abstracted pattern of safe resource acquisition and release
in the face of errors. The first action "acquires" some value, which
is "released" by the second action at the end. The third action "uses"
the value and its result is the result of the bracket.
If an error is thrown during the use, the release still happens before the error is rethrown.
Note that this is essentially a type-specialized version of
generalBracket. This function has a more common signature (matching the
signature from Control.Exception), and is often more convenient to use. By
contrast, generalBracket is more expressive, allowing us to implement
other functions like bracketOnError.
for :: (Traversable t, Applicative f) => t a -> (a -> f b) -> f (t b) #
class (Typeable e, Show e) => Exception e where #
Any type that you wish to throw or catch as an exception must be an
instance of the Exception class. The simplest case is a new exception
type directly below the root:
data MyException = ThisException | ThatException
deriving Show
instance Exception MyExceptionThe default method definitions in the Exception class do what we need
in this case. You can now throw and catch ThisException and
ThatException as exceptions:
*Main> throw ThisException `catch` \e -> putStrLn ("Caught " ++ show (e :: MyException))
Caught ThisException
In more complicated examples, you may wish to define a whole hierarchy of exceptions:
---------------------------------------------------------------------
-- Make the root exception type for all the exceptions in a compiler
data SomeCompilerException = forall e . Exception e => SomeCompilerException e
instance Show SomeCompilerException where
show (SomeCompilerException e) = show e
instance Exception SomeCompilerException
compilerExceptionToException :: Exception e => e -> SomeException
compilerExceptionToException = toException . SomeCompilerException
compilerExceptionFromException :: Exception e => SomeException -> Maybe e
compilerExceptionFromException x = do
SomeCompilerException a <- fromException x
cast a
---------------------------------------------------------------------
-- Make a subhierarchy for exceptions in the frontend of the compiler
data SomeFrontendException = forall e . Exception e => SomeFrontendException e
instance Show SomeFrontendException where
show (SomeFrontendException e) = show e
instance Exception SomeFrontendException where
toException = compilerExceptionToException
fromException = compilerExceptionFromException
frontendExceptionToException :: Exception e => e -> SomeException
frontendExceptionToException = toException . SomeFrontendException
frontendExceptionFromException :: Exception e => SomeException -> Maybe e
frontendExceptionFromException x = do
SomeFrontendException a <- fromException x
cast a
---------------------------------------------------------------------
-- Make an exception type for a particular frontend compiler exception
data MismatchedParentheses = MismatchedParentheses
deriving Show
instance Exception MismatchedParentheses where
toException = frontendExceptionToException
fromException = frontendExceptionFromExceptionWe can now catch a MismatchedParentheses exception as
MismatchedParentheses, SomeFrontendException or
SomeCompilerException, but not other types, e.g. IOException:
*Main> throw MismatchedParentheses `catch` \e -> putStrLn ("Caught " ++ show (e :: MismatchedParentheses))
Caught MismatchedParentheses
*Main> throw MismatchedParentheses `catch` \e -> putStrLn ("Caught " ++ show (e :: SomeFrontendException))
Caught MismatchedParentheses
*Main> throw MismatchedParentheses `catch` \e -> putStrLn ("Caught " ++ show (e :: SomeCompilerException))
Caught MismatchedParentheses
*Main> throw MismatchedParentheses `catch` \e -> putStrLn ("Caught " ++ show (e :: IOException))
*** Exception: MismatchedParentheses
Minimal complete definition
Nothing
Methods
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 AesonException | |
Defined in Data.Aeson.Types.Internal Methods toException :: AesonException -> SomeException # | |
| Exception AsyncCancelled | |
Defined in Control.Concurrent.Async.Internal Methods toException :: AsyncCancelled -> SomeException # | |
| Exception ExceptionInLinkedThread | |
Defined in Control.Concurrent.Async.Internal | |
| Exception NestedAtomically | Since: base-4.0 |
Defined in Control.Exception.Base Methods toException :: NestedAtomically -> SomeException # | |
| Exception NoMatchingContinuationPrompt | Since: base-4.18 |
Defined in Control.Exception.Base | |
| Exception NoMethodError | Since: base-4.0 |
Defined in Control.Exception.Base Methods toException :: NoMethodError -> SomeException # fromException :: SomeException -> Maybe NoMethodError # displayException :: NoMethodError -> String # | |
| Exception NonTermination | Since: base-4.0 |
Defined in Control.Exception.Base Methods toException :: NonTermination -> SomeException # | |
| Exception PatternMatchFail | Since: base-4.0 |
Defined in Control.Exception.Base Methods toException :: PatternMatchFail -> SomeException # | |
| Exception RecConError | Since: base-4.0 |
Defined in Control.Exception.Base Methods toException :: RecConError -> SomeException # fromException :: SomeException -> Maybe RecConError # displayException :: RecConError -> String # | |
| Exception RecSelError | Since: base-4.0 |
Defined in Control.Exception.Base Methods toException :: RecSelError -> SomeException # fromException :: SomeException -> Maybe RecSelError # displayException :: RecSelError -> String # | |
| Exception RecUpdError | Since: base-4.0 |
Defined in Control.Exception.Base Methods toException :: RecUpdError -> SomeException # fromException :: SomeException -> Maybe RecUpdError # displayException :: RecUpdError -> String # | |
| Exception TypeError | Since: base-4.9.0.0 |
Defined in Control.Exception.Base Methods toException :: TypeError -> SomeException # fromException :: SomeException -> Maybe TypeError # displayException :: TypeError -> String # | |
| Exception Dynamic | Since: base-4.0.0.0 |
Defined in Data.Dynamic Methods toException :: Dynamic -> SomeException # fromException :: SomeException -> Maybe Dynamic # displayException :: Dynamic -> String # | |
| Exception Void | Since: base-4.8.0.0 |
Defined in GHC.Exception.Type Methods toException :: Void -> SomeException # fromException :: SomeException -> Maybe Void # displayException :: Void -> String # | |
| Exception ErrorCall | Since: base-4.0.0.0 |
Defined in GHC.Exception Methods toException :: ErrorCall -> SomeException # fromException :: SomeException -> Maybe ErrorCall # displayException :: ErrorCall -> String # | |
| Exception ArithException | Since: base-4.0.0.0 |
Defined in GHC.Exception.Type Methods toException :: ArithException -> SomeException # | |
| Exception SomeException | Since: base-3.0 |
Defined in GHC.Exception.Type Methods toException :: SomeException -> SomeException # fromException :: SomeException -> Maybe SomeException # displayException :: SomeException -> String # | |
| Exception AllocationLimitExceeded | Since: base-4.8.0.0 |
Defined in GHC.IO.Exception | |
| Exception ArrayException | Since: base-4.1.0.0 |
Defined in GHC.IO.Exception Methods toException :: ArrayException -> SomeException # | |
| Exception AssertionFailed | Since: base-4.1.0.0 |
Defined in GHC.IO.Exception Methods toException :: AssertionFailed -> SomeException # | |
| Exception AsyncException | Since: base-4.7.0.0 |
Defined in GHC.IO.Exception Methods toException :: AsyncException -> SomeException # | |
| Exception BlockedIndefinitelyOnMVar | Since: base-4.1.0.0 |
Defined in GHC.IO.Exception | |
| Exception BlockedIndefinitelyOnSTM | Since: base-4.1.0.0 |
Defined in GHC.IO.Exception | |
| Exception CompactionFailed | Since: base-4.10.0.0 |
Defined in GHC.IO.Exception Methods toException :: CompactionFailed -> SomeException # | |
| Exception Deadlock | Since: base-4.1.0.0 |
Defined in GHC.IO.Exception Methods toException :: Deadlock -> SomeException # fromException :: SomeException -> Maybe Deadlock # displayException :: Deadlock -> String # | |
| Exception ExitCode | Since: base-4.1.0.0 |
Defined in GHC.IO.Exception Methods toException :: ExitCode -> SomeException # fromException :: SomeException -> Maybe ExitCode # displayException :: ExitCode -> String # | |
| Exception FixIOException | Since: base-4.11.0.0 |
Defined in GHC.IO.Exception Methods toException :: FixIOException -> SomeException # | |
| Exception IOException | Since: base-4.1.0.0 |
Defined in GHC.IO.Exception Methods toException :: IOException -> SomeException # fromException :: SomeException -> Maybe IOException # displayException :: IOException -> String # | |
| Exception SomeAsyncException | Since: base-4.7.0.0 |
Defined in GHC.IO.Exception Methods toException :: SomeAsyncException -> SomeException # fromException :: SomeException -> Maybe SomeAsyncException # | |
| Exception IOPortException | |
Defined in GHC.IOPort Methods toException :: IOPortException -> SomeException # fromException :: SomeException -> Maybe IOPortException # displayException :: IOPortException -> String # | |
| Exception Timeout | Since: base-4.7.0.0 |
Defined in System.Timeout Methods toException :: Timeout -> SomeException # fromException :: SomeException -> Maybe Timeout # displayException :: Timeout -> String # | |
| Exception SizeOverflowException | |
Defined in Data.ByteString.Internal.Type | |
| Exception ClientError | |
Defined in DBus.Client Methods toException :: ClientError -> SomeException # fromException :: SomeException -> Maybe ClientError # displayException :: ClientError -> String # | |
| Exception MethodExc | |
Defined in DBus.Client Methods toException :: MethodExc -> SomeException # fromException :: SomeException -> Maybe MethodExc # displayException :: MethodExc -> String # | |
| Exception SigParseError | |
Defined in DBus.Internal.Types Methods toException :: SigParseError -> SomeException # fromException :: SomeException -> Maybe SigParseError # displayException :: SigParseError -> String # | |
| Exception SocketError | |
Defined in DBus.Socket Methods toException :: SocketError -> SomeException # fromException :: SomeException -> Maybe SocketError # displayException :: SocketError -> String # | |
| Exception TransportError | |
Defined in DBus.Transport Methods toException :: TransportError -> SomeException # | |
| Exception InvalidPosException | |
Defined in Text.Megaparsec.Pos Methods toException :: InvalidPosException -> SomeException # fromException :: SomeException -> Maybe InvalidPosException # | |
| Exception NullError | |
Defined in Data.NonNull Methods toException :: NullError -> SomeException # fromException :: SomeException -> Maybe NullError # displayException :: NullError -> String # | |
| Exception InvalidAccess | |
Defined in Control.Monad.Trans.Resource.Internal Methods toException :: InvalidAccess -> SomeException # fromException :: SomeException -> Maybe InvalidAccess # displayException :: InvalidAccess -> String # | |
| Exception ResourceCleanupException | |
| Exception AsyncExceptionWrapper | |
Defined in Control.Exception.Safe | |
| Exception StringException | |
Defined in Control.Exception.Safe Methods toException :: StringException -> SomeException # | |
| Exception SyncExceptionWrapper | |
Defined in Control.Exception.Safe Methods toException :: SyncExceptionWrapper -> SomeException # fromException :: SomeException -> Maybe SyncExceptionWrapper # | |
| Exception CyclicKeyError Source # | |
Defined in Shrun.Configuration.Legend Methods toException :: CyclicKeyError -> SomeException # | |
| Exception DuplicateKeyError Source # | |
Defined in Shrun.Configuration.Legend Methods toException :: DuplicateKeyError -> SomeException # | |
| Exception NotifyException Source # | |
Defined in Shrun.Notify.MonadNotify Methods toException :: NotifyException -> SomeException # | |
| Exception LinuxNotifySystemMismatch Source # | |
Defined in Shrun.Notify.Types | |
| Exception OsxNotifySystemMismatch Source # | |
Defined in Shrun.Notify.Types | |
| Exception UnicodeException | |
Defined in Data.Text.Encoding.Error Methods toException :: UnicodeException -> SomeException # | |
| Exception TOMLError | |
Defined in TOML.Error Methods toException :: TOMLError -> SomeException # fromException :: SomeException -> Maybe TOMLError # displayException :: TOMLError -> String # | |
| Exception ByteStringOutputException | |
Defined in System.Process.Typed.Internal | |
| Exception ExitCodeException | |
Defined in System.Process.Typed.Internal Methods toException :: ExitCodeException -> SomeException # | |
| Exception ConcException | |
Defined in UnliftIO.Internals.Async Methods toException :: ConcException -> SomeException # fromException :: SomeException -> Maybe ConcException # displayException :: ConcException -> String # | |
| Exception e => Exception (ExceptionCS e) | Since: effects-exceptions-0.1 |
Defined in Effects.Exception.Annotation.CallStack.Legacy Methods toException :: ExceptionCS e -> SomeException # fromException :: SomeException -> Maybe (ExceptionCS e) # displayException :: ExceptionCS e -> String # | |
| (Show s, Show (Token s), Show e, ShowErrorComponent e, VisualStream s, Typeable s, Typeable e) => Exception (ParseError s e) | |
Defined in Text.Megaparsec.Error Methods toException :: ParseError s e -> SomeException # fromException :: SomeException -> Maybe (ParseError s e) # displayException :: ParseError s e -> String # | |
| (Show s, Show (Token s), Show e, ShowErrorComponent e, VisualStream s, TraversableStream s, Typeable s, Typeable e) => Exception (ParseErrorBundle s e) | |
Defined in Text.Megaparsec.Error Methods toException :: ParseErrorBundle s e -> SomeException # fromException :: SomeException -> Maybe (ParseErrorBundle s e) # displayException :: ParseErrorBundle s e -> String # | |
forever :: Applicative f => f a -> f b #
Repeat an action indefinitely.
Examples
A common use of forever is to process input from network sockets,
Handles, and channels
(e.g. MVar and
Chan).
For example, here is how we might implement an echo
server, using
forever both to listen for client connections on a network socket
and to echo client input on client connection handles:
echoServer :: Socket -> IO () echoServer socket =forever$ do client <- accept socketforkFinally(echo client) (\_ -> hClose client) where echo :: Handle -> IO () echo client =forever$ hGetLine client >>= hPutStrLn client
Note that "forever" isn't necessarily non-terminating.
If the action is in a MonadPlusforevermzero, effectively short-circuiting its caller.
class Monad m => MonadHandleWriter (m :: Type -> Type) where Source #
Represents handle writer effects.
Since: effects-fs-0.1
Minimal complete definition
openBinaryFile, withBinaryFile, hClose, hFlush, hSetFileSize, hSetBuffering, hSeek, hTell, hSetEcho, hPut, hPutNonBlocking
Methods
openBinaryFile :: OsPath -> IOMode -> m Handle Source #
Lifted openBinaryFileIO.
Since: effects-fs-0.1
hClose :: Handle -> m () Source #
Lifted hClose.
Since: effects-fs-0.1
hFlush :: Handle -> m () Source #
Lifted hFlush.
Since: effects-fs-0.1
Instances
| MonadHandleWriter IO | Since: effects-fs-0.1 |
Defined in Effects.FileSystem.HandleWriter Methods openBinaryFile :: OsPath -> IOMode -> IO Handle Source # withBinaryFile :: HasCallStack => OsPath -> IOMode -> (Handle -> IO a) -> IO a Source # hClose :: Handle -> IO () Source # hFlush :: Handle -> IO () Source # hSetFileSize :: Handle -> Integer -> IO () Source # hSetBuffering :: Handle -> BufferMode -> IO () Source # hSeek :: Handle -> SeekMode -> Integer -> IO () Source # hTell :: Handle -> IO Integer Source # hSetEcho :: Handle -> Bool -> IO () Source # hPut :: Handle -> ByteString -> IO () Source # hPutNonBlocking :: Handle -> ByteString -> IO ByteString Source # | |
| MonadHandleWriter m => MonadHandleWriter (ShellT env m) Source # | |
Defined in Shrun.ShellT Methods openBinaryFile :: OsPath -> IOMode -> ShellT env m Handle Source # withBinaryFile :: HasCallStack => OsPath -> IOMode -> (Handle -> ShellT env m a) -> ShellT env m a Source # hClose :: Handle -> ShellT env m () Source # hFlush :: Handle -> ShellT env m () Source # hSetFileSize :: Handle -> Integer -> ShellT env m () Source # hSetBuffering :: Handle -> BufferMode -> ShellT env m () Source # hSeek :: Handle -> SeekMode -> Integer -> ShellT env m () Source # hTell :: Handle -> ShellT env m Integer Source # hSetEcho :: Handle -> Bool -> ShellT env m () Source # hPut :: Handle -> ByteString -> ShellT env m () Source # hPutNonBlocking :: Handle -> ByteString -> ShellT env m ByteString Source # | |
| MonadHandleWriter m => MonadHandleWriter (ReaderT env m) | Since: effects-fs-0.1 |
Defined in Effects.FileSystem.HandleWriter Methods openBinaryFile :: OsPath -> IOMode -> ReaderT env m Handle Source # withBinaryFile :: HasCallStack => OsPath -> IOMode -> (Handle -> ReaderT env m a) -> ReaderT env m a Source # hClose :: Handle -> ReaderT env m () Source # hFlush :: Handle -> ReaderT env m () Source # hSetFileSize :: Handle -> Integer -> ReaderT env m () Source # hSetBuffering :: Handle -> BufferMode -> ReaderT env m () Source # hSeek :: Handle -> SeekMode -> Integer -> ReaderT env m () Source # hTell :: Handle -> ReaderT env m Integer Source # hSetEcho :: Handle -> Bool -> ReaderT env m () Source # hPut :: Handle -> ByteString -> ReaderT env m () Source # hPutNonBlocking :: Handle -> ByteString -> ReaderT env m ByteString Source # | |
threadDelay :: Int -> IO () #
Suspends the current thread for a given number of microseconds (GHC only).
There is no guarantee that the thread will be rescheduled promptly when the delay has expired, but the thread will never continue to run earlier than specified.
Be careful not to exceed maxBound :: Int, which on 32-bit machines is only
2147483647 μs, less than 36 minutes.
Consider using Control.Concurrent.Thread.Delay.delay from unbounded-delays package.
class MonadCatch m => MonadMask (m :: Type -> Type) where #
A class for monads which provide for the ability to account for all possible exit points from a computation, and to mask asynchronous exceptions. Continuation-based monads are invalid instances of this class.
Instances should ensure that, in the following code:
fg = f `finally` g
The action g is called regardless of what occurs within f, including
async exceptions. Some monads allow f to abort the computation via other
effects than throwing an exception. For simplicity, we will consider aborting
and throwing an exception to be two forms of "throwing an error".
If f and g both throw an error, the error thrown by fg depends on which
errors we're talking about. In a monad transformer stack, the deeper layers
override the effects of the inner layers; for example, ExceptT e1 (Except
e2) a represents a value of type Either e2 (Either e1 a), so throwing both
an e1 and an e2 will result in Left e2. If f and g both throw an
error from the same layer, instances should ensure that the error from g
wins.
Effects other than throwing an error are also overridden by the deeper layers.
For example, StateT s Maybe a represents a value of type s -> Maybe (a,
s), so if an error thrown from f causes this function to return Nothing,
any changes to the state which f also performed will be erased. As a
result, g will see the state as it was before f. Once g completes,
f's error will be rethrown, so g' state changes will be erased as well.
This is the normal interaction between effects in a monad transformer stack.
By contrast, lifted-base's
version of finally always discards all of g's non-IO effects, and g
never sees any of f's non-IO effects, regardless of the layer ordering and
regardless of whether f throws an error. This is not the result of
interacting effects, but a consequence of MonadBaseControl's approach.
Minimal complete definition
Methods
mask :: HasCallStack => ((forall a. m a -> m a) -> m b) -> m b #
Runs an action with asynchronous exceptions disabled. The action is
provided a method for restoring the async. environment to what it was
at the mask call. See Control.Exception's mask.
Instances
| MonadMask IO | |
Defined in Control.Monad.Catch Methods mask :: HasCallStack => ((forall a. IO a -> IO a) -> IO b) -> IO b # uninterruptibleMask :: HasCallStack => ((forall a. IO a -> IO a) -> IO b) -> IO b # generalBracket :: HasCallStack => IO a -> (a -> ExitCase b -> IO c) -> (a -> IO b) -> IO (b, c) # | |
| e ~ SomeException => MonadMask (Either e) | Since: exceptions-0.8.3 |
Defined in Control.Monad.Catch Methods mask :: HasCallStack => ((forall a. Either e a -> Either e a) -> Either e b) -> Either e b # uninterruptibleMask :: HasCallStack => ((forall a. Either e a -> Either e a) -> Either e b) -> Either e b # generalBracket :: HasCallStack => Either e a -> (a -> ExitCase b -> Either e c) -> (a -> Either e b) -> Either e (b, c) # | |
| MonadMask m => MonadMask (ResourceT m) | |
Defined in Control.Monad.Trans.Resource.Internal Methods mask :: HasCallStack => ((forall a. ResourceT m a -> ResourceT m a) -> ResourceT m b) -> ResourceT m b # uninterruptibleMask :: HasCallStack => ((forall a. ResourceT m a -> ResourceT m a) -> ResourceT m b) -> ResourceT m b # generalBracket :: HasCallStack => ResourceT m a -> (a -> ExitCase b -> ResourceT m c) -> (a -> ResourceT m b) -> ResourceT m (b, c) # | |
| MonadMask m => MonadMask (MaybeT m) | Since: exceptions-0.10.0 |
Defined in Control.Monad.Catch Methods mask :: HasCallStack => ((forall a. MaybeT m a -> MaybeT m a) -> MaybeT m b) -> MaybeT m b # uninterruptibleMask :: HasCallStack => ((forall a. MaybeT m a -> MaybeT m a) -> MaybeT m b) -> MaybeT m b # generalBracket :: HasCallStack => MaybeT m a -> (a -> ExitCase b -> MaybeT m c) -> (a -> MaybeT m b) -> MaybeT m (b, c) # | |
| MonadMask m => MonadMask (ShellT env m) Source # | |
Defined in Shrun.ShellT Methods mask :: HasCallStack => ((forall a. ShellT env m a -> ShellT env m a) -> ShellT env m b) -> ShellT env m b # uninterruptibleMask :: HasCallStack => ((forall a. ShellT env m a -> ShellT env m a) -> ShellT env m b) -> ShellT env m b # generalBracket :: HasCallStack => ShellT env m a -> (a -> ExitCase b -> ShellT env m c) -> (a -> ShellT env m b) -> ShellT env m (b, c) # | |
| MonadMask m => MonadMask (ExceptT e m) | Since: exceptions-0.9.0 |
Defined in Control.Monad.Catch Methods mask :: HasCallStack => ((forall a. ExceptT e m a -> ExceptT e m a) -> ExceptT e m b) -> ExceptT e m b # uninterruptibleMask :: HasCallStack => ((forall a. ExceptT e m a -> ExceptT e m a) -> ExceptT e m b) -> ExceptT e m b # generalBracket :: HasCallStack => ExceptT e m a -> (a -> ExitCase b -> ExceptT e m c) -> (a -> ExceptT e m b) -> ExceptT e m (b, c) # | |
| MonadMask m => MonadMask (IdentityT m) | |
Defined in Control.Monad.Catch Methods mask :: HasCallStack => ((forall a. IdentityT m a -> IdentityT m a) -> IdentityT m b) -> IdentityT m b # uninterruptibleMask :: HasCallStack => ((forall a. IdentityT m a -> IdentityT m a) -> IdentityT m b) -> IdentityT m b # generalBracket :: HasCallStack => IdentityT m a -> (a -> ExitCase b -> IdentityT m c) -> (a -> IdentityT m b) -> IdentityT m (b, c) # | |
| MonadMask m => MonadMask (ReaderT r m) | |
Defined in Control.Monad.Catch Methods mask :: HasCallStack => ((forall a. ReaderT r m a -> ReaderT r m a) -> ReaderT r m b) -> ReaderT r m b # uninterruptibleMask :: HasCallStack => ((forall a. ReaderT r m a -> ReaderT r m a) -> ReaderT r m b) -> ReaderT r m b # generalBracket :: HasCallStack => ReaderT r m a -> (a -> ExitCase b -> ReaderT r m c) -> (a -> ReaderT r m b) -> ReaderT r m (b, c) # | |
| MonadMask m => MonadMask (StateT s m) | |
Defined in Control.Monad.Catch Methods mask :: HasCallStack => ((forall a. StateT s m a -> StateT s m a) -> StateT s m b) -> StateT s m b # uninterruptibleMask :: HasCallStack => ((forall a. StateT s m a -> StateT s m a) -> StateT s m b) -> StateT s m b # generalBracket :: HasCallStack => StateT s m a -> (a -> ExitCase b -> StateT s m c) -> (a -> StateT s m b) -> StateT s m (b, c) # | |
| MonadMask m => MonadMask (StateT s m) | |
Defined in Control.Monad.Catch Methods mask :: HasCallStack => ((forall a. StateT s m a -> StateT s m a) -> StateT s m b) -> StateT s m b # uninterruptibleMask :: HasCallStack => ((forall a. StateT s m a -> StateT s m a) -> StateT s m b) -> StateT s m b # generalBracket :: HasCallStack => StateT s m a -> (a -> ExitCase b -> StateT s m c) -> (a -> StateT s m b) -> StateT s m (b, c) # | |
| (MonadMask m, Monoid w) => MonadMask (WriterT w m) | |
Defined in Control.Monad.Catch Methods mask :: HasCallStack => ((forall a. WriterT w m a -> WriterT w m a) -> WriterT w m b) -> WriterT w m b # uninterruptibleMask :: HasCallStack => ((forall a. WriterT w m a -> WriterT w m a) -> WriterT w m b) -> WriterT w m b # generalBracket :: HasCallStack => WriterT w m a -> (a -> ExitCase b -> WriterT w m c) -> (a -> WriterT w m b) -> WriterT w m (b, c) # | |
| (MonadMask m, Monoid w) => MonadMask (WriterT w m) | |
Defined in Control.Monad.Catch Methods mask :: HasCallStack => ((forall a. WriterT w m a -> WriterT w m a) -> WriterT w m b) -> WriterT w m b # uninterruptibleMask :: HasCallStack => ((forall a. WriterT w m a -> WriterT w m a) -> WriterT w m b) -> WriterT w m b # generalBracket :: HasCallStack => WriterT w m a -> (a -> ExitCase b -> WriterT w m c) -> (a -> WriterT w m b) -> WriterT w m (b, c) # | |
| (MonadMask m, Monoid w) => MonadMask (RWST r w s m) | |
Defined in Control.Monad.Catch Methods mask :: HasCallStack => ((forall a. RWST r w s m a -> RWST r w s m a) -> RWST r w s m b) -> RWST r w s m b # uninterruptibleMask :: HasCallStack => ((forall a. RWST r w s m a -> RWST r w s m a) -> RWST r w s m b) -> RWST r w s m b # generalBracket :: HasCallStack => RWST r w s m a -> (a -> ExitCase b -> RWST r w s m c) -> (a -> RWST r w s m b) -> RWST r w s m (b, c) # | |
| (MonadMask m, Monoid w) => MonadMask (RWST r w s m) | |
Defined in Control.Monad.Catch Methods mask :: HasCallStack => ((forall a. RWST r w s m a -> RWST r w s m a) -> RWST r w s m b) -> RWST r w s m b # uninterruptibleMask :: HasCallStack => ((forall a. RWST r w s m a -> RWST r w s m a) -> RWST r w s m b) -> RWST r w s m b # generalBracket :: HasCallStack => RWST r w s m a -> (a -> ExitCase b -> RWST r w s m c) -> (a -> RWST r w s m b) -> RWST r w s m (b, c) # | |
try :: (HasCallStack, MonadCatch m, Exception e) => m a -> m (Either e a) Source #
Same as upstream try, but will not catch asynchronous
exceptions
Since: safe-exceptions-0.1.0.0
class Monad m => MonadTerminal (m :: Type -> Type) where Source #
Represents a terminal.
Since: effects-terminal-0.1
Minimal complete definition
putStr, putBinary, getChar, getLine, getContents', getTerminalSize, supportsPretty
Methods
putStr :: String -> m () Source #
Lifted putStr.
Since: effects-terminal-0.1
putStrLn :: String -> m () Source #
Lifted putStrLn.
Since: effects-terminal-0.1
Instances
| MonadTerminal IO | Since: effects-terminal-0.1 |
Defined in Effects.System.Terminal | |
| MonadTerminal m => MonadTerminal (ReaderT e m) | Since: effects-terminal-0.1 |
Defined in Effects.System.Terminal Methods putStr :: String -> ReaderT e m () Source # putStrLn :: String -> ReaderT e m () Source # putBinary :: ByteString -> ReaderT e m () Source # getChar :: ReaderT e m Char Source # getLine :: ReaderT e m String Source # getContents' :: ReaderT e m String Source # getTerminalSize :: ReaderT e m (Window Natural) Source # supportsPretty :: ReaderT e m Bool Source # | |
traverse_ :: (Foldable t, Applicative f) => (a -> f b) -> t a -> f () #
Map each element of a structure to an Applicative action, evaluate these
actions from left to right, and ignore the results. For a version that
doesn't ignore the results see traverse.
traverse_ is just like mapM_, but generalised to Applicative actions.
Examples
Basic usage:
>>>traverse_ print ["Hello", "world", "!"]"Hello" "world" "!"
for_ :: (Foldable t, Applicative f) => t a -> (a -> f b) -> f () #
for_ is traverse_ with its arguments flipped. For a version
that doesn't ignore the results see for. This
is forM_ generalised to Applicative actions.
for_ is just like forM_, but generalised to Applicative actions.
Examples
Basic usage:
>>>for_ [1..4] print1 2 3 4
const x y always evaluates to x, ignoring its second argument.
const x = \_ -> x
This function might seem useless at first glance, but it can be very useful in a higher order context.
Examples
>>>const 42 "hello"42
>>>map (const 42) [0..3][42,42,42,42]
zip :: [a] -> [b] -> [(a, b)] #
\(\mathcal{O}(\min(m,n))\). zip takes two lists and returns a list of
corresponding pairs.
zip is right-lazy:
>>>zip [] undefined[]>>>zip undefined []*** Exception: Prelude.undefined ...
zip is capable of list fusion, but it is restricted to its
first list argument and its resulting list.
Examples
>>>zip [1, 2, 3] ['a', 'b', 'c'][(1,'a'),(2,'b'),(3,'c')]
If one input list is shorter than the other, excess elements of the longer list are discarded, even if one of the lists is infinite:
>>>zip [1] ['a', 'b'][(1,'a')]
>>>zip [1, 2] ['a'][(1,'a')]
>>>zip [] [1..][]
>>>zip [1..] [][]
print :: Show a => a -> IO () #
The print function outputs a value of any printable type to the
standard output device.
Printable types are those that are instances of class Show; print
converts values to strings for output using the show operation and
adds a newline.
For example, a program to print the first 20 integers and their powers of 2 could be written as:
main = print ([(n, 2^n) | n <- [0..19]])
getField :: DecodeTOML a => Text -> Decoder a Source #
Decode a field in a TOML Value.
Equivalent to getFields with a single-element list.
a = 1
b = asdf
-- MyConfig 1 "asdf" MyConfig <$> getField "a" <*> getField "b"
type HasCallStack = ?callStack :: CallStack #
Request a CallStack.
NOTE: The implicit parameter ?callStack :: CallStack is an
implementation detail and should not be considered part of the
CallStack API, we may decide to change the implementation in the
future.
Since: base-4.9.0.0
data SomeException #
The SomeException type is the root of the exception type hierarchy.
When an exception of type e is thrown, behind the scenes it is
encapsulated in a SomeException.
Instances
| Exception SomeException | Since: base-3.0 |
Defined in GHC.Exception.Type Methods toException :: SomeException -> SomeException # fromException :: SomeException -> Maybe SomeException # displayException :: SomeException -> String # | |
| Show SomeException | Since: base-3.0 |
Defined in GHC.Exception.Type Methods showsPrec :: Int -> SomeException -> ShowS # show :: SomeException -> String # showList :: [SomeException] -> ShowS # | |
undefined :: HasCallStack => a #
(<**>) :: Applicative f => f a -> f (a -> b) -> f b infixl 4 #
(=<<) :: Monad m => (a -> m b) -> m a -> m b infixr 1 #
Same as >>=, but with the arguments interchanged.
(.) :: (b -> c) -> (a -> b) -> a -> c infixr 9 #
Right to left function composition.
(f . g) x = f (g x)
f . id = f = id . f
Examples
>>>map ((*2) . length) [[], [0, 1, 2], [0]][0,6,2]
>>>foldr (.) id [(+1), (*3), (^3)] 225
>>>let (...) = (.).(.) in ((*2)...(+)) 5 1030
flip :: (a -> b -> c) -> b -> a -> c #
flip ff.
flip f x y = f y x
flip . flip = id
Examples
>>>flip (++) "hello" "world""worldhello"
>>>let (.>) = flip (.) in (+1) .> show $ 5"6"
maybe :: b -> (a -> b) -> Maybe a -> b #
The maybe function takes a default value, a function, and a Maybe
value. If the Maybe value is Nothing, the function returns the
default value. Otherwise, it applies the function to the value inside
the Just and returns the result.
Examples
Basic usage:
>>>maybe False odd (Just 3)True
>>>maybe False odd NothingFalse
Read an integer from a string using readMaybe. If we succeed,
return twice the integer; that is, apply (*2) to it. If instead
we fail to parse an integer, return 0 by default:
>>>import Text.Read ( readMaybe )>>>maybe 0 (*2) (readMaybe "5")10>>>maybe 0 (*2) (readMaybe "")0
Apply show to a Maybe Int. If we have Just n, we want to show
the underlying Int n. But if we have Nothing, we return the
empty string instead of (for example) "Nothing":
>>>maybe "" show (Just 5)"5">>>maybe "" show Nothing""
replicate :: Int -> a -> [a] #
replicate n x is a list of length n with x the value of
every element.
It is an instance of the more general genericReplicate,
in which n may be of any integral type.
Examples
>>>replicate 0 True[]
>>>replicate (-1) True[]
>>>replicate 4 True[True,True,True,True]
any :: Foldable t => (a -> Bool) -> t a -> Bool #
Determines whether any element of the structure satisfies the predicate.
Examples
Basic usage:
>>>any (> 3) []False
>>>any (> 3) [1,2]False
>>>any (> 3) [1,2,3,4,5]True
>>>any (> 3) [1..]True
>>>any (> 3) [0, -1..]* Hangs forever *
truncate :: (RealFrac a, Integral b) => a -> b #
truncate xx between zero and x
(%) :: forall k l m (is :: IxList) (js :: IxList) (ks :: IxList) s t u v a b. (JoinKinds k l m, AppendIndices is js ks) => Optic k is s t u v -> Optic l js u v a b -> Optic m ks s t a b infixl 9 Source #
Compose two optics of compatible flavours.
Returns an optic of the appropriate supertype. If either or both optics are indexed, the composition preserves all the indices.
(&) :: 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 $.
This is a version of flip idid is specialized from a -> a to (a -> b) -> (a -> b)
which by the associativity of (->) is (a -> b) -> a -> b.
flipping this yields a -> (a -> b) -> b which is the type signature of &
Examples
>>>5 & (+1) & show"6"
>>>sqrt $ [1 / n^2 | n <- [1..1000]] & sum & (*6)3.1406380562059946
Since: base-4.8.0.0
Shared memory locations that support atomic memory transactions.
See openFile
Constructors
| WriteMode | |
| AppendMode |
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.
catchAny :: (HasCallStack, MonadCatch m) => m a -> (SomeException -> m a) -> m a Source #
catch specialized to catch all synchronous exception
Since: safe-exceptions-0.1.0.0
A mutable variable in the IO monad.
>>>import Data.IORef>>>r <- newIORef 0>>>readIORef r0>>>writeIORef r 1>>>readIORef r1>>>atomicWriteIORef r 2>>>readIORef r2>>>modifyIORef' r (+ 1)>>>readIORef r3>>>atomicModifyIORef' r (\a -> (a + 1, ()))>>>readIORef r4
Instances
| NFData1 IORef | Since: deepseq-1.4.3.0 |
Defined in Control.DeepSeq | |
| NFData (IORef a) | NOTE: Only strict in the reference and not the referenced value. Since: deepseq-1.4.2.0 |
Defined in Control.DeepSeq | |
| Eq (IORef a) | Pointer equality. Since: base-4.0.0.0 |
class Monad m => MonadIORef (m :: Type -> Type) where Source #
IORef effect.
Since: effects-ioref-0.1
Minimal complete definition
newIORef, readIORef, writeIORef, atomicWriteIORef, modifyIORef', atomicModifyIORef'
Methods
newIORef :: HasCallStack => a -> m (IORef a) Source #
Lifted newIORef.
Since: effects-ioref-0.1
readIORef :: HasCallStack => IORef a -> m a Source #
Lifted readIORef.
Since: effects-ioref-0.1
writeIORef :: HasCallStack => IORef a -> a -> m () Source #
Lifted writeIORef.
Since: effects-ioref-0.1
modifyIORef' :: HasCallStack => IORef a -> (a -> a) -> m () Source #
Lifted modifyIORef'.
Since: effects-ioref-0.1
atomicModifyIORef' :: HasCallStack => IORef a -> (a -> (a, b)) -> m b Source #
Lifted atomicModifyIORef'.
Since: effects-ioref-0.1
Instances
| MonadIORef IO | Since: effects-ioref-0.1 |
Defined in Effects.IORef Methods newIORef :: HasCallStack => a -> IO (IORef a) Source # readIORef :: HasCallStack => IORef a -> IO a Source # writeIORef :: HasCallStack => IORef a -> a -> IO () Source # atomicWriteIORef :: HasCallStack => IORef a -> a -> IO () Source # modifyIORef' :: HasCallStack => IORef a -> (a -> a) -> IO () Source # atomicModifyIORef' :: HasCallStack => IORef a -> (a -> (a, b)) -> IO b Source # | |
| MonadIORef m => MonadIORef (ShellT env m) Source # | |
Defined in Shrun.ShellT Methods newIORef :: HasCallStack => a -> ShellT env m (IORef a) Source # readIORef :: HasCallStack => IORef a -> ShellT env m a Source # writeIORef :: HasCallStack => IORef a -> a -> ShellT env m () Source # atomicWriteIORef :: HasCallStack => IORef a -> a -> ShellT env m () Source # modifyIORef' :: HasCallStack => IORef a -> (a -> a) -> ShellT env m () Source # atomicModifyIORef' :: HasCallStack => IORef a -> (a -> (a, b)) -> ShellT env m b Source # | |
| MonadIORef m => MonadIORef (ReaderT e m) | Since: effects-ioref-0.1 |
Defined in Effects.IORef Methods newIORef :: HasCallStack => a -> ReaderT e m (IORef a) Source # readIORef :: HasCallStack => IORef a -> ReaderT e m a Source # writeIORef :: HasCallStack => IORef a -> a -> ReaderT e m () Source # atomicWriteIORef :: HasCallStack => IORef a -> a -> ReaderT e m () Source # modifyIORef' :: HasCallStack => IORef a -> (a -> a) -> ReaderT e m () Source # atomicModifyIORef' :: HasCallStack => IORef a -> (a -> (a, b)) -> ReaderT e m b Source # | |
(>=>) :: Monad m => (a -> m b) -> (b -> m c) -> a -> m c infixr 1 #
Left-to-right composition of Kleisli arrows.
'(bs ' can be understood as the >=> cs) ado expression
do b <- bs a cs b
exitFailure :: (HasCallStack, MonadThrow m) => m a Source #
The computation exitFailure is equivalent to
exitWith (ExitFailure exitfail),
where exitfail is implementation-dependent.
Since: effects-exceptions-0.1
class Monad m => MonadEnv (m :: Type -> Type) where Source #
Environment effects.
Since: effects-env-0.1
Minimal complete definition
getArgs, getProgName, executablePath, getExecutablePath, getEnv, lookupEnv, setEnv, unsetEnv, withArgs, withProgName, getEnvironment
Methods
withArgs :: HasCallStack => [String] -> m a -> m a Source #
Lifted withArgs.
Since: effects-env-0.1
Instances
| MonadEnv IO | Since: effects-env-0.1 |
Defined in Effects.System.Environment Methods getArgs :: IO [String] Source # getProgName :: IO String Source # executablePath :: Maybe (IO (Maybe FilePath)) Source # getExecutablePath :: IO FilePath Source # getEnv :: String -> IO String Source # lookupEnv :: String -> IO (Maybe String) Source # setEnv :: String -> String -> IO () Source # unsetEnv :: String -> IO () Source # withArgs :: HasCallStack => [String] -> IO a -> IO a Source # withProgName :: HasCallStack => String -> IO a -> IO a Source # | |
| MonadEnv m => MonadEnv (ReaderT env m) | Since: effects-env-0.1 |
Defined in Effects.System.Environment Methods getArgs :: ReaderT env m [String] Source # getProgName :: ReaderT env m String Source # executablePath :: Maybe (ReaderT env m (Maybe FilePath)) Source # getExecutablePath :: ReaderT env m FilePath Source # getEnv :: String -> ReaderT env m String Source # lookupEnv :: String -> ReaderT env m (Maybe String) Source # setEnv :: String -> String -> ReaderT env m () Source # unsetEnv :: String -> ReaderT env m () Source # withArgs :: HasCallStack => [String] -> ReaderT env m a -> ReaderT env m a Source # withProgName :: HasCallStack => String -> ReaderT env m a -> ReaderT env m a Source # | |
A Decoder a represents a function for decoding a TOML value to a value of type a.
Generally, you'd only need to chain the getField* functions together, like
decoder =
MyConfig
<$> getField "a"
<*> getField "b"
<*> getField "c"
or use interfaces like Monad and Alternative:
decoder = do
cfgType <- getField "type"
case cfgType of
"int" -> MyIntValue <$> (getField "int" <|> getField "integer")
"bool" -> MyBoolValue <$> getField "bool"
_ -> fail $ "Invalid type: " <> cfgType
but you can also manually implement a Decoder with makeDecoder.
Instances
Arguments
| :: MonadReader r m | |
| => (r -> a) | The selector function to apply to the environment. |
| -> m a |
Retrieves a function of the current environment.
data ConsoleRegion Source #
A handle allowing access to a region of the console.
Instances
| Eq ConsoleRegion | |
Defined in System.Console.Regions Methods (==) :: ConsoleRegion -> ConsoleRegion -> Bool # (/=) :: ConsoleRegion -> ConsoleRegion -> Bool # | |
data RegionLayout Source #
Controls how a region is laid out in the console.
Here's an annotated example of how the console layout works. Each sequence of the same letter represents a distinct region.
scrolling...... scrolling...... scrolling...... aaaaaa......... -- Linear bbbbbbbbbbbbbbb -- Linear bbb............ (expanded to multiple lines) ccccccccc...... -- Linear ddddeeeefffffff -- [InLine] fffffggggg..... (expanded to multiple lines)
Constructors
| Linear |
Instances
| Eq RegionLayout | |
Defined in System.Console.Regions | |
class MonadThrow m => MonadCatch (m :: Type -> Type) #
A class for monads which allow exceptions to be caught, in particular
exceptions which were thrown by throwM.
Instances should obey the following law:
catch (throwM e) f = f e
Note that the ability to catch an exception does not guarantee that we can
deal with all possible exit points from a computation. Some monads, such as
continuation-based stacks, allow for more than just a success/failure
strategy, and therefore catch cannot be used by those monads to properly
implement a function such as finally. For more information, see
MonadMask.
Minimal complete definition
Instances
| MonadCatch STM | |
Defined in Control.Monad.Catch | |
| MonadCatch IO | |
Defined in Control.Monad.Catch | |
| e ~ SomeException => MonadCatch (Either e) | Since: exceptions-0.8.3 |
Defined in Control.Monad.Catch | |
| MonadCatch m => MonadCatch (ResourceT m) | |
Defined in Control.Monad.Trans.Resource.Internal | |
| MonadCatch m => MonadCatch (MaybeT m) | Catches exceptions from the base monad. |
Defined in Control.Monad.Catch | |
| (Functor f, MonadCatch m) => MonadCatch (FreeT f m) | |
Defined in Control.Monad.Trans.Free | |
| MonadCatch m => MonadCatch (ShellT env m) Source # | |
Defined in Shrun.ShellT | |
| MonadCatch m => MonadCatch (ExceptT e m) | Catches exceptions from the base monad. |
Defined in Control.Monad.Catch | |
| MonadCatch m => MonadCatch (IdentityT m) | |
Defined in Control.Monad.Catch | |
| MonadCatch m => MonadCatch (ReaderT r m) | |
Defined in Control.Monad.Catch | |
| MonadCatch m => MonadCatch (StateT s m) | |
Defined in Control.Monad.Catch | |
| MonadCatch m => MonadCatch (StateT s m) | |
Defined in Control.Monad.Catch | |
| (MonadCatch m, Monoid w) => MonadCatch (WriterT w m) | |
Defined in Control.Monad.Catch | |
| (MonadCatch m, Monoid w) => MonadCatch (WriterT w m) | |
Defined in Control.Monad.Catch | |
| (MonadCatch m, Monoid w) => MonadCatch (RWST r w s m) | |
Defined in Control.Monad.Catch | |
| (MonadCatch m, Monoid w) => MonadCatch (RWST r w s m) | |
Defined in Control.Monad.Catch | |
class Monad m => MonadThrow (m :: Type -> Type) #
A class for monads in which exceptions may be thrown.
Instances should obey the following law:
throwM e >> x = throwM e
In other words, throwing an exception short-circuits the rest of the monadic computation.
Minimal complete definition
Instances
| MonadThrow STM | |
Defined in Control.Monad.Catch Methods throwM :: (HasCallStack, Exception e) => e -> STM a # | |
| MonadThrow IO | |
Defined in Control.Monad.Catch Methods throwM :: (HasCallStack, Exception e) => e -> IO a # | |
| MonadThrow Q | |
Defined in Control.Monad.Catch Methods throwM :: (HasCallStack, Exception e) => e -> Q a # | |
| MonadThrow Maybe | |
Defined in Control.Monad.Catch Methods throwM :: (HasCallStack, Exception e) => e -> Maybe a # | |
| MonadThrow [] | |
Defined in Control.Monad.Catch Methods throwM :: (HasCallStack, Exception e) => e -> [a] # | |
| e ~ SomeException => MonadThrow (Either e) | |
Defined in Control.Monad.Catch Methods throwM :: (HasCallStack, Exception e0) => e0 -> Either e a # | |
| MonadThrow (ST s) | |
Defined in Control.Monad.Catch Methods throwM :: (HasCallStack, Exception e) => e -> ST s a # | |
| MonadThrow (Render s) | |
Defined in DBus.Introspection.Render Methods throwM :: (HasCallStack, Exception e) => e -> Render s a # | |
| MonadThrow m => MonadThrow (ResourceT m) | |
Defined in Control.Monad.Trans.Resource.Internal Methods throwM :: (HasCallStack, Exception e) => e -> ResourceT m a # | |
| MonadThrow m => MonadThrow (MaybeT m) | Throws exceptions into the base monad. |
Defined in Control.Monad.Catch Methods throwM :: (HasCallStack, Exception e) => e -> MaybeT m a # | |
| (Functor f, MonadThrow m) => MonadThrow (FreeT f m) | |
Defined in Control.Monad.Trans.Free Methods throwM :: (HasCallStack, Exception e) => e -> FreeT f m a # | |
| MonadThrow m => MonadThrow (ShellT env m) Source # | |
Defined in Shrun.ShellT Methods throwM :: (HasCallStack, Exception e) => e -> ShellT env m a # | |
| MonadThrow m => MonadThrow (ExceptT e m) | Throws exceptions into the base monad. |
Defined in Control.Monad.Catch Methods throwM :: (HasCallStack, Exception e0) => e0 -> ExceptT e m a # | |
| MonadThrow m => MonadThrow (IdentityT m) | |
Defined in Control.Monad.Catch Methods throwM :: (HasCallStack, Exception e) => e -> IdentityT m a # | |
| MonadThrow m => MonadThrow (ReaderT r m) | |
Defined in Control.Monad.Catch Methods throwM :: (HasCallStack, Exception e) => e -> ReaderT r m a # | |
| MonadThrow m => MonadThrow (StateT s m) | |
Defined in Control.Monad.Catch Methods throwM :: (HasCallStack, Exception e) => e -> StateT s m a # | |
| MonadThrow m => MonadThrow (StateT s m) | |
Defined in Control.Monad.Catch Methods throwM :: (HasCallStack, Exception e) => e -> StateT s m a # | |
| (MonadThrow m, Monoid w) => MonadThrow (WriterT w m) | |
Defined in Control.Monad.Catch Methods throwM :: (HasCallStack, Exception e) => e -> WriterT w m a # | |
| (MonadThrow m, Monoid w) => MonadThrow (WriterT w m) | |
Defined in Control.Monad.Catch Methods throwM :: (HasCallStack, Exception e) => e -> WriterT w m a # | |
| MonadThrow m => MonadThrow (ConduitT i o m) | |
Defined in Data.Conduit.Internal.Conduit Methods throwM :: (HasCallStack, Exception e) => e -> ConduitT i o m a # | |
| MonadThrow m => MonadThrow (ContT r m) | |
Defined in Control.Monad.Catch Methods throwM :: (HasCallStack, Exception e) => e -> ContT r m a # | |
| (MonadThrow m, Monoid w) => MonadThrow (RWST r w s m) | |
Defined in Control.Monad.Catch Methods throwM :: (HasCallStack, Exception e) => e -> RWST r w s m a # | |
| (MonadThrow m, Monoid w) => MonadThrow (RWST r w s m) | |
Defined in Control.Monad.Catch Methods throwM :: (HasCallStack, Exception e) => e -> RWST r w s m a # | |
| MonadThrow m => MonadThrow (Pipe l i o u m) | |
Defined in Data.Conduit.Internal.Pipe Methods throwM :: (HasCallStack, Exception e) => e -> Pipe l i o u m a # | |
throwM :: (HasCallStack, MonadThrow m, Exception e) => e -> m a Source #
Synonym for throw
Since: safe-exceptions-0.1.0.0
decodeUtf8 :: ByteString -> Either UnicodeException Text Source #
Decodes a ByteString to UTF-8.
Since: effects-fs-0.1
decodeUtf8Lenient :: ByteString -> Text Source #
Leniently decodes a ByteString to UTF-8.
Since: effects-fs-0.1
data Process stdin stdout stderr Source #
A running process. The three type parameters provide the type of the standard input, standard output, and standard error streams.
To interact with a Process use the functions from the section
Interact with a process.
Since: typed-process-0.1.0.0
General-purpose finite sequences.
Bundled Patterns
| pattern (:|>) :: Seq a -> a -> Seq a infixl 5 | A bidirectional pattern synonym viewing the rear of a non-empty sequence. Since: containers-0.5.8 |
| pattern (:<|) :: a -> Seq a -> Seq a infixr 5 | A bidirectional pattern synonym viewing the front of a non-empty sequence. Since: containers-0.5.8 |
Instances
| MonadFix Seq | Since: containers-0.5.11 | ||||||||
Defined in Data.Sequence.Internal | |||||||||
| MonadZip Seq |
Since: containers-0.5.10.1 | ||||||||
| Foldable Seq | |||||||||
Defined in Data.Sequence.Internal Methods fold :: Monoid m => Seq m -> m # foldMap :: Monoid m => (a -> m) -> Seq a -> m # foldMap' :: Monoid m => (a -> m) -> Seq a -> m # foldr :: (a -> b -> b) -> b -> Seq a -> b # foldr' :: (a -> b -> b) -> b -> Seq a -> b # foldl :: (b -> a -> b) -> b -> Seq a -> b # foldl' :: (b -> a -> b) -> b -> Seq a -> b # foldr1 :: (a -> a -> a) -> Seq a -> a # foldl1 :: (a -> a -> a) -> Seq a -> a # elem :: Eq a => a -> Seq a -> Bool # maximum :: Ord a => Seq a -> a # | |||||||||
| Eq1 Seq | Since: containers-0.5.9 | ||||||||
| Ord1 Seq | Since: containers-0.5.9 | ||||||||
Defined in Data.Sequence.Internal | |||||||||
| Read1 Seq | Since: containers-0.5.9 | ||||||||
Defined in Data.Sequence.Internal | |||||||||
| Show1 Seq | Since: containers-0.5.9 | ||||||||
| Traversable Seq | |||||||||
| Alternative Seq | Since: containers-0.5.4 | ||||||||
| Applicative Seq | Since: containers-0.5.4 | ||||||||
| Functor Seq | |||||||||
| Monad Seq | |||||||||
| MonadPlus Seq | |||||||||
| UnzipWith Seq | |||||||||
Defined in Data.Sequence.Internal Methods unzipWith' :: (x -> (a, b)) -> Seq x -> (Seq a, Seq b) | |||||||||
| Hashable1 Seq | Since: hashable-1.3.4.0 | ||||||||
Defined in Data.Hashable.Class | |||||||||
| Lift a => Lift (Seq a :: Type) | Since: containers-0.6.6 | ||||||||
| Each Int (Seq a) (Seq b) a b |
| ||||||||
Defined in Optics.Each.Core | |||||||||
| Data a => Data (Seq a) | |||||||||
Defined in Data.Sequence.Internal Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Seq a -> c (Seq a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Seq a) # dataTypeOf :: Seq a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Seq a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Seq a)) # gmapT :: (forall b. Data b => b -> b) -> Seq a -> Seq a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Seq a -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Seq a -> r # gmapQ :: (forall d. Data d => d -> u) -> Seq a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Seq a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Seq a -> m (Seq a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Seq a -> m (Seq a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Seq a -> m (Seq a) # | |||||||||
| a ~ Char => IsString (Seq a) | Since: containers-0.5.7 | ||||||||
Defined in Data.Sequence.Internal Methods fromString :: String -> Seq a # | |||||||||
| Monoid (Seq a) | |||||||||
| Semigroup (Seq a) | Since: containers-0.5.7 | ||||||||
| IsList (Seq a) | |||||||||
| Read a => Read (Seq a) | |||||||||
| Show a => Show (Seq a) | |||||||||
| NFData a => NFData (Seq a) | |||||||||
Defined in Data.Sequence.Internal | |||||||||
| Eq a => Eq (Seq a) | |||||||||
| Ord a => Ord (Seq a) | |||||||||
| Hashable v => Hashable (Seq v) | Since: hashable-1.3.4.0 | ||||||||
| Ixed (Seq a) | |||||||||
Defined in Control.Lens.At | |||||||||
| Wrapped (Seq a) | |||||||||
| Ord a => Stream (Seq a) | Since: megaparsec-9.0.0 | ||||||||
Defined in Text.Megaparsec.Stream Associated Types
Methods tokenToChunk :: Proxy (Seq a) -> Token (Seq a) -> Tokens (Seq a) Source # tokensToChunk :: Proxy (Seq a) -> [Token (Seq a)] -> Tokens (Seq a) Source # chunkToTokens :: Proxy (Seq a) -> Tokens (Seq a) -> [Token (Seq a)] Source # chunkLength :: Proxy (Seq a) -> Tokens (Seq a) -> Int Source # chunkEmpty :: Proxy (Seq a) -> Tokens (Seq a) -> Bool Source # take1_ :: Seq a -> Maybe (Token (Seq a), Seq a) Source # takeN_ :: Int -> Seq a -> Maybe (Tokens (Seq a), Seq a) Source # takeWhile_ :: (Token (Seq a) -> Bool) -> Seq a -> (Tokens (Seq a), Seq a) Source # | |||||||||
| GrowingAppend (Seq a) | |||||||||
Defined in Data.MonoTraversable | |||||||||
| MonoFoldable (Seq a) | |||||||||
Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element (Seq a) -> m) -> Seq a -> m Source # ofoldr :: (Element (Seq a) -> b -> b) -> b -> Seq a -> b Source # ofoldl' :: (a0 -> Element (Seq a) -> a0) -> a0 -> Seq a -> a0 Source # otoList :: Seq a -> [Element (Seq a)] Source # oall :: (Element (Seq a) -> Bool) -> Seq a -> Bool Source # oany :: (Element (Seq a) -> Bool) -> Seq a -> Bool Source # onull :: Seq a -> Bool Source # olength :: Seq a -> Int Source # olength64 :: Seq a -> Int64 Source # ocompareLength :: Integral i => Seq a -> i -> Ordering Source # otraverse_ :: Applicative f => (Element (Seq a) -> f b) -> Seq a -> f () Source # ofor_ :: Applicative f => Seq a -> (Element (Seq a) -> f b) -> f () Source # omapM_ :: Applicative m => (Element (Seq a) -> m ()) -> Seq a -> m () Source # oforM_ :: Applicative m => Seq a -> (Element (Seq a) -> m ()) -> m () Source # ofoldlM :: Monad m => (a0 -> Element (Seq a) -> m a0) -> a0 -> Seq a -> m a0 Source # ofoldMap1Ex :: Semigroup m => (Element (Seq a) -> m) -> Seq a -> m Source # ofoldr1Ex :: (Element (Seq a) -> Element (Seq a) -> Element (Seq a)) -> Seq a -> Element (Seq a) Source # ofoldl1Ex' :: (Element (Seq a) -> Element (Seq a) -> Element (Seq a)) -> Seq a -> Element (Seq a) Source # headEx :: Seq a -> Element (Seq a) Source # lastEx :: Seq a -> Element (Seq a) Source # unsafeHead :: Seq a -> Element (Seq a) Source # unsafeLast :: Seq a -> Element (Seq a) Source # maximumByEx :: (Element (Seq a) -> Element (Seq a) -> Ordering) -> Seq a -> Element (Seq a) Source # minimumByEx :: (Element (Seq a) -> Element (Seq a) -> Ordering) -> Seq a -> Element (Seq a) Source # | |||||||||
| MonoFunctor (Seq a) | |||||||||
| MonoPointed (Seq a) | |||||||||
| MonoTraversable (Seq a) | |||||||||
| IsSequence (Seq a) | |||||||||
Defined in Data.Sequences Methods fromList :: [Element (Seq a)] -> Seq a Source # lengthIndex :: Seq a -> Index (Seq a) Source # break :: (Element (Seq a) -> Bool) -> Seq a -> (Seq a, Seq a) Source # span :: (Element (Seq a) -> Bool) -> Seq a -> (Seq a, Seq a) Source # dropWhile :: (Element (Seq a) -> Bool) -> Seq a -> Seq a Source # takeWhile :: (Element (Seq a) -> Bool) -> Seq a -> Seq a Source # splitAt :: Index (Seq a) -> Seq a -> (Seq a, Seq a) Source # unsafeSplitAt :: Index (Seq a) -> Seq a -> (Seq a, Seq a) Source # take :: Index (Seq a) -> Seq a -> Seq a Source # unsafeTake :: Index (Seq a) -> Seq a -> Seq a Source # drop :: Index (Seq a) -> Seq a -> Seq a Source # unsafeDrop :: Index (Seq a) -> Seq a -> Seq a Source # dropEnd :: Index (Seq a) -> Seq a -> Seq a Source # partition :: (Element (Seq a) -> Bool) -> Seq a -> (Seq a, Seq a) Source # uncons :: Seq a -> Maybe (Element (Seq a), Seq a) Source # unsnoc :: Seq a -> Maybe (Seq a, Element (Seq a)) Source # filter :: (Element (Seq a) -> Bool) -> Seq a -> Seq a Source # filterM :: Monad m => (Element (Seq a) -> m Bool) -> Seq a -> m (Seq a) Source # replicate :: Index (Seq a) -> Element (Seq a) -> Seq a Source # replicateM :: Monad m => Index (Seq a) -> m (Element (Seq a)) -> m (Seq a) Source # groupBy :: (Element (Seq a) -> Element (Seq a) -> Bool) -> Seq a -> [Seq a] Source # groupAllOn :: Eq b => (Element (Seq a) -> b) -> Seq a -> [Seq a] Source # subsequences :: Seq a -> [Seq a] Source # permutations :: Seq a -> [Seq a] Source # tailEx :: Seq a -> Seq a Source # tailMay :: Seq a -> Maybe (Seq a) Source # initEx :: Seq a -> Seq a Source # initMay :: Seq a -> Maybe (Seq a) Source # unsafeTail :: Seq a -> Seq a Source # unsafeInit :: Seq a -> Seq a Source # index :: Seq a -> Index (Seq a) -> Maybe (Element (Seq a)) Source # indexEx :: Seq a -> Index (Seq a) -> Element (Seq a) Source # unsafeIndex :: Seq a -> Index (Seq a) -> Element (Seq a) Source # splitWhen :: (Element (Seq a) -> Bool) -> Seq a -> [Seq a] Source # tails :: Seq a -> [Seq a] Source # | |||||||||
| SemiSequence (Seq a) | |||||||||
Defined in Data.Sequences Methods intersperse :: Element (Seq a) -> Seq a -> Seq a Source # reverse :: Seq a -> Seq a Source # find :: (Element (Seq a) -> Bool) -> Seq a -> Maybe (Element (Seq a)) Source # sortBy :: (Element (Seq a) -> Element (Seq a) -> Ordering) -> Seq a -> Seq a Source # | |||||||||
| HasNonEmpty (Seq a) | |||||||||
Defined in Data.Containers.NonEmpty | |||||||||
| Ixed (Seq a) | |||||||||
| AsEmpty (Seq a) | |||||||||
| DecodeTOML a => DecodeTOML (Seq a) | |||||||||
Defined in TOML.Decode Methods tomlDecoder :: Decoder (Seq a) Source # | |||||||||
| t ~ Seq a' => Rewrapped (Seq a) t | |||||||||
Defined in Control.Lens.Wrapped | |||||||||
| Cons (Seq a) (Seq b) a b | |||||||||
| Snoc (Seq a) (Seq b) a b | |||||||||
| type Item (Seq a) | |||||||||
Defined in Data.Sequence.Internal | |||||||||
| type Index (Seq a) | |||||||||
Defined in Control.Lens.At | |||||||||
| type IxValue (Seq a) | |||||||||
Defined in Control.Lens.At | |||||||||
| type Unwrapped (Seq a) | |||||||||
Defined in Control.Lens.Wrapped | |||||||||
| type Token (Seq a) | |||||||||
Defined in Text.Megaparsec.Stream | |||||||||
| type Tokens (Seq a) | |||||||||
Defined in Text.Megaparsec.Stream | |||||||||
| type Element (Seq a) | |||||||||
Defined in Data.MonoTraversable | |||||||||
| type Index (Seq a) | |||||||||
Defined in Data.Sequences | |||||||||
| type NE (Seq a) | |||||||||
Defined in Data.Containers.NonEmpty | |||||||||
| type Index (Seq a) | |||||||||
Defined in Optics.At.Core | |||||||||
| type IxKind (Seq a) | |||||||||
Defined in Optics.At.Core | |||||||||
| type IxValue (Seq a) | |||||||||
Defined in Optics.At.Core | |||||||||
class Monad m => MonadPathWriter (m :: Type -> Type) where Source #
Represents file-system writer effects.
Since: effects-fs-0.1
Minimal complete definition
createDirectory, createDirectoryIfMissing, removeDirectory, removeDirectoryRecursive, removePathForcibly, renameDirectory, setCurrentDirectory, withCurrentDirectory, removeFile, renameFile, renamePath, copyFile, copyFileWithMetadata, createFileLink, createDirectoryLink, removeDirectoryLink, setPermissions, copyPermissions, setAccessTime, setModificationTime
Instances
| MonadPathWriter IO | Since: effects-fs-0.1 |
Defined in Effects.FileSystem.PathWriter Methods createDirectory :: OsPath -> IO () Source # createDirectoryIfMissing :: Bool -> OsPath -> IO () Source # removeDirectory :: OsPath -> IO () Source # removeDirectoryRecursive :: OsPath -> IO () Source # removePathForcibly :: OsPath -> IO () Source # renameDirectory :: OsPath -> OsPath -> IO () Source # setCurrentDirectory :: OsPath -> IO () Source # withCurrentDirectory :: HasCallStack => OsPath -> IO a -> IO a Source # removeFile :: OsPath -> IO () Source # renameFile :: OsPath -> OsPath -> IO () Source # renamePath :: OsPath -> OsPath -> IO () Source # copyFile :: OsPath -> OsPath -> IO () Source # copyFileWithMetadata :: OsPath -> OsPath -> IO () Source # createFileLink :: OsPath -> OsPath -> IO () Source # createDirectoryLink :: OsPath -> OsPath -> IO () Source # removeDirectoryLink :: OsPath -> IO () Source # setPermissions :: OsPath -> Permissions -> IO () Source # copyPermissions :: OsPath -> OsPath -> IO () Source # | |
| MonadPathWriter m => MonadPathWriter (ShellT env m) Source # | |
Defined in Shrun.ShellT Methods createDirectory :: OsPath -> ShellT env m () Source # createDirectoryIfMissing :: Bool -> OsPath -> ShellT env m () Source # removeDirectory :: OsPath -> ShellT env m () Source # removeDirectoryRecursive :: OsPath -> ShellT env m () Source # removePathForcibly :: OsPath -> ShellT env m () Source # renameDirectory :: OsPath -> OsPath -> ShellT env m () Source # setCurrentDirectory :: OsPath -> ShellT env m () Source # withCurrentDirectory :: HasCallStack => OsPath -> ShellT env m a -> ShellT env m a Source # removeFile :: OsPath -> ShellT env m () Source # renameFile :: OsPath -> OsPath -> ShellT env m () Source # renamePath :: OsPath -> OsPath -> ShellT env m () Source # copyFile :: OsPath -> OsPath -> ShellT env m () Source # copyFileWithMetadata :: OsPath -> OsPath -> ShellT env m () Source # createFileLink :: OsPath -> OsPath -> ShellT env m () Source # createDirectoryLink :: OsPath -> OsPath -> ShellT env m () Source # removeDirectoryLink :: OsPath -> ShellT env m () Source # setPermissions :: OsPath -> Permissions -> ShellT env m () Source # copyPermissions :: OsPath -> OsPath -> ShellT env m () Source # setAccessTime :: OsPath -> UTCTime -> ShellT env m () Source # setModificationTime :: OsPath -> UTCTime -> ShellT env m () Source # | |
| MonadPathWriter m => MonadPathWriter (ReaderT env m) | Since: effects-fs-0.1 |
Defined in Effects.FileSystem.PathWriter Methods createDirectory :: OsPath -> ReaderT env m () Source # createDirectoryIfMissing :: Bool -> OsPath -> ReaderT env m () Source # removeDirectory :: OsPath -> ReaderT env m () Source # removeDirectoryRecursive :: OsPath -> ReaderT env m () Source # removePathForcibly :: OsPath -> ReaderT env m () Source # renameDirectory :: OsPath -> OsPath -> ReaderT env m () Source # setCurrentDirectory :: OsPath -> ReaderT env m () Source # withCurrentDirectory :: HasCallStack => OsPath -> ReaderT env m a -> ReaderT env m a Source # removeFile :: OsPath -> ReaderT env m () Source # renameFile :: OsPath -> OsPath -> ReaderT env m () Source # renamePath :: OsPath -> OsPath -> ReaderT env m () Source # copyFile :: OsPath -> OsPath -> ReaderT env m () Source # copyFileWithMetadata :: OsPath -> OsPath -> ReaderT env m () Source # createFileLink :: OsPath -> OsPath -> ReaderT env m () Source # createDirectoryLink :: OsPath -> OsPath -> ReaderT env m () Source # removeDirectoryLink :: OsPath -> ReaderT env m () Source # setPermissions :: OsPath -> Permissions -> ReaderT env m () Source # copyPermissions :: OsPath -> OsPath -> ReaderT env m () Source # setAccessTime :: OsPath -> UTCTime -> ReaderT env m () Source # setModificationTime :: OsPath -> UTCTime -> ReaderT env m () Source # | |
Type representing filenames/pathnames.
This type doesn't add any guarantees over OsString.
class Monad m => MonadPathReader (m :: Type -> Type) where Source #
Represents file-system reader effects.
Since: effects-fs-0.1
Minimal complete definition
listDirectory, getDirectoryContents, getCurrentDirectory, getHomeDirectory, getXdgDirectory, getXdgDirectoryList, getAppUserDataDirectory, getUserDocumentsDirectory, getTemporaryDirectory, getFileSize, canonicalizePath, makeAbsolute, makeRelativeToCurrentDirectory, doesPathExist, doesFileExist, doesDirectoryExist, findExecutable, findExecutables, findExecutablesInDirectories, findFileWith, findFilesWith, pathIsSymbolicLink, getSymbolicLinkTarget, getPermissions, getAccessTime, getModificationTime
Methods
getFileSize :: OsPath -> m Integer Source #
Lifted getFileSize.
Since: effects-fs-0.1
doesFileExist :: OsPath -> m Bool Source #
Lifted doesFileExist.
Since: effects-fs-0.1
doesDirectoryExist :: OsPath -> m Bool Source #
Lifted doesDirectoryExist.
Since: effects-fs-0.1
Instances
| MonadPathReader IO | |
Defined in Effects.FileSystem.PathReader Methods listDirectory :: OsPath -> IO [OsPath] Source # getDirectoryContents :: OsPath -> IO [OsPath] Source # getCurrentDirectory :: IO OsPath Source # getHomeDirectory :: IO OsPath Source # getXdgDirectory :: XdgDirectory -> OsPath -> IO OsPath Source # getXdgDirectoryList :: XdgDirectoryList -> IO [OsPath] Source # getAppUserDataDirectory :: OsPath -> IO OsPath Source # getUserDocumentsDirectory :: IO OsPath Source # getTemporaryDirectory :: IO OsPath Source # getFileSize :: OsPath -> IO Integer Source # canonicalizePath :: OsPath -> IO OsPath Source # makeAbsolute :: OsPath -> IO OsPath Source # makeRelativeToCurrentDirectory :: OsPath -> IO OsPath Source # doesPathExist :: OsPath -> IO Bool Source # doesFileExist :: OsPath -> IO Bool Source # doesDirectoryExist :: OsPath -> IO Bool Source # findExecutable :: OsPath -> IO (Maybe OsPath) Source # findExecutables :: OsPath -> IO [OsPath] Source # findExecutablesInDirectories :: [OsPath] -> OsPath -> IO [OsPath] Source # findFileWith :: (OsPath -> IO Bool) -> [OsPath] -> OsPath -> IO (Maybe OsPath) Source # findFilesWith :: (OsPath -> IO Bool) -> [OsPath] -> OsPath -> IO [OsPath] Source # pathIsSymbolicLink :: OsPath -> IO Bool Source # getSymbolicLinkTarget :: OsPath -> IO OsPath Source # getPermissions :: OsPath -> IO Permissions Source # | |
| MonadPathReader m => MonadPathReader (ReaderT env m) | |
Defined in Effects.FileSystem.PathReader Methods listDirectory :: OsPath -> ReaderT env m [OsPath] Source # getDirectoryContents :: OsPath -> ReaderT env m [OsPath] Source # getCurrentDirectory :: ReaderT env m OsPath Source # getHomeDirectory :: ReaderT env m OsPath Source # getXdgDirectory :: XdgDirectory -> OsPath -> ReaderT env m OsPath Source # getXdgDirectoryList :: XdgDirectoryList -> ReaderT env m [OsPath] Source # getAppUserDataDirectory :: OsPath -> ReaderT env m OsPath Source # getUserDocumentsDirectory :: ReaderT env m OsPath Source # getTemporaryDirectory :: ReaderT env m OsPath Source # getFileSize :: OsPath -> ReaderT env m Integer Source # canonicalizePath :: OsPath -> ReaderT env m OsPath Source # makeAbsolute :: OsPath -> ReaderT env m OsPath Source # makeRelativeToCurrentDirectory :: OsPath -> ReaderT env m OsPath Source # doesPathExist :: OsPath -> ReaderT env m Bool Source # doesFileExist :: OsPath -> ReaderT env m Bool Source # doesDirectoryExist :: OsPath -> ReaderT env m Bool Source # findExecutable :: OsPath -> ReaderT env m (Maybe OsPath) Source # findExecutables :: OsPath -> ReaderT env m [OsPath] Source # findExecutablesInDirectories :: [OsPath] -> OsPath -> ReaderT env m [OsPath] Source # findFileWith :: (OsPath -> ReaderT env m Bool) -> [OsPath] -> OsPath -> ReaderT env m (Maybe OsPath) Source # findFilesWith :: (OsPath -> ReaderT env m Bool) -> [OsPath] -> OsPath -> ReaderT env m [OsPath] Source # pathIsSymbolicLink :: OsPath -> ReaderT env m Bool Source # getSymbolicLinkTarget :: OsPath -> ReaderT env m OsPath Source # getPermissions :: OsPath -> ReaderT env m Permissions Source # getAccessTime :: OsPath -> ReaderT env m UTCTime Source # getModificationTime :: OsPath -> ReaderT env m UTCTime Source # | |
(</>) :: OsPath -> OsPath -> OsPath #
Combine two paths with a path separator.
If the second path starts with a path separator or a drive letter, then it returns the second.
The intention is that readFile (dir will access the same file as
</> file)setCurrentDirectory dir; readFile file.
Posix: "/directory" </> "file.ext" == "/directory/file.ext"
Windows: "/directory" </> "file.ext" == "/directory\\file.ext"
"directory" </> "/file.ext" == "/file.ext"
Valid x => (takeDirectory x </> takeFileName x) `equalFilePath` xCombined:
Posix: "/" </> "test" == "/test" Posix: "home" </> "bob" == "home/bob" Posix: "x:" </> "foo" == "x:/foo" Windows: "C:\\foo" </> "bar" == "C:\\foo\\bar" Windows: "home" </> "bob" == "home\\bob"
Not combined:
Posix: "home" </> "/bob" == "/bob" Windows: "home" </> "C:\\bob" == "C:\\bob"
Not combined (tricky):
On Windows, if a filepath starts with a single slash, it is relative to the
root of the current drive. In [1], this is (confusingly) referred to as an
absolute path.
The current behavior of </> is to never combine these forms.
Windows: "home" </> "/bob" == "/bob" Windows: "home" </> "\\bob" == "\\bob" Windows: "C:\\home" </> "\\bob" == "\\bob"
On Windows, from [1]: "If a file name begins with only a disk designator
but not the backslash after the colon, it is interpreted as a relative path
to the current directory on the drive with the specified letter."
The current behavior of </> is to never combine these forms.
Windows: "D:\\foo" </> "C:bar" == "C:bar" Windows: "C:\\foo" </> "C:bar" == "C:bar"
class Monad m => MonadThread (m :: Type -> Type) Source #
Represents thread effects.
Since: effects-thread-0.1
Minimal complete definition
threadDelay, throwTo, getNumCapabilities, setNumCapabilities, threadCapability, myThreadId, labelThread, threadLabel
Instances
| MonadThread IO | Since: effects-thread-0.1 |
Defined in Effects.Concurrent.Thread Methods threadDelay :: Int -> IO () Source # throwTo :: (Exception e, HasCallStack) => ThreadId -> e -> IO () Source # getNumCapabilities :: IO Int Source # setNumCapabilities :: Int -> IO () Source # threadCapability :: ThreadId -> IO (Int, Bool) Source # myThreadId :: IO ThreadId Source # | |
| MonadThread m => MonadThread (ShellT env m) Source # | |
Defined in Shrun.ShellT Methods threadDelay :: Int -> ShellT env m () Source # throwTo :: (Exception e, HasCallStack) => ThreadId -> e -> ShellT env m () Source # getNumCapabilities :: ShellT env m Int Source # setNumCapabilities :: Int -> ShellT env m () Source # threadCapability :: ThreadId -> ShellT env m (Int, Bool) Source # myThreadId :: ShellT env m ThreadId Source # labelThread :: ThreadId -> String -> ShellT env m () Source # threadLabel :: ThreadId -> ShellT env m (Maybe String) Source # | |
| MonadThread m => MonadThread (ReaderT e m) | Since: effects-thread-0.1 |
Defined in Effects.Concurrent.Thread Methods threadDelay :: Int -> ReaderT e m () Source # throwTo :: (Exception e0, HasCallStack) => ThreadId -> e0 -> ReaderT e m () Source # getNumCapabilities :: ReaderT e m Int Source # setNumCapabilities :: Int -> ReaderT e m () Source # threadCapability :: ThreadId -> ReaderT e m (Int, Bool) Source # myThreadId :: ReaderT e m ThreadId Source # labelThread :: ThreadId -> String -> ReaderT e m () Source # threadLabel :: ThreadId -> ReaderT e m (Maybe String) Source # | |
class Monad m => MonadAsync (m :: Type -> Type) Source #
Represents async effects. API largely follows unliftio's implementation of UnliftIO.Async.
Since: effects-async-0.1
Minimal complete definition
withAsync, withAsyncBound, withAsyncOn, withAsyncWithUnmask, withAsyncOnWithUnmask, wait, poll, waitCatch, cancel, uninterruptibleCancel, cancelWith, race, concurrently, concurrently_, waitAny, waitAnyCatch, waitAnyCancel, waitAnyCatchCancel, waitEither, waitEitherCatch, waitEitherCancel, waitEitherCatchCancel, waitEither_, waitBoth, async, asyncBound, asyncOn, asyncWithUnmask, asyncOnWithUnmask, link, linkOnly, link2, link2Only, pooledMapConcurrentlyN, pooledMapConcurrently, pooledMapConcurrentlyN_, pooledMapConcurrently_
Instances
| MonadAsync IO | Since: effects-async-0.1 |
Defined in Effects.Concurrent.Async Methods withAsync :: HasCallStack => IO a -> (Async a -> IO b) -> IO b Source # withAsyncBound :: HasCallStack => IO a -> (Async a -> IO b) -> IO b Source # withAsyncOn :: HasCallStack => Int -> IO a -> (Async a -> IO b) -> IO b Source # withAsyncWithUnmask :: HasCallStack => ((forall c. IO c -> IO c) -> IO a) -> (Async a -> IO b) -> IO b Source # withAsyncOnWithUnmask :: HasCallStack => Int -> ((forall c. IO c -> IO c) -> IO a) -> (Async a -> IO b) -> IO b Source # wait :: HasCallStack => Async a -> IO a Source # poll :: HasCallStack => Async a -> IO (Maybe (Either SomeException a)) Source # waitCatch :: HasCallStack => Async a -> IO (Either SomeException a) Source # cancel :: HasCallStack => Async a -> IO () Source # uninterruptibleCancel :: HasCallStack => Async a -> IO () Source # cancelWith :: (Exception e, HasCallStack) => Async a -> e -> IO () Source # race :: HasCallStack => IO a -> IO b -> IO (Either a b) Source # concurrently :: HasCallStack => IO a -> IO b -> IO (a, b) Source # concurrently_ :: HasCallStack => IO a -> IO b -> IO () Source # waitAny :: HasCallStack => [Async a] -> IO (Async a, a) Source # waitAnyCatch :: HasCallStack => [Async a] -> IO (Async a, Either SomeException a) Source # waitAnyCancel :: HasCallStack => [Async a] -> IO (Async a, a) Source # waitAnyCatchCancel :: HasCallStack => [Async a] -> IO (Async a, Either SomeException a) Source # waitEither :: HasCallStack => Async a -> Async b -> IO (Either a b) Source # waitEitherCatch :: HasCallStack => Async a -> Async b -> IO (Either (Either SomeException a) (Either SomeException b)) Source # waitEitherCancel :: HasCallStack => Async a -> Async b -> IO (Either a b) Source # waitEitherCatchCancel :: HasCallStack => Async a -> Async b -> IO (Either (Either SomeException a) (Either SomeException b)) Source # waitEither_ :: HasCallStack => Async a -> Async b -> IO () Source # waitBoth :: HasCallStack => Async a -> Async b -> IO (a, b) Source # async :: HasCallStack => IO a -> IO (Async a) Source # asyncBound :: HasCallStack => IO a -> IO (Async a) Source # asyncOn :: HasCallStack => Int -> IO a -> IO (Async a) Source # asyncWithUnmask :: HasCallStack => ((forall b. IO b -> IO b) -> IO a) -> IO (Async a) Source # asyncOnWithUnmask :: HasCallStack => Int -> ((forall b. IO b -> IO b) -> IO a) -> IO (Async a) Source # link :: HasCallStack => Async a -> IO () Source # linkOnly :: HasCallStack => (SomeException -> Bool) -> Async a -> IO () Source # link2 :: HasCallStack => Async a -> Async b -> IO () Source # link2Only :: HasCallStack => (SomeException -> Bool) -> Async a -> Async b -> IO () Source # pooledMapConcurrentlyN :: (HasCallStack, Traversable t) => Positive Int -> (a -> IO b) -> t a -> IO (t b) Source # pooledMapConcurrently :: (HasCallStack, Traversable t) => (a -> IO b) -> t a -> IO (t b) Source # pooledMapConcurrentlyN_ :: (Foldable f, HasCallStack) => Positive Int -> (a -> IO b) -> f a -> IO () Source # pooledMapConcurrently_ :: (Foldable f, HasCallStack) => (a -> IO b) -> f a -> IO () Source # | |
| MonadAsync m => MonadAsync (ShellT env m) Source # | |
Defined in Shrun.ShellT Methods withAsync :: HasCallStack => ShellT env m a -> (Async a -> ShellT env m b) -> ShellT env m b Source # withAsyncBound :: HasCallStack => ShellT env m a -> (Async a -> ShellT env m b) -> ShellT env m b Source # withAsyncOn :: HasCallStack => Int -> ShellT env m a -> (Async a -> ShellT env m b) -> ShellT env m b Source # withAsyncWithUnmask :: HasCallStack => ((forall c. ShellT env m c -> ShellT env m c) -> ShellT env m a) -> (Async a -> ShellT env m b) -> ShellT env m b Source # withAsyncOnWithUnmask :: HasCallStack => Int -> ((forall c. ShellT env m c -> ShellT env m c) -> ShellT env m a) -> (Async a -> ShellT env m b) -> ShellT env m b Source # wait :: HasCallStack => Async a -> ShellT env m a Source # poll :: HasCallStack => Async a -> ShellT env m (Maybe (Either SomeException a)) Source # waitCatch :: HasCallStack => Async a -> ShellT env m (Either SomeException a) Source # cancel :: HasCallStack => Async a -> ShellT env m () Source # uninterruptibleCancel :: HasCallStack => Async a -> ShellT env m () Source # cancelWith :: (Exception e, HasCallStack) => Async a -> e -> ShellT env m () Source # race :: HasCallStack => ShellT env m a -> ShellT env m b -> ShellT env m (Either a b) Source # concurrently :: HasCallStack => ShellT env m a -> ShellT env m b -> ShellT env m (a, b) Source # concurrently_ :: HasCallStack => ShellT env m a -> ShellT env m b -> ShellT env m () Source # waitAny :: HasCallStack => [Async a] -> ShellT env m (Async a, a) Source # waitAnyCatch :: HasCallStack => [Async a] -> ShellT env m (Async a, Either SomeException a) Source # waitAnyCancel :: HasCallStack => [Async a] -> ShellT env m (Async a, a) Source # waitAnyCatchCancel :: HasCallStack => [Async a] -> ShellT env m (Async a, Either SomeException a) Source # waitEither :: HasCallStack => Async a -> Async b -> ShellT env m (Either a b) Source # waitEitherCatch :: HasCallStack => Async a -> Async b -> ShellT env m (Either (Either SomeException a) (Either SomeException b)) Source # waitEitherCancel :: HasCallStack => Async a -> Async b -> ShellT env m (Either a b) Source # waitEitherCatchCancel :: HasCallStack => Async a -> Async b -> ShellT env m (Either (Either SomeException a) (Either SomeException b)) Source # waitEither_ :: HasCallStack => Async a -> Async b -> ShellT env m () Source # waitBoth :: HasCallStack => Async a -> Async b -> ShellT env m (a, b) Source # async :: HasCallStack => ShellT env m a -> ShellT env m (Async a) Source # asyncBound :: HasCallStack => ShellT env m a -> ShellT env m (Async a) Source # asyncOn :: HasCallStack => Int -> ShellT env m a -> ShellT env m (Async a) Source # asyncWithUnmask :: HasCallStack => ((forall b. ShellT env m b -> ShellT env m b) -> ShellT env m a) -> ShellT env m (Async a) Source # asyncOnWithUnmask :: HasCallStack => Int -> ((forall b. ShellT env m b -> ShellT env m b) -> ShellT env m a) -> ShellT env m (Async a) Source # link :: HasCallStack => Async a -> ShellT env m () Source # linkOnly :: HasCallStack => (SomeException -> Bool) -> Async a -> ShellT env m () Source # link2 :: HasCallStack => Async a -> Async b -> ShellT env m () Source # link2Only :: HasCallStack => (SomeException -> Bool) -> Async a -> Async b -> ShellT env m () Source # pooledMapConcurrentlyN :: (HasCallStack, Traversable t) => Positive Int -> (a -> ShellT env m b) -> t a -> ShellT env m (t b) Source # pooledMapConcurrently :: (HasCallStack, Traversable t) => (a -> ShellT env m b) -> t a -> ShellT env m (t b) Source # pooledMapConcurrentlyN_ :: (Foldable f, HasCallStack) => Positive Int -> (a -> ShellT env m b) -> f a -> ShellT env m () Source # pooledMapConcurrently_ :: (Foldable f, HasCallStack) => (a -> ShellT env m b) -> f a -> ShellT env m () Source # | |
| MonadAsync m => MonadAsync (ReaderT env m) | Since: effects-async-0.1 |
Defined in Effects.Concurrent.Async Methods withAsync :: HasCallStack => ReaderT env m a -> (Async a -> ReaderT env m b) -> ReaderT env m b Source # withAsyncBound :: HasCallStack => ReaderT env m a -> (Async a -> ReaderT env m b) -> ReaderT env m b Source # withAsyncOn :: HasCallStack => Int -> ReaderT env m a -> (Async a -> ReaderT env m b) -> ReaderT env m b Source # withAsyncWithUnmask :: HasCallStack => ((forall c. ReaderT env m c -> ReaderT env m c) -> ReaderT env m a) -> (Async a -> ReaderT env m b) -> ReaderT env m b Source # withAsyncOnWithUnmask :: HasCallStack => Int -> ((forall c. ReaderT env m c -> ReaderT env m c) -> ReaderT env m a) -> (Async a -> ReaderT env m b) -> ReaderT env m b Source # wait :: HasCallStack => Async a -> ReaderT env m a Source # poll :: HasCallStack => Async a -> ReaderT env m (Maybe (Either SomeException a)) Source # waitCatch :: HasCallStack => Async a -> ReaderT env m (Either SomeException a) Source # cancel :: HasCallStack => Async a -> ReaderT env m () Source # uninterruptibleCancel :: HasCallStack => Async a -> ReaderT env m () Source # cancelWith :: (Exception e, HasCallStack) => Async a -> e -> ReaderT env m () Source # race :: HasCallStack => ReaderT env m a -> ReaderT env m b -> ReaderT env m (Either a b) Source # concurrently :: HasCallStack => ReaderT env m a -> ReaderT env m b -> ReaderT env m (a, b) Source # concurrently_ :: HasCallStack => ReaderT env m a -> ReaderT env m b -> ReaderT env m () Source # waitAny :: HasCallStack => [Async a] -> ReaderT env m (Async a, a) Source # waitAnyCatch :: HasCallStack => [Async a] -> ReaderT env m (Async a, Either SomeException a) Source # waitAnyCancel :: HasCallStack => [Async a] -> ReaderT env m (Async a, a) Source # waitAnyCatchCancel :: HasCallStack => [Async a] -> ReaderT env m (Async a, Either SomeException a) Source # waitEither :: HasCallStack => Async a -> Async b -> ReaderT env m (Either a b) Source # waitEitherCatch :: HasCallStack => Async a -> Async b -> ReaderT env m (Either (Either SomeException a) (Either SomeException b)) Source # waitEitherCancel :: HasCallStack => Async a -> Async b -> ReaderT env m (Either a b) Source # waitEitherCatchCancel :: HasCallStack => Async a -> Async b -> ReaderT env m (Either (Either SomeException a) (Either SomeException b)) Source # waitEither_ :: HasCallStack => Async a -> Async b -> ReaderT env m () Source # waitBoth :: HasCallStack => Async a -> Async b -> ReaderT env m (a, b) Source # async :: HasCallStack => ReaderT env m a -> ReaderT env m (Async a) Source # asyncBound :: HasCallStack => ReaderT env m a -> ReaderT env m (Async a) Source # asyncOn :: HasCallStack => Int -> ReaderT env m a -> ReaderT env m (Async a) Source # asyncWithUnmask :: HasCallStack => ((forall b. ReaderT env m b -> ReaderT env m b) -> ReaderT env m a) -> ReaderT env m (Async a) Source # asyncOnWithUnmask :: HasCallStack => Int -> ((forall b. ReaderT env m b -> ReaderT env m b) -> ReaderT env m a) -> ReaderT env m (Async a) Source # link :: HasCallStack => Async a -> ReaderT env m () Source # linkOnly :: HasCallStack => (SomeException -> Bool) -> Async a -> ReaderT env m () Source # link2 :: HasCallStack => Async a -> Async b -> ReaderT env m () Source # link2Only :: HasCallStack => (SomeException -> Bool) -> Async a -> Async b -> ReaderT env m () Source # pooledMapConcurrentlyN :: (HasCallStack, Traversable t) => Positive Int -> (a -> ReaderT env m b) -> t a -> ReaderT env m (t b) Source # pooledMapConcurrently :: (HasCallStack, Traversable t) => (a -> ReaderT env m b) -> t a -> ReaderT env m (t b) Source # pooledMapConcurrentlyN_ :: (Foldable f, HasCallStack) => Positive Int -> (a -> ReaderT env m b) -> f a -> ReaderT env m () Source # pooledMapConcurrently_ :: (Foldable f, HasCallStack) => (a -> ReaderT env m b) -> f a -> ReaderT env m () Source # | |
tryAny :: (HasCallStack, MonadCatch m) => m a -> m (Either SomeException a) Source #
try specialized to catch all synchronous exceptions
Since: safe-exceptions-0.1.0.0
throwCS :: forall m e a. (Exception e, HasCallStack, MonadThrow m) => e -> m a Source #
Legacy throw with callstack. For base >= 4.20 (GHC 9.10), alias for
throwM.
catchCS :: forall m e a. (Exception e, HasCallStack, MonadCatch m) => m a -> (e -> m a) -> m a Source #
Legacy catch with callstack. For base >= 4.20 (GHC 9.10), alias for
catch.
osp :: QuasiQuoter #
getXdgConfig :: (HasCallStack, MonadPathReader m) => OsPath -> m OsPath Source #
Retrieves the XDG config directory e.g. ~/.config.
Since: effects-fs-0.1
getXdgState :: (HasCallStack, MonadPathReader m) => OsPath -> m OsPath Source #
Retrieves the XDG state directory e.g. ~/.local/state.
Since: effects-fs-0.1
removeFileIfExists :: (HasCallStack, MonadPathReader m, MonadPathWriter m) => OsPath -> m () Source #
Calls removeFile if doesFileExist is True.
Since: effects-fs-0.1
removeDirectoryIfExists :: (HasCallStack, MonadPathReader m, MonadPathWriter m) => OsPath -> m () Source #
Calls removeDirectory if doesDirectoryExist is True.
Since: effects-fs-0.1
hPutUtf8 :: (HasCallStack, MonadHandleWriter m) => Handle -> Text -> m () Source #
Writes the UTF-8 text to the handle.
Since: effects-fs-0.1
class Monad m => MonadHandleReader (m :: Type -> Type) Source #
Represents handle reader effects.
Since: effects-fs-0.1
Minimal complete definition
hIsEOF, hGetBuffering, hIsOpen, hIsClosed, hIsReadable, hIsWritable, hIsSeekable, hIsTerminalDevice, hGetEcho, hWaitForInput, hReady, hGetChar, hGetLine, hGetContents, hGet, hGetSome, hGetNonBlocking
Instances
| MonadHandleReader IO | Since: effects-fs-0.1 |
Defined in Effects.FileSystem.HandleReader Methods hIsEOF :: Handle -> IO Bool Source # hGetBuffering :: Handle -> IO BufferMode Source # hIsOpen :: Handle -> IO Bool Source # hIsClosed :: Handle -> IO Bool Source # hIsReadable :: Handle -> IO Bool Source # hIsWritable :: Handle -> IO Bool Source # hIsSeekable :: Handle -> IO Bool Source # hIsTerminalDevice :: Handle -> IO Bool Source # hGetEcho :: Handle -> IO Bool Source # hWaitForInput :: Handle -> Int -> IO Bool Source # hReady :: Handle -> IO Bool Source # hGetChar :: Handle -> IO Char Source # hGetLine :: Handle -> IO ByteString Source # hGetContents :: Handle -> IO ByteString Source # hGet :: Handle -> Int -> IO ByteString Source # hGetSome :: Handle -> Int -> IO ByteString Source # hGetNonBlocking :: Handle -> Int -> IO ByteString Source # | |
| MonadHandleReader m => MonadHandleReader (ShellT env m) Source # | |
Defined in Shrun.ShellT Methods hIsEOF :: Handle -> ShellT env m Bool Source # hGetBuffering :: Handle -> ShellT env m BufferMode Source # hIsOpen :: Handle -> ShellT env m Bool Source # hIsClosed :: Handle -> ShellT env m Bool Source # hIsReadable :: Handle -> ShellT env m Bool Source # hIsWritable :: Handle -> ShellT env m Bool Source # hIsSeekable :: Handle -> ShellT env m Bool Source # hIsTerminalDevice :: Handle -> ShellT env m Bool Source # hGetEcho :: Handle -> ShellT env m Bool Source # hWaitForInput :: Handle -> Int -> ShellT env m Bool Source # hReady :: Handle -> ShellT env m Bool Source # hGetChar :: Handle -> ShellT env m Char Source # hGetLine :: Handle -> ShellT env m ByteString Source # hGetContents :: Handle -> ShellT env m ByteString Source # hGet :: Handle -> Int -> ShellT env m ByteString Source # hGetSome :: Handle -> Int -> ShellT env m ByteString Source # hGetNonBlocking :: Handle -> Int -> ShellT env m ByteString Source # | |
| MonadHandleReader m => MonadHandleReader (ReaderT e m) | Since: effects-fs-0.1 |
Defined in Effects.FileSystem.HandleReader Methods hIsEOF :: Handle -> ReaderT e m Bool Source # hGetBuffering :: Handle -> ReaderT e m BufferMode Source # hIsOpen :: Handle -> ReaderT e m Bool Source # hIsClosed :: Handle -> ReaderT e m Bool Source # hIsReadable :: Handle -> ReaderT e m Bool Source # hIsWritable :: Handle -> ReaderT e m Bool Source # hIsSeekable :: Handle -> ReaderT e m Bool Source # hIsTerminalDevice :: Handle -> ReaderT e m Bool Source # hGetEcho :: Handle -> ReaderT e m Bool Source # hWaitForInput :: Handle -> Int -> ReaderT e m Bool Source # hReady :: Handle -> ReaderT e m Bool Source # hGetChar :: Handle -> ReaderT e m Char Source # hGetLine :: Handle -> ReaderT e m ByteString Source # hGetContents :: Handle -> ReaderT e m ByteString Source # hGet :: Handle -> Int -> ReaderT e m ByteString Source # hGetSome :: Handle -> Int -> ReaderT e m ByteString Source # hGetNonBlocking :: Handle -> Int -> ReaderT e m ByteString Source # | |
class Monad m => MonadFileWriter (m :: Type -> Type) Source #
Represents file-system writer effects.
Since: effects-fs-0.1
Minimal complete definition
Instances
| MonadFileWriter IO | Since: effects-fs-0.1 |
Defined in Effects.FileSystem.FileWriter Methods writeBinaryFile :: OsPath -> ByteString -> IO () Source # appendBinaryFile :: OsPath -> ByteString -> IO () Source # | |
| MonadFileWriter m => MonadFileWriter (ShellT env m) Source # | |
Defined in Shrun.ShellT Methods writeBinaryFile :: OsPath -> ByteString -> ShellT env m () Source # appendBinaryFile :: OsPath -> ByteString -> ShellT env m () Source # | |
| MonadFileWriter m => MonadFileWriter (ReaderT env m) | Since: effects-fs-0.1 |
Defined in Effects.FileSystem.FileWriter Methods writeBinaryFile :: OsPath -> ByteString -> ReaderT env m () Source # appendBinaryFile :: OsPath -> ByteString -> ReaderT env m () Source # | |
writeFileUtf8 :: (HasCallStack, MonadFileWriter m) => OsPath -> Text -> m () Source #
Writes to a file as UTF-8.
Since: effects-fs-0.1
appendFileUtf8 :: (HasCallStack, MonadFileWriter m) => OsPath -> Text -> m () Source #
Appends to a file as UTF-8.
Since: effects-fs-0.1
class Monad m => MonadFileReader (m :: Type -> Type) Source #
Represents file-system reader effects.
Since: effects-fs-0.1
Minimal complete definition
Instances
| MonadFileReader IO | Since: effects-fs-0.1 |
Defined in Effects.FileSystem.FileReader Methods readBinaryFile :: OsPath -> IO ByteString Source # | |
| MonadFileReader m => MonadFileReader (ShellT env m) Source # | |
Defined in Shrun.ShellT Methods readBinaryFile :: OsPath -> ShellT env m ByteString Source # | |
| MonadFileReader m => MonadFileReader (ReaderT e m) | Since: effects-fs-0.1 |
Defined in Effects.FileSystem.FileReader Methods readBinaryFile :: OsPath -> ReaderT e m ByteString Source # | |
readFileUtf8Lenient :: (HasCallStack, MonadFileReader m) => OsPath -> m Text Source #
Reads a file as UTF-8 in lenient mode.
Since: effects-fs-0.1
readFileUtf8ThrowM :: (HasCallStack, MonadFileReader m, MonadThrow m) => OsPath -> m Text Source #
Decodes a file as UTF-8. Throws UnicodeException for decode errors.
Since: effects-fs-0.1
class Monad m => MonadOptparse (m :: Type -> Type) where Source #
Effects for optparse-applicative.
The vast majority of optparse-applicative is not re-exported, as most of the interface is pure. This is merely the functions needed to run a parser.
Since: effects-optparse-0.1
Minimal complete definition
Methods
execParser :: HasCallStack => ParserInfo a -> m a Source #
Lifted execParser.
Since: effects-optparse-0.1
Instances
| MonadOptparse IO | Since: effects-optparse-0.1 |
Defined in Effects.Optparse Methods execParser :: HasCallStack => ParserInfo a -> IO a Source # customExecParser :: HasCallStack => ParserPrefs -> ParserInfo a -> IO a Source # handleParseResult :: HasCallStack => ParserResult a -> IO a Source # | |
| MonadOptparse m => MonadOptparse (ReaderT env m) | Since: effects-optparse-0.1 |
Defined in Effects.Optparse Methods execParser :: HasCallStack => ParserInfo a -> ReaderT env m a Source # customExecParser :: HasCallStack => ParserPrefs -> ParserInfo a -> ReaderT env m a Source # handleParseResult :: HasCallStack => ParserResult a -> ReaderT env m a Source # | |
TBQueue is an abstract type representing a bounded FIFO channel.
Since: stm-2.4
class Monad m => MonadSTM (m :: Type -> Type) Source #
STM effect. Note that this class is for monads that can lift entire
STM transactions (i.e. atomically). It is not intended for "STM-like"
monads -- hence has no STM instance -- as the semantics for "STM-like" and
"can lift STM atomically" are different.
Since: effects-stm-0.1
Minimal complete definition
Instances
| MonadSTM IO | Since: effects-stm-0.1 |
Defined in Effects.Concurrent.STM Methods atomically :: HasCallStack => STM a -> IO a Source # | |
| MonadSTM m => MonadSTM (ShellT env m) Source # | |
Defined in Shrun.ShellT Methods atomically :: HasCallStack => STM a -> ShellT env m a Source # | |
| MonadSTM m => MonadSTM (ReaderT e m) | Since: effects-stm-0.1 |
Defined in Effects.Concurrent.STM Methods atomically :: HasCallStack => STM a -> ReaderT e m a Source # | |
newTVarA :: (HasCallStack, MonadSTM m) => a -> m (TVar a) Source #
Create a new TVar holding a value supplied and lifts the result via
atomically.
Since: effects-stm-0.1
readTVarA :: (HasCallStack, MonadSTM m) => TVar a -> m a Source #
Return the current value stored in a TVar and lifts the result via
atomically.
Since: effects-stm-0.1
writeTVarA :: (HasCallStack, MonadSTM m) => TVar a -> a -> m () Source #
Write the supplied value into a TVar and lifts the action via
atomically.
Since: effects-stm-0.1
modifyTVarA' :: (HasCallStack, MonadSTM m) => TVar a -> (a -> a) -> m () Source #
Strict version of modifyTVar, lifting the action via
atomically.
Since: effects-stm-0.1
Arguments
| :: (HasCallStack, MonadSTM m) | |
| => Natural | maximum number of elements the queue can hold |
| -> m (TBQueue a) |
Builds and returns a new instance of TBQueue, lifting via atomically.
Since: effects-stm-0.1
readTBQueueA :: (HasCallStack, MonadSTM m) => TBQueue a -> m a Source #
Read the next value from the TBQueue, lifting via atomically.
Since: effects-stm-0.1
writeTBQueueA :: (HasCallStack, MonadSTM m) => TBQueue a -> a -> m () Source #
Write a value to a TBQueue; blocks if the queue is full. Lifts via
atomically.
Since: effects-stm-0.1
flushTBQueueA :: (HasCallStack, MonadSTM m) => TBQueue a -> m [a] Source #
Efficiently read the entire contents of a TBQueue into a list. This
function never retries. Lifts via atomically.
Since: effects-stm-0.1
putText :: (HasCallStack, MonadTerminal m) => Text -> m () Source #
putTextLn :: (HasCallStack, MonadTerminal m) => Text -> m () Source #
class Monad m => MonadTime (m :: Type -> Type) Source #
Time effect.
Since: effects-time-0.1
Minimal complete definition
Instances
| MonadTime IO | Since: effects-time-0.1 |
Defined in Effects.Time | |
| MonadTime m => MonadTime (ShellT env m) Source # | |
Defined in Shrun.ShellT Methods getSystemZonedTime :: ShellT env m ZonedTime Source # getMonotonicTime :: ShellT env m Double Source # | |
| MonadTime m => MonadTime (ReaderT e m) | Since: effects-time-0.1 |
Defined in Effects.Time Methods getSystemZonedTime :: ReaderT e m ZonedTime Source # getMonotonicTime :: ReaderT e m Double Source # | |
class Monad m => MonadTypedProcess (m :: Type -> Type) Source #
Effect for launching processes. API largely follows typed-process.
Since: effects-typed-process-0.1
Minimal complete definition
runProcess, readProcess, readProcessStdout, readProcessStderr, readProcessInterleaved, withProcessWait, withProcessTerm, startProcess, stopProcess, runProcess_, readProcess_, readProcessStdout_, readProcessStderr_, readProcessInterleaved_, withProcessWait_, withProcessTerm_, waitExitCode, getExitCode, checkExitCode
Instances
| MonadTypedProcess IO | Since: effects-typed-process-0.1 |
Defined in Effects.Process.Typed Methods runProcess :: HasCallStack => ProcessConfig stdin stdout stderr -> IO ExitCode Source # readProcess :: HasCallStack => ProcessConfig stdin stdoutIgnored stderrIgnored -> IO (ExitCode, ByteString, ByteString) Source # readProcessStdout :: HasCallStack => ProcessConfig stdin stdoutIgnored stderr -> IO (ExitCode, ByteString) Source # readProcessStderr :: HasCallStack => ProcessConfig stdin stdout stderrIgnored -> IO (ExitCode, ByteString) Source # readProcessInterleaved :: HasCallStack => ProcessConfig stdin stdoutIgnored stderrIgnored -> IO (ExitCode, ByteString) Source # withProcessWait :: HasCallStack => ProcessConfig stdin stdout stderr -> (Process stdin stdout stderr -> IO a) -> IO a Source # withProcessTerm :: HasCallStack => ProcessConfig stdin stdout stderr -> (Process stdin stdout stderr -> IO a) -> IO a Source # startProcess :: HasCallStack => ProcessConfig stdin stdout stderr -> IO (Process stdin stdout stderr) Source # stopProcess :: HasCallStack => Process stdin stdout stderr -> IO () Source # runProcess_ :: HasCallStack => ProcessConfig stdin stdout stderr -> IO () Source # readProcess_ :: HasCallStack => ProcessConfig stdin stdoutIgnored stderrIgnored -> IO (ByteString, ByteString) Source # readProcessStdout_ :: HasCallStack => ProcessConfig stdin stdoutIgnored stderr -> IO ByteString Source # readProcessStderr_ :: HasCallStack => ProcessConfig stdin stdout stderrIgnored -> IO ByteString Source # readProcessInterleaved_ :: HasCallStack => ProcessConfig stdin stdoutIgnored stderrIgnored -> IO ByteString Source # withProcessWait_ :: HasCallStack => ProcessConfig stdin stdout stderr -> (Process stdin stdout stderr -> IO a) -> IO a Source # withProcessTerm_ :: HasCallStack => ProcessConfig stdin stdout stderr -> (Process stdin stdout stderr -> IO a) -> IO a Source # waitExitCode :: HasCallStack => Process stdin stdout stderr -> IO ExitCode Source # getExitCode :: HasCallStack => Process stdin stdout stderr -> IO (Maybe ExitCode) Source # checkExitCode :: HasCallStack => Process stdin stdout stderr -> IO () Source # | |
| MonadTypedProcess m => MonadTypedProcess (ShellT env m) Source # | |
Defined in Shrun.ShellT Methods runProcess :: HasCallStack => ProcessConfig stdin stdout stderr -> ShellT env m ExitCode Source # readProcess :: HasCallStack => ProcessConfig stdin stdoutIgnored stderrIgnored -> ShellT env m (ExitCode, ByteString, ByteString) Source # readProcessStdout :: HasCallStack => ProcessConfig stdin stdoutIgnored stderr -> ShellT env m (ExitCode, ByteString) Source # readProcessStderr :: HasCallStack => ProcessConfig stdin stdout stderrIgnored -> ShellT env m (ExitCode, ByteString) Source # readProcessInterleaved :: HasCallStack => ProcessConfig stdin stdoutIgnored stderrIgnored -> ShellT env m (ExitCode, ByteString) Source # withProcessWait :: HasCallStack => ProcessConfig stdin stdout stderr -> (Process stdin stdout stderr -> ShellT env m a) -> ShellT env m a Source # withProcessTerm :: HasCallStack => ProcessConfig stdin stdout stderr -> (Process stdin stdout stderr -> ShellT env m a) -> ShellT env m a Source # startProcess :: HasCallStack => ProcessConfig stdin stdout stderr -> ShellT env m (Process stdin stdout stderr) Source # stopProcess :: HasCallStack => Process stdin stdout stderr -> ShellT env m () Source # runProcess_ :: HasCallStack => ProcessConfig stdin stdout stderr -> ShellT env m () Source # readProcess_ :: HasCallStack => ProcessConfig stdin stdoutIgnored stderrIgnored -> ShellT env m (ByteString, ByteString) Source # readProcessStdout_ :: HasCallStack => ProcessConfig stdin stdoutIgnored stderr -> ShellT env m ByteString Source # readProcessStderr_ :: HasCallStack => ProcessConfig stdin stdout stderrIgnored -> ShellT env m ByteString Source # readProcessInterleaved_ :: HasCallStack => ProcessConfig stdin stdoutIgnored stderrIgnored -> ShellT env m ByteString Source # withProcessWait_ :: HasCallStack => ProcessConfig stdin stdout stderr -> (Process stdin stdout stderr -> ShellT env m a) -> ShellT env m a Source # withProcessTerm_ :: HasCallStack => ProcessConfig stdin stdout stderr -> (Process stdin stdout stderr -> ShellT env m a) -> ShellT env m a Source # waitExitCode :: HasCallStack => Process stdin stdout stderr -> ShellT env m ExitCode Source # getExitCode :: HasCallStack => Process stdin stdout stderr -> ShellT env m (Maybe ExitCode) Source # checkExitCode :: HasCallStack => Process stdin stdout stderr -> ShellT env m () Source # | |
| MonadTypedProcess m => MonadTypedProcess (ReaderT env m) | Since: effects-typed-process-0.1 |
Defined in Effects.Process.Typed Methods runProcess :: HasCallStack => ProcessConfig stdin stdout stderr -> ReaderT env m ExitCode Source # readProcess :: HasCallStack => ProcessConfig stdin stdoutIgnored stderrIgnored -> ReaderT env m (ExitCode, ByteString, ByteString) Source # readProcessStdout :: HasCallStack => ProcessConfig stdin stdoutIgnored stderr -> ReaderT env m (ExitCode, ByteString) Source # readProcessStderr :: HasCallStack => ProcessConfig stdin stdout stderrIgnored -> ReaderT env m (ExitCode, ByteString) Source # readProcessInterleaved :: HasCallStack => ProcessConfig stdin stdoutIgnored stderrIgnored -> ReaderT env m (ExitCode, ByteString) Source # withProcessWait :: HasCallStack => ProcessConfig stdin stdout stderr -> (Process stdin stdout stderr -> ReaderT env m a) -> ReaderT env m a Source # withProcessTerm :: HasCallStack => ProcessConfig stdin stdout stderr -> (Process stdin stdout stderr -> ReaderT env m a) -> ReaderT env m a Source # startProcess :: HasCallStack => ProcessConfig stdin stdout stderr -> ReaderT env m (Process stdin stdout stderr) Source # stopProcess :: HasCallStack => Process stdin stdout stderr -> ReaderT env m () Source # runProcess_ :: HasCallStack => ProcessConfig stdin stdout stderr -> ReaderT env m () Source # readProcess_ :: HasCallStack => ProcessConfig stdin stdoutIgnored stderrIgnored -> ReaderT env m (ByteString, ByteString) Source # readProcessStdout_ :: HasCallStack => ProcessConfig stdin stdoutIgnored stderr -> ReaderT env m ByteString Source # readProcessStderr_ :: HasCallStack => ProcessConfig stdin stdout stderrIgnored -> ReaderT env m ByteString Source # readProcessInterleaved_ :: HasCallStack => ProcessConfig stdin stdoutIgnored stderrIgnored -> ReaderT env m ByteString Source # withProcessWait_ :: HasCallStack => ProcessConfig stdin stdout stderr -> (Process stdin stdout stderr -> ReaderT env m a) -> ReaderT env m a Source # withProcessTerm_ :: HasCallStack => ProcessConfig stdin stdout stderr -> (Process stdin stdout stderr -> ReaderT env m a) -> ReaderT env m a Source # waitExitCode :: HasCallStack => Process stdin stdout stderr -> ReaderT env m ExitCode Source # getExitCode :: HasCallStack => Process stdin stdout stderr -> ReaderT env m (Maybe ExitCode) Source # checkExitCode :: HasCallStack => Process stdin stdout stderr -> ReaderT env m () Source # | |
decodeWith :: Decoder a -> Text -> Either TOMLError a Source #
Decode the given TOML input using the given Decoder.
review :: forall k (is :: IxList) t b. Is k A_Review => Optic' k is t b -> b -> t Source #
Retrieve the value targeted by a Review.
>>>review _Left "hi"Left "hi"
preview :: forall k (is :: IxList) s a. Is k An_AffineFold => Optic' k is s a -> s -> Maybe a Source #
Retrieve the value targeted by an AffineFold.
>>>let _Right = prism Right $ either (Left . Left) Right
>>>preview _Right (Right 'x')Just 'x'
>>>preview _Right (Left 'y')Nothing
(^?) :: forall k s (is :: IxList) a. Is k An_AffineFold => s -> Optic' k is s a -> Maybe a infixl 8 Source #
Flipped infix version of preview.
prism :: (b -> t) -> (s -> Either t a) -> Prism s t a b Source #
Build a prism from a constructor and a matcher, which must respect the well-formedness laws.
If you want to build a Prism from the van Laarhoven representation, use
prismVL from the optics-vl package.
_2 :: Field2 s t a b => Lens s t a b Source #
Access the 2nd field of a tuple.
>>>_2 .~ "hello" $ (1,(),3,4)(1,"hello",3,4)
>>>(1,2,3,4) & _2 %~ (*3)(1,6,3,4)
>>>traverseOf _2 print (1,2)2 (1,())
(^.) :: forall k s (is :: IxList) a. Is k A_Getter => s -> Optic' k is s a -> a infixl 8 Source #
Flipped infix version of view.
(.~) :: forall k (is :: IxList) s t a b. Is k A_Setter => Optic k is s t a b -> b -> s -> t infixr 4 Source #
Infix version of set.
(?~) :: forall k (is :: IxList) s t a b. Is k A_Setter => Optic k is s t a (Maybe b) -> b -> s -> t infixr 4 Source #
_1 :: Field1 s t a b => Lens s t a b Source #
Access the 1st field of a tuple (and possibly change its type).
>>>(1,2) ^. _11
>>>(1,2) & _1 .~ "hello"("hello",2)
>>>traverseOf _1 putStrLn ("hello","world")hello ((),"world")
This can also be used on larger tuples as well:
>>>(1,2,3,4,5) & _1 %~ (+41)(42,2,3,4,5)
type Optic' k (is :: IxList) s a = Optic k is s s a a Source #
Common special case of Optic where source and target types are equal.
Here, we need only one "big" and one "small" type. For lenses, this means that in the restricted form we cannot do type-changing updates.
set' :: forall k (is :: IxList) s t a b. Is k A_Setter => Optic k is s t a b -> b -> s -> t Source #
Apply a setter, strictly.
TODO DOC: what exactly is the strictness property?
(#) :: forall k (is :: IxList) t b. Is k A_Review => Optic' k is t b -> b -> t infixr 8 Source #
Infix version of review.
iso :: (s -> a) -> (b -> t) -> Iso s t a b Source #
Build an iso from a pair of inverse functions.
If you want to build an Iso from the van Laarhoven representation, use
isoVL from the optics-vl package.
newtype Bytes (s :: Size) n Source #
This is the core type for handling type-safe byte operations. It is
intended to be used as a simple wrapper over some numeric type,
equipped with a Size tag.
To take full advantage of the API (e.g. normalize), the underlying
numeric type should implement Semifield or, ideally, Field.
Examples
>>>MkBytes @M 1000MkBytes 1000
Since: si-bytes-0.1
Constructors
| MkBytes n |
Instances
| HasField "unBytes" (Bytes s n) n | Since: si-bytes-0.1 | ||||
Defined in Data.Bytes.Internal | |||||
| (k ~ An_Iso, a ~ n, b ~ n) => LabelOptic "unBytes" k (Bytes s n) (Bytes s n) a b | Since: si-bytes-0.1 | ||||
Defined in Data.Bytes.Internal | |||||
| Applicative (Bytes s) | Since: si-bytes-0.1 | ||||
| Functor (Bytes s) | Since: si-bytes-0.1 | ||||
| Monad (Bytes s) | Since: si-bytes-0.1 | ||||
| AGroup n => AGroup (Bytes s n) | Since: si-bytes-0.1 | ||||
| AMonoid n => AMonoid (Bytes s n) | Since: si-bytes-0.1 | ||||
Defined in Data.Bytes.Internal | |||||
| ASemigroup n => ASemigroup (Bytes s n) | Since: si-bytes-0.1 | ||||
| Normed n => Normed (Bytes s n) | Since: si-bytes-0.1 | ||||
| FromInteger n => FromInteger (Bytes s n) | Since: si-bytes-0.1 | ||||
Defined in Data.Bytes.Internal Methods afromInteger :: Integer -> Bytes s n Source # | |||||
| FromRational n => FromRational (Bytes s n) | Since: si-bytes-0.1 | ||||
Defined in Data.Bytes.Internal Methods afromRational :: Rational -> Bytes s n Source # | |||||
| Bounded n => Bounded (Bytes s n) | Since: si-bytes-0.1 | ||||
| Generic (Bytes s n) | |||||
Defined in Data.Bytes.Internal Associated Types
| |||||
| Show n => Show (Bytes s n) | Since: si-bytes-0.1 | ||||
| AnyLowerBounded n => AnyLowerBounded (Bytes s n) | Since: si-bytes-0.1 | ||||
Defined in Data.Bytes.Internal Methods someLowerBound :: Maybe (Bytes s n) Source # | |||||
| AnyUpperBounded n => AnyUpperBounded (Bytes s n) | Since: si-bytes-0.1 | ||||
Defined in Data.Bytes.Internal Methods someUpperBound :: Maybe (Bytes s n) Source # | |||||
| LowerBounded n => LowerBounded (Bytes s n) | Since: si-bytes-0.1 | ||||
Defined in Data.Bytes.Internal Methods lowerBound :: Bytes s n Source # | |||||
| LowerBoundless (Bytes s n) | Since: si-bytes-0.1 | ||||
Defined in Data.Bytes.Internal | |||||
| UpperBounded n => UpperBounded (Bytes s n) | Since: si-bytes-0.1 | ||||
Defined in Data.Bytes.Internal Methods upperBound :: Bytes s n Source # | |||||
| UpperBoundless (Bytes s n) | Since: si-bytes-0.1 | ||||
Defined in Data.Bytes.Internal | |||||
| NFData n => NFData (Bytes s n) | Since: si-bytes-0.1 | ||||
Defined in Data.Bytes.Internal | |||||
| Eq n => Eq (Bytes s n) | Since: si-bytes-0.1 | ||||
| Ord n => Ord (Bytes s n) | Since: si-bytes-0.1 | ||||
| Hashable n => Hashable (Bytes s n) | Since: si-bytes-0.1 | ||||
| (FromInteger n, MGroup n, SingSize s) => Conversion (Bytes s n) | Since: si-bytes-0.1 | ||||
| (FromInteger n, MGroup n, Normed n, Ord n, SingSize s) => Normalize (Bytes s n) | Since: si-bytes-0.1 | ||||
| Read n => Parser (Bytes s n) | Since: si-bytes-0.1 | ||||
| RawNumeric (Bytes s n) | Since: si-bytes-0.1 | ||||
| SingSize s => Sized (Bytes s n) | Since: si-bytes-0.1 | ||||
| MSemigroup n => MSemiSpace (Bytes s n) n | Since: si-bytes-0.1 | ||||
| MGroup n => MSpace (Bytes s n) n | Since: si-bytes-0.1 | ||||
| Ring n => Module (Bytes s n) n | Since: si-bytes-0.1 | ||||
Defined in Data.Bytes.Internal | |||||
| Semiring n => Semimodule (Bytes s n) n | Since: si-bytes-0.1 | ||||
Defined in Data.Bytes.Internal | |||||
| Semifield n => SemivectorSpace (Bytes s n) n | Since: si-bytes-0.1 | ||||
Defined in Data.Bytes.Internal | |||||
| Field n => VectorSpace (Bytes s n) n | Since: si-bytes-0.1 | ||||
Defined in Data.Bytes.Internal | |||||
| type Converted t (Bytes s n) | |||||
Defined in Data.Bytes.Internal | |||||
| type Rep (Bytes s n) | Since: si-bytes-0.1 | ||||
Defined in Data.Bytes.Internal type Rep (Bytes s n) = D1 ('MetaData "Bytes" "Data.Bytes.Internal" "si-bytes-0.1-d13f5301c58f6493bc77bbec789b3c261bf5d8e740a3eb2c2beea532db7cf08a" 'True) (C1 ('MetaCons "MkBytes" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 n))) | |||||
| type Norm (Bytes s n) | |||||
Defined in Data.Bytes.Internal | |||||
| type Raw (Bytes s n) | |||||
Defined in Data.Bytes.Internal | |||||
| type HideSize (Bytes s n) | |||||
Defined in Data.Bytes.Internal | |||||
pattern IsEmpty :: Seq a Source #
O(1). The IsNonEmpty and IsEmpty patterns allow you to treat
a Seq as if it were either a IsNonEmpty nn is
a NESeq) or an IsEmpty.
Matching on IsEmpty means that the original Seq was empty.
A case statement handling both IsNonEmpty and IsEmpty provides
complete coverage.
This is a bidirectional pattern, so you can use IsEmpty as an
expression, and it will be interpreted as empty.
See IsNonEmpty for more information.
data NESeq a where infixr 5 Source #
A general-purpose non-empty (by construction) finite sequence type.
Non-emptiness means that:
- Functions that take an
NESeqcan safely operate on it with the assumption that it has at least value. - Functions that return an
NESeqprovide an assurance that the result has at least one value.
Data.Sequence.NonEmpty re-exports the API of Data.Sequence,
faithfully reproducing asymptotics, typeclass constraints, and
semantics. Functions that ensure that input and output maps are both
non-empty (like <|) return NESeq, but
functions that might potentially return an empty map (like
tail) return a Seq instead.
You can directly construct an NESeq with the API from
Data.Sequence.NonEmpty; it's more or less the same as constructing
a normal Seq, except you don't have access to empty. There
are also a few ways to construct an NESeq from a Seq:
- The
nonEmptySeqsmart constructor will convert aSeqaMaybe(NESeqa)Nothingif the originalSeqwas empty. - You can use
:<||,:||>, andinsertSeqAtto insert a value into aSeqto create a guaranteedNESeq. - You can use the
IsNonEmptyandIsEmptypatterns to "pattern match" on aSeqto reveal it as either containing aNESeqor an empty sequence. withNonEmptyoffers a continuation-based interface for deconstructing aSeqand treating it as if it were anNESeq.
You can convert an NESeq into a Seq with toSeq or
IsNonEmpty, essentially "obscuring" the
non-empty property from the type.
Bundled Patterns
| pattern (:<||) :: a -> Seq a -> NESeq a infixr 5 | O(1). An abstract constructor for an Can be used to match on the head and tail of an |
| pattern (:||>) :: Seq a -> a -> NESeq a infixl 5 | O(1). An abstract constructor for an Can be used to match on the init and last of an |
Instances
| MonadFix NESeq | |
Defined in Data.Sequence.NonEmpty.Internal | |
| MonadZip NESeq | mzipWith = zipWith munzip = unzip |
| Foldable NESeq |
|
Defined in Data.Sequence.NonEmpty.Internal Methods fold :: Monoid m => NESeq m -> m # foldMap :: Monoid m => (a -> m) -> NESeq a -> m # foldMap' :: Monoid m => (a -> m) -> NESeq a -> m # foldr :: (a -> b -> b) -> b -> NESeq a -> b # foldr' :: (a -> b -> b) -> b -> NESeq a -> b # foldl :: (b -> a -> b) -> b -> NESeq a -> b # foldl' :: (b -> a -> b) -> b -> NESeq a -> b # foldr1 :: (a -> a -> a) -> NESeq a -> a # foldl1 :: (a -> a -> a) -> NESeq a -> a # elem :: Eq a => a -> NESeq a -> Bool # maximum :: Ord a => NESeq a -> a # minimum :: Ord a => NESeq a -> a # | |
| Foldable1 NESeq | |
Defined in Data.Sequence.NonEmpty.Internal Methods fold1 :: Semigroup m => NESeq m -> m # foldMap1 :: Semigroup m => (a -> m) -> NESeq a -> m # foldMap1' :: Semigroup m => (a -> m) -> NESeq a -> m # toNonEmpty :: NESeq a -> NonEmpty a # maximum :: Ord a => NESeq a -> a # minimum :: Ord a => NESeq a -> a # foldrMap1 :: (a -> b) -> (a -> b -> b) -> NESeq a -> b # foldlMap1' :: (a -> b) -> (b -> a -> b) -> NESeq a -> b # foldlMap1 :: (a -> b) -> (b -> a -> b) -> NESeq a -> b # foldrMap1' :: (a -> b) -> (a -> b -> b) -> NESeq a -> b # | |
| Eq1 NESeq | |
| Ord1 NESeq | |
Defined in Data.Sequence.NonEmpty.Internal | |
| Read1 NESeq | |
Defined in Data.Sequence.NonEmpty.Internal | |
| Show1 NESeq | |
| Traversable NESeq | |
| Applicative NESeq | |
| Functor NESeq | |
| Monad NESeq | |
| Comonad NESeq | |
| Invariant NESeq | Since: nonempty-containers-0.3.4.4 |
| Alt NESeq | |
| Apply NESeq | |
| Bind NESeq | |
| Extend NESeq | |
| Traversable1 NESeq | |
| FromJSON a => FromJSON (NESeq a) | |
| ToJSON a => ToJSON (NESeq a) | |
| Data a => Data (NESeq a) | |
Defined in Data.Sequence.NonEmpty.Internal Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> NESeq a -> c (NESeq a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (NESeq a) # toConstr :: NESeq a -> Constr # dataTypeOf :: NESeq a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (NESeq a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (NESeq a)) # gmapT :: (forall b. Data b => b -> b) -> NESeq a -> NESeq a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> NESeq a -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> NESeq a -> r # gmapQ :: (forall d. Data d => d -> u) -> NESeq a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> NESeq a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> NESeq a -> m (NESeq a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> NESeq a -> m (NESeq a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> NESeq a -> m (NESeq a) # | |
| Semigroup (NESeq a) | |
| Read a => Read (NESeq a) | |
| Show a => Show (NESeq a) | |
| NFData a => NFData (NESeq a) | |
Defined in Data.Sequence.NonEmpty.Internal | |
| Eq a => Eq (NESeq a) | |
| Ord a => Ord (NESeq a) | |
Defined in Data.Sequence.NonEmpty.Internal | |
class LabelOptic (name :: Symbol) k s t a b | name s -> k a, name t -> k b, name s b -> t, name t a -> s where Source #
Support for overloaded labels as optics.
An overloaded label #foo can be used as an optic if there is an instance
LabelOptic "foo" k s t a b
Alternatively, if both s and t have a Generic (GenericLabelOptics if
explicit-generic-labels flag is enabled) instance, a total field of s is
accessible by a label #field of kind A_Lens, whereas its constructor by a
label #_Constructor of kind A_Prism.
Methods
labelOptic :: Optic k NoIx s t a b Source #
Used to interpret overloaded label syntax. An overloaded label #foo
corresponds to labelOptic @"foo"
Instances
| (k ~ An_Iso, a ~ Void0, b ~ Void0) => LabelOptic name k Void0 Void0 a b | If for an overloaded label |
Defined in Optics.Label Methods labelOptic :: Optic k NoIx Void0 Void0 a b Source # | |
| GenericLabelOpticContext repDefined name k s t a b => LabelOptic name k s t a b | If no instance matches, try to use For more information have a look at Since: optics-core-0.4 |
Defined in Optics.Label Methods labelOptic :: Optic k NoIx s t a b Source # | |
| (k ~ A_Lens, a ~ UnlinedText, b ~ UnlinedText) => LabelOptic "body" k ShrunNote ShrunNote a b Source # | |
Defined in Shrun.Notify.MonadNotify | |
| (k ~ An_Iso, a ~ Bool, b ~ Bool) => LabelOptic "boolIso" k ReportReadErrorsSwitch ReportReadErrorsSwitch a b Source # | |
Defined in Shrun.Configuration.Data.CommandLogging Methods labelOptic :: Optic k NoIx ReportReadErrorsSwitch ReportReadErrorsSwitch a b Source # | |
| (k ~ An_Iso, a ~ Bool, b ~ Bool) => LabelOptic "boolIso" k ConsoleLogCmdSwitch ConsoleLogCmdSwitch a b Source # | |
Defined in Shrun.Configuration.Data.ConsoleLogging Methods labelOptic :: Optic k NoIx ConsoleLogCmdSwitch ConsoleLogCmdSwitch a b Source # | |
| (k ~ An_Iso, a ~ Bool, b ~ Bool) => LabelOptic "boolIso" k DeleteOnSuccessSwitch DeleteOnSuccessSwitch a b Source # | |
Defined in Shrun.Configuration.Data.FileLogging Methods labelOptic :: Optic k NoIx DeleteOnSuccessSwitch DeleteOnSuccessSwitch a b Source # | |
| (k ~ A_Lens, a ~ CaseFormat, b ~ CaseFormat) => LabelOptic "caseFormat" k DirectedFormatter DirectedFormatter a b | Since: si-bytes-0.1 |
Defined in Data.Bytes.Formatting.Direction Methods labelOptic :: Optic k NoIx DirectedFormatter DirectedFormatter a b Source # | |
| (k ~ A_Lens, a ~ CaseFormat, b ~ CaseFormat) => LabelOptic "caseFormat" k SizedFormatter SizedFormatter a b | Since: si-bytes-0.1 |
Defined in Data.Bytes.Formatting.Size Methods labelOptic :: Optic k NoIx SizedFormatter SizedFormatter a b Source # | |
| (k ~ A_Lens, a ~ Maybe CommandP1, b ~ Maybe CommandP1) => LabelOptic "cmd" k Log Log a b Source # | |
Defined in Shrun.Logging.Types | |
| (k ~ A_Lens, a ~ NESeq Text, b ~ NESeq Text) => LabelOptic "commands" k Args Args a b Source # | |
Defined in Shrun.Configuration.Args.Parsing | |
| (k ~ A_Lens, a ~ NESeq CommandP1, b ~ NESeq CommandP1) => LabelOptic "commands" k MergedConfig MergedConfig a b Source # | |
Defined in Shrun.Configuration.Data.MergedConfig Methods labelOptic :: Optic k NoIx MergedConfig MergedConfig a b Source # | |
| (k ~ A_Lens, a ~ WithDisabled OsPath, b ~ WithDisabled OsPath) => LabelOptic "configPath" k Args Args a b Source # | |
Defined in Shrun.Configuration.Args.Parsing | |
| (k ~ A_Lens, a ~ CoreConfigArgs, b ~ CoreConfigArgs) => LabelOptic "coreConfig" k Args Args a b Source # | |
Defined in Shrun.Configuration.Args.Parsing | |
| (k ~ A_Lens, a ~ CoreConfigMerged, b ~ CoreConfigMerged) => LabelOptic "coreConfig" k MergedConfig MergedConfig a b Source # | |
Defined in Shrun.Configuration.Data.MergedConfig Methods labelOptic :: Optic k NoIx MergedConfig MergedConfig a b Source # | |
| (k ~ A_Lens, a ~ CoreConfigToml, b ~ CoreConfigToml) => LabelOptic "coreConfig" k Toml Toml a b Source # | |
Defined in Shrun.Configuration.Toml | |
| (k ~ A_Lens, a ~ Natural, b ~ Natural) => LabelOptic "days" k RelativeTime RelativeTime a b | Since: relative-time-0.1 |
Defined in Data.Time.Relative Methods labelOptic :: Optic k NoIx RelativeTime RelativeTime a b Source # | |
| (k ~ A_Lens, a ~ DirectionFormat, b ~ DirectionFormat) => LabelOptic "directionFormat" k DirectedFormatter DirectedFormatter a b | Since: si-bytes-0.1 |
Defined in Data.Bytes.Formatting.Direction Methods labelOptic :: Optic k NoIx DirectedFormatter DirectedFormatter a b Source # | |
| (k ~ A_Lens, a ~ Handle, b ~ Handle) => LabelOptic "handle" k FileLogOpened FileLogOpened a b Source # | |
Defined in Shrun.Configuration.Data.FileLogging Methods labelOptic :: Optic k NoIx FileLogOpened FileLogOpened a b Source # | |
| (k ~ A_Lens, a ~ Natural, b ~ Natural) => LabelOptic "hours" k RelativeTime RelativeTime a b | Since: relative-time-0.1 |
Defined in Data.Time.Relative Methods labelOptic :: Optic k NoIx RelativeTime RelativeTime a b Source # | |
| (k ~ A_Getter, a ~ Text, b ~ Text) => LabelOptic "key" k KeyVal KeyVal a b Source # | |
Defined in Shrun.Configuration.Toml.Legend | |
| (k ~ A_Lens, a ~ Bool, b ~ Bool) => LabelOptic "leadingSpace" k SizedFormatter SizedFormatter a b | Since: si-bytes-0.1 |
Defined in Data.Bytes.Formatting.Size Methods labelOptic :: Optic k NoIx SizedFormatter SizedFormatter a b Source # | |
| (k ~ A_Lens, a ~ Maybe (List KeyVal), b ~ Maybe (List KeyVal)) => LabelOptic "legend" k Toml Toml a b Source # | |
Defined in Shrun.Configuration.Toml | |
| (k ~ A_Lens, a ~ LogLevel, b ~ LogLevel) => LabelOptic "lvl" k Log Log a b Source # | |
Defined in Shrun.Logging.Types | |
| (k ~ A_Lens, a ~ Natural, b ~ Natural) => LabelOptic "minutes" k RelativeTime RelativeTime a b | Since: relative-time-0.1 |
Defined in Data.Time.Relative Methods labelOptic :: Optic k NoIx RelativeTime RelativeTime a b Source # | |
| (k ~ A_Lens, a ~ LogMode, b ~ LogMode) => LabelOptic "mode" k Log Log a b Source # | |
Defined in Shrun.Logging.Types | |
| (k ~ A_Lens, a ~ UnlinedText, b ~ UnlinedText) => LabelOptic "msg" k Log Log a b Source # | |
Defined in Shrun.Logging.Types | |
| (k ~ A_Lens, a ~ Natural, b ~ Natural) => LabelOptic "nsec" k TimeSpec TimeSpec a b | Since: effects-time-0.1 |
Defined in Effects.Time | |
| (k ~ A_Lens, a ~ Overwrite, b ~ Overwrite) => LabelOptic "overwrite" k CopyDirConfig CopyDirConfig a b | Since: effects-fs-0.1 |
Defined in Effects.FileSystem.PathWriter Methods labelOptic :: Optic k NoIx CopyDirConfig CopyDirConfig a b Source # | |
| (k ~ A_Lens, a ~ TBQueue FileLog, b ~ TBQueue FileLog) => LabelOptic "queue" k FileLogOpened FileLogOpened a b Source # | |
Defined in Shrun.Configuration.Data.FileLogging Methods labelOptic :: Optic k NoIx FileLogOpened FileLogOpened a b Source # | |
| (k ~ A_Lens, a ~ Natural, b ~ Natural) => LabelOptic "sec" k TimeSpec TimeSpec a b | Since: effects-time-0.1 |
Defined in Effects.Time | |
| (k ~ A_Lens, a ~ Natural, b ~ Natural) => LabelOptic "seconds" k RelativeTime RelativeTime a b | Since: relative-time-0.1 |
Defined in Data.Time.Relative Methods labelOptic :: Optic k NoIx RelativeTime RelativeTime a b Source # | |
| (k ~ A_Lens, a ~ SizeFormat, b ~ SizeFormat) => LabelOptic "sizeFormat" k SizedFormatter SizedFormatter a b | Since: si-bytes-0.1 |
Defined in Data.Bytes.Formatting.Size Methods labelOptic :: Optic k NoIx SizedFormatter SizedFormatter a b Source # | |
| (k ~ A_Lens, a ~ FormatStyle, b ~ FormatStyle) => LabelOptic "style" k Format Format a b | Since: relative-time-0.1 |
Defined in Data.Time.Relative | |
| (k ~ A_Lens, a ~ UnlinedText, b ~ UnlinedText) => LabelOptic "summary" k ShrunNote ShrunNote a b Source # | |
Defined in Shrun.Notify.MonadNotify | |
| (k ~ A_Lens, a ~ TargetName, b ~ TargetName) => LabelOptic "targetName" k CopyDirConfig CopyDirConfig a b | Since: effects-fs-0.1 |
Defined in Effects.FileSystem.PathWriter Methods labelOptic :: Optic k NoIx CopyDirConfig CopyDirConfig a b Source # | |
| (k ~ A_Lens, a ~ NotifyTimeout, b ~ NotifyTimeout) => LabelOptic "timeout" k ShrunNote ShrunNote a b Source # | |
Defined in Shrun.Notify.MonadNotify | |
| (k ~ A_Getter, a ~ Text, b ~ Text) => LabelOptic "unConsoleLog" k ConsoleLog ConsoleLog a b Source # | |
Defined in Shrun.Logging.Types.Internal Methods labelOptic :: Optic k NoIx ConsoleLog ConsoleLog a b Source # | |
| (k ~ A_Getter, a ~ Text, b ~ Text) => LabelOptic "unFileLog" k FileLog FileLog a b Source # | |
Defined in Shrun.Logging.Types.Internal | |
| (k ~ An_Iso, a ~ Natural, b ~ Natural) => LabelOptic "unPollInterval" k PollInterval PollInterval a b Source # | |
Defined in Shrun.Configuration.Data.CommandLogging.PollInterval Methods labelOptic :: Optic k NoIx PollInterval PollInterval a b Source # | |
| (k ~ An_Iso, a ~ Bytes 'B Natural, b ~ Bytes 'B Natural) => LabelOptic "unReadSize" k ReadSize ReadSize a b Source # | |
| (k ~ An_Iso, a ~ Natural, b ~ Natural) => LabelOptic "unTimeout" k Timeout Timeout a b Source # | |
Defined in Shrun.Configuration.Data.Core.Timeout | |
| (k ~ A_Getter, a ~ Text, b ~ Text) => LabelOptic "unUnlinedText" k UnlinedText UnlinedText a b Source # | |
Defined in Shrun.Data.Text Methods labelOptic :: Optic k NoIx UnlinedText UnlinedText a b Source # | |
| (k ~ A_Lens, a ~ UrgencyLevel, b ~ UrgencyLevel) => LabelOptic "urgency" k ShrunNote ShrunNote a b Source # | |
Defined in Shrun.Notify.MonadNotify | |
| (k ~ A_Getter, a ~ NESeq Text, b ~ NESeq Text) => LabelOptic "val" k KeyVal KeyVal a b Source # | |
Defined in Shrun.Configuration.Toml.Legend | |
| (k ~ A_Lens, a ~ FormatVerbosity, b ~ FormatVerbosity) => LabelOptic "verbosity" k Format Format a b | Since: relative-time-0.1 |
Defined in Data.Time.Relative | |
| (k ~ A_Lens, a ~ NotifyActionF p, b ~ NotifyActionF p) => LabelOptic "action" k (NotifyP p) (NotifyP p) a b Source # | |
Defined in Shrun.Configuration.Data.Notify | |
| (k ~ A_Lens, a ~ TVar Bool, b ~ TVar Bool) => LabelOptic "anyError" k (Env r) (Env r) a b Source # | |
Defined in Shrun.Configuration.Env.Types | |
| (k ~ A_Lens, a ~ Text, b ~ Text) => LabelOptic "command" k (CommandP p) (CommandP p) a b Source # | |
Defined in Shrun.Data.Command | |
| (k ~ A_Lens, a ~ SwitchF p ConsoleLogCmdSwitch, b ~ SwitchF p ConsoleLogCmdSwitch) => LabelOptic "commandLogging" k (ConsoleLoggingP p) (ConsoleLoggingP p) a b Source # | |
Defined in Shrun.Configuration.Data.ConsoleLogging Methods labelOptic :: Optic k NoIx (ConsoleLoggingP p) (ConsoleLoggingP p) a b Source # | |
| (k ~ A_Lens, a ~ TomlOptF p (CommandLoggingP p), b ~ TomlOptF p (CommandLoggingP p)) => LabelOptic "commandLogging" k (CoreConfigP p) (CoreConfigP p) a b Source # | |
Defined in Shrun.Configuration.Data.Core Methods labelOptic :: Optic k NoIx (CoreConfigP p) (CoreConfigP p) a b Source # | |
| (k ~ A_Lens, a ~ ConfigPhaseMaybeF p (Truncation 'TruncCommandName), b ~ ConfigPhaseMaybeF p (Truncation 'TruncCommandName)) => LabelOptic "commandNameTrunc" k (ConsoleLoggingP p) (ConsoleLoggingP p) a b Source # | |
Defined in Shrun.Configuration.Data.ConsoleLogging Methods labelOptic :: Optic k NoIx (ConsoleLoggingP p) (ConsoleLoggingP p) a b Source # | |
| (k ~ A_Lens, a ~ ConfigPhaseMaybeF p (Truncation 'TruncCommandName), b ~ ConfigPhaseMaybeF p (Truncation 'TruncCommandName)) => LabelOptic "commandNameTrunc" k (FileLoggingP p) (FileLoggingP p) a b Source # | |
Defined in Shrun.Configuration.Data.FileLogging Methods labelOptic :: Optic k NoIx (FileLoggingP p) (FileLoggingP p) a b Source # | |
| (k ~ A_Lens, a ~ NESeq CommandP1, b ~ NESeq CommandP1) => LabelOptic "commands" k (Env r) (Env r) a b Source # | |
Defined in Shrun.Configuration.Env.Types | |
| (k ~ A_Lens, a ~ TomlOptF p (CommonLoggingP p), b ~ TomlOptF p (CommonLoggingP p)) => LabelOptic "commonLogging" k (CoreConfigP p) (CoreConfigP p) a b Source # | |
Defined in Shrun.Configuration.Data.Core Methods labelOptic :: Optic k NoIx (CoreConfigP p) (CoreConfigP p) a b Source # | |
| (k ~ A_Lens, a ~ TVar (Seq CommandP1), b ~ TVar (Seq CommandP1)) => LabelOptic "completedCommands" k (Env r) (Env r) a b Source # | |
Defined in Shrun.Configuration.Env.Types | |
| (k ~ A_Lens, a ~ CoreConfigP 'ConfigPhaseEnv, b ~ CoreConfigP 'ConfigPhaseEnv) => LabelOptic "config" k (Env r) (Env r) a b Source # | |
Defined in Shrun.Configuration.Env.Types | |
| (k ~ A_Lens, a ~ TBQueue (LogRegion r), b ~ TBQueue (LogRegion r)) => LabelOptic "consoleLogQueue" k (Env r) (Env r) a b Source # | |
Defined in Shrun.Configuration.Env.Types | |
| (k ~ A_Lens, a ~ TomlOptF p (ConsoleLoggingP p), b ~ TomlOptF p (ConsoleLoggingP p)) => LabelOptic "consoleLogging" k (CoreConfigP p) (CoreConfigP p) a b Source # | |
Defined in Shrun.Configuration.Data.Core Methods labelOptic :: Optic k NoIx (CoreConfigP p) (CoreConfigP p) a b Source # | |
| (k ~ A_Lens, a ~ SwitchF p DeleteOnSuccessSwitch, b ~ SwitchF p DeleteOnSuccessSwitch) => LabelOptic "deleteOnSuccess" k (FileLoggingP p) (FileLoggingP p) a b Source # | |
Defined in Shrun.Configuration.Data.FileLogging Methods labelOptic :: Optic k NoIx (FileLoggingP p) (FileLoggingP p) a b Source # | |
| (k ~ A_Lens, a ~ FileLogFileF p, b ~ FileLogFileF p) => LabelOptic "file" k (FileLoggingP p) (FileLoggingP p) a b Source # | |
Defined in Shrun.Configuration.Data.FileLogging Methods labelOptic :: Optic k NoIx (FileLoggingP p) (FileLoggingP p) a b Source # | |
| (k ~ A_Lens, a ~ ArgsOnlyDetF p (FileLoggingP p), b ~ ArgsOnlyDetF p (FileLoggingP p)) => LabelOptic "fileLogging" k (CoreConfigP p) (CoreConfigP p) a b Source # | |
Defined in Shrun.Configuration.Data.Core Methods labelOptic :: Optic k NoIx (CoreConfigP p) (CoreConfigP p) a b Source # | |
| (k ~ A_Lens, a ~ ConfigPhaseMaybeF p Text, b ~ ConfigPhaseMaybeF p Text) => LabelOptic "init" k (CoreConfigP p) (CoreConfigP p) a b Source # | |
Defined in Shrun.Configuration.Data.Core Methods labelOptic :: Optic k NoIx (CoreConfigP p) (CoreConfigP p) a b Source # | |
| (k ~ A_Lens, a ~ Maybe Text, b ~ Maybe Text) => LabelOptic "key" k (CommandP p) (CommandP p) a b Source # | |
Defined in Shrun.Data.Command | |
| (k ~ An_Iso, a ~ ConfigPhaseF p KeyHideSwitch, b ~ ConfigPhaseF p KeyHideSwitch) => LabelOptic "keyHide" k (CommonLoggingP p) (CommonLoggingP p) a b Source # | |
Defined in Shrun.Configuration.Data.CommonLogging Methods labelOptic :: Optic k NoIx (CommonLoggingP p) (CommonLoggingP p) a b Source # | |
| (k ~ A_Lens, a ~ LineTruncF p, b ~ LineTruncF p) => LabelOptic "lineTrunc" k (ConsoleLoggingP p) (ConsoleLoggingP p) a b Source # | |
Defined in Shrun.Configuration.Data.ConsoleLogging Methods labelOptic :: Optic k NoIx (ConsoleLoggingP p) (ConsoleLoggingP p) a b Source # | |
| (k ~ A_Lens, a ~ LineTruncF p, b ~ LineTruncF p) => LabelOptic "lineTrunc" k (FileLoggingP p) (FileLoggingP p) a b Source # | |
Defined in Shrun.Configuration.Data.FileLogging Methods labelOptic :: Optic k NoIx (FileLoggingP p) (FileLoggingP p) a b Source # | |
| (k ~ A_Lens, a ~ ConfigPhaseF p FileMode, b ~ ConfigPhaseF p FileMode) => LabelOptic "mode" k (FileLogInitP p) (FileLogInitP p) a b Source # | |
Defined in Shrun.Configuration.Data.FileLogging Methods labelOptic :: Optic k NoIx (FileLogInitP p) (FileLogInitP p) a b Source # | |
| (k ~ A_Lens, a ~ ArgsOnlyDetF p (NotifyP p), b ~ ArgsOnlyDetF p (NotifyP p)) => LabelOptic "notify" k (CoreConfigP p) (CoreConfigP p) a b Source # | |
Defined in Shrun.Configuration.Data.Core Methods labelOptic :: Optic k NoIx (CoreConfigP p) (CoreConfigP p) a b Source # | |
| (k ~ A_Lens, a ~ FileLogPathF p, b ~ FileLogPathF p) => LabelOptic "path" k (FileLogInitP p) (FileLogInitP p) a b Source # | |
Defined in Shrun.Configuration.Data.FileLogging Methods labelOptic :: Optic k NoIx (FileLogInitP p) (FileLogInitP p) a b Source # | |
| (k ~ A_Lens, a ~ ConfigPhaseF p PollInterval, b ~ ConfigPhaseF p PollInterval) => LabelOptic "pollInterval" k (CommandLoggingP p) (CommandLoggingP p) a b Source # | |
Defined in Shrun.Configuration.Data.CommandLogging Methods labelOptic :: Optic k NoIx (CommandLoggingP p) (CommandLoggingP p) a b Source # | |
| (k ~ A_Lens, a ~ ConfigPhaseF p ReadSize, b ~ ConfigPhaseF p ReadSize) => LabelOptic "readSize" k (CommandLoggingP p) (CommandLoggingP p) a b Source # | |
Defined in Shrun.Configuration.Data.CommandLogging Methods labelOptic :: Optic k NoIx (CommandLoggingP p) (CommandLoggingP p) a b Source # | |
| (k ~ A_Lens, a ~ SwitchF p ReportReadErrorsSwitch, b ~ SwitchF p ReportReadErrorsSwitch) => LabelOptic "reportReadErrors" k (CommandLoggingP p) (CommandLoggingP p) a b Source # | |
Defined in Shrun.Configuration.Data.CommandLogging Methods labelOptic :: Optic k NoIx (CommandLoggingP p) (CommandLoggingP p) a b Source # | |
| (k ~ A_Lens, a ~ ConfigPhaseF p FileSizeMode, b ~ ConfigPhaseF p FileSizeMode) => LabelOptic "sizeMode" k (FileLogInitP p) (FileLogInitP p) a b Source # | |
Defined in Shrun.Configuration.Data.FileLogging Methods labelOptic :: Optic k NoIx (FileLogInitP p) (FileLogInitP p) a b Source # | |
| (k ~ A_Lens, a ~ ConfigPhaseF p ConsoleLogStripControl, b ~ ConfigPhaseF p ConsoleLogStripControl) => LabelOptic "stripControl" k (ConsoleLoggingP p) (ConsoleLoggingP p) a b Source # | |
Defined in Shrun.Configuration.Data.ConsoleLogging Methods labelOptic :: Optic k NoIx (ConsoleLoggingP p) (ConsoleLoggingP p) a b Source # | |
| (k ~ A_Lens, a ~ ConfigPhaseF p FileLogStripControl, b ~ ConfigPhaseF p FileLogStripControl) => LabelOptic "stripControl" k (FileLoggingP p) (FileLoggingP p) a b Source # | |
Defined in Shrun.Configuration.Data.FileLogging Methods labelOptic :: Optic k NoIx (FileLoggingP p) (FileLoggingP p) a b Source # | |
| (k ~ A_Lens, a ~ ConfigPhaseF p (NotifySystemP p), b ~ ConfigPhaseF p (NotifySystemP p)) => LabelOptic "system" k (NotifyP p) (NotifyP p) a b Source # | |
Defined in Shrun.Configuration.Data.Notify | |
| (k ~ A_Lens, a ~ ConfigPhaseMaybeF p Timeout, b ~ ConfigPhaseMaybeF p Timeout) => LabelOptic "timeout" k (CoreConfigP p) (CoreConfigP p) a b Source # | |
Defined in Shrun.Configuration.Data.Core Methods labelOptic :: Optic k NoIx (CoreConfigP p) (CoreConfigP p) a b Source # | |
| (k ~ A_Lens, a ~ ConfigPhaseF p NotifyTimeout, b ~ ConfigPhaseF p NotifyTimeout) => LabelOptic "timeout" k (NotifyP p) (NotifyP p) a b Source # | |
Defined in Shrun.Configuration.Data.Notify | |
| (k ~ A_Lens, a ~ ConfigPhaseF p TimerFormat, b ~ ConfigPhaseF p TimerFormat) => LabelOptic "timerFormat" k (ConsoleLoggingP p) (ConsoleLoggingP p) a b Source # | |
Defined in Shrun.Configuration.Data.ConsoleLogging Methods labelOptic :: Optic k NoIx (ConsoleLoggingP p) (ConsoleLoggingP p) a b Source # | |
| (k ~ A_Getter, x ~ a, y ~ a) => LabelOptic "unNonZero" k (NonZero a) (NonZero a) x y | Since: smart-math-0.1 |
Defined in Numeric.Data.NonZero.Internal | |
| (k ~ A_Getter, x ~ a, y ~ a) => LabelOptic "unPositive" k (Positive a) (Positive a) x y | Since: smart-math-0.1 |
Defined in Numeric.Data.Positive.Internal | |
| (k ~ A_Getter, a ~ n, b ~ n) => LabelOptic "unSomeNet" k (SomeNet n) (SomeNet n) a b | Since: si-bytes-0.1 |
Defined in Data.Bytes.Network.Internal | |
| (k ~ A_Getter, a ~ n, b ~ n) => LabelOptic "unSomeSize" k (SomeSize n) (SomeSize n) a b | Since: si-bytes-0.1 |
Defined in Data.Bytes.Internal | |
| (k ~ An_Iso, a ~ Natural, b ~ Natural) => LabelOptic "unTruncation" k (Truncation r) (Truncation r) a b Source # | |
Defined in Shrun.Configuration.Data.Truncation Methods labelOptic :: Optic k NoIx (Truncation r) (Truncation r) a b Source # | |
| (k ~ An_Iso, a ~ n, b ~ n) => LabelOptic "unBytes" k (Bytes s n) (Bytes s n) a b | Since: si-bytes-0.1 |
Defined in Data.Bytes.Internal | |
| (k ~ A_Getter, a ~ n, b ~ n) => LabelOptic "unSomeNetDir" k (SomeNetDir s n) (SomeNetDir s n) a b | Since: si-bytes-0.1 |
Defined in Data.Bytes.Network.Internal Methods labelOptic :: Optic k NoIx (SomeNetDir s n) (SomeNetDir s n) a b Source # | |
| (k ~ A_Getter, a ~ n, b ~ n) => LabelOptic "unSomeNetSize" k (SomeNetSize d n) (SomeNetSize d n) a b | Since: si-bytes-0.1 |
Defined in Data.Bytes.Network.Internal Methods labelOptic :: Optic k NoIx (SomeNetSize d n) (SomeNetSize d n) a b Source # | |
| (k ~ An_Iso, a ~ n, b ~ n) => LabelOptic "unNetBytes" k (NetBytes d s n) (NetBytes d s n) a b | Since: si-bytes-0.1 |
Defined in Data.Bytes.Network.Internal | |
data An_AffineFold Source #
Tag for an affine fold.
Instances
| Is A_Getter An_AffineFold | |||||
Defined in Optics.Internal.Optic.Subtyping Methods implies :: forall (p :: Type -> Type -> Type -> Type) r. (Constraints A_Getter p => r) -> Constraints An_AffineFold p => r Source # | |||||
| Is A_Lens An_AffineFold | |||||
Defined in Optics.Internal.Optic.Subtyping Methods implies :: forall (p :: Type -> Type -> Type -> Type) r. (Constraints A_Lens p => r) -> Constraints An_AffineFold p => r Source # | |||||
| Is A_Prism An_AffineFold | |||||
Defined in Optics.Internal.Optic.Subtyping Methods implies :: forall (p :: Type -> Type -> Type -> Type) r. (Constraints A_Prism p => r) -> Constraints An_AffineFold p => r Source # | |||||
| Is A_ReversedPrism An_AffineFold | |||||
Defined in Optics.Internal.Optic.Subtyping Methods implies :: forall (p :: Type -> Type -> Type -> Type) r. (Constraints A_ReversedPrism p => r) -> Constraints An_AffineFold p => r Source # | |||||
| Is An_AffineFold A_Fold | |||||
Defined in Optics.Internal.Optic.Subtyping Methods implies :: forall (p :: Type -> Type -> Type -> Type) r. (Constraints An_AffineFold p => r) -> Constraints A_Fold p => r Source # | |||||
| Is An_AffineTraversal An_AffineFold | |||||
Defined in Optics.Internal.Optic.Subtyping Methods implies :: forall (p :: Type -> Type -> Type -> Type) r. (Constraints An_AffineTraversal p => r) -> Constraints An_AffineFold p => r Source # | |||||
| Is An_Iso An_AffineFold | |||||
Defined in Optics.Internal.Optic.Subtyping Methods implies :: forall (p :: Type -> Type -> Type -> Type) r. (Constraints An_Iso p => r) -> Constraints An_AffineFold p => r Source # | |||||
| k ~ A_Fold => JoinKinds A_Fold An_AffineFold k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints A_Fold p, Constraints An_AffineFold p) => r) -> Constraints k p => r Source # | |||||
| k ~ An_AffineFold => JoinKinds A_Getter An_AffineFold k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints A_Getter p, Constraints An_AffineFold p) => r) -> Constraints k p => r Source # | |||||
| k ~ An_AffineFold => JoinKinds A_Lens An_AffineFold k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints A_Lens p, Constraints An_AffineFold p) => r) -> Constraints k p => r Source # | |||||
| k ~ An_AffineFold => JoinKinds A_Prism An_AffineFold k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints A_Prism p, Constraints An_AffineFold p) => r) -> Constraints k p => r Source # | |||||
| k ~ An_AffineFold => JoinKinds A_ReversedPrism An_AffineFold k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints A_ReversedPrism p, Constraints An_AffineFold p) => r) -> Constraints k p => r Source # | |||||
| k ~ A_Fold => JoinKinds A_Traversal An_AffineFold k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints A_Traversal p, Constraints An_AffineFold p) => r) -> Constraints k p => r Source # | |||||
| k ~ A_Fold => JoinKinds An_AffineFold A_Fold k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints An_AffineFold p, Constraints A_Fold p) => r) -> Constraints k p => r Source # | |||||
| k ~ An_AffineFold => JoinKinds An_AffineFold A_Getter k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints An_AffineFold p, Constraints A_Getter p) => r) -> Constraints k p => r Source # | |||||
| k ~ An_AffineFold => JoinKinds An_AffineFold A_Lens k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints An_AffineFold p, Constraints A_Lens p) => r) -> Constraints k p => r Source # | |||||
| k ~ An_AffineFold => JoinKinds An_AffineFold A_Prism k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints An_AffineFold p, Constraints A_Prism p) => r) -> Constraints k p => r Source # | |||||
| k ~ An_AffineFold => JoinKinds An_AffineFold A_ReversedPrism k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints An_AffineFold p, Constraints A_ReversedPrism p) => r) -> Constraints k p => r Source # | |||||
| k ~ A_Fold => JoinKinds An_AffineFold A_Traversal k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints An_AffineFold p, Constraints A_Traversal p) => r) -> Constraints k p => r Source # | |||||
| k ~ An_AffineFold => JoinKinds An_AffineFold An_AffineFold k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints An_AffineFold p, Constraints An_AffineFold p) => r) -> Constraints k p => r Source # | |||||
| k ~ An_AffineFold => JoinKinds An_AffineFold An_AffineTraversal k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints An_AffineFold p, Constraints An_AffineTraversal p) => r) -> Constraints k p => r Source # | |||||
| k ~ An_AffineFold => JoinKinds An_AffineFold An_Iso k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints An_AffineFold p, Constraints An_Iso p) => r) -> Constraints k p => r Source # | |||||
| k ~ An_AffineFold => JoinKinds An_AffineTraversal An_AffineFold k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints An_AffineTraversal p, Constraints An_AffineFold p) => r) -> Constraints k p => r Source # | |||||
| k ~ An_AffineFold => JoinKinds An_Iso An_AffineFold k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints An_Iso p, Constraints An_AffineFold p) => r) -> Constraints k p => r Source # | |||||
| (s ~ t, a ~ b) => IxOptic An_AffineFold s t a b | |||||
Defined in Optics.Indexed.Core Methods noIx :: forall (is :: IxList). NonEmptyIndices is => Optic An_AffineFold is s t a b -> Optic An_AffineFold NoIx s t a b Source # | |||||
| (s ~ t, a ~ b) => ToReadOnly An_AffineFold s t a b | |||||
Defined in Optics.ReadOnly Associated Types
Methods getting :: forall (is :: IxList). Optic An_AffineFold is s t a b -> Optic' (ReadOnlyOptic An_AffineFold) is s a Source # | |||||
| type ReadOnlyOptic An_AffineFold | |||||
Defined in Optics.ReadOnly | |||||
Tag for a getter.
Instances
| ReversibleOptic A_Getter | |||||
Defined in Optics.Re Associated Types
Methods re :: forall (is :: IxList) s t a b. AcceptsEmptyIndices "re" is => Optic A_Getter is s t a b -> Optic (ReversedOptic A_Getter) is b a t s Source # | |||||
| Is A_Getter A_Fold | |||||
Defined in Optics.Internal.Optic.Subtyping | |||||
| Is A_Getter An_AffineFold | |||||
Defined in Optics.Internal.Optic.Subtyping Methods implies :: forall (p :: Type -> Type -> Type -> Type) r. (Constraints A_Getter p => r) -> Constraints An_AffineFold p => r Source # | |||||
| Is A_Lens A_Getter | |||||
Defined in Optics.Internal.Optic.Subtyping | |||||
| Is A_ReversedPrism A_Getter | |||||
Defined in Optics.Internal.Optic.Subtyping Methods implies :: forall (p :: Type -> Type -> Type -> Type) r. (Constraints A_ReversedPrism p => r) -> Constraints A_Getter p => r Source # | |||||
| Is An_Iso A_Getter | |||||
Defined in Optics.Internal.Optic.Subtyping | |||||
| k ~ A_Fold => JoinKinds A_Fold A_Getter k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints A_Fold p, Constraints A_Getter p) => r) -> Constraints k p => r Source # | |||||
| k ~ A_Fold => JoinKinds A_Getter A_Fold k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints A_Getter p, Constraints A_Fold p) => r) -> Constraints k p => r Source # | |||||
| k ~ A_Getter => JoinKinds A_Getter A_Getter k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints A_Getter p, Constraints A_Getter p) => r) -> Constraints k p => r Source # | |||||
| k ~ A_Getter => JoinKinds A_Getter A_Lens k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints A_Getter p, Constraints A_Lens p) => r) -> Constraints k p => r Source # | |||||
| k ~ An_AffineFold => JoinKinds A_Getter A_Prism k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints A_Getter p, Constraints A_Prism p) => r) -> Constraints k p => r Source # | |||||
| k ~ A_Getter => JoinKinds A_Getter A_ReversedPrism k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints A_Getter p, Constraints A_ReversedPrism p) => r) -> Constraints k p => r Source # | |||||
| k ~ A_Fold => JoinKinds A_Getter A_Traversal k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints A_Getter p, Constraints A_Traversal p) => r) -> Constraints k p => r Source # | |||||
| k ~ An_AffineFold => JoinKinds A_Getter An_AffineFold k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints A_Getter p, Constraints An_AffineFold p) => r) -> Constraints k p => r Source # | |||||
| k ~ An_AffineFold => JoinKinds A_Getter An_AffineTraversal k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints A_Getter p, Constraints An_AffineTraversal p) => r) -> Constraints k p => r Source # | |||||
| k ~ A_Getter => JoinKinds A_Getter An_Iso k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints A_Getter p, Constraints An_Iso p) => r) -> Constraints k p => r Source # | |||||
| k ~ A_Getter => JoinKinds A_Lens A_Getter k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints A_Lens p, Constraints A_Getter p) => r) -> Constraints k p => r Source # | |||||
| k ~ An_AffineFold => JoinKinds A_Prism A_Getter k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints A_Prism p, Constraints A_Getter p) => r) -> Constraints k p => r Source # | |||||
| k ~ A_Getter => JoinKinds A_ReversedPrism A_Getter k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints A_ReversedPrism p, Constraints A_Getter p) => r) -> Constraints k p => r Source # | |||||
| k ~ A_Fold => JoinKinds A_Traversal A_Getter k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints A_Traversal p, Constraints A_Getter p) => r) -> Constraints k p => r Source # | |||||
| k ~ An_AffineFold => JoinKinds An_AffineFold A_Getter k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints An_AffineFold p, Constraints A_Getter p) => r) -> Constraints k p => r Source # | |||||
| k ~ An_AffineFold => JoinKinds An_AffineTraversal A_Getter k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints An_AffineTraversal p, Constraints A_Getter p) => r) -> Constraints k p => r Source # | |||||
| k ~ A_Getter => JoinKinds An_Iso A_Getter k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints An_Iso p, Constraints A_Getter p) => r) -> Constraints k p => r Source # | |||||
| (s ~ t, a ~ b) => IxOptic A_Getter s t a b | |||||
| (s ~ t, a ~ b) => ToReadOnly A_Getter s t a b | |||||
Defined in Optics.ReadOnly Associated Types
| |||||
| (Functor f, f ~ g, s ~ t, a ~ b) => MappingOptic A_Getter f g s t a b |
| ||||
Defined in Optics.Mapping Associated Types
Methods mapping :: forall (is :: IxList). AcceptsEmptyIndices "mapping" is => Optic A_Getter is s t a b -> Optic (MappedOptic A_Getter) is (f s) (g t) (f a) (g b) Source # | |||||
| type MappedOptic A_Getter | |||||
Defined in Optics.Mapping | |||||
| type ReversedOptic A_Getter | |||||
Defined in Optics.Re | |||||
| type ReadOnlyOptic A_Getter | |||||
Defined in Optics.ReadOnly | |||||
Tag for a setter.
Instances
| Is A_Lens A_Setter | |
Defined in Optics.Internal.Optic.Subtyping | |
| Is A_Prism A_Setter | |
Defined in Optics.Internal.Optic.Subtyping | |
| Is A_Traversal A_Setter | |
Defined in Optics.Internal.Optic.Subtyping Methods implies :: forall (p :: Type -> Type -> Type -> Type) r. (Constraints A_Traversal p => r) -> Constraints A_Setter p => r Source # | |
| Is An_AffineTraversal A_Setter | |
Defined in Optics.Internal.Optic.Subtyping Methods implies :: forall (p :: Type -> Type -> Type -> Type) r. (Constraints An_AffineTraversal p => r) -> Constraints A_Setter p => r Source # | |
| Is An_Iso A_Setter | |
Defined in Optics.Internal.Optic.Subtyping | |
| k ~ A_Setter => JoinKinds A_Lens A_Setter k | |
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints A_Lens p, Constraints A_Setter p) => r) -> Constraints k p => r Source # | |
| k ~ A_Setter => JoinKinds A_Prism A_Setter k | |
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints A_Prism p, Constraints A_Setter p) => r) -> Constraints k p => r Source # | |
| k ~ A_Setter => JoinKinds A_Setter A_Lens k | |
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints A_Setter p, Constraints A_Lens p) => r) -> Constraints k p => r Source # | |
| k ~ A_Setter => JoinKinds A_Setter A_Prism k | |
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints A_Setter p, Constraints A_Prism p) => r) -> Constraints k p => r Source # | |
| k ~ A_Setter => JoinKinds A_Setter A_Setter k | |
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints A_Setter p, Constraints A_Setter p) => r) -> Constraints k p => r Source # | |
| k ~ A_Setter => JoinKinds A_Setter A_Traversal k | |
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints A_Setter p, Constraints A_Traversal p) => r) -> Constraints k p => r Source # | |
| k ~ A_Setter => JoinKinds A_Setter An_AffineTraversal k | |
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints A_Setter p, Constraints An_AffineTraversal p) => r) -> Constraints k p => r Source # | |
| k ~ A_Setter => JoinKinds A_Setter An_Iso k | |
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints A_Setter p, Constraints An_Iso p) => r) -> Constraints k p => r Source # | |
| k ~ A_Setter => JoinKinds A_Traversal A_Setter k | |
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints A_Traversal p, Constraints A_Setter p) => r) -> Constraints k p => r Source # | |
| k ~ A_Setter => JoinKinds An_AffineTraversal A_Setter k | |
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints An_AffineTraversal p, Constraints A_Setter p) => r) -> Constraints k p => r Source # | |
| k ~ A_Setter => JoinKinds An_Iso A_Setter k | |
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints An_Iso p, Constraints A_Setter p) => r) -> Constraints k p => r Source # | |
| IxOptic A_Setter s t a b | |
data An_AffineTraversal Source #
Tag for an affine traversal.
Instances
| ArrowChoice arr => ArrowOptic An_AffineTraversal arr | |||||
Defined in Optics.Arrow | |||||
| Is A_Lens An_AffineTraversal | |||||
Defined in Optics.Internal.Optic.Subtyping Methods implies :: forall (p :: Type -> Type -> Type -> Type) r. (Constraints A_Lens p => r) -> Constraints An_AffineTraversal p => r Source # | |||||
| Is A_Prism An_AffineTraversal | |||||
Defined in Optics.Internal.Optic.Subtyping Methods implies :: forall (p :: Type -> Type -> Type -> Type) r. (Constraints A_Prism p => r) -> Constraints An_AffineTraversal p => r Source # | |||||
| Is An_AffineTraversal A_Fold | |||||
Defined in Optics.Internal.Optic.Subtyping Methods implies :: forall (p :: Type -> Type -> Type -> Type) r. (Constraints An_AffineTraversal p => r) -> Constraints A_Fold p => r Source # | |||||
| Is An_AffineTraversal A_Setter | |||||
Defined in Optics.Internal.Optic.Subtyping Methods implies :: forall (p :: Type -> Type -> Type -> Type) r. (Constraints An_AffineTraversal p => r) -> Constraints A_Setter p => r Source # | |||||
| Is An_AffineTraversal A_Traversal | |||||
Defined in Optics.Internal.Optic.Subtyping Methods implies :: forall (p :: Type -> Type -> Type -> Type) r. (Constraints An_AffineTraversal p => r) -> Constraints A_Traversal p => r Source # | |||||
| Is An_AffineTraversal An_AffineFold | |||||
Defined in Optics.Internal.Optic.Subtyping Methods implies :: forall (p :: Type -> Type -> Type -> Type) r. (Constraints An_AffineTraversal p => r) -> Constraints An_AffineFold p => r Source # | |||||
| Is An_Iso An_AffineTraversal | |||||
Defined in Optics.Internal.Optic.Subtyping Methods implies :: forall (p :: Type -> Type -> Type -> Type) r. (Constraints An_Iso p => r) -> Constraints An_AffineTraversal p => r Source # | |||||
| k ~ A_Fold => JoinKinds A_Fold An_AffineTraversal k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints A_Fold p, Constraints An_AffineTraversal p) => r) -> Constraints k p => r Source # | |||||
| k ~ An_AffineFold => JoinKinds A_Getter An_AffineTraversal k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints A_Getter p, Constraints An_AffineTraversal p) => r) -> Constraints k p => r Source # | |||||
| k ~ An_AffineTraversal => JoinKinds A_Lens An_AffineTraversal k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints A_Lens p, Constraints An_AffineTraversal p) => r) -> Constraints k p => r Source # | |||||
| k ~ An_AffineTraversal => JoinKinds A_Prism An_AffineTraversal k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints A_Prism p, Constraints An_AffineTraversal p) => r) -> Constraints k p => r Source # | |||||
| k ~ An_AffineFold => JoinKinds A_ReversedPrism An_AffineTraversal k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints A_ReversedPrism p, Constraints An_AffineTraversal p) => r) -> Constraints k p => r Source # | |||||
| k ~ A_Setter => JoinKinds A_Setter An_AffineTraversal k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints A_Setter p, Constraints An_AffineTraversal p) => r) -> Constraints k p => r Source # | |||||
| k ~ A_Traversal => JoinKinds A_Traversal An_AffineTraversal k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints A_Traversal p, Constraints An_AffineTraversal p) => r) -> Constraints k p => r Source # | |||||
| k ~ An_AffineFold => JoinKinds An_AffineFold An_AffineTraversal k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints An_AffineFold p, Constraints An_AffineTraversal p) => r) -> Constraints k p => r Source # | |||||
| k ~ A_Fold => JoinKinds An_AffineTraversal A_Fold k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints An_AffineTraversal p, Constraints A_Fold p) => r) -> Constraints k p => r Source # | |||||
| k ~ An_AffineFold => JoinKinds An_AffineTraversal A_Getter k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints An_AffineTraversal p, Constraints A_Getter p) => r) -> Constraints k p => r Source # | |||||
| k ~ An_AffineTraversal => JoinKinds An_AffineTraversal A_Lens k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints An_AffineTraversal p, Constraints A_Lens p) => r) -> Constraints k p => r Source # | |||||
| k ~ An_AffineTraversal => JoinKinds An_AffineTraversal A_Prism k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints An_AffineTraversal p, Constraints A_Prism p) => r) -> Constraints k p => r Source # | |||||
| k ~ An_AffineFold => JoinKinds An_AffineTraversal A_ReversedPrism k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints An_AffineTraversal p, Constraints A_ReversedPrism p) => r) -> Constraints k p => r Source # | |||||
| k ~ A_Setter => JoinKinds An_AffineTraversal A_Setter k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints An_AffineTraversal p, Constraints A_Setter p) => r) -> Constraints k p => r Source # | |||||
| k ~ A_Traversal => JoinKinds An_AffineTraversal A_Traversal k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints An_AffineTraversal p, Constraints A_Traversal p) => r) -> Constraints k p => r Source # | |||||
| k ~ An_AffineFold => JoinKinds An_AffineTraversal An_AffineFold k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints An_AffineTraversal p, Constraints An_AffineFold p) => r) -> Constraints k p => r Source # | |||||
| k ~ An_AffineTraversal => JoinKinds An_AffineTraversal An_AffineTraversal k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints An_AffineTraversal p, Constraints An_AffineTraversal p) => r) -> Constraints k p => r Source # | |||||
| k ~ An_AffineTraversal => JoinKinds An_AffineTraversal An_Iso k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints An_AffineTraversal p, Constraints An_Iso p) => r) -> Constraints k p => r Source # | |||||
| k ~ An_AffineTraversal => JoinKinds An_Iso An_AffineTraversal k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints An_Iso p, Constraints An_AffineTraversal p) => r) -> Constraints k p => r Source # | |||||
| IxOptic An_AffineTraversal s t a b | |||||
Defined in Optics.Indexed.Core Methods noIx :: forall (is :: IxList). NonEmptyIndices is => Optic An_AffineTraversal is s t a b -> Optic An_AffineTraversal NoIx s t a b Source # | |||||
| ToReadOnly An_AffineTraversal s t a b | |||||
Defined in Optics.ReadOnly Associated Types
Methods getting :: forall (is :: IxList). Optic An_AffineTraversal is s t a b -> Optic' (ReadOnlyOptic An_AffineTraversal) is s a Source # | |||||
| type ReadOnlyOptic An_AffineTraversal | |||||
Defined in Optics.ReadOnly | |||||
Tag for a lens.
Instances
| ReversibleOptic A_Lens | |||||
Defined in Optics.Re Associated Types
Methods re :: forall (is :: IxList) s t a b. AcceptsEmptyIndices "re" is => Optic A_Lens is s t a b -> Optic (ReversedOptic A_Lens) is b a t s Source # | |||||
| Arrow arr => ArrowOptic A_Lens arr | |||||
| Is A_Lens A_Fold | |||||
Defined in Optics.Internal.Optic.Subtyping | |||||
| Is A_Lens A_Getter | |||||
Defined in Optics.Internal.Optic.Subtyping | |||||
| Is A_Lens A_Setter | |||||
Defined in Optics.Internal.Optic.Subtyping | |||||
| Is A_Lens A_Traversal | |||||
Defined in Optics.Internal.Optic.Subtyping Methods implies :: forall (p :: Type -> Type -> Type -> Type) r. (Constraints A_Lens p => r) -> Constraints A_Traversal p => r Source # | |||||
| Is A_Lens An_AffineFold | |||||
Defined in Optics.Internal.Optic.Subtyping Methods implies :: forall (p :: Type -> Type -> Type -> Type) r. (Constraints A_Lens p => r) -> Constraints An_AffineFold p => r Source # | |||||
| Is A_Lens An_AffineTraversal | |||||
Defined in Optics.Internal.Optic.Subtyping Methods implies :: forall (p :: Type -> Type -> Type -> Type) r. (Constraints A_Lens p => r) -> Constraints An_AffineTraversal p => r Source # | |||||
| Is An_Iso A_Lens | |||||
Defined in Optics.Internal.Optic.Subtyping | |||||
| k ~ A_Fold => JoinKinds A_Fold A_Lens k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints A_Fold p, Constraints A_Lens p) => r) -> Constraints k p => r Source # | |||||
| k ~ A_Getter => JoinKinds A_Getter A_Lens k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints A_Getter p, Constraints A_Lens p) => r) -> Constraints k p => r Source # | |||||
| k ~ A_Fold => JoinKinds A_Lens A_Fold k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints A_Lens p, Constraints A_Fold p) => r) -> Constraints k p => r Source # | |||||
| k ~ A_Getter => JoinKinds A_Lens A_Getter k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints A_Lens p, Constraints A_Getter p) => r) -> Constraints k p => r Source # | |||||
| k ~ A_Lens => JoinKinds A_Lens A_Lens k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints A_Lens p, Constraints A_Lens p) => r) -> Constraints k p => r Source # | |||||
| k ~ An_AffineTraversal => JoinKinds A_Lens A_Prism k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints A_Lens p, Constraints A_Prism p) => r) -> Constraints k p => r Source # | |||||
| k ~ A_Getter => JoinKinds A_Lens A_ReversedPrism k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints A_Lens p, Constraints A_ReversedPrism p) => r) -> Constraints k p => r Source # | |||||
| k ~ A_Setter => JoinKinds A_Lens A_Setter k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints A_Lens p, Constraints A_Setter p) => r) -> Constraints k p => r Source # | |||||
| k ~ A_Traversal => JoinKinds A_Lens A_Traversal k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints A_Lens p, Constraints A_Traversal p) => r) -> Constraints k p => r Source # | |||||
| k ~ An_AffineFold => JoinKinds A_Lens An_AffineFold k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints A_Lens p, Constraints An_AffineFold p) => r) -> Constraints k p => r Source # | |||||
| k ~ An_AffineTraversal => JoinKinds A_Lens An_AffineTraversal k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints A_Lens p, Constraints An_AffineTraversal p) => r) -> Constraints k p => r Source # | |||||
| k ~ A_Lens => JoinKinds A_Lens An_Iso k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints A_Lens p, Constraints An_Iso p) => r) -> Constraints k p => r Source # | |||||
| k ~ An_AffineTraversal => JoinKinds A_Prism A_Lens k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints A_Prism p, Constraints A_Lens p) => r) -> Constraints k p => r Source # | |||||
| k ~ A_Getter => JoinKinds A_ReversedPrism A_Lens k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints A_ReversedPrism p, Constraints A_Lens p) => r) -> Constraints k p => r Source # | |||||
| k ~ A_Setter => JoinKinds A_Setter A_Lens k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints A_Setter p, Constraints A_Lens p) => r) -> Constraints k p => r Source # | |||||
| k ~ A_Traversal => JoinKinds A_Traversal A_Lens k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints A_Traversal p, Constraints A_Lens p) => r) -> Constraints k p => r Source # | |||||
| k ~ An_AffineFold => JoinKinds An_AffineFold A_Lens k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints An_AffineFold p, Constraints A_Lens p) => r) -> Constraints k p => r Source # | |||||
| k ~ An_AffineTraversal => JoinKinds An_AffineTraversal A_Lens k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints An_AffineTraversal p, Constraints A_Lens p) => r) -> Constraints k p => r Source # | |||||
| k ~ A_Lens => JoinKinds An_Iso A_Lens k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints An_Iso p, Constraints A_Lens p) => r) -> Constraints k p => r Source # | |||||
| IxOptic A_Lens s t a b | |||||
| ToReadOnly A_Lens s t a b | |||||
Defined in Optics.ReadOnly Associated Types
| |||||
| (Functor f, f ~ g, s ~ t, a ~ b) => MappingOptic A_Lens f g s t a b | |||||
Defined in Optics.Mapping Associated Types
Methods mapping :: forall (is :: IxList). AcceptsEmptyIndices "mapping" is => Optic A_Lens is s t a b -> Optic (MappedOptic A_Lens) is (f s) (g t) (f a) (g b) Source # | |||||
| GFieldImpl name s t a b => GenericOptic repDefined (name :: Symbol) A_Lens s t a b | |||||
Defined in Optics.Label Methods genericOptic :: Optic A_Lens NoIx s t a b | |||||
| type MappedOptic A_Lens | |||||
Defined in Optics.Mapping | |||||
| type ReversedOptic A_Lens | |||||
Defined in Optics.Re | |||||
| type ReadOnlyOptic A_Lens | |||||
Defined in Optics.ReadOnly | |||||
Tag for an iso.
Instances
| ReversibleOptic An_Iso | |||||
Defined in Optics.Re Associated Types
Methods re :: forall (is :: IxList) s t a b. AcceptsEmptyIndices "re" is => Optic An_Iso is s t a b -> Optic (ReversedOptic An_Iso) is b a t s Source # | |||||
| Arrow arr => ArrowOptic An_Iso arr | |||||
| Is An_Iso A_Fold | |||||
Defined in Optics.Internal.Optic.Subtyping | |||||
| Is An_Iso A_Getter | |||||
Defined in Optics.Internal.Optic.Subtyping | |||||
| Is An_Iso A_Lens | |||||
Defined in Optics.Internal.Optic.Subtyping | |||||
| Is An_Iso A_Prism | |||||
Defined in Optics.Internal.Optic.Subtyping | |||||
| Is An_Iso A_ReversedLens | |||||
Defined in Optics.Internal.Optic.Subtyping Methods implies :: forall (p :: Type -> Type -> Type -> Type) r. (Constraints An_Iso p => r) -> Constraints A_ReversedLens p => r Source # | |||||
| Is An_Iso A_ReversedPrism | |||||
Defined in Optics.Internal.Optic.Subtyping Methods implies :: forall (p :: Type -> Type -> Type -> Type) r. (Constraints An_Iso p => r) -> Constraints A_ReversedPrism p => r Source # | |||||
| Is An_Iso A_Review | |||||
Defined in Optics.Internal.Optic.Subtyping | |||||
| Is An_Iso A_Setter | |||||
Defined in Optics.Internal.Optic.Subtyping | |||||
| Is An_Iso A_Traversal | |||||
Defined in Optics.Internal.Optic.Subtyping Methods implies :: forall (p :: Type -> Type -> Type -> Type) r. (Constraints An_Iso p => r) -> Constraints A_Traversal p => r Source # | |||||
| Is An_Iso An_AffineFold | |||||
Defined in Optics.Internal.Optic.Subtyping Methods implies :: forall (p :: Type -> Type -> Type -> Type) r. (Constraints An_Iso p => r) -> Constraints An_AffineFold p => r Source # | |||||
| Is An_Iso An_AffineTraversal | |||||
Defined in Optics.Internal.Optic.Subtyping Methods implies :: forall (p :: Type -> Type -> Type -> Type) r. (Constraints An_Iso p => r) -> Constraints An_AffineTraversal p => r Source # | |||||
| k ~ A_Fold => JoinKinds A_Fold An_Iso k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints A_Fold p, Constraints An_Iso p) => r) -> Constraints k p => r Source # | |||||
| k ~ A_Getter => JoinKinds A_Getter An_Iso k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints A_Getter p, Constraints An_Iso p) => r) -> Constraints k p => r Source # | |||||
| k ~ A_Lens => JoinKinds A_Lens An_Iso k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints A_Lens p, Constraints An_Iso p) => r) -> Constraints k p => r Source # | |||||
| k ~ A_Prism => JoinKinds A_Prism An_Iso k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints A_Prism p, Constraints An_Iso p) => r) -> Constraints k p => r Source # | |||||
| k ~ A_ReversedLens => JoinKinds A_ReversedLens An_Iso k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints A_ReversedLens p, Constraints An_Iso p) => r) -> Constraints k p => r Source # | |||||
| k ~ A_ReversedPrism => JoinKinds A_ReversedPrism An_Iso k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints A_ReversedPrism p, Constraints An_Iso p) => r) -> Constraints k p => r Source # | |||||
| k ~ A_Review => JoinKinds A_Review An_Iso k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints A_Review p, Constraints An_Iso p) => r) -> Constraints k p => r Source # | |||||
| k ~ A_Setter => JoinKinds A_Setter An_Iso k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints A_Setter p, Constraints An_Iso p) => r) -> Constraints k p => r Source # | |||||
| k ~ A_Traversal => JoinKinds A_Traversal An_Iso k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints A_Traversal p, Constraints An_Iso p) => r) -> Constraints k p => r Source # | |||||
| k ~ An_AffineFold => JoinKinds An_AffineFold An_Iso k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints An_AffineFold p, Constraints An_Iso p) => r) -> Constraints k p => r Source # | |||||
| k ~ An_AffineTraversal => JoinKinds An_AffineTraversal An_Iso k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints An_AffineTraversal p, Constraints An_Iso p) => r) -> Constraints k p => r Source # | |||||
| k ~ A_Fold => JoinKinds An_Iso A_Fold k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints An_Iso p, Constraints A_Fold p) => r) -> Constraints k p => r Source # | |||||
| k ~ A_Getter => JoinKinds An_Iso A_Getter k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints An_Iso p, Constraints A_Getter p) => r) -> Constraints k p => r Source # | |||||
| k ~ A_Lens => JoinKinds An_Iso A_Lens k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints An_Iso p, Constraints A_Lens p) => r) -> Constraints k p => r Source # | |||||
| k ~ A_Prism => JoinKinds An_Iso A_Prism k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints An_Iso p, Constraints A_Prism p) => r) -> Constraints k p => r Source # | |||||
| k ~ A_ReversedLens => JoinKinds An_Iso A_ReversedLens k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints An_Iso p, Constraints A_ReversedLens p) => r) -> Constraints k p => r Source # | |||||
| k ~ A_ReversedPrism => JoinKinds An_Iso A_ReversedPrism k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints An_Iso p, Constraints A_ReversedPrism p) => r) -> Constraints k p => r Source # | |||||
| k ~ A_Review => JoinKinds An_Iso A_Review k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints An_Iso p, Constraints A_Review p) => r) -> Constraints k p => r Source # | |||||
| k ~ A_Setter => JoinKinds An_Iso A_Setter k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints An_Iso p, Constraints A_Setter p) => r) -> Constraints k p => r Source # | |||||
| k ~ A_Traversal => JoinKinds An_Iso A_Traversal k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints An_Iso p, Constraints A_Traversal p) => r) -> Constraints k p => r Source # | |||||
| k ~ An_AffineFold => JoinKinds An_Iso An_AffineFold k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints An_Iso p, Constraints An_AffineFold p) => r) -> Constraints k p => r Source # | |||||
| k ~ An_AffineTraversal => JoinKinds An_Iso An_AffineTraversal k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints An_Iso p, Constraints An_AffineTraversal p) => r) -> Constraints k p => r Source # | |||||
| k ~ An_Iso => JoinKinds An_Iso An_Iso k | |||||
Defined in Optics.Internal.Optic.Subtyping Methods joinKinds :: forall (p :: Type -> Type -> Type -> Type) r. ((Constraints An_Iso p, Constraints An_Iso p) => r) -> Constraints k p => r Source # | |||||
| ToReadOnly An_Iso s t a b | |||||
Defined in Optics.ReadOnly Associated Types
| |||||
| (Functor f, Functor g) => MappingOptic An_Iso f g s t a b | |||||
Defined in Optics.Mapping Associated Types
Methods mapping :: forall (is :: IxList). AcceptsEmptyIndices "mapping" is => Optic An_Iso is s t a b -> Optic (MappedOptic An_Iso) is (f s) (g t) (f a) (g b) Source # | |||||
| type MappedOptic An_Iso | |||||
Defined in Optics.Mapping | |||||
| type ReversedOptic An_Iso | |||||
Defined in Optics.Re | |||||
| type ReadOnlyOptic An_Iso | |||||
Defined in Optics.ReadOnly | |||||
Subtyping relationship between kinds of optics.
An instance of Is k lOptic kOptic lIs A_Lens
A_TraversalIs A_Traversal A_Lens
This class needs instances for all possible combinations of tags.
Minimal complete definition
Instances
| Is A_Getter A_Fold | |
Defined in Optics.Internal.Optic.Subtyping | |
| Is A_Getter An_AffineFold | |
Defined in Optics.Internal.Optic.Subtyping Methods implies :: forall (p :: Type -> Type -> Type -> Type) r. (Constraints A_Getter p => r) -> Constraints An_AffineFold p => r Source # | |
| Is A_Lens A_Fold | |
Defined in Optics.Internal.Optic.Subtyping | |
| Is A_Lens A_Getter | |
Defined in Optics.Internal.Optic.Subtyping | |
| Is A_Lens A_Setter | |
Defined in Optics.Internal.Optic.Subtyping | |
| Is A_Lens A_Traversal | |
Defined in Optics.Internal.Optic.Subtyping Methods implies :: forall (p :: Type -> Type -> Type -> Type) r. (Constraints A_Lens p => r) -> Constraints A_Traversal p => r Source # | |
| Is A_Lens An_AffineFold | |
Defined in Optics.Internal.Optic.Subtyping Methods implies :: forall (p :: Type -> Type -> Type -> Type) r. (Constraints A_Lens p => r) -> Constraints An_AffineFold p => r Source # | |
| Is A_Lens An_AffineTraversal | |
Defined in Optics.Internal.Optic.Subtyping Methods implies :: forall (p :: Type -> Type -> Type -> Type) r. (Constraints A_Lens p => r) -> Constraints An_AffineTraversal p => r Source # | |
| Is A_Prism A_Fold | |
Defined in Optics.Internal.Optic.Subtyping | |
| Is A_Prism A_Review | |
Defined in Optics.Internal.Optic.Subtyping | |
| Is A_Prism A_Setter | |
Defined in Optics.Internal.Optic.Subtyping | |
| Is A_Prism A_Traversal | |
Defined in Optics.Internal.Optic.Subtyping Methods implies :: forall (p :: Type -> Type -> Type -> Type) r. (Constraints A_Prism p => r) -> Constraints A_Traversal p => r Source # | |
| Is A_Prism An_AffineFold | |
Defined in Optics.Internal.Optic.Subtyping Methods implies :: forall (p :: Type -> Type -> Type -> Type) r. (Constraints A_Prism p => r) -> Constraints An_AffineFold p => r Source # | |
| Is A_Prism An_AffineTraversal | |
Defined in Optics.Internal.Optic.Subtyping Methods implies :: forall (p :: Type -> Type -> Type -> Type) r. (Constraints A_Prism p => r) -> Constraints An_AffineTraversal p => r Source # | |
| Is A_ReversedLens A_Review | |
Defined in Optics.Internal.Optic.Subtyping Methods implies :: forall (p :: Type -> Type -> Type -> Type) r. (Constraints A_ReversedLens p => r) -> Constraints A_Review p => r Source # | |
| Is A_ReversedPrism A_Fold | |
Defined in Optics.Internal.Optic.Subtyping Methods implies :: forall (p :: Type -> Type -> Type -> Type) r. (Constraints A_ReversedPrism p => r) -> Constraints A_Fold p => r Source # | |
| Is A_ReversedPrism A_Getter | |
Defined in Optics.Internal.Optic.Subtyping Methods implies :: forall (p :: Type -> Type -> Type -> Type) r. (Constraints A_ReversedPrism p => r) -> Constraints A_Getter p => r Source # | |
| Is A_ReversedPrism An_AffineFold | |
Defined in Optics.Internal.Optic.Subtyping Methods implies :: forall (p :: Type -> Type -> Type -> Type) r. (Constraints A_ReversedPrism p => r) -> Constraints An_AffineFold p => r Source # | |
| Is A_Traversal A_Fold | |
Defined in Optics.Internal.Optic.Subtyping Methods implies :: forall (p :: Type -> Type -> Type -> Type) r. (Constraints A_Traversal p => r) -> Constraints A_Fold p => r Source # | |
| Is A_Traversal A_Setter | |
Defined in Optics.Internal.Optic.Subtyping Methods implies :: forall (p :: Type -> Type -> Type -> Type) r. (Constraints A_Traversal p => r) -> Constraints A_Setter p => r Source # | |
| Is An_AffineFold A_Fold | |
Defined in Optics.Internal.Optic.Subtyping Methods implies :: forall (p :: Type -> Type -> Type -> Type) r. (Constraints An_AffineFold p => r) -> Constraints A_Fold p => r Source # | |
| Is An_AffineTraversal A_Fold | |
Defined in Optics.Internal.Optic.Subtyping Methods implies :: forall (p :: Type -> Type -> Type -> Type) r. (Constraints An_AffineTraversal p => r) -> Constraints A_Fold p => r Source # | |
| Is An_AffineTraversal A_Setter | |
Defined in Optics.Internal.Optic.Subtyping Methods implies :: forall (p :: Type -> Type -> Type -> Type) r. (Constraints An_AffineTraversal p => r) -> Constraints A_Setter p => r Source # | |
| Is An_AffineTraversal A_Traversal | |
Defined in Optics.Internal.Optic.Subtyping Methods implies :: forall (p :: Type -> Type -> Type -> Type) r. (Constraints An_AffineTraversal p => r) -> Constraints A_Traversal p => r Source # | |
| Is An_AffineTraversal An_AffineFold | |
Defined in Optics.Internal.Optic.Subtyping Methods implies :: forall (p :: Type -> Type -> Type -> Type) r. (Constraints An_AffineTraversal p => r) -> Constraints An_AffineFold p => r Source # | |
| Is An_Iso A_Fold | |
Defined in Optics.Internal.Optic.Subtyping | |
| Is An_Iso A_Getter | |
Defined in Optics.Internal.Optic.Subtyping | |
| Is An_Iso A_Lens | |
Defined in Optics.Internal.Optic.Subtyping | |
| Is An_Iso A_Prism | |
Defined in Optics.Internal.Optic.Subtyping | |
| Is An_Iso A_ReversedLens | |
Defined in Optics.Internal.Optic.Subtyping Methods implies :: forall (p :: Type -> Type -> Type -> Type) r. (Constraints An_Iso p => r) -> Constraints A_ReversedLens p => r Source # | |
| Is An_Iso A_ReversedPrism | |
Defined in Optics.Internal.Optic.Subtyping Methods implies :: forall (p :: Type -> Type -> Type -> Type) r. (Constraints An_Iso p => r) -> Constraints A_ReversedPrism p => r Source # | |
| Is An_Iso A_Review | |
Defined in Optics.Internal.Optic.Subtyping | |
| Is An_Iso A_Setter | |
Defined in Optics.Internal.Optic.Subtyping | |
| Is An_Iso A_Traversal | |
Defined in Optics.Internal.Optic.Subtyping Methods implies :: forall (p :: Type -> Type -> Type -> Type) r. (Constraints An_Iso p => r) -> Constraints A_Traversal p => r Source # | |
| Is An_Iso An_AffineFold | |
Defined in Optics.Internal.Optic.Subtyping Methods implies :: forall (p :: Type -> Type -> Type -> Type) r. (Constraints An_Iso p => r) -> Constraints An_AffineFold p => r Source # | |
| Is An_Iso An_AffineTraversal | |
Defined in Optics.Internal.Optic.Subtyping Methods implies :: forall (p :: Type -> Type -> Type -> Type) r. (Constraints An_Iso p => r) -> Constraints An_AffineTraversal p => r Source # | |
| Is k k | Every kind of optic can be used as itself. |
Defined in Optics.Internal.Optic.Subtyping Methods implies :: forall (p :: Type -> Type -> Type -> Type) r. (Constraints k p => r) -> Constraints k p => r Source # | |
| (TypeError (((('ShowType k ':<>: 'Text " cannot be used as ") ':<>: 'ShowType l) ':$$: 'Text "Perhaps you meant one of these:") ':$$: ShowEliminations (EliminationForms k)) :: Constraint) => Is k l | Overlappable instance for a custom type error. |
Defined in Optics.Internal.Optic.Subtyping Methods implies :: forall (p :: Type -> Type -> Type -> Type) r. (Constraints k p => r) -> Constraints l p => r Source # | |
type AffineTraversal' s a = Optic' An_AffineTraversal NoIx s a Source #
Type synonym for a type-preserving affine traversal.
lensVL :: LensVL s t a b -> Lens s t a b Source #
Build a lens from the van Laarhoven representation.
(%?) :: forall (is :: IxList) (js :: IxList) (ks :: IxList) k k' l m s t u v a b. (AppendIndices is js ks, JoinKinds k A_Prism k', JoinKinds k' l m) => Optic k is s t (Maybe u) (Maybe v) -> Optic l js u v a b -> Optic m ks s t a b infixl 9 Source #
over' :: forall k (is :: IxList) s t a b. Is k A_Setter => Optic k is s t a b -> (a -> b) -> s -> t Source #
Apply a setter as a modifier, strictly.
TODO DOC: what exactly is the strictness property?
Example:
f :: Int -> (Int, a) -> (Int, a) f k acc | k > 0 = f (k - 1) $over'_1(+1) acc | otherwise = acc
runs in constant space, but would result in a space leak if used with over.
Note that replacing $ with $! or _1 with
_1' (which amount to the same thing) doesn't help when
over is used, because the first coordinate of a pair is never forced.
(%!~) :: forall k (is :: IxList) s t a b. Is k A_Setter => Optic k is s t a b -> (a -> b) -> s -> t infixr 4 Source #
Infix version of over'.
Instances
| Exception TOMLError | |
Defined in TOML.Error Methods toException :: TOMLError -> SomeException # fromException :: SomeException -> Maybe TOMLError # displayException :: TOMLError -> String # | |
| Show TOMLError | |
| Eq TOMLError | |
renderTOMLError :: TOMLError -> Text Source #
class DecodeTOML a where Source #
A type class containing the default Decoder for the given type.
See the docs for Decoder for examples.
Methods
tomlDecoder :: Decoder a Source #
Instances
| DecodeTOML Version | |
Defined in TOML.Decode Methods | |
| DecodeTOML Void | |
Defined in TOML.Decode Methods | |
| DecodeTOML Int16 | |
Defined in TOML.Decode Methods | |
| DecodeTOML Int32 | |
Defined in TOML.Decode Methods | |
| DecodeTOML Int64 | |
Defined in TOML.Decode Methods | |
| DecodeTOML Int8 | |
Defined in TOML.Decode Methods | |
| DecodeTOML Word16 | |
Defined in TOML.Decode Methods | |
| DecodeTOML Word32 | |
Defined in TOML.Decode Methods | |
| DecodeTOML Word64 | |
Defined in TOML.Decode Methods | |
| DecodeTOML Word8 | |
Defined in TOML.Decode Methods | |
| DecodeTOML IntSet | |
Defined in TOML.Decode Methods | |
| DecodeTOML Ordering | |
Defined in TOML.Decode Methods | |
| DecodeTOML CommandLoggingToml Source # | |
Defined in Shrun.Configuration.Data.CommandLogging Methods | |
| DecodeTOML PollInterval Source # | |
Defined in Shrun.Configuration.Data.CommandLogging.PollInterval Methods | |
| DecodeTOML ReadSize Source # | |
Defined in Shrun.Configuration.Data.CommandLogging.ReadSize Methods | |
| DecodeTOML CommonLoggingToml Source # | |
Defined in Shrun.Configuration.Data.CommonLogging Methods | |
| DecodeTOML KeyHideSwitch Source # | |
Defined in Shrun.Configuration.Data.CommonLogging.KeyHideSwitch Methods | |
| DecodeTOML ConsoleLoggingToml Source # | |
Defined in Shrun.Configuration.Data.ConsoleLogging Methods | |
| DecodeTOML TimerFormat Source # | |
Defined in Shrun.Configuration.Data.ConsoleLogging.TimerFormat Methods | |
| DecodeTOML Timeout Source # | |
Defined in Shrun.Configuration.Data.Core.Timeout Methods | |
| DecodeTOML FileLoggingToml Source # | |
Defined in Shrun.Configuration.Data.FileLogging Methods | |
| DecodeTOML FileMode Source # | |
Defined in Shrun.Configuration.Data.FileLogging.FileMode Methods | |
| DecodeTOML FilePathDefault Source # | |
Defined in Shrun.Configuration.Data.FileLogging.FilePathDefault Methods | |
| DecodeTOML FileSizeMode Source # | |
Defined in Shrun.Configuration.Data.FileLogging.FileSizeMode Methods | |
| DecodeTOML NotifyToml Source # | |
Defined in Shrun.Configuration.Data.Notify Methods | |
| DecodeTOML LineTruncation Source # | |
Defined in Shrun.Configuration.Data.Truncation Methods | |
| DecodeTOML Toml Source # | |
Defined in Shrun.Configuration.Toml Methods | |
| DecodeTOML KeyVal Source # | |
Defined in Shrun.Configuration.Toml.Legend Methods | |
| DecodeTOML NotifyAction Source # | |
Defined in Shrun.Notify.Types Methods | |
| DecodeTOML NotifySystemToml Source # | |
Defined in Shrun.Notify.Types Methods | |
| DecodeTOML NotifyTimeout Source # | |
Defined in Shrun.Notify.Types Methods | |
| DecodeTOML Text | |
Defined in TOML.Decode Methods | |
| DecodeTOML Text | |
Defined in TOML.Decode Methods | |
| DecodeTOML CalendarDiffDays | |
Defined in TOML.Decode Methods | |
| DecodeTOML Day | |
Defined in TOML.Decode Methods tomlDecoder :: Decoder Day Source # | |
| DecodeTOML DayOfWeek | |
Defined in TOML.Decode Methods | |
| DecodeTOML DiffTime | |
Defined in TOML.Decode Methods | |
| DecodeTOML NominalDiffTime | |
Defined in TOML.Decode Methods | |
| DecodeTOML SystemTime | |
Defined in TOML.Decode Methods | |
| DecodeTOML UTCTime | |
Defined in TOML.Decode Methods | |
| DecodeTOML CalendarDiffTime | |
Defined in TOML.Decode Methods | |
| DecodeTOML LocalTime | |
Defined in TOML.Decode Methods | |
| DecodeTOML TimeOfDay | |
Defined in TOML.Decode Methods | |
| DecodeTOML ZonedTime | |
Defined in TOML.Decode Methods | |
| DecodeTOML Value | |
Defined in TOML.Decode Methods | |
| DecodeTOML String | |
Defined in TOML.Decode Methods | |
| DecodeTOML Integer | |
Defined in TOML.Decode Methods | |
| DecodeTOML Natural | |
Defined in TOML.Decode Methods | |
| DecodeTOML () | |
Defined in TOML.Decode Methods tomlDecoder :: Decoder () Source # | |
| DecodeTOML Bool | |
Defined in TOML.Decode Methods | |
| DecodeTOML Char | |
Defined in TOML.Decode Methods | |
| DecodeTOML Double | |
Defined in TOML.Decode Methods | |
| DecodeTOML Float | |
Defined in TOML.Decode Methods | |
| DecodeTOML Int | |
Defined in TOML.Decode Methods tomlDecoder :: Decoder Int Source # | |
| DecodeTOML Word | |
Defined in TOML.Decode Methods | |
| DecodeTOML a => DecodeTOML (Identity a) | |
Defined in TOML.Decode Methods tomlDecoder :: Decoder (Identity a) Source # | |
| DecodeTOML a => DecodeTOML (First a) | |
Defined in TOML.Decode Methods tomlDecoder :: Decoder (First a) Source # | |
| DecodeTOML a => DecodeTOML (Last a) | |
Defined in TOML.Decode Methods tomlDecoder :: Decoder (Last a) Source # | |
| DecodeTOML a => DecodeTOML (First a) | |
Defined in TOML.Decode Methods tomlDecoder :: Decoder (First a) Source # | |
| DecodeTOML a => DecodeTOML (Last a) | |
Defined in TOML.Decode Methods tomlDecoder :: Decoder (Last a) Source # | |
| DecodeTOML a => DecodeTOML (Max a) | |
Defined in TOML.Decode Methods tomlDecoder :: Decoder (Max a) Source # | |
| DecodeTOML a => DecodeTOML (Min a) | |
Defined in TOML.Decode Methods tomlDecoder :: Decoder (Min a) Source # | |
| DecodeTOML a => DecodeTOML (Dual a) | |
Defined in TOML.Decode Methods tomlDecoder :: Decoder (Dual a) Source # | |
| DecodeTOML a => DecodeTOML (NonEmpty a) | |
Defined in TOML.Decode Methods tomlDecoder :: Decoder (NonEmpty a) Source # | |
| Integral a => DecodeTOML (Ratio a) | |
Defined in TOML.Decode Methods tomlDecoder :: Decoder (Ratio a) Source # | |
| DecodeTOML a => DecodeTOML (IntMap a) | |
Defined in TOML.Decode Methods tomlDecoder :: Decoder (IntMap a) Source # | |
| DecodeTOML a => DecodeTOML (Seq a) | |
Defined in TOML.Decode Methods tomlDecoder :: Decoder (Seq a) Source # | |
| (DecodeTOML a, Ord a) => DecodeTOML (Set a) | |
Defined in TOML.Decode Methods tomlDecoder :: Decoder (Set a) Source # | |
| DecodeTOML (StripControl t) Source # | |
Defined in Shrun.Configuration.Data.StripControl Methods tomlDecoder :: Decoder (StripControl t) Source # | |
| DecodeTOML (Truncation a) Source # | |
Defined in Shrun.Configuration.Data.Truncation Methods tomlDecoder :: Decoder (Truncation a) Source # | |
| DecodeTOML a => DecodeTOML (Maybe a) | Since TOML doesn't support literal NULLs, this will only ever return |
Defined in TOML.Decode Methods tomlDecoder :: Decoder (Maybe a) Source # | |
| DecodeTOML a => DecodeTOML [a] | |
Defined in TOML.Decode Methods tomlDecoder :: Decoder [a] Source # | |
| (DecodeTOML a, DecodeTOML b) => DecodeTOML (Either a b) | |
Defined in TOML.Decode Methods tomlDecoder :: Decoder (Either a b) Source # | |
| HasResolution a => DecodeTOML (Fixed a) | |
Defined in TOML.Decode Methods tomlDecoder :: Decoder (Fixed a) Source # | |
| DecodeTOML (Proxy a) | |
Defined in TOML.Decode Methods tomlDecoder :: Decoder (Proxy a) Source # | |
| (IsString k, Ord k, DecodeTOML v) => DecodeTOML (Map k v) | |
Defined in TOML.Decode Methods tomlDecoder :: Decoder (Map k v) Source # | |
| (DecodeTOML a, DecodeTOML b) => DecodeTOML (a, b) | |
Defined in TOML.Decode Methods tomlDecoder :: Decoder (a, b) Source # | |
| DecodeTOML a => DecodeTOML (Const a b) | |
Defined in TOML.Decode Methods tomlDecoder :: Decoder (Const a b) Source # | |
| (DecodeTOML a, DecodeTOML b, DecodeTOML c) => DecodeTOML (a, b, c) | |
Defined in TOML.Decode Methods tomlDecoder :: Decoder (a, b, c) Source # | |
| (DecodeTOML a, DecodeTOML b, DecodeTOML c, DecodeTOML d) => DecodeTOML (a, b, c, d) | |
Defined in TOML.Decode Methods tomlDecoder :: Decoder (a, b, c, d) Source # | |
makeDecoder :: (Value -> DecodeM a) -> Decoder a Source #
Manually implement a Decoder with the given function.
invalidValue :: Text -> Value -> DecodeM a Source #
Throw an error indicating that the given Value is invalid.
makeDecoder $ \v ->
case v of
Integer 42 -> invalidValue "We don't like this number" v
_ -> runDecoder tomlDecoder v
-- or alternatively,
tomlDecoder >>= case
42 -> makeDecoder $ invalidValue "We don't like this number"
v -> pure v
getFieldOpt :: DecodeTOML a => Text -> Decoder (Maybe a) Source #
Decode a field in a TOML Value, or Nothing if the field doesn't exist.
Equivalent to getFieldsOpt with a single-element list.
a = 1
-- MyConfig (Just 1) Nothing MyConfig <$> getFieldOpt "a" <*> getFieldOpt "b"
getFieldOptWith :: Decoder a -> Text -> Decoder (Maybe a) Source #
Same as getFieldOpt, except with the given Decoder.