std::front_inserter
Aus 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. |
definiert in Header <iterator>
|
||
template< class Container > std::front_insert_iterator<Container> front_inserter( Container& c); |
||
front_inserter
ist eine Komfortfunktion Vorlage, die eine std::front_insert_iterator für den Container c
mit dem Typ von der Art der Argumentation ableiten konstruiert .Original:
front_inserter
is a convenience function template that constructs a std::front_insert_iterator for the container c
with the type deduced from the type of the argument.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.
Inhaltsverzeichnis |
[Bearbeiten] Parameter
c | - | Container, der eine
push_front Vorgang unterstütztOriginal: container that supports a push_front operationThe text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. |
[Bearbeiten] Rückgabewert
Ein std::front_insert_iterator die zur Elemente am Anfang des Behälters
c
hinzugefügt werden könnenOriginal:
A std::front_insert_iterator which can be used to add elements to the beginning of the container
c
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.
[Bearbeiten] Mögliche Implementierung
template< class Container > std::front_insert_iterator<Container> front_inserter( Container& c) { return std::front_insert_iterator<Container>(c); } |
[Bearbeiten] Beispiel
#include <iostream> #include <deque> #include <algorithm> #include <iterator> int main() { std::deque<int> v{1,2,3,4,5,6,7,8,9,10}; std::fill_n(std::front_inserter(v), 3, -1); for(int n : v) std::cout << n << ' '; }
Output:
-1 -1 -1 1 2 3 4 5 6 7 8 9 10
[Bearbeiten] Siehe auch
Iterator Adapter für die Zuführung an der Vorderseite eines Behälters Original: iterator adaptor for insertion at the front of a container The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (Klassen-Template) | |
schafft eine std::back_insert_iterator des Typs aus dem Argument abgeleitet Original: creates a std::back_insert_iterator of type inferred from the argument The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (Funktions-Template) | |
schafft eine std::insert_iterator des Typs aus dem Argument abgeleitet Original: creates a std::insert_iterator of type inferred from the argument The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (Funktions-Template) |