Remove non-copyable idioms

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

diff --git a/src/support/lyxalgo.h b/src/support/lyxalgo.h
index 2d8d49f06c943b3bf615987e90238e8a987803e2..d1aa023e1e918dd9ecfe2ad4799245f9070598fe 100644 (file)
--- a/src/support/lyxalgo.h
+++ b/src/support/lyxalgo.h
@@ -1,9 +1,23 @@
 // -*- C++ -*-
+/**
+ * \file lyxalgo.h
+ * This file is part of LyX, the document processor.
+ * Licence details can be found in the file COPYING.
+ *
+ * \author Lars Gullik Bjønnes
+ *
+ * Full author contact details are available in file CREDITS.
+ *
+ * A variety of useful templates.
+ */
 
 #ifndef LYX_ALGO_H
 #define LYX_ALGO_H
 
 #include <utility>
+#include <iterator>
+#include <algorithm>
+
 
 namespace lyx {
 
@@ -42,9 +56,13 @@ struct firster {
 };
 
 
+/**
+ * copy elements in the given range to the output iterator
+ * if the predicate evaluates as true
+ */
 template <class InputIter, class OutputIter, class Func>
 OutputIter copy_if(InputIter first, InputIter last,
-              OutputIter result, Func func) 
+              OutputIter result, Func func)
 {
        for (; first != last; ++first) {
                if (func(*first)) {
@@ -54,5 +72,23 @@ OutputIter copy_if(InputIter first, InputIter last,
        return result;
 }
 
-}  // end of namespace lyx
-#endif
+
+/// Remove all duplicate entries in c.
+template<class C>
+void eliminate_duplicates(C & c)
+{
+       // It is a requirement that the container is sorted for
+       // std::unique to work properly.
+       std::sort(c.begin(), c.end());
+       c.erase(std::unique(c.begin(), c.end()), c.end());
+}
+
+
+using std::next;
+
+
+using std::prev;
+
+} // namespace lyx
+
+#endif // LYX_ALGO_H