- os << " inset: " << item.inset_
- << " text: " << item.text()
- << " idx: " << item.idx_
- << " par: " << item.par_
- << " pos: " << item.pos_
-// << " x: " << item.inset_->x()
-// << " y: " << item.inset_->y()
-;
- return os;
-}
-
-
-
-
-void increment(CursorBase & it)
-{
- CursorSlice & top = it.back();
- MathArray & ar = top.asMathInset()->cell(top.idx_);
-
- // move into the current inset if possible
- // it is impossible for pos() == size()!
- MathInset * n = 0;
- if (top.pos_ != ar.size())
- n = (ar.begin() + top.pos_)->nucleus();
- if (n && n->isActive()) {
- it.push_back(CursorSlice(n));
- return;
- }
-
- // otherwise move on one cell back if possible
- if (top.pos_ < ar.size()) {
- // pos() == size() is valid!
- ++top.pos_;
- return;
- }
-
- // otherwise try to move on one cell if possible
- while (top.idx_ + 1 < top.asMathInset()->nargs()) {
- // idx() == nargs() is _not_ valid!
- ++top.idx_;
- if (top.asMathInset()->validCell(top.idx_)) {
- top.pos_ = 0;
- return;
- }
- }
-
- // otherwise leave array, move on one back
- // this might yield pos() == size(), but that's a ok.
- it.pop_back();
- // it certainly invalidates top
- ++it.back().pos_;