// -*- 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>
+#include <set>
+
namespace lyx {
};
+/**
+ * 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)) {
count (Iterator first, Iterator last, T const & value)
{
#ifdef HAVE_STD_COUNT
- return std::count(first, last, value);
+ return std::count(first, last, value);
#else
- std::iterator_traits<Iterator>::difference_type n = 0;
- while (first != last)
+ 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)
+{
+ 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
-#endif
+#endif // LYX_ALGO_H