EdgeRDDImpl

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

def ++(other: RDD[Edge[ED]]): RDD[Edge[ED]]

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

def aggregate[U](zeroValue: U)(seqOp: (U, Edge[ED]) ⇒ U, combOp: (U, U) ⇒ U)(implicit arg0: ClassTag[U]): U

final def asInstanceOf[T0]: T0

def cache(): EdgeRDDImpl.this.type

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

def cartesian[U](other: RDD[U])(implicit arg0: ClassTag[U]): RDD[(Edge[ED], U)]

def checkpoint(): Unit

def clearDependencies(): Unit

def clone(): AnyRef

def coalesce(numPartitions: Int, shuffle: Boolean)(implicit ord: Ordering[Edge[ED]]): RDD[Edge[ED]]

def collect(): Array[Edge[ED]]

def collect[U](f: PartialFunction[Edge[ED], U])(implicit arg0: ClassTag[U]): RDD[U]

def compute(part: Partition, context: TaskContext): Iterator[Edge[ED]]

def context: SparkContext

def count(): Long

The number of edges in the RDD.

def countApprox(timeout: Long, confidence: Double): PartialResult[BoundedDouble]

def countApproxDistinct(relativeSD: Double): Long

def countApproxDistinct(p: Int, sp: Int): Long

def countByValue()(implicit ord: Ordering[Edge[ED]]): Map[Edge[ED], Long]

def countByValueApprox(timeout: Long, confidence: Double)(implicit ord: Ordering[Edge[ED]]): PartialResult[Map[Edge[ED], BoundedDouble]]

final def dependencies: Seq[Dependency[_]]

def distinct(): RDD[Edge[ED]]

def distinct(numPartitions: Int)(implicit ord: Ordering[Edge[ED]]): RDD[Edge[ED]]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def filter(epred: (EdgeTriplet[VD, ED]) ⇒ Boolean, vpred: (VertexId, VD) ⇒ Boolean): EdgeRDDImpl[ED, VD]

def filter(f: (Edge[ED]) ⇒ Boolean): RDD[Edge[ED]]

def finalize(): Unit

def first(): Edge[ED]

def firstParent[U](implicit arg0: ClassTag[U]): RDD[U]

def flatMap[U](f: (Edge[ED]) ⇒ TraversableOnce[U])(implicit arg0: ClassTag[U]): RDD[U]

def fold(zeroValue: Edge[ED])(op: (Edge[ED], Edge[ED]) ⇒ Edge[ED]): Edge[ED]

def foreach(f: (Edge[ED]) ⇒ Unit): Unit

def foreachPartition(f: (Iterator[Edge[ED]]) ⇒ Unit): Unit

def getCheckpointFile: Option[String]

final def getClass(): Class[_]

def getDependencies: Seq[Dependency[_]]

def getPartitions: Array[Partition]

def getPreferredLocations(split: Partition): Seq[String]

def getStorageLevel: StorageLevel

def glom(): RDD[Array[Edge[ED]]]

def groupBy[K](f: (Edge[ED]) ⇒ K, p: Partitioner)(implicit kt: ClassTag[K], ord: Ordering[K]): RDD[(K, Iterable[Edge[ED]])]

def groupBy[K](f: (Edge[ED]) ⇒ K, numPartitions: Int)(implicit kt: ClassTag[K]): RDD[(K, Iterable[Edge[ED]])]

def groupBy[K](f: (Edge[ED]) ⇒ K)(implicit kt: ClassTag[K]): RDD[(K, Iterable[Edge[ED]])]

def hashCode(): Int

val id: Int

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.

def intersection(other: RDD[Edge[ED]], numPartitions: Int): RDD[Edge[ED]]

def intersection(other: RDD[Edge[ED]], partitioner: Partitioner)(implicit ord: Ordering[Edge[ED]]): RDD[Edge[ED]]

def intersection(other: RDD[Edge[ED]]): RDD[Edge[ED]]

def isCheckpointed: Boolean

def isEmpty(): Boolean

final def isInstanceOf[T0]: Boolean

def isTraceEnabled(): Boolean

final def iterator(split: Partition, context: TaskContext): Iterator[Edge[ED]]

def keyBy[K](f: (Edge[ED]) ⇒ K): RDD[(K, Edge[ED])]

def localCheckpoint(): EdgeRDDImpl.this.type

def log: Logger

def logDebug(msg: ⇒ String, throwable: Throwable): Unit

def logDebug(msg: ⇒ String): Unit

def logError(msg: ⇒ String, throwable: Throwable): Unit

def logError(msg: ⇒ String): Unit

def logInfo(msg: ⇒ String, throwable: Throwable): Unit

def logInfo(msg: ⇒ String): Unit

def logName: String

def logTrace(msg: ⇒ String, throwable: Throwable): Unit

def logTrace(msg: ⇒ String): Unit

def logWarning(msg: ⇒ String, throwable: Throwable): Unit

def logWarning(msg: ⇒ String): Unit

def map[U](f: (Edge[ED]) ⇒ U)(implicit arg0: ClassTag[U]): RDD[U]

def mapEdgePartitions[ED2, VD2](f: (PartitionID, EdgePartition[ED, VD]) ⇒ EdgePartition[ED2, VD2])(implicit arg0: ClassTag[ED2], arg1: ClassTag[VD2]): EdgeRDDImpl[ED2, VD2]

def mapPartitions[U](f: (Iterator[Edge[ED]]) ⇒ Iterator[U], preservesPartitioning: Boolean)(implicit arg0: ClassTag[U]): RDD[U]

def mapPartitionsWithIndex[U](f: (Int, Iterator[Edge[ED]]) ⇒ Iterator[U], preservesPartitioning: Boolean)(implicit arg0: ClassTag[U]): RDD[U]

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.

def max()(implicit ord: Ordering[Edge[ED]]): Edge[ED]

def min()(implicit ord: Ordering[Edge[ED]]): Edge[ED]

var name: String

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def parent[U](j: Int)(implicit arg0: ClassTag[U]): RDD[U]

val partitioner: Option[Partitioner]

If partitionsRDD already has a partitioner, use it.

final def partitions: Array[Partition]

val partitionsRDD: RDD[(PartitionID, EdgePartition[ED, VD])]

def persist(newLevel: StorageLevel): EdgeRDDImpl.this.type

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

def persist(): EdgeRDDImpl.this.type

def pipe(command: Seq[String], env: Map[String, String], printPipeContext: ((String) ⇒ Unit) ⇒ Unit, printRDDElement: (Edge[ED], (String) ⇒ Unit) ⇒ Unit, separateWorkingDir: Boolean): RDD[String]

def pipe(command: String, env: Map[String, String]): RDD[String]

def pipe(command: String): RDD[String]

final def preferredLocations(split: Partition): Seq[String]

def randomSplit(weights: Array[Double], seed: Long): Array[RDD[Edge[ED]]]

def reduce(f: (Edge[ED], Edge[ED]) ⇒ Edge[ED]): Edge[ED]

def repartition(numPartitions: Int)(implicit ord: Ordering[Edge[ED]]): RDD[Edge[ED]]

def reverse: EdgeRDDImpl[ED, VD]

Reverse all the edges in this RDD.

def sample(withReplacement: Boolean, fraction: Double, seed: Long): RDD[Edge[ED]]

def saveAsObjectFile(path: String): Unit

def saveAsTextFile(path: String, codec: Class[_ <: CompressionCodec]): Unit

def saveAsTextFile(path: String): Unit

def setName(_name: String): EdgeRDDImpl.this.type

def sortBy[K](f: (Edge[ED]) ⇒ K, ascending: Boolean, numPartitions: Int)(implicit ord: Ordering[K], ctag: ClassTag[K]): RDD[Edge[ED]]

def sparkContext: SparkContext

def subtract(other: RDD[Edge[ED]], p: Partitioner)(implicit ord: Ordering[Edge[ED]]): RDD[Edge[ED]]

def subtract(other: RDD[Edge[ED]], numPartitions: Int): RDD[Edge[ED]]

def subtract(other: RDD[Edge[ED]]): RDD[Edge[ED]]

final def synchronized[T0](arg0: ⇒ T0): T0

def take(num: Int): Array[Edge[ED]]

def takeOrdered(num: Int)(implicit ord: Ordering[Edge[ED]]): Array[Edge[ED]]

def takeSample(withReplacement: Boolean, num: Int, seed: Long): Array[Edge[ED]]

val targetStorageLevel: StorageLevel

def toDebugString: String

def toJavaRDD(): JavaRDD[Edge[ED]]

def toLocalIterator: Iterator[Edge[ED]]

def toString(): String

def top(num: Int)(implicit ord: Ordering[Edge[ED]]): Array[Edge[ED]]

def treeAggregate[U](zeroValue: U)(seqOp: (U, Edge[ED]) ⇒ U, combOp: (U, U) ⇒ U, depth: Int)(implicit arg0: ClassTag[U]): U

def treeReduce(f: (Edge[ED], Edge[ED]) ⇒ Edge[ED], depth: Int): Edge[ED]

def union(other: RDD[Edge[ED]]): RDD[Edge[ED]]

def unpersist(blocking: Boolean = true): EdgeRDDImpl.this.type

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

def zip[U](other: RDD[U])(implicit arg0: ClassTag[U]): RDD[(Edge[ED], U)]

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]

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]

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]

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]

def zipPartitions[B, V](rdd2: RDD[B])(f: (Iterator[Edge[ED]], Iterator[B]) ⇒ Iterator[V])(implicit arg0: ClassTag[B], arg1: ClassTag[V]): RDD[V]

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]

def zipWithIndex(): RDD[(Edge[ED], Long)]

def zipWithUniqueId(): RDD[(Edge[ED], Long)]

def filterWith[A](constructA: (Int) ⇒ A)(p: (Edge[ED], A) ⇒ Boolean): RDD[Edge[ED]]

def flatMapWith[A, U](constructA: (Int) ⇒ A, preservesPartitioning: Boolean)(f: (Edge[ED], A) ⇒ Seq[U])(implicit arg0: ClassTag[U]): RDD[U]

def foreachWith[A](constructA: (Int) ⇒ A)(f: (Edge[ED], A) ⇒ Unit): Unit

def mapPartitionsWithContext[U](f: (TaskContext, Iterator[Edge[ED]]) ⇒ Iterator[U], preservesPartitioning: Boolean)(implicit arg0: ClassTag[U]): RDD[U]

def mapPartitionsWithSplit[U](f: (Int, Iterator[Edge[ED]]) ⇒ Iterator[U], preservesPartitioning: Boolean)(implicit arg0: ClassTag[U]): RDD[U]

def mapWith[A, U](constructA: (Int) ⇒ A, preservesPartitioning: Boolean)(f: (Edge[ED], A) ⇒ U)(implicit arg0: ClassTag[U]): RDD[U]

def toArray(): Array[Edge[ED]]