facade.h 8.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254
  1. #pragma once
  2. #include <iterator>
  3. #include <type_traits>
  4. #include "detail/arrow_proxy.h"
  5. #include "detail/traits.h"
  6. namespace iterator::detail {
  7. template <typename, typename = void> struct has_equal_to : std::false_type {};
  8. template <typename T>
  9. struct has_equal_to<T, exists(_val(T).equal_to(_val(T)))> : std::true_type {};
  10. template <typename, typename = void>
  11. struct has_distance_to : std::false_type {};
  12. template <typename T>
  13. struct has_distance_to<T, exists(_val(T).distance_to(_val(T)))>
  14. : std::true_type {};
  15. template <typename, typename = void>
  16. struct is_advanceable_iterator : std::false_type {};
  17. template <typename T>
  18. struct is_advanceable_iterator<T, exists(_val(T).advance({}))>
  19. : std::true_type {};
  20. template <typename, typename = void>
  21. struct is_single_pass_iterator : std::false_type {};
  22. template <typename T>
  23. struct is_single_pass_iterator<T, void_t<typename T::single_pass_iterator>>
  24. : std::true_type {};
  25. template <typename, typename = void> struct has_increment : std::false_type {};
  26. template <typename T>
  27. struct has_increment<T, exists(_val(T).increment())> : std::true_type {};
  28. template <typename, typename = void> struct has_decrement : std::false_type {};
  29. template <typename T>
  30. struct has_decrement<T, exists(_val(T).decrement())> : std::true_type {};
  31. template <typename, typename = void> struct distance_to {
  32. using type = std::ptrdiff_t;
  33. };
  34. template <typename T>
  35. struct distance_to<T, std::enable_if_t<has_distance_to<T>{}>> {
  36. using type = decltype(_val(T).distance_to(_val(T)));
  37. };
  38. template <typename, typename = void> struct sentinal_type {
  39. using type = void;
  40. };
  41. template <typename T>
  42. struct sentinal_type<T, void_t<typename T::sentinal_type>> {
  43. using type = typename T::sentinal_type;
  44. };
  45. template <typename T> using distance_to_t = typename distance_to<T>::type;
  46. template <typename T> using sentinal_type_t = typename sentinal_type<T>::type;
  47. template <typename T> constexpr bool has_equal_to_v = has_equal_to<T>{};
  48. template <typename T> constexpr bool has_distance_to_v = has_distance_to<T>{};
  49. template <typename T> constexpr bool has_increment_v = has_increment<T>{};
  50. template <typename T> constexpr bool has_decrement_v = has_decrement<T>{};
  51. template <typename T>
  52. constexpr bool is_advanceable_iterator_v = is_advanceable_iterator<T>{};
  53. template <typename T>
  54. constexpr bool is_random_access_iterator_v =
  55. has_distance_to_v<T> && is_advanceable_iterator_v<T>;
  56. template <typename T>
  57. constexpr bool is_bidirectional_iterator_v =
  58. has_decrement_v<T> && has_increment_v<T> && has_equal_to_v<T>;
  59. template <typename T>
  60. constexpr bool is_single_pass_iterator_v = is_single_pass_iterator<T>{};
  61. template <typename T>
  62. using iterator_category_t = std::conditional_t<
  63. is_random_access_iterator_v<T>, std::random_access_iterator_tag,
  64. std::conditional_t<is_bidirectional_iterator_v<T>,
  65. std::bidirectional_iterator_tag,
  66. std::conditional_t<is_single_pass_iterator_v<T>,
  67. std::input_iterator_tag,
  68. std::forward_iterator_tag>>>;
  69. }
  70. #undef _val
  71. #undef exists
  72. namespace iterator {
  73. template <typename D, typename T>
  74. using difference_type_arg_t =
  75. std::enable_if_t<std::is_convertible_v<D, detail::distance_to_t<T>>>;
  76. template <typename D, typename T>
  77. using sentinel_type_arg_t =
  78. std::enable_if_t<std::is_same_v<D, detail::sentinal_type_t<T>>>;
  79. template <typename self_type> class facade {
  80. public:
  81. decltype(auto) operator*() const { return self().dereference(); }
  82. decltype(auto) operator->() const {
  83. if constexpr (std::is_reference<decltype(**this)>{}) {
  84. return std::addressof(**this);
  85. } else {
  86. return detail::arrow_proxy{**this};
  87. }
  88. }
  89. template <typename D, typename = difference_type_arg_t<D, self_type>>
  90. decltype(auto) operator[](D off) const {
  91. return *(self() + off);
  92. }
  93. self_type & operator++() {
  94. if constexpr (detail::is_advanceable_iterator_v<self_type>) {
  95. self() += 1;
  96. } else {
  97. self().increment();
  98. }
  99. return self();
  100. }
  101. auto operator++(int) {
  102. if constexpr (detail::is_single_pass_iterator_v<self_type>) {
  103. ++*this;
  104. } else {
  105. auto tmp = self();
  106. ++*this;
  107. return tmp;
  108. }
  109. }
  110. self_type & operator--() {
  111. if constexpr (detail::is_advanceable_iterator_v<self_type>) {
  112. self() -= 1;
  113. } else {
  114. self().decrement();
  115. }
  116. return self();
  117. }
  118. self_type operator--(int) {
  119. auto tmp = self();
  120. --*this;
  121. return tmp;
  122. }
  123. template <typename D, typename = difference_type_arg_t<D, self_type>>
  124. friend self_type & operator+=(self_type & self, D off) {
  125. static_assert(detail::is_advanceable_iterator_v<self_type>,
  126. "must be advancable");
  127. self.advance(off);
  128. return self;
  129. }
  130. template <typename D, typename = difference_type_arg_t<D, self_type>>
  131. friend self_type & operator-=(self_type & self, D off) {
  132. static_assert(detail::is_advanceable_iterator_v<self_type>,
  133. "must be advancable");
  134. self.advance(-off);
  135. return self;
  136. }
  137. template <typename D, typename = difference_type_arg_t<D, self_type>>
  138. friend auto operator+(self_type self, D off) {
  139. static_assert(detail::is_advanceable_iterator_v<self_type>,
  140. "must be advancable");
  141. return self += off;
  142. }
  143. template <typename D, typename = difference_type_arg_t<D, self_type>>
  144. friend auto operator+(D off, self_type self) {
  145. static_assert(detail::is_advanceable_iterator_v<self_type>,
  146. "must be advancable");
  147. return self += off;
  148. }
  149. template <typename D, typename = difference_type_arg_t<D, self_type>>
  150. friend auto operator-(self_type self, D off) {
  151. static_assert(detail::is_advanceable_iterator_v<self_type>,
  152. "must be advancable");
  153. return self -= off;
  154. }
  155. friend auto operator-(self_type const & left, self_type const & right) {
  156. return right.distance_to(left);
  157. }
  158. friend bool operator==(self_type const & left, self_type const & right) {
  159. if constexpr (detail::has_distance_to_v<self_type>) {
  160. return (left - right) == 0;
  161. } else {
  162. return left.equal_to(right);
  163. }
  164. }
  165. template <typename S, typename = sentinel_type_arg_t<S, self_type>>
  166. friend auto operator==(self_type self, S) {
  167. return self.at_end();
  168. }
  169. template <typename S, typename = sentinel_type_arg_t<S, self_type>>
  170. friend auto operator!=(self_type self, S) {
  171. return !self.at_end();
  172. }
  173. friend bool operator!=(self_type const & left, self_type const & right) {
  174. return !(left == right);
  175. }
  176. friend bool operator<(self_type const & left, self_type const & right) {
  177. return (left - right) < 0;
  178. }
  179. friend bool operator<=(self_type const & left, self_type const & right) {
  180. return (left - right) <= 0;
  181. }
  182. friend bool operator>(self_type const & left, self_type const & right) {
  183. return (left - right) > 0;
  184. }
  185. friend bool operator>=(self_type const & left, self_type const & right) {
  186. return (left - right) >= 0;
  187. }
  188. private:
  189. self_type & self() { return *static_cast<self_type *>(this); }
  190. self_type const & self() const {
  191. return *static_cast<self_type const *>(this);
  192. }
  193. };
  194. }
  195. // In C++20, a concept/requires could be used to eschew the need for the below
  196. // macros.
  197. template <typename I> struct std::iterator_traits<::iterator::facade<I>> {
  198. using reference = decltype(*std::declval<I>());
  199. using value_type = std::remove_cv_t<std::remove_reference_t<reference>>;
  200. using pointer = decltype(std::declval<I>().operator->());
  201. using difference_type = ::iterator::detail::distance_to_t<I>;
  202. using iterator_category = ::iterator::detail::iterator_category_t<I>;
  203. };
  204. #define MAKE_ITERATOR_FACADE_TYPEDEFS(type) \
  205. template <> \
  206. struct std::iterator_traits<type> \
  207. : std::iterator_traits<::iterator::facade<type>> {}
  208. #define MAKE_ITERATOR_FACADE_TYPEDEFS_T(type) \
  209. template <typename... T> \
  210. struct std::iterator_traits<type<T...>> \
  211. : std::iterator_traits<::iterator::facade<type<T...>>> {}