roysc/plugeth
1
0
Fork 0
forked from cerc-io/plugeth
Code Pull Requests Activity

all: fix 'the the' in comments (#24036)

Browse Source
This commit is contained in:
Taeik Lim 2021-12-02 23:42:09 +09:00 committed by GitHub
parent b45931cc4a
commit 85064ed09b
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
6 changed files with 7 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
core/state/snapshot/generate.go
View File

@ -48,13 +48,13 @@ var (
// accountCheckRange is the upper limit of the number of accounts involved in // accountCheckRange is the upper limit of the number of accounts involved in
// each range check. This is a value estimated based on experience. If this // each range check. This is a value estimated based on experience. If this
// value is too large, the failure rate of range prove will increase. Otherwise // value is too large, the failure rate of range prove will increase. Otherwise
// the the value is too small, the efficiency of the state recovery will decrease. // the value is too small, the efficiency of the state recovery will decrease.
accountCheckRange = 128 accountCheckRange = 128
// storageCheckRange is the upper limit of the number of storage slots involved // storageCheckRange is the upper limit of the number of storage slots involved
// in each range check. This is a value estimated based on experience. If this // in each range check. This is a value estimated based on experience. If this
// value is too large, the failure rate of range prove will increase. Otherwise // value is too large, the failure rate of range prove will increase. Otherwise
// the the value is too small, the efficiency of the state recovery will decrease. // the value is too small, the efficiency of the state recovery will decrease.
storageCheckRange = 1024 storageCheckRange = 1024
// errMissingTrie is returned if the target trie is missing while the generation // errMissingTrie is returned if the target trie is missing while the generation

2
crypto/secp256k1/libsecp256k1/src/asm/field_10x26_arm.s
View File

@ -11,7 +11,7 @@ Note:
- To avoid unnecessary loads and make use of available registers, two - To avoid unnecessary loads and make use of available registers, two
'passes' have every time been interleaved, with the odd passes accumulating c' and d' 'passes' have every time been interleaved, with the odd passes accumulating c' and d'
which will be added to c and d respectively in the the even passes which will be added to c and d respectively in the even passes
*/ */

2
eth/protocols/eth/handler.go
View File

@ -96,7 +96,7 @@ type Backend interface {
// TxPool defines the methods needed by the protocol handler to serve transactions. // TxPool defines the methods needed by the protocol handler to serve transactions.
type TxPool interface { type TxPool interface {
// Get retrieves the the transaction from the local txpool with the given hash. // Get retrieves the transaction from the local txpool with the given hash.
Get(hash common.Hash) *types.Transaction Get(hash common.Hash) *types.Transaction
} }

2
les/vflux/client/serverpool.go
View File

@ -44,7 +44,7 @@ const (
queryWaitStep = 1.02 // exponential multiplier of redial wait time when no value was provided by the server queryWaitStep = 1.02 // exponential multiplier of redial wait time when no value was provided by the server
waitThreshold = time.Hour * 2000 // drop node if waiting time is over the threshold waitThreshold = time.Hour * 2000 // drop node if waiting time is over the threshold
nodeWeightMul = 1000000 // multiplier constant for node weight calculation nodeWeightMul = 1000000 // multiplier constant for node weight calculation
nodeWeightThreshold = 100 // minimum weight for keeping a node in the the known (valuable) set nodeWeightThreshold = 100 // minimum weight for keeping a node in the known (valuable) set
minRedialWait = 10 // minimum redial wait time in seconds minRedialWait = 10 // minimum redial wait time in seconds
preNegLimit = 5 // maximum number of simultaneous pre-negotiation queries preNegLimit = 5 // maximum number of simultaneous pre-negotiation queries
warnQueryFails = 20 // number of consecutive UDP query failures before we print a warning warnQueryFails = 20 // number of consecutive UDP query failures before we print a warning

2
p2p/discover/v5wire/msg.go
View File

@ -84,7 +84,7 @@ type (
ReqID []byte ReqID []byte
ENRSeq uint64 ENRSeq uint64
ToIP net.IP // These fields should mirror the UDP envelope address of the ping ToIP net.IP // These fields should mirror the UDP envelope address of the ping
ToPort uint16 // packet, which provides a way to discover the the external address (after NAT). ToPort uint16 // packet, which provides a way to discover the external address (after NAT).
} }
// FINDNODE is a query for nodes in the given bucket. // FINDNODE is a query for nodes in the given bucket.

2
trie/iterator.go
View File

@ -275,7 +275,7 @@ func (it *nodeIterator) seek(prefix []byte) error {
} }
} }
// init initializes the the iterator. // init initializes the iterator.
func (it *nodeIterator) init() (*nodeIteratorState, error) { func (it *nodeIterator) init() (*nodeIteratorState, error) {
root := it.trie.Hash() root := it.trie.Hash()
state := &nodeIteratorState{node: it.trie.root, index: -1} state := &nodeIteratorState{node: it.trie.root, index: -1}