| & | Binary AND Operator copies a bit to the result if it exists in both operands. | (A & B) will give 12 which is 0000 1100 |

[RTEnzyme]

          |  & | Binary AND Operator copies a bit to the result if it exists in both operands.                                             |                            (A & B) will give 12 which is 0000 1100                           |

|:--:|---------------------------------------------------------------------------------------------------------------------------|:--------------------------------------------------------------------------------------------:|
| | | Binary OR Operator copies a bit if it exists in either operand. | (A | B) will give 61 which is 0011 1101 |
| ~ | Binary Ones Complement Operator is unary and has the effect of 'flipping' bits. | (~A ) will give -61 which is 1100 0011 in 2's complement form due to a signed binary number. |
| << | Binary Left Shift Operator. The left operands value is moved left by the number of bits specified by the right operand. | A << 2 will give 240 which is 1111 0000 |
| >> | Binary Right Shift Operator. The left operands value is moved right by the number of bits specified by the right operand. | A >> 2 will give 15 which is 0000 1111 |
| # | bitwise XOR. | A # B will give 49 which is 00110001 |

I have investigated the bitwise operations in the PG database.
You can follow the PG document to implement this.
@FauxFaux

Originally posted by @liukun4515 in #1619 (comment)