en:pfw:random_generators_xorshift
Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
| en:pfw:random_generators_xorshift [2023-09-04 18:18] – ↷ Links angepasst, weil Seiten im Wiki verschoben wurden uho | en:pfw:random_generators_xorshift [2024-10-09 15:47] (current) – [Generic Forth version] willem | ||
|---|---|---|---|
| Line 136: | Line 136: | ||
| === Implementations: | === Implementations: | ||
| - | < | + | |
| - | < | + | |
| - | [[en: | + | * [[en: |
| - | < | + | |
| - | < | + | * [[https:// |
| - | < | + | * [[en: |
| - | < | + | |
| - | < | + | |
| - | < | + | |
| === A few points to note: === | === A few points to note: === | ||
| - | < | ||
| There is no limit to the number of seeds. If you want to use a thousand seeds, you can. The method functions fine with that. In that case it would be more efficient to put the seeds in a table and read and write to the table with two pointers. But it is hard to imagine a use-case where there is a need for more than 256 bits of seeds, so for instance eight 32 bit seeds. This gives a wrap-to-zero period of 2< | There is no limit to the number of seeds. If you want to use a thousand seeds, you can. The method functions fine with that. In that case it would be more efficient to put the seeds in a table and read and write to the table with two pointers. But it is hard to imagine a use-case where there is a need for more than 256 bits of seeds, so for instance eight 32 bit seeds. This gives a wrap-to-zero period of 2< | ||
en/pfw/random_generators_xorshift.1693844291.txt.gz · Last modified: 2023-09-04 18:18 by uho