mirror of
https://github.com/prometheus/prometheus.git
synced 2024-12-27 06:29:42 -08:00
70 lines
1.5 KiB
Go
70 lines
1.5 KiB
Go
// Copyright 2019 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 index
|
|
|
|
import (
|
|
"math"
|
|
"sort"
|
|
)
|
|
|
|
// Stat holds values for a single cardinality statistic.
|
|
type Stat struct {
|
|
Name string
|
|
Count uint64
|
|
}
|
|
|
|
type maxHeap struct {
|
|
maxLength int
|
|
minValue uint64
|
|
minIndex int
|
|
Items []Stat
|
|
}
|
|
|
|
func (m *maxHeap) init(len int) {
|
|
m.maxLength = len
|
|
m.minValue = math.MaxUint64
|
|
m.Items = make([]Stat, 0, len)
|
|
}
|
|
|
|
func (m *maxHeap) push(item Stat) {
|
|
if len(m.Items) < m.maxLength {
|
|
if item.Count < m.minValue {
|
|
m.minValue = item.Count
|
|
m.minIndex = len(m.Items)
|
|
}
|
|
m.Items = append(m.Items, item)
|
|
return
|
|
}
|
|
if item.Count < m.minValue {
|
|
return
|
|
}
|
|
|
|
m.Items[m.minIndex] = item
|
|
m.minValue = item.Count
|
|
|
|
for i, stat := range m.Items {
|
|
if stat.Count < m.minValue {
|
|
m.minValue = stat.Count
|
|
m.minIndex = i
|
|
}
|
|
}
|
|
}
|
|
|
|
func (m *maxHeap) get() []Stat {
|
|
sort.Slice(m.Items, func(i, j int) bool {
|
|
return m.Items[i].Count > m.Items[j].Count
|
|
})
|
|
return m.Items
|
|
}
|