2018-05-14 12:36:24 +00:00
|
|
|
// Copyright 2018 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.
|
|
|
|
|
2017-11-01 08:44:27 +00:00
|
|
|
package nflogpb
|
|
|
|
|
|
|
|
import (
|
|
|
|
"testing"
|
|
|
|
)
|
|
|
|
|
|
|
|
func TestIsFiringSubset(t *testing.T) {
|
|
|
|
e := &Entry{
|
|
|
|
FiringAlerts: []uint64{1, 2, 3},
|
|
|
|
}
|
|
|
|
|
|
|
|
tests := []struct {
|
|
|
|
subset map[uint64]struct{}
|
|
|
|
expected bool
|
|
|
|
}{
|
2022-03-25 16:59:51 +00:00
|
|
|
{newSubset(), true}, // empty subset
|
2017-11-01 08:44:27 +00:00
|
|
|
{newSubset(1), true},
|
|
|
|
{newSubset(2), true},
|
|
|
|
{newSubset(3), true},
|
|
|
|
{newSubset(1, 2), true},
|
|
|
|
{newSubset(1, 2), true},
|
|
|
|
{newSubset(1, 2, 3), true},
|
|
|
|
{newSubset(4), false},
|
|
|
|
{newSubset(1, 5), false},
|
|
|
|
{newSubset(1, 2, 3, 6), false},
|
|
|
|
}
|
|
|
|
|
|
|
|
for _, test := range tests {
|
|
|
|
if result := e.IsFiringSubset(test.subset); result != test.expected {
|
|
|
|
t.Errorf("Expected %t, got %t for subset %v", test.expected, result, elements(test.subset))
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2018-06-08 09:37:38 +00:00
|
|
|
func TestIsResolvedSubset(t *testing.T) {
|
|
|
|
e := &Entry{
|
|
|
|
ResolvedAlerts: []uint64{1, 2, 3},
|
|
|
|
}
|
|
|
|
|
|
|
|
tests := []struct {
|
|
|
|
subset map[uint64]struct{}
|
|
|
|
expected bool
|
|
|
|
}{
|
2022-03-25 16:59:51 +00:00
|
|
|
{newSubset(), true}, // empty subset
|
2018-06-08 09:37:38 +00:00
|
|
|
{newSubset(1), true},
|
|
|
|
{newSubset(2), true},
|
|
|
|
{newSubset(3), true},
|
|
|
|
{newSubset(1, 2), true},
|
|
|
|
{newSubset(1, 2), true},
|
|
|
|
{newSubset(1, 2, 3), true},
|
|
|
|
{newSubset(4), false},
|
|
|
|
{newSubset(1, 5), false},
|
|
|
|
{newSubset(1, 2, 3, 6), false},
|
|
|
|
}
|
|
|
|
|
|
|
|
for _, test := range tests {
|
|
|
|
if result := e.IsResolvedSubset(test.subset); result != test.expected {
|
|
|
|
t.Errorf("Expected %t, got %t for subset %v", test.expected, result, elements(test.subset))
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2017-11-01 08:44:27 +00:00
|
|
|
func newSubset(elements ...uint64) map[uint64]struct{} {
|
|
|
|
subset := make(map[uint64]struct{})
|
|
|
|
for _, el := range elements {
|
|
|
|
subset[el] = struct{}{}
|
|
|
|
}
|
|
|
|
|
|
|
|
return subset
|
|
|
|
}
|
|
|
|
|
|
|
|
func elements(m map[uint64]struct{}) []uint64 {
|
|
|
|
els := make([]uint64, 0, len(m))
|
2019-01-04 14:37:33 +00:00
|
|
|
for k := range m {
|
2017-11-01 08:44:27 +00:00
|
|
|
els = append(els, k)
|
|
|
|
}
|
|
|
|
|
|
|
|
return els
|
|
|
|
}
|