}
-/*
-void MathIterator::shrink(size_type i)
-{
- if (i < size())
- erase(begin() + i, end());
-}
-
-
-void MathIterator::shrink(size_type i)
+bool MathIterator::normal() const
{
- if (i < size())
- erase(begin() + i, end());
+ return back().pos_ < cell().size();
}
-*/
void MathIterator::shrink(size_type i)
void goEnd();
/// read access to top most item
MathArray const & cell() const;
+ /// is this a non-end position
+ bool normal() const;
/// shrinks to at most i levels
void shrink(size_type i);
x += 2;
}
+
void MathNestInset::substitute(MathMacro const & m)
{
for (idx_type i = 0; i < nargs(); ++i)