/// Adds propose from this node to the proposes list for the current height. Such propose
/// cannot contain unknown transactions. Returns hash of the propose.
Adds propose from this node to the proposes list for the current height. Such propose
cannot contain unknown transactions. Returns hash of the propose.
Adds propose from this node to the proposes list for the current height . Such propose cannot contain unknown transactions . Returns hash of the propose .
pub(super) fn add_self_propose(&mut self, msg: Verified<Propose>) -> Hash {
        debug_assert!(self.validator_state().is_some());
        let propose_hash = msg.object_hash();
        self.proposes.insert(
            propose_hash,
            ProposeState {
                propose: msg,
                unknown_txs: HashSet::new(),
                block_hash: None,
                // TODO: For the moment it's true because this code gets called immediately after
                // saving a propose to the cache. Think about making this approach less error-prone.
                // (ECR-1635)
                is_saved: true,
                // We expect ourself not to produce invalid proposes.
                is_valid: true,
            },
        );
        propose_hash
    }
pub ( super ) fn add_self_propose ( & mut self , msg : Verified < Propose > ) -> Hash { debug_assert ! ( self validator_state ( ) is_some ( ) ) ; let propose_hash = msg . object_hash ( ) ; self . proposes . insert ( propose_hash , ProposeState { propose : msg , unknown_txs : HashSet :: new ( ) , block_hash : None , // TODO: For the moment it's true because this code gets called immediately after // saving a propose to the cache. Think about making this approach less error-prone. // (ECR-1635) is_saved : true , // We expect ourself not to produce invalid proposes. is_valid : true , } , ) ; propose_hash }
Adds propose from this node to the proposes list for the current height.
Adds propose from this node to the proposes list for the current height .
&mut self
msg
Verified<Propose>