Samples in each slice are assumed to be sorted.
(s ...[]chunks.Sample)
| 749 | |
| 750 | // Samples in each slice are assumed to be sorted. |
| 751 | func createFakeReaderAndIterables(s ...[]chunks.Sample) (*fakeChunksReader, []chunks.Meta) { |
| 752 | f := &fakeChunksReader{ |
| 753 | chks: map[chunks.ChunkRef]chunkenc.Chunk{}, |
| 754 | iterables: map[chunks.ChunkRef]chunkenc.Iterable{}, |
| 755 | } |
| 756 | chks := make([]chunks.Meta, 0, len(s)) |
| 757 | |
| 758 | for ref, samples := range s { |
| 759 | f.iterables[chunks.ChunkRef(ref)] = &mockIterable{s: samples} |
| 760 | |
| 761 | var minTime, maxTime int64 |
| 762 | if len(samples) > 0 { |
| 763 | minTime = samples[0].T() |
| 764 | maxTime = samples[len(samples)-1].T() |
| 765 | } |
| 766 | chks = append(chks, chunks.Meta{ |
| 767 | Ref: chunks.ChunkRef(ref), |
| 768 | MinTime: minTime, |
| 769 | MaxTime: maxTime, |
| 770 | }) |
| 771 | } |
| 772 | return f, chks |
| 773 | } |
| 774 | |
| 775 | func (r *fakeChunksReader) ChunkOrIterable(meta chunks.Meta) (chunkenc.Chunk, chunkenc.Iterable, error) { |
| 776 | if chk, ok := r.chks[meta.Ref]; ok { |
no test coverage detected
searching dependent graphs…