iterator insert(iterator I, size_type NumToInsert, const T &Elt) {
if (I == this->end()) { // Important special case for empty vector.
append(NumToInsert, Elt);
- return this->end()-1;
+ return NumToInsert == 0 ? this->end() : this->end()-1;
}
// Convert iterator to elt# to avoid invalidating iterator when we reserve()
iterator insert(iterator I, ItTy From, ItTy To) {
if (I == this->end()) { // Important special case for empty vector.
append(From, To);
- return this->end()-1;
+ return From == To ? this->end() : this->end()-1;
}
size_t NumToInsert = std::distance(From, To);
makeSequence(theVector, 10, 15);
theVector.insert(theVector.begin() + 1, 2, Constructable(16));
assertValuesInOrder(theVector, 8u, 10, 16, 16, 11, 12, 13, 14, 15);
+
+ EXPECT_EQ(theVector.end(),
+ theVector.insert(theVector.end(), 0, Constructable(42)));
}
// Insert range.
makeSequence(theVector, 1, 3);
theVector.insert(theVector.begin() + 1, 3, Constructable(77));
assertValuesInOrder(theVector, 6u, 1, 77, 77, 77, 2, 3);
+
+ EXPECT_EQ(theVector.end(), theVector.insert(theVector.end(),
+ theVector.begin(),
+ theVector.begin()));
}
// Comparison tests.