public class VertexRDDImpl<VD> extends VertexRDD<VD>
| Modifier and Type | Method and Description |
|---|---|
<VD2> VertexRDD<VD2> |
aggregateUsingIndex(RDD<scala.Tuple2<Object,VD2>> messages,
scala.Function2<VD2,VD2,VD2> reduceFunc,
scala.reflect.ClassTag<VD2> evidence$12)
Aggregates vertices in
messages that have the same ids using reduceFunc, returning a
VertexRDD co-indexed with this. |
VertexRDDImpl<VD> |
cache()
Persists the vertex partitions at `targetStorageLevel`, which defaults to MEMORY_ONLY.
|
void |
checkpoint()
Mark this RDD for checkpointing.
|
long |
count()
The number of vertices in the RDD.
|
VertexRDD<VD> |
diff(RDD<scala.Tuple2<Object,VD>> other)
For each vertex present in both
this and other, diff returns only those vertices with
differing values; for values that are different, keeps the values from other. |
VertexRDD<VD> |
diff(VertexRDD<VD> other)
For each vertex present in both
this and other, diff returns only those vertices with
differing values; for values that are different, keeps the values from other. |
scala.Option<String> |
getCheckpointFile()
Gets the name of the file to which this RDD was checkpointed
|
StorageLevel |
getStorageLevel()
Get the RDD's current storage level, or StorageLevel.NONE if none is set.
|
<U,VD2> VertexRDD<VD2> |
innerJoin(RDD<scala.Tuple2<Object,U>> other,
scala.Function3<Object,VD,U,VD2> f,
scala.reflect.ClassTag<U> evidence$10,
scala.reflect.ClassTag<VD2> evidence$11)
Inner joins this VertexRDD with an RDD containing vertex attribute pairs.
|
<U,VD2> VertexRDD<VD2> |
innerZipJoin(VertexRDD<U> other,
scala.Function3<Object,VD,U,VD2> f,
scala.reflect.ClassTag<U> evidence$8,
scala.reflect.ClassTag<VD2> evidence$9)
Efficiently inner joins this VertexRDD with another VertexRDD sharing the same index.
|
boolean |
isCheckpointed()
Return whether this RDD has been checkpointed or not
|
<VD2,VD3> VertexRDD<VD3> |
leftJoin(RDD<scala.Tuple2<Object,VD2>> other,
scala.Function3<Object,VD,scala.Option<VD2>,VD3> f,
scala.reflect.ClassTag<VD2> evidence$6,
scala.reflect.ClassTag<VD3> evidence$7)
Left joins this VertexRDD with an RDD containing vertex attribute pairs.
|
<VD2,VD3> VertexRDD<VD3> |
leftZipJoin(VertexRDD<VD2> other,
scala.Function3<Object,VD,scala.Option<VD2>,VD3> f,
scala.reflect.ClassTag<VD2> evidence$4,
scala.reflect.ClassTag<VD3> evidence$5)
Left joins this RDD with another VertexRDD with the same index.
|
<VD2> VertexRDD<VD2> |
mapValues(scala.Function1<VD,VD2> f,
scala.reflect.ClassTag<VD2> evidence$2)
Maps each vertex attribute, preserving the index.
|
<VD2> VertexRDD<VD2> |
mapValues(scala.Function2<Object,VD,VD2> f,
scala.reflect.ClassTag<VD2> evidence$3)
Maps each vertex attribute, additionally supplying the vertex ID.
|
VertexRDD<VD> |
minus(RDD<scala.Tuple2<Object,VD>> other)
For each VertexId present in both
this and other, minus will act as a set difference
operation returning only those unique VertexId's present in this. |
VertexRDD<VD> |
minus(VertexRDD<VD> other)
For each VertexId present in both
this and other, minus will act as a set difference
operation returning only those unique VertexId's present in this. |
scala.Option<Partitioner> |
partitioner()
Optionally overridden by subclasses to specify how they are partitioned.
|
RDD<org.apache.spark.graphx.impl.ShippableVertexPartition<VD>> |
partitionsRDD() |
VertexRDDImpl<VD> |
persist(StorageLevel newLevel)
Persists the vertex partitions at the specified storage level, ignoring any existing target
storage level.
|
VertexRDD<VD> |
reindex()
Construct a new VertexRDD that is indexed by only the visible vertices.
|
VertexRDD<VD> |
reverseRoutingTables()
Returns a new
VertexRDD reflecting a reversal of all edge directions in the corresponding
EdgeRDD. |
VertexRDDImpl<VD> |
setName(String _name)
Assign a name to this RDD
|
StorageLevel |
targetStorageLevel() |
VertexRDDImpl<VD> |
unpersist(boolean blocking)
Mark the RDD as non-persistent, and remove all blocks for it from memory and disk.
|
VertexRDD<VD> |
withEdges(EdgeRDD<?> edges)
Prepares this VertexRDD for efficient joins with the given EdgeRDD.
|
apply, apply, apply, compute, filter, fromEdgesaggregate, cartesian, checkpointData, coalesce, collect, collect, context, countApprox, countApproxDistinct, countApproxDistinct, countByValue, countByValueApprox, creationSite, dependencies, distinct, distinct, doubleRDDToDoubleRDDFunctions, filterWith, first, flatMap, flatMapWith, fold, foreach, foreachPartition, foreachWith, glom, groupBy, groupBy, groupBy, id, intersection, intersection, intersection, isEmpty, iterator, keyBy, map, mapPartitions, mapPartitionsWithContext, mapPartitionsWithIndex, mapPartitionsWithSplit, mapWith, max, min, name, numericRDDToDoubleRDDFunctions, partitions, persist, pipe, pipe, pipe, preferredLocations, randomSplit, rddToAsyncRDDActions, rddToOrderedRDDFunctions, rddToPairRDDFunctions, rddToSequenceFileRDDFunctions, reduce, repartition, sample, saveAsObjectFile, saveAsTextFile, saveAsTextFile, scope, sortBy, sparkContext, subtract, subtract, subtract, take, takeOrdered, takeSample, toArray, toDebugString, toJavaRDD, toLocalIterator, top, toString, treeAggregate, treeReduce, union, zip, zipPartitions, zipPartitions, zipPartitions, zipPartitions, zipPartitions, zipPartitions, zipWithIndex, zipWithUniqueIdinitializeIfNecessary, initializeLogging, isTraceEnabled, log_, log, logDebug, logDebug, logError, logError, logInfo, logInfo, logName, logTrace, logTrace, logWarning, logWarningpublic StorageLevel targetStorageLevel()
public VertexRDD<VD> reindex()
VertexRDDpublic scala.Option<Partitioner> partitioner()
RDDpartitioner in class RDD<scala.Tuple2<Object,VD>>public VertexRDDImpl<VD> setName(String _name)
RDDpublic VertexRDDImpl<VD> persist(StorageLevel newLevel)
public VertexRDDImpl<VD> unpersist(boolean blocking)
RDDpublic VertexRDDImpl<VD> cache()
public StorageLevel getStorageLevel()
RDDgetStorageLevel in class RDD<scala.Tuple2<Object,VD>>public void checkpoint()
RDDcheckpoint in class RDD<scala.Tuple2<Object,VD>>public boolean isCheckpointed()
RDDisCheckpointed in class RDD<scala.Tuple2<Object,VD>>public scala.Option<String> getCheckpointFile()
RDDgetCheckpointFile in class RDD<scala.Tuple2<Object,VD>>public long count()
public <VD2> VertexRDD<VD2> mapValues(scala.Function1<VD,VD2> f, scala.reflect.ClassTag<VD2> evidence$2)
VertexRDDpublic <VD2> VertexRDD<VD2> mapValues(scala.Function2<Object,VD,VD2> f, scala.reflect.ClassTag<VD2> evidence$3)
VertexRDDpublic VertexRDD<VD> minus(RDD<scala.Tuple2<Object,VD>> other)
VertexRDDthis and other, minus will act as a set difference
operation returning only those unique VertexId's present in this.
public VertexRDD<VD> minus(VertexRDD<VD> other)
VertexRDDthis and other, minus will act as a set difference
operation returning only those unique VertexId's present in this.
public VertexRDD<VD> diff(RDD<scala.Tuple2<Object,VD>> other)
VertexRDDthis and other, diff returns only those vertices with
differing values; for values that are different, keeps the values from other. This is
only guaranteed to work if the VertexRDDs share a common ancestor.
public VertexRDD<VD> diff(VertexRDD<VD> other)
VertexRDDthis and other, diff returns only those vertices with
differing values; for values that are different, keeps the values from other. This is
only guaranteed to work if the VertexRDDs share a common ancestor.
public <VD2,VD3> VertexRDD<VD3> leftZipJoin(VertexRDD<VD2> other, scala.Function3<Object,VD,scala.Option<VD2>,VD3> f, scala.reflect.ClassTag<VD2> evidence$4, scala.reflect.ClassTag<VD3> evidence$5)
VertexRDDthis.
If other is missing any vertex in this VertexRDD, f is passed None.
leftZipJoin in class VertexRDD<VD>other - the other VertexRDD with which to join.f - the function mapping a vertex id and its attributes in this and the other vertex set
to a new vertex attribute.evidence$4 - (undocumented)evidence$5 - (undocumented)fpublic <VD2,VD3> VertexRDD<VD3> leftJoin(RDD<scala.Tuple2<Object,VD2>> other, scala.Function3<Object,VD,scala.Option<VD2>,VD3> f, scala.reflect.ClassTag<VD2> evidence$6, scala.reflect.ClassTag<VD3> evidence$7)
VertexRDDleftZipJoin implementation is
used. The resulting VertexRDD contains an entry for each vertex in this. If other is
missing any vertex in this VertexRDD, f is passed None. If there are duplicates,
the vertex is picked arbitrarily.
leftJoin in class VertexRDD<VD>other - the other VertexRDD with which to joinf - the function mapping a vertex id and its attributes in this and the other vertex set
to a new vertex attribute.evidence$6 - (undocumented)evidence$7 - (undocumented)f.public <U,VD2> VertexRDD<VD2> innerZipJoin(VertexRDD<U> other, scala.Function3<Object,VD,U,VD2> f, scala.reflect.ClassTag<U> evidence$8, scala.reflect.ClassTag<VD2> evidence$9)
VertexRDDinnerJoin for the behavior of the join.innerZipJoin in class VertexRDD<VD>other - (undocumented)f - (undocumented)evidence$8 - (undocumented)evidence$9 - (undocumented)public <U,VD2> VertexRDD<VD2> innerJoin(RDD<scala.Tuple2<Object,U>> other, scala.Function3<Object,VD,U,VD2> f, scala.reflect.ClassTag<U> evidence$10, scala.reflect.ClassTag<VD2> evidence$11)
VertexRDDinnerZipJoin implementation
is used.
innerJoin in class VertexRDD<VD>other - an RDD containing vertices to join. If there are multiple entries for the same
vertex, one is picked arbitrarily. Use aggregateUsingIndex to merge multiple entries.f - the join function applied to corresponding values of this and otherevidence$10 - (undocumented)evidence$11 - (undocumented)this, containing only vertices that appear in both
this and other, with values supplied by fpublic <VD2> VertexRDD<VD2> aggregateUsingIndex(RDD<scala.Tuple2<Object,VD2>> messages, scala.Function2<VD2,VD2,VD2> reduceFunc, scala.reflect.ClassTag<VD2> evidence$12)
VertexRDDmessages that have the same ids using reduceFunc, returning a
VertexRDD co-indexed with this.
aggregateUsingIndex in class VertexRDD<VD>messages - an RDD containing messages to aggregate, where each message is a pair of its
target vertex ID and the message datareduceFunc - the associative aggregation function for merging messages to the same vertexevidence$12 - (undocumented)this, containing only vertices that received messages.
For those vertices, their values are the result of applying reduceFunc to all received
messages.public VertexRDD<VD> reverseRoutingTables()
VertexRDDVertexRDD reflecting a reversal of all edge directions in the corresponding
EdgeRDD.reverseRoutingTables in class VertexRDD<VD>