1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*
* This file is part of the LibreOffice project.
*
* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/.
*
* This file incorporates work covered by the following license notice:
*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed
* with this work for additional information regarding copyright
* ownership. The ASF licenses this file to you under the Apache
* License, Version 2.0 (the "License"); you may not use this file
* except in compliance with the License. You may obtain a copy of
* the License at http://www.apache.org/licenses/LICENSE-2.0 .
*/
#include <list.hxx>
#include <numrule.hxx>
#include <ndarr.hxx>
#include <node.hxx>
#include <utility>
SwList::SwList( OUString sListId,
SwNumRule& rDefaultListStyle,
const SwNodes& rNodes )
: msListId( std::move(sListId) ),
msDefaultListStyleName( rDefaultListStyle.GetName() ),
mnMarkedListLevel( MAXLEVEL )
{
// create empty list trees for the document ranges
const SwNode* pNode = rNodes[SwNodeOffset(0)];
std::vector<bool> aVisited(static_cast<sal_Int32>(rNodes.Count()), false);
do
{
SwNodeOffset nIndex = pNode->GetIndex();
if (aVisited[static_cast<sal_Int32>(nIndex)])
{
// crashtesting ooo84576-1.odt, which manages to trigger a broken document structure
// in our code. This is just a workaround to prevent an infinite loop leading to OOM.
SAL_WARN("sw.core", "corrupt document structure, bailing out of infinite loop");
throw css::uno::RuntimeException(u"corrupt document structure, bailing out of infinite loop"_ustr);
}
aVisited[static_cast<sal_Int32>(nIndex)] = true;
SwPaM aPam( *pNode, *pNode->EndOfSectionNode() );
maListTrees.emplace_back(
std::make_unique<SwNodeNum>( &rDefaultListStyle ),
std::make_unique<SwNodeNum>( &rDefaultListStyle ),
std::make_unique<SwNodeNum>( &rDefaultListStyle ),
std::make_unique<SwPaM>( *(aPam.Start()), *(aPam.End()) ));
pNode = pNode->EndOfSectionNode();
if (pNode != &rNodes.GetEndOfContent())
{
nIndex = pNode->GetIndex();
nIndex++;
pNode = rNodes[nIndex];
}
}
while ( pNode != &rNodes.GetEndOfContent() );
}
SwList::~SwList() COVERITY_NOEXCEPT_FALSE
{
for ( auto& rNumberTree : maListTrees )
{
SwNodeNum::HandleNumberTreeRootNodeDelete(*(rNumberTree.pRoot));
SwNodeNum::HandleNumberTreeRootNodeDelete(*(rNumberTree.pRootRLHidden));
SwNodeNum::HandleNumberTreeRootNodeDelete(*(rNumberTree.pRootOrigText));
}
}
bool SwList::HasNodes() const
{
for (auto const& rNumberTree : maListTrees)
{
if (rNumberTree.pRoot->GetChildCount() != 0)
{
return true;
}
}
return false;
}
void SwList::InsertListItem(SwNodeNum& rNodeNum, SwListRedlineType const eRedline,
const int nLevel, const SwDoc& rDoc)
{
const SwPosition aPosOfNodeNum( rNodeNum.GetPosition() );
const SwNodes* pNodesOfNodeNum = &(aPosOfNodeNum.GetNode().GetNodes());
for ( const auto& rNumberTree : maListTrees )
{
auto [pStart, pEnd] = rNumberTree.pSection->StartEnd(); // SwPosition*
const SwNodes* pRangeNodes = &(pStart->GetNode().GetNodes());
if ( pRangeNodes == pNodesOfNodeNum &&
*pStart <= aPosOfNodeNum && aPosOfNodeNum <= *pEnd)
{
auto const& pRoot(SwListRedlineType::HIDDEN == eRedline
? rNumberTree.pRootRLHidden
: SwListRedlineType::SHOW == eRedline
? rNumberTree.pRoot
: rNumberTree.pRootOrigText);
pRoot->AddChild(&rNodeNum, nLevel, rDoc);
break;
}
}
}
void SwList::RemoveListItem(SwNodeNum& rNodeNum, const SwDoc& rDoc)
{
rNodeNum.RemoveMe(rDoc);
}
void SwList::InvalidateListTree()
{
for ( const auto& rNumberTree : maListTrees )
{
rNumberTree.pRoot->InvalidateTree();
rNumberTree.pRootRLHidden->InvalidateTree();
rNumberTree.pRootOrigText->InvalidateTree();
}
}
void SwList::ValidateListTree(const SwDoc& rDoc)
{
for ( auto& rNumberTree : maListTrees )
{
rNumberTree.pRoot->NotifyInvalidChildren(rDoc);
rNumberTree.pRootRLHidden->NotifyInvalidChildren(rDoc);
rNumberTree.pRootOrigText->NotifyInvalidChildren(rDoc);
}
}
void SwList::MarkListLevel( const int nListLevel,
const bool bValue )
{
if ( bValue )
{
if ( nListLevel != mnMarkedListLevel )
{
if ( mnMarkedListLevel != MAXLEVEL )
{
// notify former marked list nodes
NotifyItemsOnListLevel( mnMarkedListLevel );
}
mnMarkedListLevel = nListLevel;
// notify new marked list nodes
NotifyItemsOnListLevel( mnMarkedListLevel );
}
}
else
{
if ( mnMarkedListLevel != MAXLEVEL )
{
// notify former marked list nodes
NotifyItemsOnListLevel( mnMarkedListLevel );
}
mnMarkedListLevel = MAXLEVEL;
}
}
bool SwList::IsListLevelMarked( const int nListLevel ) const
{
return nListLevel == mnMarkedListLevel;
}
void SwList::NotifyItemsOnListLevel( const int nLevel )
{
for ( auto& rNumberTree : maListTrees )
{
rNumberTree.pRoot->NotifyNodesOnListLevel( nLevel );
rNumberTree.pRootRLHidden->NotifyNodesOnListLevel( nLevel );
rNumberTree.pRootOrigText->NotifyNodesOnListLevel( nLevel );
}
}
void SwList::SetDefaultListStyleName(UIName const& rNew)
{
msDefaultListStyleName = rNew;
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
