Skip to main content

Predicate In Java 8 with examples | test(), and(), or(), negate() methods

 Java 8 predicate functinal interface | test, or, and, nagate method

What is Predicate in Java 8? 

  • Predicate in general meaning is a statement about something that is either true or false. In programming, predicates represent single argument functions that return a boolean value.
  • Predicate is a functional interface representing a single argument function that returns a boolean value.
  • If we want conditional check in our code, we can use Predicate.  

Predicates in Java are implemented with interfaces. Predicate<T> is a generic functional interface representing a single argument function that returns a boolean value. It is located in the java.util.function package. It contains a Test (T t) method that evaluates the predicate on the given argument.

public interface Predicate<T> {
    public boolean test(T t);          
}
    

test is only abstract method present in Predicate interface. It is return boolean value based on given condition.

With predicates, we can create code that is more clean and readable. Predicates also help to create better tests.

Lets understand Predicate using code.

Example 1 : Without Predicate interface

public class PredicateDemo {
    
    public boolean checkNumber(int number) {
        if (number > 18) {
            return true;
        } else {
            return false;
        }
    }
    
    public static void main(String[] args) {
        
        PredicateDemo obj = new PredicateDemo();
        System.out.println(obj.checkNumber(17));
        System.out.println(obj.checkNumber(22));
        
    }
    

Output :

false
true

Example 2 : With Predicate interface

import java.util.function.Predicate; 

public class PredicateDemo {
    
    public static void main(String[] args) {
       
        Predicate<Integer> predicate = number -> number > 18;
        System.out.println(predicate.test(17));
        System.out.println(predicate.test(22));
       
    }
}

Example 3 : Check even number or not using Predicate interface

public class PredicateDemo {
    
    public static void main(String[] args) {
       
        Predicate<Integer> isEven = number -> number % 2 == 0;
        System.out.println("Number 17 is even number : "+ isEven.test(17));
        System.out.println("Number 22 is even number : "+ isEven.test(22));
       
    }
    
}

Output :

Number 17 is even number : false
Number 22 is even number : true

Methods of Predicate :

  1. boolean test() - abstract method
  2. and() - default method
  3. negate() - default method
  4. or() - default method
  5. isEqual() - static method

test :

Evaluates this predicate on the given argument.

and :

Returns a composed predicate that represents a logical AND. When evaluating the composed predicate, if this predicate is false, then the other predicate is not evaluated.

or :

Returns a composed predicate that represents a logical OR. Return true if any condition becomes true in given predicate.

negate :

Returns a predicate that represents the logical negation of this predicate. It is return opposite of given condition.

isEqual :

It returns a predicate that tests if two arguments are equal according to Objects.equals(Object, Object).

Example 4 : Predicate or() method 

import java.util.function.Predicate;
import java.util.List;
import java.util.Arrays;
import java.util.stream.Collectors;

public class PredicateDemo {
    
    public static void main(String[] args) {
       
        List<String> techCompanies = Arrays.asList("Google", "Amazon", "Flipkart", "Apple");

        Predicate<String> predicatenameLength =
              company -> company.length() == 5;

        Predicate<String> predicateEndsWith =
              company -> company.endsWith("le");

        List<String> afterPredicateList = techCompanies.stream()
        .filter(predicatenameLength.or(predicateEndsWith))
        .collect(Collectors.toList());

        System.out.println(afterPredicateList);
       
    }
    
}

Output :

[Google, Amazon, Apple]

In above output, Amazon is return by predicatenameLength and Google and Apple return by predicateEndsWith predicate.

Example 5 : Predicate and() method

public class PredicateDemo {
    
    public static void main(String[] args) {
       
        List<Integer> numbersList =
                  Arrays.asList(1, 2, 3, 4, 5, 6, 7, 8, 9, 10);

        Predicate<Integer> predicteNumberGT3 =
             number -> number > 3;
         Predicate<Integer> predicteNumberLT9 =
              number -> number < 9;

        List<Integer> afterPredicateList = numbersList.stream()
        .filter(predicteNumberGT3.and(predicteNumberLT9))
        .collect(Collectors.toList());
 
        System.out.println(afterPredicateList);
       
    }
    
}

Output :

[4, 5, 6, 7, 8]

In and() predicate, if both condition are satisfy then it return true.

Example 6 : Predicate negate() method

public class PredicateDemo {

    public static void main(String[] args) {

         List<String> techCompanies =
                Arrays.asList("Google", "Amazon", "Flipkart", "Apple");

         Predicate<String> predicatenameLength =
               company -> company.length() == 5;

         List<String> afterPredicateList = techCompanies.stream()
         .filter(predicatenameLength.negate())
         .collect(Collectors.toList());

         System.out.println(afterPredicateList);
    }
}

Output:
[Google, Amazon, Flipkart]

In above example, we are returning companies whose length is == 5, but it is negate() predicate so it is returned opposite of that. means it returns companies whose length is not 5. 

Advantages of  Predicate :-

  • Predicate classes are easy to test and change.
  • Your domain objects remain clean and focused on representing your domain, not your business logic.
  • You optimize the re-usability of your code and, in the end, reduce your maintenance.
  • You separate your business from operational concerns.

 

Other Java 8 articles :


Comments

Post a Comment

Popular posts from this blog

Plus Minus HackerRank Solution in Java | Programming Blog

Java Solution for HackerRank Plus Minus Problem Given an array of integers, calculate the ratios of its elements that are positive , negative , and zero . Print the decimal value of each fraction on a new line with 6 places after the decimal. Example 1 : array = [1, 1, 0, -1, -1] There are N = 5 elements, two positive, two negative and one zero. Their ratios are 2/5 = 0.400000, 2/5 = 0.400000 and 1/5 = 0.200000. Results are printed as:  0.400000 0.400000 0.200000 proportion of positive values proportion of negative values proportion of zeros Example 2 : array = [-4, 3, -9, 0, 4, 1]  There are 3 positive numbers, 2 negative numbers, and 1 zero in array. Following is answer : 3/6 = 0.500000 2/6 = 0.333333 1/6 = 0.166667 Lets see solution Solution 1 import java.io.*; import java.math.*; import java.security.*; import java.text.*; import java.util.*; import java.util.concurrent.*; import java.util.function.*; import java.util.regex.*; import java.util.stream.*; import static jav...

Flipping the Matrix HackerRank Solution in Java with Explanation

Java Solution for Flipping the Matrix | Find Highest Sum of Upper-Left Quadrant of Matrix Problem Description : Sean invented a game involving a 2n * 2n matrix where each cell of the matrix contains an integer. He can reverse any of its rows or columns any number of times. The goal of the game is to maximize the sum of the elements in the n *n submatrix located in the upper-left quadrant of the matrix. Given the initial configurations for q matrices, help Sean reverse the rows and columns of each matrix in the best possible way so that the sum of the elements in the matrix's upper-left quadrant is maximal.  Input : matrix = [[1, 2], [3, 4]] Output : 4 Input : matrix = [[112, 42, 83, 119], [56, 125, 56, 49], [15, 78, 101, 43], [62, 98, 114, 108]] Output : 119 + 114 + 56 + 125 = 414 Full Problem Description : Flipping the Matrix Problem Description   Here we can find solution using following pattern, So simply we have to find Max of same number of box like (1,1,1,1). And ...