// -*- 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
#define LYX_ALGO_H
#include <iterator>
#include <algorithm>
+
namespace lyx {
/**
- * 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>
}
-/// A slot in replacement for std::count for systems where it is broken.
-template <class Iterator, class T>
-typename std::iterator_traits<Iterator>::difference_type
-count (Iterator first, Iterator last, T const & value)
+/// Remove all duplicate entries in c.
+template<class C>
+void eliminate_duplicates(C & c)
{
-#ifdef HAVE_STD_COUNT
- return std::count(first, last, value);
-#else
- std::iterator_traits<Iterator>::difference_type n = 0;
- while (first != last)
- if (*first++ == value) ++n;
- return n;
-#endif
+ // 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