X-Git-Url: https://git.lyx.org/gitweb/?a=blobdiff_plain;f=src%2FInsetList.cpp;h=f5f8cf27029f252c770d4db5113fe1d2dc8e51a2;hb=c5301a6495b108df5b307da39dad5be65926f76b;hp=088d3aa2d8c077f282fb4ac641bad97211f20064;hpb=b1e077a7d25fa156f7070a9b84e7dd9303fc7411;p=lyx.git

diff --git a/src/InsetList.cpp b/src/InsetList.cpp
index 088d3aa2d8..f5f8cf2702 100644
--- a/src/InsetList.cpp
+++ b/src/InsetList.cpp
@@ -3,25 +3,22 @@
  * 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
  * \author Martin Vermeer
  *
  * Full author contact details are available in file CREDITS.
  */
 
 #include <config.h>
-#include <algorithm>
 
 #include "InsetList.h"
 
-#include "Buffer.h"
-#include "BufferParams.h"
-#include "BranchList.h"
-
-#include "insets/InsetBranch.h"
+#include "insets/Inset.h"
 
 #include "support/debug.h"
 
+#include <algorithm>
+
 using namespace std;
 
 namespace lyx {
@@ -29,9 +26,9 @@ namespace lyx {
 
 namespace {
 
-typedef InsetList::InsetTable Table;
+typedef InsetList::Element Table;
 
-struct InsetTablePosLess
+struct ElementPosLess
 {
 	bool operator()(Table const & t1, Table const & t2) const
 	{
@@ -39,12 +36,11 @@ struct InsetTablePosLess
 	}
 };
 
-} // namespace anon
+} // namespace
 
 
-InsetList::InsetList(InsetList const & il)
+InsetList::InsetList(InsetList const & il) : list_(il.list_)
 {
-	list_ = il.list_;
 	List::iterator it = list_.begin();
 	List::iterator end = list_.end();
 	for (; it != end; ++it)
@@ -52,6 +48,21 @@ InsetList::InsetList(InsetList const & il)
 }
 
 
+InsetList::InsetList(InsetList const & il, pos_type beg, pos_type end)
+{
+	InsetList::const_iterator cit = il.begin();
+	InsetList::const_iterator cend = il.end();
+	for (; cit != cend; ++cit) {
+		if (cit->pos < beg)
+			continue;
+		if (cit->pos >= end)
+			break;
+		// Add a new entry in the insetlist_.
+		insert(cit->inset->clone(), cit->pos - beg);
+	}
+}
+
+
 InsetList::~InsetList()
 {
 	List::iterator it = list_.begin();
@@ -61,19 +72,37 @@ InsetList::~InsetList()
 }
 
 
+void InsetList::setBuffer(Buffer & b)
+{
+	List::iterator it = list_.begin();
+	List::iterator end = list_.end();
+	for (; it != end; ++it)
+		it->inset->setBuffer(b);
+}
+
+
+void InsetList::resetBuffer()
+{
+	List::iterator it = list_.begin();
+	List::iterator end = list_.end();
+	for (; it != end; ++it)
+		it->inset->resetBuffer();
+}
+
+
 InsetList::iterator InsetList::insetIterator(pos_type pos)
 {
-	InsetTable search_elem(pos, 0);
+	Element search_elem(pos, 0);
 	return lower_bound(list_.begin(), list_.end(), search_elem,
-			   InsetTablePosLess());
+			   ElementPosLess());
 }
 
 
 InsetList::const_iterator InsetList::insetIterator(pos_type pos) const
 {
-	InsetTable search_elem(pos, 0);
+	Element search_elem(pos, 0);
 	return lower_bound(list_.begin(), list_.end(), search_elem,
-			   InsetTablePosLess());
+			   ElementPosLess());
 }
 
 
@@ -85,7 +114,7 @@ void InsetList::insert(Inset * inset, pos_type pos)
 		LYXERR0("ERROR (InsetList::insert): "
 		       << "There is an inset in position: " << pos);
 	} else {
-		list_.insert(it, InsetTable(pos, inset));
+		list_.insert(it, Element(pos, inset));
 	}
 }