Packages

c

org.apache.spark.graphx.impl

VertexRDDImpl

class VertexRDDImpl[VD] extends VertexRDD[VD]

Linear Supertypes
VertexRDD[VD], RDD[(VertexId, VD)], Logging, Serializable, Serializable, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. VertexRDDImpl
  2. VertexRDD
  3. RDD
  4. Logging
  5. Serializable
  6. Serializable
  7. AnyRef
  8. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. def ++(other: RDD[(VertexId, VD)]): RDD[(VertexId, VD)]
    Definition Classes
    RDD
  4. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  5. def aggregate[U](zeroValue: U)(seqOp: (U, (VertexId, VD)) ⇒ U, combOp: (U, U) ⇒ U)(implicit arg0: ClassTag[U]): U
    Definition Classes
    RDD
  6. def aggregateUsingIndex[VD2](messages: RDD[(VertexId, VD2)], reduceFunc: (VD2, VD2) ⇒ VD2)(implicit arg0: ClassTag[VD2]): VertexRDD[VD2]

    Aggregates vertices in messages that have the same ids using reduceFunc, returning a VertexRDD co-indexed with this.

    Aggregates vertices in messages that have the same ids using reduceFunc, returning a VertexRDD co-indexed with this.

    messages

    an RDD containing messages to aggregate, where each message is a pair of its target vertex ID and the message data

    reduceFunc

    the associative aggregation function for merging messages to the same vertex

    returns

    a VertexRDD co-indexed with this, containing only vertices that received messages. For those vertices, their values are the result of applying reduceFunc to all received messages.

    Definition Classes
    VertexRDDImpl → VertexRDD
  7. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  8. def barrier(): RDDBarrier[(VertexId, VD)]
    Definition Classes
    RDD
    Annotations
    @Experimental() @Since( "2.4.0" )
  9. def cache(): VertexRDDImpl.this.type

    Persists the vertex partitions at targetStorageLevel, which defaults to MEMORY_ONLY.

    Persists the vertex partitions at targetStorageLevel, which defaults to MEMORY_ONLY.

    Definition Classes
    VertexRDDImpl → RDD
  10. def cartesian[U](other: RDD[U])(implicit arg0: ClassTag[U]): RDD[((VertexId, VD), U)]
    Definition Classes
    RDD
  11. def checkpoint(): Unit
    Definition Classes
    VertexRDDImpl → RDD
  12. def clearDependencies(): Unit
    Attributes
    protected
    Definition Classes
    RDD
  13. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  14. def coalesce(numPartitions: Int, shuffle: Boolean, partitionCoalescer: Option[PartitionCoalescer])(implicit ord: Ordering[(VertexId, VD)]): RDD[(VertexId, VD)]
    Definition Classes
    RDD
  15. def collect[U](f: PartialFunction[(VertexId, VD), U])(implicit arg0: ClassTag[U]): RDD[U]
    Definition Classes
    RDD
  16. def collect(): Array[(VertexId, VD)]
    Definition Classes
    RDD
  17. def compute(part: Partition, context: TaskContext): Iterator[(VertexId, VD)]

    Provides the RDD[(VertexId, VD)] equivalent output.

    Provides the RDD[(VertexId, VD)] equivalent output.

    Definition Classes
    VertexRDD → RDD
  18. def context: SparkContext
    Definition Classes
    RDD
  19. def count(): Long

    The number of vertices in the RDD.

    The number of vertices in the RDD.

    Definition Classes
    VertexRDDImpl → RDD
  20. def countApprox(timeout: Long, confidence: Double): PartialResult[BoundedDouble]
    Definition Classes
    RDD
  21. def countApproxDistinct(relativeSD: Double): Long
    Definition Classes
    RDD
  22. def countApproxDistinct(p: Int, sp: Int): Long
    Definition Classes
    RDD
  23. def countByValue()(implicit ord: Ordering[(VertexId, VD)]): Map[(VertexId, VD), Long]
    Definition Classes
    RDD
  24. def countByValueApprox(timeout: Long, confidence: Double)(implicit ord: Ordering[(VertexId, VD)]): PartialResult[Map[(VertexId, VD), BoundedDouble]]
    Definition Classes
    RDD
  25. final def dependencies: Seq[Dependency[_]]
    Definition Classes
    RDD
  26. def diff(other: VertexRDD[VD]): VertexRDD[VD]

    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.

    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. This is only guaranteed to work if the VertexRDDs share a common ancestor.

    other

    the other VertexRDD with which to diff against.

    Definition Classes
    VertexRDDImpl → VertexRDD
  27. def diff(other: RDD[(VertexId, VD)]): VertexRDD[VD]

    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.

    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. This is only guaranteed to work if the VertexRDDs share a common ancestor.

    other

    the other RDD[(VertexId, VD)] with which to diff against.

    Definition Classes
    VertexRDDImpl → VertexRDD
  28. def distinct(): RDD[(VertexId, VD)]
    Definition Classes
    RDD
  29. def distinct(numPartitions: Int)(implicit ord: Ordering[(VertexId, VD)]): RDD[(VertexId, VD)]
    Definition Classes
    RDD
  30. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  31. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  32. def filter(pred: ((VertexId, VD)) ⇒ Boolean): VertexRDD[VD]

    Restricts the vertex set to the set of vertices satisfying the given predicate.

    Restricts the vertex set to the set of vertices satisfying the given predicate. This operation preserves the index for efficient joins with the original RDD, and it sets bits in the bitmask rather than allocating new memory.

    It is declared and defined here to allow refining the return type from RDD[(VertexId, VD)] to VertexRDD[VD].

    pred

    the user defined predicate, which takes a tuple to conform to the RDD[(VertexId, VD)] interface

    Definition Classes
    VertexRDD → RDD
  33. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  34. def first(): (VertexId, VD)
    Definition Classes
    RDD
  35. def firstParent[U](implicit arg0: ClassTag[U]): RDD[U]
    Attributes
    protected[spark]
    Definition Classes
    RDD
  36. def flatMap[U](f: ((VertexId, VD)) ⇒ TraversableOnce[U])(implicit arg0: ClassTag[U]): RDD[U]
    Definition Classes
    RDD
  37. def fold(zeroValue: (VertexId, VD))(op: ((VertexId, VD), (VertexId, VD)) ⇒ (VertexId, VD)): (VertexId, VD)
    Definition Classes
    RDD
  38. def foreach(f: ((VertexId, VD)) ⇒ Unit): Unit
    Definition Classes
    RDD
  39. def foreachPartition(f: (Iterator[(VertexId, VD)]) ⇒ Unit): Unit
    Definition Classes
    RDD
  40. def getCheckpointFile: Option[String]
    Definition Classes
    VertexRDDImpl → RDD
  41. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  42. def getDependencies: Seq[Dependency[_]]
    Attributes
    protected
    Definition Classes
    RDD
  43. final def getNumPartitions: Int
    Definition Classes
    RDD
    Annotations
    @Since( "1.6.0" )
  44. def getOutputDeterministicLevel: rdd.DeterministicLevel.Value
    Attributes
    protected
    Definition Classes
    RDD
    Annotations
    @DeveloperApi()
  45. def getPartitions: Array[Partition]
    Attributes
    protected
    Definition Classes
    VertexRDD → RDD
  46. def getPreferredLocations(s: Partition): Seq[String]
    Attributes
    protected
    Definition Classes
    VertexRDDImpl → RDD
  47. def getStorageLevel: StorageLevel
    Definition Classes
    VertexRDDImpl → RDD
  48. def glom(): RDD[Array[(VertexId, VD)]]
    Definition Classes
    RDD
  49. def groupBy[K](f: ((VertexId, VD)) ⇒ K, p: Partitioner)(implicit kt: ClassTag[K], ord: Ordering[K]): RDD[(K, Iterable[(VertexId, VD)])]
    Definition Classes
    RDD
  50. def groupBy[K](f: ((VertexId, VD)) ⇒ K, numPartitions: Int)(implicit kt: ClassTag[K]): RDD[(K, Iterable[(VertexId, VD)])]
    Definition Classes
    RDD
  51. def groupBy[K](f: ((VertexId, VD)) ⇒ K)(implicit kt: ClassTag[K]): RDD[(K, Iterable[(VertexId, VD)])]
    Definition Classes
    RDD
  52. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  53. val id: Int
    Definition Classes
    RDD
  54. def initializeLogIfNecessary(isInterpreter: Boolean, silent: Boolean): Boolean
    Attributes
    protected
    Definition Classes
    Logging
  55. def initializeLogIfNecessary(isInterpreter: Boolean): Unit
    Attributes
    protected
    Definition Classes
    Logging
  56. def innerJoin[U, VD2](other: RDD[(VertexId, U)])(f: (VertexId, VD, U) ⇒ VD2)(implicit arg0: ClassTag[U], arg1: ClassTag[VD2]): VertexRDD[VD2]

    Inner joins this VertexRDD with an RDD containing vertex attribute pairs.

    Inner joins this VertexRDD with an RDD containing vertex attribute pairs. If the other RDD is backed by a VertexRDD with the same index then the efficient innerZipJoin implementation is used.

    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 other

    returns

    a VertexRDD co-indexed with this, containing only vertices that appear in both this and other, with values supplied by f

    Definition Classes
    VertexRDDImpl → VertexRDD
  57. def innerZipJoin[U, VD2](other: VertexRDD[U])(f: (VertexId, VD, U) ⇒ VD2)(implicit arg0: ClassTag[U], arg1: ClassTag[VD2]): VertexRDD[VD2]

    Efficiently inner joins this VertexRDD with another VertexRDD sharing the same index.

    Efficiently inner joins this VertexRDD with another VertexRDD sharing the same index. See innerJoin for the behavior of the join.

    Definition Classes
    VertexRDDImpl → VertexRDD
  58. def intersection(other: RDD[(VertexId, VD)], numPartitions: Int): RDD[(VertexId, VD)]
    Definition Classes
    RDD
  59. def intersection(other: RDD[(VertexId, VD)], partitioner: Partitioner)(implicit ord: Ordering[(VertexId, VD)]): RDD[(VertexId, VD)]
    Definition Classes
    RDD
  60. def intersection(other: RDD[(VertexId, VD)]): RDD[(VertexId, VD)]
    Definition Classes
    RDD
  61. lazy val isBarrier_: Boolean
    Attributes
    protected
    Definition Classes
    RDD
    Annotations
    @transient()
  62. def isCheckpointed: Boolean
    Definition Classes
    VertexRDDImpl → RDD
  63. def isEmpty(): Boolean
    Definition Classes
    RDD
  64. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  65. def isTraceEnabled(): Boolean
    Attributes
    protected
    Definition Classes
    Logging
  66. final def iterator(split: Partition, context: TaskContext): Iterator[(VertexId, VD)]
    Definition Classes
    RDD
  67. def keyBy[K](f: ((VertexId, VD)) ⇒ K): RDD[(K, (VertexId, VD))]
    Definition Classes
    RDD
  68. def leftJoin[VD2, VD3](other: RDD[(VertexId, VD2)])(f: (VertexId, VD, Option[VD2]) ⇒ VD3)(implicit arg0: ClassTag[VD2], arg1: ClassTag[VD3]): VertexRDD[VD3]

    Left joins this VertexRDD with an RDD containing vertex attribute pairs.

    Left joins this VertexRDD with an RDD containing vertex attribute pairs. If the other RDD is backed by a VertexRDD with the same index then the efficient leftZipJoin 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.

    VD2

    the attribute type of the other VertexRDD

    VD3

    the attribute type of the resulting VertexRDD

    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.

    returns

    a VertexRDD containing all the vertices in this VertexRDD with the attributes emitted by f.

    Definition Classes
    VertexRDDImpl → VertexRDD
  69. def leftZipJoin[VD2, VD3](other: VertexRDD[VD2])(f: (VertexId, VD, Option[VD2]) ⇒ VD3)(implicit arg0: ClassTag[VD2], arg1: ClassTag[VD3]): VertexRDD[VD3]

    Left joins this RDD with another VertexRDD with the same index.

    Left joins this RDD with another VertexRDD with the same index. This function will fail if both VertexRDDs do not share the same index. The resulting vertex set contains an entry for each vertex in this. If other is missing any vertex in this VertexRDD, f is passed None.

    VD2

    the attribute type of the other VertexRDD

    VD3

    the attribute type of the resulting VertexRDD

    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.

    returns

    a VertexRDD containing the results of f

    Definition Classes
    VertexRDDImpl → VertexRDD
  70. def localCheckpoint(): VertexRDDImpl.this.type
    Definition Classes
    RDD
  71. def log: Logger
    Attributes
    protected
    Definition Classes
    Logging
  72. def logDebug(msg: ⇒ String, throwable: Throwable): Unit
    Attributes
    protected
    Definition Classes
    Logging
  73. def logDebug(msg: ⇒ String): Unit
    Attributes
    protected
    Definition Classes
    Logging
  74. def logError(msg: ⇒ String, throwable: Throwable): Unit
    Attributes
    protected
    Definition Classes
    Logging
  75. def logError(msg: ⇒ String): Unit
    Attributes
    protected
    Definition Classes
    Logging
  76. def logInfo(msg: ⇒ String, throwable: Throwable): Unit
    Attributes
    protected
    Definition Classes
    Logging
  77. def logInfo(msg: ⇒ String): Unit
    Attributes
    protected
    Definition Classes
    Logging
  78. def logName: String
    Attributes
    protected
    Definition Classes
    Logging
  79. def logTrace(msg: ⇒ String, throwable: Throwable): Unit
    Attributes
    protected
    Definition Classes
    Logging
  80. def logTrace(msg: ⇒ String): Unit
    Attributes
    protected
    Definition Classes
    Logging
  81. def logWarning(msg: ⇒ String, throwable: Throwable): Unit
    Attributes
    protected
    Definition Classes
    Logging
  82. def logWarning(msg: ⇒ String): Unit
    Attributes
    protected
    Definition Classes
    Logging
  83. def map[U](f: ((VertexId, VD)) ⇒ U)(implicit arg0: ClassTag[U]): RDD[U]
    Definition Classes
    RDD
  84. def mapPartitions[U](f: (Iterator[(VertexId, VD)]) ⇒ Iterator[U], preservesPartitioning: Boolean)(implicit arg0: ClassTag[U]): RDD[U]
    Definition Classes
    RDD
  85. def mapPartitionsWithIndex[U](f: (Int, Iterator[(VertexId, VD)]) ⇒ Iterator[U], preservesPartitioning: Boolean)(implicit arg0: ClassTag[U]): RDD[U]
    Definition Classes
    RDD
  86. def mapValues[VD2](f: (VertexId, VD) ⇒ VD2)(implicit arg0: ClassTag[VD2]): VertexRDD[VD2]

    Maps each vertex attribute, additionally supplying the vertex ID.

    Maps each vertex attribute, additionally supplying the vertex ID.

    VD2

    the type returned by the map function

    f

    the function applied to each ID-value pair in the RDD

    returns

    a new VertexRDD with values obtained by applying f to each of the entries in the original VertexRDD. The resulting VertexRDD retains the same index.

    Definition Classes
    VertexRDDImpl → VertexRDD
  87. def mapValues[VD2](f: (VD) ⇒ VD2)(implicit arg0: ClassTag[VD2]): VertexRDD[VD2]

    Maps each vertex attribute, preserving the index.

    Maps each vertex attribute, preserving the index.

    VD2

    the type returned by the map function

    f

    the function applied to each value in the RDD

    returns

    a new VertexRDD with values obtained by applying f to each of the entries in the original VertexRDD

    Definition Classes
    VertexRDDImpl → VertexRDD
  88. def max()(implicit ord: Ordering[(VertexId, VD)]): (VertexId, VD)
    Definition Classes
    RDD
  89. def min()(implicit ord: Ordering[(VertexId, VD)]): (VertexId, VD)
    Definition Classes
    RDD
  90. def minus(other: VertexRDD[VD]): VertexRDD[VD]

    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.

    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.

    other

    a VertexRDD to run the set operation against

    Definition Classes
    VertexRDDImpl → VertexRDD
  91. def minus(other: RDD[(VertexId, VD)]): VertexRDD[VD]

    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.

    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.

    other

    an RDD to run the set operation against

    Definition Classes
    VertexRDDImpl → VertexRDD
  92. var name: String
    Definition Classes
    RDD
  93. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  94. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  95. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  96. def parent[U](j: Int)(implicit arg0: ClassTag[U]): RDD[U]
    Attributes
    protected[spark]
    Definition Classes
    RDD
  97. val partitioner: Option[Partitioner]
    Definition Classes
    VertexRDDImpl → RDD
  98. final def partitions: Array[Partition]
    Definition Classes
    RDD
  99. val partitionsRDD: RDD[ShippableVertexPartition[VD]]
    Definition Classes
    VertexRDDImpl → VertexRDD
  100. def persist(newLevel: StorageLevel): VertexRDDImpl.this.type

    Persists the vertex partitions at the specified storage level, ignoring any existing target storage level.

    Persists the vertex partitions at the specified storage level, ignoring any existing target storage level.

    Definition Classes
    VertexRDDImpl → RDD
  101. def persist(): VertexRDDImpl.this.type
    Definition Classes
    RDD
  102. def pipe(command: Seq[String], env: Map[String, String], printPipeContext: ((String) ⇒ Unit) ⇒ Unit, printRDDElement: ((VertexId, VD), (String) ⇒ Unit) ⇒ Unit, separateWorkingDir: Boolean, bufferSize: Int, encoding: String): RDD[String]
    Definition Classes
    RDD
  103. def pipe(command: String, env: Map[String, String]): RDD[String]
    Definition Classes
    RDD
  104. def pipe(command: String): RDD[String]
    Definition Classes
    RDD
  105. final def preferredLocations(split: Partition): Seq[String]
    Definition Classes
    RDD
  106. def randomSplit(weights: Array[Double], seed: Long): Array[RDD[(VertexId, VD)]]
    Definition Classes
    RDD
  107. def reduce(f: ((VertexId, VD), (VertexId, VD)) ⇒ (VertexId, VD)): (VertexId, VD)
    Definition Classes
    RDD
  108. def reindex(): VertexRDD[VD]

    Construct a new VertexRDD that is indexed by only the visible vertices.

    Construct a new VertexRDD that is indexed by only the visible vertices. The resulting VertexRDD will be based on a different index and can no longer be quickly joined with this RDD.

    Definition Classes
    VertexRDDImpl → VertexRDD
  109. def repartition(numPartitions: Int)(implicit ord: Ordering[(VertexId, VD)]): RDD[(VertexId, VD)]
    Definition Classes
    RDD
  110. def reverseRoutingTables(): VertexRDD[VD]

    Returns a new VertexRDD reflecting a reversal of all edge directions in the corresponding EdgeRDD.

    Returns a new VertexRDD reflecting a reversal of all edge directions in the corresponding EdgeRDD.

    Definition Classes
    VertexRDDImpl → VertexRDD
  111. def sample(withReplacement: Boolean, fraction: Double, seed: Long): RDD[(VertexId, VD)]
    Definition Classes
    RDD
  112. def saveAsObjectFile(path: String): Unit
    Definition Classes
    RDD
  113. def saveAsTextFile(path: String, codec: Class[_ <: CompressionCodec]): Unit
    Definition Classes
    RDD
  114. def saveAsTextFile(path: String): Unit
    Definition Classes
    RDD
  115. def setName(_name: String): VertexRDDImpl.this.type
    Definition Classes
    VertexRDDImpl → RDD
  116. def sortBy[K](f: ((VertexId, VD)) ⇒ K, ascending: Boolean, numPartitions: Int)(implicit ord: Ordering[K], ctag: ClassTag[K]): RDD[(VertexId, VD)]
    Definition Classes
    RDD
  117. def sparkContext: SparkContext
    Definition Classes
    RDD
  118. def subtract(other: RDD[(VertexId, VD)], p: Partitioner)(implicit ord: Ordering[(VertexId, VD)]): RDD[(VertexId, VD)]
    Definition Classes
    RDD
  119. def subtract(other: RDD[(VertexId, VD)], numPartitions: Int): RDD[(VertexId, VD)]
    Definition Classes
    RDD
  120. def subtract(other: RDD[(VertexId, VD)]): RDD[(VertexId, VD)]
    Definition Classes
    RDD
  121. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  122. def take(num: Int): Array[(VertexId, VD)]
    Definition Classes
    RDD
  123. def takeOrdered(num: Int)(implicit ord: Ordering[(VertexId, VD)]): Array[(VertexId, VD)]
    Definition Classes
    RDD
  124. def takeSample(withReplacement: Boolean, num: Int, seed: Long): Array[(VertexId, VD)]
    Definition Classes
    RDD
  125. val targetStorageLevel: StorageLevel
  126. def toDebugString: String
    Definition Classes
    RDD
  127. def toJavaRDD(): JavaRDD[(VertexId, VD)]
    Definition Classes
    RDD
  128. def toLocalIterator: Iterator[(VertexId, VD)]
    Definition Classes
    RDD
  129. def toString(): String
    Definition Classes
    RDD → AnyRef → Any
  130. def top(num: Int)(implicit ord: Ordering[(VertexId, VD)]): Array[(VertexId, VD)]
    Definition Classes
    RDD
  131. def treeAggregate[U](zeroValue: U)(seqOp: (U, (VertexId, VD)) ⇒ U, combOp: (U, U) ⇒ U, depth: Int)(implicit arg0: ClassTag[U]): U
    Definition Classes
    RDD
  132. def treeReduce(f: ((VertexId, VD), (VertexId, VD)) ⇒ (VertexId, VD), depth: Int): (VertexId, VD)
    Definition Classes
    RDD
  133. def union(other: RDD[(VertexId, VD)]): RDD[(VertexId, VD)]
    Definition Classes
    RDD
  134. def unpersist(blocking: Boolean = false): VertexRDDImpl.this.type
    Definition Classes
    VertexRDDImpl → RDD
  135. implicit val vdTag: ClassTag[VD]
    Attributes
    protected
    Definition Classes
    VertexRDDImpl → VertexRDD
  136. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  137. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  138. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  139. def withEdges(edges: EdgeRDD[_]): VertexRDD[VD]

    Prepares this VertexRDD for efficient joins with the given EdgeRDD.

    Prepares this VertexRDD for efficient joins with the given EdgeRDD.

    Definition Classes
    VertexRDDImpl → VertexRDD
  140. def zip[U](other: RDD[U])(implicit arg0: ClassTag[U]): RDD[((VertexId, VD), U)]
    Definition Classes
    RDD
  141. def zipPartitions[B, C, D, V](rdd2: RDD[B], rdd3: RDD[C], rdd4: RDD[D])(f: (Iterator[(VertexId, VD)], Iterator[B], Iterator[C], Iterator[D]) ⇒ Iterator[V])(implicit arg0: ClassTag[B], arg1: ClassTag[C], arg2: ClassTag[D], arg3: ClassTag[V]): RDD[V]
    Definition Classes
    RDD
  142. def zipPartitions[B, C, D, V](rdd2: RDD[B], rdd3: RDD[C], rdd4: RDD[D], preservesPartitioning: Boolean)(f: (Iterator[(VertexId, VD)], Iterator[B], Iterator[C], Iterator[D]) ⇒ Iterator[V])(implicit arg0: ClassTag[B], arg1: ClassTag[C], arg2: ClassTag[D], arg3: ClassTag[V]): RDD[V]
    Definition Classes
    RDD
  143. def zipPartitions[B, C, V](rdd2: RDD[B], rdd3: RDD[C])(f: (Iterator[(VertexId, VD)], Iterator[B], Iterator[C]) ⇒ Iterator[V])(implicit arg0: ClassTag[B], arg1: ClassTag[C], arg2: ClassTag[V]): RDD[V]
    Definition Classes
    RDD
  144. def zipPartitions[B, C, V](rdd2: RDD[B], rdd3: RDD[C], preservesPartitioning: Boolean)(f: (Iterator[(VertexId, VD)], Iterator[B], Iterator[C]) ⇒ Iterator[V])(implicit arg0: ClassTag[B], arg1: ClassTag[C], arg2: ClassTag[V]): RDD[V]
    Definition Classes
    RDD
  145. def zipPartitions[B, V](rdd2: RDD[B])(f: (Iterator[(VertexId, VD)], Iterator[B]) ⇒ Iterator[V])(implicit arg0: ClassTag[B], arg1: ClassTag[V]): RDD[V]
    Definition Classes
    RDD
  146. def zipPartitions[B, V](rdd2: RDD[B], preservesPartitioning: Boolean)(f: (Iterator[(VertexId, VD)], Iterator[B]) ⇒ Iterator[V])(implicit arg0: ClassTag[B], arg1: ClassTag[V]): RDD[V]
    Definition Classes
    RDD
  147. def zipWithIndex(): RDD[((VertexId, VD), Long)]
    Definition Classes
    RDD
  148. def zipWithUniqueId(): RDD[((VertexId, VD), Long)]
    Definition Classes
    RDD

Inherited from VertexRDD[VD]

Inherited from RDD[(VertexId, VD)]

Inherited from Logging

Inherited from Serializable

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped