⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 rgb_persist.h

📁 Dieharder是一个是一个测试一序列伪随机数的随机性能的测试套件
💻 H
字号:
/* * diehard_rgb_persist test header. *//* * function prototype */typedef struct {  uint nbits;  uint and_mask;  uint cumulative_mask;} Rgb_Persist;void rgb_persist(Test **test, Rgb_Persist *persist);static Dtest rgb_persist_dtest = {  "RGB Bit Persistence Test",  "\n\#========================================================================\n\#                   RGB Bit Persistence Test\n\# This test generates 256 sequential samples of an random unsigned\n\# integer from the given rng.  Successive integers are logically\n\# processed to extract a mask with 1's whereever bits do not\n\# change.  Since bits will NOT change when filling e.g. unsigned\n\# ints with 16 bit ints, this mask logically &'d with the maximum\n\# random number returned by the rng.  All the remaining 1's in the\n\# resulting mask are therefore significant -- they represent bits\n\# that never change over the length of the test.  These bits are\n\# very likely the reason that certain rng's fail the monobit\n\# test -- extra persistent e.g. 1's or 0's inevitably bias the\n\# total bitcount.  In many cases the particular bits repeated\n\# appear to depend on the seed.  If the -i flag is given, the\n\# entire test is repeated with the rng reseeded to generate a mask\n\# and the extracted mask cumulated to show all the possible bit\n\# positions that might be repeated for different seeds.\n\",  1,  256,  1};uint *rgb_persist_rand_uint;

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -