mirror of https://github.com/poanetwork/quorum.git
55 lines
1.0 KiB
Go
55 lines
1.0 KiB
Go
package trie
|
|
|
|
import "github.com/ethereum/go-ethereum/logger/glog"
|
|
|
|
type Backend interface {
|
|
Get([]byte) ([]byte, error)
|
|
Put([]byte, []byte) error
|
|
}
|
|
|
|
type Cache struct {
|
|
store map[string][]byte
|
|
backend Backend
|
|
}
|
|
|
|
func NewCache(backend Backend) *Cache {
|
|
return &Cache{make(map[string][]byte), backend}
|
|
}
|
|
|
|
func (self *Cache) Get(key []byte) []byte {
|
|
data := self.store[string(key)]
|
|
if data == nil {
|
|
data, _ = self.backend.Get(key)
|
|
}
|
|
|
|
return data
|
|
}
|
|
|
|
func (self *Cache) Put(key []byte, data []byte) {
|
|
self.store[string(key)] = data
|
|
}
|
|
|
|
func (self *Cache) Flush() {
|
|
for k, v := range self.store {
|
|
if err := self.backend.Put([]byte(k), v); err != nil {
|
|
glog.Fatal("db write err:", err)
|
|
}
|
|
}
|
|
|
|
// This will eventually grow too large. We'd could
|
|
// do a make limit on storage and push out not-so-popular nodes.
|
|
//self.Reset()
|
|
}
|
|
|
|
func (self *Cache) Copy() *Cache {
|
|
cache := NewCache(self.backend)
|
|
for k, v := range self.store {
|
|
cache.store[k] = v
|
|
}
|
|
return cache
|
|
}
|
|
|
|
func (self *Cache) Reset() {
|
|
//self.store = make(map[string][]byte)
|
|
}
|