#include "insets/InsetTabular.h"
+#include "support/convert.h"
#include "support/debug.h"
+#include "support/ExceptionMessage.h"
+#include "support/gettext.h"
#include "support/lassert.h"
#include "support/lstrings.h"
DocIterator doc_iterator_begin(const Buffer * buf0, const Inset * inset0)
{
- Buffer * buf = const_cast<Buffer *>(buf0);
+ Buffer * buf = const_cast<Buffer *>(buf0);
Inset * inset = const_cast<Inset *>(inset0);
DocIterator dit(buf, inset ? inset : &buf->inset());
dit.forwardPos();
DocIterator doc_iterator_end(const Buffer * buf0, const Inset * inset0)
{
- Buffer * buf = const_cast<Buffer *>(buf0);
+ Buffer * buf = const_cast<Buffer *>(buf0);
Inset * inset = const_cast<Inset *>(inset0);
return DocIterator(buf, inset ? inset : &buf->inset());
}
DocIterator dit(buffer);
size_t const n = slices_.size();
for (size_t i = 0 ; i != n; ++i) {
- LASSERT(inset, /**/);
+ LBUFERR(inset);
dit.push_back(slices_[i]);
dit.top().inset_ = inset;
if (i + 1 != n)
bool DocIterator::inRegexped() const
{
InsetMath * im = inset().asInsetMath();
- if (!im)
+ if (!im)
return false;
InsetMathHull * hull = im->asHullInset();
return hull && hull->getType() == hullRegexp;
Inset * DocIterator::realInset() const
{
- LASSERT(inTexted(), /**/);
+ LASSERT(inTexted(), return 0);
// if we are in a tabular, we need the cell
if (inset().lyxCode() == TABULAR_CODE) {
InsetTabular * tabular = inset().asInsetTabular();
Text * DocIterator::text() const
{
- LASSERT(!empty(), /**/);
+ LASSERT(!empty(), return 0);
return top().text();
}
Paragraph & DocIterator::paragraph() const
{
- if (!inTexted())
+ if (!inTexted()) {
LYXERR0(*this);
- LASSERT(inTexted(), /**/);
+ LBUFERR(false);
+ }
return top().paragraph();
}
Paragraph & DocIterator::innerParagraph() const
{
- LASSERT(!empty(), /**/);
+ LBUFERR(!empty());
return innerTextSlice().paragraph();
}
return f;
}
-
+
CursorSlice const & DocIterator::innerTextSlice() const
{
- LASSERT(!empty(), /**/);
+ LBUFERR(!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];
- // This case is in principe not possible. We _must_
+ // This case is in principle not possible. We _must_
// be inside a Text.
- LASSERT(false, /**/);
- static CursorSlice dummy;
- return dummy;
+ LBUFERR(false);
+ // Squash warning
+ static const CursorSlice c;
+ return c;
+}
+
+
+docstring DocIterator::paragraphGotoArgument() const
+{
+ CursorSlice const & s = innerTextSlice();
+ return convert<docstring>(s.paragraph().id()) + ' ' +
+ convert<docstring>(s.pos());
+}
+
+
+DocIterator DocIterator::getInnerText() const
+{
+ DocIterator texted = *this;
+ while (!texted.inTexted())
+ texted.pop_back();
+ return texted;
}
Text * DocIterator::innerText() const
{
- LASSERT(!empty(), /**/);
+ LASSERT(!empty(), return 0);
return innerTextSlice().text();
}
}
+bool DocIterator::posBackward()
+{
+ if (pos() == 0)
+ return false;
+ --pos();
+ return true;
+}
+
+
+bool DocIterator::posForward()
+{
+ if (pos() == lastpos())
+ return false;
+ ++pos();
+ return true;
+}
+
+
// This duplicates code above, but is in the critical path.
// So please think twice before adding stuff
void DocIterator::forwardPos()
}
+#if 0
+// works, but currently not needed
+void DocIterator::backwardInset()
+{
+ backwardPos();
+
+ while (!empty() && !nextInset()) {
+ if (inTexted()) {
+ pos_type const lastp = lastpos();
+ Paragraph const & par = paragraph();
+ pos_type & pos = top().pos();
+ while (pos > 0 && (pos == lastp || !par.isInset(pos)))
+ --pos;
+ if (pos > 0)
+ break;
+ }
+ backwardPos();
+ }
+}
+#endif
+
+
bool DocIterator::hasPart(DocIterator const & it) const
{
// it can't be a part if it is larger
}
+bool DocIterator::allowSpellCheck() const
+{
+ /// spell check is disabled if the iterator position
+ /// is inside of an inset which disables the spell checker
+ size_t const n = depth();
+ for (size_t i = 0; i < n; ++i) {
+ if (!slices_[i].inset_->allowSpellCheck())
+ return false;
+ }
+ return true;
+}
+
+
void DocIterator::updateInsets(Inset * inset)
{
// this function re-creates the cache of inset pointers.
size_t const n = slices_.size();
slices_.resize(0);
for (size_t i = 0 ; i < n; ++i) {
- LASSERT(inset, /**/);
+ LBUFERR(inset);
push_back(dit[i]);
top().inset_ = inset;
if (i + 1 != n)
if (empty())
return false;
- // Go through the slice stack from the bottom.
+ // Go through the slice stack from the bottom.
// Check that all coordinates (idx, pit, pos) are correct and
// that the inset is the one which is claimed to be there
Inset * inset = &slices_[0].inset();
size_t n = slices_.size();
for (; i != n; ++i) {
CursorSlice & cs = slices_[i];
- if (&cs.inset() != inset) {
+ if (&cs.inset() != inset || ! cs.inset().isActive()) {
// the whole slice is wrong, chop off this as well
--i;
LYXERR(Debug::DEBUG, "fixIfBroken(): inset changed");
fixIfBroken();
break;
}
+ if (!inset->isActive()) {
+ LYXERR0("Inset found on cursor stack is not active.");
+ fixIfBroken();
+ break;
+ }
push_back(sl[i]);
top().inset_ = inset;
if (fixIfBroken())
}
-int DocIterator::find(Inset const * inset) const
+int DocIterator::find(Inset const * inset) const
{
for (size_t l = 0; l != slices_.size(); ++l) {
if (&slices_[l].inset() == inset)
}
-void DocIterator::append(vector<CursorSlice> const & x)
+void DocIterator::append(vector<CursorSlice> const & x)
{
slices_.insert(slices_.end(), x.begin(), x.end());
}
-void DocIterator::append(DocIterator::idx_type idx, pos_type pos)
+void DocIterator::append(DocIterator::idx_type idx, pos_type pos)
{
slices_.push_back(CursorSlice());
top().idx() = idx;
///////////////////////////////////////////////////////
-StableDocIterator::StableDocIterator(DocIterator const & dit)
+StableDocIterator::StableDocIterator(DocIterator const & dit) :
+ data_(dit.internalData())
{
- data_ = dit.internalData();
for (size_t i = 0, n = data_.size(); i != n; ++i)
data_[i].inset_ = 0;
}
projects / lyx.git / blobdiff