2000-03-09 03:36:48 +00:00
|
|
|
// -*- C++ -*-
|
|
|
|
|
|
|
|
#ifndef LYX_ALGO_H
|
|
|
|
#define LYX_ALGO_H
|
|
|
|
|
2001-04-17 14:22:53 +00:00
|
|
|
#include <utility>
|
|
|
|
|
|
|
|
namespace lyx {
|
|
|
|
|
2000-03-09 03:36:48 +00:00
|
|
|
|
|
|
|
/// Returns true if the sequence first,last is sorted, false if not.
|
|
|
|
template <class For>
|
|
|
|
bool sorted(For first, For last)
|
|
|
|
{
|
|
|
|
if (first == last) return true;
|
|
|
|
For tmp = first;
|
|
|
|
while (++tmp != last) {
|
2000-03-09 23:58:55 +00:00
|
|
|
if (*tmp < *first++) return false;
|
2000-03-09 03:36:48 +00:00
|
|
|
}
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2001-04-17 14:22:53 +00:00
|
|
|
|
2000-03-09 03:36:48 +00:00
|
|
|
/// Cmp is the same Cmp as you would pass to std::sort.
|
|
|
|
template <class For, class Cmp>
|
|
|
|
bool sorted(For first, For last, Cmp cmp)
|
|
|
|
{
|
|
|
|
if (first == last) return true;
|
|
|
|
For tmp = first;
|
|
|
|
while (++tmp != last) {
|
|
|
|
if (cmp(*tmp, *first++)) return false;
|
|
|
|
}
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2001-04-17 14:22:53 +00:00
|
|
|
|
|
|
|
struct firster {
|
|
|
|
template <class P1, class P2>
|
|
|
|
P1 operator()(std::pair<P1, P2> const & p) {
|
|
|
|
return p.first;
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
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;
|
|
|
|
}
|
|
|
|
|
|
|
|
} // end of namespace lyx
|
2000-03-09 03:36:48 +00:00
|
|
|
#endif
|