one’s complement arithmetic : Java Glossary

one’s complement arithmetic
Java internally uses (or emulates) two’s complement arithmetic for integers. Some hardware architectures, particularly older ones, use one’s complement arithmetic. Positive numbers are stored in binary. That means that for example the number 13 would be written 0x0d = 00001101 = 1*8 + 1*4 + 0*2 + 1*1. The high order bit is called the sign bit. For signed quantities such as byte, short int and long, when that high order bit is a 1, we consider the number negative. To represent a negative number we simply invert each bit. We would write -13 this way: 0x0d00001101111100100xf2. Whenever you do any operation on a byte, it is first sign extended to an int. Don’t confuse one’s complement with one’s compliments — your aggregate flattering activities.

CMP homejump to top You can get the freshest copy of this page from: or possibly from your local J: drive (Java virtual drive/mindprod.com website mirror)
http://mindprod.com/jgloss/onescomplement.html J:\mindprod\jgloss\onescomplement.html
logo
Please email your , letters to the editor, errors, omissions, typos, formatting errors, ambiguities, unclear wording, broken/redirected link reports, suggestions to improve this page or comments to Roedy Green : feedback email. If you want your message, your name or email kept confidential, not considered for public posting, please explicitly specify that. Unless you state otherwise, I will treat your message as a letter to the editor that I may or may not publish in the feedback section. After that, it will be too late to retract it. If you disagree with something I said, please quote it and cite the web page where you found it, tell me why you think it is wrong, and, if possible, provide some supporting evidence. Threatening to kill me or spouting obscenities has yet to persuade me to change my mind.
mindprod.com IP:[65.110.21.43]
view BlogYour face IP:[38.107.179.210]
You are visitor number 11.