2 This file is part of LilyPond, the GNU music typesetter.
4 Copyright (C) 2011--2015 Mike Solomon <mike@mikesolomon.org>
6 LilyPond is free software: you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation, either version 3 of the License, or
9 (at your option) any later version.
11 LilyPond is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with LilyPond. If not, see <http://www.gnu.org/licenses/>.
25 #include "pointer-group-interface.hh"
26 #include "pure-from-neighbor-interface.hh"
27 #include "engraver.hh"
29 #include "translator.icc"
33 class Pure_from_neighbor_engraver : public Engraver
35 vector<Grob *> pure_relevants_;
36 vector<Grob *> need_pure_heights_from_neighbors_;
39 TRANSLATOR_DECLARATIONS (Pure_from_neighbor_engraver);
41 DECLARE_ACKNOWLEDGER (pure_from_neighbor);
42 DECLARE_ACKNOWLEDGER (item);
46 Pure_from_neighbor_engraver::Pure_from_neighbor_engraver ()
51 Pure_from_neighbor_engraver::acknowledge_item (Grob_info i)
53 if (!has_interface<Pure_from_neighbor_interface> (i.item ()))
54 pure_relevants_.push_back (i.item ());
58 in_same_column (Grob *g1, Grob *g2)
60 return (g1->spanned_rank_interval ()[LEFT]
61 == g2->spanned_rank_interval ()[LEFT])
62 && (g1->spanned_rank_interval ()[RIGHT]
63 == g2->spanned_rank_interval ()[RIGHT])
64 && (g1->spanned_rank_interval ()[LEFT]
65 == g1->spanned_rank_interval ()[RIGHT]);
69 Pure_from_neighbor_engraver::acknowledge_pure_from_neighbor (Grob_info i)
71 need_pure_heights_from_neighbors_.push_back (i.item ());
75 Pure_from_neighbor_engraver::finalize ()
77 if (!need_pure_heights_from_neighbors_.size ())
80 vector_sort (need_pure_heights_from_neighbors_, Grob::less);
81 vector_sort (pure_relevants_, Grob::less);
84 first, clump need_pure_heights_from_neighbors into
85 vectors of grobs that have the same column.
89 vector<vector<Grob *> > need_pure_heights_from_neighbors;
93 temp.push_back (need_pure_heights_from_neighbors_[l]);
95 (l < need_pure_heights_from_neighbors_.size () - 1
96 && ((need_pure_heights_from_neighbors_[l]
97 ->spanned_rank_interval ()[LEFT])
98 == (need_pure_heights_from_neighbors_[l + 1]
99 ->spanned_rank_interval ()[LEFT])));
101 temp.push_back (need_pure_heights_from_neighbors_[l + 1]);
102 need_pure_heights_from_neighbors.push_back (temp);
105 while (l < need_pure_heights_from_neighbors_.size ());
108 then, loop through the pure_relevants_ list, adding the items
109 to the elements of need_pure_heights_from_neighbors_ on either side.
112 int pos[2] = { -1, 0};
113 for (vsize i = 0; i < pure_relevants_.size (); i++)
115 while (pos[1] < (int) need_pure_heights_from_neighbors.size ()
116 && (pure_relevants_[i]->spanned_rank_interval ()[LEFT]
117 > (need_pure_heights_from_neighbors[pos[1]][0]
118 ->spanned_rank_interval ()[LEFT])))
123 for (int j = 0; j < 2; j++)
124 if (pos[j] >= 0 && pos[j]
125 < (int) need_pure_heights_from_neighbors.size ())
127 k < need_pure_heights_from_neighbors[pos[j]].size ();
129 if (!in_same_column (need_pure_heights_from_neighbors[pos[j]][k],
131 Pointer_group_interface::add_grob
132 (need_pure_heights_from_neighbors[pos[j]][k],
133 ly_symbol2scm ("neighbors"),
137 need_pure_heights_from_neighbors_.clear ();
138 pure_relevants_.clear ();
141 ADD_ACKNOWLEDGER (Pure_from_neighbor_engraver, item);
142 ADD_ACKNOWLEDGER (Pure_from_neighbor_engraver, pure_from_neighbor);
143 ADD_TRANSLATOR (Pure_from_neighbor_engraver,
145 "Coordinates items that get their pure heights from their neighbors.",