<div class="t-tr-text">C + +: concetti<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> SequenceContainer
|
|
Questa pagina è stata tradotta in modo automatico dalla versione in ineglese della wiki usando Google Translate.
La traduzione potrebbe contenere errori e termini strani. Muovi il puntatore sopra al testo per vedere la versione originale. Puoi aiutarci a correggere gli gli errori. Per ulteriori istruzioni clicca qui. |
<metanoindex/>
SequenceContainer è un Container che memorizza oggetti dello stesso tipo in una disposizione lineare.SequenceContainer is a Container that stores objects of the same type in a linear arrangement.You can help to correct and verify the translation. Click here for instructions.
Requisiti
Original: Legend The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. | |
X
|
Tipo di contenitore
Original: Container type The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. |
T
|
Tipo di elemento
Original: Element type The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. |
a, b
|
Gli oggetti di tipo
XOriginal: Objects of type XThe text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. |
t
|
Oggetto di
T tipo Original: Object of type T The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. |
n
|
Numero intero positivo
Original: Positive integer The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. |
i, j
|
InputIterators che denotano un intervallo validoOriginal: InputIterators denoting a valid rangeThe text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. |
il
|
std::initializer_list<T> |
args
|
Parametro confezione
Original: Parameter pack The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. |
p, q
|
const_iterators in
a Original: const_iterators in a The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. |
| expression | return type | effects | precondition | postcondition |
|---|---|---|---|---|
X(n,t) |
Constructs a SequenceContainer containing n copies of t |
T CopyInsertable |
std::distance(begin(),end()) == n
| |
X(i,j) |
Constructs a SequenceContainer equivalent to the range [i,j)
|
|
std::distance(begin(),end()) == std::distance(i,j)
| |
X(il) |
X(il.begin(),il.end) |
|||
a = il |
X& |
Assigns the range represented by il into a
|
T CopyInsertable and CopyAssignable
|
Existing elements of a are destroyed or assigned to
|
a.emplace(p,args) |
iterator | Insert an object constructed with std::forward<Args>(args) before p
|
|
|
a.emplace(p,t) |
iterator | Inserts a copy of t before i
|
|
|
a.insert(p,n,t) |
iterator | Inserts n copies of t before i
|
T CopyInsertable and CopyAssignable
|
|
a.insert(p,i,j) |
iterator | Inserts copies of elements in [i, j) before p
|
|
Each iterator in [i,j) is dereferenced once
|
a.insert(p, il) |
iterator | a.insert(p,il.begin(),il.end()) |
||
a.erase(q) |
iterator | Erases the element pointed to by q | (std :: deque, std :: vector) T MoveAssignable
|
|
a.erase(p,q) |
iterator | Erases elements in [p,q) |
(std :: deque, std :: vector) T MoveAssignable |
|
a.clear() |
void | Destroys all elements in a |
| |
a.assign(i,j) |
void | Replaces elements in a with a copy of [i, j)
|
|
Each iterator in [i,j) is dereferenced once
|
a.assign(il) |
void | a.assign(il.begin(),il.end()) |
||
a.assign(n,t) |
void | Replaces elements in a with n copies of t
|
T CopyInsertable and CopyAssignable
|
Operazioni opzionali
| This section is incomplete |
SequenceContainers della libreria standard
(dal C++11) |
statico array contiguo Original: static contiguous array The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (classe template) |
dinamica array contiguo Original: dynamic contiguous array The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (classe template) | |
doppio attacco coda Original: double-ended queue The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (classe template) | |
(dal C++11) |
singolarmente-linked list Original: singly-linked list The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (classe template) |
doppiamente lista concatenata Original: doubly-linked list The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (classe template) | |
Trade-off / note di utilizzo
| std::array | Accesso veloce ma il numero fisso di elementi
Original: Fast access but fixed number of elements The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. |
| std::vector | Accesso veloce ma soprattutto inefficiente inserzioni / delezioni
Original: Fast access but mostly inefficient insertions/deletions The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. |
| std::list std::forward_list |
Inserimento efficiente / delezione nel mezzo della sequenza
Original: Efficient insertion/deletion in the middle of the sequence The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. |
| std::deque | Inserimento efficiente / delezione all'inizio e alla fine della sequenza
Original: Efficient insertion/deletion at the beginning and at the end of the sequence The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. |