drifty/comaps
1
0
Fork 0
mirror of https://codeberg.org/comaps/comaps synced 2025-12-20 13:23:59 +00:00
Code Issues Packages Projects Releases Wiki Activity

Format all C++ and Java code via clang-format

Browse Source 
Signed-off-by: Konstantin Pastbin <konstantin.pastbin@gmail.com>
This commit is contained in:
Konstantin Pastbin
2025-08-17 14:32:37 +07:00
parent 9f0290c0ec
commit bfffa1fff4
2169 changed files with 56441 additions and 64188 deletions
Download Patch File Download Diff File Expand all files Collapse all files

9
libs/search/approximate_string_match.hpp
View File

@@ -20,10 +20,7 @@ struct MatchCostData
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;
}
bool operator<(MatchCostData const & o) const { return m_Cost > o.m_Cost; }
};
template <typename PriorityQueue>
@@ -47,8 +44,8 @@ public:
};
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)
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));