当你想在容器之间移动对象时，你可以使用list::splice。

例如，一个图划分算法可以将常数数量的对象递归地划分到数量不断增加的容器中。对象应该初始化一次，并始终保持在内存中的相同位置。通过重新链接来重新排列比重新分配要快得多。

Edit: as libraries prepare to implement C++0x, the general case of splicing a subsequence into a list is becoming linear complexity with the length of the sequence. This is because splice (now) needs to iterate over the sequence to count the number of elements in it. (Because the list needs to record its size.) Simply counting and re-linking the list is still faster than any alternative, and splicing an entire list or a single element are special cases with constant complexity. But, if you have long sequences to splice, you might have to dig around for a better, old-fashioned, non-compliant container.

List是双链表，所以很容易插入和删除一个元素。我们只需要改变这几个指针，而在向量中如果我们想在中间插入一个元素那么它后面的每个元素都要移动一个下标。此外，如果向量的大小已满，那么它必须首先增加它的大小。所以这是一个昂贵的手术。 因此，在这种情况下，只要需要更频繁地执行插入和删除操作，就应该使用案例列表。

想要重复将大量项插入序列末尾以外的任何位置的情况。

看看每种不同类型的容器的复杂度保证:

标准容器的复杂性保证是什么?

当你想在容器之间移动对象时，你可以使用list::splice。

例如，一个图划分算法可以将常数数量的对象递归地划分到数量不断增加的容器中。对象应该初始化一次，并始终保持在内存中的相同位置。通过重新链接来重新排列比重新分配要快得多。

Edit: as libraries prepare to implement C++0x, the general case of splicing a subsequence into a list is becoming linear complexity with the length of the sequence. This is because splice (now) needs to iterate over the sequence to count the number of elements in it. (Because the list needs to record its size.) Simply counting and re-linking the list is still faster than any alternative, and splicing an entire list or a single element are special cases with constant complexity. But, if you have long sequences to splice, you might have to dig around for a better, old-fashioned, non-compliant container.

当你在序列中间有很多插入或删除时。例如，内存管理器。

列表只是stl中double - linkedlist的包装器，因此提供了您可能希望从d-linklist中获得的功能，即O(1)插入和删除。 向量是具有传染性的数据序列，其工作方式类似于动态数组。S-更容易遍历。