xenia/kakoune
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Make InsertCompletion an aggregate

Browse Source
This commit is contained in:
Maxime Coste 2017-09-01 17:03:34 +07:00
parent 6d0016f89c
commit 44fb375c81
1 changed files with 1 additions and 10 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

11
src/insert_completer.hh
View File

@ -62,21 +62,12 @@ struct InsertCompletion
bool operator==(const Candidate& other) const { return completion == other.completion; } bool operator==(const Candidate& other) const { return completion == other.completion; }
bool operator<(const Candidate& other) const { return completion < other.completion; } bool operator<(const Candidate& other) const { return completion < other.completion; }
}; };
using CandidateList = Vector<Candidate, MemoryDomain::Completion>; using CandidateList = Vector<Candidate, MemoryDomain::Completion>;
CandidateList candidates; CandidateList candidates;
BufferCoord begin; BufferCoord begin;
BufferCoord end; BufferCoord end;
size_t timestamp; size_t timestamp = 0;
InsertCompletion() : timestamp{0} {}
InsertCompletion(CandidateList candidates,
BufferCoord begin, BufferCoord end,
size_t timestamp)
: candidates{std::move(candidates)}, begin{begin}, end{end},
timestamp{timestamp} {}
bool is_valid() const { return not candidates.empty(); } bool is_valid() const { return not candidates.empty(); }
}; };