aboutsummaryrefslogtreecommitdiffstats
path: root/utils/merkletrie
diff options
context:
space:
mode:
authorferhat elmas <elmas.ferhat@gmail.com>2017-11-20 03:54:25 +0100
committerferhat elmas <elmas.ferhat@gmail.com>2017-11-20 03:55:01 +0100
commitd9b8691c6b137bb59ee185f69acf868a8f42b77d (patch)
tree03d8d5ef744a9df744d7f7b42674cacf12d4da18 /utils/merkletrie
parentdcec8517e203aa22f28b72e3015a4b3406d7cc62 (diff)
downloadgo-git-d9b8691c6b137bb59ee185f69acf868a8f42b77d.tar.gz
examples,plumbing,utils: typo fixes
Diffstat (limited to 'utils/merkletrie')
-rw-r--r--utils/merkletrie/difftree.go2
-rw-r--r--utils/merkletrie/iter.go2
-rw-r--r--utils/merkletrie/noder/path.go2
3 files changed, 3 insertions, 3 deletions
diff --git a/utils/merkletrie/difftree.go b/utils/merkletrie/difftree.go
index 0748865..2294096 100644
--- a/utils/merkletrie/difftree.go
+++ b/utils/merkletrie/difftree.go
@@ -54,7 +54,7 @@ package merkletrie
//
// Here is a full list of all the cases that are similar and how to
// merge them together into more general cases. Each general case
-// is labeled wiht an uppercase letter for further reference, and it
+// is labeled with an uppercase letter for further reference, and it
// is followed by the pseudocode of the checks you have to perfrom
// on both noders to see if you are in such a case, the actions to
// perform (i.e. what changes to output) and how to advance the
diff --git a/utils/merkletrie/iter.go b/utils/merkletrie/iter.go
index e3f3055..b4d4c99 100644
--- a/utils/merkletrie/iter.go
+++ b/utils/merkletrie/iter.go
@@ -198,7 +198,7 @@ func (iter *Iter) current() (noder.Path, error) {
}
// removes the current node if any, and all the frames that become empty as a
-// consecuence of this action.
+// consequence of this action.
func (iter *Iter) drop() {
frame, ok := iter.top()
if !ok {
diff --git a/utils/merkletrie/noder/path.go b/utils/merkletrie/noder/path.go
index d2e2932..e9c905c 100644
--- a/utils/merkletrie/noder/path.go
+++ b/utils/merkletrie/noder/path.go
@@ -8,7 +8,7 @@ import (
)
// Path values represent a noder and its ancestors. The root goes first
-// and the actual final noder the path is refering to will be the last.
+// and the actual final noder the path is referring to will be the last.
//
// A path implements the Noder interface, redirecting all the interface
// calls to its final noder.