CascadeRDD

Instance Constructors

new CascadeRDD(rdd: RDD[T], pid: Int, cascade: Option[RDD[U]], f: ⇒ (Iterator[T], Option[Iterator[U]]) ⇒ Iterator[U])(implicit arg0: ClassTag[T], arg1: ClassTag[U])

Value Members

final def !=(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def ##(): Int

Definition Classes
AnyRef → Any
def ++(other: RDD[U]): RDD[U]

Definition Classes
RDD
final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def aggregate[U](zeroValue: U)(seqOp: (U, U) ⇒ U, combOp: (U, U) ⇒ U)(implicit arg0: ClassTag[U]): U

Definition Classes
RDD
final def asInstanceOf[T0]: T0

Definition Classes
Any
def cache(): CascadeRDD.this.type

Definition Classes
RDD
def cartesian[U](other: RDD[U])(implicit arg0: ClassTag[U]): RDD[(U, U)]

Definition Classes
RDD
def checkpoint(): Unit

Definition Classes
RDD
def clearDependencies(): Unit

Attributes
protected
Definition Classes
RDD
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
def coalesce(numPartitions: Int, shuffle: Boolean, partitionCoalescer: Option[PartitionCoalescer])(implicit ord: Ordering[U]): RDD[U]

Definition Classes
RDD
def collect[U](f: PartialFunction[U, U])(implicit arg0: ClassTag[U]): RDD[U]

Definition Classes
RDD
def collect(): Array[U]

Definition Classes
RDD
def compute(unused: Partition, ctx: TaskContext): Iterator[U]

Definition Classes
CascadeRDD → RDD
def context: SparkContext

Definition Classes
RDD
def count(): Long

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

Definition Classes
RDD
def countApproxDistinct(relativeSD: Double): Long

Definition Classes
RDD
def countApproxDistinct(p: Int, sp: Int): Long

Definition Classes
RDD
def countByValue()(implicit ord: Ordering[U]): Map[U, Long]

Definition Classes
RDD
def countByValueApprox(timeout: Long, confidence: Double)(implicit ord: Ordering[U]): PartialResult[Map[U, BoundedDouble]]

Definition Classes
RDD
final def dependencies: Seq[Dependency[_]]

Definition Classes
RDD
def distinct(): RDD[U]

Definition Classes
RDD
def distinct(numPartitions: Int)(implicit ord: Ordering[U]): RDD[U]

Definition Classes
RDD
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def filter(f: (U) ⇒ Boolean): RDD[U]

Definition Classes
RDD
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
def first(): U

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

Attributes
protected[org.apache.spark]
Definition Classes
RDD
def flatMap[U](f: (U) ⇒ TraversableOnce[U])(implicit arg0: ClassTag[U]): RDD[U]

Definition Classes
RDD
def fold(zeroValue: U)(op: (U, U) ⇒ U): U

Definition Classes
RDD
def foreach(f: (U) ⇒ Unit): Unit

Definition Classes
RDD
def foreachPartition(f: (Iterator[U]) ⇒ Unit): Unit

Definition Classes
RDD
def getCheckpointFile: Option[String]

Definition Classes
RDD
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def getDependencies: Seq[Dependency[_]]

Attributes
protected
Definition Classes
RDD
final def getNumPartitions: Int

Definition Classes
RDD
Annotations
@Since( "1.6.0" )
def getPartitions: Array[Partition]

Definition Classes
CascadeRDD → RDD
def getPreferredLocations(split: Partition): Seq[String]

Attributes
protected
Definition Classes
RDD
def getStorageLevel: StorageLevel

Definition Classes
RDD
def glom(): RDD[Array[U]]

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

Definition Classes
RDD
def groupBy[K](f: (U) ⇒ K, numPartitions: Int)(implicit kt: ClassTag[K]): RDD[(K, Iterable[U])]

Definition Classes
RDD
def groupBy[K](f: (U) ⇒ K)(implicit kt: ClassTag[K]): RDD[(K, Iterable[U])]

Definition Classes
RDD
def hashCode(): Int

Definition Classes
AnyRef → Any
val id: Int

Definition Classes
RDD
def initializeLogIfNecessary(isInterpreter: Boolean): Unit

Attributes
protected
Definition Classes
Logging
def intersection(other: RDD[U], numPartitions: Int): RDD[U]

Definition Classes
RDD
def intersection(other: RDD[U], partitioner: Partitioner)(implicit ord: Ordering[U]): RDD[U]

Definition Classes
RDD
def intersection(other: RDD[U]): RDD[U]

Definition Classes
RDD
def isCheckpointed: Boolean

Definition Classes
RDD
def isEmpty(): Boolean

Definition Classes
RDD
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
def isTraceEnabled(): Boolean

Attributes
protected
Definition Classes
Logging
final def iterator(split: Partition, context: TaskContext): Iterator[U]

Definition Classes
RDD
def keyBy[K](f: (U) ⇒ K): RDD[(K, U)]

Definition Classes
RDD
def localCheckpoint(): CascadeRDD.this.type

Definition Classes
RDD
def log: Logger

Attributes
protected
Definition Classes
Logging
def logDebug(msg: ⇒ String, throwable: Throwable): Unit

Attributes
protected
Definition Classes
Logging
def logDebug(msg: ⇒ String): Unit

Attributes
protected
Definition Classes
Logging
def logError(msg: ⇒ String, throwable: Throwable): Unit

Attributes
protected
Definition Classes
Logging
def logError(msg: ⇒ String): Unit

Attributes
protected
Definition Classes
Logging
def logInfo(msg: ⇒ String, throwable: Throwable): Unit

Attributes
protected
Definition Classes
Logging
def logInfo(msg: ⇒ String): Unit

Attributes
protected
Definition Classes
Logging
def logName: String

Attributes
protected
Definition Classes
Logging
def logTrace(msg: ⇒ String, throwable: Throwable): Unit

Attributes
protected
Definition Classes
Logging
def logTrace(msg: ⇒ String): Unit

Attributes
protected
Definition Classes
Logging
def logWarning(msg: ⇒ String, throwable: Throwable): Unit

Attributes
protected
Definition Classes
Logging
def logWarning(msg: ⇒ String): Unit

Attributes
protected
Definition Classes
Logging
def map[U](f: (U) ⇒ U)(implicit arg0: ClassTag[U]): RDD[U]

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

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

Definition Classes
RDD
def max()(implicit ord: Ordering[U]): U

Definition Classes
RDD
def min()(implicit ord: Ordering[U]): U

Definition Classes
RDD
var name: String

Definition Classes
RDD
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

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

Attributes
protected[org.apache.spark]
Definition Classes
RDD
val partitioner: Option[Partitioner]

Definition Classes
RDD
final def partitions: Array[Partition]

Definition Classes
RDD
def persist(): CascadeRDD.this.type

Definition Classes
RDD
def persist(newLevel: StorageLevel): CascadeRDD.this.type

Definition Classes
RDD
def pipe(command: Seq[String], env: Map[String, String], printPipeContext: ((String) ⇒ Unit) ⇒ Unit, printRDDElement: (U, (String) ⇒ Unit) ⇒ Unit, separateWorkingDir: Boolean, bufferSize: Int, encoding: String): RDD[String]

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

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

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

Definition Classes
RDD
def randomSplit(weights: Array[Double], seed: Long): Array[RDD[U]]

Definition Classes
RDD
val rddPartition: Partition
def reduce(f: (U, U) ⇒ U): U

Definition Classes
RDD
def repartition(numPartitions: Int)(implicit ord: Ordering[U]): RDD[U]

Definition Classes
RDD
def sample(withReplacement: Boolean, fraction: Double, seed: Long): RDD[U]

Definition Classes
RDD
def saveAsObjectFile(path: String): Unit

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

Definition Classes
RDD
def saveAsTextFile(path: String): Unit

Definition Classes
RDD
def setName(_name: String): CascadeRDD.this.type

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

Definition Classes
RDD
def sparkContext: SparkContext

Definition Classes
RDD
def subtract(other: RDD[U], p: Partitioner)(implicit ord: Ordering[U]): RDD[U]

Definition Classes
RDD
def subtract(other: RDD[U], numPartitions: Int): RDD[U]

Definition Classes
RDD
def subtract(other: RDD[U]): RDD[U]

Definition Classes
RDD
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def take(num: Int): Array[U]

Definition Classes
RDD
def takeOrdered(num: Int)(implicit ord: Ordering[U]): Array[U]

Definition Classes
RDD
def takeSample(withReplacement: Boolean, num: Int, seed: Long): Array[U]

Definition Classes
RDD
def toDebugString: String

Definition Classes
RDD
def toJavaRDD(): JavaRDD[U]

Definition Classes
RDD
def toLocalIterator: Iterator[U]

Definition Classes
RDD
def toString(): String

Definition Classes
RDD → AnyRef → Any
def top(num: Int)(implicit ord: Ordering[U]): Array[U]

Definition Classes
RDD
def treeAggregate[U](zeroValue: U)(seqOp: (U, U) ⇒ U, combOp: (U, U) ⇒ U, depth: Int)(implicit arg0: ClassTag[U]): U

Definition Classes
RDD
def treeReduce(f: (U, U) ⇒ U, depth: Int): U

Definition Classes
RDD
def union(other: RDD[U]): RDD[U]

Definition Classes
RDD
def unpersist(blocking: Boolean): CascadeRDD.this.type

Definition Classes
RDD
final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
def zip[U](other: RDD[U])(implicit arg0: ClassTag[U]): RDD[(U, U)]

Definition Classes
RDD
def zipPartitions[B, C, D, V](rdd2: RDD[B], rdd3: RDD[C], rdd4: RDD[D])(f: (Iterator[U], 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
def zipPartitions[B, C, D, V](rdd2: RDD[B], rdd3: RDD[C], rdd4: RDD[D], preservesPartitioning: Boolean)(f: (Iterator[U], 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
def zipPartitions[B, C, V](rdd2: RDD[B], rdd3: RDD[C])(f: (Iterator[U], Iterator[B], Iterator[C]) ⇒ Iterator[V])(implicit arg0: ClassTag[B], arg1: ClassTag[C], arg2: ClassTag[V]): RDD[V]

Definition Classes
RDD
def zipPartitions[B, C, V](rdd2: RDD[B], rdd3: RDD[C], preservesPartitioning: Boolean)(f: (Iterator[U], Iterator[B], Iterator[C]) ⇒ Iterator[V])(implicit arg0: ClassTag[B], arg1: ClassTag[C], arg2: ClassTag[V]): RDD[V]

Definition Classes
RDD
def zipPartitions[B, V](rdd2: RDD[B])(f: (Iterator[U], Iterator[B]) ⇒ Iterator[V])(implicit arg0: ClassTag[B], arg1: ClassTag[V]): RDD[V]

Definition Classes
RDD
def zipPartitions[B, V](rdd2: RDD[B], preservesPartitioning: Boolean)(f: (Iterator[U], Iterator[B]) ⇒ Iterator[V])(implicit arg0: ClassTag[B], arg1: ClassTag[V]): RDD[V]

Definition Classes
RDD
def zipWithIndex(): RDD[(U, Long)]

Definition Classes
RDD
def zipWithUniqueId(): RDD[(U, Long)]

Definition Classes
RDD

Related Doc: package cascade

class CascadeRDD[T, U] extends RDD[U]

Instance Constructors

new CascadeRDD(rdd: RDD[T], pid: Int, cascade: Option[RDD[U]], f: ⇒ (Iterator[T], Option[Iterator[U]]) ⇒ Iterator[U])(implicit arg0: ClassTag[T], arg1: ClassTag[U])

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

def ++(other: RDD[U]): RDD[U]

final def ==(arg0: Any): Boolean

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

final def asInstanceOf[T0]: T0

def cache(): CascadeRDD.this.type

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

def checkpoint(): Unit

def clearDependencies(): Unit

def clone(): AnyRef

def coalesce(numPartitions: Int, shuffle: Boolean, partitionCoalescer: Option[PartitionCoalescer])(implicit ord: Ordering[U]): RDD[U]

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

def collect(): Array[U]

def compute(unused: Partition, ctx: TaskContext): Iterator[U]

def context: SparkContext

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[U]): Map[U, Long]

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

final def dependencies: Seq[Dependency[_]]

def distinct(): RDD[U]

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

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def filter(f: (U) ⇒ Boolean): RDD[U]

def finalize(): Unit

def first(): U

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

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

def fold(zeroValue: U)(op: (U, U) ⇒ U): U

def foreach(f: (U) ⇒ Unit): Unit

def foreachPartition(f: (Iterator[U]) ⇒ Unit): Unit

def getCheckpointFile: Option[String]

final def getClass(): Class[_]

def getDependencies: Seq[Dependency[_]]

final def getNumPartitions: Int

def getPartitions: Array[Partition]

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

def getStorageLevel: StorageLevel

def glom(): RDD[Array[U]]

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

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

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

def hashCode(): Int

val id: Int

def initializeLogIfNecessary(isInterpreter: Boolean): Unit

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

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

def intersection(other: RDD[U]): RDD[U]

def isCheckpointed: Boolean

def isEmpty(): Boolean

final def isInstanceOf[T0]: Boolean

def isTraceEnabled(): Boolean

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

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

def localCheckpoint(): CascadeRDD.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: (U) ⇒ U)(implicit arg0: ClassTag[U]): RDD[U]

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

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