mirror of
https://github.com/prometheus/prometheus.git
synced 2025-08-05 21:57:09 +02:00
25aee26a57
Lets take the given example: P1: [2, 5, 9, 18, 21] P2: [3, 7, 14, 19, 21] P3: [1, 21] Currently, we would only advance through P1 and P2 until discovering an intersection and then checking P3. In essence, the traversal order was: 2, 3, 5, 7, 9, 14, 18, 19, 21 (intersection found). With the proposed change, P3 is also examined even if P1 and P2 haven't found an intersection yet. This adjustment allows for the possibility of skipping some iterations. Post-change, the traversal order becomes: 2, 3, 21 (3 iterations instead of 9). Signed-off-by: alanprot <alanprot@gmail.com> |
||
|---|---|---|
| .. | ||
| index_test.go | ||
| index.go | ||
| postings_test.go | ||
| postings.go | ||
| postingsstats_test.go | ||
| postingsstats.go | ||