From 37dd7c6df9d2d1837dfd9b93863f79b52aedc355 Mon Sep 17 00:00:00 2001
From: Alex Shvartzkop <dudesuchamazing@gmail.com>
Date: Thu, 20 Jun 2024 18:42:03 +0300
Subject: [PATCH] Backport BOX2I_MINMAX.

---
 libs/kimath/include/math/box2_minmax.h | 91 ++++++++++++++++++++++++++
 1 file changed, 91 insertions(+)
 create mode 100644 libs/kimath/include/math/box2_minmax.h

diff --git a/libs/kimath/include/math/box2_minmax.h b/libs/kimath/include/math/box2_minmax.h
new file mode 100644
index 0000000000..03bc249d40
--- /dev/null
+++ b/libs/kimath/include/math/box2_minmax.h
@@ -0,0 +1,91 @@
+/*
+ * This program source code file is part of KiCad, a free EDA CAD application.
+ *
+ * Copyright (C) 2024 Alex Shvartzkop <dudesuchamazing@gmail.com>
+ * Copyright (C) 2024 Kicad Developers, see AUTHORS.txt for contributors.
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License
+ * as published by the Free Software Foundation; either version 2
+ * of the License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, you may find one here:
+ * http://www.gnu.org/licenses/old-licenses/gpl-2.0.html
+ * or you may search the http://www.gnu.org website for the version 2 license,
+ * or you may write to the Free Software Foundation, Inc.,
+ * 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301, USA
+ */
+
+#ifndef __BOX2_MINMAX_H
+#define __BOX2_MINMAX_H
+
+#include <math/box2.h>
+#include <geometry/seg.h>
+#include <geometry/shape_arc.h>
+
+
+/**
+ * A min-max version of BOX2 for fast intersection checking.
+ */
+struct BOX2I_MINMAX
+{
+    BOX2I_MINMAX() : m_Left( 0 ), m_Top( 0 ), m_Right( 0 ), m_Bottom( 0 ) {}
+
+    BOX2I_MINMAX( int aLeft, int aTop, int aRight, int aBottom ) :
+            m_Left( aLeft ), m_Top( aTop ), m_Right( aRight ), m_Bottom( aBottom )
+    {
+    }
+
+    BOX2I_MINMAX( const BOX2I& aBox ) :
+            m_Left( aBox.GetLeft() ), m_Top( aBox.GetTop() ), m_Right( aBox.GetRight() ),
+            m_Bottom( aBox.GetBottom() )
+    {
+    }
+
+    BOX2I_MINMAX( const VECTOR2I& aA, const VECTOR2I& aB )
+    {
+        m_Left = std::min( aA.x, aB.x );
+        m_Right = std::max( aA.x, aB.x );
+        m_Top = std::min( aA.y, aB.y );
+        m_Bottom = std::max( aA.y, aB.y );
+    }
+
+    operator BOX2I()
+    {
+        return BOX2ISafe( VECTOR2I( m_Left, m_Top ),
+                          VECTOR2L( int64_t( m_Right ) - m_Left, int64_t( m_Bottom ) - m_Top ) );
+    }
+
+    BOX2I_MINMAX( const SHAPE_ARC& aArc ) : BOX2I_MINMAX( aArc.BBox() ) {}
+
+    BOX2I_MINMAX( const SEG& aSeg ) : BOX2I_MINMAX( aSeg.A, aSeg.B ) {}
+
+    inline bool Intersects( const BOX2I_MINMAX& aOther ) const
+    {
+        // calculate the left common area coordinate:
+        int left = std::max( m_Left, aOther.m_Left );
+        // calculate the right common area coordinate:
+        int right = std::min( m_Right, aOther.m_Right );
+        // calculate the upper common area coordinate:
+        int top = std::max( m_Top, aOther.m_Top );
+        // calculate the lower common area coordinate:
+        int bottom = std::min( m_Bottom, aOther.m_Bottom );
+
+        // if a common area exists, it must have a positive (null accepted) size
+        return left <= right && top <= bottom;
+    }
+
+    int m_Left;
+    int m_Top;
+    int m_Right;
+    int m_Bottom;
+};
+
+
+#endif