c

fm.lazyseq

JavaIterableLazySeq

final class JavaIterableLazySeq[A] extends LazySeq[A]

LazySeq Implementation using the Java Iterable 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. JavaIterableLazySeq
  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 JavaIterableLazySeq(collection: Iterable[A])

Type Members

  1. type Self = LazySeq[A]
    Attributes
    protected[this]
    Definition Classes
    TraversableLike
  2. class WithFilter extends FilterMonadic[A, Repr]
    Definition Classes
    TraversableLike

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. final def ++[B >: A](rest: LazySeq[B]): LazySeq[B]
    Definition Classes
    LazySeq
  4. def ++[B >: A, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[LazySeq[A], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  5. def ++:[B >: A, That](that: Traversable[B])(implicit bf: CanBuildFrom[LazySeq[A], B, That]): That
    Definition Classes
    TraversableLike
  6. def ++:[B >: A, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[LazySeq[A], B, That]): That
    Definition Classes
    TraversableLike
  7. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  8. def addString(b: StringBuilder): StringBuilder
    Definition Classes
    TraversableOnce
  9. def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    TraversableOnce
  10. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    TraversableOnce
  11. final def after[U](f: (A) ⇒ U): LazySeq[A]

    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
  12. final def afterWithResource[R, U](resource: Resource[R])(f: (A, R) ⇒ U): LazySeq[A]

    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
  13. def aggregate[B](z: ⇒ B)(seqop: (B, A) ⇒ B, combop: (B, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  14. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  15. final def assertSorted[B >: A](implicit ord: Ordering[B]): LazySeq[B]

    Assert that this reader is in sorted order

    Assert that this reader is in sorted order

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

    Assert that this reader is in sorted order AND unique

    Assert that this reader is in sorted order AND unique

    Definition Classes
    LazySeq
  17. final def assertSortedAndUniqueBy[K](key: (A) ⇒ K)(implicit ord: Ordering[K]): LazySeq[A]
    Definition Classes
    LazySeq
  18. final def assertSortedBy[K](key: (A) ⇒ K)(implicit ord: Ordering[K]): LazySeq[A]
    Definition Classes
    LazySeq
  19. final def before[U](f: (A) ⇒ U): LazySeq[A]

    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
  20. final def beforeWithResource[R, U](resource: Resource[R])(f: (A, R) ⇒ U): LazySeq[A]

    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
  21. final def bucketize[B >: A](num: Int)(implicit serializer: Serializer[B]): Vector[LazySeq[B]]

    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
  22. final def buffered(size: Int = 0): LazySeq[A]

    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
  23. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  24. final def collapseBy[B >: A, K](key: (B) ⇒ K)(op: (B, B) ⇒ B): LazySeq[B]
    Definition Classes
    LazySeq
  25. final def collect[B](pf: PartialFunction[A, B]): LazySeq[B]
    Definition Classes
    LazySeqBase
  26. def collect[B, That](pf: PartialFunction[A, B])(implicit bf: CanBuildFrom[LazySeq[A], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  27. def collectFirst[B](pf: PartialFunction[A, B]): Option[B]
    Definition Classes
    TraversableOnce
  28. final def companion: GenericCompanion[LazySeq]
    Definition Classes
    LazySeqBase → Traversable → GenTraversable → GenericTraversableTemplate
  29. def copyToArray[B >: A](xs: Array[B], start: Int, len: Int): Unit
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  30. def copyToArray[B >: A](xs: Array[B]): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  31. def copyToArray[B >: A](xs: Array[B], start: Int): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  32. def copyToBuffer[B >: A](dest: Buffer[B]): Unit
    Definition Classes
    TraversableOnce
  33. def count(p: (A) ⇒ Boolean): Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  34. final def drop(n: Int): LazySeq[A]
    Definition Classes
    LazySeq → TraversableLike → GenTraversableLike
  35. final def dropRight(n: Int): LazySeq[A]
    Definition Classes
    LazySeqBase
  36. final def dropWhile(p: (A) ⇒ Boolean): LazySeq[A]
    Definition Classes
    LazySeq → TraversableLike → GenTraversableLike
  37. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  38. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  39. def exists(p: (A) ⇒ Boolean): Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  40. final def filter(p: (A) ⇒ Boolean): LazySeq[A]
    Definition Classes
    LazySeqBase → TraversableLike → GenTraversableLike
  41. final def filterNot(p: (A) ⇒ Boolean): LazySeq[A]
    Definition Classes
    LazySeqBase → TraversableLike → GenTraversableLike
  42. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  43. def find(p: (A) ⇒ Boolean): Option[A]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  44. final def flatMap[B, That](f: (A) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[LazySeq[A], B, That]): That
    Definition Classes
    LazySeqBase → TraversableLike → GenTraversableLike → FilterMonadic
  45. final def flatten[B](implicit asTraversable: (A) ⇒ GenTraversableOnce[B]): LazySeq[B]
    Definition Classes
    LazySeq → GenericTraversableTemplate
  46. def fold[A1 >: A](z: A1)(op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  47. def foldLeft[B](z: B)(op: (B, A) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  48. def foldRight[B](z: B)(op: (A, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  49. def forall(p: (A) ⇒ Boolean): Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  50. def foreach[U](f: (A) ⇒ U): Unit

    This is the method that sub-classes must implement

    This is the method that sub-classes must implement

    Definition Classes
    JavaIterableLazySeq → LazySeq → GenericTraversableTemplate → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  51. def genericBuilder[B]: Builder[B, LazySeq[B]]
    Definition Classes
    GenericTraversableTemplate
  52. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  53. final def groupBy[B >: A, K](f: (A) ⇒ K)(implicit serializer: Serializer[B]): Map[K, LazySeq[B]]
    Definition Classes
    LazySeq
  54. final def groupBy[B >: A, K](serializer: Serializer[B])(f: (A) ⇒ K): Map[K, LazySeq[B]]

    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
  55. def groupBy[K](f: (A) ⇒ K): Map[K, LazySeq[A]]
    Definition Classes
    TraversableLike → GenTraversableLike
  56. final def grouped[B >: A](size: Int, additionalIncrement: (B) ⇒ Int): LazySeq[IndexedSeq[B]]
    Definition Classes
    LazySeq
  57. final def grouped[B >: A](size: Int): LazySeq[IndexedSeq[B]]
    Definition Classes
    LazySeq
  58. final def groupedBy[K](by: (A) ⇒ K): LazySeq[(K, IndexedSeq[A])]

    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
  59. def hasDefiniteSize: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  60. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  61. def head: A
    Definition Classes
    LazySeq → GenericTraversableTemplate → TraversableLike → GenTraversableLike
  62. def headOption: Option[A]
    Definition Classes
    LazySeq → TraversableLike → GenTraversableLike
  63. def init: LazySeq[A]
    Definition Classes
    TraversableLike → GenTraversableLike
  64. def inits: Iterator[LazySeq[A]]
    Definition Classes
    TraversableLike
  65. def isEmpty: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  66. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  67. final def isTraversableAgain: Boolean
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  68. def iterator: LazySeqIterator[A]
    Definition Classes
    LazySeq
  69. def last: A
    Definition Classes
    TraversableLike → GenTraversableLike
  70. def lastOption: Option[A]
    Definition Classes
    TraversableLike → GenTraversableLike
  71. final def map[B, That](f: (A) ⇒ B)(implicit bf: CanBuildFrom[LazySeq[A], B, That]): That
    Definition Classes
    LazySeqBase → TraversableLike → GenTraversableLike → FilterMonadic
  72. def max[B >: A](implicit cmp: Ordering[B]): A
    Definition Classes
    TraversableOnce → GenTraversableOnce
  73. def maxBy[B](f: (A) ⇒ B)(implicit cmp: Ordering[B]): A
    Definition Classes
    TraversableOnce → GenTraversableOnce
  74. final def mergeCorresponding[B >: A](that: LazySeq[B])(implicit ord: Ordering[B]): LazySeq[EitherOrBoth[B, B]]
    Definition Classes
    LazySeq
  75. final def mergeCorrespondingByKey[R, K](that: LazySeq[R], thisKey: (A) ⇒ K, thatKey: (R) ⇒ K)(implicit ord: Ordering[K]): LazySeq[EitherOrBoth[A, R]]

    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
  76. def min[B >: A](implicit cmp: Ordering[B]): A
    Definition Classes
    TraversableOnce → GenTraversableOnce
  77. def minBy[B](f: (A) ⇒ B)(implicit cmp: Ordering[B]): A
    Definition Classes
    TraversableOnce → GenTraversableOnce
  78. def mkString: String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  79. def mkString(sep: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  80. def mkString(start: String, sep: String, end: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  81. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  82. final def newBuilder(): Builder[A, LazySeq[A]]
    Attributes
    protected[this]
    Definition Classes
    LazySeqBase → GenericTraversableTemplate → TraversableLike → HasNewBuilder
  83. def nonEmpty: Boolean
    Definition Classes
    TraversableOnce → GenTraversableOnce
  84. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  85. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  86. final def onFirst[U](f: (A) ⇒ U): LazySeq[A]

    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
  87. final def onLast[U](f: (A) ⇒ U): LazySeq[A]

    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
  88. def par: ParIterable[A]
    Definition Classes
    Parallelizable
  89. def parCombiner: Combiner[A, ParIterable[A]]
    Attributes
    protected[this]
    Definition Classes
    TraversableLike → Parallelizable
  90. final def parFlatMap[B](threads: Int = LazySeq.defaultThreadCount, inputBuffer: Int = LazySeq.defaultThreadCount, resultBuffer: Int = LazySeq.defaultThreadCount * 4)(f: (A) ⇒ GenTraversableOnce[B]): LazySeq[B]

    Performs a parallel flat map maintaining ordered output

    Performs a parallel flat map maintaining ordered output

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

    Performs a parallel flat map maintaining ordered output

    Performs a parallel flat map maintaining ordered output

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

    A Parallel foreach

    A Parallel foreach

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

    A Parallel foreach

    A Parallel foreach

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

    Performs a parallel map maintaining ordered output

    Performs a parallel map maintaining ordered output

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

    Performs a parallel map maintaining ordered output

    Performs a parallel map maintaining ordered output

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

    Standard partition implementation using LazySeqs

    Standard partition implementation using LazySeqs

    Definition Classes
    LazySeq
  97. def partition(p: (A) ⇒ Boolean): (LazySeq[A], LazySeq[A])
    Definition Classes
    TraversableLike → GenTraversableLike
  98. def product[B >: A](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  99. def reduce[A1 >: A](op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  100. def reduceLeft[B >: A](op: (B, A) ⇒ B): B
    Definition Classes
    TraversableOnce
  101. def reduceLeftOption[B >: A](op: (B, A) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  102. def reduceOption[A1 >: A](op: (A1, A1) ⇒ A1): Option[A1]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  103. def reduceRight[B >: A](op: (A, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  104. def reduceRightOption[B >: A](op: (A, B) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  105. def repr: LazySeq[A]
    Definition Classes
    TraversableLike → GenTraversableLike
  106. def reversed: List[A]
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  107. def scan[B >: A, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[LazySeq[A], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  108. def scanLeft[B, That](z: B)(op: (B, A) ⇒ B)(implicit bf: CanBuildFrom[LazySeq[A], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  109. def scanRight[B, That](z: B)(op: (A, B) ⇒ B)(implicit bf: CanBuildFrom[LazySeq[A], B, That]): That
    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.

  110. final def seq: LazySeq[A]
    Definition Classes
    LazySeqBase → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
  111. final def shuffle[B >: A](implicit serializer: Serializer[B]): LazySeq[B]
    Definition Classes
    LazySeq
  112. final def shuffle[B >: A](seed: Long)(implicit serializer: Serializer[B]): LazySeq[B]
    Definition Classes
    LazySeq
  113. final def shuffle[B >: A](random: Random)(implicit serializer: Serializer[B]): LazySeq[B]
    Definition Classes
    LazySeq
  114. def size: Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  115. def sizeHintIfCheap: Int
    Attributes
    protected[scala.collection]
    Definition Classes
    GenTraversableOnce
  116. final def slice(from: Int, until: Int): LazySeq[A]
    Definition Classes
    LazySeq → TraversableLike → GenTraversableLike
  117. 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]
    Definition Classes
    LazySeq
  118. 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]
    Definition Classes
    LazySeq
  119. final def sortAndCollapseBy[B >: A, K](key: (B) ⇒ K)(op: (B, B) ⇒ B)(implicit serializer: Serializer[B], ord: Ordering[K]): LazySeq[B]
    Definition Classes
    LazySeq
  120. final def sortAndCollapseBy[B >: A, K](serializer: Serializer[B])(key: (B) ⇒ K)(op: (B, B) ⇒ B)(implicit ord: Ordering[K]): LazySeq[B]

    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
  121. final def sortBy[B >: A, K](bufferSizeLimitMB: Int, bufferRecordLimit: Int)(f: (B) ⇒ K)(implicit serializer: Serializer[B], ord: Ordering[K]): LazySeq[B]
    Definition Classes
    LazySeq
  122. final def sortBy[B >: A, K](serializer: Serializer[B], bufferSizeLimitMB: Int, bufferRecordLimit: Int)(f: (B) ⇒ K)(implicit ord: Ordering[K]): LazySeq[B]
    Definition Classes
    LazySeq
  123. final def sortBy[B >: A, K](f: (B) ⇒ K)(implicit serializer: Serializer[B], ord: Ordering[K]): LazySeq[B]
    Definition Classes
    LazySeq
  124. final def sortBy[B >: A, K](serializer: Serializer[B])(f: (B) ⇒ K)(implicit ord: Ordering[K]): LazySeq[B]
    Definition Classes
    LazySeq
  125. final def sorted[B >: A](bufferSizeLimitMB: Int, bufferRecordLimit: Int)(implicit serializer: Serializer[B], ord: Ordering[B]): LazySeq[B]
    Definition Classes
    LazySeq
  126. final def sorted[B >: A](implicit serializer: Serializer[B], ord: Ordering[B]): LazySeq[B]
    Definition Classes
    LazySeq
  127. def span(p: (A) ⇒ Boolean): (LazySeq[A], LazySeq[A])
    Definition Classes
    TraversableLike → GenTraversableLike
  128. def splitAt(n: Int): (LazySeq[A], LazySeq[A])
    Definition Classes
    TraversableLike → GenTraversableLike
  129. def stringPrefix: String
    Definition Classes
    TraversableLike → GenTraversableLike
  130. def sum[B >: A](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  131. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  132. def tail: LazySeq[A]
    Definition Classes
    TraversableLike → GenTraversableLike
  133. def tails: Iterator[LazySeq[A]]
    Definition Classes
    TraversableLike
  134. final def take(n: Int): LazySeq[A]
    Definition Classes
    LazySeq → TraversableLike → GenTraversableLike
  135. final def takeWhile(p: (A) ⇒ Boolean): LazySeq[A]
    Definition Classes
    LazySeq → TraversableLike → GenTraversableLike
  136. def thisCollection: Traversable[A]
    Attributes
    protected[this]
    Definition Classes
    TraversableLike
  137. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, A, Col[A]]): Col[A]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  138. def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  139. def toBuffer[B >: A]: Buffer[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  140. def toCollection(repr: LazySeq[A]): Traversable[A]
    Attributes
    protected[this]
    Definition Classes
    TraversableLike
  141. def toIndexedSeq: IndexedSeq[A]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  142. def toIterable: Iterable[A]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  143. def toIterator(batchSize: Int = 32, bufferSize: Int = 0): LazySeqIterator[A]
    Definition Classes
    LazySeq
  144. def toIterator: Iterator[A]
    Definition Classes
    TraversableLike → GenTraversableOnce
  145. def toList: List[A]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  146. def toMap[T, U](implicit ev: <:<[A, (T, U)]): Map[T, U]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  147. def toSeq: Seq[A]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  148. def toSet[B >: A]: Set[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  149. def toStream: Stream[A]
    Definition Classes
    TraversableLike → GenTraversableOnce
  150. def toString(): String
    Definition Classes
    TraversableLike → Any
  151. def toTraversable: Traversable[A]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  152. def toVector: Vector[A]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  153. def transpose[B](implicit asTraversable: (A) ⇒ GenTraversableOnce[B]): LazySeq[LazySeq[B]]
    Definition Classes
    GenericTraversableTemplate
    Annotations
    @migration
    Migration

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

  154. final def unique: LazySeq[A]
    Definition Classes
    LazySeq
  155. final def uniqueSortBy[B >: A, K](f: (B) ⇒ K)(implicit serializer: Serializer[B], ord: Ordering[K]): LazySeq[B]
    Definition Classes
    LazySeq
  156. final def uniqueSortBy[B >: A, K](serializer: Serializer[B])(f: (B) ⇒ K)(implicit ord: Ordering[K]): LazySeq[B]
    Definition Classes
    LazySeq
  157. final def uniqueSorted[B >: A](implicit serializer: Serializer[B], ord: Ordering[B]): LazySeq[B]
    Definition Classes
    LazySeq
  158. final def uniqueUsing[K](f: (A) ⇒ K): LazySeq[A]
    Definition Classes
    LazySeq
  159. def unzip[A1, A2](implicit asPair: (A) ⇒ (A1, A2)): (LazySeq[A1], LazySeq[A2])
    Definition Classes
    GenericTraversableTemplate
  160. def unzip3[A1, A2, A3](implicit asTriple: (A) ⇒ (A1, A2, A3)): (LazySeq[A1], LazySeq[A2], LazySeq[A3])
    Definition Classes
    GenericTraversableTemplate
  161. def view(from: Int, until: Int): TraversableView[A, LazySeq[A]]
    Definition Classes
    TraversableLike
  162. def view: TraversableView[A, LazySeq[A]]
    Definition Classes
    TraversableLike
  163. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  164. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  165. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  166. final def withFilter(p: (A) ⇒ Boolean): LazySeq[A]
    Definition Classes
    LazySeqBase → TraversableLike → FilterMonadic
  167. final def zipWithIndex: LazySeq[(A, Int)]
    Definition Classes
    LazySeqBase

Deprecated Value Members

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

    (Since version 2.12.10) Use foldLeft instead of /:

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

    (Since version 2.12.10) Use foldRight instead of :\

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