<div class="t-tr-text">Concepts C + +:<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
De cppreference.com
<metanoindex/>
Un SequenceContainer est un Container qui stocke les objets du même type dans un agencement linéaire .
Original:
A SequenceContainer is a Container that stores objects of the same type in a linear arrangement.
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
Exigences
Legend Original: Legend The text has been machine-translated via Google Translate. | |
X
|
Type de conteneur Original: Container type The text has been machine-translated via Google Translate. |
T
|
Type d'élément Original: Element type The text has been machine-translated via Google Translate. |
a, b
|
Objets de Original: Objects of type The text has been machine-translated via Google Translate. |
t
|
Objet de Original: Object of type The text has been machine-translated via Google Translate. |
n
|
Entier positif Original: Positive integer The text has been machine-translated via Google Translate. |
i, j
|
Original:
The text has been machine-translated via Google Translate. |
il
|
std::initializer_list<T> |
args
|
Pack paramètre Original: Parameter pack The text has been machine-translated via Google Translate. |
p, q
|
const_iterators dans Original: const_iterators in The text has been machine-translated via Google Translate. |
| 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 Original: std::deque, std::vector The text has been machine-translated via Google Translate. MoveAssignable
|
|
a.erase(p,q) |
iterator | Erases elements in [p,q) |
( std :: deque, std :: vector Original: std::deque, std::vector The text has been machine-translated via Google Translate. 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
|
Opérations optionnelles
SequenceContainers dans la bibliothèque standard
(depuis C++11) |
tableau statique contigu (classe générique) [edit] |
| tableau dynamique contigu (classe générique) [edit] | |
| file d'attente à deux bouts (classe générique) [edit] | |
(depuis C++11) |
liste simplement chaînée (classe générique) [edit] |
| liste doublement chaînée (classe générique) [edit] | |
Compromis / notes d'utilisation
| std::array | Accès rapide mais nombre fixe d'éléments Original: Fast access but fixed number of elements The text has been machine-translated via Google Translate. |
| std::vector | Accès rapide mais surtout inefficace insertions / suppressions Original: Fast access but mostly inefficient insertions/deletions The text has been machine-translated via Google Translate. |
| std::list std::forward_list |
Insertion efficace / délétion dans le milieu de la séquence Original: Efficient insertion/deletion in the middle of the sequence The text has been machine-translated via Google Translate. |
| std::deque | Insertion efficace / suppression, au début et à la fin de la séquence Original: Efficient insertion/deletion at the beginning and at the end of the sequence The text has been machine-translated via Google Translate. |