final
class
MergeCorrespondingLazySeq[L, R, K] extends LazySeq[EitherOrBoth[L, R]]
Instance Constructors
-
new
MergeCorrespondingLazySeq(leftReader: LazySeq[L], rightReader: LazySeq[R], toLeftKey: (L) ⇒ K, toRightKey: (R) ⇒ K)(implicit ord: Ordering[K])
Value Members
-
final
def
!=(arg0: AnyRef): Boolean
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
-
def
/:[B](z: B)(op: (B, EitherOrBoth[L, R]) ⇒ B): B
-
def
:\[B](z: B)(op: (EitherOrBoth[L, R], B) ⇒ B): B
-
final
def
==(arg0: AnyRef): Boolean
-
final
def
==(arg0: Any): Boolean
-
def
addString(b: StringBuilder): StringBuilder
-
def
addString(b: StringBuilder, sep: String): StringBuilder
-
def
addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
-
-
final
def
afterWithResource[R, U](resource: Resource[R])(f: (EitherOrBoth[L, R], R) ⇒ U): LazySeq[EitherOrBoth[L, R]]
-
def
aggregate[B](z: B)(seqop: (B, EitherOrBoth[L, R]) ⇒ B, combop: (B, B) ⇒ B): B
-
final
def
asInstanceOf[T0]: T0
-
final
def
assertSorted[B >: EitherOrBoth[L, R]](implicit ord: Ordering[B]): LazySeq[B]
-
final
def
assertSortedAndUnique[B >: EitherOrBoth[L, R]](implicit ord: Ordering[B]): LazySeq[B]
-
final
def
assertSortedAndUniqueBy[K](key: (EitherOrBoth[L, R]) ⇒ K)(implicit ord: Ordering[K]): LazySeq[EitherOrBoth[L, R]]
-
final
def
assertSortedBy[K](key: (EitherOrBoth[L, R]) ⇒ K)(implicit ord: Ordering[K]): LazySeq[EitherOrBoth[L, R]]
-
-
final
def
beforeWithResource[R, U](resource: Resource[R])(f: (EitherOrBoth[L, R], R) ⇒ U): LazySeq[EitherOrBoth[L, R]]
-
final
def
bucketize[B >: EitherOrBoth[L, R]](num: Int)(implicit serializer: Serializer[B]): Vector[LazySeq[B]]
-
final
def
buffered(size: Int = 0): LazySeq[EitherOrBoth[L, R]]
-
def
clone(): AnyRef
-
final
def
collapseBy[B >: EitherOrBoth[L, R], K](key: (B) ⇒ K)(op: (B, B) ⇒ B)(implicit ord: Ordering[K]): LazySeq[B]
-
def
collectFirst[B](pf: PartialFunction[EitherOrBoth[L, R], B]): Option[B]
-
final
def
copyToArray[B >: EitherOrBoth[L, R]](xs: Array[B], start: Int, len: Int): Unit
-
def
copyToArray[B >: EitherOrBoth[L, R]](xs: Array[B]): Unit
-
def
copyToArray[B >: EitherOrBoth[L, R]](xs: Array[B], start: Int): Unit
-
def
copyToBuffer[B >: EitherOrBoth[L, R]](dest: Buffer[B]): Unit
-
def
count(p: (EitherOrBoth[L, R]) ⇒ Boolean): Int
-
-
-
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
final
def
exists(p: (EitherOrBoth[L, R]) ⇒ Boolean): Boolean
-
-
-
def
finalize(): Unit
-
final
def
find(p: (EitherOrBoth[L, R]) ⇒ Boolean): Option[EitherOrBoth[L, R]]
-
final
def
flatMap[B, That](f: (EitherOrBoth[L, R]) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[LazySeq[EitherOrBoth[L, R]], B, That]): That
-
final
def
flatten[B](implicit asTraversable: (EitherOrBoth[L, R]) ⇒ GenTraversableOnce[B]): LazySeq[B]
-
def
fold[A1 >: EitherOrBoth[L, R]](z: A1)(op: (A1, A1) ⇒ A1): A1
-
def
foldLeft[B](z: B)(op: (B, EitherOrBoth[L, R]) ⇒ B): B
-
def
foldRight[B](z: B)(op: (EitherOrBoth[L, R], B) ⇒ B): B
-
final
def
forall(p: (EitherOrBoth[L, R]) ⇒ Boolean): Boolean
-
final
def
foreach[U](f: (EitherOrBoth[L, R]) ⇒ U): Unit
-
final
def
getClass(): Class[_]
-
final
def
groupBy[B >: EitherOrBoth[L, R], K](f: (EitherOrBoth[L, R]) ⇒ K)(implicit serializer: Serializer[B]): Map[K, LazySeq[B]]
-
final
def
groupBy[B >: EitherOrBoth[L, R], K](serializer: Serializer[B])(f: (EitherOrBoth[L, R]) ⇒ K): Map[K, LazySeq[B]]
-
final
def
grouped[B >: EitherOrBoth[L, R]](size: Int): LazySeq[IndexedSeq[B]]
-
final
def
groupedBy[K](by: (EitherOrBoth[L, R]) ⇒ K): LazySeq[(K, IndexedSeq[EitherOrBoth[L, R]])]
-
def
hasDefiniteSize: Boolean
-
def
hashCode(): Int
-
-
def
headOption: Option[EitherOrBoth[L, R]]
-
def
isEmpty: Boolean
-
final
def
isInstanceOf[T0]: Boolean
-
def
isTraversableAgain: Boolean
-
final
def
map[B, That](f: (EitherOrBoth[L, R]) ⇒ B)(implicit bf: CanBuildFrom[LazySeq[EitherOrBoth[L, R]], B, That]): That
-
def
max[B >: EitherOrBoth[L, R]](implicit cmp: Ordering[B]): EitherOrBoth[L, R]
-
def
maxBy[B](f: (EitherOrBoth[L, R]) ⇒ B)(implicit cmp: Ordering[B]): EitherOrBoth[L, R]
-
final
def
mergeCorresponding[B >: EitherOrBoth[L, R]](that: LazySeq[B])(implicit ord: Ordering[B]): LazySeq[EitherOrBoth[B, B]]
-
final
def
mergeCorrespondingByKey[R, K](that: LazySeq[R], thisKey: (EitherOrBoth[L, R]) ⇒ K, thatKey: (R) ⇒ K)(implicit ord: Ordering[K]): LazySeq[EitherOrBoth[EitherOrBoth[L, R], R]]
-
def
min[B >: EitherOrBoth[L, R]](implicit cmp: Ordering[B]): EitherOrBoth[L, R]
-
def
minBy[B](f: (EitherOrBoth[L, R]) ⇒ B)(implicit cmp: Ordering[B]): EitherOrBoth[L, R]
-
def
mkString: String
-
def
mkString(sep: String): String
-
def
mkString(start: String, sep: String, end: String): String
-
final
def
ne(arg0: AnyRef): Boolean
-
def
nonEmpty: Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
-
-
-
final
def
parFlatMap[B](f: (EitherOrBoth[L, R]) ⇒ GenTraversableOnce[B]): LazySeq[B]
-
-
final
def
parForeach[U](f: (EitherOrBoth[L, R]) ⇒ U): Unit
-
-
final
def
parMap[B](f: (EitherOrBoth[L, R]) ⇒ B): LazySeq[B]
-
final
def
partition[B >: EitherOrBoth[L, R]](p: (EitherOrBoth[L, R]) ⇒ Boolean)(implicit serializer: Serializer[B]): (LazySeq[B], LazySeq[B])
-
def
product[B >: EitherOrBoth[L, R]](implicit num: Numeric[B]): B
-
def
reduce[A1 >: EitherOrBoth[L, R]](op: (A1, A1) ⇒ A1): A1
-
def
reduceLeft[B >: EitherOrBoth[L, R]](op: (B, EitherOrBoth[L, R]) ⇒ B): B
-
def
reduceLeftOption[B >: EitherOrBoth[L, R]](op: (B, EitherOrBoth[L, R]) ⇒ B): Option[B]
-
def
reduceOption[A1 >: EitherOrBoth[L, R]](op: (A1, A1) ⇒ A1): Option[A1]
-
def
reduceRight[B >: EitherOrBoth[L, R]](op: (EitherOrBoth[L, R], B) ⇒ B): B
-
def
reduceRightOption[B >: EitherOrBoth[L, R]](op: (EitherOrBoth[L, R], B) ⇒ B): Option[B]
-
def
reversed: List[EitherOrBoth[L, R]]
-
-
final
def
shuffle[B >: EitherOrBoth[L, R]](implicit serializer: Serializer[B]): LazySeq[B]
-
final
def
shuffle[B >: EitherOrBoth[L, R]](seed: Long)(implicit serializer: Serializer[B]): LazySeq[B]
-
final
def
shuffle[B >: EitherOrBoth[L, R]](random: Random)(implicit serializer: Serializer[B]): LazySeq[B]
-
def
size: Int
-
final
def
slice(from: Int, until: Int): LazySeq[EitherOrBoth[L, R]]
-
final
def
sortAndCollapseBy[B >: EitherOrBoth[L, R], K](bufferSizeLimitMB: Int, bufferRecordLimit: Int)(key: (B) ⇒ K)(op: (B, B) ⇒ B)(implicit serializer: Serializer[B], ord: Ordering[K]): LazySeq[B]
-
final
def
sortAndCollapseBy[B >: EitherOrBoth[L, R], K](serializer: Serializer[B], bufferSizeLimitMB: Int, bufferRecordLimit: Int)(key: (B) ⇒ K)(op: (B, B) ⇒ B)(implicit ord: Ordering[K]): LazySeq[B]
-
final
def
sortAndCollapseBy[B >: EitherOrBoth[L, R], K](key: (B) ⇒ K)(op: (B, B) ⇒ B)(implicit serializer: Serializer[B], ord: Ordering[K]): LazySeq[B]
-
final
def
sortAndCollapseBy[B >: EitherOrBoth[L, R], K](serializer: Serializer[B])(key: (B) ⇒ K)(op: (B, B) ⇒ B)(implicit ord: Ordering[K]): LazySeq[B]
-
final
def
sortBy[B >: EitherOrBoth[L, R], K](bufferSizeLimitMB: Int, bufferRecordLimit: Int)(f: (B) ⇒ K)(implicit serializer: Serializer[B], ord: Ordering[K]): LazySeq[B]
-
final
def
sortBy[B >: EitherOrBoth[L, R], K](serializer: Serializer[B], bufferSizeLimitMB: Int, bufferRecordLimit: Int)(f: (B) ⇒ K)(implicit ord: Ordering[K]): LazySeq[B]
-
final
def
sortBy[B >: EitherOrBoth[L, R], K](f: (B) ⇒ K)(implicit serializer: Serializer[B], ord: Ordering[K]): LazySeq[B]
-
final
def
sortBy[B >: EitherOrBoth[L, R], K](serializer: Serializer[B])(f: (B) ⇒ K)(implicit ord: Ordering[K]): LazySeq[B]
-
final
def
sorted[B >: EitherOrBoth[L, R]](bufferSizeLimitMB: Int, bufferRecordLimit: Int)(implicit serializer: Serializer[B], ord: Ordering[B]): LazySeq[B]
-
final
def
sorted[B >: EitherOrBoth[L, R]](implicit serializer: Serializer[B], ord: Ordering[B]): LazySeq[B]
-
def
sum[B >: EitherOrBoth[L, R]](implicit num: Numeric[B]): B
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
-
-
def
to[Col[_]](implicit cbf: CanBuildFrom[Nothing, EitherOrBoth[L, R], Col[EitherOrBoth[L, R]]]): Col[EitherOrBoth[L, R]]
-
def
toArray[B >: EitherOrBoth[L, R]](implicit arg0: ClassTag[B]): Array[B]
-
def
toBuffer[B >: EitherOrBoth[L, R]]: Buffer[B]
-
def
toIndexedSeq: IndexedSeq[EitherOrBoth[L, R]]
-
def
toIterable: Iterable[EitherOrBoth[L, R]]
-
def
toIterator(batchSize: Int = 32, bufferSize: Int = 0): LazySeqIterator[EitherOrBoth[L, R]]
-
-
-
def
toMap[T, U](implicit ev: <:<[EitherOrBoth[L, R], (T, U)]): Map[T, U]
-
-
def
toSet[B >: EitherOrBoth[L, R]]: Set[B]
-
def
toStream: Stream[EitherOrBoth[L, R]]
-
def
toString(): String
-
def
toTraversable: Traversable[EitherOrBoth[L, R]]
-
def
toVector: Vector[EitherOrBoth[L, R]]
-
-
final
def
uniqueSortBy[B >: EitherOrBoth[L, R], K](f: (B) ⇒ K)(implicit serializer: Serializer[B], ord: Ordering[K]): LazySeq[B]
-
final
def
uniqueSortBy[B >: EitherOrBoth[L, R], K](serializer: Serializer[B])(f: (B) ⇒ K)(implicit ord: Ordering[K]): LazySeq[B]
-
final
def
uniqueSorted[B >: EitherOrBoth[L, R]](implicit serializer: Serializer[B], ord: Ordering[B]): LazySeq[B]
-
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
-
-
final
def
zipWithIndex: LazySeq[(EitherOrBoth[L, R], Int)]
Deprecated Value Members
-
def
/:\[A1 >: EitherOrBoth[L, R]](z: A1)(op: (A1, A1) ⇒ A1): A1
Inherited from AnyRef
Inherited from Any
For LazySeq.mergeCorresponding