From: ockham_at_[hidden]
Date: 2008-06-14 11:11:36
Author: bernhard.reiter
Date: 2008-06-14 11:11:35 EDT (Sat, 14 Jun 2008)
New Revision: 46390
URL: http://svn.boost.org/trac/boost/changeset/46390
Log:
Minor fixes.
Properties modified:
sandbox/SOC/2006/tree/trunk/libs/tree/test/ (props changed)
Text files modified:
sandbox/SOC/2006/tree/trunk/libs/tree/test/subtree_algorithms_checks.hpp | 2 +-
sandbox/SOC/2006/tree/trunk/libs/tree/test/traverse_binary_tree_test.cpp | 20 ++++++++++----------
2 files changed, 11 insertions(+), 11 deletions(-)
Modified: sandbox/SOC/2006/tree/trunk/libs/tree/test/subtree_algorithms_checks.hpp
==============================================================================
--- sandbox/SOC/2006/tree/trunk/libs/tree/test/subtree_algorithms_checks.hpp (original)
+++ sandbox/SOC/2006/tree/trunk/libs/tree/test/subtree_algorithms_checks.hpp 2008-06-14 11:11:35 EDT (Sat, 14 Jun 2008)
@@ -76,7 +76,7 @@
oc_bi_lst_type oc_test_list = oc_bi_lst_type(it_test_list);
boost::tree::ORDER::copy(cur, oc_test_list);
-
+
// Are the elements accessed in the correct order?
BOOST_CHECK(std::equal( boost::tree::ORDER::begin(cur),
boost::tree::ORDER::end(cur),
Modified: sandbox/SOC/2006/tree/trunk/libs/tree/test/traverse_binary_tree_test.cpp
==============================================================================
--- sandbox/SOC/2006/tree/trunk/libs/tree/test/traverse_binary_tree_test.cpp (original)
+++ sandbox/SOC/2006/tree/trunk/libs/tree/test/traverse_binary_tree_test.cpp 2008-06-14 11:11:35 EDT (Sat, 14 Jun 2008)
@@ -73,17 +73,17 @@
void comparisons(binary_tree<int>::const_cursor c) {
using boost::tree::ascending_cursor;
- //if (!c.empty()) {
- test::preorder::compare_cursor_to_iterator_traversal(c);
- test::inorder::compare_cursor_to_iterator_traversal(c);
- test::postorder::compare_cursor_to_iterator_traversal(c);
+// if (!c.empty()) {
+// test::preorder::compare_cursor_to_iterator_traversal(c);
+// test::inorder::compare_cursor_to_iterator_traversal(c);
+// test::postorder::compare_cursor_to_iterator_traversal(c);
//Now same for iterators wrapped around "explicit stack"-based cursors
ascending_cursor<binary_tree<int>::const_cursor> ac(c);
test::preorder::compare_cursor_to_iterator_traversal(ac);
test::inorder::compare_cursor_to_iterator_traversal(ac);
test::postorder::compare_cursor_to_iterator_traversal(ac);
- //}
+// }
return;
}
@@ -131,11 +131,11 @@
comparisons(test_tree2.root());
// underefed_for_each(test_tree2.root(), comparisons);
-// comparisons(test_tree2.root().begin());
-// comparisons(test_tree2.root().begin().begin());
-//
-// comparisons(test_tree2.root().end());
-// comparisons(test_tree2.root().end().end());
+ comparisons(test_tree2.root().begin());
+ comparisons(test_tree2.root().begin().begin());
+
+ comparisons(test_tree2.root().end());
+ comparisons(test_tree2.root().end().end());
}
int test_main(int, char* [])