Kaydet (Commit) fc7f3f44 authored tarafından Michael Stahl's avatar Michael Stahl

Revert "revert 25622f29 in list.cxx"

This reverts commit fa2167fe ...
and fixes the merge conflicts.

Change-Id: I57fa6b9e7d35e0fc28d941f2968854a52b17b995
üst 418206ee
...@@ -115,13 +115,10 @@ SwListImpl::SwListImpl( const OUString& sListId, ...@@ -115,13 +115,10 @@ SwListImpl::SwListImpl( const OUString& sListId,
SwListImpl::~SwListImpl() COVERITY_NOEXCEPT_FALSE SwListImpl::~SwListImpl() COVERITY_NOEXCEPT_FALSE
{ {
tListTrees::iterator aNumberTreeIter; for ( auto& rNumberTree : maListTrees )
for ( aNumberTreeIter = maListTrees.begin();
aNumberTreeIter != maListTrees.end();
++aNumberTreeIter )
{ {
SwNodeNum::HandleNumberTreeRootNodeDelete(*((*aNumberTreeIter).pRoot)); SwNodeNum::HandleNumberTreeRootNodeDelete(*(rNumberTree.pRoot));
SwNodeNum::HandleNumberTreeRootNodeDelete(*((*aNumberTreeIter).pRootRLHidden)); SwNodeNum::HandleNumberTreeRootNodeDelete(*(rNumberTree.pRootRLHidden));
} }
} }
...@@ -131,21 +128,18 @@ void SwListImpl::InsertListItem( SwNodeNum& rNodeNum, bool const isHiddenRedline ...@@ -131,21 +128,18 @@ void SwListImpl::InsertListItem( SwNodeNum& rNodeNum, bool const isHiddenRedline
const SwPosition aPosOfNodeNum( rNodeNum.GetPosition() ); const SwPosition aPosOfNodeNum( rNodeNum.GetPosition() );
const SwNodes* pNodesOfNodeNum = &(aPosOfNodeNum.nNode.GetNode().GetNodes()); const SwNodes* pNodesOfNodeNum = &(aPosOfNodeNum.nNode.GetNode().GetNodes());
tListTrees::const_iterator aNumberTreeIter; for ( const auto& rNumberTree : maListTrees )
for ( aNumberTreeIter = maListTrees.begin();
aNumberTreeIter != maListTrees.end();
++aNumberTreeIter )
{ {
const SwPosition* pStart = (*aNumberTreeIter).pSection->Start(); const SwPosition* pStart = rNumberTree.pSection->Start();
const SwPosition* pEnd = (*aNumberTreeIter).pSection->End(); const SwPosition* pEnd = rNumberTree.pSection->End();
const SwNodes* pRangeNodes = &(pStart->nNode.GetNode().GetNodes()); const SwNodes* pRangeNodes = &(pStart->nNode.GetNode().GetNodes());
if ( pRangeNodes == pNodesOfNodeNum && if ( pRangeNodes == pNodesOfNodeNum &&
*pStart <= aPosOfNodeNum && aPosOfNodeNum <= *pEnd) *pStart <= aPosOfNodeNum && aPosOfNodeNum <= *pEnd)
{ {
auto const& pRoot(isHiddenRedlines auto const& pRoot(isHiddenRedlines
? (*aNumberTreeIter).pRootRLHidden ? rNumberTree.pRootRLHidden
: (*aNumberTreeIter).pRoot); : rNumberTree.pRoot);
pRoot->AddChild(&rNodeNum, nLevel); pRoot->AddChild(&rNodeNum, nLevel);
break; break;
} }
...@@ -159,25 +153,19 @@ void SwListImpl::RemoveListItem( SwNodeNum& rNodeNum ) ...@@ -159,25 +153,19 @@ void SwListImpl::RemoveListItem( SwNodeNum& rNodeNum )
void SwListImpl::InvalidateListTree() void SwListImpl::InvalidateListTree()
{ {
tListTrees::iterator aNumberTreeIter; for ( auto& rNumberTree : maListTrees )
for ( aNumberTreeIter = maListTrees.begin();
aNumberTreeIter != maListTrees.end();
++aNumberTreeIter )
{ {
(*aNumberTreeIter).pRoot->InvalidateTree(); rNumberTree.pRoot->InvalidateTree();
(*aNumberTreeIter).pRootRLHidden->InvalidateTree(); rNumberTree.pRootRLHidden->InvalidateTree();
} }
} }
void SwListImpl::ValidateListTree() void SwListImpl::ValidateListTree()
{ {
tListTrees::iterator aNumberTreeIter; for ( auto& rNumberTree : maListTrees )
for ( aNumberTreeIter = maListTrees.begin();
aNumberTreeIter != maListTrees.end();
++aNumberTreeIter )
{ {
(*aNumberTreeIter).pRoot->NotifyInvalidChildren(); rNumberTree.pRoot->NotifyInvalidChildren();
(*aNumberTreeIter).pRootRLHidden->NotifyInvalidChildren(); rNumberTree.pRootRLHidden->NotifyInvalidChildren();
} }
} }
...@@ -219,13 +207,10 @@ bool SwListImpl::IsListLevelMarked( const int nListLevel ) const ...@@ -219,13 +207,10 @@ bool SwListImpl::IsListLevelMarked( const int nListLevel ) const
void SwListImpl::NotifyItemsOnListLevel( const int nLevel ) void SwListImpl::NotifyItemsOnListLevel( const int nLevel )
{ {
tListTrees::iterator aNumberTreeIter; for ( auto& rNumberTree : maListTrees )
for ( aNumberTreeIter = maListTrees.begin();
aNumberTreeIter != maListTrees.end();
++aNumberTreeIter )
{ {
(*aNumberTreeIter).pRoot->NotifyNodesOnListLevel( nLevel ); rNumberTree.pRoot->NotifyNodesOnListLevel( nLevel );
(*aNumberTreeIter).pRootRLHidden->NotifyNodesOnListLevel( nLevel ); rNumberTree.pRootRLHidden->NotifyNodesOnListLevel( nLevel );
} }
} }
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment