rotate.h 6.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200
  1. //===----------------------------------------------------------------------===//
  2. //
  3. // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
  4. // See https://llvm.org/LICENSE.txt for license information.
  5. // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
  6. //
  7. //===----------------------------------------------------------------------===//
  8. #ifndef _LIBCPP___ALGORITHM_ROTATE_H
  9. #define _LIBCPP___ALGORITHM_ROTATE_H
  10. #include <__algorithm/move.h>
  11. #include <__algorithm/move_backward.h>
  12. #include <__algorithm/swap_ranges.h>
  13. #include <__config>
  14. #include <__iterator/iterator_traits.h>
  15. #include <__iterator/next.h>
  16. #include <__iterator/prev.h>
  17. #include <__utility/swap.h>
  18. #include <iterator>
  19. #if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
  20. # pragma GCC system_header
  21. #endif
  22. _LIBCPP_BEGIN_NAMESPACE_STD
  23. template <class _ForwardIterator>
  24. _LIBCPP_CONSTEXPR_AFTER_CXX11 _ForwardIterator
  25. __rotate_left(_ForwardIterator __first, _ForwardIterator __last)
  26. {
  27. typedef typename iterator_traits<_ForwardIterator>::value_type value_type;
  28. value_type __tmp = _VSTD::move(*__first);
  29. _ForwardIterator __lm1 = _VSTD::move(_VSTD::next(__first), __last, __first);
  30. *__lm1 = _VSTD::move(__tmp);
  31. return __lm1;
  32. }
  33. template <class _BidirectionalIterator>
  34. _LIBCPP_CONSTEXPR_AFTER_CXX11 _BidirectionalIterator
  35. __rotate_right(_BidirectionalIterator __first, _BidirectionalIterator __last)
  36. {
  37. typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type;
  38. _BidirectionalIterator __lm1 = _VSTD::prev(__last);
  39. value_type __tmp = _VSTD::move(*__lm1);
  40. _BidirectionalIterator __fp1 = _VSTD::move_backward(__first, __lm1, __last);
  41. *__first = _VSTD::move(__tmp);
  42. return __fp1;
  43. }
  44. template <class _ForwardIterator>
  45. _LIBCPP_CONSTEXPR_AFTER_CXX14 _ForwardIterator
  46. __rotate_forward(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last)
  47. {
  48. _ForwardIterator __i = __middle;
  49. while (true)
  50. {
  51. swap(*__first, *__i);
  52. ++__first;
  53. if (++__i == __last)
  54. break;
  55. if (__first == __middle)
  56. __middle = __i;
  57. }
  58. _ForwardIterator __r = __first;
  59. if (__first != __middle)
  60. {
  61. __i = __middle;
  62. while (true)
  63. {
  64. swap(*__first, *__i);
  65. ++__first;
  66. if (++__i == __last)
  67. {
  68. if (__first == __middle)
  69. break;
  70. __i = __middle;
  71. }
  72. else if (__first == __middle)
  73. __middle = __i;
  74. }
  75. }
  76. return __r;
  77. }
  78. template<typename _Integral>
  79. inline _LIBCPP_INLINE_VISIBILITY
  80. _LIBCPP_CONSTEXPR_AFTER_CXX14 _Integral
  81. __algo_gcd(_Integral __x, _Integral __y)
  82. {
  83. do
  84. {
  85. _Integral __t = __x % __y;
  86. __x = __y;
  87. __y = __t;
  88. } while (__y);
  89. return __x;
  90. }
  91. template<typename _RandomAccessIterator>
  92. _LIBCPP_CONSTEXPR_AFTER_CXX14 _RandomAccessIterator
  93. __rotate_gcd(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last)
  94. {
  95. typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type;
  96. typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type;
  97. const difference_type __m1 = __middle - __first;
  98. const difference_type __m2 = __last - __middle;
  99. if (__m1 == __m2)
  100. {
  101. _VSTD::swap_ranges(__first, __middle, __middle);
  102. return __middle;
  103. }
  104. const difference_type __g = _VSTD::__algo_gcd(__m1, __m2);
  105. for (_RandomAccessIterator __p = __first + __g; __p != __first;)
  106. {
  107. value_type __t(_VSTD::move(*--__p));
  108. _RandomAccessIterator __p1 = __p;
  109. _RandomAccessIterator __p2 = __p1 + __m1;
  110. do
  111. {
  112. *__p1 = _VSTD::move(*__p2);
  113. __p1 = __p2;
  114. const difference_type __d = __last - __p2;
  115. if (__m1 < __d)
  116. __p2 += __m1;
  117. else
  118. __p2 = __first + (__m1 - __d);
  119. } while (__p2 != __p);
  120. *__p1 = _VSTD::move(__t);
  121. }
  122. return __first + __m2;
  123. }
  124. template <class _ForwardIterator>
  125. inline _LIBCPP_INLINE_VISIBILITY
  126. _LIBCPP_CONSTEXPR_AFTER_CXX11 _ForwardIterator
  127. __rotate(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last,
  128. _VSTD::forward_iterator_tag)
  129. {
  130. typedef typename iterator_traits<_ForwardIterator>::value_type value_type;
  131. if (is_trivially_move_assignable<value_type>::value)
  132. {
  133. if (_VSTD::next(__first) == __middle)
  134. return _VSTD::__rotate_left(__first, __last);
  135. }
  136. return _VSTD::__rotate_forward(__first, __middle, __last);
  137. }
  138. template <class _BidirectionalIterator>
  139. inline _LIBCPP_INLINE_VISIBILITY
  140. _LIBCPP_CONSTEXPR_AFTER_CXX11 _BidirectionalIterator
  141. __rotate(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last,
  142. bidirectional_iterator_tag)
  143. {
  144. typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type;
  145. if (is_trivially_move_assignable<value_type>::value)
  146. {
  147. if (_VSTD::next(__first) == __middle)
  148. return _VSTD::__rotate_left(__first, __last);
  149. if (_VSTD::next(__middle) == __last)
  150. return _VSTD::__rotate_right(__first, __last);
  151. }
  152. return _VSTD::__rotate_forward(__first, __middle, __last);
  153. }
  154. template <class _RandomAccessIterator>
  155. inline _LIBCPP_INLINE_VISIBILITY
  156. _LIBCPP_CONSTEXPR_AFTER_CXX11 _RandomAccessIterator
  157. __rotate(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last,
  158. random_access_iterator_tag)
  159. {
  160. typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type;
  161. if (is_trivially_move_assignable<value_type>::value)
  162. {
  163. if (_VSTD::next(__first) == __middle)
  164. return _VSTD::__rotate_left(__first, __last);
  165. if (_VSTD::next(__middle) == __last)
  166. return _VSTD::__rotate_right(__first, __last);
  167. return _VSTD::__rotate_gcd(__first, __middle, __last);
  168. }
  169. return _VSTD::__rotate_forward(__first, __middle, __last);
  170. }
  171. template <class _ForwardIterator>
  172. inline _LIBCPP_INLINE_VISIBILITY
  173. _LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator
  174. rotate(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last)
  175. {
  176. if (__first == __middle)
  177. return __last;
  178. if (__middle == __last)
  179. return __first;
  180. return _VSTD::__rotate(__first, __middle, __last,
  181. typename iterator_traits<_ForwardIterator>::iterator_category());
  182. }
  183. _LIBCPP_END_NAMESPACE_STD
  184. #endif // _LIBCPP___ALGORITHM_ROTATE_H