(C++17) | ||||
| Sequence | ||||
(C++11) | ||||
(C++26) | ||||
(C++26) | ||||
(C++11) | ||||
| Associative | ||||
| Unordered associative | ||||
(C++11) | ||||
(C++11) | ||||
(C++11) | ||||
(C++11) | ||||
| Adaptors | ||||
(C++23) | ||||
(C++23) | ||||
(C++23) | ||||
(C++23) | ||||
| Views | ||||
(C++20) | ||||
(C++23) | ||||
| Tables | ||||
| Iterator invalidation | ||||
| Member function table | ||||
| Non-member function table |
constexprvoid clear()noexcept; | (since C++26) | |
Erases all elements from the container. After this call,size() returns zero.
Invalidates any references, pointers, and iterators referring to contained elements.Any past-the-end iterators are also invalidated.
Linear in the size of the container, i.e., the number of elements.
#include <iostream>#include <string_view>#include <inplace_vector> void print_info(std::string_view rem,conststd::inplace_vector<int,3>& v){std::cout<< rem<<"{ ";for(constauto& value: v)std::cout<< value<<' ';std::cout<<"}\n";std::cout<<"Size="<< v.size()<<'\n';} int main(){std::inplace_vector<int,3> container{1,2,3}; print_info("Before clear: ", container); container.clear(); print_info("After clear: ", container);}
Output:
Before clear: { 1 2 3 }Size=3After clear: { }Size=0| erases elements (public member function)[edit] |
