diff options
Diffstat (limited to 'icing/scoring/ranker.h')
| -rw-r--r-- | icing/scoring/ranker.h | 13 |
1 files changed, 0 insertions, 13 deletions
diff --git a/icing/scoring/ranker.h b/icing/scoring/ranker.h index 81838f3..785c133 100644 --- a/icing/scoring/ranker.h +++ b/icing/scoring/ranker.h @@ -17,7 +17,6 @@ #include <vector> -#include "icing/index/term-metadata.h" #include "icing/scoring/scored-document-hit.h" // Provides functionality to get the top N results from an unsorted vector. @@ -40,18 +39,6 @@ std::vector<ScoredDocumentHit> PopTopResultsFromHeap( std::vector<ScoredDocumentHit>* scored_document_hits_heap, int num_results, const ScoredDocumentHitComparator& scored_document_hit_comparator); -// The heap is a min-heap. So that we can avoid some push operations by -// comparing to the root term, and only pushing if greater than root. The time -// complexity for a single push is O(lgK) which K is the number_to_return. -// REQUIRED: scored_terms_heap is not null. -void PushToTermHeap(TermMetadata term, int number_to_return, - std::vector<TermMetadata>& scored_terms_heap); - -// Return all terms from the given terms heap. And since the heap is a min-heap, -// the output vector will be increasing order. -// REQUIRED: scored_terms_heap is not null. -std::vector<TermMetadata> PopAllTermsFromHeap( - std::vector<TermMetadata>& scored_terms_heap); } // namespace lib } // namespace icing |