Index: clangd/CodeComplete.cpp =================================================================== --- clangd/CodeComplete.cpp +++ clangd/CodeComplete.cpp @@ -1375,7 +1375,7 @@ // Build the query. FuzzyFindRequest Req; if (Opts.Limit) - Req.MaxCandidateCount = Opts.Limit; + Req.Limit = Opts.Limit; Req.Query = Filter->pattern(); Req.RestrictForCodeCompletion = true; Req.Scopes = QueryScopes; Index: clangd/FindSymbols.cpp =================================================================== --- clangd/FindSymbols.cpp +++ clangd/FindSymbols.cpp @@ -117,8 +117,9 @@ if (IsGlobalQuery || !Names.first.empty()) Req.Scopes = {Names.first}; if (Limit) - Req.MaxCandidateCount = Limit; - TopN Top(Req.MaxCandidateCount); + Req.Limit = Limit; + TopN Top( + Req.Limit ? *Req.Limit : std::numeric_limits::max()); FuzzyMatcher Filter(Req.Query); Index->fuzzyFind(Req, [HintPath, &Top, &Filter](const Symbol &Sym) { // Prefer the definition over e.g. a function declaration in a header Index: clangd/index/Index.h =================================================================== --- clangd/index/Index.h +++ clangd/index/Index.h @@ -437,9 +437,7 @@ std::vector Scopes; /// \brief The number of top candidates to return. The index may choose to /// return more than this, e.g. if it doesn't know which candidates are best. - // FIXME: Use llvm::Optional; semantically, the absence of MaxCandidateCount - // is equivalent to setting this field to default value as below. - uint32_t MaxCandidateCount = std::numeric_limits::max(); + llvm::Optional Limit; /// If set to true, only symbols for completion support will be considered. bool RestrictForCodeCompletion = false; /// Contextually relevant files (e.g. the file we're code-completing in). @@ -447,9 +445,9 @@ std::vector ProximityPaths; bool operator==(const FuzzyFindRequest &Req) const { - return std::tie(Query, Scopes, MaxCandidateCount, RestrictForCodeCompletion, + return std::tie(Query, Scopes, Limit, RestrictForCodeCompletion, ProximityPaths) == - std::tie(Req.Query, Req.Scopes, Req.MaxCandidateCount, + std::tie(Req.Query, Req.Scopes, Req.Limit, Req.RestrictForCodeCompletion, Req.ProximityPaths); } bool operator!=(const FuzzyFindRequest &Req) const { return !(*this == Req); } @@ -476,7 +474,7 @@ /// each matched symbol before returning. /// If returned Symbols are used outside Callback, they must be deep-copied! /// - /// Returns true if there may be more results (limited by MaxCandidateCount). + /// Returns true if there may be more results (limited by Req.Limit). virtual bool fuzzyFind(const FuzzyFindRequest &Req, llvm::function_ref Callback) const = 0; Index: clangd/index/Index.cpp =================================================================== --- clangd/index/Index.cpp +++ clangd/index/Index.cpp @@ -177,14 +177,14 @@ bool fromJSON(const llvm::json::Value &Parameters, FuzzyFindRequest &Request) { json::ObjectMapper O(Parameters); - int64_t MaxCandidateCount; + int64_t Limit; bool OK = O && O.map("Query", Request.Query) && O.map("Scopes", Request.Scopes) && - O.map("MaxCandidateCount", MaxCandidateCount) && + O.map("Limit", Limit) && O.map("RestrictForCodeCompletion", Request.RestrictForCodeCompletion) && O.map("ProximityPaths", Request.ProximityPaths); - if (OK && MaxCandidateCount <= std::numeric_limits::max()) - Request.MaxCandidateCount = MaxCandidateCount; + if (OK && Limit <= std::numeric_limits::max()) + Request.Limit = Limit; return OK; } @@ -192,7 +192,7 @@ return json::Object{ {"Query", Request.Query}, {"Scopes", json::Array{Request.Scopes}}, - {"MaxCandidateCount", Request.MaxCandidateCount}, + {"Limit", Request.Limit}, {"RestrictForCodeCompletion", Request.RestrictForCodeCompletion}, {"ProximityPaths", json::Array{Request.ProximityPaths}}, }; Index: clangd/index/MemIndex.cpp =================================================================== --- clangd/index/MemIndex.cpp +++ clangd/index/MemIndex.cpp @@ -29,7 +29,8 @@ assert(!StringRef(Req.Query).contains("::") && "There must be no :: in query."); - TopN> Top(Req.MaxCandidateCount); + TopN> Top( + Req.Limit ? *Req.Limit : std::numeric_limits::max()); FuzzyMatcher Filter(Req.Query); bool More = false; for (const auto Pair : Index) { Index: clangd/index/dex/Dex.cpp =================================================================== --- clangd/index/dex/Dex.cpp +++ clangd/index/dex/Dex.cpp @@ -179,8 +179,8 @@ // FIXME(kbobyrev): Pre-scoring retrieval threshold should be adjusted as // using 100x of the requested number might not be good in practice, e.g. // when the requested number of items is small. - const size_t ItemsToRetrieve = 100 * Req.MaxCandidateCount; - auto Root = createLimit(move(QueryIterator), ItemsToRetrieve); + auto Root = Req.Limit ? createLimit(move(QueryIterator), *Req.Limit * 100) + : move(QueryIterator); using IDAndScore = std::pair; std::vector IDAndScores = consume(*Root); @@ -188,7 +188,8 @@ auto Compare = [](const IDAndScore &LHS, const IDAndScore &RHS) { return LHS.second > RHS.second; }; - TopN Top(Req.MaxCandidateCount, Compare); + TopN Top( + Req.Limit ? *Req.Limit : std::numeric_limits::max(), Compare); for (const auto &IDAndScore : IDAndScores) { const DocID SymbolDocID = IDAndScore.first; const auto *Sym = Symbols[SymbolDocID]; @@ -205,7 +206,7 @@ More = true; } - // Apply callback to the top Req.MaxCandidateCount items in the descending + // Apply callback to the top Req.Limit items in the descending // order of cumulative score. for (const auto &Item : std::move(Top).items()) Callback(*Symbols[Item.first]); Index: test/clangd/Inputs/requests.json =================================================================== --- test/clangd/Inputs/requests.json +++ test/clangd/Inputs/requests.json @@ -1,7 +1,7 @@ -[{"MaxCandidateCount":100,"ProximityPaths":["/usr/home/user/clang-tools-extra/clangd/benchmarks/IndexBenchmark.cpp"],"Query":"OMP","RestrictForCodeCompletion":true,"Scopes":["clang::"]}, -{"MaxCandidateCount":100,"ProximityPaths":[],"Query":"s","RestrictForCodeCompletion":true,"Scopes":["llvm::", ""]}, -{"MaxCandidateCount":100,"ProximityPaths":[],"Query":"sy","RestrictForCodeCompletion":true,"Scopes":["llvm::", ""]}, -{"MaxCandidateCount":100,"ProximityPaths":[],"Query":"sys","RestrictForCodeCompletion":true,"Scopes":["llvm::", ""]}, -{"MaxCandidateCount":100,"ProximityPaths":[],"Query":"sys","RestrictForCodeCompletion":true,"Scopes":["llvm::", ""]}, -{"MaxCandidateCount":100,"ProximityPaths":[],"Query":"Dex","RestrictForCodeCompletion":true,"Scopes":["clang::clangd::", "clang::", "clang::clangd::dex::"]}, -{"MaxCandidateCount":100,"ProximityPaths":[],"Query":"Variable","RestrictForCodeCompletion":true,"Scopes":[""]}] +[{"Limit":100,"ProximityPaths":["/usr/home/user/clang-tools-extra/clangd/benchmarks/IndexBenchmark.cpp"],"Query":"OMP","RestrictForCodeCompletion":true,"Scopes":["clang::"]}, +{"Limit":100,"ProximityPaths":[],"Query":"s","RestrictForCodeCompletion":true,"Scopes":["llvm::", ""]}, +{"Limit":100,"ProximityPaths":[],"Query":"sy","RestrictForCodeCompletion":true,"Scopes":["llvm::", ""]}, +{"Limit":100,"ProximityPaths":[],"Query":"sys","RestrictForCodeCompletion":true,"Scopes":["llvm::", ""]}, +{"Limit":100,"ProximityPaths":[],"Query":"sys","RestrictForCodeCompletion":true,"Scopes":["llvm::", ""]}, +{"Limit":100,"ProximityPaths":[],"Query":"Dex","RestrictForCodeCompletion":true,"Scopes":["clang::clangd::", "clang::", "clang::clangd::dex::"]}, +{"Limit":100,"ProximityPaths":[],"Query":"Variable","RestrictForCodeCompletion":true,"Scopes":[""]}] Index: unittests/clangd/DexTests.cpp =================================================================== --- unittests/clangd/DexTests.cpp +++ unittests/clangd/DexTests.cpp @@ -482,7 +482,7 @@ URISchemes); FuzzyFindRequest Req; Req.Query = "lol"; - Req.MaxCandidateCount = 2; + Req.Limit = 2; EXPECT_THAT(match(*I, Req), UnorderedElementsAre("LaughingOutLoud", "LittleOldLady")); } @@ -498,6 +498,7 @@ FuzzyFindRequest Req; Req.Query = "2"; Dex I(Symbols, URISchemes); + EXPECT_FALSE(Req.Limit); EXPECT_THAT(match(I, Req), ElementsAre("2", "2")); } @@ -505,10 +506,11 @@ auto I = Dex::build(generateNumSymbols(0, 100), URISchemes); FuzzyFindRequest Req; Req.Query = "5"; - Req.MaxCandidateCount = 3; + Req.Limit = 3; bool Incomplete; auto Matches = match(*I, Req, &Incomplete); - EXPECT_EQ(Matches.size(), Req.MaxCandidateCount); + EXPECT_TRUE(Req.Limit); + EXPECT_EQ(Matches.size(), *Req.Limit); EXPECT_TRUE(Incomplete); } @@ -518,7 +520,7 @@ URISchemes); FuzzyFindRequest Req; Req.Query = "lol"; - Req.MaxCandidateCount = 2; + Req.Limit = 2; EXPECT_THAT(match(*I, Req), UnorderedElementsAre("LaughingOutLoud", "LittleOldLady")); } @@ -596,7 +598,7 @@ FuzzyFindRequest Req; Req.Query = "abc"; // The best candidate can change depending on the proximity paths. - Req.MaxCandidateCount = 1; + Req.Limit = 1; // FuzzyFind request comes from the file which is far from the root: expect // CloseSymbol to come out. Index: unittests/clangd/IndexTests.cpp =================================================================== --- unittests/clangd/IndexTests.cpp +++ unittests/clangd/IndexTests.cpp @@ -78,10 +78,11 @@ auto I = MemIndex::build(generateNumSymbols(0, 100), RefSlab()); FuzzyFindRequest Req; Req.Query = "5"; - Req.MaxCandidateCount = 3; + Req.Limit = 3; bool Incomplete; auto Matches = match(*I, Req, &Incomplete); - EXPECT_EQ(Matches.size(), Req.MaxCandidateCount); + EXPECT_TRUE(Req.Limit); + EXPECT_EQ(Matches.size(), *Req.Limit); EXPECT_TRUE(Incomplete); } @@ -91,7 +92,7 @@ RefSlab()); FuzzyFindRequest Req; Req.Query = "lol"; - Req.MaxCandidateCount = 2; + Req.Limit = 2; EXPECT_THAT(match(*I, Req), UnorderedElementsAre("LaughingOutLoud", "LittleOldLady")); }