rename method

Signed-off-by: Alan Protasio <[email protected]>

Author: alanprot

pkg/querier/batch/batch.go

@@ -42,7 +42,9 @@ type iterator interface {
 	// AtTime returns the start time of the next batch.  Must only be called after
 	// Seek or Next have returned true.
 	AtTime() int64
-	MaxTime() int64
+
+	// MaxCurrentChunkTime returns the max time on the current chunk
+	MaxCurrentChunkTime() int64
 
 	// Batch returns the current batch.  Must only be called after Seek or Next
 	// have returned true.
@@ -99,7 +101,7 @@ func (a *iteratorAdapter) Seek(t int64) bool {
 				a.curr.Index++
 			}
 			return true
-		} else if t <= a.underlying.MaxTime() {
+		} else if t <= a.underlying.MaxCurrentChunkTime() {
 			// In this case, some timestamp inside the current underlying chunk can fulfill the seek.
 			// In this case we will call next until we find the sample as it will be faster than calling seek directly.
 			for a.underlying.Next(promchunk.BatchSize) {

pkg/querier/batch/chunk.go

@@ -21,7 +21,7 @@ func (i *chunkIterator) reset(chunk GenericChunk) {
 	i.batch.Index = 0
 }
 
-func (i *chunkIterator) MaxTime() int64 {
+func (i *chunkIterator) MaxCurrentChunkTime() int64 {
 	return i.chunk.MaxTime
 }
 

pkg/querier/batch/merge.go

@@ -21,12 +21,12 @@ type mergeIterator struct {
 	currErr error
 }
 
-func (c *mergeIterator) MaxTime() int64 {
+func (c *mergeIterator) MaxCurrentChunkTime() int64 {
 	if len(c.h) < 1 {
 		return -1
 	}
 
-	return c.h[0].MaxTime()
+	return c.h[0].MaxCurrentChunkTime()
 }
 
 func newMergeIterator(cs []GenericChunk) *mergeIterator {

pkg/querier/batch/non_overlapping.go

@@ -32,8 +32,8 @@ func (it *nonOverlappingIterator) Seek(t int64, size int) bool {
 	}
 }
 
-func (it *nonOverlappingIterator) MaxTime() int64 {
-	return it.iter.MaxTime()
+func (it *nonOverlappingIterator) MaxCurrentChunkTime() int64 {
+	return it.iter.MaxCurrentChunkTime()
 }
 
 func (it *nonOverlappingIterator) Next(size int) bool {