class
SCollectionWithHotKeyFanout[K, V] extends TransformNameable
Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: Any): Boolean
-
def
aggregateByKey[A, U](aggregator: Aggregator[V, A, U])(implicit arg0: ClassTag[A], arg1: ClassTag[U]): SCollection[(K, U)]
-
def
aggregateByKey[U](zeroValue: U)(seqOp: (U, V) ⇒ U, combOp: (U, U) ⇒ U)(implicit arg0: ClassTag[U]): SCollection[(K, U)]
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
def
combineByKey[C](createCombiner: (V) ⇒ C)(mergeValue: (C, V) ⇒ C)(mergeCombiners: (C, C) ⇒ C)(implicit arg0: ClassTag[C]): SCollection[(K, C)]
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
def
finalize(): Unit
-
def
foldByKey(implicit mon: Monoid[V]): SCollection[(K, V)]
-
def
foldByKey(zeroValue: V)(op: (V, V) ⇒ V): SCollection[(K, V)]
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
final
def
isInstanceOf[T0]: Boolean
-
final
def
ne(arg0: AnyRef): Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
reduceByKey(op: (V, V) ⇒ V): SCollection[(K, V)]
-
-
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 AnyRef
Inherited from Any
An enhanced SCollection that uses an intermediate node to combine "hot" keys partially before performing the full combine.