Skip to main content

Integer comparison using == gets tricky between -128 to 127.


  • Integer i=45;                                                                                                                                   Integer k=45;
        System.out.println("i.hashcode= "+i.hashCode());
        System.out.println("k.hashcode= "+k.hashCode());
        System.out.println(i==k);
        System.out.println(i.equals(k));

Out Put:

i.hashcode= 45
k.hashcode= 45
true
true

Great, it seems work fine! now change the value of i=k=201.
        Integer i=201;
        Integer k=201;
        System.out.println("i.hashcode= "+i.hashCode());
        System.out.println("k.hashcode= "+k.hashCode());
        System.out.println(i==k);
        System.out.println(i.equals(k));


OutPut:
i.hashcode= 201
k.hashcode= 201
false //
System.out.println(i==k); 
true 

The reason behind this is the IntegerCache, a private static inner class in Integer class. This was feature was introduced in java 1.5 for performance improvement. 


An implementation  of flyweight design pattern . A flyweight is an object that minimises memory use by sharing as much data as possible with other similar objects.

 


so, integer  cache help auto boxing between the range [-128 to 127].
Now how auto boxing  happen?  When we do the following in java 1.5 onwards
Integer K=23;
program flow goes to following method of Integer class
public static Integer valueOf(int i) {
        if (i >= IntegerCache.low && i <= IntegerCache.high)
            return IntegerCache.cache[i + (-IntegerCache.low)];
        return new Integer(i);
    }
so , above code checks if the int i lies between [-128 to 127] then the object from integer cache else it creates a new integer object using new operator.


That’s why checking equality using == operator only holds between the range -128 to 127.
one exception to above rule; if we create object using new operator and even if the integer lies between [-128 to 127] equality using == operator will not hold true when values are same.

Caching also supported by java.lang.Long and java.lang.Character
in Character class cache array hold 128 objects(The ASCII table) unlike Integer and Long.  
 





Comments

Popular posts from this blog

Greedy algorithms for Job Scheduling

In this programming problem and the next you'll code up the greedy algorithms from lecture for minimizing the weighted sum of completion times.. This file describes a set of jobs with positive and integral weights and lengths. It has the format [number_of_jobs] [job_1_weight] [job_1_length] [job_2_weight] [job_2_length] ... For example, the third line of the file is "74 59", indicating that the second job has weight 74 and length 59. You should NOT assume that edge weights or lengths are distinct. Your task in this problem is to run the greedy algorithm that schedules jobs in decreasing order of the difference (weight - length). This algorithm is not always optimal. IMPORTANT: if two jobs have equal difference (weight - length), you should schedule the job with higher weight first. Beware: if you break ties in a different way, you are likely to get the wrong answer. You should report the sum of weighted completion times of the resulting schedule --- a posi...

You have given an array in which numbers are first increasing and then decreasing. Find the maximum element in O(log n).

An integer array with unique elements has the following property – elements initially are in increasing order till a point after which they start to decrease. Implement a function to find the index of the maximum element in the array in less than linear time, i.e., O(n). Example: Input: array = {1, 3, 5, 7, 9, 8, 6, 4} Output: max index = 4 Max Index : 4.  Max Element value is : 9