1 /* === S Y N F I G ========================================================= */
2 /*! \file valuenode.cpp
3 ** \brief Implementation of the "Placeholder" valuenode conversion.
8 ** Copyright (c) 2002-2005 Robert B. Quattlebaum Jr., Adrian Bentley
9 ** Copyright (c) 2007 Chris Moore
11 ** This package is free software; you can redistribute it and/or
12 ** modify it under the terms of the GNU General Public License as
13 ** published by the Free Software Foundation; either version 2 of
14 ** the License, or (at your option) any later version.
16 ** This package is distributed in the hope that it will be useful,
17 ** but WITHOUT ANY WARRANTY; without even the implied warranty of
18 ** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
19 ** General Public License for more details.
22 /* ========================================================================= */
24 /* === H E A D E R S ======================================================= */
26 #define SYNFIG_NO_ANGLE
28 //#define HAS_HASH_MAP 1
37 #include "valuenode.h"
41 #include "valuenode_const.h"
42 #include "valuenode_linear.h"
43 #include "valuenode_composite.h"
44 #include "valuenode_reference.h"
45 #include "valuenode_scale.h"
46 #include "valuenode_blinecalctangent.h"
47 #include "valuenode_blinecalcvertex.h"
48 #include "valuenode_blinereversetangent.h"
49 #include "valuenode_segcalctangent.h"
50 #include "valuenode_segcalcvertex.h"
51 #include "valuenode_repeat_gradient.h"
52 #include "valuenode_stripes.h"
53 #include "valuenode_range.h"
54 #include "valuenode_add.h"
55 #include "valuenode_subtract.h"
56 #include "valuenode_timedswap.h"
57 #include "valuenode_twotone.h"
58 #include "valuenode_bline.h"
59 #include "valuenode_dynamiclist.h"
60 #include "valuenode_radialcomposite.h"
61 #include "valuenode_gradientrotate.h"
62 #include "valuenode_sine.h"
63 #include "valuenode_cos.h"
64 #include "valuenode_atan2.h"
65 #include "valuenode_exp.h"
66 #include "valuenode_switch.h"
67 #include "valuenode_timeloop.h"
68 #include "valuenode_reciprocal.h"
69 #include "valuenode_duplicate.h"
70 #include "valuenode_integer.h"
76 /* === U S I N G =========================================================== */
80 using namespace synfig;
82 /* === M A C R O S ========================================================= */
84 /* === G L O B A L S ======================================================= */
86 static int value_node_count(0);
88 static LinkableValueNode::Book *book_;
91 ValueNode::LooseHandle
92 synfig::find_value_node(const GUID& guid)
94 return guid_cast<ValueNode>(guid);
97 /* === P R O C E D U R E S ================================================= */
99 /* === M E T H O D S ======================================================= */
102 ValueNode::subsys_init()
104 book_=new LinkableValueNode::Book();
106 #define ADD_VALUENODE(class,name,local) \
107 (*book_)[name].factory=reinterpret_cast<LinkableValueNode::Factory>(&class::create); \
108 (*book_)[name].check_type=&class::check_type; \
109 (*book_)[name].local_name=local
111 #define ADD_VALUENODE2(class,name,local) \
112 (*book_)[name].factory=reinterpret_cast<LinkableValueNode::Factory>(&class::create_from); \
113 (*book_)[name].check_type=&class::check_type; \
114 (*book_)[name].local_name=local
116 ADD_VALUENODE(ValueNode_Linear, "linear", _("Linear") );
117 ADD_VALUENODE(ValueNode_Composite, "composite", _("Composite") );
118 ADD_VALUENODE(ValueNode_RadialComposite,"radial_composite", _("Radial Composite") );
119 ADD_VALUENODE(ValueNode_Reference, "reference", _("Reference") );
120 ADD_VALUENODE(ValueNode_Repeat_Gradient,"repeat_gradient", _("Repeat Gradient") );
121 ADD_VALUENODE(ValueNode_Scale, "scale", _("Scale") );
122 ADD_VALUENODE(ValueNode_BLineCalcTangent,"blinecalctangent",_("BLine Tangent") );
123 ADD_VALUENODE(ValueNode_BLineCalcVertex,"blinecalcvertex", _("BLine Vertex") );
124 ADD_VALUENODE(ValueNode_BLineRevTangent,"blinerevtangent", _("Reverse Tangent") );
125 ADD_VALUENODE(ValueNode_SegCalcTangent, "segcalctangent", _("Segment Tangent") );
126 ADD_VALUENODE(ValueNode_SegCalcVertex, "segcalcvertex", _("Segment Vertex") );
127 ADD_VALUENODE(ValueNode_Stripes, "stripes", _("Stripes") );
128 ADD_VALUENODE(ValueNode_Range, "range", _("Range") );
129 ADD_VALUENODE(ValueNode_Add, "add", _("Add") );
130 ADD_VALUENODE(ValueNode_Subtract, "subtract", _("Subtract") );
131 ADD_VALUENODE(ValueNode_TimedSwap, "timed_swap", _("Timed Swap") );
132 ADD_VALUENODE(ValueNode_TwoTone, "twotone", _("Two-Tone") );
133 ADD_VALUENODE(ValueNode_BLine, "bline", _("BLine") );
134 ADD_VALUENODE2(ValueNode_DynamicList, "dynamic_list", _("Dynamic List") );
135 ADD_VALUENODE(ValueNode_GradientRotate, "gradient_rotate", _("Gradient Rotate") );
136 ADD_VALUENODE(ValueNode_Sine, "sine", _("Sine") );
137 ADD_VALUENODE(ValueNode_Cos, "cos", _("Cos") );
138 ADD_VALUENODE(ValueNode_Atan2, "atan2", _("aTan2") );
139 ADD_VALUENODE(ValueNode_Exp, "exp", _("Exponential") );
140 ADD_VALUENODE(ValueNode_Switch, "switch", _("Switch") );
141 ADD_VALUENODE(ValueNode_TimeLoop, "timeloop", _("Time Loop") );
142 ADD_VALUENODE(ValueNode_Reciprocal, "reciprocal", _("Reciprocal") );
143 ADD_VALUENODE(ValueNode_Duplicate, "duplicate", _("Duplicate") );
144 ADD_VALUENODE(ValueNode_Integer, "fromint", _("From Integer") );
147 #undef ADD_VALUENODE2
153 ValueNode::subsys_stop()
156 /* if(global_value_node_map.size() || value_node_count)
159 synfig::error("%d ValueNodes haven't been destroyed yet!",value_node_count);
161 if(global_value_node_map.size()!=value_node_count)
162 synfig::error("value node count mismatch! map.size()!=value_node_count (%d!=%d)",global_value_node_map.size(),value_node_count);
164 GlobalValueNodeMap::iterator iter;
165 for(iter=global_value_node_map.begin();iter!=global_value_node_map.end();++iter)
167 if(!iter->second->is_exported())
168 synfig::info("%s: count:%d name:%s type:%s",
169 iter->first.get_string().c_str(),
170 iter->second->count(),
171 iter->second->get_name().c_str(),
172 ValueBase::type_name(iter->second->get_type()).c_str()
175 synfig::info("%s: id:%s count:%d name:%s type:%s",
176 iter->first.get_string().c_str(),
177 iter->second->get_id().c_str(),
178 iter->second->count(),
179 iter->second->get_name().c_str(),
180 ValueBase::type_name(iter->second->get_type()).c_str()
188 ValueNode::ValueNode(ValueBase::Type type):type(type)
193 LinkableValueNode::Book&
194 LinkableValueNode::book()
199 LinkableValueNode::Handle
200 LinkableValueNode::create(const String &name, const ValueBase& x)
202 if(!book().count(name))
204 return book()[name].factory(x);
208 LinkableValueNode::check_type(const String &name, ValueBase::Type x)
210 if(!book().count(name) || !book()[name].check_type)
212 return book()[name].check_type(x);
216 LinkableValueNode::set_link(int i,ValueNode::Handle x)
218 ValueNode::Handle previous(get_link(i));
220 if(set_link_vfunc(i,x))
223 remove_child(previous.get());
226 if(!x->is_exported() && get_parent_canvas())
228 x->set_parent_canvas(get_parent_canvas());
236 ValueNode::LooseHandle
237 LinkableValueNode::get_link(int i)const
239 return get_link_vfunc(i);
243 LinkableValueNode::unlink_all()
245 for(int i=0;i<link_count();i++)
247 ValueNode::LooseHandle value_node(get_link(i));
249 value_node->parent_set.erase(this);
253 ValueNode::~ValueNode()
263 ValueNode::on_changed()
265 etl::loose_handle<Canvas> parent_canvas = get_parent_canvas();
267 do // signal to all the ancestor canvases
268 parent_canvas->signal_value_node_changed()(this);
269 while (parent_canvas = parent_canvas->parent());
270 else if(get_root_canvas())
271 get_root_canvas()->signal_value_node_changed()(this);
277 ValueNode::replace(etl::handle<ValueNode> x)
282 while(parent_set.size())
284 (*parent_set.begin())->add_child(x.get());
285 (*parent_set.begin())->remove_child(this);
286 //x->parent_set.insert(*parent_set.begin());
287 //parent_set.erase(parent_set.begin());
289 int r(RHandle(this).replace(x));
295 ValueNode::set_id(const String &x)
300 signal_id_changed_();
304 ValueNodeList::ValueNodeList():
305 placeholder_count_(0)
310 ValueNodeList::count(const String &id)const
317 for(iter=begin();iter!=end() && id!=(*iter)->get_id();++iter);
326 ValueNodeList::find(const String &id)
331 throw Exception::IDNotFound("Empty ID");
333 for(iter=begin();iter!=end() && id!=(*iter)->get_id();++iter);
336 throw Exception::IDNotFound("ValueNode in ValueNodeList: "+id);
341 ValueNode::ConstHandle
342 ValueNodeList::find(const String &id)const
347 throw Exception::IDNotFound("Empty ID");
349 for(iter=begin();iter!=end() && id!=(*iter)->get_id();++iter);
352 throw Exception::IDNotFound("ValueNode in ValueNodeList: "+id);
358 ValueNodeList::surefind(const String &id)
361 throw Exception::IDNotFound("Empty ID");
363 ValueNode::Handle value_node;
369 catch(Exception::IDNotFound)
371 value_node=PlaceholderValueNode::create();
372 value_node->set_id(id);
373 push_back(value_node);
374 placeholder_count_++;
381 ValueNodeList::erase(ValueNode::Handle value_node)
387 for(iter=begin();iter!=end();++iter)
388 if(value_node.get()==iter->get())
390 std::list<ValueNode::RHandle>::erase(iter);
391 if(PlaceholderValueNode::Handle::cast_dynamic(value_node))
392 placeholder_count_--;
399 ValueNodeList::add(ValueNode::Handle value_node)
403 if(value_node->get_id().empty())
408 ValueNode::RHandle other_value_node=find(value_node->get_id());
409 if(PlaceholderValueNode::Handle::cast_dynamic(other_value_node))
411 other_value_node->replace(value_node);
412 placeholder_count_--;
418 catch(Exception::IDNotFound)
420 push_back(value_node);
428 ValueNodeList::audit()
432 for(next=begin(),iter=next++;iter!=end();iter=next++)
434 std::list<ValueNode::RHandle>::erase(iter);
439 PlaceholderValueNode::get_name()const
441 return "placeholder";
445 PlaceholderValueNode::get_local_name()const
447 return _("Placeholder");
451 PlaceholderValueNode::clone(const GUID& deriv_guid)const
453 ValueNode* ret(new PlaceholderValueNode());
454 ret->set_guid(get_guid()^deriv_guid);
458 PlaceholderValueNode::Handle
459 PlaceholderValueNode::create(ValueBase::Type type)
461 return new PlaceholderValueNode(type);
465 PlaceholderValueNode::operator()(Time /*t*/)const
471 PlaceholderValueNode::PlaceholderValueNode(ValueBase::Type type):
477 LinkableValueNode::clone(const GUID& deriv_guid)const
479 // printf("%s:%d clone()\n", __FILE__, __LINE__);
480 { ValueNode* x(find_value_node(get_guid()^deriv_guid).get()); if(x)
482 printf("VALUENODE FOUND VALUENODE\n");
487 LinkableValueNode *ret=create_new();
488 ret->set_guid(get_guid()^deriv_guid);
490 for(i=0;i<link_count();i++)
492 ValueNode::Handle link=get_link_vfunc(i);
493 if(!link->is_exported())
495 ValueNode::LooseHandle value_node(find_value_node(link->get_guid()^deriv_guid));
497 value_node=link->clone(deriv_guid);
498 ret->set_link(i,value_node);
501 ret->set_link(i,link);
508 ValueNode::get_relative_id(etl::loose_handle<const Canvas> x)const
510 assert(is_exported());
513 if(x.get()==canvas_.get())
516 return canvas_->_get_relative_id(x)+':'+get_id();
520 ValueNode::set_parent_canvas(etl::loose_handle<Canvas> x)
522 canvas_=x; if(x) root_canvas_=x->get_root();
526 ValueNode::set_root_canvas(etl::loose_handle<Canvas> x)
528 root_canvas_=x->get_root();
531 void LinkableValueNode::get_times_vfunc(Node::time_set &set) const
533 ValueNode::LooseHandle h;
535 int size = link_count();
537 //just add it to the set...
538 for(int i=0; i < size; ++i)
544 const Node::time_set &tset = h->get_times();
545 set.insert(tset.begin(),tset.end());