Neo Stream Search Java Challenge

Understanding the mechanics of the functional interface Predicate of a Stream is crucial if you want to create something meaningful with streams. On this challenge, we will explore important key methods when we work with a stream so that it becomes clear for you what they do.

Without further ado, let’s go to the Java Challenge!

It’s time to improve your Java skills with this Neo Stream Search Challenge

Neo Stream Search Challenge

What do you think will happen when running the following code?

import java.util.List;
import java.util.function.Predicate;

public class NeoSearch {

    public static void main(String... doYourBest) {
        List<String> ls = List.of("Neo", "Morpheus", "Oracle", "Trinity", "Neo");

        Predicate<String> neoSearch = str -> {
            System.out.println("Agent Smith is looking for Neo...");
            return str.contains("Neo");
        };

        var binaryNumbers = List.of(1, 0, 1, 1).stream();
        Integer binarySum = binaryNumbers.reduce(Integer::sum).orElseThrow(StackOverflowError::new);

        boolean neoFound = ls.stream().filter(str -> str.length() >= binarySum).allMatch(neoSearch);
        System.out.println(neoFound);
    }

}

A) Agent Smith is looking for Neo…​

false

B) Agent Smith is looking for Neo…​

Agent Smith is looking for Neo…​

false

C) Agent Smith is looking for Neo…​

true

D) Agent Smith is looking for Neo…​

Agent Smith is looking for Neo…​

Agent Smith is looking for Neo…​

Agent Smith is looking for Neo…​

Agent Smith is looking for Neo…​

true

Explanation:

Here we are simply defining what is the Predicate condition with a Lambda:

Predicate neoSearch = str -> {
  System.out.println("Agent Smith is looking for Neo...");
  return str.contains("Neo");
};

Then we are reducing our List from 1, 0, 1 and 1 to 3 because we are adding all elements basically:

var binaryNumbers = List.of(1, 0, 1, 1).stream();
Integer binarySum = binaryNumbers.reduce(Integer::sum)
.orElseThrow(StackOverflowError::new);

Then here we filter all elements that have the size greater or equals to binarySum and then we use the allMatch function. Note that this function has to have all elements matching to return true. Since the first element is true, the allMatch method from the Stream will go to the next element printing again “Agent Smith is looking for Neo…​”, as this method requires all elements to be true, there is no point in continuing the looping so the looping will break.

boolean neoFound = ls.stream().filter(str -> str.length() >= binarySum).allMatch(neoSearch);
System.out.println(neoFound);

To conclude, the output will be:

B) Agent Smith is looking for Neo...
    Agent Smith is looking for Neo...
    false

To fully understand this Java Challenge, you can also watch the FULL explanation video:

That’s it challenger! Keep it up with your Java learning and keep solving the Java Challenges! To see the original article, check it out the following link:
https://javachallengers.com/neo-stream-search-java-challenge/