release: 0.0.76

[lilypond.git] / lily / rest-collision.cc

diff --git a/lily/rest-collision.cc b/lily/rest-collision.cc
index 2a6e1e755fd499e972b19faf620f534326e2ecf5..4529bbc4d6128cce92ec344afb2204800447c282 100644 (file)
--- a/lily/rest-collision.cc
+++ b/lily/rest-collision.cc
@@ -1,21 +1,37 @@
 /*
   rest-collision.cc -- implement Rest_collision
 
-  source file of the LilyPond music typesetter
+  source file of the GNU LilyPond music typesetter
 
   (c) 1997 Han-Wen Nienhuys <hanwen@stack.nl>
 */
 
+#include "debug.hh"
 #include "rest-collision.hh"
 #include "rest-column.hh"
+#include "note-column.hh"
+#include "stem.hh"
+#include "note-head.hh"
 #include "collision.hh"
+#include "paper-def.hh"
+
+IMPLEMENT_STATIC_NAME(Rest_collision);
+IMPLEMENT_IS_TYPE_B1(Rest_collision,Item);
+
+void
+Rest_collision::add(Note_column *nc_l)
+{
+    add_dependency(nc_l);
+    ncol_l_arr_.push(nc_l);
+}
 
 void
 Rest_collision::add(Rest_column *rc_l)
 {
-    rest_l_arr_.push(rc_l);
     add_dependency(rc_l);
+    rest_l_arr_.push(rc_l);
 }
+
 void
 Rest_collision::add(Collision * c_l)
 {
@@ -24,35 +40,122 @@ Rest_collision::add(Collision * c_l)
        ncol_l_arr_.push(c_l->clash_l_arr_[i]);
 }
 
-
 void
 Rest_collision::do_post_processing()
 {
-    #if 0
-        bool rest_b_a[4];
-       rest_b_a[j] = (col_l_a[j]) ? col_l_a[j]->rest_b_ : false;       
-    do {
-       int i1 = idx(d, false);
-       int i2 = idx(d,true);
-       if (!intersection(y_extent[i1] , 
-                         y_extent[i2]).empty_b()) {
-           if (rest_b_a[i1]) {
-               y_off[i1] = -y_extent[i1][-d] + y_extent[1][d] + d*4; // ugh
-               y_extent[i1] += y_off[i1];
-           }
-       }
-    } while ((d *= -1) != 1);
+    /*
+      handle rest under beam (do_post: beams are calculated now)
+
+      [todo]
+      i-d like to have access to the beam itself, 
+      iso only the (half-initialised?) stem
+
+      what about combination of collisions and rest under beam
+     */
+
+    // no rests to collide
+    if (!rest_l_arr_.size())
+       return;
+    // can this happen?
+    Stem* stem_l = rest_l_arr_[0]->stem_l_;
+    if (!stem_l)
+       return;
+    // no beam
+    if (!(stem_l->beams_left_i_ || stem_l->beams_right_i_))
+       return;
+
+    int dir_i = rest_l_arr_[0]->dir_i_;
+    int midpos = 4;
+#if 1
+    // ugh
+    int stem_length_i = 7 - 2;
+    // ugh, Stem::stem_start vs Stem::stem_end
+    int pos = (stem_l->stem_end_f() - midpos) - dir_i * stem_length_i;
+#else // nogo: stem_start not set for rests?
+    int pos = (stem_l->stem_start_f() - midpos) + dir_i * 2;
+#endif
+    rest_l_arr_[0]->translate_heads(pos);      
+}
+
+void
+Rest_collision::do_pre_processing()
+{
+    /* 
+      handle rest-rest and rest-note collisions
+
+      [todo]
+      decide not to print rest if too crowded?
+     */
 
-    do {
-       int i1 = idx(d, false);
-       int i2 = idx(-d,false);
+    // no rests to collide
+    if (!rest_l_arr_.size())
+       return;
+
+    // no partners to collide with
+    if (rest_l_arr_.size() + ncol_l_arr_.size() < 2 )
+       return;
+
+    // meisjes met meisjes
+    if (!ncol_l_arr_.size()) {
+       int dy = rest_l_arr_.size() > 2 ? 6 : 4;
+       
+       rest_l_arr_[0]->translate_heads(rest_l_arr_[0]->dir_i_ *dy);    
+       // top is last element...
+       rest_l_arr_.top()->translate_heads(rest_l_arr_.top()->dir_i_* dy);      
+    }
+    // meisjes met jongetjes
+    else {
+#if 0 // breendet: rests go always under
+       // geen gemug, trug op je rug
+       int dir_i = -1;
+       rest_l_arr_[0]->translate_heads(dir_i * 3 );    
+#else
+       // int dir_i = - ncol_l_arr_[0]->dir_i_;
+       int dir_i = rest_l_arr_[0]->dir_i_;
+       // hope it's 4: if it works->doco
+       int midpos = 4;
+       
+        // minimum move
+       int minpos = 4;
+       
+       // quart rest height
+       // UGH Should get dims from table!
+       int size_i = 6;
        
-       if (d*(y_extent[i1][-d] - y_extent[i2][d] )< 0&& rest_b_a[i1]) {
-           y_off[i1] = -y_extent[i1][-d] + y_extent[i2][d] +d* 4; // ugh
-           y_extent[i1] += y_off[i1];
+       int sep_i = 3 + size_i / 2;
+       for (int i = 0; i < ncol_l_arr_.size(); i++) {
+           // how to know whether to sort?
+           ncol_l_arr_[i]->sort();
+           for ( int j = 0; j < ncol_l_arr_[i]->head_l_arr_.size(); j++ )
+               minpos = minpos >? dir_i * 
+                   (ncol_l_arr_[i]->head_l_arr_[j]->position_i_ -midpos ) + sep_i;
        }
-    } while ((d *= -1) != 1);
-    
+       rest_l_arr_[0]->translate_heads(dir_i * minpos );       
 #endif
+    }
+}
+
+void
+Rest_collision::do_print() const
+{
+#ifndef NPRINT
+    mtor << "rests: " << rest_l_arr_.size() << ", ";
+    mtor << "cols: " << ncol_l_arr_.size();
+#endif
+}
+
+void
+Rest_collision::do_substitute_dependency(Score_elem*o,Score_elem*n)
+{
+    Item*o_l = o->item();
+    Item*n_l = n?n->item():0;
+    
+    rest_l_arr_.substitute((Rest_column*)o_l,(Rest_column*)n_l);
+    ncol_l_arr_.substitute((Note_column*)o_l,(Note_column*)n_l);
+}
+
+Rest_collision::Rest_collision()
+{
+    transparent_b_ = true;
+    empty_b_ = true;
 }
-IMPLEMENT_STATIC_NAME(Rest_collision);