We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Well, it doesn't compile on Visual Studio 2013 (thanks to your ROT implementation), by ignoring Visual Studio you ignore a large group of programmers.
I hope that sticking with your own version of bit rotation algorithm was worth losing of so many potential users...
PS. Your algorithm is slow compared to original rand(), 64 bit multiplication generates external call to _allmul when compiled on 32 bits.
The text was updated successfully, but these errors were encountered:
No branches or pull requests
Well, it doesn't compile on Visual Studio 2013 (thanks to your ROT implementation), by ignoring Visual Studio you ignore a large group of programmers.
I hope that sticking with your own version of bit rotation algorithm was worth losing of so many potential users...
PS. Your algorithm is slow compared to original rand(), 64 bit multiplication generates external call to _allmul when compiled on 32 bits.
The text was updated successfully, but these errors were encountered: