abstract
class
FlatFileReaderWithTries extends WithFilterCompat[Try[FlatFileRow], LazySeq] with LazySeq[Try[FlatFileRow]]
Instance Constructors
-
new
FlatFileReaderWithTries()
Abstract Value Members
-
abstract
def
foreach[U](f: (Try[FlatFileRow]) ⇒ U): Unit
Concrete Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
++[B >: Try[FlatFileRow]](rest: LazySeq[B]): LazySeq[B]
-
final
def
==(arg0: Any): Boolean
-
final
def
after[U](f: (Try[FlatFileRow]) ⇒ U): LazySeq[Try[FlatFileRow]]
-
final
def
afterWithResource[R, U](resource: Resource[R])(f: (Try[FlatFileRow], R) ⇒ U): LazySeq[Try[FlatFileRow]]
-
final
def
asInstanceOf[T0]: T0
-
final
def
asTraversableOnce: TraversableOnce[Try[FlatFileRow]]
-
final
def
assertSorted[B >: Try[FlatFileRow]](implicit ord: Ordering[B]): LazySeq[B]
-
final
def
assertSortedAndUnique[B >: Try[FlatFileRow]](implicit ord: Ordering[B]): LazySeq[B]
-
final
def
assertSortedAndUniqueBy[K](key: (Try[FlatFileRow]) ⇒ K)(implicit ord: Ordering[K]): LazySeq[Try[FlatFileRow]]
-
final
def
assertSortedBy[K](key: (Try[FlatFileRow]) ⇒ K)(implicit ord: Ordering[K]): LazySeq[Try[FlatFileRow]]
-
final
def
before[U](f: (Try[FlatFileRow]) ⇒ U): LazySeq[Try[FlatFileRow]]
-
final
def
beforeWithResource[R, U](resource: Resource[R])(f: (Try[FlatFileRow], R) ⇒ U): LazySeq[Try[FlatFileRow]]
-
final
def
bucketize[B >: Try[FlatFileRow]](num: Int)(implicit serializer: Serializer[B]): Vector[LazySeq[B]]
-
final
def
buffered[B >: Try[FlatFileRow]](queue: BlockingQueue[B]): BufferedLazySeq[B]
-
final
def
buffered(size: Int): BufferedLazySeq[Try[FlatFileRow]]
-
def
clone(): AnyRef
-
final
def
collapseBy[B >: Try[FlatFileRow], K](key: (B) ⇒ K)(op: (B, B) ⇒ B)(implicit ord: Ordering[K]): LazySeq[B]
-
final
def
collect[B](pf: PartialFunction[Try[FlatFileRow], B]): LazySeq[B]
-
final
def
copyToArray[B >: Try[FlatFileRow]](xs: Array[B], start: Int, len: Int): Unit
-
final
def
drop(n: Int): LazySeq[Try[FlatFileRow]]
-
final
def
dropRight(n: Int): LazySeq[Try[FlatFileRow]]
-
final
def
dropWhile(p: (Try[FlatFileRow]) ⇒ Boolean): LazySeq[Try[FlatFileRow]]
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
final
def
exists(p: (Try[FlatFileRow]) ⇒ Boolean): Boolean
-
final
def
filter(p: (Try[FlatFileRow]) ⇒ Boolean): LazySeq[Try[FlatFileRow]]
-
final
def
filterNot(p: (Try[FlatFileRow]) ⇒ Boolean): LazySeq[Try[FlatFileRow]]
-
final
def
find(p: (Try[FlatFileRow]) ⇒ Boolean): Option[Try[FlatFileRow]]
-
final
def
flatMap[B](f: (Try[FlatFileRow]) ⇒ TraversableOnce[B])(implicit dummyImplicit: DummyImplicit): LazySeq[B]
-
final
def
flatMap[B](f: (Try[FlatFileRow]) ⇒ TraversableOnceOrIterableOnce[B]): LazySeq[B]
-
final
def
flatten[B](implicit asTraversable: (Try[FlatFileRow]) ⇒ TraversableOnceOrIterableOnce[B]): LazySeq[B]
-
def
foldLeft[B](z: B)(op: (B, Try[FlatFileRow]) ⇒ B): B
-
final
def
forall(p: (Try[FlatFileRow]) ⇒ Boolean): Boolean
-
final
def
getClass(): Class[_]
-
final
def
groupBy[B >: Try[FlatFileRow], K](f: (Try[FlatFileRow]) ⇒ K)(implicit serializer: Serializer[B]): Map[K, LazySeq[B]]
-
final
def
groupBy[B >: Try[FlatFileRow], K](serializer: Serializer[B])(f: (Try[FlatFileRow]) ⇒ K): Map[K, LazySeq[B]]
-
final
def
grouped[B >: Try[FlatFileRow]](size: Int, additionalIncrement: (B) ⇒ Int): LazySeq[IndexedSeq[B]]
-
final
def
grouped[B >: Try[FlatFileRow]](size: Int): LazySeq[IndexedSeq[B]]
-
final
def
groupedBy[K](by: (Try[FlatFileRow]) ⇒ K): LazySeq[(K, IndexedSeq[Try[FlatFileRow]])]
-
final
def
hasKnownSize: Boolean
-
final
def
hasKnownSizeAndIsEmpty: Boolean
-
final
def
hasKnownSizeAndIsNonEmpty: Boolean
-
def
hashCode(): Int
-
-
def
headOption: Option[Try[FlatFileRow]]
-
def
isEmpty: Boolean
-
final
def
isInstanceOf[T0]: Boolean
-
def
isTraversableAgain: Boolean
-
def
knownSize: Int
-
final
def
map[B](f: (Try[FlatFileRow]) ⇒ B): LazySeq[B]
-
def
mapExceptions(f: (Throwable) ⇒ Throwable): LazySeq[Try[FlatFileRow]]
-
def
max[B >: Try[FlatFileRow]](implicit cmp: Ordering[B]): Try[FlatFileRow]
-
final
def
mergeCorresponding[B >: Try[FlatFileRow]](that: LazySeq[B])(implicit ord: Ordering[B]): LazySeq[EitherOrBoth[B, B]]
-
final
def
mergeCorrespondingByKey[R, K](that: LazySeq[R], thisKey: (Try[FlatFileRow]) ⇒ K, thatKey: (R) ⇒ K)(implicit ord: Ordering[K]): LazySeq[EitherOrBoth[Try[FlatFileRow], R]]
-
def
min[B >: Try[FlatFileRow]](implicit ord: Ordering[B]): Try[FlatFileRow]
-
final
def
ne(arg0: AnyRef): Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
final
def
onFirst[U](f: (Try[FlatFileRow]) ⇒ U): LazySeq[Try[FlatFileRow]]
-
final
def
onLast[U](f: (Try[FlatFileRow]) ⇒ U): LazySeq[Try[FlatFileRow]]
-
final
def
parFlatMap[B](threads: Int, inputBuffer: Int, resultBuffer: Int)(f: (Try[FlatFileRow]) ⇒ TraversableOnceOrIterableOnce[B]): LazySeq[B]
-
final
def
parFlatMap[B](f: (Try[FlatFileRow]) ⇒ TraversableOnceOrIterableOnce[B]): LazySeq[B]
-
final
def
parForeach[U](threads: Int, inputBuffer: Int)(f: (Try[FlatFileRow]) ⇒ U): Unit
-
final
def
parForeach[U](f: (Try[FlatFileRow]) ⇒ U): Unit
-
final
def
parMap[B](threads: Int, inputBuffer: Int, resultBuffer: Int)(f: (Try[FlatFileRow]) ⇒ B): LazySeq[B]
-
final
def
parMap[B](f: (Try[FlatFileRow]) ⇒ B): LazySeq[B]
-
final
def
partition[B >: Try[FlatFileRow]](p: (Try[FlatFileRow]) ⇒ Boolean)(implicit serializer: Serializer[B]): (LazySeq[B], LazySeq[B])
-
def
reduceLeft[B >: Try[FlatFileRow]](op: (B, Try[FlatFileRow]) ⇒ B): B
-
def
reduceLeftOption[B >: Try[FlatFileRow]](op: (B, Try[FlatFileRow]) ⇒ B): Option[B]
-
final
def
shuffle[B >: Try[FlatFileRow]](implicit serializer: Serializer[B]): LazySeq[B]
-
final
def
shuffle[B >: Try[FlatFileRow]](seed: Long)(implicit serializer: Serializer[B]): LazySeq[B]
-
final
def
shuffle[B >: Try[FlatFileRow]](random: Random)(implicit serializer: Serializer[B]): LazySeq[B]
-
final
def
slice(from: Int, until: Int): LazySeq[Try[FlatFileRow]]
-
final
def
sortAndCollapseBy[B >: Try[FlatFileRow], 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 >: Try[FlatFileRow], 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 >: Try[FlatFileRow], K](key: (B) ⇒ K)(op: (B, B) ⇒ B)(implicit serializer: Serializer[B], ord: Ordering[K]): LazySeq[B]
-
final
def
sortAndCollapseBy[B >: Try[FlatFileRow], K](serializer: Serializer[B])(key: (B) ⇒ K)(op: (B, B) ⇒ B)(implicit ord: Ordering[K]): LazySeq[B]
-
final
def
sortBy[B >: Try[FlatFileRow], K](bufferSizeLimitMB: Int, bufferRecordLimit: Int)(f: (B) ⇒ K)(implicit serializer: Serializer[B], ord: Ordering[K]): LazySeq[B]
-
final
def
sortBy[B >: Try[FlatFileRow], K](serializer: Serializer[B], bufferSizeLimitMB: Int, bufferRecordLimit: Int)(f: (B) ⇒ K)(implicit ord: Ordering[K]): LazySeq[B]
-
final
def
sortBy[B >: Try[FlatFileRow], K](f: (B) ⇒ K)(implicit serializer: Serializer[B], ord: Ordering[K]): LazySeq[B]
-
final
def
sortBy[B >: Try[FlatFileRow], K](serializer: Serializer[B])(f: (B) ⇒ K)(implicit ord: Ordering[K]): LazySeq[B]
-
final
def
sorted[B >: Try[FlatFileRow]](bufferSizeLimitMB: Int, bufferRecordLimit: Int)(implicit serializer: Serializer[B], ord: Ordering[B]): LazySeq[B]
-
final
def
sorted[B >: Try[FlatFileRow]](implicit serializer: Serializer[B], ord: Ordering[B]): LazySeq[B]
-
def
sum[B >: Try[FlatFileRow]](implicit num: Numeric[B]): B
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
final
def
take(n: Int): LazySeq[Try[FlatFileRow]]
-
final
def
takeWhile(p: (Try[FlatFileRow]) ⇒ Boolean): LazySeq[Try[FlatFileRow]]
-
def
toArray[B >: Try[FlatFileRow]](implicit arg0: ClassTag[B]): Array[B]
-
def
toIndexedSeq: IndexedSeq[Try[FlatFileRow]]
-
def
toIterator(batchSize: Int, bufferSize: Int): LazySeqIterator[Try[FlatFileRow]]
-
def
toIterator: LazySeqIterator[Try[FlatFileRow]]
-
def
toList: List[Try[FlatFileRow]]
-
-
def
toString(): String
-
def
toVector: Vector[Try[FlatFileRow]]
-
final
def
unique: LazySeq[Try[FlatFileRow]]
-
final
def
uniqueSortBy[B >: Try[FlatFileRow], K](f: (B) ⇒ K)(implicit serializer: Serializer[B], ord: Ordering[K]): LazySeq[B]
-
final
def
uniqueSortBy[B >: Try[FlatFileRow], K](serializer: Serializer[B])(f: (B) ⇒ K)(implicit ord: Ordering[K]): LazySeq[B]
-
final
def
uniqueSorted[B >: Try[FlatFileRow]](implicit serializer: Serializer[B], ord: Ordering[B]): LazySeq[B]
-
final
def
uniqueUsing[K](f: (Try[FlatFileRow]) ⇒ K): LazySeq[Try[FlatFileRow]]
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
-
final
def
wait(): Unit
-
final
def
withFilter(p: (Try[FlatFileRow]) ⇒ Boolean): LazySeq[Try[FlatFileRow]]
-
final
def
zipWithIndex: LazySeq[(Try[FlatFileRow], Int)]
Deprecated Value Members
-
def
finalize(): Unit
Inherited from WithFilterCompat[Try[FlatFileRow], LazySeq]
Inherited from AnyRef
Inherited from Any
