1 // the breaking problem for a score.
11 /// all stuff which goes onto paper
13 Paperdef *paper_; // indirection.
15 /// the columns, ordered left to right
16 PointerList<PCol *> cols;
18 /// the idealspacings, no particular order
19 PointerList<Idealspacing*> suz;
21 /// the staffs ordered top to bottom
22 PointerList<PStaff*> staffs;
24 /// all symbols in score. No particular order.
25 PointerList<Item*> its;
27 /// if broken, the different lines
28 PointerList<Line_of_score*> lines;
30 /// crescs etc; no particular order
31 PointerList<Spanner *> spanners;
33 /****************************************************************/
35 svec<Item*> select_items(PStaff*, PCol*);
39 calculate where the lines are to be broken.
43 lines contain the broken lines.
46 /// search all pcols which are breakable.
47 svec<const PCol *> find_breaks() const;
49 /// add a line to the broken stuff. Positions given in #config#
50 void add_line(svec<const PCol *> curline, svec<Real> config);
52 /// helper: solve for the columns in #curline#.
53 svec<Real> solve_line(svec<const PCol *> curline) const;
57 void typeset_item(Item *, PCol *,PStaff*,int=1);
58 /// add to bottom of pcols
63 void output(Tex_stream &ts);
65 Idealspacing* get_spacing(PCol *, PCol *);
67 get the spacing between c1 and c2, create one if necessary.
71 PCursor<PCol *> find_col(PCol *);
73 void problem_OK()const ;
78 /** notes, signs, symbols in a score can be grouped in two ways:
79 horizontally (staffwise), and vertically (columns). #PScore#
80 contains the items, the columns and the staffs.