diff options
author | Leif Jurvetson <leijurv@gmail.com> | 2016-03-16 02:55:39 +0800 |
---|---|---|
committer | Leif Jurvetson <leijurv@gmail.com> | 2016-03-16 03:03:17 +0800 |
commit | 434e4b31d8ad2fb34b9b9a74d05cae3cd4169daa (patch) | |
tree | 479aa140da9612da93b838d6e665bab928836066 /eth | |
parent | 06fe6310a3ecf0be324b082ca83c015abe47fa8f (diff) | |
download | dexon-434e4b31d8ad2fb34b9b9a74d05cae3cd4169daa.tar dexon-434e4b31d8ad2fb34b9b9a74d05cae3cd4169daa.tar.gz dexon-434e4b31d8ad2fb34b9b9a74d05cae3cd4169daa.tar.bz2 dexon-434e4b31d8ad2fb34b9b9a74d05cae3cd4169daa.tar.lz dexon-434e4b31d8ad2fb34b9b9a74d05cae3cd4169daa.tar.xz dexon-434e4b31d8ad2fb34b9b9a74d05cae3cd4169daa.tar.zst dexon-434e4b31d8ad2fb34b9b9a74d05cae3cd4169daa.zip |
core, eth: replace reorganiz with reorganis
Diffstat (limited to 'eth')
-rw-r--r-- | eth/downloader/downloader.go | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/eth/downloader/downloader.go b/eth/downloader/downloader.go index 9fa82d486..f50a71cf1 100644 --- a/eth/downloader/downloader.go +++ b/eth/downloader/downloader.go @@ -534,7 +534,7 @@ func (d *Downloader) fetchHeight61(p *peer) (uint64, error) { // findAncestor61 tries to locate the common ancestor block of the local chain and // a remote peers blockchain. In the general case when our node was in sync and // on the correct chain, checking the top N blocks should already get us a match. -// In the rare scenario when we ended up on a long reorganization (i.e. none of +// In the rare scenario when we ended up on a long reorganisation (i.e. none of // the head blocks match), we do a binary search to find the common ancestor. func (d *Downloader) findAncestor61(p *peer) (uint64, error) { glog.V(logger.Debug).Infof("%v: looking for common ancestor", p) @@ -960,7 +960,7 @@ func (d *Downloader) fetchHeight(p *peer) (uint64, error) { // findAncestor tries to locate the common ancestor link of the local chain and // a remote peers blockchain. In the general case when our node was in sync and // on the correct chain, checking the top N links should already get us a match. -// In the rare scenario when we ended up on a long reorganization (i.e. none of +// In the rare scenario when we ended up on a long reorganisation (i.e. none of // the head links match), we do a binary search to find the common ancestor. func (d *Downloader) findAncestor(p *peer) (uint64, error) { glog.V(logger.Debug).Infof("%v: looking for common ancestor", p) |