| FazBrowse GitHub Viewer | Trending | | Home |
| Tools: [Download Repo ZIP] [Original HTTPS Page] |
1 parent 5411558 commit a47d992
2 files changed
| Original file line number | Diff line number | Diff line change | |
|---|---|---|---|
@@ -1,6 +1,7 @@ | |||
| 1 | 1 | #ifndef UTIL_LANG_RANGE_HPP | |
| 2 | 2 | #define UTIL_LANG_RANGE_HPP | |
| 3 | 3 | ||
| 4 | + #include <cmath> | ||
| 4 | 5 | #include <iterator> | |
| 5 | 6 | #include <type_traits> | |
| 6 | 7 | ||
@@ -42,120 +43,133 @@ struct range_iter_base : std::iterator<std::input_iterator_tag, T> { | |||
| 42 | 43 | } // namespace detail | |
| 43 | 44 | ||
| 44 | 45 | template <typename T> | |
| 45 | - struct range_proxy { | ||
| 46 | + struct step_range_proxy { | ||
| 46 | 47 | struct iterator : detail::range_iter_base<T> { | |
| 47 | - iterator(T current) : detail::range_iter_base<T>(current) { } | ||
| 48 | - }; | ||
| 48 | + iterator(T current, T step) | ||
| 49 | + : detail::range_iter_base<T>(current), step_(step) { } | ||
| 49 | 50 | ||
| 50 | - struct step_range_proxy { | ||
| 51 | - struct iter : detail::range_iter_base<T> { | ||
| 52 | - iter(T current, T step) | ||
| 53 | - : detail::range_iter_base<T>(current), step(step) { } | ||
| 51 | + using detail::range_iter_base<T>::current; | ||
| 54 | 52 | ||
| 55 | - using detail::range_iter_base<T>::current; | ||
| 53 | + iterator& operator ++() { | ||
| 54 | + current += step_; | ||
| 55 | + return *this; | ||
| 56 | + } | ||
| 56 | 57 | ||
| 57 | - iter& operator ++() { | ||
| 58 | - current += step; | ||
| 59 | - return *this; | ||
| 60 | - } | ||
| 58 | + iterator operator ++(int) { | ||
| 59 | + auto copy = *this; | ||
| 60 | + ++*this; | ||
| 61 | + return copy; | ||
| 62 | + } | ||
| 61 | 63 | ||
| 62 | - iter operator ++(int) { | ||
| 63 | - auto copy = *this; | ||
| 64 | - ++*this; | ||
| 65 | - return copy; | ||
| 66 | - } | ||
| 64 | + // Loses commutativity. Iterator-based ranges are simply broken. :-( | ||
| 65 | + bool operator ==(iterator const& other) const { | ||
| 66 | + return step_ > 0 ? current >= other.current | ||
| 67 | + : current < other.current; | ||
| 68 | + } | ||
| 67 | 69 | ||
| 68 | - // Loses commutativity. Iterator-based ranges are simply broken. :-( | ||
| 69 | - bool operator ==(iter const& other) const { | ||
| 70 | - return step > 0 ? current >= other.current | ||
| 71 | - : current < other.current; | ||
| 72 | - } | ||
| 70 | + bool operator !=(iterator const& other) const { | ||
| 71 | + return not (*this == other); | ||
| 72 | + } | ||
| 73 | 73 | ||
| 74 | - bool operator !=(iter const& other) const { | ||
| 75 | - return not (*this == other); | ||
| 76 | - } | ||
| 74 | + T step_; | ||
| 75 | + }; | ||
| 77 | 76 | ||
| 78 | - private: | ||
| 79 | - T step; | ||
| 80 | - }; | ||
| 77 | + step_range_proxy(T begin, T end, T step) | ||
| 78 | + : begin_(begin, step), end_(end, step) { } | ||
| 81 | 79 | ||
| 82 | - step_range_proxy(T begin, T end, T step) | ||
| 83 | - : begin_(begin, step), end_(end, step) { } | ||
| 80 | + iterator begin() const { return begin_; } | ||
| 84 | 81 | ||
| 85 | - iter begin() const { return begin_; } | ||
| 82 | + iterator end() const { return end_; } | ||
| 86 | 83 | ||
| 87 | - iter end() const { return end_; } | ||
| 84 | + std::size_t size() const { | ||
| 85 | + if (*end_ >= *begin_) { | ||
| 86 | + // Increasing and empty range | ||
| 87 | + if (begin_.step_ < T{0}) return 0; | ||
| 88 | + } else { | ||
| 89 | + // Decreasing range | ||
| 90 | + if (begin_.step_ > T{0}) return 0; | ||
| 91 | + } | ||
| 92 | + return std::ceil(std::abs(static_cast<double>(*end_ - *begin_) / begin_.step_)); | ||
| 93 | + } | ||
| 88 | 94 | ||
| 89 | - private: | ||
| 90 | - iter begin_; | ||
| 91 | - iter end_; | ||
| 95 | + private: | ||
| 96 | + iterator begin_; | ||
| 97 | + iterator end_; | ||
| 98 | + }; | ||
| 99 | + | ||
| 100 | + template <typename T> | ||
| 101 | + struct range_proxy { | ||
| 102 | + struct iterator : detail::range_iter_base<T> { | ||
| 103 | + iterator(T current) : detail::range_iter_base<T>(current) { } | ||
| 92 | 104 | }; | |
| 93 | 105 | ||
| 94 | 106 | range_proxy(T begin, T end) : begin_(begin), end_(end) { } | |
| 95 | 107 | ||
| 96 | - step_range_proxy step(T step) { | ||
| 108 | + step_range_proxy<T> step(T step) { | ||
| 97 | 109 | return {*begin_, *end_, step}; | |
| 98 | 110 | } | |
| 99 | 111 | ||
| 100 | 112 | iterator begin() const { return begin_; } | |
| 101 | - | ||
| 102 | 113 | iterator end() const { return end_; } | |
| 103 | 114 | ||
| 115 | + std::size_t size() const { return *end_ - *begin_; } | ||
| 116 | + | ||
| 104 | 117 | private: | |
| 105 | 118 | iterator begin_; | |
| 106 | 119 | iterator end_; | |
| 107 | 120 | }; | |
| 108 | 121 | ||
| 109 | 122 | template <typename T> | |
| 110 | - struct infinite_range_proxy { | ||
| 123 | + struct step_inf_range_proxy { | ||
| 111 | 124 | struct iterator : detail::range_iter_base<T> { | |
| 112 | - iterator(T current = T()) : detail::range_iter_base<T>(current) { } | ||
| 125 | + iterator(T current = T(), T step = T()) | ||
| 126 | + : detail::range_iter_base<T>(current), step(step) { } | ||
| 113 | 127 | ||
| 114 | - bool operator ==(iterator const&) const { return false; } | ||
| 128 | + using detail::range_iter_base<T>::current; | ||
| 115 | 129 | ||
| 116 | - bool operator !=(iterator const&) const { return true; } | ||
| 117 | - }; | ||
| 130 | + iterator& operator ++() { | ||
| 131 | + current += step; | ||
| 132 | + return *this; | ||
| 133 | + } | ||
| 118 | 134 | ||
| 119 | - struct step_range_proxy { | ||
| 120 | - struct iter : detail::range_iter_base<T> { | ||
| 121 | - iter(T current = T(), T step = T()) | ||
| 122 | - : detail::range_iter_base<T>(current), step(step) { } | ||
| 135 | + iterator operator ++(int) { | ||
| 136 | + auto copy = *this; | ||
| 137 | + ++*this; | ||
| 138 | + return copy; | ||
| 139 | + } | ||
| 123 | 140 | ||
| 124 | - using detail::range_iter_base<T>::current; | ||
| 141 | + bool operator ==(iterator const&) const { return false; } | ||
| 125 | 142 | ||
| 126 | - iter& operator ++() { | ||
| 127 | - current += step; | ||
| 128 | - return *this; | ||
| 129 | - } | ||
| 143 | + bool operator !=(iterator const&) const { return true; } | ||
| 130 | 144 | ||
| 131 | - iter operator ++(int) { | ||
| 132 | - auto copy = *this; | ||
| 133 | - ++*this; | ||
| 134 | - return copy; | ||
| 135 | - } | ||
| 145 | + private: | ||
| 146 | + T step; | ||
| 147 | + }; | ||
| 136 | 148 | ||
| 137 | - bool operator ==(iter const&) const { return false; } | ||
| 149 | + step_inf_range_proxy(T begin, T step) : begin_(begin, step) { } | ||
| 138 | 150 | ||
| 139 | - bool operator !=(iter const&) const { return true; } | ||
| 151 | + iterator begin() const { return begin_; } | ||
| 140 | 152 | ||
| 141 | - private: | ||
| 142 | - T step; | ||
| 143 | - }; | ||
| 153 | + iterator end() const { return iterator(); } | ||
| 144 | 154 | ||
| 145 | - step_range_proxy(T begin, T step) : begin_(begin, step) { } | ||
| 155 | + private: | ||
| 156 | + iterator begin_; | ||
| 157 | + }; | ||
| 146 | 158 | ||
| 147 | - iter begin() const { return begin_; } | ||
| 159 | + template <typename T> | ||
| 160 | + struct infinite_range_proxy { | ||
| 161 | + struct iterator : detail::range_iter_base<T> { | ||
| 162 | + iterator(T current = T()) : detail::range_iter_base<T>(current) { } | ||
| 148 | 163 | ||
| 149 | - iter end() const { return iter(); } | ||
| 164 | + bool operator ==(iterator const&) const { return false; } | ||
| 150 | 165 | ||
| 151 | - private: | ||
| 152 | - iter begin_; | ||
| 166 | + bool operator !=(iterator const&) const { return true; } | ||
| 153 | 167 | }; | |
| 154 | 168 | ||
| 155 | 169 | infinite_range_proxy(T begin) : begin_(begin) { } | |
| 156 | 170 | ||
| 157 | - step_range_proxy step(T step) { | ||
| 158 | - return step_range_proxy(*begin_, step); | ||
| 171 | + step_inf_range_proxy<T> step(T step) { | ||
| 172 | + return {*begin_, step}; | ||
| 159 | 173 | } | |
| 160 | 174 | ||
| 161 | 175 | iterator begin() const { return begin_; } | |
| Original file line number | Diff line number | Diff line change | |
|---|---|---|---|
@@ -12,6 +12,45 @@ void print_range(R const& range) { | |||
| 12 | 12 | std::cout << "\n"; | |
| 13 | 13 | } | |
| 14 | 14 | ||
| 15 | + template <typename R> | ||
| 16 | + std::size_t manual_range_size(R const& range) { | ||
| 17 | + std::size_t size = 0; | ||
| 18 | + for (auto const& _ : range) ++size, (void) _; | ||
| 19 | + return size; | ||
| 20 | + } | ||
| 21 | + | ||
| 22 | + namespace util { namespace lang { | ||
| 23 | + | ||
| 24 | + // template <typename T> | ||
| 25 | + // struct is_a_step_range : std::false_type {}; | ||
| 26 | + | ||
| 27 | + // template <typename T> | ||
| 28 | + // struct is_a_step_range<typename range_proxy<T>::step_range_proxy> : std::true_type {}; | ||
| 29 | + | ||
| 30 | + template <typename T> | ||
| 31 | + std::ostream& operator <<(std::ostream& out, step_range_proxy<T> const& r) { | ||
| 32 | + return out << "range(" << *r.begin() << ", " << *r.end() << ")" | ||
| 33 | + << ".step(" << r.begin().step_ << ")"; | ||
| 34 | + } | ||
| 35 | + | ||
| 36 | + template <typename T> | ||
| 37 | + std::ostream& operator <<(std::ostream& out, range_proxy<T> const& r) { | ||
| 38 | + return out << "range(" << *r.begin() << ", " << *r.end() << ")"; | ||
| 39 | + } | ||
| 40 | + | ||
| 41 | + }} | ||
| 42 | + | ||
| 43 | + template <typename R> | ||
| 44 | + void test_range_size(R const& range) { | ||
| 45 | + auto const real_size = manual_range_size(R{range}); | ||
| 46 | + if (real_size == range.size()) { | ||
| 47 | + std::cout << range << ".size() = " << real_size << "\n"; | ||
| 48 | + } else { | ||
| 49 | + std::cout << "ERROR: " << range << ".size() ≠ " << real_size | ||
| 50 | + << " (was " << range.size() << ")!\n"; | ||
| 51 | + } | ||
| 52 | + } | ||
| 53 | + | ||
| 15 | 54 | int main() { | |
| 16 | 55 | using std::cout; | |
| 17 | 56 | using util::lang::range; | |
@@ -64,4 +103,10 @@ int main() { | |||
| 64 | 103 | print_range(range(8, 1).step(-2)); | |
| 65 | 104 | print_range(range(8.0, 1.0).step(-2.0)); | |
| 66 | 105 | cout << "\n"; | |
| 106 | + | ||
| 107 | + test_range_size(range(1, 8).step(2)); | ||
| 108 | + test_range_size(range(8.0, 1.0).step(-2.0)); | ||
| 109 | + test_range_size(range(8, 1).step(-2)); | ||
| 110 | + test_range_size(range(0.1, 0.11).step(2)); | ||
| 111 | + test_range_size(range(-7, 1).step(7)); | ||
| 67 | 112 | } | |
| Back | FazBrowse Home | New Git URL |
0 commit comments