1. /**
    2. * 排序的wordcount程序
    3. * @author Administrator
    4. *
    5. */
    6. public class SortWordCount {
    7. public static void main(String[] args) {
    8. // 创建SparkConf和JavaSparkContext
    9. SparkConf conf = new SparkConf()
    10. .setAppName("SortWordCount")
    11. .setMaster("local");
    12. JavaSparkContext sc = new JavaSparkContext(conf);
    13. // 创建lines RDD
    14. JavaRDD<String> lines = sc.textFile("C://Users//Administrator//Desktop//spark.txt");
    15. // 执行我们之前做过的单词计数
    16. JavaRDD<String> words = lines.flatMap(new FlatMapFunction<String, String>() {
    17. private static final long serialVersionUID = 1L;
    18. @Override
    19. public Iterable<String> call(String t) throws Exception {
    20. return Arrays.asList(t.split(" "));
    21. }
    22. });
    23. JavaPairRDD<String, Integer> pairs = words.mapToPair(
    24. new PairFunction<String, String, Integer>() {
    25. private static final long serialVersionUID = 1L;
    26. @Override
    27. public Tuple2<String, Integer> call(String t) throws Exception {
    28. return new Tuple2<String, Integer>(t, 1);
    29. }
    30. });
    31. JavaPairRDD<String, Integer> wordCounts = pairs.reduceByKey(
    32. new Function2<Integer, Integer, Integer>() {
    33. private static final long serialVersionUID = 1L;
    34. @Override
    35. public Integer call(Integer v1, Integer v2) throws Exception {
    36. return v1 + v2;
    37. }
    38. });
    39. // 到这里为止,就得到了每个单词出现的次数
    40. // 但是,问题是,我们的新需求,是要按照每个单词出现次数的顺序,降序排序
    41. // wordCounts RDD内的元素是什么?应该是这种格式的吧:(hello, 3) (you, 2)
    42. // 我们需要将RDD转换成(3, hello) (2, you)的这种格式,才能根据单词出现次数进行排序把!
    43. // 进行key-value的反转映射
    44. JavaPairRDD<Integer, String> countWords = wordCounts.mapToPair(
    45. new PairFunction<Tuple2<String,Integer>, Integer, String>() {
    46. private static final long serialVersionUID = 1L;
    47. @Override
    48. public Tuple2<Integer, String> call(Tuple2<String, Integer> t)
    49. throws Exception {
    50. return new Tuple2<Integer, String>(t._2, t._1);
    51. }
    52. });
    53. // 按照key进行排序
    54. JavaPairRDD<Integer, String> sortedCountWords = countWords.sortByKey(false);
    55. // 再次将value-key进行反转映射
    56. JavaPairRDD<String, Integer> sortedWordCounts = sortedCountWords.mapToPair(
    57. new PairFunction<Tuple2<Integer,String>, String, Integer>() {
    58. private static final long serialVersionUID = 1L;
    59. @Override
    60. public Tuple2<String, Integer> call(Tuple2<Integer, String> t)
    61. throws Exception {
    62. return new Tuple2<String, Integer>(t._2, t._1);
    63. }
    64. });
    65. // 到此为止,我们获得了按照单词出现次数排序后的单词计数
    66. // 打印出来
    67. sortedWordCounts.foreach(new VoidFunction<Tuple2<String,Integer>>() {
    68. private static final long serialVersionUID = 1L;
    69. @Override
    70. public void call(Tuple2<String, Integer> t) throws Exception {
    71. System.out.println(t._1 + " appears " + t._2 + " times.");
    72. }
    73. });
    74. // 关闭JavaSparkContext
    75. sc.close();
    76. }

    scala 版本

    1. object SortWordCount {
    2. def main(args: Array[String]) {
    3. val conf = new SparkConf()
    4. .setAppName("SortWordCount")
    5. .setMaster("local")
    6. val sc = new SparkContext(conf)
    7. val lines = sc.textFile("C://Users//Administrator//Desktop//spark.txt", 1)
    8. val words = lines.flatMap { line => line.split(" ") }
    9. val pairs = words.map { word => (word, 1) }
    10. val wordCounts = pairs.reduceByKey(_ + _)
    11. val countWords = wordCounts.map(wordCount => (wordCount._2, wordCount._1))
    12. val sortedCountWords = countWords.sortByKey(false)
    13. val sortedWordCounts = sortedCountWords.map(sortedCountWord => (sortedCountWord._2, sortedCountWord._1))
    14. sortedWordCounts.foreach(sortedWordCount => println(
    15. sortedWordCount._1 + " appear " + sortedWordCount._2 + " times."))
    16. }
    17. }