cardano-ledger-test-9.9.9.9: Testing harness, tests and benchmarks for Shelley style cardano ledgers
Safe HaskellSafe-Inferred
LanguageHaskell2010

Test.Cardano.Ledger.Constrained.Rewrite

Synopsis

Documentation

rewriteEra era ⇒ [Pred era] → [Pred era] Source #

rewriteGenEra era ⇒ (Int, [Pred era]) → Gen (Int, [Pred era]) Source #

rewritePredEra era ⇒ IntPred era → Gen ([Pred era], Int) Source #

compileEra era ⇒ OrderInfo → [Pred era] → Typed (DependGraph era) Source #

Construct the DependGraph

compileGenWithSubstEra era ⇒ OrderInfoSubst era → [Pred era] → Gen (Int, DependGraph era) Source #

Construct the DependGraph

removeSameVarEra era ⇒ [Pred era] → [Pred era] → [Pred era] Source #

removeEqualEra era ⇒ [Pred era] → [Pred era] → [Pred era] Source #

newtype DependGraph era Source #

An Ordering

Constructors

DependGraph [([Name era], [Pred era])] 

Instances

Instances details
Era era ⇒ Show (DependGraph era) Source # 
Instance details

Defined in Test.Cardano.Ledger.Constrained.Rewrite

accumdepEra era ⇒ OrderInfoMap (Name era) (HashSet (Name era)) → Pred era → Map (Name era) (HashSet (Name era)) Source #

initialOrder ∷ ∀ era. Era era ⇒ OrderInfo → [Pred era] → Typed [Name era] Source #

listEq ∷ (a → b → Bool) → [a] → [b] → Bool Source #

mkDependGraph ∷ ∀ era. Era era ⇒ Int → [([Name era], [Pred era])] → HashSet (Name era) → [Name era] → [Name era] → [Pred era] → Typed (DependGraph era) Source #

notBeforePred era → Bool Source #

cpeqEra era ⇒ Pred era → Pred era → Bool Source #

Conservative Pred equality

cteqEra era ⇒ Term era t → Term era t → Bool Source #

Conservative Term equality

mkNewVar ∷ ∀ era d r. Term era (Map d r) → Term era (Set d) Source #

addPEra era ⇒ Pred era → [Pred era] → [Pred era] Source #

addPredEra era ⇒ HashSet (Name era) → Pred era → [Name era] → [Pred era] → [Pred era] → [Pred era] Source #

partitionE ∷ (a → Either b a) → [a] → ([b], [a]) Source #

renameName era → [Int] → [Name era] Source #