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

Test.Ouroboros.Consensus.ChainGenerator.Slot

Synopsis

Counting

data E Source #

Type-level names for the different kinds of slots counted in this library

The data constructors of this type are used in promoted form with -XDataKinds.

Constructors

ActiveSlotE

Active slots must be filled on the honest chain and may be filled on an alternative chain.

EmptySlotE

Empty slots may be filled on the honest chain and must not be filled on an alternative chain.

SlotE

SlotE is the union of ActiveSlotE and EmptySlotE

complementActive ∷ ∀ proxy (pol ∷ Pol) base which. proxy pol → Size base 'SlotE → Count base (PreImage pol 'ActiveSlotE) which → Count base (PreImage pol 'EmptySlotE) which Source #

Every slot is either active or empty

complementEmpty ∷ ∀ proxy (pol ∷ Pol) base which. proxy pol → Size base 'SlotE → Count base (PreImage pol 'EmptySlotE) which → Count base (PreImage pol 'ActiveSlotE) which Source #

Every slot is either active or empty

Slot

data S Source #

The activeness of some slot

Instances

Instances details
Arbitrary S Source # 
Instance details

Defined in Test.Ouroboros.Consensus.ChainGenerator.Slot

Methods

arbitrary ∷ Gen S Source #

shrink ∷ S → [S] Source #

Read S Source # 
Instance details

Defined in Test.Ouroboros.Consensus.ChainGenerator.Slot

Methods

readsPrec ∷ Int → ReadS S #

readList ∷ ReadS [S] #

readPrec ∷ ReadPrec S #

readListPrec ∷ ReadPrec [S] #

Show S Source # 
Instance details

Defined in Test.Ouroboros.Consensus.ChainGenerator.Slot

Methods

showsPrec ∷ Int → S → ShowS #

show ∷ S → String #

showList ∷ [S] → ShowS #

Eq S Source # 
Instance details

Defined in Test.Ouroboros.Consensus.ChainGenerator.Slot

Methods

(==) ∷ S → S → Bool #

(/=) ∷ S → S → Bool #

Ord S Source # 
Instance details

Defined in Test.Ouroboros.Consensus.ChainGenerator.Slot

Methods

compare ∷ S → S → Ordering #

(<) ∷ S → S → Bool #

(<=) ∷ S → S → Bool #

(>) ∷ S → S → Bool #

(>=) ∷ S → S → Bool #

max ∷ S → S → S #

min ∷ S → S → S #

Unbox S Source # 
Instance details

Defined in Test.Ouroboros.Consensus.ChainGenerator.Slot

Vector Vector S Source # 
Instance details

Defined in Test.Ouroboros.Consensus.ChainGenerator.Slot

Methods

basicUnsafeFreeze ∷ Mutable Vector s S → ST s (Vector S) Source #

basicUnsafeThaw ∷ Vector S → ST s (Mutable Vector s S) Source #

basicLength ∷ Vector S → Int Source #

basicUnsafeSlice ∷ Int → Int → Vector S → Vector S Source #

basicUnsafeIndexM ∷ Vector S → Int → Box S Source #

basicUnsafeCopy ∷ Mutable Vector s S → Vector S → ST s () Source #

elemseq ∷ Vector S → S → b → b Source #

MVector MVector S Source # 
Instance details

Defined in Test.Ouroboros.Consensus.ChainGenerator.Slot

Methods

basicLength ∷ MVector s S → Int Source #

basicUnsafeSlice ∷ Int → Int → MVector s S → MVector s S Source #

basicOverlaps ∷ MVector s S → MVector s S → Bool Source #

basicUnsafeNew ∷ Int → ST s (MVector s S) Source #

basicInitialize ∷ MVector s S → ST s () Source #

basicUnsafeReplicate ∷ Int → S → ST s (MVector s S) Source #

basicUnsafeRead ∷ MVector s S → Int → ST s S Source #

basicUnsafeWrite ∷ MVector s S → Int → S → ST s () Source #

basicClear ∷ MVector s S → ST s () Source #

basicSet ∷ MVector s S → S → ST s () Source #

basicUnsafeCopy ∷ MVector s S → MVector s S → ST s () Source #

basicUnsafeMove ∷ MVector s S → MVector s S → ST s () Source #

basicUnsafeGrow ∷ MVector s S → Int → ST s (MVector s S) Source #

newtype Vector S Source # 
Instance details

Defined in Test.Ouroboros.Consensus.ChainGenerator.Slot

newtype Vector S = V_S (Vector Bool)
newtype MVector s S Source # 
Instance details

Defined in Test.Ouroboros.Consensus.ChainGenerator.Slot

newtype MVector s S = MV_S (MVector s Bool)

showS ∷ S → ShowS Source #

genS ∷ RandomGen g ⇒ Asc → g → (S, g) Source #

Reuse

class POL (pol ∷ Pol) where Source #

Overloaded slot operations for the two polarities

Methods

mkActive ∷ proxy pol → S Source #

Make an active slot

test ∷ proxy pol → S → Bool Source #

Test whether pol maps the given bit to one

Instances

Instances details
POL 'Inverted Source # 
Instance details

Defined in Test.Ouroboros.Consensus.ChainGenerator.Slot

Methods

mkActive ∷ proxy 'Inverted → S Source #

test ∷ proxy 'Inverted → S → Bool Source #

POL 'NotInverted Source # 
Instance details

Defined in Test.Ouroboros.Consensus.ChainGenerator.Slot

Methods

mkActive ∷ proxy 'NotInverted → S Source #

test ∷ proxy 'NotInverted → S → Bool Source #

data Pol Source #

The polarity of a type

This is used to toggle how functions in this library interact with vectors of S values.

If the polarity is Inverted, then the function will treat all S values as if they were first complemented.

The PreImage type family does the corresponding parameterization of ActiveSlotE and EmptySlotE at the type level.

NOTE: No S value is ever actually complemented because of Inverted, but the functions parameterized by pol will treat them as if they were.

Constructors

Inverted 
NotInverted 

type family PreImage (pol ∷ Pol) (e ∷ E) ∷ E where ... Source #

PreImage pol e is the complement of e if pol is Inverted and simply e if it's NotInverted

Equations

PreImage 'Inverted 'EmptySlotE = 'ActiveSlotE 
PreImage 'Inverted 'ActiveSlotE = 'EmptySlotE 
PreImage 'NotInverted e = e 

inverted ∷ Proxy 'Inverted Source #

notInverted ∷ Proxy 'NotInverted Source #