Erases all elements from the container vector

Author: mathsyouth

README.md

@@ -430,6 +430,7 @@ for (vector<int>::iterator p=a.begin(); p!=a.end(); ++p)
 vector<int> b(a.begin(), a.end());  // b is copy of a
 vector<T> c(n, x);        // c[0]..c[n-1] init to x
 T d[10]; vector<T> e(d, d+10);      // e is initialized from d
+a.clear();              // Erases all elements from the container. Leaves the capacity() of the vector unchanged.
 ```
 
 ## `deque` (Array stack queue)

cheatsheet-as-sourcefile.cpp

@@ -402,6 +402,7 @@ for (vector<int>::iterator p=a.begin(); p!=a.end(); ++p)
 vector<int> b(a.begin(), a.end());  // b is copy of a
 vector<T> c(n, x);        // c[0]..c[n-1] init to x
 T d[10]; vector<T> e(d, d+10);      // e is initialized from d
+a.clear();              // Erases all elements from the container. Leaves the capacity() of the vector unchanged.
 
 // ## `deque` (Array stack queue)