62 lines
1.6 KiB
C++
62 lines
1.6 KiB
C++
#ifndef ranked_match_hh_INCLUDED
|
|
#define ranked_match_hh_INCLUDED
|
|
|
|
#include "string.hh"
|
|
#include "meta.hh"
|
|
|
|
#include <cstdint>
|
|
|
|
namespace Kakoune
|
|
{
|
|
|
|
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
|
|
{
|
|
RankedMatch(StringView candidate, StringView query);
|
|
RankedMatch(StringView candidate, UsedLetters candidate_letters,
|
|
StringView query, UsedLetters query_letters);
|
|
|
|
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 m_matches; }
|
|
|
|
private:
|
|
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,
|
|
SmartFullMatch = 1 << 5,
|
|
FullMatch = 1 << 6,
|
|
};
|
|
friend constexpr bool with_bit_ops(Meta::Type<Flags>) { return true; }
|
|
|
|
StringView m_candidate{};
|
|
bool m_matches = false;
|
|
Flags m_flags = Flags::None;
|
|
int m_word_boundary_match_count = 0;
|
|
int m_max_index = 0;
|
|
};
|
|
|
|
}
|
|
|
|
#endif // ranked_match_hh_INCLUDED
|