X-Git-Url: https://git.lyx.org/gitweb/?a=blobdiff_plain;f=src%2FDocIterator.h;h=8ee4d4e373c790f50a909cdf2eca6c6d812eca3c;hb=037b1e14789223c89e88e8bd74baffa4d0956571;hp=f8e4289ab811cbcedfb27b1ba13355c73729f659;hpb=694399b16c604d172a1441639e2309baf1afb7fc;p=lyx.git diff --git a/src/DocIterator.h b/src/DocIterator.h index f8e4289ab8..8ee4d4e373 100644 --- a/src/DocIterator.h +++ b/src/DocIterator.h @@ -15,16 +15,18 @@ #include "CursorSlice.h" #include - +#include namespace lyx { class DocIterator; +class Encoding; +class FontSpan; +class InsetIterator; class LyXErr; class MathAtom; class Paragraph; class Text; -class InsetIterator; DocIterator doc_iterator_begin(Buffer const * buf, Inset const * inset = 0); DocIterator doc_iterator_end(Buffer const * buf, Inset const * inset = 0); @@ -51,6 +53,10 @@ public: /// access to owning buffer void setBuffer(Buffer * buf) { buffer_ = buf; } + /// Clone this for given \p buffer. + /// \p buffer must be a clone of buffer_. + DocIterator clone(Buffer * buffer) const; + /// access slice at position \p i CursorSlice const & operator[](size_t i) const { return slices_[i]; } /// access slice at position \p i @@ -59,15 +65,16 @@ public: void resize(size_t i) { slices_.resize(i); } /// is the iterator valid? - operator const void*() const { return empty() ? 0 : this; } - /// is this iterator invalid? - bool operator!() const { return empty(); } + explicit operator bool() const { return !empty(); } /// does this iterator have any content? bool empty() const { return slices_.empty(); } /// is this the end position? bool atEnd() const { return slices_.empty(); } + /// checks the cursor slices for disabled spell checker insets + bool allowSpellCheck() const; + // // access to slice at tip // @@ -117,6 +124,7 @@ public: /// return the last column of the top grid col_type lastcol() const { return ncols() - 1; } /// the inset just behind the cursor + /// returns 0 if there is no inset (e.g. normal text) Inset * nextInset() const; /// the inset just in front of the cursor Inset * prevInset() const; @@ -141,6 +149,10 @@ public: // /// return the mathed cell this cursor is in MathData & cell() const; + /// + InsetMath & nextMath(); + /// + InsetMath & prevMath(); /// the mathatom left of the cursor MathAtom & prevAtom() const; /// the mathatom right of the cursor @@ -157,6 +169,13 @@ public: Paragraph & innerParagraph() const; /// return the inner text slice. CursorSlice const & innerTextSlice() const; + // convert a DocIterator into an argument to LFUN_PARAGRAPH_GOTO + docstring paragraphGotoArgument() const; + /// returns a DocIterator for the containing text inset + DocIterator getInnerText() const; + /// the first and last positions of a word at top cursor slice + /// \warning only works within text! + FontSpan locateWord(word_location const loc) const; /// Text * text() const; /// the containing inset or the cell, respectively @@ -169,6 +188,10 @@ public: // // elementary moving // + /// move one step backwards + bool posBackward(); + /// move one step forward + bool posForward(); /** * move on one logical position, descend into nested insets * including collapsed insets @@ -183,7 +206,7 @@ public: void forwardChar(); /// move on one paragraph void forwardPar(); - /// move on one inset + /// move on to the next closest inset void forwardInset(); /// move backward one logical position void backwardPos(); @@ -192,7 +215,7 @@ public: /// move backward one paragraph void backwardPar(); /// move backward one inset - /// FIXME: This is not implemented! + /// not used currently, uncomment if you need it //void backwardInset(); /// are we some 'extension' (i.e. deeper nested) of the given iterator @@ -221,6 +244,13 @@ public: /// fix DocIterator in circumstances that should never happen. /// \return true if the DocIterator was fixed. bool fixIfBroken(); + /// Repopulate the slices insets from bottom to top. Useful + /// for stable iterators or Undo data. + void sanitize(); + /// + bool isInside(Inset const *) const; + /// make sure we are outside of given inset + void leaveInset(Inset const & inset); /// find index of CursorSlice with &cell() == &cell (or -1 if not found) int find(MathData const & cell) const; @@ -235,6 +265,11 @@ public: /// push one CursorSlice on top and set its index and position void append(idx_type idx, pos_type pos); + /// + docstring getPossibleLabel() const; + + /// + Encoding const * getEncoding() const; private: friend class InsetIterator; friend DocIterator doc_iterator_begin(Buffer const * buf, Inset const * inset); @@ -243,22 +278,22 @@ private: explicit DocIterator(Buffer * buf, Inset * inset); /** * Normally, when the cursor is at position i, it is painted *before* - * the character at position i. However, what if we want the cursor + * the character at position i. However, what if we want the cursor * painted *after* position i? That's what boundary_ is for: if * boundary_==true, the cursor is painted *after* position i-1, instead * of before position i. * * Note 1: Usually, after i-1 or before i are actually the same place! - * However, this is not the case when i-1 and i are not painted + * However, this is not the case when i-1 and i are not painted * contiguously, and in these cases we sometimes do want to have control * over whether to paint before i or after i-1. * Some concrete examples of where this happens: * a. i-1 at the end of one row, i at the beginning of next row * b. in bidi text, at transitions between RTL and LTR or vice versa * - * Note 2: Why i and i-1? Why, if boundary_==false means: *before* i, - * couldn't boundary_==true mean: *after* i? - * Well, the reason is this: cursor position is not used only for + * Note 2: Why i and i-1? Why, if boundary_==false means: *before* i, + * couldn't boundary_==true mean: *after* i? + * Well, the reason is this: cursor position is not used only for * painting the cursor, but it also affects other things, for example: * where the next insertion will be placed (it is inserted at the current * position, pushing anything at the current position and beyond forward). @@ -302,21 +337,21 @@ bool operator<(DocIterator const & p, DocIterator const & q) } -inline +inline bool operator>(DocIterator const & p, DocIterator const & q) { return q < p; } -inline +inline bool operator<=(DocIterator const & p, DocIterator const & q) { return !(q < p); } -inline +inline bool operator>=(DocIterator const & p, DocIterator const & q) { return !(p < q);