123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081 |
- package store
- import (
- "container/heap"
- )
- // An TTLKeyHeap is a min-heap of TTLKeys order by expiration time
- type ttlKeyHeap struct {
- array []*node
- keyMap map[*node]int
- }
- func newTtlKeyHeap() *ttlKeyHeap {
- h := &ttlKeyHeap{keyMap: make(map[*node]int)}
- heap.Init(h)
- return h
- }
- func (h ttlKeyHeap) Len() int {
- return len(h.array)
- }
- func (h ttlKeyHeap) Less(i, j int) bool {
- return h.array[i].ExpireTime.Before(h.array[j].ExpireTime)
- }
- func (h ttlKeyHeap) Swap(i, j int) {
- // swap node
- h.array[i], h.array[j] = h.array[j], h.array[i]
- // update map
- h.keyMap[h.array[i]] = i
- h.keyMap[h.array[j]] = j
- }
- func (h *ttlKeyHeap) Push(x interface{}) {
- n, _ := x.(*node)
- h.keyMap[n] = len(h.array)
- h.array = append(h.array, n)
- }
- func (h *ttlKeyHeap) Pop() interface{} {
- old := h.array
- n := len(old)
- x := old[n-1]
- h.array = old[0 : n-1]
- delete(h.keyMap, x)
- return x
- }
- func (h *ttlKeyHeap) top() *node {
- if h.Len() != 0 {
- return h.array[0]
- }
- return nil
- }
- func (h *ttlKeyHeap) pop() *node {
- x := heap.Pop(h)
- n, _ := x.(*node)
- return n
- }
- func (h *ttlKeyHeap) push(x interface{}) {
- heap.Push(h, x)
- }
- func (h *ttlKeyHeap) update(n *node) {
- index, ok := h.keyMap[n]
- if ok {
- heap.Remove(h, index)
- heap.Push(h, n)
- }
- }
- func (h *ttlKeyHeap) remove(n *node) {
- index, ok := h.keyMap[n]
- if ok {
- heap.Remove(h, index)
- }
- }
|