Lines Matching refs:__pos

537 …_LIBCPP_HIDE_FROM_ABI __deque_range(iterator __pos, iterator __e) _NOEXCEPT : __pos_(__pos), __end…
1638 size_type __pos = __p - begin();
1639 size_type __to_end = size() - __pos;
1641 if (__pos < __to_end) { // insert by shifting things backward
1646 if (__pos == 0) {
1656 if (__pos > 1)
1657 __b = std::move(std::next(__b), __b + __pos, __b);
1665 size_type __de = size() - __pos;
1679 return begin() + __pos;
1685 size_type __pos = __p - begin();
1686 size_type __to_end = size() - __pos;
1688 if (__pos < __to_end) { // insert by shifting things backward
1693 if (__pos == 0) {
1704 if (__pos > 1)
1705 __b = std::move(std::next(__b), __b + __pos, __b);
1713 size_type __de = size() - __pos;
1728 return begin() + __pos;
1735 size_type __pos = __p - begin();
1736 size_type __to_end = size() - __pos;
1738 if (__pos < __to_end) { // insert by shifting things backward
1743 if (__pos == 0) {
1756 if (__pos > 1)
1757 __b = __move_and_check(std::next(__b), __b + __pos, __b, __vt);
1765 size_type __de = size() - __pos;
1782 return begin() + __pos;
1788 size_type __pos = __p - begin();
1789 size_type __to_end = __size() - __pos;
1791 if (__pos < __to_end) { // insert by shifting things backward
1798 if (__n > __pos) {
1799 for (size_type __m = __n - __pos; __m; --__m, --__start_, ++__size())
1801 __n = __pos;
1807 if (__n < __pos)
1808 __old_begin = __move_and_check(__obn, __old_begin + __pos, __old_begin, __vt);
1819 size_type __de = size() - __pos;
1834 return begin() + __pos;
1888 size_type __pos = __p - begin();
1889 size_type __to_end = size() - __pos;
1891 if (__pos < __to_end) { // insert by shifting things backward
1899 if (__n > __pos) {
1900 __m = __pos < __n / 2 ? std::prev(__l, __pos) : std::next(__f, __n - __pos);
1903 __n = __pos;
1912 if (__n < __pos)
1913 __old_begin = std::move(__obn, __old_begin + __pos, __old_begin);
1925 size_type __de = size() - __pos;
1941 return begin() + __pos;
2413 difference_type __pos = __f - __b;
2414 iterator __p = __b + __pos;
2416 if (static_cast<size_t>(__pos) <= (size() - 1) / 2) { // erase from front
2430 return begin() + __pos;
2440 difference_type __pos = __f - __b;
2441 iterator __p = __b + __pos;
2444 if (static_cast<size_t>(__pos) <= (size() - __n) / 2) { // erase from front
2463 return begin() + __pos;
2475 difference_type __pos = __f - __b;
2476 for (iterator __p = __b + __pos; __p != __e; ++__p)