aboutsummaryrefslogtreecommitdiffstats
path: root/core
diff options
context:
space:
mode:
authorHa ĐANG <dvietha@gmail.com>2018-07-30 19:10:48 +0800
committerPéter Szilágyi <peterke@gmail.com>2018-07-30 19:10:48 +0800
commit2cffd4ff3c6643e374e34bccd8d68cb52d7d4c8b (patch)
tree886557e387bf8e7b7bef78bd693267d7ea455d2d /core
parent7b1aa642201170627dd6f3d4d96701fdd068bf80 (diff)
downloaddexon-2cffd4ff3c6643e374e34bccd8d68cb52d7d4c8b.tar
dexon-2cffd4ff3c6643e374e34bccd8d68cb52d7d4c8b.tar.gz
dexon-2cffd4ff3c6643e374e34bccd8d68cb52d7d4c8b.tar.bz2
dexon-2cffd4ff3c6643e374e34bccd8d68cb52d7d4c8b.tar.lz
dexon-2cffd4ff3c6643e374e34bccd8d68cb52d7d4c8b.tar.xz
dexon-2cffd4ff3c6643e374e34bccd8d68cb52d7d4c8b.tar.zst
dexon-2cffd4ff3c6643e374e34bccd8d68cb52d7d4c8b.zip
core: fix some small typos on comment code (#17278)
Diffstat (limited to 'core')
-rw-r--r--core/blockchain.go2
-rw-r--r--core/headerchain.go2
-rw-r--r--core/tx_list.go2
3 files changed, 3 insertions, 3 deletions
diff --git a/core/blockchain.go b/core/blockchain.go
index 7b7e4e79a..62dc26125 100644
--- a/core/blockchain.go
+++ b/core/blockchain.go
@@ -1016,7 +1016,7 @@ func (bc *BlockChain) insertChain(chain types.Blocks) (int, []interface{}, []*ty
// Do a sanity check that the provided chain is actually ordered and linked
for i := 1; i < len(chain); i++ {
if chain[i].NumberU64() != chain[i-1].NumberU64()+1 || chain[i].ParentHash() != chain[i-1].Hash() {
- // Chain broke ancestry, log a messge (programming error) and skip insertion
+ // Chain broke ancestry, log a message (programming error) and skip insertion
log.Error("Non contiguous block insert", "number", chain[i].Number(), "hash", chain[i].Hash(),
"parent", chain[i].ParentHash(), "prevnumber", chain[i-1].Number(), "prevhash", chain[i-1].Hash())
diff --git a/core/headerchain.go b/core/headerchain.go
index da6716d67..2bbec28bf 100644
--- a/core/headerchain.go
+++ b/core/headerchain.go
@@ -208,7 +208,7 @@ func (hc *HeaderChain) ValidateHeaderChain(chain []*types.Header, checkFreq int)
// Do a sanity check that the provided chain is actually ordered and linked
for i := 1; i < len(chain); i++ {
if chain[i].Number.Uint64() != chain[i-1].Number.Uint64()+1 || chain[i].ParentHash != chain[i-1].Hash() {
- // Chain broke ancestry, log a messge (programming error) and skip insertion
+ // Chain broke ancestry, log a message (programming error) and skip insertion
log.Error("Non contiguous header insert", "number", chain[i].Number, "hash", chain[i].Hash(),
"parent", chain[i].ParentHash, "prevnumber", chain[i-1].Number, "prevhash", chain[i-1].Hash())
diff --git a/core/tx_list.go b/core/tx_list.go
index 287dda4c3..57abc5148 100644
--- a/core/tx_list.go
+++ b/core/tx_list.go
@@ -436,7 +436,7 @@ func (l *txPricedList) Removed() {
}
// Cap finds all the transactions below the given price threshold, drops them
-// from the priced list and returs them for further removal from the entire pool.
+// from the priced list and returns them for further removal from the entire pool.
func (l *txPricedList) Cap(threshold *big.Int, local *accountSet) types.Transactions {
drop := make(types.Transactions, 0, 128) // Remote underpriced transactions to drop
save := make(types.Transactions, 0, 64) // Local underpriced transactions to keep