1 /* === S Y N F I G ========================================================= */
2 /*! \file valuenode_bline.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 ======================================================= */
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 // if either extreme is zero then use linear interpolation instead
67 if (a.is_equal_to(Vector::zero()) || b.is_equal_to(Vector::zero()))
68 return linear_interpolation(a, b, c);
70 affine_combo<Real,float> mag_combo;
71 affine_combo<Angle,float> ang_combo;
73 Real mag(mag_combo(a.mag(),b.mag(),c));
74 Angle ang(ang_combo(Angle::tan(a[1],a[0]),Angle::tan(b[1],b[0]),c));
76 return Point( mag*Angle::cos(ang).get(),mag*Angle::sin(ang).get() );
82 synfig::convert_bline_to_segment_list(const ValueBase& bline)
84 std::vector<Segment> ret;
86 // std::vector<BLinePoint> list(bline.operator std::vector<BLinePoint>());
87 //std::vector<BLinePoint> list(bline);
88 std::vector<BLinePoint> list(bline.get_list().begin(),bline.get_list().end());
89 std::vector<BLinePoint>::const_iterator iter;
91 BLinePoint prev,first;
93 //start with prev = first and iter on the second...
95 if(list.empty()) return ValueBase(ret,bline.get_loop());
96 first = prev = list.front();
98 for(iter=++list.begin();iter!=list.end();++iter)
121 return ValueBase(ret,bline.get_loop());
125 synfig::convert_bline_to_width_list(const ValueBase& bline)
127 std::vector<Real> ret;
128 // std::vector<BLinePoint> list(bline.operator std::vector<BLinePoint>());
129 //std::vector<BLinePoint> list(bline);
130 std::vector<BLinePoint> list(bline.get_list().begin(),bline.get_list().end());
131 std::vector<BLinePoint>::const_iterator iter;
134 return ValueBase(ValueBase::TYPE_LIST);
136 for(iter=list.begin();iter!=list.end();++iter)
137 ret.push_back(iter->get_width());
140 ret.push_back(list.front().get_width());
142 return ValueBase(ret,bline.get_loop());
146 /* === M E T H O D S ======================================================= */
149 ValueNode_BLine::ValueNode_BLine():
150 ValueNode_DynamicList(ValueBase::TYPE_BLINEPOINT)
154 ValueNode_BLine::~ValueNode_BLine()
159 ValueNode_BLine::create(const ValueBase &value)
161 if(value.get_type()!=ValueBase::TYPE_LIST)
164 ValueNode_BLine* value_node(new ValueNode_BLine());
168 switch(value.get_contained_type())
170 case ValueBase::TYPE_BLINEPOINT:
172 // std::vector<BLinePoint> bline_points(value.operator std::vector<BLinePoint>());
173 //std::vector<BLinePoint> bline_points(value);
174 std::vector<BLinePoint> bline_points(value.get_list().begin(),value.get_list().end());
175 std::vector<BLinePoint>::const_iterator iter;
177 for(iter=bline_points.begin();iter!=bline_points.end();iter++)
179 value_node->add(ValueNode::Handle(ValueNode_Composite::create(*iter)));
181 value_node->set_loop(value.get_loop());
184 case ValueBase::TYPE_SEGMENT:
186 // Here, we want to convert a list of segments
187 // into a list of BLinePoints. We make an assumption
188 // that the segment list is continuous(sp), but not necessarily
191 value_node->set_loop(false);
192 // std::vector<Segment> segments(value.operator std::vector<Segment>());
193 // std::vector<Segment> segments(value);
194 std::vector<Segment> segments(value.get_list().begin(),value.get_list().end());
195 std::vector<Segment>::const_iterator iter,last(segments.end());
197 ValueNode_Const::Handle prev,first;
199 for(iter=segments.begin();iter!=segments.end();iter++)
201 #define PREV_POINT prev->get_value().get(BLinePoint())
202 #define FIRST_POINT first->get_value().get(BLinePoint())
203 #define CURR_POINT curr->get_value().get(BLinePoint())
204 if(iter==segments.begin())
206 prev=ValueNode_Const::create(ValueBase::TYPE_BLINEPOINT);
208 BLinePoint prev_point(PREV_POINT);
209 prev_point.set_vertex(iter->p1);
210 prev_point.set_tangent1(iter->t1);
211 prev_point.set_width(0.01);
212 prev_point.set_origin(0.5);
213 prev_point.set_split_tangent_flag(false);
214 prev->set_value(prev_point);
217 value_node->add(ValueNode::Handle(prev));
220 if(iter==last && iter->p2.is_equal_to(FIRST_POINT.get_vertex()))
222 value_node->set_loop(true);
223 if(!iter->t2.is_equal_to(FIRST_POINT.get_tangent1()))
225 BLinePoint first_point(FIRST_POINT);
226 first_point.set_tangent1(iter->t2);
227 first->set_value(first_point);
232 ValueNode_Const::Handle curr;
233 curr=ValueNode_Const::create(ValueBase::TYPE_BLINEPOINT);
235 BLinePoint curr_point(CURR_POINT);
236 curr_point.set_vertex(iter->p2);
237 curr_point.set_tangent1(iter->t2);
238 curr_point.set_width(0.01);
239 curr_point.set_origin(0.5);
240 curr_point.set_split_tangent_flag(false);
241 curr->set_value(curr_point);
243 if(!PREV_POINT.get_tangent1().is_equal_to(iter->t1))
245 BLinePoint prev_point(PREV_POINT);
246 prev_point.set_split_tangent_flag(true);
247 prev_point.set_tangent2(iter->t1);
248 prev->set_value(prev_point);
250 value_node->add(ValueNode::Handle(curr));
257 // We got a list of who-knows-what. We don't have any idea
258 // what to do with it.
268 ValueNode_BLine::ListEntry
269 ValueNode_BLine::create_list_entry(int index, Time time, Real origin)
271 ValueNode_BLine::ListEntry ret;
274 synfig::BLinePoint prev,next;
278 index=index%link_count();
282 ret.set_parent_value_node(this);
284 if(!list[index].status_at_time(time))
285 next_i=find_next_valid_entry(index,time);
288 prev_i=find_prev_valid_entry(index,time);
290 synfig::info("index=%d, next_i=%d, prev_i=%d",index,next_i,prev_i);
292 next=(*list[next_i].value_node)(time);
293 prev=(*list[prev_i].value_node)(time);
295 etl::hermite<Vector> curve(prev.get_vertex(),next.get_vertex(),prev.get_tangent2(),next.get_tangent1());
296 etl::derivative< etl::hermite<Vector> > deriv(curve);
298 synfig::BLinePoint bline_point;
299 bline_point.set_vertex(curve(origin));
300 bline_point.set_width((next.get_width()-prev.get_width())*origin+prev.get_width());
301 bline_point.set_tangent1(deriv(origin)*min(1.0-origin,origin));
302 bline_point.set_tangent2(bline_point.get_tangent1());
303 bline_point.set_split_tangent_flag(false);
304 bline_point.set_origin(origin);
306 ret.value_node=ValueNode_Composite::create(bline_point);
312 ValueNode_BLine::operator()(Time t)const
314 std::vector<BLinePoint> ret_list;
316 std::vector<ListEntry>::const_iterator iter,first_iter;
317 bool first_flag(true);
320 float next_scale(1.0f);
322 BLinePoint prev,first;
323 first.set_origin(100.0f);
325 for(iter=list.begin();iter!=list.end();++iter,index++)
327 float amount(iter->amount_at_time(t,&rising));
329 assert(amount>=0.0f);
330 assert(amount<=1.0f);
337 first=prev=(*iter->value_node)(t).get(prev);
339 ret_list.push_back(first);
344 curr=(*iter->value_node)(t).get(prev);
348 ret_list.back().set_split_tangent_flag(true);
349 ret_list.back().set_tangent2(prev.get_tangent2()*next_scale);
351 ret_list.push_back(curr);
353 ret_list.back().set_split_tangent_flag(true);
354 ret_list.back().set_tangent2(curr.get_tangent2());
355 ret_list.back().set_tangent1(curr.get_tangent1()*next_scale);
361 ret_list.push_back(curr);
370 std::vector<ListEntry>::const_iterator begin_iter,end_iter;
372 // This is where the interesting stuff happens
373 // We need to seek forward in the list to see what the next
377 BLinePoint begin; // begin of dynamic group
378 BLinePoint end; // End of dynamic group
380 int dist_from_begin(0), dist_from_end(0);
388 try{ end_time=iter->find_prev(t)->get_time(); }
389 catch(...) { end_time=Time::begin(); }
390 try{ begin_time=iter->find_next(t)->get_time(); }
391 catch(...) { begin_time=Time::end(); }
395 try{ begin_time=iter->find_prev(t)->get_time(); }
396 catch(...) { begin_time=Time::begin(); }
397 try{ end_time=iter->find_next(t)->get_time(); }
398 catch(...) { end_time=Time::end(); }
400 blend_time=begin_time;
401 curr=(*iter->value_node)(end_time).get(curr);
403 // curr=(*iter->value_node)(t).get(curr);
405 // Find "end" of dynamic group
407 // for(++end_iter;begin_iter!=list.end();++end_iter)
408 for(++end_iter;end_iter!=list.end();++end_iter)
409 if(end_iter->amount_at_time(t)>amount)
411 end=(*end_iter->value_node)(blend_time).get(prev);
415 // If we did not find an end of the dynamic group...
416 if(end_iter==list.end())
421 end=(*end_iter->value_node)(blend_time).get(prev);
428 end=(*end_iter->value_node)(blend_time).get(prev);
433 // Find "begin" of dynamic group
435 begin.set_origin(100.0f); // set the origin to 100 (which is crazy) so that we can check to see if it was found
438 if(begin_iter==list.begin())
441 begin_iter=list.end();
452 if(begin_iter->amount_at_time(t)>amount)
454 begin=(*begin_iter->value_node)(blend_time).get(prev);
457 }while(begin_iter!=iter);
459 // If we did not find a begin
460 if(begin.get_origin()==100.0f)
464 begin_iter=first_iter;
465 begin=(*begin_iter->value_node)(blend_time).get(prev);
471 begin_iter=first_iter;
472 begin=(*begin_iter->value_node)(blend_time).get(prev);
477 etl::hermite<Vector> curve(begin.get_vertex(),end.get_vertex(),begin.get_tangent2(),end.get_tangent1());
478 etl::derivative< etl::hermite<Vector> > deriv(curve);
480 ret.set_vertex(curve(curr.get_origin()));
482 ret.set_width((end.get_width()-begin.get_width())*curr.get_origin()+begin.get_width());
484 ret.set_tangent1(deriv(curr.get_origin()));
485 ret.set_tangent2(deriv(curr.get_origin()));
487 float prev_tangent_scalar(1.0f);
488 float next_tangent_scalar(1.0f);
490 //synfig::info("index_%d:dist_from_begin=%d",index,dist_from_begin);
491 //synfig::info("index_%d:dist_from_end=%d",index,dist_from_end);
493 // If we are the next to the begin
494 if(begin_iter==--std::vector<ListEntry>::const_iterator(iter) || dist_from_begin==1)
496 prev_tangent_scalar=(1.0f-curr.get_origin())*amount+curr.get_origin();
500 float origin=curr.get_origin()-prev.get_origin();
501 prev_tangent_scalar=(1.0f-origin)*amount+origin;
504 // If we are the next to the end
505 if(end_iter==++std::vector<ListEntry>::const_iterator(iter) || dist_from_end==1)
507 float origin=1.0-curr.get_origin();
508 next_tangent_scalar=(1.0f-origin)*amount+origin;
511 if(list.end()!=++std::vector<ListEntry>::const_iterator(iter))
514 next=((*(++std::vector<ListEntry>::const_iterator(iter))->value_node)(t).get(prev));
515 float origin=next.get_origin()-curr.get_origin();
516 next_tangent_scalar=(1.0f-origin)*amount+origin;
520 //! \todo this isn't quite right; we should handle looped blines identically no matter where the loop happens
521 //! and we currently don't. this at least makes it a lot better than it was before
522 float origin=end.get_origin()-curr.get_origin();
523 next_tangent_scalar=(1.0f-origin)*amount+origin;
525 next_scale=next_tangent_scalar;
527 //ret.set_vertex((curr.get_vertex()-ret.get_vertex())*amount+ret.get_vertex());
531 Point ref_point_begin(
533 (*begin_iter->value_node)(begin_time).get(prev).get_vertex() +
534 (*end_iter->value_node)(begin_time).get(prev).get_vertex()
539 (*begin_iter->value_node)(end_time).get(prev).get_vertex() +
540 (*end_iter->value_node)(end_time).get(prev).get_vertex()
545 (*begin_iter->value_node)(t).get(prev).get_vertex() +
546 (*end_iter->value_node)(t).get(prev).get_vertex()
549 Point ref_point_linear((ref_point_end-ref_point_begin)*amount+ref_point_begin);
552 (curr.get_vertex()-ret.get_vertex())*amount+ret.get_vertex() +
553 (ref_point_now-ref_point_linear)
555 ret.set_tangent1((curr.get_tangent1()-ret.get_tangent1())*amount+ret.get_tangent1());
556 ret.set_split_tangent_flag(curr.get_split_tangent_flag());
557 if(ret.get_split_tangent_flag())
558 ret.set_tangent2((curr.get_tangent2()-ret.get_tangent2())*amount+ret.get_tangent2());
563 Point begin_cord_sys[2], begin_cord_origin;
564 Point end_cord_sys[2], end_cord_origin;
565 Point curr_cord_sys[2], curr_cord_origin;
568 const Point a((*end_iter->value_node)(begin_time).get(prev).get_vertex());
569 const Point b((*begin_iter->value_node)(begin_time).get(prev).get_vertex());
570 begin_cord_origin=(a+b)/2;
571 begin_cord_sys[0]=( b - a ).norm();
572 begin_cord_sys[1]=begin_cord_sys[0].perp();
575 const Point a((*end_iter->value_node)(end_time).get(prev).get_vertex());
576 const Point b((*begin_iter->value_node)(end_time).get(prev).get_vertex());
577 end_cord_origin=(a+b)/2;
578 end_cord_sys[0]=( b - a ).norm();
579 end_cord_sys[1]=end_cord_sys[0].perp();
582 const Point a((*end_iter->value_node)(t).get(prev).get_vertex());
583 const Point b((*begin_iter->value_node)(t).get(prev).get_vertex());
584 curr_cord_origin=(a+b)/2;
585 curr_cord_sys[0]=( b - a ).norm();
586 curr_cord_sys[1]=curr_cord_sys[0].perp();
590 end_cord_origin=(*end_iter->value_node)(end_time).get(prev).get_vertex();
592 (*begin_iter->value_node)(end_time).get(prev).get_vertex() -
595 end_cord_sys[1]=end_cord_sys[0].perp();
597 curr_cord_origin=(*end_iter->value_node)(t).get(prev).get_vertex();
599 (*begin_iter->value_node)(t).get(prev).get_vertex() -
602 curr_cord_sys[1]=curr_cord_sys[0].perp();
605 // Convert start point
609 Point tmp(ret.get_vertex()-begin_cord_origin);
610 a[0]=tmp*begin_cord_sys[0];
611 a[1]=tmp*begin_cord_sys[1];
612 #define COORD_SYS_RADIAL_TAN_INTERP 1
614 #ifdef COORD_SYS_RADIAL_TAN_INTERP
615 tmp=ret.get_tangent1()+ret.get_vertex()-begin_cord_origin;
616 at1[0]=tmp*begin_cord_sys[0];
617 at1[1]=tmp*begin_cord_sys[1];
619 if(curr.get_split_tangent_flag())
621 tmp=ret.get_tangent2()+ret.get_vertex()-begin_cord_origin;
622 at2[0]=tmp*begin_cord_sys[0];
623 at2[1]=tmp*begin_cord_sys[1];
628 // Convert finish point
632 Point tmp(curr.get_vertex()-end_cord_origin);
633 b[0]=tmp*end_cord_sys[0];
634 b[1]=tmp*end_cord_sys[1];
636 #ifdef COORD_SYS_RADIAL_TAN_INTERP
637 tmp=curr.get_tangent1()+curr.get_vertex()-end_cord_origin;
638 bt1[0]=tmp*end_cord_sys[0];
639 bt1[1]=tmp*end_cord_sys[1];
641 if(curr.get_split_tangent_flag())
643 tmp=curr.get_tangent2()+curr.get_vertex()-end_cord_origin;
644 bt2[0]=tmp*end_cord_sys[0];
645 bt2[1]=tmp*end_cord_sys[1];
650 // Convert current point
654 // Transpose (invert)
655 swap(curr_cord_sys[0][1],curr_cord_sys[1][0]);
657 Point tmp((b-a)*amount+a);
658 c[0]=tmp*curr_cord_sys[0];
659 c[1]=tmp*curr_cord_sys[1];
662 #define INTERP_FUNCTION radial_interpolation
663 //#define INTERP_FUNCTION linear_interpolation
665 #ifdef COORD_SYS_RADIAL_TAN_INTERP
666 tmp=INTERP_FUNCTION(at1,bt1,amount);
667 ct1[0]=tmp*curr_cord_sys[0];
668 ct1[1]=tmp*curr_cord_sys[1];
669 ct1+=curr_cord_origin;
672 if(curr.get_split_tangent_flag())
674 tmp=INTERP_FUNCTION(at2,bt2,amount);
675 ct2[0]=tmp*curr_cord_sys[0];
676 ct2[1]=tmp*curr_cord_sys[1];
677 ct2+=curr_cord_origin;
684 #ifndef COORD_SYS_RADIAL_TAN_INTERP
685 ret.set_tangent1(radial_interpolation(ret.get_tangent1(),curr.get_tangent1(),amount));
686 ret.set_split_tangent_flag(curr.get_split_tangent_flag());
687 if(ret.get_split_tangent_flag())
688 ret.set_tangent2(radial_interpolation(ret.get_tangent2(),curr.get_tangent2(),amount));
690 ret.set_tangent1(ct1);
691 ret.set_split_tangent_flag(curr.get_split_tangent_flag());
692 if(ret.get_split_tangent_flag())
693 ret.set_tangent2(ct2);
697 ret.set_origin(curr.get_origin());
698 ret.set_width((curr.get_width()-ret.get_width())*amount+ret.get_width());
701 // Handle the case where we are the first vertex
704 ret.set_tangent1(ret.get_tangent1()*prev_tangent_scalar);
708 ret_list.push_back(ret);
712 ret_list.back().set_split_tangent_flag(true);
713 ret_list.back().set_tangent2(prev.get_tangent2()*prev_tangent_scalar);
714 ret_list.push_back(ret);
715 ret_list.back().set_split_tangent_flag(true);
716 //ret_list.back().set_tangent2(ret.get_tangent1());
717 ret_list.back().set_tangent1(ret.get_tangent1()*prev_tangent_scalar);
725 ret_list.back().set_split_tangent_flag(true);
726 ret_list.back().set_tangent2(prev.get_tangent2()*next_scale);
730 if(get_loop() && !first_flag)
744 synfig::warning(string("ValueNode_BLine::operator()():")+_("No entries in list"));
747 synfig::warning(string("ValueNode_BLine::operator()():")+_("No entries in ret_list"));
749 return ValueBase(ret_list,get_loop());
753 ValueNode_BLine::link_local_name(int i)const
755 assert(i>=0 && (unsigned)i<list.size());
756 return etl::strprintf(_("Vertex %03d"),i+1);
760 ValueNode_BLine::clone(const GUID& deriv_guid)const
762 { ValueNode* x(find_value_node(get_guid()^deriv_guid).get()); if(x)return x; }
764 ValueNode_BLine* ret=new ValueNode_BLine();
765 ret->set_guid(get_guid()^deriv_guid);
767 std::vector<ListEntry>::const_iterator iter;
769 for(iter=list.begin();iter!=list.end();++iter)
771 if(iter->value_node->is_exported())
775 ListEntry list_entry(*iter);
776 //list_entry.value_node=find_value_node(iter->value_node->get_guid()^deriv_guid).get();
777 //if(!list_entry.value_node)
778 list_entry.value_node=iter->value_node->clone(deriv_guid);
779 ret->add(list_entry);
780 //ret->list.back().value_node=iter->value_node.clone();
783 ret->set_loop(get_loop());
789 ValueNode_BLine::get_name()const
795 ValueNode_BLine::get_local_name()const
801 ValueNode_BLine::create_new()const
808 ValueNode_BLine::check_type(ValueBase::Type type)
810 return type==ValueBase::TYPE_LIST;