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.
209 lines
5.1 KiB
209 lines
5.1 KiB
// Copyright 2022 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 histogram |
|
|
|
import ( |
|
"math" |
|
"testing" |
|
|
|
"github.com/stretchr/testify/require" |
|
"golang.org/x/exp/slices" |
|
) |
|
|
|
func TestGetBound(t *testing.T) { |
|
scenarios := []struct { |
|
idx int32 |
|
schema int32 |
|
want float64 |
|
}{ |
|
{ |
|
idx: -1, |
|
schema: -1, |
|
want: 0.25, |
|
}, |
|
{ |
|
idx: 0, |
|
schema: -1, |
|
want: 1, |
|
}, |
|
{ |
|
idx: 1, |
|
schema: -1, |
|
want: 4, |
|
}, |
|
{ |
|
idx: 512, |
|
schema: -1, |
|
want: math.MaxFloat64, |
|
}, |
|
{ |
|
idx: 513, |
|
schema: -1, |
|
want: math.Inf(+1), |
|
}, |
|
{ |
|
idx: -1, |
|
schema: 0, |
|
want: 0.5, |
|
}, |
|
{ |
|
idx: 0, |
|
schema: 0, |
|
want: 1, |
|
}, |
|
{ |
|
idx: 1, |
|
schema: 0, |
|
want: 2, |
|
}, |
|
{ |
|
idx: 1024, |
|
schema: 0, |
|
want: math.MaxFloat64, |
|
}, |
|
{ |
|
idx: 1025, |
|
schema: 0, |
|
want: math.Inf(+1), |
|
}, |
|
{ |
|
idx: -1, |
|
schema: 2, |
|
want: 0.8408964152537144, |
|
}, |
|
{ |
|
idx: 0, |
|
schema: 2, |
|
want: 1, |
|
}, |
|
{ |
|
idx: 1, |
|
schema: 2, |
|
want: 1.189207115002721, |
|
}, |
|
{ |
|
idx: 4096, |
|
schema: 2, |
|
want: math.MaxFloat64, |
|
}, |
|
{ |
|
idx: 4097, |
|
schema: 2, |
|
want: math.Inf(+1), |
|
}, |
|
} |
|
|
|
for _, s := range scenarios { |
|
got := getBound(s.idx, s.schema) |
|
if s.want != got { |
|
require.Equal(t, s.want, got, "idx %d, schema %d", s.idx, s.schema) |
|
} |
|
} |
|
} |
|
|
|
func TestReduceResolutionHistogram(t *testing.T) { |
|
cases := []struct { |
|
spans []Span |
|
buckets []int64 |
|
schema int32 |
|
targetSchema int32 |
|
expectedSpans []Span |
|
expectedBuckets []int64 |
|
}{ |
|
{ |
|
spans: []Span{ |
|
{Offset: 0, Length: 4}, |
|
{Offset: 0, Length: 0}, |
|
{Offset: 3, Length: 2}, |
|
}, |
|
buckets: []int64{1, 2, -2, 1, -1, 0}, |
|
schema: 0, |
|
targetSchema: -1, |
|
expectedSpans: []Span{ |
|
{Offset: 0, Length: 3}, |
|
{Offset: 1, Length: 1}, |
|
}, |
|
expectedBuckets: []int64{1, 3, -2, 0}, |
|
// schema 0, base 2 { (0.5, 1]:1 (1,2]:3, (2,4]:1, (4,8]:2, (8,16]:0, (16,32]:0, (32,64]:0, (64,128]:1, (128,256]:1}", |
|
// schema 1, base 4 { (0.25, 1):1 (1,4]:4, (4,16]:2, (16,64]:0, (64,256]:2} |
|
}, |
|
} |
|
|
|
for _, tc := range cases { |
|
spansCopy, bucketsCopy := slices.Clone(tc.spans), slices.Clone(tc.buckets) |
|
spans, buckets := reduceResolution(tc.spans, tc.buckets, tc.schema, tc.targetSchema, true, false) |
|
require.Equal(t, tc.expectedSpans, spans) |
|
require.Equal(t, tc.expectedBuckets, buckets) |
|
// Verify inputs were not mutated: |
|
require.Equal(t, spansCopy, tc.spans) |
|
require.Equal(t, bucketsCopy, tc.buckets) |
|
|
|
// Output slices reuse input slices: |
|
const inplace = true |
|
spans, buckets = reduceResolution(tc.spans, tc.buckets, tc.schema, tc.targetSchema, true, inplace) |
|
require.Equal(t, tc.expectedSpans, spans) |
|
require.Equal(t, tc.expectedBuckets, buckets) |
|
// Verify inputs were mutated which is now expected: |
|
require.Equal(t, spans, tc.spans[:len(spans)]) |
|
require.Equal(t, buckets, tc.buckets[:len(buckets)]) |
|
} |
|
} |
|
|
|
func TestReduceResolutionFloatHistogram(t *testing.T) { |
|
cases := []struct { |
|
spans []Span |
|
buckets []float64 |
|
schema int32 |
|
targetSchema int32 |
|
expectedSpans []Span |
|
expectedBuckets []float64 |
|
}{ |
|
{ |
|
spans: []Span{ |
|
{Offset: 0, Length: 4}, |
|
{Offset: 0, Length: 0}, |
|
{Offset: 3, Length: 2}, |
|
}, |
|
buckets: []float64{1, 3, 1, 2, 1, 1}, |
|
schema: 0, |
|
targetSchema: -1, |
|
expectedSpans: []Span{ |
|
{Offset: 0, Length: 3}, |
|
{Offset: 1, Length: 1}, |
|
}, |
|
expectedBuckets: []float64{1, 4, 2, 2}, |
|
// schema 0, base 2 { (0.5, 1]:1 (1,2]:3, (2,4]:1, (4,8]:2, (8,16]:0, (16,32]:0, (32,64]:0, (64,128]:1, (128,256]:1}", |
|
// schema 1, base 4 { (0.25, 1):1 (1,4]:4, (4,16]:2, (16,64]:0, (64,256]:2} |
|
}, |
|
} |
|
|
|
for _, tc := range cases { |
|
spansCopy, bucketsCopy := slices.Clone(tc.spans), slices.Clone(tc.buckets) |
|
spans, buckets := reduceResolution(tc.spans, tc.buckets, tc.schema, tc.targetSchema, false, false) |
|
require.Equal(t, tc.expectedSpans, spans) |
|
require.Equal(t, tc.expectedBuckets, buckets) |
|
// Verify inputs were not mutated: |
|
require.Equal(t, spansCopy, tc.spans) |
|
require.Equal(t, bucketsCopy, tc.buckets) |
|
|
|
// Output slices reuse input slices: |
|
const inplace = true |
|
spans, buckets = reduceResolution(tc.spans, tc.buckets, tc.schema, tc.targetSchema, false, inplace) |
|
require.Equal(t, tc.expectedSpans, spans) |
|
require.Equal(t, tc.expectedBuckets, buckets) |
|
// Verify inputs were mutated which is now expected: |
|
require.Equal(t, spans, tc.spans[:len(spans)]) |
|
require.Equal(t, buckets, tc.buckets[:len(buckets)]) |
|
} |
|
}
|
|
|