2 beaming-info.cc -- implement Beaming_info, Beaming_info_list
4 source file of the GNU LilyPond music typesetter
6 (c) 1999--2005 Han-Wen Nienhuys <hanwen@cs.uu.nl>
11 Beaming_info::Beaming_info ()
14 beams_i_drul_[LEFT] = 0;
15 beams_i_drul_[RIGHT] = 0;
18 Beaming_info::Beaming_info (Moment m, int i)
21 beams_i_drul_[LEFT] = i;
22 beams_i_drul_[RIGHT] = i;
25 const int at_beat = 1 << 15;
28 Beaming_info_list::best_splitpoint_index (Moment &beat_length, bool subdivide) const
34 for (int i = 1; i < infos_.size (); i++)
36 beat_pos = infos_[i].start_mom_ / beat_length;
37 int den = beat_pos.den ();
38 if (infos_[i].beams_i_drul_[LEFT] == infos_[i - 1].beams_i_drul_[RIGHT] && !subdivide)
47 return minidx | (minden == 1 && subdivide ? at_beat : 0);
51 Beaming_info_list::beam_extend_count (Direction d) const
53 if (infos_.size () == 1)
54 return infos_[0].beams_i_drul_[d];
56 Beaming_info thisbeam = infos_.boundary (d, 0);
57 Beaming_info next = infos_.boundary (d, 1);
59 return min (thisbeam.beams_i_drul_[-d], next.beams_i_drul_[d]);
63 Beaming_info_list::beamify (Moment &beat_length, bool subdivide)
65 if (infos_.size () <= 1)
68 Drul_array<Beaming_info_list> splits;
69 int m = best_splitpoint_index (beat_length, subdivide);
70 bool split = subdivide && (m & at_beat); m = m & ~at_beat;
71 splits[LEFT].infos_ = infos_.slice (0, m);
72 splits[RIGHT].infos_ = infos_.slice (m, infos_.size ());
77 splits[d].beamify (beat_length, subdivide);
78 while (flip (&d) != LEFT)
81 int middle_beams = (split ? 1
82 : min (splits[RIGHT].beam_extend_count (LEFT),
83 splits[LEFT].beam_extend_count (RIGHT)));
87 if (splits[d].infos_.size () != 1)
88 splits[d].infos_.boundary (-d, 0).beams_i_drul_[-d] = middle_beams;
90 while (flip (&d) != LEFT);
92 infos_ = splits[LEFT].infos_;
93 infos_.concat (splits[RIGHT].infos_);
97 Beaming_info_list::add_stem (Moment m, int b)
99 infos_.push (Beaming_info (m, b));