mirror of
https://github.com/pezkuwichain/pezkuwi-subxt.git
synced 2026-05-31 11:01:01 +00:00
Fix full spellcheck (#1076)
* fix(spellcheck): test of fixing * fix(hunspell): improved many typos etc. * fix(hunspell): all errors solved * fix(hunspell): extended scope of files - the build should fail * Return error code. * Fix spelling, sort dictionary. * fix(hunspell): added fix to gitlabs check * fix(typo): one typo and test of verification on github * fix(typo): one typo Co-authored-by: Tomasz Drwięga <tomasz@parity.io>
This commit is contained in:
committed by
Bastian Köcher
parent
562fac801d
commit
f86d101d7c
@@ -36,7 +36,7 @@ pub struct CachedFinalityVotes<Submitter> {
|
||||
/// best finalized.
|
||||
pub stopped_at_finalized_sibling: bool,
|
||||
/// Header ancestors that were read while we have been searching for
|
||||
/// cached votes entry. Newest header has index 0.
|
||||
/// cached votes entry. The newest header has index 0.
|
||||
pub unaccounted_ancestry: VecDeque<(HeaderId, Option<Submitter>, AuraHeader)>,
|
||||
/// Cached finality votes, if they have been found. The associated
|
||||
/// header is not included into `unaccounted_ancestry`.
|
||||
@@ -59,7 +59,7 @@ pub struct FinalityEffects<Submitter> {
|
||||
pub struct FinalityVotes<Submitter> {
|
||||
/// Number of votes per each validator.
|
||||
pub votes: BTreeMap<Address, u64>,
|
||||
/// Ancestry blocks with oldest ancestors at the beginning and newest at the
|
||||
/// Ancestry blocks with the oldest ancestors at the beginning and newest at the
|
||||
/// end of the queue.
|
||||
pub ancestry: VecDeque<FinalityAncestor<Submitter>>,
|
||||
}
|
||||
|
||||
@@ -22,7 +22,7 @@ use crate::{AuraConfiguration, ChainTime, ChangeToEnact, PruningStrategy, Storag
|
||||
use bp_eth_poa::{AuraHeader, HeaderId, Receipt};
|
||||
use sp_std::{collections::btree_map::BTreeMap, prelude::*};
|
||||
|
||||
/// Imports bunch of headers and updates blocks finality.
|
||||
/// Imports a bunch of headers and updates blocks finality.
|
||||
///
|
||||
/// Transactions receipts must be provided if `header_import_requires_receipts()`
|
||||
/// has returned true.
|
||||
|
||||
@@ -169,8 +169,8 @@ struct PruningRange {
|
||||
/// were unable to prune for whatever reason (i.e. if it isn't finalized yet and has
|
||||
/// scheduled validators set change).
|
||||
pub oldest_unpruned_block: u64,
|
||||
/// Number of oldest block(s) that we want to keep. We want to prune blocks in range
|
||||
/// [`oldest_unpruned_block`; `oldest_block_to_keep`).
|
||||
/// Number of the oldest block(s) that we want to keep. We want to prune blocks in range
|
||||
/// [ `oldest_unpruned_block`; `oldest_block_to_keep` ).
|
||||
pub oldest_block_to_keep: u64,
|
||||
}
|
||||
|
||||
@@ -316,10 +316,10 @@ pub trait PruningStrategy: Default {
|
||||
/// Pallet may prune both finalized and unfinalized blocks. But it can't give any
|
||||
/// guarantees on when it will happen. Example: if some unfinalized block at height N
|
||||
/// has scheduled validators set change, then the module won't prune any blocks with
|
||||
/// number >= N even if strategy allows that.
|
||||
/// number greater than or equal to N even if strategy allows that.
|
||||
///
|
||||
/// If your strategy allows pruning unfinalized blocks, this could lead to switch
|
||||
/// between finalized forks (only if authorities are misbehaving). But since 50%+1 (or 2/3)
|
||||
/// between finalized forks (only if authorities are misbehaving). But since 50 percent plus one (or 2/3)
|
||||
/// authorities are able to do whatever they want with the chain, this isn't considered
|
||||
/// fatal. If your strategy only prunes finalized blocks, we'll never be able to finalize
|
||||
/// header that isn't descendant of current best finalized block.
|
||||
|
||||
@@ -19,7 +19,7 @@
|
||||
//! Although the name implies that it is used by tests, it shouldn't be be used _directly_ by tests.
|
||||
//! Instead these utilities should be used by the Mock runtime, which in turn is used by tests.
|
||||
//!
|
||||
//! On the other hand, they may be used directly by the bechmarking module.
|
||||
//! On the other hand, they may be used directly by the benchmark module.
|
||||
|
||||
// Since this is test code it's fine that not everything is used
|
||||
#![allow(dead_code)]
|
||||
|
||||
@@ -43,7 +43,7 @@ pub fn is_importable_header<S: Storage>(storage: &S, header: &AuraHeader) -> Res
|
||||
Ok((id, finalized_id))
|
||||
}
|
||||
|
||||
/// Try accept unsigned aura header into transaction pool.
|
||||
/// Try to accept unsigned aura header into transaction pool.
|
||||
///
|
||||
/// Returns required and provided tags.
|
||||
pub fn accept_aura_header_into_pool<S: Storage, CT: ChainTime>(
|
||||
|
||||
Reference in New Issue
Block a user