Skip to main content

Crate tatara_lattice

Crate tatara_lattice 

Source
Expand description

Lattice algebra over tatara_process::classification.

Replaces convergence-controller::qualities_match and the scattered compliance-baseline comparators with a single Lattice trait.

Laws (proven by proptest in tests):

  • idempotent: a ⊓ a = a, a ⊔ a = a
  • commutative: a ⊓ b = b ⊓ a, a ⊔ b = b ⊔ a
  • associative: a ⊓ (b ⊓ c) = (a ⊓ b) ⊓ c, similarly for ⊔
  • absorption: a ⊓ (a ⊔ b) = a, a ⊔ (a ⊓ b) = a
  • leq agrees: a ≤ b ⇔ a ⊓ b = a ⇔ a ⊔ b = b

Modules§

baseline
Compliance baseline ordering — fedramp-highfedramp-moderatecis-l2cis-l1none.

Traits§

Lattice
The lattice trait.

Functions§

satisfies
Convenience — does a cluster classification satisfy a workload’s requirements?