Packages

c

com.datastax.spark.connector.util

MergeJoinIterator

class MergeJoinIterator[L, R, K] extends Iterator[(K, Seq[L], Seq[R])]

An iterator that preforms a mergeJoin between two ordered iterators joining on a given key. The input iterators are assumed to be ordered so we can do a greedy merge join. Since our iterators are lazy we cannot check that they are ordered before starting.

Example:

val list1 = Seq( (1, "a"), (2, "a") , (3, "a") )
val list2 = Seq( (1, "b"), (2, "b") , (3, "b") )
val iterator = new MergeJoinIterator(
  list1.iterator,
  list2.iterator,
  (x: (Int, String)) => x._1,
  (y: (Int, String)) => y._1
)
val result = iterator.toSeq
// (1, Seq((1, "a")), Seq((1, "b"))),
// (2, Seq((2, "a")), Seq((2, "b"))),
// (3, Seq((3, "a")), Seq((3, "b")))
Linear Supertypes
Iterator[(K, Seq[L], Seq[R])], TraversableOnce[(K, Seq[L], Seq[R])], GenTraversableOnce[(K, Seq[L], Seq[R])], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. MergeJoinIterator
  2. Iterator
  3. TraversableOnce
  4. GenTraversableOnce
  5. AnyRef
  6. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new MergeJoinIterator(iteratorLeft: Iterator[L], iteratorRight: Iterator[R], keyExtractLeft: (L) ⇒ K, keyExtractRight: (R) ⇒ K)(implicit order: Ordering[K])

Type Members

  1. class GroupedIterator[B >: A] extends AbstractIterator[Seq[B]] with Iterator[Seq[B]]
    Definition Classes
    Iterator

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. def ++[B >: (K, Seq[L], Seq[R])](that: ⇒ GenTraversableOnce[B]): Iterator[B]
    Definition Classes
    Iterator
  4. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  5. def addString(b: StringBuilder): StringBuilder
    Definition Classes
    TraversableOnce
  6. def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    TraversableOnce
  7. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    TraversableOnce
  8. def aggregate[B](z: ⇒ B)(seqop: (B, (K, Seq[L], Seq[R])) ⇒ B, combop: (B, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  9. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  10. def buffered: BufferedIterator[(K, Seq[L], Seq[R])]
    Definition Classes
    Iterator
  11. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native() @HotSpotIntrinsicCandidate()
  12. def collect[B](pf: PartialFunction[(K, Seq[L], Seq[R]), B]): Iterator[B]
    Definition Classes
    Iterator
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) collect has changed. The previous behavior can be reproduced with toSeq.

  13. def collectFirst[B](pf: PartialFunction[(K, Seq[L], Seq[R]), B]): Option[B]
    Definition Classes
    TraversableOnce
  14. def contains(elem: Any): Boolean
    Definition Classes
    Iterator
  15. def copyToArray[B >: (K, Seq[L], Seq[R])](xs: Array[B], start: Int, len: Int): Unit
    Definition Classes
    Iterator → TraversableOnce → GenTraversableOnce
  16. def copyToArray[B >: (K, Seq[L], Seq[R])](xs: Array[B]): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  17. def copyToArray[B >: (K, Seq[L], Seq[R])](xs: Array[B], start: Int): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  18. def copyToBuffer[B >: (K, Seq[L], Seq[R])](dest: Buffer[B]): Unit
    Definition Classes
    TraversableOnce
  19. def corresponds[B](that: GenTraversableOnce[B])(p: ((K, Seq[L], Seq[R]), B) ⇒ Boolean): Boolean
    Definition Classes
    Iterator
  20. def count(p: ((K, Seq[L], Seq[R])) ⇒ Boolean): Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  21. def drop(n: Int): Iterator[(K, Seq[L], Seq[R])]
    Definition Classes
    Iterator
  22. def dropWhile(p: ((K, Seq[L], Seq[R])) ⇒ Boolean): Iterator[(K, Seq[L], Seq[R])]
    Definition Classes
    Iterator
  23. def duplicate: (Iterator[(K, Seq[L], Seq[R])], Iterator[(K, Seq[L], Seq[R])])
    Definition Classes
    Iterator
  24. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  25. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  26. def exists(p: ((K, Seq[L], Seq[R])) ⇒ Boolean): Boolean
    Definition Classes
    Iterator → TraversableOnce → GenTraversableOnce
  27. def filter(p: ((K, Seq[L], Seq[R])) ⇒ Boolean): Iterator[(K, Seq[L], Seq[R])]
    Definition Classes
    Iterator
  28. def filterNot(p: ((K, Seq[L], Seq[R])) ⇒ Boolean): Iterator[(K, Seq[L], Seq[R])]
    Definition Classes
    Iterator
  29. def find(p: ((K, Seq[L], Seq[R])) ⇒ Boolean): Option[(K, Seq[L], Seq[R])]
    Definition Classes
    Iterator → TraversableOnce → GenTraversableOnce
  30. def flatMap[B](f: ((K, Seq[L], Seq[R])) ⇒ GenTraversableOnce[B]): Iterator[B]
    Definition Classes
    Iterator
  31. def fold[A1 >: (K, Seq[L], Seq[R])](z: A1)(op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  32. def foldLeft[B](z: B)(op: (B, (K, Seq[L], Seq[R])) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  33. def foldRight[B](z: B)(op: ((K, Seq[L], Seq[R]), B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  34. def forall(p: ((K, Seq[L], Seq[R])) ⇒ Boolean): Boolean
    Definition Classes
    Iterator → TraversableOnce → GenTraversableOnce
  35. def foreach[U](f: ((K, Seq[L], Seq[R])) ⇒ U): Unit
    Definition Classes
    Iterator → TraversableOnce → GenTraversableOnce
  36. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  37. def grouped[B >: (K, Seq[L], Seq[R])](size: Int): GroupedIterator[B]
    Definition Classes
    Iterator
  38. def hasDefiniteSize: Boolean
    Definition Classes
    Iterator → TraversableOnce → GenTraversableOnce
  39. def hasNext: Boolean
    Definition Classes
    MergeJoinIterator → Iterator
  40. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  41. def indexOf[B >: (K, Seq[L], Seq[R])](elem: B, from: Int): Int
    Definition Classes
    Iterator
  42. def indexOf[B >: (K, Seq[L], Seq[R])](elem: B): Int
    Definition Classes
    Iterator
  43. def indexWhere(p: ((K, Seq[L], Seq[R])) ⇒ Boolean, from: Int): Int
    Definition Classes
    Iterator
  44. def indexWhere(p: ((K, Seq[L], Seq[R])) ⇒ Boolean): Int
    Definition Classes
    Iterator
  45. def isEmpty: Boolean
    Definition Classes
    Iterator → TraversableOnce → GenTraversableOnce
  46. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  47. def isTraversableAgain: Boolean
    Definition Classes
    Iterator → GenTraversableOnce
  48. def length: Int
    Definition Classes
    Iterator
  49. def map[B](f: ((K, Seq[L], Seq[R])) ⇒ B): Iterator[B]
    Definition Classes
    Iterator
  50. def max[B >: (K, Seq[L], Seq[R])](implicit cmp: Ordering[B]): (K, Seq[L], Seq[R])
    Definition Classes
    TraversableOnce → GenTraversableOnce
  51. def maxBy[B](f: ((K, Seq[L], Seq[R])) ⇒ B)(implicit cmp: Ordering[B]): (K, Seq[L], Seq[R])
    Definition Classes
    TraversableOnce → GenTraversableOnce
  52. def min[B >: (K, Seq[L], Seq[R])](implicit cmp: Ordering[B]): (K, Seq[L], Seq[R])
    Definition Classes
    TraversableOnce → GenTraversableOnce
  53. def minBy[B](f: ((K, Seq[L], Seq[R])) ⇒ B)(implicit cmp: Ordering[B]): (K, Seq[L], Seq[R])
    Definition Classes
    TraversableOnce → GenTraversableOnce
  54. def mkString: String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  55. def mkString(sep: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  56. def mkString(start: String, sep: String, end: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  57. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  58. def next(): (K, Seq[L], Seq[R])

    We need to determine which iterator is behind since we are assuming sorted order.

    We need to determine which iterator is behind since we are assuming sorted order. We then pull all the elements from that iterator as long as the key matches, then pull all the elements from the right iterator.

    Definition Classes
    MergeJoinIterator → Iterator
  59. def nonEmpty: Boolean
    Definition Classes
    TraversableOnce → GenTraversableOnce
  60. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  61. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  62. def padTo[A1 >: (K, Seq[L], Seq[R])](len: Int, elem: A1): Iterator[A1]
    Definition Classes
    Iterator
  63. def partition(p: ((K, Seq[L], Seq[R])) ⇒ Boolean): (Iterator[(K, Seq[L], Seq[R])], Iterator[(K, Seq[L], Seq[R])])
    Definition Classes
    Iterator
  64. def patch[B >: (K, Seq[L], Seq[R])](from: Int, patchElems: Iterator[B], replaced: Int): Iterator[B]
    Definition Classes
    Iterator
  65. def product[B >: (K, Seq[L], Seq[R])](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  66. def reduce[A1 >: (K, Seq[L], Seq[R])](op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  67. def reduceLeft[B >: (K, Seq[L], Seq[R])](op: (B, (K, Seq[L], Seq[R])) ⇒ B): B
    Definition Classes
    TraversableOnce
  68. def reduceLeftOption[B >: (K, Seq[L], Seq[R])](op: (B, (K, Seq[L], Seq[R])) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  69. def reduceOption[A1 >: (K, Seq[L], Seq[R])](op: (A1, A1) ⇒ A1): Option[A1]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  70. def reduceRight[B >: (K, Seq[L], Seq[R])](op: ((K, Seq[L], Seq[R]), B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  71. def reduceRightOption[B >: (K, Seq[L], Seq[R])](op: ((K, Seq[L], Seq[R]), B) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  72. def reversed: List[(K, Seq[L], Seq[R])]
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  73. def sameElements(that: Iterator[_]): Boolean
    Definition Classes
    Iterator
  74. def scanLeft[B](z: B)(op: (B, (K, Seq[L], Seq[R])) ⇒ B): Iterator[B]
    Definition Classes
    Iterator
  75. def scanRight[B](z: B)(op: ((K, Seq[L], Seq[R]), B) ⇒ B): Iterator[B]
    Definition Classes
    Iterator
  76. def seq: Iterator[(K, Seq[L], Seq[R])]
    Definition Classes
    Iterator → TraversableOnce → GenTraversableOnce
  77. def size: Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  78. def sizeHintIfCheap: Int
    Attributes
    protected[collection]
    Definition Classes
    GenTraversableOnce
  79. def slice(from: Int, until: Int): Iterator[(K, Seq[L], Seq[R])]
    Definition Classes
    Iterator
  80. def sliceIterator(from: Int, until: Int): Iterator[(K, Seq[L], Seq[R])]
    Attributes
    protected
    Definition Classes
    Iterator
  81. def sliding[B >: (K, Seq[L], Seq[R])](size: Int, step: Int): GroupedIterator[B]
    Definition Classes
    Iterator
  82. def span(p: ((K, Seq[L], Seq[R])) ⇒ Boolean): (Iterator[(K, Seq[L], Seq[R])], Iterator[(K, Seq[L], Seq[R])])
    Definition Classes
    Iterator
  83. def sum[B >: (K, Seq[L], Seq[R])](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  84. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  85. def take(n: Int): Iterator[(K, Seq[L], Seq[R])]
    Definition Classes
    Iterator
  86. def takeWhile(p: ((K, Seq[L], Seq[R])) ⇒ Boolean): Iterator[(K, Seq[L], Seq[R])]
    Definition Classes
    Iterator
  87. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, (K, Seq[L], Seq[R]), Col[(K, Seq[L], Seq[R])]]): Col[(K, Seq[L], Seq[R])]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  88. def toArray[B >: (K, Seq[L], Seq[R])](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  89. def toBuffer[B >: (K, Seq[L], Seq[R])]: Buffer[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  90. def toIndexedSeq: IndexedSeq[(K, Seq[L], Seq[R])]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  91. def toIterable: Iterable[(K, Seq[L], Seq[R])]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  92. def toIterator: Iterator[(K, Seq[L], Seq[R])]
    Definition Classes
    Iterator → GenTraversableOnce
  93. def toList: List[(K, Seq[L], Seq[R])]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  94. def toMap[T, U](implicit ev: <:<[(K, Seq[L], Seq[R]), (T, U)]): Map[T, U]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  95. def toSeq: Seq[(K, Seq[L], Seq[R])]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  96. def toSet[B >: (K, Seq[L], Seq[R])]: Set[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  97. def toStream: Stream[(K, Seq[L], Seq[R])]
    Definition Classes
    Iterator → GenTraversableOnce
  98. def toString(): String
    Definition Classes
    Iterator → AnyRef → Any
  99. def toTraversable: Traversable[(K, Seq[L], Seq[R])]
    Definition Classes
    Iterator → TraversableOnce → GenTraversableOnce
  100. def toVector: Vector[(K, Seq[L], Seq[R])]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  101. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  102. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  103. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  104. def withFilter(p: ((K, Seq[L], Seq[R])) ⇒ Boolean): Iterator[(K, Seq[L], Seq[R])]
    Definition Classes
    Iterator
  105. def zip[B](that: Iterator[B]): Iterator[((K, Seq[L], Seq[R]), B)]
    Definition Classes
    Iterator
  106. def zipAll[B, A1 >: (K, Seq[L], Seq[R]), B1 >: B](that: Iterator[B], thisElem: A1, thatElem: B1): Iterator[(A1, B1)]
    Definition Classes
    Iterator
  107. def zipWithIndex: Iterator[((K, Seq[L], Seq[R]), Int)]
    Definition Classes
    Iterator

Deprecated Value Members

  1. def /:[B](z: B)(op: (B, (K, Seq[L], Seq[R])) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
    Annotations
    @deprecated
    Deprecated

    (Since version 2.12.10) Use foldLeft instead of /:

  2. def :\[B](z: B)(op: ((K, Seq[L], Seq[R]), B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
    Annotations
    @deprecated
    Deprecated

    (Since version 2.12.10) Use foldRight instead of :\

  3. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] ) @Deprecated @deprecated
    Deprecated

    (Since version ) see corresponding Javadoc for more information.

Inherited from Iterator[(K, Seq[L], Seq[R])]

Inherited from TraversableOnce[(K, Seq[L], Seq[R])]

Inherited from GenTraversableOnce[(K, Seq[L], Seq[R])]

Inherited from AnyRef

Inherited from Any

Ungrouped