Packages

class EdgeRDDImpl[ED, VD] extends EdgeRDD[ED]

Linear Supertypes
EdgeRDD[ED], RDD[Edge[ED]], Logging, Serializable, Serializable, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. EdgeRDDImpl
  2. EdgeRDD
  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[Edge[ED]]): RDD[Edge[ED]]
    Definition Classes
    RDD
  4. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  5. def aggregate[U](zeroValue: U)(seqOp: (U, Edge[ED]) ⇒ U, combOp: (U, U) ⇒ U)(implicit arg0: ClassTag[U]): U
    Definition Classes
    RDD
  6. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  7. def barrier(): RDDBarrier[Edge[ED]]
    Definition Classes
    RDD
    Annotations
    @Experimental() @Since( "2.4.0" )
  8. def cache(): EdgeRDDImpl.this.type

    Persists the edge partitions using targetStorageLevel, which defaults to MEMORY_ONLY.

    Persists the edge partitions using targetStorageLevel, which defaults to MEMORY_ONLY.

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

    The number of edges in the RDD.

    The number of edges in the RDD.

    Definition Classes
    EdgeRDDImpl → RDD
  19. def countApprox(timeout: Long, confidence: Double): PartialResult[BoundedDouble]
    Definition Classes
    RDD
  20. def countApproxDistinct(relativeSD: Double): Long
    Definition Classes
    RDD
  21. def countApproxDistinct(p: Int, sp: Int): Long
    Definition Classes
    RDD
  22. def countByValue()(implicit ord: Ordering[Edge[ED]]): Map[Edge[ED], Long]
    Definition Classes
    RDD
  23. def countByValueApprox(timeout: Long, confidence: Double)(implicit ord: Ordering[Edge[ED]]): PartialResult[Map[Edge[ED], BoundedDouble]]
    Definition Classes
    RDD
  24. final def dependencies: Seq[Dependency[_]]
    Definition Classes
    RDD
  25. def distinct(): RDD[Edge[ED]]
    Definition Classes
    RDD
  26. def distinct(numPartitions: Int)(implicit ord: Ordering[Edge[ED]]): RDD[Edge[ED]]
    Definition Classes
    RDD
  27. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  28. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  29. def filter(epred: (EdgeTriplet[VD, ED]) ⇒ Boolean, vpred: (VertexId, VD) ⇒ Boolean): EdgeRDDImpl[ED, VD]
  30. def filter(f: (Edge[ED]) ⇒ Boolean): RDD[Edge[ED]]
    Definition Classes
    RDD
  31. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  32. def first(): Edge[ED]
    Definition Classes
    RDD
  33. def firstParent[U](implicit arg0: ClassTag[U]): RDD[U]
    Attributes
    protected[spark]
    Definition Classes
    RDD
  34. def flatMap[U](f: (Edge[ED]) ⇒ TraversableOnce[U])(implicit arg0: ClassTag[U]): RDD[U]
    Definition Classes
    RDD
  35. def fold(zeroValue: Edge[ED])(op: (Edge[ED], Edge[ED]) ⇒ Edge[ED]): Edge[ED]
    Definition Classes
    RDD
  36. def foreach(f: (Edge[ED]) ⇒ Unit): Unit
    Definition Classes
    RDD
  37. def foreachPartition(f: (Iterator[Edge[ED]]) ⇒ Unit): Unit
    Definition Classes
    RDD
  38. def getCheckpointFile: Option[String]
    Definition Classes
    EdgeRDDImpl → RDD
  39. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  40. def getDependencies: Seq[Dependency[_]]
    Attributes
    protected
    Definition Classes
    RDD
  41. final def getNumPartitions: Int
    Definition Classes
    RDD
    Annotations
    @Since( "1.6.0" )
  42. def getOutputDeterministicLevel: rdd.DeterministicLevel.Value
    Attributes
    protected
    Definition Classes
    RDD
    Annotations
    @DeveloperApi()
  43. def getPartitions: Array[Partition]
    Attributes
    protected
    Definition Classes
    EdgeRDD → RDD
  44. def getPreferredLocations(split: Partition): Seq[String]
    Attributes
    protected
    Definition Classes
    RDD
  45. def getStorageLevel: StorageLevel
    Definition Classes
    EdgeRDDImpl → RDD
  46. def glom(): RDD[Array[Edge[ED]]]
    Definition Classes
    RDD
  47. def groupBy[K](f: (Edge[ED]) ⇒ K, p: Partitioner)(implicit kt: ClassTag[K], ord: Ordering[K]): RDD[(K, Iterable[Edge[ED]])]
    Definition Classes
    RDD
  48. def groupBy[K](f: (Edge[ED]) ⇒ K, numPartitions: Int)(implicit kt: ClassTag[K]): RDD[(K, Iterable[Edge[ED]])]
    Definition Classes
    RDD
  49. def groupBy[K](f: (Edge[ED]) ⇒ K)(implicit kt: ClassTag[K]): RDD[(K, Iterable[Edge[ED]])]
    Definition Classes
    RDD
  50. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  51. val id: Int
    Definition Classes
    RDD
  52. def initializeLogIfNecessary(isInterpreter: Boolean, silent: Boolean): Boolean
    Attributes
    protected
    Definition Classes
    Logging
  53. def initializeLogIfNecessary(isInterpreter: Boolean): Unit
    Attributes
    protected
    Definition Classes
    Logging
  54. def innerJoin[ED2, ED3](other: EdgeRDD[ED2])(f: (VertexId, VertexId, ED, ED2) ⇒ ED3)(implicit arg0: ClassTag[ED2], arg1: ClassTag[ED3]): EdgeRDDImpl[ED3, VD]

    Inner joins this EdgeRDD with another EdgeRDD, assuming both are partitioned using the same PartitionStrategy.

    Inner joins this EdgeRDD with another EdgeRDD, assuming both are partitioned using the same PartitionStrategy.

    other

    the EdgeRDD to join with

    f

    the join function applied to corresponding values of this and other

    returns

    a new EdgeRDD containing only edges that appear in both this and other, with values supplied by f

    Definition Classes
    EdgeRDDImpl → EdgeRDD
  55. def intersection(other: RDD[Edge[ED]], numPartitions: Int): RDD[Edge[ED]]
    Definition Classes
    RDD
  56. def intersection(other: RDD[Edge[ED]], partitioner: Partitioner)(implicit ord: Ordering[Edge[ED]]): RDD[Edge[ED]]
    Definition Classes
    RDD
  57. def intersection(other: RDD[Edge[ED]]): RDD[Edge[ED]]
    Definition Classes
    RDD
  58. lazy val isBarrier_: Boolean
    Attributes
    protected
    Definition Classes
    RDD
    Annotations
    @transient()
  59. def isCheckpointed: Boolean
    Definition Classes
    EdgeRDDImpl → RDD
  60. def isEmpty(): Boolean
    Definition Classes
    RDD
  61. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  62. def isTraceEnabled(): Boolean
    Attributes
    protected
    Definition Classes
    Logging
  63. final def iterator(split: Partition, context: TaskContext): Iterator[Edge[ED]]
    Definition Classes
    RDD
  64. def keyBy[K](f: (Edge[ED]) ⇒ K): RDD[(K, Edge[ED])]
    Definition Classes
    RDD
  65. def localCheckpoint(): EdgeRDDImpl.this.type
    Definition Classes
    RDD
  66. def log: Logger
    Attributes
    protected
    Definition Classes
    Logging
  67. def logDebug(msg: ⇒ String, throwable: Throwable): Unit
    Attributes
    protected
    Definition Classes
    Logging
  68. def logDebug(msg: ⇒ String): Unit
    Attributes
    protected
    Definition Classes
    Logging
  69. def logError(msg: ⇒ String, throwable: Throwable): Unit
    Attributes
    protected
    Definition Classes
    Logging
  70. def logError(msg: ⇒ String): Unit
    Attributes
    protected
    Definition Classes
    Logging
  71. def logInfo(msg: ⇒ String, throwable: Throwable): Unit
    Attributes
    protected
    Definition Classes
    Logging
  72. def logInfo(msg: ⇒ String): Unit
    Attributes
    protected
    Definition Classes
    Logging
  73. def logName: String
    Attributes
    protected
    Definition Classes
    Logging
  74. def logTrace(msg: ⇒ String, throwable: Throwable): Unit
    Attributes
    protected
    Definition Classes
    Logging
  75. def logTrace(msg: ⇒ String): Unit
    Attributes
    protected
    Definition Classes
    Logging
  76. def logWarning(msg: ⇒ String, throwable: Throwable): Unit
    Attributes
    protected
    Definition Classes
    Logging
  77. def logWarning(msg: ⇒ String): Unit
    Attributes
    protected
    Definition Classes
    Logging
  78. def map[U](f: (Edge[ED]) ⇒ U)(implicit arg0: ClassTag[U]): RDD[U]
    Definition Classes
    RDD
  79. def mapEdgePartitions[ED2, VD2](f: (PartitionID, EdgePartition[ED, VD]) ⇒ EdgePartition[ED2, VD2])(implicit arg0: ClassTag[ED2], arg1: ClassTag[VD2]): EdgeRDDImpl[ED2, VD2]
  80. def mapPartitions[U](f: (Iterator[Edge[ED]]) ⇒ Iterator[U], preservesPartitioning: Boolean)(implicit arg0: ClassTag[U]): RDD[U]
    Definition Classes
    RDD
  81. def mapPartitionsWithIndex[U](f: (Int, Iterator[Edge[ED]]) ⇒ Iterator[U], preservesPartitioning: Boolean)(implicit arg0: ClassTag[U]): RDD[U]
    Definition Classes
    RDD
  82. def mapValues[ED2](f: (Edge[ED]) ⇒ ED2)(implicit arg0: ClassTag[ED2]): EdgeRDDImpl[ED2, VD]

    Map the values in an edge partitioning preserving the structure but changing the values.

    Map the values in an edge partitioning preserving the structure but changing the values.

    ED2

    the new edge value type

    f

    the function from an edge to a new edge value

    returns

    a new EdgeRDD containing the new edge values

    Definition Classes
    EdgeRDDImpl → EdgeRDD
  83. def max()(implicit ord: Ordering[Edge[ED]]): Edge[ED]
    Definition Classes
    RDD
  84. def min()(implicit ord: Ordering[Edge[ED]]): Edge[ED]
    Definition Classes
    RDD
  85. var name: String
    Definition Classes
    RDD
  86. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  87. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  88. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  89. def parent[U](j: Int)(implicit arg0: ClassTag[U]): RDD[U]
    Attributes
    protected[spark]
    Definition Classes
    RDD
  90. val partitioner: Option[Partitioner]

    If partitionsRDD already has a partitioner, use it.

    If partitionsRDD already has a partitioner, use it. Otherwise assume that the PartitionIDs in partitionsRDD correspond to the actual partitions and create a new partitioner that allows co-partitioning with partitionsRDD.

    Definition Classes
    EdgeRDDImpl → RDD
  91. final def partitions: Array[Partition]
    Definition Classes
    RDD
  92. val partitionsRDD: RDD[(PartitionID, EdgePartition[ED, VD])]
    Definition Classes
    EdgeRDDImpl → EdgeRDD
  93. def persist(newLevel: StorageLevel): EdgeRDDImpl.this.type

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

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

    Definition Classes
    EdgeRDDImpl → RDD
  94. def persist(): EdgeRDDImpl.this.type
    Definition Classes
    RDD
  95. def pipe(command: Seq[String], env: Map[String, String], printPipeContext: ((String) ⇒ Unit) ⇒ Unit, printRDDElement: (Edge[ED], (String) ⇒ Unit) ⇒ Unit, separateWorkingDir: Boolean, bufferSize: Int, encoding: String): RDD[String]
    Definition Classes
    RDD
  96. def pipe(command: String, env: Map[String, String]): RDD[String]
    Definition Classes
    RDD
  97. def pipe(command: String): RDD[String]
    Definition Classes
    RDD
  98. final def preferredLocations(split: Partition): Seq[String]
    Definition Classes
    RDD
  99. def randomSplit(weights: Array[Double], seed: Long): Array[RDD[Edge[ED]]]
    Definition Classes
    RDD
  100. def reduce(f: (Edge[ED], Edge[ED]) ⇒ Edge[ED]): Edge[ED]
    Definition Classes
    RDD
  101. def repartition(numPartitions: Int)(implicit ord: Ordering[Edge[ED]]): RDD[Edge[ED]]
    Definition Classes
    RDD
  102. def reverse: EdgeRDDImpl[ED, VD]

    Reverse all the edges in this RDD.

    Reverse all the edges in this RDD.

    returns

    a new EdgeRDD containing all the edges reversed

    Definition Classes
    EdgeRDDImpl → EdgeRDD
  103. def sample(withReplacement: Boolean, fraction: Double, seed: Long): RDD[Edge[ED]]
    Definition Classes
    RDD
  104. def saveAsObjectFile(path: String): Unit
    Definition Classes
    RDD
  105. def saveAsTextFile(path: String, codec: Class[_ <: CompressionCodec]): Unit
    Definition Classes
    RDD
  106. def saveAsTextFile(path: String): Unit
    Definition Classes
    RDD
  107. def setName(_name: String): EdgeRDDImpl.this.type
    Definition Classes
    EdgeRDDImpl → RDD
  108. def sortBy[K](f: (Edge[ED]) ⇒ K, ascending: Boolean, numPartitions: Int)(implicit ord: Ordering[K], ctag: ClassTag[K]): RDD[Edge[ED]]
    Definition Classes
    RDD
  109. def sparkContext: SparkContext
    Definition Classes
    RDD
  110. def subtract(other: RDD[Edge[ED]], p: Partitioner)(implicit ord: Ordering[Edge[ED]]): RDD[Edge[ED]]
    Definition Classes
    RDD
  111. def subtract(other: RDD[Edge[ED]], numPartitions: Int): RDD[Edge[ED]]
    Definition Classes
    RDD
  112. def subtract(other: RDD[Edge[ED]]): RDD[Edge[ED]]
    Definition Classes
    RDD
  113. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  114. def take(num: Int): Array[Edge[ED]]
    Definition Classes
    RDD
  115. def takeOrdered(num: Int)(implicit ord: Ordering[Edge[ED]]): Array[Edge[ED]]
    Definition Classes
    RDD
  116. def takeSample(withReplacement: Boolean, num: Int, seed: Long): Array[Edge[ED]]
    Definition Classes
    RDD
  117. val targetStorageLevel: StorageLevel
  118. def toDebugString: String
    Definition Classes
    RDD
  119. def toJavaRDD(): JavaRDD[Edge[ED]]
    Definition Classes
    RDD
  120. def toLocalIterator: Iterator[Edge[ED]]
    Definition Classes
    RDD
  121. def toString(): String
    Definition Classes
    RDD → AnyRef → Any
  122. def top(num: Int)(implicit ord: Ordering[Edge[ED]]): Array[Edge[ED]]
    Definition Classes
    RDD
  123. def treeAggregate[U](zeroValue: U)(seqOp: (U, Edge[ED]) ⇒ U, combOp: (U, U) ⇒ U, depth: Int)(implicit arg0: ClassTag[U]): U
    Definition Classes
    RDD
  124. def treeReduce(f: (Edge[ED], Edge[ED]) ⇒ Edge[ED], depth: Int): Edge[ED]
    Definition Classes
    RDD
  125. def union(other: RDD[Edge[ED]]): RDD[Edge[ED]]
    Definition Classes
    RDD
  126. def unpersist(blocking: Boolean = false): EdgeRDDImpl.this.type
    Definition Classes
    EdgeRDDImpl → RDD
  127. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  128. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  129. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  130. def zip[U](other: RDD[U])(implicit arg0: ClassTag[U]): RDD[(Edge[ED], U)]
    Definition Classes
    RDD
  131. def zipPartitions[B, C, D, V](rdd2: RDD[B], rdd3: RDD[C], rdd4: RDD[D])(f: (Iterator[Edge[ED]], 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
  132. def zipPartitions[B, C, D, V](rdd2: RDD[B], rdd3: RDD[C], rdd4: RDD[D], preservesPartitioning: Boolean)(f: (Iterator[Edge[ED]], 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
  133. def zipPartitions[B, C, V](rdd2: RDD[B], rdd3: RDD[C])(f: (Iterator[Edge[ED]], Iterator[B], Iterator[C]) ⇒ Iterator[V])(implicit arg0: ClassTag[B], arg1: ClassTag[C], arg2: ClassTag[V]): RDD[V]
    Definition Classes
    RDD
  134. def zipPartitions[B, C, V](rdd2: RDD[B], rdd3: RDD[C], preservesPartitioning: Boolean)(f: (Iterator[Edge[ED]], Iterator[B], Iterator[C]) ⇒ Iterator[V])(implicit arg0: ClassTag[B], arg1: ClassTag[C], arg2: ClassTag[V]): RDD[V]
    Definition Classes
    RDD
  135. def zipPartitions[B, V](rdd2: RDD[B])(f: (Iterator[Edge[ED]], Iterator[B]) ⇒ Iterator[V])(implicit arg0: ClassTag[B], arg1: ClassTag[V]): RDD[V]
    Definition Classes
    RDD
  136. def zipPartitions[B, V](rdd2: RDD[B], preservesPartitioning: Boolean)(f: (Iterator[Edge[ED]], Iterator[B]) ⇒ Iterator[V])(implicit arg0: ClassTag[B], arg1: ClassTag[V]): RDD[V]
    Definition Classes
    RDD
  137. def zipWithIndex(): RDD[(Edge[ED], Long)]
    Definition Classes
    RDD
  138. def zipWithUniqueId(): RDD[(Edge[ED], Long)]
    Definition Classes
    RDD

Inherited from EdgeRDD[ED]

Inherited from RDD[Edge[ED]]

Inherited from Logging

Inherited from Serializable

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped