2 align-elem.cc -- implement Align_elem
4 source file of the GNU LilyPond music typesetter
6 (c) 1997--1999 Han-Wen Nienhuys <hanwen@cs.uu.nl>
9 #include "align-element.hh"
10 #include "interval.hh"
11 #include "direction.hh"
13 #include "hash-table-iter.hh"
15 struct Align_element_content {
16 Graphical_element * elem_l_;
19 static int compare (Align_element_content const &h1,
20 Align_element_content const &h2)
22 return h1.priority_i_ - h2.priority_i_;
24 Align_element_content (Graphical_element *elem_l, int p)
29 Align_element_content () {
38 Align_element::add_element (Score_element*el_l)
40 int p = elem_l_arr_.size ();
41 add_element_priority (el_l, p);
45 Align_element::add_element_priority (Score_element *el, int p)
47 assert (! contains_b (el));
48 Axis_group_element::add_element (el);
49 priority_i_hash_[el] = p;
54 Align_element::do_substitute_element_pointer (Score_element*o,
57 Axis_group_element :: do_substitute_element_pointer (o,n);
62 if (priority_i_hash_.elem_b (o))
64 priority_i_hash_[n] = priority_i_hash_[o];
66 Huh? It seems the old pointers are still used. Why?
68 // priority_i_hash_.remove (o);
73 Align_element::do_post_processing()
75 if (axis () == Y_AXIS)
76 do_side_processing ();
80 Align_element::do_pre_processing ()
82 if (axis () == X_AXIS)
83 do_side_processing ();
87 Align_element::do_side_processing ()
92 Link_array<Score_element> elems;
93 for (int i=0; i < elem_l_arr_.size(); i++)
95 Interval y = elem_l_arr_[i]->extent(axis ());
99 Score_element *e =dynamic_cast<Score_element*>(elem_l_arr_[i]);
106 for (int i=0 ; i < elems.size(); i++)
108 Real dy = - stacking_dir_ * dims[i][-stacking_dir_];
110 dy += stacking_dir_ * dims[i-1][stacking_dir_];
114 dy = (dy >? threshold_interval_[SMALLER] )
115 <? threshold_interval_[BIGGER];
118 if (!i && align_dir_ == LEFT)
120 else if (align_dir_ == CENTER && elems[i] == center_l_)
123 where_f += stacking_dir_ * dy;
124 elems[i]->translate_axis (where_f, axis ());
128 where_f += dims.top ()[stacking_dir_];
129 if (align_dir_ == RIGHT)
131 else if (align_dir_ == CENTER && !center_l_)
132 center_f = where_f / 2;
135 translate_axis ( - center_f, axis ());
137 dim_cache_[axis ()]->invalidate ();
140 Align_element::Align_element()
143 threshold_interval_ = Interval (0, Interval::infinity ());
144 stacking_dir_ = DOWN;
147 priority_i_hash_.hash_func_ = pointer_hash;
151 Align_element::axis () const
157 Align_element::set_axis (Axis a)
164 Align_element::contains_b (Score_element const *e) const
166 return elem_l_arr_.find_l (e);
170 Align_element::sort_elements ()
172 Array<Align_element_content> content;
173 for (int i =0; i < elem_l_arr_.size(); i++)
175 Score_element * e = dynamic_cast<Score_element*> (elem_l_arr_[i]);
176 assert (priority_i_hash_.elem_b (e));
177 int p = priority_i_hash_[e];
178 content.push (Align_element_content (e, p));
180 content.sort (Align_element_content::compare);
183 priority_i_hash_.clear();
185 for (int i =0; i < content.size(); i++)
187 elem_l_arr_.push (content[i].elem_l_);
192 Align_element::do_print () const
195 DOUT << "contains: ";
196 for (int i=0 ; i < elem_l_arr_.size(); i++)
197 DOUT << classname (elem_l_arr_[i]) << ", ";
202 Align_element::get_elt_by_priority (int p) const
204 for (Hash_table_iter<Score_element*, int> i(priority_i_hash_); i.ok (); i++)
213 Align_element::get_priority (Score_element* e) const
215 if ( priority_i_hash_.elem_b (e))
216 return priority_i_hash_[e];
218 return elem_l_arr_.find_i (e);