Namensräume
Varianten
Aktionen

C + + Konzepte: RandomAccessIterator

Aus cppreference.com
< cpp‎ | concept

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++
 
C + + Konzepte
Basic
Original:
Basic
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
Library-Wide
Original:
Library-Wide
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
Container
Original:
Container
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
Container-Elemente
Original:
Container Elements
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
Iterator
Original:
Iterator
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
ForwardIterator
BidirectionalIterator
RandomAccessIterator
Zufallszahlen
Original:
Random Numbers
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
Concurrency
Original:
Concurrency
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
BasicLockable(C++11)
Lockable(C++11)
TimedLockable(C++11)
Mutex(C++11)
TimedMutex(C++11)
Andere
Original:
Other
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
 
A RandomAccessIterator ist ein BidirectionalIterator, die verschoben, um jedes Element in konstanter Zeit zeigen können .
Original:
A RandomAccessIterator is a BidirectionalIterator that can be moved to point to any element in constant time.
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
Ein Standard-Zeiger ist ein Beispiel eines Typs, die dieses Konzept erfüllt .
Original:
A standard pointer is an example of a type that satisfies this concept.
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

[Bearbeiten] Anforderungen

Zusätzlich zu der Anforderung für einen Typ It ein RandomAccessIterator sein, Instanzen a, b muss i und r von It:
Original:
In addition to the above requirement, for a type It to be an RandomAccessIterator, instances a, b, i, and r of It must:
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
Expression Return Equivalent expression Notes
r += n It& if(n>=0)

   while(n--) ++r;
else
   while(n++) --r;
return r;

  • n kann sowohl positiv oder negativ sein
    Original:
    n can be both positive or negative
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.
  • Constant Komplexität (dh, der entsprechende Ausdruck kann nicht als Umsetzung verwendet werden)
    Original:
    Constant complexity (that is, the equivalent expression cannot be used as implementation)
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.
i + n It It temp = i;

return temp += n;

n + i It i + n
r -= n It& return r += -n;
i - n It It temp = i;

return temp -= n;

n - i It i - n
b - a difference n returns n such that a+n==b
i[n] convertible to reference *(i + n)
a < b contextually convertible to bool b - a > 0 Strict total ordering relation:
  • !(a < a)
  • wenn a < b dann !(b < a)
    Original:
    if a < b then !(b < a)
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.
  • wenn a < b und b < c dann a < c
    Original:
    if a < b and b < c then a < c
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.
  • a < b oder b < a oder a == b
    (genau einer der Ausdrücke wahr ist)
    Original:
    a < b or b < a or a == b
    (exactly one of the expressions is true)
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.
a > b contextually convertible to bool b < a Total ordering relation opposite to a < b
a >= b contextually convertible to bool !(a < b)
a <= b contextually convertible to bool !(a > b)

[Bearbeiten] Anmerkungen zur Tabelle

  • It ist die Art der Umsetzung dieses Konzepts
    Original:
    It is the type implementing this concept
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.
  • T ist die Art std::iterator_traits<It>::value_type
    Original:
    T is the type std::iterator_traits<It>::value_type
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.
  • reference ist die Art std::iterator_traits<It>::reference
    Original:
    reference is the type std::iterator_traits<It>::reference
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click