Ticket #12287: test_rtree_insert.cpp

#define BOOST_TEST_DYN_LINK
#define BOOST_TEST_MODULE test_rtree_insert

#include <random>
#include <vector>
#include <boost/geometry.hpp>
#include <boost/test/unit_test.hpp>

#include <boost/geometry/index/rtree.hpp>

BOOST_AUTO_TEST_CASE(test_rtree_insert) {
        namespace bg = boost::geometry;
        namespace bgi = bg::index;
        typedef bg::model::point<int, 2, bg::cs::cartesian> point_t;
        typedef bgi::rtree<point_t, bgi::linear<32> > rtree_t;
        int width = 500;
        int height = 500;
        int n_points = 2000;

        rtree_t rtree;

        auto rx = std::bind(std::uniform_int_distribution<>{0, width}, std::default_random_engine{23});
        auto ry = std::bind(std::uniform_int_distribution<>{0, height}, std::default_random_engine{1223});

        int count_contains_failures = 0;
    for(int i = 0; i < n_points; i++) {
                point_t p(rx(), ry());

                rtree.insert(p);
                std::vector<point_t> result;
                auto t = rtree.query(bgi::contains(p), std::back_inserter(result));

                if(t != 1) {
                        std::cout << "failed contains for point " << p.get<0>() << ", " << p.get<1>() << std::endl;
                        count_contains_failures++;
                }

    }

    std::cout << "failed contains " << count_contains_failures << std::endl;
    BOOST_CHECK_EQUAL(count_contains_failures, 0);
}