* src/support/lyxalgo.h

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

diff --git a/src/support/lyxalgo.h b/src/support/lyxalgo.h
index 323f8e32f16a8b1269f00a817a53a72e52704b7a..19c2485a34241b9cf5ee51c69d92360b2a0e24d7 100644 (file)
--- a/src/support/lyxalgo.h
+++ b/src/support/lyxalgo.h
@@ -1,4 +1,15 @@
 // -*- 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
@@ -7,6 +18,7 @@
 #include <iterator>
 #include <algorithm>
 
+
 namespace lyx {
 
 
@@ -44,6 +56,10 @@ 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)
@@ -65,13 +81,23 @@ count (Iterator first, Iterator last, T const & value)
 #ifdef HAVE_STD_COUNT
        return std::count(first, last, value);
 #else
-       std::iterator_traits<Iterator>::difference_type n = 0;
+       typename std::iterator_traits<Iterator>::difference_type n = 0;
        while (first != last)
                if (*first++ == value) ++n;
        return n;
 #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());
+}
+
 } // namespace lyx
 
-#endif
+#endif // LYX_ALGO_H