In the
range version (1), the new contents are elements constructed from each of the elements in the range between
first and
last, in the same order.
In the
fill version (2), the new contents are
n elements, each initialized to a copy of
val.
If needed, the container uses its
internal allocator to allocate additional storage.
In the
range version (1), the new contents are elements constructed from each of the elements in the range between
first and
last, in the same order.
In the
fill version (2), the new contents are
n elements, each initialized to a copy of
val.
In the
initializer list version (3), the new contents are copies of the values passed as initializer list, in the same order.
If there are changes in storage, the
internal allocator is used (through its
traits). It is also used to
destroy all existing elements, and to
construct the new ones.