/*! \file timegather.cpp
** \brief Time Gather File
**
-** $Id: timegather.cpp,v 1.1.1.1 2005/01/07 03:34:37 darco Exp $
+** $Id$
**
** \legal
** Copyright (c) 2004 Adrian Bentley
+** Copyright (c) 2007 Chris Moore
**
-** This software and associated documentation
-** are CONFIDENTIAL and PROPRIETARY property of
-** the above-mentioned copyright holder.
+** This package is free software; you can redistribute it and/or
+** modify it under the terms of the GNU General Public License as
+** published by the Free Software Foundation; either version 2 of
+** the License, or (at your option) any later version.
**
-** You may not copy, print, publish, or in any
-** other way distribute this software without
-** a prior written agreement with
-** the copyright holder.
+** This package 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
+** General Public License for more details.
** \endlegal
*/
/* ========================================================================= */
#include <synfig/layer_pastecanvas.h>
+#include "general.h"
+
#endif
/* === U S I N G =========================================================== */
{
ValueBaseTimeInfo vt;
vt.val = v;
-
+
waytracker::iterator i = waypointbiglist.find(vt);
-
+
if(i != waypointbiglist.end())
{
i->waypoints.insert(w);
{
ActiveTimeInfo vt;
vt.val = v;
-
+
acttracker::iterator i = actpointbiglist.find(vt);
-
+
if(i != actpointbiglist.end())
{
i->activepoints.insert(a);
}
//recursion functions
-void synfigapp::recurse_canvas(synfig::Canvas::Handle h, const std::set<Time> &tlist,
- timepoints_ref &vals)
+void synfigapp::recurse_canvas(synfig::Canvas::Handle h, const std::set<Time> &tlist,
+ timepoints_ref &vals, synfig::Time time_offset)
{
-
+
//synfig::info("Canvas...\n Recurse through layers");
// iterate through the layers
for(; i != end; ++i)
{
const Node::time_set &tset = (*i)->get_times();
- if(check_intersect(tset.begin(),tset.end(),tlist.begin(),tlist.end()))
+ if(check_intersect(tset.begin(),tset.end(),tlist.begin(),tlist.end(),time_offset))
{
- recurse_layer(*i,tlist,vals);
+ recurse_layer(*i,tlist,vals,time_offset);
}
}
}
-void synfigapp::recurse_layer(synfig::Layer::Handle h, const std::set<Time> &tlist,
- timepoints_ref &vals)
+void synfigapp::recurse_layer(synfig::Layer::Handle h, const std::set<Time> &tlist,
+ timepoints_ref &vals, synfig::Time time_offset)
{
// iterate through the layers
//check for special case of paste canvas
etl::handle<synfig::Layer_PasteCanvas> p = etl::handle<synfig::Layer_PasteCanvas>::cast_dynamic(h);
-
+
//synfig::info("Layer...");
-
+
if(p)
{
//synfig::info("We are a paste canvas so go into that");
//recurse into the canvas
const synfig::Node::time_set &tset = p->get_sub_canvas()->get_times();
-
- if(check_intersect(tset.begin(),tset.end(),tlist.begin(),tlist.end()))
- {
- //we have to offset the times so it won't wreck havoc if the canvas is imported more than once...
- // and so we get correct results when offsets are present
- std::set<Time> tlistoff;
- std::set<Time>::iterator i = tlist.begin(), end = tlist.end();
- for(; i != end; ++i)
- {
- tlistoff.insert(*i - p->get_time_offset());
- }
-
- recurse_canvas(p->get_sub_canvas(),tlist,vals);
- }
+ synfig::Time subcanvas_time_offset(time_offset + p->get_time_offset());
+
+ if(check_intersect(tset.begin(),tset.end(),tlist.begin(),tlist.end(),subcanvas_time_offset))
+ recurse_canvas(p->get_sub_canvas(),tlist,vals,subcanvas_time_offset);
}
//check all the valuenodes regardless...
for(; i != end; ++i)
{
const synfig::Node::time_set &tset = i->second->get_times();
-
- if(check_intersect(tset.begin(),tset.end(),tlist.begin(),tlist.end()))
+
+ if(check_intersect(tset.begin(),tset.end(),tlist.begin(),tlist.end(),time_offset))
{
- recurse_valuedesc(ValueDesc(h,i->first),tlist,vals);
+ recurse_valuedesc(ValueDesc(h,i->first),tlist,vals,time_offset);
}
}
}
static bool sorted(IT i,IT end, const CMP &cmp = CMP())
{
if(i == end) return true;
-
+
for(IT last = i++; i != end; last = i++)
{
if(!cmp(*last,*i))
return false;
}
-
+
return true;
}
-void synfigapp::recurse_valuedesc(synfigapp::ValueDesc h, const std::set<Time> &tlist,
- timepoints_ref &vals)
+void synfigapp::recurse_valuedesc(synfigapp::ValueDesc h, const std::set<Time> &tlist,
+ timepoints_ref &vals, synfig::Time time_offset)
{
//special cases for Animated, DynamicList, and Linkable
-
+
//synfig::info("ValueBasenode... %p, %s", h.get_value_node().get(),typeid(*h.get_value_node()).name());
-
-
+
+
//animated case
{
synfig::ValueNode_Animated::Handle p = synfig::ValueNode_Animated::Handle::cast_dynamic(h.get_value_node());
-
+
if(p)
{
//loop through and determine which waypoint we will need to reference
const synfig::WaypointList &w = p->waypoint_list();
-
+
synfig::WaypointList::const_iterator i = w.begin(),
end = w.end();
-
+
std::set<Time>::const_iterator j = tlist.begin(),
jend = tlist.end();
- for(; i != end && j != jend;)
+ for(; i != end && j != jend;)
{
//synfig::info("tpair t(%.3f) = %.3f", (float)*j, (float)(i->get_time()));
-
- if(j->is_equal(i->get_time()))
+
+ if((*j+time_offset).is_equal(i->get_time()))
{
vals.insert(p,*i);
++i,++j;
- }else if(*i < *j)
+ }else if(*i < *j+time_offset)
{
++i;
}else ++j;
return;
}
}
-
+
//parent dynamiclist case - just for active points for that object...
if(h.parent_is_value_node())
{
- synfig::ValueNode_DynamicList::Handle p = synfig::ValueNode_DynamicList::Handle::cast_dynamic(h.get_parent_value_node());
-
+ synfig::ValueNode_DynamicList::Handle p = synfig::ValueNode_DynamicList::Handle::cast_dynamic(h.get_parent_value_node());
+
if(p)
{
int index = h.get_index();
-
+
//check all the active points in each list...
const synfig::ActivepointList &a = p->list[index].timing_info;
-
+
//synfig::info("Our parent = dynamic list, searching in %d activepts",a.size());
-
+
std::set<Time>::const_iterator i = tlist.begin(),
end = tlist.end();
-
+
synfig::ActivepointList::const_iterator j = a.begin(),
jend = a.end();
-
+
for(; j != jend && i != end;)
{
- double it = *i;
+ double it = *i+time_offset;
double jt = j->get_time();
double diff = (double)(it - jt);
-
- //synfig::info("\ttpair match(%.4lg) - %.4lg (diff = %lg",it,jt,diff);
-
+
+ //synfig::info("\ttpair match(%.4lg) - %.4lg (diff = %lg",it,jt,diff);
+
//
if(abs(diff) < (double)Time::epsilon())
{
//synfig::info("\tActivepoint to add being referenced (%x,%s,%.4lg)",
// (int)j->get_uid(),j->state?"true":"false", (double)j->time);
vals.insert(ValueDesc(p,index),*j);
- ++i,++j;
+ ++i,++j;
}else if(it < jt)
{
++i;
//synfig::info("\tIncrementing time");
}
- else
+ else
{
++j;
//synfig::info("\tIncrementing actpt");
}
}
}
-
+
//dynamiclist case - we must still make sure that we read from the list entries the time values
// because just the linked valuenodes will not do that
{
synfig::ValueNode_DynamicList::Handle p = synfig::ValueNode_DynamicList::Handle::cast_dynamic(h.get_value_node());
-
+
if(p)
{
//synfig::info("Process dynamic list valuenode");
int index = 0;
-
- std::vector<synfig::ValueNode_DynamicList::ListEntry>::const_iterator
+
+ std::vector<synfig::ValueNode_DynamicList::ListEntry>::const_iterator
i = p->list.begin(),
end = p->list.end();
-
+
for(; i != end; ++i, ++index)
{
const Node::time_set &tset = i->get_times();
-
- if(check_intersect(tset.begin(),tset.end(),tlist.begin(),tlist.end()))
+
+ if(check_intersect(tset.begin(),tset.end(),tlist.begin(),tlist.end(),time_offset))
{
- recurse_valuedesc(ValueDesc(p,index),tlist,vals);
+ recurse_valuedesc(ValueDesc(p,index),tlist,vals,time_offset);
}
}
return;
}
}
-
+
//the linkable case...
{
etl::handle<synfig::LinkableValueNode> p = etl::handle<synfig::LinkableValueNode>::cast_dynamic(h.get_value_node());
-
+
if(p)
{
//synfig::info("Process Linkable ValueBasenode");
int i = 0, size = p->link_count();
-
+
for(; i < size; ++i)
{
ValueNode::Handle v = p->get_link(i);
const Node::time_set &tset = v->get_times();
-
- if(check_intersect(tset.begin(),tset.end(),tlist.begin(),tlist.end()))
+
+ if(check_intersect(tset.begin(),tset.end(),tlist.begin(),tlist.end(),time_offset))
{
- recurse_valuedesc(ValueDesc(p,i),tlist,vals);
+ recurse_valuedesc(ValueDesc(p,i),tlist,vals,time_offset);
}
}
}
projects / synfig.git / blobdiff