@@ -19,35 +19,35 @@ func NewCached[T cacheable]() Cache[T] {
19
19
}
20
20
}
21
21
22
- func (i * Cache [T ]) setAll (v []T ) {
23
- i .m .Lock ()
24
- defer i .m .Unlock ()
22
+ func (c * Cache [T ]) setAll (v []T ) {
23
+ c .m .Lock ()
24
+ defer c .m .Unlock ()
25
25
26
- i .items = v
26
+ c .items = v
27
27
}
28
28
29
- func (i * Cache [T ]) update (fn func (* T )) {
30
- i .m .Lock ()
31
- defer i .m .Unlock ()
29
+ func (c * Cache [T ]) update (fn func (* T )) {
30
+ c .m .Lock ()
31
+ defer c .m .Unlock ()
32
32
33
- for idx , item := range i .items {
33
+ for idx , item := range c .items {
34
34
fn (& item )
35
- i .items [idx ] = item
35
+ c .items [idx ] = item
36
36
}
37
37
}
38
38
39
- func (i * Cache [T ]) Get () []T {
40
- i .m .RLock ()
41
- defer i .m .RUnlock ()
39
+ func (c * Cache [T ]) Get () []T {
40
+ c .m .RLock ()
41
+ defer c .m .RUnlock ()
42
42
43
- return i .items
43
+ return c .items
44
44
}
45
45
46
- func (i * Cache [T ]) Find (fn func (T ) bool ) (v * T , found bool ) {
47
- i .m .RLock ()
48
- defer i .m .RUnlock ()
46
+ func (c * Cache [T ]) Find (fn func (T ) bool ) (v * T , found bool ) {
47
+ c .m .RLock ()
48
+ defer c .m .RUnlock ()
49
49
50
- for _ , item := range i .items {
50
+ for _ , item := range c .items {
51
51
if fn (item ) {
52
52
return & item , true
53
53
}
@@ -56,17 +56,17 @@ func (i *Cache[T]) Find(fn func(T) bool) (v *T, found bool) {
56
56
return nil , false
57
57
}
58
58
59
- func (i * Cache [T ]) FindByDN (dn string ) (v * T , found bool ) {
60
- return i .Find (func (v T ) bool {
59
+ func (c * Cache [T ]) FindByDN (dn string ) (v * T , found bool ) {
60
+ return c .Find (func (v T ) bool {
61
61
return v .DN () == dn
62
62
})
63
63
}
64
64
65
- func (i * Cache [T ]) Filter (fn func (T ) bool ) (v []T ) {
66
- i .m .RLock ()
67
- defer i .m .RUnlock ()
65
+ func (c * Cache [T ]) Filter (fn func (T ) bool ) (v []T ) {
66
+ c .m .RLock ()
67
+ defer c .m .RUnlock ()
68
68
69
- for _ , item := range i .items {
69
+ for _ , item := range c .items {
70
70
if fn (item ) {
71
71
v = append (v , item )
72
72
}
@@ -75,9 +75,9 @@ func (i *Cache[T]) Filter(fn func(T) bool) (v []T) {
75
75
return v
76
76
}
77
77
78
- func (i * Cache [T ]) Count () int {
79
- i .m .RLock ()
80
- defer i .m .RUnlock ()
78
+ func (c * Cache [T ]) Count () int {
79
+ c .m .RLock ()
80
+ defer c .m .RUnlock ()
81
81
82
- return len (i .items )
82
+ return len (c .items )
83
83
}
0 commit comments