Issues
- 0
- 0
- 0
- 0
- 0
- 0
- 0
- 0
- 0
- 0
- 0
- 0
Round up to the next highest power of 2 by float casting
#52 opened by make-github-pseudonymous-again - 0
Count the consecutive zero bits (trailing) on the right with multiply and lookup
#51 opened by make-github-pseudonymous-again - 0
Count the consecutive zero bits (trailing) on the right with modulus division and lookup
#50 opened by make-github-pseudonymous-again - 0
Count the consecutive zero bits (trailing) on the right by casting to a float
#49 opened by make-github-pseudonymous-again - 0
Count the consecutive zero bits (trailing) on the right by binary search
#48 opened by make-github-pseudonymous-again - 0
Count the consecutive zero bits (trailing) on the right in parallel
#47 opened by make-github-pseudonymous-again - 0
Count the consecutive zero bits (trailing) on the right linearly
#46 opened by make-github-pseudonymous-again - 0
Find integer log base 2 of the pow(2, r)-root of a 32-bit IEEE float (for unsigned integer r)
#45 opened by make-github-pseudonymous-again - 0
- 0
- 0
- 0
Find the log base 2 of an N-bit integer in O(lg(N)) operations with multiply and lookup
#41 opened by make-github-pseudonymous-again - 0
Find the log base 2 of an N-bit integer in O(lg(N)) operations
#40 opened by make-github-pseudonymous-again - 0
- 0
Find the integer log base 2 of an integer with an 64-bit IEEE float
#38 opened by make-github-pseudonymous-again - 0
Find the log base 2 of an integer with the MSB N set in O(N) operations (the obvious way)
#37 opened by make-github-pseudonymous-again - 0
Computing modulus division by (1 << s) - 1 in parallel without a division operation
#36 opened by make-github-pseudonymous-again - 0
Computing modulus division by (1 << s) - 1 without a division operation
#35 opened by make-github-pseudonymous-again - 0
Computing modulus division by 1 << s without a division operation (obvious)
#34 opened by make-github-pseudonymous-again - 0
Reverse an N-bit quantity in parallel with 5 * lg(N) operations
#33 opened by make-github-pseudonymous-again - 0
Reverse the bits in a byte with 7 operations (no 64-bit, only 32)
#32 opened by make-github-pseudonymous-again - 0
Reverse the bits in a byte with 4 operations (64-bit multiply, no division)
#31 opened by make-github-pseudonymous-again - 0
Reverse the bits in a byte with 3 operations (64-bit multiply and modulus division)
#30 opened by make-github-pseudonymous-again - 0
- 0
- 0
- 0
Swapping values with XOR
#26 opened by make-github-pseudonymous-again - 0
- 0
Compute parity in parallel
#24 opened by make-github-pseudonymous-again - 0
- 0
Compute parity of a byte using 64-bit multiply and modulus division
#22 opened by make-github-pseudonymous-again - 0
- 0
- 0
Select the bit position (from the most-significant bit) with the given count (rank)
#19 opened by make-github-pseudonymous-again - 0
Count bits set (rank) from the most-significant bit upto a given position
#18 opened by make-github-pseudonymous-again - 0
- 0
Counting bits set in 14, 24, or 32-bit words using 64-bit instructions
#16 opened by make-github-pseudonymous-again - 0
- 0