pub(crate) fn current_limit(&self) -> Option<N> {
		self.pending_standard_changes.roots()
			.min_by_key(|&(_, _, c)| c.effective_number())
			.map(|(_, _, c)| c.effective_number())
	}
/// Get the earliest limit-block number, if any. If there are pending changes across
/// different forks, this method will return the earliest effective number (across the
/// different branches). Only standard changes are taken into account for the current
/// limit, since any existing forced change should preclude the voter from voting.
Get the earliest limit-block number, if any. If there are pending changes across
different forks, this method will return the earliest effective number (across the
different branches). Only standard changes are taken into account for the current
limit, since any existing forced change should preclude the voter from voting.
Get the earliest limit - block number if any . If there are pending changes across different forks this method will return the earliest effective number ( across the different branches ) . Only standard changes are taken into account for the current limit since any existing forced change should preclude the voter from voting .
pub(crate) fn current_limit(&self) -> Option<N> {
		self.pending_standard_changes.roots()
			.min_by_key(|&(_, _, c)| c.effective_number())
			.map(|(_, _, c)| c.effective_number())
	}
pub ( crate ) fn current_limit ( & self ) -> Option < N > { self . pending_standard_changes . roots ( ) . min_by_key ( | & ( _ , _ , c ) | c . effective_number ( ) ) . map ( | ( _ , _ , c ) | c . effective_number ( ) ) }
Get the earliest limit-block number, if any.
Get the earliest limit - block number if any .
&self
&self