python随机种子数_Python获得随机颜色，给定种子数的速度尽可能快

你没有提到number的范围。它必须是非负整数，否则bytes(number)将失败。(顺便说一句，该函数返回一个由number个零字节组成的bytes字符串，如果number很大，它将占用大量的RAM)。我假设number至少是24位来覆盖24位RGB颜色空间。在

为此目的使用加密哈希函数是过分的。因此，hashlib函数非常快，因为它们是用C语言编写的。我们可以使用内置的函数，但是对于机器大小的整数，hash(n)只返回{}，所以我们需要做类似hash((n, n))的操作来获得随机输出。然而，做这种事情的结果并不是特别随机的：hash是为哈希表工作而设计的，而不是我们这里想要的那种置乱。在

为了生成随机的RGB值，我采用了Yann Collet的xxHash的混合算法。您可以在xxhash.c source code中查看该算法的C源代码。该算法速度相当快，具有良好的avalanching。Bret Mulvey写了一篇很好的关于hash mixing functions and the avalanche effect的介绍性文章。在def id_to_random_color(n):

n = ((n ^ n >> 15) * 2246822519) & 0xffffffff

n = ((n ^ n >> 13) * 3266489917) & 0xffffffff

n = (n ^ n >> 16) >> 8

return [u / 255. for u in n.to_bytes(3, 'big')] + [1.0]

此函数适用于range(2**24)中的n，事实上，它的结果在整个range(2**32)中是相当好的；它仍将在该范围之外给出有用的结果。为了在这里测试它，我将使用一个简化的版本，它将RGB值作为整数返回。第一个测试只显示n中n的RGB值。第二个测试生成25600个随机数并找到相应的RGB值。每个R、G和B值应该可以得到大约100次点击。在

^{pr2}$

输出0: 00 00 00

1: 60 6d 18

2: 4e f2 bf

3: 75 4f 48

4: 60 98 f1

5: 17 1d 98

6: 3b 69 13

7: aa 10 98

8: c1 31 e3

9: 1e fa 4a

10: 7f 05 b2

11: 86 0e b3

12: 39 84 c6

13: c1 75 4f

14: e2 38 87

15: db 54 79

16: 45 14 b6

17: cb 56 68

18: 8e bf d8

19: cd 50 3f

计数器输出r [74, 75, 75, 77, 78, 80, 80, 80, 80, 81, 82, 83, 84, 85, 85, 85, 86, 86, 86, 88, 88, 88, 88, 89, 89, 89, 89, 89, 89, 89, 89, 90, 90, 90, 90, 90, 90, 90, 91, 91, 91, 91, 91, 91, 91, 91, 91, 92, 92, 92, 92, 92, 92, 92, 92, 93, 93, 93, 93, 93, 93, 93, 93, 93, 94, 94, 94, 94, 94, 94, 94, 94, 94, 95, 95, 95, 95, 95, 95, 95, 96, 96, 96, 96, 96, 96, 96, 96, 96, 96, 96, 96, 96, 96, 96, 96, 97, 97, 97, 97, 97, 97, 97, 97, 98, 98, 98, 98, 98, 98, 98, 98, 98, 99, 99, 99, 99, 99, 99, 99, 100, 100, 100, 100, 100, 100, 100, 100, 100, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 104, 104, 104, 104, 104, 104, 104, 105, 105, 105, 105, 105, 105, 105, 105, 105, 105, 106, 106, 106, 106, 106, 106, 106, 106, 106, 107, 107, 107, 107, 107, 107, 107, 107, 107, 107, 107, 108, 108, 108, 108, 108, 108, 108, 108, 109, 109, 109, 109, 109, 109, 109, 109, 109, 109, 110, 110, 110, 110, 110, 110, 110, 110, 111, 112, 112, 112, 112, 112, 113, 113, 113, 114, 114, 115, 115, 115, 115, 116, 116, 116, 116, 118, 119, 120, 123, 124, 126, 128, 138]

g [73, 74, 74, 77, 78, 79, 79, 81, 81, 82, 82, 83, 83, 83, 84, 84, 84, 84, 85, 85, 85, 86, 87, 87, 87, 87, 87, 87, 87, 88, 88, 88, 88, 88, 89, 89, 89, 89, 89, 89, 90, 90, 90, 90, 90, 90, 90, 90, 90, 91, 91, 91, 91, 92, 92, 92, 92, 92, 92, 92, 92, 92, 93, 93, 93, 93, 93, 93, 93, 93, 94, 94, 94, 94, 94, 94, 95, 95, 95, 95, 95, 95, 95, 95, 95, 95, 95, 96, 96, 96, 96, 96, 96, 96, 96, 96, 96, 96, 96, 96, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 98, 98, 98, 98, 98, 98, 98, 98, 99, 99, 99, 99, 99, 99, 99, 99, 99, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 101, 101, 101, 101, 101, 101, 102, 102, 102, 102, 102, 102, 102, 102, 102, 103, 103, 103, 103, 103, 103, 104, 104, 104, 104, 104, 104, 104, 104, 104, 104, 105, 105, 105, 105, 105, 105, 105, 105, 105, 105, 105, 105, 105, 105, 106, 106, 106, 106, 106, 106, 106, 107, 107, 107, 107, 107, 107, 107, 107, 107, 108, 108, 108, 109, 109, 109, 110, 110, 110, 110, 110, 111, 111, 111, 111, 111, 111, 112, 112, 112, 112, 112, 112, 113, 113, 113, 113, 113, 113, 113, 113, 114, 114, 114, 114, 115, 115, 116, 117, 117, 117, 117, 118, 118, 118, 119, 119, 119, 120, 120, 121, 121, 121, 123, 125, 126, 128]

b [73, 74, 77, 78, 78, 79, 80, 80, 80, 81, 82, 84, 84, 84, 84, 84, 84, 84, 84, 85, 85, 85, 85, 85, 86, 86, 86, 86, 86, 87, 87, 87, 87, 88, 88, 89, 89, 89, 89, 89, 89, 89, 89, 90, 90, 90, 90, 90, 90, 91, 91, 91, 91, 91, 91, 92, 93, 93, 93, 93, 93, 93, 93, 94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 95, 95, 95, 95, 95, 95, 96, 96, 96, 96, 96, 96, 96, 96, 96, 96, 96, 96, 96, 96, 96, 97, 97, 97, 97, 97, 97, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 101, 101, 101, 101, 101, 101, 101, 101, 101, 102, 102, 102, 102, 102, 102, 102, 103, 103, 103, 103, 103, 103, 103, 103, 104, 104, 104, 104, 104, 104, 104, 104, 104, 104, 104, 104, 104, 105, 105, 105, 105, 105, 105, 105, 106, 106, 106, 106, 106, 106, 106, 107, 107, 107, 107, 107, 107, 107, 107, 107, 108, 108, 108, 108, 108, 108, 108, 108, 108, 108, 108, 108, 109, 109, 109, 109, 109, 109, 109, 110, 110, 110, 111, 111, 111, 111, 112, 112, 112, 113, 113, 113, 114, 114, 114, 114, 114, 115, 115, 115, 115, 115, 115, 115, 115, 115, 116, 116, 116, 117, 118, 119, 120, 120, 122, 124, 126, 127, 128, 131]

您可能会注意到，id_to_RGB对于一个零输入返回所有的零。如果这是不需要的，您可以在开始处添加一个额外的混合步骤(也借用了xxHash)。在def id_to_RGB(n):

n = (374761397 + n * 3266489917) & 0xffffffff

n = ((n ^ n >> 15) * 2246822519) & 0xffffffff

n = ((n ^ n >> 13) * 3266489917) & 0xffffffff

n = (n ^ n >> 16) >> 8

return tuple(n.to_bytes(3, 'big'))