1 /* === S Y N F I G ========================================================= */
2 /*! \file valuenode_bline.cpp
3 ** \brief Template File
5 ** $Id: valuenode_bline.cpp,v 1.1.1.1 2005/01/04 01:23:15 darco Exp $
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 ======================================================= */
32 #include "valuenode_bline.h"
33 #include "valuenode_const.h"
34 #include "valuenode_composite.h"
36 #include "exception.h"
37 #include "blinepoint.h"
41 #include <ETL/hermite>
42 #include <ETL/calculus>
47 /* === U S I N G =========================================================== */
51 using namespace synfig;
53 /* === M A C R O S ========================================================= */
55 /* === G L O B A L S ======================================================= */
57 /* === P R O C E D U R E S ================================================= */
60 linear_interpolation(const Vector& a, const Vector& b, float c)
64 radial_interpolation(const Vector& a, const Vector& b, float c)
66 affine_combo<Real,float> mag_combo;
67 affine_combo<Angle,float> ang_combo;
69 Real mag(mag_combo(a.mag(),b.mag(),c));
70 Angle ang(ang_combo(Angle::tan(a[1],a[0]),Angle::tan(b[1],b[0]),c));
72 return Point( mag*Angle::cos(ang).get(),mag*Angle::sin(ang).get() );
78 synfig::convert_bline_to_segment_list(const ValueBase& bline)
80 std::vector<Segment> ret;
82 // std::vector<BLinePoint> list(bline.operator std::vector<BLinePoint>());
83 //std::vector<BLinePoint> list(bline);
84 std::vector<BLinePoint> list(bline.get_list().begin(),bline.get_list().end());
85 std::vector<BLinePoint>::const_iterator iter;
87 BLinePoint prev,first;
89 //start with prev = first and iter on the second...
91 if(list.empty()) return ValueBase(ret,bline.get_loop());
92 first = prev = list.front();
94 for(iter=++list.begin();iter!=list.end();++iter)
117 return ValueBase(ret,bline.get_loop());
121 synfig::convert_bline_to_width_list(const ValueBase& bline)
123 std::vector<Real> ret;
124 // std::vector<BLinePoint> list(bline.operator std::vector<BLinePoint>());
125 //std::vector<BLinePoint> list(bline);
126 std::vector<BLinePoint> list(bline.get_list().begin(),bline.get_list().end());
127 std::vector<BLinePoint>::const_iterator iter;
130 return ValueBase(ValueBase::TYPE_LIST);
132 for(iter=list.begin();iter!=list.end();++iter)
133 ret.push_back(iter->get_width());
136 ret.push_back(list.front().get_width());
138 return ValueBase(ret,bline.get_loop());
142 /* === M E T H O D S ======================================================= */
145 ValueNode_BLine::ValueNode_BLine():
146 ValueNode_DynamicList(ValueBase::TYPE_BLINEPOINT)
150 ValueNode_BLine::~ValueNode_BLine()
155 ValueNode_BLine::create(const ValueBase &value)
157 if(value.get_type()!=ValueBase::TYPE_LIST)
160 ValueNode_BLine* value_node(new ValueNode_BLine());
164 switch(value.get_contained_type())
166 case ValueBase::TYPE_BLINEPOINT:
168 // std::vector<BLinePoint> bline_points(value.operator std::vector<BLinePoint>());
169 //std::vector<BLinePoint> bline_points(value);
170 std::vector<BLinePoint> bline_points(value.get_list().begin(),value.get_list().end());
171 std::vector<BLinePoint>::const_iterator iter;
173 for(iter=bline_points.begin();iter!=bline_points.end();iter++)
175 value_node->add(ValueNode::Handle(ValueNode_Composite::create(*iter)));
177 value_node->set_loop(value.get_loop());
180 case ValueBase::TYPE_SEGMENT:
182 // Here, we want to convert a list of segments
183 // into a list of BLinePoints. We make an assumption
184 // that the segment list is continuous(sp), but not necessarily
187 value_node->set_loop(false);
188 // std::vector<Segment> segments(value.operator std::vector<Segment>());
189 // std::vector<Segment> segments(value);
190 std::vector<Segment> segments(value.get_list().begin(),value.get_list().end());
191 std::vector<Segment>::const_iterator iter,last(segments.end());
193 ValueNode_Const::Handle prev,first;
195 for(iter=segments.begin();iter!=segments.end();iter++)
197 #define PREV_POINT prev->get_value().get(BLinePoint())
198 #define FIRST_POINT first->get_value().get(BLinePoint())
199 #define CURR_POINT curr->get_value().get(BLinePoint())
200 if(iter==segments.begin())
202 prev=ValueNode_Const::create(ValueBase::TYPE_BLINEPOINT);
204 BLinePoint prev_point(PREV_POINT);
205 prev_point.set_vertex(iter->p1);
206 prev_point.set_tangent1(iter->t1);
207 prev_point.set_width(0.01);
208 prev_point.set_origin(0.5);
209 prev_point.set_split_tangent_flag(false);
210 prev->set_value(prev_point);
213 value_node->add(ValueNode::Handle(prev));
216 if(iter==last && iter->p2.is_equal_to(FIRST_POINT.get_vertex()))
218 value_node->set_loop(true);
219 if(!iter->t2.is_equal_to(FIRST_POINT.get_tangent1()))
221 BLinePoint first_point(FIRST_POINT);
222 first_point.set_tangent1(iter->t2);
223 first->set_value(first_point);
228 ValueNode_Const::Handle curr;
229 curr=ValueNode_Const::create(ValueBase::TYPE_BLINEPOINT);
231 BLinePoint curr_point(CURR_POINT);
232 curr_point.set_vertex(iter->p2);
233 curr_point.set_tangent1(iter->t2);
234 curr_point.set_width(0.01);
235 curr_point.set_origin(0.5);
236 curr_point.set_split_tangent_flag(false);
237 curr->set_value(curr_point);
239 if(!PREV_POINT.get_tangent1().is_equal_to(iter->t1))
241 BLinePoint prev_point(PREV_POINT);
242 prev_point.set_split_tangent_flag(true);
243 prev_point.set_tangent2(iter->t1);
244 prev->set_value(prev_point);
246 value_node->add(ValueNode::Handle(curr));
253 // We got a list of who-knows-what. We don't have any idea
254 // what to do with it.
264 ValueNode_BLine::ListEntry
265 ValueNode_BLine::create_list_entry(int index, Time time, Real origin)
267 ValueNode_BLine::ListEntry ret;
270 synfig::BLinePoint prev,next;
274 index=index%link_count();
278 ret.set_parent_value_node(this);
280 if(!list[index].status_at_time(time))
281 next_i=find_next_valid_entry(index,time);
284 prev_i=find_prev_valid_entry(index,time);
286 synfig::info("index=%d, next_i=%d, prev_i=%d",index,next_i,prev_i);
288 next=(*list[next_i].value_node)(time);
289 prev=(*list[prev_i].value_node)(time);
291 etl::hermite<Vector> curve(prev.get_vertex(),next.get_vertex(),prev.get_tangent2(),next.get_tangent1());
292 etl::derivative< etl::hermite<Vector> > deriv(curve);
294 synfig::BLinePoint bline_point;
295 bline_point.set_vertex(curve(origin));
296 bline_point.set_width((next.get_width()-prev.get_width())*origin+prev.get_width());
297 bline_point.set_tangent1(deriv(origin)*min(1.0-origin,origin));
298 bline_point.set_tangent2(bline_point.get_tangent1());
299 bline_point.set_split_tangent_flag(false);
300 bline_point.set_origin(origin);
302 ret.value_node=ValueNode_Composite::create(bline_point);
308 ValueNode_BLine::operator()(Time t)const
310 std::vector<BLinePoint> ret_list;
312 std::vector<ListEntry>::const_iterator iter,first_iter;
313 bool first_flag(true);
316 float next_scale(1.0f);
318 BLinePoint prev,first;
319 first.set_origin(100.0f);
321 for(iter=list.begin();iter!=list.end();++iter,index++)
323 float amount(iter->amount_at_time(t,&rising));
325 assert(amount>=0.0f);
326 assert(amount<=1.0f);
333 first=prev=(*iter->value_node)(t).get(prev);
335 ret_list.push_back(first);
340 curr=(*iter->value_node)(t).get(prev);
344 ret_list.back().set_split_tangent_flag(true);
345 ret_list.back().set_tangent2(prev.get_tangent2()*next_scale);
347 ret_list.push_back(curr);
349 ret_list.back().set_split_tangent_flag(true);
350 ret_list.back().set_tangent2(curr.get_tangent2());
351 ret_list.back().set_tangent1(curr.get_tangent1()*next_scale);
357 ret_list.push_back(curr);
366 std::vector<ListEntry>::const_iterator begin_iter,end_iter;
368 // This is where the interesting stuff happens
369 // We need to seek forward in the list to see what the next
373 BLinePoint begin; // begin of dynamic group
374 BLinePoint end; // End of dynamic group
376 int dist_from_begin(0), dist_from_end(0);
384 try{ end_time=iter->find_prev(t)->get_time(); }
385 catch(...) { end_time=Time::begin(); }
386 try{ begin_time=iter->find_next(t)->get_time(); }
387 catch(...) { begin_time=Time::end(); }
391 try{ begin_time=iter->find_prev(t)->get_time(); }
392 catch(...) { begin_time=Time::begin(); }
393 try{ end_time=iter->find_next(t)->get_time(); }
394 catch(...) { end_time=Time::end(); }
396 blend_time=begin_time;
397 curr=(*iter->value_node)(end_time).get(curr);
399 // curr=(*iter->value_node)(t).get(curr);
401 // Find "end" of dynamic group
403 // for(++end_iter;begin_iter!=list.end();++end_iter)
404 for(++end_iter;end_iter!=list.end();++end_iter)
405 if(end_iter->amount_at_time(t)>amount)
407 end=(*end_iter->value_node)(blend_time).get(prev);
411 // If we did not find an end of the dynamic group...
412 if(end_iter==list.end())
417 end=(*end_iter->value_node)(blend_time).get(prev);
424 end=(*end_iter->value_node)(blend_time).get(prev);
429 // Find "begin" of dynamic group
431 begin.set_origin(100.0f); // set the origin to 100 (which is crazy) so that we can check to see if it was found
434 if(begin_iter==list.begin())
437 begin_iter=list.end();
448 if(begin_iter->amount_at_time(t)>amount)
450 begin=(*begin_iter->value_node)(blend_time).get(prev);
453 }while(begin_iter!=iter);
455 // If we did not find a begin
456 if(begin.get_origin()==100.0f)
460 begin_iter=first_iter;
461 begin=(*begin_iter->value_node)(blend_time).get(prev);
467 begin_iter=first_iter;
468 begin=(*begin_iter->value_node)(blend_time).get(prev);
473 etl::hermite<Vector> curve(begin.get_vertex(),end.get_vertex(),begin.get_tangent2(),end.get_tangent1());
474 etl::derivative< etl::hermite<Vector> > deriv(curve);
476 ret.set_vertex(curve(curr.get_origin()));
478 ret.set_width((end.get_width()-begin.get_width())*curr.get_origin()+begin.get_width());
480 ret.set_tangent1(deriv(curr.get_origin()));
481 ret.set_tangent2(deriv(curr.get_origin()));
483 float prev_tangent_scalar(1.0f);
484 float next_tangent_scalar(1.0f);
486 //synfig::info("index_%d:dist_from_begin=%d",index,dist_from_begin);
487 //synfig::info("index_%d:dist_from_end=%d",index,dist_from_end);
489 // If we are the next to the begin
490 if(begin_iter==--std::vector<ListEntry>::const_iterator(iter) || dist_from_begin==1)
492 prev_tangent_scalar=(1.0f-curr.get_origin())*amount+curr.get_origin();
496 float origin=curr.get_origin()-prev.get_origin();
497 prev_tangent_scalar=(1.0f-origin)*amount+origin;
500 // If we are the next to the end
501 if(end_iter==++std::vector<ListEntry>::const_iterator(iter) || dist_from_end==1)
503 float origin=1.0-curr.get_origin();
504 next_tangent_scalar=(1.0f-origin)*amount+origin;
507 if(list.end()!=++std::vector<ListEntry>::const_iterator(iter))
510 next=((*(++std::vector<ListEntry>::const_iterator(iter))->value_node)(t).get(prev));
511 float origin=next.get_origin()-curr.get_origin();
512 next_tangent_scalar=(1.0f-origin)*amount+origin;
514 next_scale=next_tangent_scalar;
516 //ret.set_vertex((curr.get_vertex()-ret.get_vertex())*amount+ret.get_vertex());
520 Point ref_point_begin(
522 (*begin_iter->value_node)(begin_time).get(prev).get_vertex() +
523 (*end_iter->value_node)(begin_time).get(prev).get_vertex()
528 (*begin_iter->value_node)(end_time).get(prev).get_vertex() +
529 (*end_iter->value_node)(end_time).get(prev).get_vertex()
534 (*begin_iter->value_node)(t).get(prev).get_vertex() +
535 (*end_iter->value_node)(t).get(prev).get_vertex()
538 Point ref_point_linear((ref_point_end-ref_point_begin)*amount+ref_point_begin);
541 (curr.get_vertex()-ret.get_vertex())*amount+ret.get_vertex() +
542 (ref_point_now-ref_point_linear)
544 ret.set_tangent1((curr.get_tangent1()-ret.get_tangent1())*amount+ret.get_tangent1());
545 ret.set_split_tangent_flag(curr.get_split_tangent_flag());
546 if(ret.get_split_tangent_flag())
547 ret.set_tangent2((curr.get_tangent2()-ret.get_tangent2())*amount+ret.get_tangent2());
552 Point begin_cord_sys[2], begin_cord_origin;
553 Point end_cord_sys[2], end_cord_origin;
554 Point curr_cord_sys[2], curr_cord_origin;
557 const Point a((*end_iter->value_node)(begin_time).get(prev).get_vertex());
558 const Point b((*begin_iter->value_node)(begin_time).get(prev).get_vertex());
559 begin_cord_origin=(a+b)/2;
560 begin_cord_sys[0]=( b - a ).norm();
561 begin_cord_sys[1]=begin_cord_sys[0].perp();
564 const Point a((*end_iter->value_node)(end_time).get(prev).get_vertex());
565 const Point b((*begin_iter->value_node)(end_time).get(prev).get_vertex());
566 end_cord_origin=(a+b)/2;
567 end_cord_sys[0]=( b - a ).norm();
568 end_cord_sys[1]=end_cord_sys[0].perp();
571 const Point a((*end_iter->value_node)(t).get(prev).get_vertex());
572 const Point b((*begin_iter->value_node)(t).get(prev).get_vertex());
573 curr_cord_origin=(a+b)/2;
574 curr_cord_sys[0]=( b - a ).norm();
575 curr_cord_sys[1]=curr_cord_sys[0].perp();
579 end_cord_origin=(*end_iter->value_node)(end_time).get(prev).get_vertex();
581 (*begin_iter->value_node)(end_time).get(prev).get_vertex() -
584 end_cord_sys[1]=end_cord_sys[0].perp();
586 curr_cord_origin=(*end_iter->value_node)(t).get(prev).get_vertex();
588 (*begin_iter->value_node)(t).get(prev).get_vertex() -
591 curr_cord_sys[1]=curr_cord_sys[0].perp();
594 // Convert start point
598 Point tmp(ret.get_vertex()-begin_cord_origin);
599 a[0]=tmp*begin_cord_sys[0];
600 a[1]=tmp*begin_cord_sys[1];
601 #define COORD_SYS_RADIAL_TAN_INTERP 1
603 #ifdef COORD_SYS_RADIAL_TAN_INTERP
604 tmp=ret.get_tangent1()+ret.get_vertex()-begin_cord_origin;
605 at1[0]=tmp*begin_cord_sys[0];
606 at1[1]=tmp*begin_cord_sys[1];
608 if(curr.get_split_tangent_flag())
610 tmp=ret.get_tangent2()+ret.get_vertex()-begin_cord_origin;
611 at2[0]=tmp*begin_cord_sys[0];
612 at2[1]=tmp*begin_cord_sys[1];
617 // Convert finish point
621 Point tmp(curr.get_vertex()-end_cord_origin);
622 b[0]=tmp*end_cord_sys[0];
623 b[1]=tmp*end_cord_sys[1];
625 #ifdef COORD_SYS_RADIAL_TAN_INTERP
626 tmp=curr.get_tangent1()+curr.get_vertex()-end_cord_origin;
627 bt1[0]=tmp*end_cord_sys[0];
628 bt1[1]=tmp*end_cord_sys[1];
630 if(curr.get_split_tangent_flag())
632 tmp=curr.get_tangent2()+curr.get_vertex()-end_cord_origin;
633 bt2[0]=tmp*end_cord_sys[0];
634 bt2[1]=tmp*end_cord_sys[1];
639 // Convert current point
643 // Transpose (invert)
644 swap(curr_cord_sys[0][1],curr_cord_sys[1][0]);
646 Point tmp((b-a)*amount+a);
647 c[0]=tmp*curr_cord_sys[0];
648 c[1]=tmp*curr_cord_sys[1];
651 #define INTERP_FUNCTION radial_interpolation
652 //#define INTERP_FUNCTION linear_interpolation
654 #ifdef COORD_SYS_RADIAL_TAN_INTERP
655 tmp=INTERP_FUNCTION(at1,bt1,amount);
656 ct1[0]=tmp*curr_cord_sys[0];
657 ct1[1]=tmp*curr_cord_sys[1];
658 ct1+=curr_cord_origin;
661 if(curr.get_split_tangent_flag())
663 tmp=INTERP_FUNCTION(at2,bt2,amount);
664 ct2[0]=tmp*curr_cord_sys[0];
665 ct2[1]=tmp*curr_cord_sys[1];
666 ct2+=curr_cord_origin;
673 #ifndef COORD_SYS_RADIAL_TAN_INTERP
674 ret.set_tangent1(radial_interpolation(ret.get_tangent1(),curr.get_tangent1(),amount));
675 ret.set_split_tangent_flag(curr.get_split_tangent_flag());
676 if(ret.get_split_tangent_flag())
677 ret.set_tangent2(radial_interpolation(ret.get_tangent2(),curr.get_tangent2(),amount));
679 ret.set_tangent1(ct1);
680 ret.set_split_tangent_flag(curr.get_split_tangent_flag());
681 if(ret.get_split_tangent_flag())
682 ret.set_tangent2(ct2);
686 ret.set_origin(curr.get_origin());
687 ret.set_width((curr.get_width()-ret.get_width())*amount+ret.get_width());
690 // Handle the case where we are the first vertex
693 ret.set_tangent1(ret.get_tangent1()*prev_tangent_scalar);
697 ret_list.push_back(ret);
701 ret_list.back().set_split_tangent_flag(true);
702 ret_list.back().set_tangent2(prev.get_tangent2()*prev_tangent_scalar);
703 ret_list.push_back(ret);
704 ret_list.back().set_split_tangent_flag(true);
705 //ret_list.back().set_tangent2(ret.get_tangent1());
706 ret_list.back().set_tangent1(ret.get_tangent1()*prev_tangent_scalar);
714 ret_list.back().set_split_tangent_flag(true);
715 ret_list.back().set_tangent2(prev.get_tangent2()*next_scale);
719 if(get_loop() && !first_flag)
733 synfig::warning(string("ValueNode_BLine::operator()():")+_("No entries in list"));
736 synfig::warning(string("ValueNode_BLine::operator()():")+_("No entries in ret_list"));
738 return ValueBase(ret_list,get_loop());
742 ValueNode_BLine::link_local_name(int i)const
744 assert(i>=0 && (unsigned)i<list.size());
745 return etl::strprintf(_("Vertex %03d"),i+1);
749 ValueNode_BLine::clone(const GUID& deriv_guid)const
751 { ValueNode* x(find_value_node(get_guid()^deriv_guid).get()); if(x)return x; }
753 ValueNode_BLine* ret=new ValueNode_BLine();
754 ret->set_guid(get_guid()^deriv_guid);
756 std::vector<ListEntry>::const_iterator iter;
758 for(iter=list.begin();iter!=list.end();++iter)
760 if(iter->value_node->is_exported())
764 ListEntry list_entry(*iter);
765 //list_entry.value_node=find_value_node(iter->value_node->get_guid()^deriv_guid).get();
766 //if(!list_entry.value_node)
767 list_entry.value_node=iter->value_node->clone(deriv_guid);
768 ret->add(list_entry);
769 //ret->list.back().value_node=iter->value_node.clone();
772 ret->set_loop(get_loop());
778 ValueNode_BLine::get_name()const
784 ValueNode_BLine::get_local_name()const
790 ValueNode_BLine::create_new()const
797 ValueNode_BLine::check_type(ValueBase::Type type)
799 return type==ValueBase::TYPE_LIST;