Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
def
+(other: String): String
-
def
++(other: RDD[R]): RDD[R]
-
-
final
def
==(arg0: Any): Boolean
-
def
aggregate[U](zeroValue: U)(seqOp: Function2[U, R, U], combOp: Function2[U, U, U]): U
-
final
def
asInstanceOf[T0]: T0
-
def
cache(): JavaRDD[R]
-
-
def
cassandraCount(): Long
-
def
checkpoint(): Unit
-
implicit
val
classTag: ClassTag[R]
-
def
clone(): AnyRef
-
def
coalesce(numPartitions: Int, shuffle: Boolean): JavaRDD[R]
-
def
coalesce(numPartitions: Int): JavaRDD[R]
-
def
collect(): List[R]
-
def
collectAsync(): JavaFutureAction[List[R]]
-
def
collectPartitions(partitionIds: Array[Int]): Array[List[R]]
-
def
compute(split: Partition, context: TaskContext): Iterator[R]
-
-
def
count(): Long
-
def
countApprox(timeout: Long): PartialResult[BoundedDouble]
-
def
countApprox(timeout: Long, confidence: Double): PartialResult[BoundedDouble]
-
def
countApproxDistinct(relativeSD: Double): Long
-
def
countAsync(): JavaFutureAction[Long]
-
def
countByValue(): Map[R, Long]
-
def
countByValueApprox(timeout: Long): PartialResult[Map[R, BoundedDouble]]
-
def
countByValueApprox(timeout: Long, confidence: Double): PartialResult[Map[R, BoundedDouble]]
-
final
def
dependencies: Seq[Dependency[_]]
-
def
distinct(numPartitions: Int): JavaRDD[R]
-
def
distinct(): JavaRDD[R]
-
-
-
-
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
def
filter(f: Function[R, Boolean]): JavaRDD[R]
-
def
finalize(): Unit
-
def
first(): R
-
def
flatMap[U](f: FlatMapFunction[R, U]): JavaRDD[U]
-
def
flatMapToDouble(f: DoubleFlatMapFunction[R]): JavaDoubleRDD
-
def
flatMapToPair[K2, V2](f: PairFlatMapFunction[R, K2, V2]): JavaPairRDD[K2, V2]
-
def
fold(zeroValue: R)(f: Function2[R, R, R]): R
-
def
foreach(f: VoidFunction[R]): Unit
-
def
foreachAsync(f: VoidFunction[R]): JavaFutureAction[Void]
-
def
foreachPartition(f: VoidFunction[Iterator[R]]): Unit
-
def
foreachPartitionAsync(f: VoidFunction[Iterator[R]]): JavaFutureAction[Void]
-
def
formatted(fmtstr: String): String
-
def
getCheckpointFile(): Optional[String]
-
final
def
getClass(): Class[_]
-
def
getNumPartitions: Int
-
-
def
glom(): JavaRDD[List[R]]
-
def
groupBy[U](f: Function[R, U], numPartitions: Int): JavaPairRDD[U, Iterable[R]]
-
def
groupBy[U](f: Function[R, U]): JavaPairRDD[U, Iterable[R]]
-
def
hashCode(): Int
-
def
id: Int
-
def
intersection(other: JavaRDD[R]): JavaRDD[R]
-
def
isCheckpointed: Boolean
-
def
isEmpty(): Boolean
-
final
def
isInstanceOf[T0]: Boolean
-
def
iterator(split: Partition, taskContext: TaskContext): Iterator[R]
-
-
-
-
-
-
-
-
def
localCheckpoint(): RDD[R]
-
-
def
mapPartitions[U](f: FlatMapFunction[Iterator[R], U], preservesPartitioning: Boolean): JavaRDD[U]
-
def
mapPartitions[U](f: FlatMapFunction[Iterator[R], U]): JavaRDD[U]
-
def
mapPartitionsToDouble(f: DoubleFlatMapFunction[Iterator[R]], preservesPartitioning: Boolean): JavaDoubleRDD
-
def
mapPartitionsToDouble(f: DoubleFlatMapFunction[Iterator[R]]): JavaDoubleRDD
-
def
mapPartitionsToPair[K2, V2](f: PairFlatMapFunction[Iterator[R], K2, V2], preservesPartitioning: Boolean): JavaPairRDD[K2, V2]
-
def
mapPartitionsToPair[K2, V2](f: PairFlatMapFunction[Iterator[R], K2, V2]): JavaPairRDD[K2, V2]
-
def
mapPartitionsWithIndex[R](f: Function2[Integer, Iterator[R], Iterator[R]], preservesPartitioning: Boolean): JavaRDD[R]
-
def
mapToDouble[R](f: DoubleFunction[R]): JavaDoubleRDD
-
def
mapToPair[K2, V2](f: PairFunction[R, K2, V2]): JavaPairRDD[K2, V2]
-
def
max(comp: Comparator[R]): R
-
def
min(comp: Comparator[R]): R
-
def
name(): String
-
final
def
ne(arg0: AnyRef): Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
partitioner: Optional[Partitioner]
-
def
partitions: List[Partition]
-
-
def
pipe(command: List[String], env: Map[String, String]): JavaRDD[String]
-
def
pipe(command: List[String]): JavaRDD[String]
-
def
pipe(command: String): JavaRDD[String]
-
final
def
preferredLocations(split: Partition): Seq[String]
-
def
randomSplit(weights: Array[Double], seed: Long): Array[JavaRDD[R]]
-
def
randomSplit(weights: Array[Double]): Array[JavaRDD[R]]
-
-
def
reduce(f: Function2[R, R, R]): R
-
def
repartition(numPartitions: Int): JavaRDD[R]
-
def
sample(withReplacement: Boolean, fraction: Double, seed: Long): JavaRDD[R]
-
def
sample(withReplacement: Boolean, fraction: Double): JavaRDD[R]
-
def
saveAsObjectFile(path: String): Unit
-
def
saveAsTextFile(path: String, codec: Class[_ <: CompressionCodec]): Unit
-
def
saveAsTextFile(path: String): Unit
-
-
def
select(columnNames: <repeated...>[String]): CassandraTableScanJavaRDD[R]
-
def
selectedColumnNames(): Array[String]
-
def
selectedColumnRefs(): Array[ColumnRef]
-
def
setName(name: String): JavaRDD[R]
-
def
sortBy[S](f: Function[R, S], ascending: Boolean, numPartitions: Int): JavaRDD[R]
-
def
spanBy[K](f: Function[R, K], keyClass: Class[K]): JavaPairRDD[K, Iterable[R]]
-
def
spanBy[K](f: Function[R, K], keyClassTag: ClassTag[K]): JavaPairRDD[K, Iterable[R]]
-
-
-
def
subtract(other: JavaRDD[R], numPartitions: Int): JavaRDD[R]
-
def
subtract(other: JavaRDD[R]): JavaRDD[R]
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
take(num: Int): List[R]
-
def
takeAsync(num: Int): JavaFutureAction[List[R]]
-
def
takeOrdered(num: Int): List[R]
-
def
takeOrdered(num: Int, comp: Comparator[R]): List[R]
-
def
takeSample(withReplacement: Boolean, num: Int, seed: Long): List[R]
-
def
takeSample(withReplacement: Boolean, num: Int): List[R]
-
def
toDebugString(): String
-
-
def
toJavaRDD(): JavaRDD[R]
-
def
toLocalIterator(): Iterator[R]
-
def
toString(): String
-
def
top(num: Int): List[R]
-
def
top(num: Int, comp: Comparator[R]): List[R]
-
def
treeAggregate[U](zeroValue: U, seqOp: Function2[U, R, U], combOp: Function2[U, U, U]): U
-
def
treeAggregate[U](zeroValue: U, seqOp: Function2[U, R, U], combOp: Function2[U, U, U], depth: Int): U
-
def
treeReduce(f: Function2[R, R, R]): R
-
def
treeReduce(f: Function2[R, R, R], depth: Int): R
-
-
def
unpersist(blocking: Boolean): JavaRDD[R]
-
def
unpersist(): JavaRDD[R]
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
-
def
where(cqlWhereClause: String, args: <repeated...>[AnyRef]): CassandraTableScanJavaRDD[R]
-
-
-
-
-
-
def
wrapRDD(rdd: RDD[R]): JavaRDD[R]
-
-
def
zipPartitions[U, V](other: JavaRDDLike[U, _], f: FlatMapFunction2[Iterator[R], Iterator[U], V]): JavaRDD[V]
-
def
zipWithIndex(): JavaPairRDD[R, Long]
-
def
zipWithUniqueId(): JavaPairRDD[R, Long]
-
Shadowed Implicit Value Members
-
def
aggregate[U](zeroValue: U)(seqOp: (U, R) ⇒ U, combOp: (U, U) ⇒ U)(implicit arg0: ClassTag[U]): U
-
def
cache(): RDD[R]
-
def
cartesian[U](other: RDD[U])(implicit arg0: ClassTag[U]): RDD[(R, U)]
-
def
checkpoint(): Unit
-
def
coalesce(numPartitions: Int, shuffle: Boolean)(implicit ord: Ordering[R]): RDD[R]
-
def
collect[U](f: PartialFunction[R, U])(implicit arg0: ClassTag[U]): RDD[U]
-
def
collect(): Array[R]
-
-
def
count(): Long
-
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[R]): Map[R, Long]
-
def
countByValueApprox(timeout: Long, confidence: Double)(implicit ord: Ordering[R]): PartialResult[Map[R, BoundedDouble]]
-
def
distinct(): RDD[R]
-
def
distinct(numPartitions: Int)(implicit ord: Ordering[R]): RDD[R]
-
def
filter(f: (R) ⇒ Boolean): RDD[R]
-
def
first(): R
-
def
flatMap[U](f: (R) ⇒ TraversableOnce[U])(implicit arg0: ClassTag[U]): RDD[U]
-
def
fold(zeroValue: R)(op: (R, R) ⇒ R): R
-
def
foreach(f: (R) ⇒ Unit): Unit
-
def
foreachPartition(f: (Iterator[R]) ⇒ Unit): Unit
-
def
getCheckpointFile: Option[String]
-
final
def
getNumPartitions: Int
-
-
def
glom(): RDD[Array[R]]
-
def
groupBy[K](f: (R) ⇒ K, p: Partitioner)(implicit kt: ClassTag[K], ord: Ordering[K]): RDD[(K, Iterable[R])]
-
def
groupBy[K](f: (R) ⇒ K, numPartitions: Int)(implicit kt: ClassTag[K]): RDD[(K, Iterable[R])]
-
def
groupBy[K](f: (R) ⇒ K)(implicit kt: ClassTag[K]): RDD[(K, Iterable[R])]
-
val
id: Int
-
def
intersection(other: RDD[R], numPartitions: Int): RDD[R]
-
def
intersection(other: RDD[R], partitioner: Partitioner)(implicit ord: Ordering[R]): RDD[R]
-
def
intersection(other: RDD[R]): RDD[R]
-
def
isCheckpointed: Boolean
-
def
isEmpty(): Boolean
-
final
def
iterator(split: Partition, context: TaskContext): Iterator[R]
-
def
keyBy[K](f: (R) ⇒ K): RDD[(K, R)]
-
def
map[U](f: (R) ⇒ U)(implicit arg0: ClassTag[U]): RDD[U]
-
def
mapPartitions[U](f: (Iterator[R]) ⇒ Iterator[U], preservesPartitioning: Boolean)(implicit arg0: ClassTag[U]): RDD[U]
-
def
mapPartitionsWithIndex[U](f: (Int, Iterator[R]) ⇒ Iterator[U], preservesPartitioning: Boolean)(implicit arg0: ClassTag[U]): RDD[U]
-
def
max()(implicit ord: Ordering[R]): R
-
def
min()(implicit ord: Ordering[R]): R
-
var
name: String
-
val
partitioner: Option[Partitioner]
-
final
def
partitions: Array[Partition]
-
def
persist(): RDD[R]
-
-
def
pipe(command: Seq[String], env: Map[String, String], printPipeContext: ((String) ⇒ Unit) ⇒ Unit, printRDDElement: (R, (String) ⇒ Unit) ⇒ Unit, separateWorkingDir: Boolean): RDD[String]
-
def
pipe(command: String, env: Map[String, String]): RDD[String]
-
def
pipe(command: String): RDD[String]
-
def
randomSplit(weights: Array[Double], seed: Long): Array[RDD[R]]
-
def
reduce(f: (R, R) ⇒ R): R
-
def
repartition(numPartitions: Int)(implicit ord: Ordering[R]): RDD[R]
-
def
sample(withReplacement: Boolean, fraction: Double, seed: Long): RDD[R]
-
def
saveAsObjectFile(path: String): Unit
-
def
saveAsTextFile(path: String, codec: Class[_ <: CompressionCodec]): Unit
-
def
saveAsTextFile(path: String): Unit
-
def
setName(_name: String): RDD[R]
-
def
sortBy[K](f: (R) ⇒ K, ascending: Boolean, numPartitions: Int)(implicit ord: Ordering[K], ctag: ClassTag[K]): RDD[R]
-
def
subtract(other: RDD[R], p: Partitioner)(implicit ord: Ordering[R]): RDD[R]
-
def
subtract(other: RDD[R], numPartitions: Int): RDD[R]
-
def
subtract(other: RDD[R]): RDD[R]
-
def
take(num: Int): Array[R]
-
def
takeOrdered(num: Int)(implicit ord: Ordering[R]): Array[R]
-
def
takeSample(withReplacement: Boolean, num: Int, seed: Long): Array[R]
-
def
toDebugString: String
-
def
toLocalIterator: Iterator[R]
-
def
toString(): String
-
def
top(num: Int)(implicit ord: Ordering[R]): Array[R]
-
def
treeAggregate[U](zeroValue: U)(seqOp: (U, R) ⇒ U, combOp: (U, U) ⇒ U, depth: Int)(implicit arg0: ClassTag[U]): U
-
def
treeReduce(f: (R, R) ⇒ R, depth: Int): R
-
def
union(other: RDD[R]): RDD[R]
-
def
unpersist(blocking: Boolean): RDD[R]
-
def
zip[U](other: RDD[U])(implicit arg0: ClassTag[U]): RDD[(R, U)]
-
def
zipPartitions[B, C, D, V](rdd2: RDD[B], rdd3: RDD[C], rdd4: RDD[D])(f: (Iterator[R], 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[R], 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[R], 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[R], 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[R], Iterator[B]) ⇒ Iterator[V])(implicit arg0: ClassTag[B], arg1: ClassTag[V]): RDD[V]
-
def
zipPartitions[B, V](rdd2: RDD[B], preservesPartitioning: Boolean)(f: (Iterator[R], Iterator[B]) ⇒ Iterator[V])(implicit arg0: ClassTag[B], arg1: ClassTag[V]): RDD[V]
-
def
zipWithIndex(): RDD[(R, Long)]
-
def
zipWithUniqueId(): RDD[(R, Long)]
Deprecated Value Members
-
def
filterWith[A](constructA: (Int) ⇒ A)(p: (R, A) ⇒ Boolean): RDD[R]
-
def
flatMapWith[A, U](constructA: (Int) ⇒ A, preservesPartitioning: Boolean)(f: (R, A) ⇒ Seq[U])(implicit arg0: ClassTag[U]): RDD[U]
-
def
foreachWith[A](constructA: (Int) ⇒ A)(f: (R, A) ⇒ Unit): Unit
-
def
mapPartitionsWithContext[U](f: (TaskContext, Iterator[R]) ⇒ Iterator[U], preservesPartitioning: Boolean)(implicit arg0: ClassTag[U]): RDD[U]
-
def
mapPartitionsWithSplit[U](f: (Int, Iterator[R]) ⇒ Iterator[U], preservesPartitioning: Boolean)(implicit arg0: ClassTag[U]): RDD[U]
-
def
mapWith[A, U](constructA: (Int) ⇒ A, preservesPartitioning: Boolean)(f: (R, A) ⇒ U)(implicit arg0: ClassTag[U]): RDD[U]
-
-
def
toArray(): Array[R]
-
def
toArray(): List[R]
Inherited from Serializable
Inherited from Serializable
Inherited from AnyRef
Inherited from Any