c2c/co-maps
c2c/co-maps
2
0
Fork 0
Code Issues Pull requests Projects Releases 1 Packages Wiki Activity Actions

Repo created

Browse source
This commit is contained in:
Fr4nz D13trich 2025-11-22 13:58:55 +01:00
parent 4af19165ec
commit 68073add76
12458 changed files with 12350765 additions and 2 deletions
Download patch file Download diff file Expand all files Collapse all files

86
libs/search/approximate_string_match.hpp Normal file
View file

@ -0,0 +1,86 @@
#pragma once
#include "indexer/search_string_utils.hpp"
#include "base/base.hpp"
#include "base/buffer_vector.hpp"
#include <cstdint>
#include <queue>
namespace search
{
namespace impl
{
struct MatchCostData
{
uint32_t m_A, m_B;
uint32_t m_Cost;
MatchCostData() : m_A(0), m_B(0), m_Cost(0) {}
MatchCostData(uint32_t a, uint32_t b, uint32_t cost) : m_A(a), m_B(b), m_Cost(cost) {}
bool operator<(MatchCostData const & o) const { return m_Cost > o.m_Cost; }
};
template <typename PriorityQueue>
void PushMatchCost(PriorityQueue & q, uint32_t maxCost, uint32_t a, uint32_t b, uint32_t cost)
{
if (cost <= maxCost)
q.push(MatchCostData(a, b, cost));
}
} // namespace impl
class DefaultMatchCost
{
public:
uint32_t Cost10(strings::UniChar a) const;
uint32_t Cost01(strings::UniChar b) const;
uint32_t Cost11(strings::UniChar a, strings::UniChar b) const;
uint32_t Cost12(strings::UniChar a, strings::UniChar const * pB) const;
uint32_t Cost21(strings::UniChar const * pA, strings::UniChar b) const;
uint32_t Cost22(strings::UniChar const * pA, strings::UniChar const * pB) const;
uint32_t SwapCost(strings::UniChar a1, strings::UniChar a2) const;
};
template <typename Char, typename CostFn>
uint32_t StringMatchCost(Char const * sA, size_t sizeA, Char const * sB, size_t sizeB, CostFn const & costF,
uint32_t maxCost, bool bPrefixMatch = false)
{
std::priority_queue<impl::MatchCostData, buffer_vector<impl::MatchCostData, 256>> q;
q.push(impl::MatchCostData(0, 0, 0));
while (!q.empty())
{
uint32_t a = q.top().m_A;
uint32_t b = q.top().m_B;
uint32_t const c = q.top().m_Cost;
q.pop();
while (a < sizeA && b < sizeB && sA[a] == sB[b])
{
++a;
++b;
}
if (a == sizeA && (bPrefixMatch || b == sizeB))
return c;
if (a < sizeA)
impl::PushMatchCost(q, maxCost, a + 1, b, c + costF.Cost10(sA[a]));
if (b < sizeB)
impl::PushMatchCost(q, maxCost, a, b + 1, c + costF.Cost01(sB[b]));
if (a < sizeA && b < sizeB)
impl::PushMatchCost(q, maxCost, a + 1, b + 1, c + costF.Cost11(sA[a], sB[b]));
if (a + 1 < sizeA && b < sizeB)
impl::PushMatchCost(q, maxCost, a + 2, b + 1, c + costF.Cost21(&sA[a], sB[b]));
if (a < sizeA && b + 1 < sizeB)
impl::PushMatchCost(q, maxCost, a + 1, b + 2, c + costF.Cost12(sA[a], &sB[b]));
if (a + 1 < sizeA && b + 1 < sizeB)
{
impl::PushMatchCost(q, maxCost, a + 2, b + 2, c + costF.Cost22(&sA[a], &sB[b]));
if (sA[a] == sB[b + 1] && sA[a + 1] == sB[b])
impl::PushMatchCost(q, maxCost, a + 2, b + 2, c + costF.SwapCost(sA[a], sA[a + 1]));
}
}
return maxCost + 1;
}
} // namespace search