Adding upstream version 2.1.1.upstream/2.1.1upstream

Signed-off-by: Daniel Baumann <daniel.baumann@progress-linux.org>

1 files changed, 83 insertions, 0 deletions

diff --git a/test/rtree/test_intersection.cpp b/test/rtree/test_intersection.cpp
new file mode 100644
index 0000000..0cf5b93
--- /dev/null
+++ b/test/rtree/test_intersection.cpp
@@ -0,0 +1,83 @@
+/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
+/*************************************************************************
+ *
+ * Copyright (c) 2021 Kohei Yoshida
+ *
+ * Permission is hereby granted, free of charge, to any person
+ * obtaining a copy of this software and associated documentation
+ * files (the "Software"), to deal in the Software without
+ * restriction, including without limitation the rights to use,
+ * copy, modify, merge, publish, distribute, sublicense, and/or sell
+ * copies of the Software, and to permit persons to whom the
+ * Software is furnished to do so, subject to the following
+ * conditions:
+ *
+ * The above copyright notice and this permission notice shall be
+ * included in all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+ * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
+ * OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+ * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
+ * HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
+ * WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
+ * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
+ * OTHER DEALINGS IN THE SOFTWARE.
+ *
+ ************************************************************************/
+
+#include "test_global.hpp" // This must be the first header to be included.
+#include "test_global_rtree.hpp"
+
+using mdds::rtree;
+using std::cout;
+using std::endl;
+
+void rtree_test_intersection()
+{
+    stack_printer __stack_printer__("::rtree_test_intersection");
+    using rt_type = rtree<int16_t, std::string>;
+    using bounding_box = rt_type::extent_type;
+    using mdds::detail::rtree::calc_intersection;
+    using mdds::detail::rtree::calc_linear_intersection;
+
+    struct check
+    {
+        bounding_box bb1;
+        bounding_box bb2;
+        int16_t expected_length1;
+        int16_t expected_length2;
+    };
+
+    std::vector<check> checks = {
+        // bounding box 1           bounding box 2
+        {{{0, 0}, {3, 6}}, {{1, 2}, {7, 5}}, 2, 3},       {{{3, 2}, {7, 10}}, {{1, 10}, {10, 11}}, 4, 0},
+        {{{3, 2}, {7, 10}}, {{1, 9}, {10, 11}}, 4, 1},    {{{3, 2}, {7, 6}}, {{5, 4}, {11, 8}}, 2, 2},
+        {{{-2, -8}, {2, -5}}, {{0, -10}, {8, -1}}, 2, 3}, {{{2, 2}, {20, 12}}, {{5, 6}, {16, 9}}, 11, 3},
+        {{{0, 0}, {6, 6}}, {{0, 0}, {2, 3}}, 2, 3},
+    };
+
+    for (const check& c : checks)
+    {
+        int16_t length1 = calc_linear_intersection<bounding_box>(0, c.bb1, c.bb2);
+        assert(length1 == c.expected_length1);
+        int16_t length2 = calc_linear_intersection<bounding_box>(1, c.bb1, c.bb2);
+        assert(length2 == c.expected_length2);
+
+        int16_t area = calc_intersection<bounding_box>(c.bb1, c.bb2);
+        int16_t expected_area = c.expected_length1 * c.expected_length2;
+        assert(area == expected_area);
+
+        // Swap the boxes and run the same tests. We should get the same results.
+
+        length1 = calc_linear_intersection<bounding_box>(0, c.bb2, c.bb1);
+        assert(length1 == c.expected_length1);
+        length2 = calc_linear_intersection<bounding_box>(1, c.bb2, c.bb1);
+        assert(length2 == c.expected_length2);
+
+        area = calc_intersection<bounding_box>(c.bb2, c.bb1);
+        assert(area == expected_area);
+    }
+}
+
+/* vim:set shiftwidth=4 softtabstop=4 expandtab: */