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.
121 lines
3.4 KiB
121 lines
3.4 KiB
// Copyright 2017 The Prometheus 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 labels
|
|
|
|
import (
|
|
"regexp"
|
|
"strings"
|
|
)
|
|
|
|
// Selector holds constraints for matching against a label set.
|
|
type Selector []Matcher
|
|
|
|
// Matches returns whether the labels satisfy all matchers.
|
|
func (s Selector) Matches(labels Labels) bool {
|
|
for _, m := range s {
|
|
if v := labels.Get(m.Name()); !m.Matches(v) {
|
|
return false
|
|
}
|
|
}
|
|
return true
|
|
}
|
|
|
|
// Matcher specifies a constraint for the value of a label.
|
|
type Matcher interface {
|
|
// Name returns the label name the matcher should apply to.
|
|
Name() string
|
|
// Matches checks whether a value fulfills the constraints.
|
|
Matches(v string) bool
|
|
}
|
|
|
|
// EqualMatcher matches on equality.
|
|
type EqualMatcher struct {
|
|
name, value string
|
|
}
|
|
|
|
// Name implements Matcher interface.
|
|
func (m *EqualMatcher) Name() string { return m.name }
|
|
|
|
// Matches implements Matcher interface.
|
|
func (m *EqualMatcher) Matches(v string) bool { return v == m.value }
|
|
|
|
// Value returns the matched value.
|
|
func (m *EqualMatcher) Value() string { return m.value }
|
|
|
|
// NewEqualMatcher returns a new matcher matching an exact label value.
|
|
func NewEqualMatcher(name, value string) Matcher {
|
|
return &EqualMatcher{name: name, value: value}
|
|
}
|
|
|
|
type regexpMatcher struct {
|
|
name string
|
|
re *regexp.Regexp
|
|
}
|
|
|
|
func (m *regexpMatcher) Name() string { return m.name }
|
|
func (m *regexpMatcher) Matches(v string) bool { return m.re.MatchString(v) }
|
|
|
|
// NewRegexpMatcher returns a new matcher verifying that a value matches
|
|
// the regular expression pattern.
|
|
func NewRegexpMatcher(name, pattern string) (Matcher, error) {
|
|
re, err := regexp.Compile(pattern)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
return ®expMatcher{name: name, re: re}, nil
|
|
}
|
|
|
|
// NewRegexpMatcher returns a new matcher verifying that a value matches
|
|
// the regular expression pattern. Will panic if the pattern is not a valid
|
|
// regular expression.
|
|
func NewMustRegexpMatcher(name, pattern string) Matcher {
|
|
re, err := regexp.Compile(pattern)
|
|
if err != nil {
|
|
panic(err)
|
|
}
|
|
return ®expMatcher{name: name, re: re}
|
|
|
|
}
|
|
|
|
// notMatcher inverts the matching result for a matcher.
|
|
type notMatcher struct {
|
|
Matcher
|
|
}
|
|
|
|
func (m *notMatcher) Matches(v string) bool { return !m.Matcher.Matches(v) }
|
|
|
|
// Not inverts the matcher's matching result.
|
|
func Not(m Matcher) Matcher {
|
|
return ¬Matcher{m}
|
|
}
|
|
|
|
// PrefixMatcher implements Matcher for labels which values matches prefix.
|
|
type PrefixMatcher struct {
|
|
name, prefix string
|
|
}
|
|
|
|
// NewPrefixMatcher returns new Matcher for label name matching prefix.
|
|
func NewPrefixMatcher(name, prefix string) Matcher {
|
|
return &PrefixMatcher{name: name, prefix: prefix}
|
|
}
|
|
|
|
// Name implements Matcher interface.
|
|
func (m *PrefixMatcher) Name() string { return m.name }
|
|
|
|
// Prefix returns matching prefix.
|
|
func (m *PrefixMatcher) Prefix() string { return m.prefix }
|
|
|
|
// Matches implements Matcher interface.
|
|
func (m *PrefixMatcher) Matches(v string) bool { return strings.HasPrefix(v, m.prefix) }
|