Remove redundant words (#2100)
* Remove redundant words Signed-off-by: depthlending <bikangning@outlook.com> * Fix copyright year --------- Signed-off-by: depthlending <bikangning@outlook.com> Co-authored-by: jangko <jangko128@gmail.com>
This commit is contained in:
parent
f3de770c14
commit
dce00079c4
|
@ -797,7 +797,7 @@ func getMaxOfferedContentKeys*(protocolIdLen: uint32, maxKeySize: uint32): int =
|
|||
# To calculate how much bytes, `n` content keys of size `maxKeySize` will take
|
||||
# we can use following equation:
|
||||
# bytes = (n * (maxKeySize + perContentKeyOverhead)) + offerMessageOverhead
|
||||
# to calculate maximal number of keys which will will given space this can be
|
||||
# to calculate maximal number of keys which will given space this can be
|
||||
# transformed to:
|
||||
# n = trunc((bytes - offerMessageOverhead) / (maxKeySize + perContentKeyOverhead))
|
||||
return ((maxTalkReqPayload - 5) div (int(maxKeySize) + 4))
|
||||
|
|
|
@ -1,5 +1,5 @@
|
|||
# Nimbus
|
||||
# Copyright (c) 2018 Status Research & Development GmbH
|
||||
# Copyright (c) 2018-2024 Status Research & Development GmbH
|
||||
# Licensed under either of
|
||||
# * Apache License, version 2.0, ([LICENSE-APACHE](LICENSE-APACHE) or
|
||||
# http://www.apache.org/licenses/LICENSE-2.0)
|
||||
|
@ -35,7 +35,7 @@ export
|
|||
type
|
||||
CliqueState* = ##\
|
||||
## Descriptor state snapshot which can be used for implementing
|
||||
## transaction trasnaction handling. Nore the the `Snapshot` type
|
||||
## transaction trasnaction handling. Nore the `Snapshot` type
|
||||
## inside the `Result[]` is most probably opaque.
|
||||
Result[Snapshot,void]
|
||||
|
||||
|
|
|
@ -163,7 +163,7 @@ proc cliqueGenvote*(
|
|||
checkPoint: seq[EthAddress] = @[]): BlockHeader
|
||||
{.gcsafe, raises: [CatchableError].} =
|
||||
## Variant of `clique_genvote()` where the `parent` is the canonical head
|
||||
## on the the block chain database.
|
||||
## on the block chain database.
|
||||
##
|
||||
## Trivial example (aka smoke test):
|
||||
##
|
||||
|
|
|
@ -1,5 +1,5 @@
|
|||
# Nimbus
|
||||
# Copyright (c) 2018-2023 Status Research & Development GmbH
|
||||
# Copyright (c) 2018-2024 Status Research & Development GmbH
|
||||
# Licensed under either of
|
||||
# * Apache License, version 2.0, ([LICENSE-APACHE](LICENSE-APACHE) or
|
||||
# http://www.apache.org/licenses/LICENSE-2.0)
|
||||
|
@ -411,7 +411,7 @@ when defined(testing):
|
|||
# check newError < error
|
||||
error = newError
|
||||
|
||||
# After enough samples we should be very close the the final result
|
||||
# After enough samples we should be very close the final result
|
||||
check error < (expectedFinalCost * 0.02)
|
||||
|
||||
performTest(1, 10, 5.0, 100.0)
|
||||
|
|
|
@ -534,7 +534,7 @@ proc hexaryEnvelopeDecompose*(
|
|||
if touched.chunks == 0:
|
||||
return err(DecomposeDisjunct)
|
||||
|
||||
# Decompose the the complement of the `node` envelope off `iv` into
|
||||
# Decompose the complement of the `node` envelope off `iv` into
|
||||
# envelopes/sub-tries.
|
||||
let
|
||||
startNode = NodeSpecs(partialPath: partialPath)
|
||||
|
|
|
@ -1,5 +1,5 @@
|
|||
# Nimbus
|
||||
# Copyright (c) 2021-2023 Status Research & Development GmbH
|
||||
# Copyright (c) 2021-2024 Status Research & Development GmbH
|
||||
# Licensed under either of
|
||||
# * Apache License, version 2.0, ([LICENSE-APACHE](LICENSE-APACHE) or
|
||||
# http://www.apache.org/licenses/LICENSE-2.0)
|
||||
|
@ -39,7 +39,7 @@ type
|
|||
## addresses in turn (no pun intended) depend on the private keys of
|
||||
## these accounts. Now, the private keys are generated on-the-fly by a
|
||||
## PRNG which re-seeded the same for each test. So the sort order is
|
||||
## predictable and the correct value of the the `noTurn` flag can be set
|
||||
## predictable and the correct value of the `noTurn` flag can be set
|
||||
## by sort of experimenting with the tests (and/or refering to earlier
|
||||
## woking test specs.)
|
||||
|
||||
|
|
|
@ -54,7 +54,7 @@ const
|
|||
deletedItemsRatioBandPC = 95
|
||||
|
||||
# With a large enough block size, decreasing it should not decrease the
|
||||
# profitability (very much) as the the number of blocks availabe increases
|
||||
# profitability (very much) as the number of blocks availabe increases
|
||||
# (and a better choice might be available?) A good value for the next
|
||||
# parameter should be above 100%.
|
||||
decreasingBlockProfitRatioPC = 92
|
||||
|
|
Loading…
Reference in New Issue