forked from projectcalico/libcalico-go
-
Notifications
You must be signed in to change notification settings - Fork 0
/
set.go
146 lines (123 loc) · 2.66 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
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
// Copyright (c) 2016-2017 Tigera, Inc. All rights reserved.
//
// 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 set
import (
"errors"
"reflect"
log "github.com/sirupsen/logrus"
)
type Set interface {
Len() int
Add(interface{})
AddAll(itemArray interface{})
Discard(interface{})
Clear()
Contains(interface{}) bool
Iter(func(item interface{}) error)
Copy() Set
Equals(Set) bool
ContainsAll(Set) bool
}
type empty struct{}
var emptyValue = empty{}
var (
StopIteration = errors.New("Stop iteration")
RemoveItem = errors.New("Remove item")
)
func New() Set {
return make(mapSet)
}
func From(members ...interface{}) Set {
s := New()
s.AddAll(members)
return s
}
func FromArray(membersArray interface{}) Set {
s := New()
s.AddAll(membersArray)
return s
}
func Empty() Set {
return mapSet(nil)
}
type mapSet map[interface{}]empty
func (set mapSet) Len() int {
return len(set)
}
func (set mapSet) Add(item interface{}) {
set[item] = emptyValue
}
func (set mapSet) AddAll(itemArray interface{}) {
arrVal := reflect.ValueOf(itemArray)
for i := 0; i < arrVal.Len(); i++ {
set.Add(arrVal.Index(i).Interface())
}
}
func (set mapSet) Discard(item interface{}) {
delete(set, item)
}
func (set mapSet) Clear() {
for item := range set {
delete(set, item)
}
}
func (set mapSet) Contains(item interface{}) bool {
_, present := set[item]
return present
}
func (set mapSet) Iter(visitor func(item interface{}) error) {
loop:
for item := range set {
err := visitor(item)
switch err {
case StopIteration:
break loop
case RemoveItem:
delete(set, item)
case nil:
break
default:
log.WithError(err).Panic("Unexpected iteration error")
}
}
}
func (set mapSet) Copy() Set {
cpy := New()
for item := range set {
cpy.Add(item)
}
return cpy
}
func (set mapSet) Equals(other Set) bool {
if set.Len() != other.Len() {
return false
}
for item := range set {
if !other.Contains(item) {
return false
}
}
return true
}
func (set mapSet) ContainsAll(other Set) bool {
result := true
other.Iter(func(item interface{}) error {
if !set.Contains(item) {
result = false
return StopIteration
}
return nil
})
return result
}