chore: remove repeat words (#5053)

Signed-off-by: dashangcun <jchaodaohang@foxmail.com>
Co-authored-by: dashangcun <jchaodaohang@foxmail.com>
Co-authored-by: Zack Brunson <Zshooter@gmail.com>
This commit is contained in:
dashangcun
2024-07-10 06:05:14 +09:00
committed by tequ
parent 62c17828d7
commit a5787f78a5
5 changed files with 5 additions and 5 deletions

View File

@@ -526,7 +526,7 @@ static int secp256k1_ecdsa_sign_inner(const secp256k1_context* ctx, secp256k1_sc
break;
}
is_nonce_valid = secp256k1_scalar_set_b32_seckey(&non, nonce32);
/* The nonce is still secret here, but it being invalid is is less likely than 1:2^255. */
/* The nonce is still secret here, but it being invalid is less likely than 1:2^255. */
secp256k1_declassify(ctx, &is_nonce_valid, sizeof(is_nonce_valid));
if (is_nonce_valid) {
ret = secp256k1_ecdsa_sig_sign(&ctx->ecmult_gen_ctx, r, s, &sec, &msg, &non, recid);

View File

@@ -40,7 +40,7 @@ namespace csf {
level when adding to the simulation.
The example code below demonstrates the reason for storing the collector
as a reference. The collector's lifetime will generally be be longer than
as a reference. The collector's lifetime will generally be longer than
the simulation; perhaps several simulations are run for a single collector
instance. The collector potentially stores lots of data as well, so the
simulation needs to point to the single instance, rather than requiring

View File

@@ -220,7 +220,7 @@ public:
@param fileName The output file (creates)
@param vertexName A invokable T vertexName(Vertex const &) that
returns the name target use for the vertex in the file
T must be be ostream-able
T must be ostream-able
*/
template <class VertexName>
void

View File

@@ -37,7 +37,7 @@ namespace ripple {
low bits. When dereferencing the pointer, these low "tag" bits are set to
zero. When accessing the tag bits, the high "pointer" bits are set to zero.
The "pointer" part points to to the equivalent to an array of
The "pointer" part points to the equivalent to an array of
`SHAMapHash` followed immediately by an array of
`shared_ptr<SHAMapTreeNode>`. The sizes of these arrays are
determined by the tag. The tag is an index into an array (`boundaries`,

View File

@@ -258,7 +258,7 @@ TaggedPointer::getChildIndex(std::uint16_t isBranch, int i) const
// of a child in the array is the number of non-empty children
// before it. Since `isBranch_` is a bitset of the stored
// children, we simply need to mask out (and set to zero) all
// the bits in `isBranch_` equal to to higher than `i` and count
// the bits in `isBranch_` equal to higher than `i` and count
// the bits.
// mask sets all the bits >=i to zero and all the bits <i to