Class

fm.lazyseq

JavaIteratorLazySeq

Related Doc: package lazyseq

Permalink

final class JavaIteratorLazySeq[A] extends LazySeq[A]

LazySeq Implementation using the Java Iterator interface

Linear Supertypes
LazySeq[A], LazySeqBase[A], Traversable[A], GenTraversable[A], GenericTraversableTemplate[A, LazySeq], TraversableLike[A, LazySeq[A]], GenTraversableLike[A, LazySeq[A]], Parallelizable[A, ParIterable[A]], TraversableOnce[A], GenTraversableOnce[A], FilterMonadic[A, LazySeq[A]], HasNewBuilder[A, fm.lazyseq.LazySeq[A] @scala.annotation.unchecked.uncheckedVariance], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. JavaIteratorLazySeq
  2. LazySeq
  3. LazySeqBase
  4. Traversable
  5. GenTraversable
  6. GenericTraversableTemplate
  7. TraversableLike
  8. GenTraversableLike
  9. Parallelizable
  10. TraversableOnce
  11. GenTraversableOnce
  12. FilterMonadic
  13. HasNewBuilder
  14. AnyRef
  15. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new JavaIteratorLazySeq(it: Iterator[A])

    Permalink

Type Members

  1. type Self = LazySeq[A]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    TraversableLike
  2. class WithFilter extends FilterMonadic[A, Repr]

    Permalink
    Definition Classes
    TraversableLike

Value Members

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

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

    Permalink
    Definition Classes
    AnyRef → Any
  3. final def ++[B >: A](rest: LazySeq[B]): LazySeq[B]

    Permalink
    Definition Classes
    LazySeq
  4. def ++[B >: A, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[LazySeq[A], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  5. def ++:[B >: A, That](that: Traversable[B])(implicit bf: CanBuildFrom[LazySeq[A], B, That]): That

    Permalink
    Definition Classes
    TraversableLike
  6. def ++:[B >: A, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[LazySeq[A], B, That]): That

    Permalink
    Definition Classes
    TraversableLike
  7. def /:[B](z: B)(op: (B, A) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  8. def :\[B](z: B)(op: (A, B) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  9. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  10. def addString(b: StringBuilder): StringBuilder

    Permalink
    Definition Classes
    TraversableOnce
  11. def addString(b: StringBuilder, sep: String): StringBuilder

    Permalink
    Definition Classes
    TraversableOnce
  12. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

    Permalink
    Definition Classes
    TraversableOnce
  13. final def after[U](f: (A) ⇒ U): LazySeq[A]

    Permalink

    Run this function on each item after the foreach function

    Run this function on each item after the foreach function

    This is basically a foreach but without forcing evaluation of this LazySeq.

    Definition Classes
    LazySeq
  14. final def afterWithResource[R, U](resource: Resource[R])(f: (A, R) ⇒ U): LazySeq[A]

    Permalink

    Same as after() but takes a Resource (i.e.

    Same as after() but takes a Resource (i.e. can use it for something like logging)

    Definition Classes
    LazySeq
  15. def aggregate[B](z: ⇒ B)(seqop: (B, A) ⇒ B, combop: (B, B) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  16. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  17. final def assertSorted[B >: A](implicit ord: Ordering[B]): LazySeq[B]

    Permalink

    Assert that this reader is in sorted order

    Assert that this reader is in sorted order

    Definition Classes
    LazySeq
  18. final def assertSortedAndUnique[B >: A](implicit ord: Ordering[B]): LazySeq[B]

    Permalink

    Assert that this reader is in sorted order AND unique

    Assert that this reader is in sorted order AND unique

    Definition Classes
    LazySeq
  19. final def assertSortedAndUniqueBy[K](key: (A) ⇒ K)(implicit ord: Ordering[K]): LazySeq[A]

    Permalink
    Definition Classes
    LazySeq
  20. final def assertSortedBy[K](key: (A) ⇒ K)(implicit ord: Ordering[K]): LazySeq[A]

    Permalink
    Definition Classes
    LazySeq
  21. final def before[U](f: (A) ⇒ U): LazySeq[A]

    Permalink

    Run this function on each item before the foreach function

    Run this function on each item before the foreach function

    This is basically a foreach but without forcing evaluation of this LazySeq.

    Definition Classes
    LazySeq
  22. final def beforeWithResource[R, U](resource: Resource[R])(f: (A, R) ⇒ U): LazySeq[A]

    Permalink

    Same as before() but takes a Resource (i.e.

    Same as before() but takes a Resource (i.e. can use it for something like logging)

    Definition Classes
    LazySeq
  23. final def bucketize[B >: A](num: Int)(implicit serializer: Serializer[B]): Vector[LazySeq[B]]

    Permalink

    Split the LazySeq into num buckets of equal size using a round-robin algorithm

    Split the LazySeq into num buckets of equal size using a round-robin algorithm

    Definition Classes
    LazySeq
  24. final def buffered(size: Int = 0): LazySeq[A]

    Permalink

    Creates an asynchronous buffer that spins up a producer thread which feeds data into a BlockingQueue that is read using the resulting LazySeq.

    Creates an asynchronous buffer that spins up a producer thread which feeds data into a BlockingQueue that is read using the resulting LazySeq.

    Definition Classes
    LazySeq
  25. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  26. final def collapseBy[B >: A, K](key: (B) ⇒ K)(op: (B, B) ⇒ B): LazySeq[B]

    Permalink
    Definition Classes
    LazySeq
  27. final def collect[B](pf: PartialFunction[A, B]): LazySeq[B]

    Permalink
    Definition Classes
    LazySeqBase
  28. def collect[B, That](pf: PartialFunction[A, B])(implicit bf: CanBuildFrom[LazySeq[A], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  29. def collectFirst[B](pf: PartialFunction[A, B]): Option[B]

    Permalink
    Definition Classes
    TraversableOnce
  30. final def companion: GenericCompanion[LazySeq]

    Permalink
    Definition Classes
    LazySeqBase → Traversable → GenTraversable → GenericTraversableTemplate
  31. def copyToArray[B >: A](xs: Array[B], start: Int, len: Int): Unit

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  32. def copyToArray[B >: A](xs: Array[B]): Unit

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  33. def copyToArray[B >: A](xs: Array[B], start: Int): Unit

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  34. def copyToBuffer[B >: A](dest: Buffer[B]): Unit

    Permalink
    Definition Classes
    TraversableOnce
  35. def count(p: (A) ⇒ Boolean): Int

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  36. final def drop(n: Int): LazySeq[A]

    Permalink
    Definition Classes
    LazySeq → TraversableLike → GenTraversableLike
  37. final def dropRight(n: Int): LazySeq[A]

    Permalink
    Definition Classes
    LazySeqBase
  38. final def dropWhile(p: (A) ⇒ Boolean): LazySeq[A]

    Permalink
    Definition Classes
    LazySeq → TraversableLike → GenTraversableLike
  39. final def eq(arg0: AnyRef): Boolean

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

    Permalink
    Definition Classes
    AnyRef → Any
  41. def exists(p: (A) ⇒ Boolean): Boolean

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  42. final def filter(p: (A) ⇒ Boolean): LazySeq[A]

    Permalink
    Definition Classes
    LazySeqBase → TraversableLike → GenTraversableLike
  43. final def filterNot(p: (A) ⇒ Boolean): LazySeq[A]

    Permalink
    Definition Classes
    LazySeqBase → TraversableLike → GenTraversableLike
  44. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  45. def find(p: (A) ⇒ Boolean): Option[A]

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  46. final def flatMap[B, That](f: (A) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[LazySeq[A], B, That]): That

    Permalink
    Definition Classes
    LazySeqBase → TraversableLike → GenTraversableLike → FilterMonadic
  47. final def flatten[B](implicit asTraversable: (A) ⇒ GenTraversableOnce[B]): LazySeq[B]

    Permalink
    Definition Classes
    LazySeq → GenericTraversableTemplate
  48. def fold[A1 >: A](z: A1)(op: (A1, A1) ⇒ A1): A1

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  49. def foldLeft[B](z: B)(op: (B, A) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  50. def foldRight[B](z: B)(op: (A, B) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  51. def forall(p: (A) ⇒ Boolean): Boolean

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  52. def foreach[U](f: (A) ⇒ U): Unit

    Permalink

    This is the method that sub-classes must implement

    This is the method that sub-classes must implement

    Definition Classes
    JavaIteratorLazySeqLazySeq → GenericTraversableTemplate → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  53. def genericBuilder[B]: Builder[B, LazySeq[B]]

    Permalink
    Definition Classes
    GenericTraversableTemplate
  54. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  55. final def groupBy[B >: A, K](f: (A) ⇒ K)(implicit serializer: Serializer[B]): Map[K, LazySeq[B]]

    Permalink
    Definition Classes
    LazySeq
  56. final def groupBy[B >: A, K](serializer: Serializer[B])(f: (A) ⇒ K): Map[K, LazySeq[B]]

    Permalink

    Mostly standard group by implementation that uses tmp files to store the values of the HashMap

    Mostly standard group by implementation that uses tmp files to store the values of the HashMap

    Definition Classes
    LazySeq
  57. def groupBy[K](f: (A) ⇒ K): Map[K, LazySeq[A]]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  58. final def grouped[B >: A](size: Int, additionalIncrement: (B) ⇒ Int): LazySeq[IndexedSeq[B]]

    Permalink
    Definition Classes
    LazySeq
  59. final def grouped[B >: A](size: Int): LazySeq[IndexedSeq[B]]

    Permalink
    Definition Classes
    LazySeq
  60. final def groupedBy[K](by: (A) ⇒ K): LazySeq[(K, IndexedSeq[A])]

    Permalink

    A cross between grouped and groupBy that allows you to specify a key to be used (like in groupBy) instead of a fixed count (like in grouped).

    A cross between grouped and groupBy that allows you to specify a key to be used (like in groupBy) instead of a fixed count (like in grouped). All elements next to each other with the same key get returned in each group.

    e.g. LazySeq.wrap(Seq(1,1,1,2,2,1)).groupedBy{ a => a }.toIndexedSeq => Vector((1,Vector(1, 1, 1)), (2,Vector(2, 2)), (1,Vector(1)))

    Definition Classes
    LazySeq
  61. def hasDefiniteSize: Boolean

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  62. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  63. def head: A

    Permalink
    Definition Classes
    LazySeq → GenericTraversableTemplate → TraversableLike → GenTraversableLike
  64. def headOption: Option[A]

    Permalink
    Definition Classes
    LazySeq → TraversableLike → GenTraversableLike
  65. def init: LazySeq[A]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  66. def inits: Iterator[LazySeq[A]]

    Permalink
    Definition Classes
    TraversableLike
  67. def isEmpty: Boolean

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  68. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  69. final def isTraversableAgain: Boolean

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  70. def iterator: LazySeqIterator[A]

    Permalink
    Definition Classes
    LazySeq
  71. def last: A

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  72. def lastOption: Option[A]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  73. final def map[B, That](f: (A) ⇒ B)(implicit bf: CanBuildFrom[LazySeq[A], B, That]): That

    Permalink
    Definition Classes
    LazySeqBase → TraversableLike → GenTraversableLike → FilterMonadic
  74. def max[B >: A](implicit cmp: Ordering[B]): A

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  75. def maxBy[B](f: (A) ⇒ B)(implicit cmp: Ordering[B]): A

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  76. final def mergeCorresponding[B >: A](that: LazySeq[B])(implicit ord: Ordering[B]): LazySeq[EitherOrBoth[B, B]]

    Permalink
    Definition Classes
    LazySeq
  77. final def mergeCorrespondingByKey[R, K](that: LazySeq[R], thisKey: (A) ⇒ K, thatKey: (R) ⇒ K)(implicit ord: Ordering[K]): LazySeq[EitherOrBoth[A, R]]

    Permalink

    Merge corresponding records from this sorted read with that sorted reader given a method to get a common key that can be compared.

    Merge corresponding records from this sorted read with that sorted reader given a method to get a common key that can be compared.

    Definition Classes
    LazySeq
  78. def min[B >: A](implicit cmp: Ordering[B]): A

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  79. def minBy[B](f: (A) ⇒ B)(implicit cmp: Ordering[B]): A

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  80. def mkString: String

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  81. def mkString(sep: String): String

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  82. def mkString(start: String, sep: String, end: String): String

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  83. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  84. final def newBuilder(): Builder[A, LazySeq[A]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    LazySeqBase → GenericTraversableTemplate → TraversableLike → HasNewBuilder
  85. def nonEmpty: Boolean

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  86. final def notify(): Unit

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

    Permalink
    Definition Classes
    AnyRef
  88. final def onFirst[U](f: (A) ⇒ U): LazySeq[A]

    Permalink

    Execute the method on the first element of the LazySeq whenever it is evaluated.

    Execute the method on the first element of the LazySeq whenever it is evaluated.

    Note: The first element is still call via foreach

    Definition Classes
    LazySeq
  89. final def onLast[U](f: (A) ⇒ U): LazySeq[A]

    Permalink

    Same as onFirst except for the last element whenever it is evaluated

    Same as onFirst except for the last element whenever it is evaluated

    Definition Classes
    LazySeq
  90. def par: ParIterable[A]

    Permalink
    Definition Classes
    Parallelizable
  91. def parCombiner: Combiner[A, ParIterable[A]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    TraversableLike → Parallelizable
  92. final def parFlatMap[B](threads: Int = LazySeq.defaultThreadCount, inputBuffer: Int = LazySeq.defaultThreadCount, resultBuffer: Int = LazySeq.defaultThreadCount * 4)(f: (A) ⇒ GenTraversableOnce[B]): LazySeq[B]

    Permalink

    Performs a parallel flat map maintaining ordered output

    Performs a parallel flat map maintaining ordered output

    Definition Classes
    LazySeq
  93. final def parFlatMap[B](f: (A) ⇒ GenTraversableOnce[B]): LazySeq[B]

    Permalink

    Performs a parallel flat map maintaining ordered output

    Performs a parallel flat map maintaining ordered output

    Definition Classes
    LazySeq
  94. final def parForeach[U](threads: Int = LazySeq.defaultThreadCount, inputBuffer: Int = LazySeq.defaultThreadCount)(f: (A) ⇒ U): Unit

    Permalink

    A Parallel foreach

    A Parallel foreach

    Definition Classes
    LazySeq
  95. final def parForeach[U](f: (A) ⇒ U): Unit

    Permalink

    A Parallel foreach

    A Parallel foreach

    Definition Classes
    LazySeq
  96. final def parMap[B](threads: Int = LazySeq.defaultThreadCount, inputBuffer: Int = LazySeq.defaultThreadCount, resultBuffer: Int = LazySeq.defaultThreadCount * 4)(f: (A) ⇒ B): LazySeq[B]

    Permalink

    Performs a parallel map maintaining ordered output

    Performs a parallel map maintaining ordered output

    Definition Classes
    LazySeq
  97. final def parMap[B](f: (A) ⇒ B): LazySeq[B]

    Permalink

    Performs a parallel map maintaining ordered output

    Performs a parallel map maintaining ordered output

    Definition Classes
    LazySeq
  98. final def partition[B >: A](p: (A) ⇒ Boolean)(implicit serializer: Serializer[B]): (LazySeq[B], LazySeq[B])

    Permalink

    Standard partition implementation using LazySeqs

    Standard partition implementation using LazySeqs

    Definition Classes
    LazySeq
  99. def partition(p: (A) ⇒ Boolean): (LazySeq[A], LazySeq[A])

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  100. def product[B >: A](implicit num: Numeric[B]): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  101. def reduce[A1 >: A](op: (A1, A1) ⇒ A1): A1

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  102. def reduceLeft[B >: A](op: (B, A) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce
  103. def reduceLeftOption[B >: A](op: (B, A) ⇒ B): Option[B]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  104. def reduceOption[A1 >: A](op: (A1, A1) ⇒ A1): Option[A1]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  105. def reduceRight[B >: A](op: (A, B) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  106. def reduceRightOption[B >: A](op: (A, B) ⇒ B): Option[B]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  107. def repr: LazySeq[A]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  108. def reversed: List[A]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  109. def scan[B >: A, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[LazySeq[A], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  110. def scanLeft[B, That](z: B)(op: (B, A) ⇒ B)(implicit bf: CanBuildFrom[LazySeq[A], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  111. def scanRight[B, That](z: B)(op: (A, B) ⇒ B)(implicit bf: CanBuildFrom[LazySeq[A], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
    Annotations
    @migration
    Migration

    (Changed in version 2.9.0) The behavior of scanRight has changed. The previous behavior can be reproduced with scanRight.reverse.

  112. final def seq: LazySeq[A]

    Permalink
    Definition Classes
    LazySeqBase → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
  113. final def shuffle[B >: A](implicit serializer: Serializer[B]): LazySeq[B]

    Permalink
    Definition Classes
    LazySeq
  114. final def shuffle[B >: A](seed: Long)(implicit serializer: Serializer[B]): LazySeq[B]

    Permalink
    Definition Classes
    LazySeq
  115. final def shuffle[B >: A](random: Random)(implicit serializer: Serializer[B]): LazySeq[B]

    Permalink
    Definition Classes
    LazySeq
  116. def size: Int

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  117. final def slice(from: Int, until: Int): LazySeq[A]

    Permalink
    Definition Classes
    LazySeq → TraversableLike → GenTraversableLike
  118. final def sortAndCollapseBy[B >: A, K](bufferSizeLimitMB: Int, bufferRecordLimit: Int)(key: (B) ⇒ K)(op: (B, B) ⇒ B)(implicit serializer: Serializer[B], ord: Ordering[K]): LazySeq[B]

    Permalink
    Definition Classes
    LazySeq
  119. final def sortAndCollapseBy[B >: A, K](serializer: Serializer[B], bufferSizeLimitMB: Int, bufferRecordLimit: Int)(key: (B) ⇒ K)(op: (B, B) ⇒ B)(implicit ord: Ordering[K]): LazySeq[B]

    Permalink
    Definition Classes
    LazySeq
  120. final def sortAndCollapseBy[B >: A, K](key: (B) ⇒ K)(op: (B, B) ⇒ B)(implicit serializer: Serializer[B], ord: Ordering[K]): LazySeq[B]

    Permalink
    Definition Classes
    LazySeq
  121. final def sortAndCollapseBy[B >: A, K](serializer: Serializer[B])(key: (B) ⇒ K)(op: (B, B) ⇒ B)(implicit ord: Ordering[K]): LazySeq[B]

    Permalink

    Collapse elements with the same key by applying a binary operator.

    Collapse elements with the same key by applying a binary operator.

    Should be similar to doing something like: reader.groupBy(key).values.flatMap{ _.reduce(op) }

    Definition Classes
    LazySeq
  122. final def sortBy[B >: A, K](bufferSizeLimitMB: Int, bufferRecordLimit: Int)(f: (B) ⇒ K)(implicit serializer: Serializer[B], ord: Ordering[K]): LazySeq[B]

    Permalink
    Definition Classes
    LazySeq
  123. final def sortBy[B >: A, K](serializer: Serializer[B], bufferSizeLimitMB: Int, bufferRecordLimit: Int)(f: (B) ⇒ K)(implicit ord: Ordering[K]): LazySeq[B]

    Permalink
    Definition Classes
    LazySeq
  124. final def sortBy[B >: A, K](f: (B) ⇒ K)(implicit serializer: Serializer[B], ord: Ordering[K]): LazySeq[B]

    Permalink
    Definition Classes
    LazySeq
  125. final def sortBy[B >: A, K](serializer: Serializer[B])(f: (B) ⇒ K)(implicit ord: Ordering[K]): LazySeq[B]

    Permalink
    Definition Classes
    LazySeq
  126. final def sorted[B >: A](bufferSizeLimitMB: Int, bufferRecordLimit: Int)(implicit serializer: Serializer[B], ord: Ordering[B]): LazySeq[B]

    Permalink
    Definition Classes
    LazySeq
  127. final def sorted[B >: A](implicit serializer: Serializer[B], ord: Ordering[B]): LazySeq[B]

    Permalink
    Definition Classes
    LazySeq
  128. def span(p: (A) ⇒ Boolean): (LazySeq[A], LazySeq[A])

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  129. def splitAt(n: Int): (LazySeq[A], LazySeq[A])

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  130. def stringPrefix: String

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  131. def sum[B >: A](implicit num: Numeric[B]): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  132. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  133. def tail: LazySeq[A]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  134. def tails: Iterator[LazySeq[A]]

    Permalink
    Definition Classes
    TraversableLike
  135. final def take(n: Int): LazySeq[A]

    Permalink
    Definition Classes
    LazySeq → TraversableLike → GenTraversableLike
  136. final def takeWhile(p: (A) ⇒ Boolean): LazySeq[A]

    Permalink
    Definition Classes
    LazySeq → TraversableLike → GenTraversableLike
  137. def thisCollection: Traversable[A]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    TraversableLike
  138. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, A, Col[A]]): Col[A]

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  139. def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  140. def toBuffer[B >: A]: Buffer[B]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  141. def toCollection(repr: LazySeq[A]): Traversable[A]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    TraversableLike
  142. def toIndexedSeq: IndexedSeq[A]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  143. def toIterable: Iterable[A]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  144. def toIterator(batchSize: Int = 32, bufferSize: Int = 0): LazySeqIterator[A]

    Permalink
    Definition Classes
    LazySeq
  145. def toIterator: Iterator[A]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableOnce
  146. def toList: List[A]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  147. def toMap[T, U](implicit ev: <:<[A, (T, U)]): Map[T, U]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  148. def toSeq: Seq[A]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  149. def toSet[B >: A]: Set[B]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  150. def toStream: Stream[A]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableOnce
  151. def toString(): String

    Permalink
    Definition Classes
    TraversableLike → Any
  152. def toTraversable: Traversable[A]

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  153. def toVector: Vector[A]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  154. def transpose[B](implicit asTraversable: (A) ⇒ GenTraversableOnce[B]): LazySeq[LazySeq[B]]

    Permalink
    Definition Classes
    GenericTraversableTemplate
    Annotations
    @migration
    Migration

    (Changed in version 2.9.0) transpose throws an IllegalArgumentException if collections are not uniformly sized.

  155. final def unique: LazySeq[A]

    Permalink
    Definition Classes
    LazySeq
  156. final def uniqueSortBy[B >: A, K](f: (B) ⇒ K)(implicit serializer: Serializer[B], ord: Ordering[K]): LazySeq[B]

    Permalink
    Definition Classes
    LazySeq
  157. final def uniqueSortBy[B >: A, K](serializer: Serializer[B])(f: (B) ⇒ K)(implicit ord: Ordering[K]): LazySeq[B]

    Permalink
    Definition Classes
    LazySeq
  158. final def uniqueSorted[B >: A](implicit serializer: Serializer[B], ord: Ordering[B]): LazySeq[B]

    Permalink
    Definition Classes
    LazySeq
  159. final def uniqueUsing[K](f: (A) ⇒ K): LazySeq[A]

    Permalink
    Definition Classes
    LazySeq
  160. def unzip[A1, A2](implicit asPair: (A) ⇒ (A1, A2)): (LazySeq[A1], LazySeq[A2])

    Permalink
    Definition Classes
    GenericTraversableTemplate
  161. def unzip3[A1, A2, A3](implicit asTriple: (A) ⇒ (A1, A2, A3)): (LazySeq[A1], LazySeq[A2], LazySeq[A3])

    Permalink
    Definition Classes
    GenericTraversableTemplate
  162. def view(from: Int, until: Int): TraversableView[A, LazySeq[A]]

    Permalink
    Definition Classes
    TraversableLike
  163. def view: TraversableView[A, LazySeq[A]]

    Permalink
    Definition Classes
    TraversableLike
  164. final def wait(): Unit

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

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  167. final def withFilter(p: (A) ⇒ Boolean): LazySeq[A]

    Permalink
    Definition Classes
    LazySeqBase → TraversableLike → FilterMonadic
  168. final def zipWithIndex: LazySeq[(A, Int)]

    Permalink
    Definition Classes
    LazySeqBase

Inherited from LazySeq[A]

Inherited from LazySeqBase[A]

Inherited from Traversable[A]

Inherited from GenTraversable[A]

Inherited from GenericTraversableTemplate[A, LazySeq]

Inherited from TraversableLike[A, LazySeq[A]]

Inherited from GenTraversableLike[A, LazySeq[A]]

Inherited from Parallelizable[A, ParIterable[A]]

Inherited from TraversableOnce[A]

Inherited from GenTraversableOnce[A]

Inherited from FilterMonadic[A, LazySeq[A]]

Inherited from HasNewBuilder[A, fm.lazyseq.LazySeq[A] @scala.annotation.unchecked.uncheckedVariance]

Inherited from AnyRef

Inherited from Any

Ungrouped