xenia/home
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Use manual lexicographic comparison in RankedMatch::operator<

Browse Source
This commit is contained in:
Maxime Coste 2016-03-28 14:44:49 +01:00
parent 75e9bbfa43
commit 2a9875bd58
1 changed files with 12 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

19
src/ranked_match.cc
View File

@ -148,13 +148,18 @@ bool RankedMatch::operator<(const RankedMatch& other) const
if (m_match_index_sum != other.m_match_index_sum) if (m_match_index_sum != other.m_match_index_sum)
return m_match_index_sum < other.m_match_index_sum; return m_match_index_sum < other.m_match_index_sum;
return std::lexicographical_compare( for (Utf8It it1{m_candidate.begin(), m_candidate}, it2{other.m_candidate.begin(), other.m_candidate};
Utf8It{m_candidate.begin(), m_candidate}, Utf8It{m_candidate.end(), m_candidate}, it1 != m_candidate.end() and it2 != other.m_candidate.end(); ++it1, ++it2)
Utf8It{other.m_candidate.begin(), other.m_candidate}, Utf8It{other.m_candidate.end(), other.m_candidate}, {
[](Codepoint a, Codepoint b) { const auto cp1 = *it1, cp2 = *it2;
const bool low_a = islower(a), low_b = islower(b); if (cp1 != cp2)
return low_a == low_b ? a < b : low_a; {
}); const bool low1 = islower(cp1), low2 = islower(cp2);
return low1 == low2 ? cp1 < cp2 : low2;
}
}
return false;
} }
UnitTest test_ranked_match{[] { UnitTest test_ranked_match{[] {