query: Quickest way to get the position of the leading 1 in a bitset for an integer?
positive_passages.docid: 143350
positive_passages.text: Compute fast log base 2 ceiling
negative_passages.docid: 133693
negative_passages.text: Is it possible to lower the bitwidth of (floating point) numbers?
negative_passages.docid: 28687
negative_passages.text: Efficient bitwise operations for counting bits or find the right|left most ones
negative_passages.docid: 11450
negative_passages.text: Add leading zeroes to number in Java?
negative_passages.docid: 62622
negative_passages.text: Why does std::bitset expose bits in little-endian fashion?
negative_passages.docid: 26701
negative_passages.text: Is there a reliable way in JavaScript to obtain the number of decimal places of an arbitrary number?
negative_passages.docid: 24369
negative_passages.text: In Java, when using bitshifts, why does 1 << 32 != 1 << 31 << 1?
negative_passages.docid: 16175
negative_passages.text: How can I pad a value with leading zeros?
negative_passages.docid: 4689
negative_passages.text: How do I round numbers to the nearest integer from the command line?
negative_passages.docid: 158564
negative_passages.text: How to specify a short int literal without casting?
negative_passages.docid: 12344
negative_passages.text: set 4-bit nibble in an int type
negative_passages.docid: 1085
negative_passages.text: How to output a counter with leading zeros?
negative_passages.docid: 98048
negative_passages.text: Convert a character digit to the corresponding integer in C
negative_passages.docid: 633
negative_passages.text: Number of bit strings
negative_passages.docid: 12188
negative_passages.text: BitConverter.ToString() in reverse?
negative_passages.docid: 35073
negative_passages.text: finding the number of bit string containing eight 0s and twelve 1s?
negative_passages.docid: 4221
negative_passages.text: Determining the number of bit strings of length n that contains no adjacent 0s