left arrow comments removed // <--

2 files changed, 0 insertions, 26 deletions

diff --git a/sw/source/core/SwNumberTree/SwNodeNum.cxx b/sw/source/core/SwNumberTree/SwNodeNum.cxx
index 4a3827b4e637..c0e52c1d97bc 100644
--- a/sw/source/core/SwNumberTree/SwNodeNum.cxx
+++ b/sw/source/core/SwNumberTree/SwNodeNum.cxx
@@ -37,7 +37,6 @@
 #include <stdio.h>
 // #i83479#
 #include <IDocumentListItems.hxx>
-// <--
 #include <doc.hxx>
 
 SwNodeNum::SwNodeNum( SwTxtNode* pTxtNode )
@@ -145,7 +144,6 @@ void SwNodeNum::PostRemove()
         mpNumRule = 0;
     }
 }
-// <--
 
 bool SwNodeNum::IsNotifiable() const
 {
@@ -184,7 +182,6 @@ bool SwNodeNum::IsContinuous() const
     {
         OSL_FAIL( "<SwNodeNum::IsContinuous()> - OD debug" );
     }
-    // <--
 
     return aResult;
 }
@@ -198,7 +195,6 @@ bool SwNodeNum::IsCounted() const
         // #i59559#
         // <SwTxtNode::IsCounted()> determines, if a text node is counted for numbering
         aResult = GetTxtNode()->IsCountedInList();
-        // <--
     }
     else
         aResult = SwNumberTreeNode::IsCounted();
@@ -230,7 +226,6 @@ bool SwNodeNum::HasCountedChildren() const
 
     return bResult;
 }
-// <--
 // #i64010#
 bool SwNodeNum::IsCountedForNumbering() const
 {
@@ -240,7 +235,6 @@ bool SwNodeNum::IsCountedForNumbering() const
              GetTxtNode()->HasNumber() ||   // text node
              GetTxtNode()->HasBullet() );   // text node
 }
-// <--
 
 
 void SwNodeNum::NotifyNode()
@@ -265,7 +259,6 @@ bool SwNodeNum::LessThan(const SwNumberTreeNode & rNode) const
         // #i83479# - refactoring
         // simplify comparison by comparing the indexes of the text nodes
         bResult = ( mpTxtNode->GetIndex() < rTmpNode.mpTxtNode->GetIndex() ) ? true : false;
-        // <--
     }
 
     return bResult;
@@ -296,7 +289,6 @@ bool SwNodeNum::IsCountPhantoms() const
     {
         OSL_FAIL( "<SwNodeNum::IsCountPhantoms(): missing numbering rule - please inform OD" );
     }
-    // <--
 
     return bResult;
 }
@@ -391,11 +383,9 @@ void SwNodeNum::_UnregisterMeAndChildrenDueToRootDelete( SwNodeNum& rNodeNum )
             pTxtNode->GetDoc()->ResetAttrs( aPam, sal_False,
                                             &aResetAttrsArray,
                                             false );
-            // <--
         }
     }
 }
-// <--
 
 // #i81002#
 const SwNodeNum* SwNodeNum::GetPrecedingNodeNumOf( const SwTxtNode& rTxtNode ) const
@@ -404,7 +394,6 @@ const SwNodeNum* SwNodeNum::GetPrecedingNodeNumOf( const SwTxtNode& rTxtNode ) c
 
     // #i83479#
     SwNodeNum aNodeNumForTxtNode( const_cast<SwTxtNode*>(&rTxtNode) );
-    // <--
 
     pPrecedingNodeNum = dynamic_cast<const SwNodeNum*>(
                             GetRoot()
@@ -413,6 +402,5 @@ const SwNodeNum* SwNodeNum::GetPrecedingNodeNumOf( const SwTxtNode& rTxtNode ) c
 
     return pPrecedingNodeNum;
 }
-// <--
 
 /* vim:set shiftwidth=4 softtabstop=4 expandtab: */
diff --git a/sw/source/core/SwNumberTree/SwNumberTree.cxx b/sw/source/core/SwNumberTree/SwNumberTree.cxx
index 6f259e81a128..184f94c8273e 100644
--- a/sw/source/core/SwNumberTree/SwNumberTree.cxx
+++ b/sw/source/core/SwNumberTree/SwNumberTree.cxx
@@ -140,7 +140,6 @@ void SwNumberTreeNode::ClearObsoletePhantoms()
             // is referenced by <mItLastValid>, it's needed to adjust
             // <mItLastValid> before erasing <aIt>.
             SetLastValid(mChildren.end());
-            // <--
 
             delete *aIt;
             mChildren.erase(aIt);
@@ -243,11 +242,9 @@ void SwNumberTreeNode::ValidateHierarchical(const SwNumberTreeNode * pNode) cons
                 else
                     ++nTmpNumber;
             }
-            // <--
 
             (*aIt)->mnNumber = nTmpNumber;
         }
-        // <--
 
         SetLastValid(aIt, true);
     }
@@ -282,7 +279,6 @@ void SwNumberTreeNode::ValidateContinuous(const SwNumberTreeNode * pNode) const
                 if ( !(*aIt)->IsCounted() )
                     // #i65284#
                     nTmpNumber = pPred->GetNumber( pPred->GetParent() != (*aIt)->GetParent() );
-                    // <--
                 else
                 {
                     if ( (*aIt)->IsRestart() )
@@ -303,7 +299,6 @@ void SwNumberTreeNode::ValidateContinuous(const SwNumberTreeNode * pNode) const
                        nTmpNumber = GetStartValue();
                 }
             }
-            // <--
 
             (*aIt)->mnNumber = nTmpNumber;
         }
@@ -313,7 +308,6 @@ void SwNumberTreeNode::ValidateContinuous(const SwNumberTreeNode * pNode) const
     // #i74748# - applied patch from garnier_romain
     // number tree node has to be validated.
     SetLastValid( aIt, true );
-    // <--
 }
 
 void SwNumberTreeNode::Validate(const SwNumberTreeNode * pNode) const
@@ -406,7 +400,6 @@ void SwNumberTreeNode::MoveGreaterChildren( SwNumberTreeNode& _rCompareNode,
         // the element, which is referenced by <mItLastValid>, it's needed to
         // adjust <mItLastValid> before erasing <aIt>.
         SetLastValid( mChildren.end() );
-        // <--
 
         mChildren.erase(aItUpper, mChildren.end());
 
@@ -415,7 +408,6 @@ void SwNumberTreeNode::MoveGreaterChildren( SwNumberTreeNode& _rCompareNode,
         {
             SetLastValid( --(mChildren.end()) );
         }
-        // <--
     }
 
 #ifdef __SW_NUMBER_TREE_SANITY_CHECK
@@ -436,7 +428,6 @@ void SwNumberTreeNode::MoveChildren(SwNumberTreeNode * pDest)
         // which is referenced by <mItLastValid>, it's needed to adjust
         // <mItLastValid> before erasing <aItBegin>.
         SetLastValid(mChildren.end());
-        // <--
 
         if (pMyFirst->IsPhantom())
         {
@@ -598,7 +589,6 @@ void SwNumberTreeNode::AddChild( SwNumberTreeNode * pChild,
                 }
                 // assure that unnessary created phantoms at <pChild> are deleted.
                 pChild->ClearObsoletePhantoms();
-                // <--
 
                 if ((*aPredIt)->IsValid())
                     SetLastValid(aPredIt);
@@ -688,7 +678,6 @@ void SwNumberTreeNode::RemoveChild(SwNumberTreeNode * pChild)
             SetLastValid(mChildren.end());
         else
             SetLastValid(aItPred);
-        // <--
 
         mChildren.erase(aRemoveIt);
 
@@ -1068,7 +1057,6 @@ SwNumberTreeNode * SwNumberTreeNode::GetPred(bool bSibling) const
             // #i64311#
             // root node is no valid predecessor
             pResult = mpParent->GetParent() ? mpParent : NULL;
-            // <--
         }
         else
         {
@@ -1237,7 +1225,6 @@ void SwNumberTreeNode::NotifyInvalidChildren()
             }
         }
 
-        // <--
     }
 
     if (IsContinuous() && mpParent)
@@ -1281,7 +1268,6 @@ const SwNumberTreeNode* SwNumberTreeNode::GetPrecedingNodeOf(
 
     return pPrecedingNode;
 }
-// <--
 
 void SwNumberTreeNode::NotifyNodesOnListLevel( const int nListLevel )
 {