[Boost-commit] svn:boost r50427 - in sandbox/SOC/2006/tree/trunk/boost/tree: . detail/algorithm detail/balancers

Subject: [Boost-commit] svn:boost r50427 - in sandbox/SOC/2006/tree/trunk/boost/tree: . detail/algorithm detail/balancers
From: ockham_at_[hidden]
Date: 2009-01-01 07:15:37

Author: bernhard.reiter
Date: 2009-01-01 07:15:36 EST (Thu, 01 Jan 2009)
New Revision: 50427
URL: http://svn.boost.org/trac/boost/changeset/50427

Log:
Rename forward, back -> successor, predecessor (to avoid confusion with sequence.back() etc)
Text files modified: 
   sandbox/SOC/2006/tree/trunk/boost/tree/algorithm.hpp                   |     4 ++--                                    
   sandbox/SOC/2006/tree/trunk/boost/tree/detail/algorithm/ascending.hpp  |     2 +-                                      
   sandbox/SOC/2006/tree/trunk/boost/tree/detail/algorithm/inorder.hpp    |     4 ++--                                    
   sandbox/SOC/2006/tree/trunk/boost/tree/detail/algorithm/iterative.hpp  |     4 ++--                                    
   sandbox/SOC/2006/tree/trunk/boost/tree/detail/algorithm/postorder.hpp  |     4 ++--                                    
   sandbox/SOC/2006/tree/trunk/boost/tree/detail/algorithm/preorder.hpp   |     4 ++--                                    
   sandbox/SOC/2006/tree/trunk/boost/tree/detail/balancers/unbalanced.hpp |     2 +-                                      
   sandbox/SOC/2006/tree/trunk/boost/tree/iterator.hpp                    |     4 ++--                                    
   8 files changed, 14 insertions(+), 14 deletions(-)

Modified: sandbox/SOC/2006/tree/trunk/boost/tree/algorithm.hpp
==============================================================================
--- sandbox/SOC/2006/tree/trunk/boost/tree/algorithm.hpp	(original)
+++ sandbox/SOC/2006/tree/trunk/boost/tree/algorithm.hpp	2009-01-01 07:15:36 EST (Thu, 01 Jan 2009)
@@ -37,7 +37,7 @@
                  , typename Cursor::difference_type n = 1)
 {
     for (; n!=0; --n)
-        forward<Order>(c);
+        successor<Order>(c);
     return c;
 }
 
@@ -52,7 +52,7 @@
                   , typename Cursor::difference_type n = 1)
 {
     for (; n!=0; --n)
-        back<Order>(c);
+        predecessor<Order>(c);
     return c;
 }
 

Modified: sandbox/SOC/2006/tree/trunk/boost/tree/detail/algorithm/ascending.hpp
==============================================================================
--- sandbox/SOC/2006/tree/trunk/boost/tree/detail/algorithm/ascending.hpp	(original)
+++ sandbox/SOC/2006/tree/trunk/boost/tree/detail/algorithm/ascending.hpp	2009-01-01 07:15:36 EST (Thu, 01 Jan 2009)
@@ -30,7 +30,7 @@
  * @ingroup    traversal
  */
 template <class MultiwayCursor>
-inline void forward(ascending, MultiwayCursor& c)
+inline void successor(ascending, MultiwayCursor& c)
 {
     c.to_parent();
     return;

Modified: sandbox/SOC/2006/tree/trunk/boost/tree/detail/algorithm/inorder.hpp
==============================================================================
--- sandbox/SOC/2006/tree/trunk/boost/tree/detail/algorithm/inorder.hpp	(original)
+++ sandbox/SOC/2006/tree/trunk/boost/tree/detail/algorithm/inorder.hpp	2009-01-01 07:15:36 EST (Thu, 01 Jan 2009)
@@ -43,7 +43,7 @@
     ((Descendor<MultiwayCursor>))
     ((RootTracker<MultiwayCursor>)),
     (void)) // return type
-forward(inorder, MultiwayCursor& c)
+successor(inorder, MultiwayCursor& c)
 {
     if (!(++c).empty()) {
         while (!c.to_begin().empty());
@@ -65,7 +65,7 @@
     ((Descendor<MultiwayCursor>))
     ((RootTracker<MultiwayCursor>)),
     (void)) // return type
-back(inorder, MultiwayCursor& c)
+predecessor(inorder, MultiwayCursor& c)
 {
     if (!c.empty()) {
         while (!c.to_end().empty());

Modified: sandbox/SOC/2006/tree/trunk/boost/tree/detail/algorithm/iterative.hpp
==============================================================================
--- sandbox/SOC/2006/tree/trunk/boost/tree/detail/algorithm/iterative.hpp	(original)
+++ sandbox/SOC/2006/tree/trunk/boost/tree/detail/algorithm/iterative.hpp	2009-01-01 07:15:36 EST (Thu, 01 Jan 2009)
@@ -40,7 +40,7 @@
     to_last(Order(), s2);
     while (s!=s2) {
         f(*s);
-        forward(Order(), s);
+        successor(Order(), s);
     }
     return f;
 }
@@ -65,7 +65,7 @@
 
     while (cc.in()!=s2) {
         *cc.out() = op(*cc.in());
-        forward(Order(), cc);
+        successor(Order(), cc);
     }
     return cc.out();
 }

Modified: sandbox/SOC/2006/tree/trunk/boost/tree/detail/algorithm/postorder.hpp
==============================================================================
--- sandbox/SOC/2006/tree/trunk/boost/tree/detail/algorithm/postorder.hpp	(original)
+++ sandbox/SOC/2006/tree/trunk/boost/tree/detail/algorithm/postorder.hpp	2009-01-01 07:15:36 EST (Thu, 01 Jan 2009)
@@ -40,7 +40,7 @@
     ((Descendor<Cursor>))
     ((RootTracker<Cursor>)),
     (void)) // return type
-forward(postorder, Cursor& c)
+successor(postorder, Cursor& c)
 {
     c.to_parent();
 
@@ -74,7 +74,7 @@
     ((Descendor<Cursor>))
     ((RootTracker<Cursor>)),
     (void)) // return type
-back(postorder, Cursor& c)
+predecessor(postorder, Cursor& c)
 {
     if (c.is_root()) { // Root?
         c.to_begin();

Modified: sandbox/SOC/2006/tree/trunk/boost/tree/detail/algorithm/preorder.hpp
==============================================================================
--- sandbox/SOC/2006/tree/trunk/boost/tree/detail/algorithm/preorder.hpp	(original)
+++ sandbox/SOC/2006/tree/trunk/boost/tree/detail/algorithm/preorder.hpp	2009-01-01 07:15:36 EST (Thu, 01 Jan 2009)
@@ -40,7 +40,7 @@
     ((Descendor<Cursor>))
     ((RootTracker<Cursor>)),
     (void)) // return type
-forward(preorder, Cursor& c)
+successor(preorder, Cursor& c)
 {
     // If we have a left child, go there.
     if (!c.empty()) {
@@ -81,7 +81,7 @@
     ((Descendor<Cursor>))
     ((RootTracker<Cursor>)),
     (void)) // return type
-back(preorder, Cursor& c)
+predecessor(preorder, Cursor& c)
 {
     if (!c.is_root()) {
         c.to_parent();

Modified: sandbox/SOC/2006/tree/trunk/boost/tree/detail/balancers/unbalanced.hpp
==============================================================================
--- sandbox/SOC/2006/tree/trunk/boost/tree/detail/balancers/unbalanced.hpp	(original)
+++ sandbox/SOC/2006/tree/trunk/boost/tree/detail/balancers/unbalanced.hpp	2009-01-01 07:15:36 EST (Thu, 01 Jan 2009)
@@ -32,7 +32,7 @@
         //typename Tree::cursor y = x;
         if (x.begin().empty() || x.end().empty())
              return x;
-         //forward(inorder, x);
+         //successor(inorder, x);
          return next(inorder(), x);
     }
         

Modified: sandbox/SOC/2006/tree/trunk/boost/tree/iterator.hpp
==============================================================================
--- sandbox/SOC/2006/tree/trunk/boost/tree/iterator.hpp	(original)
+++ sandbox/SOC/2006/tree/trunk/boost/tree/iterator.hpp	2009-01-01 07:15:36 EST (Thu, 01 Jan 2009)
@@ -74,13 +74,13 @@
     
     void increment()
     {
-        forward(Order(), this->base_reference());
+        successor(Order(), this->base_reference());
         //BOOST_ASSERT(!index(this->base_reference()) || this->base_reference().is_root());
     }
     
     void decrement()
     {
-        back(Order(), this->base_reference());
+        predecessor(Order(), this->base_reference());
         //BOOST_ASSERT(!index(this->base_reference()) || this->base_reference().is_root());
     }
 };