Skip to main content

Why we must declare immutable class as Final? Why is an immutable class supposed to be final?

Why immutable class declared as final in Java?

Why we must declare immutable class as Final

Immutable class means, once object is created it can not be changed. 

Learn more about Immutable class in details :

Now lets see why we must declare immutable class as final in Java.

If immutable class does not defined as final then any other class can extends that class and change properties of that class and broke the objective of immutability.

So final class is important in immutability. Lets see using example.

Programming.java

public class Programming {
    
    private final String name;
    
    public Programming(String name) {
        this.name = name;
    }

    public String getName() {
        return name;
    }

    @Override
    public String toString() {
        return "Programming [name=" + name + "]";
    }

    @Override
    public int hashCode() {
        final int prime = 31;
        int result = 1;
        result = prime * result + ((name == null) ? 0 : name.hashCode());
        return result;
    }

    @Override
    public boolean equals(Object obj) {
        if (this == obj)
            return true;
        if (obj == null)
            return false;
        if (getClass() != obj.getClass())
            return false;
        Programming other = (Programming) obj;
        if (name == null) {
            if (other.name != null)
                return false;
        } else if (!name.equals(other.name))
            return false;
        return true;
    }

}

MutableClass.java

public class MutableClass extends Programming {

    private String mutableName;
    
    public MutableClass(String name) {
        super(name);
       
        // Setting same name as programming name field
        this.setMutableName(name);
    }

    public String getMutableName() {
        return mutableName;
    }

    public void setMutableName(String mutableName) {
        this.mutableName = mutableName;
    }

    @Override
    public int hashCode() {
        final int prime = 31;
        int result = super.hashCode();
        result = prime * result + ((mutableName == null) ? 0 : mutableName.hashCode());
        return result;
    }

    @Override
    public boolean equals(Object obj) {
        if (this == obj)
            return true;
        if (!super.equals(obj))
            return false;
        if (getClass() != obj.getClass())
            return false;
        MutableClass other = (MutableClass) obj;
        if (mutableName == null) {
            if (other.mutableName != null)
                return false;
        } else if (!mutableName.equals(other.mutableName))
            return false;
        return true;
    }
    
}

Demo.java

import java.util.HashMap;

public class Demo {

    public static void main(String[] args) {
       
        HashMap<Programming, Integer> mapOfProgramming = new HashMap<>();
       
        MutableClass mutableObj = new MutableClass("Java");
       
        // Assigning obj reference of mutable to immutable class
        Programming programmingObj = mutableObj;
       
        mapOfProgramming.put(programmingObj, 1);
       
        // Changing immutable class property "name" using mutable class
        mutableObj.setMutableName("Python");
       
        System.out.println(mapOfProgramming.get(programmingObj));
       
    }
    
}

Output :

null

As you can see, we are getting "null" answer rather than "1". because MutableClass extends Programming class and change the property of "name" field and broke the immutability of Programming class.

Map only knows key holding as Object "Java", but using mutable class we are set name property to "Python" and if we get from map using "Python" name property it will return null because there is no key as name "Python". 

If we comment "mutableObj.setMutableName("Python");" line of code we are getting answer as 1.

So for create immutable class, one must declare class as Final otherwise some other class can extends it and change the object of immutable class.


Other articles :

 

Comments

Popular posts from this blog

Queen's Attack II HackerRank Solution in Java with Explanation

Queen's Attack II Problem's Solution in Java (Chessboard Problem)   Problem Description : You will be given a square chess board with one queen and a number of obstacles placed on it. Determine how many squares the queen can attack.  A queen is standing on an n * n chessboard. The chess board's rows are numbered from 1 to n, going from bottom to top. Its columns are numbered from 1 to n, going from left to right. Each square is referenced by a tuple, (r, c), describing the row r and column c, where the square is located. The queen is standing at position (r_q, c_q). In a single move, queen can attack any square in any of the eight directions The queen can move: Horizontally (left, right) Vertically (up, down) Diagonally (four directions: up-left, up-right, down-left, down-right) The queen can move any number of squares in any of these directions, but it cannot move through obstacles. Input Format : n : The size of the chessboard ( n x n ). k : The number of obstacles...

Sales by Match HackerRank Solution | Java Solution

HackerRank Sales by Match problem solution in Java   Problem Description : Alex works at a clothing store. There is a large pile of socks that must be paired by color for sale. Given an array of integers representing the color of each sock, determine how many pairs of socks with matching colors there are. For example, there are n=7 socks with colors socks = [1,2,1,2,1,3,2]. There is one pair of color 1 and one of color 2 . There are three odd socks left, one of each color. The number of pairs is 2 .   Example 1 : Input : n = 6 arr = [1, 2, 3, 4, 5, 6] Output : 0 Explanation : We have 6 socks with all different colors, So print 0. Example 2 : Input : n = 10 arr = [1, 2, 3, 4, 1, 4, 2, 7, 9, 9] Output : 4 Explanation : We have 10 socks. There is pair of color 1, 2, 4 and 9, So print 4. This problem easily solved by HashMap . Store all pair of socks one by one in Map and check if any pair is present in Map or not. If pair is present then increment ans variable by 1 ...