-
Notifications
You must be signed in to change notification settings - Fork 661
/
short_set.go
119 lines (104 loc) · 2.35 KB
/
short_set.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
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
// (c) 2019-2020, Ava Labs, Inc. All rights reserved.
// See the file LICENSE for licensing terms.
package ids
import "strings"
const (
minShortSetSize = 16
)
// ShortSet is a set of ShortIDs
type ShortSet map[ShortID]bool
func (ids *ShortSet) init(size int) {
if *ids == nil {
if minShortSetSize > size {
size = minShortSetSize
}
*ids = make(map[ShortID]bool, size)
}
}
// Add all the ids to this set, if the id is already in the set, nothing happens
func (ids *ShortSet) Add(idList ...ShortID) {
ids.init(2 * len(idList))
for _, id := range idList {
(*ids)[id] = true
}
}
// Union adds all the ids from the provided sets to this set.
func (ids *ShortSet) Union(idSet ShortSet) {
ids.init(2 * idSet.Len())
for id := range idSet {
(*ids)[id] = true
}
}
// Contains returns true if the set contains this id, false otherwise
func (ids *ShortSet) Contains(id ShortID) bool {
ids.init(1)
return (*ids)[id]
}
// Len returns the number of ids in this set
func (ids ShortSet) Len() int { return len(ids) }
// Remove all the id from this set, if the id isn't in the set, nothing happens
func (ids *ShortSet) Remove(idList ...ShortID) {
ids.init(1)
for _, id := range idList {
delete(*ids, id)
}
}
// Clear empties this set
func (ids *ShortSet) Clear() { *ids = nil }
// CappedList returns a list of length at most [size].
// Size should be >= 0. If size < 0, returns nil.
func (ids ShortSet) CappedList(size int) []ShortID {
if size < 0 {
return nil
}
if l := ids.Len(); l < size {
size = l
}
i := 0
idList := make([]ShortID, size)
for id := range ids {
if i >= size {
break
}
idList[i] = id
i++
}
return idList
}
// List converts this set into a list
func (ids ShortSet) List() []ShortID {
idList := make([]ShortID, len(ids))
i := 0
for id := range ids {
idList[i] = id
i++
}
return idList
}
// Equals returns true if the sets contain the same elements
func (ids ShortSet) Equals(oIDs ShortSet) bool {
if ids.Len() != oIDs.Len() {
return false
}
for key := range oIDs {
if !ids[key] {
return false
}
}
return true
}
// String returns the string representation of a set
func (ids ShortSet) String() string {
sb := strings.Builder{}
sb.WriteString("{")
first := true
for id := range ids {
if !first {
sb.WriteString(", ")
}
first = false
sb.WriteString(id.String())
}
sb.WriteString("}")
return sb.String()
}