/// The count of `Aux` messages such that the set of values carried by those messages is a
/// subset of `bin_values`.
///
/// In general, we can't expect every good node to send the same `Aux` value, so waiting for
/// _N - f_ agreeing messages would not always terminate. We can, however, expect every good
/// node to send an `Aux` value that will eventually end up in our `bin_values`.
The count of `Aux` messages such that the set of values carried by those messages is a
subset of `bin_values`.

In general, we can't expect every good node to send the same `Aux` value, so waiting for
_N - f_ agreeing messages would not always terminate. We can, however, expect every good
node to send an `Aux` value that will eventually end up in our `bin_values`.
The count of ` Aux ` messages such that the set of values carried by those messages is a subset of ` bin_values ` . In general we can ' t expect every good node to send the same ` Aux ` value so waiting for _N - f_ agreeing messages would not always terminate . We can however expect every good node to send an ` Aux ` value that will eventually end up in our ` bin_values ` .
fn count_aux(&self) -> (usize, BoolSet) {
        let mut values = bool_set::NONE;
        let mut count = 0;
        for b in self.bin_values {
            if !self.received_aux[b].is_empty() {
                values.insert(b);
                count += self.received_aux[b].len();
            }
        }
        (count, values)
    }
fn count_aux ( & self ) -> ( usize , BoolSet ) { let mut values = bool_set :: NONE ; let mut count = 0 ; for b in self . bin_values { if ! self . received_aux [ b ] . is_empty ( ) { values . insert ( b ) ; count += self . received_aux [ b ] . len ( ) ; } } ( count , values ) }
The count of `Aux` messages such that the set of values carried by those messages is a
subset of `bin_values`.
The count of ` Aux ` messages such that the set of values carried by those messages is a subset of ` bin_values ` .
&self