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, 2008 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"
40 #include "paramdesc.h"
43 #include "valuenode_const.h"
44 #include "valuenode_linear.h"
45 #include "valuenode_composite.h"
46 #include "valuenode_reference.h"
47 #include "valuenode_scale.h"
48 #include "valuenode_blinecalctangent.h"
49 #include "valuenode_blinecalcvertex.h"
50 #include "valuenode_blinecalcwidth.h"
51 #include "valuenode_blinereversetangent.h"
52 #include "valuenode_segcalctangent.h"
53 #include "valuenode_segcalcvertex.h"
54 #include "valuenode_repeat_gradient.h"
55 #include "valuenode_stripes.h"
56 #include "valuenode_range.h"
57 #include "valuenode_add.h"
58 #include "valuenode_subtract.h"
59 #include "valuenode_timedswap.h"
60 #include "valuenode_twotone.h"
61 #include "valuenode_bline.h"
62 #include "valuenode_dynamiclist.h"
63 #include "valuenode_radialcomposite.h"
64 #include "valuenode_gradientrotate.h"
65 #include "valuenode_sine.h"
66 #include "valuenode_cos.h"
67 #include "valuenode_atan2.h"
68 #include "valuenode_exp.h"
69 #include "valuenode_switch.h"
70 #include "valuenode_timeloop.h"
71 #include "valuenode_reciprocal.h"
72 #include "valuenode_duplicate.h"
73 #include "valuenode_integer.h"
74 #include "valuenode_step.h"
75 #include "valuenode_vectorangle.h"
76 #include "valuenode_vectorlength.h"
77 #include "valuenode_vectorx.h"
78 #include "valuenode_vectory.h"
79 #include "valuenode_gradientcolor.h"
80 #include "valuenode_dotproduct.h"
86 /* === U S I N G =========================================================== */
90 using namespace synfig;
92 /* === M A C R O S ========================================================= */
94 /* === G L O B A L S ======================================================= */
96 static int value_node_count(0);
98 static LinkableValueNode::Book *book_;
101 ValueNode::LooseHandle
102 synfig::find_value_node(const GUID& guid)
104 return guid_cast<ValueNode>(guid);
107 /* === P R O C E D U R E S ================================================= */
109 /* === M E T H O D S ======================================================= */
112 ValueNode::subsys_init()
114 book_=new LinkableValueNode::Book();
116 #define ADD_VALUENODE(class,name,local,version) \
117 (*book_)[name].factory=reinterpret_cast<LinkableValueNode::Factory>(&class::create); \
118 (*book_)[name].check_type=&class::check_type; \
119 (*book_)[name].local_name=local; \
120 (*book_)[name].release_version=version
122 #define ADD_VALUENODE2(class,name,local,version) \
123 (*book_)[name].factory=reinterpret_cast<LinkableValueNode::Factory>(&class::create_from); \
124 (*book_)[name].check_type=&class::check_type; \
125 (*book_)[name].local_name=local; \
126 (*book_)[name].release_version=version
128 ADD_VALUENODE(ValueNode_Linear, "linear", _("Linear"), RELEASE_VERSION_0_61_06);
129 ADD_VALUENODE(ValueNode_Composite, "composite", _("Composite"), RELEASE_VERSION_0_61_06);
130 ADD_VALUENODE(ValueNode_RadialComposite, "radial_composite", _("Radial Composite"), RELEASE_VERSION_0_61_06);
131 ADD_VALUENODE(ValueNode_Reference, "reference", _("Reference"), RELEASE_VERSION_0_61_06);
132 ADD_VALUENODE(ValueNode_Scale, "scale", _("Scale"), RELEASE_VERSION_0_61_06);
133 ADD_VALUENODE(ValueNode_SegCalcTangent, "segcalctangent", _("Segment Tangent"), RELEASE_VERSION_0_61_06);
134 ADD_VALUENODE(ValueNode_SegCalcVertex, "segcalcvertex", _("Segment Vertex"), RELEASE_VERSION_0_61_06);
135 ADD_VALUENODE(ValueNode_Stripes, "stripes", _("Stripes"), RELEASE_VERSION_0_61_06);
136 ADD_VALUENODE(ValueNode_Subtract, "subtract", _("Subtract"), RELEASE_VERSION_0_61_06);
137 ADD_VALUENODE(ValueNode_TwoTone, "twotone", _("Two-Tone"), RELEASE_VERSION_0_61_06);
138 ADD_VALUENODE(ValueNode_BLine, "bline", _("BLine"), RELEASE_VERSION_0_61_06);
139 ADD_VALUENODE2(ValueNode_DynamicList, "dynamic_list", _("Dynamic List"), RELEASE_VERSION_0_61_06);
140 ADD_VALUENODE(ValueNode_GradientRotate, "gradient_rotate", _("Gradient Rotate"), RELEASE_VERSION_0_61_06);
141 ADD_VALUENODE(ValueNode_Sine, "sine", _("Sine"), RELEASE_VERSION_0_61_06);
143 ADD_VALUENODE(ValueNode_TimedSwap, "timed_swap", _("Timed Swap"), RELEASE_VERSION_0_61_07); // SVN r610
144 ADD_VALUENODE(ValueNode_Repeat_Gradient, "repeat_gradient", _("Repeat Gradient"), RELEASE_VERSION_0_61_07); // SVN r666
145 ADD_VALUENODE(ValueNode_Exp, "exp", _("Exponential"), RELEASE_VERSION_0_61_07); // SVN r739
146 ADD_VALUENODE(ValueNode_Add, "add", _("Add"), RELEASE_VERSION_0_61_07); // SVN r742
147 ADD_VALUENODE(ValueNode_BLineCalcTangent, "blinecalctangent", _("BLine Tangent"), RELEASE_VERSION_0_61_07); // SVN r744
148 ADD_VALUENODE(ValueNode_BLineCalcVertex, "blinecalcvertex", _("BLine Vertex"), RELEASE_VERSION_0_61_07); // SVN r744
149 ADD_VALUENODE(ValueNode_Range, "range", _("Range"), RELEASE_VERSION_0_61_07); // SVN r776
151 ADD_VALUENODE(ValueNode_Switch, "switch", _("Switch"), RELEASE_VERSION_0_61_08); // SVN r923
152 ADD_VALUENODE(ValueNode_Cos, "cos", _("Cos"), RELEASE_VERSION_0_61_08); // SVN r1111
153 ADD_VALUENODE(ValueNode_Atan2, "atan2", _("aTan2"), RELEASE_VERSION_0_61_08); // SVN r1132
154 ADD_VALUENODE(ValueNode_BLineRevTangent, "blinerevtangent", _("Reverse Tangent"), RELEASE_VERSION_0_61_08); // SVN r1162
155 ADD_VALUENODE(ValueNode_TimeLoop, "timeloop", _("Time Loop"), RELEASE_VERSION_0_61_08); // SVN r1226
156 ADD_VALUENODE(ValueNode_Reciprocal, "reciprocal", _("Reciprocal"), RELEASE_VERSION_0_61_08); // SVN r1238
157 ADD_VALUENODE(ValueNode_Duplicate, "duplicate", _("Duplicate"), RELEASE_VERSION_0_61_08); // SVN r1267
158 ADD_VALUENODE(ValueNode_Integer, "fromint", _("From Integer"), RELEASE_VERSION_0_61_08); // SVN r1267
159 ADD_VALUENODE(ValueNode_Step, "step", _("Step"), RELEASE_VERSION_0_61_08); // SVN r1691
160 ADD_VALUENODE(ValueNode_BLineCalcWidth, "blinecalcwidth", _("BLine Width"), RELEASE_VERSION_0_61_08); // SVN r1694
162 ADD_VALUENODE(ValueNode_VectorAngle, "vectorangle", _("Vector Angle"), RELEASE_VERSION_0_61_09); // SVN r1880
163 ADD_VALUENODE(ValueNode_VectorLength, "vectorlength", _("Vector Length"), RELEASE_VERSION_0_61_09); // SVN r1881
164 ADD_VALUENODE(ValueNode_VectorX, "vectorx", _("Vector X"), RELEASE_VERSION_0_61_09); // SVN r1882
165 ADD_VALUENODE(ValueNode_VectorY, "vectory", _("Vector Y"), RELEASE_VERSION_0_61_09); // SVN r1882
166 ADD_VALUENODE(ValueNode_GradientColor, "gradientcolor", _("Gradient Color"), RELEASE_VERSION_0_61_09); // SVN r1885
167 ADD_VALUENODE(ValueNode_DotProduct, "dotproduct", _("Dot Product"), RELEASE_VERSION_0_61_09); // SVN r1891
170 #undef ADD_VALUENODE2
176 ValueNode::subsys_stop()
179 /* if(global_value_node_map.size() || value_node_count)
182 synfig::error("%d ValueNodes haven't been destroyed yet!",value_node_count);
184 if(global_value_node_map.size()!=value_node_count)
185 synfig::error("value node count mismatch! map.size()!=value_node_count (%d!=%d)",global_value_node_map.size(),value_node_count);
187 GlobalValueNodeMap::iterator iter;
188 for(iter=global_value_node_map.begin();iter!=global_value_node_map.end();++iter)
190 if(!iter->second->is_exported())
191 synfig::info(_("%s: count:%d name:%s type:%s"),
192 iter->first.get_string().c_str(),
193 iter->second->count(),
194 iter->second->get_name().c_str(),
195 ValueBase::type_local_name(iter->second->get_type()).c_str()
198 synfig::info(_("%s: id:%s count:%d name:%s type:%s"),
199 iter->first.get_string().c_str(),
200 iter->second->get_id().c_str(),
201 iter->second->count(),
202 iter->second->get_name().c_str(),
203 ValueBase::type_local_name(iter->second->get_type()).c_str()
211 ValueNode::ValueNode(ValueBase::Type type):type(type)
216 LinkableValueNode::Book&
217 LinkableValueNode::book()
222 LinkableValueNode::Handle
223 LinkableValueNode::create(const String &name, const ValueBase& x)
225 if(!book().count(name))
228 if (!check_type(name, x.get_type()) &&
229 // the Duplicate ValueNode is an exception - we don't want the
230 // user creating it for themselves, so check_type() fails for
231 // it even when it is valid
232 !(name == "duplicate" && x.get_type() == ValueBase::TYPE_REAL))
234 error(_("Bad type: ValueNode '%s' doesn't accept type '%s'"), book()[name].local_name.c_str(), ValueBase::type_local_name(x.get_type()).c_str());
238 return book()[name].factory(x);
242 LinkableValueNode::check_type(const String &name, ValueBase::Type x)
244 if(!book().count(name) || !book()[name].check_type)
246 return book()[name].check_type(x);
250 LinkableValueNode::set_link(int i,ValueNode::Handle x)
252 ValueNode::Handle previous(get_link(i));
254 if(set_link_vfunc(i,x))
257 remove_child(previous.get());
260 if(!x->is_exported() && get_parent_canvas())
262 x->set_parent_canvas(get_parent_canvas());
270 ValueNode::LooseHandle
271 LinkableValueNode::get_link(int i)const
273 return get_link_vfunc(i);
277 LinkableValueNode::unlink_all()
279 for(int i=0;i<link_count();i++)
281 ValueNode::LooseHandle value_node(get_link(i));
283 value_node->parent_set.erase(this);
287 ValueNode::~ValueNode()
295 ValueNode::on_changed()
297 etl::loose_handle<Canvas> parent_canvas = get_parent_canvas();
299 do // signal to all the ancestor canvases
300 parent_canvas->signal_value_node_changed()(this);
301 while (parent_canvas = parent_canvas->parent());
302 else if(get_root_canvas())
303 get_root_canvas()->signal_value_node_changed()(this);
309 ValueNode::replace(etl::handle<ValueNode> x)
314 while(parent_set.size())
316 (*parent_set.begin())->add_child(x.get());
317 (*parent_set.begin())->remove_child(this);
318 //x->parent_set.insert(*parent_set.begin());
319 //parent_set.erase(parent_set.begin());
321 int r(RHandle(this).replace(x));
327 ValueNode::set_id(const String &x)
332 signal_id_changed_();
337 ValueNode::get_description(bool show_exported_name)const
339 String ret(_("ValueNode"));
341 if (dynamic_cast<const LinkableValueNode*>(this))
342 return (dynamic_cast<const LinkableValueNode*>(this))->get_description(-1, show_exported_name);
344 if (show_exported_name && !is_exported())
345 show_exported_name = false;
347 if (show_exported_name)
348 ret += strprintf(" (%s)", get_id().c_str());
353 ValueNodeList::ValueNodeList():
354 placeholder_count_(0)
359 ValueNodeList::count(const String &id)const
366 for(iter=begin();iter!=end() && id!=(*iter)->get_id();++iter)
376 ValueNodeList::find(const String &id)
381 throw Exception::IDNotFound("Empty ID");
383 for(iter=begin();iter!=end() && id!=(*iter)->get_id();++iter)
387 throw Exception::IDNotFound("ValueNode in ValueNodeList: "+id);
392 ValueNode::ConstHandle
393 ValueNodeList::find(const String &id)const
398 throw Exception::IDNotFound("Empty ID");
400 for(iter=begin();iter!=end() && id!=(*iter)->get_id();++iter)
404 throw Exception::IDNotFound("ValueNode in ValueNodeList: "+id);
410 ValueNodeList::surefind(const String &id)
413 throw Exception::IDNotFound("Empty ID");
415 ValueNode::Handle value_node;
421 catch(Exception::IDNotFound)
423 value_node=PlaceholderValueNode::create();
424 value_node->set_id(id);
425 push_back(value_node);
426 placeholder_count_++;
433 ValueNodeList::erase(ValueNode::Handle value_node)
439 for(iter=begin();iter!=end();++iter)
440 if(value_node.get()==iter->get())
442 std::list<ValueNode::RHandle>::erase(iter);
443 if(PlaceholderValueNode::Handle::cast_dynamic(value_node))
444 placeholder_count_--;
451 ValueNodeList::add(ValueNode::Handle value_node)
455 if(value_node->get_id().empty())
460 ValueNode::RHandle other_value_node=find(value_node->get_id());
461 if(PlaceholderValueNode::Handle::cast_dynamic(other_value_node))
463 other_value_node->replace(value_node);
464 placeholder_count_--;
470 catch(Exception::IDNotFound)
472 push_back(value_node);
480 ValueNodeList::audit()
484 for(next=begin(),iter=next++;iter!=end();iter=next++)
486 std::list<ValueNode::RHandle>::erase(iter);
491 PlaceholderValueNode::get_name()const
493 return "placeholder";
497 PlaceholderValueNode::get_local_name()const
499 return _("Placeholder");
503 PlaceholderValueNode::clone(const GUID& deriv_guid)const
505 ValueNode* ret(new PlaceholderValueNode());
506 ret->set_guid(get_guid()^deriv_guid);
510 PlaceholderValueNode::Handle
511 PlaceholderValueNode::create(ValueBase::Type type)
513 return new PlaceholderValueNode(type);
517 PlaceholderValueNode::operator()(Time /*t*/)const
523 PlaceholderValueNode::PlaceholderValueNode(ValueBase::Type type):
529 LinkableValueNode::clone(const GUID& deriv_guid)const
532 ValueNode* x(find_value_node(get_guid()^deriv_guid).get());
538 LinkableValueNode *ret=create_new();
539 ret->set_guid(get_guid()^deriv_guid);
541 for(i=0;i<link_count();i++)
543 ValueNode::Handle link=get_link_vfunc(i);
544 if(!link->is_exported())
546 ValueNode::LooseHandle value_node(find_value_node(link->get_guid()^deriv_guid));
548 value_node=link->clone(deriv_guid);
549 ret->set_link(i,value_node);
552 ret->set_link(i,link);
559 ValueNode::get_relative_id(etl::loose_handle<const Canvas> x)const
561 assert(is_exported());
564 if(x.get()==canvas_.get())
567 return canvas_->_get_relative_id(x)+':'+get_id();
571 ValueNode::set_parent_canvas(etl::loose_handle<Canvas> x)
573 canvas_=x; if(x) root_canvas_=x->get_root();
577 ValueNode::set_root_canvas(etl::loose_handle<Canvas> x)
579 root_canvas_=x->get_root();
582 void LinkableValueNode::get_times_vfunc(Node::time_set &set) const
584 ValueNode::LooseHandle h;
586 int size = link_count();
588 //just add it to the set...
589 for(int i=0; i < size; ++i)
595 const Node::time_set &tset = h->get_times();
596 set.insert(tset.begin(),tset.end());
602 LinkableValueNode::get_description(int index, bool show_exported_name)const
608 if (show_exported_name && is_exported())
609 description += strprintf(" (%s)", get_id().c_str());
613 description = String(":") + link_local_name(index);
615 if (show_exported_name)
617 ValueNode::LooseHandle link(get_link(index));
618 if (link->is_exported())
619 description += strprintf(" (%s)", link->get_id().c_str());
623 const synfig::Node* node = this;
624 LinkableValueNode::ConstHandle parent_linkable_vn = 0;
626 // walk up through the valuenodes trying to find the layer at the top
627 while (!node->parent_set.empty() && !dynamic_cast<const Layer*>(node))
629 LinkableValueNode::ConstHandle linkable_value_node(dynamic_cast<const LinkableValueNode*>(node));
630 if (linkable_value_node)
633 int cnt = linkable_value_node->link_count();
634 for (int i = 0; i < cnt; i++)
635 if (linkable_value_node->get_link(i) == parent_linkable_vn)
637 link = String(":") + linkable_value_node->link_local_name(i);
641 description = linkable_value_node->get_local_name() + link + (parent_linkable_vn?">":"") + description;
643 node = *node->parent_set.begin();
644 parent_linkable_vn = linkable_value_node;
647 Layer::ConstHandle parent_layer(dynamic_cast<const Layer*>(node));
651 const Layer::DynamicParamList &dynamic_param_list(parent_layer->dynamic_param_list());
652 // loop to find the parameter in the dynamic parameter list - this gives us its name
653 for (Layer::DynamicParamList::const_iterator iter = dynamic_param_list.begin(); iter != dynamic_param_list.end(); iter++)
654 if (iter->second == parent_linkable_vn)
655 param = String(":") + parent_layer->get_param_local_name(iter->first);
656 description = strprintf("(%s)%s>%s",
657 parent_layer->get_non_empty_description().c_str(),
659 description.c_str());