@Override public Result<T> map(Result<T> value) throws Exception { // by the triangle listing algorithm we know f1 < f2 if (value.getVertexId0().compareTo(value.getVertexId1()) > 0) { T tempVal = value.getVertexId0(); value.setVertexId0(value.getVertexId1()); if (tempVal.compareTo(value.getVertexId2()) <= 0) { value.setVertexId1(tempVal); } else { value.setVertexId1(value.getVertexId2()); value.setVertexId2(tempVal); } } return value; } }
tmp = value.getVertexId0(); value.setVertexId0(value.getVertexId1()); value.setVertexId1(tmp); tmp = value.getVertexId1(); value.setVertexId1(value.getVertexId2()); value.setVertexId2(tmp); tmp = value.getVertexId0(); value.setVertexId0(value.getVertexId2()); value.setVertexId2(tmp); tmp = value.getVertexId0(); value.setVertexId0(value.getVertexId1()); value.setVertexId1(tmp); tmp = value.getVertexId1(); value.setVertexId1(value.getVertexId2()); value.setVertexId2(tmp);
tmp = value.getVertexId0(); value.setVertexId0(value.getVertexId1()); value.setVertexId1(tmp); tmp = value.getVertexId1(); value.setVertexId1(value.getVertexId2()); value.setVertexId2(tmp); tmp = value.getVertexId0(); value.setVertexId0(value.getVertexId2()); value.setVertexId2(tmp); tmp = value.getVertexId0(); value.setVertexId0(value.getVertexId1()); value.setVertexId1(tmp); tmp = value.getVertexId1(); value.setVertexId1(value.getVertexId2()); value.setVertexId2(tmp);
@Override public Result<T> map(Result<T> value) throws Exception { // by the triangle listing algorithm we know f1 < f2 if (value.getVertexId0().compareTo(value.getVertexId1()) > 0) { T tempVal = value.getVertexId0(); value.setVertexId0(value.getVertexId1()); if (tempVal.compareTo(value.getVertexId2()) <= 0) { value.setVertexId1(tempVal); } else { value.setVertexId1(value.getVertexId2()); value.setVertexId2(tempVal); } } return value; } }
@Override public Result<T> map(Result<T> value) throws Exception { // by the triangle listing algorithm we know f1 < f2 if (value.getVertexId0().compareTo(value.getVertexId1()) > 0) { T tempVal = value.getVertexId0(); value.setVertexId0(value.getVertexId1()); if (tempVal.compareTo(value.getVertexId2()) <= 0) { value.setVertexId1(tempVal); } else { value.setVertexId1(value.getVertexId2()); value.setVertexId2(tempVal); } } return value; } }
@Override public int hashCode() { if (hasher == null) { hasher = new MurmurHash(HASH_SEED); } return hasher.reset() .hash(getVertexId0().hashCode()) .hash(getVertexId1().hashCode()) .hash(getVertexId2().hashCode()) .hash(); } }
@Override public String toString() { return "(" + getVertexId0() + "," + getVertexId1() + "," + getVertexId2() + ")"; }
@Override public void flatMap(TriangleListing.Result<T> value, Collector<Tuple2<T, LongValue>> out) throws Exception { output.f0 = value.getVertexId0(); out.collect(output); output.f0 = value.getVertexId1(); out.collect(output); output.f0 = value.getVertexId2(); out.collect(output); } }
@Override public int hashCode() { if (hasher == null) { hasher = new MurmurHash(HASH_SEED); } return hasher.reset() .hash(getVertexId0().hashCode()) .hash(getVertexId1().hashCode()) .hash(getVertexId2().hashCode()) .hash(); } }
@Override public String toPrintableString() { return "1st vertex ID: " + getVertexId0() + ", 2nd vertex ID: " + getVertexId1() + ", 3rd vertex ID: " + getVertexId2(); }
/** * Format values into a human-readable string. * * @return verbose string */ public String toPrintableString() { return "1st vertex ID: " + getVertexId0() + ", 2nd vertex ID: " + getVertexId1() + ", 3rd vertex ID: " + getVertexId2(); } }
@Override public String toPrintableString() { return "1st vertex ID: " + getVertexId0() + ", 2nd vertex ID: " + getVertexId1() + ", 3rd vertex ID: " + getVertexId2(); }
@Override public Result<T> join(Tuple3<T, T, T> triplet, Tuple2<T, T> edge) throws Exception { output.setVertexId0(triplet.f0); output.setVertexId1(triplet.f1); output.setVertexId2(triplet.f2); return output; } }
@Override public void flatMap(TriangleListing.Result<T> value, Collector<Tuple2<T, LongValue>> out) throws Exception { output.f0 = value.getVertexId0(); out.collect(output); output.f0 = value.getVertexId1(); out.collect(output); output.f0 = value.getVertexId2(); out.collect(output); } }
@Override public Result<T> join(Tuple3<T, T, T> triplet, Tuple2<T, T> edge) throws Exception { output.setVertexId0(triplet.f0); output.setVertexId1(triplet.f1); output.setVertexId2(triplet.f2); return output; } }
@Override public String toString() { return "(" + getVertexId0() + "," + getVertexId1() + "," + getVertexId2() + ")"; }
tmp = value.getVertexId0(); value.setVertexId0(value.getVertexId1()); value.setVertexId1(tmp); tmp = value.getVertexId1(); value.setVertexId1(value.getVertexId2()); value.setVertexId2(tmp); tmp = value.getVertexId0(); value.setVertexId0(value.getVertexId2()); value.setVertexId2(tmp); tmp = value.getVertexId0(); value.setVertexId0(value.getVertexId1()); value.setVertexId1(tmp); tmp = value.getVertexId1(); value.setVertexId1(value.getVertexId2()); value.setVertexId2(tmp);
@Override public void flatMap(TriangleListing.Result<T> value, Collector<Tuple2<T, LongValue>> out) throws Exception { output.f0 = value.getVertexId0(); out.collect(output); output.f0 = value.getVertexId1(); out.collect(output); output.f0 = value.getVertexId2(); out.collect(output); } }
@Override public int hashCode() { if (hasher == null) { hasher = new MurmurHash(HASH_SEED); } return hasher.reset() .hash(getVertexId0().hashCode()) .hash(getVertexId1().hashCode()) .hash(getVertexId2().hashCode()) .hash(); } }
@Override public String toPrintableString() { return "1st vertex ID: " + getVertexId0() + ", 2nd vertex ID: " + getVertexId1() + ", 3rd vertex ID: " + getVertexId2(); }