lily/pure-from-neighbor-engraver.cc

   1 /*
   2   This file is part of LilyPond, the GNU music typesetter.
   3
   4   Copyright (C) 2011--2015 Mike Solomon <mike@mikesolomon.org>
   5
   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.
  10
  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.
  15
  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/>.
  18 */
  19
  20 #include <map>
  21 #include <algorithm>
  22
  23 #include "grob.hh"
  24 #include "item.hh"
  25 #include "pointer-group-interface.hh"
  26 #include "pure-from-neighbor-interface.hh"
  27 #include "engraver.hh"
  28
  29 #include "translator.icc"
  30
  31 class Pure_from_neighbor_engraver : public Engraver
  32 {
  33   vector<Grob *> pure_relevants_;
  34   vector<Grob *> need_pure_heights_from_neighbors_;
  35
  36 public:
  37   TRANSLATOR_DECLARATIONS (Pure_from_neighbor_engraver);
  38 protected:
  39   void acknowledge_pure_from_neighbor (Grob_info);
  40   void acknowledge_item (Grob_info);
  41   void finalize ();
  42 };
  43
  44 Pure_from_neighbor_engraver::Pure_from_neighbor_engraver (Context *c)
  45   : Engraver (c)
  46 {
  47 }
  48
  49 void
  50 Pure_from_neighbor_engraver::acknowledge_item (Grob_info i)
  51 {
  52   if (!has_interface<Pure_from_neighbor_interface> (i.item ()))
  53     pure_relevants_.push_back (i.item ());
  54 }
  55
  56 bool
  57 in_same_column (Grob *g1, Grob *g2)
  58 {
  59   return (g1->spanned_rank_interval ()[LEFT]
  60           == g2->spanned_rank_interval ()[LEFT])
  61          && (g1->spanned_rank_interval ()[RIGHT]
  62              == g2->spanned_rank_interval ()[RIGHT])
  63          && (g1->spanned_rank_interval ()[LEFT]
  64              == g1->spanned_rank_interval ()[RIGHT]);
  65 }
  66
  67 void
  68 Pure_from_neighbor_engraver::acknowledge_pure_from_neighbor (Grob_info i)
  69 {
  70   need_pure_heights_from_neighbors_.push_back (i.item ());
  71 }
  72
  73 void
  74 Pure_from_neighbor_engraver::finalize ()
  75 {
  76   if (!need_pure_heights_from_neighbors_.size ())
  77     return;
  78
  79   vector_sort (need_pure_heights_from_neighbors_, Grob::less);
  80   vector_sort (pure_relevants_, Grob::less);
  81
  82   /*
  83     first, clump need_pure_heights_from_neighbors into
  84     vectors of grobs that have the same column.
  85   */
  86
  87   vsize l = 0;
  88   vector<vector<Grob *> > need_pure_heights_from_neighbors;
  89   do
  90     {
  91       vector<Grob *> temp;
  92       temp.push_back (need_pure_heights_from_neighbors_[l]);
  93       for (;
  94            (l < need_pure_heights_from_neighbors_.size () - 1
  95             && ((need_pure_heights_from_neighbors_[l]
  96                  ->spanned_rank_interval ()[LEFT])
  97                 == (need_pure_heights_from_neighbors_[l + 1]
  98                     ->spanned_rank_interval ()[LEFT])));
  99            l++)
 100         temp.push_back (need_pure_heights_from_neighbors_[l + 1]);
 101       need_pure_heights_from_neighbors.push_back (temp);
 102       l++;
 103     }
 104   while (l < need_pure_heights_from_neighbors_.size ());
 105
 106   /*
 107     then, loop through the pure_relevants_ list, adding the items
 108     to the elements of need_pure_heights_from_neighbors_ on either side.
 109   */
 110
 111   int pos[2] = { -1, 0};
 112   for (vsize i = 0; i < pure_relevants_.size (); i++)
 113     {
 114       while (pos[1] < (int) need_pure_heights_from_neighbors.size ()
 115              && (pure_relevants_[i]->spanned_rank_interval ()[LEFT]
 116                  > (need_pure_heights_from_neighbors[pos[1]][0]
 117                     ->spanned_rank_interval ()[LEFT])))
 118         {
 119           pos[0] = pos[1];
 120           pos[1]++;
 121         }
 122       for (int j = 0; j < 2; j++)
 123         if (pos[j] >= 0 && pos[j]
 124             < (int) need_pure_heights_from_neighbors.size ())
 125           for (vsize k = 0;
 126                k < need_pure_heights_from_neighbors[pos[j]].size ();
 127                k++)
 128             if (!in_same_column (need_pure_heights_from_neighbors[pos[j]][k],
 129                                  pure_relevants_[i]))
 130               Pointer_group_interface::add_grob
 131               (need_pure_heights_from_neighbors[pos[j]][k],
 132                ly_symbol2scm ("neighbors"),
 133                pure_relevants_[i]);
 134     }
 135
 136   need_pure_heights_from_neighbors_.clear ();
 137   pure_relevants_.clear ();
 138 }
 139
 140 void
 141 Pure_from_neighbor_engraver::boot ()
 142 {
 143   ADD_ACKNOWLEDGER (Pure_from_neighbor_engraver, item);
 144   ADD_ACKNOWLEDGER (Pure_from_neighbor_engraver, pure_from_neighbor);
 145 }
 146
 147 ADD_TRANSLATOR (Pure_from_neighbor_engraver,
 148                 /* doc */
 149                 "Coordinates items that get their pure heights from their neighbors.",
 150
 151                 /* create */
 152                 "",
 153
 154                 /* read */
 155                 "",
 156
 157                 /* write */
 158                 ""
 159                );