aboutsummaryrefslogtreecommitdiffstats
path: root/ptrie/cache.go
diff options
context:
space:
mode:
Diffstat (limited to 'ptrie/cache.go')
-rw-r--r--ptrie/cache.go42
1 files changed, 0 insertions, 42 deletions
diff --git a/ptrie/cache.go b/ptrie/cache.go
deleted file mode 100644
index 721dc4cf6..000000000
--- a/ptrie/cache.go
+++ /dev/null
@@ -1,42 +0,0 @@
-package ptrie
-
-type Backend interface {
- Get([]byte) ([]byte, error)
- Put([]byte, []byte)
-}
-
-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 {
- self.backend.Put([]byte(k), v)
- }
-
- // 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) Reset() {
- self.store = make(map[string][]byte)
-}