Housekeeping; 2005->2006, remove "notes for 2.6"

[lilypond.git] / lily / break-algorithm.cc

diff --git a/lily/break-algorithm.cc b/lily/break-algorithm.cc
index 9dbb3d33bafe68d01afc16efaaaa1352daba2ead..923627f44c5a00384fac90adf1581aeb484611e8 100644 (file)
--- a/lily/break-algorithm.cc
+++ b/lily/break-algorithm.cc
@@ -3,7 +3,7 @@
 
   source file of the GNU LilyPond music typesetter
 
-  (c) 1996--2005 Han-Wen Nienhuys <hanwen@xs4all.nl>
+  (c) 1996--2006 Han-Wen Nienhuys <hanwen@xs4all.nl>
 */
 
 #include "break-algorithm.hh"
@@ -15,42 +15,22 @@
 #include "cpu-timer.hh"
 #include "simple-spacer.hh"
 
-Array<int>
-Break_algorithm::find_break_indices () const
-{
-  Link_array<Grob> all = pscore_->root_system ()->columns ();
-  Array<int> retval;
-
-  for (int i = 0; i < all.size (); i++)
-    if (Item::is_breakable (all[i]))
-      retval.push (i);
-
-  if (linewidth_ <= 0)
-    while (retval.size () > 2)
-      retval.del (1);
-
-  return retval;
-}
-
-Link_array<Grob>
+vector<Grob*>
 Break_algorithm::find_breaks () const
 {
-  Link_array<Grob> all = pscore_->root_system ()->columns ();
-  Link_array<Grob> retval;
+  vector<Grob*> all = pscore_->root_system ()->columns ();
+  vector<Grob*> retval;
 
-  for (int i = 0; i < all.size (); i++)
+  for (vsize i = 0; i < all.size (); i++)
     if (Item::is_breakable (all[i]))
-      retval.push (all[i]);
+      retval.push_back (all[i]);
 
-  if (linewidth_ <= 0)
-    while (retval.size () > 2)
-      retval.del (1);
 
   return retval;
 }
 
 Simple_spacer_wrapper *
-Break_algorithm::generate_spacing_problem (Link_array<Grob> const &curline,
+Break_algorithm::generate_spacing_problem (vector<Grob*> const &curline,
                                           Interval line) const
 {
   Simple_spacer_wrapper *spw = new Simple_spacer_wrapper;
@@ -85,14 +65,13 @@ void
 Break_algorithm::set_pscore (Paper_score *s)
 {
   pscore_ = s;
-  linewidth_ = s->layout ()->get_dimension (ly_symbol2scm ("linewidth"));
+  linewidth_ = s->layout ()->get_dimension (ly_symbol2scm ("line-width"));
 }
 
-Array<Column_x_positions>
-Break_algorithm::solve () const
+vector<Column_x_positions>
+Break_algorithm::solve () 
 {
-  Array<Column_x_positions> h= do_solve ();
-
+  vector<Column_x_positions> h;
   return h;
 }