Espacios de nombres
Variantes
    Acciones

      Conceptos C++: RandomAccessIterator

      De cppreference.com
      < cpp‎ | concept

      Esta página se ha traducido por ordenador/computador/computadora de la versión en inglés de la Wiki usando Google Translate.

      La traducción puede contener errores y palabras aparatosas/incorrectas. Planea sobre el texto para ver la versión original. Puedes ayudar a corregir los errores y mejorar la traducción. Para instrucciones haz clic aquí.

       
      C++
      Apoyo de compiladores
      Implementaciones independientes y albergadas
      Lenguaje
      Biblioteca estándar
      Encabezados de la biblioteca estándar
      Requisitos denominados
      Macros de prueba de característica (C++20)
      Biblioteca de apoyo del lenguaje
      Biblioteca de conceptos(C++20)
      Biblioteca de diagnósticos
      Biblioteca de gestión de memoria
      Biblioteca de metaprogramación(C++11)
      Biblioteca de servicios generales
      Biblioteca de contenedores
      Biblioteca de iteradores
      Biblioteca de rangos(C++20)
      Biblioteca de algoritmos
      Biblioteca de cadenas
      Biblioteca de procesamiento de texto
      Biblioteca numérica
      Biblioteca de fecha y hora
      Biblioteca de entrada/salida
      Biblioteca del sistema de archivos(C++17)
      Biblioteca de apoyo de concurrencia(C++11)
      Biblioteca de apoyo de ejecución(C++26)
      Especificaciones técnicas
      Índice de símbolos
      Bibliotecas externas
       
      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.
      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.
      (C++11)
      (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.
      ExpressionReturnEquivalent expressionNotes
      r += nIt&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 + nItIt temp = i;

      return temp += n;

      n + iIti + n
      r -= nIt&return r +=-n;
      i - nItIt temp = i;

      return temp -= n;

      n - iIti - n
      b - adifferencenreturns n such that a+n==b
      i[n]convertible to reference*(i + n)
      a < bcontextually convertible to boolb - a >0Strict 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 < ca < 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 > bcontextually convertible to boolb < aTotal ordering relation opposite to a < b
      a >= bcontextually convertible to bool!(a < b)
      a <= bcontextually 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 «https://es.cppreference.com/mwiki/index.php?title=cpp/concept/RandomAccessIterator&oldid=21185»
      close