ouroboros-consensus-0.26.0.0: Consensus layer for the Ouroboros blockchain protocol
Safe HaskellNone
LanguageHaskell2010

Ouroboros.Consensus.Util.DepPair

Synopsis

Dependent pairs

type DepPair = GenDepPair I Source #

Dependent pair

A dependent pair is a pair of values where the type of the value depends on the first value.

data GenDepPair (g ∷ k → Type) (f ∷ k → Type) where Source #

Generalization of DepPair

This adds an additional functor g around the second value in the pair.

Constructors

GenDepPair ∷ ∀ {k} (f ∷ k → Type) (a ∷ k) (g ∷ k → Type). !(f a) → !(g a) → GenDepPair g f 

Bundled Patterns

pattern DepPair ∷ () ⇒ f a → a → DepPair f 

Instances

Instances details
(DecodeDiskDepIx f blk, DecodeDiskDep f blk) ⇒ DecodeDisk blk (DepPair (f blk)) Source # 
Instance details

Defined in Ouroboros.Consensus.Storage.Serialisation

Methods

decodeDiskCodecConfig blk → ∀ s. Decoder s (DepPair (f blk)) Source #

(EncodeDiskDepIx f blk, EncodeDiskDep f blk) ⇒ EncodeDisk blk (DepPair (f blk)) Source # 
Instance details

Defined in Ouroboros.Consensus.Storage.Serialisation

Methods

encodeDiskCodecConfig blk → DepPair (f blk) → Encoding Source #

DecodeDiskDepIx f blk ⇒ DecodeDisk blk (GenDepPair (SerialisedTypeType) (f blk)) Source # 
Instance details

Defined in Ouroboros.Consensus.Storage.Serialisation

Methods

decodeDiskCodecConfig blk → ∀ s. Decoder s (GenDepPair (SerialisedTypeType) (f blk)) Source #

EncodeDiskDepIx f blk ⇒ EncodeDisk blk (GenDepPair (SerialisedTypeType) (f blk)) Source # 
Instance details

Defined in Ouroboros.Consensus.Storage.Serialisation

Methods

encodeDiskCodecConfig blk → GenDepPair (SerialisedTypeType) (f blk) → Encoding Source #

(HasNestedContent f blk, ∀ a. Show (g a)) ⇒ Show (GenDepPair g (NestedCtxt f blk)) Source # 
Instance details

Defined in Ouroboros.Consensus.Block.NestedContent

Methods

showsPrecIntGenDepPair g (NestedCtxt f blk) → ShowS #

showGenDepPair g (NestedCtxt f blk) → String #

showList ∷ [GenDepPair g (NestedCtxt f blk)] → ShowS #

depPairFirst ∷ ∀ {k} f f' (g ∷ k → Type). (∀ (a ∷ k). f a → f' a) → GenDepPair g f → GenDepPair g f' Source #

Compare indices

class SameDepIndex (f ∷ k → Type) where Source #

Minimal complete definition

Nothing

Methods

sameDepIndex ∷ ∀ (a ∷ k) (b ∷ k). f a → f b → Maybe (a :~: b) Source #

default sameDepIndex ∷ ∀ (a ∷ k) (b ∷ k). TrivialDependency f ⇒ f a → f b → Maybe (a :~: b) Source #

Instances

Instances details
SameDepIndex QueryAnytime Source # 
Instance details

Defined in Ouroboros.Consensus.HardFork.Combinator.Ledger.Query

Methods

sameDepIndexQueryAnytime a → QueryAnytime b → Maybe (a :~: b) Source #

SameDepIndex (QueryHardFork xs ∷ TypeType) Source # 
Instance details

Defined in Ouroboros.Consensus.HardFork.Combinator.Ledger.Query

Methods

sameDepIndexQueryHardFork xs a → QueryHardFork xs b → Maybe (a :~: b) Source #

SameDepIndex2 (BlockQuery blk) ⇒ SameDepIndex (Query blk ∷ TypeType) Source # 
Instance details

Defined in Ouroboros.Consensus.Ledger.Query

Methods

sameDepIndexQuery blk a → Query blk b → Maybe (a :~: b) Source #

SameDepIndex (NestedCtxt_ blk f) ⇒ SameDepIndex (NestedCtxt f blk ∷ TypeType) Source # 
Instance details

Defined in Ouroboros.Consensus.Block.NestedContent

Methods

sameDepIndexNestedCtxt f blk a → NestedCtxt f blk b → Maybe (a :~: b) Source #

CanHardFork xs ⇒ SameDepIndex (NestedCtxt_ (HardForkBlock xs) HeaderTypeType) Source # 
Instance details

Defined in Ouroboros.Consensus.HardFork.Combinator.Block

SameDepIndex (NestedCtxt_ m f) ⇒ SameDepIndex (NestedCtxt_ (DualBlock m a) f ∷ TypeType) Source # 
Instance details

Defined in Ouroboros.Consensus.Ledger.Dual

Methods

sameDepIndexNestedCtxt_ (DualBlock m a) f a0 → NestedCtxt_ (DualBlock m a) f b → Maybe (a0 :~: b) Source #

class SameDepIndex2 (f ∷ k1 → k2 → Type) where Source #

Methods

sameDepIndex2 ∷ ∀ (x ∷ k1) (a ∷ k2) (y ∷ k1) (b ∷ k2). f x a → f y b → Maybe ('(x, a) :~: '(y, b)) Source #

Instances

Instances details
All SingleEraBlock xs ⇒ SameDepIndex2 (QueryIfCurrent xs ∷ QueryFootprintTypeType) Source # 
Instance details

Defined in Ouroboros.Consensus.HardFork.Combinator.Ledger.Query

Methods

sameDepIndex2 ∷ ∀ (x ∷ QueryFootprint) a (y ∷ QueryFootprint) b. QueryIfCurrent xs x a → QueryIfCurrent xs y b → Maybe ('(x, a) :~: '(y, b)) Source #

All SingleEraBlock xs ⇒ SameDepIndex2 (BlockQuery (HardForkBlock xs) ∷ QueryFootprintTypeType) Source # 
Instance details

Defined in Ouroboros.Consensus.HardFork.Combinator.Ledger.Query

Methods

sameDepIndex2 ∷ ∀ (x ∷ QueryFootprint) a (y ∷ QueryFootprint) b. BlockQuery (HardForkBlock xs) x a → BlockQuery (HardForkBlock xs) y b → Maybe ('(x, a) :~: '(y, b)) Source #

SameDepIndex2 (BlockQuery (DualBlock m a) ∷ QueryFootprintTypeType) Source # 
Instance details

Defined in Ouroboros.Consensus.Ledger.Dual

Methods

sameDepIndex2 ∷ ∀ (x ∷ QueryFootprint) a0 (y ∷ QueryFootprint) b. BlockQuery (DualBlock m a) x a0 → BlockQuery (DualBlock m a) y b → Maybe ('(x, a0) :~: '(y, b)) Source #

Trivial dependency

class TrivialDependency (f ∷ k → Type) where Source #

A dependency is trivial if it always maps to the same type b

Associated Types

type TrivialIndex (f ∷ k → Type) ∷ k1 Source #

Methods

hasSingleIndex ∷ ∀ (a ∷ k) (b ∷ k). f a → f b → a :~: b Source #

indexIsTrivial ∷ f (TrivialIndex f ∷ k) Source #

Instances

Instances details
TrivialDependency (NestedCtxt_ blk f) ⇒ TrivialDependency (NestedCtxt f blk ∷ TypeType) Source # 
Instance details

Defined in Ouroboros.Consensus.Block.NestedContent

Methods

hasSingleIndexNestedCtxt f blk a → NestedCtxt f blk b → a :~: b Source #

indexIsTrivialNestedCtxt f blk (TrivialIndex (NestedCtxt f blk) ∷ Type) Source #

Convenience re-exports

data Proxy (t ∷ k) #

Proxy is a type that holds no data, but has a phantom parameter of arbitrary type (or even kind). Its use is to provide type information, even though there is no value available of that type (or it may be too costly to create one).

Historically, Proxy :: Proxy a is a safer alternative to the undefined :: a idiom.

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

Proxy can even hold types of higher kinds,

>>> Proxy :: Proxy Either
Proxy
>>> Proxy :: Proxy Functor
Proxy
>>> Proxy :: Proxy complicatedStructure
Proxy

Constructors

Proxy 

Instances

Instances details
ApplicativeB (Proxy ∷ (k → Type) → Type) 
Instance details

Defined in Barbies.Internal.ApplicativeB

Methods

bpure ∷ (∀ (a ∷ k). f a) → Proxy f Source #

bprod ∷ ∀ (f ∷ k → Type) (g ∷ k → Type). Proxy f → Proxy g → Proxy (Product f g) Source #

ConstraintsB (Proxy ∷ (k → Type) → Type) 
Instance details

Defined in Barbies.Internal.ConstraintsB

Methods

baddDicts ∷ ∀ (c ∷ k → Constraint) (f ∷ k → Type). AllB c (Proxy ∷ (k → Type) → Type) ⇒ Proxy f → Proxy (Product (Dict c) f) Source #

DistributiveB (Proxy ∷ (k → Type) → Type) 
Instance details

Defined in Barbies.Internal.DistributiveB

Methods

bdistribute ∷ ∀ f (g ∷ k → Type). Functor f ⇒ f (Proxy g) → Proxy (Compose f g) Source #

FunctorB (Proxy ∷ (k → Type) → Type) 
Instance details

Defined in Barbies.Internal.FunctorB

Methods

bmap ∷ (∀ (a ∷ k). f a → g a) → Proxy f → Proxy g Source #

TraversableB (Proxy ∷ (k → Type) → Type) 
Instance details

Defined in Barbies.Internal.TraversableB

Methods

btraverseApplicative e ⇒ (∀ (a ∷ k). f a → e (g a)) → Proxy f → e (Proxy g) Source #

Generic1 (Proxy ∷ k → Type) 
Instance details

Defined in GHC.Internal.Generics

Associated Types

type Rep1 (Proxy ∷ k → Type)

@since base-4.6.0.0

Instance details

Defined in GHC.Internal.Generics

type Rep1 (Proxy ∷ k → Type) = D1 ('MetaData "Proxy" "GHC.Internal.Data.Proxy" "ghc-internal" 'False) (C1 ('MetaCons "Proxy" 'PrefixI 'False) (U1 ∷ k → Type))

Methods

from1 ∷ ∀ (a ∷ k). Proxy a → Rep1 (Proxy ∷ k → Type) a #

to1 ∷ ∀ (a ∷ k). Rep1 (Proxy ∷ k → Type) a → Proxy a #

RepeatWithIndex Void (ProxyTypeType) 
Instance details

Defined in Data.Semialign.Internal

Methods

irepeat ∷ (Void → a) → Proxy a Source #

SemialignWithIndex Void (ProxyTypeType) 
Instance details

Defined in Data.Semialign.Internal

Methods

ialignWith ∷ (VoidThese a b → c) → Proxy a → Proxy b → Proxy c Source #

ZipWithIndex Void (ProxyTypeType) 
Instance details

Defined in Data.Semialign.Internal

Methods

izipWith ∷ (Void → a → b → c) → Proxy a → Proxy b → Proxy c Source #

Representable (ProxyTypeType) 
Instance details

Defined in Data.Functor.Rep

Associated Types

type Rep (ProxyTypeType) 
Instance details

Defined in Data.Functor.Rep

type Rep (ProxyTypeType) = Void

Methods

tabulate ∷ (Rep (ProxyTypeType) → a) → Proxy a Source #

indexProxy a → Rep (ProxyTypeType) → a Source #

FromJSON1 (ProxyTypeType) 
Instance details

Defined in Data.Aeson.Types.FromJSON

Methods

liftParseJSONMaybe a → (ValueParser a) → (ValueParser [a]) → ValueParser (Proxy a) Source #

liftParseJSONListMaybe a → (ValueParser a) → (ValueParser [a]) → ValueParser [Proxy a] Source #

liftOmittedFieldMaybe a → Maybe (Proxy a) Source #

ToJSON1 (ProxyTypeType) 
Instance details

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 #

liftOmitField ∷ (a → Bool) → Proxy a → Bool Source #

MonadZip (ProxyTypeType)

Since: base-4.9.0.0

Instance details

Defined in Control.Monad.Zip

Methods

mzipProxy a → Proxy b → Proxy (a, b) #

mzipWith ∷ (a → b → c) → Proxy a → Proxy b → Proxy c #

munzipProxy (a, b) → (Proxy a, Proxy b) #

Eq1 (ProxyTypeType)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Classes

Methods

liftEq ∷ (a → b → Bool) → Proxy a → Proxy b → Bool #

Ord1 (ProxyTypeType)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Classes

Methods

liftCompare ∷ (a → b → Ordering) → Proxy a → Proxy b → Ordering #

Read1 (ProxyTypeType)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Classes

Methods

liftReadsPrec ∷ (IntReadS a) → ReadS [a] → IntReadS (Proxy a) #

liftReadList ∷ (IntReadS a) → ReadS [a] → ReadS [Proxy a] #

liftReadPrecReadPrec a → ReadPrec [a] → ReadPrec (Proxy a) #

liftReadListPrecReadPrec a → ReadPrec [a] → ReadPrec [Proxy a] #

Show1 (ProxyTypeType)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Classes

Methods

liftShowsPrec ∷ (Int → a → ShowS) → ([a] → ShowS) → IntProxy a → ShowS #

liftShowList ∷ (Int → a → ShowS) → ([a] → ShowS) → [Proxy a] → ShowS #

Contravariant (ProxyTypeType) 
Instance details

Defined in Data.Functor.Contravariant

Methods

contramap ∷ (a' → a) → Proxy a → Proxy a' #

(>$) ∷ b → Proxy b → Proxy a #

NFData1 (ProxyTypeType)

Since: deepseq-1.4.3.0

Instance details

Defined in Control.DeepSeq

Methods

liftRnf ∷ (a → ()) → Proxy a → () #

Alternative (ProxyTypeType)

@since base-4.9.0.0

Instance details

Defined in GHC.Internal.Data.Proxy

Methods

emptyProxy a #

(<|>)Proxy a → Proxy a → Proxy a #

someProxy a → Proxy [a] #

manyProxy a → Proxy [a] #

Applicative (ProxyTypeType)

@since base-4.7.0.0

Instance details

Defined in GHC.Internal.Data.Proxy

Methods

pure ∷ a → Proxy a #

(<*>)Proxy (a → b) → Proxy a → Proxy b #

liftA2 ∷ (a → b → c) → Proxy a → Proxy b → Proxy c #

(*>)Proxy a → Proxy b → Proxy b #

(<*)Proxy a → Proxy b → Proxy a #

Functor (ProxyTypeType)

@since base-4.7.0.0

Instance details

Defined in GHC.Internal.Data.Proxy

Methods

fmap ∷ (a → b) → Proxy a → Proxy b #

(<$) ∷ a → Proxy b → Proxy a #

Monad (ProxyTypeType)

@since base-4.7.0.0

Instance details

Defined in GHC.Internal.Data.Proxy

Methods

(>>=)Proxy a → (a → Proxy b) → Proxy b #

(>>)Proxy a → Proxy b → Proxy b #

return ∷ a → Proxy a #

MonadPlus (ProxyTypeType)

@since base-4.9.0.0

Instance details

Defined in GHC.Internal.Data.Proxy

Methods

mzeroProxy a #

mplusProxy a → Proxy a → Proxy a #

Foldable (ProxyTypeType)

@since base-4.7.0.0

Instance details

Defined in GHC.Internal.Data.Foldable

Methods

foldMonoid m ⇒ Proxy m → m #

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

toListProxy a → [a] #

nullProxy a → Bool #

lengthProxy a → Int #

elemEq a ⇒ a → Proxy a → Bool #

maximumOrd a ⇒ Proxy a → a #

minimumOrd a ⇒ Proxy a → a #

sumNum a ⇒ Proxy a → a #

productNum a ⇒ Proxy a → a #

Traversable (ProxyTypeType)

@since base-4.7.0.0

Instance details

Defined in GHC.Internal.Data.Traversable

Methods

traverseApplicative f ⇒ (a → f b) → Proxy a → f (Proxy b) #

sequenceAApplicative f ⇒ Proxy (f a) → f (Proxy a) #

mapMMonad m ⇒ (a → m b) → Proxy a → m (Proxy b) #

sequenceMonad m ⇒ Proxy (m a) → m (Proxy a) #

Hashable1 (ProxyTypeType) 
Instance details

Defined in Data.Hashable.Class

Methods

liftHashWithSalt ∷ (Int → a → Int) → IntProxy a → Int Source #

Align (ProxyTypeType) 
Instance details

Defined in Data.Semialign.Internal

Methods

nilProxy a Source #

Repeat (ProxyTypeType) 
Instance details

Defined in Data.Semialign.Internal

Methods

repeat ∷ a → Proxy a Source #

Semialign (ProxyTypeType) 
Instance details

Defined in Data.Semialign.Internal

Methods

alignProxy a → Proxy b → Proxy (These a b) Source #

alignWith ∷ (These a b → c) → Proxy a → Proxy b → Proxy c Source #

Unalign (ProxyTypeType) 
Instance details

Defined in Data.Semialign.Internal

Methods

unalignProxy (These a b) → (Proxy a, Proxy b) Source #

unalignWith ∷ (c → These a b) → Proxy c → (Proxy a, Proxy b) Source #

Unzip (ProxyTypeType) 
Instance details

Defined in Data.Semialign.Internal

Methods

unzipWith ∷ (c → (a, b)) → Proxy c → (Proxy a, Proxy b) Source #

unzipProxy (a, b) → (Proxy a, Proxy b) Source #

Zip (ProxyTypeType) 
Instance details

Defined in Data.Semialign.Internal

Methods

zipProxy a → Proxy b → Proxy (a, b) Source #

zipWith ∷ (a → b → c) → Proxy a → Proxy b → Proxy c Source #

FromJSON (Proxy a) 
Instance details

Defined in Data.Aeson.Types.FromJSON

ToJSON (Proxy a) 
Instance details

Defined in Data.Aeson.Types.ToJSON

NFData (Proxy a)

Since: deepseq-1.4.0.0

Instance details

Defined in Control.DeepSeq

Methods

rnfProxy a → () #

Monoid (Proxy s)

@since base-4.7.0.0

Instance details

Defined in GHC.Internal.Data.Proxy

Methods

memptyProxy s #

mappendProxy s → Proxy s → Proxy s #

mconcat ∷ [Proxy s] → Proxy s #

Semigroup (Proxy s)

@since base-4.9.0.0

Instance details

Defined in GHC.Internal.Data.Proxy

Methods

(<>)Proxy s → Proxy s → Proxy s #

sconcatNonEmpty (Proxy s) → Proxy s #

stimesIntegral b ⇒ b → Proxy s → Proxy s #

Bounded (Proxy t)

@since base-4.7.0.0

Instance details

Defined in GHC.Internal.Data.Proxy

Methods

minBoundProxy t #

maxBoundProxy t #

Enum (Proxy s)

@since base-4.7.0.0

Instance details

Defined in GHC.Internal.Data.Proxy

Methods

succProxy s → Proxy s #

predProxy s → Proxy s #

toEnumIntProxy s #

fromEnumProxy s → Int #

enumFromProxy s → [Proxy s] #

enumFromThenProxy s → Proxy s → [Proxy s] #

enumFromToProxy s → Proxy s → [Proxy s] #

enumFromThenToProxy s → Proxy s → Proxy s → [Proxy s] #

Generic (Proxy t) 
Instance details

Defined in GHC.Internal.Generics

Associated Types

type Rep (Proxy t)

@since base-4.6.0.0

Instance details

Defined in GHC.Internal.Generics

type Rep (Proxy t) = D1 ('MetaData "Proxy" "GHC.Internal.Data.Proxy" "ghc-internal" 'False) (C1 ('MetaCons "Proxy" 'PrefixI 'False) (U1TypeType))

Methods

fromProxy t → Rep (Proxy t) x #

toRep (Proxy t) x → Proxy t #

Ix (Proxy s)

@since base-4.7.0.0

Instance details

Defined in GHC.Internal.Data.Proxy

Methods

range ∷ (Proxy s, Proxy s) → [Proxy s] #

index ∷ (Proxy s, Proxy s) → Proxy s → Int #

unsafeIndex ∷ (Proxy s, Proxy s) → Proxy s → Int #

inRange ∷ (Proxy s, Proxy s) → Proxy s → Bool #

rangeSize ∷ (Proxy s, Proxy s) → Int #

unsafeRangeSize ∷ (Proxy s, Proxy s) → Int #

Read (Proxy t)

@since base-4.7.0.0

Instance details

Defined in GHC.Internal.Data.Proxy

Show (Proxy s)

@since base-4.7.0.0

Instance details

Defined in GHC.Internal.Data.Proxy

Methods

showsPrecIntProxy s → ShowS #

showProxy s → String #

showList ∷ [Proxy s] → ShowS #

Eq (Proxy s)

@since base-4.7.0.0

Instance details

Defined in GHC.Internal.Data.Proxy

Methods

(==)Proxy s → Proxy s → Bool #

(/=)Proxy s → Proxy s → Bool #

Ord (Proxy s)

@since base-4.7.0.0

Instance details

Defined in GHC.Internal.Data.Proxy

Methods

compareProxy s → Proxy s → Ordering #

(<)Proxy s → Proxy s → Bool #

(<=)Proxy s → Proxy s → Bool #

(>)Proxy s → Proxy s → Bool #

(>=)Proxy s → Proxy s → Bool #

maxProxy s → Proxy s → Proxy s #

minProxy s → Proxy s → Proxy s #

Hashable (Proxy a) 
Instance details

Defined in Data.Hashable.Class

Methods

hashWithSaltIntProxy a → Int Source #

hashProxy a → Int Source #

MonoFoldable (Proxy a)

Since: mono-traversable-1.0.11.0

Instance details

Defined in Data.MonoTraversable

Methods

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

otoListProxy a → [Element (Proxy a)] Source #

oall ∷ (Element (Proxy a) → Bool) → Proxy a → Bool Source #

oany ∷ (Element (Proxy a) → Bool) → Proxy a → Bool Source #

onullProxy a → Bool Source #

olengthProxy a → Int Source #

olength64Proxy a → Int64 Source #

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

ofoldlMMonad m ⇒ (a0 → Element (Proxy a) → m a0) → a0 → Proxy a → m a0 Source #

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

headExProxy a → Element (Proxy a) Source #

lastExProxy a → Element (Proxy a) Source #

unsafeHeadProxy a → Element (Proxy a) Source #

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

oelemElement (Proxy a) → Proxy a → Bool Source #

onotElemElement (Proxy a) → Proxy a → Bool Source #

MonoFunctor (Proxy a)

Since: mono-traversable-1.0.11.0

Instance details

Defined in Data.MonoTraversable

Methods

omap ∷ (Element (Proxy a) → Element (Proxy a)) → Proxy a → Proxy a Source #

MonoPointed (Proxy a)

Since: mono-traversable-1.0.11.0

Instance details

Defined in Data.MonoTraversable

Methods

opointElement (Proxy a) → Proxy a Source #

MonoTraversable (Proxy a)

Since: mono-traversable-1.0.11.0

Instance details

Defined in Data.MonoTraversable

Methods

otraverseApplicative f ⇒ (Element (Proxy a) → f (Element (Proxy a))) → Proxy a → f (Proxy a) Source #

omapMApplicative m ⇒ (Element (Proxy a) → m (Element (Proxy a))) → Proxy a → m (Proxy a) Source #

MonoidNull (Proxy a)

Since: monoid-subclasses-1.2.5.0

Instance details

Defined in Data.Monoid.Null

Methods

nullProxy a → Bool Source #

PositiveMonoid (Proxy a)

Since: monoid-subclasses-1.2.5.0

Instance details

Defined in Data.Monoid.Null

Serialise (Proxy a)

Since: serialise-0.2.0.0

Instance details

Defined in Codec.Serialise.Class

type AllB (c ∷ k → Constraint) (Proxy ∷ (k → Type) → Type) 
Instance details

Defined in Barbies.Internal.ConstraintsB

type AllB (c ∷ k → Constraint) (Proxy ∷ (k → Type) → Type) = ()
type Rep1 (Proxy ∷ k → Type)

@since base-4.6.0.0

Instance details

Defined in GHC.Internal.Generics

type Rep1 (Proxy ∷ k → Type) = D1 ('MetaData "Proxy" "GHC.Internal.Data.Proxy" "ghc-internal" 'False) (C1 ('MetaCons "Proxy" 'PrefixI 'False) (U1 ∷ k → Type))
type Rep (ProxyTypeType) 
Instance details

Defined in Data.Functor.Rep

type Rep (ProxyTypeType) = Void
type Rep (Proxy t)

@since base-4.6.0.0

Instance details

Defined in GHC.Internal.Generics

type Rep (Proxy t) = D1 ('MetaData "Proxy" "GHC.Internal.Data.Proxy" "ghc-internal" 'False) (C1 ('MetaCons "Proxy" 'PrefixI 'False) (U1TypeType))
type Element (Proxy a) 
Instance details

Defined in Data.MonoTraversable

type Element (Proxy a) = a

data (a ∷ k) :~: (b ∷ k) where infix 4 #

Propositional equality. If a :~: b is inhabited by some terminating value, then the type a is the same as the type b. To use this equality in practice, pattern-match on the a :~: b to get out the Refl constructor; in the body of the pattern-match, the compiler knows that a ~ b.

@since base-4.7.0.0

Constructors

Refl ∷ ∀ {k} (a ∷ k). a :~: a 

Instances

Instances details
Category ((:~:) ∷ k → k → Type)

@since base-4.7.0.0

Instance details

Defined in GHC.Internal.Control.Category

Methods

id ∷ ∀ (a ∷ k). a :~: a #

(.) ∷ ∀ (b ∷ k) (c ∷ k) (a ∷ k). (b :~: c) → (a :~: b) → a :~: c #

TestEquality ((:~:) a ∷ k → Type)

@since base-4.7.0.0

Instance details

Defined in GHC.Internal.Data.Type.Equality

Methods

testEquality ∷ ∀ (a0 ∷ k) (b ∷ k). (a :~: a0) → (a :~: b) → Maybe (a0 :~: b) #

GCompare ((:~:) a ∷ k → Type) 
Instance details

Defined in Data.GADT.Internal

Methods

gcompare ∷ ∀ (a0 ∷ k) (b ∷ k). (a :~: a0) → (a :~: b) → GOrdering a0 b Source #

GEq ((:~:) a ∷ k → Type) 
Instance details

Defined in Data.GADT.Internal

Methods

geq ∷ ∀ (a0 ∷ k) (b ∷ k). (a :~: a0) → (a :~: b) → Maybe (a0 :~: b) Source #

GRead ((:~:) a ∷ k → Type) 
Instance details

Defined in Data.GADT.Internal

Methods

greadsPrecIntGReadS ((:~:) a) Source #

GShow ((:~:) a ∷ k → Type) 
Instance details

Defined in Data.GADT.Internal

Methods

gshowsPrec ∷ ∀ (a0 ∷ k). Int → (a :~: a0) → ShowS Source #

NFData2 ((:~:)TypeTypeType)

Since: deepseq-1.4.3.0

Instance details

Defined in Control.DeepSeq

Methods

liftRnf2 ∷ (a → ()) → (b → ()) → (a :~: b) → () #

NFData1 ((:~:) a)

Since: deepseq-1.4.3.0

Instance details

Defined in Control.DeepSeq

Methods

liftRnf ∷ (a0 → ()) → (a :~: a0) → () #

NFData (a :~: b)

Since: deepseq-1.4.3.0

Instance details

Defined in Control.DeepSeq

Methods

rnf ∷ (a :~: b) → () #

a ~ b ⇒ Bounded (a :~: b)

@since base-4.7.0.0

Instance details

Defined in GHC.Internal.Data.Type.Equality

Methods

minBound ∷ a :~: b #

maxBound ∷ a :~: b #

a ~ b ⇒ Enum (a :~: b)

@since base-4.7.0.0

Instance details

Defined in GHC.Internal.Data.Type.Equality

Methods

succ ∷ (a :~: b) → a :~: b #

pred ∷ (a :~: b) → a :~: b #

toEnumInt → a :~: b #

fromEnum ∷ (a :~: b) → Int #

enumFrom ∷ (a :~: b) → [a :~: b] #

enumFromThen ∷ (a :~: b) → (a :~: b) → [a :~: b] #

enumFromTo ∷ (a :~: b) → (a :~: b) → [a :~: b] #

enumFromThenTo ∷ (a :~: b) → (a :~: b) → (a :~: b) → [a :~: b] #

a ~ b ⇒ Read (a :~: b)

@since base-4.7.0.0

Instance details

Defined in GHC.Internal.Data.Type.Equality

Methods

readsPrecIntReadS (a :~: b) #

readListReadS [a :~: b] #

readPrecReadPrec (a :~: b) #

readListPrecReadPrec [a :~: b] #

Show (a :~: b)

@since base-4.7.0.0

Instance details

Defined in GHC.Internal.Data.Type.Equality

Methods

showsPrecInt → (a :~: b) → ShowS #

show ∷ (a :~: b) → String #

showList ∷ [a :~: b] → ShowS #

Eq (a :~: b)

@since base-4.7.0.0

Instance details

Defined in GHC.Internal.Data.Type.Equality

Methods

(==) ∷ (a :~: b) → (a :~: b) → Bool #

(/=) ∷ (a :~: b) → (a :~: b) → Bool #

Ord (a :~: b)

@since base-4.7.0.0

Instance details

Defined in GHC.Internal.Data.Type.Equality

Methods

compare ∷ (a :~: b) → (a :~: b) → Ordering #

(<) ∷ (a :~: b) → (a :~: b) → Bool #

(<=) ∷ (a :~: b) → (a :~: b) → Bool #

(>) ∷ (a :~: b) → (a :~: b) → Bool #

(>=) ∷ (a :~: b) → (a :~: b) → Bool #

max ∷ (a :~: b) → (a :~: b) → a :~: b #

min ∷ (a :~: b) → (a :~: b) → a :~: b #