37 lines
1.0 KiB
C++
37 lines
1.0 KiB
C++
#pragma once
|
|
|
|
#include <algorithm>
|
|
#include <string>
|
|
#include <vector>
|
|
|
|
namespace util {
|
|
template<typename Iter>
|
|
inline void insertion_sort(Iter first, Iter last) {
|
|
for (Iter it = first; it != last; ++it) {
|
|
std::rotate(
|
|
std::upper_bound(first, it, *it), it, std::next(it)
|
|
);
|
|
}
|
|
}
|
|
|
|
template<typename Iter, typename Compare>
|
|
inline void insertion_sort(Iter first, Iter last, Compare compare) {
|
|
for (Iter it = first; it != last; ++it) {
|
|
std::rotate(
|
|
std::upper_bound(first, it, *it, compare), it, std::next(it)
|
|
);
|
|
}
|
|
}
|
|
|
|
template <class T>
|
|
inline bool contains(const std::vector<T>& vec, const T& value) {
|
|
return std::find(vec.begin(), vec.end(), value) != vec.end();
|
|
}
|
|
|
|
template <class T>
|
|
inline void concat(std::vector<T>& a, const std::vector<T>& b) {
|
|
a.reserve(a.size() + b.size());
|
|
a.insert(a.end(), b.begin(), b.end());
|
|
}
|
|
}
|