Copyright | (c) 2013-2023 Brendan Hay |
---|---|
License | Mozilla Public License, v. 2.0. |
Maintainer | Brendan Hay <brendan.g.hay+amazonka@gmail.com> |
Stability | provisional |
Portability | non-portable (GHC extensions) |
Safe Haskell | None |
Language | Haskell2010 |
Amazonka.Prelude
Description
An intentionally limited set of prelude exports to control backward compatibility and simplify code generation.
Please consider long and hard before adding any addtional types exports to this module - they should either be in pervasive use throughout the project or have zero ambiguity. If you ever are forced to disambiguate at any point, it's a bad export.
Try and avoid any value, operator, or symbol exports, if possible. Most of the ones here exist to ease legacy code-migration.
Synopsis
- module Control.Monad
- module Control.Monad.IO.Class
- module Control.Monad.Trans.Class
- module Data.Bifoldable
- module Data.Bifunctor
- module Data.Bitraversable
- module Data.Coerce
- module Data.Functor.Identity
- module Data.Int
- module Data.Maybe
- module Data.String
- module Prelude
- data Symbol
- data Natural
- data Void
- class IsList l where
- data NonEmpty a = a :| [a]
- class Generic a
- type Type = TYPE LiftedRep
- data HashMap k v
- data ByteString
- data Text
- data Proxy (t :: k) = Proxy
- class Applicative f => Alternative (f :: Type -> Type) where
- (<|>) :: f a -> f a -> f a
- data Word16
- data Word32
- data Word64
- data Word8
- data Scientific
- data UTCTime
- class Eq a => Hashable a where
- hashWithSalt :: Int -> a -> Int
- hash :: a -> Int
- data First a
- class (Typeable e, Show e) => Exception e
- class KnownNat (n :: Nat)
- class KnownSymbol (n :: Symbol)
- data SomeException
- (<&>) :: Functor f => f a -> (a -> b) -> f b
- (&) :: a -> (a -> b) -> b
- type Nat = Natural
- type family Item l
- data CI s
- class MonadIO m => MonadResource (m :: Type -> Type)
- data DiffTime
- class NFData a where
- rnf :: a -> ()
- data Day
- type Traversal' s a = Traversal s s a a
- type Setter' s a = Setter s s a a
- type Iso' s a = Iso s s a a
- type Prism' s a = Prism s s a a
- type Lens' s a = Lens s s a a
- data HashSet a
- data NominalDiffTime
- type TextLazy = Text
- type TextBuilder = Builder
- type ByteStringLazy = ByteString
- type ByteStringBuilder = Builder
Documentation
module Control.Monad
module Control.Monad.IO.Class
module Control.Monad.Trans.Class
module Data.Bifoldable
module Data.Bifunctor
module Data.Bitraversable
module Data.Coerce
module Data.Functor.Identity
module Data.Int
module Data.Maybe
module Data.String
module Prelude
(Kind) This is the kind of type-level symbols.
Instances
SingKind Symbol | Since: base-4.9.0.0 | ||||
Defined in GHC.Generics Associated Types
| |||||
TestCoercion SSymbol | Since: base-4.18.0.0 | ||||
Defined in GHC.TypeLits | |||||
TestEquality SSymbol | Since: base-4.18.0.0 | ||||
Defined in GHC.TypeLits | |||||
KnownSymbol a => SingI (a :: Symbol) | Since: base-4.9.0.0 | ||||
Defined in GHC.Generics Methods sing :: Sing a | |||||
KnownSymbol n => Reifies (n :: Symbol) String | |||||
Defined in Data.Reflection | |||||
type DemoteRep Symbol | |||||
Defined in GHC.Generics | |||||
data Sing (s :: Symbol) | |||||
Defined in GHC.Generics | |||||
type Compare (a :: Symbol) (b :: Symbol) | |||||
Defined in Data.Type.Ord |
Natural number
Invariant: numbers <= 0xffffffffffffffff use the NS
constructor
Instances
Uninhabited data type
Since: base-4.8.0.0
Instances
FromJSON Void | |
FromJSONKey Void | Since: aeson-2.1.2.0 |
Defined in Data.Aeson.Types.FromJSON Methods | |
ToJSON Void | |
ToJSONKey Void | Since: aeson-2.1.2.0 |
Defined in Data.Aeson.Types.ToJSON Methods | |
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 | |
Lift Void | Since: template-haskell-2.15.0.0 |
type Rep Void | Since: base-4.8.0.0 |
The IsList
class and its methods are intended to be used in
conjunction with the OverloadedLists extension.
Since: base-4.7.0.0
Methods
The fromList
function constructs the structure l
from the given
list of Item l
fromListN :: Int -> [Item l] -> l #
The fromListN
function takes the input list's length and potentially
uses it to construct the structure l
more efficiently compared to
fromList
. If the given number does not equal to the input list's length
the behaviour of fromListN
is not specified.
fromListN (length xs) xs == fromList xs
The toList
function extracts a list of Item l
from the structure l
.
It should satisfy fromList . toList = id.
Instances
IsList ByteArray | Since: base-4.17.0.0 | ||||
IsList Version | Since: base-4.8.0.0 | ||||
IsList CallStack | Be aware that 'fromList . toList = id' only for unfrozen Since: base-4.9.0.0 | ||||
IsList String | |||||
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] # | |||||
IsList ByteString | Since: bytestring-0.10.12.0 | ||||
Defined in Data.ByteString.Lazy.Internal Associated Types
Methods fromList :: [Item ByteString] -> ByteString # fromListN :: Int -> [Item ByteString] -> ByteString # toList :: ByteString -> [Item ByteString] # | |||||
IsList ShortByteString | Since: bytestring-0.10.12.0 | ||||
Defined in Data.ByteString.Short.Internal Associated Types
Methods fromList :: [Item ShortByteString] -> ShortByteString # fromListN :: Int -> [Item ShortByteString] -> ShortByteString # toList :: ShortByteString -> [Item ShortByteString] # | |||||
IsList ByteArray | |||||
IsList SlicedByteArray | |||||
Defined in Codec.CBOR.ByteArray.Sliced Associated Types
Methods fromList :: [Item SlicedByteArray] -> SlicedByteArray # fromListN :: Int -> [Item SlicedByteArray] -> SlicedByteArray # toList :: SlicedByteArray -> [Item SlicedByteArray] # | |||||
IsList IntSet | Since: containers-0.5.6.2 | ||||
IsList ShortText | Note: Surrogate pairs ( Since: text-short-0.1.2 | ||||
IsList (KeyMap v) | Since: aeson-2.0.2.0 | ||||
IsList a => IsList (Sensitive a) Source # | |||||
Defined in Amazonka.Data.Sensitive Associated Types
| |||||
IsList (ZipList a) | Since: base-4.15.0.0 | ||||
IsList (NonEmpty a) | Since: base-4.9.0.0 | ||||
PrimType ty => IsList (Block ty) | |||||
IsList c => IsList (NonEmpty c) | |||||
PrimType ty => IsList (UArray ty) | |||||
IsList (IntMap a) | Since: containers-0.5.6.2 | ||||
IsList (Seq a) | |||||
Ord a => IsList (Set a) | Since: containers-0.5.6.2 | ||||
IsList (DNonEmpty a) | |||||
Defined in Data.DList.DNonEmpty.Internal Associated Types
| |||||
IsList (DList a) | |||||
IsList (Array a) | |||||
Prim a => IsList (PrimArray a) | Since: primitive-0.6.4.0 | ||||
Defined in Data.Primitive.PrimArray Associated Types
| |||||
IsList (SmallArray a) | |||||
Defined in Data.Primitive.SmallArray Associated Types
Methods fromList :: [Item (SmallArray a)] -> SmallArray a # fromListN :: Int -> [Item (SmallArray a)] -> SmallArray a # toList :: SmallArray a -> [Item (SmallArray a)] # | |||||
(Eq a, Hashable a) => IsList (HashSet a) | |||||
IsList (Vector a) | |||||
Prim a => IsList (Vector a) | |||||
Storable a => IsList (Vector a) | |||||
IsList (Vector a) | |||||
IsList [a] | Since: base-4.7.0.0 | ||||
Ord k => IsList (Map k v) | Since: containers-0.5.6.2 | ||||
(Eq k, Hashable k) => IsList (HashMap k v) | |||||
Defined in Data.HashMap.Internal Associated Types
|
Non-empty (and non-strict) list type.
Since: base-4.9.0.0
Constructors
a :| [a] infixr 5 |
Instances
FromJSON1 NonEmpty | |||||
Defined in Data.Aeson.Types.FromJSON | |||||
ToJSON1 NonEmpty | |||||
Defined in Data.Aeson.Types.ToJSON Methods liftToJSON :: (a -> Bool) -> (a -> Value) -> ([a] -> Value) -> NonEmpty a -> Value Source # liftToJSONList :: (a -> Bool) -> (a -> Value) -> ([a] -> Value) -> [NonEmpty a] -> Value Source # liftToEncoding :: (a -> Bool) -> (a -> Encoding) -> ([a] -> Encoding) -> NonEmpty a -> Encoding Source # liftToEncodingList :: (a -> Bool) -> (a -> Encoding) -> ([a] -> Encoding) -> [NonEmpty a] -> Encoding Source # | |||||
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 | |||||
GetAddrInfo NonEmpty | |||||
Defined in Network.Socket.Info | |||||
Generic1 NonEmpty | |||||
Defined in GHC.Generics Associated Types
| |||||
Lift a => Lift (NonEmpty a :: Type) | Since: template-haskell-2.15.0.0 | ||||
FromJSON a => FromJSON (NonEmpty a) | |||||
ToJSON a => ToJSON (NonEmpty a) | |||||
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 | |||||
Reversing (NonEmpty a) | |||||
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 # | |||||
t ~ NonEmpty b => Rewrapped (NonEmpty a) t | |||||
Defined in Control.Lens.Wrapped | |||||
Each (NonEmpty a) (NonEmpty b) a b |
| ||||
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 |
Representable types of kind *
.
This class is derivable in GHC with the DeriveGeneric
flag on.
A Generic
instance must satisfy the following laws:
from
.to
≡id
to
.from
≡id
Instances
Generic Value | |||||
Defined in Data.Aeson.Types.Internal Associated Types
| |||||
Generic Base64 Source # | |||||
Defined in Amazonka.Data.Base64 Associated Types
| |||||
Generic ResponseBody Source # | |||||
Defined in Amazonka.Data.Body Associated Types
| |||||
Generic Format Source # | |||||
Defined in Amazonka.Data.Time Associated Types
| |||||
Generic Abbrev Source # | |||||
Defined in Amazonka.Types Associated Types
| |||||
Generic AccessKey Source # | |||||
Defined in Amazonka.Types Associated Types
| |||||
Generic AuthEnv Source # | |||||
Defined in Amazonka.Types Associated Types
| |||||
Generic Endpoint Source # | |||||
Defined in Amazonka.Types Associated Types
| |||||
Generic Error Source # | |||||
Defined in Amazonka.Types Associated Types
| |||||
Generic ErrorMessage Source # | |||||
Defined in Amazonka.Types Associated Types
| |||||
Generic Region Source # | |||||
Defined in Amazonka.Types Associated Types
| |||||
Generic RequestId Source # | |||||
Defined in Amazonka.Types Associated Types
| |||||
Generic Retry Source # | |||||
Defined in Amazonka.Types Associated Types
| |||||
Generic S3AddressingStyle Source # | |||||
Defined in Amazonka.Types Associated Types
Methods from :: S3AddressingStyle -> Rep S3AddressingStyle x # to :: Rep S3AddressingStyle x -> S3AddressingStyle # | |||||
Generic Seconds Source # | |||||
Defined in Amazonka.Types Associated Types
| |||||
Generic SecretKey Source # | |||||
Defined in Amazonka.Types Associated Types
| |||||
Generic SerializeError Source # | |||||
Defined in Amazonka.Types Associated Types
Methods from :: SerializeError -> Rep SerializeError x # to :: Rep SerializeError x -> SerializeError # | |||||
Generic Service Source # | |||||
Defined in Amazonka.Types Associated Types
| |||||
Generic ServiceError Source # | |||||
Defined in Amazonka.Types Associated Types
| |||||
Generic SessionToken Source # | |||||
Defined in Amazonka.Types 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 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 Half | |||||
Defined in Numeric.Half.Internal Associated Types
| |||||
Generic ByteRange | |||||
Defined in Network.HTTP.Types.Header Associated Types
| |||||
Generic StdMethod | |||||
Defined in Network.HTTP.Types.Method Associated Types
| |||||
Generic Status | |||||
Defined in Network.HTTP.Types.Status Associated Types
| |||||
Generic HttpVersion | |||||
Defined in Network.HTTP.Types.Version Associated Types
| |||||
Generic IP | |||||
Defined in Data.IP.Addr Associated Types
| |||||
Generic IPv4 | |||||
Defined in Data.IP.Addr Associated Types
| |||||
Generic IPv6 | |||||
Defined in Data.IP.Addr Associated Types
| |||||
Generic IPRange | |||||
Defined in Data.IP.Range 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 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 Group | |||||
Defined in Network.TLS.Crypto.Types Associated Types
| |||||
Generic SessionData | |||||
Defined in Network.TLS.Types Associated Types
| |||||
Generic SessionFlag | |||||
Defined in Network.TLS.Types Associated Types
| |||||
Generic TLS13TicketInfo | |||||
Defined in Network.TLS.Types Associated Types
Methods from :: TLS13TicketInfo -> Rep TLS13TicketInfo x # to :: Rep TLS13TicketInfo x -> TLS13TicketInfo # | |||||
Generic Version | |||||
Defined in Network.TLS.Types Associated Types
| |||||
Generic UnixTime | |||||
Defined in Data.UnixTime.Types 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 CompressParams | |||||
Defined in Codec.Compression.Zlib.Internal Associated Types
Methods from :: CompressParams -> Rep CompressParams x # to :: Rep CompressParams x -> CompressParams # | |||||
Generic DecompressError | |||||
Defined in Codec.Compression.Zlib.Internal Associated Types
Methods from :: DecompressError -> Rep DecompressError x # to :: Rep DecompressError x -> DecompressError # | |||||
Generic DecompressParams | |||||
Defined in Codec.Compression.Zlib.Internal Associated Types
Methods from :: DecompressParams -> Rep DecompressParams x # to :: Rep DecompressParams x -> DecompressParams # | |||||
Generic CompressionLevel | |||||
Defined in Codec.Compression.Zlib.Stream Associated Types
Methods from :: CompressionLevel -> Rep CompressionLevel x # to :: Rep CompressionLevel x -> CompressionLevel # | |||||
Generic CompressionStrategy | |||||
Defined in Codec.Compression.Zlib.Stream Associated Types
Methods from :: CompressionStrategy -> Rep CompressionStrategy x # to :: Rep CompressionStrategy x -> CompressionStrategy # | |||||
Generic Format | |||||
Defined in Codec.Compression.Zlib.Stream Associated Types
| |||||
Generic MemoryLevel | |||||
Defined in Codec.Compression.Zlib.Stream Associated Types
| |||||
Generic Method | |||||
Defined in Codec.Compression.Zlib.Stream | |||||
Generic WindowBits | |||||
Defined in Codec.Compression.Zlib.Stream Associated Types
| |||||
Generic () | |||||
Generic Bool | |||||
Defined in GHC.Generics | |||||
Generic (Sensitive a) Source # | |||||
Defined in Amazonka.Data.Sensitive Associated Types
| |||||
Generic (Time a) Source # | |||||
Defined in Amazonka.Data.Time Associated Types
| |||||
Generic (Request a) Source # | |||||
Defined in Amazonka.Types Associated Types
| |||||
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 (HistoriedResponse body) | |||||
Defined in Network.HTTP.Client Associated Types
Methods from :: HistoriedResponse body -> Rep (HistoriedResponse body) x # to :: Rep (HistoriedResponse body) x -> HistoriedResponse body # | |||||
Generic (AddrRange a) | |||||
Defined in Data.IP.Range Associated Types
| |||||
Generic (Doc a) | |||||
Defined in Text.PrettyPrint.Annotated.HughesPJ Associated Types
| |||||
Generic (Maybe a) | |||||
Defined in Data.Strict.Maybe Associated Types
| |||||
Generic (TyVarBndr flag) | |||||
Defined in Language.Haskell.TH.Syntax Associated Types
| |||||
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 (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 (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
|
A map from keys to values. A map cannot contain duplicate keys; each key can map to at most one value.
Instances
Bifoldable HashMap | Since: unordered-containers-0.2.11 | ||||
Eq2 HashMap | |||||
Ord2 HashMap | |||||
Defined in Data.HashMap.Internal | |||||
Show2 HashMap | |||||
NFData2 HashMap | Since: unordered-containers-0.2.14.0 | ||||
Defined in Data.HashMap.Internal | |||||
Hashable2 HashMap | |||||
(Lift k, Lift v) => Lift (HashMap k v :: Type) | Since: unordered-containers-0.2.17.0 | ||||
(FromJSONKey k, Eq k, Hashable k) => FromJSON1 (HashMap k) | |||||
Defined in Data.Aeson.Types.FromJSON | |||||
ToJSONKey k => ToJSON1 (HashMap k) | |||||
Defined in Data.Aeson.Types.ToJSON Methods liftToJSON :: (a -> Bool) -> (a -> Value) -> ([a] -> Value) -> HashMap k a -> Value Source # liftToJSONList :: (a -> Bool) -> (a -> Value) -> ([a] -> Value) -> [HashMap k a] -> Value Source # liftToEncoding :: (a -> Bool) -> (a -> Encoding) -> ([a] -> Encoding) -> HashMap k a -> Encoding Source # liftToEncodingList :: (a -> Bool) -> (a -> Encoding) -> ([a] -> Encoding) -> [HashMap k a] -> Encoding Source # liftOmitField :: (a -> Bool) -> HashMap k a -> Bool Source # | |||||
Foldable (HashMap k) | |||||
Defined in Data.HashMap.Internal Methods fold :: Monoid m => HashMap k m -> m # foldMap :: Monoid m => (a -> m) -> HashMap k a -> m # foldMap' :: Monoid m => (a -> m) -> HashMap k a -> m # foldr :: (a -> b -> b) -> b -> HashMap k a -> b # foldr' :: (a -> b -> b) -> b -> HashMap k a -> b # foldl :: (b -> a -> b) -> b -> HashMap k a -> b # foldl' :: (b -> a -> b) -> b -> HashMap k a -> b # foldr1 :: (a -> a -> a) -> HashMap k a -> a # foldl1 :: (a -> a -> a) -> HashMap k a -> a # toList :: HashMap k a -> [a] # length :: HashMap k a -> Int # elem :: Eq a => a -> HashMap k a -> Bool # maximum :: Ord a => HashMap k a -> a # minimum :: Ord a => HashMap k a -> a # | |||||
Eq k => Eq1 (HashMap k) | |||||
Ord k => Ord1 (HashMap k) | |||||
Defined in Data.HashMap.Internal | |||||
(Eq k, Hashable k, Read k) => Read1 (HashMap k) | |||||
Defined in Data.HashMap.Internal | |||||
Show k => Show1 (HashMap k) | |||||
Traversable (HashMap k) | |||||
Defined in Data.HashMap.Internal | |||||
Functor (HashMap k) | |||||
NFData k => NFData1 (HashMap k) | Since: unordered-containers-0.2.14.0 | ||||
Defined in Data.HashMap.Internal | |||||
Hashable k => Hashable1 (HashMap k) | |||||
Defined in Data.HashMap.Internal | |||||
(FromJSON v, FromJSONKey k, Eq k, Hashable k) => FromJSON (HashMap k v) | |||||
(ToJSON v, ToJSONKey k) => ToJSON (HashMap k v) | |||||
(ToByteString k, ToByteString v) => ToHeader (HashMap k v) Source # | |||||
Defined in Amazonka.Data.Headers | |||||
(ToByteString k, ToByteString v) => ToHeaders (HashMap k v) Source # | |||||
AWSTruncated (HashMap k v) Source # | |||||
(Data k, Data v, Eq k, Hashable k) => Data (HashMap k v) | |||||
Defined in Data.HashMap.Internal Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> HashMap k v -> c (HashMap k v) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (HashMap k v) # toConstr :: HashMap k v -> Constr # dataTypeOf :: HashMap k v -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (HashMap k v)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (HashMap k v)) # gmapT :: (forall b. Data b => b -> b) -> HashMap k v -> HashMap k v # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> HashMap k v -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> HashMap k v -> r # gmapQ :: (forall d. Data d => d -> u) -> HashMap k v -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> HashMap k v -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> HashMap k v -> m (HashMap k v) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> HashMap k v -> m (HashMap k v) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> HashMap k v -> m (HashMap k v) # | |||||
(Eq k, Hashable k) => Monoid (HashMap k v) | If a key occurs in both maps, the mapping from the first will be the mapping in the result. Examples
| ||||
(Eq k, Hashable k) => Semigroup (HashMap k v) | If a key occurs in both maps, the mapping from the first will be the mapping in the result. Examples
| ||||
(Eq k, Hashable k) => IsList (HashMap k v) | |||||
Defined in Data.HashMap.Internal Associated Types
| |||||
(Eq k, Hashable k, Read k, Read e) => Read (HashMap k e) | |||||
(Show k, Show v) => Show (HashMap k v) | |||||
(NFData k, NFData v) => NFData (HashMap k v) | |||||
Defined in Data.HashMap.Internal | |||||
(Eq k, Eq v) => Eq (HashMap k v) | Note that, in the presence of hash collisions, equal
In general, the lack of extensionality can be observed with any function that depends on the key ordering, such as folds and traversals. | ||||
(Ord k, Ord v) => Ord (HashMap k v) | The ordering is total and consistent with the | ||||
Defined in Data.HashMap.Internal | |||||
(Hashable k, Hashable v) => Hashable (HashMap k v) | |||||
(Eq k, Hashable k) => At (HashMap k a) | |||||
(Eq k, Hashable k) => Ixed (HashMap k a) | |||||
Defined in Control.Lens.At | |||||
AsEmpty (HashMap k a) | |||||
(Hashable k, Eq k) => Wrapped (HashMap k a) | |||||
(Eq k, Hashable k) => GrowingAppend (HashMap k v) | |||||
Defined in Data.MonoTraversable | |||||
MonoFoldable (HashMap k v) | |||||
Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element (HashMap k v) -> m) -> HashMap k v -> m Source # ofoldr :: (Element (HashMap k v) -> b -> b) -> b -> HashMap k v -> b Source # ofoldl' :: (a -> Element (HashMap k v) -> a) -> a -> HashMap k v -> a Source # otoList :: HashMap k v -> [Element (HashMap k v)] Source # oall :: (Element (HashMap k v) -> Bool) -> HashMap k v -> Bool Source # oany :: (Element (HashMap k v) -> Bool) -> HashMap k v -> Bool Source # onull :: HashMap k v -> Bool Source # olength :: HashMap k v -> Int Source # olength64 :: HashMap k v -> Int64 Source # ocompareLength :: Integral i => HashMap k v -> i -> Ordering Source # otraverse_ :: Applicative f => (Element (HashMap k v) -> f b) -> HashMap k v -> f () Source # ofor_ :: Applicative f => HashMap k v -> (Element (HashMap k v) -> f b) -> f () Source # omapM_ :: Applicative m => (Element (HashMap k v) -> m ()) -> HashMap k v -> m () Source # oforM_ :: Applicative m => HashMap k v -> (Element (HashMap k v) -> m ()) -> m () Source # ofoldlM :: Monad m => (a -> Element (HashMap k v) -> m a) -> a -> HashMap k v -> m a Source # ofoldMap1Ex :: Semigroup m => (Element (HashMap k v) -> m) -> HashMap k v -> m Source # ofoldr1Ex :: (Element (HashMap k v) -> Element (HashMap k v) -> Element (HashMap k v)) -> HashMap k v -> Element (HashMap k v) Source # ofoldl1Ex' :: (Element (HashMap k v) -> Element (HashMap k v) -> Element (HashMap k v)) -> HashMap k v -> Element (HashMap k v) Source # headEx :: HashMap k v -> Element (HashMap k v) Source # lastEx :: HashMap k v -> Element (HashMap k v) Source # unsafeHead :: HashMap k v -> Element (HashMap k v) Source # unsafeLast :: HashMap k v -> Element (HashMap k v) Source # maximumByEx :: (Element (HashMap k v) -> Element (HashMap k v) -> Ordering) -> HashMap k v -> Element (HashMap k v) Source # minimumByEx :: (Element (HashMap k v) -> Element (HashMap k v) -> Ordering) -> HashMap k v -> Element (HashMap k v) Source # oelem :: Element (HashMap k v) -> HashMap k v -> Bool Source # onotElem :: Element (HashMap k v) -> HashMap k v -> Bool Source # | |||||
MonoFunctor (HashMap k v) | |||||
MonoTraversable (HashMap k v) | |||||
(t ~ HashMap k' a', Hashable k, Eq k) => Rewrapped (HashMap k a) t | Use | ||||
Defined in Control.Lens.Wrapped | |||||
c ~ d => Each (HashMap c a) (HashMap d b) a b |
| ||||
type Item (HashMap k v) | |||||
Defined in Data.HashMap.Internal | |||||
type Index (HashMap k a) | |||||
Defined in Control.Lens.At | |||||
type IxValue (HashMap k a) | |||||
Defined in Control.Lens.At | |||||
type Unwrapped (HashMap k a) | |||||
Defined in Control.Lens.Wrapped | |||||
type Element (HashMap k v) | |||||
Defined in Data.MonoTraversable |
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
ToBody ByteString Source # | |||||
Defined in Amazonka.Data.Body Methods toBody :: ByteString -> RequestBody Source # | |||||
ToHashedBody ByteString Source # | |||||
Defined in Amazonka.Data.Body Methods toHashed :: ByteString -> HashedBody Source # | |||||
ToByteString CredentialScope Source # | |||||
Defined in Amazonka.Sign.V4.Base Methods toBS :: CredentialScope -> ByteString Source # | |||||
ToByteString ByteString Source # | |||||
Defined in Amazonka.Data.ByteString Methods toBS :: ByteString -> ByteString Source # | |||||
ToHeader ByteString Source # | |||||
Defined in Amazonka.Data.Headers Methods toHeader :: HeaderName -> ByteString -> [Header] Source # | |||||
ToLog ByteString Source # | |||||
Defined in Amazonka.Data.Log Methods build :: ByteString -> ByteStringBuilder Source # | |||||
ToPath ByteString Source # | |||||
Defined in Amazonka.Data.Path Methods toPath :: ByteString -> ByteString Source # | |||||
ToQuery ByteString Source # | |||||
Defined in Amazonka.Data.Query Methods toQuery :: ByteString -> QueryString Source # | |||||
FromText ByteString Source # | |||||
Defined in Amazonka.Data.Text | |||||
ToText ByteString Source # | |||||
Defined in Amazonka.Data.Text Methods toText :: ByteString -> Text Source # | |||||
FromXML ByteString Source # | |||||
Defined in Amazonka.Data.XML | |||||
ToXML ByteString Source # | |||||
Defined in Amazonka.Data.XML Methods toXML :: ByteString -> XML Source # | |||||
Chunk ByteString | |||||
Defined in Data.Attoparsec.Internal.Types Associated Types
Methods nullChunk :: ByteString -> Bool pappendChunk :: State ByteString -> ByteString -> State ByteString atBufferEnd :: ByteString -> State ByteString -> Pos bufferElemAt :: ByteString -> Pos -> State ByteString -> Maybe (ChunkElem ByteString, Int) chunkElemToChar :: ByteString -> ChunkElem ByteString -> Char | |||||
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 # | |||||
FoldCase ByteString | Note that | ||||
Defined in Data.CaseInsensitive.Internal | |||||
AttoparsecInput ByteString | |||||
Defined in Data.Conduit.Attoparsec Methods parseA :: Parser ByteString b -> ByteString -> IResult ByteString b feedA :: IResult ByteString b -> ByteString -> IResult ByteString b empty :: ByteString isNull :: ByteString -> Bool getLinesCols :: ByteString -> Position stripFromEnd :: ByteString -> ByteString -> ByteString | |||||
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 | |||||
QueryKeyLike ByteString | |||||
Defined in Network.HTTP.Types.QueryLike Methods toQueryKey :: ByteString -> ByteString Source # | |||||
QueryValueLike ByteString | |||||
Defined in Network.HTTP.Types.QueryLike Methods toQueryValue :: ByteString -> Maybe ByteString Source # | |||||
Ixed ByteString | |||||
Defined in Control.Lens.At Methods ix :: Index ByteString -> Traversal' ByteString (IxValue ByteString) Source # | |||||
AsEmpty ByteString | |||||
Defined in Control.Lens.Empty Methods _Empty :: Prism' ByteString () Source # | |||||
Reversing ByteString | |||||
Defined in Control.Lens.Internal.Iso Methods reversing :: ByteString -> ByteString Source # | |||||
Prefixed ByteString | |||||
Defined in Control.Lens.Prism Methods prefixed :: ByteString -> Prism' ByteString ByteString Source # | |||||
Suffixed ByteString | |||||
Defined in Control.Lens.Prism Methods suffixed :: ByteString -> Prism' ByteString ByteString Source # | |||||
IsByteString ByteString | |||||
Defined in Data.ByteString.Lens Methods packedBytes :: Iso' [Word8] ByteString Source # packedChars :: Iso' String ByteString Source # | |||||
ByteArray ByteString | |||||
Defined in Data.ByteArray.Types | |||||
ByteArrayAccess ByteString | |||||
Defined in Data.ByteArray.Types Methods length :: ByteString -> Int Source # withByteArray :: ByteString -> (Ptr p -> IO a) -> IO a Source # copyByteArrayToPtr :: ByteString -> Ptr p -> IO () 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 # | |||||
Extract ByteString | |||||
Defined in Text.Regex.Base.RegexLike Methods before :: Int -> ByteString -> ByteString Source # after :: Int -> ByteString -> ByteString Source # empty :: ByteString Source # extract :: (Int, Int) -> 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 # | |||||
Cons ByteString ByteString Word8 Word8 | |||||
Defined in Control.Lens.Cons Methods _Cons :: Prism ByteString ByteString (Word8, ByteString) (Word8, ByteString) Source # | |||||
Snoc ByteString ByteString Word8 Word8 | |||||
Defined in Control.Lens.Cons Methods _Snoc :: Prism ByteString ByteString (ByteString, Word8) (ByteString, Word8) Source # | |||||
(a ~ Word8, b ~ Word8) => Each ByteString ByteString a b |
| ||||
Defined in Control.Lens.Each Methods each :: Traversal ByteString ByteString a b Source # | |||||
ToLog [Header] Source # | |||||
Defined in Amazonka.Data.Log Methods build :: [Header] -> ByteStringBuilder Source # | |||||
ToByteString (Tag s ByteString) Source # | |||||
Defined in Amazonka.Sign.V4.Base Methods toBS :: Tag s ByteString -> ByteString Source # | |||||
ToLog (Tag s ByteString) Source # | |||||
Defined in Amazonka.Sign.V4.Base Methods build :: Tag s ByteString -> ByteStringBuilder Source # | |||||
type ChunkElem ByteString | |||||
Defined in Data.Attoparsec.Internal.Types | |||||
type State ByteString | |||||
Defined in Data.Attoparsec.Internal.Types type State ByteString = Buffer | |||||
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 Element ByteString | |||||
Defined in Data.MonoTraversable | |||||
type Index ByteString | |||||
Defined in Data.Sequences |
A space efficient, packed, unboxed Unicode text type.
Instances
FromJSON Text | |||||
FromJSONKey Text | |||||
Defined in Data.Aeson.Types.FromJSON Methods | |||||
ToJSON Text | |||||
ToJSONKey Text | |||||
Defined in Data.Aeson.Types.ToJSON Methods | |||||
ToBody Text Source # | |||||
Defined in Amazonka.Data.Body Methods toBody :: Text -> RequestBody Source # | |||||
ToHashedBody Text Source # | |||||
Defined in Amazonka.Data.Body Methods toHashed :: Text -> HashedBody Source # | |||||
ToByteString Text Source # | |||||
Defined in Amazonka.Data.ByteString Methods toBS :: Text -> ByteString Source # | |||||
ToHeader Text Source # | |||||
Defined in Amazonka.Data.Headers | |||||
ToLog Text Source # | |||||
Defined in Amazonka.Data.Log Methods build :: Text -> ByteStringBuilder Source # | |||||
ToPath Text Source # | |||||
Defined in Amazonka.Data.Path Methods toPath :: Text -> ByteString Source # | |||||
ToQuery Text Source # | |||||
Defined in Amazonka.Data.Query Methods toQuery :: Text -> QueryString Source # | |||||
FromText Text Source # | |||||
ToText Text Source # | |||||
FromXML Text Source # | |||||
ToXML Text Source # | |||||
Chunk Text | |||||
Defined in Data.Attoparsec.Internal.Types Associated Types
Methods pappendChunk :: State Text -> Text -> State Text atBufferEnd :: Text -> State Text -> Pos bufferElemAt :: Text -> Pos -> State Text -> Maybe (ChunkElem Text, Int) chunkElemToChar :: Text -> ChunkElem Text -> Char | |||||
FoldCase Text | |||||
Defined in Data.CaseInsensitive.Internal | |||||
AttoparsecInput Text | |||||
Hashable Text | |||||
QueryKeyLike Text | |||||
Defined in Network.HTTP.Types.QueryLike Methods toQueryKey :: Text -> ByteString Source # | |||||
QueryValueLike Text | |||||
Defined in Network.HTTP.Types.QueryLike Methods toQueryValue :: Text -> Maybe ByteString Source # | |||||
Ixed Text | |||||
Defined in Control.Lens.At | |||||
AsEmpty Text | |||||
Reversing Text | |||||
Prefixed Text | |||||
Suffixed Text | |||||
IsText 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 # | |||||
Extract Text | Since: regex-base-0.94.0.0 | ||||
LazySequence Text Text | |||||
Utf8 Text ByteString | |||||
Defined in Data.Sequences | |||||
Cons Text Text Char Char | |||||
Snoc Text Text Char Char | |||||
(a ~ Char, b ~ Char) => Each Text Text a b |
| ||||
type ChunkElem Text | |||||
Defined in Data.Attoparsec.Internal.Types | |||||
type State Text | |||||
Defined in Data.Attoparsec.Internal.Types type State Text = Buffer | |||||
type Item Text | |||||
type Index Text | |||||
Defined in Control.Lens.At | |||||
type IxValue Text | |||||
Defined in Control.Lens.At | |||||
type Element Text | |||||
Defined in Data.MonoTraversable | |||||
type Index Text | |||||
Defined in Data.Sequences |
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,
is a safer alternative to the
Proxy
:: Proxy
a
idiom.undefined
:: a
>>>
Proxy :: Proxy (Void, Int -> Int)
Proxy
Proxy can even hold types of higher kinds,
>>>
Proxy :: Proxy Either
Proxy
>>>
Proxy :: Proxy Functor
Proxy
>>>
Proxy :: Proxy complicatedStructure
Proxy
Constructors
Proxy |
Instances
Generic1 (Proxy :: k -> Type) | |
Defined in GHC.Generics | |
Representable (Proxy :: Type -> Type) | |
FromJSON1 (Proxy :: Type -> Type) | |
Defined in Data.Aeson.Types.FromJSON | |
ToJSON1 (Proxy :: Type -> Type) | |
Defined in Data.Aeson.Types.ToJSON Methods liftToJSON :: (a -> Bool) -> (a -> Value) -> ([a] -> Value) -> Proxy a -> Value Source # liftToJSONList :: (a -> Bool) -> (a -> Value) -> ([a] -> Value) -> [Proxy a] -> Value Source # liftToEncoding :: (a -> Bool) -> (a -> Encoding) -> ([a] -> Encoding) -> Proxy a -> Encoding Source # liftToEncodingList :: (a -> Bool) -> (a -> Encoding) -> ([a] -> Encoding) -> [Proxy a] -> Encoding Source # | |
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 | |
FromJSON (Proxy a) | |
ToJSON (Proxy a) | |
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 |
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 |
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 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 Deque | |
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 Vector | |
Alternative Vector | |
Alternative AttrParser | |
Defined in Text.XML.Stream.Parse Methods empty :: AttrParser a # (<|>) :: AttrParser a -> AttrParser a -> AttrParser a # some :: AttrParser a -> AttrParser [a] # many :: AttrParser a -> AttrParser [a] # | |
Alternative NameMatcher |
|
Defined in Text.XML.Stream.Parse Methods empty :: NameMatcher a # (<|>) :: NameMatcher a -> NameMatcher a -> NameMatcher a # some :: NameMatcher a -> NameMatcher [a] # many :: NameMatcher a -> NameMatcher [a] # | |
Alternative Maybe | Picks the leftmost Since: base-2.1 |
Alternative [] | Combines lists by concatenation, starting from the empty list. Since: base-2.1 |
Alternative (Parser i) | |
Monad m => Alternative (ZeptoT m) | |
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 |
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] # | |
Alternative (Parser byteArray) | |
Alternative m => Alternative (ResourceT m) | Since 1.1.5 |
Alternative f => Alternative (Lift f) | A combination is |
(Functor m, Monad m) => Alternative (MaybeT m) | |
(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 |
(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) | |
16-bit unsigned integer type
Instances
FromJSON Word16 | |||||
FromJSONKey Word16 | |||||
Defined in Data.Aeson.Types.FromJSON Methods | |||||
ToJSON Word16 | |||||
ToJSONKey Word16 | |||||
Defined in Data.Aeson.Types.ToJSON Methods | |||||
ToLog Word16 Source # | |||||
Defined in Amazonka.Data.Log Methods build :: Word16 -> ByteStringBuilder Source # | |||||
Data Word16 | 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) -> Word16 -> c Word16 # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Word16 # toConstr :: Word16 -> Constr # dataTypeOf :: Word16 -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Word16) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Word16) # gmapT :: (forall b. Data b => b -> b) -> Word16 -> Word16 # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Word16 -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Word16 -> r # gmapQ :: (forall d. Data d => d -> u) -> Word16 -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Word16 -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Word16 -> m Word16 # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Word16 -> m Word16 # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Word16 -> m Word16 # | |||||
Storable Word16 | Since: base-2.1 | ||||
Bits Word16 | Since: base-2.1 | ||||
Defined in GHC.Word Methods (.&.) :: Word16 -> Word16 -> Word16 # (.|.) :: Word16 -> Word16 -> Word16 # xor :: Word16 -> Word16 -> Word16 # complement :: Word16 -> Word16 # shift :: Word16 -> Int -> Word16 # rotate :: Word16 -> Int -> Word16 # setBit :: Word16 -> Int -> Word16 # clearBit :: Word16 -> Int -> Word16 # complementBit :: Word16 -> Int -> Word16 # testBit :: Word16 -> Int -> Bool # bitSizeMaybe :: Word16 -> Maybe Int # shiftL :: Word16 -> Int -> Word16 # unsafeShiftL :: Word16 -> Int -> Word16 # shiftR :: Word16 -> Int -> Word16 # unsafeShiftR :: Word16 -> Int -> Word16 # rotateL :: Word16 -> Int -> Word16 # | |||||
FiniteBits Word16 | Since: base-4.6.0.0 | ||||
Defined in GHC.Word Methods finiteBitSize :: Word16 -> Int # countLeadingZeros :: Word16 -> Int # countTrailingZeros :: Word16 -> Int # | |||||
Bounded Word16 | Since: base-2.1 | ||||
Enum Word16 | Since: base-2.1 | ||||
Defined in GHC.Word | |||||
Ix Word16 | Since: base-2.1 | ||||
Num Word16 | Since: base-2.1 | ||||
Read Word16 | Since: base-2.1 | ||||
Integral Word16 | Since: base-2.1 | ||||
Real Word16 | Since: base-2.1 | ||||
Defined in GHC.Word Methods toRational :: Word16 -> Rational # | |||||
Show Word16 | Since: base-2.1 | ||||
PrintfArg Word16 | Since: base-2.1 | ||||
Defined in Text.Printf | |||||
BitOps Word16 | |||||
Defined in Basement.Bits Methods (.&.) :: Word16 -> Word16 -> Word16 Source # (.|.) :: Word16 -> Word16 -> Word16 Source # (.^.) :: Word16 -> Word16 -> Word16 Source # (.<<.) :: Word16 -> CountOf Bool -> Word16 Source # (.>>.) :: Word16 -> CountOf Bool -> Word16 Source # bit :: Offset Bool -> Word16 Source # isBitSet :: Word16 -> Offset Bool -> Bool Source # | |||||
FiniteBitsOps Word16 | |||||
Defined in Basement.Bits | |||||
Subtractive Word16 | |||||
Defined in Basement.Numerical.Subtractive Associated Types
| |||||
PrimMemoryComparable Word16 | |||||
Defined in Basement.PrimType | |||||
PrimType Word16 | |||||
Defined in Basement.PrimType Associated Types
Methods primSizeInBytes :: Proxy Word16 -> CountOf Word8 Source # primShiftToBytes :: Proxy Word16 -> Int Source # primBaUIndex :: ByteArray# -> Offset Word16 -> Word16 Source # primMbaURead :: PrimMonad prim => MutableByteArray# (PrimState prim) -> Offset Word16 -> prim Word16 Source # primMbaUWrite :: PrimMonad prim => MutableByteArray# (PrimState prim) -> Offset Word16 -> Word16 -> prim () Source # primAddrIndex :: Addr# -> Offset Word16 -> Word16 Source # primAddrRead :: PrimMonad prim => Addr# -> Offset Word16 -> prim Word16 Source # primAddrWrite :: PrimMonad prim => Addr# -> Offset Word16 -> Word16 -> prim () Source # | |||||
Default Word16 | |||||
Defined in Data.Default.Class | |||||
NFData Word16 | |||||
Defined in Control.DeepSeq | |||||
Eq Word16 | Since: base-2.1 | ||||
Ord Word16 | Since: base-2.1 | ||||
Hashable Word16 | |||||
ByteSwap Word16 | |||||
Defined in Data.Memory.Endian | |||||
Uniform Word16 | |||||
Defined in System.Random.Internal Methods uniformM :: StatefulGen g m => g -> m Word16 Source # | |||||
UniformRange Word16 | |||||
Defined in System.Random.Internal | |||||
ByteSource Word16 | |||||
Defined in Data.UUID.Types.Internal.Builder | |||||
Unbox Word16 | |||||
Defined in Data.Vector.Unboxed.Base | |||||
Lift Word16 | |||||
Vector Vector Word16 | |||||
Defined in Data.Vector.Unboxed.Base Methods basicUnsafeFreeze :: Mutable Vector s Word16 -> ST s (Vector Word16) basicUnsafeThaw :: Vector Word16 -> ST s (Mutable Vector s Word16) basicLength :: Vector Word16 -> Int basicUnsafeSlice :: Int -> Int -> Vector Word16 -> Vector Word16 basicUnsafeIndexM :: Vector Word16 -> Int -> Box Word16 basicUnsafeCopy :: Mutable Vector s Word16 -> Vector Word16 -> ST s () | |||||
MVector MVector Word16 | |||||
Defined in Data.Vector.Unboxed.Base Methods basicLength :: MVector s Word16 -> Int basicUnsafeSlice :: Int -> Int -> MVector s Word16 -> MVector s Word16 basicOverlaps :: MVector s Word16 -> MVector s Word16 -> Bool basicUnsafeNew :: Int -> ST s (MVector s Word16) basicInitialize :: MVector s Word16 -> ST s () basicUnsafeReplicate :: Int -> Word16 -> ST s (MVector s Word16) basicUnsafeRead :: MVector s Word16 -> Int -> ST s Word16 basicUnsafeWrite :: MVector s Word16 -> Int -> Word16 -> ST s () basicClear :: MVector s Word16 -> ST s () basicSet :: MVector s Word16 -> Word16 -> ST s () basicUnsafeCopy :: MVector s Word16 -> MVector s Word16 -> ST s () basicUnsafeMove :: MVector s Word16 -> MVector s Word16 -> ST s () basicUnsafeGrow :: MVector s Word16 -> Int -> ST s (MVector s Word16) | |||||
type NatNumMaxBound Word16 | |||||
Defined in Basement.Nat | |||||
type Difference Word16 | |||||
Defined in Basement.Numerical.Subtractive | |||||
type PrimSize Word16 | |||||
Defined in Basement.PrimType | |||||
newtype Vector Word16 | |||||
Defined in Data.Vector.Unboxed.Base | |||||
type ByteSink Word16 g | |||||
Defined in Data.UUID.Types.Internal.Builder type ByteSink Word16 g = Takes2Bytes g | |||||
newtype MVector s Word16 | |||||
Defined in Data.Vector.Unboxed.Base |
32-bit unsigned integer type
Instances
FromJSON Word32 | |||||
FromJSONKey Word32 | |||||
Defined in Data.Aeson.Types.FromJSON Methods | |||||
ToJSON Word32 | |||||
ToJSONKey Word32 | |||||
Defined in Data.Aeson.Types.ToJSON Methods | |||||
ToLog Word32 Source # | |||||
Defined in Amazonka.Data.Log Methods build :: Word32 -> ByteStringBuilder Source # | |||||
Data Word32 | 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) -> Word32 -> c Word32 # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Word32 # toConstr :: Word32 -> Constr # dataTypeOf :: Word32 -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Word32) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Word32) # gmapT :: (forall b. Data b => b -> b) -> Word32 -> Word32 # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Word32 -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Word32 -> r # gmapQ :: (forall d. Data d => d -> u) -> Word32 -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Word32 -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Word32 -> m Word32 # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Word32 -> m Word32 # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Word32 -> m Word32 # | |||||
Storable Word32 | Since: base-2.1 | ||||
Bits Word32 | Since: base-2.1 | ||||
Defined in GHC.Word Methods (.&.) :: Word32 -> Word32 -> Word32 # (.|.) :: Word32 -> Word32 -> Word32 # xor :: Word32 -> Word32 -> Word32 # complement :: Word32 -> Word32 # shift :: Word32 -> Int -> Word32 # rotate :: Word32 -> Int -> Word32 # setBit :: Word32 -> Int -> Word32 # clearBit :: Word32 -> Int -> Word32 # complementBit :: Word32 -> Int -> Word32 # testBit :: Word32 -> Int -> Bool # bitSizeMaybe :: Word32 -> Maybe Int # shiftL :: Word32 -> Int -> Word32 # unsafeShiftL :: Word32 -> Int -> Word32 # shiftR :: Word32 -> Int -> Word32 # unsafeShiftR :: Word32 -> Int -> Word32 # rotateL :: Word32 -> Int -> Word32 # | |||||
FiniteBits Word32 | Since: base-4.6.0.0 | ||||
Defined in GHC.Word Methods finiteBitSize :: Word32 -> Int # countLeadingZeros :: Word32 -> Int # countTrailingZeros :: Word32 -> Int # | |||||
Bounded Word32 | Since: base-2.1 | ||||
Enum Word32 | Since: base-2.1 | ||||
Defined in GHC.Word | |||||
Ix Word32 | Since: base-2.1 | ||||
Num Word32 | Since: base-2.1 | ||||
Read Word32 | Since: base-2.1 | ||||
Integral Word32 | Since: base-2.1 | ||||
Real Word32 | Since: base-2.1 | ||||
Defined in GHC.Word Methods toRational :: Word32 -> Rational # | |||||
Show Word32 | Since: base-2.1 | ||||
PrintfArg Word32 | Since: base-2.1 | ||||
Defined in Text.Printf | |||||
BitOps Word32 | |||||
Defined in Basement.Bits Methods (.&.) :: Word32 -> Word32 -> Word32 Source # (.|.) :: Word32 -> Word32 -> Word32 Source # (.^.) :: Word32 -> Word32 -> Word32 Source # (.<<.) :: Word32 -> CountOf Bool -> Word32 Source # (.>>.) :: Word32 -> CountOf Bool -> Word32 Source # bit :: Offset Bool -> Word32 Source # isBitSet :: Word32 -> Offset Bool -> Bool Source # | |||||
FiniteBitsOps Word32 | |||||
Defined in Basement.Bits | |||||
Subtractive Word32 | |||||
Defined in Basement.Numerical.Subtractive Associated Types
| |||||
PrimMemoryComparable Word32 | |||||
Defined in Basement.PrimType | |||||
PrimType Word32 | |||||
Defined in Basement.PrimType Associated Types
Methods primSizeInBytes :: Proxy Word32 -> CountOf Word8 Source # primShiftToBytes :: Proxy Word32 -> Int Source # primBaUIndex :: ByteArray# -> Offset Word32 -> Word32 Source # primMbaURead :: PrimMonad prim => MutableByteArray# (PrimState prim) -> Offset Word32 -> prim Word32 Source # primMbaUWrite :: PrimMonad prim => MutableByteArray# (PrimState prim) -> Offset Word32 -> Word32 -> prim () Source # primAddrIndex :: Addr# -> Offset Word32 -> Word32 Source # primAddrRead :: PrimMonad prim => Addr# -> Offset Word32 -> prim Word32 Source # primAddrWrite :: PrimMonad prim => Addr# -> Offset Word32 -> Word32 -> prim () Source # | |||||
Default Word32 | |||||
Defined in Data.Default.Class | |||||
NFData Word32 | |||||
Defined in Control.DeepSeq | |||||
Eq Word32 | Since: base-2.1 | ||||
Ord Word32 | Since: base-2.1 | ||||
Hashable Word32 | |||||
ByteSwap Word32 | |||||
Defined in Data.Memory.Endian | |||||
Uniform Word32 | |||||
Defined in System.Random.Internal Methods uniformM :: StatefulGen g m => g -> m Word32 Source # | |||||
UniformRange Word32 | |||||
Defined in System.Random.Internal | |||||
ByteSource Word32 | |||||
Defined in Data.UUID.Types.Internal.Builder | |||||
Unbox Word32 | |||||
Defined in Data.Vector.Unboxed.Base | |||||
Lift Word32 | |||||
Vector Vector Word32 | |||||
Defined in Data.Vector.Unboxed.Base Methods basicUnsafeFreeze :: Mutable Vector s Word32 -> ST s (Vector Word32) basicUnsafeThaw :: Vector Word32 -> ST s (Mutable Vector s Word32) basicLength :: Vector Word32 -> Int basicUnsafeSlice :: Int -> Int -> Vector Word32 -> Vector Word32 basicUnsafeIndexM :: Vector Word32 -> Int -> Box Word32 basicUnsafeCopy :: Mutable Vector s Word32 -> Vector Word32 -> ST s () | |||||
MVector MVector Word32 | |||||
Defined in Data.Vector.Unboxed.Base Methods basicLength :: MVector s Word32 -> Int basicUnsafeSlice :: Int -> Int -> MVector s Word32 -> MVector s Word32 basicOverlaps :: MVector s Word32 -> MVector s Word32 -> Bool basicUnsafeNew :: Int -> ST s (MVector s Word32) basicInitialize :: MVector s Word32 -> ST s () basicUnsafeReplicate :: Int -> Word32 -> ST s (MVector s Word32) basicUnsafeRead :: MVector s Word32 -> Int -> ST s Word32 basicUnsafeWrite :: MVector s Word32 -> Int -> Word32 -> ST s () basicClear :: MVector s Word32 -> ST s () basicSet :: MVector s Word32 -> Word32 -> ST s () basicUnsafeCopy :: MVector s Word32 -> MVector s Word32 -> ST s () basicUnsafeMove :: MVector s Word32 -> MVector s Word32 -> ST s () basicUnsafeGrow :: MVector s Word32 -> Int -> ST s (MVector s Word32) | |||||
type NatNumMaxBound Word32 | |||||
Defined in Basement.Nat | |||||
type Difference Word32 | |||||
Defined in Basement.Numerical.Subtractive | |||||
type PrimSize Word32 | |||||
Defined in Basement.PrimType | |||||
newtype Vector Word32 | |||||
Defined in Data.Vector.Unboxed.Base | |||||
type ByteSink Word32 g | |||||
Defined in Data.UUID.Types.Internal.Builder type ByteSink Word32 g = Takes4Bytes g | |||||
newtype MVector s Word32 | |||||
Defined in Data.Vector.Unboxed.Base |
64-bit unsigned integer type
Instances
FromJSON Word64 | |||||
FromJSONKey Word64 | |||||
Defined in Data.Aeson.Types.FromJSON Methods | |||||
ToJSON Word64 | |||||
ToJSONKey Word64 | |||||
Defined in Data.Aeson.Types.ToJSON Methods | |||||
ToLog Word64 Source # | |||||
Defined in Amazonka.Data.Log Methods build :: Word64 -> ByteStringBuilder Source # | |||||
Data Word64 | 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) -> Word64 -> c Word64 # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Word64 # toConstr :: Word64 -> Constr # dataTypeOf :: Word64 -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Word64) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Word64) # gmapT :: (forall b. Data b => b -> b) -> Word64 -> Word64 # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Word64 -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Word64 -> r # gmapQ :: (forall d. Data d => d -> u) -> Word64 -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Word64 -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Word64 -> m Word64 # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Word64 -> m Word64 # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Word64 -> m Word64 # | |||||
Storable Word64 | Since: base-2.1 | ||||
Bits Word64 | Since: base-2.1 | ||||
Defined in GHC.Word Methods (.&.) :: Word64 -> Word64 -> Word64 # (.|.) :: Word64 -> Word64 -> Word64 # xor :: Word64 -> Word64 -> Word64 # complement :: Word64 -> Word64 # shift :: Word64 -> Int -> Word64 # rotate :: Word64 -> Int -> Word64 # setBit :: Word64 -> Int -> Word64 # clearBit :: Word64 -> Int -> Word64 # complementBit :: Word64 -> Int -> Word64 # testBit :: Word64 -> Int -> Bool # bitSizeMaybe :: Word64 -> Maybe Int # shiftL :: Word64 -> Int -> Word64 # unsafeShiftL :: Word64 -> Int -> Word64 # shiftR :: Word64 -> Int -> Word64 # unsafeShiftR :: Word64 -> Int -> Word64 # rotateL :: Word64 -> Int -> Word64 # | |||||
FiniteBits Word64 | Since: base-4.6.0.0 | ||||
Defined in GHC.Word Methods finiteBitSize :: Word64 -> Int # countLeadingZeros :: Word64 -> Int # countTrailingZeros :: Word64 -> Int # | |||||
Bounded Word64 | Since: base-2.1 | ||||
Enum Word64 | Since: base-2.1 | ||||
Defined in GHC.Word | |||||
Ix Word64 | Since: base-2.1 | ||||
Num Word64 | Since: base-2.1 | ||||
Read Word64 | Since: base-2.1 | ||||
Integral Word64 | Since: base-2.1 | ||||
Real Word64 | Since: base-2.1 | ||||
Defined in GHC.Word Methods toRational :: Word64 -> Rational # | |||||
Show Word64 | Since: base-2.1 | ||||
PrintfArg Word64 | Since: base-2.1 | ||||
Defined in Text.Printf | |||||
BitOps Word64 | |||||
Defined in Basement.Bits Methods (.&.) :: Word64 -> Word64 -> Word64 Source # (.|.) :: Word64 -> Word64 -> Word64 Source # (.^.) :: Word64 -> Word64 -> Word64 Source # (.<<.) :: Word64 -> CountOf Bool -> Word64 Source # (.>>.) :: Word64 -> CountOf Bool -> Word64 Source # bit :: Offset Bool -> Word64 Source # isBitSet :: Word64 -> Offset Bool -> Bool Source # | |||||
FiniteBitsOps Word64 | |||||
Defined in Basement.Bits | |||||
Subtractive Word64 | |||||
Defined in Basement.Numerical.Subtractive Associated Types
| |||||
PrimMemoryComparable Word64 | |||||
Defined in Basement.PrimType | |||||
PrimType Word64 | |||||
Defined in Basement.PrimType Associated Types
Methods primSizeInBytes :: Proxy Word64 -> CountOf Word8 Source # primShiftToBytes :: Proxy Word64 -> Int Source # primBaUIndex :: ByteArray# -> Offset Word64 -> Word64 Source # primMbaURead :: PrimMonad prim => MutableByteArray# (PrimState prim) -> Offset Word64 -> prim Word64 Source # primMbaUWrite :: PrimMonad prim => MutableByteArray# (PrimState prim) -> Offset Word64 -> Word64 -> prim () Source # primAddrIndex :: Addr# -> Offset Word64 -> Word64 Source # primAddrRead :: PrimMonad prim => Addr# -> Offset Word64 -> prim Word64 Source # primAddrWrite :: PrimMonad prim => Addr# -> Offset Word64 -> Word64 -> prim () Source # | |||||
Default Word64 | |||||
Defined in Data.Default.Class | |||||
NFData Word64 | |||||
Defined in Control.DeepSeq | |||||
Eq Word64 | Since: base-2.1 | ||||
Ord Word64 | Since: base-2.1 | ||||
Hashable Word64 | |||||
ByteSwap Word64 | |||||
Defined in Data.Memory.Endian | |||||
Uniform Word64 | |||||
Defined in System.Random.Internal Methods uniformM :: StatefulGen g m => g -> m Word64 Source # | |||||
UniformRange Word64 | |||||
Defined in System.Random.Internal | |||||
ByteSource Word64 | |||||
Defined in Data.UUID.Types.Internal.Builder | |||||
Unbox Word64 | |||||
Defined in Data.Vector.Unboxed.Base | |||||
Lift Word64 | |||||
Vector Vector Word64 | |||||
Defined in Data.Vector.Unboxed.Base Methods basicUnsafeFreeze :: Mutable Vector s Word64 -> ST s (Vector Word64) basicUnsafeThaw :: Vector Word64 -> ST s (Mutable Vector s Word64) basicLength :: Vector Word64 -> Int basicUnsafeSlice :: Int -> Int -> Vector Word64 -> Vector Word64 basicUnsafeIndexM :: Vector Word64 -> Int -> Box Word64 basicUnsafeCopy :: Mutable Vector s Word64 -> Vector Word64 -> ST s () | |||||
MVector MVector Word64 | |||||
Defined in Data.Vector.Unboxed.Base Methods basicLength :: MVector s Word64 -> Int basicUnsafeSlice :: Int -> Int -> MVector s Word64 -> MVector s Word64 basicOverlaps :: MVector s Word64 -> MVector s Word64 -> Bool basicUnsafeNew :: Int -> ST s (MVector s Word64) basicInitialize :: MVector s Word64 -> ST s () basicUnsafeReplicate :: Int -> Word64 -> ST s (MVector s Word64) basicUnsafeRead :: MVector s Word64 -> Int -> ST s Word64 basicUnsafeWrite :: MVector s Word64 -> Int -> Word64 -> ST s () basicClear :: MVector s Word64 -> ST s () basicSet :: MVector s Word64 -> Word64 -> ST s () basicUnsafeCopy :: MVector s Word64 -> MVector s Word64 -> ST s () basicUnsafeMove :: MVector s Word64 -> MVector s Word64 -> ST s () basicUnsafeGrow :: MVector s Word64 -> Int -> ST s (MVector s Word64) | |||||
type NatNumMaxBound Word64 | |||||
Defined in Basement.Nat | |||||
type Difference Word64 | |||||
Defined in Basement.Numerical.Subtractive | |||||
type PrimSize Word64 | |||||
Defined in Basement.PrimType | |||||
newtype Vector Word64 | |||||
Defined in Data.Vector.Unboxed.Base | |||||
type ByteSink Word64 g | |||||
Defined in Data.UUID.Types.Internal.Builder type ByteSink Word64 g = Takes8Bytes g | |||||
newtype MVector s Word64 | |||||
Defined in Data.Vector.Unboxed.Base |
8-bit unsigned integer type
Instances
FromJSON Word8 | |||||
FromJSONKey Word8 | |||||
Defined in Data.Aeson.Types.FromJSON Methods | |||||
ToJSON Word8 | |||||
ToJSONKey Word8 | |||||
Defined in Data.Aeson.Types.ToJSON Methods | |||||
ToLog Word8 Source # | |||||
Defined in Amazonka.Data.Log Methods build :: Word8 -> ByteStringBuilder Source # | |||||
Data Word8 | 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) -> Word8 -> c Word8 # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Word8 # dataTypeOf :: Word8 -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Word8) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Word8) # gmapT :: (forall b. Data b => b -> b) -> Word8 -> Word8 # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Word8 -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Word8 -> r # gmapQ :: (forall d. Data d => d -> u) -> Word8 -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Word8 -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Word8 -> m Word8 # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Word8 -> m Word8 # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Word8 -> m Word8 # | |||||
Storable Word8 | Since: base-2.1 | ||||
Bits Word8 | Since: base-2.1 | ||||
Defined in GHC.Word Methods (.&.) :: Word8 -> Word8 -> Word8 # (.|.) :: Word8 -> Word8 -> Word8 # xor :: Word8 -> Word8 -> Word8 # complement :: Word8 -> Word8 # shift :: Word8 -> Int -> Word8 # rotate :: Word8 -> Int -> Word8 # setBit :: Word8 -> Int -> Word8 # clearBit :: Word8 -> Int -> Word8 # complementBit :: Word8 -> Int -> Word8 # testBit :: Word8 -> Int -> Bool # bitSizeMaybe :: Word8 -> Maybe Int # shiftL :: Word8 -> Int -> Word8 # unsafeShiftL :: Word8 -> Int -> Word8 # shiftR :: Word8 -> Int -> Word8 # unsafeShiftR :: Word8 -> Int -> Word8 # rotateL :: Word8 -> Int -> Word8 # | |||||
FiniteBits Word8 | Since: base-4.6.0.0 | ||||
Defined in GHC.Word Methods finiteBitSize :: Word8 -> Int # countLeadingZeros :: Word8 -> Int # countTrailingZeros :: Word8 -> Int # | |||||
Bounded Word8 | Since: base-2.1 | ||||
Enum Word8 | Since: base-2.1 | ||||
Ix Word8 | Since: base-2.1 | ||||
Num Word8 | Since: base-2.1 | ||||
Read Word8 | Since: base-2.1 | ||||
Integral Word8 | Since: base-2.1 | ||||
Real Word8 | Since: base-2.1 | ||||
Defined in GHC.Word Methods toRational :: Word8 -> Rational # | |||||
Show Word8 | Since: base-2.1 | ||||
PrintfArg Word8 | Since: base-2.1 | ||||
Defined in Text.Printf | |||||
BitOps Word8 | |||||
Defined in Basement.Bits Methods (.&.) :: Word8 -> Word8 -> Word8 Source # (.|.) :: Word8 -> Word8 -> Word8 Source # (.^.) :: Word8 -> Word8 -> Word8 Source # (.<<.) :: Word8 -> CountOf Bool -> Word8 Source # (.>>.) :: Word8 -> CountOf Bool -> Word8 Source # bit :: Offset Bool -> Word8 Source # isBitSet :: Word8 -> Offset Bool -> Bool Source # | |||||
FiniteBitsOps Word8 | |||||
Defined in Basement.Bits | |||||
Subtractive Word8 | |||||
Defined in Basement.Numerical.Subtractive Associated Types
| |||||
PrimMemoryComparable Word8 | |||||
Defined in Basement.PrimType | |||||
PrimType Word8 | |||||
Defined in Basement.PrimType Associated Types
Methods primSizeInBytes :: Proxy Word8 -> CountOf Word8 Source # primShiftToBytes :: Proxy Word8 -> Int Source # primBaUIndex :: ByteArray# -> Offset Word8 -> Word8 Source # primMbaURead :: PrimMonad prim => MutableByteArray# (PrimState prim) -> Offset Word8 -> prim Word8 Source # primMbaUWrite :: PrimMonad prim => MutableByteArray# (PrimState prim) -> Offset Word8 -> Word8 -> prim () Source # primAddrIndex :: Addr# -> Offset Word8 -> Word8 Source # primAddrRead :: PrimMonad prim => Addr# -> Offset Word8 -> prim Word8 Source # primAddrWrite :: PrimMonad prim => Addr# -> Offset Word8 -> Word8 -> prim () Source # | |||||
Default Word8 | |||||
Defined in Data.Default.Class | |||||
NFData Word8 | |||||
Defined in Control.DeepSeq | |||||
Eq Word8 | Since: base-2.1 | ||||
Ord Word8 | Since: base-2.1 | ||||
Hashable Word8 | |||||
Uniform Word8 | |||||
Defined in System.Random.Internal Methods uniformM :: StatefulGen g m => g -> m Word8 Source # | |||||
UniformRange Word8 | |||||
Defined in System.Random.Internal | |||||
ByteSource Word8 | |||||
Defined in Data.UUID.Types.Internal.Builder | |||||
Unbox Word8 | |||||
Defined in Data.Vector.Unboxed.Base | |||||
Lift Word8 | |||||
Vector Vector Word8 | |||||
Defined in Data.Vector.Unboxed.Base Methods basicUnsafeFreeze :: Mutable Vector s Word8 -> ST s (Vector Word8) basicUnsafeThaw :: Vector Word8 -> ST s (Mutable Vector s Word8) basicLength :: Vector Word8 -> Int basicUnsafeSlice :: Int -> Int -> Vector Word8 -> Vector Word8 basicUnsafeIndexM :: Vector Word8 -> Int -> Box Word8 basicUnsafeCopy :: Mutable Vector s Word8 -> Vector Word8 -> ST s () | |||||
MVector MVector Word8 | |||||
Defined in Data.Vector.Unboxed.Base Methods basicLength :: MVector s Word8 -> Int basicUnsafeSlice :: Int -> Int -> MVector s Word8 -> MVector s Word8 basicOverlaps :: MVector s Word8 -> MVector s Word8 -> Bool basicUnsafeNew :: Int -> ST s (MVector s Word8) basicInitialize :: MVector s Word8 -> ST s () basicUnsafeReplicate :: Int -> Word8 -> ST s (MVector s Word8) basicUnsafeRead :: MVector s Word8 -> Int -> ST s Word8 basicUnsafeWrite :: MVector s Word8 -> Int -> Word8 -> ST s () basicClear :: MVector s Word8 -> ST s () basicSet :: MVector s Word8 -> Word8 -> ST s () basicUnsafeCopy :: MVector s Word8 -> MVector s Word8 -> ST s () basicUnsafeMove :: MVector s Word8 -> MVector s Word8 -> ST s () basicUnsafeGrow :: MVector s Word8 -> Int -> ST s (MVector s Word8) | |||||
Cons ByteString ByteString Word8 Word8 | |||||
Defined in Control.Lens.Cons Methods _Cons :: Prism ByteString ByteString (Word8, ByteString) (Word8, ByteString) Source # | |||||
Cons ByteString ByteString Word8 Word8 | |||||
Defined in Control.Lens.Cons Methods _Cons :: Prism ByteString ByteString (Word8, ByteString) (Word8, ByteString) Source # | |||||
Snoc ByteString ByteString Word8 Word8 | |||||
Defined in Control.Lens.Cons Methods _Snoc :: Prism ByteString ByteString (ByteString, Word8) (ByteString, Word8) Source # | |||||
Snoc ByteString ByteString Word8 Word8 | |||||
Defined in Control.Lens.Cons Methods _Snoc :: Prism ByteString ByteString (ByteString, Word8) (ByteString, Word8) Source # | |||||
type NatNumMaxBound Word8 | |||||
Defined in Basement.Nat | |||||
type Difference Word8 | |||||
Defined in Basement.Numerical.Subtractive | |||||
type PrimSize Word8 | |||||
Defined in Basement.PrimType | |||||
newtype Vector Word8 | |||||
Defined in Data.Vector.Unboxed.Base | |||||
type ByteSink Word8 g | |||||
Defined in Data.UUID.Types.Internal.Builder type ByteSink Word8 g = Takes1Byte g | |||||
newtype MVector s Word8 | |||||
Defined in Data.Vector.Unboxed.Base |
data Scientific Source #
An arbitrary-precision number represented using scientific notation.
This type describes the set of all
which have a finite
decimal expansion.Real
s
A scientific number with coefficient
c
and base10Exponent
e
corresponds to the Fractional
number: fromInteger
c * 10 ^^
e
Instances
FromJSON Scientific | |
Defined in Data.Aeson.Types.FromJSON Methods parseJSON :: Value -> Parser Scientific Source # parseJSONList :: Value -> Parser [Scientific] Source # | |
ToJSON Scientific | |
Defined in Data.Aeson.Types.ToJSON Methods toJSON :: Scientific -> Value Source # toEncoding :: Scientific -> Encoding Source # toJSONList :: [Scientific] -> Value Source # toEncodingList :: [Scientific] -> Encoding Source # omitField :: Scientific -> Bool Source # | |
ToJSONKey Scientific | |
Defined in Data.Aeson.Types.ToJSON Methods | |
FromText Scientific Source # | |
Defined in Amazonka.Data.Text | |
ToText Scientific Source # | |
Defined in Amazonka.Data.Text Methods toText :: Scientific -> Text Source # | |
Data Scientific | |
Defined in Data.Scientific Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Scientific -> c Scientific # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Scientific # toConstr :: Scientific -> Constr # dataTypeOf :: Scientific -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Scientific) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Scientific) # gmapT :: (forall b. Data b => b -> b) -> Scientific -> Scientific # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Scientific -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Scientific -> r # gmapQ :: (forall d. Data d => d -> u) -> Scientific -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Scientific -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Scientific -> m Scientific # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Scientific -> m Scientific # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Scientific -> m Scientific # | |
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 # | |
Read Scientific | Supports the skipping of parentheses and whitespaces. Example: > read " ( (( -1.0e+3 ) ))" :: Scientific -1000.0 (Note: This |
Defined in Data.Scientific Methods readsPrec :: Int -> ReadS Scientific # readList :: ReadS [Scientific] # readPrec :: ReadPrec Scientific # readListPrec :: ReadPrec [Scientific] # | |
Fractional Scientific | WARNING: These methods also compute
|
Defined in Data.Scientific Methods (/) :: Scientific -> Scientific -> Scientific # recip :: Scientific -> Scientific # fromRational :: Rational -> Scientific # | |
Real Scientific | WARNING: Avoid applying |
Defined in Data.Scientific Methods toRational :: Scientific -> Rational # | |
RealFrac Scientific | WARNING: the methods of the |
Defined in Data.Scientific Methods properFraction :: Integral b => Scientific -> (b, Scientific) # truncate :: Integral b => Scientific -> b # round :: Integral b => Scientific -> b # ceiling :: Integral b => Scientific -> b # floor :: Integral b => Scientific -> b # | |
Show Scientific | See |
Defined in Data.Scientific Methods showsPrec :: Int -> Scientific -> ShowS # show :: Scientific -> String # showList :: [Scientific] -> ShowS # | |
Binary Scientific | Note that in the future I intend to change the type of the |
Defined in Data.Scientific | |
NFData Scientific | |
Defined in Data.Scientific Methods rnf :: Scientific -> () # | |
Eq Scientific | Scientific numbers can be safely compared for equality. No magnitude |
Defined in Data.Scientific | |
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 # | |
Hashable Scientific | A hash can be safely calculated from a
|
Defined in Data.Scientific | |
Lift Scientific | Since: scientific-0.3.7.0 |
Defined in Data.Scientific Methods lift :: Quote m => Scientific -> m Exp # liftTyped :: forall (m :: Type -> Type). Quote m => Scientific -> Code m Scientific # |
This is the simplest representation of UTC. It consists of the day number, and a time offset from midnight. Note that if a day has a leap second added to it, it will have 86401 seconds.
Instances
FromJSON UTCTime | |
FromJSONKey UTCTime | |
Defined in Data.Aeson.Types.FromJSON Methods | |
ToJSON UTCTime | |
ToJSONKey UTCTime | |
Defined in Data.Aeson.Types.ToJSON Methods | |
ToByteString UTCTime Source # | |
Defined in Amazonka.Data.ByteString Methods toBS :: UTCTime -> ByteString Source # | |
ToLog UTCTime Source # | |
Defined in Amazonka.Data.Log Methods build :: UTCTime -> ByteStringBuilder Source # | |
Data UTCTime | |
Defined in Data.Time.Clock.Internal.UTCTime Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> UTCTime -> c UTCTime # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c UTCTime # toConstr :: UTCTime -> Constr # dataTypeOf :: UTCTime -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c UTCTime) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c UTCTime) # gmapT :: (forall b. Data b => b -> b) -> UTCTime -> UTCTime # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> UTCTime -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> UTCTime -> r # gmapQ :: (forall d. Data d => d -> u) -> UTCTime -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> UTCTime -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> UTCTime -> m UTCTime # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> UTCTime -> m UTCTime # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> UTCTime -> m UTCTime # | |
NFData UTCTime | |
Defined in Data.Time.Clock.Internal.UTCTime | |
Eq UTCTime | |
Ord UTCTime | |
Defined in Data.Time.Clock.Internal.UTCTime | |
ISO8601 UTCTime |
|
Defined in Data.Time.Format.ISO8601 Methods |
class Eq a => Hashable a where Source #
The class of types that can be converted to a hash value.
Minimal implementation: hashWithSalt
.
Hashable
is intended exclusively for use in in-memory data structures.
.
Hashable
does not have a fixed standard.
This allows it to improve over time.
.
Because it does not have a fixed standard, different computers or computers on different versions of the code will observe different hash values.
As such, Hashable
is not recommended for use other than in-memory datastructures.
Specifically, Hashable
is not intended for network use or in applications which persist hashed values.
For stable hashing use named hashes: sha256, crc32, xxhash etc.
If you are looking for Hashable
instance in time
package,
check time-compat
Minimal complete definition
Nothing
Methods
hashWithSalt :: Int -> a -> Int infixl 0 Source #
Return a hash value for the argument, using the given salt.
The general contract of hashWithSalt
is:
- If two values are equal according to the
==
method, then applying thehashWithSalt
method on each of the two values must produce the same integer result if the same salt is used in each case. - It is not required that if two values are unequal
according to the
==
method, then applying thehashWithSalt
method on each of the two values must produce distinct integer results. However, the programmer should be aware that producing distinct integer results for unequal values may improve the performance of hashing-based data structures. - This method can be used to compute different hash values for
the same input by providing a different salt in each
application of the method. This implies that any instance
that defines
hashWithSalt
must make use of the salt in its implementation. hashWithSalt
may return negativeInt
values.
Like hashWithSalt
, but no salt is used. The default
implementation uses hashWithSalt
with some default salt.
Instances might want to implement this method to provide a more
efficient implementation than the default implementation.
Instances
Hashable Key | |
Hashable Value | |
Hashable Base64 Source # | |
Hashable AccessKey Source # | |
Hashable Region Source # | |
Hashable Seconds Source # | |
Hashable SecretKey Source # | |
Hashable SessionToken Source # | |
Defined in Amazonka.Types | |
Hashable ByteArray | This instance was available since 1.4.1.0 only for GHC-9.4+ Since: hashable-1.4.2.0 |
Hashable SomeTypeRep | |
Defined in Data.Hashable.Class | |
Hashable Unique | |
Hashable Version | |
Hashable IntPtr | |
Hashable WordPtr | |
Hashable Void | |
Hashable ThreadId | |
Hashable Fingerprint | Since: hashable-1.3.0.0 |
Defined in Data.Hashable.Class | |
Hashable Int16 | |
Hashable Int32 | |
Hashable Int64 | |
Hashable Int8 | |
Hashable Word16 | |
Hashable Word32 | |
Hashable Word64 | |
Hashable Word8 | |
Hashable ByteString | |
Defined in Data.Hashable.Class | |
Hashable ByteString | |
Defined in Data.Hashable.Class | |
Hashable ShortByteString | |
Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> ShortByteString -> Int Source # hash :: ShortByteString -> Int Source # | |
Hashable IntSet | Since: hashable-1.3.4.0 |
Hashable OsString | |
Hashable PosixString | |
Defined in Data.Hashable.Class | |
Hashable WindowsString | |
Defined in Data.Hashable.Class | |
Hashable BigNat | |
Hashable Ordering | |
Hashable OsString | Since: hashable-1.4.2.0 |
Hashable PosixString | Since: hashable-1.4.2.0 |
Defined in Data.Hashable.Class | |
Hashable WindowsString | Since: hashable-1.4.2.0 |
Defined in Data.Hashable.Class | |
Hashable Scientific | A hash can be safely calculated from a
|
Defined in Data.Scientific | |
Hashable Text | |
Hashable Text | |
Hashable ShortText | |
Hashable UUID | |
Hashable Integer | |
Hashable Natural | |
Hashable () | |
Defined in Data.Hashable.Class | |
Hashable Bool | |
Hashable Char | |
Hashable Double | Note: prior to The Since: hashable-1.3.0.0 |
Hashable Float | Note: prior to The Since: hashable-1.3.0.0 |
Hashable Int | |
Hashable Word | |
Hashable v => Hashable (KeyMap v) | |
Hashable a => Hashable (Sensitive a) Source # | |
Hashable (Time a) Source # | |
Hashable a => Hashable (Complex a) | |
Hashable a => Hashable (Identity a) | |
Hashable a => Hashable (First a) | |
Hashable a => Hashable (Last a) | |
Hashable a => Hashable (Max a) | |
Hashable a => Hashable (Min a) | |
Hashable a => Hashable (WrappedMonoid a) | |
Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> WrappedMonoid a -> Int Source # hash :: WrappedMonoid a -> Int Source # | |
Hashable a => Hashable (NonEmpty a) | |
Hashable (FunPtr a) | |
Hashable (Ptr a) | |
Hashable a => Hashable (Ratio a) | |
Hashable (StableName a) | |
Defined in Data.Hashable.Class | |
Hashable s => Hashable (CI s) | |
Hashable v => Hashable (IntMap v) | Since: hashable-1.3.4.0 |
Hashable v => Hashable (Seq v) | Since: hashable-1.3.4.0 |
Hashable v => Hashable (Set v) | Since: hashable-1.3.4.0 |
Hashable v => Hashable (Tree v) | Since: hashable-1.3.4.0 |
Hashable1 f => Hashable (Fix f) | |
Eq a => Hashable (Hashed a) | |
Hashable a => Hashable (Maybe a) | |
Hashable a => Hashable (HashSet a) | |
Hashable a => Hashable (Maybe a) | |
Hashable a => Hashable (Solo a) | |
Hashable a => Hashable [a] | |
Defined in Data.Hashable.Class | |
(Hashable a, Hashable b) => Hashable (Either a b) | |
Hashable (Fixed a) | |
Hashable (Proxy a) | |
Hashable a => Hashable (Arg a b) | Note: Prior to Since: hashable-1.3.0.0 |
Hashable (TypeRep a) | |
(Hashable k, Hashable v) => Hashable (Map k v) | Since: hashable-1.3.4.0 |
(Hashable a, Hashable b) => Hashable (Either a b) | |
(Hashable a, Hashable b) => Hashable (These a b) | |
(Hashable a, Hashable b) => Hashable (Pair a b) | |
(Hashable a, Hashable b) => Hashable (These a b) | |
(Hashable k, Hashable v) => Hashable (HashMap k v) | |
(Hashable a1, Hashable a2) => Hashable (a1, a2) | |
Defined in Data.Hashable.Class | |
Hashable a => Hashable (Const a b) | |
(Hashable a1, Hashable a2, Hashable a3) => Hashable (a1, a2, a3) | |
Defined in Data.Hashable.Class | |
(Hashable1 f, Hashable1 g, Hashable a) => Hashable (Product f g a) | |
(Hashable1 f, Hashable1 g, Hashable a) => Hashable (Sum f g a) | |
(Hashable a1, Hashable a2, Hashable a3, Hashable a4) => Hashable (a1, a2, a3, a4) | |
Defined in Data.Hashable.Class | |
(Hashable1 f, Hashable1 g, Hashable a) => Hashable (Compose f g a) | In general, |
(Hashable a1, Hashable a2, Hashable a3, Hashable a4, Hashable a5) => Hashable (a1, a2, a3, a4, a5) | |
Defined in Data.Hashable.Class | |
(Hashable a1, Hashable a2, Hashable a3, Hashable a4, Hashable a5, Hashable a6) => Hashable (a1, a2, a3, a4, a5, a6) | |
Defined in Data.Hashable.Class | |
(Hashable a1, Hashable a2, Hashable a3, Hashable a4, Hashable a5, Hashable a6, Hashable a7) => Hashable (a1, a2, a3, a4, a5, a6, a7) | |
Defined in Data.Hashable.Class |
Maybe monoid returning the leftmost non-Nothing
value.
is isomorphic to First
a
, but precedes it
historically.Alt
Maybe
a
Beware that Data.Monoid.
First
is different from
Data.Semigroup.
First
. The former returns the first non-Nothing
,
so Data.Monoid.First Nothing <> x = x
. The latter simply returns the first value,
thus Data.Semigroup.First Nothing <> x = Data.Semigroup.First Nothing
.
Examples
>>>
First (Just "hello") <> First Nothing <> First (Just "world")
First {getFirst = Just "hello"}
>>>
First Nothing <> mempty
First {getFirst = Nothing}
Instances
FromJSON1 First | |||||
Defined in Data.Aeson.Types.FromJSON | |||||
ToJSON1 First | |||||
Defined in Data.Aeson.Types.ToJSON Methods liftToJSON :: (a -> Bool) -> (a -> Value) -> ([a] -> Value) -> First a -> Value Source # liftToJSONList :: (a -> Bool) -> (a -> Value) -> ([a] -> Value) -> [First a] -> Value Source # liftToEncoding :: (a -> Bool) -> (a -> Encoding) -> ([a] -> Encoding) -> First a -> Encoding Source # liftToEncodingList :: (a -> Bool) -> (a -> Encoding) -> ([a] -> Encoding) -> [First a] -> Encoding Source # | |||||
MonadFix First | Since: base-4.8.0.0 | ||||
Defined in Control.Monad.Fix | |||||
MonadZip First | Since: base-4.8.0.0 | ||||
Foldable First | Since: base-4.8.0.0 | ||||
Defined in Data.Foldable Methods fold :: Monoid m => First m -> m # foldMap :: Monoid m => (a -> m) -> First a -> m # foldMap' :: Monoid m => (a -> m) -> First a -> m # foldr :: (a -> b -> b) -> b -> First a -> b # foldr' :: (a -> b -> b) -> b -> First a -> b # foldl :: (b -> a -> b) -> b -> First a -> b # foldl' :: (b -> a -> b) -> b -> First a -> b # foldr1 :: (a -> a -> a) -> First a -> a # foldl1 :: (a -> a -> a) -> First a -> a # elem :: Eq a => a -> First a -> Bool # maximum :: Ord a => First a -> a # minimum :: Ord a => First a -> a # | |||||
Traversable First | Since: base-4.8.0.0 | ||||
Applicative First | Since: base-4.8.0.0 | ||||
Functor First | Since: base-4.8.0.0 | ||||
Monad First | Since: base-4.8.0.0 | ||||
NFData1 First | Since: deepseq-1.4.3.0 | ||||
Defined in Control.DeepSeq | |||||
Generic1 First | |||||
Defined in Data.Monoid Associated Types
| |||||
FromJSON a => FromJSON (First a) | |||||
ToJSON a => ToJSON (First a) | |||||
Data a => Data (First a) | Since: base-4.8.0.0 | ||||
Defined in Data.Data Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> First a -> c (First a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (First a) # toConstr :: First a -> Constr # dataTypeOf :: First a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (First a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (First a)) # gmapT :: (forall b. Data b => b -> b) -> First a -> First a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> First a -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> First a -> r # gmapQ :: (forall d. Data d => d -> u) -> First a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> First a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> First a -> m (First a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> First a -> m (First a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> First a -> m (First a) # | |||||
Monoid (First a) | Since: base-2.1 | ||||
Semigroup (First a) | Since: base-4.9.0.0 | ||||
Generic (First a) | |||||
Defined in Data.Monoid Associated Types
| |||||
Read a => Read (First a) | Since: base-2.1 | ||||
Show a => Show (First a) | Since: base-2.1 | ||||
Default (First a) | |||||
Defined in Data.Default.Class | |||||
NFData a => NFData (First a) | Since: deepseq-1.4.0.0 | ||||
Defined in Control.DeepSeq | |||||
Eq a => Eq (First a) | Since: base-2.1 | ||||
Ord a => Ord (First a) | Since: base-2.1 | ||||
AsEmpty (First a) | |||||
Wrapped (First a) | |||||
t ~ First b => Rewrapped (First a) t | |||||
Defined in Control.Lens.Wrapped | |||||
type Rep1 First | Since: base-4.7.0.0 | ||||
Defined in Data.Monoid | |||||
type Rep (First a) | Since: base-4.7.0.0 | ||||
Defined in Data.Monoid | |||||
type Unwrapped (First a) | |||||
Defined in Control.Lens.Wrapped |
class (Typeable e, Show e) => Exception e #
Any type that you wish to throw or catch as an exception must be an
instance of the Exception
class. The simplest case is a new exception
type directly below the root:
data MyException = ThisException | ThatException deriving Show instance Exception MyException
The default method definitions in the Exception
class do what we need
in this case. You can now throw and catch ThisException
and
ThatException
as exceptions:
*Main> throw ThisException `catch` \e -> putStrLn ("Caught " ++ show (e :: MyException)) Caught ThisException
In more complicated examples, you may wish to define a whole hierarchy of exceptions:
--------------------------------------------------------------------- -- Make the root exception type for all the exceptions in a compiler data SomeCompilerException = forall e . Exception e => SomeCompilerException e instance Show SomeCompilerException where show (SomeCompilerException e) = show e instance Exception SomeCompilerException compilerExceptionToException :: Exception e => e -> SomeException compilerExceptionToException = toException . SomeCompilerException compilerExceptionFromException :: Exception e => SomeException -> Maybe e compilerExceptionFromException x = do SomeCompilerException a <- fromException x cast a --------------------------------------------------------------------- -- Make a subhierarchy for exceptions in the frontend of the compiler data SomeFrontendException = forall e . Exception e => SomeFrontendException e instance Show SomeFrontendException where show (SomeFrontendException e) = show e instance Exception SomeFrontendException where toException = compilerExceptionToException fromException = compilerExceptionFromException frontendExceptionToException :: Exception e => e -> SomeException frontendExceptionToException = toException . SomeFrontendException frontendExceptionFromException :: Exception e => SomeException -> Maybe e frontendExceptionFromException x = do SomeFrontendException a <- fromException x cast a --------------------------------------------------------------------- -- Make an exception type for a particular frontend compiler exception data MismatchedParentheses = MismatchedParentheses deriving Show instance Exception MismatchedParentheses where toException = frontendExceptionToException fromException = frontendExceptionFromException
We can now catch a MismatchedParentheses
exception as
MismatchedParentheses
, SomeFrontendException
or
SomeCompilerException
, but not other types, e.g. IOException
:
*Main> throw MismatchedParentheses `catch` \e -> putStrLn ("Caught " ++ show (e :: MismatchedParentheses)) Caught MismatchedParentheses *Main> throw MismatchedParentheses `catch` \e -> putStrLn ("Caught " ++ show (e :: SomeFrontendException)) Caught MismatchedParentheses *Main> throw MismatchedParentheses `catch` \e -> putStrLn ("Caught " ++ show (e :: SomeCompilerException)) Caught MismatchedParentheses *Main> throw MismatchedParentheses `catch` \e -> putStrLn ("Caught " ++ show (e :: IOException)) *** Exception: MismatchedParentheses
Instances
Exception AesonException | |
Defined in Data.Aeson.Types.Internal Methods toException :: AesonException -> SomeException # | |
Exception Error Source # | |
Defined in Amazonka.Types Methods toException :: Error -> SomeException # fromException :: SomeException -> Maybe Error # displayException :: Error -> String # | |
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 ASCII7_Invalid | |
Defined in Basement.String.Encoding.ASCII7 Methods toException :: ASCII7_Invalid -> SomeException # fromException :: SomeException -> Maybe ASCII7_Invalid # displayException :: ASCII7_Invalid -> String # | |
Exception ISO_8859_1_Invalid | |
Defined in Basement.String.Encoding.ISO_8859_1 Methods toException :: ISO_8859_1_Invalid -> SomeException # fromException :: SomeException -> Maybe ISO_8859_1_Invalid # displayException :: ISO_8859_1_Invalid -> String # | |
Exception UTF16_Invalid | |
Defined in Basement.String.Encoding.UTF16 Methods toException :: UTF16_Invalid -> SomeException # fromException :: SomeException -> Maybe UTF16_Invalid # displayException :: UTF16_Invalid -> String # | |
Exception UTF32_Invalid | |
Defined in Basement.String.Encoding.UTF32 Methods toException :: UTF32_Invalid -> SomeException # fromException :: SomeException -> Maybe UTF32_Invalid # displayException :: UTF32_Invalid -> String # | |
Exception SizeOverflowException | |
Defined in Data.ByteString.Internal.Type | |
Exception ParseError | |
Defined in Data.Conduit.Attoparsec Methods toException :: ParseError -> SomeException # fromException :: SomeException -> Maybe ParseError # displayException :: ParseError -> String # | |
Exception SinkStorableException | |
Defined in Data.Conduit.Binary Methods toException :: SinkStorableException -> SomeException # fromException :: SomeException -> Maybe SinkStorableException # displayException :: SinkStorableException -> String # | |
Exception TextException | |
Defined in Data.Conduit.Text Methods toException :: TextException -> SomeException # fromException :: SomeException -> Maybe TextException # displayException :: TextException -> String # | |
Exception CryptoError | |
Defined in Crypto.Error.Types Methods toException :: CryptoError -> SomeException # fromException :: SomeException -> Maybe CryptoError # displayException :: CryptoError -> String # | |
Exception CoprimesAssertionError | |
Defined in Crypto.Number.ModArithmetic Methods toException :: CoprimesAssertionError -> SomeException # fromException :: SomeException -> Maybe CoprimesAssertionError # displayException :: CoprimesAssertionError -> String # | |
Exception ModulusAssertionError | |
Defined in Crypto.Number.ModArithmetic Methods toException :: ModulusAssertionError -> SomeException # fromException :: SomeException -> Maybe ModulusAssertionError # displayException :: ModulusAssertionError -> String # | |
Exception EncapsulatedPopperException | |
Defined in Network.HTTP.Client.Request Methods toException :: EncapsulatedPopperException -> SomeException # fromException :: SomeException -> Maybe EncapsulatedPopperException # displayException :: EncapsulatedPopperException -> String # | |
Exception HttpException | |
Defined in Network.HTTP.Client.Types Methods toException :: HttpException -> SomeException # fromException :: SomeException -> Maybe HttpException # displayException :: HttpException -> String # | |
Exception HttpExceptionContentWrapper | |
Defined in Network.HTTP.Client.Types Methods toException :: HttpExceptionContentWrapper -> SomeException # fromException :: SomeException -> Maybe HttpExceptionContentWrapper # displayException :: HttpExceptionContentWrapper -> String # | |
Exception JSONException | |
Defined in Network.HTTP.Simple Methods toException :: JSONException -> SomeException # fromException :: SomeException -> Maybe JSONException # displayException :: JSONException -> String # | |
Exception HandlingException | |
Defined in Control.Lens.Internal.Exception Methods toException :: HandlingException -> SomeException # | |
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 UnicodeException | |
Defined in Data.Text.Encoding.Error Methods toException :: UnicodeException -> SomeException # | |
Exception UnresolvedEntityException | |
Defined in Text.XML | |
Exception XMLException | |
Defined in Text.XML Methods toException :: XMLException -> SomeException # fromException :: SomeException -> Maybe XMLException # displayException :: XMLException -> String # | |
Exception XmlException | |
Defined in Text.XML.Stream.Parse Methods toException :: XmlException -> SomeException # fromException :: SomeException -> Maybe XmlException # displayException :: XmlException -> String # | |
Exception InvalidEventStream | |
Defined in Text.XML.Unresolved Methods toException :: InvalidEventStream -> SomeException # fromException :: SomeException -> Maybe InvalidEventStream # | |
Exception DecompressError | |
Defined in Codec.Compression.Zlib.Internal Methods toException :: DecompressError -> SomeException # | |
Typeable a => Exception (FieldException a) | |
Defined in Data.Data.Lens Methods toException :: FieldException a -> SomeException # fromException :: SomeException -> Maybe (FieldException a) # displayException :: FieldException a -> String # | |
(Reifies s (SomeException -> Maybe a), Typeable a, Typeable s, Typeable m) => Exception (Handling a s m) | |
Defined in Control.Lens.Internal.Exception Methods toException :: Handling a s m -> SomeException # fromException :: SomeException -> Maybe (Handling a s m) # displayException :: Handling a s m -> String # |
This class gives the integer associated with a type-level natural. There are instances of the class for every concrete literal: 0, 1, 2, etc.
Since: base-4.7.0.0
Minimal complete definition
class KnownSymbol (n :: Symbol) #
This class gives the string associated with a type-level symbol. There are instances of the class for every concrete literal: "hello", etc.
Since: base-4.7.0.0
Minimal complete definition
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
AsError SomeException Source # | |
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 # | |
AsAllocationLimitExceeded SomeException | |
Defined in Control.Exception.Lens | |
AsArithException SomeException | |
Defined in Control.Exception.Lens Methods _ArithException :: Prism' SomeException ArithException Source # | |
AsArrayException SomeException | |
Defined in Control.Exception.Lens Methods _ArrayException :: Prism' SomeException ArrayException Source # | |
AsAssertionFailed SomeException | |
Defined in Control.Exception.Lens | |
AsAsyncException SomeException | |
Defined in Control.Exception.Lens Methods _AsyncException :: Prism' SomeException AsyncException Source # | |
AsBlockedIndefinitelyOnMVar SomeException | |
AsBlockedIndefinitelyOnSTM SomeException | |
AsCompactionFailed SomeException | |
Defined in Control.Exception.Lens | |
AsDeadlock SomeException | |
Defined in Control.Exception.Lens Methods __Deadlock :: Prism' SomeException Deadlock Source # _Deadlock :: Prism' SomeException () Source # | |
AsErrorCall SomeException | |
Defined in Control.Exception.Lens Methods | |
AsHandlingException SomeException | |
Defined in Control.Exception.Lens | |
AsIOException SomeException | |
Defined in Control.Exception.Lens Methods | |
AsNestedAtomically SomeException | |
Defined in Control.Exception.Lens | |
AsNoMethodError SomeException | |
Defined in Control.Exception.Lens | |
AsNonTermination SomeException | |
Defined in Control.Exception.Lens Methods __NonTermination :: Prism' SomeException NonTermination Source # | |
AsPatternMatchFail SomeException | |
Defined in Control.Exception.Lens | |
AsRecConError SomeException | |
Defined in Control.Exception.Lens | |
AsRecSelError SomeException | |
Defined in Control.Exception.Lens | |
AsRecUpdError SomeException | |
Defined in Control.Exception.Lens | |
AsTypeError SomeException | |
Defined in Control.Exception.Lens Methods | |
AsDynamic SomeException | |
Defined in Data.Dynamic.Lens | |
AsExitCode SomeException | |
Defined in System.Exit.Lens | |
Handleable SomeException IO Handler | |
Typeable m => Handleable SomeException m (Handler m) | |
(&) :: 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
, where flip
id
id
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
A type synonym for Natural
.
Previously, this was an opaque data type, but it was changed to a type synonym.
Since: base-4.16.0.0
The Item
type function returns the type of items of the structure
l
.
Instances
type Item ByteArray | |
Defined in Data.Array.Byte | |
type Item Version | |
Defined in GHC.IsList | |
type Item CallStack | |
Defined in GHC.IsList | |
type Item String | |
Defined in Basement.UTF8.Base | |
type Item ByteString | |
Defined in Data.ByteString.Internal.Type | |
type Item ByteString | |
Defined in Data.ByteString.Lazy.Internal | |
type Item ShortByteString | |
Defined in Data.ByteString.Short.Internal | |
type Item ByteArray | |
Defined in Codec.CBOR.ByteArray | |
type Item SlicedByteArray | |
Defined in Codec.CBOR.ByteArray.Sliced | |
type Item IntSet | |
Defined in Data.IntSet.Internal | |
type Item Text | |
type Item Text | |
Defined in Data.Text.Lazy | |
type Item ShortText | |
Defined in Data.Text.Short.Internal | |
type Item (KeyMap v) | |
Defined in Data.Aeson.KeyMap | |
type Item (Sensitive a) Source # | |
Defined in Amazonka.Data.Sensitive | |
type Item (ZipList a) | |
Defined in GHC.IsList | |
type Item (NonEmpty a) | |
Defined in GHC.IsList | |
type Item (Block ty) | |
Defined in Basement.Block.Base | |
type Item (NonEmpty c) | |
Defined in Basement.NonEmpty | |
type Item (UArray ty) | |
Defined in Basement.UArray.Base | |
type Item (IntMap a) | |
Defined in Data.IntMap.Internal | |
type Item (Seq a) | |
Defined in Data.Sequence.Internal | |
type Item (Set a) | |
Defined in Data.Set.Internal | |
type Item (DNonEmpty a) | |
Defined in Data.DList.DNonEmpty.Internal | |
type Item (DList a) | |
Defined in Data.DList.Internal | |
type Item (Array a) | |
Defined in Data.Primitive.Array | |
type Item (PrimArray a) | |
Defined in Data.Primitive.PrimArray | |
type Item (SmallArray a) | |
Defined in Data.Primitive.SmallArray | |
type Item (HashSet a) | |
Defined in Data.HashSet.Internal | |
type Item (Vector a) | |
Defined in Data.Vector type Item (Vector a) = a | |
type Item (Vector a) | |
Defined in Data.Vector.Primitive type Item (Vector a) = a | |
type Item (Vector a) | |
Defined in Data.Vector.Storable type Item (Vector a) = a | |
type Item (Vector a) | |
Defined in Data.Vector.Strict type Item (Vector a) = a | |
type Item (Vector e) | |
Defined in Data.Vector.Unboxed | |
type Item [a] | |
Defined in GHC.IsList type Item [a] = a | |
type Item (Map k v) | |
Defined in Data.Map.Internal | |
type Item (HashMap k v) | |
Defined in Data.HashMap.Internal |
A CI s
provides Case Insensitive comparison for the string-like type
s
(for example: String
, Text
, ByteString
, etc.).
Note that CI s
has an instance for IsString
which together with the
OverloadedStrings
language extension allows you to write case insensitive
string literals as in:
> ("Content-Type" ::CI
Text
) == ("CONTENT-TYPE" ::CI
Text
) True
Instances
ToByteString a => ToByteString (CI a) Source # | |
Defined in Amazonka.Data.ByteString Methods toBS :: CI a -> ByteString Source # | |
ToLog a => ToLog (CI a) Source # | |
Defined in Amazonka.Data.Log Methods build :: CI a -> ByteStringBuilder Source # | |
ToLog [Header] Source # | |
Defined in Amazonka.Data.Log Methods build :: [Header] -> ByteStringBuilder Source # | |
(FoldCase a, FromText a) => FromText (CI a) Source # | |
ToText a => ToText (CI a) Source # | |
Data s => Data (CI s) | |
Defined in Data.CaseInsensitive.Internal Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> CI s -> c (CI s) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (CI s) # dataTypeOf :: CI s -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (CI s)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (CI s)) # gmapT :: (forall b. Data b => b -> b) -> CI s -> CI s # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> CI s -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> CI s -> r # gmapQ :: (forall d. Data d => d -> u) -> CI s -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> CI s -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> CI s -> m (CI s) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> CI s -> m (CI s) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> CI s -> m (CI s) # | |
(IsString s, FoldCase s) => IsString (CI s) | |
Defined in Data.CaseInsensitive.Internal Methods fromString :: String -> CI s # | |
Monoid s => Monoid (CI s) | |
Semigroup s => Semigroup (CI s) | |
(Read s, FoldCase s) => Read (CI s) | |
Show s => Show (CI s) | |
FoldCase (CI s) | |
Defined in Data.CaseInsensitive.Internal | |
NFData s => NFData (CI s) | |
Defined in Data.CaseInsensitive.Internal | |
Eq s => Eq (CI s) | |
Ord s => Ord (CI s) | |
Hashable s => Hashable (CI s) | |
class MonadIO m => MonadResource (m :: Type -> Type) Source #
A Monad
which allows for safe resource allocation. In theory, any monad
transformer stack which includes a ResourceT
can be an instance of
MonadResource
.
Note: runResourceT
has a requirement for a MonadUnliftIO m
monad,
which allows control operations to be lifted. A MonadResource
does not
have this requirement. This means that transformers such as ContT
can be
an instance of MonadResource
. However, the ContT
wrapper will need to be
unwrapped before calling runResourceT
.
Since 0.3.0
Minimal complete definition
Instances
MonadIO m => MonadResource (ResourceT m) | |
Defined in Control.Monad.Trans.Resource.Internal | |
MonadResource m => MonadResource (MaybeT m) | |
Defined in Control.Monad.Trans.Resource.Internal | |
MonadResource m => MonadResource (ExceptT e m) | |
Defined in Control.Monad.Trans.Resource.Internal | |
MonadResource m => MonadResource (IdentityT m) | |
Defined in Control.Monad.Trans.Resource.Internal | |
MonadResource m => MonadResource (ReaderT r m) | |
Defined in Control.Monad.Trans.Resource.Internal | |
MonadResource m => MonadResource (StateT s m) | |
Defined in Control.Monad.Trans.Resource.Internal | |
MonadResource m => MonadResource (StateT s m) | |
Defined in Control.Monad.Trans.Resource.Internal | |
(Monoid w, MonadResource m) => MonadResource (WriterT w m) | |
Defined in Control.Monad.Trans.Resource.Internal | |
(Monoid w, MonadResource m) => MonadResource (WriterT w m) | |
Defined in Control.Monad.Trans.Resource.Internal | |
MonadResource m => MonadResource (ConduitT i o m) | |
Defined in Data.Conduit.Internal.Conduit | |
MonadResource m => MonadResource (ContT r m) | |
Defined in Control.Monad.Trans.Resource.Internal | |
(Monoid w, MonadResource m) => MonadResource (RWST r w s m) | |
Defined in Control.Monad.Trans.Resource.Internal | |
(Monoid w, MonadResource m) => MonadResource (RWST r w s m) | |
Defined in Control.Monad.Trans.Resource.Internal | |
MonadResource m => MonadResource (Pipe l i o u m) | |
Defined in Data.Conduit.Internal.Pipe |
This is a length of time, as measured by a clock.
Conversion functions such as fromInteger
and realToFrac
will treat it as seconds.
For example, (0.010 :: DiffTime)
corresponds to 10 milliseconds.
It has a precision of one picosecond (= 10^-12 s). Enumeration functions will treat it as picoseconds.
Instances
FromJSON DiffTime | This instance includes a bounds check to prevent maliciously
large inputs to fill up the memory of the target system. You can
newtype |
ToJSON DiffTime | |
Data DiffTime | |
Defined in Data.Time.Clock.Internal.DiffTime Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> DiffTime -> c DiffTime # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c DiffTime # toConstr :: DiffTime -> Constr # dataTypeOf :: DiffTime -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c DiffTime) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c DiffTime) # gmapT :: (forall b. Data b => b -> b) -> DiffTime -> DiffTime # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> DiffTime -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> DiffTime -> r # gmapQ :: (forall d. Data d => d -> u) -> DiffTime -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> DiffTime -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> DiffTime -> m DiffTime # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> DiffTime -> m DiffTime # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> DiffTime -> m DiffTime # | |
Enum DiffTime | |
Defined in Data.Time.Clock.Internal.DiffTime | |
Num DiffTime | |
Defined in Data.Time.Clock.Internal.DiffTime | |
Read DiffTime | |
Fractional DiffTime | |
Real DiffTime | |
Defined in Data.Time.Clock.Internal.DiffTime Methods toRational :: DiffTime -> Rational # | |
RealFrac DiffTime | |
Show DiffTime | |
NFData DiffTime | |
Defined in Data.Time.Clock.Internal.DiffTime | |
Eq DiffTime | |
Ord DiffTime | |
Defined in Data.Time.Clock.Internal.DiffTime |
A class of types that can be fully evaluated.
Since: deepseq-1.1.0.0
Minimal complete definition
Nothing
Methods
rnf
should reduce its argument to normal form (that is, fully
evaluate all sub-components), and then return ()
.
Generic
NFData
deriving
Starting with GHC 7.2, you can automatically derive instances
for types possessing a Generic
instance.
Note: Generic1
can be auto-derived starting with GHC 7.4
{-# LANGUAGE DeriveGeneric #-} import GHC.Generics (Generic, Generic1) import Control.DeepSeq data Foo a = Foo a String deriving (Eq, Generic, Generic1) instance NFData a => NFData (Foo a) instance NFData1 Foo data Colour = Red | Green | Blue deriving Generic instance NFData Colour
Starting with GHC 7.10, the example above can be written more
concisely by enabling the new DeriveAnyClass
extension:
{-# LANGUAGE DeriveGeneric, DeriveAnyClass #-} import GHC.Generics (Generic) import Control.DeepSeq data Foo a = Foo a String deriving (Eq, Generic, Generic1, NFData, NFData1) data Colour = Red | Green | Blue deriving (Generic, NFData)
Compatibility with previous deepseq
versions
Prior to version 1.4.0.0, the default implementation of the rnf
method was defined as
rnf
a =seq
a ()
However, starting with deepseq-1.4.0.0
, the default
implementation is based on DefaultSignatures
allowing for
more accurate auto-derived NFData
instances. If you need the
previously used exact default rnf
method implementation
semantics, use
instance NFData Colour where rnf x = seq x ()
or alternatively
instance NFData Colour where rnf = rwhnf
or
{-# LANGUAGE BangPatterns #-} instance NFData Colour where rnf !_ = ()
Instances
NFData Key | |
Defined in Data.Aeson.Key | |
NFData JSONPathElement | |
Defined in Data.Aeson.Types.Internal Methods rnf :: JSONPathElement -> () # | |
NFData Value | |
Defined in Data.Aeson.Types.Internal | |
NFData Base64 Source # | |
Defined in Amazonka.Data.Base64 | |
NFData AccessKey Source # | |
Defined in Amazonka.Types | |
NFData AuthEnv Source # | |
Defined in Amazonka.Types | |
NFData Region Source # | |
Defined in Amazonka.Types | |
NFData Seconds Source # | |
Defined in Amazonka.Types | |
NFData SecretKey Source # | |
Defined in Amazonka.Types | |
NFData SessionToken Source # | |
Defined in Amazonka.Types Methods rnf :: SessionToken -> () # | |
NFData Number | |
Defined in Data.Attoparsec.Number | |
NFData ByteArray | Since: deepseq-1.4.7.0 |
Defined in Control.DeepSeq | |
NFData All | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
NFData Any | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
NFData TypeRep | NOTE: Prior to Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
NFData Unique | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
NFData Version | Since: deepseq-1.3.0.0 |
Defined in Control.DeepSeq | |
NFData CBool | Since: deepseq-1.4.3.0 |
Defined in Control.DeepSeq | |
NFData CChar | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
NFData CClock | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
NFData CDouble | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
NFData CFile | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
NFData CFloat | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
NFData CFpos | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
NFData CInt | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
NFData CIntMax | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
NFData CIntPtr | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
NFData CJmpBuf | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
NFData CLLong | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
NFData CLong | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
NFData CPtrdiff | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
NFData CSChar | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
NFData CSUSeconds | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq Methods rnf :: CSUSeconds -> () # | |
NFData CShort | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
NFData CSigAtomic | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq Methods rnf :: CSigAtomic -> () # | |
NFData CSize | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
NFData CTime | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
NFData CUChar | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
NFData CUInt | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
NFData CUIntMax | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
NFData CUIntPtr | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
NFData CULLong | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
NFData CULong | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
NFData CUSeconds | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
NFData CUShort | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
NFData CWchar | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
NFData Void | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
NFData ThreadId | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
NFData Fingerprint | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq Methods rnf :: Fingerprint -> () # | |
NFData MaskingState | Since: deepseq-1.4.4.0 |
Defined in Control.DeepSeq Methods rnf :: MaskingState -> () # | |
NFData ExitCode | Since: deepseq-1.4.2.0 |
Defined in Control.DeepSeq | |
NFData Int16 | |
Defined in Control.DeepSeq | |
NFData Int32 | |
Defined in Control.DeepSeq | |
NFData Int64 | |
Defined in Control.DeepSeq | |
NFData Int8 | |
Defined in Control.DeepSeq | |
NFData CallStack | Since: deepseq-1.4.2.0 |
Defined in Control.DeepSeq | |
NFData SrcLoc | Since: deepseq-1.4.2.0 |
Defined in Control.DeepSeq | |
NFData Word16 | |
Defined in Control.DeepSeq | |
NFData Word32 | |
Defined in Control.DeepSeq | |
NFData Word64 | |
Defined in Control.DeepSeq | |
NFData Word8 | |
Defined in Control.DeepSeq | |
NFData ByteString | |
Defined in Data.ByteString.Internal.Type Methods rnf :: ByteString -> () # | |
NFData ByteString | |
Defined in Data.ByteString.Lazy.Internal Methods rnf :: ByteString -> () # | |
NFData ShortByteString | |
Defined in Data.ByteString.Short.Internal Methods rnf :: ShortByteString -> () # | |
NFData IntSet | |
Defined in Data.IntSet.Internal | |
NFData AES128 | |
Defined in Crypto.Cipher.AES | |
NFData AES192 | |
Defined in Crypto.Cipher.AES | |
NFData AES256 | |
Defined in Crypto.Cipher.AES | |
NFData Blowfish | |
Defined in Crypto.Cipher.Blowfish | |
NFData Blowfish128 | |
Defined in Crypto.Cipher.Blowfish Methods rnf :: Blowfish128 -> () # | |
NFData Blowfish256 | |
Defined in Crypto.Cipher.Blowfish Methods rnf :: Blowfish256 -> () # | |
NFData Blowfish448 | |
Defined in Crypto.Cipher.Blowfish Methods rnf :: Blowfish448 -> () # | |
NFData Blowfish64 | |
Defined in Crypto.Cipher.Blowfish Methods rnf :: Blowfish64 -> () # | |
NFData State | |
Defined in Crypto.Cipher.ChaCha | |
NFData StateSimple | |
Defined in Crypto.Cipher.ChaCha Methods rnf :: StateSimple -> () # | |
NFData State | |
Defined in Crypto.Cipher.RC4 | |
NFData State | |
Defined in Crypto.Cipher.Salsa | |
NFData SharedSecret | |
Defined in Crypto.ECC Methods rnf :: SharedSecret -> () # | |
NFData Point | |
Defined in Crypto.ECC.Edwards25519 | |
NFData Scalar | |
Defined in Crypto.ECC.Edwards25519 | |
NFData Auth | |
Defined in Crypto.MAC.Poly1305 | |
NFData DhSecret | |
Defined in Crypto.PubKey.Curve25519 | |
NFData PublicKey | |
Defined in Crypto.PubKey.Curve25519 | |
NFData SecretKey | |
Defined in Crypto.PubKey.Curve25519 | |
NFData DhSecret | |
Defined in Crypto.PubKey.Curve448 | |
NFData PublicKey | |
Defined in Crypto.PubKey.Curve448 | |
NFData SecretKey | |
Defined in Crypto.PubKey.Curve448 | |
NFData Params | |
Defined in Crypto.PubKey.DH | |
NFData PrivateNumber | |
Defined in Crypto.PubKey.DH Methods rnf :: PrivateNumber -> () # | |
NFData PublicNumber | |
Defined in Crypto.PubKey.DH Methods rnf :: PublicNumber -> () # | |
NFData SharedKey | |
Defined in Crypto.PubKey.DH | |
NFData KeyPair | |
Defined in Crypto.PubKey.DSA | |
NFData Params | |
Defined in Crypto.PubKey.DSA | |
NFData PrivateKey | |
Defined in Crypto.PubKey.DSA Methods rnf :: PrivateKey -> () # | |
NFData PublicKey | |
Defined in Crypto.PubKey.DSA | |
NFData Signature | |
Defined in Crypto.PubKey.DSA | |
NFData Point | |
Defined in Crypto.PubKey.ECC.P256 | |
NFData Scalar | |
Defined in Crypto.PubKey.ECC.P256 | |
NFData CurveBinary | |
Defined in Crypto.PubKey.ECC.Types Methods rnf :: CurveBinary -> () # | |
NFData Point | |
Defined in Crypto.PubKey.ECC.Types | |
NFData PublicKey | |
Defined in Crypto.PubKey.Ed25519 | |
NFData SecretKey | |
Defined in Crypto.PubKey.Ed25519 | |
NFData Signature | |
Defined in Crypto.PubKey.Ed25519 | |
NFData PublicKey | |
Defined in Crypto.PubKey.Ed448 | |
NFData SecretKey | |
Defined in Crypto.PubKey.Ed448 | |
NFData Signature | |
Defined in Crypto.PubKey.Ed448 | |
NFData KeyPair | |
Defined in Crypto.PubKey.RSA.Types | |
NFData PrivateKey | |
Defined in Crypto.PubKey.RSA.Types Methods rnf :: PrivateKey -> () # | |
NFData PublicKey | |
Defined in Crypto.PubKey.RSA.Types | |
NFData OsChar | |
Defined in System.OsString.Internal.Types.Hidden | |
NFData OsString | |
Defined in System.OsString.Internal.Types.Hidden | |
NFData PosixChar | |
Defined in System.OsString.Internal.Types.Hidden | |
NFData PosixString | |
Defined in System.OsString.Internal.Types.Hidden Methods rnf :: PosixString -> () # | |
NFData WindowsChar | |
Defined in System.OsString.Internal.Types.Hidden Methods rnf :: WindowsChar -> () # | |
NFData WindowsString | |
Defined in System.OsString.Internal.Types.Hidden Methods rnf :: WindowsString -> () # | |
NFData Module | Since: deepseq-1.4.8.0 |
Defined in Control.DeepSeq | |
NFData Ordering | |
Defined in Control.DeepSeq | |
NFData TyCon | NOTE: Prior to Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
NFData Half | |
Defined in Numeric.Half.Internal | |
NFData SockAddr | |
Defined in Network.Socket.Types | |
NFData URI | |
Defined in Network.URI | |
NFData URIAuth | |
Defined in Network.URI | |
NFData OsChar | |
Defined in System.OsString.Internal.Types | |
NFData OsString | |
Defined in System.OsString.Internal.Types | |
NFData PosixChar | |
Defined in System.OsString.Internal.Types | |
NFData PosixString | |
Defined in System.OsString.Internal.Types Methods rnf :: PosixString -> () # | |
NFData WindowsChar | |
Defined in System.OsString.Internal.Types Methods rnf :: WindowsChar -> () # | |
NFData WindowsString | |
Defined in System.OsString.Internal.Types Methods rnf :: WindowsString -> () # | |
NFData TextDetails | |
Defined in Text.PrettyPrint.Annotated.HughesPJ Methods rnf :: TextDetails -> () # | |
NFData Doc | |
Defined in Text.PrettyPrint.HughesPJ | |
NFData StdGen | |
Defined in System.Random.Internal | |
NFData Scientific | |
Defined in Data.Scientific Methods rnf :: Scientific -> () # | |
NFData UnicodeException | |
Defined in Data.Text.Encoding.Error Methods rnf :: UnicodeException -> () # | |
NFData ShortText | |
Defined in Data.Text.Short.Internal | |
NFData Day | |
Defined in Data.Time.Calendar.Days | |
NFData Month | |
Defined in Data.Time.Calendar.Month | |
NFData Quarter | |
Defined in Data.Time.Calendar.Quarter | |
NFData QuarterOfYear | |
Defined in Data.Time.Calendar.Quarter Methods rnf :: QuarterOfYear -> () # | |
NFData DiffTime | |
Defined in Data.Time.Clock.Internal.DiffTime | |
NFData NominalDiffTime | |
Defined in Data.Time.Clock.Internal.NominalDiffTime Methods rnf :: NominalDiffTime -> () # | |
NFData UTCTime | |
Defined in Data.Time.Clock.Internal.UTCTime | |
NFData LocalTime | |
Defined in Data.Time.LocalTime.Internal.LocalTime | |
NFData TimeZone | |
Defined in Data.Time.LocalTime.Internal.TimeZone | |
NFData ZonedTime | |
Defined in Data.Time.LocalTime.Internal.ZonedTime | |
NFData UUID | |
Defined in Data.UUID.Types.Internal | |
NFData Document | |
NFData Element | |
NFData Node | |
NFData Content | |
Defined in Data.XML.Types | |
NFData Doctype | |
Defined in Data.XML.Types | |
NFData Document | |
Defined in Data.XML.Types | |
NFData Element | |
Defined in Data.XML.Types | |
NFData Event | |
Defined in Data.XML.Types | |
NFData ExternalID | |
Defined in Data.XML.Types Methods rnf :: ExternalID -> () # | |
NFData Instruction | |
Defined in Data.XML.Types Methods rnf :: Instruction -> () # | |
NFData Miscellaneous | |
Defined in Data.XML.Types Methods rnf :: Miscellaneous -> () # | |
NFData Name | |
Defined in Data.XML.Types | |
NFData Node | |
Defined in Data.XML.Types | |
NFData Prologue | |
Defined in Data.XML.Types | |
NFData Integer | |
Defined in Control.DeepSeq | |
NFData Natural | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
NFData () | |
Defined in Control.DeepSeq | |
NFData Bool | |
Defined in Control.DeepSeq | |
NFData Char | |
Defined in Control.DeepSeq | |
NFData Double | |
Defined in Control.DeepSeq | |
NFData Float | |
Defined in Control.DeepSeq | |
NFData Int | |
Defined in Control.DeepSeq | |
NFData Word | |
Defined in Control.DeepSeq | |
NFData v => NFData (KeyMap v) | |
Defined in Data.Aeson.KeyMap | |
NFData a => NFData (IResult a) | |
Defined in Data.Aeson.Types.Internal | |
NFData a => NFData (Result a) | |
Defined in Data.Aeson.Types.Internal | |
NFData a => NFData (Sensitive a) Source # | |
Defined in Amazonka.Data.Sensitive | |
NFData (Time a) Source # | |
Defined in Amazonka.Data.Time | |
NFData r => NFData (Result r) | |
Defined in Data.Attoparsec.ByteString.Lazy | |
NFData r => NFData (Result r) | |
Defined in Data.Attoparsec.Text.Lazy | |
NFData a => NFData (ZipList a) | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
NFData (MutableByteArray s) | Since: deepseq-1.4.8.0 |
Defined in Control.DeepSeq Methods rnf :: MutableByteArray s -> () # | |
NFData a => NFData (Complex a) | |
Defined in Control.DeepSeq | |
NFData a => NFData (Identity a) | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
NFData a => NFData (First a) | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
NFData a => NFData (Last a) | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
NFData a => NFData (Down a) | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
NFData a => NFData (First a) | Since: deepseq-1.4.2.0 |
Defined in Control.DeepSeq | |
NFData a => NFData (Last a) | Since: deepseq-1.4.2.0 |
Defined in Control.DeepSeq | |
NFData a => NFData (Max a) | Since: deepseq-1.4.2.0 |
Defined in Control.DeepSeq | |
NFData a => NFData (Min a) | Since: deepseq-1.4.2.0 |
Defined in Control.DeepSeq | |
NFData m => NFData (WrappedMonoid m) | Since: deepseq-1.4.2.0 |
Defined in Control.DeepSeq Methods rnf :: WrappedMonoid m -> () # | |
NFData a => NFData (Dual a) | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
NFData a => NFData (Product a) | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
NFData a => NFData (Sum a) | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
NFData a => NFData (NonEmpty a) | Since: deepseq-1.4.2.0 |
Defined in Control.DeepSeq | |
NFData (IORef a) | NOTE: Only strict in the reference and not the referenced value. Since: deepseq-1.4.2.0 |
Defined in Control.DeepSeq | |
NFData (MVar a) | NOTE: Only strict in the reference and not the referenced value. Since: deepseq-1.4.2.0 |
Defined in Control.DeepSeq | |
NFData (FunPtr a) | Since: deepseq-1.4.2.0 |
Defined in Control.DeepSeq | |
NFData (Ptr a) | Since: deepseq-1.4.2.0 |
Defined in Control.DeepSeq | |
NFData a => NFData (Ratio a) | |
Defined in Control.DeepSeq | |
NFData (StableName a) | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq Methods rnf :: StableName a -> () # | |
NFData s => NFData (CI s) | |
Defined in Data.CaseInsensitive.Internal | |
NFData a => NFData (SCC a) | |
Defined in Data.Graph | |
NFData a => NFData (IntMap a) | |
Defined in Data.IntMap.Internal | |
NFData a => NFData (Digit a) | |
Defined in Data.Sequence.Internal | |
NFData a => NFData (Elem a) | |
Defined in Data.Sequence.Internal | |
NFData a => NFData (FingerTree a) | |
Defined in Data.Sequence.Internal Methods rnf :: FingerTree a -> () # | |
NFData a => NFData (Node a) | |
Defined in Data.Sequence.Internal | |
NFData a => NFData (Seq a) | |
Defined in Data.Sequence.Internal | |
NFData a => NFData (Set a) | |
Defined in Data.Set.Internal | |
NFData a => NFData (Tree a) | |
NFData (Context a) | |
Defined in Crypto.Hash.Types | |
NFData (Digest a) | |
Defined in Crypto.Hash.Types | |
NFData (KMAC a) | |
Defined in Crypto.MAC.KMAC | |
NFData (KeyedBlake2 a) | |
Defined in Crypto.MAC.KeyedBlake2 Methods rnf :: KeyedBlake2 a -> () # | |
NFData (Scalar curve) => NFData (Signature curve) | |
Defined in Crypto.PubKey.ECDSA | |
NFData (SecretKey curve) | |
Defined in Crypto.PubKey.EdDSA | |
NFData1 f => NFData (Fix f) | |
NFData a => NFData (DNonEmpty a) | |
Defined in Data.DList.DNonEmpty.Internal | |
NFData a => NFData (DList a) | |
Defined in Data.DList.Internal | |
NFData a => NFData (Hashed a) | |
Defined in Data.Hashable.Class | |
NFData a => NFData (AnnotDetails a) | |
Defined in Text.PrettyPrint.Annotated.HughesPJ Methods rnf :: AnnotDetails a -> () # | |
NFData a => NFData (Doc a) | |
Defined in Text.PrettyPrint.Annotated.HughesPJ | |
NFData a => NFData (Array a) | |
Defined in Data.Primitive.Array | |
NFData (PrimArray a) | |
Defined in Data.Primitive.PrimArray | |
NFData a => NFData (SmallArray a) | |
Defined in Data.Primitive.SmallArray Methods rnf :: SmallArray a -> () # | |
NFData g => NFData (StateGen g) | |
Defined in System.Random.Internal | |
NFData g => NFData (AtomicGen g) | |
Defined in System.Random.Stateful | |
NFData g => NFData (IOGen g) | |
Defined in System.Random.Stateful | |
NFData g => NFData (STGen g) | |
Defined in System.Random.Stateful | |
NFData g => NFData (TGen g) | |
Defined in System.Random.Stateful | |
NFData a => NFData (Maybe a) | |
Defined in Data.Strict.Maybe | |
NFData a => NFData (Array a) | |
Defined in Data.HashMap.Internal.Array | |
NFData a => NFData (HashSet a) | |
Defined in Data.HashSet.Internal | |
NFData a => NFData (Vector a) | |
Defined in Data.Vector | |
NFData (Vector a) | |
Defined in Data.Vector.Primitive | |
NFData (Vector a) | |
Defined in Data.Vector.Storable | |
NFData a => NFData (Vector a) | |
Defined in Data.Vector.Strict | |
NFData (Vector a) | |
Defined in Data.Vector.Unboxed.Base | |
NFData a => NFData (Maybe a) | |
Defined in Control.DeepSeq | |
NFData a => NFData (Solo a) | Since: deepseq-1.4.6.0 |
Defined in Control.DeepSeq | |
NFData a => NFData [a] | |
Defined in Control.DeepSeq | |
(NFData i, NFData r) => NFData (IResult i r) | |
Defined in Data.Attoparsec.Internal.Types | |
(NFData a, NFData b) => NFData (Either a b) | |
Defined in Control.DeepSeq | |
NFData (Fixed a) | Since: deepseq-1.3.0.0 |
Defined in Control.DeepSeq | |
NFData (Proxy a) | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
(NFData a, NFData b) => NFData (Arg a b) | Since: deepseq-1.4.2.0 |
Defined in Control.DeepSeq | |
NFData (TypeRep a) | Since: deepseq-1.4.8.0 |
Defined in Control.DeepSeq | |
(NFData a, NFData b) => NFData (Array a b) | |
Defined in Control.DeepSeq | |
NFData (STRef s a) | NOTE: Only strict in the reference and not the referenced value. Since: deepseq-1.4.2.0 |
Defined in Control.DeepSeq | |
(NFData k, NFData a) => NFData (Map k a) | |
Defined in Data.Map.Internal | |
NFData (PublicKey curve hash) | |
Defined in Crypto.PubKey.EdDSA | |
NFData (Signature curve hash) | |
Defined in Crypto.PubKey.EdDSA | |
NFData (MutablePrimArray s a) | |
Defined in Data.Primitive.PrimArray Methods rnf :: MutablePrimArray s a -> () # | |
(NFData a, NFData b) => NFData (Either a b) | |
Defined in Data.Strict.Either | |
(NFData a, NFData b) => NFData (These a b) | |
Defined in Data.Strict.These | |
(NFData a, NFData b) => NFData (Pair a b) | |
Defined in Data.Strict.Tuple | |
(NFData a, NFData b) => NFData (These a b) | Since: these-0.7.1 |
Defined in Data.These | |
(NFData k, NFData v) => NFData (HashMap k v) | |
Defined in Data.HashMap.Internal | |
(NFData k, NFData v) => NFData (Leaf k v) | |
Defined in Data.HashMap.Internal | |
NFData (MVector s a) | |
Defined in Data.Vector.Unboxed.Base | |
(NFData a, NFData b) => NFData (a, b) | |
Defined in Control.DeepSeq | |
NFData (a -> b) | This instance is for convenience and consistency with Since: deepseq-1.3.0.0 |
Defined in Control.DeepSeq | |
NFData a => NFData (Const a b) | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
NFData (a :~: b) | Since: deepseq-1.4.3.0 |
Defined in Control.DeepSeq | |
NFData b => NFData (Tagged s b) | |
Defined in Data.Tagged | |
(NFData (f a), NFData (g a), NFData a) => NFData (These1 f g a) | Available always Since: these-1.2 |
Defined in Data.Functor.These | |
(NFData a1, NFData a2, NFData a3) => NFData (a1, a2, a3) | |
Defined in Control.DeepSeq | |
(NFData (f a), NFData (g a)) => NFData (Product f g a) | Note: in Since: deepseq-1.4.3.0 |
Defined in Control.DeepSeq | |
(NFData (f a), NFData (g a)) => NFData (Sum f g a) | Note: in Since: deepseq-1.4.3.0 |
Defined in Control.DeepSeq | |
NFData (a :~~: b) | Since: deepseq-1.4.3.0 |
Defined in Control.DeepSeq | |
(NFData a1, NFData a2, NFData a3, NFData a4) => NFData (a1, a2, a3, a4) | |
Defined in Control.DeepSeq | |
NFData (f (g a)) => NFData (Compose f g a) | Note: in Since: deepseq-1.4.3.0 |
Defined in Control.DeepSeq | |
(NFData a1, NFData a2, NFData a3, NFData a4, NFData a5) => NFData (a1, a2, a3, a4, a5) | |
Defined in Control.DeepSeq | |
(NFData a1, NFData a2, NFData a3, NFData a4, NFData a5, NFData a6) => NFData (a1, a2, a3, a4, a5, a6) | |
Defined in Control.DeepSeq | |
(NFData a1, NFData a2, NFData a3, NFData a4, NFData a5, NFData a6, NFData a7) => NFData (a1, a2, a3, a4, a5, a6, a7) | |
Defined in Control.DeepSeq | |
(NFData a1, NFData a2, NFData a3, NFData a4, NFData a5, NFData a6, NFData a7, NFData a8) => NFData (a1, a2, a3, a4, a5, a6, a7, a8) | |
Defined in Control.DeepSeq | |
(NFData a1, NFData a2, NFData a3, NFData a4, NFData a5, NFData a6, NFData a7, NFData a8, NFData a9) => NFData (a1, a2, a3, a4, a5, a6, a7, a8, a9) | |
Defined in Control.DeepSeq |
The Modified Julian Day is a standard count of days, with zero being the day 1858-11-17.
Instances
FromJSON Day | |
FromJSONKey Day | |
Defined in Data.Aeson.Types.FromJSON Methods | |
ToJSON Day | |
ToJSONKey Day | |
Defined in Data.Aeson.Types.ToJSON | |
Data Day | |
Defined in Data.Time.Calendar.Days Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Day -> c Day # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Day # dataTypeOf :: Day -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Day) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Day) # gmapT :: (forall b. Data b => b -> b) -> Day -> Day # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Day -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Day -> r # gmapQ :: (forall d. Data d => d -> u) -> Day -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Day -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Day -> m Day # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Day -> m Day # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Day -> m Day # | |
Enum Day | |
Ix Day | |
NFData Day | |
Defined in Data.Time.Calendar.Days | |
Eq Day | |
Ord Day | |
DayPeriod Day | |
Defined in Data.Time.Calendar.Days | |
ISO8601 Day |
|
Defined in Data.Time.Format.ISO8601 Methods iso8601Format :: Format Day # |
type Traversal' s a = Traversal s s a a Source #
typeTraversal'
=Simple
Traversal
A set of values. A set cannot contain duplicate values.
Instances
ToJSON1 HashSet | |
Defined in Data.Aeson.Types.ToJSON Methods liftToJSON :: (a -> Bool) -> (a -> Value) -> ([a] -> Value) -> HashSet a -> Value Source # liftToJSONList :: (a -> Bool) -> (a -> Value) -> ([a] -> Value) -> [HashSet a] -> Value Source # liftToEncoding :: (a -> Bool) -> (a -> Encoding) -> ([a] -> Encoding) -> HashSet a -> Encoding Source # liftToEncodingList :: (a -> Bool) -> (a -> Encoding) -> ([a] -> Encoding) -> [HashSet a] -> Encoding Source # | |
Foldable HashSet | |
Defined in Data.HashSet.Internal Methods fold :: Monoid m => HashSet m -> m # foldMap :: Monoid m => (a -> m) -> HashSet a -> m # foldMap' :: Monoid m => (a -> m) -> HashSet a -> m # foldr :: (a -> b -> b) -> b -> HashSet a -> b # foldr' :: (a -> b -> b) -> b -> HashSet a -> b # foldl :: (b -> a -> b) -> b -> HashSet a -> b # foldl' :: (b -> a -> b) -> b -> HashSet a -> b # foldr1 :: (a -> a -> a) -> HashSet a -> a # foldl1 :: (a -> a -> a) -> HashSet a -> a # elem :: Eq a => a -> HashSet a -> Bool # maximum :: Ord a => HashSet a -> a # minimum :: Ord a => HashSet a -> a # | |
Eq1 HashSet | |
Ord1 HashSet | |
Defined in Data.HashSet.Internal | |
Show1 HashSet | |
NFData1 HashSet | Since: unordered-containers-0.2.14.0 |
Defined in Data.HashSet.Internal | |
Hashable1 HashSet | |
Defined in Data.HashSet.Internal | |
Lift a => Lift (HashSet a :: Type) | Since: unordered-containers-0.2.17.0 |
(Eq a, Hashable a, FromJSON a) => FromJSON (HashSet a) | |
ToJSON a => ToJSON (HashSet a) | |
(Data a, Eq a, Hashable a) => Data (HashSet a) | |
Defined in Data.HashSet.Internal Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> HashSet a -> c (HashSet a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (HashSet a) # toConstr :: HashSet a -> Constr # dataTypeOf :: HashSet a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (HashSet a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (HashSet a)) # gmapT :: (forall b. Data b => b -> b) -> HashSet a -> HashSet a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> HashSet a -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> HashSet a -> r # gmapQ :: (forall d. Data d => d -> u) -> HashSet a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> HashSet a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> HashSet a -> m (HashSet a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> HashSet a -> m (HashSet a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> HashSet a -> m (HashSet a) # | |
(Hashable a, Eq a) => Monoid (HashSet a) | \(O(n+m)\) To obtain good performance, the smaller set must be presented as the first argument. Examples
|
(Hashable a, Eq a) => Semigroup (HashSet a) | \(O(n+m)\) To obtain good performance, the smaller set must be presented as the first argument. Examples
|
(Eq a, Hashable a) => IsList (HashSet a) | |
(Eq a, Hashable a, Read a) => Read (HashSet a) | |
Show a => Show (HashSet a) | |
NFData a => NFData (HashSet a) | |
Defined in Data.HashSet.Internal | |
Eq a => Eq (HashSet a) | Note that, in the presence of hash collisions, equal
In general, the lack of extensionality can be observed with any function that depends on the key ordering, such as folds and traversals. |
Ord a => Ord (HashSet a) | |
Hashable a => Hashable (HashSet a) | |
(Eq k, Hashable k) => At (HashSet k) | |
(Eq a, Hashable a) => Contains (HashSet a) | |
(Eq k, Hashable k) => Ixed (HashSet k) | |
Defined in Control.Lens.At | |
AsEmpty (HashSet a) | |
(Hashable a, Eq a) => Wrapped (HashSet a) | |
(Eq v, Hashable v) => GrowingAppend (HashSet v) | |
Defined in Data.MonoTraversable | |
MonoFoldable (HashSet e) | |
Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element (HashSet e) -> m) -> HashSet e -> m Source # ofoldr :: (Element (HashSet e) -> b -> b) -> b -> HashSet e -> b Source # ofoldl' :: (a -> Element (HashSet e) -> a) -> a -> HashSet e -> a Source # otoList :: HashSet e -> [Element (HashSet e)] Source # oall :: (Element (HashSet e) -> Bool) -> HashSet e -> Bool Source # oany :: (Element (HashSet e) -> Bool) -> HashSet e -> Bool Source # onull :: HashSet e -> Bool Source # olength :: HashSet e -> Int Source # olength64 :: HashSet e -> Int64 Source # ocompareLength :: Integral i => HashSet e -> i -> Ordering Source # otraverse_ :: Applicative f => (Element (HashSet e) -> f b) -> HashSet e -> f () Source # ofor_ :: Applicative f => HashSet e -> (Element (HashSet e) -> f b) -> f () Source # omapM_ :: Applicative m => (Element (HashSet e) -> m ()) -> HashSet e -> m () Source # oforM_ :: Applicative m => HashSet e -> (Element (HashSet e) -> m ()) -> m () Source # ofoldlM :: Monad m => (a -> Element (HashSet e) -> m a) -> a -> HashSet e -> m a Source # ofoldMap1Ex :: Semigroup m => (Element (HashSet e) -> m) -> HashSet e -> m Source # ofoldr1Ex :: (Element (HashSet e) -> Element (HashSet e) -> Element (HashSet e)) -> HashSet e -> Element (HashSet e) Source # ofoldl1Ex' :: (Element (HashSet e) -> Element (HashSet e) -> Element (HashSet e)) -> HashSet e -> Element (HashSet e) Source # headEx :: HashSet e -> Element (HashSet e) Source # lastEx :: HashSet e -> Element (HashSet e) Source # unsafeHead :: HashSet e -> Element (HashSet e) Source # unsafeLast :: HashSet e -> Element (HashSet e) Source # maximumByEx :: (Element (HashSet e) -> Element (HashSet e) -> Ordering) -> HashSet e -> Element (HashSet e) Source # minimumByEx :: (Element (HashSet e) -> Element (HashSet e) -> Ordering) -> HashSet e -> Element (HashSet e) Source # oelem :: Element (HashSet e) -> HashSet e -> Bool Source # onotElem :: Element (HashSet e) -> HashSet e -> Bool Source # | |
Hashable a => MonoPointed (HashSet a) | |
(t ~ HashSet a', Hashable a, Eq a) => Rewrapped (HashSet a) t | Use |
Defined in Control.Lens.Wrapped | |
type Item (HashSet a) | |
Defined in Data.HashSet.Internal | |
type Index (HashSet a) | |
Defined in Control.Lens.At | |
type IxValue (HashSet k) | |
Defined in Control.Lens.At | |
type Unwrapped (HashSet a) | |
Defined in Control.Lens.Wrapped | |
type Element (HashSet e) | |
Defined in Data.MonoTraversable |
data NominalDiffTime #
This is a length of time, as measured by UTC. It has a precision of 10^-12 s.
Conversion functions such as fromInteger
and realToFrac
will treat it as seconds.
For example, (0.010 :: NominalDiffTime)
corresponds to 10 milliseconds.
It has a precision of one picosecond (= 10^-12 s). Enumeration functions will treat it as picoseconds.
It ignores leap-seconds, so it's not necessarily a fixed amount of clock time. For instance, 23:00 UTC + 2 hours of NominalDiffTime = 01:00 UTC (+ 1 day), regardless of whether a leap-second intervened.
Instances
FromJSON NominalDiffTime | This instance includes a bounds check to prevent maliciously
large inputs to fill up the memory of the target system. You can
newtype |
Defined in Data.Aeson.Types.FromJSON Methods parseJSON :: Value -> Parser NominalDiffTime Source # parseJSONList :: Value -> Parser [NominalDiffTime] Source # | |
ToJSON NominalDiffTime | |
Defined in Data.Aeson.Types.ToJSON Methods toJSON :: NominalDiffTime -> Value Source # toEncoding :: NominalDiffTime -> Encoding Source # toJSONList :: [NominalDiffTime] -> Value Source # toEncodingList :: [NominalDiffTime] -> Encoding Source # omitField :: NominalDiffTime -> Bool Source # | |
Data NominalDiffTime | |
Defined in Data.Time.Clock.Internal.NominalDiffTime Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> NominalDiffTime -> c NominalDiffTime # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c NominalDiffTime # toConstr :: NominalDiffTime -> Constr # dataTypeOf :: NominalDiffTime -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c NominalDiffTime) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c NominalDiffTime) # gmapT :: (forall b. Data b => b -> b) -> NominalDiffTime -> NominalDiffTime # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> NominalDiffTime -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> NominalDiffTime -> r # gmapQ :: (forall d. Data d => d -> u) -> NominalDiffTime -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> NominalDiffTime -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> NominalDiffTime -> m NominalDiffTime # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> NominalDiffTime -> m NominalDiffTime # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> NominalDiffTime -> m NominalDiffTime # | |
Enum NominalDiffTime | |
Defined in Data.Time.Clock.Internal.NominalDiffTime Methods succ :: NominalDiffTime -> NominalDiffTime # pred :: NominalDiffTime -> NominalDiffTime # toEnum :: Int -> NominalDiffTime # fromEnum :: NominalDiffTime -> Int # enumFrom :: NominalDiffTime -> [NominalDiffTime] # enumFromThen :: NominalDiffTime -> NominalDiffTime -> [NominalDiffTime] # enumFromTo :: NominalDiffTime -> NominalDiffTime -> [NominalDiffTime] # enumFromThenTo :: NominalDiffTime -> NominalDiffTime -> NominalDiffTime -> [NominalDiffTime] # | |
Num NominalDiffTime | |
Defined in Data.Time.Clock.Internal.NominalDiffTime Methods (+) :: NominalDiffTime -> NominalDiffTime -> NominalDiffTime # (-) :: NominalDiffTime -> NominalDiffTime -> NominalDiffTime # (*) :: NominalDiffTime -> NominalDiffTime -> NominalDiffTime # negate :: NominalDiffTime -> NominalDiffTime # abs :: NominalDiffTime -> NominalDiffTime # signum :: NominalDiffTime -> NominalDiffTime # fromInteger :: Integer -> NominalDiffTime # | |
Read NominalDiffTime | |
Defined in Data.Time.Clock.Internal.NominalDiffTime Methods readsPrec :: Int -> ReadS NominalDiffTime # readList :: ReadS [NominalDiffTime] # | |
Fractional NominalDiffTime | |
Defined in Data.Time.Clock.Internal.NominalDiffTime Methods (/) :: NominalDiffTime -> NominalDiffTime -> NominalDiffTime # recip :: NominalDiffTime -> NominalDiffTime # fromRational :: Rational -> NominalDiffTime # | |
Real NominalDiffTime | |
Defined in Data.Time.Clock.Internal.NominalDiffTime Methods toRational :: NominalDiffTime -> Rational # | |
RealFrac NominalDiffTime | |
Defined in Data.Time.Clock.Internal.NominalDiffTime Methods properFraction :: Integral b => NominalDiffTime -> (b, NominalDiffTime) # truncate :: Integral b => NominalDiffTime -> b # round :: Integral b => NominalDiffTime -> b # ceiling :: Integral b => NominalDiffTime -> b # floor :: Integral b => NominalDiffTime -> b # | |
Show NominalDiffTime | |
Defined in Data.Time.Clock.Internal.NominalDiffTime Methods showsPrec :: Int -> NominalDiffTime -> ShowS # show :: NominalDiffTime -> String # showList :: [NominalDiffTime] -> ShowS # | |
NFData NominalDiffTime | |
Defined in Data.Time.Clock.Internal.NominalDiffTime Methods rnf :: NominalDiffTime -> () # | |
Eq NominalDiffTime | |
Defined in Data.Time.Clock.Internal.NominalDiffTime Methods (==) :: NominalDiffTime -> NominalDiffTime -> Bool # (/=) :: NominalDiffTime -> NominalDiffTime -> Bool # | |
Ord NominalDiffTime | |
Defined in Data.Time.Clock.Internal.NominalDiffTime Methods compare :: NominalDiffTime -> NominalDiffTime -> Ordering # (<) :: NominalDiffTime -> NominalDiffTime -> Bool # (<=) :: NominalDiffTime -> NominalDiffTime -> Bool # (>) :: NominalDiffTime -> NominalDiffTime -> Bool # (>=) :: NominalDiffTime -> NominalDiffTime -> Bool # max :: NominalDiffTime -> NominalDiffTime -> NominalDiffTime # min :: NominalDiffTime -> NominalDiffTime -> NominalDiffTime # |
type TextBuilder = Builder Source #
type ByteStringLazy = ByteString Source #
type ByteStringBuilder = Builder Source #