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
|
/* -*- 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 .
*/
// must be first
#include <canvas/debug.hxx>
#include <canvas/verbosetrace.hxx>
#include "basecontainernode.hxx"
#include "eventqueue.hxx"
#include "tools.hxx"
#include "nodetools.hxx"
#include "delayevent.hxx"
#include <boost/bind.hpp>
#include <boost/mem_fn.hpp>
#include <algorithm>
using namespace com::sun::star;
namespace slideshow {
namespace internal {
BaseContainerNode::BaseContainerNode(
const uno::Reference< animations::XAnimationNode >& xNode,
const BaseContainerNodeSharedPtr& rParent,
const NodeContext& rContext )
: BaseNode( xNode, rParent, rContext ),
maChildren(),
mnFinishedChildren(0),
mnLeftIterations(0),
mbDurationIndefinite( isIndefiniteTiming( xNode->getEnd() ) &&
isIndefiniteTiming( xNode->getDuration() ) )
{
}
void BaseContainerNode::dispose()
{
forEachChildNode( boost::mem_fn(&Disposable::dispose) );
maChildren.clear();
BaseNode::dispose();
}
bool BaseContainerNode::init_st()
{
if( !(getXAnimationNode()->getRepeatCount() >>= mnLeftIterations) )
mnLeftIterations = 1.0;
return init_children();
}
bool BaseContainerNode::init_children()
{
mnFinishedChildren = 0;
// initialize all children
return (std::count_if(
maChildren.begin(), maChildren.end(),
boost::mem_fn(&AnimationNode::init) ) ==
static_cast<VectorOfNodes::difference_type>(maChildren.size()));
}
void BaseContainerNode::deactivate_st( NodeState eDestState )
{
mnLeftIterations = 0; // in order to make skip effect work correctly
if (eDestState == FROZEN) {
// deactivate all children that are not FROZEN or ENDED:
forEachChildNode( boost::mem_fn(&AnimationNode::deactivate),
~(FROZEN | ENDED) );
}
else {
// end all children that are not ENDED:
forEachChildNode( boost::mem_fn(&AnimationNode::end), ~ENDED );
}
}
bool BaseContainerNode::hasPendingAnimation() const
{
// does any of our children returns "true" on
// AnimationNode::hasPendingAnimation()?
// If yes, we, too, return true
VectorOfNodes::const_iterator const iEnd( maChildren.end() );
return (std::find_if(
maChildren.begin(), iEnd,
boost::mem_fn(&AnimationNode::hasPendingAnimation) ) != iEnd);
}
void BaseContainerNode::appendChildNode( AnimationNodeSharedPtr const& pNode )
{
if (! checkValidNode())
return;
// register derived classes as end listeners at all children.
// this is necessary to control the children animation
// sequence, and to determine our own end event
if (pNode->registerDeactivatingListener( getSelf() )) {
maChildren.push_back( pNode );
}
}
bool BaseContainerNode::isChildNode( AnimationNodeSharedPtr const& pNode ) const
{
// find given notifier in child vector
VectorOfNodes::const_iterator const iEnd( maChildren.end() );
VectorOfNodes::const_iterator const iFind(
std::find( maChildren.begin(), iEnd, pNode ) );
return (iFind != iEnd);
}
bool BaseContainerNode::notifyDeactivatedChild(
AnimationNodeSharedPtr const& pChildNode )
{
OSL_ASSERT( pChildNode->getState() == FROZEN ||
pChildNode->getState() == ENDED );
// early exit on invalid nodes
OSL_ASSERT( getState() != INVALID );
if( getState() == INVALID )
return false;
if (! isChildNode(pChildNode)) {
OSL_FAIL( "unknown notifier!" );
return false;
}
std::size_t const nSize = maChildren.size();
OSL_ASSERT( mnFinishedChildren < nSize );
++mnFinishedChildren;
bool bFinished = (mnFinishedChildren >= nSize);
// all children finished, and we've got indefinite duration?
// think of ParallelTimeContainer::notifyDeactivating()
// if duration given, we will be deactivated by some end event
// @see fillCommonParameters()
if (bFinished && isDurationIndefinite()) {
if( mnLeftIterations >= 1.0 )
{
mnLeftIterations -= 1.0;
}
if( mnLeftIterations >= 1.0 )
{
bFinished = false;
EventSharedPtr aRepetitionEvent =
makeDelay( boost::bind( &BaseContainerNode::repeat, this ),
0.0,
"BaseContainerNode::repeat");
getContext().mrEventQueue.addEvent( aRepetitionEvent );
}
else
{
deactivate();
}
}
return bFinished;
}
bool BaseContainerNode::repeat()
{
forEachChildNode( boost::mem_fn(&AnimationNode::end), ~ENDED );
bool bState = init_children();
if( bState )
activate_st();
return bState;
}
#if OSL_DEBUG_LEVEL >= 2 && defined(DBG_UTIL)
void BaseContainerNode::showState() const
{
for( std::size_t i=0; i<maChildren.size(); ++i )
{
BaseNodeSharedPtr pNode =
boost::dynamic_pointer_cast<BaseNode>(maChildren[i]);
VERBOSE_TRACE(
"Node connection: n0x%X -> n0x%X",
(const char*)this+debugGetCurrentOffset(),
(const char*)pNode.get()+debugGetCurrentOffset() );
pNode->showState();
}
BaseNode::showState();
}
#endif
} // namespace internal
} // namespace slideshow
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
