com.hazelcast.jet.examples.wordcount.WordCount Maven / Gradle / Ivy
/*
* Copyright (c) 2008-2019, Hazelcast, Inc. All Rights Reserved.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package com.hazelcast.jet.examples.wordcount;
import com.hazelcast.core.IMap;
import com.hazelcast.jet.Jet;
import com.hazelcast.jet.JetInstance;
import com.hazelcast.jet.pipeline.Pipeline;
import com.hazelcast.jet.pipeline.Sinks;
import com.hazelcast.jet.pipeline.Sources;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.HashMap;
import java.util.Map;
import java.util.Map.Entry;
import java.util.concurrent.TimeUnit;
import java.util.regex.Pattern;
import static com.hazelcast.jet.Traversers.traverseArray;
import static com.hazelcast.jet.aggregate.AggregateOperations.counting;
import static com.hazelcast.jet.function.Functions.wholeItem;
import static java.util.Comparator.comparingLong;
/**
* Demonstrates a simple Word Count job in the Pipeline API. Inserts the
* text of The Complete Works of William Shakespeare into a Hazelcast
* IMap, then lets Jet count the words in it and write its findings to
* another IMap. The example looks at Jet's output and prints the 100 most
* frequent words.
*/
public class WordCount {
private static final String BOOK_LINES = "bookLines";
private static final String COUNTS = "counts";
private JetInstance jet;
private static Pipeline buildPipeline() {
Pattern delimiter = Pattern.compile("\\W+");
Pipeline p = Pipeline.create();
p.drawFrom(Sources.map(BOOK_LINES))
.flatMap(e -> traverseArray(delimiter.split(e.getValue().toLowerCase())))
.filter(word -> !word.isEmpty())
.groupingKey(wholeItem())
.aggregate(counting())
.drainTo(Sinks.map(COUNTS));
return p;
}
public static void main(String[] args) {
new WordCount().go();
}
/**
* This code illustrates a few more things about Jet, new in 0.5. See comments.
*/
private void go() {
try {
setup();
System.out.print("\nCounting words... ");
long start = System.nanoTime();
Pipeline p = buildPipeline();
jet.newJob(p).join();
System.out.print("done in " + TimeUnit.NANOSECONDS.toMillis(System.nanoTime() - start) + " milliseconds.");
printResults();
IMap counts = jet.getMap(COUNTS);
if (counts.get("the") != 27_843) {
throw new AssertionError("Wrong count of 'the'");
}
System.out.println("Count of 'the' is valid");
} finally {
Jet.shutdownAll();
}
}
private void setup() {
System.out.println("Creating Jet instance 1");
jet = Jet.newJetInstance();
System.out.println("Creating Jet instance 2");
Jet.newJetInstance();
System.out.println("Loading The Complete Works of William Shakespeare");
try {
long[] lineNum = {0};
Map bookLines = new HashMap<>();
InputStream stream = getClass().getResourceAsStream("/books/shakespeare-complete-works.txt");
try (BufferedReader reader = new BufferedReader(new InputStreamReader(stream))) {
reader.lines().forEach(line -> bookLines.put(++lineNum[0], line));
}
jet.getMap(BOOK_LINES).putAll(bookLines);
} catch (IOException e) {
throw new RuntimeException(e);
}
}
private void printResults() {
final int limit = 100;
System.out.format(" Top %d entries are:%n", limit);
final Map counts = jet.getMap(COUNTS);
System.out.println("/-------+---------\\");
System.out.println("| Count | Word |");
System.out.println("|-------+---------|");
counts.entrySet().stream()
.sorted(comparingLong(Entry::getValue).reversed())
.limit(limit)
.forEach(e -> System.out.format("|%6d | %-8s|%n", e.getValue(), e.getKey()));
System.out.println("\\-------+---------/");
}
}