mudhorn/prometheus
1
0
Fork 0
mirror of https://github.com/prometheus/prometheus.git synced 2025-03-05 20:59:13 -08:00
Code Issues Actions 4 Packages Projects Releases Wiki Activity

chore: fix some comments

Browse source 
Signed-off-by: riskrole <yuhang@before.tech>
This commit is contained in:
riskrole 2024-08-28 11:26:57 +08:00
parent 7757794bb3
commit 406bf775aa
4 changed files with 5 additions and 5 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

4
model/textparse/protobufparse.go
View file

@ -47,7 +47,7 @@ import (
// the re-arrangement work is actually causing problems (which has to be seen), // the re-arrangement work is actually causing problems (which has to be seen),
// that expectation needs to be changed. // that expectation needs to be changed.
type ProtobufParser struct { type ProtobufParser struct {
in []byte // The intput to parse. in []byte // The input to parse.
inPos int // Position within the input. inPos int // Position within the input.
metricPos int // Position within Metric slice. metricPos int // Position within Metric slice.
// fieldPos is the position within a Summary or (legacy) Histogram. -2 // fieldPos is the position within a Summary or (legacy) Histogram. -2
@ -71,7 +71,7 @@ type ProtobufParser struct {
mf *dto.MetricFamily mf *dto.MetricFamily
// Wether to also parse a classic histogram that is also present as a // Whether to also parse a classic histogram that is also present as a
// native histogram. // native histogram.
parseClassicHistograms bool parseClassicHistograms bool

2
rules/alerting_test.go
View file

@ -648,7 +648,7 @@ func TestAlertingRuleLimit(t *testing.T) {
case err != nil: case err != nil:
require.EqualError(t, err, test.err) require.EqualError(t, err, test.err)
case test.err != "": case test.err != "":
t.Errorf("Expected errror %s, got none", test.err) t.Errorf("Expected error %s, got none", test.err)
} }
} }
} }

2
tsdb/compact_test.go
View file

@ -2018,7 +2018,7 @@ func TestDelayedCompaction(t *testing.T) {
// This implies that the compaction delay doesn't block or wait on the initial trigger. // This implies that the compaction delay doesn't block or wait on the initial trigger.
// 3 is an arbitrary value because it's difficult to determine the precise value. // 3 is an arbitrary value because it's difficult to determine the precise value.
require.GreaterOrEqual(t, prom_testutil.ToFloat64(db.metrics.compactionsTriggered)-prom_testutil.ToFloat64(db.metrics.compactionsSkipped), 3.0) require.GreaterOrEqual(t, prom_testutil.ToFloat64(db.metrics.compactionsTriggered)-prom_testutil.ToFloat64(db.metrics.compactionsSkipped), 3.0)
// The delay doesn't change the head blocks alignement. // The delay doesn't change the head blocks alignment.
require.Eventually(t, func() bool { require.Eventually(t, func() bool {
return db.head.MinTime() == db.compactor.(*LeveledCompactor).ranges[0]+1 return db.head.MinTime() == db.compactor.(*LeveledCompactor).ranges[0]+1
}, 500*time.Millisecond, 10*time.Millisecond) }, 500*time.Millisecond, 10*time.Millisecond)

2
tsdb/head_read.go
View file

@ -430,7 +430,7 @@ func (s *memSeries) chunk(id chunks.HeadChunkID, chunkDiskMapper *chunks.ChunkDi
// incremented by 1 when new chunk is created, hence (id - firstChunkID) gives the slice index. // incremented by 1 when new chunk is created, hence (id - firstChunkID) gives the slice index.
// The max index for the s.mmappedChunks slice can be len(s.mmappedChunks)-1, hence if the ix // The max index for the s.mmappedChunks slice can be len(s.mmappedChunks)-1, hence if the ix
// is >= len(s.mmappedChunks), it represents one of the chunks on s.headChunks linked list. // is >= len(s.mmappedChunks), it represents one of the chunks on s.headChunks linked list.
// The order of elemens is different for slice and linked list. // The order of elements is different for slice and linked list.
// For s.mmappedChunks slice newer chunks are appended to it. // For s.mmappedChunks slice newer chunks are appended to it.
// For s.headChunks list newer chunks are prepended to it. // For s.headChunks list newer chunks are prepended to it.
// //