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.

Sign up for GitHub

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

chore: remove repetitive words #233

Merged
merged 1 commit into from
Aug 16, 2024
Merged

chore: remove repetitive words #233

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
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
2 changes: 1 addition & 1 deletion legacy-sdk/whirlpool/src/router/public/router-utils.ts
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -257,7 +257,7 @@ export class RouterUtils {

/**
* Get the default options for selecting a route from a list of generated routes.
* @returns Default options for selecting a a route from a list of generated routes.
* @returns Default options for selecting a route from a list of generated routes.
*/
static getDefaultSelectOptions(): RouteSelectOptions {
return {
Expand Down
2 changes: 1 addition & 1 deletion legacy-sdk/whirlpool/src/utils/graphs/adjacency-list-pool-graph.ts
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -256,7 +256,7 @@ function findWalks(
tokenPairs.forEach(([tokenMintFrom, tokenMintTo]) => {
let paths = [];

// Adjust walk's from & to token based of of internal path id.
// Adjust walk's from & to token based of internal path id.
const [internalTokenMintFrom, internalTokenMintTo] = [
tokenMintFrom,
tokenMintTo,
Expand Down
2 changes: 1 addition & 1 deletion programs/whirlpool/src/manager/swap_manager.rs
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2519,7 +2519,7 @@ mod swap_error_tests {
// Expectation
// The swap should fail to do amount calculated overflowing.
fn swap_does_not_overflow() {
// Use filled arrays to minimize the the overflow from calculations, rather than accumulation
// Use filled arrays to minimize the overflow from calculations, rather than accumulation
let array_1_ticks: Vec<TestTickInfo> = build_filled_tick_array(439296, TS_128);
let array_2_ticks: Vec<TestTickInfo> = build_filled_tick_array(439296 - 88 * 128, TS_128);
let array_3_ticks: Vec<TestTickInfo> =
Expand Down
2 changes: 1 addition & 1 deletion programs/whirlpool/src/math/tick_math.rs
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -83,7 +83,7 @@ pub fn tick_index_from_sqrt_price(sqrt_price_x64: &u128) -> i32 {
tick_low
} else {
// If our estimation for tick_high returns a lower sqrt_price than the input
// then the actual tick_high has to be higher than than tick_high.
// then the actual tick_high has to be higher than tick_high.
// Otherwise, the actual value is between tick_low & tick_high, so a floor value
// (tick_low) is returned
let actual_tick_high_sqrt_price_x64: u128 = sqrt_price_from_tick_index(tick_high);
Expand Down