X-Git-Url: https://git.lyx.org/gitweb/?a=blobdiff_plain;f=src%2FInsetList.h;h=708eab86fa0377ca7bd56e6bfc10ebfb820594c3;hb=26ba2a65838731ce639a09539f617cb0f0be3b22;hp=5baa9087944364e98f0a2430dc9da0ce75acff1c;hpb=1eaa3eb913b16f4e6f5991b9c53b0b9ab3f84948;p=lyx.git

diff --git a/src/InsetList.h b/src/InsetList.h
index 5baa908794..708eab86fa 100644
--- 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,28 +12,45 @@
 #ifndef INSET_LIST_H
 #define INSET_LIST_H
 
+#include "insets/InsetCode.h"
+
 #include "support/types.h"
 
 #include <vector>
 
-class InsetBase;
-class Buffer;
 
+namespace lyx {
+
+class Inset;
+class Buffer;
 
 ///
 class InsetList {
 public:
 	///
-	struct 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:
 		///
-		lyx::pos_type pos;
+		Element(pos_type p, Inset * i) : pos(p), inset(i) {}
 		///
-		InsetBase * inset;
+		pos_type pos;
 		///
-		InsetTable(lyx::pos_type p, InsetBase * i) : pos(p), inset(i) {}
+		Inset * inset;
 	};
 	///
-	typedef std::vector<InsetTable> List;
+	typedef std::vector<Element> List;
 	///
 	typedef List::iterator iterator;
 	///
@@ -42,37 +59,53 @@ public:
 	///
 	~InsetList();
 	///
-	iterator begin() { return list.begin(); }
+	iterator begin() { return list_.begin(); }
 	///
-	iterator end() { return list.end(); }
+	iterator end() { return list_.end(); }
 	///
-	const_iterator begin() const { return list.begin(); }
+	const_iterator begin() const { return list_.begin(); }
 	///
-	const_iterator end() const { return list.end(); }
+	const_iterator end() const { return list_.end(); }
 	///
-	bool empty() const { return list.empty(); }
+	bool empty() const { return list_.empty(); }
 	///
-	iterator insetIterator(lyx::pos_type pos); 
+	iterator insetIterator(pos_type pos);
 	///
-	const_iterator insetIterator(lyx::pos_type pos) const;
+	const_iterator insetIterator(pos_type pos) const;
 	///
-	void insert(InsetBase * inset, lyx::pos_type pos);
+	void insert(Inset * inset, pos_type pos);
 	///
-	void erase(lyx::pos_type pos);
+	void erase(pos_type pos);
 	///
-	InsetBase * release(lyx::pos_type);
+	Inset * release(pos_type);
 	///
-	InsetBase * get(lyx::pos_type pos) const;
+	Inset * get(pos_type pos) const;
 	///
-	void increasePosAfterPos(lyx::pos_type pos);
+	void increasePosAfterPos(pos_type pos);
 	///
-	void decreasePosAfterPos(lyx::pos_type pos);
-	///
-	void insetsOpenCloseBranch(Buffer const & buf);
+	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;
+	List list_;
 };
 
+
+} // namespace lyx
+
 #endif