119 lines
2.7 KiB
Go
119 lines
2.7 KiB
Go
/*
|
|
Copyright 2016 The Kubernetes Authors.
|
|
|
|
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 sets
|
|
|
|
import (
|
|
"net"
|
|
"strings"
|
|
)
|
|
|
|
type IPNet map[string]*net.IPNet
|
|
|
|
func ParseIPNets(specs ...string) (IPNet, error) {
|
|
ipnetset := make(IPNet)
|
|
for _, spec := range specs {
|
|
spec = strings.TrimSpace(spec)
|
|
_, ipnet, err := net.ParseCIDR(spec)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
k := ipnet.String() // In case of normalization
|
|
ipnetset[k] = ipnet
|
|
}
|
|
return ipnetset, nil
|
|
}
|
|
|
|
// Insert adds items to the set.
|
|
func (s IPNet) Insert(items ...*net.IPNet) {
|
|
for _, item := range items {
|
|
s[item.String()] = item
|
|
}
|
|
}
|
|
|
|
// Delete removes all items from the set.
|
|
func (s IPNet) Delete(items ...*net.IPNet) {
|
|
for _, item := range items {
|
|
delete(s, item.String())
|
|
}
|
|
}
|
|
|
|
// Has returns true if and only if item is contained in the set.
|
|
func (s IPNet) Has(item *net.IPNet) bool {
|
|
_, contained := s[item.String()]
|
|
return contained
|
|
}
|
|
|
|
// HasAll returns true if and only if all items are contained in the set.
|
|
func (s IPNet) HasAll(items ...*net.IPNet) bool {
|
|
for _, item := range items {
|
|
if !s.Has(item) {
|
|
return false
|
|
}
|
|
}
|
|
return true
|
|
}
|
|
|
|
// Difference returns a set of objects that are not in s2
|
|
// For example:
|
|
// s1 = {a1, a2, a3}
|
|
// s2 = {a1, a2, a4, a5}
|
|
// s1.Difference(s2) = {a3}
|
|
// s2.Difference(s1) = {a4, a5}
|
|
func (s IPNet) Difference(s2 IPNet) IPNet {
|
|
result := make(IPNet)
|
|
for k, i := range s {
|
|
_, found := s2[k]
|
|
if found {
|
|
continue
|
|
}
|
|
result[k] = i
|
|
}
|
|
return result
|
|
}
|
|
|
|
// StringSlice returns a []string with the String representation of each element in the set.
|
|
// Order is undefined.
|
|
func (s IPNet) StringSlice() []string {
|
|
a := make([]string, 0, len(s))
|
|
for k := range s {
|
|
a = append(a, k)
|
|
}
|
|
return a
|
|
}
|
|
|
|
// IsSuperset returns true if and only if s1 is a superset of s2.
|
|
func (s1 IPNet) IsSuperset(s2 IPNet) bool {
|
|
for k := range s2 {
|
|
_, found := s1[k]
|
|
if !found {
|
|
return false
|
|
}
|
|
}
|
|
return true
|
|
}
|
|
|
|
// Equal returns true if and only if s1 is equal (as a set) to s2.
|
|
// Two sets are equal if their membership is identical.
|
|
// (In practice, this means same elements, order doesn't matter)
|
|
func (s1 IPNet) Equal(s2 IPNet) bool {
|
|
return len(s1) == len(s2) && s1.IsSuperset(s2)
|
|
}
|
|
|
|
// Len returns the size of the set.
|
|
func (s IPNet) Len() int {
|
|
return len(s)
|
|
}
|