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

docs: remove repetitive words #35722

Closed
wants to merge 1 commit into from
Closed
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
4 changes: 2 additions & 2 deletions core/src/consensus/heaviest_subtree_fork_choice.rs
Original file line number Diff line number Diff line change
Expand Up @@ -3514,7 +3514,7 @@ mod test {
(vote_pubkeys[1], duplicate_leaves_descended_from_5[0]),
];

// The best slot should be the the smallest leaf descended from 4
// The best slot should be the smallest leaf descended from 4
assert_eq!(
heaviest_subtree_fork_choice.add_votes(
pubkey_votes.iter(),
Expand Down Expand Up @@ -3560,7 +3560,7 @@ mod test {
..,
) = setup_mark_invalid_forks_duplicate_tests();

// Marking candidate as valid again will choose the the heaviest leaf of
// Marking candidate as valid again will choose the heaviest leaf of
// the newly valid branch
let duplicate_slot = duplicate_leaves_descended_from_4[0].0;
let duplicate_descendant = (duplicate_slot + 1, Hash::new_unique());
Expand Down
2 changes: 1 addition & 1 deletion dos/src/main.rs
Original file line number Diff line number Diff line change
Expand Up @@ -551,7 +551,7 @@ fn create_payers<T: 'static + BenchTpsClient + Send + Sync>(
// Assume that if we use valid blockhash, we also have a payer
if valid_blockhash {
// each payer is used to fund transaction
// transactions are built to be invalid so the the amount here is arbitrary
// transactions are built to be invalid so the amount here is arbitrary
let funding_key = Keypair::new();
let funding_key = Arc::new(funding_key);
let res = generate_and_fund_keypairs(
Expand Down
2 changes: 1 addition & 1 deletion sdk/program/src/secp256k1_recover.rs
Original file line number Diff line number Diff line change
Expand Up @@ -233,7 +233,7 @@ impl Secp256k1Pubkey {
/// lengths of `hash` and `signature` beforehand.
///
/// When run on-chain this function will not directly validate the lengths of
/// `hash` and `signature`. It will assume they are the the correct lengths and
/// `hash` and `signature`. It will assume they are the correct lengths and
/// pass their pointers to the runtime, which will interpret them as 32-byte and
/// 64-byte buffers. If the provided slices are too short, the runtime will read
/// invalid data and attempt to interpret it, most likely returning an error,
Expand Down
2 changes: 1 addition & 1 deletion sdk/src/secp256k1_instruction.rs
Original file line number Diff line number Diff line change
Expand Up @@ -98,7 +98,7 @@
//! Many steps must be done manually.
//!
//! The `solana_program` crate provides no APIs to assist in interpreting
//! the the secp256k1 instruction data. It must be done manually.
//! the secp256k1 instruction data. It must be done manually.
//!
//! The secp256k1 program is implemented with the [`libsecp256k1`] crate,
//! which clients may also want to use.
Expand Down
2 changes: 1 addition & 1 deletion send-transaction-service/src/tpu_info.rs
Original file line number Diff line number Diff line change
Expand Up @@ -3,7 +3,7 @@ use {solana_client::connection_cache::Protocol, solana_sdk::clock::Slot, std::ne
pub trait TpuInfo {
fn refresh_recent_peers(&mut self);
fn get_leader_tpus(&self, max_count: u64, protocol: Protocol) -> Vec<&SocketAddr>;
/// In addition to the the tpu address, also return the leader slot
/// In addition to the tpu address, also return the leader slot
fn get_leader_tpus_with_slots(
&self,
max_count: u64,
Expand Down