query: finding the first set bit in a binary number
positive_passages.docid: 28687
positive_passages.text: Efficient bitwise operations for counting bits or find the right|left most ones
negative_passages.docid: 95865
negative_passages.text: How does one store a vector or a bitset into a file, but bit-wise?
negative_passages.docid: 18308
negative_passages.text: Coset multiplication giving a well defined binary operation
negative_passages.docid: 74839
negative_passages.text: Catalan numbers: bijection between applications of a binary operator and Dyck words.
negative_passages.docid: 19549
negative_passages.text: What are bitwise shift (bit-shift) operators and how do they work?
negative_passages.docid: 32039
negative_passages.text: What are the trailing number of the zeroes in the given integer
negative_passages.docid: 55644
negative_passages.text: Binary number 11 represents?
negative_passages.docid: 98355
negative_passages.text: Is the set of all possible binary strings countable?
negative_passages.docid: 50399
negative_passages.text: Base-2 (Binary) Representation Using Python
negative_passages.docid: 4721
negative_passages.text: What is the fastest/most efficient way to find the highest set bit (msb) in an integer in C?
negative_passages.docid: 142912
negative_passages.text: Fractions in binary?
negative_passages.docid: 20174
negative_passages.text: Discrete mathematics bit strings
negative_passages.docid: 128885
negative_passages.text: For 3 numbers represented with $n$ bits in binary, how many bits is required for their product.
negative_passages.docid: 122126
negative_passages.text: Detecting start bit in software UART
negative_passages.docid: 132118
negative_passages.text: Computing the $n^{\textrm{th}}$ permutation of bits.
negative_passages.docid: 60915
negative_passages.text: Count number of 1's in binary representation
negative_passages.docid: 60384
negative_passages.text: Define bitset size at initialization?