/
set.go
103 lines (89 loc) · 1.98 KB
/
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
package dstore
import (
"sort"
"strings"
)
// StringSet is a set of strings.
type StringSet struct {
strsMap map[string]bool
strs []string
}
// NewStringSet creates StringSet.
func NewStringSet(s ...string) *StringSet {
return newStringSet(len(s), s...)
}
// NewStringSetWithCapacity ..
func NewStringSetWithCapacity(capacity int) *StringSet {
return newStringSet(capacity)
}
func newStringSet(capacity int, s ...string) *StringSet {
strsMap := make(map[string]bool, capacity)
strs := make([]string, 0, capacity)
for _, v := range s {
strsMap[v] = true
strs = append(strs, v)
}
return &StringSet{
strsMap: strsMap,
strs: strs,
}
}
// NewStringSetSplit creates StringSet for split string.
func NewStringSetSplit(s string, delim string) *StringSet {
strs := strings.Split(s, delim)
if len(strs) == 1 && strs[0] == "" {
return NewStringSet()
}
return NewStringSet(strs...)
}
// Contains returns true if set contains string.
func (s *StringSet) Contains(str string) bool {
return s.strsMap[str]
}
// Add to set.
func (s *StringSet) Add(str string) {
if s.Contains(str) {
return
}
s.strsMap[str] = true
s.strs = append(s.strs, str)
}
// AddAll to set.
func (s *StringSet) AddAll(strs []string) {
for _, str := range strs {
s.Add(str)
}
}
// Remove from set.
func (s *StringSet) Remove(str string) {
delete(s.strsMap, str)
keys := make([]string, 0, len(s.strs))
for _, k := range s.strs {
if k != str {
keys = append(keys, k)
}
}
s.strs = keys
}
// Size for set.
func (s *StringSet) Size() int {
return len(s.strs)
}
// Clear set.
func (s *StringSet) Clear() {
s.strsMap = map[string]bool{}
s.strs = []string{}
}
// Strings returns strings in set.
func (s *StringSet) Strings() []string {
// Copy to prevent caller changing s.strs
keys := make([]string, 0, len(s.strs))
keys = append(keys, s.strs...)
return keys
}
// Sorted returns strings in set, sorted.
func (s *StringSet) Sorted() []string {
strs := s.Strings()
sort.Strings(strs)
return strs
}