Compare commits

...

4 Commits

Author SHA1 Message Date
Shivanth MP a1ce2cece1
Merge 58d00f50d7 into 76b74e25d5 2024-11-22 09:40:13 +01:00
Ivan Goncharov 76b74e25d5
fix: add very small delay between observations to make test more realistic (and faster) (#1691) 2024-11-20 14:47:38 +01:00
Shivanth 58d00f50d7 Remove unused variable 2024-11-17 20:33:48 +01:00
Shivanth 8b1189b8a7 Add exemplars for native histograms 2024-11-17 20:29:39 +01:00
2 changed files with 4 additions and 0 deletions

View File

@ -382,6 +382,7 @@ func TestHistogramAtomicObserve(t *testing.T) {
return return
default: default:
his.Observe(1) his.Observe(1)
time.Sleep(time.Nanosecond)
} }
} }
} }

View File

@ -186,6 +186,9 @@ func (m *withExemplarsMetric) Write(pb *dto.Metric) error {
case pb.Counter != nil: case pb.Counter != nil:
pb.Counter.Exemplar = m.exemplars[len(m.exemplars)-1] pb.Counter.Exemplar = m.exemplars[len(m.exemplars)-1]
case pb.Histogram != nil: case pb.Histogram != nil:
if *pb.Histogram.Schema > math.MinInt32 {
pb.Histogram.Exemplars = append(pb.Histogram.Exemplars, m.exemplars...)
}
for _, e := range m.exemplars { for _, e := range m.exemplars {
// pb.Histogram.Bucket are sorted by UpperBound. // pb.Histogram.Bucket are sorted by UpperBound.
i := sort.Search(len(pb.Histogram.Bucket), func(i int) bool { i := sort.Search(len(pb.Histogram.Bucket), func(i int) bool {