zoukankan      html  css  js  c++  java
  • hadoop在eclipse当中如何添加源码?

    [学习笔记]

    /*org.apache.hadoop.mapreduce.Mapper.Context,java.lang.InterruptedException,想看map的源代码,按control,点击,出现Attach Source Code,点击External Location/External File,找到源代码,就在Source目录下,,D:hadoop-2.7.4src
     其中key为此行的开头相对于文件的起始位置,value就是此行的字符文本
      */  public void map(Object key, Text value, Context context) throws IOException, InterruptedException {
                System.out.println("key is 马克-to-win @ 马克java社区 "+key.toString()+" value is "+value.toString());
                StringTokenizer itr = new StringTokenizer(value.toString());
                while (itr.hasMoreTokens()) {
                    word.set(itr.nextToken());
                    context.write(word, one);
                }
            }
        }

        public static class IntSumReducer extends Reducer<Text, IntWritable, Text, IntWritable> {
            private IntWritable result = new IntWritable();
            public void reduce(Text key, Iterable<IntWritable> values, Context context)
                    throws IOException, InterruptedException {
                System.out.println("reduce key is 马克-to-win @ 马克java社区 "+key.toString());
                int sum = 0;
                for (IntWritable val : values) {
                    int valValue=val.get();
                    System.out.println("valValue is"+valValue);
                    sum += valValue ;
                }
                result.set(sum);
                context.write(key, result);
            }
        }


        public static void main(String[] args) throws Exception {
            Configuration conf = new Configuration();
            String[] otherArgs = new GenericOptionsParser(conf, args).getRemainingArgs();
            if (otherArgs.length != 2) {
                System.err.println("Usage: wordcount <in> <out>");
                System.exit(2);
            }
            Job job = new Job(conf, "word count");
            job.setJarByClass(WordCount.class);
            job.setMapperClass(TokenizerMapper.class);

    文章转载自原文:https://blog.csdn.net/qq_44594249/article/details/96110661

  • 相关阅读:
    28. Implement strStr()(KMP字符串匹配算法)
    60. Permutation Sequence(求全排列的第k个排列)
    47. Permutations II (全排列有重复的元素)
    46. Permutations (全排列)
    3. Longest Substring Without Repeating Characters(最长子串,双指针+hash)
    Python 一行代码实现并行
    1. Two Sum
    236. Lowest Common Ancestor of a Binary Tree(最低公共祖先,难理解)
    ssm项目配置多个数据源
    SpringMVC架构实现原理
  • 原文地址:https://www.cnblogs.com/haima1949/p/11444867.html
Copyright © 2011-2022 走看看