libstdc++
stl_bvector.h
Go to the documentation of this file.
1 // vector<bool> specialization -*- C++ -*-
2 
3 // Copyright (C) 2001-2020 Free Software Foundation, Inc.
4 //
5 // This file is part of the GNU ISO C++ Library. This library is free
6 // software; you can redistribute it and/or modify it under the
7 // terms of the GNU General Public License as published by the
8 // Free Software Foundation; either version 3, or (at your option)
9 // any later version.
10 
11 // This library is distributed in the hope that it will be useful,
12 // but WITHOUT ANY WARRANTY; without even the implied warranty of
13 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 // GNU General Public License for more details.
15 
16 // Under Section 7 of GPL version 3, you are granted additional
17 // permissions described in the GCC Runtime Library Exception, version
18 // 3.1, as published by the Free Software Foundation.
19 
20 // You should have received a copy of the GNU General Public License and
21 // a copy of the GCC Runtime Library Exception along with this program;
22 // see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
23 // <http://www.gnu.org/licenses/>.
24 
25 /*
26  *
27  * Copyright (c) 1994
28  * Hewlett-Packard Company
29  *
30  * Permission to use, copy, modify, distribute and sell this software
31  * and its documentation for any purpose is hereby granted without fee,
32  * provided that the above copyright notice appear in all copies and
33  * that both that copyright notice and this permission notice appear
34  * in supporting documentation. Hewlett-Packard Company makes no
35  * representations about the suitability of this software for any
36  * purpose. It is provided "as is" without express or implied warranty.
37  *
38  *
39  * Copyright (c) 1996-1999
40  * Silicon Graphics Computer Systems, Inc.
41  *
42  * Permission to use, copy, modify, distribute and sell this software
43  * and its documentation for any purpose is hereby granted without fee,
44  * provided that the above copyright notice appear in all copies and
45  * that both that copyright notice and this permission notice appear
46  * in supporting documentation. Silicon Graphics makes no
47  * representations about the suitability of this software for any
48  * purpose. It is provided "as is" without express or implied warranty.
49  */
50 
51 /** @file bits/stl_bvector.h
52  * This is an internal header file, included by other library headers.
53  * Do not attempt to use it directly. @headername{vector}
54  */
55 
56 #ifndef _STL_BVECTOR_H
57 #define _STL_BVECTOR_H 1
58 
59 #if __cplusplus >= 201103L
60 #include <initializer_list>
61 #include <bits/functional_hash.h>
62 #endif
63 
64 namespace std _GLIBCXX_VISIBILITY(default)
65 {
66 _GLIBCXX_BEGIN_NAMESPACE_VERSION
67 _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
68 
69  typedef unsigned long _Bit_type;
70  enum { _S_word_bit = int(__CHAR_BIT__ * sizeof(_Bit_type)) };
71 
72  struct _Bit_reference
73  {
74  _Bit_type * _M_p;
75  _Bit_type _M_mask;
76 
77  _Bit_reference(_Bit_type * __x, _Bit_type __y)
78  : _M_p(__x), _M_mask(__y) { }
79 
80  _Bit_reference() _GLIBCXX_NOEXCEPT : _M_p(0), _M_mask(0) { }
81 
82 #if __cplusplus >= 201103L
83  _Bit_reference(const _Bit_reference&) = default;
84 #endif
85 
86  operator bool() const _GLIBCXX_NOEXCEPT
87  { return !!(*_M_p & _M_mask); }
88 
89  _Bit_reference&
90  operator=(bool __x) _GLIBCXX_NOEXCEPT
91  {
92  if (__x)
93  *_M_p |= _M_mask;
94  else
95  *_M_p &= ~_M_mask;
96  return *this;
97  }
98 
99  _Bit_reference&
100  operator=(const _Bit_reference& __x) _GLIBCXX_NOEXCEPT
101  { return *this = bool(__x); }
102 
103  bool
104  operator==(const _Bit_reference& __x) const
105  { return bool(*this) == bool(__x); }
106 
107  bool
108  operator<(const _Bit_reference& __x) const
109  { return !bool(*this) && bool(__x); }
110 
111  void
112  flip() _GLIBCXX_NOEXCEPT
113  { *_M_p ^= _M_mask; }
114  };
115 
116 #if __cplusplus >= 201103L
117  inline void
118  swap(_Bit_reference __x, _Bit_reference __y) noexcept
119  {
120  bool __tmp = __x;
121  __x = __y;
122  __y = __tmp;
123  }
124 
125  inline void
126  swap(_Bit_reference __x, bool& __y) noexcept
127  {
128  bool __tmp = __x;
129  __x = __y;
130  __y = __tmp;
131  }
132 
133  inline void
134  swap(bool& __x, _Bit_reference __y) noexcept
135  {
136  bool __tmp = __x;
137  __x = __y;
138  __y = __tmp;
139  }
140 #endif
141 
142  struct _Bit_iterator_base
143  : public std::iterator<std::random_access_iterator_tag, bool>
144  {
145  _Bit_type * _M_p;
146  unsigned int _M_offset;
147 
148  _Bit_iterator_base(_Bit_type * __x, unsigned int __y)
149  : _M_p(__x), _M_offset(__y) { }
150 
151  void
152  _M_bump_up()
153  {
154  if (_M_offset++ == int(_S_word_bit) - 1)
155  {
156  _M_offset = 0;
157  ++_M_p;
158  }
159  }
160 
161  void
162  _M_bump_down()
163  {
164  if (_M_offset-- == 0)
165  {
166  _M_offset = int(_S_word_bit) - 1;
167  --_M_p;
168  }
169  }
170 
171  void
172  _M_incr(ptrdiff_t __i)
173  {
174  difference_type __n = __i + _M_offset;
175  _M_p += __n / int(_S_word_bit);
176  __n = __n % int(_S_word_bit);
177  if (__n < 0)
178  {
179  __n += int(_S_word_bit);
180  --_M_p;
181  }
182  _M_offset = static_cast<unsigned int>(__n);
183  }
184 
185  friend _GLIBCXX20_CONSTEXPR bool
186  operator==(const _Bit_iterator_base& __x, const _Bit_iterator_base& __y)
187  { return __x._M_p == __y._M_p && __x._M_offset == __y._M_offset; }
188 
189 #if __cpp_lib_three_way_comparison
190  friend constexpr strong_ordering
191  operator<=>(const _Bit_iterator_base& __x, const _Bit_iterator_base& __y)
192  noexcept
193  {
194  if (const auto __cmp = __x._M_p <=> __y._M_p; __cmp != 0)
195  return __cmp;
196  return __x._M_offset <=> __y._M_offset;
197  }
198 #else
199  friend bool
200  operator<(const _Bit_iterator_base& __x, const _Bit_iterator_base& __y)
201  {
202  return __x._M_p < __y._M_p
203  || (__x._M_p == __y._M_p && __x._M_offset < __y._M_offset);
204  }
205 
206  friend bool
207  operator!=(const _Bit_iterator_base& __x, const _Bit_iterator_base& __y)
208  { return !(__x == __y); }
209 
210  friend bool
211  operator>(const _Bit_iterator_base& __x, const _Bit_iterator_base& __y)
212  { return __y < __x; }
213 
214  friend bool
215  operator<=(const _Bit_iterator_base& __x, const _Bit_iterator_base& __y)
216  { return !(__y < __x); }
217 
218  friend bool
219  operator>=(const _Bit_iterator_base& __x, const _Bit_iterator_base& __y)
220  { return !(__x < __y); }
221 #endif // three-way comparison
222 
223  friend ptrdiff_t
224  operator-(const _Bit_iterator_base& __x, const _Bit_iterator_base& __y)
225  {
226  return (int(_S_word_bit) * (__x._M_p - __y._M_p)
227  + __x._M_offset - __y._M_offset);
228  }
229  };
230 
231  struct _Bit_iterator : public _Bit_iterator_base
232  {
233  typedef _Bit_reference reference;
234 #if __cplusplus > 201703L
235  typedef void pointer;
236 #else
237  typedef _Bit_reference* pointer;
238 #endif
239  typedef _Bit_iterator iterator;
240 
241  _Bit_iterator() : _Bit_iterator_base(0, 0) { }
242 
243  _Bit_iterator(_Bit_type * __x, unsigned int __y)
244  : _Bit_iterator_base(__x, __y) { }
245 
246  iterator
247  _M_const_cast() const
248  { return *this; }
249 
250  reference
251  operator*() const
252  { return reference(_M_p, 1UL << _M_offset); }
253 
254  iterator&
255  operator++()
256  {
257  _M_bump_up();
258  return *this;
259  }
260 
261  iterator
262  operator++(int)
263  {
264  iterator __tmp = *this;
265  _M_bump_up();
266  return __tmp;
267  }
268 
269  iterator&
270  operator--()
271  {
272  _M_bump_down();
273  return *this;
274  }
275 
276  iterator
277  operator--(int)
278  {
279  iterator __tmp = *this;
280  _M_bump_down();
281  return __tmp;
282  }
283 
284  iterator&
285  operator+=(difference_type __i)
286  {
287  _M_incr(__i);
288  return *this;
289  }
290 
291  iterator&
292  operator-=(difference_type __i)
293  {
294  *this += -__i;
295  return *this;
296  }
297 
298  reference
299  operator[](difference_type __i) const
300  { return *(*this + __i); }
301 
302  friend iterator
303  operator+(const iterator& __x, difference_type __n)
304  {
305  iterator __tmp = __x;
306  __tmp += __n;
307  return __tmp;
308  }
309 
310  friend iterator
311  operator+(difference_type __n, const iterator& __x)
312  { return __x + __n; }
313 
314  friend iterator
315  operator-(const iterator& __x, difference_type __n)
316  {
317  iterator __tmp = __x;
318  __tmp -= __n;
319  return __tmp;
320  }
321  };
322 
323  struct _Bit_const_iterator : public _Bit_iterator_base
324  {
325  typedef bool reference;
326  typedef bool const_reference;
327 #if __cplusplus > 201703L
328  typedef void pointer;
329 #else
330  typedef const bool* pointer;
331 #endif
332  typedef _Bit_const_iterator const_iterator;
333 
334  _Bit_const_iterator() : _Bit_iterator_base(0, 0) { }
335 
336  _Bit_const_iterator(_Bit_type * __x, unsigned int __y)
337  : _Bit_iterator_base(__x, __y) { }
338 
339  _Bit_const_iterator(const _Bit_iterator& __x)
340  : _Bit_iterator_base(__x._M_p, __x._M_offset) { }
341 
342  _Bit_iterator
343  _M_const_cast() const
344  { return _Bit_iterator(_M_p, _M_offset); }
345 
346  const_reference
347  operator*() const
348  { return _Bit_reference(_M_p, 1UL << _M_offset); }
349 
350  const_iterator&
351  operator++()
352  {
353  _M_bump_up();
354  return *this;
355  }
356 
357  const_iterator
358  operator++(int)
359  {
360  const_iterator __tmp = *this;
361  _M_bump_up();
362  return __tmp;
363  }
364 
365  const_iterator&
366  operator--()
367  {
368  _M_bump_down();
369  return *this;
370  }
371 
372  const_iterator
373  operator--(int)
374  {
375  const_iterator __tmp = *this;
376  _M_bump_down();
377  return __tmp;
378  }
379 
380  const_iterator&
381  operator+=(difference_type __i)
382  {
383  _M_incr(__i);
384  return *this;
385  }
386 
387  const_iterator&
388  operator-=(difference_type __i)
389  {
390  *this += -__i;
391  return *this;
392  }
393 
394  const_reference
395  operator[](difference_type __i) const
396  { return *(*this + __i); }
397 
398  friend const_iterator
399  operator+(const const_iterator& __x, difference_type __n)
400  {
401  const_iterator __tmp = __x;
402  __tmp += __n;
403  return __tmp;
404  }
405 
406  friend const_iterator
407  operator-(const const_iterator& __x, difference_type __n)
408  {
409  const_iterator __tmp = __x;
410  __tmp -= __n;
411  return __tmp;
412  }
413 
414  friend const_iterator
415  operator+(difference_type __n, const const_iterator& __x)
416  { return __x + __n; }
417  };
418 
419  template<typename _Alloc>
420  struct _Bvector_base
421  {
423  rebind<_Bit_type>::other _Bit_alloc_type;
425  _Bit_alloc_traits;
426  typedef typename _Bit_alloc_traits::pointer _Bit_pointer;
427 
428  struct _Bvector_impl_data
429  {
430 #if !_GLIBCXX_INLINE_VERSION
431  _Bit_iterator _M_start;
432 #else
433  // We don't need the offset field for the start, it's always zero.
434  struct {
435  _Bit_type* _M_p;
436  // Allow assignment from iterators (assume offset is zero):
437  void operator=(_Bit_iterator __it) { _M_p = __it._M_p; }
438  } _M_start;
439 #endif
440  _Bit_iterator _M_finish;
441  _Bit_pointer _M_end_of_storage;
442 
443  _Bvector_impl_data() _GLIBCXX_NOEXCEPT
444  : _M_start(), _M_finish(), _M_end_of_storage()
445  { }
446 
447 #if __cplusplus >= 201103L
448  _Bvector_impl_data(const _Bvector_impl_data&) = default;
449  _Bvector_impl_data&
450  operator=(const _Bvector_impl_data&) = default;
451 
452  _Bvector_impl_data(_Bvector_impl_data&& __x) noexcept
453  : _Bvector_impl_data(__x)
454  { __x._M_reset(); }
455 
456  void
457  _M_move_data(_Bvector_impl_data&& __x) noexcept
458  {
459  *this = __x;
460  __x._M_reset();
461  }
462 #endif
463 
464  void
465  _M_reset() _GLIBCXX_NOEXCEPT
466  { *this = _Bvector_impl_data(); }
467 
468  void
469  _M_swap_data(_Bvector_impl_data& __x) _GLIBCXX_NOEXCEPT
470  {
471  // Do not use std::swap(_M_start, __x._M_start), etc as it loses
472  // information used by TBAA.
473  std::swap(*this, __x);
474  }
475  };
476 
477  struct _Bvector_impl
478  : public _Bit_alloc_type, public _Bvector_impl_data
479  {
480  _Bvector_impl() _GLIBCXX_NOEXCEPT_IF(
481  is_nothrow_default_constructible<_Bit_alloc_type>::value)
482  : _Bit_alloc_type()
483  { }
484 
485  _Bvector_impl(const _Bit_alloc_type& __a) _GLIBCXX_NOEXCEPT
486  : _Bit_alloc_type(__a)
487  { }
488 
489 #if __cplusplus >= 201103L
490  // Not defaulted, to enforce noexcept(true) even when
491  // !is_nothrow_move_constructible<_Bit_alloc_type>.
492  _Bvector_impl(_Bvector_impl&& __x) noexcept
493  : _Bit_alloc_type(std::move(__x)), _Bvector_impl_data(std::move(__x))
494  { }
495 
496  _Bvector_impl(_Bit_alloc_type&& __a, _Bvector_impl&& __x) noexcept
497  : _Bit_alloc_type(std::move(__a)), _Bvector_impl_data(std::move(__x))
498  { }
499 #endif
500 
501  _Bit_type*
502  _M_end_addr() const _GLIBCXX_NOEXCEPT
503  {
504  if (this->_M_end_of_storage)
505  return std::__addressof(this->_M_end_of_storage[-1]) + 1;
506  return 0;
507  }
508  };
509 
510  public:
511  typedef _Alloc allocator_type;
512 
513  _Bit_alloc_type&
514  _M_get_Bit_allocator() _GLIBCXX_NOEXCEPT
515  { return this->_M_impl; }
516 
517  const _Bit_alloc_type&
518  _M_get_Bit_allocator() const _GLIBCXX_NOEXCEPT
519  { return this->_M_impl; }
520 
521  allocator_type
522  get_allocator() const _GLIBCXX_NOEXCEPT
523  { return allocator_type(_M_get_Bit_allocator()); }
524 
525 #if __cplusplus >= 201103L
526  _Bvector_base() = default;
527 #else
528  _Bvector_base() { }
529 #endif
530 
531  _Bvector_base(const allocator_type& __a)
532  : _M_impl(__a) { }
533 
534 #if __cplusplus >= 201103L
535  _Bvector_base(_Bvector_base&&) = default;
536 
537  _Bvector_base(_Bvector_base&& __x, const allocator_type& __a) noexcept
538  : _M_impl(_Bit_alloc_type(__a), std::move(__x._M_impl))
539  { }
540 #endif
541 
542  ~_Bvector_base()
543  { this->_M_deallocate(); }
544 
545  protected:
546  _Bvector_impl _M_impl;
547 
548  _Bit_pointer
549  _M_allocate(size_t __n)
550  { return _Bit_alloc_traits::allocate(_M_impl, _S_nword(__n)); }
551 
552  void
553  _M_deallocate()
554  {
555  if (_M_impl._M_start._M_p)
556  {
557  const size_t __n = _M_impl._M_end_addr() - _M_impl._M_start._M_p;
559  _M_impl._M_end_of_storage - __n,
560  __n);
561  _M_impl._M_reset();
562  }
563  }
564 
565 #if __cplusplus >= 201103L
566  void
567  _M_move_data(_Bvector_base&& __x) noexcept
568  { _M_impl._M_move_data(std::move(__x._M_impl)); }
569 #endif
570 
571  static size_t
572  _S_nword(size_t __n)
573  { return (__n + int(_S_word_bit) - 1) / int(_S_word_bit); }
574  };
575 
576 _GLIBCXX_END_NAMESPACE_CONTAINER
577 _GLIBCXX_END_NAMESPACE_VERSION
578 } // namespace std
579 
580 // Declare a partial specialization of vector<T, Alloc>.
581 #include <bits/stl_vector.h>
582 
583 namespace std _GLIBCXX_VISIBILITY(default)
584 {
585 _GLIBCXX_BEGIN_NAMESPACE_VERSION
586 _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
587 
588  /**
589  * @brief A specialization of vector for booleans which offers fixed time
590  * access to individual elements in any order.
591  *
592  * @ingroup sequences
593  *
594  * @tparam _Alloc Allocator type.
595  *
596  * Note that vector<bool> does not actually meet the requirements for being
597  * a container. This is because the reference and pointer types are not
598  * really references and pointers to bool. See DR96 for details. @see
599  * vector for function documentation.
600  *
601  * In some terminology a %vector can be described as a dynamic
602  * C-style array, it offers fast and efficient access to individual
603  * elements in any order and saves the user from worrying about
604  * memory and size allocation. Subscripting ( @c [] ) access is
605  * also provided as with C-style arrays.
606  */
607  template<typename _Alloc>
608  class vector<bool, _Alloc> : protected _Bvector_base<_Alloc>
609  {
610  typedef _Bvector_base<_Alloc> _Base;
611  typedef typename _Base::_Bit_pointer _Bit_pointer;
613 
614 #if __cplusplus >= 201103L
615  friend struct std::hash<vector>;
616 #endif
617 
618  public:
619  typedef bool value_type;
620  typedef size_t size_type;
621  typedef ptrdiff_t difference_type;
622  typedef _Bit_reference reference;
623  typedef bool const_reference;
624  typedef _Bit_reference* pointer;
625  typedef const bool* const_pointer;
626  typedef _Bit_iterator iterator;
627  typedef _Bit_const_iterator const_iterator;
630  typedef _Alloc allocator_type;
631 
632  allocator_type
633  get_allocator() const
634  { return _Base::get_allocator(); }
635 
636  protected:
637  using _Base::_M_allocate;
638  using _Base::_M_deallocate;
639  using _Base::_S_nword;
640  using _Base::_M_get_Bit_allocator;
641 
642  public:
643 #if __cplusplus >= 201103L
644  vector() = default;
645 #else
646  vector() { }
647 #endif
648 
649  explicit
650  vector(const allocator_type& __a)
651  : _Base(__a) { }
652 
653 #if __cplusplus >= 201103L
654  explicit
655  vector(size_type __n, const allocator_type& __a = allocator_type())
656  : vector(__n, false, __a)
657  { }
658 
659  vector(size_type __n, const bool& __value,
660  const allocator_type& __a = allocator_type())
661 #else
662  explicit
663  vector(size_type __n, const bool& __value = bool(),
664  const allocator_type& __a = allocator_type())
665 #endif
666  : _Base(__a)
667  {
668  _M_initialize(__n);
669  _M_initialize_value(__value);
670  }
671 
672  vector(const vector& __x)
673  : _Base(_Bit_alloc_traits::_S_select_on_copy(__x._M_get_Bit_allocator()))
674  {
675  _M_initialize(__x.size());
676  _M_copy_aligned(__x.begin(), __x.end(), begin());
677  }
678 
679 #if __cplusplus >= 201103L
680  vector(vector&&) = default;
681 
682  private:
683  vector(vector&& __x, const allocator_type& __a, true_type) noexcept
684  : _Base(std::move(__x), __a)
685  { }
686 
687  vector(vector&& __x, const allocator_type& __a, false_type)
688  : _Base(__a)
689  {
690  if (__x.get_allocator() == __a)
691  this->_M_move_data(std::move(__x));
692  else
693  {
694  _M_initialize(__x.size());
695  _M_copy_aligned(__x.begin(), __x.end(), begin());
696  __x.clear();
697  }
698  }
699 
700  public:
701  vector(vector&& __x, const allocator_type& __a)
702  noexcept(_Bit_alloc_traits::_S_always_equal())
703  : vector(std::move(__x), __a,
705  { }
706 
707  vector(const vector& __x, const allocator_type& __a)
708  : _Base(__a)
709  {
710  _M_initialize(__x.size());
711  _M_copy_aligned(__x.begin(), __x.end(), begin());
712  }
713 
715  const allocator_type& __a = allocator_type())
716  : _Base(__a)
717  {
718  _M_initialize_range(__l.begin(), __l.end(),
720  }
721 #endif
722 
723 #if __cplusplus >= 201103L
724  template<typename _InputIterator,
725  typename = std::_RequireInputIter<_InputIterator>>
726  vector(_InputIterator __first, _InputIterator __last,
727  const allocator_type& __a = allocator_type())
728  : _Base(__a)
729  {
730  _M_initialize_range(__first, __last,
731  std::__iterator_category(__first));
732  }
733 #else
734  template<typename _InputIterator>
735  vector(_InputIterator __first, _InputIterator __last,
736  const allocator_type& __a = allocator_type())
737  : _Base(__a)
738  {
739  // Check whether it's an integral type. If so, it's not an iterator.
740  typedef typename std::__is_integer<_InputIterator>::__type _Integral;
741  _M_initialize_dispatch(__first, __last, _Integral());
742  }
743 #endif
744 
745  ~vector() _GLIBCXX_NOEXCEPT { }
746 
747  vector&
748  operator=(const vector& __x)
749  {
750  if (&__x == this)
751  return *this;
752 #if __cplusplus >= 201103L
753  if (_Bit_alloc_traits::_S_propagate_on_copy_assign())
754  {
755  if (this->_M_get_Bit_allocator() != __x._M_get_Bit_allocator())
756  {
757  this->_M_deallocate();
758  std::__alloc_on_copy(_M_get_Bit_allocator(),
759  __x._M_get_Bit_allocator());
760  _M_initialize(__x.size());
761  }
762  else
763  std::__alloc_on_copy(_M_get_Bit_allocator(),
764  __x._M_get_Bit_allocator());
765  }
766 #endif
767  if (__x.size() > capacity())
768  {
769  this->_M_deallocate();
770  _M_initialize(__x.size());
771  }
772  this->_M_impl._M_finish = _M_copy_aligned(__x.begin(), __x.end(),
773  begin());
774  return *this;
775  }
776 
777 #if __cplusplus >= 201103L
778  vector&
779  operator=(vector&& __x) noexcept(_Bit_alloc_traits::_S_nothrow_move())
780  {
781  if (_Bit_alloc_traits::_S_propagate_on_move_assign()
782  || this->_M_get_Bit_allocator() == __x._M_get_Bit_allocator())
783  {
784  this->_M_deallocate();
785  this->_M_move_data(std::move(__x));
786  std::__alloc_on_move(_M_get_Bit_allocator(),
787  __x._M_get_Bit_allocator());
788  }
789  else
790  {
791  if (__x.size() > capacity())
792  {
793  this->_M_deallocate();
794  _M_initialize(__x.size());
795  }
796  this->_M_impl._M_finish = _M_copy_aligned(__x.begin(), __x.end(),
797  begin());
798  __x.clear();
799  }
800  return *this;
801  }
802 
803  vector&
805  {
806  this->assign(__l.begin(), __l.end());
807  return *this;
808  }
809 #endif
810 
811  // assign(), a generalized assignment member function. Two
812  // versions: one that takes a count, and one that takes a range.
813  // The range version is a member template, so we dispatch on whether
814  // or not the type is an integer.
815  void
816  assign(size_type __n, const bool& __x)
817  { _M_fill_assign(__n, __x); }
818 
819 #if __cplusplus >= 201103L
820  template<typename _InputIterator,
821  typename = std::_RequireInputIter<_InputIterator>>
822  void
823  assign(_InputIterator __first, _InputIterator __last)
824  { _M_assign_aux(__first, __last, std::__iterator_category(__first)); }
825 #else
826  template<typename _InputIterator>
827  void
828  assign(_InputIterator __first, _InputIterator __last)
829  {
830  // Check whether it's an integral type. If so, it's not an iterator.
831  typedef typename std::__is_integer<_InputIterator>::__type _Integral;
832  _M_assign_dispatch(__first, __last, _Integral());
833  }
834 #endif
835 
836 #if __cplusplus >= 201103L
837  void
839  { _M_assign_aux(__l.begin(), __l.end(), random_access_iterator_tag()); }
840 #endif
841 
842  iterator
843  begin() _GLIBCXX_NOEXCEPT
844  { return iterator(this->_M_impl._M_start._M_p, 0); }
845 
846  const_iterator
847  begin() const _GLIBCXX_NOEXCEPT
848  { return const_iterator(this->_M_impl._M_start._M_p, 0); }
849 
850  iterator
851  end() _GLIBCXX_NOEXCEPT
852  { return this->_M_impl._M_finish; }
853 
854  const_iterator
855  end() const _GLIBCXX_NOEXCEPT
856  { return this->_M_impl._M_finish; }
857 
859  rbegin() _GLIBCXX_NOEXCEPT
860  { return reverse_iterator(end()); }
861 
863  rbegin() const _GLIBCXX_NOEXCEPT
864  { return const_reverse_iterator(end()); }
865 
867  rend() _GLIBCXX_NOEXCEPT
868  { return reverse_iterator(begin()); }
869 
871  rend() const _GLIBCXX_NOEXCEPT
872  { return const_reverse_iterator(begin()); }
873 
874 #if __cplusplus >= 201103L
875  const_iterator
876  cbegin() const noexcept
877  { return const_iterator(this->_M_impl._M_start._M_p, 0); }
878 
879  const_iterator
880  cend() const noexcept
881  { return this->_M_impl._M_finish; }
882 
884  crbegin() const noexcept
885  { return const_reverse_iterator(end()); }
886 
888  crend() const noexcept
889  { return const_reverse_iterator(begin()); }
890 #endif
891 
892  size_type
893  size() const _GLIBCXX_NOEXCEPT
894  { return size_type(end() - begin()); }
895 
896  size_type
897  max_size() const _GLIBCXX_NOEXCEPT
898  {
899  const size_type __isize =
900  __gnu_cxx::__numeric_traits<difference_type>::__max
901  - int(_S_word_bit) + 1;
902  const size_type __asize
903  = _Bit_alloc_traits::max_size(_M_get_Bit_allocator());
904  return (__asize <= __isize / int(_S_word_bit)
905  ? __asize * int(_S_word_bit) : __isize);
906  }
907 
908  size_type
909  capacity() const _GLIBCXX_NOEXCEPT
910  { return size_type(const_iterator(this->_M_impl._M_end_addr(), 0)
911  - begin()); }
912 
913  _GLIBCXX_NODISCARD bool
914  empty() const _GLIBCXX_NOEXCEPT
915  { return begin() == end(); }
916 
917  reference
918  operator[](size_type __n)
919  { return begin()[__n]; }
920 
921  const_reference
922  operator[](size_type __n) const
923  { return begin()[__n]; }
924 
925  protected:
926  void
927  _M_range_check(size_type __n) const
928  {
929  if (__n >= this->size())
930  __throw_out_of_range_fmt(__N("vector<bool>::_M_range_check: __n "
931  "(which is %zu) >= this->size() "
932  "(which is %zu)"),
933  __n, this->size());
934  }
935 
936  public:
937  reference
938  at(size_type __n)
939  { _M_range_check(__n); return (*this)[__n]; }
940 
941  const_reference
942  at(size_type __n) const
943  { _M_range_check(__n); return (*this)[__n]; }
944 
945  void
946  reserve(size_type __n)
947  {
948  if (__n > max_size())
949  __throw_length_error(__N("vector::reserve"));
950  if (capacity() < __n)
951  _M_reallocate(__n);
952  }
953 
954  reference
955  front()
956  { return *begin(); }
957 
958  const_reference
959  front() const
960  { return *begin(); }
961 
962  reference
963  back()
964  { return *(end() - 1); }
965 
966  const_reference
967  back() const
968  { return *(end() - 1); }
969 
970  // _GLIBCXX_RESOLVE_LIB_DEFECTS
971  // DR 464. Suggestion for new member functions in standard containers.
972  // N.B. DR 464 says nothing about vector<bool> but we need something
973  // here due to the way we are implementing DR 464 in the debug-mode
974  // vector class.
975  void
976  data() _GLIBCXX_NOEXCEPT { }
977 
978  void
979  push_back(bool __x)
980  {
981  if (this->_M_impl._M_finish._M_p != this->_M_impl._M_end_addr())
982  *this->_M_impl._M_finish++ = __x;
983  else
984  _M_insert_aux(end(), __x);
985  }
986 
987  void
988  swap(vector& __x) _GLIBCXX_NOEXCEPT
989  {
990 #if __cplusplus >= 201103L
991  __glibcxx_assert(_Bit_alloc_traits::propagate_on_container_swap::value
992  || _M_get_Bit_allocator() == __x._M_get_Bit_allocator());
993 #endif
994  this->_M_impl._M_swap_data(__x._M_impl);
995  _Bit_alloc_traits::_S_on_swap(_M_get_Bit_allocator(),
996  __x._M_get_Bit_allocator());
997  }
998 
999  // [23.2.5]/1, third-to-last entry in synopsis listing
1000  static void
1001  swap(reference __x, reference __y) _GLIBCXX_NOEXCEPT
1002  {
1003  bool __tmp = __x;
1004  __x = __y;
1005  __y = __tmp;
1006  }
1007 
1008  iterator
1009 #if __cplusplus >= 201103L
1010  insert(const_iterator __position, const bool& __x = bool())
1011 #else
1012  insert(iterator __position, const bool& __x = bool())
1013 #endif
1014  {
1015  const difference_type __n = __position - begin();
1016  if (this->_M_impl._M_finish._M_p != this->_M_impl._M_end_addr()
1017  && __position == end())
1018  *this->_M_impl._M_finish++ = __x;
1019  else
1020  _M_insert_aux(__position._M_const_cast(), __x);
1021  return begin() + __n;
1022  }
1023 
1024 #if __cplusplus >= 201103L
1025  template<typename _InputIterator,
1026  typename = std::_RequireInputIter<_InputIterator>>
1027  iterator
1028  insert(const_iterator __position,
1029  _InputIterator __first, _InputIterator __last)
1030  {
1031  difference_type __offset = __position - cbegin();
1032  _M_insert_range(__position._M_const_cast(),
1033  __first, __last,
1034  std::__iterator_category(__first));
1035  return begin() + __offset;
1036  }
1037 #else
1038  template<typename _InputIterator>
1039  void
1040  insert(iterator __position,
1041  _InputIterator __first, _InputIterator __last)
1042  {
1043  // Check whether it's an integral type. If so, it's not an iterator.
1044  typedef typename std::__is_integer<_InputIterator>::__type _Integral;
1045  _M_insert_dispatch(__position, __first, __last, _Integral());
1046  }
1047 #endif
1048 
1049 #if __cplusplus >= 201103L
1050  iterator
1051  insert(const_iterator __position, size_type __n, const bool& __x)
1052  {
1053  difference_type __offset = __position - cbegin();
1054  _M_fill_insert(__position._M_const_cast(), __n, __x);
1055  return begin() + __offset;
1056  }
1057 #else
1058  void
1059  insert(iterator __position, size_type __n, const bool& __x)
1060  { _M_fill_insert(__position, __n, __x); }
1061 #endif
1062 
1063 #if __cplusplus >= 201103L
1064  iterator
1065  insert(const_iterator __p, initializer_list<bool> __l)
1066  { return this->insert(__p, __l.begin(), __l.end()); }
1067 #endif
1068 
1069  void
1070  pop_back()
1071  { --this->_M_impl._M_finish; }
1072 
1073  iterator
1074 #if __cplusplus >= 201103L
1075  erase(const_iterator __position)
1076 #else
1077  erase(iterator __position)
1078 #endif
1079  { return _M_erase(__position._M_const_cast()); }
1080 
1081  iterator
1082 #if __cplusplus >= 201103L
1083  erase(const_iterator __first, const_iterator __last)
1084 #else
1085  erase(iterator __first, iterator __last)
1086 #endif
1087  { return _M_erase(__first._M_const_cast(), __last._M_const_cast()); }
1088 
1089  void
1090  resize(size_type __new_size, bool __x = bool())
1091  {
1092  if (__new_size < size())
1093  _M_erase_at_end(begin() + difference_type(__new_size));
1094  else
1095  insert(end(), __new_size - size(), __x);
1096  }
1097 
1098 #if __cplusplus >= 201103L
1099  void
1100  shrink_to_fit()
1101  { _M_shrink_to_fit(); }
1102 #endif
1103 
1104  void
1105  flip() _GLIBCXX_NOEXCEPT
1106  {
1107  _Bit_type * const __end = this->_M_impl._M_end_addr();
1108  for (_Bit_type * __p = this->_M_impl._M_start._M_p; __p != __end; ++__p)
1109  *__p = ~*__p;
1110  }
1111 
1112  void
1113  clear() _GLIBCXX_NOEXCEPT
1114  { _M_erase_at_end(begin()); }
1115 
1116 #if __cplusplus >= 201103L
1117  template<typename... _Args>
1118 #if __cplusplus > 201402L
1119  reference
1120 #else
1121  void
1122 #endif
1123  emplace_back(_Args&&... __args)
1124  {
1125  push_back(bool(__args...));
1126 #if __cplusplus > 201402L
1127  return back();
1128 #endif
1129  }
1130 
1131  template<typename... _Args>
1132  iterator
1133  emplace(const_iterator __pos, _Args&&... __args)
1134  { return insert(__pos, bool(__args...)); }
1135 #endif
1136 
1137  protected:
1138  // Precondition: __first._M_offset == 0 && __result._M_offset == 0.
1139  iterator
1140  _M_copy_aligned(const_iterator __first, const_iterator __last,
1141  iterator __result)
1142  {
1143  _Bit_type* __q = std::copy(__first._M_p, __last._M_p, __result._M_p);
1144  return std::copy(const_iterator(__last._M_p, 0), __last,
1145  iterator(__q, 0));
1146  }
1147 
1148  void
1149  _M_initialize(size_type __n)
1150  {
1151  if (__n)
1152  {
1153  _Bit_pointer __q = this->_M_allocate(__n);
1154  this->_M_impl._M_end_of_storage = __q + _S_nword(__n);
1155  iterator __start = iterator(std::__addressof(*__q), 0);
1156  this->_M_impl._M_start = __start;
1157  this->_M_impl._M_finish = __start + difference_type(__n);
1158  }
1159  }
1160 
1161  void
1162  _M_initialize_value(bool __x)
1163  {
1164  if (_Bit_type* __p = this->_M_impl._M_start._M_p)
1165  __builtin_memset(__p, __x ? ~0 : 0,
1166  (this->_M_impl._M_end_addr() - __p)
1167  * sizeof(_Bit_type));
1168  }
1169 
1170  void
1171  _M_reallocate(size_type __n);
1172 
1173 #if __cplusplus >= 201103L
1174  bool
1175  _M_shrink_to_fit();
1176 #endif
1177 
1178 #if __cplusplus < 201103L
1179  // _GLIBCXX_RESOLVE_LIB_DEFECTS
1180  // 438. Ambiguity in the "do the right thing" clause
1181  template<typename _Integer>
1182  void
1183  _M_initialize_dispatch(_Integer __n, _Integer __x, __true_type)
1184  {
1185  _M_initialize(static_cast<size_type>(__n));
1186  _M_initialize_value(__x);
1187  }
1188 
1189  template<typename _InputIterator>
1190  void
1191  _M_initialize_dispatch(_InputIterator __first, _InputIterator __last,
1192  __false_type)
1193  { _M_initialize_range(__first, __last,
1194  std::__iterator_category(__first)); }
1195 #endif
1196 
1197  template<typename _InputIterator>
1198  void
1199  _M_initialize_range(_InputIterator __first, _InputIterator __last,
1201  {
1202  for (; __first != __last; ++__first)
1203  push_back(*__first);
1204  }
1205 
1206  template<typename _ForwardIterator>
1207  void
1208  _M_initialize_range(_ForwardIterator __first, _ForwardIterator __last,
1210  {
1211  const size_type __n = std::distance(__first, __last);
1212  _M_initialize(__n);
1213  std::copy(__first, __last, begin());
1214  }
1215 
1216 #if __cplusplus < 201103L
1217  // _GLIBCXX_RESOLVE_LIB_DEFECTS
1218  // 438. Ambiguity in the "do the right thing" clause
1219  template<typename _Integer>
1220  void
1221  _M_assign_dispatch(_Integer __n, _Integer __val, __true_type)
1222  { _M_fill_assign(__n, __val); }
1223 
1224  template<class _InputIterator>
1225  void
1226  _M_assign_dispatch(_InputIterator __first, _InputIterator __last,
1227  __false_type)
1228  { _M_assign_aux(__first, __last, std::__iterator_category(__first)); }
1229 #endif
1230 
1231  void
1232  _M_fill_assign(size_t __n, bool __x)
1233  {
1234  if (__n > size())
1235  {
1236  _M_initialize_value(__x);
1237  insert(end(), __n - size(), __x);
1238  }
1239  else
1240  {
1241  _M_erase_at_end(begin() + __n);
1242  _M_initialize_value(__x);
1243  }
1244  }
1245 
1246  template<typename _InputIterator>
1247  void
1248  _M_assign_aux(_InputIterator __first, _InputIterator __last,
1250  {
1251  iterator __cur = begin();
1252  for (; __first != __last && __cur != end(); ++__cur, (void)++__first)
1253  *__cur = *__first;
1254  if (__first == __last)
1255  _M_erase_at_end(__cur);
1256  else
1257  insert(end(), __first, __last);
1258  }
1259 
1260  template<typename _ForwardIterator>
1261  void
1262  _M_assign_aux(_ForwardIterator __first, _ForwardIterator __last,
1264  {
1265  const size_type __len = std::distance(__first, __last);
1266  if (__len < size())
1267  _M_erase_at_end(std::copy(__first, __last, begin()));
1268  else
1269  {
1270  _ForwardIterator __mid = __first;
1271  std::advance(__mid, size());
1272  std::copy(__first, __mid, begin());
1273  insert(end(), __mid, __last);
1274  }
1275  }
1276 
1277 #if __cplusplus < 201103L
1278  // _GLIBCXX_RESOLVE_LIB_DEFECTS
1279  // 438. Ambiguity in the "do the right thing" clause
1280  template<typename _Integer>
1281  void
1282  _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __x,
1283  __true_type)
1284  { _M_fill_insert(__pos, __n, __x); }
1285 
1286  template<typename _InputIterator>
1287  void
1288  _M_insert_dispatch(iterator __pos,
1289  _InputIterator __first, _InputIterator __last,
1290  __false_type)
1291  { _M_insert_range(__pos, __first, __last,
1292  std::__iterator_category(__first)); }
1293 #endif
1294 
1295  void
1296  _M_fill_insert(iterator __position, size_type __n, bool __x);
1297 
1298  template<typename _InputIterator>
1299  void
1300  _M_insert_range(iterator __pos, _InputIterator __first,
1301  _InputIterator __last, std::input_iterator_tag)
1302  {
1303  for (; __first != __last; ++__first)
1304  {
1305  __pos = insert(__pos, *__first);
1306  ++__pos;
1307  }
1308  }
1309 
1310  template<typename _ForwardIterator>
1311  void
1312  _M_insert_range(iterator __position, _ForwardIterator __first,
1313  _ForwardIterator __last, std::forward_iterator_tag);
1314 
1315  void
1316  _M_insert_aux(iterator __position, bool __x);
1317 
1318  size_type
1319  _M_check_len(size_type __n, const char* __s) const
1320  {
1321  if (max_size() - size() < __n)
1322  __throw_length_error(__N(__s));
1323 
1324  const size_type __len = size() + std::max(size(), __n);
1325  return (__len < size() || __len > max_size()) ? max_size() : __len;
1326  }
1327 
1328  void
1329  _M_erase_at_end(iterator __pos)
1330  { this->_M_impl._M_finish = __pos; }
1331 
1332  iterator
1333  _M_erase(iterator __pos);
1334 
1335  iterator
1336  _M_erase(iterator __first, iterator __last);
1337  };
1338 
1339 _GLIBCXX_END_NAMESPACE_CONTAINER
1340 
1341  inline void
1342  __fill_bvector(_GLIBCXX_STD_C::_Bit_type * __v,
1343  unsigned int __first, unsigned int __last, bool __x)
1344  {
1345  using _GLIBCXX_STD_C::_Bit_type;
1346  using _GLIBCXX_STD_C::_S_word_bit;
1347  const _Bit_type __fmask = ~0ul << __first;
1348  const _Bit_type __lmask = ~0ul >> (_S_word_bit - __last);
1349  const _Bit_type __mask = __fmask & __lmask;
1350 
1351  if (__x)
1352  *__v |= __mask;
1353  else
1354  *__v &= ~__mask;
1355  }
1356 
1357  inline void
1358  __fill_a1(_GLIBCXX_STD_C::_Bit_iterator __first,
1359  _GLIBCXX_STD_C::_Bit_iterator __last, const bool& __x)
1360  {
1361  using _GLIBCXX_STD_C::_Bit_type;
1362  using _GLIBCXX_STD_C::_S_word_bit;
1363  if (__first._M_p != __last._M_p)
1364  {
1365  _Bit_type* __first_p = __first._M_p;
1366  if (__first._M_offset != 0)
1367  __fill_bvector(__first_p++, __first._M_offset, _S_word_bit, __x);
1368 
1369  __builtin_memset(__first_p, __x ? ~0 : 0,
1370  (__last._M_p - __first_p) * sizeof(_Bit_type));
1371 
1372  if (__last._M_offset != 0)
1373  __fill_bvector(__last._M_p, 0, __last._M_offset, __x);
1374  }
1375  else if (__first._M_offset != __last._M_offset)
1376  __fill_bvector(__first._M_p, __first._M_offset, __last._M_offset, __x);
1377  }
1378 
1379 #if __cplusplus >= 201103L
1380  // DR 1182.
1381  /// std::hash specialization for vector<bool>.
1382  template<typename _Alloc>
1383  struct hash<_GLIBCXX_STD_C::vector<bool, _Alloc>>
1384  : public __hash_base<size_t, _GLIBCXX_STD_C::vector<bool, _Alloc>>
1385  {
1386  size_t
1387  operator()(const _GLIBCXX_STD_C::vector<bool, _Alloc>&) const noexcept;
1388  };
1389 #endif // C++11
1390 
1391 _GLIBCXX_END_NAMESPACE_VERSION
1392 } // namespace std
1393 
1394 #endif
__gnu_cxx::__alloc_traits::deallocate
static constexpr void deallocate(_Alloc &__a, pointer __p, size_type __n)
Deallocate memory.
Definition: bits/alloc_traits.h:340
__gnu_cxx::__alloc_traits
Uniform interface to C++98 and C++11 allocators.
Definition: ext/alloc_traits.h:52
std::hash
Primary class template hash.
Definition: functional_hash.h:102
std::vector::vector
vector()=default
Creates a vector with no elements.
std::vector::cbegin
const_iterator cbegin() const noexcept
Definition: stl_vector.h:884
std::vector::_M_range_check
void _M_range_check(size_type __n) const
Safety check used only from at().
Definition: stl_vector.h:1070
std::vector::operator=
vector & operator=(const vector &__x)
Vector assignment operator.
Definition: vector.tcc:199
std::vector::size
size_type size() const noexcept
Definition: stl_vector.h:918
std::__iterator_category
constexpr iterator_traits< _Iter >::iterator_category __iterator_category(const _Iter &)
Definition: stl_iterator_base_types.h:238
std::operator+
constexpr complex< _Tp > operator+(const complex< _Tp > &__x, const complex< _Tp > &__y)
Return new complex value x plus y.
Definition: complex:332
std::vector::end
iterator end() noexcept
Definition: stl_vector.h:829
__gnu_cxx::__alloc_traits::allocate
static constexpr pointer allocate(_Alloc &__a, size_type __n)
Allocate memory.
Definition: bits/alloc_traits.h:313
std::reverse_iterator
Definition: bits/stl_iterator.h:132
std::vector::back
reference back() noexcept
Definition: stl_vector.h:1143
std
ISO C++ entities toplevel namespace is std.
std::vector::operator[]
reference operator[](size_type __n) noexcept
Subscript access to the data contained in the vector.
Definition: stl_vector.h:1043
std::allocator_traits::is_always_equal
__detected_or_t< typename is_empty< _Alloc >::type, __equal, _Alloc > is_always_equal
Whether all instances of the allocator type compare equal.
Definition: bits/alloc_traits.h:206
std::distance
constexpr iterator_traits< _InputIterator >::difference_type distance(_InputIterator __first, _InputIterator __last)
A generalization of pointer arithmetic.
Definition: stl_iterator_base_funcs.h:138
std::vector::shrink_to_fit
void shrink_to_fit()
Definition: stl_vector.h:989
std::vector::swap
void swap(vector &__x) noexcept
Swaps data with another vector.
Definition: stl_vector.h:1480
std::vector::erase
iterator erase(const_iterator __position)
Remove element at given position.
Definition: stl_vector.h:1430
std::integral_constant
integral_constant
Definition: type_traits:58
std::forward_iterator_tag
Forward iterators support a superset of input iterator operations.
Definition: stl_iterator_base_types.h:99
std::__addressof
constexpr _Tp * __addressof(_Tp &__r) noexcept
Same as C++11 std::addressof.
Definition: move.h:49
std::vector::clear
void clear() noexcept
Definition: stl_vector.h:1498
std::operator-
constexpr complex< _Tp > operator-(const complex< _Tp > &__x, const complex< _Tp > &__y)
Return new complex value x minus y.
Definition: complex:362
std::vector::push_back
void push_back(const value_type &__x)
Add data to the end of the vector.
Definition: stl_vector.h:1187
std::vector::~vector
~vector() noexcept
Definition: stl_vector.h:678
std::max
constexpr const _Tp & max(const _Tp &, const _Tp &)
This does what you think it does.
Definition: stl_algobase.h:254
std::vector::reserve
void reserve(size_type __n)
Attempt to preallocate enough memory for specified number of elements.
Definition: vector.tcc:67
std::move
constexpr std::remove_reference< _Tp >::type && move(_Tp &&__t) noexcept
Convert a value to an rvalue.
Definition: move.h:101
operator=
auto_ptr & operator=(auto_ptr &__a)
auto_ptr assignment operator.
Definition: auto_ptr.h:47
std::vector::data
_Tp * data() noexcept
Definition: stl_vector.h:1168
std::vector::at
reference at(size_type __n)
Provides access to the data contained in the vector.
Definition: stl_vector.h:1092
initializer_list
std::vector
A standard container which offers fixed time access to individual elements in any order.
Definition: stl_vector.h:390
std::vector::cend
const_iterator cend() const noexcept
Definition: stl_vector.h:893
std::swap
void swap(any &__x, any &__y) noexcept
Exchange the states of two any objects.
Definition: any:412
std::initializer_list
initializer_list
Definition: initializer_list:48
std::random_access_iterator_tag
Random-access iterators support a superset of bidirectional iterator operations.
Definition: stl_iterator_base_types.h:107
std::iterator
Common iterator class.
Definition: stl_iterator_base_types.h:128
std::vector::emplace
iterator emplace(const_iterator __position, _Args &&... __args)
Inserts an object in vector before specified iterator.
Definition: stl_vector.h:1248
std::vector::insert
iterator insert(const_iterator __position, const value_type &__x)
Inserts given value into vector before specified iterator.
Definition: vector.tcc:132
std::vector::rend
reverse_iterator rend() noexcept
Definition: stl_vector.h:865
std::vector::get_allocator
allocator_type get_allocator() const noexcept
Get a copy of the memory allocation object.
Definition: stl_vector.h:284
std::vector::assign
void assign(size_type __n, const value_type &__val)
Assigns a given value to a vector.
Definition: stl_vector.h:749
std::vector::begin
iterator begin() noexcept
Definition: stl_vector.h:811
std::vector::pop_back
void pop_back() noexcept
Removes last element.
Definition: stl_vector.h:1225
std::input_iterator_tag
Marking input iterators.
Definition: stl_iterator_base_types.h:93
std::vector::front
reference front() noexcept
Definition: stl_vector.h:1121
std::operator*
constexpr complex< _Tp > operator*(const complex< _Tp > &__x, const complex< _Tp > &__y)
Return new complex value x times y.
Definition: complex:392
std::vector::capacity
size_type capacity() const noexcept
Definition: stl_vector.h:998
std::vector::crend
const_reverse_iterator crend() const noexcept
Definition: stl_vector.h:911
std::vector::resize
void resize(size_type __new_size)
Resizes the vector to the specified number of elements.
Definition: stl_vector.h:937
stl_vector.h
std::iterator< std::random_access_iterator_tag, bool >::difference_type
ptrdiff_t difference_type
Distance between iterators is represented as this type.
Definition: stl_iterator_base_types.h:134
std::vector::max_size
size_type max_size() const noexcept
Definition: stl_vector.h:923
std::vector::crbegin
const_reverse_iterator crbegin() const noexcept
Definition: stl_vector.h:902
std::vector::empty
bool empty() const noexcept
Definition: stl_vector.h:1007
std::vector::rbegin
reverse_iterator rbegin() noexcept
Definition: stl_vector.h:847
functional_hash.h