• Home
  • History
  • Annotate
  • Raw
  • Download
  • only in /freebsd-12-stable/contrib/libstdc++/include/bits/

Lines Matching defs:std

69 _GLIBCXX_BEGIN_NESTED_NAMESPACE(std, _GLIBCXX_STD)
110 typedef std::random_access_iterator_tag iterator_category;
239 // order to avoid ambiguous overload resolution when std::rel_ops operators
398 //This struct encapsulates the implementation of the std::deque
495 this->_M_impl._M_map_size = std::max((size_t) _S_initial_map_size,
579 * std::map class, and "nodes" should not be confused with
580 * std::list's usage of "node".)
637 template<typename _Tp, typename _Alloc = std::allocator<_Tp> >
656 typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
657 typedef std::reverse_iterator<iterator> reverse_iterator;
720 { std::__uninitialized_copy_a(__x.begin(), __x.end(),
744 typedef typename std::__is_integer<_InputIterator>::__type _Integral;
796 typedef typename std::__is_integer<_InputIterator>::__type _Integral;
962 * @throw std::out_of_range If @a n is an invalid index.
980 * @throw std::out_of_range If @a n is an invalid index.
1160 typedef typename std::__is_integer<_InputIterator>::__type _Integral;
1205 * Note that the global std::swap() function is specialized such that
1206 * std::swap(d1,d2) will feed to this function.
1211 std::swap(this->_M_impl._M_start, __x._M_impl._M_start);
1212 std::swap(this->_M_impl._M_finish, __x._M_impl._M_finish);
1213 std::swap(this->_M_impl._M_map, __x._M_impl._M_map);
1214 std::swap(this->_M_impl._M_map_size, __x._M_impl._M_map_size);
1218 std::__alloc_swap<_Tp_alloc_type>::_S_do_it(_M_get_Tp_allocator(),
1250 typedef typename std::iterator_traits<_InputIterator>::
1272 std::input_iterator_tag);
1278 std::forward_iterator_tag);
1314 typedef typename std::iterator_traits<_InputIterator>::
1323 std::input_iterator_tag);
1329 std::forward_iterator_tag)
1331 const size_type __len = std::distance(__first, __last);
1335 std::advance(__mid, size());
1336 std::copy(__first, __mid, begin());
1340 _M_erase_at_end(std::copy(__first, __last, begin()));
1350 std::fill(begin(), end(), __val);
1356 std::fill(begin(), end(), __val);
1395 typedef typename std::iterator_traits<_InputIterator>::
1404 _InputIterator __last, std::input_iterator_tag);
1410 _ForwardIterator __last, std::forward_iterator_tag);
1455 const std::allocator<_Tp>&)
1457 typedef typename std::__is_scalar<value_type>::__type
1564 && std::equal(__x.begin(), __x.end(), __y.begin()); }
1575 * See std::lexicographical_compare() for how the determination is made.
1581 { return std::lexicographical_compare(__x.begin(), __x.end(),
1612 /// See std::deque::swap().