python (12.9k questions)

javascript (9.2k questions)

reactjs (4.7k questions)

java (4.2k questions)

java (4.2k questions)

c# (3.5k questions)

c# (3.5k questions)

html (3.3k questions)

Questions - bit

Function in c++ stl that can give me numbers with even number of set bits? Or the code/logic for it?

Is there a built in function in C++ STL that could provide me a list of numbers which have even number of set bits? For example 110 which is 6 has 2 set bits which is even number of set bits. Is there...
test-img

Partth Kulkarni

bit-manipulation

64-bit

bitwise-operators

bit

Votes: 0

Answers: 2

Latest Answer

An easy to understand way to generate the numbers with an even Hamming weight is to loop over all the numbers, calculate their Hamming weights, and keep only the numbers for which it is even. This way...
test-img

harold

How to write/read 8 true/false in a single byte on rust language

Everyone knows that bool uses 1 byte and not 1 bite. In case I want to store 8 (or more) true/false in a single byte, how can I do it on Rust? Something like this: fn main() { let x:ByteOnBits; ...
test-img

WORM HACKER

memory-management

rust

byte

bit

Votes: 0

Answers: 2

Latest Answer

You can use the bitflags crate to use bits as bools stored in different sizes. Although it is intended for other uses, you can still leverage its functionality for it.
test-img

Netwave

Why do operation on <bit> return signed numbers?

Operations like template< class T > constexpr int popcount( T x ) noexcept; return a signed integer, but the number of set bits can never be negative? What was the motivation for choosing a sig...
test-img

Mikhail

c++

c++20

bit

Votes: 0

Answers: 1

Latest Answer

From the paper: The counting operations return "int" quantities, consistent with the rule "use an int unless you need something else". This choice does not reflect, in the type, t...
test-img

Barry

Zero all the bits after the 2nd index

i want to zero all the bits after the 2nd index (Including the 2nd) in an unsigned int. Here's the non working code i wrote so far: (temp is an unsigned int.) for(int i=2; i< DSLength(dnaS); i++) ...
test-img

N.N Beats

c

bit

Votes: 0

Answers: 1

Latest Answer

If I understand you correct, and you want to preserve the lowest two bits and zero all the rest, you don't need a loop: x &= 3 does exactly that with x.
test-img

bereal

Posts

Questions

Blogs

Jobs