all bogus comments removed keeping the indentation

2 files changed, 19 insertions, 19 deletions

diff --git a/sw/source/core/SwNumberTree/SwNodeNum.cxx b/sw/source/core/SwNumberTree/SwNodeNum.cxx
index 67a0110000c6..4a3827b4e637 100644
--- a/sw/source/core/SwNumberTree/SwNodeNum.cxx
+++ b/sw/source/core/SwNumberTree/SwNodeNum.cxx
@@ -35,7 +35,7 @@
 #include <ndtxt.hxx>
 #include <pam.hxx>
 #include <stdio.h>
-// --> OD 2007-10-31 #i83479#
+// #i83479#
 #include <IDocumentListItems.hxx>
 // <--
 #include <doc.hxx>
@@ -171,7 +171,7 @@ bool SwNodeNum::IsContinuous() const
 {
     bool aResult = false;
 
-    // --> OD 2006-04-21 #i64311#
+    // #i64311#
     if ( GetNumRule() )
     {
         aResult = mpNumRule->IsContinusNum();
@@ -195,7 +195,7 @@ bool SwNodeNum::IsCounted() const
 
     if ( GetTxtNode() )
     {
-        // --> OD 2006-01-25 #i59559#
+        // #i59559#
         // <SwTxtNode::IsCounted()> determines, if a text node is counted for numbering
         aResult = GetTxtNode()->IsCountedInList();
         // <--
@@ -206,7 +206,7 @@ bool SwNodeNum::IsCounted() const
     return aResult;
 }
 
-// --> OD 2006-04-26 #i64010#
+// #i64010#
 bool SwNodeNum::HasCountedChildren() const
 {
     bool bResult = false;
@@ -231,7 +231,7 @@ bool SwNodeNum::HasCountedChildren() const
     return bResult;
 }
 // <--
-// --> OD 2006-04-26 #i64010#
+// #i64010#
 bool SwNodeNum::IsCountedForNumbering() const
 {
     return IsCounted() &&
@@ -262,7 +262,7 @@ bool SwNodeNum::LessThan(const SwNumberTreeNode & rNode) const
         bResult = true;
     else if (mpTxtNode != NULL && rTmpNode.mpTxtNode != NULL)
     {
-        // --> OD 2007-10-31 #i83479# - refactoring
+        // #i83479# - refactoring
         // simplify comparison by comparing the indexes of the text nodes
         bResult = ( mpTxtNode->GetIndex() < rTmpNode.mpTxtNode->GetIndex() ) ? true : false;
         // <--
@@ -287,7 +287,7 @@ bool SwNodeNum::IsCountPhantoms() const
 {
     bool bResult = true;
 
-    // --> OD 2006-04-21 #i64311#
+    // #i64311#
     // phantoms aren't counted in consecutive numbering rules
     if ( mpNumRule )
         bResult = !mpNumRule->IsContinusNum() &&
@@ -397,12 +397,12 @@ void SwNodeNum::_UnregisterMeAndChildrenDueToRootDelete( SwNodeNum& rNodeNum )
 }
 // <--
 
-// --> OD 2007-09-06 #i81002#
+// #i81002#
 const SwNodeNum* SwNodeNum::GetPrecedingNodeNumOf( const SwTxtNode& rTxtNode ) const
 {
     const SwNodeNum* pPrecedingNodeNum( 0 );
 
-    // --> OD 2007-10-31 #i83479#
+    // #i83479#
     SwNodeNum aNodeNumForTxtNode( const_cast<SwTxtNode*>(&rTxtNode) );
     // <--
 
diff --git a/sw/source/core/SwNumberTree/SwNumberTree.cxx b/sw/source/core/SwNumberTree/SwNumberTree.cxx
index 03ccf0e71bad..6f259e81a128 100644
--- a/sw/source/core/SwNumberTree/SwNumberTree.cxx
+++ b/sw/source/core/SwNumberTree/SwNumberTree.cxx
@@ -135,7 +135,7 @@ void SwNumberTreeNode::ClearObsoletePhantoms()
 
         if ((*aIt)->mChildren.empty())
         {
-            // --> OD 2006-01-17 #i60652#
+            // #i60652#
             // Because <mChildren.erase(aIt)> could destroy the element, which
             // is referenced by <mItLastValid>, it's needed to adjust
             // <mItLastValid> before erasing <aIt>.
@@ -274,13 +274,13 @@ void SwNumberTreeNode::ValidateContinuous(const SwNumberTreeNode * pNode) const
         {
             SwNumberTreeNode * pPred = (*aIt)->GetPred();
 
-            // --> OD 2006-04-21 #i64311#
+            // #i64311#
             // correct consideration of phantoms
             // correct consideration of restart at a number tree node
             if ( pPred )
             {
                 if ( !(*aIt)->IsCounted() )
-                    // --> OD 2006-05-12 #i65284#
+                    // #i65284#
                     nTmpNumber = pPred->GetNumber( pPred->GetParent() != (*aIt)->GetParent() );
                     // <--
                 else
@@ -310,7 +310,7 @@ void SwNumberTreeNode::ValidateContinuous(const SwNumberTreeNode * pNode) const
     }
     while (aIt != mChildren.end() && *aIt != pNode);
 
-    // --> OD 2008-05-21 #i74748# - applied patch from garnier_romain
+    // #i74748# - applied patch from garnier_romain
     // number tree node has to be validated.
     SetLastValid( aIt, true );
     // <--
@@ -401,7 +401,7 @@ void SwNumberTreeNode::MoveGreaterChildren( SwNumberTreeNode& _rCompareNode,
 
         _rDestNode.mChildren.insert(aItUpper, mChildren.end());
 
-        // --> OD 2006-01-17 #i60652#
+        // #i60652#
         // Because <mChildren.erase(aItUpper, mChildren.end())> could destroy
         // the element, which is referenced by <mItLastValid>, it's needed to
         // adjust <mItLastValid> before erasing <aIt>.
@@ -410,7 +410,7 @@ void SwNumberTreeNode::MoveGreaterChildren( SwNumberTreeNode& _rCompareNode,
 
         mChildren.erase(aItUpper, mChildren.end());
 
-        // --> OD 2006-01-17 #i60652#
+        // #i60652#
         if ( !mChildren.empty() )
         {
             SetLastValid( --(mChildren.end()) );
@@ -431,7 +431,7 @@ void SwNumberTreeNode::MoveChildren(SwNumberTreeNode * pDest)
         tSwNumberTreeChildren::iterator aItBegin = mChildren.begin();
         SwNumberTreeNode * pMyFirst = *mChildren.begin();
 
-        // --> OD 2006-01-17 #i60652#
+        // #i60652#
         // Because <mChildren.erase(aItBegin)> could destroy the element,
         // which is referenced by <mItLastValid>, it's needed to adjust
         // <mItLastValid> before erasing <aItBegin>.
@@ -680,7 +680,7 @@ void SwNumberTreeNode::RemoveChild(SwNumberTreeNode * pChild)
             (*aItPred)->NotifyInvalidChildren();
         }
 
-        // --> OD 2006-01-17 #i60652#
+        // #i60652#
         // Because <mChildren.erase(aRemoveIt)> could destroy the element,
         // which is referenced by <mItLastValid>, it's needed to adjust
         // <mItLastValid> before erasing <aRemoveIt>.
@@ -1065,7 +1065,7 @@ SwNumberTreeNode * SwNumberTreeNode::GetPred(bool bSibling) const
 
         if ( aIt == mpParent->mChildren.begin() )
         {
-            // --> OD 2006-04-24 #i64311#
+            // #i64311#
             // root node is no valid predecessor
             pResult = mpParent->GetParent() ? mpParent : NULL;
             // <--
@@ -1250,7 +1250,7 @@ void SwNumberTreeNode::NotifyInvalidSiblings()
         mpParent->NotifyInvalidChildren();
 }
 
-// --> OD 2007-09-07 #i81002#
+// #i81002#
 const SwNumberTreeNode* SwNumberTreeNode::GetPrecedingNodeOf(
                                         const SwNumberTreeNode& rNode ) const
 {