motoko
motoko copied to clipboard
Perf: optimize the implementation of bittest operations
The primitives could directly return booleans, rather than requiring the additional inequality test against 0 in prim.mo.
This would be more efficient and would ensure the Prim.bittest operations are inlined (they are not at the moment, unlike most other prims).
Dear @receronp,
In order to potentially merge your code in this open-source repository and therefore proceed with your contribution, we need to have your approval on DFINITY's CLA[^1].
If you decide to agree with it, please visit this issue and read the instructions there.
— The DFINITY Foundation [^1]: Contributor License Agreement