Method SearchLabelValues

tsdb/querier.go:110–140

SearchLabelValues implements storage.Searcher.

(ctx context.Context, name string, hints *storage.SearchHints, matchers ...*labels.Matcher)

// SearchLabelValues implements storage.Searcher.
func (q *blockBaseQuerier) SearchLabelValues(ctx context.Context, name string, hints *storage.SearchHints, matchers ...*labels.Matcher) storage.SearchResultSet {
	if hints == nil {
		hints = &storage.SearchHints{}
	}

	// Limit pushdown is only correct when natural (ascending) index order
	// is preserved all the way to the output and no filtering discards
	// values ahead of the limit.
	labelHints := &storage.LabelHints{}
	if hints.OrderBy == storage.OrderByValueAsc && hints.Filter == nil {
		labelHints.Limit = hints.Limit
	}

	var (
		values []string
		err    error
	)
	switch hints.OrderBy {
	case storage.OrderByScoreDesc:
		// Score-based sorting happens in ApplySearchHints; avoid the
		// index-level sort.
		values, err = q.index.LabelValues(ctx, name, labelHints, matchers...)
	default:
		values, err = q.index.SortedLabelValues(ctx, name, labelHints, matchers...)
	}
	if err != nil {
		return storage.ErrSearchResultSet(err)
	}

	return storage.NewSearchResultSetFromSlice(storage.ApplySearchHints(values, hints), nil)
}

func (q *blockBaseQuerier) Close() error {
	if q.closed {