Derivation Magic... (Bitwise calculation)

[Lytz1]

Derivation Magic... Tough topic..

(1 << (2 - 1)) | (1 << (16 -1)) which equals 1 << 1 | 1 << 15 which equals 2 | 32768 (<--?)
which equals 32770.

It's all good for me and I get the logic until the sudden jump to 2|32768
Might come down to the values of the actual mask?
I am looking into Bitwise online calculators but the entry masks are very different
when shifting is involved...

If this is too complex to explain in a few sentences, don't bother. I then try to read myself into it
via online resources. But I always like to try to understand the difficult stuff in the software I use.

Best,
tL.

(I do understand simple shifting like
8 4 2 1 = Mask, then
0 0 1 1 = 3
shifted to the left by 1 =
0 1 1 0 = 6
but I just get the basic concept with simple numbers... My "best guess" here is that the end result
looks something like this for 32768 in binary format to tell metro which "switch" for the derivation algorithm is on or off: 0-10001110-00000000000000000000000 But this is only a best guess really...)

[Jerm]

The windows calculator in programmer mode makes this very easy because you can click on the binary 1's to turn them into zeros and visa versa. Then the decimal number is the value.

[Lytz1]

Very good. I can work with this. Thanks.

tL.