Object

fm.lazyseq.LazySeqBuilder

lazySeq

Related Doc: package LazySeqBuilder

Permalink

object lazySeq extends LazySeq[A] with Closeable

Linear Supertypes
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. lazySeq
  2. Closeable
  3. AutoCloseable
  4. LazySeq
  5. LazySeqBase
  6. Traversable
  7. GenTraversable
  8. GenericTraversableTemplate
  9. TraversableLike
  10. GenTraversableLike
  11. Parallelizable
  12. TraversableOnce
  13. GenTraversableOnce
  14. FilterMonadic
  15. HasNewBuilder
  16. AnyRef
  17. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

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. def close(): Unit

    Permalink
    Definition Classes
    lazySeq → Closeable → AutoCloseable
  27. final def collapseBy[B >: A, K](key: (B) ⇒ K)(op: (B, B) ⇒ B): LazySeq[B]

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  53. 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
    lazySeqLazySeq → GenericTraversableTemplate → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  54. def genericBuilder[B]: Builder[B, LazySeq[B]]

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

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

    Permalink
    Definition Classes
    LazySeq
  57. 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
  58. def groupBy[K](f: (A) ⇒ K): Map[K, LazySeq[A]]

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

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

    Permalink
    Definition Classes
    LazySeq
  61. 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
  62. def hasDefiniteSize: Boolean

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  63. def hasNext: Boolean

    Permalink
  64. def hashCode(): Int

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

    Permalink
    Definition Classes
    lazySeqLazySeq → GenericTraversableTemplate → TraversableLike → GenTraversableLike
  66. def headOption: Option[A]

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

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

    Permalink
    Definition Classes
    TraversableLike
  69. def isEmpty: Boolean

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

    Permalink
    Definition Classes
    Any
  71. final def isTraversableAgain: Boolean

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  72. object iterator extends LazySeqIterator[A]

    Permalink
    Definition Classes
    lazySeqLazySeq
  73. def last: A

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

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

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

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

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

    Permalink
    Definition Classes
    LazySeq
  79. 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
  80. def min[B >: A](implicit cmp: Ordering[B]): A

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

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

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

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

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

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

    Permalink
    Attributes
    protected[this]
    Definition Classes
    LazySeqBase → GenericTraversableTemplate → TraversableLike → HasNewBuilder
  87. def next(): A

    Permalink
  88. def nonEmpty: Boolean

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

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

    Permalink
    Definition Classes
    AnyRef
  91. 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
  92. 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
  93. def par: ParIterable[A]

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

    Permalink
    Attributes
    protected[this]
    Definition Classes
    TraversableLike → Parallelizable
  95. 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
  96. 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
  97. 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
  98. final def parForeach[U](f: (A) ⇒ U): Unit

    Permalink

    A Parallel foreach

    A Parallel foreach

    Definition Classes
    LazySeq
  99. 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
  100. 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
  101. 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
  102. def partition(p: (A) ⇒ Boolean): (LazySeq[A], LazySeq[A])

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

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

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

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

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  114. 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.

  115. final def seq: LazySeq[A]

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

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

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

    Permalink
    Definition Classes
    LazySeq
  119. def size: Int

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

    Permalink
    Definition Classes
    LazySeq → TraversableLike → GenTraversableLike
  121. 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
  122. 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
  123. 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
  124. 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
  125. 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
  126. 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
  127. final def sortBy[B >: A, K](f: (B) ⇒ K)(implicit serializer: Serializer[B], ord: Ordering[K]): LazySeq[B]

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  157. 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.

  158. final def unique: LazySeq[A]

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

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

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

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

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

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

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    LazySeqBase

Inherited from Closeable

Inherited from AutoCloseable

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, LazySeq[A]]

Inherited from AnyRef

Inherited from Any

Ungrouped