query: How to quickly count bits into separate bins in a series of ints on Sandy Bridge?
positive_passages.docid: 146257
positive_passages.text: Count each bit-position separately over many 64-bit bitmasks, with AVX but not AVX2
negative_passages.docid: 99004
negative_passages.text: How to compute a discrete histogram of a list
negative_passages.docid: 98618
negative_passages.text: Integer partition with fixed number of summands but without order
negative_passages.docid: 150574
negative_passages.text: Outputting integers in assembly on Linux
negative_passages.docid: 86445
negative_passages.text: How to gather byte occurrence statistics in binary file?
negative_passages.docid: 101532
negative_passages.text: How to divide two 64-bit numbers in Linux Kernel?
negative_passages.docid: 44988
negative_passages.text: How to create a sequence of integers in C#?
negative_passages.docid: 148329
negative_passages.text: Optimising 2D binning code
negative_passages.docid: 95755
negative_passages.text: Counting the population of integers
negative_passages.docid: 49207
negative_passages.text: How to zero pad a sequence of integers in bash so that all have the same width?
negative_passages.docid: 155162
negative_passages.text: Practical Use of Zero-Length Bitfields
negative_passages.docid: 151766
negative_passages.text: Inverse of numpy's bincount function
negative_passages.docid: 28496
negative_passages.text: Generating the partitions of a number
negative_passages.docid: 77360
negative_passages.text: Efficient way of iterating over true bits in std::bitset?
negative_passages.docid: 3568
negative_passages.text: Fast way to get a position of combination (without repetitions)
negative_passages.docid: 14046
negative_passages.text: Problem about a process with bins of balls
negative_passages.docid: 90923
negative_passages.text: What are bitwise operations?