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"
72 /* === U S I N G =========================================================== */
76 using namespace synfig;
78 /* === M A C R O S ========================================================= */
80 /* === G L O B A L S ======================================================= */
82 static int value_node_count(0);
84 static LinkableValueNode::Book *book_;
87 ValueNode::LooseHandle
88 synfig::find_value_node(const GUID& guid)
90 return guid_cast<ValueNode>(guid);
93 /* === P R O C E D U R E S ================================================= */
95 /* === M E T H O D S ======================================================= */
98 ValueNode::subsys_init()
100 book_=new LinkableValueNode::Book();
102 #define ADD_VALUENODE(class,name,local) \
103 (*book_)[name].factory=reinterpret_cast<LinkableValueNode::Factory>(&class::create); \
104 (*book_)[name].check_type=&class::check_type; \
105 (*book_)[name].local_name=local
107 #define ADD_VALUENODE2(class,name,local) \
108 (*book_)[name].factory=reinterpret_cast<LinkableValueNode::Factory>(&class::create_from); \
109 (*book_)[name].check_type=&class::check_type; \
110 (*book_)[name].local_name=local
112 ADD_VALUENODE(ValueNode_Linear, "linear", _("Linear") );
113 ADD_VALUENODE(ValueNode_Composite, "composite", _("Composite") );
114 ADD_VALUENODE(ValueNode_RadialComposite,"radial_composite", _("Radial Composite") );
115 ADD_VALUENODE(ValueNode_Reference, "reference", _("Reference") );
116 ADD_VALUENODE(ValueNode_Repeat_Gradient,"repeat_gradient", _("Repeat Gradient") );
117 ADD_VALUENODE(ValueNode_Scale, "scale", _("Scale") );
118 ADD_VALUENODE(ValueNode_BLineCalcTangent,"blinecalctangent",_("BLine Tangent") );
119 ADD_VALUENODE(ValueNode_BLineCalcVertex,"blinecalcvertex", _("BLine Vertex") );
120 ADD_VALUENODE(ValueNode_BLineRevTangent,"blinerevtangent", _("Reverse Tangent") );
121 ADD_VALUENODE(ValueNode_SegCalcTangent, "segcalctangent", _("Segment Tangent") );
122 ADD_VALUENODE(ValueNode_SegCalcVertex, "segcalcvertex", _("Segment Vertex") );
123 ADD_VALUENODE(ValueNode_Stripes, "stripes", _("Stripes") );
124 ADD_VALUENODE(ValueNode_Range, "range", _("Range") );
125 ADD_VALUENODE(ValueNode_Add, "add", _("Add") );
126 ADD_VALUENODE(ValueNode_Subtract, "subtract", _("Subtract") );
127 ADD_VALUENODE(ValueNode_TimedSwap, "timed_swap", _("Timed Swap") );
128 ADD_VALUENODE(ValueNode_TwoTone, "twotone", _("Two-Tone") );
129 ADD_VALUENODE(ValueNode_BLine, "bline", _("BLine") );
130 ADD_VALUENODE2(ValueNode_DynamicList, "dynamic_list", _("Dynamic List") );
131 ADD_VALUENODE(ValueNode_GradientRotate, "gradient_rotate", _("Gradient Rotate") );
132 ADD_VALUENODE(ValueNode_Sine, "sine", _("Sine") );
133 ADD_VALUENODE(ValueNode_Cos, "cos", _("Cos") );
134 ADD_VALUENODE(ValueNode_Atan2, "atan2", _("aTan2") );
135 ADD_VALUENODE(ValueNode_Exp, "exp", _("Exponential") );
136 ADD_VALUENODE(ValueNode_Switch, "switch", _("Switch") );
139 #undef ADD_VALUENODE2
145 ValueNode::subsys_stop()
148 /* if(global_value_node_map.size() || value_node_count)
151 synfig::error("%d ValueNodes haven't been destroyed yet!",value_node_count);
153 if(global_value_node_map.size()!=value_node_count)
154 synfig::error("value node count mismatch! map.size()!=value_node_count (%d!=%d)",global_value_node_map.size(),value_node_count);
156 GlobalValueNodeMap::iterator iter;
157 for(iter=global_value_node_map.begin();iter!=global_value_node_map.end();++iter)
159 if(!iter->second->is_exported())
160 synfig::info("%s: count:%d name:%s type:%s",
161 iter->first.get_string().c_str(),
162 iter->second->count(),
163 iter->second->get_name().c_str(),
164 ValueBase::type_name(iter->second->get_type()).c_str()
167 synfig::info("%s: id:%s count:%d name:%s type:%s",
168 iter->first.get_string().c_str(),
169 iter->second->get_id().c_str(),
170 iter->second->count(),
171 iter->second->get_name().c_str(),
172 ValueBase::type_name(iter->second->get_type()).c_str()
180 ValueNode::ValueNode(ValueBase::Type type):type(type)
185 LinkableValueNode::Book&
186 LinkableValueNode::book()
191 LinkableValueNode::Handle
192 LinkableValueNode::create(const String &name, const ValueBase& x)
194 if(!book().count(name))
196 return book()[name].factory(x);
200 LinkableValueNode::check_type(const String &name, ValueBase::Type x)
202 if(!book().count(name) || !book()[name].check_type)
204 return book()[name].check_type(x);
208 LinkableValueNode::set_link(int i,ValueNode::Handle x)
210 ValueNode::Handle previous(get_link(i));
212 if(set_link_vfunc(i,x))
215 remove_child(previous.get());
218 if(!x->is_exported() && get_parent_canvas())
220 x->set_parent_canvas(get_parent_canvas());
228 ValueNode::LooseHandle
229 LinkableValueNode::get_link(int i)const
231 return get_link_vfunc(i);
235 LinkableValueNode::unlink_all()
237 for(int i=0;i<link_count();i++)
239 ValueNode::LooseHandle value_node(get_link(i));
241 value_node->parent_set.erase(this);
245 ValueNode::~ValueNode()
255 ValueNode::on_changed()
257 etl::loose_handle<Canvas> parent_canvas = get_parent_canvas();
259 do // signal to all the ancestor canvases
260 parent_canvas->signal_value_node_changed()(this);
261 while (parent_canvas = parent_canvas->parent());
262 else if(get_root_canvas())
263 get_root_canvas()->signal_value_node_changed()(this);
269 ValueNode::replace(etl::handle<ValueNode> x)
274 while(parent_set.size())
276 (*parent_set.begin())->add_child(x.get());
277 (*parent_set.begin())->remove_child(this);
278 //x->parent_set.insert(*parent_set.begin());
279 //parent_set.erase(parent_set.begin());
281 int r(RHandle(this).replace(x));
287 ValueNode::set_id(const String &x)
292 signal_id_changed_();
296 ValueNodeList::ValueNodeList():
297 placeholder_count_(0)
302 ValueNodeList::count(const String &id)const
309 for(iter=begin();iter!=end() && id!=(*iter)->get_id();++iter);
318 ValueNodeList::find(const String &id)
323 throw Exception::IDNotFound("Empty ID");
325 for(iter=begin();iter!=end() && id!=(*iter)->get_id();++iter);
328 throw Exception::IDNotFound("ValueNode in ValueNodeList: "+id);
333 ValueNode::ConstHandle
334 ValueNodeList::find(const String &id)const
339 throw Exception::IDNotFound("Empty ID");
341 for(iter=begin();iter!=end() && id!=(*iter)->get_id();++iter);
344 throw Exception::IDNotFound("ValueNode in ValueNodeList: "+id);
350 ValueNodeList::surefind(const String &id)
353 throw Exception::IDNotFound("Empty ID");
355 ValueNode::Handle value_node;
361 catch(Exception::IDNotFound)
363 value_node=PlaceholderValueNode::create();
364 value_node->set_id(id);
365 push_back(value_node);
366 placeholder_count_++;
373 ValueNodeList::erase(ValueNode::Handle value_node)
379 for(iter=begin();iter!=end();++iter)
380 if(value_node.get()==iter->get())
382 std::list<ValueNode::RHandle>::erase(iter);
383 if(PlaceholderValueNode::Handle::cast_dynamic(value_node))
384 placeholder_count_--;
391 ValueNodeList::add(ValueNode::Handle value_node)
395 if(value_node->get_id().empty())
400 ValueNode::RHandle other_value_node=find(value_node->get_id());
401 if(PlaceholderValueNode::Handle::cast_dynamic(other_value_node))
403 other_value_node->replace(value_node);
404 placeholder_count_--;
410 catch(Exception::IDNotFound)
412 push_back(value_node);
420 ValueNodeList::audit()
424 for(next=begin(),iter=next++;iter!=end();iter=next++)
426 std::list<ValueNode::RHandle>::erase(iter);
431 PlaceholderValueNode::get_name()const
433 return "placeholder";
437 PlaceholderValueNode::get_local_name()const
439 return _("Placeholder");
443 PlaceholderValueNode::clone(const GUID& deriv_guid)const
445 ValueNode* ret(new PlaceholderValueNode());
446 ret->set_guid(get_guid()^deriv_guid);
450 PlaceholderValueNode::Handle
451 PlaceholderValueNode::create(ValueBase::Type type)
453 return new PlaceholderValueNode(type);
457 PlaceholderValueNode::operator()(Time /*t*/)const
463 PlaceholderValueNode::PlaceholderValueNode(ValueBase::Type type):
469 LinkableValueNode::clone(const GUID& deriv_guid)const
471 { ValueNode* x(find_value_node(get_guid()^deriv_guid).get()); if(x)return x; }
474 LinkableValueNode *ret=create_new();
475 ret->set_guid(get_guid()^deriv_guid);
477 for(i=0;i<link_count();i++)
479 ValueNode::Handle link=get_link_vfunc(i);
480 if(!link->is_exported())
482 ValueNode::LooseHandle value_node(find_value_node(link->get_guid()^deriv_guid));
484 value_node=link->clone(deriv_guid);
485 ret->set_link(i,value_node);
488 ret->set_link(i,link);
495 ValueNode::get_relative_id(etl::loose_handle<const Canvas> x)const
497 assert(is_exported());
500 if(x.get()==canvas_.get())
503 return canvas_->_get_relative_id(x)+':'+get_id();
507 ValueNode::set_parent_canvas(etl::loose_handle<Canvas> x)
509 canvas_=x; if(x) root_canvas_=x->get_root();
513 ValueNode::set_root_canvas(etl::loose_handle<Canvas> x)
515 root_canvas_=x->get_root();
518 void LinkableValueNode::get_times_vfunc(Node::time_set &set) const
520 ValueNode::LooseHandle h;
522 int size = link_count();
524 //just add it to the set...
525 for(int i=0; i < size; ++i)
531 const Node::time_set &tset = h->get_times();
532 set.insert(tset.begin(),tset.end());