Is deleting the tail of a vector (through erase) memory efficient?

When doing v.erase(some_iterator);

Are implementations smart enough to not do any reallocations/bytes-copying since we could just update the size? (Unlike when erasing strictly inner elements.)