mirror of
https://github.com/open-telemetry/opentelemetry-go.git
synced 2024-12-14 10:13:10 +02:00
e06c9da916
Co-authored-by: Tyler Yahn <MrAlias@users.noreply.github.com>
251 lines
7.0 KiB
Go
251 lines
7.0 KiB
Go
// Copyright The OpenTelemetry 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_test
|
|
|
|
import (
|
|
"math"
|
|
"math/rand"
|
|
"sort"
|
|
"testing"
|
|
|
|
"github.com/stretchr/testify/require"
|
|
|
|
"go.opentelemetry.io/otel/api/metric"
|
|
"go.opentelemetry.io/otel/sdk/metric/aggregator/aggregatortest"
|
|
"go.opentelemetry.io/otel/sdk/metric/aggregator/histogram"
|
|
)
|
|
|
|
const count = 100
|
|
|
|
type policy struct {
|
|
name string
|
|
absolute bool
|
|
sign func() int
|
|
}
|
|
|
|
var (
|
|
positiveOnly = policy{
|
|
name: "absolute",
|
|
absolute: true,
|
|
sign: func() int { return +1 },
|
|
}
|
|
negativeOnly = policy{
|
|
name: "negative",
|
|
absolute: false,
|
|
sign: func() int { return -1 },
|
|
}
|
|
positiveAndNegative = policy{
|
|
name: "positiveAndNegative",
|
|
absolute: false,
|
|
sign: func() int {
|
|
if rand.Uint32() > math.MaxUint32/2 {
|
|
return -1
|
|
}
|
|
return 1
|
|
},
|
|
}
|
|
|
|
boundaries = []float64{500, 250, 750}
|
|
)
|
|
|
|
func new2(desc *metric.Descriptor) (_, _ *histogram.Aggregator) {
|
|
alloc := histogram.New(2, desc, boundaries)
|
|
return &alloc[0], &alloc[1]
|
|
}
|
|
|
|
func new4(desc *metric.Descriptor) (_, _, _, _ *histogram.Aggregator) {
|
|
alloc := histogram.New(4, desc, boundaries)
|
|
return &alloc[0], &alloc[1], &alloc[2], &alloc[3]
|
|
}
|
|
|
|
func checkZero(t *testing.T, agg *histogram.Aggregator, desc *metric.Descriptor) {
|
|
asum, err := agg.Sum()
|
|
require.Equal(t, metric.Number(0), asum, "Empty checkpoint sum = 0")
|
|
require.NoError(t, err)
|
|
|
|
count, err := agg.Count()
|
|
require.Equal(t, int64(0), count, "Empty checkpoint count = 0")
|
|
require.NoError(t, err)
|
|
|
|
buckets, err := agg.Histogram()
|
|
require.NoError(t, err)
|
|
|
|
require.Equal(t, len(buckets.Counts), len(boundaries)+1, "There should be b + 1 counts, where b is the number of boundaries")
|
|
for i, bCount := range buckets.Counts {
|
|
require.Equal(t, uint64(0), uint64(bCount), "Bucket #%d must have 0 observed values", i)
|
|
}
|
|
|
|
}
|
|
|
|
func TestHistogramAbsolute(t *testing.T) {
|
|
aggregatortest.RunProfiles(t, func(t *testing.T, profile aggregatortest.Profile) {
|
|
testHistogram(t, profile, positiveOnly)
|
|
})
|
|
}
|
|
|
|
func TestHistogramNegativeOnly(t *testing.T) {
|
|
aggregatortest.RunProfiles(t, func(t *testing.T, profile aggregatortest.Profile) {
|
|
testHistogram(t, profile, negativeOnly)
|
|
})
|
|
}
|
|
|
|
func TestHistogramPositiveAndNegative(t *testing.T) {
|
|
aggregatortest.RunProfiles(t, func(t *testing.T, profile aggregatortest.Profile) {
|
|
testHistogram(t, profile, positiveAndNegative)
|
|
})
|
|
}
|
|
|
|
// Validates count, sum and buckets for a given profile and policy
|
|
func testHistogram(t *testing.T, profile aggregatortest.Profile, policy policy) {
|
|
descriptor := aggregatortest.NewAggregatorTest(metric.ValueRecorderKind, profile.NumberKind)
|
|
|
|
agg, ckpt := new2(descriptor)
|
|
|
|
all := aggregatortest.NewNumbers(profile.NumberKind)
|
|
|
|
for i := 0; i < count; i++ {
|
|
x := profile.Random(policy.sign())
|
|
all.Append(x)
|
|
aggregatortest.CheckedUpdate(t, agg, x, descriptor)
|
|
}
|
|
|
|
require.NoError(t, agg.SynchronizedMove(ckpt, descriptor))
|
|
|
|
checkZero(t, agg, descriptor)
|
|
|
|
all.Sort()
|
|
|
|
asum, err := ckpt.Sum()
|
|
sum := all.Sum()
|
|
require.InEpsilon(t,
|
|
sum.CoerceToFloat64(profile.NumberKind),
|
|
asum.CoerceToFloat64(profile.NumberKind),
|
|
0.000000001,
|
|
"Same sum - "+policy.name)
|
|
require.NoError(t, err)
|
|
|
|
count, err := ckpt.Count()
|
|
require.Equal(t, all.Count(), count, "Same count -"+policy.name)
|
|
require.NoError(t, err)
|
|
|
|
buckets, err := ckpt.Histogram()
|
|
require.NoError(t, err)
|
|
|
|
require.Equal(t, len(buckets.Counts), len(boundaries)+1, "There should be b + 1 counts, where b is the number of boundaries")
|
|
|
|
counts := calcBuckets(all.Points(), profile)
|
|
for i, v := range counts {
|
|
bCount := uint64(buckets.Counts[i])
|
|
require.Equal(t, v, bCount, "Wrong bucket #%d count: %v != %v", i, counts, buckets.Counts)
|
|
}
|
|
}
|
|
|
|
func TestHistogramInitial(t *testing.T) {
|
|
aggregatortest.RunProfiles(t, func(t *testing.T, profile aggregatortest.Profile) {
|
|
descriptor := aggregatortest.NewAggregatorTest(metric.ValueRecorderKind, profile.NumberKind)
|
|
|
|
agg := &histogram.New(1, descriptor, boundaries)[0]
|
|
buckets, err := agg.Histogram()
|
|
|
|
require.NoError(t, err)
|
|
require.Equal(t, len(buckets.Counts), len(boundaries)+1)
|
|
require.Equal(t, len(buckets.Boundaries), len(boundaries))
|
|
})
|
|
}
|
|
|
|
func TestHistogramMerge(t *testing.T) {
|
|
aggregatortest.RunProfiles(t, func(t *testing.T, profile aggregatortest.Profile) {
|
|
descriptor := aggregatortest.NewAggregatorTest(metric.ValueRecorderKind, profile.NumberKind)
|
|
|
|
agg1, agg2, ckpt1, ckpt2 := new4(descriptor)
|
|
|
|
all := aggregatortest.NewNumbers(profile.NumberKind)
|
|
|
|
for i := 0; i < count; i++ {
|
|
x := profile.Random(+1)
|
|
all.Append(x)
|
|
aggregatortest.CheckedUpdate(t, agg1, x, descriptor)
|
|
}
|
|
for i := 0; i < count; i++ {
|
|
x := profile.Random(+1)
|
|
all.Append(x)
|
|
aggregatortest.CheckedUpdate(t, agg2, x, descriptor)
|
|
}
|
|
|
|
require.NoError(t, agg1.SynchronizedMove(ckpt1, descriptor))
|
|
require.NoError(t, agg2.SynchronizedMove(ckpt2, descriptor))
|
|
|
|
aggregatortest.CheckedMerge(t, ckpt1, ckpt2, descriptor)
|
|
|
|
all.Sort()
|
|
|
|
asum, err := ckpt1.Sum()
|
|
sum := all.Sum()
|
|
require.InEpsilon(t,
|
|
sum.CoerceToFloat64(profile.NumberKind),
|
|
asum.CoerceToFloat64(profile.NumberKind),
|
|
0.000000001,
|
|
"Same sum - absolute")
|
|
require.NoError(t, err)
|
|
|
|
count, err := ckpt1.Count()
|
|
require.Equal(t, all.Count(), count, "Same count - absolute")
|
|
require.NoError(t, err)
|
|
|
|
buckets, err := ckpt1.Histogram()
|
|
require.NoError(t, err)
|
|
|
|
require.Equal(t, len(buckets.Counts), len(boundaries)+1, "There should be b + 1 counts, where b is the number of boundaries")
|
|
|
|
counts := calcBuckets(all.Points(), profile)
|
|
for i, v := range counts {
|
|
bCount := uint64(buckets.Counts[i])
|
|
require.Equal(t, v, bCount, "Wrong bucket #%d count: %v != %v", i, counts, buckets.Counts)
|
|
}
|
|
})
|
|
}
|
|
|
|
func TestHistogramNotSet(t *testing.T) {
|
|
aggregatortest.RunProfiles(t, func(t *testing.T, profile aggregatortest.Profile) {
|
|
descriptor := aggregatortest.NewAggregatorTest(metric.ValueRecorderKind, profile.NumberKind)
|
|
|
|
agg, ckpt := new2(descriptor)
|
|
|
|
err := agg.SynchronizedMove(ckpt, descriptor)
|
|
require.NoError(t, err)
|
|
|
|
checkZero(t, agg, descriptor)
|
|
checkZero(t, ckpt, descriptor)
|
|
})
|
|
}
|
|
|
|
func calcBuckets(points []metric.Number, profile aggregatortest.Profile) []uint64 {
|
|
sortedBoundaries := make([]float64, len(boundaries))
|
|
|
|
copy(sortedBoundaries, boundaries)
|
|
sort.Float64s(sortedBoundaries)
|
|
|
|
counts := make([]uint64, len(sortedBoundaries)+1)
|
|
idx := 0
|
|
for _, p := range points {
|
|
for idx < len(sortedBoundaries) && p.CoerceToFloat64(profile.NumberKind) >= sortedBoundaries[idx] {
|
|
idx++
|
|
}
|
|
counts[idx]++
|
|
}
|
|
|
|
return counts
|
|
}
|