Home/ Questions/Q 3636026
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-05-19T00:58:42+00:00

I found some interesting bit twiddling in source\common\unicode\utf.h file of ICU library (International Components

  • 0

I found some interesting bit twiddling in "source\common\unicode\utf.h" file of ICU library (International Components for Unicode). The bit twiddling is intended for checking whether a number is in a particular range.

// Is a code point in a range of U+d800..U+dbff?
#define U_IS_LEAD(c) (((c)&0xfffffc00)==0xd800)

I have figured out the magic number (0xfffffc00) come from:

MagicNumber = 0xffffffff - (HighBound - LowBound)

However, I also found that the formula doesn’t apply to every arbitrary range. Does somebody here know in what circumstance the formula works?

Is there another bit twiddling for checking whether a number is in particular range?

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    For these tricks to apply, the numbers must have some common features in their binary representation.

    0xD800 == 0b1101_1000_0000_0000
0xDBFF == 0b1101_1011_1111_1111

    What this test really does is to mask out the lower ten bits. This is usually written as

    onlyHighBits = x & ~0x03FF

    After this operation (“and not”) the lower ten bits of onlyHighBits are guaranteed to be zero. That means that if this number equals the lower range of the interval now, it has been somewhere in the interval before.

    This trick works in all cases where the lower and the higher limit of the interval start with the same digits in binary, and at some point the lower limit has only zeroes while the higher limit has only ones. In your example this is at the tenth position from the right.

    • 0