Decimal to Hexadecimal using Bitwise, Bit Shift Operations in Java
Hexadecimal uses the positional base system of 16, where each digit can represent four binary digits (bits). Taking a look at the documentation you will see that a Java integer is able to hold a 32bit signed, two’s complement value between -2^31 and 2^31-1. These two findings allow us to deduce that the smallest and largest integer numbers can be represented in a maximum of 8 hexadecimal positions. The discussed two’s compliment is a widely used scheme within computing, using the most significant bit to determine if the value is negative or not. To convert a negative number to and from a two’s complement representation, a simple inversion of each binary bit and addition by one needs to take place. With this knowledge we can now go about implementing the solution found below.
Decimal to Hexadecimal
In the above implementation I first make a ‘StringBuilder’ instance with the initial size capacity of 8 (instead of the default 16). I then subsequently set the current length of the instance to the full 8, which pads the string with null values (‘\u0000’). Once this is complete I loop over the builder instance starting with the right most character, the lowest position in a positional numeral system. Within the loop I use a bitwise ‘AND’ mask which returns the current lowest positioned 4 bits from the subject integer. I could have alternatively used the decimal ‘15’, or the representation used in the bitwise operation ‘0b1111’. A value between 0 and 15 will be returned from the operation which can be looked up in the ‘codes’ string and set in the builder instance. To complete a full step through the loop I do a signed right shift on the subject integer which shifts the pattern 4 bits to the right, allowing me to process the next position. Finally, once the loop has finished I return a string representation of the builder instance.
Above are a couple of examples which show the solution being used to represent the minimum and maximum possible integer values. One issue that did arise was when converting the minimum value back to a decimal representation. I was required to do a bewildering parse as a long instead, and then cast back down to the desired integer. The reason for this is that Java parses integers as signed values, so inserting anything higher than 0x7FFFFFFF will throw an error. If you parse it as a larger long however, the value will still be signed but the cast will overflow the integer back to it’s correct value.
Random Web Colours
Now back to the reason why I wanted to convert decimal representations into hexadecimal in the first place. Web colours are represented by a six digit hex-triplet. Each two bytes represent the Red, Green and Blue components of the particular colour. With this knowledge, we simply only have to generate a random number between and inclusive of 0 (0x000000) and 16777215 (0xFFFFFF). We then can convert this decimal representation into hexadecimal using are built implementation. There are only two points I would like to make about the code below, most importantly the removal of the the first two characters of the string returned. This is due to hex-triplets only using 6 positions, which means the most significant two are not required. Also Java’s ‘nextInt’ method is inclusive of 0 and exclusive of the provided maximum value, so we must add one to the desired range to return a correct result.