trait
ResourceLazySeq[A, R] extends LazySeq[A]
Abstract Value Members
-
abstract
def
foreachWithResource[U](f: (A) ⇒ U, r: R): Unit
-
abstract
def
resource: Resource[R]
Concrete Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
++[B >: A](rest: LazySeq[B]): LazySeq[B]
-
-
def
++:[B >: A, That](that: Traversable[B])(implicit bf: CanBuildFrom[LazySeq[A], B, That]): That
-
-
def
/:[B](z: B)(op: (B, A) ⇒ B): B
-
def
:\[B](z: B)(op: (A, B) ⇒ B): B
-
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
after[U](f: (A) ⇒ U): LazySeq[A]
-
final
def
afterWithResource[R, U](resource: Resource[R])(f: (A, R) ⇒ U): LazySeq[A]
-
def
aggregate[B](z: ⇒ B)(seqop: (B, A) ⇒ B, combop: (B, B) ⇒ B): B
-
final
def
asInstanceOf[T0]: T0
-
final
def
assertSorted[B >: A](implicit ord: Ordering[B]): LazySeq[B]
-
final
def
assertSortedAndUnique[B >: A](implicit ord: Ordering[B]): LazySeq[B]
-
final
def
assertSortedAndUniqueBy[K](key: (A) ⇒ K)(implicit ord: Ordering[K]): LazySeq[A]
-
final
def
assertSortedBy[K](key: (A) ⇒ K)(implicit ord: Ordering[K]): LazySeq[A]
-
final
def
before[U](f: (A) ⇒ U): LazySeq[A]
-
final
def
beforeWithResource[R, U](resource: Resource[R])(f: (A, R) ⇒ U): LazySeq[A]
-
final
def
bucketize[B >: A](num: Int)(implicit serializer: Serializer[B]): Vector[LazySeq[B]]
-
final
def
buffered(size: Int = 0): LazySeq[A]
-
def
clone(): AnyRef
-
final
def
collapseBy[B >: A, K](key: (B) ⇒ K)(op: (B, B) ⇒ B): LazySeq[B]
-
-
-
-
-
def
copyToArray[B >: A](xs: Array[B], start: Int, len: Int): Unit
-
def
copyToArray[B >: A](xs: Array[B]): Unit
-
def
copyToArray[B >: A](xs: Array[B], start: Int): Unit
-
def
copyToBuffer[B >: A](dest: Buffer[B]): Unit
-
def
count(p: (A) ⇒ Boolean): Int
-
final
def
drop(n: Int): LazySeq[A]
-
final
def
dropRight(n: Int): LazySeq[A]
-
final
def
dropWhile(p: (A) ⇒ Boolean): LazySeq[A]
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
-
final
def
filter(p: (A) ⇒ Boolean): LazySeq[A]
-
final
def
filterNot(p: (A) ⇒ Boolean): LazySeq[A]
-
def
finalize(): Unit
-
-
-
final
def
flatten[B](implicit asTraversable: (A) ⇒ GenTraversableOnce[B]): LazySeq[B]
-
def
fold[A1 >: A](z: A1)(op: (A1, A1) ⇒ A1): A1
-
def
foldLeft[B](z: B)(op: (B, A) ⇒ B): B
-
def
foldRight[B](z: B)(op: (A, B) ⇒ B): B
-
-
def
foreach[U](f: (A) ⇒ U): Unit
-
def
genericBuilder[B]: Builder[B, LazySeq[B]]
-
final
def
getClass(): Class[_]
-
final
def
groupBy[B >: A, K](f: (A) ⇒ K)(implicit serializer: Serializer[B]): Map[K, LazySeq[B]]
-
final
def
groupBy[B >: A, K](serializer: Serializer[B])(f: (A) ⇒ K): Map[K, LazySeq[B]]
-
def
groupBy[K](f: (A) ⇒ K): Map[K, LazySeq[A]]
-
final
def
grouped[B >: A](size: Int, additionalIncrement: (B) ⇒ Int): LazySeq[IndexedSeq[B]]
-
final
def
grouped[B >: A](size: Int): LazySeq[IndexedSeq[B]]
-
final
def
groupedBy[K](by: (A) ⇒ K): LazySeq[(K, IndexedSeq[A])]
-
def
hasDefiniteSize: Boolean
-
def
hashCode(): Int
-
def
head: A
-
def
headOption: Option[A]
-
-
-
-
final
def
isInstanceOf[T0]: Boolean
-
final
def
isTraversableAgain: Boolean
-
-
def
last: A
-
def
lastOption: Option[A]
-
final
def
map[B, That](f: (A) ⇒ B)(implicit bf: CanBuildFrom[LazySeq[A], B, That]): That
-
def
max[B >: A](implicit cmp: Ordering[B]): A
-
def
maxBy[B](f: (A) ⇒ B)(implicit cmp: Ordering[B]): A
-
final
def
mergeCorresponding[B >: A](that: LazySeq[B])(implicit ord: Ordering[B]): LazySeq[EitherOrBoth[B, B]]
-
final
def
mergeCorrespondingByKey[R, K](that: LazySeq[R], thisKey: (A) ⇒ K, thatKey: (R) ⇒ K)(implicit ord: Ordering[K]): LazySeq[EitherOrBoth[A, R]]
-
def
min[B >: A](implicit cmp: Ordering[B]): A
-
def
minBy[B](f: (A) ⇒ B)(implicit cmp: Ordering[B]): A
-
def
mkString: String
-
def
mkString(sep: String): String
-
def
mkString(start: String, sep: String, end: String): String
-
final
def
ne(arg0: AnyRef): Boolean
-
final
def
newBuilder(): Builder[A, LazySeq[A]]
-
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
final
def
onFirst[U](f: (A) ⇒ U): LazySeq[A]
-
final
def
onLast[U](f: (A) ⇒ U): LazySeq[A]
-
-
def
parCombiner: Combiner[A, ParIterable[A]]
-
-
-
-
final
def
parForeach[U](f: (A) ⇒ U): Unit
-
-
final
def
parMap[B](f: (A) ⇒ B): LazySeq[B]
-
final
def
partition[B >: A](p: (A) ⇒ Boolean)(implicit serializer: Serializer[B]): (LazySeq[B], LazySeq[B])
-
-
def
product[B >: A](implicit num: Numeric[B]): B
-
def
reduce[A1 >: A](op: (A1, A1) ⇒ A1): A1
-
def
reduceLeft[B >: A](op: (B, A) ⇒ B): B
-
def
reduceLeftOption[B >: A](op: (B, A) ⇒ B): Option[B]
-
def
reduceOption[A1 >: A](op: (A1, A1) ⇒ A1): Option[A1]
-
def
reduceRight[B >: A](op: (A, B) ⇒ B): B
-
def
reduceRightOption[B >: A](op: (A, B) ⇒ B): Option[B]
-
-
def
reversed: List[A]
-
def
scan[B >: A, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[LazySeq[A], B, That]): That
-
def
scanLeft[B, That](z: B)(op: (B, A) ⇒ B)(implicit bf: CanBuildFrom[LazySeq[A], B, That]): That
-
def
scanRight[B, That](z: B)(op: (A, B) ⇒ B)(implicit bf: CanBuildFrom[LazySeq[A], B, That]): That
-
final
def
seq: LazySeq[A]
-
final
def
shuffle[B >: A](implicit serializer: Serializer[B]): LazySeq[B]
-
final
def
shuffle[B >: A](seed: Long)(implicit serializer: Serializer[B]): LazySeq[B]
-
final
def
shuffle[B >: A](random: Random)(implicit serializer: Serializer[B]): LazySeq[B]
-
def
size: Int
-
final
def
slice(from: Int, until: Int): LazySeq[A]
-
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]
-
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]
-
final
def
sortAndCollapseBy[B >: A, K](key: (B) ⇒ K)(op: (B, B) ⇒ B)(implicit serializer: Serializer[B], ord: Ordering[K]): LazySeq[B]
-
final
def
sortAndCollapseBy[B >: A, K](serializer: Serializer[B])(key: (B) ⇒ K)(op: (B, B) ⇒ B)(implicit ord: Ordering[K]): LazySeq[B]
-
final
def
sortBy[B >: A, K](bufferSizeLimitMB: Int, bufferRecordLimit: Int)(f: (B) ⇒ K)(implicit serializer: Serializer[B], ord: Ordering[K]): LazySeq[B]
-
final
def
sortBy[B >: A, K](serializer: Serializer[B], bufferSizeLimitMB: Int, bufferRecordLimit: Int)(f: (B) ⇒ K)(implicit ord: Ordering[K]): LazySeq[B]
-
final
def
sortBy[B >: A, K](f: (B) ⇒ K)(implicit serializer: Serializer[B], ord: Ordering[K]): LazySeq[B]
-
final
def
sortBy[B >: A, K](serializer: Serializer[B])(f: (B) ⇒ K)(implicit ord: Ordering[K]): LazySeq[B]
-
final
def
sorted[B >: A](bufferSizeLimitMB: Int, bufferRecordLimit: Int)(implicit serializer: Serializer[B], ord: Ordering[B]): LazySeq[B]
-
final
def
sorted[B >: A](implicit serializer: Serializer[B], ord: Ordering[B]): LazySeq[B]
-
-
-
def
stringPrefix: String
-
def
sum[B >: A](implicit num: Numeric[B]): B
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
-
-
final
def
take(n: Int): LazySeq[A]
-
final
def
takeWhile(p: (A) ⇒ Boolean): LazySeq[A]
-
def
thisCollection: Traversable[A]
-
def
to[Col[_]](implicit cbf: CanBuildFrom[Nothing, A, Col[A]]): Col[A]
-
def
toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
-
def
toBuffer[B >: A]: Buffer[B]
-
-
def
toIndexedSeq: IndexedSeq[A]
-
def
toIterable: Iterable[A]
-
def
toIterator(batchSize: Int = 32, bufferSize: Int = 0): LazySeqIterator[A]
-
def
toIterator: Iterator[A]
-
def
toList: List[A]
-
def
toMap[T, U](implicit ev: <:<[A, (T, U)]): Map[T, U]
-
def
toSeq: Seq[A]
-
def
toSet[B >: A]: Set[B]
-
def
toStream: Stream[A]
-
def
toString(): String
-
-
def
toVector: Vector[A]
-
-
final
def
unique: LazySeq[A]
-
final
def
uniqueSortBy[B >: A, K](f: (B) ⇒ K)(implicit serializer: Serializer[B], ord: Ordering[K]): LazySeq[B]
-
final
def
uniqueSortBy[B >: A, K](serializer: Serializer[B])(f: (B) ⇒ K)(implicit ord: Ordering[K]): LazySeq[B]
-
final
def
uniqueSorted[B >: A](implicit serializer: Serializer[B], ord: Ordering[B]): LazySeq[B]
-
final
def
uniqueUsing[K](f: (A) ⇒ K): LazySeq[A]
-
def
unzip[A1, A2](implicit asPair: (A) ⇒ (A1, A2)): (LazySeq[A1], LazySeq[A2])
-
def
unzip3[A1, A2, A3](implicit asTriple: (A) ⇒ (A1, A2, A3)): (LazySeq[A1], LazySeq[A2], LazySeq[A3])
-
def
view(from: Int, until: Int): TraversableView[A, LazySeq[A]]
-
def
view: TraversableView[A, LazySeq[A]]
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
-
final
def
withFilter(p: (A) ⇒ Boolean): LazySeq[A]
-
final
def
zipWithIndex: LazySeq[(A, Int)]
Inherited from HasNewBuilder[A, fm.lazyseq.LazySeq[A] @scala.annotation.unchecked.uncheckedVariance]
Inherited from AnyRef
Inherited from Any
Helper class that takes a Resource and handles using the resource