mirror of
https://git.lyx.org/repos/lyx.git
synced 2024-09-21 15:18:45 +00:00
a97c06ef62
git-svn-id: svn://svn.lyx.org/lyx/lyx-devel/trunk@10277 a592a061-630c-0410-9148-cb99ea01b6c8
550 lines
10 KiB
C
550 lines
10 KiB
C
/**
|
|
* \file dociterator.C
|
|
* This file is part of LyX, the document processor.
|
|
* Licence details can be found in the file COPYING.
|
|
*
|
|
* \author André Pönitz
|
|
*
|
|
* Full author contact details are available in file CREDITS.
|
|
*/
|
|
|
|
|
|
#include <config.h>
|
|
|
|
#include "dociterator.h"
|
|
|
|
#include "debug.h"
|
|
#include "lyxtext.h"
|
|
#include "lyxrow.h"
|
|
#include "paragraph.h"
|
|
|
|
#include "mathed/math_data.h"
|
|
#include "mathed/math_inset.h"
|
|
|
|
#include <boost/assert.hpp>
|
|
#include <boost/current_function.hpp>
|
|
|
|
using std::endl;
|
|
|
|
|
|
// We could be able to get rid of this if only every BufferView were
|
|
// associated to a buffer on construction.
|
|
DocIterator::DocIterator()
|
|
: boundary_(false), inset_(0)
|
|
{}
|
|
|
|
|
|
DocIterator::DocIterator(InsetBase & inset)
|
|
: boundary_(false), inset_(&inset)
|
|
{}
|
|
|
|
|
|
DocIterator doc_iterator_begin(InsetBase & inset)
|
|
{
|
|
DocIterator dit(inset);
|
|
dit.forwardPos();
|
|
return dit;
|
|
}
|
|
|
|
|
|
DocIterator doc_iterator_end(InsetBase & inset)
|
|
{
|
|
return DocIterator(inset);
|
|
}
|
|
|
|
|
|
InsetBase * DocIterator::nextInset()
|
|
{
|
|
BOOST_ASSERT(!empty());
|
|
if (pos() == lastpos())
|
|
return 0;
|
|
if (pos() > lastpos()) {
|
|
lyxerr << "Should not happen, but it does. " << endl;
|
|
return 0;
|
|
}
|
|
if (inMathed())
|
|
return nextAtom().nucleus();
|
|
return paragraph().isInset(pos()) ? paragraph().getInset(pos()) : 0;
|
|
}
|
|
|
|
|
|
InsetBase * DocIterator::prevInset()
|
|
{
|
|
BOOST_ASSERT(!empty());
|
|
if (pos() == 0)
|
|
return 0;
|
|
if (inMathed())
|
|
return prevAtom().nucleus();
|
|
return paragraph().isInset(pos() - 1) ? paragraph().getInset(pos() - 1) : 0;
|
|
}
|
|
|
|
|
|
InsetBase const * DocIterator::prevInset() const
|
|
{
|
|
BOOST_ASSERT(!empty());
|
|
if (pos() == 0)
|
|
return 0;
|
|
if (inMathed())
|
|
return prevAtom().nucleus();
|
|
return paragraph().isInset(pos() - 1) ? paragraph().getInset(pos() - 1) : 0;
|
|
}
|
|
|
|
|
|
MathAtom const & DocIterator::prevAtom() const
|
|
{
|
|
BOOST_ASSERT(!empty());
|
|
BOOST_ASSERT(pos() > 0);
|
|
return cell()[pos() - 1];
|
|
}
|
|
|
|
|
|
MathAtom & DocIterator::prevAtom()
|
|
{
|
|
BOOST_ASSERT(!empty());
|
|
BOOST_ASSERT(pos() > 0);
|
|
return cell()[pos() - 1];
|
|
}
|
|
|
|
|
|
MathAtom const & DocIterator::nextAtom() const
|
|
{
|
|
BOOST_ASSERT(!empty());
|
|
//lyxerr << "lastpos: " << lastpos() << " next atom:\n" << *this << endl;
|
|
BOOST_ASSERT(pos() < lastpos());
|
|
return cell()[pos()];
|
|
}
|
|
|
|
|
|
MathAtom & DocIterator::nextAtom()
|
|
{
|
|
BOOST_ASSERT(!empty());
|
|
//lyxerr << "lastpos: " << lastpos() << " next atom:\n" << *this << endl;
|
|
BOOST_ASSERT(pos() < lastpos());
|
|
return cell()[pos()];
|
|
}
|
|
|
|
|
|
LyXText * DocIterator::text()
|
|
{
|
|
BOOST_ASSERT(!empty());
|
|
return top().text();
|
|
}
|
|
|
|
LyXText const * DocIterator::text() const
|
|
{
|
|
BOOST_ASSERT(!empty());
|
|
return top().text();
|
|
}
|
|
|
|
|
|
Paragraph & DocIterator::paragraph()
|
|
{
|
|
if (!inTexted())
|
|
lyxerr << *this << endl;
|
|
BOOST_ASSERT(inTexted());
|
|
return top().paragraph();
|
|
}
|
|
|
|
|
|
Paragraph const & DocIterator::paragraph() const
|
|
{
|
|
BOOST_ASSERT(inTexted());
|
|
return top().paragraph();
|
|
}
|
|
|
|
|
|
Row & DocIterator::textRow()
|
|
{
|
|
BOOST_ASSERT(!paragraph().rows().empty());
|
|
return paragraph().getRow(pos(), boundary_);
|
|
}
|
|
|
|
|
|
Row const & DocIterator::textRow() const
|
|
{
|
|
BOOST_ASSERT(!paragraph().rows().empty());
|
|
return paragraph().getRow(pos(), boundary_);
|
|
}
|
|
|
|
|
|
DocIterator::pit_type DocIterator::lastpit() const
|
|
{
|
|
return inMathed() ? 0 : text()->paragraphs().size() - 1;
|
|
}
|
|
|
|
|
|
DocIterator::pos_type DocIterator::lastpos() const
|
|
{
|
|
return inMathed() ? cell().size() : paragraph().size();
|
|
}
|
|
|
|
|
|
DocIterator::idx_type DocIterator::lastidx() const
|
|
{
|
|
return top().lastidx();
|
|
}
|
|
|
|
|
|
size_t DocIterator::nargs() const
|
|
{
|
|
// assume 1x1 grid for main text
|
|
return top().nargs();
|
|
}
|
|
|
|
|
|
size_t DocIterator::ncols() const
|
|
{
|
|
// assume 1x1 grid for main text
|
|
return top().ncols();
|
|
}
|
|
|
|
|
|
size_t DocIterator::nrows() const
|
|
{
|
|
// assume 1x1 grid for main text
|
|
return top().nrows();
|
|
}
|
|
|
|
|
|
DocIterator::row_type DocIterator::row() const
|
|
{
|
|
return top().row();
|
|
}
|
|
|
|
|
|
DocIterator::col_type DocIterator::col() const
|
|
{
|
|
return top().col();
|
|
}
|
|
|
|
|
|
MathArray const & DocIterator::cell() const
|
|
{
|
|
BOOST_ASSERT(inMathed());
|
|
return top().cell();
|
|
}
|
|
|
|
|
|
MathArray & DocIterator::cell()
|
|
{
|
|
BOOST_ASSERT(inMathed());
|
|
return top().cell();
|
|
}
|
|
|
|
|
|
bool DocIterator::inMathed() const
|
|
{
|
|
return !empty() && inset().inMathed();
|
|
}
|
|
|
|
|
|
bool DocIterator::inTexted() const
|
|
{
|
|
return !empty() && !inset().inMathed();
|
|
}
|
|
|
|
|
|
LyXText * DocIterator::innerText()
|
|
{
|
|
BOOST_ASSERT(!empty());
|
|
// Go up until first non-0 text is hit
|
|
// (innermost text is 0 in mathed)
|
|
for (int i = depth() - 1; i >= 0; --i)
|
|
if (slices_[i].text())
|
|
return slices_[i].text();
|
|
return 0;
|
|
}
|
|
|
|
LyXText const * DocIterator::innerText() const
|
|
{
|
|
BOOST_ASSERT(!empty());
|
|
// go up until first non-0 text is hit
|
|
// (innermost text is 0 in mathed)
|
|
for (int i = depth() - 1; i >= 0; --i)
|
|
if (slices_[i].text())
|
|
return slices_[i].text();
|
|
return 0;
|
|
}
|
|
|
|
|
|
InsetBase * DocIterator::innerInsetOfType(int code) const
|
|
{
|
|
for (int i = depth() - 1; i >= 0; --i)
|
|
if (slices_[i].inset_->lyxCode() == code)
|
|
return slices_[i].inset_;
|
|
return 0;
|
|
}
|
|
|
|
|
|
void DocIterator::forwardPos()
|
|
{
|
|
//this dog bites his tail
|
|
if (empty()) {
|
|
push_back(CursorSlice(*inset_));
|
|
return;
|
|
}
|
|
|
|
CursorSlice & tip = top();
|
|
//lyxerr << "XXX\n" << *this << endl;
|
|
|
|
// this is used twice and shows up in the profiler!
|
|
pos_type const lastp = lastpos();
|
|
|
|
// move into an inset to the right if possible
|
|
InsetBase * n = 0;
|
|
|
|
if (tip.pos() != lastp) {
|
|
// this is impossible for pos() == size()
|
|
if (inMathed()) {
|
|
n = (tip.cell().begin() + tip.pos())->nucleus();
|
|
} else {
|
|
if (paragraph().isInset(tip.pos()))
|
|
n = paragraph().getInset(tip.pos());
|
|
}
|
|
}
|
|
|
|
if (n && n->isActive()) {
|
|
//lyxerr << "... descend" << endl;
|
|
push_back(CursorSlice(*n));
|
|
return;
|
|
}
|
|
|
|
// otherwise move on one position if possible
|
|
if (tip.pos() < lastp) {
|
|
//lyxerr << "... next pos" << endl;
|
|
++tip.pos();
|
|
return;
|
|
}
|
|
//lyxerr << "... no next pos" << endl;
|
|
|
|
// otherwise move on one paragraph if possible
|
|
if (tip.pit() < lastpit()) {
|
|
//lyxerr << "... next par" << endl;
|
|
++tip.pit();
|
|
tip.pos() = 0;
|
|
return;
|
|
}
|
|
//lyxerr << "... no next pit" << endl;
|
|
|
|
// otherwise try to move on one cell if possible
|
|
if (tip.idx() < lastidx()) {
|
|
//lyxerr << "... next idx" << endl;
|
|
++tip.idx();
|
|
tip.pit() = 0;
|
|
tip.pos() = 0;
|
|
return;
|
|
}
|
|
//lyxerr << "... no next idx" << endl;
|
|
|
|
// otherwise leave inset and jump over inset as a whole
|
|
pop_back();
|
|
// 'top' is invalid now...
|
|
if (!empty())
|
|
++top().pos();
|
|
}
|
|
|
|
|
|
void DocIterator::forwardPosNoDescend()
|
|
{
|
|
CursorSlice & tip = top();
|
|
pos_type const lastp = lastpos();
|
|
|
|
// move on one position if possible
|
|
if (tip.pos() < lastp) {
|
|
//lyxerr << "... next pos" << endl;
|
|
++tip.pos();
|
|
return;
|
|
}
|
|
//lyxerr << "... no next pos" << endl;
|
|
|
|
// otherwise move on one paragraph if possible
|
|
if (tip.pit() < lastpit()) {
|
|
//lyxerr << "... next par" << endl;
|
|
++tip.pit();
|
|
tip.pos() = 0;
|
|
return;
|
|
}
|
|
//lyxerr << "... no next pit" << endl;
|
|
|
|
// otherwise try to move on one cell if possible
|
|
if (tip.idx() < lastidx()) {
|
|
//lyxerr << "... next idx" << endl;
|
|
++tip.idx();
|
|
tip.pit() = 0;
|
|
tip.pos() = 0;
|
|
return;
|
|
}
|
|
//lyxerr << "... no next idx" << endl;
|
|
|
|
// otherwise we can't move on
|
|
}
|
|
|
|
|
|
void DocIterator::forwardPar()
|
|
{
|
|
forwardPos();
|
|
|
|
#if 0
|
|
DocIterator cmp(*this);
|
|
#endif
|
|
|
|
while (!empty() && (!inTexted() || pos() != 0)) {
|
|
if (inTexted()) {
|
|
pos_type const lastp = lastpos();
|
|
Paragraph const & par = paragraph();
|
|
pos_type & pos = top().pos();
|
|
while (pos < lastp && !par.isInset(pos))
|
|
++pos;
|
|
}
|
|
forwardPos();
|
|
}
|
|
|
|
#if 0
|
|
while (!cmp.empty() && (!cmp.inTexted() || cmp.pos() != 0))
|
|
cmp.forwardPos();
|
|
BOOST_ASSERT(cmp == *this);
|
|
#endif
|
|
}
|
|
|
|
|
|
void DocIterator::forwardChar()
|
|
{
|
|
forwardPos();
|
|
while (!empty() && pos() == lastpos())
|
|
forwardPos();
|
|
}
|
|
|
|
|
|
void DocIterator::forwardInset()
|
|
{
|
|
forwardPos();
|
|
while (!empty() && (pos() == lastpos() || nextInset() == 0))
|
|
forwardPos();
|
|
}
|
|
|
|
|
|
void DocIterator::backwardChar()
|
|
{
|
|
backwardPos();
|
|
while (!empty() && pos() == lastpos())
|
|
backwardPos();
|
|
}
|
|
|
|
|
|
void DocIterator::backwardPos()
|
|
{
|
|
//this dog bites his tail
|
|
if (empty()) {
|
|
push_back(CursorSlice(*inset_));
|
|
top().idx() = lastidx();
|
|
top().pit() = lastpit();
|
|
top().pos() = lastpos();
|
|
return;
|
|
}
|
|
|
|
CursorSlice & tip = top();
|
|
|
|
if (tip.pos() != 0) {
|
|
--tip.pos();
|
|
} else if (tip.pit() != 0) {
|
|
--tip.pit();
|
|
tip.pos() = lastpos();
|
|
return;
|
|
} else if (tip.idx() != 0) {
|
|
--tip.idx();
|
|
tip.pit() = lastpit();
|
|
tip.pos() = lastpos();
|
|
return;
|
|
} else {
|
|
pop_back();
|
|
return;
|
|
}
|
|
|
|
// move into an inset to the left if possible
|
|
InsetBase * n = 0;
|
|
|
|
if (inMathed()) {
|
|
n = (tip.cell().begin() + tip.pos())->nucleus();
|
|
} else {
|
|
if (paragraph().isInset(tip.pos()))
|
|
n = paragraph().getInset(tip.pos());
|
|
}
|
|
|
|
if (n && n->isActive()) {
|
|
push_back(CursorSlice(*n));
|
|
top().idx() = lastidx();
|
|
top().pit() = lastpit();
|
|
top().pos() = lastpos();
|
|
}
|
|
}
|
|
|
|
|
|
bool DocIterator::hasPart(DocIterator const & it) const
|
|
{
|
|
// it can't be a part if it is larger
|
|
if (it.depth() > depth())
|
|
return false;
|
|
|
|
// as inset adresses are the 'last' level
|
|
return &it.top().inset() == &slices_[it.depth() - 1].inset();
|
|
}
|
|
|
|
|
|
std::ostream & operator<<(std::ostream & os, DocIterator const & dit)
|
|
{
|
|
for (size_t i = 0, n = dit.depth(); i != n; ++i)
|
|
os << " " << dit[i] << "\n";
|
|
return os;
|
|
}
|
|
|
|
|
|
|
|
///////////////////////////////////////////////////////
|
|
|
|
StableDocIterator::StableDocIterator(DocIterator const & dit)
|
|
{
|
|
data_ = dit.internalData();
|
|
for (size_t i = 0, n = data_.size(); i != n; ++i)
|
|
data_[i].inset_ = 0;
|
|
}
|
|
|
|
|
|
DocIterator StableDocIterator::asDocIterator(InsetBase * inset) const
|
|
{
|
|
// this function re-creates the cache of inset pointers
|
|
//lyxerr << "converting:\n" << *this << endl;
|
|
DocIterator dit = DocIterator(*inset);
|
|
for (size_t i = 0, n = data_.size(); i != n; ++i) {
|
|
if (inset == 0) {
|
|
// FIXME
|
|
lyxerr << BOOST_CURRENT_FUNCTION
|
|
<< " Should not happen, but does e.g. after C-n C-l C-z S-C-z"
|
|
<< '\n' << "dit: " << dit << '\n'
|
|
<< " lastpos: " << dit.lastpos() << endl;
|
|
//break;
|
|
BOOST_ASSERT(false);
|
|
}
|
|
dit.push_back(data_[i]);
|
|
dit.top().inset_ = inset;
|
|
if (i + 1 != n)
|
|
inset = dit.nextInset();
|
|
}
|
|
//lyxerr << "convert:\n" << *this << " to:\n" << dit << endl;
|
|
return dit;
|
|
}
|
|
|
|
|
|
std::ostream & operator<<(std::ostream & os, StableDocIterator const & dit)
|
|
{
|
|
for (size_t i = 0, n = dit.data_.size(); i != n; ++i)
|
|
os << " " << dit.data_[i] << "\n";
|
|
return os;
|
|
}
|
|
|
|
|
|
bool operator==(StableDocIterator const & dit1, StableDocIterator const & dit2)
|
|
{
|
|
return dit1.data_ == dit2.data_;
|
|
}
|
|
|