diff options
| author | Péter Szilágyi <peterke@gmail.com> | 2018-05-24 18:46:45 +0800 |
|---|---|---|
| committer | Péter Szilágyi <peterke@gmail.com> | 2018-05-24 18:46:45 +0800 |
| commit | d31802312a7ae1ed816daf8fe674efd42493adb1 (patch) | |
| tree | 3288b4fc2abc980f1c59f8250774498148ba07c7 | |
| parent | fbf57d53e272c2d79d4d899bb94db824678de2d5 (diff) | |
| download | dexon-d31802312a7ae1ed816daf8fe674efd42493adb1.tar.gz dexon-d31802312a7ae1ed816daf8fe674efd42493adb1.tar.zst dexon-d31802312a7ae1ed816daf8fe674efd42493adb1.zip | |
trie: cleaner logic, one less func call
| -rw-r--r-- | trie/hasher.go | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/trie/hasher.go b/trie/hasher.go index 2fc44787a..ff61e7092 100644 --- a/trie/hasher.go +++ b/trie/hasher.go @@ -196,12 +196,12 @@ func (h *hasher) store(n node, db *Database, force bool) (node, error) { if h.onleaf != nil { switch n := n.(type) { case *shortNode: - if child, ok := n.Val.(valueNode); ok { + if child, ok := n.Val.(valueNode); ok && child != nil { h.onleaf(child, hash) } case *fullNode: for i := 0; i < 16; i++ { - if child, ok := n.Children[i].(valueNode); ok { + if child, ok := n.Children[i].(valueNode); ok && child != nil { h.onleaf(child, hash) } } |