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
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
|
/* -*- 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 <basegfx/range/b2drange.hxx>
#include <basegfx/range/b1drange.hxx>
#include <basegfx/range/b2dpolyrange.hxx>
#include <basegfx/polygon/b2dpolypolygon.hxx>
#include <basegfx/polygon/b2dpolypolygoncutter.hxx>
#include <osl/diagnose.h>
#include "layer.hxx"
using namespace ::com::sun::star;
namespace slideshow
{
namespace internal
{
Layer::Layer( Dummy ) :
maViewEntries(),
maBounds(),
maNewBounds(),
mbBoundsDirty(false),
mbBackgroundLayer(true),
mbClipSet(false)
{
}
Layer::Layer() :
maViewEntries(),
maBounds(),
maNewBounds(),
mbBoundsDirty(false),
mbBackgroundLayer(false),
mbClipSet(false)
{
}
ViewLayerSharedPtr Layer::addView( const ViewSharedPtr& rNewView )
{
OSL_ASSERT( rNewView );
ViewEntryVector::iterator aIter;
const ViewEntryVector::iterator aEnd( maViewEntries.end() );
if( (aIter=std::find_if( maViewEntries.begin(),
aEnd,
[&rNewView]( const ViewEntry& rViewEntry )
{ return rViewEntry.getView() == rNewView; } ) ) != aEnd )
{
// already added - just return existing layer
return aIter->mpViewLayer;
}
// not yet added - create new view layer
ViewLayerSharedPtr pNewLayer;
if( mbBackgroundLayer )
pNewLayer = rNewView;
else
pNewLayer = rNewView->createViewLayer(maBounds);
// add to local list
maViewEntries.emplace_back( rNewView,
pNewLayer );
return maViewEntries.back().mpViewLayer;
}
ViewLayerSharedPtr Layer::removeView( const ViewSharedPtr& rView )
{
OSL_ASSERT( rView );
ViewEntryVector::iterator aIter;
const ViewEntryVector::iterator aEnd( maViewEntries.end() );
if( (aIter=std::find_if( maViewEntries.begin(),
aEnd,
[&rView]( const ViewEntry& rViewEntry )
{ return rViewEntry.getView() == rView; } ) ) == aEnd )
{
// View was not added/is already removed
return ViewLayerSharedPtr();
}
OSL_ENSURE( std::count_if( maViewEntries.begin(),
aEnd,
[&rView]( const ViewEntry& rViewEntry )
{ return rViewEntry.getView() == rView; } ) == 1,
"Layer::removeView(): view added multiple times" );
ViewLayerSharedPtr pRet( aIter->mpViewLayer );
maViewEntries.erase(aIter);
return pRet;
}
void Layer::setShapeViews( ShapeSharedPtr const& rShape ) const
{
rShape->clearAllViewLayers();
for( const auto& rViewEntry : maViewEntries )
rShape->addViewLayer( rViewEntry.getViewLayer(), false );
}
void Layer::setPriority( const ::basegfx::B1DRange& rPrioRange )
{
if( !mbBackgroundLayer )
{
for( const auto& rViewEntry : maViewEntries )
rViewEntry.getViewLayer()->setPriority( rPrioRange );
}
}
void Layer::addUpdateRange( ::basegfx::B2DRange const& rUpdateRange )
{
// TODO(Q1): move this to B2DMultiRange
if( !rUpdateRange.isEmpty() )
maUpdateAreas.appendElement( rUpdateRange,
basegfx::B2VectorOrientation::Positive );
}
void Layer::updateBounds( ShapeSharedPtr const& rShape )
{
if( !mbBackgroundLayer )
{
if( !mbBoundsDirty )
maNewBounds.reset();
maNewBounds.expand( rShape->getUpdateArea() );
}
mbBoundsDirty = true;
}
bool Layer::commitBounds()
{
mbBoundsDirty = false;
if( mbBackgroundLayer )
return false;
if( maNewBounds == maBounds )
return false;
maBounds = maNewBounds;
if( std::count_if( maViewEntries.begin(),
maViewEntries.end(),
[this]( const ViewEntry& rViewEntry )
{ return rViewEntry.getViewLayer()->resize( this->maBounds ); }
) == 0 )
{
return false;
}
// layer content invalid, update areas have wrong
// coordinates/not sensible anymore.
clearUpdateRanges();
return true;
}
void Layer::clearUpdateRanges()
{
maUpdateAreas.clear();
}
void Layer::clearContent()
{
// clear content on all view layers
for( const auto& rViewEntry : maViewEntries )
rViewEntry.getViewLayer()->clearAll();
// layer content cleared, update areas are not sensible
// anymore.
clearUpdateRanges();
}
class LayerEndUpdate
{
public:
LayerEndUpdate( const LayerEndUpdate& ) = delete;
LayerEndUpdate& operator=( const LayerEndUpdate& ) = delete;
explicit LayerEndUpdate( LayerSharedPtr const& rLayer ) :
mpLayer( rLayer )
{}
~LayerEndUpdate() { if(mpLayer) mpLayer->endUpdate(); }
private:
LayerSharedPtr mpLayer;
};
Layer::EndUpdater Layer::beginUpdate()
{
if( maUpdateAreas.count() )
{
// perform proper layer update. That means, setup proper
// clipping, and render each shape that intersects with
// the calculated update area
::basegfx::B2DPolyPolygon aClip( maUpdateAreas.solveCrossovers() );
aClip = ::basegfx::utils::stripNeutralPolygons(aClip);
aClip = ::basegfx::utils::stripDispensablePolygons(aClip);
// actually, if there happen to be shapes with zero
// update area in the maUpdateAreas vector, the
// resulting clip polygon will be empty.
if( aClip.count() )
{
for( const auto& rViewEntry : maViewEntries )
{
const ViewLayerSharedPtr& pViewLayer = rViewEntry.getViewLayer();
// set clip to all view layers and
pViewLayer->setClip( aClip );
// clear update area on all view layers
pViewLayer->clear();
}
mbClipSet = true;
}
}
return std::make_shared<LayerEndUpdate>(shared_from_this());
}
void Layer::endUpdate()
{
if( mbClipSet )
{
mbClipSet = false;
basegfx::B2DPolyPolygon aEmptyClip;
for( const auto& rViewEntry : maViewEntries )
rViewEntry.getViewLayer()->setClip( aEmptyClip );
}
clearUpdateRanges();
}
bool Layer::isInsideUpdateArea( ShapeSharedPtr const& rShape ) const
{
return maUpdateAreas.overlaps( rShape->getUpdateArea() );
}
LayerSharedPtr Layer::createBackgroundLayer()
{
return LayerSharedPtr(new Layer( BackgroundLayer ));
}
LayerSharedPtr Layer::createLayer( )
{
return LayerSharedPtr( new Layer );
}
}
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
