Skip to main content

Sad reality about Wrapper Classes in Java

Consider the snippet.



Integer firstInteger = 1000; // autoboxing
Integer secondInteger = 1000; //autoboxing

if (firstInteger != secondInteger) {
System.out.println("Different objects!");
}

if(firstInteger.equals(secondInteger)) {
System.out.println("Meaningfully equivalent!");
}

Output:



Different objects!
Meaningfully equivalent!

How about this one.



Integer firstInteger = 100; // autoboxing
Integer secondInteger = 100; //autoboxing

if (firstInteger == secondInteger) {
System.out.println("Equal objects!");
}

if(firstInteger.equals(secondInteger)) {
System.out.println("Meaningfully equivalent!");
}

And the output?



Equal objects!
Meaningfully equivalent!

And the explanation?


Two instances of the wrapper objects will always be == when their primitive values are the same.
- Boolean
- Byte
- Character from \u0000 to \u007F (0 to 127)
- Short from -128 to 127
- Integer from -128 to 127


Tsk.

Comments

Popular posts from this blog

Moving on

So I bought my self a 2.5″ hard drive enclosure for about 750 bucks. I wish I have my own tools for constructing a device as such. Instead of going for a 2GB USB flash drive, I chose to salvage the 30GB hard drive of an incapacitated laptop. Cool isn’t it? Though relatively slower than a typical USB flash drive, the storage capacity outweighs it. [To God] Thanks for being there always.

Architecture Complexity

Here are the items to consider: Coding to an interface Service Oriented Architecture Automated Testing Domain Driven Design Custom Data Access Layer Layered architecture Complexity is relatively equal the number of lines of code. Note that complexity is not bad. It must be justified.

Bin to hex converter in 16-bit DOS assembly

Just a quick code like putting your keyboard where your brain is. There should be another way of doing this. I hate this code. start: xor al, al xor bl, bl xor cl, cl mov dl, 4 ; use dl as counter input: mov ah, 00 int 16h cmp ah, 1ch je exit cmp al, '0' jb input cmp al, '1' ja input convert: mov cl, dl dec cl ; dl - 1 sub al, 30h ; get original value shl al, cl ; place in the appropriate bit position or bl, al ; save in bl dec dl ; prepare for the next bit jnz input ; must be 4 bits cmp bl, 9 ja letter jbe number letter: add bl, 37h ; because 'A' - 37h is 0Ah jmp here number: add bl, 30h ; because '0' - 30h is 00h here: call display jmp start display: mov ah, 02h ...