pot-pourri/bit

Determine if a word has a byte greater than n

hack

#61

· make-github-pseudonymous-again opened

on Apr 14, 2015

Determine if a word has byte less than n

hack

#60

· make-github-pseudonymous-again opened

on Apr 14, 2015

Determine if a word has a byte equal to n

hack

#59

· make-github-pseudonymous-again opened

on Apr 14, 2015

Determine if a word has a zero byte

hack

#58

· make-github-pseudonymous-again opened

on Apr 14, 2015

Interleave bits by Binary Magic Numbers

hack

#57

· make-github-pseudonymous-again opened

on Apr 14, 2015

Interleave bits with 64-bit multiply

hack

#56

· make-github-pseudonymous-again opened

on Apr 14, 2015

Interleave bits by table lookup

hack

#55

· make-github-pseudonymous-again opened

on Apr 14, 2015

Interleave bits the obvious way

hack

#54

· make-github-pseudonymous-again opened

on Apr 14, 2015

Round up to the next highest power of 2

hack

#53

· make-github-pseudonymous-again opened

on Apr 14, 2015

Round up to the next highest power of 2 by float casting

hack

#52

· make-github-pseudonymous-again opened

on Apr 14, 2015

Count the consecutive zero bits (trailing) on the right with multiply and lookup

hack

#51

· make-github-pseudonymous-again opened

on Apr 14, 2015

Count the consecutive zero bits (trailing) on the right with modulus division and lookup

hack

#50

· make-github-pseudonymous-again opened

on Apr 14, 2015

Count the consecutive zero bits (trailing) on the right by casting to a float

hack

#49

· make-github-pseudonymous-again opened

on Apr 14, 2015

Count the consecutive zero bits (trailing) on the right by binary search

hack

#48

· make-github-pseudonymous-again opened

on Apr 14, 2015

Count the consecutive zero bits (trailing) on the right in parallel

hack

#47

· make-github-pseudonymous-again opened

on Apr 14, 2015

Count the consecutive zero bits (trailing) on the right linearly

hack

#46

· make-github-pseudonymous-again opened

on Apr 14, 2015

Find integer log base 2 of the pow(2, r)-root of a 32-bit IEEE float (for unsigned integer r)

hack

#45

· make-github-pseudonymous-again opened

on Apr 14, 2015

Find integer log base 2 of a 32-bit IEEE float

hack

#44

· make-github-pseudonymous-again opened

on Apr 14, 2015

Find integer log base 10 of an integer the obvious way

hack

#43

· make-github-pseudonymous-again opened

on Apr 14, 2015

Find integer log base 10 of an integer

hack

#42

· make-github-pseudonymous-again opened

on Apr 14, 2015

Find the log base 2 of an N-bit integer in O(lg(N)) operations with multiply and lookup

hack

#41

· make-github-pseudonymous-again opened

on Apr 14, 2015

Find the log base 2 of an N-bit integer in O(lg(N)) operations

hack

#40

· make-github-pseudonymous-again opened

on Apr 14, 2015

Find the log base 2 of an integer with a lookup table

hack

#39

· make-github-pseudonymous-again opened

on Apr 14, 2015

Find the integer log base 2 of an integer with an 64-bit IEEE float

hack

#38

· make-github-pseudonymous-again opened

on Apr 14, 2015

Find the log base 2 of an integer with the MSB N set in O(N) operations (the obvious way)

hack

#37

· make-github-pseudonymous-again opened

on Apr 14, 2015

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Uh oh!

seander

Determine if a word has a byte greater than n

Determine if a word has byte less than n

Determine if a word has a byte equal to n

Determine if a word has a zero byte

Interleave bits by Binary Magic Numbers

Interleave bits with 64-bit multiply

Interleave bits by table lookup

Interleave bits the obvious way

Round up to the next highest power of 2

Round up to the next highest power of 2 by float casting

Count the consecutive zero bits (trailing) on the right with multiply and lookup

Count the consecutive zero bits (trailing) on the right with modulus division and lookup

Count the consecutive zero bits (trailing) on the right by casting to a float

Count the consecutive zero bits (trailing) on the right by binary search

Count the consecutive zero bits (trailing) on the right in parallel

Count the consecutive zero bits (trailing) on the right linearly

Find integer log base 2 of the pow(2, r)-root of a 32-bit IEEE float (for unsigned integer r)

Find integer log base 2 of a 32-bit IEEE float

Find integer log base 10 of an integer the obvious way

Find integer log base 10 of an integer

Find the log base 2 of an N-bit integer in O(lg(N)) operations with multiply and lookup

Find the log base 2 of an N-bit integer in O(lg(N)) operations

Find the log base 2 of an integer with a lookup table

Find the integer log base 2 of an integer with an 64-bit IEEE float

Find the log base 2 of an integer with the MSB N set in O(N) operations (the obvious way)

seander

List view