2 beaming-info.cc -- implement Beam_rhythmic_element, Beaming_pattern
4 source file of the GNU LilyPond music typesetter
6 (c) 1999--2006 Han-Wen Nienhuys <hanwen@xs4all.nl>
9 #include "beaming-pattern.hh"
12 Beam_rhythmic_element::Beam_rhythmic_element ()
15 beam_count_drul_[LEFT] = 0;
16 beam_count_drul_[RIGHT] = 0;
20 Beam_rhythmic_element::Beam_rhythmic_element (Moment m, int i)
23 beam_count_drul_[LEFT] = i;
24 beam_count_drul_[RIGHT] = i;
28 Beaming_pattern::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_pattern::beam_extend_count (Direction d) const
65 if (infos_.size () == 1)
66 return infos_[0].beam_count_drul_[d];
68 Beam_rhythmic_element thisbeam = boundary (infos_, d, 0);
69 Beam_rhythmic_element next = boundary (infos_, d, 1);
71 return min (thisbeam.beam_count_drul_[-d], next.beam_count_drul_[d]);
75 Beaming_pattern::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));
82 Moment measure_length = robust_scm2moment (context->get_property ("beatLength"), Moment (1, 4));
84 if (infos_[0].start_moment_ < Moment (0))
85 for (vsize i = 0; i < infos_.size(); i++)
86 infos_[i].start_moment_ += measure_length;
88 SCM grouping = context->get_property ("beatGrouping");
89 Moment measure_pos (0);
91 vector<Moment> group_starts;
92 vector<Moment> beat_starts;
94 while (measure_pos <= infos_.back().start_moment_)
97 if (scm_is_pair (grouping))
99 count = scm_to_int (scm_car (grouping));
100 grouping = scm_cdr (grouping);
103 group_starts.push_back (measure_pos);
104 for (int i = 0; i < count; i++)
106 beat_starts.push_back (measure_pos + beat_length * i);
108 measure_pos += beat_length * count;
113 for (vsize i = 0; i < infos_.size(); i++)
115 while (j < group_starts.size()-1
116 && group_starts[j+1] <= infos_[i].start_moment_)
119 infos_[i].group_start_ = group_starts[j];
121 while (k < beat_starts.size()-1
122 && beat_starts[k+1] <= infos_[i].start_moment_)
125 infos_[i].beat_start_ = beat_starts[k];
128 beamify (subdivide_beams);
133 Beaming_pattern::beamify (bool subdivide_beams)
135 if (infos_.size () <= 1)
138 Drul_array<Beaming_pattern> splits;
140 bool at_boundary = false;
141 int m = best_splitpoint_index (&at_boundary);
143 splits[LEFT].infos_ = vector<Beam_rhythmic_element> (infos_.begin (),
144 infos_.begin () + m);
145 splits[RIGHT].infos_ = vector<Beam_rhythmic_element> (infos_.begin () + m,
152 splits[d].beamify (subdivide_beams);
154 while (flip (&d) != LEFT);
156 int middle_beams = ((at_boundary && subdivide_beams)
158 : min (splits[RIGHT].beam_extend_count (LEFT),
159 splits[LEFT].beam_extend_count (RIGHT)));
163 if (splits[d].infos_.size () != 1)
164 boundary (splits[d].infos_, -d, 0).beam_count_drul_[-d] = middle_beams;
166 while (flip (&d) != LEFT);
168 infos_ = splits[LEFT].infos_;
169 infos_.insert (infos_.end (),
170 splits[RIGHT].infos_.begin (),
171 splits[RIGHT].infos_.end ());
176 Beaming_pattern::add_stem (Moment m, int b)
178 infos_.push_back (Beam_rhythmic_element (m, b));
181 Beaming_pattern::Beaming_pattern ()
186 Beaming_pattern::beamlet_count (int i, Direction d) const
188 return infos_.at (i).beam_count_drul_[d];