2005-01-21 16:06:51 +00:00
|
|
|
/*************************************************************************
|
|
|
|
*
|
2005-09-07 19:45:40 +00:00
|
|
|
* OpenOffice.org - a multi-platform office productivity suite
|
2005-01-21 16:06:51 +00:00
|
|
|
*
|
2005-09-07 19:45:40 +00:00
|
|
|
* $RCSfile: paralleltimecontainer.cxx,v $
|
2005-01-21 16:06:51 +00:00
|
|
|
*
|
2005-10-11 07:44:01 +00:00
|
|
|
* $Revision: 1.5 $
|
2005-01-21 16:06:51 +00:00
|
|
|
*
|
2005-10-11 07:44:01 +00:00
|
|
|
* last change: $Author: obo $ $Date: 2005-10-11 08:44:01 $
|
2005-01-21 16:06:51 +00:00
|
|
|
*
|
2005-09-07 19:45:40 +00:00
|
|
|
* The Contents of this file are made available subject to
|
|
|
|
* the terms of GNU Lesser General Public License Version 2.1.
|
2005-01-21 16:06:51 +00:00
|
|
|
*
|
|
|
|
*
|
2005-09-07 19:45:40 +00:00
|
|
|
* GNU Lesser General Public License Version 2.1
|
|
|
|
* =============================================
|
|
|
|
* Copyright 2005 by Sun Microsystems, Inc.
|
|
|
|
* 901 San Antonio Road, Palo Alto, CA 94303, USA
|
2005-01-21 16:06:51 +00:00
|
|
|
*
|
2005-09-07 19:45:40 +00:00
|
|
|
* This library is free software; you can redistribute it and/or
|
|
|
|
* modify it under the terms of the GNU Lesser General Public
|
|
|
|
* License version 2.1, as published by the Free Software Foundation.
|
2005-01-21 16:06:51 +00:00
|
|
|
*
|
2005-09-07 19:45:40 +00:00
|
|
|
* This library is distributed in the hope that it will be useful,
|
|
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
|
|
* Lesser General Public License for more details.
|
2005-01-21 16:06:51 +00:00
|
|
|
*
|
2005-09-07 19:45:40 +00:00
|
|
|
* You should have received a copy of the GNU Lesser General Public
|
|
|
|
* License along with this library; if not, write to the Free Software
|
|
|
|
* Foundation, Inc., 59 Temple Place, Suite 330, Boston,
|
|
|
|
* MA 02111-1307 USA
|
2005-01-21 16:06:51 +00:00
|
|
|
*
|
|
|
|
************************************************************************/
|
|
|
|
|
|
|
|
#include <canvas/debug.hxx>
|
|
|
|
#include <canvas/verbosetrace.hxx>
|
|
|
|
|
|
|
|
#include <paralleltimecontainer.hxx>
|
|
|
|
#include <tools.hxx>
|
|
|
|
#include <nodetools.hxx>
|
|
|
|
|
|
|
|
#ifndef BOOST_BIND_HPP_INCLUDED
|
|
|
|
#include <boost/bind.hpp>
|
|
|
|
#endif
|
|
|
|
#ifndef BOOST_MEM_FN_HPP_INCLUDED
|
|
|
|
#include <boost/mem_fn.hpp>
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#include <algorithm>
|
|
|
|
|
|
|
|
using namespace ::com::sun::star;
|
|
|
|
|
|
|
|
namespace presentation
|
|
|
|
{
|
|
|
|
namespace internal
|
|
|
|
{
|
|
|
|
ParallelTimeContainer::ParallelTimeContainer( const uno::Reference< animations::XAnimationNode >& xNode,
|
|
|
|
const BaseContainerNodeSharedPtr& rParent,
|
|
|
|
const NodeContext& rContext ) :
|
|
|
|
BaseContainerNode( xNode, rParent, rContext )
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
|
|
|
bool ParallelTimeContainer::activate()
|
|
|
|
{
|
|
|
|
if( getState() == ACTIVE )
|
|
|
|
return true; // avoid duplicate event generation
|
|
|
|
|
2005-03-30 07:07:33 +00:00
|
|
|
if( !BaseContainerNode::activate() )
|
2005-01-21 16:06:51 +00:00
|
|
|
return false;
|
|
|
|
|
|
|
|
// resolve all children, only return true, if _all_
|
|
|
|
// children were resolvable.
|
|
|
|
return ::std::count_if( getChildren().begin(),
|
|
|
|
getChildren().end(),
|
|
|
|
::boost::mem_fn(&AnimationNode::resolve) )
|
|
|
|
== static_cast<VectorOfNodes::difference_type>(getChildren().size());
|
|
|
|
}
|
|
|
|
|
|
|
|
void ParallelTimeContainer::notifyDeactivating( const AnimationNodeSharedPtr& rNotifier )
|
|
|
|
{
|
|
|
|
// early exit on invalid nodes
|
|
|
|
if( getState() == INVALID )
|
|
|
|
return;
|
|
|
|
|
|
|
|
// if we don't have indefinite duration, ignore this message
|
|
|
|
if( !isDurationInfinite() )
|
|
|
|
return;
|
|
|
|
|
|
|
|
// find given notifier in child vector
|
|
|
|
const VectorOfNodes::const_iterator aBegin( getChildren().begin() );
|
|
|
|
const VectorOfNodes::const_iterator aEnd( getChildren().end() );
|
|
|
|
VectorOfNodes::const_iterator aIter;
|
|
|
|
if( (aIter=::std::find( aBegin,
|
|
|
|
aEnd,
|
|
|
|
rNotifier )) == aEnd )
|
|
|
|
{
|
|
|
|
OSL_ENSURE( false,
|
|
|
|
"ParallelTimeContainer::notifyDeactivating(): unknown notifier" );
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
const ::std::size_t nIndex( ::std::distance(aBegin, aIter) );
|
|
|
|
|
|
|
|
// prevent duplicate increments (for children that notify
|
|
|
|
// more than once)
|
|
|
|
if( getFinishedStates()[ nIndex ] == false )
|
|
|
|
++getFinishedCount();
|
|
|
|
|
|
|
|
getFinishedStates()[ nIndex ] = true;
|
|
|
|
|
|
|
|
// all children finished?
|
|
|
|
if( getFinishedCount() == getChildren().size() )
|
|
|
|
{
|
|
|
|
// yep. deactivate this node, too
|
|
|
|
deactivate();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
#if defined(VERBOSE) && defined(DBG_UTIL)
|
|
|
|
const char* ParallelTimeContainer::getDescription() const
|
|
|
|
{
|
|
|
|
return "ParallelTimeContainer";
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
}
|
|
|
|
}
|