std::move_backward
Aus cppreference.com
< cpp | algorithm
Version vom 22. Oktober 2012, 15:48 Uhr von TranslationBot (Diskussion | Beiträge)
| Defined in header <algorithm>
|
||
| template< class BidirIt1, class BidirIt2 > BidirIt2 move_backward( BidirIt1 first, BidirIt1 last, BidirIt2 d_last ); |
||
Verschiebt die Elemente aus dem Bereich
[first, last), in einen anderen Bereich Abschluss an d_last. Die Elemente werden in umgekehrter Reihenfolge (das letzte Element zuerst bewegt) bewegt, aber ihre relative Anordnung beibehalten wird . Original:
Moves the elements from the range
[first, last), to another range ending at d_last. The elements are moved in reverse order (the last element is moved first), but their relative order is preserved. 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 |
Parameter
| first, last | - | der Bereich der Elemente zu bewegen
Original: the range of the elements to move The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. |
| d_last | - | Ende des Zielbereichs. Wenn d_last in [first, last) ist, muss NJ std :: move </ span> statt std::move_backward verwendet werden . Original: end of the destination range. If d_last is within [first, last), NJ std :: move </ span> must be used instead of std::move_backward. </div>The text has been machine-translated via Google Translate. </div></div></div></div>
You can help to correct and verify the translation. Click here for instructions. |
| Type requirements | ||
-BidirIt1, BidirIt2 must meet the requirements of BidirectionalIterator.
| ||
Rückgabewert
Iterator im Zielbereich, zog deutete auf das letzte Element .
Original:
Iterator in the destination range, pointing at the last element moved.
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.
Komplexität
Genau
last - first bewegen Aufgaben .Original:
Exactly
last - first move assignments.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.
Mögliche Implementierung
template< class BidirIt1, class BidirIt2 > BidirIt2 move_backward(BidirIt1 first, BidirIt1 last, BidirIt2 d_last) { while (first != last) { *(--d_last) = std::move(*(--last)); } return d_last; } |
Beispiel
| This section is incomplete Reason: no example |
