drifty/comaps
1
0
Fork 0
mirror of https://codeberg.org/comaps/comaps synced 2025-12-21 22:03:37 +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/tree4d.hpp
View File

@@ -37,8 +37,7 @@ class Tree
bool IsIntersect(m2::RectD const & r) const
{
return !((m_pts[2] <= r.minX()) || (m_pts[0] >= r.maxX()) || (m_pts[3] <= r.minY()) ||
(m_pts[1] >= r.maxY()));
return !((m_pts[2] <= r.minX()) || (m_pts[0] >= r.maxX()) || (m_pts[3] <= r.minY()) || (m_pts[1] >= r.maxY()));
}
bool operator==(Value const & r) const { return (m_val == r.m_val); }
@@ -47,8 +46,7 @@ class Tree
{
std::ostringstream out;
out << DebugPrint(m_val) << ", (" << m_pts[0] << ", " << m_pts[1] << ", " << m_pts[2] << ", "
<< m_pts[3] << ")";
out << DebugPrint(m_val) << ", (" << m_pts[0] << ", " << m_pts[1] << ", " << m_pts[2] << ", " << m_pts[3] << ")";
return out.str();
}
@@ -77,9 +75,7 @@ class Tree
class for_each_helper
{
public:
for_each_helper(m2::RectD const & r, ToDo && toDo) : m_rect(r), m_toDo(std::forward<ToDo>(toDo))
{
}
for_each_helper(m2::RectD const & r, ToDo && toDo) : m_rect(r), m_toDo(std::forward<ToDo>(toDo)) {}
bool ScanLeft(size_t plane, Value const & v) const
{
@@ -153,7 +149,8 @@ private:
bool skip = false;
std::vector<Value const *> isect;
m_tree.for_each(GetFunctor(rect, [&](Value const & v) {
m_tree.for_each(GetFunctor(rect, [&](Value const & v)
{
if (skip)
return;
@@ -177,14 +174,14 @@ public:
template <typename Compare>
void ReplaceAllInRect(T const & obj, Compare comp)
{
ReplaceImpl(obj, GetLimitRect(obj),
[&comp](T const & t1, T const & t2) { return comp(t1, t2) ? 1 : -1; });
ReplaceImpl(obj, GetLimitRect(obj), [&comp](T const & t1, T const & t2) { return comp(t1, t2) ? 1 : -1; });
}
template <typename Equal, typename Compare>
void ReplaceEqualInRect(T const & obj, Equal eq, Compare comp)
{
ReplaceImpl(obj, GetLimitRect(obj), [&](T const & t1, T const & t2) {
ReplaceImpl(obj, GetLimitRect(obj), [&](T const & t1, T const & t2)
{
if (eq(t1, t2))
return comp(t1, t2) ? 1 : -1;
else
@@ -215,10 +212,8 @@ public:
bool ForAny(ToDo && toDo) const
{
for (Value const & v : m_tree)
{
if (toDo(v.m_val))
return true;
}
return false;
}
@@ -234,10 +229,8 @@ public:
bool FindNode(ToDo && toDo) const
{
for (Value const & v : m_tree)
{
if (toDo(v.m_val))
return true;
}
return false;
}