2 beaming-info.cc -- implement Beaming_info, Beaming_info_list
4 source file of the GNU LilyPond music typesetter
6 (c) 1999--2006 Han-Wen Nienhuys <hanwen@xs4all.nl>
12 Beaming_info::Beaming_info ()
15 beam_count_drul_[LEFT] = 0;
16 beam_count_drul_[RIGHT] = 0;
20 Beaming_info::Beaming_info (Moment m, int i)
23 beam_count_drul_[LEFT] = i;
24 beam_count_drul_[RIGHT] = i;
28 Beaming_info_list::best_splitpoint_index (bool *at_boundary) const
31 for (vsize i = 1; i < infos_.size (); i++)
33 if (infos_[i].group_start_ == infos_[i].start_moment_)
37 for (vsize i = 1; i < infos_.size (); i++)
39 if (infos_[i].beat_start_ == infos_[i].start_moment_)
45 int min_denominator = INT_MAX;
49 for (vsize i = 1; i < infos_.size (); i++)
51 Moment dt = infos_[i].start_moment_ - infos_[i].beat_start_;
52 if (dt.den () < min_denominator)
54 min_denominator = dt.den ();
63 Beaming_info_list::beam_extend_count (Direction d) const
65 if (infos_.size () == 1)
66 return infos_[0].beam_count_drul_[d];
68 Beaming_info thisbeam = boundary (infos_, d, 0);
69 Beaming_info next = boundary (infos_, d, 1);
71 return min (thisbeam.beam_count_drul_[-d], next.beam_count_drul_[d]);
75 Beaming_info_list::beamify (Context *context)
77 if (infos_.size () <= 1)
80 bool subdivide_beams = to_boolean (context->get_property ("subdivideBeams"));
81 Moment beat_length = robust_scm2moment (context->get_property ("beatLength"), Moment (1, 4));
83 SCM grouping = context->get_property ("beatGrouping");
84 Moment measure_pos (0);
86 vector<Moment> group_starts;
87 vector<Moment> beat_starts;
89 while (measure_pos <= infos_.back().start_moment_)
92 if (scm_is_pair (grouping))
94 count = scm_to_int (scm_car (grouping));
95 grouping = scm_cdr (grouping);
98 group_starts.push_back (measure_pos);
99 for (int i = 0; i < count; i++)
101 beat_starts.push_back (measure_pos + beat_length * i);
103 measure_pos += beat_length * count;
108 for (vsize i = 0; i < infos_.size(); i++)
110 while (j < group_starts.size()-1
111 && group_starts[j+1] <= infos_[i].start_moment_)
114 infos_[i].group_start_ = group_starts[j];
116 while (k < beat_starts.size()-1
117 && beat_starts[k+1] <= infos_[i].start_moment_)
120 infos_[i].beat_start_ = beat_starts[k];
123 beamify (subdivide_beams);
128 Beaming_info_list::beamify (bool subdivide_beams)
130 if (infos_.size () <= 1)
133 Drul_array<Beaming_info_list> splits;
135 bool at_boundary = false;
136 int m = best_splitpoint_index (&at_boundary);
138 splits[LEFT].infos_ = vector<Beaming_info> (infos_.begin (),
139 infos_.begin () + m);
140 splits[RIGHT].infos_ = vector<Beaming_info> (infos_.begin () + m,
147 splits[d].beamify (subdivide_beams);
149 while (flip (&d) != LEFT);
151 int middle_beams = ((at_boundary && subdivide_beams)
153 : min (splits[RIGHT].beam_extend_count (LEFT),
154 splits[LEFT].beam_extend_count (RIGHT)));
158 if (splits[d].infos_.size () != 1)
159 boundary (splits[d].infos_, -d, 0).beam_count_drul_[-d] = middle_beams;
161 while (flip (&d) != LEFT);
163 infos_ = splits[LEFT].infos_;
164 infos_.insert (infos_.end (),
165 splits[RIGHT].infos_.begin (),
166 splits[RIGHT].infos_.end ());
171 Beaming_info_list::add_stem (Moment m, int b)
173 infos_.push_back (Beaming_info (m, b));
176 Beaming_info_list::Beaming_info_list ()
181 Beaming_info_list::beamlet_count (int i, Direction d) const
183 return infos_.at (i).beam_count_drul_[d];