mirror of https://github.com/prometheus/prometheus
You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
52 lines
1.1 KiB
52 lines
1.1 KiB
// Copyright 2013 Prometheus Team |
|
// 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 utility |
|
|
|
type Set map[interface{}]bool |
|
|
|
func (s Set) Add(v interface{}) { |
|
s[v] = true |
|
} |
|
|
|
func (s Set) Remove(v interface{}) { |
|
delete(s, v) |
|
} |
|
|
|
func (s Set) Elements() []interface{} { |
|
result := make([]interface{}, 0, len(s)) |
|
|
|
for k := range s { |
|
result = append(result, k) |
|
} |
|
|
|
return result |
|
} |
|
|
|
func (s Set) Has(v interface{}) bool { |
|
_, p := s[v] |
|
|
|
return p |
|
} |
|
|
|
func (s Set) Intersection(o Set) Set { |
|
result := make(Set) |
|
|
|
for k := range s { |
|
if o.Has(k) { |
|
result[k] = true |
|
} |
|
} |
|
|
|
return result |
|
}
|
|
|