mirror of
https://github.com/LizardByte/Sunshine.git
synced 2024-11-18 02:09:49 +00:00
157 lines
2.9 KiB
C++
157 lines
2.9 KiB
C++
#ifndef KITTY_UTIL_ITERATOR_H
|
|
#define KITTY_UTIL_ITERATOR_H
|
|
|
|
#include <iterator>
|
|
|
|
namespace util {
|
|
template<class V, class T>
|
|
class it_wrap_t : public std::iterator<std::random_access_iterator_tag, V> {
|
|
public:
|
|
typedef T iterator;
|
|
typedef typename std::iterator<std::random_access_iterator_tag, V>::value_type class_t;
|
|
|
|
typedef class_t &reference;
|
|
typedef class_t *pointer;
|
|
|
|
typedef std::ptrdiff_t diff_t;
|
|
|
|
iterator operator+=(diff_t step) {
|
|
while(step-- > 0) {
|
|
++_this();
|
|
}
|
|
|
|
return _this();
|
|
}
|
|
|
|
iterator operator-=(diff_t step) {
|
|
while(step-- > 0) {
|
|
--_this();
|
|
}
|
|
|
|
return _this();
|
|
}
|
|
|
|
iterator operator+(diff_t step) {
|
|
iterator new_ = _this();
|
|
|
|
return new_ += step;
|
|
}
|
|
|
|
iterator operator-(diff_t step) {
|
|
iterator new_ = _this();
|
|
|
|
return new_ -= step;
|
|
}
|
|
|
|
diff_t operator-(iterator first) {
|
|
diff_t step = 0;
|
|
while(first != _this()) {
|
|
++step;
|
|
++first;
|
|
}
|
|
|
|
return step;
|
|
}
|
|
|
|
iterator operator++() {
|
|
_this().inc();
|
|
return _this();
|
|
}
|
|
iterator operator--() {
|
|
_this().dec();
|
|
return _this();
|
|
}
|
|
|
|
iterator operator++(int) {
|
|
iterator new_ = _this();
|
|
|
|
++_this();
|
|
|
|
return new_;
|
|
}
|
|
|
|
iterator operator--(int) {
|
|
iterator new_ = _this();
|
|
|
|
--_this();
|
|
|
|
return new_;
|
|
}
|
|
|
|
reference operator*() { return *_this().get(); }
|
|
const reference operator*() const { return *_this().get(); }
|
|
|
|
pointer operator->() { return &*_this(); }
|
|
const pointer operator->() const { return &*_this(); }
|
|
|
|
bool operator!=(const iterator &other) const {
|
|
return !(_this() == other);
|
|
}
|
|
|
|
bool operator<(const iterator &other) const {
|
|
return !(_this() >= other);
|
|
}
|
|
|
|
bool operator>=(const iterator &other) const {
|
|
return _this() == other || _this() > other;
|
|
}
|
|
|
|
bool operator<=(const iterator &other) const {
|
|
return _this() == other || _this() < other;
|
|
}
|
|
|
|
bool operator==(const iterator &other) const { return _this().eq(other); };
|
|
bool operator>(const iterator &other) const { return _this().gt(other); }
|
|
|
|
private:
|
|
iterator &_this() { return *static_cast<iterator *>(this); }
|
|
const iterator &_this() const { return *static_cast<const iterator *>(this); }
|
|
};
|
|
|
|
template<class V, class It>
|
|
class round_robin_t : public it_wrap_t<V, round_robin_t<V, It>> {
|
|
public:
|
|
using iterator = It;
|
|
using pointer = V *;
|
|
|
|
round_robin_t(iterator begin, iterator end) : _begin(begin), _end(end), _pos(begin) {}
|
|
|
|
void inc() {
|
|
++_pos;
|
|
|
|
if(_pos == _end) {
|
|
_pos = _begin;
|
|
}
|
|
}
|
|
|
|
void dec() {
|
|
if(_pos == _begin) {
|
|
_pos = _end;
|
|
}
|
|
|
|
--_pos;
|
|
}
|
|
|
|
bool eq(const round_robin_t &other) const {
|
|
return *_pos == *other._pos;
|
|
}
|
|
|
|
pointer get() const {
|
|
return &*_pos;
|
|
}
|
|
|
|
private:
|
|
It _begin;
|
|
It _end;
|
|
|
|
It _pos;
|
|
};
|
|
|
|
template<class V, class It>
|
|
round_robin_t<V, It> make_round_robin(It begin, It end) {
|
|
return round_robin_t<V, It>(begin, end);
|
|
}
|
|
} // namespace util
|
|
|
|
#endif
|