lily/collision.cc

   1 /*
   2   collision.cc -- implement Collision
   3
   4   source file of the GNU LilyPond music typesetter
   5
   6   (c)  1997--1999 Han-Wen Nienhuys <hanwen@cs.uu.nl>
   7 */
   8 #include "debug.hh"
   9 #include "collision.hh"
  10 #include "note-column.hh"
  11 #include "note-head.hh"
  12 #include "paper-def.hh"
  13
  14 Collision::Collision()
  15 {
  16   set_axes (X_AXIS, Y_AXIS);
  17 }
  18
  19 void
  20 Collision::add_column (Note_column* ncol_l)
  21 {
  22   add_element (ncol_l);
  23   add_dependency (ncol_l);
  24 }
  25
  26 /*
  27   UGH.  junk Shift_tup .
  28  */
  29
  30 void
  31 Collision::do_pre_processing()
  32 {
  33   Array<Shift_tup> autos (automatic_shift ());
  34   Array<Shift_tup> hand (forced_shift ());
  35   Link_array<Score_element> done;
  36
  37   Real wid = paper_l ()->get_var ("collision_note_width");
  38   for (int i=0; i < hand.size (); i++)
  39     {
  40       hand[i].e1_->translate_axis (hand[i].e2_ *wid, X_AXIS);
  41       done.push (hand[i].e1_);
  42     }
  43
  44   for (int i=0; i < autos.size (); i++)
  45     {
  46       if (!done.find_l (autos[i].e1_))
  47         autos[i].e1_->translate_axis (autos[i].e2_ * wid, X_AXIS);
  48     }
  49 }
  50
  51 /** This complicated routine moves note columns around horizontally to
  52   ensure that notes don't clash.
  53
  54   This should be done better, probably.
  55
  56   */
  57 Array< Shift_tup >
  58 Collision::automatic_shift ()
  59 {
  60   Drul_array<Link_array<Note_column> > clash_groups;
  61   Drul_array<Array<int> > shifts;
  62   Array<Shift_tup>  tups;
  63
  64
  65   SCM s = get_elt_property ("elements");
  66   for (; gh_pair_p (s); s = gh_cdr (s))
  67     {
  68       SCM car = gh_car (s);
  69
  70       Score_element * se = unsmob_element (car);
  71       if (Note_column * col = dynamic_cast<Note_column*> (se))
  72         clash_groups[col->dir ()].push (col);
  73     }
  74
  75
  76   Direction d = UP;
  77   do
  78     {
  79       Array<int> & shift (shifts[d]);
  80       Link_array<Note_column> & clashes (clash_groups[d]);
  81
  82       clashes.sort (Note_column::shift_compare);
  83
  84       for (int i=0; i < clashes.size (); i++)
  85         {
  86           SCM sh
  87             = clashes[i]->remove_elt_property ("horizontal-shift");
  88
  89           if (gh_number_p (sh))
  90             shift.push (gh_scm2int (sh));
  91           else
  92             shift.push (0);
  93         }
  94
  95       for (int i=1; i < shift.size (); i++)
  96         {
  97           if (shift[i-1] == shift[i])
  98             {
  99               warning (_ ("Too many clashing notecolumns.  Ignoring them."));
 100               return tups;
 101             }
 102         }
 103     }
 104   while ((flip (&d))!= UP);
 105
 106   Drul_array< Array < Slice > > extents;
 107   Drul_array< Array < Real > > offsets;
 108   d = UP;
 109   do
 110     {
 111       for (int i=0; i < clash_groups[d].size (); i++)
 112         {
 113           Slice s(clash_groups[d][i]->head_positions_interval ());
 114           s[LEFT] --;
 115           s[RIGHT]++;
 116           extents[d].push (s);
 117           offsets[d].push (d * 0.5 * i);
 118         }
 119     }
 120   while ((flip (&d))!= UP);
 121
 122   do
 123     {
 124       for (int i=1; i < clash_groups[d].size (); i++)
 125         {
 126           Slice prev =extents[d][i-1];
 127           prev.intersect (extents[d][i]);
 128           if (prev.length ()> 0 ||
 129               (extents[-d].size () && d * (extents[d][i][-d] - extents[-d][0][d]) < 0))
 130             for (int j = i; j <  clash_groups[d].size (); j++)
 131               offsets[d][j] += d * 0.5;
 132         }
 133     }
 134   while ((flip (&d))!= UP);
 135
 136   /*
 137     if the up and down version are close, and can not be merged, move
 138     all of them again. */
 139   if (extents[UP].size () && extents[DOWN].size ())
 140     {
 141       Note_column *cu_l =clash_groups[UP][0];
 142       Note_column *cd_l =clash_groups[DOWN][0];
 143
 144
 145       /*
 146         TODO.
 147        */
 148       Note_head * nu_l= cu_l->first_head();
 149       Note_head * nd_l = cd_l->first_head();
 150
 151       int downpos =     cd_l->head_positions_interval ()[BIGGER];
 152       int uppos =       cu_l->head_positions_interval ()[SMALLER];
 153
 154       bool merge  =
 155         downpos == uppos
 156         && nu_l->balltype_i () == nd_l->balltype_i ()
 157         && nu_l->dots_i () == nd_l->dots_i ();
 158
 159       /*
 160         notes are close, but can not be merged.  Shift
 161        */
 162       if (abs(uppos - downpos) < 2 && !merge)
 163           do
 164           {
 165             for (int i=0; i < clash_groups[d].size (); i++)
 166               {
 167                 offsets[d][i] -= d * 0.5;
 168               }
 169           }
 170           while ((flip (&d))!= UP);
 171     }
 172
 173   do
 174     {
 175       for (int i=0; i < clash_groups[d].size (); i++)
 176         tups.push (Shift_tup (clash_groups[d][i], offsets[d][i]));
 177     }
 178   while (flip (&d) != UP);
 179   return tups;
 180 }
 181
 182
 183 Array <Shift_tup>
 184 Collision::forced_shift ()
 185 {
 186   Array<Shift_tup> tups;
 187
 188   SCM s = get_elt_property ("elements");
 189   for (; gh_pair_p (s); s = gh_cdr (s))
 190     {
 191       Score_element * se = unsmob_element ( gh_car (s));
 192
 193       SCM force =  se->remove_elt_property ("force-hshift");
 194       if (gh_number_p (force))
 195         {
 196           tups. push (Shift_tup (se, gh_scm2double (force)));
 197         }
 198     }
 199   return tups;
 200 }
 201
 202
 203