ctests: categorize #12708 test file as resolved

[lyx.git] / src / InsetList.h

diff --git a/src/InsetList.h b/src/InsetList.h
index 3e287ad1c73c496a4461a9526b176cd3df817fd2..708eab86fa0377ca7bd56e6bfc10ebfb820594c3 100644 (file)
--- a/src/InsetList.h
+++ b/src/InsetList.h
@@ -4,7 +4,7 @@
  * This file is part of LyX, the document processor.
  * Licence details can be found in the file COPYING.
  *
- * \author Lars Gullik Bjønnes
+ * \author Lars Gullik Bjønnes
  *
  * Full author contact details are available in file CREDITS.
  */
@@ -12,6 +12,8 @@
 #ifndef INSET_LIST_H
 #define INSET_LIST_H
 
+#include "insets/InsetCode.h"
+
 #include "support/types.h"
 
 #include <vector>
@@ -19,25 +21,36 @@
 
 namespace lyx {
 
-class InsetBase;
+class Inset;
 class Buffer;
 
-
 ///
 class InsetList {
 public:
        ///
-       class InsetTable {
+       InsetList() {}
+       ///
+       InsetList(InsetList const &);
+       /// Partial copy constructor.
+       /// Copy the InsetList contents from \p beg to \p end (without end).
+       InsetList(InsetList const &, pos_type beg, pos_type end);
+       ///
+       void setBuffer(Buffer &);
+       ///
+       void resetBuffer();
+
+       ///
+       class Element {
        public:
                ///
-               InsetTable(pos_type p, InsetBase * i) : pos(p), inset(i) {}
+               Element(pos_type p, Inset * i) : pos(p), inset(i) {}
                ///
                pos_type pos;
                ///
-               InsetBase * inset;
+               Inset * inset;
        };
        ///
-       typedef std::vector<InsetTable> List;
+       typedef std::vector<Element> List;
        ///
        typedef List::iterator iterator;
        ///
@@ -60,18 +73,33 @@ public:
        ///
        const_iterator insetIterator(pos_type pos) const;
        ///
-       void insert(InsetBase * inset, pos_type pos);
+       void insert(Inset * inset, pos_type pos);
        ///
        void erase(pos_type pos);
        ///
-       InsetBase * release(pos_type);
+       Inset * release(pos_type);
        ///
-       InsetBase * get(pos_type pos) const;
+       Inset * get(pos_type pos) const;
        ///
        void increasePosAfterPos(pos_type pos);
        ///
        void decreasePosAfterPos(pos_type pos);
 
+       /// search for next occurence of an \c Inset type.
+       /// \return the position of the found inset.
+       /// \retval -1 if no \c Inset is found.
+       pos_type find(
+               InsetCode code, ///< Code of inset to find.
+               pos_type startpos = 0 ///< start position for the search.
+               ) const;
+
+       /// count occurrences of an \c Inset type.
+       /// \return the number of found inset(s).
+       int count(
+               InsetCode code, ///< Code of inset type to count.
+               pos_type startpos = 0 ///< start position for the counting.
+               ) const;
+
 private:
        ///
        List list_;