11 for (iter_top(its,i); i.ok(); i++)
14 w.unite(Interval(0,0));
24 PCursor<PCol*> me=pscore_l_->find_col( (PCol*)this);
27 PCursor<PCol*> bot(pscore_l_->cols.top());
30 assert(rank_i_ != -1);
39 prebreak_p_->rank_i_ = i;
41 postbreak_p_->rank_i_ = i;
51 mtor << "rank: " << rank_i_ << '\n';
53 mtor << "# symbols: " << its.size() ;
55 mtor << "\npre,post: ";
57 postbreak_p_->print();
58 } else if (daddy_l_) {
59 mtor<<'\n' << ((this == daddy_l_->prebreak_p_) ?
60 "prebreak" : "postbreak");
63 mtor << "extent: " << width().str() << "\n";
69 PCol::compare(PCol const &c1, PCol const &c2)
71 return c1.rank() - c2.rank();
78 if (prebreak_p_ || postbreak_p_ ) {
79 assert(prebreak_p_&&postbreak_p_);
80 assert(prebreak_p_->daddy_l_ == this);
81 assert(postbreak_p_->daddy_l_ == this);
92 prebreak_p_ = new PCol(this);
93 postbreak_p_ = new PCol(this);
94 prebreak_p_->pscore_l_ = pscore_l_;
95 postbreak_p_->pscore_l_ = pscore_l_;
99 PCol::breakable_b() const
101 return prebreak_p_||postbreak_p_;
104 PCol::PCol(PCol *parent)
130 return breakable_b() || its.size();