Back

## An interesting usecase for bit manipulation

January 6, 2023

The other day, I was reading the source code to preact/signals and came across code that looked somewhat like this:

``// flagsconst FIRSTFLAG = 1 << 0;const SECONDFLAG = 1 << 1;const THRIDFLAG = 1 << 2;// object with flagsconst node = {  flags: 0}// adding flags?node.flags |= FIRSTFLAG;// checking if flags existedif (node.flags & (SECONDFLAG | THIRDFLAG)) {  // do stuff}// removing flags?node.flags &= ~FIRSTFLAG;``

Event after coding for ~ten years, this isn't something I have seen with any regularity. Certainly not enough to know what it did off the top of my head. So what exactly is going on here? Lets break it down.

### Binary

Before we can go any further, we need to discuss how numbers are represented at the binary level. When we talk about binary, data is can only be represented as a series of `1`s and `0`s. For now we will just discuss what that means for numbers in our little javascript example. Lets work with the following:

``````000001
``````

This represents the number `1`. It doesn't matter how many zeros precede the `1`, just that it appears in the right most place. Going left each bit/digit represents double the previous digit. So it would go something like: `0001 == 1`, `0010 == 2`, `0100 == 4`, `1000 == 8`, and so on.

From here you can set the bit in multiple places to get all the numbers:

``````0001    // 1
0010 +  // 2
------
0011    // 3
``````

Javascript numbers are 64-bit, so in theory you could have up to `1`s and `0`s, but the way there encoded for floating point precision and postive/negative values, it leaves us with 53 bits of usable information. We can distinguish this by the following:

``const max_binary = Number.MAX_SAFE_INTEGER.toString(2);// 11111111111111111111111111111111111111111111111111111max_binary.length; // 53``

Javascript technically has big ints, but I'm not there yet. Plus I think we have enough for now.

### Creating flags

Okay, so 53 bits worth of information... for what? We will get there... I promise.

Now that we have some background knowledge, what is going on in the code. It starts by predefining some flags with some interesting syntax, which turns out to be the bitshift operator.

``const FIRSTFLAG = 1 << 0; // bit shifting left 0 places``

This changes the number `1` by moving it's bits to the left by `0` places. If we push `001` left by `0`, we still have `1`. 🙄 Okay, that was lame... lets try again. But push it left `1` space:

``const SECONDFLAG = 1 << 1; // bit shifting left 1 placeSECONDFLAG === 2;``

We've transformed `001` by pushing the bits to get `010`, and the slot second from the left has the value of `2`.

If you continue this for each of the flags you might need, you will see the double in value everytime. This correaltes 1:1 with each digit of a binary value to double the previous digit (going right to left).

### So what?

Okay now we have the ability to store some information within a single number value. Why might this be useful?

I think it's a niche scenario, when memory usage is super important. I don't understand the details completely, but by storing multiple data values in a single number you limit how many variable descriptors you need. Instead of having five different (boolean) variables created with their own memory allocation, you can store them all at once.

That's mostly a guess. I find this whole thing intriguing, but haven't been able to find a good usecase for myself. Will hang on to this idea just in case. It's at least helpful that I now understand how this stuff works when I come across it in code.

Till next time...