1// -*- C++ -*- 2//===----------------------------------------------------------------------===// 3// 4// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. 5// See https://llvm.org/LICENSE.txt for license information. 6// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 7// 8//===----------------------------------------------------------------------===// 9 10#ifndef _LIBCPP_DEQUE 11#define _LIBCPP_DEQUE 12 13/* 14 deque synopsis 15 16namespace std 17{ 18 19template <class T, class Allocator = allocator<T> > 20class deque 21{ 22public: 23 // types: 24 typedef T value_type; 25 typedef Allocator allocator_type; 26 27 typedef typename allocator_type::reference reference; 28 typedef typename allocator_type::const_reference const_reference; 29 typedef implementation-defined iterator; 30 typedef implementation-defined const_iterator; 31 typedef typename allocator_type::size_type size_type; 32 typedef typename allocator_type::difference_type difference_type; 33 34 typedef typename allocator_type::pointer pointer; 35 typedef typename allocator_type::const_pointer const_pointer; 36 typedef std::reverse_iterator<iterator> reverse_iterator; 37 typedef std::reverse_iterator<const_iterator> const_reverse_iterator; 38 39 // construct/copy/destroy: 40 deque() noexcept(is_nothrow_default_constructible<allocator_type>::value); 41 explicit deque(const allocator_type& a); 42 explicit deque(size_type n); 43 explicit deque(size_type n, const allocator_type& a); // C++14 44 deque(size_type n, const value_type& v); 45 deque(size_type n, const value_type& v, const allocator_type& a); 46 template <class InputIterator> 47 deque(InputIterator f, InputIterator l); 48 template <class InputIterator> 49 deque(InputIterator f, InputIterator l, const allocator_type& a); 50 template<container-compatible-range<T> R> 51 deque(from_range_t, R&& rg, const Allocator& = Allocator()); // C++23 52 deque(const deque& c); 53 deque(deque&& c) 54 noexcept(is_nothrow_move_constructible<allocator_type>::value); 55 deque(initializer_list<value_type> il, const Allocator& a = allocator_type()); 56 deque(const deque& c, const allocator_type& a); 57 deque(deque&& c, const allocator_type& a); 58 ~deque(); 59 60 deque& operator=(const deque& c); 61 deque& operator=(deque&& c) 62 noexcept( 63 allocator_type::propagate_on_container_move_assignment::value && 64 is_nothrow_move_assignable<allocator_type>::value); 65 deque& operator=(initializer_list<value_type> il); 66 67 template <class InputIterator> 68 void assign(InputIterator f, InputIterator l); 69 template<container-compatible-range<T> R> 70 void assign_range(R&& rg); // C++23 71 void assign(size_type n, const value_type& v); 72 void assign(initializer_list<value_type> il); 73 74 allocator_type get_allocator() const noexcept; 75 76 // iterators: 77 78 iterator begin() noexcept; 79 const_iterator begin() const noexcept; 80 iterator end() noexcept; 81 const_iterator end() const noexcept; 82 83 reverse_iterator rbegin() noexcept; 84 const_reverse_iterator rbegin() const noexcept; 85 reverse_iterator rend() noexcept; 86 const_reverse_iterator rend() const noexcept; 87 88 const_iterator cbegin() const noexcept; 89 const_iterator cend() const noexcept; 90 const_reverse_iterator crbegin() const noexcept; 91 const_reverse_iterator crend() const noexcept; 92 93 // capacity: 94 size_type size() const noexcept; 95 size_type max_size() const noexcept; 96 void resize(size_type n); 97 void resize(size_type n, const value_type& v); 98 void shrink_to_fit(); 99 bool empty() const noexcept; 100 101 // element access: 102 reference operator[](size_type i); 103 const_reference operator[](size_type i) const; 104 reference at(size_type i); 105 const_reference at(size_type i) const; 106 reference front(); 107 const_reference front() const; 108 reference back(); 109 const_reference back() const; 110 111 // modifiers: 112 void push_front(const value_type& v); 113 void push_front(value_type&& v); 114 template<container-compatible-range<T> R> 115 void prepend_range(R&& rg); // C++23 116 void push_back(const value_type& v); 117 void push_back(value_type&& v); 118 template<container-compatible-range<T> R> 119 void append_range(R&& rg); // C++23 120 template <class... Args> reference emplace_front(Args&&... args); // reference in C++17 121 template <class... Args> reference emplace_back(Args&&... args); // reference in C++17 122 template <class... Args> iterator emplace(const_iterator p, Args&&... args); 123 iterator insert(const_iterator p, const value_type& v); 124 iterator insert(const_iterator p, value_type&& v); 125 iterator insert(const_iterator p, size_type n, const value_type& v); 126 template <class InputIterator> 127 iterator insert(const_iterator p, InputIterator f, InputIterator l); 128 template<container-compatible-range<T> R> 129 iterator insert_range(const_iterator position, R&& rg); // C++23 130 iterator insert(const_iterator p, initializer_list<value_type> il); 131 void pop_front(); 132 void pop_back(); 133 iterator erase(const_iterator p); 134 iterator erase(const_iterator f, const_iterator l); 135 void swap(deque& c) 136 noexcept(allocator_traits<allocator_type>::is_always_equal::value); // C++17 137 void clear() noexcept; 138}; 139 140template <class InputIterator, class Allocator = allocator<typename iterator_traits<InputIterator>::value_type>> 141 deque(InputIterator, InputIterator, Allocator = Allocator()) 142 -> deque<typename iterator_traits<InputIterator>::value_type, Allocator>; // C++17 143 144template<ranges::input_range R, class Allocator = allocator<ranges::range_value_t<R>>> 145 deque(from_range_t, R&&, Allocator = Allocator()) 146 -> deque<ranges::range_value_t<R>, Allocator>; // C++23 147 148template <class T, class Allocator> 149 bool operator==(const deque<T,Allocator>& x, const deque<T,Allocator>& y); 150template <class T, class Allocator> 151 bool operator< (const deque<T,Allocator>& x, const deque<T,Allocator>& y); // removed in C++20 152template <class T, class Allocator> 153 bool operator!=(const deque<T,Allocator>& x, const deque<T,Allocator>& y); // removed in C++20 154template <class T, class Allocator> 155 bool operator> (const deque<T,Allocator>& x, const deque<T,Allocator>& y); // removed in C++20 156template <class T, class Allocator> 157 bool operator>=(const deque<T,Allocator>& x, const deque<T,Allocator>& y); // removed in C++20 158template <class T, class Allocator> 159 bool operator<=(const deque<T,Allocator>& x, const deque<T,Allocator>& y); // removed in C++20 160template<class T, class Allocator> 161 synth-three-way-result<T> operator<=>(const deque<T, Allocator>& x, 162 const deque<T, Allocator>& y); // since C++20 163 164// specialized algorithms: 165template <class T, class Allocator> 166 void swap(deque<T,Allocator>& x, deque<T,Allocator>& y) 167 noexcept(noexcept(x.swap(y))); 168 169template <class T, class Allocator, class U> 170 typename deque<T, Allocator>::size_type 171 erase(deque<T, Allocator>& c, const U& value); // C++20 172template <class T, class Allocator, class Predicate> 173 typename deque<T, Allocator>::size_type 174 erase_if(deque<T, Allocator>& c, Predicate pred); // C++20 175 176} // std 177 178*/ 179 180#include <__algorithm/copy.h> 181#include <__algorithm/copy_backward.h> 182#include <__algorithm/copy_n.h> 183#include <__algorithm/equal.h> 184#include <__algorithm/fill_n.h> 185#include <__algorithm/lexicographical_compare.h> 186#include <__algorithm/lexicographical_compare_three_way.h> 187#include <__algorithm/min.h> 188#include <__algorithm/remove.h> 189#include <__algorithm/remove_if.h> 190#include <__algorithm/unwrap_iter.h> 191#include <__assert> 192#include <__availability> 193#include <__config> 194#include <__format/enable_insertable.h> 195#include <__iterator/distance.h> 196#include <__iterator/iterator_traits.h> 197#include <__iterator/next.h> 198#include <__iterator/prev.h> 199#include <__iterator/reverse_iterator.h> 200#include <__iterator/segmented_iterator.h> 201#include <__memory/addressof.h> 202#include <__memory/allocator_destructor.h> 203#include <__memory/pointer_traits.h> 204#include <__memory/temp_value.h> 205#include <__memory/unique_ptr.h> 206#include <__memory_resource/polymorphic_allocator.h> 207#include <__ranges/access.h> 208#include <__ranges/concepts.h> 209#include <__ranges/container_compatible_range.h> 210#include <__ranges/from_range.h> 211#include <__ranges/size.h> 212#include <__split_buffer> 213#include <__type_traits/is_allocator.h> 214#include <__type_traits/is_convertible.h> 215#include <__type_traits/is_same.h> 216#include <__type_traits/type_identity.h> 217#include <__utility/forward.h> 218#include <__utility/move.h> 219#include <__utility/pair.h> 220#include <__utility/swap.h> 221#include <limits> 222#include <stdexcept> 223#include <version> 224 225// standard-mandated includes 226 227// [iterator.range] 228#include <__iterator/access.h> 229#include <__iterator/data.h> 230#include <__iterator/empty.h> 231#include <__iterator/reverse_access.h> 232#include <__iterator/size.h> 233 234// [deque.syn] 235#include <compare> 236#include <initializer_list> 237 238#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER) 239# pragma GCC system_header 240#endif 241 242_LIBCPP_PUSH_MACROS 243#include <__undef_macros> 244 245_LIBCPP_BEGIN_NAMESPACE_STD 246 247template <class _Tp, class _Allocator = allocator<_Tp> > 248class _LIBCPP_TEMPLATE_VIS deque; 249 250template <class _ValueType, class _DiffType> 251struct __deque_block_size { 252 static const _DiffType value = sizeof(_ValueType) < 256 ? 4096 / sizeof(_ValueType) : 16; 253}; 254 255template <class _ValueType, 256 class _Pointer, 257 class _Reference, 258 class _MapPointer, 259 class _DiffType, 260 _DiffType _BS = 261#ifdef _LIBCPP_ABI_INCOMPLETE_TYPES_IN_DEQUE 262 // Keep template parameter to avoid changing all template declarations thoughout 263 // this file. 264 0 265#else 266 __deque_block_size<_ValueType, _DiffType>::value 267#endif 268 > 269class _LIBCPP_TEMPLATE_VIS __deque_iterator { 270 typedef _MapPointer __map_iterator; 271 272public: 273 typedef _Pointer pointer; 274 typedef _DiffType difference_type; 275 276private: 277 __map_iterator __m_iter_; 278 pointer __ptr_; 279 280 static const difference_type __block_size; 281 282public: 283 typedef _ValueType value_type; 284 typedef random_access_iterator_tag iterator_category; 285 typedef _Reference reference; 286 287 _LIBCPP_HIDE_FROM_ABI __deque_iterator() _NOEXCEPT 288#if _LIBCPP_STD_VER >= 14 289 : __m_iter_(nullptr), 290 __ptr_(nullptr) 291#endif 292 { 293 } 294 295 template <class _Pp, class _Rp, class _MP, __enable_if_t<is_convertible<_Pp, pointer>::value, int> = 0> 296 _LIBCPP_HIDE_FROM_ABI 297 __deque_iterator(const __deque_iterator<value_type, _Pp, _Rp, _MP, difference_type, _BS>& __it) _NOEXCEPT 298 : __m_iter_(__it.__m_iter_), 299 __ptr_(__it.__ptr_) {} 300 301 _LIBCPP_HIDE_FROM_ABI reference operator*() const { return *__ptr_; } 302 _LIBCPP_HIDE_FROM_ABI pointer operator->() const { return __ptr_; } 303 304 _LIBCPP_HIDE_FROM_ABI __deque_iterator& operator++() { 305 if (++__ptr_ - *__m_iter_ == __block_size) { 306 ++__m_iter_; 307 __ptr_ = *__m_iter_; 308 } 309 return *this; 310 } 311 312 _LIBCPP_HIDE_FROM_ABI __deque_iterator operator++(int) { 313 __deque_iterator __tmp = *this; 314 ++(*this); 315 return __tmp; 316 } 317 318 _LIBCPP_HIDE_FROM_ABI __deque_iterator& operator--() { 319 if (__ptr_ == *__m_iter_) { 320 --__m_iter_; 321 __ptr_ = *__m_iter_ + __block_size; 322 } 323 --__ptr_; 324 return *this; 325 } 326 327 _LIBCPP_HIDE_FROM_ABI __deque_iterator operator--(int) { 328 __deque_iterator __tmp = *this; 329 --(*this); 330 return __tmp; 331 } 332 333 _LIBCPP_HIDE_FROM_ABI __deque_iterator& operator+=(difference_type __n) { 334 if (__n != 0) { 335 __n += __ptr_ - *__m_iter_; 336 if (__n > 0) { 337 __m_iter_ += __n / __block_size; 338 __ptr_ = *__m_iter_ + __n % __block_size; 339 } else // (__n < 0) 340 { 341 difference_type __z = __block_size - 1 - __n; 342 __m_iter_ -= __z / __block_size; 343 __ptr_ = *__m_iter_ + (__block_size - 1 - __z % __block_size); 344 } 345 } 346 return *this; 347 } 348 349 _LIBCPP_HIDE_FROM_ABI __deque_iterator& operator-=(difference_type __n) { return *this += -__n; } 350 351 _LIBCPP_HIDE_FROM_ABI __deque_iterator operator+(difference_type __n) const { 352 __deque_iterator __t(*this); 353 __t += __n; 354 return __t; 355 } 356 357 _LIBCPP_HIDE_FROM_ABI __deque_iterator operator-(difference_type __n) const { 358 __deque_iterator __t(*this); 359 __t -= __n; 360 return __t; 361 } 362 363 _LIBCPP_HIDE_FROM_ABI friend __deque_iterator operator+(difference_type __n, const __deque_iterator& __it) { 364 return __it + __n; 365 } 366 367 _LIBCPP_HIDE_FROM_ABI friend difference_type operator-(const __deque_iterator& __x, const __deque_iterator& __y) { 368 if (__x != __y) 369 return (__x.__m_iter_ - __y.__m_iter_) * __block_size + (__x.__ptr_ - *__x.__m_iter_) - 370 (__y.__ptr_ - *__y.__m_iter_); 371 return 0; 372 } 373 374 _LIBCPP_HIDE_FROM_ABI reference operator[](difference_type __n) const { return *(*this + __n); } 375 376 _LIBCPP_HIDE_FROM_ABI friend bool operator==(const __deque_iterator& __x, const __deque_iterator& __y) { 377 return __x.__ptr_ == __y.__ptr_; 378 } 379 380 _LIBCPP_HIDE_FROM_ABI friend bool operator!=(const __deque_iterator& __x, const __deque_iterator& __y) { 381 return !(__x == __y); 382 } 383 384 _LIBCPP_HIDE_FROM_ABI friend bool operator<(const __deque_iterator& __x, const __deque_iterator& __y) { 385 return __x.__m_iter_ < __y.__m_iter_ || (__x.__m_iter_ == __y.__m_iter_ && __x.__ptr_ < __y.__ptr_); 386 } 387 388 _LIBCPP_HIDE_FROM_ABI friend bool operator>(const __deque_iterator& __x, const __deque_iterator& __y) { 389 return __y < __x; 390 } 391 392 _LIBCPP_HIDE_FROM_ABI friend bool operator<=(const __deque_iterator& __x, const __deque_iterator& __y) { 393 return !(__y < __x); 394 } 395 396 _LIBCPP_HIDE_FROM_ABI friend bool operator>=(const __deque_iterator& __x, const __deque_iterator& __y) { 397 return !(__x < __y); 398 } 399 400private: 401 _LIBCPP_HIDE_FROM_ABI explicit __deque_iterator(__map_iterator __m, pointer __p) _NOEXCEPT 402 : __m_iter_(__m), 403 __ptr_(__p) {} 404 405 template <class _Tp, class _Ap> 406 friend class _LIBCPP_TEMPLATE_VIS deque; 407 template <class _Vp, class _Pp, class _Rp, class _MP, class _Dp, _Dp> 408 friend class _LIBCPP_TEMPLATE_VIS __deque_iterator; 409 410 template <class> 411 friend struct __segmented_iterator_traits; 412}; 413 414template <class _ValueType, class _Pointer, class _Reference, class _MapPointer, class _DiffType, _DiffType _BlockSize> 415struct __segmented_iterator_traits< 416 __deque_iterator<_ValueType, _Pointer, _Reference, _MapPointer, _DiffType, _BlockSize> > { 417private: 418 using _Iterator = __deque_iterator<_ValueType, _Pointer, _Reference, _MapPointer, _DiffType, _BlockSize>; 419 420public: 421 using __is_segmented_iterator = true_type; 422 using __segment_iterator = _MapPointer; 423 using __local_iterator = _Pointer; 424 425 static _LIBCPP_HIDE_FROM_ABI __segment_iterator __segment(_Iterator __iter) { return __iter.__m_iter_; } 426 static _LIBCPP_HIDE_FROM_ABI __local_iterator __local(_Iterator __iter) { return __iter.__ptr_; } 427 static _LIBCPP_HIDE_FROM_ABI __local_iterator __begin(__segment_iterator __iter) { return *__iter; } 428 429 static _LIBCPP_HIDE_FROM_ABI __local_iterator __end(__segment_iterator __iter) { 430 return *__iter + _Iterator::__block_size; 431 } 432 433 static _LIBCPP_HIDE_FROM_ABI _Iterator __compose(__segment_iterator __segment, __local_iterator __local) { 434 if (__segment && __local == __end(__segment)) { 435 ++__segment; 436 return _Iterator(__segment, *__segment); 437 } 438 return _Iterator(__segment, __local); 439 } 440}; 441 442template <class _ValueType, class _Pointer, class _Reference, class _MapPointer, class _DiffType, _DiffType _BlockSize> 443const _DiffType __deque_iterator<_ValueType, _Pointer, _Reference, _MapPointer, _DiffType, _BlockSize>::__block_size = 444 __deque_block_size<_ValueType, _DiffType>::value; 445 446template <class _Tp, class _Allocator /*= allocator<_Tp>*/> 447class _LIBCPP_TEMPLATE_VIS deque { 448public: 449 // types: 450 451 using value_type = _Tp; 452 453 static_assert((is_same<typename _Allocator::value_type, value_type>::value), 454 "Allocator::value_type must be same type as value_type"); 455 456 using allocator_type = _Allocator; 457 using __alloc_traits = allocator_traits<allocator_type>; 458 459 using size_type = typename __alloc_traits::size_type; 460 using difference_type = typename __alloc_traits::difference_type; 461 462 using pointer = typename __alloc_traits::pointer; 463 using const_pointer = typename __alloc_traits::const_pointer; 464 465 using __pointer_allocator = __rebind_alloc<__alloc_traits, pointer>; 466 using __const_pointer_allocator = __rebind_alloc<__alloc_traits, const_pointer>; 467 using __map = __split_buffer<pointer, __pointer_allocator>; 468 using __map_alloc_traits = allocator_traits<__pointer_allocator>; 469 using __map_pointer = typename __map_alloc_traits::pointer; 470 using __map_const_pointer = typename allocator_traits<__const_pointer_allocator>::const_pointer; 471 using __map_const_iterator = typename __map::const_iterator; 472 473 using reference = value_type&; 474 using const_reference = const value_type&; 475 476 using iterator = __deque_iterator<value_type, pointer, reference, __map_pointer, difference_type>; 477 using const_iterator = 478 __deque_iterator<value_type, const_pointer, const_reference, __map_const_pointer, difference_type>; 479 using reverse_iterator = std::reverse_iterator<iterator>; 480 using const_reverse_iterator = std::reverse_iterator<const_iterator>; 481 482 static_assert(is_same<allocator_type, __rebind_alloc<__alloc_traits, value_type> >::value, 483 "[allocator.requirements] states that rebinding an allocator to the same type should result in the " 484 "original allocator"); 485 static_assert(is_nothrow_default_constructible<allocator_type>::value == 486 is_nothrow_default_constructible<__pointer_allocator>::value, 487 "rebinding an allocator should not change excpetion guarantees"); 488 static_assert(is_nothrow_move_constructible<allocator_type>::value == 489 is_nothrow_move_constructible<typename __map::allocator_type>::value, 490 "rebinding an allocator should not change excpetion guarantees"); 491 492private: 493 struct __deque_block_range { 494 explicit _LIBCPP_HIDE_FROM_ABI __deque_block_range(pointer __b, pointer __e) _NOEXCEPT 495 : __begin_(__b), 496 __end_(__e) {} 497 const pointer __begin_; 498 const pointer __end_; 499 }; 500 501 struct __deque_range { 502 iterator __pos_; 503 const iterator __end_; 504 505 _LIBCPP_HIDE_FROM_ABI __deque_range(iterator __pos, iterator __e) _NOEXCEPT : __pos_(__pos), __end_(__e) {} 506 507 explicit _LIBCPP_HIDE_FROM_ABI operator bool() const _NOEXCEPT { return __pos_ != __end_; } 508 509 _LIBCPP_HIDE_FROM_ABI __deque_range begin() const { return *this; } 510 511 _LIBCPP_HIDE_FROM_ABI __deque_range end() const { return __deque_range(__end_, __end_); } 512 _LIBCPP_HIDE_FROM_ABI __deque_block_range operator*() const _NOEXCEPT { 513 if (__pos_.__m_iter_ == __end_.__m_iter_) { 514 return __deque_block_range(__pos_.__ptr_, __end_.__ptr_); 515 } 516 return __deque_block_range(__pos_.__ptr_, *__pos_.__m_iter_ + __block_size); 517 } 518 519 _LIBCPP_HIDE_FROM_ABI __deque_range& operator++() _NOEXCEPT { 520 if (__pos_.__m_iter_ == __end_.__m_iter_) { 521 __pos_ = __end_; 522 } else { 523 ++__pos_.__m_iter_; 524 __pos_.__ptr_ = *__pos_.__m_iter_; 525 } 526 return *this; 527 } 528 529 _LIBCPP_HIDE_FROM_ABI friend bool operator==(__deque_range const& __lhs, __deque_range const& __rhs) { 530 return __lhs.__pos_ == __rhs.__pos_; 531 } 532 _LIBCPP_HIDE_FROM_ABI friend bool operator!=(__deque_range const& __lhs, __deque_range const& __rhs) { 533 return !(__lhs == __rhs); 534 } 535 }; 536 537 struct _ConstructTransaction { 538 _LIBCPP_HIDE_FROM_ABI _ConstructTransaction(deque* __db, __deque_block_range& __r) 539 : __pos_(__r.__begin_), __end_(__r.__end_), __begin_(__r.__begin_), __base_(__db) {} 540 541 _LIBCPP_HIDE_FROM_ABI ~_ConstructTransaction() { __base_->__size() += (__pos_ - __begin_); } 542 543 pointer __pos_; 544 const pointer __end_; 545 546 private: 547 const pointer __begin_; 548 deque* const __base_; 549 }; 550 551 static const difference_type __block_size; 552 553 __map __map_; 554 size_type __start_; 555 __compressed_pair<size_type, allocator_type> __size_; 556 557public: 558 // construct/copy/destroy: 559 _LIBCPP_HIDE_FROM_ABI deque() _NOEXCEPT_(is_nothrow_default_constructible<allocator_type>::value) 560 : __start_(0), __size_(0, __default_init_tag()) { 561 __annotate_new(0); 562 } 563 564 _LIBCPP_HIDE_FROM_ABI ~deque() { 565 clear(); 566 __annotate_delete(); 567 typename __map::iterator __i = __map_.begin(); 568 typename __map::iterator __e = __map_.end(); 569 for (; __i != __e; ++__i) 570 __alloc_traits::deallocate(__alloc(), *__i, __block_size); 571 } 572 573 _LIBCPP_HIDE_FROM_ABI explicit deque(const allocator_type& __a) 574 : __map_(__pointer_allocator(__a)), __start_(0), __size_(0, __a) { 575 __annotate_new(0); 576 } 577 578 explicit _LIBCPP_HIDE_FROM_ABI deque(size_type __n); 579#if _LIBCPP_STD_VER >= 14 580 explicit _LIBCPP_HIDE_FROM_ABI deque(size_type __n, const _Allocator& __a); 581#endif 582 _LIBCPP_HIDE_FROM_ABI deque(size_type __n, const value_type& __v); 583 584 template <__enable_if_t<__is_allocator<_Allocator>::value, int> = 0> 585 _LIBCPP_HIDE_FROM_ABI deque(size_type __n, const value_type& __v, const allocator_type& __a) 586 : __map_(__pointer_allocator(__a)), __start_(0), __size_(0, __a) { 587 __annotate_new(0); 588 if (__n > 0) 589 __append(__n, __v); 590 } 591 592 template <class _InputIter, __enable_if_t<__has_input_iterator_category<_InputIter>::value, int> = 0> 593 _LIBCPP_HIDE_FROM_ABI deque(_InputIter __f, _InputIter __l); 594 template <class _InputIter, __enable_if_t<__has_input_iterator_category<_InputIter>::value, int> = 0> 595 _LIBCPP_HIDE_FROM_ABI deque(_InputIter __f, _InputIter __l, const allocator_type& __a); 596 597#if _LIBCPP_STD_VER >= 23 598 template <_ContainerCompatibleRange<_Tp> _Range> 599 _LIBCPP_HIDE_FROM_ABI deque(from_range_t, _Range&& __range, const allocator_type& __a = allocator_type()) 600 : __map_(__pointer_allocator(__a)), __start_(0), __size_(0, __a) { 601 if constexpr (ranges::forward_range<_Range> || ranges::sized_range<_Range>) { 602 __append_with_size(ranges::begin(__range), ranges::distance(__range)); 603 604 } else { 605 for (auto&& __e : __range) { 606 emplace_back(std::forward<decltype(__e)>(__e)); 607 } 608 } 609 } 610#endif 611 612 _LIBCPP_HIDE_FROM_ABI deque(const deque& __c); 613 _LIBCPP_HIDE_FROM_ABI deque(const deque& __c, const __type_identity_t<allocator_type>& __a); 614 615 _LIBCPP_HIDE_FROM_ABI deque& operator=(const deque& __c); 616 617#ifndef _LIBCPP_CXX03_LANG 618 _LIBCPP_HIDE_FROM_ABI deque(initializer_list<value_type> __il); 619 _LIBCPP_HIDE_FROM_ABI deque(initializer_list<value_type> __il, const allocator_type& __a); 620 621 _LIBCPP_HIDE_FROM_ABI deque& operator=(initializer_list<value_type> __il) { 622 assign(__il); 623 return *this; 624 } 625 626 _LIBCPP_HIDE_FROM_ABI deque(deque&& __c) _NOEXCEPT_(is_nothrow_move_constructible<allocator_type>::value); 627 _LIBCPP_HIDE_FROM_ABI deque(deque&& __c, const __type_identity_t<allocator_type>& __a); 628 _LIBCPP_HIDE_FROM_ABI deque& operator=(deque&& __c) 629 _NOEXCEPT_(__alloc_traits::propagate_on_container_move_assignment::value&& 630 is_nothrow_move_assignable<allocator_type>::value); 631 632 _LIBCPP_HIDE_FROM_ABI void assign(initializer_list<value_type> __il) { assign(__il.begin(), __il.end()); } 633#endif // _LIBCPP_CXX03_LANG 634 635 template <class _InputIter, 636 __enable_if_t<__has_input_iterator_category<_InputIter>::value && 637 !__has_random_access_iterator_category<_InputIter>::value, 638 int> = 0> 639 _LIBCPP_HIDE_FROM_ABI void assign(_InputIter __f, _InputIter __l); 640 template <class _RAIter, __enable_if_t<__has_random_access_iterator_category<_RAIter>::value, int> = 0> 641 _LIBCPP_HIDE_FROM_ABI void assign(_RAIter __f, _RAIter __l); 642 643#if _LIBCPP_STD_VER >= 23 644 template <_ContainerCompatibleRange<_Tp> _Range> 645 _LIBCPP_HIDE_FROM_ABI void assign_range(_Range&& __range) { 646 if constexpr (ranges::random_access_range<_Range>) { 647 auto __n = static_cast<size_type>(ranges::distance(__range)); 648 __assign_with_size_random_access(ranges::begin(__range), __n); 649 650 } else if constexpr (ranges::forward_range<_Range> || ranges::sized_range<_Range>) { 651 auto __n = static_cast<size_type>(ranges::distance(__range)); 652 __assign_with_size(ranges::begin(__range), __n); 653 654 } else { 655 __assign_with_sentinel(ranges::begin(__range), ranges::end(__range)); 656 } 657 } 658#endif 659 660 _LIBCPP_HIDE_FROM_ABI void assign(size_type __n, const value_type& __v); 661 662 _LIBCPP_HIDE_FROM_ABI allocator_type get_allocator() const _NOEXCEPT; 663 _LIBCPP_HIDE_FROM_ABI allocator_type& __alloc() _NOEXCEPT { return __size_.second(); } 664 _LIBCPP_HIDE_FROM_ABI const allocator_type& __alloc() const _NOEXCEPT { return __size_.second(); } 665 666 // iterators: 667 668 _LIBCPP_HIDE_FROM_ABI iterator begin() _NOEXCEPT { 669 __map_pointer __mp = __map_.begin() + __start_ / __block_size; 670 return iterator(__mp, __map_.empty() ? 0 : *__mp + __start_ % __block_size); 671 } 672 673 _LIBCPP_HIDE_FROM_ABI const_iterator begin() const _NOEXCEPT { 674 __map_const_pointer __mp = static_cast<__map_const_pointer>(__map_.begin() + __start_ / __block_size); 675 return const_iterator(__mp, __map_.empty() ? 0 : *__mp + __start_ % __block_size); 676 } 677 678 _LIBCPP_HIDE_FROM_ABI iterator end() _NOEXCEPT { 679 size_type __p = size() + __start_; 680 __map_pointer __mp = __map_.begin() + __p / __block_size; 681 return iterator(__mp, __map_.empty() ? 0 : *__mp + __p % __block_size); 682 } 683 684 _LIBCPP_HIDE_FROM_ABI const_iterator end() const _NOEXCEPT { 685 size_type __p = size() + __start_; 686 __map_const_pointer __mp = static_cast<__map_const_pointer>(__map_.begin() + __p / __block_size); 687 return const_iterator(__mp, __map_.empty() ? 0 : *__mp + __p % __block_size); 688 } 689 690 _LIBCPP_HIDE_FROM_ABI reverse_iterator rbegin() _NOEXCEPT { return reverse_iterator(end()); } 691 _LIBCPP_HIDE_FROM_ABI const_reverse_iterator rbegin() const _NOEXCEPT { return const_reverse_iterator(end()); } 692 _LIBCPP_HIDE_FROM_ABI reverse_iterator rend() _NOEXCEPT { return reverse_iterator(begin()); } 693 _LIBCPP_HIDE_FROM_ABI const_reverse_iterator rend() const _NOEXCEPT { return const_reverse_iterator(begin()); } 694 695 _LIBCPP_HIDE_FROM_ABI const_iterator cbegin() const _NOEXCEPT { return begin(); } 696 _LIBCPP_HIDE_FROM_ABI const_iterator cend() const _NOEXCEPT { return end(); } 697 _LIBCPP_HIDE_FROM_ABI const_reverse_iterator crbegin() const _NOEXCEPT { return const_reverse_iterator(end()); } 698 _LIBCPP_HIDE_FROM_ABI const_reverse_iterator crend() const _NOEXCEPT { return const_reverse_iterator(begin()); } 699 700 // capacity: 701 _LIBCPP_HIDE_FROM_ABI size_type size() const _NOEXCEPT { return __size(); } 702 703 _LIBCPP_HIDE_FROM_ABI size_type& __size() _NOEXCEPT { return __size_.first(); } 704 _LIBCPP_HIDE_FROM_ABI const size_type& __size() const _NOEXCEPT { return __size_.first(); } 705 706 _LIBCPP_HIDE_FROM_ABI size_type max_size() const _NOEXCEPT { 707 return std::min<size_type>(__alloc_traits::max_size(__alloc()), numeric_limits<difference_type>::max()); 708 } 709 _LIBCPP_HIDE_FROM_ABI void resize(size_type __n); 710 _LIBCPP_HIDE_FROM_ABI void resize(size_type __n, const value_type& __v); 711 _LIBCPP_HIDE_FROM_ABI void shrink_to_fit() _NOEXCEPT; 712 _LIBCPP_NODISCARD_AFTER_CXX17 _LIBCPP_HIDE_FROM_ABI bool empty() const _NOEXCEPT { return size() == 0; } 713 714 // element access: 715 _LIBCPP_HIDE_FROM_ABI reference operator[](size_type __i) _NOEXCEPT; 716 _LIBCPP_HIDE_FROM_ABI const_reference operator[](size_type __i) const _NOEXCEPT; 717 _LIBCPP_HIDE_FROM_ABI reference at(size_type __i); 718 _LIBCPP_HIDE_FROM_ABI const_reference at(size_type __i) const; 719 _LIBCPP_HIDE_FROM_ABI reference front() _NOEXCEPT; 720 _LIBCPP_HIDE_FROM_ABI const_reference front() const _NOEXCEPT; 721 _LIBCPP_HIDE_FROM_ABI reference back() _NOEXCEPT; 722 _LIBCPP_HIDE_FROM_ABI const_reference back() const _NOEXCEPT; 723 724 // 23.2.2.3 modifiers: 725 _LIBCPP_HIDE_FROM_ABI void push_front(const value_type& __v); 726 _LIBCPP_HIDE_FROM_ABI void push_back(const value_type& __v); 727#ifndef _LIBCPP_CXX03_LANG 728# if _LIBCPP_STD_VER >= 17 729 template <class... _Args> 730 _LIBCPP_HIDE_FROM_ABI reference emplace_front(_Args&&... __args); 731 template <class... _Args> 732 _LIBCPP_HIDE_FROM_ABI reference emplace_back(_Args&&... __args); 733# else 734 template <class... _Args> 735 _LIBCPP_HIDE_FROM_ABI void emplace_front(_Args&&... __args); 736 template <class... _Args> 737 _LIBCPP_HIDE_FROM_ABI void emplace_back(_Args&&... __args); 738# endif 739 template <class... _Args> 740 _LIBCPP_HIDE_FROM_ABI iterator emplace(const_iterator __p, _Args&&... __args); 741 742 _LIBCPP_HIDE_FROM_ABI void push_front(value_type&& __v); 743 _LIBCPP_HIDE_FROM_ABI void push_back(value_type&& __v); 744 745# if _LIBCPP_STD_VER >= 23 746 template <_ContainerCompatibleRange<_Tp> _Range> 747 _LIBCPP_HIDE_FROM_ABI void prepend_range(_Range&& __range) { 748 insert_range(begin(), std::forward<_Range>(__range)); 749 } 750 751 template <_ContainerCompatibleRange<_Tp> _Range> 752 _LIBCPP_HIDE_FROM_ABI void append_range(_Range&& __range) { 753 insert_range(end(), std::forward<_Range>(__range)); 754 } 755# endif 756 757 _LIBCPP_HIDE_FROM_ABI iterator insert(const_iterator __p, value_type&& __v); 758 759 _LIBCPP_HIDE_FROM_ABI iterator insert(const_iterator __p, initializer_list<value_type> __il) { 760 return insert(__p, __il.begin(), __il.end()); 761 } 762#endif // _LIBCPP_CXX03_LANG 763 _LIBCPP_HIDE_FROM_ABI iterator insert(const_iterator __p, const value_type& __v); 764 _LIBCPP_HIDE_FROM_ABI iterator insert(const_iterator __p, size_type __n, const value_type& __v); 765 template <class _InputIter, __enable_if_t<__has_exactly_input_iterator_category<_InputIter>::value, int> = 0> 766 _LIBCPP_HIDE_FROM_ABI iterator insert(const_iterator __p, _InputIter __f, _InputIter __l); 767 template <class _ForwardIterator, 768 __enable_if_t<__has_exactly_forward_iterator_category<_ForwardIterator>::value, int> = 0> 769 _LIBCPP_HIDE_FROM_ABI iterator insert(const_iterator __p, _ForwardIterator __f, _ForwardIterator __l); 770 template <class _BiIter, __enable_if_t<__has_bidirectional_iterator_category<_BiIter>::value, int> = 0> 771 _LIBCPP_HIDE_FROM_ABI iterator insert(const_iterator __p, _BiIter __f, _BiIter __l); 772 773#if _LIBCPP_STD_VER >= 23 774 template <_ContainerCompatibleRange<_Tp> _Range> 775 _LIBCPP_HIDE_FROM_ABI iterator insert_range(const_iterator __position, _Range&& __range) { 776 if constexpr (ranges::bidirectional_range<_Range>) { 777 auto __n = static_cast<size_type>(ranges::distance(__range)); 778 return __insert_bidirectional(__position, ranges::begin(__range), ranges::end(__range), __n); 779 780 } else if constexpr (ranges::forward_range<_Range> || ranges::sized_range<_Range>) { 781 auto __n = static_cast<size_type>(ranges::distance(__range)); 782 return __insert_with_size(__position, ranges::begin(__range), __n); 783 784 } else { 785 return __insert_with_sentinel(__position, ranges::begin(__range), ranges::end(__range)); 786 } 787 } 788#endif 789 790 _LIBCPP_HIDE_FROM_ABI void pop_front(); 791 _LIBCPP_HIDE_FROM_ABI void pop_back(); 792 _LIBCPP_HIDE_FROM_ABI iterator erase(const_iterator __p); 793 _LIBCPP_HIDE_FROM_ABI iterator erase(const_iterator __f, const_iterator __l); 794 795 _LIBCPP_HIDE_FROM_ABI void swap(deque& __c) 796#if _LIBCPP_STD_VER >= 14 797 _NOEXCEPT; 798#else 799 _NOEXCEPT_(!__alloc_traits::propagate_on_container_swap::value || __is_nothrow_swappable<allocator_type>::value); 800#endif 801 _LIBCPP_HIDE_FROM_ABI void clear() _NOEXCEPT; 802 803 _LIBCPP_HIDE_FROM_ABI bool __invariants() const { 804 if (!__map_.__invariants()) 805 return false; 806 if (__map_.size() >= size_type(-1) / __block_size) 807 return false; 808 for (__map_const_iterator __i = __map_.begin(), __e = __map_.end(); __i != __e; ++__i) 809 if (*__i == nullptr) 810 return false; 811 if (__map_.size() != 0) { 812 if (size() >= __map_.size() * __block_size) 813 return false; 814 if (__start_ >= __map_.size() * __block_size - size()) 815 return false; 816 } else { 817 if (size() != 0) 818 return false; 819 if (__start_ != 0) 820 return false; 821 } 822 return true; 823 } 824 825 _LIBCPP_HIDE_FROM_ABI void __move_assign_alloc(deque& __c) 826 _NOEXCEPT_(!__alloc_traits::propagate_on_container_move_assignment::value || 827 is_nothrow_move_assignable<allocator_type>::value) { 828 __move_assign_alloc(__c, integral_constant<bool, __alloc_traits::propagate_on_container_move_assignment::value>()); 829 } 830 831 _LIBCPP_HIDE_FROM_ABI void __move_assign_alloc(deque& __c, true_type) 832 _NOEXCEPT_(is_nothrow_move_assignable<allocator_type>::value) { 833 __alloc() = std::move(__c.__alloc()); 834 } 835 836 _LIBCPP_HIDE_FROM_ABI void __move_assign_alloc(deque&, false_type) _NOEXCEPT {} 837 838 _LIBCPP_HIDE_FROM_ABI void __move_assign(deque& __c) 839 _NOEXCEPT_(__alloc_traits::propagate_on_container_move_assignment::value&& 840 is_nothrow_move_assignable<allocator_type>::value) { 841 __map_ = std::move(__c.__map_); 842 __start_ = __c.__start_; 843 __size() = __c.size(); 844 __move_assign_alloc(__c); 845 __c.__start_ = __c.__size() = 0; 846 } 847 848 _LIBCPP_HIDE_FROM_ABI static size_type __recommend_blocks(size_type __n) { 849 return __n / __block_size + (__n % __block_size != 0); 850 } 851 _LIBCPP_HIDE_FROM_ABI size_type __capacity() const { 852 return __map_.size() == 0 ? 0 : __map_.size() * __block_size - 1; 853 } 854 _LIBCPP_HIDE_FROM_ABI size_type __block_count() const { return __map_.size(); } 855 856 _LIBCPP_HIDE_FROM_ABI size_type __front_spare() const { return __start_; } 857 _LIBCPP_HIDE_FROM_ABI size_type __front_spare_blocks() const { return __front_spare() / __block_size; } 858 _LIBCPP_HIDE_FROM_ABI size_type __back_spare() const { return __capacity() - (__start_ + size()); } 859 _LIBCPP_HIDE_FROM_ABI size_type __back_spare_blocks() const { return __back_spare() / __block_size; } 860 861private: 862 enum __asan_annotation_type { __asan_unposion, __asan_poison }; 863 864 enum __asan_annotation_place { 865 __asan_front_moved, 866 __asan_back_moved, 867 }; 868 869 // The following functions are no-ops outside of AddressSanitizer mode. 870 // We call annotations for every allocator, unless explicitly disabled. 871 // 872 // To disable annotations for a particular allocator, change value of 873 // __asan_annotate_container_with_allocator to false. 874 // For more details, see the "Using libc++" documentation page or 875 // the documentation for __sanitizer_annotate_contiguous_container. 876 _LIBCPP_HIDE_FROM_ABI void __annotate_double_ended_contiguous_container( 877 const void* __beg, 878 const void* __end, 879 const void* __old_con_beg, 880 const void* __old_con_end, 881 const void* __new_con_beg, 882 const void* __new_con_end) const { 883 (void)__beg; 884 (void)__end; 885 (void)__old_con_beg; 886 (void)__old_con_end; 887 (void)__new_con_beg; 888 (void)__new_con_end; 889#ifndef _LIBCPP_HAS_NO_ASAN 890 if (__beg != nullptr && __asan_annotate_container_with_allocator<_Allocator>::value) 891 __sanitizer_annotate_double_ended_contiguous_container( 892 __beg, __end, __old_con_beg, __old_con_end, __new_con_beg, __new_con_end); 893#endif 894 } 895 896 _LIBCPP_HIDE_FROM_ABI void __annotate_from_to( 897 size_type __beg, 898 size_type __end, 899 __asan_annotation_type __annotation_type, 900 __asan_annotation_place __place) const _NOEXCEPT { 901 (void)__beg; 902 (void)__end; 903 (void)__annotation_type; 904 (void)__place; 905#ifndef _LIBCPP_HAS_NO_ASAN 906 // __beg - index of the first item to annotate 907 // __end - index behind the last item to annotate (so last item + 1) 908 // __annotation_type - __asan_unposion or __asan_poison 909 // __place - __asan_front_moved or __asan_back_moved 910 // Note: All indexes in __map_ 911 if (__beg == __end) 912 return; 913 // __annotations_beg_map - first chunk which annotations we want to modify 914 // __annotations_end_map - last chunk which annotations we want to modify 915 // NOTE: if __end % __block_size == 0, __annotations_end_map points at the next block, which may not exist 916 __map_const_iterator __annotations_beg_map = __map_.begin() + __beg / __block_size; 917 __map_const_iterator __annotations_end_map = __map_.begin() + __end / __block_size; 918 919 bool const __poisoning = __annotation_type == __asan_poison; 920 // __old_c_beg_index - index of the first element in old container 921 // __old_c_end_index - index of the end of old container (last + 1) 922 // Note: may be outside the area we are annotating 923 size_t __old_c_beg_index = (__poisoning && __place == __asan_front_moved) ? __beg : __start_; 924 size_t __old_c_end_index = (__poisoning && __place == __asan_back_moved) ? __end : __start_ + size(); 925 bool const __front = __place == __asan_front_moved; 926 927 if (__poisoning && empty()) { 928 // Special case: we shouldn't trust __start_ 929 __old_c_beg_index = __beg; 930 __old_c_end_index = __end; 931 } 932 // __old_c_beg_map - memory block (chunk) with first element 933 // __old_c_end_map - memory block (chunk) with end of old container 934 // Note: if __old_c_end_index % __block_size == 0, __old_c_end_map points at the next block, 935 // which may not exist 936 __map_const_iterator __old_c_beg_map = __map_.begin() + __old_c_beg_index / __block_size; 937 __map_const_iterator __old_c_end_map = __map_.begin() + __old_c_end_index / __block_size; 938 939 // One edge (front/end) of the container was moved and one was not modified. 940 // __new_edge_index - index of new edge 941 // __new_edge_map - memory block (chunk) with new edge, it always equals to 942 // __annotations_beg_map or __annotations_end_map 943 // __old_edge_map - memory block (chunk) with old edge, it always equals to 944 // __old_c_beg_map or __old_c_end_map 945 size_t __new_edge_index = (__poisoning ^ __front) ? __beg : __end; 946 __map_const_iterator __new_edge_map = __map_.begin() + __new_edge_index / __block_size; 947 __map_const_iterator __old_edge_map = __front ? __old_c_end_map : __old_c_beg_map; 948 949 // We iterate over map pointers (chunks) and fully poison all memory blocks between the first and the last. 950 // First and last chunk may be partially poisoned. 951 // __annotate_end_map may point at not existing chunk, therefore we have to have a check for it. 952 for (__map_const_iterator __map_it = __annotations_beg_map; __map_it <= __annotations_end_map; ++__map_it) { 953 if (__map_it == __annotations_end_map && __end % __block_size == 0) 954 // Chunk may not exist, but nothing to do here anyway 955 break; 956 957 // The beginning and the end of the current memory block 958 const void* __mem_beg = std::__to_address(*__map_it); 959 const void* __mem_end = std::__to_address(*__map_it + __block_size); 960 961 // The beginning of memory-in-use in the memory block before container modification 962 const void* __old_beg = 963 (__map_it == __old_c_beg_map) ? std::__to_address(*__map_it + (__old_c_beg_index % __block_size)) : __mem_beg; 964 965 // The end of memory-in-use in the memory block before container modification 966 const void* __old_end; 967 if (__map_it < __old_c_beg_map || __map_it > __old_c_end_map || (!__poisoning && empty())) 968 __old_end = __old_beg; 969 else 970 __old_end = (__map_it == __old_c_end_map) 971 ? std::__to_address(*__map_it + (__old_c_end_index % __block_size)) 972 : __mem_end; 973 974 // New edge of the container in current memory block 975 // If the edge is in a different chunk it points on corresponding end of the memory block 976 const void* __new_edge; 977 if (__map_it == __new_edge_map) 978 __new_edge = std::__to_address(*__map_it + (__new_edge_index % __block_size)); 979 else 980 __new_edge = (__poisoning ^ __front) ? __mem_beg : __mem_end; 981 982 // Not modified edge of the container 983 // If the edge is in a different chunk it points on corresponding end of the memory block 984 const void* __old_edge; 985 if (__map_it == __old_edge_map) 986 __old_edge = __front ? __old_end : __old_beg; 987 else 988 __old_edge = __front ? __mem_end : __mem_beg; 989 990 // __new_beg - the beginning of memory-in-use in the memory block after container modification 991 // __new_end - the end of memory-in-use in the memory block after container modification 992 const void* __new_beg = __front ? __new_edge : __old_edge; 993 const void* __new_end = __front ? __old_edge : __new_edge; 994 995 __annotate_double_ended_contiguous_container(__mem_beg, __mem_end, __old_beg, __old_end, __new_beg, __new_end); 996 } 997#endif // !_LIBCPP_HAS_NO_ASAN 998 } 999 1000 _LIBCPP_HIDE_FROM_ABI void __annotate_new(size_type __current_size) const _NOEXCEPT { 1001 (void)__current_size; 1002#ifndef _LIBCPP_HAS_NO_ASAN 1003 if (__current_size == 0) 1004 __annotate_from_to(0, __map_.size() * __block_size, __asan_poison, __asan_back_moved); 1005 else { 1006 __annotate_from_to(0, __start_, __asan_poison, __asan_front_moved); 1007 __annotate_from_to(__start_ + __current_size, __map_.size() * __block_size, __asan_poison, __asan_back_moved); 1008 } 1009#endif 1010 } 1011 1012 _LIBCPP_HIDE_FROM_ABI void __annotate_delete() const _NOEXCEPT { 1013#ifndef _LIBCPP_HAS_NO_ASAN 1014 if (empty()) { 1015 for (size_t __i = 0; __i < __map_.size(); ++__i) { 1016 __annotate_whole_block(__i, __asan_unposion); 1017 } 1018 } else { 1019 __annotate_from_to(0, __start_, __asan_unposion, __asan_front_moved); 1020 __annotate_from_to(__start_ + size(), __map_.size() * __block_size, __asan_unposion, __asan_back_moved); 1021 } 1022#endif 1023 } 1024 1025 _LIBCPP_HIDE_FROM_ABI void __annotate_increase_front(size_type __n) const _NOEXCEPT { 1026 (void)__n; 1027#ifndef _LIBCPP_HAS_NO_ASAN 1028 __annotate_from_to(__start_ - __n, __start_, __asan_unposion, __asan_front_moved); 1029#endif 1030 } 1031 1032 _LIBCPP_HIDE_FROM_ABI void __annotate_increase_back(size_type __n) const _NOEXCEPT { 1033 (void)__n; 1034#ifndef _LIBCPP_HAS_NO_ASAN 1035 __annotate_from_to(__start_ + size(), __start_ + size() + __n, __asan_unposion, __asan_back_moved); 1036#endif 1037 } 1038 1039 _LIBCPP_HIDE_FROM_ABI void __annotate_shrink_front(size_type __old_size, size_type __old_start) const _NOEXCEPT { 1040 (void)__old_size; 1041 (void)__old_start; 1042#ifndef _LIBCPP_HAS_NO_ASAN 1043 __annotate_from_to(__old_start, __old_start + (__old_size - size()), __asan_poison, __asan_front_moved); 1044#endif 1045 } 1046 1047 _LIBCPP_HIDE_FROM_ABI void __annotate_shrink_back(size_type __old_size, size_type __old_start) const _NOEXCEPT { 1048 (void)__old_size; 1049 (void)__old_start; 1050#ifndef _LIBCPP_HAS_NO_ASAN 1051 __annotate_from_to(__old_start + size(), __old_start + __old_size, __asan_poison, __asan_back_moved); 1052#endif 1053 } 1054 1055 _LIBCPP_HIDE_FROM_ABI void __annotate_poison_block(const void* __beginning, const void* __end) const _NOEXCEPT { 1056 (void)__beginning; 1057 (void)__end; 1058#ifndef _LIBCPP_HAS_NO_ASAN 1059 __annotate_double_ended_contiguous_container(__beginning, __end, __beginning, __end, __end, __end); 1060#endif 1061 } 1062 1063 _LIBCPP_HIDE_FROM_ABI void 1064 __annotate_whole_block(size_t __block_index, __asan_annotation_type __annotation_type) const _NOEXCEPT { 1065 (void)__block_index; 1066 (void)__annotation_type; 1067#ifndef _LIBCPP_HAS_NO_ASAN 1068 __map_const_iterator __block_it = __map_.begin() + __block_index; 1069 const void* __block_start = std::__to_address(*__block_it); 1070 const void* __block_end = std::__to_address(*__block_it + __block_size); 1071 1072 if (__annotation_type == __asan_poison) 1073 __annotate_poison_block(__block_start, __block_end); 1074 else { 1075 __annotate_double_ended_contiguous_container( 1076 __block_start, __block_end, __block_start, __block_start, __block_start, __block_end); 1077 } 1078#endif 1079 } 1080#if !defined(_LIBCPP_HAS_NO_ASAN) 1081 1082public: 1083 _LIBCPP_HIDE_FROM_ABI bool __verify_asan_annotations() const _NOEXCEPT { 1084 // This function tests deque object annotations. 1085 if (empty()) { 1086 for (__map_const_iterator __it = __map_.begin(); __it != __map_.end(); ++__it) { 1087 if (!__sanitizer_verify_double_ended_contiguous_container( 1088 std::__to_address(*__it), 1089 std::__to_address(*__it), 1090 std::__to_address(*__it), 1091 std::__to_address(*__it + __block_size))) 1092 return false; 1093 } 1094 1095 return true; 1096 } 1097 1098 size_type __end = __start_ + size(); 1099 __map_const_iterator __first_mp = __map_.begin() + __start_ / __block_size; 1100 __map_const_iterator __last_mp = __map_.begin() + (__end - 1) / __block_size; 1101 1102 // Pointers to first and after last elements 1103 // Those can be in different deque blocks 1104 const void* __p_beg = std::__to_address(*__first_mp + (__start_ % __block_size)); 1105 const void* __p_end = 1106 std::__to_address(*__last_mp + ((__end % __block_size == 0) ? __block_size : __end % __block_size)); 1107 1108 for (__map_const_iterator __it = __map_.begin(); __it != __map_.end(); ++__it) { 1109 // Go over all blocks, find the place we are in and verify its annotations 1110 // Note that __p_end points *behind* the last item. 1111 1112 // - blocks before the first block with container elements 1113 // - first block with items 1114 // - last block with items 1115 // - blocks after last block with ciontainer elements 1116 1117 // Is the block before or after deque blocks that contain elements? 1118 if (__it < __first_mp || __it > __last_mp) { 1119 if (!__sanitizer_verify_double_ended_contiguous_container( 1120 std::__to_address(*__it), 1121 std::__to_address(*__it), 1122 std::__to_address(*__it), 1123 std::__to_address(*__it + __block_size))) 1124 return false; 1125 } else { 1126 const void* __containers_buffer_beg = (__it == __first_mp) ? __p_beg : (const void*)std::__to_address(*__it); 1127 const void* __containers_buffer_end = 1128 (__it == __last_mp) ? __p_end : (const void*)std::__to_address(*__it + __block_size); 1129 if (!__sanitizer_verify_double_ended_contiguous_container( 1130 std::__to_address(*__it), 1131 __containers_buffer_beg, 1132 __containers_buffer_end, 1133 std::__to_address(*__it + __block_size))) { 1134 return false; 1135 } 1136 } 1137 } 1138 return true; 1139 } 1140 1141private: 1142#endif // _LIBCPP_VERIFY_ASAN_DEQUE_ANNOTATIONS 1143 _LIBCPP_HIDE_FROM_ABI bool __maybe_remove_front_spare(bool __keep_one = true) { 1144 if (__front_spare_blocks() >= 2 || (!__keep_one && __front_spare_blocks())) { 1145 __annotate_whole_block(0, __asan_unposion); 1146 __alloc_traits::deallocate(__alloc(), __map_.front(), __block_size); 1147 __map_.pop_front(); 1148 __start_ -= __block_size; 1149 return true; 1150 } 1151 return false; 1152 } 1153 1154 _LIBCPP_HIDE_FROM_ABI bool __maybe_remove_back_spare(bool __keep_one = true) { 1155 if (__back_spare_blocks() >= 2 || (!__keep_one && __back_spare_blocks())) { 1156 __annotate_whole_block(__map_.size() - 1, __asan_unposion); 1157 __alloc_traits::deallocate(__alloc(), __map_.back(), __block_size); 1158 __map_.pop_back(); 1159 return true; 1160 } 1161 return false; 1162 } 1163 1164 template <class _Iterator, class _Sentinel> 1165 _LIBCPP_HIDE_FROM_ABI void __assign_with_sentinel(_Iterator __f, _Sentinel __l); 1166 1167 template <class _RandomAccessIterator> 1168 _LIBCPP_HIDE_FROM_ABI void __assign_with_size_random_access(_RandomAccessIterator __f, difference_type __n); 1169 template <class _Iterator> 1170 _LIBCPP_HIDE_FROM_ABI void __assign_with_size(_Iterator __f, difference_type __n); 1171 1172 template <class _Iterator, class _Sentinel> 1173 _LIBCPP_HIDE_FROM_ABI iterator __insert_with_sentinel(const_iterator __p, _Iterator __f, _Sentinel __l); 1174 1175 template <class _Iterator> 1176 _LIBCPP_HIDE_FROM_ABI iterator __insert_with_size(const_iterator __p, _Iterator __f, size_type __n); 1177 1178 template <class _BiIter, class _Sentinel> 1179 _LIBCPP_HIDE_FROM_ABI iterator 1180 __insert_bidirectional(const_iterator __p, _BiIter __f, _Sentinel __sent, size_type __n); 1181 template <class _BiIter> 1182 _LIBCPP_HIDE_FROM_ABI iterator __insert_bidirectional(const_iterator __p, _BiIter __f, _BiIter __l, size_type __n); 1183 1184 template <class _InpIter, __enable_if_t<__has_exactly_input_iterator_category<_InpIter>::value, int> = 0> 1185 _LIBCPP_HIDE_FROM_ABI void __append(_InpIter __f, _InpIter __l); 1186 template <class _ForIter, __enable_if_t<__has_forward_iterator_category<_ForIter>::value, int> = 0> 1187 _LIBCPP_HIDE_FROM_ABI void __append(_ForIter __f, _ForIter __l); 1188 1189 template <class _InputIterator> 1190 _LIBCPP_HIDE_FROM_ABI void __append_with_size(_InputIterator __from, size_type __n); 1191 template <class _InputIterator, class _Sentinel> 1192 _LIBCPP_HIDE_FROM_ABI void __append_with_sentinel(_InputIterator __f, _Sentinel __l); 1193 1194 _LIBCPP_HIDE_FROM_ABI void __append(size_type __n); 1195 _LIBCPP_HIDE_FROM_ABI void __append(size_type __n, const value_type& __v); 1196 _LIBCPP_HIDE_FROM_ABI void __erase_to_end(const_iterator __f); 1197 _LIBCPP_HIDE_FROM_ABI void __add_front_capacity(); 1198 _LIBCPP_HIDE_FROM_ABI void __add_front_capacity(size_type __n); 1199 _LIBCPP_HIDE_FROM_ABI void __add_back_capacity(); 1200 _LIBCPP_HIDE_FROM_ABI void __add_back_capacity(size_type __n); 1201 _LIBCPP_HIDE_FROM_ABI iterator __move_and_check(iterator __f, iterator __l, iterator __r, const_pointer& __vt); 1202 _LIBCPP_HIDE_FROM_ABI iterator 1203 __move_backward_and_check(iterator __f, iterator __l, iterator __r, const_pointer& __vt); 1204 _LIBCPP_HIDE_FROM_ABI void __move_construct_and_check(iterator __f, iterator __l, iterator __r, const_pointer& __vt); 1205 _LIBCPP_HIDE_FROM_ABI void 1206 __move_construct_backward_and_check(iterator __f, iterator __l, iterator __r, const_pointer& __vt); 1207 1208 _LIBCPP_HIDE_FROM_ABI void __copy_assign_alloc(const deque& __c) { 1209 __copy_assign_alloc(__c, integral_constant<bool, __alloc_traits::propagate_on_container_copy_assignment::value>()); 1210 } 1211 1212 _LIBCPP_HIDE_FROM_ABI void __copy_assign_alloc(const deque& __c, true_type) { 1213 if (__alloc() != __c.__alloc()) { 1214 clear(); 1215 shrink_to_fit(); 1216 } 1217 __alloc() = __c.__alloc(); 1218 __map_.__alloc() = __c.__map_.__alloc(); 1219 } 1220 1221 _LIBCPP_HIDE_FROM_ABI void __copy_assign_alloc(const deque&, false_type) {} 1222 1223 _LIBCPP_HIDE_FROM_ABI void __move_assign(deque& __c, true_type) 1224 _NOEXCEPT_(is_nothrow_move_assignable<allocator_type>::value); 1225 _LIBCPP_HIDE_FROM_ABI void __move_assign(deque& __c, false_type); 1226}; 1227 1228template <class _Tp, class _Alloc> 1229_LIBCPP_CONSTEXPR const typename allocator_traits<_Alloc>::difference_type deque<_Tp, _Alloc>::__block_size = 1230 __deque_block_size<value_type, difference_type>::value; 1231 1232#if _LIBCPP_STD_VER >= 17 1233template <class _InputIterator, 1234 class _Alloc = allocator<__iter_value_type<_InputIterator>>, 1235 class = enable_if_t<__has_input_iterator_category<_InputIterator>::value>, 1236 class = enable_if_t<__is_allocator<_Alloc>::value> > 1237deque(_InputIterator, _InputIterator) -> deque<__iter_value_type<_InputIterator>, _Alloc>; 1238 1239template <class _InputIterator, 1240 class _Alloc, 1241 class = enable_if_t<__has_input_iterator_category<_InputIterator>::value>, 1242 class = enable_if_t<__is_allocator<_Alloc>::value> > 1243deque(_InputIterator, _InputIterator, _Alloc) -> deque<__iter_value_type<_InputIterator>, _Alloc>; 1244#endif 1245 1246#if _LIBCPP_STD_VER >= 23 1247template <ranges::input_range _Range, 1248 class _Alloc = allocator<ranges::range_value_t<_Range>>, 1249 class = enable_if_t<__is_allocator<_Alloc>::value> > 1250deque(from_range_t, _Range&&, _Alloc = _Alloc()) -> deque<ranges::range_value_t<_Range>, _Alloc>; 1251#endif 1252 1253template <class _Tp, class _Allocator> 1254deque<_Tp, _Allocator>::deque(size_type __n) : __start_(0), __size_(0, __default_init_tag()) { 1255 __annotate_new(0); 1256 if (__n > 0) 1257 __append(__n); 1258} 1259 1260#if _LIBCPP_STD_VER >= 14 1261template <class _Tp, class _Allocator> 1262deque<_Tp, _Allocator>::deque(size_type __n, const _Allocator& __a) 1263 : __map_(__pointer_allocator(__a)), __start_(0), __size_(0, __a) { 1264 __annotate_new(0); 1265 if (__n > 0) 1266 __append(__n); 1267} 1268#endif 1269 1270template <class _Tp, class _Allocator> 1271deque<_Tp, _Allocator>::deque(size_type __n, const value_type& __v) : __start_(0), __size_(0, __default_init_tag()) { 1272 __annotate_new(0); 1273 if (__n > 0) 1274 __append(__n, __v); 1275} 1276 1277template <class _Tp, class _Allocator> 1278template <class _InputIter, __enable_if_t<__has_input_iterator_category<_InputIter>::value, int> > 1279deque<_Tp, _Allocator>::deque(_InputIter __f, _InputIter __l) : __start_(0), __size_(0, __default_init_tag()) { 1280 __annotate_new(0); 1281 __append(__f, __l); 1282} 1283 1284template <class _Tp, class _Allocator> 1285template <class _InputIter, __enable_if_t<__has_input_iterator_category<_InputIter>::value, int> > 1286deque<_Tp, _Allocator>::deque(_InputIter __f, _InputIter __l, const allocator_type& __a) 1287 : __map_(__pointer_allocator(__a)), __start_(0), __size_(0, __a) { 1288 __annotate_new(0); 1289 __append(__f, __l); 1290} 1291 1292template <class _Tp, class _Allocator> 1293deque<_Tp, _Allocator>::deque(const deque& __c) 1294 : __map_(__pointer_allocator(__alloc_traits::select_on_container_copy_construction(__c.__alloc()))), 1295 __start_(0), 1296 __size_(0, __map_.__alloc()) { 1297 __annotate_new(0); 1298 __append(__c.begin(), __c.end()); 1299} 1300 1301template <class _Tp, class _Allocator> 1302deque<_Tp, _Allocator>::deque(const deque& __c, const __type_identity_t<allocator_type>& __a) 1303 : __map_(__pointer_allocator(__a)), __start_(0), __size_(0, __a) { 1304 __annotate_new(0); 1305 __append(__c.begin(), __c.end()); 1306} 1307 1308template <class _Tp, class _Allocator> 1309deque<_Tp, _Allocator>& deque<_Tp, _Allocator>::operator=(const deque& __c) { 1310 if (this != std::addressof(__c)) { 1311 __copy_assign_alloc(__c); 1312 assign(__c.begin(), __c.end()); 1313 } 1314 return *this; 1315} 1316 1317#ifndef _LIBCPP_CXX03_LANG 1318 1319template <class _Tp, class _Allocator> 1320deque<_Tp, _Allocator>::deque(initializer_list<value_type> __il) : __start_(0), __size_(0, __default_init_tag()) { 1321 __annotate_new(0); 1322 __append(__il.begin(), __il.end()); 1323} 1324 1325template <class _Tp, class _Allocator> 1326deque<_Tp, _Allocator>::deque(initializer_list<value_type> __il, const allocator_type& __a) 1327 : __map_(__pointer_allocator(__a)), __start_(0), __size_(0, __a) { 1328 __annotate_new(0); 1329 __append(__il.begin(), __il.end()); 1330} 1331 1332template <class _Tp, class _Allocator> 1333inline deque<_Tp, _Allocator>::deque(deque&& __c) _NOEXCEPT_(is_nothrow_move_constructible<allocator_type>::value) 1334 : __map_(std::move(__c.__map_)), __start_(std::move(__c.__start_)), __size_(std::move(__c.__size_)) { 1335 __c.__start_ = 0; 1336 __c.__size() = 0; 1337} 1338 1339template <class _Tp, class _Allocator> 1340inline deque<_Tp, _Allocator>::deque(deque&& __c, const __type_identity_t<allocator_type>& __a) 1341 : __map_(std::move(__c.__map_), __pointer_allocator(__a)), 1342 __start_(std::move(__c.__start_)), 1343 __size_(std::move(__c.__size()), __a) { 1344 if (__a == __c.__alloc()) { 1345 __c.__start_ = 0; 1346 __c.__size() = 0; 1347 } else { 1348 __map_.clear(); 1349 __start_ = 0; 1350 __size() = 0; 1351 typedef move_iterator<iterator> _Ip; 1352 assign(_Ip(__c.begin()), _Ip(__c.end())); 1353 } 1354} 1355 1356template <class _Tp, class _Allocator> 1357inline deque<_Tp, _Allocator>& deque<_Tp, _Allocator>::operator=(deque&& __c) _NOEXCEPT_( 1358 __alloc_traits::propagate_on_container_move_assignment::value&& is_nothrow_move_assignable<allocator_type>::value) { 1359 __move_assign(__c, integral_constant<bool, __alloc_traits::propagate_on_container_move_assignment::value>()); 1360 return *this; 1361} 1362 1363template <class _Tp, class _Allocator> 1364void deque<_Tp, _Allocator>::__move_assign(deque& __c, false_type) { 1365 if (__alloc() != __c.__alloc()) { 1366 typedef move_iterator<iterator> _Ip; 1367 assign(_Ip(__c.begin()), _Ip(__c.end())); 1368 } else 1369 __move_assign(__c, true_type()); 1370} 1371 1372template <class _Tp, class _Allocator> 1373void deque<_Tp, _Allocator>::__move_assign(deque& __c, true_type) 1374 _NOEXCEPT_(is_nothrow_move_assignable<allocator_type>::value) { 1375 clear(); 1376 shrink_to_fit(); 1377 __move_assign(__c); 1378} 1379 1380#endif // _LIBCPP_CXX03_LANG 1381 1382template <class _Tp, class _Allocator> 1383template <class _InputIter, 1384 __enable_if_t<__has_input_iterator_category<_InputIter>::value && 1385 !__has_random_access_iterator_category<_InputIter>::value, 1386 int> > 1387void deque<_Tp, _Allocator>::assign(_InputIter __f, _InputIter __l) { 1388 __assign_with_sentinel(__f, __l); 1389} 1390 1391template <class _Tp, class _Allocator> 1392template <class _Iterator, class _Sentinel> 1393_LIBCPP_HIDE_FROM_ABI void deque<_Tp, _Allocator>::__assign_with_sentinel(_Iterator __f, _Sentinel __l) { 1394 iterator __i = begin(); 1395 iterator __e = end(); 1396 for (; __f != __l && __i != __e; ++__f, (void)++__i) 1397 *__i = *__f; 1398 if (__f != __l) 1399 __append_with_sentinel(std::move(__f), std::move(__l)); 1400 else 1401 __erase_to_end(__i); 1402} 1403 1404template <class _Tp, class _Allocator> 1405template <class _RAIter, __enable_if_t<__has_random_access_iterator_category<_RAIter>::value, int> > 1406void deque<_Tp, _Allocator>::assign(_RAIter __f, _RAIter __l) { 1407 __assign_with_size_random_access(__f, __l - __f); 1408} 1409 1410template <class _Tp, class _Allocator> 1411template <class _RandomAccessIterator> 1412_LIBCPP_HIDE_FROM_ABI void 1413deque<_Tp, _Allocator>::__assign_with_size_random_access(_RandomAccessIterator __f, difference_type __n) { 1414 if (static_cast<size_type>(__n) > size()) { 1415 auto __l = __f + size(); 1416 std::copy(__f, __l, begin()); 1417 __append_with_size(__l, __n - size()); 1418 } else 1419 __erase_to_end(std::copy_n(__f, __n, begin())); 1420} 1421 1422template <class _Tp, class _Allocator> 1423template <class _Iterator> 1424_LIBCPP_HIDE_FROM_ABI void deque<_Tp, _Allocator>::__assign_with_size(_Iterator __f, difference_type __n) { 1425 if (static_cast<size_type>(__n) > size()) { 1426 auto __added_size = __n - size(); 1427 1428 auto __i = begin(); 1429 for (auto __count = size(); __count != 0; --__count) { 1430 *__i++ = *__f++; 1431 } 1432 1433 __append_with_size(__f, __added_size); 1434 1435 } else { 1436 __erase_to_end(std::copy_n(__f, __n, begin())); 1437 } 1438} 1439 1440template <class _Tp, class _Allocator> 1441void deque<_Tp, _Allocator>::assign(size_type __n, const value_type& __v) { 1442 if (__n > size()) { 1443 std::fill_n(begin(), size(), __v); 1444 __n -= size(); 1445 __append(__n, __v); 1446 } else 1447 __erase_to_end(std::fill_n(begin(), __n, __v)); 1448} 1449 1450template <class _Tp, class _Allocator> 1451inline _Allocator deque<_Tp, _Allocator>::get_allocator() const _NOEXCEPT { 1452 return __alloc(); 1453} 1454 1455template <class _Tp, class _Allocator> 1456void deque<_Tp, _Allocator>::resize(size_type __n) { 1457 if (__n > size()) 1458 __append(__n - size()); 1459 else if (__n < size()) 1460 __erase_to_end(begin() + __n); 1461} 1462 1463template <class _Tp, class _Allocator> 1464void deque<_Tp, _Allocator>::resize(size_type __n, const value_type& __v) { 1465 if (__n > size()) 1466 __append(__n - size(), __v); 1467 else if (__n < size()) 1468 __erase_to_end(begin() + __n); 1469} 1470 1471template <class _Tp, class _Allocator> 1472void deque<_Tp, _Allocator>::shrink_to_fit() _NOEXCEPT { 1473 allocator_type& __a = __alloc(); 1474 if (empty()) { 1475 __annotate_delete(); 1476 while (__map_.size() > 0) { 1477 __alloc_traits::deallocate(__a, __map_.back(), __block_size); 1478 __map_.pop_back(); 1479 } 1480 __start_ = 0; 1481 } else { 1482 __maybe_remove_front_spare(/*__keep_one=*/false); 1483 __maybe_remove_back_spare(/*__keep_one=*/false); 1484 } 1485 __map_.shrink_to_fit(); 1486} 1487 1488template <class _Tp, class _Allocator> 1489inline typename deque<_Tp, _Allocator>::reference deque<_Tp, _Allocator>::operator[](size_type __i) _NOEXCEPT { 1490 _LIBCPP_ASSERT_VALID_ELEMENT_ACCESS(__i < size(), "deque::operator[] index out of bounds"); 1491 size_type __p = __start_ + __i; 1492 return *(*(__map_.begin() + __p / __block_size) + __p % __block_size); 1493} 1494 1495template <class _Tp, class _Allocator> 1496inline typename deque<_Tp, _Allocator>::const_reference 1497deque<_Tp, _Allocator>::operator[](size_type __i) const _NOEXCEPT { 1498 _LIBCPP_ASSERT_VALID_ELEMENT_ACCESS(__i < size(), "deque::operator[] index out of bounds"); 1499 size_type __p = __start_ + __i; 1500 return *(*(__map_.begin() + __p / __block_size) + __p % __block_size); 1501} 1502 1503template <class _Tp, class _Allocator> 1504inline typename deque<_Tp, _Allocator>::reference deque<_Tp, _Allocator>::at(size_type __i) { 1505 if (__i >= size()) 1506 std::__throw_out_of_range("deque"); 1507 size_type __p = __start_ + __i; 1508 return *(*(__map_.begin() + __p / __block_size) + __p % __block_size); 1509} 1510 1511template <class _Tp, class _Allocator> 1512inline typename deque<_Tp, _Allocator>::const_reference deque<_Tp, _Allocator>::at(size_type __i) const { 1513 if (__i >= size()) 1514 std::__throw_out_of_range("deque"); 1515 size_type __p = __start_ + __i; 1516 return *(*(__map_.begin() + __p / __block_size) + __p % __block_size); 1517} 1518 1519template <class _Tp, class _Allocator> 1520inline typename deque<_Tp, _Allocator>::reference deque<_Tp, _Allocator>::front() _NOEXCEPT { 1521 _LIBCPP_ASSERT_VALID_ELEMENT_ACCESS(!empty(), "deque::front called on an empty deque"); 1522 return *(*(__map_.begin() + __start_ / __block_size) + __start_ % __block_size); 1523} 1524 1525template <class _Tp, class _Allocator> 1526inline typename deque<_Tp, _Allocator>::const_reference deque<_Tp, _Allocator>::front() const _NOEXCEPT { 1527 _LIBCPP_ASSERT_VALID_ELEMENT_ACCESS(!empty(), "deque::front called on an empty deque"); 1528 return *(*(__map_.begin() + __start_ / __block_size) + __start_ % __block_size); 1529} 1530 1531template <class _Tp, class _Allocator> 1532inline typename deque<_Tp, _Allocator>::reference deque<_Tp, _Allocator>::back() _NOEXCEPT { 1533 _LIBCPP_ASSERT_VALID_ELEMENT_ACCESS(!empty(), "deque::back called on an empty deque"); 1534 size_type __p = size() + __start_ - 1; 1535 return *(*(__map_.begin() + __p / __block_size) + __p % __block_size); 1536} 1537 1538template <class _Tp, class _Allocator> 1539inline typename deque<_Tp, _Allocator>::const_reference deque<_Tp, _Allocator>::back() const _NOEXCEPT { 1540 _LIBCPP_ASSERT_VALID_ELEMENT_ACCESS(!empty(), "deque::back called on an empty deque"); 1541 size_type __p = size() + __start_ - 1; 1542 return *(*(__map_.begin() + __p / __block_size) + __p % __block_size); 1543} 1544 1545template <class _Tp, class _Allocator> 1546void deque<_Tp, _Allocator>::push_back(const value_type& __v) { 1547 allocator_type& __a = __alloc(); 1548 if (__back_spare() == 0) 1549 __add_back_capacity(); 1550 // __back_spare() >= 1 1551 __annotate_increase_back(1); 1552 __alloc_traits::construct(__a, std::addressof(*end()), __v); 1553 ++__size(); 1554} 1555 1556template <class _Tp, class _Allocator> 1557void deque<_Tp, _Allocator>::push_front(const value_type& __v) { 1558 allocator_type& __a = __alloc(); 1559 if (__front_spare() == 0) 1560 __add_front_capacity(); 1561 // __front_spare() >= 1 1562 __annotate_increase_front(1); 1563 __alloc_traits::construct(__a, std::addressof(*--begin()), __v); 1564 --__start_; 1565 ++__size(); 1566} 1567 1568#ifndef _LIBCPP_CXX03_LANG 1569template <class _Tp, class _Allocator> 1570void deque<_Tp, _Allocator>::push_back(value_type&& __v) { 1571 allocator_type& __a = __alloc(); 1572 if (__back_spare() == 0) 1573 __add_back_capacity(); 1574 // __back_spare() >= 1 1575 __annotate_increase_back(1); 1576 __alloc_traits::construct(__a, std::addressof(*end()), std::move(__v)); 1577 ++__size(); 1578} 1579 1580template <class _Tp, class _Allocator> 1581template <class... _Args> 1582# if _LIBCPP_STD_VER >= 17 1583typename deque<_Tp, _Allocator>::reference 1584# else 1585void 1586# endif 1587deque<_Tp, _Allocator>::emplace_back(_Args&&... __args) { 1588 allocator_type& __a = __alloc(); 1589 if (__back_spare() == 0) 1590 __add_back_capacity(); 1591 // __back_spare() >= 1 1592 __annotate_increase_back(1); 1593 __alloc_traits::construct(__a, std::addressof(*end()), std::forward<_Args>(__args)...); 1594 ++__size(); 1595# if _LIBCPP_STD_VER >= 17 1596 return *--end(); 1597# endif 1598} 1599 1600template <class _Tp, class _Allocator> 1601void deque<_Tp, _Allocator>::push_front(value_type&& __v) { 1602 allocator_type& __a = __alloc(); 1603 if (__front_spare() == 0) 1604 __add_front_capacity(); 1605 // __front_spare() >= 1 1606 __annotate_increase_front(1); 1607 __alloc_traits::construct(__a, std::addressof(*--begin()), std::move(__v)); 1608 --__start_; 1609 ++__size(); 1610} 1611 1612template <class _Tp, class _Allocator> 1613template <class... _Args> 1614# if _LIBCPP_STD_VER >= 17 1615typename deque<_Tp, _Allocator>::reference 1616# else 1617void 1618# endif 1619deque<_Tp, _Allocator>::emplace_front(_Args&&... __args) { 1620 allocator_type& __a = __alloc(); 1621 if (__front_spare() == 0) 1622 __add_front_capacity(); 1623 // __front_spare() >= 1 1624 __annotate_increase_front(1); 1625 __alloc_traits::construct(__a, std::addressof(*--begin()), std::forward<_Args>(__args)...); 1626 --__start_; 1627 ++__size(); 1628# if _LIBCPP_STD_VER >= 17 1629 return *begin(); 1630# endif 1631} 1632 1633template <class _Tp, class _Allocator> 1634typename deque<_Tp, _Allocator>::iterator deque<_Tp, _Allocator>::insert(const_iterator __p, value_type&& __v) { 1635 size_type __pos = __p - begin(); 1636 size_type __to_end = size() - __pos; 1637 allocator_type& __a = __alloc(); 1638 if (__pos < __to_end) { // insert by shifting things backward 1639 if (__front_spare() == 0) 1640 __add_front_capacity(); 1641 // __front_spare() >= 1 1642 __annotate_increase_front(1); 1643 if (__pos == 0) { 1644 __alloc_traits::construct(__a, std::addressof(*--begin()), std::move(__v)); 1645 --__start_; 1646 ++__size(); 1647 } else { 1648 iterator __b = begin(); 1649 iterator __bm1 = std::prev(__b); 1650 __alloc_traits::construct(__a, std::addressof(*__bm1), std::move(*__b)); 1651 --__start_; 1652 ++__size(); 1653 if (__pos > 1) 1654 __b = std::move(std::next(__b), __b + __pos, __b); 1655 *__b = std::move(__v); 1656 } 1657 } else { // insert by shifting things forward 1658 if (__back_spare() == 0) 1659 __add_back_capacity(); 1660 // __back_capacity >= 1 1661 __annotate_increase_back(1); 1662 size_type __de = size() - __pos; 1663 if (__de == 0) { 1664 __alloc_traits::construct(__a, std::addressof(*end()), std::move(__v)); 1665 ++__size(); 1666 } else { 1667 iterator __e = end(); 1668 iterator __em1 = std::prev(__e); 1669 __alloc_traits::construct(__a, std::addressof(*__e), std::move(*__em1)); 1670 ++__size(); 1671 if (__de > 1) 1672 __e = std::move_backward(__e - __de, __em1, __e); 1673 *--__e = std::move(__v); 1674 } 1675 } 1676 return begin() + __pos; 1677} 1678 1679template <class _Tp, class _Allocator> 1680template <class... _Args> 1681typename deque<_Tp, _Allocator>::iterator deque<_Tp, _Allocator>::emplace(const_iterator __p, _Args&&... __args) { 1682 size_type __pos = __p - begin(); 1683 size_type __to_end = size() - __pos; 1684 allocator_type& __a = __alloc(); 1685 if (__pos < __to_end) { // insert by shifting things backward 1686 if (__front_spare() == 0) 1687 __add_front_capacity(); 1688 // __front_spare() >= 1 1689 __annotate_increase_front(1); 1690 if (__pos == 0) { 1691 __alloc_traits::construct(__a, std::addressof(*--begin()), std::forward<_Args>(__args)...); 1692 --__start_; 1693 ++__size(); 1694 } else { 1695 __temp_value<value_type, _Allocator> __tmp(__alloc(), std::forward<_Args>(__args)...); 1696 iterator __b = begin(); 1697 iterator __bm1 = std::prev(__b); 1698 __alloc_traits::construct(__a, std::addressof(*__bm1), std::move(*__b)); 1699 --__start_; 1700 ++__size(); 1701 if (__pos > 1) 1702 __b = std::move(std::next(__b), __b + __pos, __b); 1703 *__b = std::move(__tmp.get()); 1704 } 1705 } else { // insert by shifting things forward 1706 if (__back_spare() == 0) 1707 __add_back_capacity(); 1708 // __back_capacity >= 1 1709 __annotate_increase_back(1); 1710 size_type __de = size() - __pos; 1711 if (__de == 0) { 1712 __alloc_traits::construct(__a, std::addressof(*end()), std::forward<_Args>(__args)...); 1713 ++__size(); 1714 } else { 1715 __temp_value<value_type, _Allocator> __tmp(__alloc(), std::forward<_Args>(__args)...); 1716 iterator __e = end(); 1717 iterator __em1 = std::prev(__e); 1718 __alloc_traits::construct(__a, std::addressof(*__e), std::move(*__em1)); 1719 ++__size(); 1720 if (__de > 1) 1721 __e = std::move_backward(__e - __de, __em1, __e); 1722 *--__e = std::move(__tmp.get()); 1723 } 1724 } 1725 return begin() + __pos; 1726} 1727 1728#endif // _LIBCPP_CXX03_LANG 1729 1730template <class _Tp, class _Allocator> 1731typename deque<_Tp, _Allocator>::iterator deque<_Tp, _Allocator>::insert(const_iterator __p, const value_type& __v) { 1732 size_type __pos = __p - begin(); 1733 size_type __to_end = size() - __pos; 1734 allocator_type& __a = __alloc(); 1735 if (__pos < __to_end) { // insert by shifting things backward 1736 if (__front_spare() == 0) 1737 __add_front_capacity(); 1738 // __front_spare() >= 1 1739 __annotate_increase_front(1); 1740 if (__pos == 0) { 1741 __alloc_traits::construct(__a, std::addressof(*--begin()), __v); 1742 --__start_; 1743 ++__size(); 1744 } else { 1745 const_pointer __vt = pointer_traits<const_pointer>::pointer_to(__v); 1746 iterator __b = begin(); 1747 iterator __bm1 = std::prev(__b); 1748 if (__vt == pointer_traits<const_pointer>::pointer_to(*__b)) 1749 __vt = pointer_traits<const_pointer>::pointer_to(*__bm1); 1750 __alloc_traits::construct(__a, std::addressof(*__bm1), std::move(*__b)); 1751 --__start_; 1752 ++__size(); 1753 if (__pos > 1) 1754 __b = __move_and_check(std::next(__b), __b + __pos, __b, __vt); 1755 *__b = *__vt; 1756 } 1757 } else { // insert by shifting things forward 1758 if (__back_spare() == 0) 1759 __add_back_capacity(); 1760 // __back_capacity >= 1 1761 __annotate_increase_back(1); 1762 size_type __de = size() - __pos; 1763 if (__de == 0) { 1764 __alloc_traits::construct(__a, std::addressof(*end()), __v); 1765 ++__size(); 1766 } else { 1767 const_pointer __vt = pointer_traits<const_pointer>::pointer_to(__v); 1768 iterator __e = end(); 1769 iterator __em1 = std::prev(__e); 1770 if (__vt == pointer_traits<const_pointer>::pointer_to(*__em1)) 1771 __vt = pointer_traits<const_pointer>::pointer_to(*__e); 1772 __alloc_traits::construct(__a, std::addressof(*__e), std::move(*__em1)); 1773 ++__size(); 1774 if (__de > 1) 1775 __e = __move_backward_and_check(__e - __de, __em1, __e, __vt); 1776 *--__e = *__vt; 1777 } 1778 } 1779 return begin() + __pos; 1780} 1781 1782template <class _Tp, class _Allocator> 1783typename deque<_Tp, _Allocator>::iterator 1784deque<_Tp, _Allocator>::insert(const_iterator __p, size_type __n, const value_type& __v) { 1785 size_type __pos = __p - begin(); 1786 size_type __to_end = __size() - __pos; 1787 allocator_type& __a = __alloc(); 1788 if (__pos < __to_end) { // insert by shifting things backward 1789 if (__n > __front_spare()) 1790 __add_front_capacity(__n - __front_spare()); 1791 // __n <= __front_spare() 1792 __annotate_increase_front(__n); 1793 iterator __old_begin = begin(); 1794 iterator __i = __old_begin; 1795 if (__n > __pos) { 1796 for (size_type __m = __n - __pos; __m; --__m, --__start_, ++__size()) 1797 __alloc_traits::construct(__a, std::addressof(*--__i), __v); 1798 __n = __pos; 1799 } 1800 if (__n > 0) { 1801 const_pointer __vt = pointer_traits<const_pointer>::pointer_to(__v); 1802 iterator __obn = __old_begin + __n; 1803 __move_construct_backward_and_check(__old_begin, __obn, __i, __vt); 1804 if (__n < __pos) 1805 __old_begin = __move_and_check(__obn, __old_begin + __pos, __old_begin, __vt); 1806 std::fill_n(__old_begin, __n, *__vt); 1807 } 1808 } else { // insert by shifting things forward 1809 size_type __back_capacity = __back_spare(); 1810 if (__n > __back_capacity) 1811 __add_back_capacity(__n - __back_capacity); 1812 // __n <= __back_capacity 1813 __annotate_increase_back(__n); 1814 iterator __old_end = end(); 1815 iterator __i = __old_end; 1816 size_type __de = size() - __pos; 1817 if (__n > __de) { 1818 for (size_type __m = __n - __de; __m; --__m, (void)++__i, ++__size()) 1819 __alloc_traits::construct(__a, std::addressof(*__i), __v); 1820 __n = __de; 1821 } 1822 if (__n > 0) { 1823 const_pointer __vt = pointer_traits<const_pointer>::pointer_to(__v); 1824 iterator __oen = __old_end - __n; 1825 __move_construct_and_check(__oen, __old_end, __i, __vt); 1826 if (__n < __de) 1827 __old_end = __move_backward_and_check(__old_end - __de, __oen, __old_end, __vt); 1828 std::fill_n(__old_end - __n, __n, *__vt); 1829 } 1830 } 1831 return begin() + __pos; 1832} 1833 1834template <class _Tp, class _Allocator> 1835template <class _InputIter, __enable_if_t<__has_exactly_input_iterator_category<_InputIter>::value, int> > 1836typename deque<_Tp, _Allocator>::iterator 1837deque<_Tp, _Allocator>::insert(const_iterator __p, _InputIter __f, _InputIter __l) { 1838 return __insert_with_sentinel(__p, __f, __l); 1839} 1840 1841template <class _Tp, class _Allocator> 1842template <class _Iterator, class _Sentinel> 1843_LIBCPP_HIDE_FROM_ABI typename deque<_Tp, _Allocator>::iterator 1844deque<_Tp, _Allocator>::__insert_with_sentinel(const_iterator __p, _Iterator __f, _Sentinel __l) { 1845 __split_buffer<value_type, allocator_type&> __buf(__alloc()); 1846 __buf.__construct_at_end_with_sentinel(std::move(__f), std::move(__l)); 1847 typedef typename __split_buffer<value_type, allocator_type&>::iterator __bi; 1848 return insert(__p, move_iterator<__bi>(__buf.begin()), move_iterator<__bi>(__buf.end())); 1849} 1850 1851template <class _Tp, class _Allocator> 1852template <class _ForwardIterator, __enable_if_t<__has_exactly_forward_iterator_category<_ForwardIterator>::value, int> > 1853typename deque<_Tp, _Allocator>::iterator 1854deque<_Tp, _Allocator>::insert(const_iterator __p, _ForwardIterator __f, _ForwardIterator __l) { 1855 return __insert_with_size(__p, __f, std::distance(__f, __l)); 1856} 1857 1858template <class _Tp, class _Allocator> 1859template <class _Iterator> 1860_LIBCPP_HIDE_FROM_ABI typename deque<_Tp, _Allocator>::iterator 1861deque<_Tp, _Allocator>::__insert_with_size(const_iterator __p, _Iterator __f, size_type __n) { 1862 __split_buffer<value_type, allocator_type&> __buf(__n, 0, __alloc()); 1863 __buf.__construct_at_end_with_size(__f, __n); 1864 typedef typename __split_buffer<value_type, allocator_type&>::iterator __fwd; 1865 return insert(__p, move_iterator<__fwd>(__buf.begin()), move_iterator<__fwd>(__buf.end())); 1866} 1867 1868template <class _Tp, class _Allocator> 1869template <class _BiIter, __enable_if_t<__has_bidirectional_iterator_category<_BiIter>::value, int> > 1870typename deque<_Tp, _Allocator>::iterator deque<_Tp, _Allocator>::insert(const_iterator __p, _BiIter __f, _BiIter __l) { 1871 return __insert_bidirectional(__p, __f, __l, std::distance(__f, __l)); 1872} 1873 1874template <class _Tp, class _Allocator> 1875template <class _BiIter, class _Sentinel> 1876_LIBCPP_HIDE_FROM_ABI typename deque<_Tp, _Allocator>::iterator 1877deque<_Tp, _Allocator>::__insert_bidirectional(const_iterator __p, _BiIter __f, _Sentinel, size_type __n) { 1878 return __insert_bidirectional(__p, __f, std::next(__f, __n), __n); 1879} 1880 1881template <class _Tp, class _Allocator> 1882template <class _BiIter> 1883_LIBCPP_HIDE_FROM_ABI typename deque<_Tp, _Allocator>::iterator 1884deque<_Tp, _Allocator>::__insert_bidirectional(const_iterator __p, _BiIter __f, _BiIter __l, size_type __n) { 1885 size_type __pos = __p - begin(); 1886 size_type __to_end = size() - __pos; 1887 allocator_type& __a = __alloc(); 1888 if (__pos < __to_end) { // insert by shifting things backward 1889 if (__n > __front_spare()) 1890 __add_front_capacity(__n - __front_spare()); 1891 // __n <= __front_spare() 1892 __annotate_increase_front(__n); 1893 iterator __old_begin = begin(); 1894 iterator __i = __old_begin; 1895 _BiIter __m = __f; 1896 if (__n > __pos) { 1897 __m = __pos < __n / 2 ? std::prev(__l, __pos) : std::next(__f, __n - __pos); 1898 for (_BiIter __j = __m; __j != __f; --__start_, ++__size()) 1899 __alloc_traits::construct(__a, std::addressof(*--__i), *--__j); 1900 __n = __pos; 1901 } 1902 if (__n > 0) { 1903 iterator __obn = __old_begin + __n; 1904 for (iterator __j = __obn; __j != __old_begin;) { 1905 __alloc_traits::construct(__a, std::addressof(*--__i), std::move(*--__j)); 1906 --__start_; 1907 ++__size(); 1908 } 1909 if (__n < __pos) 1910 __old_begin = std::move(__obn, __old_begin + __pos, __old_begin); 1911 std::copy(__m, __l, __old_begin); 1912 } 1913 } else { // insert by shifting things forward 1914 size_type __back_capacity = __back_spare(); 1915 if (__n > __back_capacity) 1916 __add_back_capacity(__n - __back_capacity); 1917 // __n <= __back_capacity 1918 __annotate_increase_back(__n); 1919 iterator __old_end = end(); 1920 iterator __i = __old_end; 1921 _BiIter __m = __l; 1922 size_type __de = size() - __pos; 1923 if (__n > __de) { 1924 __m = __de < __n / 2 ? std::next(__f, __de) : std::prev(__l, __n - __de); 1925 for (_BiIter __j = __m; __j != __l; ++__i, (void)++__j, ++__size()) 1926 __alloc_traits::construct(__a, std::addressof(*__i), *__j); 1927 __n = __de; 1928 } 1929 if (__n > 0) { 1930 iterator __oen = __old_end - __n; 1931 for (iterator __j = __oen; __j != __old_end; ++__i, (void)++__j, ++__size()) 1932 __alloc_traits::construct(__a, std::addressof(*__i), std::move(*__j)); 1933 if (__n < __de) 1934 __old_end = std::move_backward(__old_end - __de, __oen, __old_end); 1935 std::copy_backward(__f, __m, __old_end); 1936 } 1937 } 1938 return begin() + __pos; 1939} 1940 1941template <class _Tp, class _Allocator> 1942template <class _InpIter, __enable_if_t<__has_exactly_input_iterator_category<_InpIter>::value, int> > 1943void deque<_Tp, _Allocator>::__append(_InpIter __f, _InpIter __l) { 1944 __append_with_sentinel(__f, __l); 1945} 1946 1947template <class _Tp, class _Allocator> 1948template <class _InputIterator, class _Sentinel> 1949_LIBCPP_HIDE_FROM_ABI void deque<_Tp, _Allocator>::__append_with_sentinel(_InputIterator __f, _Sentinel __l) { 1950 for (; __f != __l; ++__f) 1951#ifdef _LIBCPP_CXX03_LANG 1952 push_back(*__f); 1953#else 1954 emplace_back(*__f); 1955#endif 1956} 1957 1958template <class _Tp, class _Allocator> 1959template <class _ForIter, __enable_if_t<__has_forward_iterator_category<_ForIter>::value, int> > 1960void deque<_Tp, _Allocator>::__append(_ForIter __f, _ForIter __l) { 1961 __append_with_size(__f, std::distance(__f, __l)); 1962} 1963 1964template <class _Tp, class _Allocator> 1965template <class _InputIterator> 1966_LIBCPP_HIDE_FROM_ABI void deque<_Tp, _Allocator>::__append_with_size(_InputIterator __f, size_type __n) { 1967 allocator_type& __a = __alloc(); 1968 size_type __back_capacity = __back_spare(); 1969 if (__n > __back_capacity) 1970 __add_back_capacity(__n - __back_capacity); 1971 1972 // __n <= __back_capacity 1973 __annotate_increase_back(__n); 1974 for (__deque_block_range __br : __deque_range(end(), end() + __n)) { 1975 _ConstructTransaction __tx(this, __br); 1976 for (; __tx.__pos_ != __tx.__end_; ++__tx.__pos_, (void)++__f) { 1977 __alloc_traits::construct(__a, std::__to_address(__tx.__pos_), *__f); 1978 } 1979 } 1980} 1981 1982template <class _Tp, class _Allocator> 1983void deque<_Tp, _Allocator>::__append(size_type __n) { 1984 allocator_type& __a = __alloc(); 1985 size_type __back_capacity = __back_spare(); 1986 if (__n > __back_capacity) 1987 __add_back_capacity(__n - __back_capacity); 1988 // __n <= __back_capacity 1989 __annotate_increase_back(__n); 1990 for (__deque_block_range __br : __deque_range(end(), end() + __n)) { 1991 _ConstructTransaction __tx(this, __br); 1992 for (; __tx.__pos_ != __tx.__end_; ++__tx.__pos_) { 1993 __alloc_traits::construct(__a, std::__to_address(__tx.__pos_)); 1994 } 1995 } 1996} 1997 1998template <class _Tp, class _Allocator> 1999void deque<_Tp, _Allocator>::__append(size_type __n, const value_type& __v) { 2000 allocator_type& __a = __alloc(); 2001 size_type __back_capacity = __back_spare(); 2002 if (__n > __back_capacity) 2003 __add_back_capacity(__n - __back_capacity); 2004 // __n <= __back_capacity 2005 __annotate_increase_back(__n); 2006 for (__deque_block_range __br : __deque_range(end(), end() + __n)) { 2007 _ConstructTransaction __tx(this, __br); 2008 for (; __tx.__pos_ != __tx.__end_; ++__tx.__pos_) { 2009 __alloc_traits::construct(__a, std::__to_address(__tx.__pos_), __v); 2010 } 2011 } 2012} 2013 2014// Create front capacity for one block of elements. 2015// Strong guarantee. Either do it or don't touch anything. 2016template <class _Tp, class _Allocator> 2017void deque<_Tp, _Allocator>::__add_front_capacity() { 2018 allocator_type& __a = __alloc(); 2019 if (__back_spare() >= __block_size) { 2020 __start_ += __block_size; 2021 pointer __pt = __map_.back(); 2022 __map_.pop_back(); 2023 __map_.push_front(__pt); 2024 } 2025 // Else if __map_.size() < __map_.capacity() then we need to allocate 1 buffer 2026 else if (__map_.size() < __map_.capacity()) { // we can put the new buffer into the map, but don't shift things around 2027 // until all buffers are allocated. If we throw, we don't need to fix 2028 // anything up (any added buffers are undetectible) 2029 if (__map_.__front_spare() > 0) 2030 __map_.push_front(__alloc_traits::allocate(__a, __block_size)); 2031 else { 2032 __map_.push_back(__alloc_traits::allocate(__a, __block_size)); 2033 // Done allocating, reorder capacity 2034 pointer __pt = __map_.back(); 2035 __map_.pop_back(); 2036 __map_.push_front(__pt); 2037 } 2038 __start_ = __map_.size() == 1 ? __block_size / 2 : __start_ + __block_size; 2039 } 2040 // Else need to allocate 1 buffer, *and* we need to reallocate __map_. 2041 else { 2042 __split_buffer<pointer, __pointer_allocator&> __buf( 2043 std::max<size_type>(2 * __map_.capacity(), 1), 0, __map_.__alloc()); 2044 2045 typedef __allocator_destructor<_Allocator> _Dp; 2046 unique_ptr<pointer, _Dp> __hold(__alloc_traits::allocate(__a, __block_size), _Dp(__a, __block_size)); 2047 __buf.push_back(__hold.get()); 2048 __hold.release(); 2049 2050 for (__map_pointer __i = __map_.begin(); __i != __map_.end(); ++__i) 2051 __buf.push_back(*__i); 2052 std::swap(__map_.__first_, __buf.__first_); 2053 std::swap(__map_.__begin_, __buf.__begin_); 2054 std::swap(__map_.__end_, __buf.__end_); 2055 std::swap(__map_.__end_cap(), __buf.__end_cap()); 2056 __start_ = __map_.size() == 1 ? __block_size / 2 : __start_ + __block_size; 2057 } 2058 __annotate_whole_block(0, __asan_poison); 2059} 2060 2061// Create front capacity for __n elements. 2062// Strong guarantee. Either do it or don't touch anything. 2063template <class _Tp, class _Allocator> 2064void deque<_Tp, _Allocator>::__add_front_capacity(size_type __n) { 2065 allocator_type& __a = __alloc(); 2066 size_type __nb = __recommend_blocks(__n + __map_.empty()); 2067 // Number of unused blocks at back: 2068 size_type __back_capacity = __back_spare() / __block_size; 2069 __back_capacity = std::min(__back_capacity, __nb); // don't take more than you need 2070 __nb -= __back_capacity; // number of blocks need to allocate 2071 // If __nb == 0, then we have sufficient capacity. 2072 if (__nb == 0) { 2073 __start_ += __block_size * __back_capacity; 2074 for (; __back_capacity > 0; --__back_capacity) { 2075 pointer __pt = __map_.back(); 2076 __map_.pop_back(); 2077 __map_.push_front(__pt); 2078 } 2079 } 2080 // Else if __nb <= __map_.capacity() - __map_.size() then we need to allocate __nb buffers 2081 else if (__nb <= __map_.capacity() - 2082 __map_.size()) { // we can put the new buffers into the map, but don't shift things around 2083 // until all buffers are allocated. If we throw, we don't need to fix 2084 // anything up (any added buffers are undetectible) 2085 for (; __nb > 0; --__nb, __start_ += __block_size - (__map_.size() == 1)) { 2086 if (__map_.__front_spare() == 0) 2087 break; 2088 __map_.push_front(__alloc_traits::allocate(__a, __block_size)); 2089 __annotate_whole_block(0, __asan_poison); 2090 } 2091 for (; __nb > 0; --__nb, ++__back_capacity) 2092 __map_.push_back(__alloc_traits::allocate(__a, __block_size)); 2093 // Done allocating, reorder capacity 2094 __start_ += __back_capacity * __block_size; 2095 for (; __back_capacity > 0; --__back_capacity) { 2096 pointer __pt = __map_.back(); 2097 __map_.pop_back(); 2098 __map_.push_front(__pt); 2099 __annotate_whole_block(0, __asan_poison); 2100 } 2101 } 2102 // Else need to allocate __nb buffers, *and* we need to reallocate __map_. 2103 else { 2104 size_type __ds = (__nb + __back_capacity) * __block_size - __map_.empty(); 2105 __split_buffer<pointer, __pointer_allocator&> __buf( 2106 std::max<size_type>(2 * __map_.capacity(), __nb + __map_.size()), 0, __map_.__alloc()); 2107#ifndef _LIBCPP_HAS_NO_EXCEPTIONS 2108 try { 2109#endif // _LIBCPP_HAS_NO_EXCEPTIONS 2110 for (; __nb > 0; --__nb) { 2111 __buf.push_back(__alloc_traits::allocate(__a, __block_size)); 2112 // ASan: this is empty container, we have to poison whole block 2113 __annotate_poison_block(std::__to_address(__buf.back()), std::__to_address(__buf.back() + __block_size)); 2114 } 2115#ifndef _LIBCPP_HAS_NO_EXCEPTIONS 2116 } catch (...) { 2117 __annotate_delete(); 2118 for (__map_pointer __i = __buf.begin(); __i != __buf.end(); ++__i) 2119 __alloc_traits::deallocate(__a, *__i, __block_size); 2120 throw; 2121 } 2122#endif // _LIBCPP_HAS_NO_EXCEPTIONS 2123 for (; __back_capacity > 0; --__back_capacity) { 2124 __buf.push_back(__map_.back()); 2125 __map_.pop_back(); 2126 } 2127 for (__map_pointer __i = __map_.begin(); __i != __map_.end(); ++__i) 2128 __buf.push_back(*__i); 2129 std::swap(__map_.__first_, __buf.__first_); 2130 std::swap(__map_.__begin_, __buf.__begin_); 2131 std::swap(__map_.__end_, __buf.__end_); 2132 std::swap(__map_.__end_cap(), __buf.__end_cap()); 2133 __start_ += __ds; 2134 } 2135} 2136 2137// Create back capacity for one block of elements. 2138// Strong guarantee. Either do it or don't touch anything. 2139template <class _Tp, class _Allocator> 2140void deque<_Tp, _Allocator>::__add_back_capacity() { 2141 allocator_type& __a = __alloc(); 2142 if (__front_spare() >= __block_size) { 2143 __start_ -= __block_size; 2144 pointer __pt = __map_.front(); 2145 __map_.pop_front(); 2146 __map_.push_back(__pt); 2147 } 2148 // Else if __nb <= __map_.capacity() - __map_.size() then we need to allocate __nb buffers 2149 else if (__map_.size() < __map_.capacity()) { // we can put the new buffer into the map, but don't shift things around 2150 // until it is allocated. If we throw, we don't need to fix 2151 // anything up (any added buffers are undetectible) 2152 if (__map_.__back_spare() != 0) 2153 __map_.push_back(__alloc_traits::allocate(__a, __block_size)); 2154 else { 2155 __map_.push_front(__alloc_traits::allocate(__a, __block_size)); 2156 // Done allocating, reorder capacity 2157 pointer __pt = __map_.front(); 2158 __map_.pop_front(); 2159 __map_.push_back(__pt); 2160 } 2161 __annotate_whole_block(__map_.size() - 1, __asan_poison); 2162 } 2163 // Else need to allocate 1 buffer, *and* we need to reallocate __map_. 2164 else { 2165 __split_buffer<pointer, __pointer_allocator&> __buf( 2166 std::max<size_type>(2 * __map_.capacity(), 1), __map_.size(), __map_.__alloc()); 2167 2168 typedef __allocator_destructor<_Allocator> _Dp; 2169 unique_ptr<pointer, _Dp> __hold(__alloc_traits::allocate(__a, __block_size), _Dp(__a, __block_size)); 2170 __buf.push_back(__hold.get()); 2171 __hold.release(); 2172 2173 for (__map_pointer __i = __map_.end(); __i != __map_.begin();) 2174 __buf.push_front(*--__i); 2175 std::swap(__map_.__first_, __buf.__first_); 2176 std::swap(__map_.__begin_, __buf.__begin_); 2177 std::swap(__map_.__end_, __buf.__end_); 2178 std::swap(__map_.__end_cap(), __buf.__end_cap()); 2179 __annotate_whole_block(__map_.size() - 1, __asan_poison); 2180 } 2181} 2182 2183// Create back capacity for __n elements. 2184// Strong guarantee. Either do it or don't touch anything. 2185template <class _Tp, class _Allocator> 2186void deque<_Tp, _Allocator>::__add_back_capacity(size_type __n) { 2187 allocator_type& __a = __alloc(); 2188 size_type __nb = __recommend_blocks(__n + __map_.empty()); 2189 // Number of unused blocks at front: 2190 size_type __front_capacity = __front_spare() / __block_size; 2191 __front_capacity = std::min(__front_capacity, __nb); // don't take more than you need 2192 __nb -= __front_capacity; // number of blocks need to allocate 2193 // If __nb == 0, then we have sufficient capacity. 2194 if (__nb == 0) { 2195 __start_ -= __block_size * __front_capacity; 2196 for (; __front_capacity > 0; --__front_capacity) { 2197 pointer __pt = __map_.front(); 2198 __map_.pop_front(); 2199 __map_.push_back(__pt); 2200 } 2201 } 2202 // Else if __nb <= __map_.capacity() - __map_.size() then we need to allocate __nb buffers 2203 else if (__nb <= __map_.capacity() - 2204 __map_.size()) { // we can put the new buffers into the map, but don't shift things around 2205 // until all buffers are allocated. If we throw, we don't need to fix 2206 // anything up (any added buffers are undetectible) 2207 for (; __nb > 0; --__nb) { 2208 if (__map_.__back_spare() == 0) 2209 break; 2210 __map_.push_back(__alloc_traits::allocate(__a, __block_size)); 2211 __annotate_whole_block(__map_.size() - 1, __asan_poison); 2212 } 2213 for (; __nb > 0; --__nb, ++__front_capacity, __start_ += __block_size - (__map_.size() == 1)) { 2214 __map_.push_front(__alloc_traits::allocate(__a, __block_size)); 2215 __annotate_whole_block(0, __asan_poison); 2216 } 2217 // Done allocating, reorder capacity 2218 __start_ -= __block_size * __front_capacity; 2219 for (; __front_capacity > 0; --__front_capacity) { 2220 pointer __pt = __map_.front(); 2221 __map_.pop_front(); 2222 __map_.push_back(__pt); 2223 } 2224 } 2225 // Else need to allocate __nb buffers, *and* we need to reallocate __map_. 2226 else { 2227 size_type __ds = __front_capacity * __block_size; 2228 __split_buffer<pointer, __pointer_allocator&> __buf( 2229 std::max<size_type>(2 * __map_.capacity(), __nb + __map_.size()), 2230 __map_.size() - __front_capacity, 2231 __map_.__alloc()); 2232#ifndef _LIBCPP_HAS_NO_EXCEPTIONS 2233 try { 2234#endif // _LIBCPP_HAS_NO_EXCEPTIONS 2235 for (; __nb > 0; --__nb) { 2236 __buf.push_back(__alloc_traits::allocate(__a, __block_size)); 2237 // ASan: this is an empty container, we have to poison the whole block 2238 __annotate_poison_block(std::__to_address(__buf.back()), std::__to_address(__buf.back() + __block_size)); 2239 } 2240#ifndef _LIBCPP_HAS_NO_EXCEPTIONS 2241 } catch (...) { 2242 __annotate_delete(); 2243 for (__map_pointer __i = __buf.begin(); __i != __buf.end(); ++__i) 2244 __alloc_traits::deallocate(__a, *__i, __block_size); 2245 throw; 2246 } 2247#endif // _LIBCPP_HAS_NO_EXCEPTIONS 2248 for (; __front_capacity > 0; --__front_capacity) { 2249 __buf.push_back(__map_.front()); 2250 __map_.pop_front(); 2251 } 2252 for (__map_pointer __i = __map_.end(); __i != __map_.begin();) 2253 __buf.push_front(*--__i); 2254 std::swap(__map_.__first_, __buf.__first_); 2255 std::swap(__map_.__begin_, __buf.__begin_); 2256 std::swap(__map_.__end_, __buf.__end_); 2257 std::swap(__map_.__end_cap(), __buf.__end_cap()); 2258 __start_ -= __ds; 2259 } 2260} 2261 2262template <class _Tp, class _Allocator> 2263void deque<_Tp, _Allocator>::pop_front() { 2264 _LIBCPP_ASSERT_VALID_ELEMENT_ACCESS(!empty(), "deque::pop_front called on an empty deque"); 2265 size_type __old_sz = size(); 2266 size_type __old_start = __start_; 2267 allocator_type& __a = __alloc(); 2268 __alloc_traits::destroy( 2269 __a, std::__to_address(*(__map_.begin() + __start_ / __block_size) + __start_ % __block_size)); 2270 --__size(); 2271 ++__start_; 2272 __annotate_shrink_front(__old_sz, __old_start); 2273 __maybe_remove_front_spare(); 2274} 2275 2276template <class _Tp, class _Allocator> 2277void deque<_Tp, _Allocator>::pop_back() { 2278 _LIBCPP_ASSERT_VALID_ELEMENT_ACCESS(!empty(), "deque::pop_back called on an empty deque"); 2279 size_type __old_sz = size(); 2280 size_type __old_start = __start_; 2281 allocator_type& __a = __alloc(); 2282 size_type __p = size() + __start_ - 1; 2283 __alloc_traits::destroy(__a, std::__to_address(*(__map_.begin() + __p / __block_size) + __p % __block_size)); 2284 --__size(); 2285 __annotate_shrink_back(__old_sz, __old_start); 2286 __maybe_remove_back_spare(); 2287} 2288 2289// move assign [__f, __l) to [__r, __r + (__l-__f)). 2290// If __vt points into [__f, __l), then subtract (__f - __r) from __vt. 2291template <class _Tp, class _Allocator> 2292typename deque<_Tp, _Allocator>::iterator 2293deque<_Tp, _Allocator>::__move_and_check(iterator __f, iterator __l, iterator __r, const_pointer& __vt) { 2294 // as if 2295 // for (; __f != __l; ++__f, ++__r) 2296 // *__r = std::move(*__f); 2297 difference_type __n = __l - __f; 2298 while (__n > 0) { 2299 pointer __fb = __f.__ptr_; 2300 pointer __fe = *__f.__m_iter_ + __block_size; 2301 difference_type __bs = __fe - __fb; 2302 if (__bs > __n) { 2303 __bs = __n; 2304 __fe = __fb + __bs; 2305 } 2306 if (__fb <= __vt && __vt < __fe) 2307 __vt = (const_iterator(static_cast<__map_const_pointer>(__f.__m_iter_), __vt) -= __f - __r).__ptr_; 2308 __r = std::move(__fb, __fe, __r); 2309 __n -= __bs; 2310 __f += __bs; 2311 } 2312 return __r; 2313} 2314 2315// move assign [__f, __l) to [__r - (__l-__f), __r) backwards. 2316// If __vt points into [__f, __l), then add (__r - __l) to __vt. 2317template <class _Tp, class _Allocator> 2318typename deque<_Tp, _Allocator>::iterator 2319deque<_Tp, _Allocator>::__move_backward_and_check(iterator __f, iterator __l, iterator __r, const_pointer& __vt) { 2320 // as if 2321 // while (__f != __l) 2322 // *--__r = std::move(*--__l); 2323 difference_type __n = __l - __f; 2324 while (__n > 0) { 2325 --__l; 2326 pointer __lb = *__l.__m_iter_; 2327 pointer __le = __l.__ptr_ + 1; 2328 difference_type __bs = __le - __lb; 2329 if (__bs > __n) { 2330 __bs = __n; 2331 __lb = __le - __bs; 2332 } 2333 if (__lb <= __vt && __vt < __le) 2334 __vt = (const_iterator(static_cast<__map_const_pointer>(__l.__m_iter_), __vt) += __r - __l - 1).__ptr_; 2335 __r = std::move_backward(__lb, __le, __r); 2336 __n -= __bs; 2337 __l -= __bs - 1; 2338 } 2339 return __r; 2340} 2341 2342// move construct [__f, __l) to [__r, __r + (__l-__f)). 2343// If __vt points into [__f, __l), then add (__r - __f) to __vt. 2344template <class _Tp, class _Allocator> 2345void deque<_Tp, _Allocator>::__move_construct_and_check(iterator __f, iterator __l, iterator __r, const_pointer& __vt) { 2346 allocator_type& __a = __alloc(); 2347 // as if 2348 // for (; __f != __l; ++__r, ++__f, ++__size()) 2349 // __alloc_traits::construct(__a, std::addressof(*__r), std::move(*__f)); 2350 difference_type __n = __l - __f; 2351 while (__n > 0) { 2352 pointer __fb = __f.__ptr_; 2353 pointer __fe = *__f.__m_iter_ + __block_size; 2354 difference_type __bs = __fe - __fb; 2355 if (__bs > __n) { 2356 __bs = __n; 2357 __fe = __fb + __bs; 2358 } 2359 if (__fb <= __vt && __vt < __fe) 2360 __vt = (const_iterator(static_cast<__map_const_pointer>(__f.__m_iter_), __vt) += __r - __f).__ptr_; 2361 for (; __fb != __fe; ++__fb, ++__r, ++__size()) 2362 __alloc_traits::construct(__a, std::addressof(*__r), std::move(*__fb)); 2363 __n -= __bs; 2364 __f += __bs; 2365 } 2366} 2367 2368// move construct [__f, __l) to [__r - (__l-__f), __r) backwards. 2369// If __vt points into [__f, __l), then subtract (__l - __r) from __vt. 2370template <class _Tp, class _Allocator> 2371void deque<_Tp, _Allocator>::__move_construct_backward_and_check( 2372 iterator __f, iterator __l, iterator __r, const_pointer& __vt) { 2373 allocator_type& __a = __alloc(); 2374 // as if 2375 // for (iterator __j = __l; __j != __f;) 2376 // { 2377 // __alloc_traitsconstruct(__a, std::addressof(*--__r), std::move(*--__j)); 2378 // --__start_; 2379 // ++__size(); 2380 // } 2381 difference_type __n = __l - __f; 2382 while (__n > 0) { 2383 --__l; 2384 pointer __lb = *__l.__m_iter_; 2385 pointer __le = __l.__ptr_ + 1; 2386 difference_type __bs = __le - __lb; 2387 if (__bs > __n) { 2388 __bs = __n; 2389 __lb = __le - __bs; 2390 } 2391 if (__lb <= __vt && __vt < __le) 2392 __vt = (const_iterator(static_cast<__map_const_pointer>(__l.__m_iter_), __vt) -= __l - __r + 1).__ptr_; 2393 while (__le != __lb) { 2394 __alloc_traits::construct(__a, std::addressof(*--__r), std::move(*--__le)); 2395 --__start_; 2396 ++__size(); 2397 } 2398 __n -= __bs; 2399 __l -= __bs - 1; 2400 } 2401} 2402 2403template <class _Tp, class _Allocator> 2404typename deque<_Tp, _Allocator>::iterator deque<_Tp, _Allocator>::erase(const_iterator __f) { 2405 _LIBCPP_ASSERT_VALID_ELEMENT_ACCESS( 2406 __f != end(), "deque::erase(iterator) called with a non-dereferenceable iterator"); 2407 size_type __old_sz = size(); 2408 size_type __old_start = __start_; 2409 iterator __b = begin(); 2410 difference_type __pos = __f - __b; 2411 iterator __p = __b + __pos; 2412 allocator_type& __a = __alloc(); 2413 if (static_cast<size_t>(__pos) <= (size() - 1) / 2) { // erase from front 2414 std::move_backward(__b, __p, std::next(__p)); 2415 __alloc_traits::destroy(__a, std::addressof(*__b)); 2416 --__size(); 2417 ++__start_; 2418 __annotate_shrink_front(__old_sz, __old_start); 2419 __maybe_remove_front_spare(); 2420 } else { // erase from back 2421 iterator __i = std::move(std::next(__p), end(), __p); 2422 __alloc_traits::destroy(__a, std::addressof(*__i)); 2423 --__size(); 2424 __annotate_shrink_back(__old_sz, __old_start); 2425 __maybe_remove_back_spare(); 2426 } 2427 return begin() + __pos; 2428} 2429 2430template <class _Tp, class _Allocator> 2431typename deque<_Tp, _Allocator>::iterator deque<_Tp, _Allocator>::erase(const_iterator __f, const_iterator __l) { 2432 _LIBCPP_ASSERT_VALID_INPUT_RANGE(__f <= __l, "deque::erase(first, last) called with an invalid range"); 2433 size_type __old_sz = size(); 2434 size_type __old_start = __start_; 2435 difference_type __n = __l - __f; 2436 iterator __b = begin(); 2437 difference_type __pos = __f - __b; 2438 iterator __p = __b + __pos; 2439 if (__n > 0) { 2440 allocator_type& __a = __alloc(); 2441 if (static_cast<size_t>(__pos) <= (size() - __n) / 2) { // erase from front 2442 iterator __i = std::move_backward(__b, __p, __p + __n); 2443 for (; __b != __i; ++__b) 2444 __alloc_traits::destroy(__a, std::addressof(*__b)); 2445 __size() -= __n; 2446 __start_ += __n; 2447 __annotate_shrink_front(__old_sz, __old_start); 2448 while (__maybe_remove_front_spare()) { 2449 } 2450 } else { // erase from back 2451 iterator __i = std::move(__p + __n, end(), __p); 2452 for (iterator __e = end(); __i != __e; ++__i) 2453 __alloc_traits::destroy(__a, std::addressof(*__i)); 2454 __size() -= __n; 2455 __annotate_shrink_back(__old_sz, __old_start); 2456 while (__maybe_remove_back_spare()) { 2457 } 2458 } 2459 } 2460 return begin() + __pos; 2461} 2462 2463template <class _Tp, class _Allocator> 2464void deque<_Tp, _Allocator>::__erase_to_end(const_iterator __f) { 2465 size_type __old_sz = size(); 2466 size_type __old_start = __start_; 2467 iterator __e = end(); 2468 difference_type __n = __e - __f; 2469 if (__n > 0) { 2470 allocator_type& __a = __alloc(); 2471 iterator __b = begin(); 2472 difference_type __pos = __f - __b; 2473 for (iterator __p = __b + __pos; __p != __e; ++__p) 2474 __alloc_traits::destroy(__a, std::addressof(*__p)); 2475 __size() -= __n; 2476 __annotate_shrink_back(__old_sz, __old_start); 2477 while (__maybe_remove_back_spare()) { 2478 } 2479 } 2480} 2481 2482template <class _Tp, class _Allocator> 2483inline void deque<_Tp, _Allocator>::swap(deque& __c) 2484#if _LIBCPP_STD_VER >= 14 2485 _NOEXCEPT 2486#else 2487 _NOEXCEPT_(!__alloc_traits::propagate_on_container_swap::value || __is_nothrow_swappable<allocator_type>::value) 2488#endif 2489{ 2490 __map_.swap(__c.__map_); 2491 std::swap(__start_, __c.__start_); 2492 std::swap(__size(), __c.__size()); 2493 std::__swap_allocator(__alloc(), __c.__alloc()); 2494} 2495 2496template <class _Tp, class _Allocator> 2497inline void deque<_Tp, _Allocator>::clear() _NOEXCEPT { 2498 __annotate_delete(); 2499 allocator_type& __a = __alloc(); 2500 for (iterator __i = begin(), __e = end(); __i != __e; ++__i) 2501 __alloc_traits::destroy(__a, std::addressof(*__i)); 2502 __size() = 0; 2503 while (__map_.size() > 2) { 2504 __alloc_traits::deallocate(__a, __map_.front(), __block_size); 2505 __map_.pop_front(); 2506 } 2507 switch (__map_.size()) { 2508 case 1: 2509 __start_ = __block_size / 2; 2510 break; 2511 case 2: 2512 __start_ = __block_size; 2513 break; 2514 } 2515 __annotate_new(0); 2516} 2517 2518template <class _Tp, class _Allocator> 2519inline _LIBCPP_HIDE_FROM_ABI bool operator==(const deque<_Tp, _Allocator>& __x, const deque<_Tp, _Allocator>& __y) { 2520 const typename deque<_Tp, _Allocator>::size_type __sz = __x.size(); 2521 return __sz == __y.size() && std::equal(__x.begin(), __x.end(), __y.begin()); 2522} 2523 2524#if _LIBCPP_STD_VER <= 17 2525 2526template <class _Tp, class _Allocator> 2527inline _LIBCPP_HIDE_FROM_ABI bool operator!=(const deque<_Tp, _Allocator>& __x, const deque<_Tp, _Allocator>& __y) { 2528 return !(__x == __y); 2529} 2530 2531template <class _Tp, class _Allocator> 2532inline _LIBCPP_HIDE_FROM_ABI bool operator<(const deque<_Tp, _Allocator>& __x, const deque<_Tp, _Allocator>& __y) { 2533 return std::lexicographical_compare(__x.begin(), __x.end(), __y.begin(), __y.end()); 2534} 2535 2536template <class _Tp, class _Allocator> 2537inline _LIBCPP_HIDE_FROM_ABI bool operator>(const deque<_Tp, _Allocator>& __x, const deque<_Tp, _Allocator>& __y) { 2538 return __y < __x; 2539} 2540 2541template <class _Tp, class _Allocator> 2542inline _LIBCPP_HIDE_FROM_ABI bool operator>=(const deque<_Tp, _Allocator>& __x, const deque<_Tp, _Allocator>& __y) { 2543 return !(__x < __y); 2544} 2545 2546template <class _Tp, class _Allocator> 2547inline _LIBCPP_HIDE_FROM_ABI bool operator<=(const deque<_Tp, _Allocator>& __x, const deque<_Tp, _Allocator>& __y) { 2548 return !(__y < __x); 2549} 2550 2551#else // _LIBCPP_STD_VER <= 17 2552 2553template <class _Tp, class _Allocator> 2554_LIBCPP_HIDE_FROM_ABI __synth_three_way_result<_Tp> 2555operator<=>(const deque<_Tp, _Allocator>& __x, const deque<_Tp, _Allocator>& __y) { 2556 return std::lexicographical_compare_three_way( 2557 __x.begin(), __x.end(), __y.begin(), __y.end(), std::__synth_three_way<_Tp, _Tp>); 2558} 2559 2560#endif // _LIBCPP_STD_VER <= 17 2561 2562template <class _Tp, class _Allocator> 2563inline _LIBCPP_HIDE_FROM_ABI void swap(deque<_Tp, _Allocator>& __x, deque<_Tp, _Allocator>& __y) 2564 _NOEXCEPT_(_NOEXCEPT_(__x.swap(__y))) { 2565 __x.swap(__y); 2566} 2567 2568#if _LIBCPP_STD_VER >= 20 2569template <class _Tp, class _Allocator, class _Up> 2570inline _LIBCPP_HIDE_FROM_ABI typename deque<_Tp, _Allocator>::size_type 2571erase(deque<_Tp, _Allocator>& __c, const _Up& __v) { 2572 auto __old_size = __c.size(); 2573 __c.erase(std::remove(__c.begin(), __c.end(), __v), __c.end()); 2574 return __old_size - __c.size(); 2575} 2576 2577template <class _Tp, class _Allocator, class _Predicate> 2578inline _LIBCPP_HIDE_FROM_ABI typename deque<_Tp, _Allocator>::size_type 2579erase_if(deque<_Tp, _Allocator>& __c, _Predicate __pred) { 2580 auto __old_size = __c.size(); 2581 __c.erase(std::remove_if(__c.begin(), __c.end(), __pred), __c.end()); 2582 return __old_size - __c.size(); 2583} 2584 2585template <> 2586inline constexpr bool __format::__enable_insertable<std::deque<char>> = true; 2587# ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS 2588template <> 2589inline constexpr bool __format::__enable_insertable<std::deque<wchar_t>> = true; 2590# endif 2591 2592#endif // _LIBCPP_STD_VER >= 20 2593 2594_LIBCPP_END_NAMESPACE_STD 2595 2596#if _LIBCPP_STD_VER >= 17 2597_LIBCPP_BEGIN_NAMESPACE_STD 2598namespace pmr { 2599template <class _ValueT> 2600using deque _LIBCPP_AVAILABILITY_PMR = std::deque<_ValueT, polymorphic_allocator<_ValueT>>; 2601} // namespace pmr 2602_LIBCPP_END_NAMESPACE_STD 2603#endif 2604 2605_LIBCPP_POP_MACROS 2606 2607#if !defined(_LIBCPP_REMOVE_TRANSITIVE_INCLUDES) && _LIBCPP_STD_VER <= 20 2608# include <algorithm> 2609# include <atomic> 2610# include <concepts> 2611# include <cstdlib> 2612# include <functional> 2613# include <iosfwd> 2614# include <iterator> 2615# include <type_traits> 2616# include <typeinfo> 2617#endif 2618 2619#endif // _LIBCPP_DEQUE 2620