Namensräume
Varianten
Aktionen

cpp/algorithm/move backward: Unterschied zwischen den Versionen

Aus cppreference.com
< cpp‎ | algorithm
K (1 Version: Translate from the English version)
K (Fix previous edit)
 
(4 dazwischenliegende Versionen von 3 Benutzern werden nicht angezeigt)
Zeile 1: Zeile 1:
 +
 
{{cpp/title|move_backward}}
 
{{cpp/title|move_backward}}
 
{{cpp/algorithm/navbar}}
 
{{cpp/algorithm/navbar}}
−
{{ddcl list begin}}
+
{{begin}}
−
{{ddcl list header | algorithm}}
+
{{header | algorithm}}
−
{{ddcl list item |
+
{{|
 
template< class BidirIt1, class BidirIt2 >
 
template< class BidirIt1, class BidirIt2 >
 
BidirIt2 move_backward( BidirIt1 first, BidirIt1 last, BidirIt2 d_last );
 
BidirIt2 move_backward( BidirIt1 first, BidirIt1 last, BidirIt2 d_last );
 
}}
 
}}
−
{{ddcl list end}}
+
{{end}}
  
 
{{tr|Verschiebt die Elemente aus dem Bereich {{tt|[first, last)}}, in einen anderen Bereich Abschluss an {{tt|d_last}}. Die Elemente werden in umgekehrter Reihenfolge (das letzte Element zuerst bewegt) bewegt, aber ihre relative Anordnung beibehalten wird . |Moves the elements from the range {{tt|[first, last)}}, to another range ending at {{tt|d_last}}. The elements are moved in reverse order (the last element is moved first), but their relative order is preserved. }}
 
{{tr|Verschiebt die Elemente aus dem Bereich {{tt|[first, last)}}, in einen anderen Bereich Abschluss an {{tt|d_last}}. Die Elemente werden in umgekehrter Reihenfolge (das letzte Element zuerst bewegt) bewegt, aber ihre relative Anordnung beibehalten wird . |Moves the elements from the range {{tt|[first, last)}}, to another range ending at {{tt|d_last}}. The elements are moved in reverse order (the last element is moved first), but their relative order is preserved. }}
  
 
===Parameter===
 
===Parameter===
−
{{param list begin}}
+
{{begin}}
−
{{param list item | first, last |{{tr| der Bereich der Elemente zu bewegen| the range of the elements to move}}}}
+
{{| first, last |{{tr| der Bereich der Elemente zu bewegen| the range of the elements to move}}}}
−
{{param list item | d_last |{{tr| Ende des Zielbereichs. Wenn {{tt|d_last}} in {{tt|[first, last)}} ist, muss [[cpp/algorithm/move |NJ <span class="mw-geshi cpp source-cpp"> std :: move </ span>]] statt {{c|std::move_backward}} verwendet werden . | end of the destination range. If {{tt|d_last}} is within {{tt|[first, last)}}, [[cpp/algorithm/move |NJ <span class="mw-geshi cpp source-cpp"> std :: move </ span>]] must be used instead of {{c|std::move_backward}}. }}}}
+
{{| d_last |{{tr| Ende des Zielbereichs. Wenn {{tt|d_last}} in {{tt|[first, last)}} ist, muss [[cpp/algorithm/move |NJ <span class="mw-geshi cpp source-cpp"> std :: move </ span>]] statt {{|std::move_backward}} verwendet werden . | end of the destination range. If {{tt|d_last}} is within {{tt|[first, last)}}, [[cpp/algorithm/move |NJ <span class="mw-geshi cpp source-cpp"> std :: move </ span>]] must be used instead of {{|std::move_backward}}. }}}}
−
{{param list hreq}}
+
{{hreq}}
−
{{param list req concept | BidirIt1, BidirIt2 | BidirectionalIterator}}
+
{{req concept | BidirIt1, BidirIt2 | BidirectionalIterator}}
−
{{param list end}}
+
{{end}}
  
 
===Rückgabewert===
 
===Rückgabewert===
Zeile 46: Zeile 47:
  
 
===Siehe auch===
 
===Siehe auch===
−
{{dcl list begin}}
+
{{begin}}
−
{{dcl list template | cpp/algorithm/dcl list move}}
+
{{| cpp/algorithm/move}}
−
{{dcl list end}}
+
{{end}}
 +
 
 +
 +
 +
 +
 +
 +
 +
 +

Aktuelle Version vom 1. Juli 2013, 19:01 Uhr

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.

Click here for the English version of this page

 
C++
 
Algorithm Bibliothek
Funktionen
Original:
Functions
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
Nicht-modifizierende Sequenz Operationen
Original:
Non-modifying sequence operations
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
Modifizierende Sequenz Operationen
Original:
Modifying sequence operations
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
Partitionierungsoperationen
Original:
Partitioning operations
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
Sortierung Operationen (auf sortierten Bereiche)
Original:
Sorting operations (on sorted ranges)
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
Binary Suchaktionen (auf sortierten Bereiche)
Original:
Binary search operations (on sorted ranges)
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
Set-Operationen (auf sortierten Bereiche)
Original:
Set operations (on sorted ranges)
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
Heap-Operationen
Original:
Heap operations
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
Minimum / Maximum Operationen
Original:
Minimum/maximum operations
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
Numerische Operationen
Original:
Numeric operations
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
C-Bibliothek
Original:
C library
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
 
definiert 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.

Inhaltsverzeichnis

[Bearbeiten] 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.
You can help to correct and verify the translation. Click here for instructions.
</div></div></div></div>
Type requirements
-
BidirIt1, BidirIt2 must meet the requirements of BidirectionalIterator.

[Bearbeiten] 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.

[Bearbeiten] 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.

[Bearbeiten] 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;
}

[Bearbeiten] Beispiel

This section is incomplete
Reason: no example

[Bearbeiten] Siehe auch

(C++11)
bewegt sich eine Reihe von Elementen, um eine neue Position
Original:
moves a range of elements to a new location
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

(Funktions-Template) [edit]

Von „https://de.cppreference.com/mwiki/index.php?title=cpp/algorithm/move_backward&oldid=25937“