2015-02-02 17:14:36 +03:00
|
|
|
// Copyright 2014 The Prometheus Authors
|
2014-05-07 22:08:33 +04:00
|
|
|
// 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 prometheus
|
|
|
|
|
|
|
|
import (
|
|
|
|
"math"
|
|
|
|
"math/rand"
|
|
|
|
"sort"
|
|
|
|
"sync"
|
|
|
|
"testing"
|
|
|
|
"testing/quick"
|
|
|
|
"time"
|
|
|
|
|
2015-02-27 18:12:59 +03:00
|
|
|
dto "github.com/prometheus/client_model/go"
|
2014-05-07 22:08:33 +04:00
|
|
|
)
|
|
|
|
|
2016-11-23 18:08:11 +03:00
|
|
|
func TestSummaryWithDefaultObjectives(t *testing.T) {
|
|
|
|
reg := NewRegistry()
|
|
|
|
summaryWithDefaultObjectives := NewSummary(SummaryOpts{
|
|
|
|
Name: "default_objectives",
|
|
|
|
Help: "Test help.",
|
|
|
|
})
|
|
|
|
if err := reg.Register(summaryWithDefaultObjectives); err != nil {
|
|
|
|
t.Error(err)
|
|
|
|
}
|
|
|
|
|
|
|
|
m := &dto.Metric{}
|
|
|
|
if err := summaryWithDefaultObjectives.Write(m); err != nil {
|
|
|
|
t.Error(err)
|
|
|
|
}
|
|
|
|
if len(m.GetSummary().Quantile) != len(DefObjectives) {
|
|
|
|
t.Error("expected default objectives in summary")
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
func TestSummaryWithoutObjectives(t *testing.T) {
|
|
|
|
reg := NewRegistry()
|
|
|
|
summaryWithEmptyObjectives := NewSummary(SummaryOpts{
|
|
|
|
Name: "empty_objectives",
|
|
|
|
Help: "Test help.",
|
|
|
|
Objectives: map[float64]float64{},
|
|
|
|
})
|
|
|
|
if err := reg.Register(summaryWithEmptyObjectives); err != nil {
|
|
|
|
t.Error(err)
|
|
|
|
}
|
2018-12-24 13:23:13 +03:00
|
|
|
summaryWithEmptyObjectives.Observe(3)
|
|
|
|
summaryWithEmptyObjectives.Observe(0.14)
|
2016-11-23 18:08:11 +03:00
|
|
|
|
|
|
|
m := &dto.Metric{}
|
|
|
|
if err := summaryWithEmptyObjectives.Write(m); err != nil {
|
|
|
|
t.Error(err)
|
|
|
|
}
|
2018-12-24 13:23:13 +03:00
|
|
|
if got, want := m.GetSummary().GetSampleSum(), 3.14; got != want {
|
|
|
|
t.Errorf("got sample sum %f, want %f", got, want)
|
|
|
|
}
|
|
|
|
if got, want := m.GetSummary().GetSampleCount(), uint64(2); got != want {
|
|
|
|
t.Errorf("got sample sum %d, want %d", got, want)
|
|
|
|
}
|
2016-11-23 18:08:11 +03:00
|
|
|
if len(m.GetSummary().Quantile) != 0 {
|
|
|
|
t.Error("expected no objectives in summary")
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2018-07-13 14:43:21 +03:00
|
|
|
func TestSummaryWithQuantileLabel(t *testing.T) {
|
|
|
|
defer func() {
|
|
|
|
if r := recover(); r == nil {
|
|
|
|
t.Error("Attempt to create Summary with 'quantile' label did not panic.")
|
|
|
|
}
|
|
|
|
}()
|
|
|
|
_ = NewSummary(SummaryOpts{
|
|
|
|
Name: "test_summary",
|
|
|
|
Help: "less",
|
|
|
|
ConstLabels: Labels{"quantile": "test"},
|
|
|
|
})
|
|
|
|
}
|
|
|
|
|
|
|
|
func TestSummaryVecWithQuantileLabel(t *testing.T) {
|
|
|
|
defer func() {
|
|
|
|
if r := recover(); r == nil {
|
|
|
|
t.Error("Attempt to create SummaryVec with 'quantile' label did not panic.")
|
|
|
|
}
|
|
|
|
}()
|
|
|
|
_ = NewSummaryVec(SummaryOpts{
|
|
|
|
Name: "test_summary",
|
|
|
|
Help: "less",
|
|
|
|
}, []string{"quantile"})
|
|
|
|
}
|
|
|
|
|
2014-05-07 22:08:33 +04:00
|
|
|
func benchmarkSummaryObserve(w int, b *testing.B) {
|
|
|
|
b.StopTimer()
|
|
|
|
|
|
|
|
wg := new(sync.WaitGroup)
|
|
|
|
wg.Add(w)
|
|
|
|
|
|
|
|
g := new(sync.WaitGroup)
|
|
|
|
g.Add(1)
|
|
|
|
|
|
|
|
s := NewSummary(SummaryOpts{})
|
|
|
|
|
|
|
|
for i := 0; i < w; i++ {
|
|
|
|
go func() {
|
|
|
|
g.Wait()
|
|
|
|
|
|
|
|
for i := 0; i < b.N; i++ {
|
|
|
|
s.Observe(float64(i))
|
|
|
|
}
|
|
|
|
|
|
|
|
wg.Done()
|
|
|
|
}()
|
|
|
|
}
|
|
|
|
|
|
|
|
b.StartTimer()
|
|
|
|
g.Done()
|
|
|
|
wg.Wait()
|
|
|
|
}
|
|
|
|
|
|
|
|
func BenchmarkSummaryObserve1(b *testing.B) {
|
|
|
|
benchmarkSummaryObserve(1, b)
|
|
|
|
}
|
|
|
|
|
|
|
|
func BenchmarkSummaryObserve2(b *testing.B) {
|
|
|
|
benchmarkSummaryObserve(2, b)
|
|
|
|
}
|
|
|
|
|
|
|
|
func BenchmarkSummaryObserve4(b *testing.B) {
|
|
|
|
benchmarkSummaryObserve(4, b)
|
|
|
|
}
|
|
|
|
|
|
|
|
func BenchmarkSummaryObserve8(b *testing.B) {
|
|
|
|
benchmarkSummaryObserve(8, b)
|
|
|
|
}
|
|
|
|
|
|
|
|
func benchmarkSummaryWrite(w int, b *testing.B) {
|
|
|
|
b.StopTimer()
|
|
|
|
|
|
|
|
wg := new(sync.WaitGroup)
|
|
|
|
wg.Add(w)
|
|
|
|
|
|
|
|
g := new(sync.WaitGroup)
|
|
|
|
g.Add(1)
|
|
|
|
|
|
|
|
s := NewSummary(SummaryOpts{})
|
|
|
|
|
|
|
|
for i := 0; i < 1000000; i++ {
|
|
|
|
s.Observe(float64(i))
|
|
|
|
}
|
|
|
|
|
|
|
|
for j := 0; j < w; j++ {
|
|
|
|
outs := make([]dto.Metric, b.N)
|
|
|
|
|
|
|
|
go func(o []dto.Metric) {
|
|
|
|
g.Wait()
|
|
|
|
|
|
|
|
for i := 0; i < b.N; i++ {
|
|
|
|
s.Write(&o[i])
|
|
|
|
}
|
|
|
|
|
|
|
|
wg.Done()
|
|
|
|
}(outs)
|
|
|
|
}
|
|
|
|
|
|
|
|
b.StartTimer()
|
|
|
|
g.Done()
|
|
|
|
wg.Wait()
|
|
|
|
}
|
|
|
|
|
|
|
|
func BenchmarkSummaryWrite1(b *testing.B) {
|
|
|
|
benchmarkSummaryWrite(1, b)
|
|
|
|
}
|
|
|
|
|
|
|
|
func BenchmarkSummaryWrite2(b *testing.B) {
|
|
|
|
benchmarkSummaryWrite(2, b)
|
|
|
|
}
|
|
|
|
|
|
|
|
func BenchmarkSummaryWrite4(b *testing.B) {
|
|
|
|
benchmarkSummaryWrite(4, b)
|
|
|
|
}
|
|
|
|
|
|
|
|
func BenchmarkSummaryWrite8(b *testing.B) {
|
|
|
|
benchmarkSummaryWrite(8, b)
|
|
|
|
}
|
|
|
|
|
|
|
|
func TestSummaryConcurrency(t *testing.T) {
|
2015-02-19 17:51:11 +03:00
|
|
|
if testing.Short() {
|
|
|
|
t.Skip("Skipping test in short mode.")
|
|
|
|
}
|
|
|
|
|
2014-05-07 22:08:33 +04:00
|
|
|
rand.Seed(42)
|
|
|
|
|
|
|
|
it := func(n uint32) bool {
|
2015-01-21 17:24:34 +03:00
|
|
|
mutations := int(n%1e4 + 1e4)
|
2015-01-21 15:44:43 +03:00
|
|
|
concLevel := int(n%5 + 1)
|
2014-05-07 22:08:33 +04:00
|
|
|
total := mutations * concLevel
|
|
|
|
|
|
|
|
var start, end sync.WaitGroup
|
|
|
|
start.Add(1)
|
|
|
|
end.Add(concLevel)
|
|
|
|
|
|
|
|
sum := NewSummary(SummaryOpts{
|
2016-11-23 18:08:11 +03:00
|
|
|
Name: "test_summary",
|
|
|
|
Help: "helpless",
|
|
|
|
Objectives: map[float64]float64{0.5: 0.05, 0.9: 0.01, 0.99: 0.001},
|
2014-05-07 22:08:33 +04:00
|
|
|
})
|
|
|
|
|
|
|
|
allVars := make([]float64, total)
|
|
|
|
var sampleSum float64
|
|
|
|
for i := 0; i < concLevel; i++ {
|
|
|
|
vals := make([]float64, mutations)
|
|
|
|
for j := 0; j < mutations; j++ {
|
|
|
|
v := rand.NormFloat64()
|
|
|
|
vals[j] = v
|
|
|
|
allVars[i*mutations+j] = v
|
|
|
|
sampleSum += v
|
|
|
|
}
|
|
|
|
|
|
|
|
go func(vals []float64) {
|
|
|
|
start.Wait()
|
|
|
|
for _, v := range vals {
|
|
|
|
sum.Observe(v)
|
|
|
|
}
|
|
|
|
end.Done()
|
|
|
|
}(vals)
|
|
|
|
}
|
|
|
|
sort.Float64s(allVars)
|
|
|
|
start.Done()
|
|
|
|
end.Wait()
|
|
|
|
|
|
|
|
m := &dto.Metric{}
|
|
|
|
sum.Write(m)
|
|
|
|
if got, want := int(*m.Summary.SampleCount), total; got != want {
|
|
|
|
t.Errorf("got sample count %d, want %d", got, want)
|
|
|
|
}
|
|
|
|
if got, want := *m.Summary.SampleSum, sampleSum; math.Abs((got-want)/want) > 0.001 {
|
|
|
|
t.Errorf("got sample sum %f, want %f", got, want)
|
|
|
|
}
|
|
|
|
|
2015-01-20 20:27:10 +03:00
|
|
|
objectives := make([]float64, 0, len(DefObjectives))
|
|
|
|
for qu := range DefObjectives {
|
|
|
|
objectives = append(objectives, qu)
|
|
|
|
}
|
|
|
|
sort.Float64s(objectives)
|
|
|
|
|
|
|
|
for i, wantQ := range objectives {
|
|
|
|
ε := DefObjectives[wantQ]
|
2014-05-07 22:08:33 +04:00
|
|
|
gotQ := *m.Summary.Quantile[i].Quantile
|
|
|
|
gotV := *m.Summary.Quantile[i].Value
|
|
|
|
min, max := getBounds(allVars, wantQ, ε)
|
|
|
|
if gotQ != wantQ {
|
|
|
|
t.Errorf("got quantile %f, want %f", gotQ, wantQ)
|
|
|
|
}
|
2015-01-20 20:27:10 +03:00
|
|
|
if gotV < min || gotV > max {
|
2014-05-07 22:08:33 +04:00
|
|
|
t.Errorf("got %f for quantile %f, want [%f,%f]", gotV, gotQ, min, max)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return true
|
|
|
|
}
|
|
|
|
|
|
|
|
if err := quick.Check(it, nil); err != nil {
|
|
|
|
t.Error(err)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
func TestSummaryVecConcurrency(t *testing.T) {
|
2015-02-19 17:51:11 +03:00
|
|
|
if testing.Short() {
|
|
|
|
t.Skip("Skipping test in short mode.")
|
|
|
|
}
|
|
|
|
|
2014-05-07 22:08:33 +04:00
|
|
|
rand.Seed(42)
|
|
|
|
|
2015-01-20 20:27:10 +03:00
|
|
|
objectives := make([]float64, 0, len(DefObjectives))
|
|
|
|
for qu := range DefObjectives {
|
2015-01-21 15:44:43 +03:00
|
|
|
|
2015-01-20 20:27:10 +03:00
|
|
|
objectives = append(objectives, qu)
|
|
|
|
}
|
|
|
|
sort.Float64s(objectives)
|
|
|
|
|
2014-05-07 22:08:33 +04:00
|
|
|
it := func(n uint32) bool {
|
2015-01-21 17:24:34 +03:00
|
|
|
mutations := int(n%1e4 + 1e4)
|
2015-01-21 15:44:43 +03:00
|
|
|
concLevel := int(n%7 + 1)
|
|
|
|
vecLength := int(n%3 + 1)
|
2014-05-07 22:08:33 +04:00
|
|
|
|
|
|
|
var start, end sync.WaitGroup
|
|
|
|
start.Add(1)
|
|
|
|
end.Add(concLevel)
|
|
|
|
|
|
|
|
sum := NewSummaryVec(
|
|
|
|
SummaryOpts{
|
2016-11-23 18:08:11 +03:00
|
|
|
Name: "test_summary",
|
|
|
|
Help: "helpless",
|
|
|
|
Objectives: map[float64]float64{0.5: 0.05, 0.9: 0.01, 0.99: 0.001},
|
2014-05-07 22:08:33 +04:00
|
|
|
},
|
|
|
|
[]string{"label"},
|
|
|
|
)
|
|
|
|
|
|
|
|
allVars := make([][]float64, vecLength)
|
|
|
|
sampleSums := make([]float64, vecLength)
|
|
|
|
for i := 0; i < concLevel; i++ {
|
|
|
|
vals := make([]float64, mutations)
|
|
|
|
picks := make([]int, mutations)
|
|
|
|
for j := 0; j < mutations; j++ {
|
|
|
|
v := rand.NormFloat64()
|
|
|
|
vals[j] = v
|
|
|
|
pick := rand.Intn(vecLength)
|
|
|
|
picks[j] = pick
|
|
|
|
allVars[pick] = append(allVars[pick], v)
|
|
|
|
sampleSums[pick] += v
|
|
|
|
}
|
|
|
|
|
|
|
|
go func(vals []float64) {
|
|
|
|
start.Wait()
|
|
|
|
for i, v := range vals {
|
|
|
|
sum.WithLabelValues(string('A' + picks[i])).Observe(v)
|
|
|
|
}
|
|
|
|
end.Done()
|
|
|
|
}(vals)
|
|
|
|
}
|
|
|
|
for _, vars := range allVars {
|
|
|
|
sort.Float64s(vars)
|
|
|
|
}
|
|
|
|
start.Done()
|
|
|
|
end.Wait()
|
|
|
|
|
|
|
|
for i := 0; i < vecLength; i++ {
|
|
|
|
m := &dto.Metric{}
|
|
|
|
s := sum.WithLabelValues(string('A' + i))
|
2017-04-24 22:13:19 +03:00
|
|
|
s.(Summary).Write(m)
|
2014-05-07 22:08:33 +04:00
|
|
|
if got, want := int(*m.Summary.SampleCount), len(allVars[i]); got != want {
|
|
|
|
t.Errorf("got sample count %d for label %c, want %d", got, 'A'+i, want)
|
|
|
|
}
|
|
|
|
if got, want := *m.Summary.SampleSum, sampleSums[i]; math.Abs((got-want)/want) > 0.001 {
|
|
|
|
t.Errorf("got sample sum %f for label %c, want %f", got, 'A'+i, want)
|
|
|
|
}
|
2015-01-20 20:27:10 +03:00
|
|
|
for j, wantQ := range objectives {
|
|
|
|
ε := DefObjectives[wantQ]
|
2014-05-07 22:08:33 +04:00
|
|
|
gotQ := *m.Summary.Quantile[j].Quantile
|
|
|
|
gotV := *m.Summary.Quantile[j].Value
|
|
|
|
min, max := getBounds(allVars[i], wantQ, ε)
|
|
|
|
if gotQ != wantQ {
|
|
|
|
t.Errorf("got quantile %f for label %c, want %f", gotQ, 'A'+i, wantQ)
|
|
|
|
}
|
2015-01-20 20:27:10 +03:00
|
|
|
if gotV < min || gotV > max {
|
2014-05-07 22:08:33 +04:00
|
|
|
t.Errorf("got %f for quantile %f for label %c, want [%f,%f]", gotV, gotQ, 'A'+i, min, max)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return true
|
|
|
|
}
|
|
|
|
|
|
|
|
if err := quick.Check(it, nil); err != nil {
|
|
|
|
t.Error(err)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2015-01-21 15:44:43 +03:00
|
|
|
func TestSummaryDecay(t *testing.T) {
|
2015-03-15 15:58:14 +03:00
|
|
|
if testing.Short() {
|
|
|
|
t.Skip("Skipping test in short mode.")
|
|
|
|
// More because it depends on timing than because it is particularly long...
|
|
|
|
}
|
|
|
|
|
2014-05-07 22:08:33 +04:00
|
|
|
sum := NewSummary(SummaryOpts{
|
|
|
|
Name: "test_summary",
|
|
|
|
Help: "helpless",
|
2015-01-21 15:44:43 +03:00
|
|
|
MaxAge: 100 * time.Millisecond,
|
2015-01-20 20:27:10 +03:00
|
|
|
Objectives: map[float64]float64{0.1: 0.001},
|
2015-01-21 15:44:43 +03:00
|
|
|
AgeBuckets: 10,
|
2014-05-07 22:08:33 +04:00
|
|
|
})
|
|
|
|
|
|
|
|
m := &dto.Metric{}
|
|
|
|
i := 0
|
2015-01-21 15:44:43 +03:00
|
|
|
tick := time.NewTicker(time.Millisecond)
|
2016-09-16 20:59:04 +03:00
|
|
|
for range tick.C {
|
2014-05-07 22:08:33 +04:00
|
|
|
i++
|
|
|
|
sum.Observe(float64(i))
|
|
|
|
if i%10 == 0 {
|
|
|
|
sum.Write(m)
|
|
|
|
if got, want := *m.Summary.Quantile[0].Value, math.Max(float64(i)/10, float64(i-90)); math.Abs(got-want) > 20 {
|
|
|
|
t.Errorf("%d. got %f, want %f", i, got, want)
|
|
|
|
}
|
|
|
|
m.Reset()
|
|
|
|
}
|
|
|
|
if i >= 1000 {
|
|
|
|
break
|
|
|
|
}
|
|
|
|
}
|
|
|
|
tick.Stop()
|
2015-03-15 15:58:14 +03:00
|
|
|
// Wait for MaxAge without observations and make sure quantiles are NaN.
|
|
|
|
time.Sleep(100 * time.Millisecond)
|
|
|
|
sum.Write(m)
|
|
|
|
if got := *m.Summary.Quantile[0].Value; !math.IsNaN(got) {
|
|
|
|
t.Errorf("got %f, want NaN after expiration", got)
|
|
|
|
}
|
2014-05-07 22:08:33 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
func getBounds(vars []float64, q, ε float64) (min, max float64) {
|
Create a public registry interface and separate out HTTP exposition
General context and approch
===========================
This is the first part of the long awaited wider refurbishment of
`client_golang/prometheus/...`. After a lot of struggling, I decided
to not go for one breaking big-bang, but cut things into smaller steps
after all, mostly to keep the changes manageable and easy to
review. I'm aiming for having the invasive breaking changes
concentrated in as few steps as possible (ideally one). Some steps
will not be breaking at all, but typically there will be breaking
changes that only affect quite special cases so that 95+% of users
will not be affected. This first step is an example for that, see
details below.
What's happening in this commit?
================================
This step is about finally creating an exported registry
interface. This could not be done by simply export the existing
internal implementation because the interface would be _way_ too
fat. This commit introduces a qutie lean `Registry` interface
(compared to the previous interval implementation). The functions that
act on the default registry are retained (with very few exceptions) so
that most use cases won't see a change. However, several of those are
deprecated now to clean up the namespace in the future.
The default registry is kept in the public variable
`DefaultRegistry`. This follows the example of the http package in the
standard library (cf. `http.DefaultServeMux`, `http.DefaultClient`)
with the same implications. (This pattern is somewhat disputed within
the Go community but I chose to go with the devil you know instead of
creating something more complex or even disallowing any changes to the
default registry. The current approach gives everybody the freedom to
not touch DefaultRegistry or to do everything with a custom registry
to play save.)
Another important part in making the registry lean is the extraction
of the HTTP exposition, which also allows for customization of the
HTTP exposition. Note that the separation of metric collection and
exposition has the side effect that managing the MetricFamily and
Metric protobuf objects in a free-list or pool isn't really feasible
anymore. By now (with better GC in more recent Go versions), the
returns were anyway dimisishing. To be effective at all, scrapes had
to happen more often than GC cycles, and even then most elements of
the protobufs (everything excetp the MetricFamily and Metric structs
themselves) would still cause allocation churn. In a future breaking
change, the signature of the Write method in the Metric interface will
be adjusted accordingly. In this commit, avoiding breakage is more
important.
The following issues are fixed by this commit (some solved "on the
fly" now that I was touching the code anyway and it would have been
stupid to port the bugs):
https://github.com/prometheus/client_golang/issues/46
https://github.com/prometheus/client_golang/issues/100
https://github.com/prometheus/client_golang/issues/170
https://github.com/prometheus/client_golang/issues/205
Documentation including examples have been amended as required.
What future changes does this commit enable?
============================================
The following items are not yet implemented, but this commit opens the
possibility of implementing these independently.
- The separation of the HTTP exposition allows the implementation of
other exposition methods based on the Registry interface, as known
from other Prometheus client libraries, e.g. sending the metrics to
Graphite.
Cf. https://github.com/prometheus/client_golang/issues/197
- The public `Registry` interface allows the implementation of
convenience tools for testing metrics collection. Those tools can
inspect the collected MetricFamily protobufs and compare them to
expectation. Also, tests can use their own testing instance of a
registry.
Cf. https://github.com/prometheus/client_golang/issues/58
Notable non-goals of this commit
================================
Non-goals that will be tackled later
------------------------------------
The following two issues are quite closely connected to the changes in
this commit but the line has been drawn deliberately to address them
in later steps of the refurbishment:
- `InstrumentHandler` has many known problems. The plan is to create a
saner way to conveniently intrument HTTP handlers and remove the old
`InstrumentHandler` altogether. To keep breakage low for now, even
the default handler to expose metrics is still using the old
`InstrumentHandler`. This leads to weird naming inconsistencies but
I have deemed it better to not break the world right now but do it
in the change that provides better ways of instrumenting HTTP
handlers.
Cf. https://github.com/prometheus/client_golang/issues/200
- There is work underway to make the whole handling of metric
descriptors (`Desc`) more intuitive and transparent for the user
(including an ability for less strict checking,
cf. https://github.com/prometheus/client_golang/issues/47). That's
quite invasive from the perspective of the internal code, namely the
registry. I deliberately kept those changes out of this commit.
- While this commit adds new external dependency, the effort to vendor
anything within the library that is not visible in any exported
types will have to be done later.
Non-goals that _might_ be tackled later
---------------------------------------
There is a strong and understandable urge to divide the `prometheus`
package into a number of sub-packages (like `registry`, `collectors`,
`http`, `metrics`, …). However, to not run into a multitude of
circular import chains, this would need to break every single existing
usage of the library. (As just one example, if the ubiquitious
`prometheus.MustRegister` (with more than 2,000 uses on GitHub alone)
is kept in the `prometheus` package, but the other registry concerns
go into a new `registry` package, then the `prometheus` package would
import the `registry` package (to call the actual register method),
while at the same time the `registry` package needs to import the
`prometheus` package to access `Collector`, `Metric`, `Desc` and
more. If we moved `MustRegister` into the `registry` package,
thousands of code lines would have to be fixed (which would be easy if
the world was a mono repo, but it is not). If we moved everything else
the proposed registry package needs into packages of their own, we
would break thousands of other code lines.)
The main problem is really the top-level functions like
`MustRegister`, `Handler`, …, which effectively pull everything into
one package. Those functions are however very convenient for the easy
and very frequent use-cases.
This problem has to be revisited later.
For now, I'm trying to keep the amount of exported names in the
package as low as possible (e.g. I unexported expvarCollector in this
commit because the NewExpvarCollector constructor is enough to export,
and it is now consistent with other collectors, like the goCollector).
Non-goals that won't be tackled anytime soon
--------------------------------------------
Something that I have played with a lot is "streaming collection",
i.e. allow an implementation of the `Registry` interface that collects
metrics incrementally and serves them while doing so. As it has turned
out, this has many many issues and makes the `Registry` interface very
clunky. Eventually, I made the call that it is unlikely we will really
implement streaming collection; and making the interface more clunky
for something that might not even happen is really a big no-no. Note
that the `Registry` interface only creates the in-memory
representation of the metric family protobufs in one go. The
serializaton onto the wire can still be handled in a streaming fashion
(which hasn't been done so far, without causing any trouble, but might
be done in the future without breaking any interfaces).
What are the breaking changes?
==============================
- Signatures of functions pushing to Pushgateway have changed to allow
arbitrary grouping (which was planned for a long time anyway, and
now that I had to work on the Push code anyway for the registry
refurbishment, I finally did it,
cf. https://github.com/prometheus/client_golang/issues/100).
With the gained insight that pushing to the default registry is almost
never the right thing, and now that we are breaking the Push call
anyway, all the Push functions were moved to their own package,
which cleans up the namespace and is more idiomatic (pushing
Collectors is now literally done by `push.Collectors(...)`).
- The registry is doing more consistency checks by default now. Past
creators of inconsistent metrics could have masked the problem by
not setting `EnableCollectChecks`. Those inconsistencies will now be
detected. (But note that a "best effort" metrics collection is now
possible with `HandlerOpts.ErrorHandling = ContinueOnError`.)
- `EnableCollectChecks` is gone. The registry is now performing some
of those checks anyway (see previous item), and a registry with all
of those checks can now be created with `NewPedanticRegistry` (only
used for testing).
- `PanicOnCollectError` is gone. This behavior can now be configured
when creating a custom HTTP handler.
2016-07-20 18:11:14 +03:00
|
|
|
// TODO(beorn7): This currently tolerates an error of up to 2*ε. The
|
|
|
|
// error must be at most ε, but for some reason, it's sometimes slightly
|
2015-01-21 15:44:43 +03:00
|
|
|
// higher. That's a bug.
|
2015-01-20 20:27:10 +03:00
|
|
|
n := float64(len(vars))
|
2015-01-21 15:44:43 +03:00
|
|
|
lower := int((q - 2*ε) * n)
|
|
|
|
upper := int(math.Ceil((q + 2*ε) * n))
|
2014-05-07 22:08:33 +04:00
|
|
|
min = vars[0]
|
2015-01-20 20:27:10 +03:00
|
|
|
if lower > 1 {
|
|
|
|
min = vars[lower-1]
|
2014-05-07 22:08:33 +04:00
|
|
|
}
|
|
|
|
max = vars[len(vars)-1]
|
2015-01-20 20:27:10 +03:00
|
|
|
if upper < len(vars) {
|
|
|
|
max = vars[upper-1]
|
2014-05-07 22:08:33 +04:00
|
|
|
}
|
|
|
|
return
|
|
|
|
|