RDDUtils

Value Members

1. final def !=(arg0: AnyRef): Boolean

   Definition Classes

   AnyRef

2. final def !=(arg0: Any): Boolean

   Definition Classes

   Any

3. final def ##(): Int

   Definition Classes

   AnyRef → Any

4. final def ==(arg0: AnyRef): Boolean

   Definition Classes

   AnyRef

5. final def ==(arg0: Any): Boolean

   Definition Classes

   Any

6. final def asInstanceOf[T0]: T0

   Definition Classes

   Any

7. def clone(): AnyRef

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

8. final def eq(arg0: AnyRef): Boolean

   Definition Classes

   AnyRef

9. def equals(arg0: Any): Boolean

   Definition Classes

   AnyRef → Any

10. def finalize(): Unit

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

11. final def getClass(): Class[_]

    Definition Classes

    AnyRef → Any

12. def hashCode(): Int

    Definition Classes

    AnyRef → Any

13. final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

14. final def ne(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef

15. final def notify(): Unit

    Definition Classes

    AnyRef

16. final def notifyAll(): Unit

    Definition Classes

    AnyRef

17. def partitionTopK[K <: Comparable[K], V](rdd: RDD[(K, V)], k: Int)(implicit arg0: ClassTag[K], arg1: ClassTag[V]): RDD[(K, V)]

    Take top K on each partition and return a new RDD.

18. def repartition[K, V](rdd: RDD[(K, V)], part: Partitioner)(implicit arg0: ClassTag[K], arg1: ClassTag[V]): RDD[(K, V)]

    Repartition an RDD using the given partitioner.

    Repartition an RDD using the given partitioner. This is similar to Spark's partitionBy, except we use the Shark shuffle serializer.

19. def sortByKey[K <: Comparable[K], V](rdd: RDD[(K, V)])(implicit arg0: ClassTag[K], arg1: ClassTag[V]): RDD[(K, V)]

    Sort the RDD by key.

    Sort the RDD by key. This is similar to Spark's sortByKey, except that we use the Shark shuffle serializer.

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

    Definition Classes

    AnyRef

21. def toString(): String

    Definition Classes

    AnyRef → Any

22. def topK[K <: Comparable[K], V](rdd: RDD[(K, V)], k: Int)(implicit arg0: ClassTag[K], arg1: ClassTag[V]): RDD[(K, V)]

    Return an RDD containing the top K (K smallest key) from the given RDD.

23. def unionAndFlatten[T](rdd: RDD[T], otherRdd: RDD[T])(implicit arg0: ClassTag[T]): UnionRDD[T]

    Returns a UnionRDD using both RDD arguments.

    Returns a UnionRDD using both RDD arguments. Any UnionRDD argument is "flattened", in that its parent sequence of RDDs is directly passed to the UnionRDD returned.

24. def unpersistRDD(rdd: RDD[_]): RDD[_]

25. final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

27. final def wait(arg0: Long): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )