From a3eaf5d08b5a0a0a2caa2df0f0f44e7235dc6f7e Mon Sep 17 00:00:00 2001 From: Robert Roth Date: Thu, 4 Nov 2010 01:06:10 +0200 Subject: Commented code fragments, meaningless and bogus comments removed. --- sw/inc/SwNumberTree.hxx | 61 +++++++------------------------------------------ 1 file changed, 8 insertions(+), 53 deletions(-) (limited to 'sw/inc/SwNumberTree.hxx') diff --git a/sw/inc/SwNumberTree.hxx b/sw/inc/SwNumberTree.hxx index 78abfd5138fb..8451f2222fa0 100644 --- a/sw/inc/SwNumberTree.hxx +++ b/sw/inc/SwNumberTree.hxx @@ -144,8 +144,6 @@ public: /** Remove a child. - OD 2008-02-19 #refactorlists# - no longer virtual - @param pChild child to be removed */ void RemoveChild( SwNumberTreeNode* pChild ); @@ -174,9 +172,7 @@ public: */ SwNumberTree::tSwNumTreeNumber GetNumber( bool bValidate = true ) const; - // --> OD 2008-11-26 #158694# bool IsContinueingPreviousSubTree() const; - // <-- /** Returns level numbers of this node. @@ -241,7 +237,6 @@ public: /** set level of this node - OD 2008-03-13 #refactorlists# precondition: node is already member of a list tree @author OD @@ -277,13 +272,13 @@ public: All iterators holding the last valid node in the according list of childs are set to the end of this list, thereby stating all children in the list are invalid. - OD 2007-10-26 #i83479# - made public + #i83479# - made public */ void InvalidateTree() const; /** Notifies all invalid children of this node. - OD 2007-10-26 #i83479# - made public + #i83479# - made public */ void NotifyInvalidChildren(); @@ -313,15 +308,14 @@ public: */ void NotifyInvalidSiblings(); - /** notification of all nodes in the list tree on certain list level - - OD 2008-04-17 #refactorlists# + /** + notification of all nodes in the list tree on certain list level */ void NotifyNodesOnListLevel( const int nListLevel ); /** Invalidation and notification of complete numbering tree - OD 2006-04-26 #i64010# + #i64010# Usage: on state change its needed to invalidate the complete numbering tree due to wide influence of this change. */ @@ -344,7 +338,7 @@ public: /** determines the node, which is preceding the node - OD 2007-09-06 #i81002# + #i81002# The search for the preceding node is performed for the tree below the node. To search the complete tree, the method has been called for the root of the tree. @@ -353,29 +347,6 @@ public: */ const SwNumberTreeNode* GetPrecedingNodeOf( const SwNumberTreeNode& rNode ) const; -// /** -// Returns a string representation of this node. - -// @return the string representation of this node -// */ -// virtual String ToString() const = 0; - -// /** -// Print this subtree. - -// @param o output stream to direct output to -// @param rIndent additional indent for the children of this node -// @param rMyIndent indent to use for this node -// @param nDepth number of levels to print (-1 means all levels) - -// @return output stream after output of this subtree -// */ -// String print(const String & rIndent = String(" ", -// RTL_TEXTENCODING_ASCII_US), -// const String & rMyIndent = String(" ", -// RTL_TEXTENCODING_ASCII_US), -// int nDepth = -1) const; - #ifdef DBG_UTIL static unsigned long GetInstances(); unsigned long GetSerial(); @@ -423,20 +394,16 @@ protected: */ tSwNumberTreeChildren::size_type GetChildCount() const; - // --> OD 2006-04-26 #i64010# - made pure virtual + // #i64010# - made pure virtual virtual bool HasCountedChildren() const = 0; - // <-- - // --> OD 2006-04-26 #i64010# + // #i64010# virtual bool IsCountedForNumbering() const = 0; - // <-- - // --> OD 2008-02-19 #refactorlists# // method called before this tree node has been added to the list tree virtual void PreAdd() = 0; // method called after this tree node has been removed from the list tree virtual void PostRemove() = 0; - // <-- #ifdef __SW_NUMBER_TREE_SANITY_CHECK /** @@ -461,7 +428,6 @@ protected: */ mutable SwNumberTree::tSwNumTreeNumber mnNumber; - // --> OD 2008-11-26 #158694# // boolean indicating, that a node of a not counted parent node is continueing // the numbering of parent's previous node sub tree. // Example: @@ -470,7 +436,6 @@ protected: // sdfjlksaf <-- not counted parent node // 1.2. lfjlaskf <-- mutable bool mbContinueingPreviousSubTree; - // <-- /** true this node is a phantom @@ -522,7 +487,6 @@ protected: /** Invalidation of all children - OD 2005-10-19 #126009# Usage: on state change the children have to be invalidated */ inline void InvalidateChildren() @@ -532,7 +496,6 @@ protected: /** Invalidation of parent node, if its not counted. - OD 2005-10-19 #126009# Usage: on state change the parent have to be invalidated */ inline void InvalidateNotCountedParent() @@ -587,7 +550,6 @@ protected: /** Notification of parent node siblings, if its not counted. - OD 2005-10-19 #126009# Usage: on state change the parent node and its siblings have to be notified. */ @@ -601,8 +563,6 @@ protected: /** notification of children nodes on certain depth - OD 2008-04-17 #refactorlists# - @author OD */ void NotifyChildrenOnDepth( const int nDepth ); @@ -680,8 +640,6 @@ protected: /** Return if phantoms are counted. - OD 2008-02-19 #refactorlists# - pure virtual now - @retval true phantoms are counted @retval false else */ @@ -695,9 +653,7 @@ protected: */ bool HasOnlyPhantoms() const; - // --> OD 2005-10-27 #126009# bool HasPhantomCountedParent() const; - // <-- /** HB, OD : return node, if it isn't a phantom, otherwise return first @@ -728,7 +684,6 @@ protected: /** Moves all children of this node that are greater than a given node to the destination node. - OD 2005-10-14 #125991# distinguish between node for comparing, whose children are greater, and the destination node. -- cgit v1.2.3