CoalescedPartitioner

Instance Constructors

new CoalescedPartitioner(parent: Partitioner, partitionStartIndices: Array[Int])

parent
a parent partitioner
partitionStartIndices
indices of partitions in parent that should create new partitions in child (this should be an array of increasing partition IDs). For example, if we have a parent with 5 partitions, and partitionStartIndices is [0, 2, 4], we get three output partitions, corresponding to partition ranges [0, 1], [2, 3] and [4] of the parent partitioner.

Value Members

final def !=(arg0: Any): Boolean

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

Definition Classes
AnyRef → Any
final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
final def eq(arg0: AnyRef): Boolean

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

Definition Classes
CoalescedPartitioner → AnyRef → Any
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def getPartition(key: Any): Int

Definition Classes
CoalescedPartitioner → Partitioner
def hashCode(): Int

Definition Classes
CoalescedPartitioner → AnyRef → Any
final def isInstanceOf[T0]: Boolean

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

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def numPartitions: Int

Definition Classes
CoalescedPartitioner → Partitioner
val parent: Partitioner

a parent partitioner
val partitionStartIndices: Array[Int]

indices of partitions in parent that should create new partitions in child (this should be an array of increasing partition IDs).
indices of partitions in parent that should create new partitions in child (this should be an array of increasing partition IDs). For example, if we have a parent with 5 partitions, and partitionStartIndices is [0, 2, 4], we get three output partitions, corresponding to partition ranges [0, 1], [2, 3] and [4] of the parent partitioner.
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Definition Classes
AnyRef → Any
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( ... )

Related Doc: package execution

class CoalescedPartitioner extends Partitioner

Instance Constructors

new CoalescedPartitioner(parent: Partitioner, partitionStartIndices: Array[Int])

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(other: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def getPartition(key: Any): Int

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def numPartitions: Int

val parent: Partitioner

val partitionStartIndices: Array[Int]

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

def toString(): String

final def wait(): Unit

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

final def wait(arg0: Long): Unit

Inherited from Partitioner

Inherited from Serializable

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped