|
@@ -17,7 +17,6 @@
|
|
|
package trie
|
|
package trie
|
|
|
|
|
|
|
|
import (
|
|
import (
|
|
|
- "encoding/binary"
|
|
|
|
|
"errors"
|
|
"errors"
|
|
|
"fmt"
|
|
"fmt"
|
|
|
"io"
|
|
"io"
|
|
@@ -272,19 +271,6 @@ func expandNode(hash hashNode, n node) node {
|
|
|
}
|
|
}
|
|
|
}
|
|
}
|
|
|
|
|
|
|
|
-// trienodeHasher is a struct to be used with BigCache, which uses a Hasher to
|
|
|
|
|
-// determine which shard to place an entry into. It's not a cryptographic hash,
|
|
|
|
|
-// just to provide a bit of anti-collision (default is FNV64a).
|
|
|
|
|
-//
|
|
|
|
|
-// Since trie keys are already hashes, we can just use the key directly to
|
|
|
|
|
-// map shard id.
|
|
|
|
|
-type trienodeHasher struct{}
|
|
|
|
|
-
|
|
|
|
|
-// Sum64 implements the bigcache.Hasher interface.
|
|
|
|
|
-func (t trienodeHasher) Sum64(key string) uint64 {
|
|
|
|
|
- return binary.BigEndian.Uint64([]byte(key))
|
|
|
|
|
-}
|
|
|
|
|
-
|
|
|
|
|
// NewDatabase creates a new trie database to store ephemeral trie content before
|
|
// NewDatabase creates a new trie database to store ephemeral trie content before
|
|
|
// its written out to disk or garbage collected. No read cache is created, so all
|
|
// its written out to disk or garbage collected. No read cache is created, so all
|
|
|
// data retrievals will hit the underlying disk database.
|
|
// data retrievals will hit the underlying disk database.
|