forked from pingcap/tiup
-
Notifications
You must be signed in to change notification settings - Fork 0
/
any_set.go
90 lines (81 loc) · 2.05 KB
/
any_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
// Copyright 2020 PingCAP, Inc.
//
// 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,
// See the License for the specific language governing permissions and
// limitations under the License.
package set
// AnySet is a set stores interface{}
type AnySet struct {
eq func(a interface{}, b interface{}) bool
slice []interface{}
}
// NewAnySet builds a AnySet
func NewAnySet(eq func(a interface{}, b interface{}) bool, aa ...interface{}) *AnySet {
slice := []interface{}{}
out:
for _, a := range aa {
for _, b := range slice {
if eq(a, b) {
continue out
}
}
slice = append(slice, a)
}
return &AnySet{eq, slice}
}
// Exist checks whether `val` exists in `s`.
func (s *AnySet) Exist(val interface{}) bool {
for _, a := range s.slice {
if s.eq(a, val) {
return true
}
}
return false
}
// Insert inserts `val` into `s`.
func (s *AnySet) Insert(val interface{}) {
if !s.Exist(val) {
s.slice = append(s.slice, val)
}
}
// Intersection returns the intersection of two sets
func (s *AnySet) Intersection(rhs *AnySet) *AnySet {
newSet := NewAnySet(s.eq)
for elt := range rhs.slice {
if s.Exist(elt) {
newSet.Insert(elt)
}
}
return newSet
}
// Remove removes `val` from `s`
func (s *AnySet) Remove(val interface{}) {
for i, a := range s.slice {
if s.eq(a, val) {
s.slice = append(s.slice[:i], s.slice[i+1:]...)
return
}
}
}
// Difference returns the difference of two sets
func (s *AnySet) Difference(rhs *AnySet) *AnySet {
newSet := NewAnySet(s.eq)
diffSet := NewAnySet(s.eq, rhs.slice...)
for elt := range s.slice {
if !diffSet.Exist(elt) {
newSet.Insert(elt)
}
}
return newSet
}
// Slice converts the set to a slice
func (s *AnySet) Slice() []interface{} {
return append([]interface{}{}, s.slice...)
}