/
integer.go
67 lines (59 loc) · 1.75 KB
/
integer.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
// Copyright 2018 Authors of Cilium
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
package counter
import (
"sort"
)
// IntCounter tracks references for integers with an optional limiter.
//
// No threadsafety is provided within this structure, the user is expected to
// handle concurrent access to this structure if it is used from multiple
// threads.
type IntCounter map[int]int
// DeepCopy makes a new copy of the received IntCounter.
func (i IntCounter) DeepCopy() IntCounter {
result := make(IntCounter, len(i))
for k, v := range i {
result[k] = v
}
return result
}
// Add increments the reference count for the specified integer key.
func (i IntCounter) Add(key int) (changed bool) {
value, exists := i[key]
if !exists {
changed = true
}
i[key] = value + 1
return changed
}
// Delete decrements the reference count for the specified integer key.
func (i IntCounter) Delete(key int) bool {
value := i[key]
if value <= 1 {
delete(i, key)
return true
}
i[key] = value - 1
return false
}
// ToBPFData returns the keys as a slice, sorted from high to low.
func (i IntCounter) ToBPFData() []int {
result := make([]int, 0, len(i))
for key := range i {
result = append(result, key)
}
sort.Sort(sort.Reverse(sort.IntSlice(result)))
return result
}