Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

fix typo #7096

Merged
merged 2 commits into from
Jan 9, 2025
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Original file line number Diff line number Diff line change
Expand Up @@ -561,7 +561,7 @@ impl BlockEntry {
self.distributed_assignments.resize(new_len, false);
self.distributed_assignments |= bitfield;

// If the an operation did not change our current bitfield, we return true.
// If an operation did not change our current bitfield, we return true.
let distributed = total_one_bits == self.distributed_assignments.count_ones();

distributed
Expand Down
2 changes: 1 addition & 1 deletion polkadot/node/core/pvf-checker/src/interest_view.rs
Original file line number Diff line number Diff line change
Expand Up @@ -58,7 +58,7 @@ impl PvfData {
Self { judgement: None, seen_in }
}

/// Mark a the `PvfData` as seen in the provided relay-chain block referenced by `relay_hash`.
/// Mark the `PvfData` as seen in the provided relay-chain block referenced by `relay_hash`.
pub fn seen_in(&mut self, relay_hash: Hash) {
self.seen_in.insert(relay_hash);
}
Expand Down
8 changes: 4 additions & 4 deletions polkadot/node/network/approval-distribution/src/tests.rs
Original file line number Diff line number Diff line change
Expand Up @@ -1255,7 +1255,7 @@ fn import_approval_happy_path_v1_v2_peers() {
}
);

// send the an approval from peer_b
// send an approval from peer_b
let approval = IndirectSignedApprovalVoteV2 {
block_hash: hash,
candidate_indices: candidate_index.into(),
Expand Down Expand Up @@ -1385,7 +1385,7 @@ fn import_approval_happy_path_v2() {
}
);

// send the an approval from peer_b
// send an approval from peer_b
let approval = IndirectSignedApprovalVoteV2 {
block_hash: hash,
candidate_indices,
Expand Down Expand Up @@ -1893,7 +1893,7 @@ fn import_approval_bad() {
.unwrap()
.unwrap();

// send the an approval from peer_b, we don't have an assignment yet
// send an approval from peer_b, we don't have an assignment yet
let approval = IndirectSignedApprovalVoteV2 {
block_hash: hash,
candidate_indices: candidate_index.into(),
Expand Down Expand Up @@ -4172,7 +4172,7 @@ fn import_versioned_approval() {
}
);

// send the an approval from peer_a
// send an approval from peer_a
let approval = IndirectSignedApprovalVote {
block_hash: hash,
candidate_index,
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -406,7 +406,7 @@ Some(core_index), response_sender)`
* Construct a `IndirectSignedApprovalVote` using the information about the vote.
* Dispatch `ApprovalDistributionMessage::DistributeApproval`.
* ELSE
* Re-arm the timer with latest tick we have the send a the vote.
* Re-arm the timer with latest tick we have then send the vote.

### Determining Approval of Candidate

Expand Down
2 changes: 1 addition & 1 deletion polkadot/runtime/rococo/src/xcm_config.rs
Original file line number Diff line number Diff line change
Expand Up @@ -84,7 +84,7 @@ pub type LocalAssetTransactor = FungibleAdapter<
LocalCheckAccount,
>;

/// The means that we convert an the XCM message origin location into a local dispatch origin.
/// The means that we convert the XCM message origin location into a local dispatch origin.
type LocalOriginConverter = (
// A `Signed` origin of the sovereign account that the original location controls.
SovereignSignedViaLocation<LocationConverter, RuntimeOrigin>,
Expand Down
2 changes: 1 addition & 1 deletion substrate/client/allocator/src/freeing_bump.rs
Original file line number Diff line number Diff line change
Expand Up @@ -182,7 +182,7 @@ const NIL_MARKER: u32 = u32::MAX;
enum Link {
/// Nil, denotes that there is no next element.
Nil,
/// Link to the next element represented as a pointer to the a header.
/// Link to the next element represented as a pointer to the header.
Ptr(u32),
}

Expand Down
2 changes: 1 addition & 1 deletion substrate/client/api/src/proof_provider.rs
Original file line number Diff line number Diff line change
Expand Up @@ -82,7 +82,7 @@ pub trait ProofProvider<Block: BlockT> {
) -> sp_blockchain::Result<Vec<(KeyValueStorageLevel, bool)>>;

/// Verify read storage proof for a set of keys.
/// Returns collected key-value pairs and a the nested state
/// Returns collected key-value pairs and the nested state
/// depth of current iteration or 0 if completed.
fn verify_range_proof(
&self,
Expand Down
2 changes: 1 addition & 1 deletion substrate/frame/preimage/src/lib.rs
Original file line number Diff line number Diff line change
Expand Up @@ -236,7 +236,7 @@ pub mod pallet {
Self::do_unrequest_preimage(&hash)
}

/// Ensure that the a bulk of pre-images is upgraded.
/// Ensure that the bulk of pre-images is upgraded.
///
/// The caller pays no fee if at least 90% of pre-images were successfully updated.
#[pallet::call_index(4)]
Expand Down
2 changes: 1 addition & 1 deletion substrate/frame/recovery/README.md
Original file line number Diff line number Diff line change
Expand Up @@ -62,7 +62,7 @@ The intended life cycle of a successful recovery takes the following steps:

### Malicious Recovery Attempts

Initializing a the recovery process for a recoverable account is open and
Initializing the recovery process for a recoverable account is open and
permissionless. However, the recovery deposit is an economic deterrent that
should disincentivize would-be attackers from trying to maliciously recover
accounts.
Expand Down
2 changes: 1 addition & 1 deletion substrate/frame/recovery/src/lib.rs
Original file line number Diff line number Diff line change
Expand Up @@ -75,7 +75,7 @@
//!
//! ### Malicious Recovery Attempts
//!
//! Initializing a the recovery process for a recoverable account is open and
//! Initializing the recovery process for a recoverable account is open and
//! permissionless. However, the recovery deposit is an economic deterrent that
//! should disincentivize would-be attackers from trying to maliciously recover
//! accounts.
Expand Down
2 changes: 1 addition & 1 deletion substrate/frame/support/src/dispatch_context.rs
Original file line number Diff line number Diff line change
Expand Up @@ -140,7 +140,7 @@ impl<T> Value<'_, T> {

/// Runs the given `callback` in the dispatch context and gives access to some user defined value.
///
/// Passes the a mutable reference of [`Value`] to the callback. The value will be of type `T` and
/// Passes a mutable reference of [`Value`] to the callback. The value will be of type `T` and
/// is identified using the [`TypeId`] of `T`. This means that `T` should be some unique type to
/// make the value unique. If no value is set yet [`Value::get()`] and [`Value::get_mut()`] will
/// return `None`. It is totally valid to have some `T` that is shared between different callers to
Expand Down
2 changes: 1 addition & 1 deletion substrate/primitives/api/src/lib.rs
Original file line number Diff line number Diff line change
Expand Up @@ -666,7 +666,7 @@ pub struct CallApiAtParams<'a, Block: BlockT> {
pub extensions: &'a RefCell<Extensions>,
}

/// Something that can call into the an api at a given block.
/// Something that can call into an api at a given block.
#[cfg(feature = "std")]
pub trait CallApiAt<Block: BlockT> {
/// The state backend that is used to store the block states.
Expand Down
2 changes: 1 addition & 1 deletion substrate/primitives/runtime/src/traits/mod.rs
Original file line number Diff line number Diff line change
Expand Up @@ -1963,7 +1963,7 @@ pub trait AccountIdConversion<AccountId>: Sized {
Self::try_from_sub_account::<()>(a).map(|x| x.0)
}

/// Convert this value amalgamated with the a secondary "sub" value into an account ID,
/// Convert this value amalgamated with a secondary "sub" value into an account ID,
/// truncating any unused bytes. This is infallible.
///
/// NOTE: The account IDs from this and from `into_account` are *not* guaranteed to be distinct
Expand Down
Loading