Class

com.datastax.spark.connector.util

MergeJoinIterator

Related Doc: package util

Permalink

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])

    Permalink

Type Members

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

    Permalink
    Definition Classes
    Iterator

Value Members

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

    Permalink
    Definition Classes
    AnyRef → Any

  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  3. def ++[B >: (K, Seq[L], Seq[R])](that: ⇒ GenTraversableOnce[B]): Iterator[B]

    Permalink
    Definition Classes
    Iterator

  4. def /:[B](z: B)(op: (B, (K, Seq[L], Seq[R])) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  5. def :\[B](z: B)(op: ((K, Seq[L], Seq[R]), B) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Permalink
    Definition Classes
    AnyRef → Any

  7. def addString(b: StringBuilder): StringBuilder

    Permalink
    Definition Classes
    TraversableOnce

  8. def addString(b: StringBuilder, sep: String): StringBuilder

    Permalink
    Definition Classes
    TraversableOnce

  9. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

    Permalink
    Definition Classes
    TraversableOnce

  10. def aggregate[B](z: ⇒ B)(seqop: (B, (K, Seq[L], Seq[R])) ⇒ B, combop: (B, B) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  11. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  12. def buffered: BufferedIterator[(K, Seq[L], Seq[R])]

    Permalink
    Definition Classes
    Iterator

  13. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  14. def collect[B](pf: PartialFunction[(K, Seq[L], Seq[R]), B]): Iterator[B]

    Permalink
    Definition Classes
    Iterator
    Annotations
    @migration
    Migration

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

  15. def collectFirst[B](pf: PartialFunction[(K, Seq[L], Seq[R]), B]): Option[B]

    Permalink
    Definition Classes
    TraversableOnce

  16. def contains(elem: Any): Boolean

    Permalink
    Definition Classes
    Iterator

  17. def copyToArray[B >: (K, Seq[L], Seq[R])](xs: Array[B], start: Int, len: Int): Unit

    Permalink
    Definition Classes
    Iterator → TraversableOnce → GenTraversableOnce

  18. def copyToArray[B >: (K, Seq[L], Seq[R])](xs: Array[B]): Unit

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  19. def copyToArray[B >: (K, Seq[L], Seq[R])](xs: Array[B], start: Int): Unit

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  20. def copyToBuffer[B >: (K, Seq[L], Seq[R])](dest: Buffer[B]): Unit

    Permalink
    Definition Classes
    TraversableOnce

  21. def corresponds[B](that: GenTraversableOnce[B])(p: ((K, Seq[L], Seq[R]), B) ⇒ Boolean): Boolean

    Permalink
    Definition Classes
    Iterator

  22. def count(p: ((K, Seq[L], Seq[R])) ⇒ Boolean): Int

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  23. def drop(n: Int): Iterator[(K, Seq[L], Seq[R])]

    Permalink
    Definition Classes
    Iterator

  24. def dropWhile(p: ((K, Seq[L], Seq[R])) ⇒ Boolean): Iterator[(K, Seq[L], Seq[R])]

    Permalink
    Definition Classes
    Iterator

  25. def duplicate: (Iterator[(K, Seq[L], Seq[R])], Iterator[(K, Seq[L], Seq[R])])

    Permalink
    Definition Classes
    Iterator

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

    Permalink
    Definition Classes
    AnyRef

  27. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  28. def exists(p: ((K, Seq[L], Seq[R])) ⇒ Boolean): Boolean

    Permalink
    Definition Classes
    Iterator → TraversableOnce → GenTraversableOnce

  29. def filter(p: ((K, Seq[L], Seq[R])) ⇒ Boolean): Iterator[(K, Seq[L], Seq[R])]

    Permalink
    Definition Classes
    Iterator

  30. def filterNot(p: ((K, Seq[L], Seq[R])) ⇒ Boolean): Iterator[(K, Seq[L], Seq[R])]

    Permalink
    Definition Classes
    Iterator

  31. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

  32. def find(p: ((K, Seq[L], Seq[R])) ⇒ Boolean): Option[(K, Seq[L], Seq[R])]

    Permalink
    Definition Classes
    Iterator → TraversableOnce → GenTraversableOnce

  33. def flatMap[B](f: ((K, Seq[L], Seq[R])) ⇒ GenTraversableOnce[B]): Iterator[B]

    Permalink
    Definition Classes
    Iterator

  34. def fold[A1 >: (K, Seq[L], Seq[R])](z: A1)(op: (A1, A1) ⇒ A1): A1

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  35. def foldLeft[B](z: B)(op: (B, (K, Seq[L], Seq[R])) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  36. def foldRight[B](z: B)(op: ((K, Seq[L], Seq[R]), B) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  37. def forall(p: ((K, Seq[L], Seq[R])) ⇒ Boolean): Boolean

    Permalink
    Definition Classes
    Iterator → TraversableOnce → GenTraversableOnce

  38. def foreach[U](f: ((K, Seq[L], Seq[R])) ⇒ U): Unit

    Permalink
    Definition Classes
    Iterator → TraversableOnce → GenTraversableOnce

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

    Permalink
    Definition Classes
    AnyRef → Any

  40. def grouped[B >: (K, Seq[L], Seq[R])](size: Int): GroupedIterator[B]

    Permalink
    Definition Classes
    Iterator

  41. def hasDefiniteSize: Boolean

    Permalink
    Definition Classes
    Iterator → TraversableOnce → GenTraversableOnce

  42. def hasNext: Boolean

    Permalink
    Definition Classes
    MergeJoinIterator → Iterator

  43. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  44. def indexOf[B >: (K, Seq[L], Seq[R])](elem: B): Int

    Permalink
    Definition Classes
    Iterator

  45. def indexWhere(p: ((K, Seq[L], Seq[R])) ⇒ Boolean): Int

    Permalink
    Definition Classes
    Iterator

  46. def isEmpty: Boolean

    Permalink
    Definition Classes
    Iterator → TraversableOnce → GenTraversableOnce

  47. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  48. def isTraversableAgain: Boolean

    Permalink
    Definition Classes
    Iterator → GenTraversableOnce

  49. def length: Int

    Permalink
    Definition Classes
    Iterator

  50. def map[B](f: ((K, Seq[L], Seq[R])) ⇒ B): Iterator[B]

    Permalink
    Definition Classes
    Iterator

  51. def max[B >: (K, Seq[L], Seq[R])](implicit cmp: Ordering[B]): (K, Seq[L], Seq[R])

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  52. def maxBy[B](f: ((K, Seq[L], Seq[R])) ⇒ B)(implicit cmp: Ordering[B]): (K, Seq[L], Seq[R])

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  53. def min[B >: (K, Seq[L], Seq[R])](implicit cmp: Ordering[B]): (K, Seq[L], Seq[R])

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  54. def minBy[B](f: ((K, Seq[L], Seq[R])) ⇒ B)(implicit cmp: Ordering[B]): (K, Seq[L], Seq[R])

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  55. def mkString: String

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  56. def mkString(sep: String): String

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  57. def mkString(start: String, sep: String, end: String): String

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Permalink
    Definition Classes
    AnyRef

  59. def next(): (K, Seq[L], Seq[R])

    Permalink

    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

  60. def nonEmpty: Boolean

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  61. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  62. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  63. def padTo[A1 >: (K, Seq[L], Seq[R])](len: Int, elem: A1): Iterator[A1]

    Permalink
    Definition Classes
    Iterator

  64. def partition(p: ((K, Seq[L], Seq[R])) ⇒ Boolean): (Iterator[(K, Seq[L], Seq[R])], Iterator[(K, Seq[L], Seq[R])])

    Permalink
    Definition Classes
    Iterator

  65. def patch[B >: (K, Seq[L], Seq[R])](from: Int, patchElems: Iterator[B], replaced: Int): Iterator[B]

    Permalink
    Definition Classes
    Iterator

  66. def product[B >: (K, Seq[L], Seq[R])](implicit num: Numeric[B]): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  67. def reduce[A1 >: (K, Seq[L], Seq[R])](op: (A1, A1) ⇒ A1): A1

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  68. def reduceLeft[B >: (K, Seq[L], Seq[R])](op: (B, (K, Seq[L], Seq[R])) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce

  69. def reduceLeftOption[B >: (K, Seq[L], Seq[R])](op: (B, (K, Seq[L], Seq[R])) ⇒ B): Option[B]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  70. def reduceOption[A1 >: (K, Seq[L], Seq[R])](op: (A1, A1) ⇒ A1): Option[A1]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  71. def reduceRight[B >: (K, Seq[L], Seq[R])](op: ((K, Seq[L], Seq[R]), B) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  72. def reduceRightOption[B >: (K, Seq[L], Seq[R])](op: ((K, Seq[L], Seq[R]), B) ⇒ B): Option[B]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  73. def reversed: List[(K, Seq[L], Seq[R])]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce

  74. def sameElements(that: Iterator[_]): Boolean

    Permalink
    Definition Classes
    Iterator

  75. def scanLeft[B](z: B)(op: (B, (K, Seq[L], Seq[R])) ⇒ B): Iterator[B]

    Permalink
    Definition Classes
    Iterator

  76. def scanRight[B](z: B)(op: ((K, Seq[L], Seq[R]), B) ⇒ B): Iterator[B]

    Permalink
    Definition Classes
    Iterator

  77. def seq: Iterator[(K, Seq[L], Seq[R])]

    Permalink
    Definition Classes
    Iterator → TraversableOnce → GenTraversableOnce

  78. def size: Int

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  79. def slice(from: Int, until: Int): Iterator[(K, Seq[L], Seq[R])]

    Permalink
    Definition Classes
    Iterator

  80. def sliding[B >: (K, Seq[L], Seq[R])](size: Int, step: Int): GroupedIterator[B]

    Permalink
    Definition Classes
    Iterator

  81. def span(p: ((K, Seq[L], Seq[R])) ⇒ Boolean): (Iterator[(K, Seq[L], Seq[R])], Iterator[(K, Seq[L], Seq[R])])

    Permalink
    Definition Classes
    Iterator

  82. def sum[B >: (K, Seq[L], Seq[R])](implicit num: Numeric[B]): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Permalink
    Definition Classes
    AnyRef

  84. def take(n: Int): Iterator[(K, Seq[L], Seq[R])]

    Permalink
    Definition Classes
    Iterator

  85. def takeWhile(p: ((K, Seq[L], Seq[R])) ⇒ Boolean): Iterator[(K, Seq[L], Seq[R])]

    Permalink
    Definition Classes
    Iterator

  86. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, (K, Seq[L], Seq[R]), Col[(K, Seq[L], Seq[R])]]): Col[(K, Seq[L], Seq[R])]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  87. def toArray[B >: (K, Seq[L], Seq[R])](implicit arg0: ClassTag[B]): Array[B]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  88. def toBuffer[B >: (K, Seq[L], Seq[R])]: Buffer[B]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  89. def toIndexedSeq: IndexedSeq[(K, Seq[L], Seq[R])]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  90. def toIterable: Iterable[(K, Seq[L], Seq[R])]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  91. def toIterator: Iterator[(K, Seq[L], Seq[R])]

    Permalink
    Definition Classes
    Iterator → GenTraversableOnce

  92. def toList: List[(K, Seq[L], Seq[R])]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  93. def toMap[T, U](implicit ev: <:<[(K, Seq[L], Seq[R]), (T, U)]): Map[T, U]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  94. def toSeq: Seq[(K, Seq[L], Seq[R])]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  95. def toSet[B >: (K, Seq[L], Seq[R])]: Set[B]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  96. def toStream: Stream[(K, Seq[L], Seq[R])]

    Permalink
    Definition Classes
    Iterator → GenTraversableOnce

  97. def toString(): String

    Permalink
    Definition Classes
    Iterator → AnyRef → Any

  98. def toTraversable: Traversable[(K, Seq[L], Seq[R])]

    Permalink
    Definition Classes
    Iterator → TraversableOnce → GenTraversableOnce

  99. def toVector: Vector[(K, Seq[L], Seq[R])]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  100. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  103. def withFilter(p: ((K, Seq[L], Seq[R])) ⇒ Boolean): Iterator[(K, Seq[L], Seq[R])]

    Permalink
    Definition Classes
    Iterator

  104. def zip[B](that: Iterator[B]): Iterator[((K, Seq[L], Seq[R]), B)]

    Permalink
    Definition Classes
    Iterator

  105. def zipAll[B, A1 >: (K, Seq[L], Seq[R]), B1 >: B](that: Iterator[B], thisElem: A1, thatElem: B1): Iterator[(A1, B1)]

    Permalink
    Definition Classes
    Iterator

  106. def zipWithIndex: Iterator[((K, Seq[L], Seq[R]), Int)]

    Permalink
    Definition Classes
    Iterator

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