<div class="t-tr-text">C + +: concetti<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> RandomAccessIterator

Da cppreference.com.

Questa pagina è stata tradotta in modo automatico dalla versione in ineglese della wiki usando Google Translate.

La traduzione potrebbe contenere errori e termini strani. Muovi il puntatore sopra al testo per vedere la versione originale. Puoi aiutarci a correggere gli gli errori. Per ulteriori istruzioni clicca qui.

Click here for the English version of this page

Un RandomAccessIterator è un BidirectionalIterator che può essere spostato per puntare a qualsiasi elemento in tempo costante.

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.

Un puntatore standard è un esempio di un tipo che soddisfa questo concetto.

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.

Requisiti

BidirectionalIterator

Oltre al requisito di cui sopra, per un tipo It essere un RandomAccessIterator, istanze a, b, i e r di It deve:

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` può essere sia positivo che negativo 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. Complessità costante (cioè, l'espressione equivalente non può essere utilizzato come implementazione) 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)` se poi `a < b` `!(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. se `a < b` e `b < c` poi `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` o `b < a` o `a == b` (esattamente una delle espressioni è vera) 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)`

Tabella Note

It è il tipo di implementazione di questo concetto
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 è il std::iterator_traits<It>::value_type tipo
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 è il std::iterator_traits<It>::reference tipo
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 here for instructions.
difference è il std::iterator_traits<It>::difference_type tipo
Original:
difference is the type std::iterator_traits<It>::difference_type
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
i, a, b sono oggetti di tipo It o const It
Original:
i, a, b are objects of type It or const It
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
r è un valore di tipo It&
Original:
r is a value of type It&
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
n è un numero intero di difference tipo
Original:
n is an integer of type difference
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

Le norme di cui sopra implicano che RandomAccessIterator implementa anche LessThanComparable.

Original:

The above rules imply that RandomAccessIterator also implements LessThanComparable.

The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

Un mutable RandomAccessiterator è un BidirectionalIterator che soddisfa inoltre i requisiti OutputIterator.

Original:

A mutable RandomAccessiterator is a BidirectionalIterator that additionally satisfies the OutputIterator requirements.

The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.