ccls/src/include_complete.h

50 lines
1.5 KiB
C
Raw Normal View History

#pragma once
#include "lsp_completion.h"
#include <atomic>
#include <mutex>
#include <unordered_set>
struct GroupMatch;
struct Project;
struct IncludeComplete {
2018-08-09 17:08:14 +00:00
IncludeComplete(Project *project);
// Starts scanning directories. Clears existing cache.
void Rescan();
// Ensures the one-off file is inside |completion_items|.
2018-08-09 17:08:14 +00:00
void AddFile(const std::string &absolute_path);
2017-09-22 01:14:57 +00:00
// Scans the given directory and inserts all includes from this. This is a
// blocking function and should be run off the querydb thread.
2017-09-22 01:14:57 +00:00
void InsertIncludesFromDirectory(std::string directory,
bool use_angle_brackets);
2018-08-09 17:08:14 +00:00
std::optional<lsCompletionItem>
FindCompletionItemForAbsolutePath(const std::string &absolute_path);
2018-02-09 08:55:53 +00:00
// Insert item to |completion_items|.
// Update |absolute_path_to_completion_item| and |inserted_paths|.
2018-08-09 17:08:14 +00:00
void InsertCompletionItem(const std::string &absolute_path,
lsCompletionItem &&item);
2018-02-09 08:55:53 +00:00
// Guards |completion_items| when |is_scanning| is true.
std::mutex completion_items_mutex;
std::atomic<bool> is_scanning;
std::vector<lsCompletionItem> completion_items;
2017-09-22 01:14:57 +00:00
2018-02-09 08:55:53 +00:00
// Absolute file path to the completion item in |completion_items|.
// Keep the one with shortest include path.
std::unordered_map<std::string, int> absolute_path_to_completion_item;
2018-02-09 08:55:53 +00:00
// Only one completion item per include path.
std::unordered_map<std::string, int> inserted_paths;
// Cached references
2018-08-09 17:08:14 +00:00
Project *project_;
std::unique_ptr<GroupMatch> match_;
};