mirror of
https://github.com/prometheus/prometheus.git
synced 2026-04-22 22:57:16 -04:00
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 |
||
|---|---|---|
| .. | ||
| test | ||
| bytesize.go | ||
| cache.go | ||
| deadline_client.go | ||
| embed-static.sh | ||
| file_ext.go | ||
| freelist.go | ||
| set.go | ||
| set_test.go | ||
| strconv.go | ||
| time.go | ||
| uncertaintygroup.go | ||
| uncertaintygroup_test.go | ||