593f022515
This class provides a reasonably-secure random number generator that does not need seeding. That is quite unlike qrand(), which requires a seed and is low-quality (definitely not secure). This class is also like std::random_device, but better. It provides an operator() like std::random_device, but unlike that, it also provides a way to fill a buffer with random data, not just one 32-bit quantity. It's also stateless. Finally, it also implements std::seed_seq-like generate(). It obeys the standard requirement of the range (32-bit) but not that of the algorithm (if you wanted that, you'd use std::seed_seq itself). Instead, generate() fills with pure random data. Change-Id: Icd0e0d4b27cb4e5eb892fffd14b4e3ba9ea04da8 Reviewed-by: Lars Knoll <lars.knoll@qt.io>
15 lines
215 B
Prolog
15 lines
215 B
Prolog
TEMPLATE=subdirs
|
|
SUBDIRS=\
|
|
qflags \
|
|
q_func_info \
|
|
qgetputenv \
|
|
qglobal \
|
|
qnumeric \
|
|
qfloat16 \
|
|
qrand \
|
|
qrandomgenerator \
|
|
qlogging \
|
|
qtendian \
|
|
qglobalstatic \
|
|
qhooks
|