How to calculate 2^n-1 efficiently without overflow?

Posted by Ludwig Weinzierl on Stack Overflow See other posts from Stack Overflow or by Ludwig Weinzierl
Published on 2010-06-13T16:19:51Z Indexed on 2010/06/13 16:22 UTC
Read the original article Hit count: 238

Filed under:

c

|

bit-twiddling

I want to calculate 2^n-1 for a 64bit integer value. What I currently do is this

for(i=0; i<n; i++) r|=1<<i;

and I wonder if there is more elegant way to do it. The line is in an inner loop, so I need it to be fast.

I thought of

  r=(1ULL<<n)-1;

but it doesn't work for n=64, because << is only defined for values of n up to 63.

Related posts about bit-twiddling

Bit-Twiddling in SQL

as seen on SQL Blog - Search for 'SQL Blog'
Someone posted a question to the SQL Server forum the other day asking how to count runs of zero bits in an integer using SQL. Basically the poster wanted to know how to efficiently determine the longest contiguous string of zero-bits (known as a run of bits) in any given 32-bit integer. Here are… >>> More
Looking for advice on how to do some bit-twiddling [closed]

as seen on Stack Overflow - Search for 'Stack Overflow'
hi everybody fisrt of all this is not homework and now question is like this suppose i have array int a[]=new int[]{0xBCDA,0xABFE,0xBCAD,0xEFCA,0xFFCA} i know that there is always some hexadecimal number which occurs in all number or in this case A is repeat in array everywhere so my… >>> More
Extracting rightmost N bits of an integer

as seen on Stack Overflow - Search for 'Stack Overflow'
In the yester Code Jam Qualification round http://code.google.com/codejam/contest/dashboard?c=433101#s=a&a=0 , there was a problem called Snapper Chain. From the contest analysis I came to know the problem requires bit twiddling stuff like extracting the rightmost N bits of an integer and checking… >>> More
Position of least significant bit that is set

as seen on Stack Overflow - Search for 'Stack Overflow'
I am looking for an efficient way to determine the position of the least significant bit that is set in an integer, e.g. for 0x0FF0 it would be 4. A trivial implementation is this: unsigned GetLowestBitPos(unsigned value) { assert(value != 0); // handled separately unsigned pos = 0; while… >>> More
How to calculate 2^n-1 efficiently without overflow?

as seen on Stack Overflow - Search for 'Stack Overflow'
I want to calculate 2^n-1 for a 64bit integer value. What I currently do is this for(i=0; i<n; i++) r|=1<<i; and I wonder if there is more elegant way to do it. The line is in an inner loop, so I need it to be fast. I thought of r=(1ULL<<n)-1; but it doesn't work for n=64,… >>> More

Developer IT

How to calculate 2^n-1 efficiently without overflow? - Developer IT

How to calculate 2^n-1 efficiently without overflow?

c

bit-twiddling

Related posts about c

Related posts about bit-twiddling

Bit-Twiddling in SQL

Looking for advice on how to do some bit-twiddling [closed]

Extracting rightmost N bits of an integer

Position of least significant bit that is set

How to calculate 2^n-1 efficiently without overflow?

Categories cloud