Home
last modified time | relevance | path

Searched refs:__lm1 (Results 1 – 4 of 4) sorted by relevance

/freebsd/contrib/llvm-project/libcxx/include/__algorithm/
H A Dsort.h272 _BidirectionalIterator __lm1 = __last;
273 for (--__lm1; __first != __lm1; ++__first) {
430 __populate_right_bitset(_RandomAccessIterator __lm1, _Compare __comp, _ValueType& __pivot, uint64_t…
433 _RandomAccessIterator __iter = __lm1;
448 _RandomAccessIterator& __lm1,
454 difference_type __remaining_len = __lm1 - __first + 1;
480 _RandomAccessIterator __iter = __lm1;
487 …std::__swap_bitmap_pos<_AlgPolicy, _RandomAccessIterator>(__first, __lm1, __left_bitset, __right_b…
489 __lm1 -= (__right_bitset == 0) ? __r_size : 0;
494 …_RandomAccessIterator& __first, _RandomAccessIterator& __lm1, uint64_t& __left_bitset, uint64_t& _…
[all …]
H A Drotate.h38 _ForwardIterator __lm1 = std::__move<_AlgPolicy>(_Ops::next(__first), __last, __first).second; in __rotate_left() local
39 *__lm1 = std::move(__tmp); in __rotate_left()
40 return __lm1; in __rotate_left()
49 _BidirectionalIterator __lm1 = _Ops::prev(__last); in __rotate_right() local
50 value_type __tmp = _Ops::__iter_move(__lm1); in __rotate_right()
51 …_BidirectionalIterator __fp1 = std::__move_backward<_AlgPolicy>(__first, __lm1, std::move(__last))… in __rotate_right()
H A Dnth_element.h79 _RandomAccessIterator __lm1 = __last; in __nth_element()
80 unsigned __n_swaps = std::__sort3<_AlgPolicy, _Compare>(__first, __m, --__lm1, __comp); in __nth_element() local
85 _RandomAccessIterator __j = __lm1; in __nth_element()
86 // j points beyond range to be tested, *__lm1 is known to be <= *__m in __nth_element()
148 // j points beyond range to be tested, *__lm1 is known to be <= *__m in __nth_element()
/freebsd/contrib/llvm-project/libcxx/include/
H A Dforward_list1262 const_iterator __lm1 = __x.before_begin();
1263 while (__lm1.__get_begin()->__next_ != nullptr)
1264 ++__lm1;
1265 __lm1.__get_begin()->__next_ = __p.__get_begin()->__next_;
1274 const_iterator __lm1 = std::next(__i);
1275 if (__p != __i && __p != __lm1) {
1276 __i.__get_begin()->__next_ = __lm1.__get_begin()->__next_;
1277 __lm1.__get_begin()->__next_ = __p.__get_begin()->__next_;
1278 __p.__get_begin()->__next_ = __lm1.__get_unsafe_node_pointer();
1286 const_iterator __lm1 = __f;
[all …]