Struct RootSet 

pub struct RootSet { /* private fields */ }

The root keys a verifier trusts, and how many must agree

Implementations

impl RootSet

pub fn published() -> Self

ROOT_KEYS at ROOT_THRESHOLD

pub fn new( keys: impl IntoIterator<Item = PublicKeyHex>, threshold: usize, ) -> Self

A threshold of zero would certify anything, so it is raised to one

pub fn contains(&self, key: &PublicKeyHex) -> bool

pub fn threshold(&self) -> usize

pub fn keys(&self) -> impl Iterator<Item = &PublicKeyHex>

The root keys, in no particular order

Trait Implementations

impl Clone for RootSet

fn clone(&self) -> Self

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for RootSet

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Eq for RootSet

impl PartialEq for RootSet

fn eq(&self, other: &Self) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl StructuralPartialEq for RootSet