2 * This file is part of LyX, the document processor.
3 * Licence details can be found in the file COPYING.
6 * \author Lars Gullik Bjønnes
8 * Full author contact details are available in file CREDITS.
14 #include "iterators.h"
15 #include "paragraph.h"
16 #include "PosIterator.h"
19 #include "BufferView.h"
20 #include "dispatchresult.h"
22 #include "insets/inset.h"
23 #include "insets/updatableinset.h"
24 #include "insets/insettext.h"
26 #include <boost/next_prior.hpp>
27 #include <boost/optional.hpp>
30 using boost::optional;
40 ParPosition(ParagraphList::iterator p, ParagraphList const & pl);
42 ParagraphList::iterator pit;
44 ParagraphList const * plist;
46 optional<InsetList::iterator> it;
52 ParPosition::ParPosition(ParagraphList::iterator p, ParagraphList const & pl)
55 if (p != const_cast<ParagraphList&>(pl).end()) {
56 it.reset(p->insetlist.begin());
61 bool operator==(ParPosition const & pos1, ParPosition const & pos2)
63 return pos1.pit == pos2.pit;
67 bool operator!=(ParPosition const & pos1, ParPosition const & pos2)
69 return !(pos1 == pos2);
77 struct ParIterator::Pimpl {
78 typedef vector<ParPosition> PosHolder;
82 ParIterator::ParIterator(ParagraphList::iterator pit, ParagraphList const & pl)
85 pimpl_->positions.push_back(ParPosition(pit, pl));
89 ParIterator::~ParIterator()
93 ParIterator::ParIterator(ParIterator const & pi)
94 : pimpl_(new Pimpl(*pi.pimpl_))
98 void ParIterator::operator=(ParIterator const & pi)
101 pimpl_.swap(tmp.pimpl_);
105 ParIterator & ParIterator::operator++()
107 while (!pimpl_->positions.empty()) {
108 ParPosition & p = pimpl_->positions.back();
110 // Does the current inset contain more "cells" ?
113 ParagraphList * plist = (*p.it)->inset->getParagraphs(*p.index);
114 if (plist && !plist->empty()) {
115 pimpl_->positions.push_back(ParPosition(plist->begin(), *plist));
120 // The following line is needed because the value of
121 // p.it may be invalid if inset was added/removed to
122 // the paragraph pointed by the iterator
123 p.it.reset(p.pit->insetlist.begin());
125 // Try to find the next inset that contains paragraphs
126 InsetList::iterator end = p.pit->insetlist.end();
127 for (; *p.it != end; ++(*p.it)) {
128 ParagraphList * plist = (*p.it)->inset->getParagraphs(0);
129 if (plist && !plist->empty()) {
131 pimpl_->positions.push_back(ParPosition(plist->begin(), *plist));
136 // Try to go to the next paragarph
137 if (next(p.pit) != const_cast<ParagraphList*>(p.plist)->end()
138 || pimpl_->positions.size() == 1) {
146 // Drop end and move up in the stack.
147 pimpl_->positions.pop_back();
153 LyXText * ParIterator::text(Buffer & buf) const
155 //lyxerr << "positions.size: " << pimpl_->positions.size() << std::endl;
156 if (pimpl_->positions.size() <= 1)
159 ParPosition const & pos = pimpl_->positions[pimpl_->positions.size() - 2];
160 return (*pos.it)->inset->getText(*pos.index);
164 InsetOld * ParIterator::inset() const
166 //lyxerr << "positions.size: " << pimpl_->positions.size() << std::endl;
167 if (pimpl_->positions.size() <= 1)
170 ParPosition const & pos = pimpl_->positions[pimpl_->positions.size() - 2];
171 return (*pos.it)->inset;
175 int ParIterator::index() const
177 if (pimpl_->positions.size() <= 1)
180 return *(pimpl_->positions[pimpl_->positions.size() - 2].index);
184 Paragraph & ParIterator::operator*() const
186 return *pimpl_->positions.back().pit;
190 ParagraphList::iterator ParIterator::pit() const
192 return pimpl_->positions.back().pit;
196 ParagraphList::iterator ParIterator::operator->() const
198 return pimpl_->positions.back().pit;
202 ParagraphList::iterator ParIterator::outerPar() const
204 return pimpl_->positions[0].pit;
208 size_t ParIterator::size() const
210 return pimpl_->positions.size();
214 ParagraphList & ParIterator::plist() const
216 return *const_cast<ParagraphList*>(pimpl_->positions.back().plist);
220 bool operator==(ParIterator const & iter1, ParIterator const & iter2)
222 return iter1.pimpl_->positions == iter2.pimpl_->positions;
226 bool operator!=(ParIterator const & iter1, ParIterator const & iter2)
228 return !(iter1 == iter2);
237 struct ParConstIterator::Pimpl {
238 typedef vector<ParPosition> PosHolder;
243 ParConstIterator::ParConstIterator(ParagraphList::iterator pit,
244 ParagraphList const & pl)
247 pimpl_->positions.push_back(ParPosition(pit, pl));
251 ParConstIterator::~ParConstIterator()
255 ParConstIterator::ParConstIterator(ParConstIterator const & pi)
256 : pimpl_(new Pimpl(*pi.pimpl_))
260 ParConstIterator & ParConstIterator::operator++()
262 while (!pimpl_->positions.empty()) {
263 ParPosition & p = pimpl_->positions.back();
265 // Does the current inset contain more "cells" ?
268 ParagraphList * plist = (*p.it)->inset->getParagraphs(*p.index);
269 if (plist && !plist->empty()) {
270 pimpl_->positions.push_back(ParPosition(plist->begin(), *plist));
275 // The following line is needed because the value of
276 // p.it may be invalid if inset was added/removed to
277 // the paragraph pointed by the iterator
278 p.it.reset(p.pit->insetlist.begin());
280 // Try to find the next inset that contains paragraphs
281 InsetList::iterator end = p.pit->insetlist.end();
282 for (; *p.it != end; ++(*p.it)) {
283 ParagraphList * plist = (*p.it)->inset->getParagraphs(0);
284 if (plist && !plist->empty()) {
286 pimpl_->positions.push_back(ParPosition(plist->begin(), *plist));
291 // Try to go to the next paragarph
292 if (next(p.pit) != const_cast<ParagraphList*>(p.plist)->end()
293 || pimpl_->positions.size() == 1) {
301 // Drop end and move up in the stack.
302 pimpl_->positions.pop_back();
309 Paragraph const & ParConstIterator::operator*() const
311 return *pimpl_->positions.back().pit;
315 ParagraphList::const_iterator ParConstIterator::pit() const
317 return pimpl_->positions.back().pit;
321 ParagraphList::const_iterator ParConstIterator::operator->() const
323 return pimpl_->positions.back().pit;
327 ParagraphList const & ParConstIterator::plist() const
329 return *pimpl_->positions.back().plist;
333 size_t ParConstIterator::size() const
335 return pimpl_->positions.size();
339 bool operator==(ParConstIterator const & iter1, ParConstIterator const & iter2)
341 return iter1.pimpl_->positions == iter2.pimpl_->positions;
345 bool operator!=(ParConstIterator const & iter1, ParConstIterator const & iter2)
347 return !(iter1 == iter2);
351 PosIterator ParIterator::asPosIterator(lyx::pos_type pos) const
355 int const last = size() - 1;
356 for (int i = 0; i < last; ++i) {
357 ParPosition & pp = pimpl_->positions[i];
359 PosIteratorItem(const_cast<ParagraphList *>(pp.plist),
360 pp.pit, (*pp.it)->pos, *pp.index + 1));
362 ParPosition const & pp = pimpl_->positions[last];
364 PosIteratorItem(const_cast<ParagraphList *>(pp.plist), pp.pit, pos, 0));
369 ParIterator::ParIterator(PosIterator const & pos)
372 int const size = pos.stack_.size();
374 for (int i = 0; i < size; ++i) {
375 PosIteratorItem const & it = pos.stack_[i];
376 ParPosition pp(it.pit, *it.pl);
378 InsetOld * inset = it.pit->getInset(it.pos);
380 InsetList::iterator beg = it.pit->insetlist.begin();
381 InsetList::iterator end = it.pit->insetlist.end();
382 for ( ; beg != end && beg->inset != inset; ++beg)
385 pp.index.reset(it.index - 1);
387 pimpl_->positions.push_back(pp);
392 void ParIterator::lockPath(BufferView * bv) const
394 bv->cursor() = LCursor(bv);
395 int last = size() - 1;
396 #warning this seems to create just one entry for InsetTabulars
397 for (int i = 0; i < last; ++i)
398 (*pimpl_->positions[i].it)->inset->edit(bv, true);