Skip to main content

BiPredicate in Java 8 with examples | test(), and(), or() and negate() methods

What is BiPredicate?

BiPredicate in Java 8 with examples | test(), and(), or() and negate() methods

BiPredicate is same as Predicate, but it accepts two arguments. BiPredicate is Functional interface which accepts two arguments and return boolean value.

BiPredicate contains following methods : 

  1. test() : abstarct method
  2. and() : default method
  3. or() : default method
  4. negate() : default method

So lets see examples of BiPredciate

Example 1 : Check even number using BiPredicate

import java.util.function.BiPredicate;

public class BiPredicateDemo {

    public static void main(String[] args) {
       
        BiPredicate<Integer, Integer> isEven = (number1, number2) -> {
            return (number1 + number2) % 2 == 0;
        };
       
        System.out.println(isEven.test(5, 6));
        System.out.println(isEven.test(5, 5));

    }

}

Output :

false
true

and() method :

and() predicate retruns true when both predicate conditions becomes true. Lets see example of and() method.

Example 2 : BiPredicate and() method

import java.util.function.BiPredicate;

public class BiPredicateDemo {

    public static void main(String[] args) {
    
        BiPredicate<String, String> biPredicate1 = (str1, str2) ->
            str1.length() == str2.length();
       
        BiPredicate<String, String> biPredicate2 = (str1, str2) ->
            str1.equals(str2);
           
        System.out.println(biPredicate1.and(biPredicate2).test("Programming", "programming"));
        System.out.println(biPredicate1.and(biPredicate2).test("Java", "Java"));
           
    }
}

Output :

false
true

In first result, string length is same but it is not equals so it is returning false. In second result, both string are same length and equals so we are getting true as result.

or() method :

or() predicate returns true when one of predicates becomes true.

Example 3 : BiPredicate or() method

import java.util.function.BiPredicate;

public class BiPredicateDemo {

    public static void main(String[] args) {
    
        BiPredicate<String, String> biPredicate1 = (str1, str2) ->
            str1.length() == str2.length();
       
        BiPredicate<String, String> biPredicate2 = (str1, str2) ->
            str1.equals(str2);
           
        System.out.println(biPredicate1.or(biPredicate2).test("Programming", "programming"));
        System.out.println(biPredicate1.or(biPredicate2).test("Java", "Java"));

    }
}

output :

true
true

Example 4 : BiPredicate with Objects

Person.java

public class Person {
    
    String name;
    Integer age;
    
    public Person(String name, Integer age) {
        super();
        this.name = name;
        this.age = age;
    }
    
    public String getName() {
        return name;
    }
    
    public void setName(String name) {
        this.name = name;
    }
    
    public Integer getAge() {
        return age;
    }
    
    public void setAge(Integer age) {
        this.age = age;
    }
    
}

BiPredicateDemo.java

import java.util.Arrays;
import java.util.List;
import java.util.function.BiPredicate;

public class BiPredicateDemo {

    public static void main(String[] args) {
    
        List<Person> personList = Arrays.asList(
            new Person("Person 1" , 22),
            new Person("Person 2" , 40),
            new Person("Person 3" , 18),
            new Person("Person 4" , 34),
            new Person("Person 5" , 25));   

        BiPredicate<Person, Integer> biPredicate1 = (person1, age) -> {
            return  (person1.getAge() > age);
        };
       
       
        for (Person person : personList) {
            System.out.println(person.getName() + " = " + biPredicate1.test(person, 25));
        }     
    
    }
    
}

Output :

Person 1 = false
Person 2 = true
Person 3 = false
Person 4 = true
Person 5 = false


Happy Coding.

Other java 8 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...

Simple Text Editor HackerRank Solution in Java with Explanation

Simple Text Editor HackerRank Solution in Java with Explanation Problem Description : Implement a simple text editor. The editor initially contains an empty string S. Perform Q operations of the following 4 types: append (W) - Append string W to the end of S. delete (k) - Delete the last K characters of S. print (k) - Print the kth character of S. undo () - Undo the last (not previously undone) operation of type 1 or 2, reverting S to the state it was in prior to that operation. Example : Input : S = "abcde" Operations = ["1 fg", "3 6", "2 5", "4", "3 7", "4", "3 4"] index   S          ops[index]    explanation -----   ------     ----------    ----------- 0       abcde      1 fg          append fg 1       abcdefg    3 6        ...