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
I need a faster AND(x, y []byte function (stackoverflow post, and benchmark repo) and just find you provide one.
AND(x, y []byte
func AndUnsafeInplace(main, arg []byte) {}
It's so fast by converting every 8 bytes to uint64,
uint64
I'm wondering if it could be faster to use golang assembly code utilizing SIMD instructions.
I just begin to learn assembly language, hope I can help one day.
The text was updated successfully, but these errors were encountered:
I wrote one https://github.com/shenwei356/pand
It works, and the performance is OK.
Sorry, something went wrong.
No branches or pull requests
I need a faster
AND(x, y []byte
function (stackoverflow post, and benchmark repo) and just find you provide one.It's so fast by converting every 8 bytes to
uint64
,I'm wondering if it could be faster to use golang assembly code utilizing SIMD instructions.
I just begin to learn assembly language, hope I can help one day.
The text was updated successfully, but these errors were encountered: