src/DocIterator.h

   1 // -*- C++ -*-
   2 /**
   3  * \file DocIterator.h
   4  * This file is part of LyX, the document processor.
   5  * Licence details can be found in the file COPYING.
   6  *
   7  * \author André Pönitz
   8  *
   9  * Full author contact details are available in file CREDITS.
  10  */
  11
  12 #ifndef DOCITERATOR_H
  13 #define DOCITERATOR_H
  14
  15 #include "CursorSlice.h"
  16
  17 #include <vector>
  18 #include <iosfwd>
  19
  20
  21 namespace lyx {
  22
  23 class Text;
  24 class MathAtom;
  25 class Paragraph;
  26
  27
  28 // only needed for gcc 2.95, remove when support terminated
  29 template <typename A, typename B>
  30 bool ptr_cmp(A const * a, B const * b)
  31 {
  32         return a == b;
  33 }
  34
  35
  36 // The public inheritance should go in favour of a suitable data member
  37 // (or maybe private inheritance) at some point of time.
  38 class DocIterator // : public std::vector<CursorSlice>
  39 {
  40 public:
  41         /// type for cell number in inset
  42         typedef CursorSlice::idx_type idx_type;
  43         /// type for row indices
  44         typedef CursorSlice::row_type row_type;
  45         /// type for col indices
  46         typedef CursorSlice::col_type col_type;
  47
  48 public:
  49         ///
  50         DocIterator();
  51         ///
  52         explicit DocIterator(Inset & inset);
  53
  54         /// access slice at position \p i
  55         CursorSlice const & operator[](size_t i) const { return slices_[i]; }
  56         /// access slice at position \p i
  57         CursorSlice & operator[](size_t i) { return slices_[i]; }
  58         /// chop a few slices from the iterator
  59         void resize(size_t i) { slices_.resize(i); }
  60
  61         /// is the iterator valid?
  62         operator const void*() const { return empty() ? 0 : this; }
  63         /// is this iterator invalid?
  64         bool operator!() const { return empty(); }
  65
  66         /// does this iterator have any content?
  67         bool empty() const { return slices_.empty(); }
  68
  69         //
  70         // access to slice at tip
  71         //
  72         /// access to tip
  73         CursorSlice & top() { return slices_.back(); }
  74         /// access to tip
  75         CursorSlice const & top() const { return slices_.back(); }
  76         /// access to outermost slice
  77         CursorSlice & bottom() { return slices_.front(); }
  78         /// access to outermost slice
  79         CursorSlice const & bottom() const { return slices_.front(); }
  80         /// how many nested insets do we have?
  81         size_t depth() const { return slices_.size(); }
  82         /// the containing inset
  83         Inset & inset() const { return top().inset(); }
  84         /// return the cell of the inset this cursor is in
  85         idx_type idx() const { return top().idx(); }
  86         /// return the cell of the inset this cursor is in
  87         idx_type & idx() { return top().idx(); }
  88         /// return the last possible cell in this inset
  89         idx_type lastidx() const;
  90         /// return the paragraph this cursor is in
  91         pit_type pit() const { return top().pit(); }
  92         /// return the paragraph this cursor is in
  93         pit_type & pit() { return top().pit(); }
  94         /// return the last possible paragraph in this inset
  95         pit_type lastpit() const;
  96         /// return the position within the paragraph
  97         pos_type pos() const { return top().pos(); }
  98         /// return the position within the paragraph
  99         pos_type & pos() { return top().pos(); }
 100         /// return the last position within the paragraph
 101         pos_type lastpos() const;
 102
 103         /// return the number of embedded cells
 104         size_t nargs() const;
 105         /// return the number of embedded cells
 106         size_t ncols() const;
 107         /// return the number of embedded cells
 108         size_t nrows() const;
 109         /// return the grid row of the top cell
 110         row_type row() const;
 111         /// return the last row of the top grid
 112         row_type lastrow() const { return nrows() - 1; }
 113         /// return the grid column of the top cell
 114         col_type col() const;
 115         /// return the last column of the top grid
 116         col_type lastcol() const { return ncols() - 1; }
 117         /// the inset just behind the cursor
 118         Inset * nextInset();
 119         /// the inset just in front of the cursor
 120         Inset * prevInset();
 121         /// the inset just in front of the cursor
 122         Inset const * prevInset() const;
 123         ///
 124         bool boundary() const { return boundary_; }
 125         ///
 126         void boundary(bool b) { boundary_ = b; }
 127
 128         // the two methods below have been inlined out because of
 129         // profiling results under linux when opening a document.
 130         /// are we in mathed?.
 131         bool inMathed() const
 132         { return !empty() && inset().inMathed(); }
 133         /// are we in texted?.
 134         bool inTexted() const
 135         { return !empty() && !inset().inMathed(); }
 136
 137         //
 138         // math-specific part
 139         //
 140         /// return the mathed cell this cursor is in
 141         MathData const & cell() const;
 142         /// return the mathed cell this cursor is in
 143         MathData & cell();
 144         /// the mathatom left of the cursor
 145         MathAtom const & prevAtom() const;
 146         /// the mathatom left of the cursor
 147         MathAtom & prevAtom();
 148         /// the mathatom right of the cursor
 149         MathAtom const & nextAtom() const;
 150         /// the mathatom right of the cursor
 151         MathAtom & nextAtom();
 152
 153         //
 154         // text-specific part
 155         //
 156         /// the paragraph we're in
 157         Paragraph & paragraph();
 158         /// the paragraph we're in in text mode.
 159         /// \warning only works within text!
 160         Paragraph const & paragraph() const;
 161         /// the paragraph we're in in any case.
 162         /// This method will give the containing paragraph if
 163         /// in not in text mode (ex: in mathed).
 164         Paragraph const & innerParagraph() const;
 165         ///
 166         Text * text();
 167         ///
 168         Text const * text() const;
 169         /// the containing inset or the cell, respectively
 170         Inset * realInset() const;
 171         ///
 172         Inset * innerInsetOfType(int code) const;
 173         ///
 174         Text * innerText();
 175         ///
 176         Text const * innerText() const;
 177
 178         //
 179         // elementary moving
 180         //
 181         /// move on one logical position, do not descend into nested insets
 182         void forwardPosNoDescend();
 183         /**
 184          * move on one logical position, descend into nested insets
 185          * skip collapsed insets if \p ignorecollapsed is true
 186          */
 187         void forwardPos(bool ignorecollapsed = false);
 188         /// move on one physical character or inset
 189         void forwardChar();
 190         /// move on one paragraph
 191         void forwardPar();
 192         /// move on one cell
 193         void forwardIdx();
 194         /// move on one inset
 195         void forwardInset();
 196         /// move backward one logical position
 197         void backwardPos();
 198         /// move backward one physical character or inset
 199         void backwardChar();
 200         /// move backward one paragraph
 201         void backwardPar();
 202         /// move backward one cell
 203         void backwardIdx();
 204         /// move backward one inset
 205         /// FIXME: This is not implemented!
 206         //void backwardInset();
 207
 208         /// are we some 'extension' (i.e. deeper nested) of the given iterator
 209         bool hasPart(DocIterator const & it) const;
 210
 211         /// output
 212         friend std::ostream &
 213         operator<<(std::ostream & os, DocIterator const & cur);
 214         ///
 215         friend bool operator==(DocIterator const &, DocIterator const &);
 216         friend bool operator<(DocIterator const &, DocIterator const &);
 217         friend bool operator>(DocIterator const &, DocIterator const &);
 218         friend bool operator<=(DocIterator const &, DocIterator const &);
 219         ///
 220         friend class StableDocIterator;
 221 //protected:
 222         ///
 223         void clear() { slices_.clear(); }
 224         ///
 225         void push_back(CursorSlice const & sl) { slices_.push_back(sl); }
 226         ///
 227         void pop_back() { slices_.pop_back(); }
 228         /// recompute the inset parts of the cursor from the document data
 229         void updateInsets(Inset * inset);
 230         /// fix DocIterator in circumstances that should never happen.
 231         /// \return true if the DocIterator was fixed.
 232         bool fixIfBroken();
 233
 234 private:
 235         /**
 236          * When the cursor position is i, is the cursor after the i-th char
 237          * or before the i+1-th char ? Normally, these two interpretations are
 238          * equivalent, except when the fonts of the i-th and i+1-th char
 239          * differ.
 240          * We use boundary_ to distinguish between the two options:
 241          * If boundary_=true, then the cursor is after the i-th char
 242          * and if boundary_=false, then the cursor is before the i+1-th char.
 243          *
 244          * We currently use the boundary only when the language direction of
 245          * the i-th char is different than the one of the i+1-th char.
 246          * In this case it is important to distinguish between the two
 247          * cursor interpretations, in order to give a reasonable behavior to
 248          * the user.
 249          */
 250         bool boundary_;
 251         ///
 252         std::vector<CursorSlice> const & internalData() const {
 253                 return slices_;
 254         }
 255         ///
 256         std::vector<CursorSlice> slices_;
 257         ///
 258         Inset * inset_;
 259 };
 260
 261
 262 DocIterator doc_iterator_begin(Inset & inset);
 263 DocIterator doc_iterator_end(Inset & inset);
 264
 265
 266 inline
 267 bool operator==(DocIterator const & di1, DocIterator const & di2)
 268 {
 269         return di1.slices_ == di2.slices_;
 270 }
 271
 272
 273 inline
 274 bool operator!=(DocIterator const & di1, DocIterator const & di2)
 275 {
 276         return !(di1 == di2);
 277 }
 278
 279
 280 // The difference to a ('non stable') DocIterator is the removed
 281 // (overwritten by 0...) part of the CursorSlice data items. So this thing
 282 // is suitable for external storage, but not for iteration as such.
 283
 284 class StableDocIterator {
 285 public:
 286         ///
 287         StableDocIterator() {}
 288         /// non-explicit intended
 289         StableDocIterator(const DocIterator & it);
 290         ///
 291         DocIterator asDocIterator(Inset * start) const;
 292         ///
 293         size_t size() const { return data_.size(); }
 294         ///  return the position within the paragraph
 295         pos_type pos() const { return data_.back().pos(); }
 296         ///  return the position within the paragraph
 297         pos_type & pos() { return data_.back().pos(); }
 298         ///
 299         friend std::ostream &
 300         operator<<(std::ostream & os, StableDocIterator const & cur);
 301         ///
 302         friend std::istream &
 303         operator>>(std::istream & is, StableDocIterator & cur);
 304         ///
 305         friend bool
 306         operator==(StableDocIterator const &, StableDocIterator const &);
 307 private:
 308         std::vector<CursorSlice> data_;
 309 };
 310
 311
 312 } // namespace lyx
 313
 314 #endif