bitmask in php

Question

PHP

there is a desire to store boolean values ​​as a bitmask.
for example, yes-no-yes will be 1-0-1
as I understand it, you can store something like this 2^1 + 2^0 + 2^3 = 2+1+8=11
I can’t find an example. and is it worth bothering and is it easier to store as 101 and stupidly pull out the element by number in the tuple? the variant with powers of two seems to allow an unlimited increase in the length of the tuple. the truth and complexity of decoding is higher.
----

$store = 0;
$n = 2;
$store = $store | (1<<$n);
$n = 4;
$store = $store | (1<<$n);
var_dump($store);

on the output of int (20)
how now to understand which bit is written?

Answer 1

What do you want an example of? Writing the nth bit into a number: store = store | (1<<n), given that the bits are counted from zero.

Answer 2

habrahabr.ru/post/134557
here is an article that answers all your questions