Espacios de nombres
Variantes
Acciones

Conceptos C++: SeedSequence

De cppreference.com
< cpp‎ | concept
 
 
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.
SeedSequence
(C++11)
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)
(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.
 
seed sequence A es un objeto que produce valores enteros sin signo en el rango de i 0 ≤ i < 232
basado en un rango consumida de datos enteros .
Original:
A seed sequence is an object that produces unsigned integer values i in the range 0 ≤ i < 232
based on a consumed range of integer data.
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

[editar] Requisitos

  • S es un SeedSequence .
    Original:
    S is a SeedSequence.
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.
  • q es un objeto de S y r es un objeto potencialmente constante de S .
    Original:
    q is an object of S and r is a potentially constant object of S.
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.
  • T is the result_type.
  • ib, ie son InputIterators con un value_type de valores enteros sin signo de al menos 32 bits .
    Original:
    ib,ie are InputIterators with a value_type of unsigned integer values of at least 32 bits.
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.
  • il is an std::initializer_list<T>.
  • rb, re son modificables RandomAccessIterators con value_type de valores enteros sin signo de por lo menos 32 bits .
    Original:
    rb,re are modifiable RandomAccessIterators with a value_type of unsigned integer values of at least 32 bits.
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.
  • ob is an OutputIterator.
Expression Type Notes Complexity
S::result_type T Unsigned integer of at least 32 bits compile-time
S() Creates a seed sequence with the same default values as other objects of type S constant
S(ib,ie) Creates a seed sequence based on the supplied input bits by [ib,ie) O(ie-ib)
S(il) The same as S(il.begin(), il.end())
q.generate(rb,re) void Fills [rb,re) with 32-bit quantities depending on the initial supplied values and potential previous calls to generate. If it does nothing. O(re-rb)
r.size() size_t The amount of 32-bit integers copied by param. constant
r.param(ob) void Copies 32-bit values to ob that would reproduce the current state of the object if passed to a constructor of S. O(r.size())

[editar] Ver también