2 * \file DocIterator.cpp
3 * This file is part of LyX, the document processor.
4 * Licence details can be found in the file COPYING.
7 * \author Alfredo Braunstein
9 * Full author contact details are available in file CREDITS.
15 #include "DocIterator.h"
19 #include "Paragraph.h"
21 #include "mathed/MathData.h"
22 #include "mathed/InsetMath.h"
24 #include "insets/InsetTabular.h"
26 #include <boost/assert.hpp>
27 #include <boost/current_function.hpp>
35 // We could be able to get rid of this if only every BufferView were
36 // associated to a buffer on construction.
37 DocIterator::DocIterator()
38 : boundary_(false), inset_(0)
42 DocIterator::DocIterator(Inset & inset)
43 : boundary_(false), inset_(&inset)
47 DocIterator doc_iterator_begin(Inset & inset)
49 DocIterator dit(inset);
55 DocIterator doc_iterator_end(Inset & inset)
57 return DocIterator(inset);
61 Inset * DocIterator::nextInset()
63 BOOST_ASSERT(!empty());
64 if (pos() == lastpos())
66 if (pos() > lastpos()) {
67 lyxerr << "Should not happen, but it does. " << endl;
71 return nextAtom().nucleus();
72 return paragraph().isInset(pos()) ? paragraph().getInset(pos()) : 0;
76 Inset * DocIterator::prevInset()
78 BOOST_ASSERT(!empty());
83 // FIXME: this should not happen but it does.
85 // http://bugzilla.lyx.org/show_bug.cgi?id=3189
88 return prevAtom().nucleus();
89 return paragraph().isInset(pos() - 1) ? paragraph().getInset(pos() - 1) : 0;
93 Inset const * DocIterator::prevInset() const
95 BOOST_ASSERT(!empty());
100 // FIXME: this should not happen but it does.
102 // http://bugzilla.lyx.org/show_bug.cgi?id=3189
105 return prevAtom().nucleus();
106 return paragraph().isInset(pos() - 1) ? paragraph().getInset(pos() - 1) : 0;
110 Inset * DocIterator::realInset() const
112 BOOST_ASSERT(inTexted());
113 // if we are in a tabular, we need the cell
114 if (inset().lyxCode() == Inset::TABULAR_CODE) {
115 InsetTabular & tabular = static_cast<InsetTabular&>(inset());
116 return tabular.cell(idx()).get();
122 MathAtom const & DocIterator::prevAtom() const
124 BOOST_ASSERT(!empty());
125 BOOST_ASSERT(pos() > 0);
126 return cell()[pos() - 1];
130 MathAtom & DocIterator::prevAtom()
132 BOOST_ASSERT(!empty());
133 BOOST_ASSERT(pos() > 0);
134 return cell()[pos() - 1];
138 MathAtom const & DocIterator::nextAtom() const
140 BOOST_ASSERT(!empty());
141 //lyxerr << "lastpos: " << lastpos() << " next atom:\n" << *this << endl;
142 BOOST_ASSERT(pos() < lastpos());
143 return cell()[pos()];
147 MathAtom & DocIterator::nextAtom()
149 BOOST_ASSERT(!empty());
150 //lyxerr << "lastpos: " << lastpos() << " next atom:\n" << *this << endl;
151 BOOST_ASSERT(pos() < lastpos());
152 return cell()[pos()];
156 Text * DocIterator::text()
158 BOOST_ASSERT(!empty());
162 Text const * DocIterator::text() const
164 BOOST_ASSERT(!empty());
169 Paragraph & DocIterator::paragraph()
172 lyxerr << *this << endl;
173 BOOST_ASSERT(inTexted());
174 return top().paragraph();
178 Paragraph const & DocIterator::paragraph() const
180 BOOST_ASSERT(inTexted());
181 return top().paragraph();
185 Paragraph const & DocIterator::innerParagraph() const
187 BOOST_ASSERT(!empty());
188 // go up until first non-0 text is hit
189 // (innermost text is 0 in mathed)
190 for (int i = depth() - 1; i >= 0; --i)
191 if (slices_[i].text())
192 return slices_[i].paragraph();
194 // This case is in principe not possible. We _must_
195 // be inside a Paragraph.
201 pit_type DocIterator::lastpit() const
203 return inMathed() ? 0 : text()->paragraphs().size() - 1;
207 pos_type DocIterator::lastpos() const
209 return inMathed() ? cell().size() : paragraph().size();
213 DocIterator::idx_type DocIterator::lastidx() const
215 return top().lastidx();
219 size_t DocIterator::nargs() const
221 // assume 1x1 grid for main text
222 return top().nargs();
226 size_t DocIterator::ncols() const
228 // assume 1x1 grid for main text
229 return top().ncols();
233 size_t DocIterator::nrows() const
235 // assume 1x1 grid for main text
236 return top().nrows();
240 DocIterator::row_type DocIterator::row() const
246 DocIterator::col_type DocIterator::col() const
252 MathData const & DocIterator::cell() const
254 // BOOST_ASSERT(inMathed());
259 MathData & DocIterator::cell()
261 // BOOST_ASSERT(inMathed());
266 Text * DocIterator::innerText()
268 BOOST_ASSERT(!empty());
269 // Go up until first non-0 text is hit
270 // (innermost text is 0 in mathed)
271 for (int i = depth() - 1; i >= 0; --i)
272 if (slices_[i].text())
273 return slices_[i].text();
277 Text const * DocIterator::innerText() const
279 BOOST_ASSERT(!empty());
280 // go up until first non-0 text is hit
281 // (innermost text is 0 in mathed)
282 for (int i = depth() - 1; i >= 0; --i)
283 if (slices_[i].text())
284 return slices_[i].text();
289 Inset * DocIterator::innerInsetOfType(int code) const
291 for (int i = depth() - 1; i >= 0; --i)
292 if (slices_[i].inset_->lyxCode() == code)
293 return slices_[i].inset_;
298 void DocIterator::forwardPos(bool ignorecollapsed)
300 //this dog bites his tail
302 push_back(CursorSlice(*inset_));
306 Inset * const nextinset = nextInset();
307 // jump over collapsables if they are collapsed
308 // FIXME: the check for asInsetMath() shouldn't be necessary
309 // but math insets do not return a sensible editable() state yet.
310 if (ignorecollapsed && nextinset && (!nextinset->asInsetMath()
311 && nextinset->editable() != Inset::HIGHLY_EDITABLE)) {
316 CursorSlice & tip = top();
317 //lyxerr << "XXX\n" << *this << endl;
319 // this is used twice and shows up in the profiler!
320 pos_type const lastp = lastpos();
322 // move into an inset to the right if possible
325 if (tip.pos() != lastp) {
326 // this is impossible for pos() == size()
328 n = (tip.cell().begin() + tip.pos())->nucleus();
330 if (paragraph().isInset(tip.pos()))
331 n = paragraph().getInset(tip.pos());
335 if (n && n->isActive()) {
336 //lyxerr << "... descend" << endl;
337 push_back(CursorSlice(*n));
345 // otherwise leave inset and jump over inset as a whole
347 // 'tip' is invalid now...
353 void DocIterator::forwardPar()
357 while (!empty() && (!inTexted() || pos() != 0)) {
359 pos_type const lastp = lastpos();
360 Paragraph const & par = paragraph();
361 pos_type & pos = top().pos();
362 if (par.insetlist.empty())
365 while (pos < lastp && !par.isInset(pos))
373 void DocIterator::forwardIdx()
375 CursorSlice & tip = top();
377 //prevent endless loops
378 BOOST_ASSERT(tip.idx() < lastidx());
386 void DocIterator::forwardChar()
389 while (!empty() && pos() == lastpos())
394 void DocIterator::forwardInset()
398 while (!empty() && !nextInset()) {
400 pos_type const lastp = lastpos();
401 Paragraph const & par = paragraph();
402 pos_type & pos = top().pos();
403 while (pos < lastp && !par.isInset(pos))
413 void DocIterator::backwardChar()
416 while (!empty() && pos() == lastpos())
421 void DocIterator::backwardPos()
423 //this dog bites his tail
425 push_back(CursorSlice(*inset_));
426 top().idx() = lastidx();
427 top().pit() = lastpit();
428 top().pos() = lastpos();
432 if (top().at_begin()) {
439 // move into an inset to the left if possible
443 n = (top().cell().begin() + top().pos())->nucleus();
445 if (paragraph().isInset(top().pos()))
446 n = paragraph().getInset(top().pos());
449 if (n && n->isActive()) {
450 push_back(CursorSlice(*n));
451 top().idx() = lastidx();
452 top().pit() = lastpit();
453 top().pos() = lastpos();
458 bool DocIterator::hasPart(DocIterator const & it) const
460 // it can't be a part if it is larger
461 if (it.depth() > depth())
464 // as inset adresses are the 'last' level
465 return &it.top().inset() == &slices_[it.depth() - 1].inset();
469 void DocIterator::updateInsets(Inset * inset)
471 // this function re-creates the cache of inset pointers.
472 // code taken in part from StableDocIterator::asDocIterator.
473 //lyxerr << "converting:\n" << *this << endl;
474 DocIterator dit = DocIterator(*inset);
475 size_t const n = slices_.size();
476 for (size_t i = 0 ; i < n; ++i) {
478 dit.push_back(slices_[i]);
479 dit.top().inset_ = inset;
481 inset = dit.nextInset();
483 //lyxerr << "converted:\n" << *this << endl;
488 bool DocIterator::fixIfBroken()
490 // Go through the slice stack from the bottom.
491 // Check that all coordinates (idx, pit, pos) are correct and
492 // that the inset is the one which is claimed to be there
493 Inset * inset = &slices_[0].inset();
495 size_t n = slices_.size();
496 for (; i != n; ++i) {
497 CursorSlice & cs = slices_[i];
498 if (&cs.inset() != inset) {
499 // the whole slice is wrong, chop off this as well
501 LYXERR(Debug::DEBUG) << "fixIfBroken(): inset changed" << endl;
503 } else if (cs.idx() > cs.lastidx()) {
504 cs.idx() = cs.lastidx();
505 cs.pit() = cs.lastpit();
506 cs.pos() = cs.lastpos();
507 LYXERR(Debug::DEBUG) << "fixIfBroken(): idx fixed" << endl;
509 } else if (cs.pit() > cs.lastpit()) {
510 cs.pit() = cs.lastpit();
511 cs.pos() = cs.lastpos();
512 LYXERR(Debug::DEBUG) << "fixIfBroken(): pit fixed" << endl;
514 } else if (cs.pos() > cs.lastpos()) {
515 cs.pos() = cs.lastpos();
516 LYXERR(Debug::DEBUG) << "fixIfBroken(): pos fixed" << endl;
518 } else if (i != n - 1 && cs.pos() != cs.lastpos()) {
519 // get inset which is supposed to be in the next slice
520 if (cs.inset().inMathed())
521 inset = (cs.cell().begin() + cs.pos())->nucleus();
522 else if (cs.paragraph().isInset(cs.pos()))
523 inset = cs.paragraph().getInset(cs.pos());
525 // there are slices left, so there must be another inset
531 // Did we make it through the whole slice stack? Otherwise there
532 // was a problem at slice i, and we have to chop off above
534 LYXERR(Debug::DEBUG) << "fixIfBroken(): cursor chopped at " << i << endl;
542 std::ostream & operator<<(std::ostream & os, DocIterator const & dit)
544 for (size_t i = 0, n = dit.depth(); i != n; ++i)
545 os << " " << dit[i] << "\n";
550 bool operator<(DocIterator const & p, DocIterator const & q)
552 size_t depth = std::min(p.depth(), q.depth());
553 for (size_t i = 0 ; i < depth ; ++i) {
557 return p.depth() < q.depth();
561 bool operator>(DocIterator const & p, DocIterator const & q)
567 bool operator<=(DocIterator const & p, DocIterator const & q)
573 ///////////////////////////////////////////////////////
575 StableDocIterator::StableDocIterator(DocIterator const & dit)
577 data_ = dit.internalData();
578 for (size_t i = 0, n = data_.size(); i != n; ++i)
583 DocIterator StableDocIterator::asDocIterator(Inset * inset) const
585 // this function re-creates the cache of inset pointers
586 //lyxerr << "converting:\n" << *this << endl;
587 DocIterator dit = DocIterator(*inset);
588 for (size_t i = 0, n = data_.size(); i != n; ++i) {
591 lyxerr << BOOST_CURRENT_FUNCTION
592 << " Should not happen, but does e.g. after C-n C-l C-z S-C-z\n"
593 << " or when a Buffer has been concurently edited by two views"
594 << '\n' << "dit: " << dit << '\n'
595 << " lastpos: " << dit.lastpos() << endl;
599 dit.push_back(data_[i]);
600 dit.top().inset_ = inset;
601 if (dit.fixIfBroken())
604 inset = dit.nextInset();
606 //lyxerr << "convert:\n" << *this << " to:\n" << dit << endl;
611 std::ostream & operator<<(std::ostream & os, StableDocIterator const & dit)
613 for (size_t i = 0, n = dit.data_.size(); i != n; ++i)
614 os << " " << dit.data_[i] << "\n";
619 bool operator==(StableDocIterator const & dit1, StableDocIterator const & dit2)
621 return dit1.data_ == dit2.data_;