-
#include <config.h>
-#include "debug.h"
#include "math_iterator.h"
+#include "debug.h"
+#include "support/LAssert.h"
-MathIterator::MathIterator()
-{}
+//MathIterator::MathIterator()
+//{}
MathIterator::MathIterator(MathInset * p)
}
-MathIterator::MathIterator(MathCursor::cursor_type const & c)
- : cursor_(c)
-{}
-
-
-MathCursorPos const & MathIterator::position() const
-{
- return cursor_.back();
-}
-
-
-MathCursorPos & MathIterator::position()
-{
- return cursor_.back();
-}
+//MathIterator::MathIterator(MathCursor::cursor_type const & c)
+// : cursor_(c)
+//{}
MathCursor::cursor_type const & MathIterator::cursor() const
}
-MathInset * MathIterator::par() const
+MathInset const * MathIterator::par() const
{
- return cursor_.size() ? cursor_.back().par_ : 0;
+ return position().par_;
}
-MathXArray const & MathIterator::xcell() const
+MathInset * MathIterator::par()
{
- if (!par())
- lyxerr << "MathIterator::xcell: no cell\n";
- return par()->xcell(position().idx_);
+ return position().par_;
}
-MathInset * MathIterator::nextInset() const
+MathArray const & MathIterator::cell() const
{
- if (position().pos_ == xcell().data_.size())
- return 0;
- return (xcell().begin() + position().pos_)->nucleus();
+ MathCursorPos const & top = position();
+ return top.par_->cell(top.idx_);
}
+
void MathIterator::push(MathInset * p)
{
//lyxerr << "push: " << p << endl;
void MathIterator::pop()
{
//lyxerr << "pop: " << endl;
+ lyx::Assert(cursor_.size());
cursor_.pop_back();
}
}
+void MathIterator::goEnd()
+{
+ MathCursorPos & top = position();
+ top.idx_ = top.par_->nargs() - 1;
+ top.pos_ = cell().size();
+}
+
+
void MathIterator::operator++()
{
+ MathCursorPos & top = position();
+ MathArray const & ar = top.par_->cell(top.idx_);
+
// move into the current inset if possible
// it is impossible for pos() == size()!
- if (nextInset() && nextInset()->isActive()) {
- push(nextInset());
+ MathInset * n = 0;
+ if (top.pos_ != ar.size())
+ n = (ar.begin() + top.pos_)->nucleus();
+ if (n && n->isActive()) {
+ push(n);
return;
}
// otherwise move on one cell position if possible
- if (position().pos_ < xcell().data_.size()) {
+ if (top.pos_ < ar.size()) {
// pos() == size() is valid!
- ++position().pos_;
+ ++top.pos_;
return;
}
- // otherwise move on one cell if possible
- if (position().idx_ + 1 < par()->nargs()) {
+ // otherwise try to move on one cell if possible
+ while (top.idx_ + 1 < top.par_->nargs()) {
// idx() == nargs() is _not_ valid!
- ++position().idx_;
- position().pos_ = 0;
- return;
+ ++top.idx_;
+ if (top.par_->validCell(top.idx_)) {
+ top.pos_ = 0;
+ return;
+ }
}
- // otherwise leave array, move on one cell
+ // otherwise leave array, move on one position
// this might yield pos() == size(), but that's a ok.
pop();
+ // it certainly invalidates top
++position().pos_;
}
+void MathIterator::jump(MathInset::difference_type i)
+{
+ position().pos_ += i;
+ //lyx::Assert(position().pos_ >= 0);
+ lyx::Assert(position().pos_ <= cell().size());
+}
+
bool operator==(MathIterator const & it, MathIterator const & jt)
{
//lyxerr << "==: " << it.cursor().size() << " " << jt.cursor().size() << endl;
if (it.cursor().size() != jt.cursor().size())
return false;
- return it.cursor() == jt.cursor();
+ return it.cursor() == jt.cursor();
}
//lyxerr << "!=: " << it.cursor().size() << " " << jt.cursor().size() << endl;
if (it.cursor().size() != jt.cursor().size())
return true;
- return it.cursor() != jt.cursor();
+ return it.cursor() != jt.cursor();
}
+
+MathIterator ibegin(MathInset * p)
+{
+ return MathIterator(p);
+}
+
+
+MathIterator iend(MathInset * p)
+{
+ MathIterator it(p);
+ it.goEnd();
+ return it;
+}