com.alexholmes.hadooputils.sort.TextArrayWritable.java Source code

Introduction

Here is the source code for com.alexholmes.hadooputils.sort.TextArrayWritable.java

Source

/*
 * Copyright 2014 Mark Cusack
 *
 * 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.alexholmes.hadooputils.sort;

import org.apache.hadoop.io.Writable;
import org.apache.hadoop.io.ArrayWritable;
import org.apache.hadoop.io.Text;
import org.apache.hadoop.io.WritableComparable;

public class TextArrayWritable extends ArrayWritable implements WritableComparable<TextArrayWritable> {

    public TextArrayWritable() {
        super(Text.class);
    }

    public int compareTo(TextArrayWritable o) {
        Writable[] theseTexts = get();
        Writable[] thoseTexts = o.get();
        int len = Math.min(theseTexts.length, thoseTexts.length);
        for (int i = 0; i < len; i++) {
            Text thisText = (Text) theseTexts[i];
            Text thatText = (Text) thoseTexts[i];
            int comp = thisText.compareTo(thatText);
            if (comp != 0) {
                return comp;
            }
        }
        return 0;
    }

    public int hashCode() {
        final int prime = 31;
        int result = 1;
        String[] theseStrings = toStrings();
        for (int i = 0; i < theseStrings.length; i++) {
            result = result * prime + theseStrings[i].hashCode();
        }
        return result;
    }
}