Espacios de nombres
Variantes
Acciones

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

De 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 + + conceptos
Básica
Original:
Basic
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
Biblioteca-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.
Elementos contenedores
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
Números aleatorios
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.
Concurrencia
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)
Otros
Original:
Other
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
 
Un RandomAccessIterator es un BidirectionalIterator que se puede mover para apuntar a cualquier elemento de constante de tiempo .
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 puntero estándar es un ejemplo de un tipo que satisface este concepto .
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.

[editar] Requisitos

Además de los requisitos anteriores, para un tipo It ser un RandomAccessIterator, instancias a, b, i, y r de It debe:
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 puede ser positivo o 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.
  • Complejidad constante (es decir, la expresión equivalente no se puede utilizar como aplicación)
    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)
  • si a < b entonces !(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.
  • si a < b y luego b < c 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
    (exactamente una de las expresiones es verdadera)
    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)

[editar] Notas del cuadro

  • It es el tipo de aplicación de este concepto
    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 es la 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 es la 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 es la 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 son objetos de 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 es un valor de It& tipo
    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 es un número entero de 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.
Las reglas anteriores implican que RandomAccessIterator también implementa 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 es un BidirectionalIterator que además cumple con los requisitos 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.
Obtenido de «http://es.cppreference.com/mwiki/index.php?title=cpp/concept/RandomAccessIterator&oldid=21185»