Let paragraph::requestSpellcheck() consider contained insets

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

diff --git a/src/support/lyxalgo.h b/src/support/lyxalgo.h
index 410bf7593351c3cb6fb5df8d8c96e2811491df53..8777a03e41d989160f3915304e759810316a9fa4 100644 (file)
--- a/src/support/lyxalgo.h
+++ b/src/support/lyxalgo.h
@@ -14,11 +14,6 @@
 #ifndef LYX_ALGO_H
 #define LYX_ALGO_H
 
-#include <utility>
-#include <iterator>
-#include <algorithm>
-
-
 namespace lyx {
 
 
@@ -48,67 +43,6 @@ bool sorted(For first, For last, Cmp cmp)
 }
 
 
-struct firster {
-       template <class P1, class P2>
-       P1 operator()(std::pair<P1, P2> const & p) {
-               return p.first;
-       }
-};
-
-
-/**
- * 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)
-{
-       for (; first != last; ++first) {
-               if (func(*first)) {
-                       *result++ = *first;
-               }
-       }
-       return result;
-}
-
-
-/// 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());
-}
-
-
-#if __cplusplus >= 201103L
-using std::next;
-#else
-/// Replacement of std::next for older compilers
-template <typename It, typename Diff>
-inline It next(It i, Diff n = 1)
-{
-       std::advance(i, n);
-       return i;
-}
-#endif
-
-
-#if __cplusplus >= 201103L
-using std::prev;
-#else
-/// Replacement of std::prev for older compilers
-template <typename It, typename Diff>
-inline It prev(It i, Diff n = 1)
-{
-       std::advance(i, -n);
-       return i;
-}
-#endif
-
 } // namespace lyx
 
 #endif // LYX_ALGO_H