Lines Matching defs:std

118   using const_reverse_iterator = std::reverse_iterator<const_iterator>;
119 using reverse_iterator = std::reverse_iterator<iterator>;
194 std::uninitialized_copy(std::make_move_iterator(I),
195 std::make_move_iterator(E), Dest);
202 std::uninitialized_copy(I, E, Dest);
221 ::new ((void*) this->end()) T(::std::move(Elt));
239 NewCapacity = std::min(std::max(NewCapacity, MinSize), size_t(UINT32_MAX));
279 std::uninitialized_copy(I, E, Dest);
287 typename std::enable_if<std::is_same<typename std::remove_const<T1>::type,
290 // iterators): std::uninitialized_copy optimizes to memmove, but we can
364 std::uninitialized_fill(this->end(), this->begin()+N, NV);
375 T Result = ::std::move(this->back());
384 typename = typename std::enable_if<std::is_convertible<
385 typename std::iterator_traits<in_iter>::iterator_category,
386 std::input_iterator_tag>::value>::type>
388 size_type NumInputs = std::distance(in_start, in_end);
401 std::uninitialized_fill_n(this->end(), NumInputs, Elt);
405 void append(std::initializer_list<T> IL) {
417 std::uninitialized_fill(this->begin(), this->end(), Elt);
421 typename = typename std::enable_if<std::is_convertible<
422 typename std::iterator_traits<in_iter>::iterator_category,
423 std::input_iterator_tag>::value>::type>
429 void assign(std::initializer_list<T> IL) {
443 std::move(I+1, this->end(), I);
460 iterator I = std::move(E, this->end(), S);
469 this->push_back(::std::move(Elt));
482 ::new ((void*) this->end()) T(::std::move(this->back()));
484 std::move_backward(I, this->end()-1, this->end());
493 *I = ::std::move(*EltPtr);
511 ::new ((void*) this->end()) T(std::move(this->back()));
513 std::move_backward(I, this->end()-1, this->end());
550 append(std::move_iterator<iterator>(this->end() - NumToInsert),
551 std::move_iterator<iterator>(this->end()));
554 std::move_backward(I, OldEnd-NumToInsert, OldEnd);
556 std::fill_n(I, NumToInsert, Elt);
570 std::fill_n(I, NumOverwritten, Elt);
573 std::uninitialized_fill_n(OldEnd, NumToInsert-NumOverwritten, Elt);
578 typename = typename std::enable_if<std::is_convertible<
579 typename std::iterator_traits<ItTy>::iterator_category,
580 std::input_iterator_tag>::value>::type>
593 size_t NumToInsert = std::distance(From, To);
607 append(std::move_iterator<iterator>(this->end() - NumToInsert),
608 std::move_iterator<iterator>(this->end()));
611 std::move_backward(I, OldEnd-NumToInsert, OldEnd);
613 std::copy(From, To, I);
637 void insert(iterator I, std::initializer_list<T> IL) {
644 ::new ((void *)this->end()) T(std::forward<ArgTypes>(Args)...);
655 return std::equal(this->begin(), this->end(), RHS.begin());
662 return std::lexicographical_compare(this->begin(), this->end(),
673 std::swap(this->BeginX, RHS.BeginX);
674 std::swap(this->Size, RHS.Size);
675 std::swap(this->Capacity, RHS.Capacity);
687 std::swap((*this)[i], RHS[i]);
719 NewEnd = std::copy(RHS.begin(), RHS.begin()+RHSSize, this->begin());
742 std::copy(RHS.begin(), RHS.begin()+CurSize, this->begin());
778 NewEnd = std::move(RHS.begin(), RHS.end(), NewEnd);
802 std::move(RHS.begin(), RHS.begin()+CurSize, this->begin());
852 typename = typename std::enable_if<std::is_convertible<
853 typename std::iterator_traits<ItTy>::iterator_category,
854 std::input_iterator_tag>::value>::type>
865 SmallVector(std::initializer_list<T> IL) : SmallVectorImpl<T>(N) {
881 SmallVectorImpl<T>::operator=(::std::move(RHS));
886 SmallVectorImpl<T>::operator=(::std::move(RHS));
890 SmallVectorImpl<T>::operator=(::std::move(RHS));
895 SmallVectorImpl<T>::operator=(::std::move(RHS));
899 const SmallVector &operator=(std::initializer_list<T> IL) {
914 SmallVector<typename std::remove_const<typename std::remove_reference<
915 decltype(*std::begin(std::declval<R &>()))>::type>::type,
918 return {std::begin(Range), std::end(Range)};
923 namespace std {
925 /// Implement std::swap in terms of SmallVector swap.
932 /// Implement std::swap in terms of SmallVector swap.
939 } // end namespace std