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
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
|
/* -*- 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 "layoutatomvisitors.hxx"
#include <drawingml/customshapeproperties.hxx>
#include <sal/log.hxx>
using namespace ::com::sun::star;
using namespace ::com::sun::star::uno;
using namespace ::com::sun::star::xml::sax;
using namespace ::oox::core;
namespace oox::drawingml {
void ShapeCreationVisitor::visit(ConstraintAtom& /*rAtom*/)
{
// stop processing
}
void ShapeCreationVisitor::visit(RuleAtom& /*rAtom*/)
{
// stop processing
}
void ShapeCreationVisitor::visit(AlgAtom& rAtom)
{
if (meLookFor == ALGORITHM)
{
mpParentShape->setAspectRatio(rAtom.getAspectRatio());
mpParentShape->setVerticalShapesCount(rAtom.getVerticalShapesCount(mpParentShape));
}
}
void ShapeCreationVisitor::visit(LayoutNode& rAtom)
{
if (meLookFor != LAYOUT_NODE)
return;
// stop processing if it's not a child of previous LayoutNode
const DiagramData::PointsNameMap::const_iterator aDataNode = mrDgm.getData()->getPointsPresNameMap().find(rAtom.getName());
if (aDataNode == mrDgm.getData()->getPointsPresNameMap().end() || mnCurrIdx >= static_cast<sal_Int32>(aDataNode->second.size()))
return;
const dgm::Point* pNewNode = aDataNode->second.at(mnCurrIdx);
if (!mpCurrentNode || !pNewNode)
return;
bool bIsChild = false;
for (const auto & aConnection : mrDgm.getData()->getConnections())
if (aConnection.msSourceId == mpCurrentNode->msModelId && aConnection.msDestId == pNewNode->msModelId)
bIsChild = true;
if (!bIsChild)
return;
ShapePtr pCurrParent(mpParentShape);
if (rAtom.getExistingShape())
{
// reuse existing shape
ShapePtr pShape = rAtom.getExistingShape();
if (rAtom.setupShape(pShape, pNewNode, mnCurrIdx))
{
pShape->setInternalName(rAtom.getName());
rAtom.addNodeShape(pShape);
mrDgm.getLayout()->getPresPointShapeMap()[pNewNode] = pShape;
}
}
else
{
ShapeTemplateVisitor aTemplateVisitor(mrDgm, pNewNode);
aTemplateVisitor.defaultVisit(rAtom);
ShapePtr pShape = aTemplateVisitor.getShapeCopy();
if (pShape)
{
SAL_INFO(
"oox.drawingml",
"processing shape type " << (pShape->getCustomShapeProperties()->getShapePresetType()));
if (rAtom.setupShape(pShape, pNewNode, mnCurrIdx))
{
pShape->setInternalName(rAtom.getName());
pCurrParent->addChild(pShape);
pCurrParent = pShape;
rAtom.addNodeShape(pShape);
mrDgm.getLayout()->getPresPointShapeMap()[pNewNode] = pShape;
}
}
else
{
SAL_WARN("oox.drawingml", "ShapeCreationVisitor::visit: no shape set while processing layoutnode named " << rAtom.getName());
}
}
const dgm::Point* pPreviousNode = mpCurrentNode;
mpCurrentNode = pNewNode;
// set new parent for children
ShapePtr pPreviousParent(mpParentShape);
mpParentShape=pCurrParent;
// process children
meLookFor = LAYOUT_NODE;
defaultVisit(rAtom);
meLookFor = ALGORITHM;
defaultVisit(rAtom);
meLookFor = LAYOUT_NODE;
// restore parent
mpParentShape=pPreviousParent;
mpCurrentNode = pPreviousNode;
}
void ShapeCreationVisitor::visit(ShapeAtom& /*rAtom*/)
{
// stop processing
}
void ShapeTemplateVisitor::visit(ConstraintAtom& /*rAtom*/)
{
// stop processing
}
void ShapeTemplateVisitor::visit(RuleAtom& /*rAtom*/)
{
// stop processing
}
void ShapeTemplateVisitor::visit(AlgAtom& /*rAtom*/)
{
// stop processing
}
void ShapeTemplateVisitor::visit(ForEachAtom& /*rAtom*/)
{
// stop processing
}
void ShapeTemplateVisitor::visit(LayoutNode& /*rAtom*/)
{
// stop processing - only traverse Condition/Choose atoms
}
void ShapeTemplateVisitor::visit(ShapeAtom& rAtom)
{
if (mpShape)
{
SAL_WARN("oox.drawingml", "multiple shapes encountered inside LayoutNode");
return;
}
const ShapePtr& pCurrShape(rAtom.getShapeTemplate());
// TODO(F3): cloned shape shares all properties by reference,
// don't change them!
mpShape = std::make_shared<Shape>(pCurrShape);
// Fill properties have to be changed as sometimes only the presentation node contains the blip
// fill, unshare those.
mpShape->cloneFillProperties();
}
void ShapeLayoutingVisitor::visit(ConstraintAtom& rAtom)
{
if (meLookFor == CONSTRAINT)
rAtom.parseConstraint(maConstraints, /*bRequireForName=*/true);
}
void ShapeLayoutingVisitor::visit(RuleAtom& rAtom)
{
if (meLookFor == RULE)
rAtom.parseRule(maRules);
}
void ShapeLayoutingVisitor::visit(AlgAtom& rAtom)
{
if (meLookFor == ALGORITHM)
{
const PresPointShapeMap aMap = rAtom.getLayoutNode().getDiagram().getLayout()->getPresPointShapeMap();
auto pShape = aMap.find(mpCurrentNode);
if (pShape != aMap.end())
rAtom.layoutShape(pShape->second, maConstraints, maRules);
}
}
void ShapeLayoutingVisitor::visit(LayoutNode& rAtom)
{
if (meLookFor != LAYOUT_NODE)
return;
// stop processing if it's not a child of previous LayoutNode
const DiagramData::PointsNameMap::const_iterator aDataNode
= mrDgm.getData()->getPointsPresNameMap().find(rAtom.getName());
if (aDataNode == mrDgm.getData()->getPointsPresNameMap().end()
|| mnCurrIdx >= static_cast<sal_Int32>(aDataNode->second.size()))
return;
const dgm::Point* pNewNode = aDataNode->second.at(mnCurrIdx);
if (!mpCurrentNode || !pNewNode)
return;
bool bIsChild = false;
for (const auto& aConnection : mrDgm.getData()->getConnections())
if (aConnection.msSourceId == mpCurrentNode->msModelId
&& aConnection.msDestId == pNewNode->msModelId)
bIsChild = true;
if (!bIsChild)
return;
size_t nParentConstraintsNumber = maConstraints.size();
const dgm::Point* pPreviousNode = mpCurrentNode;
mpCurrentNode = pNewNode;
// process alg atoms first, nested layout nodes afterwards
meLookFor = CONSTRAINT;
defaultVisit(rAtom);
meLookFor = RULE;
defaultVisit(rAtom);
meLookFor = ALGORITHM;
defaultVisit(rAtom);
meLookFor = LAYOUT_NODE;
defaultVisit(rAtom);
mpCurrentNode = pPreviousNode;
// delete added constraints, keep parent constraints
maConstraints.erase(maConstraints.begin() + nParentConstraintsNumber, maConstraints.end());
}
void ShapeLayoutingVisitor::visit(ShapeAtom& /*rAtom*/)
{
// stop processing
}
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
