[Boost-commit] svn:boost r46396 - sandbox/SOC/2006/tree/trunk/libs/tree/test

From: ockham_at_[hidden]
Date: 2008-06-14 14:38:48

Author: bernhard.reiter
Date: 2008-06-14 14:38:48 EDT (Sat, 14 Jun 2008)
New Revision: 46396
URL: http://svn.boost.org/trac/boost/changeset/46396

Log:
Minor fixes
Text files modified: 
   sandbox/SOC/2006/tree/trunk/libs/tree/test/traverse_binary_tree_test.cpp |     4 ----                                    
   1 files changed, 0 insertions(+), 4 deletions(-)

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 14:38:48 EDT (Sat, 14 Jun 2008)
@@ -91,8 +91,6 @@
  * Do all that also using iterators wrapped around "explicit stack"-based cursors
  */ 
 void compare_cursor_to_iterator_traversal() {
-	using boost::tree::make_ascending_cursor;
-	
         binary_tree<int> test_tree2;
         //comparisons(test_tree2.root());
 
@@ -140,8 +138,6 @@
         comparisons(test_tree2.root());
         comparisons(make_ascending_cursor(test_tree2.root()));
 
-	typedef ascending_cursor<binary_tree<int>::cursor> ac;
-	
         // FIXME: This requires subtree cursors to know their root.
         //underefed_for_each(test_tree2.root(), comparisons<binary_tree<int>::cursor>);