Skip to main content

How to Sort object property with null values using Java 8 Lambda expression

Sort custom object property with null values using Java 8 lambda expression

Sort object property with null values using Java 8 Lambda expression

What is lambda expression?

The expression through which we can represent an anonymous function.

learn more about lambda expression :

Lets see how we can sort custom object property without and with lambda expression.

Example 1 : Sort custom object without lambda expression using Collections.sort()

Programming.java

public class Programming {

    private int id;
    private String name;
    
    public Programming(int id, String name) {
        this.id = id;
        this.name = name;
    }
    public int getId() {
        return id;
    }
    public void setId(int id) {
        this.id = id;
    }
    public String getName() {
        return name;
    }
    public void setName(String name) {
        this.name = name;
    }
    @Override
    public String toString() {
        return "Programming [id = " + id + ", name = " + name + "]";
    }
    
}

SortObjectPropertyByLambda.java

import java.util.ArrayList;
import java.util.Collections;
import java.util.List;

public class SortObjectPropertyByLambda {

    public static void main(String[] args) {
       
        List<Programming> language = new ArrayList<Programming>() {{
            add(new Programming(1, "Java"));
            add(new Programming(2, "Python"));
            add(new Programming(5, "JavaScript"));
            add(new Programming(10, "Php"));
            add(new Programming(4, "Dotnet"));
            add(new Programming(20, "ReactNative"));
            add(new Programming(6, "AngularJs"));
        }};
       
        Comparator<Programming> comparator = new Comparator<Programming>() {
           
            @Override
            public int compare(Programming o1, Programming o2) {
                return o1.getName().compareTo(o2.getName());
            }
        };
       
        Collections.sort(language, comparator);
        System.out.println(language);
       
    }
}

Output :

[Programming [id = 6, name = AngularJs],
Programming [id = 4, name = Dotnet],
Programming [id = 1, name = Java],
Programming [id = 5, name = JavaScript],
Programming [id = 10, name = Php],
Programming [id = 2, name = Python],
Programming [id = 20, name = ReactNative]]

For reverse order, change in return statement in compare method like below :

public int compare(Programming o1, Programming o2) {
     return o2.getName().compareTo(o1.getName());
}

Example 2 : Sort custom object with Java 8 lambda expression using Collections.sort()

import java.util.ArrayList;
import java.util.Collections;
import java.util.List;

public class SortObjectPropertyByLambda {

    public static void main(String[] args) {
       
        List<Programming> language = new ArrayList<Programming>() {{
            add(new Programming(1, "Java"));
            add(new Programming(2, "Python"));
            add(new Programming(5, "JavaScript"));
            add(new Programming(10, "Php"));
            add(new Programming(4, "Dotnet"));
            add(new Programming(20, "ReactNative"));
            add(new Programming(6, "AngularJs"));
        }};
       
        Collections.sort(language, (o1, o2) -> o1.getName().compareTo(o2.getName()));
        System.out.println(language);
    }
    
}

If we try to sort object with null value, then we get following exception.

Exception in thread "main" java.lang.NullPointerException
    at Java8.SortObjectPropertyByLambda.lambda$0(SortObjectPropertyByLambda.java:23)

So we can use Comparator comparing method for sort null value as well. lets see example for that.

Example 3 : Sort custom object property with null values in java

import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;
import java.util.List;

public class SortObjectPropertyByLambda {

    public static void main(String[] args) {
       
        List<Programming> language = new ArrayList<Programming>() {{
            add(new Programming(15, "null"));
            add(new Programming(1, "Java"));
            add(new Programming(2, "Python"));
            add(new Programming(5, "JavaScript"));
            add(new Programming(10, "Php"));
            add(new Programming(4, "Dotnet"));
            add(new Programming(20, "ReactNative"));
            add(new Programming(6, "AngularJs"));
            add(new Programming(6, "null"));
           
        }};
       
        Comparator<Programming> comparator = Comparator.comparing(Programming::getName,
                Comparator.nullsLast(Comparator.naturalOrder())
        );
       
        Collections.sort(language, comparator);
        System.out.println(language);
    }
}

Output :

[Programming [id = 6, name = AngularJs],
Programming [id = 4, name = Dotnet],
Programming [id = 1, name = Java],
Programming [id = 5, name = JavaScript],
Programming [id = 10, name = Php],
Programming [id = 2, name = Python],
Programming [id = 20, name = ReactNative],
Programming [id = 15, name = null],
Programming [id = 6, name = null]]

We can also reverse the data using Comparator.reverseOrder() method.


Other related 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 ...