Subject: [Boost-commit] svn:boost r81937 - sandbox-branches/geometry/index/test/rtree
From: adam.wulkiewicz_at_[hidden]
Date: 2012-12-14 07:10:34
Author: awulkiew
Date: 2012-12-14 07:10:34 EST (Fri, 14 Dec 2012)
New Revision: 81937
URL: http://svn.boost.org/trac/boost/changeset/81937
Log:
rtree assign() test commented out.
Text files modified:
sandbox-branches/geometry/index/test/rtree/test_rtree.hpp | 72 ++++++++++++++++++++--------------------
1 files changed, 36 insertions(+), 36 deletions(-)
Modified: sandbox-branches/geometry/index/test/rtree/test_rtree.hpp
==============================================================================
--- sandbox-branches/geometry/index/test/rtree/test_rtree.hpp (original)
+++ sandbox-branches/geometry/index/test/rtree/test_rtree.hpp 2012-12-14 07:10:34 EST (Fri, 14 Dec 2012)
@@ -976,7 +976,7 @@
}
template <typename Value, typename Algo, typename Box>
-void test_clear_assign(bgi::rtree<Value, Algo> & tree, std::vector<Value> const& input, Box const& qbox)
+void test_clear(bgi::rtree<Value, Algo> & tree, std::vector<Value> const& input, Box const& qbox)
{
typedef bgi::rtree<Value, Algo> T;
@@ -1001,55 +1001,55 @@
test_exactly_the_same_outputs(t, output, expected_output);
}
- //assign iterators
- {
- T t(tree);
+ ////assign iterators
+ //{
+ // T t(tree);
- BOOST_CHECK(t.size() == tree.size());
+ // BOOST_CHECK(t.size() == tree.size());
- std::vector<Value> expected_output;
- t.spatial_query(t.box(), std::back_inserter(expected_output));
-
- std::vector<Value> values_to_remove;
- t.spatial_query(bgi::intersects(qbox), std::back_inserter(values_to_remove));
- t.remove(values_to_remove);
-
- BOOST_CHECK(t.size() == tree.size() - values_to_remove.size());
+ // std::vector<Value> expected_output;
+ // t.spatial_query(t.box(), std::back_inserter(expected_output));
+ //
+ // std::vector<Value> values_to_remove;
+ // t.spatial_query(bgi::intersects(qbox), std::back_inserter(values_to_remove));
+ // t.remove(values_to_remove);
+ //
+ // BOOST_CHECK(t.size() == tree.size() - values_to_remove.size());
- t.assign(input.begin(), input.end());
+ // t.assign(input.begin(), input.end());
- BOOST_CHECK(t.size() == tree.size());
+ // BOOST_CHECK(t.size() == tree.size());
- std::vector<Value> output;
- t.spatial_query(t.box(), std::back_inserter(output));
+ // std::vector<Value> output;
+ // t.spatial_query(t.box(), std::back_inserter(output));
- test_exactly_the_same_outputs(t, output, expected_output);
- }
+ // test_exactly_the_same_outputs(t, output, expected_output);
+ //}
- //assign range
- {
- T t(tree);
+ ////assign range
+ //{
+ // T t(tree);
- BOOST_CHECK(t.size() == tree.size());
+ // BOOST_CHECK(t.size() == tree.size());
- std::vector<Value> expected_output;
- t.spatial_query(t.box(), std::back_inserter(expected_output));
+ // std::vector<Value> expected_output;
+ // t.spatial_query(t.box(), std::back_inserter(expected_output));
- std::vector<Value> values_to_remove;
- t.spatial_query(bgi::intersects(qbox), std::back_inserter(values_to_remove));
- t.remove(values_to_remove);
+ // std::vector<Value> values_to_remove;
+ // t.spatial_query(bgi::intersects(qbox), std::back_inserter(values_to_remove));
+ // t.remove(values_to_remove);
- BOOST_CHECK(t.size() == tree.size() - values_to_remove.size());
+ // BOOST_CHECK(t.size() == tree.size() - values_to_remove.size());
- t.assign(input);
+ // t.assign(input);
- BOOST_CHECK(t.size() == tree.size());
+ // BOOST_CHECK(t.size() == tree.size());
- std::vector<Value> output;
- t.spatial_query(t.box(), std::back_inserter(output));
+ // std::vector<Value> output;
+ // t.spatial_query(t.box(), std::back_inserter(output));
- test_exactly_the_same_outputs(t, output, expected_output);
- }
+ // test_exactly_the_same_outputs(t, output, expected_output);
+ //}
}
// run all tests for a single Algorithm and single rtree
@@ -1088,7 +1088,7 @@
test_create_insert(tree, input, qbox);
test_remove(tree, input, qbox);
- test_clear_assign(tree, input, qbox);
+ test_clear(tree, input, qbox);
// empty tree test