1 /* === S Y N F I G ========================================================= */
2 /*! \file valuenode.cpp
3 ** \brief Template File
8 ** Copyright (c) 2002-2005 Robert B. Quattlebaum Jr., Adrian Bentley
10 ** This package is free software; you can redistribute it and/or
11 ** modify it under the terms of the GNU General Public License as
12 ** published by the Free Software Foundation; either version 2 of
13 ** the License, or (at your option) any later version.
15 ** This package is distributed in the hope that it will be useful,
16 ** but WITHOUT ANY WARRANTY; without even the implied warranty of
17 ** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
18 ** General Public License for more details.
21 /* ========================================================================= */
23 /* === H E A D E R S ======================================================= */
25 #define SYNFIG_NO_ANGLE
27 //#define HAS_HASH_MAP 1
36 #include "valuenode.h"
40 #include "valuenode_const.h"
41 #include "valuenode_linear.h"
42 #include "valuenode_composite.h"
43 #include "valuenode_reference.h"
44 #include "valuenode_scale.h"
45 #include "valuenode_segcalctangent.h"
46 #include "valuenode_segcalcvertex.h"
47 #include "valuenode_stripes.h"
48 #include "valuenode_subtract.h"
49 #include "valuenode_timedswap.h"
50 #include "valuenode_twotone.h"
51 #include "valuenode_bline.h"
52 #include "valuenode_dynamiclist.h"
53 #include "valuenode_radialcomposite.h"
54 #include "valuenode_gradientrotate.h"
55 #include "valuenode_sine.h"
61 /* === U S I N G =========================================================== */
65 using namespace synfig;
67 /* === M A C R O S ========================================================= */
69 /* === G L O B A L S ======================================================= */
71 static int value_node_count(0);
73 static LinkableValueNode::Book *book_;
76 ValueNode::LooseHandle
77 synfig::find_value_node(const GUID& guid)
79 return guid_cast<ValueNode>(guid);
82 /* === P R O C E D U R E S ================================================= */
84 /* === M E T H O D S ======================================================= */
87 ValueNode::subsys_init()
89 book_=new LinkableValueNode::Book();
91 #define ADD_VALUENODE(class,name,local) \
92 (*book_)[name].factory=reinterpret_cast<LinkableValueNode::Factory>(&class::create); \
93 (*book_)[name].check_type=&class::check_type; \
94 (*book_)[name].local_name=local
96 #define ADD_VALUENODE2(class,name,local) \
97 (*book_)[name].factory=reinterpret_cast<LinkableValueNode::Factory>(&class::create_from); \
98 (*book_)[name].check_type=&class::check_type; \
99 (*book_)[name].local_name=local
101 ADD_VALUENODE(ValueNode_Linear, "linear", _("Linear") );
102 ADD_VALUENODE(ValueNode_Composite, "composite", _("Composite") );
103 ADD_VALUENODE(ValueNode_RadialComposite,"radial_composite", _("Radial Composite") );
104 ADD_VALUENODE(ValueNode_Reference, "reference", _("Reference") );
105 ADD_VALUENODE(ValueNode_Scale, "scale", _("Scale") );
106 ADD_VALUENODE(ValueNode_SegCalcTangent, "segcalctangent", _("Segment Tangent") );
107 ADD_VALUENODE(ValueNode_SegCalcVertex, "segcalcvertex", _("Segment Vertex") );
108 ADD_VALUENODE(ValueNode_Stripes, "stripes", _("Stripes") );
109 ADD_VALUENODE(ValueNode_Subtract, "subtract", _("Subtract") );
110 ADD_VALUENODE(ValueNode_TimedSwap, "timed_swap", _("Timed Swap") );
111 ADD_VALUENODE(ValueNode_TwoTone, "twotone", _("Two-Tone") );
112 ADD_VALUENODE(ValueNode_BLine, "bline", _("BLine") );
113 ADD_VALUENODE2(ValueNode_DynamicList, "dynamic_list", _("Dynamic List") );
114 ADD_VALUENODE(ValueNode_GradientRotate, "gradient_rotate", _("Gradient Rotate") );
115 ADD_VALUENODE(ValueNode_Sine, "sine", _("Sine") );
118 #undef ADD_VALUENODE2
124 ValueNode::subsys_stop()
127 /* if(global_value_node_map.size() || value_node_count)
130 synfig::error("%d ValueNodes haven't been destroyed yet!",value_node_count);
132 if(global_value_node_map.size()!=value_node_count)
133 synfig::error("value node count mismatch! map.size()!=value_node_count (%d!=%d)",global_value_node_map.size(),value_node_count);
135 GlobalValueNodeMap::iterator iter;
136 for(iter=global_value_node_map.begin();iter!=global_value_node_map.end();++iter)
138 if(!iter->second->is_exported())
139 synfig::info("%s: count:%d name:%s type:%s",
140 iter->first.get_string().c_str(),
141 iter->second->count(),
142 iter->second->get_name().c_str(),
143 ValueBase::type_name(iter->second->get_type()).c_str()
146 synfig::info("%s: id:%s count:%d name:%s type:%s",
147 iter->first.get_string().c_str(),
148 iter->second->get_id().c_str(),
149 iter->second->count(),
150 iter->second->get_name().c_str(),
151 ValueBase::type_name(iter->second->get_type()).c_str()
159 ValueNode::ValueNode(ValueBase::Type type):type(type)
164 LinkableValueNode::Book&
165 LinkableValueNode::book()
170 LinkableValueNode::Handle
171 LinkableValueNode::create(const String &name, const ValueBase& x)
173 if(!book().count(name))
175 return book()[name].factory(x);
179 LinkableValueNode::check_type(const String &name, ValueBase::Type x)
181 if(!book().count(name) || !book()[name].check_type)
183 return book()[name].check_type(x);
187 LinkableValueNode::set_link(int i,ValueNode::Handle x)
189 ValueNode::Handle previous(get_link(i));
191 if(set_link_vfunc(i,x))
194 remove_child(previous.get());
197 if(!x->is_exported() && get_parent_canvas())
199 x->set_parent_canvas(get_parent_canvas());
207 ValueNode::LooseHandle
208 LinkableValueNode::get_link(int i)const
210 return get_link_vfunc(i);
214 LinkableValueNode::unlink_all()
216 for(int i=0;i<link_count();i++)
218 ValueNode::LooseHandle value_node(get_link(i));
220 value_node->parent_set.erase(this);
224 ValueNode::~ValueNode()
234 ValueNode::on_changed()
236 if(get_parent_canvas())
237 get_parent_canvas()->signal_value_node_changed()(this);
238 else if(get_root_canvas() && get_parent_canvas())
239 get_root_canvas()->signal_value_node_changed()(this);
245 ValueNode::replace(etl::handle<ValueNode> x)
250 while(parent_set.size())
252 (*parent_set.begin())->add_child(x.get());
253 (*parent_set.begin())->remove_child(this);
254 //x->parent_set.insert(*parent_set.begin());
255 //parent_set.erase(parent_set.begin());
257 int r(RHandle(this).replace(x));
263 ValueNode::set_id(const String &x)
268 signal_id_changed_();
272 ValueNodeList::ValueNodeList():
273 placeholder_count_(0)
278 ValueNodeList::count(const String &id)const
285 for(iter=begin();iter!=end() && id!=(*iter)->get_id();++iter);
294 ValueNodeList::find(const String &id)
299 throw Exception::IDNotFound("Empty ID");
301 for(iter=begin();iter!=end() && id!=(*iter)->get_id();++iter);
304 throw Exception::IDNotFound("ValueNode in ValueNodeList: "+id);
309 ValueNode::ConstHandle
310 ValueNodeList::find(const String &id)const
315 throw Exception::IDNotFound("Empty ID");
317 for(iter=begin();iter!=end() && id!=(*iter)->get_id();++iter);
320 throw Exception::IDNotFound("ValueNode in ValueNodeList: "+id);
326 ValueNodeList::surefind(const String &id)
329 throw Exception::IDNotFound("Empty ID");
331 ValueNode::Handle value_node;
337 catch(Exception::IDNotFound)
339 value_node=PlaceholderValueNode::create();
340 value_node->set_id(id);
341 push_back(value_node);
342 placeholder_count_++;
349 ValueNodeList::erase(ValueNode::Handle value_node)
355 for(iter=begin();iter!=end();++iter)
356 if(value_node.get()==iter->get())
358 std::list<ValueNode::RHandle>::erase(iter);
359 if(PlaceholderValueNode::Handle::cast_dynamic(value_node))
360 placeholder_count_--;
367 ValueNodeList::add(ValueNode::Handle value_node)
371 if(value_node->get_id().empty())
376 ValueNode::RHandle other_value_node=find(value_node->get_id());
377 if(PlaceholderValueNode::Handle::cast_dynamic(other_value_node))
379 other_value_node->replace(value_node);
380 placeholder_count_--;
386 catch(Exception::IDNotFound)
388 push_back(value_node);
396 ValueNodeList::audit()
400 for(next=begin(),iter=next++;iter!=end();iter=next++)
402 std::list<ValueNode::RHandle>::erase(iter);
407 PlaceholderValueNode::get_name()const
409 return "placeholder";
413 PlaceholderValueNode::get_local_name()const
415 return _("Placeholder");
419 PlaceholderValueNode::clone(const GUID& deriv_guid)const
421 ValueNode* ret(new PlaceholderValueNode());
422 ret->set_guid(get_guid()^deriv_guid);
426 PlaceholderValueNode::Handle
427 PlaceholderValueNode::create(ValueBase::Type type)
429 return new PlaceholderValueNode(type);
433 PlaceholderValueNode::operator()(Time /*t*/)const
439 PlaceholderValueNode::PlaceholderValueNode(ValueBase::Type type):
445 LinkableValueNode::clone(const GUID& deriv_guid)const
447 { ValueNode* x(find_value_node(get_guid()^deriv_guid).get()); if(x)return x; }
450 LinkableValueNode *ret=create_new();
451 ret->set_guid(get_guid()^deriv_guid);
453 for(i=0;i<link_count();i++)
455 ValueNode::Handle link=get_link_vfunc(i);
456 if(!link->is_exported())
458 ValueNode::LooseHandle value_node(find_value_node(link->get_guid()^deriv_guid));
460 value_node=link->clone(deriv_guid);
461 ret->set_link(i,value_node);
464 ret->set_link(i,link);
471 ValueNode::get_relative_id(etl::loose_handle<const Canvas> x)const
473 assert(is_exported());
476 if(x.get()==canvas_.get())
479 return canvas_->_get_relative_id(x)+':'+get_id();
483 ValueNode::set_parent_canvas(etl::loose_handle<Canvas> x)
485 canvas_=x; if(x) root_canvas_=x->get_root();
489 ValueNode::set_root_canvas(etl::loose_handle<Canvas> x)
491 root_canvas_=x->get_root();
494 void LinkableValueNode::get_times_vfunc(Node::time_set &set) const
496 ValueNode::LooseHandle h;
498 int size = link_count();
500 //just add it to the set...
501 for(int i=0; i < size; ++i)
507 const Node::time_set &tset = h->get_times();
508 set.insert(tset.begin(),tset.end());