The preferred term is bitwise complement. Most computer arithmetic uses two's complement to represent numbers so the complement and the negation of a bit pattern are not the same. Because the two's complement negation of a number is equivalent to the one's complement negation plus 1, the two's complement negation of a single bit number is the same as the original number!
Which all seems a whole lot more pedantic than I really intended, but the notion that negating a number leaves it unchanged was just too neat to pass up :-D.
In reply to Re^2: Boolean calculation incorrect values
by GrandFather
in thread Boolean calculation incorrect values
by Anonymous Monk
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |