mirror of
https://github.com/prometheus/prometheus.git
synced 2024-12-25 05:34:05 -08:00
c582ae73c2
To achieve O(log n * k) runtime, this uses a heap to track the current bottom-k or top-k elements while iterating over the full set of available elements. It would be possible to reuse more code between topk and bottomk, but I decided for some more duplication for the sake of clarity. This fixes https://github.com/prometheus/prometheus/issues/399 Change-Id: I7487ddaadbe7acb22ca2cf2283ba6e7915f2b336 |
||
---|---|---|
.. | ||
ast | ||
fixtures | ||
manager | ||
alerting.go | ||
helpers.go | ||
helpers_test.go | ||
lexer.l | ||
lexer.l.go | ||
load.go | ||
Makefile | ||
parser.y | ||
parser.y.go | ||
recording.go | ||
rules.go | ||
rules_test.go |