fn filter_descendants(
        self,
        height: u64,
        bhash: &'a C::Hash,
        state: &'a State<C>,
    ) -> Option<Self> {
        let iter = self.votes.into_iter();
        Self::try_from_iter(
            iter.filter(|&(b, _)| state.find_ancestor_proposal(b, height) == Some(bhash)),
        )
    }
/// Returns a tally containing only the votes for descendants of `bhash`.
///
/// The total weight of the result is less than or equal to the total weight of `self`, and the
/// set of validators contributing to it is a subset of the ones contributing to `self`.
Returns a tally containing only the votes for descendants of `bhash`.
The total weight of the result is less than or equal to the total weight of `self`, and the
set of validators contributing to it is a subset of the ones contributing to `self`.
Returns a tally containing only the votes for descendants of ` bhash ` . The total weight of the result is less than or equal to the total weight of ` self ` and the set of validators contributing to it is a subset of the ones contributing to ` self ` .
fn filter_descendants(
        self,
        height: u64,
        bhash: &'a C::Hash,
        state: &'a State<C>,
    ) -> Option<Self> {
        let iter = self.votes.into_iter();
        Self::try_from_iter(
            iter.filter(|&(b, _)| state.find_ancestor_proposal(b, height) == Some(bhash)),
        )
    }
fn filter_descendants ( self , height : u64 , bhash : & ' a C :: Hash , state : & ' a State < C > , ) -> Option < Self > { let iter = self . votes . into_iter ( ) ; Self :: try_from_iter ( iter . filter ( | & ( b , _ ) | state . find_ancestor_proposal ( b , height ) == Some ( bhash ) ) , ) }
Returns a tally containing only the votes for descendants of `bhash`.
Returns a tally containing only the votes for descendants of ` bhash ` .
self
height
u64
bhash
&'a C::Hash
state
&'a State<C>
self
height
u64
bhash
&'a C::Hash
state
&'a State<C>