Class/Object

com.tresata.spark.sorted

GroupSorted

Related Docs: object GroupSorted | package sorted

Permalink

class GroupSorted[K, V] extends RDD[(K, V)]

GroupSorted is a partitioned key-value RDD where the values for a given key are consecutive and within a single partition. The keys are sorted within a partition (using a custom hash based Ordering). The values can also be optionally sorted per key.

Linear Supertypes
RDD[(K, V)], Logging, Serializable, Serializable, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. GroupSorted
  2. RDD
  3. Logging
  4. Serializable
  5. Serializable
  6. AnyRef
  7. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Value Members

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

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

    Permalink
    Definition Classes
    AnyRef → Any
  3. def ++(other: RDD[(K, V)]): RDD[(K, V)]

    Permalink
    Definition Classes
    RDD
  4. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  5. def aggregate[U](zeroValue: U)(seqOp: (U, (K, V)) ⇒ U, combOp: (U, U) ⇒ U)(implicit arg0: ClassTag[U]): U

    Permalink
    Definition Classes
    RDD
  6. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  7. def barrier(): RDDBarrier[(K, V)]

    Permalink
    Definition Classes
    RDD
    Annotations
    @Experimental() @Since( "2.4.0" )
  8. def cache(): GroupSorted.this.type

    Permalink
    Definition Classes
    RDD
  9. def cartesian[U](other: RDD[U])(implicit arg0: ClassTag[U]): RDD[((K, V), U)]

    Permalink
    Definition Classes
    RDD
  10. def checkpoint(): Unit

    Permalink
    Definition Classes
    RDD
  11. def clearDependencies(): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    RDD
  12. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  13. def coalesce(numPartitions: Int, shuffle: Boolean, partitionCoalescer: Option[PartitionCoalescer])(implicit ord: Ordering[(K, V)]): RDD[(K, V)]

    Permalink
    Definition Classes
    RDD
  14. def collect[U](f: PartialFunction[(K, V), U])(implicit arg0: ClassTag[U]): RDD[U]

    Permalink
    Definition Classes
    RDD
  15. def collect(): Array[(K, V)]

    Permalink
    Definition Classes
    RDD
  16. def compute(split: Partition, context: TaskContext): Iterator[(K, V)]

    Permalink
    Definition Classes
    GroupSorted → RDD
  17. def context: SparkContext

    Permalink
    Definition Classes
    RDD
  18. def count(): Long

    Permalink
    Definition Classes
    RDD
  19. def countApprox(timeout: Long, confidence: Double): PartialResult[BoundedDouble]

    Permalink
    Definition Classes
    RDD
  20. def countApproxDistinct(relativeSD: Double): Long

    Permalink
    Definition Classes
    RDD
  21. def countApproxDistinct(p: Int, sp: Int): Long

    Permalink
    Definition Classes
    RDD
  22. def countByValue()(implicit ord: Ordering[(K, V)]): Map[(K, V), Long]

    Permalink
    Definition Classes
    RDD
  23. def countByValueApprox(timeout: Long, confidence: Double)(implicit ord: Ordering[(K, V)]): PartialResult[Map[(K, V), BoundedDouble]]

    Permalink
    Definition Classes
    RDD
  24. final def dependencies: Seq[Dependency[_]]

    Permalink
    Definition Classes
    RDD
  25. def distinct(): RDD[(K, V)]

    Permalink
    Definition Classes
    RDD
  26. def distinct(numPartitions: Int)(implicit ord: Ordering[(K, V)]): RDD[(K, V)]

    Permalink
    Definition Classes
    RDD
  27. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  28. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  29. def filter(f: ((K, V)) ⇒ Boolean): GroupSorted[K, V]

    Permalink
    Definition Classes
    GroupSorted → RDD
  30. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  31. def first(): (K, V)

    Permalink
    Definition Classes
    RDD
  32. def firstParent[U](implicit arg0: ClassTag[U]): RDD[U]

    Permalink
    Attributes
    protected[org.apache.spark]
    Definition Classes
    RDD
  33. def flatMap[U](f: ((K, V)) ⇒ TraversableOnce[U])(implicit arg0: ClassTag[U]): RDD[U]

    Permalink
    Definition Classes
    RDD
  34. def flatMapValues[W](f: (V) ⇒ TraversableOnce[W])(implicit arg0: ClassTag[W]): GroupSorted[K, W]

    Permalink
  35. def fold(zeroValue: (K, V))(op: ((K, V), (K, V)) ⇒ (K, V)): (K, V)

    Permalink
    Definition Classes
    RDD
  36. def foldLeftByKey[W](w: W)(f: (W, V) ⇒ W)(implicit arg0: ClassTag[W]): GroupSorted[K, W]

    Permalink
  37. def foreach(f: ((K, V)) ⇒ Unit): Unit

    Permalink
    Definition Classes
    RDD
  38. def foreachPartition(f: (Iterator[(K, V)]) ⇒ Unit): Unit

    Permalink
    Definition Classes
    RDD
  39. def getCheckpointFile: Option[String]

    Permalink
    Definition Classes
    RDD
  40. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  41. def getDependencies: Seq[Dependency[_]]

    Permalink
    Attributes
    protected
    Definition Classes
    RDD
  42. final def getNumPartitions: Int

    Permalink
    Definition Classes
    RDD
    Annotations
    @Since( "1.6.0" )
  43. def getOutputDeterministicLevel: org.apache.spark.rdd.DeterministicLevel.Value

    Permalink
    Attributes
    protected
    Definition Classes
    RDD
    Annotations
    @DeveloperApi()
  44. def getPartitions: Array[Partition]

    Permalink
    Definition Classes
    GroupSorted → RDD
  45. def getPreferredLocations(split: Partition): Seq[String]

    Permalink
    Attributes
    protected
    Definition Classes
    RDD
  46. def getStorageLevel: StorageLevel

    Permalink
    Definition Classes
    RDD
  47. def glom(): RDD[Array[(K, V)]]

    Permalink
    Definition Classes
    RDD
  48. def groupBy[K](f: ((K, V)) ⇒ K, p: Partitioner)(implicit kt: ClassTag[K], ord: Ordering[K]): RDD[(K, Iterable[(K, V)])]

    Permalink
    Definition Classes
    RDD
  49. def groupBy[K](f: ((K, V)) ⇒ K, numPartitions: Int)(implicit kt: ClassTag[K]): RDD[(K, Iterable[(K, V)])]

    Permalink
    Definition Classes
    RDD
  50. def groupBy[K](f: ((K, V)) ⇒ K)(implicit kt: ClassTag[K]): RDD[(K, Iterable[(K, V)])]

    Permalink
    Definition Classes
    RDD
  51. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  52. val id: Int

    Permalink
    Definition Classes
    RDD
  53. def initializeLogIfNecessary(isInterpreter: Boolean, silent: Boolean): Boolean

    Permalink
    Attributes
    protected
    Definition Classes
    Logging
  54. def initializeLogIfNecessary(isInterpreter: Boolean): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    Logging
  55. def intersection(other: RDD[(K, V)], numPartitions: Int): RDD[(K, V)]

    Permalink
    Definition Classes
    RDD
  56. def intersection(other: RDD[(K, V)], partitioner: Partitioner)(implicit ord: Ordering[(K, V)]): RDD[(K, V)]

    Permalink
    Definition Classes
    RDD
  57. def intersection(other: RDD[(K, V)]): RDD[(K, V)]

    Permalink
    Definition Classes
    RDD
  58. lazy val isBarrier_: Boolean

    Permalink
    Attributes
    protected
    Definition Classes
    RDD
  59. def isCheckpointed: Boolean

    Permalink
    Definition Classes
    RDD
  60. def isEmpty(): Boolean

    Permalink
    Definition Classes
    RDD
  61. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  62. def isTraceEnabled(): Boolean

    Permalink
    Attributes
    protected
    Definition Classes
    Logging
  63. final def iterator(split: Partition, context: TaskContext): Iterator[(K, V)]

    Permalink
    Definition Classes
    RDD
  64. def keyBy[K](f: ((K, V)) ⇒ K): RDD[(K, (K, V))]

    Permalink
    Definition Classes
    RDD
  65. val keyOrdering: Ordering[K]

    Permalink
  66. def localCheckpoint(): GroupSorted.this.type

    Permalink
    Definition Classes
    RDD
  67. def log: Logger

    Permalink
    Attributes
    protected
    Definition Classes
    Logging
  68. def logDebug(msg: ⇒ String, throwable: Throwable): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    Logging
  69. def logDebug(msg: ⇒ String): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    Logging
  70. def logError(msg: ⇒ String, throwable: Throwable): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    Logging
  71. def logError(msg: ⇒ String): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    Logging
  72. def logInfo(msg: ⇒ String, throwable: Throwable): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    Logging
  73. def logInfo(msg: ⇒ String): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    Logging
  74. def logName: String

    Permalink
    Attributes
    protected
    Definition Classes
    Logging
  75. def logTrace(msg: ⇒ String, throwable: Throwable): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    Logging
  76. def logTrace(msg: ⇒ String): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    Logging
  77. def logWarning(msg: ⇒ String, throwable: Throwable): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    Logging
  78. def logWarning(msg: ⇒ String): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    Logging
  79. def map[U](f: ((K, V)) ⇒ U)(implicit arg0: ClassTag[U]): RDD[U]

    Permalink
    Definition Classes
    RDD
  80. def mapKeyValuesToValues[W](f: ((K, V)) ⇒ W)(implicit arg0: ClassTag[W]): GroupSorted[K, W]

    Permalink
  81. def mapPartitions[U](f: (Iterator[(K, V)]) ⇒ Iterator[U], preservesPartitioning: Boolean)(implicit arg0: ClassTag[U]): RDD[U]

    Permalink
    Definition Classes
    RDD
  82. def mapPartitionsWithIndex[U](f: (Int, Iterator[(K, V)]) ⇒ Iterator[U], preservesPartitioning: Boolean)(implicit arg0: ClassTag[U]): RDD[U]

    Permalink
    Definition Classes
    RDD
  83. def mapStreamByKey[W, C](c: () ⇒ C)(f: (C, Iterator[V]) ⇒ TraversableOnce[W])(implicit arg0: ClassTag[W]): GroupSorted[K, W]

    Permalink
  84. def mapStreamByKey[W](f: (Iterator[V]) ⇒ TraversableOnce[W])(implicit arg0: ClassTag[W]): GroupSorted[K, W]

    Permalink
  85. def mapValues[W](f: (V) ⇒ W)(implicit arg0: ClassTag[W]): GroupSorted[K, W]

    Permalink
  86. def max()(implicit ord: Ordering[(K, V)]): (K, V)

    Permalink
    Definition Classes
    RDD
  87. def mergeJoin[W](other: GroupSorted[K, W], bufferLeft: Boolean = false)(implicit arg0: ClassTag[W]): GroupSorted[K, (Option[V], Option[W])]

    Permalink
  88. def mergeJoin[W, U](other: GroupSorted[K, W], f: (Iterator[V], Iterator[W]) ⇒ TraversableOnce[U])(implicit arg0: ClassTag[W], arg1: ClassTag[U]): GroupSorted[K, U]

    Permalink
  89. def mergeJoinInner[W](other: GroupSorted[K, W], bufferLeft: Boolean = false)(implicit arg0: ClassTag[W]): GroupSorted[K, (V, W)]

    Permalink
  90. def mergeJoinLeftOuter[W](other: GroupSorted[K, W], bufferLeft: Boolean = false)(implicit arg0: ClassTag[W]): GroupSorted[K, (V, Option[W])]

    Permalink
  91. def mergeJoinRightOuter[W](other: GroupSorted[K, W], bufferLeft: Boolean = false)(implicit arg0: ClassTag[W]): GroupSorted[K, (Option[V], W)]

    Permalink
  92. def mergeUnion(other: GroupSorted[K, V]): GroupSorted[K, V]

    Permalink
  93. def min()(implicit ord: Ordering[(K, V)]): (K, V)

    Permalink
    Definition Classes
    RDD
  94. var name: String

    Permalink
    Definition Classes
    RDD
  95. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  96. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  97. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  98. def parent[U](j: Int)(implicit arg0: ClassTag[U]): RDD[U]

    Permalink
    Attributes
    protected[org.apache.spark]
    Definition Classes
    RDD
  99. val partitioner: Option[Partitioner]

    Permalink
    Definition Classes
    GroupSorted → RDD
  100. final def partitions: Array[Partition]

    Permalink
    Definition Classes
    RDD
  101. def persist(): GroupSorted.this.type

    Permalink
    Definition Classes
    RDD
  102. def persist(newLevel: StorageLevel): GroupSorted.this.type

    Permalink
    Definition Classes
    RDD
  103. def pipe(command: Seq[String], env: Map[String, String], printPipeContext: ((String) ⇒ Unit) ⇒ Unit, printRDDElement: ((K, V), (String) ⇒ Unit) ⇒ Unit, separateWorkingDir: Boolean, bufferSize: Int, encoding: String): RDD[String]

    Permalink
    Definition Classes
    RDD
  104. def pipe(command: String, env: Map[String, String]): RDD[String]

    Permalink
    Definition Classes
    RDD
  105. def pipe(command: String): RDD[String]

    Permalink
    Definition Classes
    RDD
  106. final def preferredLocations(split: Partition): Seq[String]

    Permalink
    Definition Classes
    RDD
  107. def randomSplit(weights: Array[Double], seed: Long): Array[RDD[(K, V)]]

    Permalink
    Definition Classes
    RDD
  108. def reduce(f: ((K, V), (K, V)) ⇒ (K, V)): (K, V)

    Permalink
    Definition Classes
    RDD
  109. def reduceLeftByKey[W >: V](f: (W, V) ⇒ W)(implicit arg0: ClassTag[W]): GroupSorted[K, W]

    Permalink
  110. def repartition(numPartitions: Int)(implicit ord: Ordering[(K, V)]): RDD[(K, V)]

    Permalink
    Definition Classes
    RDD
  111. def sample(withReplacement: Boolean, fraction: Double, seed: Long): RDD[(K, V)]

    Permalink
    Definition Classes
    RDD
  112. def saveAsObjectFile(path: String): Unit

    Permalink
    Definition Classes
    RDD
  113. def saveAsTextFile(path: String, codec: Class[_ <: CompressionCodec]): Unit

    Permalink
    Definition Classes
    RDD
  114. def saveAsTextFile(path: String): Unit

    Permalink
    Definition Classes
    RDD
  115. def scanLeftByKey[W](w: W)(f: (W, V) ⇒ W)(implicit arg0: ClassTag[W]): GroupSorted[K, W]

    Permalink
  116. def setName(_name: String): GroupSorted.this.type

    Permalink
    Definition Classes
    RDD
  117. def sortBy[K](f: ((K, V)) ⇒ K, ascending: Boolean, numPartitions: Int)(implicit ord: Ordering[K], ctag: ClassTag[K]): RDD[(K, V)]

    Permalink
    Definition Classes
    RDD
  118. def sparkContext: SparkContext

    Permalink
    Definition Classes
    RDD
  119. def subtract(other: RDD[(K, V)], p: Partitioner)(implicit ord: Ordering[(K, V)]): RDD[(K, V)]

    Permalink
    Definition Classes
    RDD
  120. def subtract(other: RDD[(K, V)], numPartitions: Int): RDD[(K, V)]

    Permalink
    Definition Classes
    RDD
  121. def subtract(other: RDD[(K, V)]): RDD[(K, V)]

    Permalink
    Definition Classes
    RDD
  122. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  123. def take(num: Int): Array[(K, V)]

    Permalink
    Definition Classes
    RDD
  124. def takeOrdered(num: Int)(implicit ord: Ordering[(K, V)]): Array[(K, V)]

    Permalink
    Definition Classes
    RDD
  125. def takeSample(withReplacement: Boolean, num: Int, seed: Long): Array[(K, V)]

    Permalink
    Definition Classes
    RDD
  126. def toDebugString: String

    Permalink
    Definition Classes
    RDD
  127. def toJavaRDD(): JavaRDD[(K, V)]

    Permalink
    Definition Classes
    RDD
  128. def toLocalIterator: Iterator[(K, V)]

    Permalink
    Definition Classes
    RDD
  129. def toString(): String

    Permalink
    Definition Classes
    RDD → AnyRef → Any
  130. def top(num: Int)(implicit ord: Ordering[(K, V)]): Array[(K, V)]

    Permalink
    Definition Classes
    RDD
  131. def treeAggregate[U](zeroValue: U)(seqOp: (U, (K, V)) ⇒ U, combOp: (U, U) ⇒ U, depth: Int)(implicit arg0: ClassTag[U]): U

    Permalink
    Definition Classes
    RDD
  132. def treeReduce(f: ((K, V), (K, V)) ⇒ (K, V), depth: Int): (K, V)

    Permalink
    Definition Classes
    RDD
  133. def union(other: RDD[(K, V)]): RDD[(K, V)]

    Permalink
    Definition Classes
    RDD
  134. def unpersist(blocking: Boolean): GroupSorted.this.type

    Permalink
    Definition Classes
    RDD
  135. val valueOrdering: Option[Ordering[V]]

    Permalink
  136. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  137. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  138. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  139. def zip[U](other: RDD[U])(implicit arg0: ClassTag[U]): RDD[((K, V), U)]

    Permalink
    Definition Classes
    RDD
  140. def zipPartitions[B, C, D, V](rdd2: RDD[B], rdd3: RDD[C], rdd4: RDD[D])(f: (Iterator[(K, V)], Iterator[B], Iterator[C], Iterator[D]) ⇒ Iterator[V])(implicit arg0: ClassTag[B], arg1: ClassTag[C], arg2: ClassTag[D], arg3: ClassTag[V]): RDD[V]

    Permalink
    Definition Classes
    RDD
  141. def zipPartitions[B, C, D, V](rdd2: RDD[B], rdd3: RDD[C], rdd4: RDD[D], preservesPartitioning: Boolean)(f: (Iterator[(K, V)], Iterator[B], Iterator[C], Iterator[D]) ⇒ Iterator[V])(implicit arg0: ClassTag[B], arg1: ClassTag[C], arg2: ClassTag[D], arg3: ClassTag[V]): RDD[V]

    Permalink
    Definition Classes
    RDD
  142. def zipPartitions[B, C, V](rdd2: RDD[B], rdd3: RDD[C])(f: (Iterator[(K, V)], Iterator[B], Iterator[C]) ⇒ Iterator[V])(implicit arg0: ClassTag[B], arg1: ClassTag[C], arg2: ClassTag[V]): RDD[V]

    Permalink
    Definition Classes
    RDD
  143. def zipPartitions[B, C, V](rdd2: RDD[B], rdd3: RDD[C], preservesPartitioning: Boolean)(f: (Iterator[(K, V)], Iterator[B], Iterator[C]) ⇒ Iterator[V])(implicit arg0: ClassTag[B], arg1: ClassTag[C], arg2: ClassTag[V]): RDD[V]

    Permalink
    Definition Classes
    RDD
  144. def zipPartitions[B, V](rdd2: RDD[B])(f: (Iterator[(K, V)], Iterator[B]) ⇒ Iterator[V])(implicit arg0: ClassTag[B], arg1: ClassTag[V]): RDD[V]

    Permalink
    Definition Classes
    RDD
  145. def zipPartitions[B, V](rdd2: RDD[B], preservesPartitioning: Boolean)(f: (Iterator[(K, V)], Iterator[B]) ⇒ Iterator[V])(implicit arg0: ClassTag[B], arg1: ClassTag[V]): RDD[V]

    Permalink
    Definition Classes
    RDD
  146. def zipWithIndex(): RDD[((K, V), Long)]

    Permalink
    Definition Classes
    RDD
  147. def zipWithUniqueId(): RDD[((K, V), Long)]

    Permalink
    Definition Classes
    RDD

Inherited from RDD[(K, V)]

Inherited from Logging

Inherited from Serializable

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped