<div class="t-tr-text">C + +: conceitos<div class="t-tr-dropdown"><div><div><div class="t-tr-dropdown-arrow-border"></div><div class="t-tr-dropdown-arrow"></div><div class="t-tr-dropdown-h">Original:</div><div class="t-tr-dropdown-orig">C++ concepts:</div><div class="t-tr-dropdown-notes">The text has been machine-translated via [http://translate.google.com Google Translate].<br/> You can help to correct and verify the translation. Click [http://en.cppreference.com/w/Cppreference:MachineTranslations here] for instructions.</div></div></div></div></div> Container
Da cppreference.com
 | This page has been machine-translated from the English version of the wiki using Google Translate. The translation may contain errors and awkward wording. Hover over text to see the original version. You can help to fix errors and improve the translation. For instructions click here. |
A
Container é um objeto usado para armazenar outros objetos e cuidar da gestão da memória usada pelos objetos que ele contém.Original:
A
Container is an object used to store other objects and taking care of the management of the memory used by the objects it contains.The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
You can help to correct and verify the translation. Click here for instructions.
Índice |
[editar]Requisitos
Ctipo ContainerOriginal:CContainer typeThe text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.Ttipo de elementoOriginal:TElement typeThe text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.a,bObjetos deCtipoOriginal:a,bObjects of typeCThe text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
[editar]Tipos
| name | type | notes |
|---|---|---|
value_type | T | Destructible |
reference | lvalue of T | |
const_reference | const lvalue of T | |
iterator | iterator pointing to T | ForwardIteratorconvertible to const_iterator |
const_iterator | const iterator pointing to T | ForwardIterator |
difference_type | signed integer | must be the same as iterator_traits::difference_type for iterator and const_iterator |
size_type | unsigned integer | large enough to represent all positive values of difference_type |
[editar]Métodos e operadores
| expression | return type | semantics | conditions | complexity | |
|---|---|---|---|---|---|
| C(); | C | Creates an empty container | Post: u.empty() == true | Constant | |
| C(a) | C | Create a copy of a | Pre: T must be CopyInsertablePost: a == X(a) | Linear | |
| a = b | C& | All elements of a are destroyed or move assigned to elements of b | Post: a == b | Linear | |
| (&a)->~C() | void | Destroy all elements and free all memory | Linear | ||
| a.begin() | (const_)iterator | Iterator to the first element | Constant | ||
| a.end() | (const_)iterator | Iterator to one passed the last element | Constant | ||
| a.cbegin()(desde C++11) | const_iterator | const_cast<const C&>(a).begin() | Constant | ||
| a.cend()(desde C++11) | const_iterator | const_cast<const C&>(a).end() | Constant | ||
| a == b | convertible to bool | Makes C EqualityComparable | Pre: T must be EqualityComparable | Linear | |
| a != b | convertible to bool | !(a==b) | Linear | ||
| a.swap(b) | void | exchanges the values of a and b | Constant[1][2] | ||
| swap(a,b) | void | a.swap(b) | Constant[1] | ||
| a.size() | size_type | distance(a.begin(),a.end()) | Constant[2] | ||
| a.max_size() | size_type | b.size() where b is the largest possible container | Constant[2] | ||
| a.empty() | convertible to bool | a.begin()== a.end() | Constant | ||
| notes | |||||
[editar]Dados corridas de contêineres
Implementações não são obrigados a fornecer qualquer garantia de reentrada para modificações seqüência - não é seguro para
push_back e ler begin simultaneamente. No entanto, é necessário evitar as corridas de dados, quando o conteúdo do objecto contido em diferentes elementos da mesma sequência são modificadas ao mesmo tempo (excepto para vector<bool>). Em outras palavras, para um vector<int> com tamanho superior a 1, e x[1] = 5*x.begin() = 10 não vai resultar em uma corrida de dados.Original:
Implementations are not required to provide any reentrancy guarantee for sequence modifications - it is not safe to
push_back and read begin concurrently. However, it is required to avoid data races when the contents of the contained object in different elements of the same sequence are modified concurrently (except for vector<bool>). In other words, for a vector<int> with size greater than 1, x[1] = 5 and *x.begin() = 10 will not result in a data race.The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
You can help to correct and verify the translation. Click here for instructions.
Estas funções também devem ser considerados
const: begin, end, rbegin, rend, front, back, data, find, lower_bound, upper_bound, equal_range, at, e, exceto em AssociativeContainer e UnorderedAssociativeContainer, operator[]. Chamar qualquer uma dessas funções simultaneamente não vai resultar em uma corrida de dados.Original:
These functions must also be considered
const: begin, end, rbegin, rend, front, back, data, find, lower_bound, upper_bound, equal_range, at, and, except in AssociativeContainer and UnorderedAssociativeContainer, operator[]. Calling any of these functions concurrently will not result in a data race.The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
You can help to correct and verify the translation. Click here for instructions.
[editar]Outros conceitos
- C
- T
