CoGroupedRDD

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. def ++(other: RDD[(K, Seq[Seq[_]])]): RDD[(K, Seq[Seq[_]])]

   Definition Classes

   RDD

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

   Definition Classes

   AnyRef

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

   Definition Classes

   Any

7. val aggr: CoGroupAggregator

8. def aggregate[U](zeroValue: U)(seqOp: (U, (K, Seq[Seq[_]])) ⇒ U, combOp: (U, U) ⇒ U)(implicit arg0: ClassManifest[U]): U

   Aggregate the elements of each partition, and then the results for all the partitions, using given combine functions and a neutral "zero value".

   Aggregate the elements of each partition, and then the results for all the partitions, using given combine functions and a neutral "zero value". This function can return a different result type, U, than the type of this RDD, T. Thus, we need one operation for merging a T into an U and one operation for merging two U's, as in scala.TraversableOnce. Both of these functions are allowed to modify and return their first argument instead of creating a new U to avoid memory allocation.

   Definition Classes

   RDD

9. final def asInstanceOf[T0]: T0

   Definition Classes

   Any

10. def cache(): RDD[(K, Seq[Seq[_]])]

    Definition Classes

    RDD

11. def cartesian[U](other: RDD[U])(implicit arg0: ClassManifest[U]): RDD[((K, Seq[Seq[_]]), U)]

    Definition Classes

    RDD

12. def clone(): AnyRef

    Attributes

    protected[lang]

    Definition Classes

    AnyRef

    Annotations

    @throws()

13. def collect(): Array[(K, Seq[Seq[_]])]

    Definition Classes

    RDD

14. def compute(s: Split): Iterator[(K, Seq[Seq[_]])]

    Definition Classes

    CoGroupedRDD → RDD

15. def context: SparkContext

    Definition Classes

    RDD

16. def count(): Long

    Definition Classes

    RDD

17. val dependencies: List[spark.Dependency[_]]

    Definition Classes

    CoGroupedRDD → RDD

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

    Definition Classes

    AnyRef

19. def equals(arg0: Any): Boolean

    Definition Classes

    AnyRef → Any

20. def filter(f: ((K, Seq[Seq[_]])) ⇒ Boolean): RDD[(K, Seq[Seq[_]])]

    Definition Classes

    RDD

21. def finalize(): Unit

    Attributes

    protected[lang]

    Definition Classes

    AnyRef

    Annotations

    @throws()

22. def first(): (K, Seq[Seq[_]])

    Definition Classes

    RDD

23. def flatMap[U](f: ((K, Seq[Seq[_]])) ⇒ TraversableOnce[U])(implicit arg0: ClassManifest[U]): RDD[U]

    Definition Classes

    RDD

24. def fold(zeroValue: (K, Seq[Seq[_]]))(op: ((K, Seq[Seq[_]]), (K, Seq[Seq[_]])) ⇒ (K, Seq[Seq[_]])): (K, Seq[Seq[_]])

    Aggregate the elements of each partition, and then the results for all the partitions, using a given associative function and a neutral "zero value".

    Aggregate the elements of each partition, and then the results for all the partitions, using a given associative function and a neutral "zero value". The function op(t1, t2) is allowed to modify t1 and return it as its result value to avoid object allocation; however, it should not modify t2.

    Definition Classes

    RDD

25. def foreach(f: ((K, Seq[Seq[_]])) ⇒ Unit): Unit

    Definition Classes

    RDD

26. final def getClass(): java.lang.Class[_]

    Definition Classes

    AnyRef → Any

27. def glom(): RDD[Array[(K, Seq[Seq[_]])]]

    Definition Classes

    RDD

28. def groupBy[K](f: ((K, Seq[Seq[_]])) ⇒ K)(implicit arg0: ClassManifest[K]): RDD[(K, Seq[(K, Seq[Seq[_]])])]

    Definition Classes

    RDD

29. def groupBy[K](f: ((K, Seq[Seq[_]])) ⇒ K, numSplits: Int)(implicit arg0: ClassManifest[K]): RDD[(K, Seq[(K, Seq[Seq[_]])])]

    Definition Classes

    RDD

30. def hashCode(): Int

    Definition Classes

    AnyRef → Any

31. val id: Int

    Definition Classes

    RDD

32. def initLogging(): Unit

    Definition Classes

    Logging

33. final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

34. final def iterator(split: Split): Iterator[(K, Seq[Seq[_]])]

    Definition Classes

    RDD

35. def log: Logger

    Definition Classes

    Logging

36. def logDebug(msg: ⇒ String, throwable: Throwable): Unit

    Definition Classes

    Logging

37. def logDebug(msg: ⇒ String): Unit

    Definition Classes

    Logging

38. def logError(msg: ⇒ String, throwable: Throwable): Unit

    Definition Classes

    Logging

39. def logError(msg: ⇒ String): Unit

    Definition Classes

    Logging

40. def logInfo(msg: ⇒ String, throwable: Throwable): Unit

    Definition Classes

    Logging

41. def logInfo(msg: ⇒ String): Unit

    Definition Classes

    Logging

42. def logWarning(msg: ⇒ String, throwable: Throwable): Unit

    Definition Classes

    Logging

43. def logWarning(msg: ⇒ String): Unit

    Definition Classes

    Logging

44. def map[U](f: ((K, Seq[Seq[_]])) ⇒ U)(implicit arg0: ClassManifest[U]): RDD[U]

    Definition Classes

    RDD

45. def mapPartitions[U](f: (Iterator[(K, Seq[Seq[_]])]) ⇒ Iterator[U])(implicit arg0: ClassManifest[U]): RDD[U]

    Definition Classes

    RDD

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

    Definition Classes

    AnyRef

47. final def notify(): Unit

    Definition Classes

    AnyRef

48. final def notifyAll(): Unit

    Definition Classes

    AnyRef

49. val partitioner: Some[Partitioner]

    Definition Classes

    CoGroupedRDD → RDD

50. def pipe(command: Seq[String], env: Map[String, String]): RDD[String]

    Definition Classes

    RDD

51. def pipe(command: Seq[String]): RDD[String]

    Definition Classes

    RDD

52. def pipe(command: String): RDD[String]

    Definition Classes

    RDD

53. def preferredLocations(s: Split): scala.collection.immutable.Nil.type

    Definition Classes

    CoGroupedRDD → RDD

54. def reduce(f: ((K, Seq[Seq[_]]), (K, Seq[Seq[_]])) ⇒ (K, Seq[Seq[_]])): (K, Seq[Seq[_]])

    Definition Classes

    RDD

55. def sample(withReplacement: Boolean, fraction: Double, seed: Int): RDD[(K, Seq[Seq[_]])]

    Definition Classes

    RDD

56. def saveAsObjectFile(path: String): Unit

    Definition Classes

    RDD

57. def saveAsTextFile(path: String): Unit

    Definition Classes

    RDD

58. def splits: Array[Split]

    Definition Classes

    CoGroupedRDD → RDD

59. val splits_: Array[Split]

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

    Definition Classes

    AnyRef

61. def take(num: Int): Array[(K, Seq[Seq[_]])]

    Take the first num elements of the RDD.

    Take the first num elements of the RDD. This currently scans the partitions *one by one*, so it will be slow if a lot of partitions are required. In that case, use collect() to get the whole RDD instead.

    Definition Classes

    RDD

62. def takeSample(withReplacement: Boolean, num: Int, seed: Int): Array[(K, Seq[Seq[_]])]

    Definition Classes

    RDD

63. def toArray(): Array[(K, Seq[Seq[_]])]

    Definition Classes

    RDD

64. def toString(): String

    Definition Classes

    AnyRef → Any

65. def union(other: RDD[(K, Seq[Seq[_]])]): RDD[(K, Seq[Seq[_]])]

    Definition Classes

    RDD

66. final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws()

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

    Definition Classes

    AnyRef

    Annotations

    @throws()

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

    Definition Classes

    AnyRef

    Annotations

    @throws()