Node:Bitwise AND, Next:Bitwise inclusive OR, Previous:Bitwise NOT, Up:Truth tables and bit masks
Bitwise AND operates on two values, for example 0 & 1. Both the
first value and the second value must be 1 in order for the
result to be 1. As a truth table this would be summarized as follows:
| value1 | value2 | result
|
| 0 | 0 | 0
|
| 0 | 1 | 0
|
| 1 | 0 | 0
|
| 1 | 1 | 1
|