|
| 1 | +package cachemap |
| 2 | + |
| 3 | +import ( |
| 4 | + "github.com/emirpasic/gods/lists/singlylinkedlist" |
| 5 | + "strconv" |
| 6 | + "sync" |
| 7 | +) |
| 8 | + |
| 9 | +var lock sync.RWMutex |
| 10 | + |
| 11 | +type CacheMap struct { |
| 12 | + table map[interface{}]interface{} |
| 13 | + ordering *singlylinkedlist.List |
| 14 | + orderPos map[interface{}]int |
| 15 | + maxSize int |
| 16 | +} |
| 17 | + |
| 18 | +func New(maxSize int) *CacheMap { |
| 19 | + m := &CacheMap{ |
| 20 | + table: make(map[interface{}]interface{}), |
| 21 | + ordering: singlylinkedlist.New(), |
| 22 | + orderPos: make(map[interface{}]int), |
| 23 | + maxSize: maxSize, |
| 24 | + } |
| 25 | + return m |
| 26 | +} |
| 27 | + |
| 28 | +func (m *CacheMap) Add(key interface{}, item interface{}) { |
| 29 | + lock.Lock() |
| 30 | + defer lock.Unlock() |
| 31 | + if _, contains := m.table[key]; !contains { |
| 32 | + m.removeExceeded() |
| 33 | + m.table[key] = item |
| 34 | + m.ordering.Append(key) |
| 35 | + m.orderPos[key] = m.ordering.Size() - 1 |
| 36 | + } |
| 37 | +} |
| 38 | + |
| 39 | +func (m *CacheMap) Remove(key interface{}) { |
| 40 | + lock.Lock() |
| 41 | + defer lock.Unlock() |
| 42 | + delete(m.table, key) |
| 43 | + index, contains := m.orderPos[key] |
| 44 | + if contains { |
| 45 | + m.ordering.Remove(index) |
| 46 | + delete(m.orderPos, key) |
| 47 | + } |
| 48 | +} |
| 49 | + |
| 50 | +func (m *CacheMap) removeExceeded() { |
| 51 | + for m.ordering.Size() >= m.maxSize { |
| 52 | + key, exist := m.ordering.Get(0) |
| 53 | + if exist { |
| 54 | + m.ordering.Remove(0) |
| 55 | + delete(m.orderPos, key) |
| 56 | + delete(m.table, key) |
| 57 | + } |
| 58 | + } |
| 59 | +} |
| 60 | + |
| 61 | +func (m *CacheMap) Contains(key interface{}) bool { |
| 62 | + lock.RLock() |
| 63 | + defer lock.RUnlock() |
| 64 | + if _, contains := m.table[key]; !contains { |
| 65 | + return false |
| 66 | + } |
| 67 | + return true |
| 68 | +} |
| 69 | + |
| 70 | +func (m *CacheMap) Get(key interface{}) interface{} { |
| 71 | + lock.RLock() |
| 72 | + defer lock.RUnlock() |
| 73 | + return m.table[key] |
| 74 | +} |
| 75 | + |
| 76 | +func (m *CacheMap) Empty() bool { |
| 77 | + lock.Lock() |
| 78 | + defer lock.Unlock() |
| 79 | + return m.Size() == 0 |
| 80 | +} |
| 81 | + |
| 82 | +func (m *CacheMap) Size() int { |
| 83 | + return m.ordering.Size() |
| 84 | +} |
| 85 | + |
| 86 | +func (m *CacheMap) Clear() { |
| 87 | + lock.Lock() |
| 88 | + defer lock.Unlock() |
| 89 | + m.table = make(map[interface{}]interface{}) |
| 90 | + m.ordering.Clear() |
| 91 | + m.orderPos = make(map[interface{}]int) |
| 92 | +} |
| 93 | + |
| 94 | +func (m *CacheMap) String() string { |
| 95 | + return "CacheMap[" + strconv.Itoa(m.ordering.Size()) + "]" |
| 96 | +} |
0 commit comments