PairRDDDecorator

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. def distributeToPartitions[B, D](mapping: RDD[(K, D)], partitioner: Partitioner)(f: (A) ⇒ B)(implicit arg0: ClassTag[D]): RDD[(D, (K, B))]

   Creates an RDD having each of required objects distributed to all required destinations

   Creates an RDD having each of required objects distributed to all required destinations

   If the data and/or mapping are partitioned with the same partitioner, no shuffle is required.

   B

   mapping

   Mapping of keys to destinations. Duplicate destinations from different partitions are coalesced.

   partitioner

   Partitioner to use. Operation is more efficient if data is partitioned with the same partitioner

   f

   Function to apply to values. It's called exactly once for each value in data

   returns

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

   Definition Classes

   AnyRef

10. def equals(arg0: Any): Boolean

    Definition Classes

    AnyRef → Any

11. def finalize(): Unit

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

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

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

    Definition Classes

    AnyRef → Any

13. def groupWithinPartitionsByKey: RDD[(K, Iterator[A])]

    Utility used to group data by key within RDD partitions by a key, assuming that RDD is already partitioned and sorted by key.

    Utility used to group data by key within RDD partitions by a key, assuming that RDD is already partitioned and sorted by key. The RDD data are processed sequentialy without shuffling and materializing them in memory.

    returns

    RDD with key -> values.

14. def hashCode(): Int

    Definition Classes

    AnyRef → Any

15. final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

16. def joinUnique[B](other: RDD[(K, B)], partitioner: Partitioner)(implicit arg0: ClassTag[B]): RDD[(K, (A, B))]

    Similar to org.apache.spark.rdd.PairRDDFunctions.join, but ensures that all keys are unique in both RDDs.

    Similar to org.apache.spark.rdd.PairRDDFunctions.join, but ensures that all keys are unique in both RDDs.

    Throws java.lang.IllegalArgumentException if encounters duplicate

    B

    other

    returns

17. def joinUnique[B](other: RDD[(K, B)], numPartitions: Int)(implicit arg0: ClassTag[B]): RDD[(K, (A, B))]

    Similar to org.apache.spark.rdd.PairRDDFunctions.join, but ensures that all keys are unique in both RDDs.

    Similar to org.apache.spark.rdd.PairRDDFunctions.join, but ensures that all keys are unique in both RDDs.

    Throws java.lang.IllegalArgumentException if encounters duplicate

    B

    other

    returns

18. def joinUnique[B](other: RDD[(K, B)])(implicit arg0: ClassTag[B]): RDD[(K, (A, B))]

    Similar to org.apache.spark.rdd.PairRDDFunctions.join, but ensures that all keys are unique in both RDDs.

    Similar to org.apache.spark.rdd.PairRDDFunctions.join, but ensures that all keys are unique in both RDDs.

    Throws java.lang.IllegalArgumentException if encounters duplicate

    B

    other

    returns

19. def leftJoinUnique[B](other: RDD[(K, B)], partitioner: Partitioner)(implicit arg0: ClassTag[B]): RDD[(K, (A, Option[B]))]

    Similar to org.apache.spark.rdd.PairRDDFunctions.leftOuterJoin, but ensures that all keys are unique in both RDDs.

    Similar to org.apache.spark.rdd.PairRDDFunctions.leftOuterJoin, but ensures that all keys are unique in both RDDs.

    Throws java.lang.IllegalArgumentException if encounters duplicate

    B

    other

    returns

20. def leftJoinUnique[B](other: RDD[(K, B)], numPartitions: Int)(implicit arg0: ClassTag[B]): RDD[(K, (A, Option[B]))]

    Similar to org.apache.spark.rdd.PairRDDFunctions.leftOuterJoin, but ensures that all keys are unique in both RDDs.

    Similar to org.apache.spark.rdd.PairRDDFunctions.leftOuterJoin, but ensures that all keys are unique in both RDDs.

    Throws java.lang.IllegalArgumentException if encounters duplicate

    B

    other

    returns

21. def leftJoinUnique[B](other: RDD[(K, B)])(implicit arg0: ClassTag[B]): RDD[(K, (A, Option[B]))]

    Similar to org.apache.spark.rdd.PairRDDFunctions.leftOuterJoin, but ensures that all keys are unique in both RDDs.

    Similar to org.apache.spark.rdd.PairRDDFunctions.leftOuterJoin, but ensures that all keys are unique in both RDDs.

    Throws java.lang.IllegalArgumentException if encounters duplicate

    B

    other

    returns

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

    Definition Classes

    AnyRef

23. final def notify(): Unit

    Definition Classes

    AnyRef

24. final def notifyAll(): Unit

    Definition Classes

    AnyRef

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

    Definition Classes

    AnyRef

26. def toString(): String

    Definition Classes

    AnyRef → Any

27. final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )