aboutsummaryrefslogtreecommitdiffstats
path: root/trie
diff options
context:
space:
mode:
authorPéter Szilágyi <peterke@gmail.com>2017-01-07 01:44:35 +0800
committerPéter Szilágyi <peterke@gmail.com>2017-01-07 01:44:35 +0800
commit18c77744ff4ad0bc385a4c8b50d28c2a6fde8e00 (patch)
treef346aa2c1de4c873ba7d7bf847225b2c319c5694 /trie
parentac93a6ff6cd1200ab0fb67a5bd0c02cb70646632 (diff)
downloaddexon-18c77744ff4ad0bc385a4c8b50d28c2a6fde8e00.tar.gz
dexon-18c77744ff4ad0bc385a4c8b50d28c2a6fde8e00.tar.zst
dexon-18c77744ff4ad0bc385a4c8b50d28c2a6fde8e00.zip
all: fix spelling errors
Diffstat (limited to 'trie')
-rw-r--r--trie/hasher.go2
1 files changed, 1 insertions, 1 deletions
diff --git a/trie/hasher.go b/trie/hasher.go
index e6261819c..98c309531 100644
--- a/trie/hasher.go
+++ b/trie/hasher.go
@@ -52,7 +52,7 @@ func returnHasherToPool(h *hasher) {
// hash collapses a node down into a hash node, also returning a copy of the
// original node initialzied with the computed hash to replace the original one.
func (h *hasher) hash(n node, db DatabaseWriter, force bool) (node, node, error) {
- // If we're not storing the node, just hashing, use avaialble cached data
+ // If we're not storing the node, just hashing, use available cached data
if hash, dirty := n.cache(); hash != nil {
if db == nil {
return hash, n, nil