split LyXText::rowlist_ into individual Paragraph::rows_ chunks

[lyx.git] / src / support / lyxalgo.h

diff --git a/src/support/lyxalgo.h b/src/support/lyxalgo.h
index 60aaff7b2b6ddfda9a790e63393cf9265b4b8f02..6bccfb12966bd75906e70470d093882dd2d9965d 100644 (file)
--- a/src/support/lyxalgo.h
+++ b/src/support/lyxalgo.h
@@ -1,12 +1,14 @@
 // -*- C++ -*-
 /**
  * \file lyxalgo.h
- * Copyright 1995-2002 the LyX Team
- * Read the file COPYING
+ * This file is part of LyX, the document processor.
+ * Licence details can be found in the file COPYING.
  *
- * A variety of useful templates.
+ * \author Lars Gullik Bjønnes
+ *
+ * Full author contact details are available in file CREDITS
  *
- * \author unknown
+ * A variety of useful templates.
  */
 
 #ifndef LYX_ALGO_H
@@ -15,6 +17,8 @@
 #include <utility>
 #include <iterator>
 #include <algorithm>
+#include <set>
+
 
 namespace lyx {
 
@@ -54,7 +58,7 @@ struct firster {
 
 
 /**
- * copy elements in the given range to the output iterator 
+ * copy elements in the given range to the output iterator
  * if the predicate evaluates as true
  */
 template <class InputIter, class OutputIter, class Func>
@@ -89,9 +93,16 @@ count (Iterator first, Iterator last, T const & value)
 template<class C>
 void eliminate_duplicates(C & c)
 {
-       std::sort(c.begin(), c.end());
-       typename C::iterator p = std::unique(c.begin(), c.end());
-       c.erase(p, c.end());
+       C unique_c;
+       std::set<typename C::value_type> s;
+
+       for (typename C::iterator p = c.begin(); p != c.end(); ++p) {
+               if (s.find(*p) == s.end()) {
+                       unique_c.push_back(*p);
+                       s.insert(*p);
+               }
+       }
+       swap(c, unique_c);
 }
 
 } // namespace lyx