-
Notifications
You must be signed in to change notification settings - Fork 0
/
inmemory.go
52 lines (40 loc) · 876 Bytes
/
inmemory.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
package cache
import "sync"
// InMemory struct
type InMemory struct {
hash map[string][]byte
mu sync.RWMutex
}
// NewInMemory initializes in-memory structure
func NewInMemory() *InMemory {
return &InMemory{hash: make(map[string][]byte)}
}
// Get cache value
func (im *InMemory) Get(key string) ([]byte, error) {
im.mu.RLock()
defer im.mu.RUnlock()
if v, found := im.hash[key]; found {
return v, nil
}
return []byte{}, errNotFound
}
// Set cache value
func (im *InMemory) Set(key string, value []byte) error {
im.mu.Lock()
defer im.mu.Unlock()
if _, found := im.hash[key]; found {
return errAlreadyExists
}
im.hash[key] = value
return nil
}
// Remove cache value
func (im *InMemory) Remove(key string) error {
im.mu.Lock()
defer im.mu.Unlock()
if _, found := im.hash[key]; found {
delete(im.hash, key)
return nil
}
return errNotFound
}