lily/p-score.cc

   1 /*
   2   p-score.cc -- implement Paper_score
   3
   4   source file of the GNU LilyPond music typesetter
   5
   6   (c) 1996,  1997--1999 Han-Wen Nienhuys <hanwen@cs.uu.nl>
   7 */
   8
   9 #include "main.hh"
  10 #include "debug.hh"
  11 #include "lookup.hh"
  12 #include "spanner.hh"
  13 #include "paper-def.hh"
  14 #include "line-of-score.hh"
  15 #include "p-col.hh"
  16 #include "p-score.hh"
  17 #include "p-col.hh"
  18 #include "scope.hh"
  19 #include "word-wrap.hh"
  20 #include "gourlay-breaking.hh"
  21 #include "paper-stream.hh"
  22 #include "paper-outputter.hh"
  23 #include "file-results.hh"
  24 #include "misc.hh"
  25
  26 Paper_score::Paper_score ()
  27 {
  28   paper_l_ =0;
  29   outputter_l_ =0;
  30   Line_of_score * line_p = new Line_of_score;
  31   typeset_unbroken_spanner (line_p);
  32
  33   line_l_ = line_p;
  34 }
  35
  36 Paper_score::Paper_score (Paper_score const &s)
  37   : Music_output (s)
  38 {
  39   assert (false);
  40 }
  41
  42 Paper_score::~Paper_score ()
  43 {
  44   for (int i=span_p_arr_.size (); --i >=0 ; )
  45     delete span_p_arr_[i];
  46   for (int i=elem_p_arr_.size (); --i >=0 ; )
  47     delete elem_p_arr_[i];
  48 }
  49
  50 void
  51 Paper_score::typeset_element (Score_element * elem_p)
  52 {
  53   elem_p_arr_.push (elem_p);
  54   elem_p->pscore_l_ = this;
  55
  56
  57   SCM p =  elem_p->remove_elt_property (break_helper_only_scm_sym);
  58   if (p != SCM_BOOL_F)
  59     break_helpers_arr_.push (elem_p);
  60 }
  61
  62
  63 void
  64 Paper_score::typeset_unbroken_spanner (Spanner*span_p)
  65 {
  66   span_p_arr_.push (span_p);
  67   span_p->pscore_l_=this;
  68
  69   SCM p =  span_p->remove_elt_property (break_helper_only_scm_sym);
  70   if (p != SCM_BOOL_F)
  71     break_helpers_arr_.push (span_p);
  72 }
  73
  74 void
  75 Paper_score::add_column (Paper_column *p)
  76 {
  77   p->set_rank (col_l_arr_.size ());
  78   col_l_arr_.push (p);
  79   typeset_element(p);
  80 }
  81
  82
  83
  84 void
  85 Paper_score::print () const
  86 {
  87 #ifndef NPRINT
  88   if (!check_debug)
  89     return ;
  90   DOUT << "Paper_score { ";
  91   DOUT << "\n elements: ";
  92   for (int i=0; i < span_p_arr_.size (); i++)
  93     span_p_arr_[i]->print ();
  94   for (int i=0; i < elem_p_arr_.size (); i++)
  95     elem_p_arr_[i]->print();
  96
  97   DOUT << "}\n";
  98 #endif
  99 }
 100
 101 int
 102 Paper_score::find_col_idx (Paper_column const *c) const
 103 {
 104   Paper_column const *what = c;
 105
 106   return col_l_arr_.find_i ((Paper_column*)what);
 107 }
 108
 109 Array<Column_x_positions>
 110 Paper_score::calc_breaking ()
 111 {
 112   Break_algorithm *algorithm_p=0;
 113   Array<Column_x_positions> sol;
 114   bool try_wrap = !paper_l_->get_var ("castingalgorithm");
 115
 116   if (!try_wrap)
 117     {
 118       algorithm_p = new Gourlay_breaking ;
 119       algorithm_p->set_pscore (this);
 120       sol = algorithm_p->solve ();
 121       delete algorithm_p;
 122       if (! sol.size ())
 123         {
 124           warning (_ ("Can't solve this casting problem exactly; revert to Word_wrap"));
 125           try_wrap = true;
 126         }
 127     }
 128   if  (try_wrap)
 129     {
 130       algorithm_p = new Word_wrap;
 131       algorithm_p->set_pscore (this);
 132       sol = algorithm_p->solve ();
 133       delete algorithm_p;
 134     }
 135   return sol;
 136 }
 137
 138
 139
 140 /*
 141   not clean.  Should update elem_p_arr_ and span_p_arr_.  That would
 142   also repair the stats.
 143
 144   This may be done efficiently by first sorting the arrays.  */
 145 void
 146 delete_array_contents (Link_array<Score_element> &to_remove, Dictionary<int> &type_stats)
 147 {
 148   for (int i=0; i < to_remove.size (); i++)
 149     {
 150       Score_element * e = to_remove[i];
 151       String nm = e->name();
 152       if (type_stats.elem_b (nm))
 153         type_stats[nm] ++;
 154       else
 155         type_stats[nm] = 1;
 156
 157       if (dynamic_cast<Item*> (e))
 158         type_stats["Item"] ++;
 159       else if (dynamic_cast<Spanner*>(e))
 160         type_stats["Spanner"] ++;
 161       type_stats["Total"] ++;
 162       /*
 163        */
 164
 165  //      delete e; //TODO!
 166     }
 167
 168   to_remove.clear ();
 169   to_remove.tighten_maxsize ();
 170 }
 171
 172 void
 173 Paper_score::schedule_for_delete (Score_element*e)
 174 {
 175   to_delete_arr_.push (e);
 176 }
 177
 178 void
 179 Paper_score::process ()
 180 {
 181   Dictionary<int> type_stats;
 182   type_stats["Item"] =0;
 183   type_stats["Spanner"] =0;
 184   type_stats["Total"]=0;
 185
 186   print ();
 187   *mlog << _ ("Preprocessing elements...") << " " << flush;
 188   line_l_->breakable_col_processing ();
 189   line_l_->pre_processing ();
 190
 191   *mlog << '\n' << _ ("Calculating column positions...") << " " << flush;
 192   line_l_->space_processing ();
 193
 194   Array<Column_x_positions> breaking = calc_breaking ();
 195
 196
 197   delete_array_contents (break_helpers_arr_, type_stats);
 198
 199   Paper_stream* paper_stream_p = paper_l_->paper_stream_p ();
 200   outputter_l_ = paper_l_->paper_outputter_p (paper_stream_p, header_l_, origin_str_);
 201
 202   Link_array<Line_of_score> lines;
 203   for (int i=0; i < breaking.size (); i++)
 204     {
 205       Line_of_score *line_l = line_l_->set_breaking (breaking, i);
 206       lines.push (line_l);
 207       if (line_l != line_l_)
 208         typeset_element (line_l);
 209     }
 210
 211   if (experimental_features_global_b)
 212     *mlog << elem_p_arr_.size ()  + span_p_arr_.size () << " elements. ";
 213
 214   *mlog << "\nLine ... ";
 215   line_l_->break_processing ();
 216   for (int i=0; i < lines.size (); i++)
 217     {
 218       *mlog << '[' << flush;
 219
 220       Line_of_score *line_l = lines[i];
 221
 222       line_l->post_processing ();
 223         *mlog << i << flush;
 224       line_l->output_all ();
 225
 226       if (experimental_features_global_b)
 227         *mlog << '(' << elem_p_arr_.size () + span_p_arr_.size () << ')';
 228
 229       *mlog << ']' << flush;
 230
 231       delete_array_contents (to_delete_arr_, type_stats);
 232      }
 233
 234   // huh?
 235   delete outputter_l_;
 236   delete paper_stream_p;
 237   outputter_l_ = 0;
 238
 239
 240   /*
 241     todo: sort output
 242    */
 243   if (experimental_features_global_b)
 244     {
 245       for (Dictionary_iter<int> i(type_stats); i.ok(); i++)
 246         {
 247           *mlog << i.key () << ": " << i.val () << " objects\n";
 248         }
 249     }
 250   *mlog << '\n' << flush;
 251
 252 }
 253
 254 Link_array<Item>
 255 Paper_score::broken_col_range (Item const*l, Item const*r) const
 256 {
 257   Link_array<Item> ret;
 258
 259   l = l->column_l ();
 260   r = r->column_l ();
 261
 262   int  start = l
 263     ? find_col_idx (dynamic_cast<Paper_column*> ((Item*)l))+1
 264     : 0;
 265
 266   int stop = r
 267     ? find_col_idx (dynamic_cast<Paper_column*>((Item*)r))
 268     : col_l_arr_.size ();
 269
 270   while (start < stop)
 271     {
 272       Paper_column *c = col_l_arr_[start];
 273       if (c->breakable_b () && !c->line_l_)
 274         ret.push (c);
 275       start++;
 276     }
 277
 278   return ret;
 279 }