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

Java Hashset HackerRank Solution | Programming Blog

Java Hashset HackerRank Solution with Explanation   Problem Statement :- In computer science, a set is an abstract data type that can store certain values, without any particular order, and no repeated values. {1,2,3} is an example of a set, but {1,2,2} is not a set. Today you will learn how to use sets in java by solving this problem. You are given n pairs of strings. Two pairs (a,b) and (c,d) are identical if a = c and b = d. That also implies (a,b) is not same as (b,a). After taking each pair as input, you need to print number of unique pairs you currently have. See full problem description in HackerRank Website :- https://www.hackerrank.com/challenges/java-hashset/problem Let's see solution of problem. import java.util.HashSet; import java.util.Scanner; public class Solution {     public static void main(String[] args) {         Scanner s = new Scanner(System.in);         System.out.println("Enter tot...