STL vector中的clear方法（18）

最新推荐文章于 2021-08-24 17:22:10 发布

coderguang

最新推荐文章于 2021-08-24 17:22:10 发布

阅读量3.9k

点赞数 1

分类专栏： STL containers STL 容器接口系列译文文章标签： STL STL vector

STL containers 同时被 2 个专栏收录

90 篇文章 6 订阅

订阅专栏

STL 容器接口系列译文

89 篇文章 11 订阅

订阅专栏

原文地址:http://www.cplusplus.com/reference/vector/vector/clear/

public member function

 
 <vector> 

void clear() noexcept;

Clear content

Removes all elements from the vector (which are destroyed), leaving the container with a size of 0.

移除vector内所有元素（并销毁他们）,使容器大小为变为0（size而不是capacity）。

例子：

#include <iostream>
#include <vector>
using namespace std;
int main()
{
	vector<int> vi={10,20,30};
	cout<<"size="<<vi.size()<<endl;
	cout<<"capacity="<<vi.capacity()<<endl;
	vi.clear();
	cout<<"size="<<vi.size()<<endl;
	cout<<"capacity="<<vi.capacity()<<endl;
	cout<<"vi[1]="<<vi[1]<<endl;
	
}

运行结果:

发现数据还是没有被销毁阿。。。

A reallocation is not guaranteed to happen, and the vector capacity is not guaranteed to change due to calling this function. A typical alternative that forces a reallocation is to use swap:

vector<T>().swap(x);   // clear x reallocating

不保证会发生重分配，也不保证该函数会改变capacity，另一个备选的发生重分配的是swap。

Parameters

none

Return value

none

Example

// clearing vectors
#include <iostream>
#include <vector>

int main ()
{
  std::vector<int> myvector;
  myvector.push_back (100);
  myvector.push_back (200);
  myvector.push_back (300);

  std::cout << "myvector contains:";
  for (unsigned i=0; i<myvector.size(); i++)
    std::cout << ' ' << myvector[i];
  std::cout << '\n';

  myvector.clear();
  myvector.push_back (1101);
  myvector.push_back (2202);

  std::cout << "myvector contains:";
  for (unsigned i=0; i<myvector.size(); i++)
    std::cout << ' ' << myvector[i];
  std::cout << '\n';

  return 0;
}

Edit & Run

Output:

myvector contains: 100 200 300
myvector contains: 1101 2202

Complexity

Linear in size (destructions).
This may be optimized to constant complexity for trivially-destructible types (such as scalar or PODs), where elements need not be destroyed.

复杂度和其大小线性相关（析构）

最优复杂度可能是常量时间复杂度，因为可能其中的元素不需要析构。

Iterator validity

All iterators, pointers and references related to this container are invalidated.

所有的迭代器，指针以及引用都将失效。

#include <iostream>
#include <vector>
using namespace std;
int main()
{
	vector<int> vi={10,20,30};
	cout<<"size="<<vi.size()<<endl;
	cout<<"capacity="<<vi.capacity()<<endl;
	int &ri=vi[0];
	auto it=vi.begin();
	vi.clear();
	cout<<"size="<<vi.size()<<endl;
	cout<<"capacity="<<vi.capacity()<<endl;
	cout<<"vi[1]="<<vi[1]<<endl;
	cout<<"ri="<<ri<<endl;
	cout<<"vi.begin()="<<*it<<endl;
	
}