drifty/comaps
1
0
Fork 0
mirror of https://codeberg.org/comaps/comaps synced 2025-12-23 14:43:43 +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

23
libs/geometry/covering.hpp
View File

@@ -41,8 +41,7 @@ public:
}
// Cover triangle.
Covering(m2::PointD const & a, m2::PointD const & b, m2::PointD const & c,
int level = CellId::DEPTH_LEVELS - 1)
Covering(m2::PointD const & a, m2::PointD const & b, m2::PointD const & c, int level = CellId::DEPTH_LEVELS - 1)
{
// TODO: ASSERT(a != b), ASSERT(b != c), ASSERT(a != c) ?
ASSERT(0 <= level && level <= CellId::DEPTH_LEVELS, (level, CellId::Root()));
@@ -117,12 +116,10 @@ private:
std::vector<CellId> parentCells;
std::vector<CellId> childCells;
for (ConstIterator it = m_Covering[level].begin(); it != m_Covering[level].end(); ++it)
{
if (parentCellCounts[it->Parent()] > 1)
parentCells.push_back(it->Parent());
else
childCells.push_back(*it);
}
ASSERT(std::is_sorted(parentCells.begin(), parentCells.end(), LessLevelOrder()), (parentCells));
ASSERT(std::is_sorted(childCells.begin(), childCells.end(), LessLevelOrder()), (childCells));
m_Covering[level].swap(childCells);
@@ -135,8 +132,7 @@ private:
ASSERT(base::IsSortedAndUnique(a.begin(), a.end(), LessLevelOrder()), (a));
ASSERT(base::IsSortedAndUnique(b.begin(), b.end(), LessLevelOrder()), (b));
std::vector<CellId> merged;
std::set_union(a.begin(), a.end(), b.begin(), b.end(), std::back_inserter(merged),
LessLevelOrder());
std::set_union(a.begin(), a.end(), b.begin(), b.end(), std::back_inserter(merged), LessLevelOrder());
a.swap(merged);
}
@@ -195,16 +191,13 @@ private:
{
if (m_Covering[parentLevel].empty())
continue;
for (int childLevel = parentLevel + 1; childLevel < static_cast<int>(m_Covering.size());
++childLevel)
for (int childLevel = parentLevel + 1; childLevel < static_cast<int>(m_Covering.size()); ++childLevel)
{
std::vector<CellId> subtracted;
CompareCellsAtLevel<LessLevelOrder> comparator(parentLevel);
ASSERT(std::is_sorted(m_Covering[childLevel].begin(), m_Covering[childLevel].end(),
comparator),
ASSERT(std::is_sorted(m_Covering[childLevel].begin(), m_Covering[childLevel].end(), comparator),
(m_Covering[childLevel]));
ASSERT(std::is_sorted(m_Covering[parentLevel].begin(), m_Covering[parentLevel].end(),
comparator),
ASSERT(std::is_sorted(m_Covering[parentLevel].begin(), m_Covering[parentLevel].end(), comparator),
(m_Covering[parentLevel]));
SetDifferenceUnlimited(m_Covering[childLevel].begin(), m_Covering[childLevel].end(),
m_Covering[parentLevel].begin(), m_Covering[parentLevel].end(),
@@ -229,8 +222,7 @@ private:
if (i + 3 < a.size())
{
CellId const parent = a[i].Parent();
if (parent == a[i + 1].Parent() && parent == a[i + 2].Parent() &&
parent == a[i + 3].Parent())
if (parent == a[i + 1].Parent() && parent == a[i + 2].Parent() && parent == a[i + 3].Parent())
{
parents.push_back(parent);
i += 3;
@@ -263,8 +255,7 @@ private:
static void CoverTriangleImpl(CoverTriangleInfo const & info, CellId const cell)
{
ASSERT_LESS_OR_EQUAL(cell.Level(), info.m_Level, (info.m_A, info.m_B, info.m_C));
CellObjectIntersection intersection =
IntersectCellWithTriangle(cell, info.m_A, info.m_B, info.m_C);
CellObjectIntersection intersection = IntersectCellWithTriangle(cell, info.m_A, info.m_B, info.m_C);
if (intersection == CELL_OBJECT_NO_INTERSECTION)
return;