Xorshift operations
From Wikipedia, the free encyclopedia
Found in articles
Xorshift random number generators, also called shift-register generators, are a class of pseudorandom number generators that were invented by George Marsaglia
Linear-feedback shift register
a 16-bit maximal-period Xorshift LFSR using the 7,9,13 triplet from John Metcalf: #include <stdint.h> unsigned lfsr_xorshift(void) { uint16_t start_state
List of hash functions
MurmurHash 32, 64, or 128 bits product/rotation Fast-Hash 32 or 64 bits xorshift operations SpookyHash 32, 64, or 128 bits see Jenkins hash function CityHash
Permuted congruential generator
xorshift operation, x ^= x >> constant. The constant is chosen to be half of the bits (rounded down) not discarded by the fllowing RR or RS operation
Pseudorandom number generator
family of xorshift generators, again based on a linear recurrence. Such generators are extremely fast and, combined with a nonlinear operation, they pass