kakoune/src/completion.hh

84 lines
2.1 KiB
C++
Raw Normal View History

#ifndef completion_hh_INCLUDED
#define completion_hh_INCLUDED
#include <functional>
#include <algorithm>
#include "units.hh"
#include "string.hh"
2015-01-09 14:57:21 +01:00
#include "vector.hh"
#include "ranked_match.hh"
namespace Kakoune
{
2013-11-11 20:10:49 +01:00
class Context;
using CandidateList = Vector<String, MemoryDomain::Completion>;
struct Completions
{
CandidateList candidates;
ByteCount start;
ByteCount end;
bool quoted = false;
Completions()
: start(0), end(0) {}
Completions(ByteCount start, ByteCount end)
: start(start), end(end) {}
Completions(ByteCount start, ByteCount end, CandidateList candidates, bool quoted = false)
: candidates(std::move(candidates)), start(start), end(end), quoted{quoted} {}
};
enum class CompletionFlags
{
None = 0,
Fast = 1 << 0,
Start = 1 << 2,
};
constexpr bool with_bit_ops(Meta::Type<CompletionFlags>) { return true; }
inline Completions complete_nothing(const Context&, CompletionFlags,
StringView, ByteCount cursor_pos)
{
2016-03-24 23:15:11 +01:00
return {cursor_pos, cursor_pos};
}
Completions shell_complete(const Context& context, CompletionFlags,
StringView, ByteCount cursor_pos);
inline Completions offset_pos(Completions completion, ByteCount offset)
{
return { completion.start + offset, completion.end + offset,
std::move(completion.candidates), completion.quoted };
}
template<typename Container>
CandidateList complete(StringView query, ByteCount cursor_pos,
const Container& container)
{
using std::begin;
static_assert(not std::is_same<decltype(*begin(container)), String>::value,
"complete require long lived strings, not temporaries");
query = query.substr(0, cursor_pos);
Vector<RankedMatch> matches;
for (const auto& str : container)
{
if (RankedMatch match{str, query})
matches.push_back(match);
}
std::sort(matches.begin(), matches.end());
CandidateList res;
for (auto& m : matches)
res.push_back(m.candidate().str());
return res;
}
}
#endif // completion_hh_INCLUDED