kakoune/src/ranked_match.hh

56 lines
1.5 KiB
C++
Raw Normal View History

#ifndef ranked_match_hh_INCLUDED
#define ranked_match_hh_INCLUDED
#include "string.hh"
namespace Kakoune
{
2016-03-25 21:35:57 +01:00
using UsedLetters = uint64_t;
UsedLetters used_letters(StringView str);
constexpr UsedLetters upper_mask = 0xFFFFFFC000000;
inline UsedLetters to_lower(UsedLetters letters)
{
return ((letters & upper_mask) >> 26) | (letters & (~upper_mask));
}
struct RankedMatch
{
2015-10-27 22:25:18 +01:00
RankedMatch(StringView candidate, StringView query);
2016-03-25 21:35:57 +01:00
RankedMatch(StringView candidate, UsedLetters candidate_letters,
StringView query, UsedLetters query_letters);
2015-10-27 22:25:18 +01:00
const StringView& candidate() const { return m_candidate; }
bool operator<(const RankedMatch& other) const;
bool operator==(const RankedMatch& other) const { return m_candidate == other.m_candidate; }
explicit operator bool() const { return not m_candidate.empty(); }
private:
2016-03-25 21:35:57 +01:00
template<typename TestFunc>
RankedMatch(StringView candidate, StringView query, TestFunc test);
enum class Flags : int
{
None = 0,
// Order is important, the highest bit has precedence for comparison
FirstCharMatch = 1 << 0,
SingleWord = 1 << 1,
Contiguous = 1 << 2,
OnlyWordBoundary = 1 << 3,
Prefix = 1 << 4,
FullMatch = 1 << 5,
};
StringView m_candidate{};
Flags m_flags = Flags::None;
int m_word_boundary_match_count = 0;
int m_max_index = 0;
};
}
#endif // ranked_match_hh_INCLUDED