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_blinereversetangent.h"
51 #include "valuenode_segcalctangent.h"
52 #include "valuenode_segcalcvertex.h"
53 #include "valuenode_repeat_gradient.h"
54 #include "valuenode_stripes.h"
55 #include "valuenode_range.h"
56 #include "valuenode_add.h"
57 #include "valuenode_subtract.h"
58 #include "valuenode_timedswap.h"
59 #include "valuenode_twotone.h"
60 #include "valuenode_bline.h"
61 #include "valuenode_dynamiclist.h"
62 #include "valuenode_radialcomposite.h"
63 #include "valuenode_gradientrotate.h"
64 #include "valuenode_sine.h"
65 #include "valuenode_cos.h"
66 #include "valuenode_atan2.h"
67 #include "valuenode_exp.h"
68 #include "valuenode_switch.h"
69 #include "valuenode_timeloop.h"
70 #include "valuenode_reciprocal.h"
71 #include "valuenode_duplicate.h"
72 #include "valuenode_integer.h"
73 #include "valuenode_step.h"
79 /* === U S I N G =========================================================== */
83 using namespace synfig;
85 /* === M A C R O S ========================================================= */
87 /* === G L O B A L S ======================================================= */
89 static int value_node_count(0);
91 static LinkableValueNode::Book *book_;
94 ValueNode::LooseHandle
95 synfig::find_value_node(const GUID& guid)
97 return guid_cast<ValueNode>(guid);
100 /* === P R O C E D U R E S ================================================= */
102 /* === M E T H O D S ======================================================= */
105 ValueNode::subsys_init()
107 book_=new LinkableValueNode::Book();
109 #define ADD_VALUENODE(class,name,local,version) \
110 (*book_)[name].factory=reinterpret_cast<LinkableValueNode::Factory>(&class::create); \
111 (*book_)[name].check_type=&class::check_type; \
112 (*book_)[name].local_name=local; \
113 (*book_)[name].release_version=version
115 #define ADD_VALUENODE2(class,name,local,version) \
116 (*book_)[name].factory=reinterpret_cast<LinkableValueNode::Factory>(&class::create_from); \
117 (*book_)[name].check_type=&class::check_type; \
118 (*book_)[name].local_name=local; \
119 (*book_)[name].release_version=version
121 ADD_VALUENODE(ValueNode_Linear, "linear", _("Linear") ,RELEASE_VERSION_0_61_06);
122 ADD_VALUENODE(ValueNode_Composite, "composite", _("Composite") ,RELEASE_VERSION_0_61_06);
123 ADD_VALUENODE(ValueNode_RadialComposite,"radial_composite", _("Radial Composite"),RELEASE_VERSION_0_61_06);
124 ADD_VALUENODE(ValueNode_Reference, "reference", _("Reference") ,RELEASE_VERSION_0_61_06);
125 ADD_VALUENODE(ValueNode_Scale, "scale", _("Scale") ,RELEASE_VERSION_0_61_06);
126 ADD_VALUENODE(ValueNode_SegCalcTangent, "segcalctangent", _("Segment Tangent") ,RELEASE_VERSION_0_61_06);
127 ADD_VALUENODE(ValueNode_SegCalcVertex, "segcalcvertex", _("Segment Vertex") ,RELEASE_VERSION_0_61_06);
128 ADD_VALUENODE(ValueNode_Stripes, "stripes", _("Stripes") ,RELEASE_VERSION_0_61_06);
129 ADD_VALUENODE(ValueNode_Subtract, "subtract", _("Subtract") ,RELEASE_VERSION_0_61_06);
130 ADD_VALUENODE(ValueNode_TwoTone, "twotone", _("Two-Tone") ,RELEASE_VERSION_0_61_06);
131 ADD_VALUENODE(ValueNode_BLine, "bline", _("BLine") ,RELEASE_VERSION_0_61_06);
132 ADD_VALUENODE2(ValueNode_DynamicList, "dynamic_list", _("Dynamic List") ,RELEASE_VERSION_0_61_06);
133 ADD_VALUENODE(ValueNode_GradientRotate, "gradient_rotate", _("Gradient Rotate") ,RELEASE_VERSION_0_61_06);
134 ADD_VALUENODE(ValueNode_Sine, "sine", _("Sine") ,RELEASE_VERSION_0_61_06);
136 ADD_VALUENODE(ValueNode_TimedSwap, "timed_swap", _("Timed Swap") ,RELEASE_VERSION_0_61_07); // SVN r610
137 ADD_VALUENODE(ValueNode_Repeat_Gradient,"repeat_gradient", _("Repeat Gradient") ,RELEASE_VERSION_0_61_07); // SVN r666
138 ADD_VALUENODE(ValueNode_Exp, "exp", _("Exponential") ,RELEASE_VERSION_0_61_07); // SVN r739
139 ADD_VALUENODE(ValueNode_Add, "add", _("Add") ,RELEASE_VERSION_0_61_07); // SVN r742
140 ADD_VALUENODE(ValueNode_BLineCalcTangent,"blinecalctangent",_("BLine Tangent") ,RELEASE_VERSION_0_61_07); // SVN r744
141 ADD_VALUENODE(ValueNode_BLineCalcVertex,"blinecalcvertex", _("BLine Vertex") ,RELEASE_VERSION_0_61_07); // SVN r744
142 ADD_VALUENODE(ValueNode_Range, "range", _("Range") ,RELEASE_VERSION_0_61_07); // SVN r776
144 ADD_VALUENODE(ValueNode_Switch, "switch", _("Switch") ,RELEASE_VERSION_0_61_08); // SVN r923
145 ADD_VALUENODE(ValueNode_Cos, "cos", _("Cos") ,RELEASE_VERSION_0_61_08); // SVN r1111
146 ADD_VALUENODE(ValueNode_Atan2, "atan2", _("aTan2") ,RELEASE_VERSION_0_61_08); // SVN r1132
147 ADD_VALUENODE(ValueNode_BLineRevTangent,"blinerevtangent", _("Reverse Tangent") ,RELEASE_VERSION_0_61_08); // SVN r1162
148 ADD_VALUENODE(ValueNode_TimeLoop, "timeloop", _("Time Loop") ,RELEASE_VERSION_0_61_08); // SVN r1226
149 ADD_VALUENODE(ValueNode_Reciprocal, "reciprocal", _("Reciprocal") ,RELEASE_VERSION_0_61_08); // SVN r1238
150 ADD_VALUENODE(ValueNode_Duplicate, "duplicate", _("Duplicate") ,RELEASE_VERSION_0_61_08); // SVN r1267
151 ADD_VALUENODE(ValueNode_Integer, "fromint", _("From Integer") ,RELEASE_VERSION_0_61_08); // SVN r1267
152 ADD_VALUENODE(ValueNode_Step, "step", _("Step") ,RELEASE_VERSION_0_61_08); // SVN r1691
155 #undef ADD_VALUENODE2
161 ValueNode::subsys_stop()
164 /* if(global_value_node_map.size() || value_node_count)
167 synfig::error("%d ValueNodes haven't been destroyed yet!",value_node_count);
169 if(global_value_node_map.size()!=value_node_count)
170 synfig::error("value node count mismatch! map.size()!=value_node_count (%d!=%d)",global_value_node_map.size(),value_node_count);
172 GlobalValueNodeMap::iterator iter;
173 for(iter=global_value_node_map.begin();iter!=global_value_node_map.end();++iter)
175 if(!iter->second->is_exported())
176 synfig::info(_("%s: count:%d name:%s type:%s"),
177 iter->first.get_string().c_str(),
178 iter->second->count(),
179 iter->second->get_name().c_str(),
180 ValueBase::type_local_name(iter->second->get_type()).c_str()
183 synfig::info(_("%s: id:%s count:%d name:%s type:%s"),
184 iter->first.get_string().c_str(),
185 iter->second->get_id().c_str(),
186 iter->second->count(),
187 iter->second->get_name().c_str(),
188 ValueBase::type_local_name(iter->second->get_type()).c_str()
196 ValueNode::ValueNode(ValueBase::Type type):type(type)
201 LinkableValueNode::Book&
202 LinkableValueNode::book()
207 LinkableValueNode::Handle
208 LinkableValueNode::create(const String &name, const ValueBase& x)
210 if(!book().count(name))
213 if (!check_type(name, x.get_type()) &&
214 // the Duplicate ValueNode is an exception - we don't want the
215 // user creating it for themselves, so check_type() fails for
216 // it even when it is valid
217 !(name == "duplicate" && x.get_type() == ValueBase::TYPE_REAL))
219 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());
223 return book()[name].factory(x);
227 LinkableValueNode::check_type(const String &name, ValueBase::Type x)
229 if(!book().count(name) || !book()[name].check_type)
231 return book()[name].check_type(x);
235 LinkableValueNode::set_link(int i,ValueNode::Handle x)
237 ValueNode::Handle previous(get_link(i));
239 if(set_link_vfunc(i,x))
242 remove_child(previous.get());
245 if(!x->is_exported() && get_parent_canvas())
247 x->set_parent_canvas(get_parent_canvas());
255 ValueNode::LooseHandle
256 LinkableValueNode::get_link(int i)const
258 return get_link_vfunc(i);
262 LinkableValueNode::unlink_all()
264 for(int i=0;i<link_count();i++)
266 ValueNode::LooseHandle value_node(get_link(i));
268 value_node->parent_set.erase(this);
272 ValueNode::~ValueNode()
280 ValueNode::on_changed()
282 etl::loose_handle<Canvas> parent_canvas = get_parent_canvas();
284 do // signal to all the ancestor canvases
285 parent_canvas->signal_value_node_changed()(this);
286 while (parent_canvas = parent_canvas->parent());
287 else if(get_root_canvas())
288 get_root_canvas()->signal_value_node_changed()(this);
294 ValueNode::replace(etl::handle<ValueNode> x)
299 while(parent_set.size())
301 (*parent_set.begin())->add_child(x.get());
302 (*parent_set.begin())->remove_child(this);
303 //x->parent_set.insert(*parent_set.begin());
304 //parent_set.erase(parent_set.begin());
306 int r(RHandle(this).replace(x));
312 ValueNode::set_id(const String &x)
317 signal_id_changed_();
322 ValueNode::get_description(bool show_exported_name)const
324 String ret(_("ValueNode"));
326 if (dynamic_cast<const LinkableValueNode*>(this))
327 return (dynamic_cast<const LinkableValueNode*>(this))->get_description(-1, show_exported_name);
329 if (show_exported_name && !is_exported())
330 show_exported_name = false;
332 if (show_exported_name)
333 ret += strprintf(" (%s)", get_id().c_str());
338 ValueNodeList::ValueNodeList():
339 placeholder_count_(0)
344 ValueNodeList::count(const String &id)const
351 for(iter=begin();iter!=end() && id!=(*iter)->get_id();++iter)
361 ValueNodeList::find(const String &id)
366 throw Exception::IDNotFound("Empty ID");
368 for(iter=begin();iter!=end() && id!=(*iter)->get_id();++iter)
372 throw Exception::IDNotFound("ValueNode in ValueNodeList: "+id);
377 ValueNode::ConstHandle
378 ValueNodeList::find(const String &id)const
383 throw Exception::IDNotFound("Empty ID");
385 for(iter=begin();iter!=end() && id!=(*iter)->get_id();++iter)
389 throw Exception::IDNotFound("ValueNode in ValueNodeList: "+id);
395 ValueNodeList::surefind(const String &id)
398 throw Exception::IDNotFound("Empty ID");
400 ValueNode::Handle value_node;
406 catch(Exception::IDNotFound)
408 value_node=PlaceholderValueNode::create();
409 value_node->set_id(id);
410 push_back(value_node);
411 placeholder_count_++;
418 ValueNodeList::erase(ValueNode::Handle value_node)
424 for(iter=begin();iter!=end();++iter)
425 if(value_node.get()==iter->get())
427 std::list<ValueNode::RHandle>::erase(iter);
428 if(PlaceholderValueNode::Handle::cast_dynamic(value_node))
429 placeholder_count_--;
436 ValueNodeList::add(ValueNode::Handle value_node)
440 if(value_node->get_id().empty())
445 ValueNode::RHandle other_value_node=find(value_node->get_id());
446 if(PlaceholderValueNode::Handle::cast_dynamic(other_value_node))
448 other_value_node->replace(value_node);
449 placeholder_count_--;
455 catch(Exception::IDNotFound)
457 push_back(value_node);
465 ValueNodeList::audit()
469 for(next=begin(),iter=next++;iter!=end();iter=next++)
471 std::list<ValueNode::RHandle>::erase(iter);
476 PlaceholderValueNode::get_name()const
478 return "placeholder";
482 PlaceholderValueNode::get_local_name()const
484 return _("Placeholder");
488 PlaceholderValueNode::clone(const GUID& deriv_guid)const
490 ValueNode* ret(new PlaceholderValueNode());
491 ret->set_guid(get_guid()^deriv_guid);
495 PlaceholderValueNode::Handle
496 PlaceholderValueNode::create(ValueBase::Type type)
498 return new PlaceholderValueNode(type);
502 PlaceholderValueNode::operator()(Time /*t*/)const
508 PlaceholderValueNode::PlaceholderValueNode(ValueBase::Type type):
514 LinkableValueNode::clone(const GUID& deriv_guid)const
516 // printf("%s:%d clone()\n", __FILE__, __LINE__);
517 { ValueNode* x(find_value_node(get_guid()^deriv_guid).get()); if(x)
519 printf("VALUENODE FOUND VALUENODE\n");
524 LinkableValueNode *ret=create_new();
525 ret->set_guid(get_guid()^deriv_guid);
527 for(i=0;i<link_count();i++)
529 ValueNode::Handle link=get_link_vfunc(i);
530 if(!link->is_exported())
532 ValueNode::LooseHandle value_node(find_value_node(link->get_guid()^deriv_guid));
534 value_node=link->clone(deriv_guid);
535 ret->set_link(i,value_node);
538 ret->set_link(i,link);
545 ValueNode::get_relative_id(etl::loose_handle<const Canvas> x)const
547 assert(is_exported());
550 if(x.get()==canvas_.get())
553 return canvas_->_get_relative_id(x)+':'+get_id();
557 ValueNode::set_parent_canvas(etl::loose_handle<Canvas> x)
559 canvas_=x; if(x) root_canvas_=x->get_root();
563 ValueNode::set_root_canvas(etl::loose_handle<Canvas> x)
565 root_canvas_=x->get_root();
568 void LinkableValueNode::get_times_vfunc(Node::time_set &set) const
570 ValueNode::LooseHandle h;
572 int size = link_count();
574 //just add it to the set...
575 for(int i=0; i < size; ++i)
581 const Node::time_set &tset = h->get_times();
582 set.insert(tset.begin(),tset.end());
588 LinkableValueNode::get_description(int index, bool show_exported_name)const
594 if (show_exported_name && is_exported())
595 description += strprintf(" (%s)", get_id().c_str());
599 description = String(":") + link_local_name(index);
601 if (show_exported_name)
603 ValueNode::LooseHandle link(get_link(index));
604 if (link->is_exported())
605 description += strprintf(" (%s)", link->get_id().c_str());
609 const synfig::Node* node = this;
610 LinkableValueNode::ConstHandle parent_linkable_vn = 0;
612 // walk up through the valuenodes trying to find the layer at the top
613 while (!node->parent_set.empty() && !dynamic_cast<const Layer*>(node))
615 LinkableValueNode::ConstHandle linkable_value_node(dynamic_cast<const LinkableValueNode*>(node));
616 if (linkable_value_node)
619 int cnt = linkable_value_node->link_count();
620 for (int i = 0; i < cnt; i++)
621 if (linkable_value_node->get_link(i) == parent_linkable_vn)
623 link = String(":") + linkable_value_node->link_local_name(i);
627 description = linkable_value_node->get_local_name() + link + (parent_linkable_vn?">":"") + description;
629 node = *node->parent_set.begin();
630 parent_linkable_vn = linkable_value_node;
633 Layer::ConstHandle parent_layer(dynamic_cast<const Layer*>(node));
637 const Layer::DynamicParamList &dynamic_param_list(parent_layer->dynamic_param_list());
638 // loop to find the parameter in the dynamic parameter list - this gives us its name
639 for (Layer::DynamicParamList::const_iterator iter = dynamic_param_list.begin(); iter != dynamic_param_list.end(); iter++)
640 if (iter->second == parent_linkable_vn)
641 param = String(":") + parent_layer->get_param_local_name(iter->first);
642 description = strprintf("(%s)%s>%s",
643 parent_layer->get_non_empty_description().c_str(),
645 description.c_str());