lily/hara-kiri-group-spanner.cc

   1 /*
   2   This file is part of LilyPond, the GNU music typesetter.
   3
   4   Copyright (C) 1998--2010 Jan Nieuwenhuizen <janneke@gnu.org>
   5   Han-Wen Nienhuys <hanwen@xs4all.nl>
   6
   7   LilyPond is free software: you can redistribute it and/or modify
   8   it under the terms of the GNU General Public License as published by
   9   the Free Software Foundation, either version 3 of the License, or
  10   (at your option) any later version.
  11
  12   LilyPond is distributed in the hope that it will be useful,
  13   but WITHOUT ANY WARRANTY; without even the implied warranty of
  14   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  15   GNU General Public License for more details.
  16
  17   You should have received a copy of the GNU General Public License
  18   along with LilyPond.  If not, see <http://www.gnu.org/licenses/>.
  19 */
  20
  21 #include "hara-kiri-group-spanner.hh"
  22
  23 #include "paper-column.hh"
  24 #include "pointer-group-interface.hh"
  25 #include "axis-group-interface.hh"
  26 #include "spanner.hh"
  27 #include "warn.hh"
  28
  29 MAKE_SCHEME_CALLBACK (Hara_kiri_group_spanner, y_extent, 1);
  30 SCM
  31 Hara_kiri_group_spanner::y_extent (SCM smob)
  32 {
  33   Grob *me = unsmob_grob (smob);
  34   consider_suicide (me);
  35   return Axis_group_interface::generic_group_extent (me, Y_AXIS);
  36 }
  37
  38 MAKE_SCHEME_CALLBACK (Hara_kiri_group_spanner, calc_skylines, 1);
  39 SCM
  40 Hara_kiri_group_spanner::calc_skylines (SCM smob)
  41 {
  42   Grob *me = unsmob_grob (smob);
  43   consider_suicide (me);
  44   return Axis_group_interface::calc_skylines (smob);
  45 }
  46
  47 MAKE_SCHEME_CALLBACK (Hara_kiri_group_spanner, pure_height, 3);
  48 SCM
  49 Hara_kiri_group_spanner::pure_height (SCM smob, SCM start_scm, SCM end_scm)
  50 {
  51   Grob *me = unsmob_grob (smob);
  52   int start = robust_scm2int (start_scm, 0);
  53   int end = robust_scm2int (end_scm, INT_MAX);
  54
  55   if (request_suicide (me, start, end))
  56     return ly_interval2scm (Interval ());
  57
  58   return ly_interval2scm (Axis_group_interface::pure_group_height (me, start, end));
  59 }
  60
  61 /* there is probably a way that doesn't involve re-implementing a binary
  62    search (I would love some proper closures right now) */
  63 bool find_in_range (SCM vector, int low, int hi, int min, int max)
  64 {
  65   if (low >= hi)
  66     return false;
  67
  68   int mid = low + (hi - low) / 2;
  69   int val = scm_to_int (scm_c_vector_ref (vector, mid));
  70   if (val >= min && val <= max)
  71     return true;
  72   else if (val < min)
  73     return find_in_range (vector, mid+1, hi, min, max);
  74   return find_in_range (vector, low, mid, min, max);
  75 }
  76
  77 bool
  78 Hara_kiri_group_spanner::request_suicide (Grob *me, int start, int end)
  79 {
  80   if (!to_boolean (me->get_property ("remove-empty")))
  81     return false;
  82
  83   bool remove_first = to_boolean (me->get_property ("remove-first"));
  84   if (!remove_first && start <= 0)
  85     return false;
  86
  87   SCM important = me->get_property ("important-column-ranks");
  88   if (scm_is_vector (important))
  89     {
  90       int len = scm_c_vector_length (important);
  91       if (find_in_range (important, 0, len, start, end))
  92         return false;
  93     }
  94   else /* build the important-columns-cache */
  95     {
  96       extract_grob_set (me, "items-worth-living", worth);
  97       vector<int> ranks;
  98
  99       for (vsize i = 0; i < worth.size (); i++)
 100         {
 101           Interval_t<int> iv = worth[i]->spanned_rank_interval ();
 102           for (int j = iv[LEFT]; j <= iv[RIGHT]; j++)
 103             ranks.push_back (j);
 104         }
 105       vector_sort (ranks, less<int> ());
 106       uniq (ranks);
 107
 108       SCM scm_vec = scm_c_make_vector (ranks.size (), SCM_EOL);
 109       for (vsize i = 0; i < ranks.size (); i++)
 110         scm_vector_set_x (scm_vec, scm_from_int (i), scm_from_int (ranks[i]));
 111       me->set_property ("important-column-ranks", scm_vec);
 112
 113       return request_suicide (me, start, end);
 114     }
 115
 116   return true;
 117 }
 118
 119 void
 120 Hara_kiri_group_spanner::consider_suicide (Grob *me)
 121 {
 122   Spanner *sp = dynamic_cast<Spanner*> (me);
 123   int left = sp->get_bound (LEFT)->get_column ()->get_rank ();
 124   int right = sp->get_bound (RIGHT)->get_column ()->get_rank ();
 125   if (!request_suicide (me, left, right))
 126     return;
 127
 128   vector<Grob*> childs;
 129   Axis_group_interface::get_children (me, &childs);
 130   for (vsize i = 0; i < childs.size (); i++)
 131     childs[i]->suicide ();
 132
 133   /*
 134     very appropriate name here :-)
 135   */
 136   me->suicide ();
 137 }
 138
 139 /*
 140   We can't rely on offsets and dimensions of elements in a hara-kiri
 141   group. Use a callback to make sure that hara-kiri has been done
 142   before asking for offsets.  */
 143 MAKE_SCHEME_CALLBACK (Hara_kiri_group_spanner, force_hara_kiri_callback, 1);
 144 SCM
 145 Hara_kiri_group_spanner::force_hara_kiri_callback (SCM smob)
 146 {
 147   Grob *me = unsmob_grob (smob);
 148   consider_suicide (me);
 149   return scm_from_double (0.0);
 150 }
 151
 152 MAKE_SCHEME_CALLBACK (Hara_kiri_group_spanner, force_hara_kiri_in_y_parent_callback, 1);
 153 SCM
 154 Hara_kiri_group_spanner::force_hara_kiri_in_y_parent_callback (SCM smob)
 155 {
 156   Grob *daughter = unsmob_grob (smob);
 157   force_hara_kiri_callback (daughter->get_parent (Y_AXIS)->self_scm ());
 158   return scm_from_double (0.0);
 159 }
 160
 161 void
 162 Hara_kiri_group_spanner::add_interesting_item (Grob *me, Grob *n)
 163 {
 164   Pointer_group_interface::add_unordered_grob (me, ly_symbol2scm ("items-worth-living"), n);
 165 }
 166
 167 ADD_INTERFACE (Hara_kiri_group_spanner,
 168                "A group spanner that keeps track of interesting items.  If it"
 169                " doesn't contain any after line breaking, it removes itself"
 170                " and all its children.",
 171
 172                /* properties */
 173                "items-worth-living "
 174                "important-column-ranks "
 175                "remove-empty "
 176                "remove-first "
 177                );
 178
 179