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

From: ockham_at_[hidden]
Date: 2008-07-23 11:02:53

Author: bernhard.reiter
Date: 2008-07-23 11:02:53 EDT (Wed, 23 Jul 2008)
New Revision: 47715
URL: http://svn.boost.org/trac/boost/changeset/47715

Log:
Use make_ascending_cursor factory instead of ascending_cursor<cursor> ctor.
Text files modified: 
   sandbox/SOC/2006/tree/trunk/libs/tree/test/iterator_algorithm_test.cpp |    26 +++++++++++++-------------              
   1 files changed, 13 insertions(+), 13 deletions(-)

Modified: sandbox/SOC/2006/tree/trunk/libs/tree/test/iterator_algorithm_test.cpp
==============================================================================
--- sandbox/SOC/2006/tree/trunk/libs/tree/test/iterator_algorithm_test.cpp	(original)
+++ sandbox/SOC/2006/tree/trunk/libs/tree/test/iterator_algorithm_test.cpp	2008-07-23 11:02:53 EDT (Wed, 23 Jul 2008)
@@ -210,20 +210,20 @@
 
         // Now the iterators based on stack-based cursors (that don't use cursor.to_parent())
 
-	test::preorder::traversal(preorder::begin(ascending_cursor<cursor>(test_tree.root())), 
-						   	  preorder::end(ascending_cursor<cursor>(test_tree.root())));
-	test::preorder::reverse_traversal(preorder::end(ascending_cursor<cursor>(test_tree.root())), 
-								   	  preorder::begin(ascending_cursor<cursor>(test_tree.root())));	
+	test::preorder::traversal(preorder::begin(make_ascending_cursor(test_tree.root())), 
+						   	  preorder::end(make_ascending_cursor(test_tree.root())));
+	test::preorder::reverse_traversal(preorder::end(make_ascending_cursor(test_tree.root())), 
+								   	  preorder::begin(make_ascending_cursor(test_tree.root())));	
         
-	test::inorder::traversal(inorder::begin(ascending_cursor<cursor>(test_tree.root())), 
-							 inorder::end(ascending_cursor<cursor>(test_tree.root())));
-	test::inorder::reverse_traversal(inorder::end(ascending_cursor<cursor>(test_tree.root())), 
-									 inorder::begin(ascending_cursor<cursor>(test_tree.root())));
-
-	test::postorder::traversal(postorder::begin(ascending_cursor<cursor>(test_tree.root())), 
-						   	   postorder::end(ascending_cursor<cursor>(test_tree.root())));
-	test::postorder::reverse_traversal(postorder::end(ascending_cursor<cursor>(test_tree.root())), 
-								   	   postorder::begin(ascending_cursor<cursor>(test_tree.root())));
+	test::inorder::traversal(inorder::begin(make_ascending_cursor(test_tree.root())), 
+							 inorder::end(make_ascending_cursor(test_tree.root())));
+	test::inorder::reverse_traversal(inorder::end(make_ascending_cursor(test_tree.root())), 
+									 inorder::begin(make_ascending_cursor(test_tree.root())));
+
+	test::postorder::traversal(postorder::begin(make_ascending_cursor(test_tree.root())), 
+						   	   postorder::end(make_ascending_cursor(test_tree.root())));
+	test::postorder::reverse_traversal(postorder::end(make_ascending_cursor(test_tree.root())), 
+								   	   postorder::begin(make_ascending_cursor(test_tree.root())));
 
         //Ascending iterator.
         binary_tree<int>::cursor c = test_tree.root();