hadoop復合鍵排序使用方法
來源：程序員人生 發布時間：2014-11-06 12:03:41 閱讀次數：2145次
在hadoop中處理復雜業務時，需要用到復合鍵，復合不同于單純的繼承Writable接口，而是繼承了WritableComparable<T>接口，而實際上，WritableComparable<T>接口繼承了Writable和Comparable<T>接口，如果只需要使用某1個類作為傳值對象而不是作為key，繼承Writable接口便可。
上源碼：
public interface WritableComparable<T> extends Writable, Comparable<T> {
}
public interface Writable {
void write(DataOutput out) throws IOException;
void readFields(DataInput in) throws IOException;
}
public interface Comparable<T> {
public int compareTo(T o);
}
以下是實現復合key的實例，親測，可用
public class SortKey implements WritableComparable<SortKey>{
private Text name;
private IntWritable right;
public SortKey() {
set(new Text(), new IntWritable());
}
public SortKey(Text name, IntWritable right) {
set(name, right);
}
private void set(Text name,IntWritable right){
this.name = name;
this.right = right;
}
/**
* @return the name
*/
public Text getName() {
return name;
}
/**
* @param name the name to set
*/
public void setName(Text name) {
this.name = name;
}
/**
* @return the right
*/
public IntWritable getRight() {
return right;
}
/**
* @param right the right to set
*/
public void setRight(IntWritable right) {
this.right = right;
}
@Override
public void write(DataOutput out) throws IOException {
name.write(out);
right.write(out);
}
@Override
public void readFields(DataInput in) throws IOException {
name.readFields(in);
right.readFields(in);
}
@Override
public int compareTo(SortKey o) {
int cmp = name.compareTo(o.name);
if(cmp != 0){
return cmp;
}else{
return right.compareTo(o.right);
}
}
<span style="white-space:pre"> </span>//到目前為止，你只能將其作為key來使用，但是如果你需要依照key的某1個值來排序，以下是重點
static{
WritableComparator.define(SortKey.class, new Comparator());
}
public static class Comparator extends WritableComparator{
private static final Text.Comparator TEXT_COMPARATOR = new Text.Comparator();
protected Comparator() {
super(SortKey.class);
}
/* (non-Javadoc)
* @see org.apache.hadoop.io.WritableComparator#compare(byte[], int, int, byte[], int, int)
*/
@Override
public int compare(byte[] b1, int s1, int l1, byte[] b2, int s2, int l2) {
try{
int firstL1 = WritableUtils.decodeVIntSize(b1[s1]) + readVInt(b1, s1);
int firstL2 = WritableUtils.decodeVIntSize(b2[s2]) + readVInt(b2, s2);
return TEXT_COMPARATOR.compare(b1, s1, firstL1, b2, s2, firstL2);
}catch(Exception e){
throw new IllegalArgumentException(e);
}
}
}
}
生活不易，碼農辛苦
如果您覺得本網站對您的學習有所幫助,可以手機掃描二維碼進行捐贈
