/
lruitems.go
97 lines (81 loc) · 1.51 KB
/
lruitems.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
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
package filecache
// TODO: Dump this file for orderedmap.
import (
"container/list"
"io"
"github.com/cznic/b"
)
type Iterator interface {
Next() Iterator
Value() interface{}
}
type listElementIterator struct {
le *list.Element
}
func (me listElementIterator) Next() Iterator {
e := me.le.Next()
if e == nil {
return nil
}
return listElementIterator{e}
}
func (me listElementIterator) Value() interface{} {
return me.le.Value
}
func newLRUItems() *lruItems {
return &lruItems{b.TreeNew(func(_a, _b interface{}) int {
a := _a.(ItemInfo)
b := _b.(ItemInfo)
if a.Accessed != b.Accessed {
if a.Accessed.Before(b.Accessed) {
return -1
} else {
return 1
}
}
if a.Path == b.Path {
return 0
}
if a.Path < b.Path {
return -1
}
return 1
})}
}
// TODO: Dumps this for orderedmap.
type lruItems struct {
tree *b.Tree
}
type bEnumeratorIterator struct {
e *b.Enumerator
v ItemInfo
}
func (me bEnumeratorIterator) Next() Iterator {
_, v, err := me.e.Next()
if err == io.EOF {
return nil
}
return bEnumeratorIterator{me.e, v.(ItemInfo)}
}
func (me bEnumeratorIterator) Value() interface{} {
return me.v
}
func (me *lruItems) Front() Iterator {
e, _ := me.tree.SeekFirst()
if e == nil {
return nil
}
return bEnumeratorIterator{
e: e,
}.Next()
}
func (me *lruItems) LRU() ItemInfo {
_, v := me.tree.First()
return v.(ItemInfo)
}
func (me *lruItems) Insert(ii ItemInfo) {
me.tree.Set(ii, ii)
}
func (me *lruItems) Remove(ii ItemInfo) bool {
return me.tree.Delete(ii)
}