chore: remove repeat words (#5041)

This commit is contained in:
todaymoon
2024-06-15 04:36:59 +09:00
committed by GitHub
parent 20d05492d2
commit 3f5e3212fe
7 changed files with 9 additions and 9 deletions

View File

@@ -89,7 +89,7 @@ public:
subject to liquidity limits
@param sb view with the strand's state of balances and offers
@param afView view the the state of balances before the strand runs
@param afView view the state of balances before the strand runs
this determines if an offer becomes unfunded or is found unfunded
@param ofrsToRm offers found unfunded or in an error state are added to
this collection
@@ -107,7 +107,7 @@ public:
subject to liquidity limits
@param sb view with the strand's state of balances and offers
@param afView view the the state of balances before the strand runs
@param afView view the state of balances before the strand runs
this determines if an offer becomes unfunded or is found unfunded
@param ofrsToRm offers found unfunded or in an error state are added to
this collection
@@ -256,7 +256,7 @@ public:
Check that the step can correctly execute in the forward direction
@param sb view with the strands state of balances and offers
@param afView view the the state of balances before the strand runs
@param afView view the state of balances before the strand runs
this determines if an offer becomes unfunded or is found unfunded
@param in requested step input
@return first element is true if step is valid, second element is out

View File

@@ -313,7 +313,7 @@ ApplyView::dirRemove(
prev->setFieldU64(sfIndexNext, rootPage);
update(prev);
// And the root points to the the last page:
// And the root points to the last page:
auto root = peek(keylet::page(directory, rootPage));
if (!root)
LogicError("Directory chain: root link broken.");

View File

@@ -180,7 +180,7 @@ PaymentSandbox::balanceHook(
algorithm remembers the original balance, and subtracts the debits. The
post-switchover algorithm should be more numerically stable. Consider a
large credit with a small initial balance. The pre-switchover algorithm
computes (B+C)-C (where B+C will the the amount passed in). The
computes (B+C)-C (where B+C will the amount passed in). The
post-switchover algorithm returns B. When B and C differ by large
magnitudes, (B+C)-C may not equal B.
*/

View File

@@ -6306,7 +6306,7 @@ class NFTokenBaseUtil_test : public beast::unit_test::suite
}
// When an account mints and burns a batch of NFTokens using tickets,
// see if the the account can be deleted.
// see if the account can be deleted.
{
Env env{*this, features};

View File

@@ -806,7 +806,7 @@ public:
on(csf::PeerID who, csf::SimTime, csf::FullyValidateLedger const& e)
{
using namespace std::chrono;
// As soon as the the fastC node fully validates C, disconnect
// As soon as the fastC node fully validates C, disconnect
// ALL c nodes from the network. The fast C node needs to disconnect
// as well to prevent it from relaying the validations it did see
if (who == groupCfast[0]->id &&

View File

@@ -51,7 +51,7 @@ namespace csf {
at either end of the connection will not be delivered.
When creating the Peer set, the caller needs to provide a
Scheduler object for managing the the timing and delivery
Scheduler object for managing the timing and delivery
of messages. After constructing the network, and establishing
connections, the caller uses the scheduler's step_* functions
to drive messages through the network.

View File

@@ -128,7 +128,7 @@ public:
depositAuthArgs(carol, becky).toStyledString()),
false);
// becky clears the the DepositAuth flag so carol becomes authorized.
// becky clears the DepositAuth flag so carol becomes authorized.
env(fclear(becky, asfDepositAuth));
env.close();