chore: remove repetitive words

consensus/istanbul/backend/snapshot_test.go

@@ -226,7 +226,7 @@ func TestVoting(t *testing.T) {
 			},
 			results: []string{"A", "B"},
 		}, {
-			// Cascading changes are not allowed, only the the account being voted on may change
+			// Cascading changes are not allowed, only the account being voted on may change
 			validators: []string{"A", "B", "C", "D"},
 			votes: []testerVote{
 				{validator: "A", voted: "C", auth: false},

core/state/snapshot/generate.go

@@ -48,13 +48,13 @@ var (
 	// 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
 	// 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
 
 	// 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
 	// 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
 
 	// errMissingTrie is returned if the target trie is missing while the generation

core/state/statedb.go

@@ -1174,7 +1174,7 @@ func (s *StateDB) Commit(deleteEmptyObjects bool) (common.Hash, error) {
 			return common.Hash{}, fmt.Errorf("Unable to link the state root to the privacy metadata root: %v", err)
 		}
 		// add a reference from the AccountExtraData root to the state root so that when the state root is written
-		// to the DB the the AccountExtraData root is also written
+		// to the DB the AccountExtraData root is also written
 		s.db.TrieDB().Reference(extraDataRoot, root)
 	}
 	return root, err

core/state/statedb_test.go

@@ -1030,7 +1030,7 @@ func TestPrivacyMetadataIsUpdatedOnAccountReCreateWithDifferentPrivacyMetadata(t
 	if privMetaData == nil {
 		t.Errorf("privacy metadata should have been updated during commit")
 	} else if privMetaData.PrivacyFlag != engine.PrivacyFlagStateValidation {
-		t.Errorf("privacy metadata should have StateValidation as the the privacy flag")
+		t.Errorf("privacy metadata should have StateValidation as the privacy flag")
 	}
 }
 

crypto/secp256k1/libsecp256k1/src/asm/field_10x26_arm.s

@@ -11,7 +11,7 @@ Note:
 
 - 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' 
-  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
 
 */
 

eth/api.go

@@ -563,7 +563,7 @@ func (api *PrivateDebugAPI) getModifiedAccounts(startBlock, endBlock *types.Bloc
 
 // Quorum
 
-// StorageRoot returns the storage root of an account on the the given (optional) block height.
+// StorageRoot returns the storage root of an account on the given (optional) block height.
 // If block number is not given the latest block is used.
 func (s *PublicEthereumAPI) StorageRoot(ctx context.Context, addr common.Address, blockNr *rpc.BlockNumber) (common.Hash, error) {
 	var (

eth/protocols/eth/handler.go

@@ -96,7 +96,7 @@ type Backend interface {
 
 // TxPool defines the methods needed by the protocol handler to serve transactions.
 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
 }
 

extension/api.go

@@ -322,7 +322,7 @@ func (api *PrivateExtensionAPI) ExtendContract(ctx context.Context, toExtend com
 		return "", errors.New("invalid new recipient transaction manager key provided")
 	}
 
-	// check the the intended new recipient will actually receive the extension request
+	// check the intended new recipient will actually receive the extension request
 	switch len(txa.PrivateFor) {
 	case 0:
 		txa.PrivateFor = append(txa.PrivateFor, newRecipientPtmPublicKey)

graphql/graphql.go

@@ -313,7 +313,7 @@ func (g *transactionReceiptGetter) get(ctx context.Context) (*types.Receipt, err
 }
 
 // (Quorum) privateTransactionReceiptGetter implements receiptGetter and gets privacy precompile transaction receipts
-// from the the db
+// from the db
 type privateTransactionReceiptGetter struct {
 	pmt *Transaction
 }

les/vflux/client/serverpool.go

@@ -44,7 +44,7 @@ const (
 	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
 	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
 	preNegLimit         = 5                      // maximum number of simultaneous pre-negotiation queries
 	warnQueryFails      = 20                     // number of consecutive UDP query failures before we print a warning

p2p/discover/v5wire/msg.go

@@ -84,7 +84,7 @@ type (
 		ReqID  []byte
 		ENRSeq uint64
 		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.

trie/iterator.go

@@ -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) {
 	root := it.trie.Hash()
 	state := &nodeIteratorState{node: it.trie.root, index: -1}