Spark下的TopK实现(Java)

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.Serializable;
import java.util.Arrays;
import java.util.Comparator;
import java.util.HashSet;
import java.util.List;
import java.util.Set;
import java.util.regex.Pattern;
import org.apache.spark.api.java.JavaPairRDD;
import org.apache.spark.api.java.JavaRDD;
import org.apache.spark.api.java.JavaSparkContext;
import org.apache.spark.api.java.function.FlatMapFunction;
import org.apache.spark.api.java.function.Function;
import org.apache.spark.api.java.function.Function2;
import org.apache.spark.api.java.function.PairFunction;

import scala.Tuple2;

/**
 * 
 * @author Liyoung
 * 
 */
public class Topk {

	private static final Pattern SPACE = Pattern.compile("\\s+");

	public static void main(String[] args) throws Exception {
		if (args.length != 3) {
			System.err
					.println("Usage: TopKCountWord <infile> <stopword> <outfile>");
			System.exit(1);
		}

		String inFile = args[0]; // Path of DataSet.
		String stopWordpath = args[1]; // Path of stopWords.
		String outFile = args[2]; // Path of the file of the final result.

		final Set<String> stopWord = new HashSet<>(); // Store all stopWord in a
														// HashSet.
		try (FileReader fr = new FileReader(stopWordpath);
				BufferedReader reader = new BufferedReader(fr);) {
			String line = null;

			// Each line of the file stopWords.txt contains a blank space,so we
			// use a loop to split this blank space;
			while ((line = reader.readLine()) != null) {
				line = line.trim();
				stopWord.add(line);
			}
		} catch (IOException e) {
		}

		JavaSparkContext context = new JavaSparkContext("local", "Topk");

		// Read the DataSet from the HDFS into a JavaRDD;
		JavaRDD<String> lines = context.textFile(inFile);

		/*
		 * Filter all punctuation.
		 */
		JavaRDD<String> words = lines
				.flatMap(new FlatMapFunction<String, String>() {
					private static final long serialVersionUID = 1L;

					@Override
					public Iterable<String> call(String s) {
						s = s.replaceAll("\\pP", " ");
						return Arrays.asList(SPACE.split(s));
					}
				});

		/*
		 * Filter the words contained in stopWords.
		 */
		JavaRDD<String> afterFilter = words
				.filter((new Function<String, Boolean>() {					
					private static final long serialVersionUID = 1L;

					public Boolean call(String w) {
						return !stopWord.contains(w);
					}
				}));

		/*
		 * The process of map, transform the RDD "afterFilter" into a PairRDD,
		 * which consist of <key,value> sets.
		 */
		JavaPairRDD<String, Integer> ones = afterFilter
				.mapToPair(new PairFunction<String, String, Integer>() {
					
					private static final long serialVersionUID = 1L;

					@Override
					public Tuple2<String, Integer> call(String s) {
						return new Tuple2<String, Integer>(s, 1);
					}
				});
		/*
		 * The process of reduce, reduce the value in the key-value pair
		 * produced by the previous step.
		 */
		JavaPairRDD<String, Integer> counts = ones
				.reduceByKey(new Function2<Integer, Integer, Integer>() {
					private static final long serialVersionUID = 1L;

					@Override
					public Integer call(Integer i1, Integer i2) {
						return i1 + i2;
					}
				});

		// Take order and sorts the top 100.
		List<Tuple2<String, Integer>> output = (List<Tuple2<String, Integer>>) counts
				.takeOrdered(101, new TupleComparator());

		/*
		 * Save the result to local file system.
		 */
		try {
			FileWriter fw = new FileWriter(outFile);
			@SuppressWarnings("resource")
			BufferedWriter bw = new BufferedWriter(fw);
			for (int i = 1; i < output.size(); i++) {
				Tuple2<?, ?> tuple = output.get(i);
				bw.write(tuple._1() + "\n");
			}
			bw.flush();
		} catch (IOException e) {

		}
		context.stop();
	}
/**
 * 
 * @author Liyoung
 * The function of this class is to sort a set of tuple.
 */
	public static class TupleComparator implements
			Comparator<Tuple2<String, Integer>>, Serializable {

		private static final long serialVersionUID = 1L;

		@Override
		public int compare(Tuple2<String, Integer> o1,
				Tuple2<String, Integer> o2) {
			return Integer.compare(o2._2(), o1._2());
		}
	}

}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值