fm-flatfile
API
Generated with
fm-flatfile/fm.flatfile.plain/LineReader

LineReader

fm.flatfile.plain.LineReader
final class LineReader(reader: Reader) extends LazySeq[StringBuilder]

Attributes

Graph
Supertypes
trait LazySeq[StringBuilder]
trait TraversableOnce[StringBuilder]
class WithFilterCompat[StringBuilder, LazySeq]
class WithFilter[StringBuilder, LazySeq]
trait Serializable
class Object
trait Matchable
class Any

Members list

Concise view

Value members

Concrete methods

def foreach[U](f: StringBuilder => U): Unit

This is the method that sub-classes must implement

This is the method that sub-classes must implement

Attributes

Inherited methods

final def ++[B >: StringBuilder](rest: LazySeq[B]): LazySeq[B]

Attributes

Inherited from:
LazySeq
final def after[U](f: StringBuilder => 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.

Attributes

Inherited from:
LazySeq
final def afterWithResource[R, U](resource: Resource[R])(f: (StringBuilder, R) => U): LazySeq[A]

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

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

Attributes

Inherited from:
LazySeq
final def asTraversableOnce: TraversableOnce[A]

Attributes

Inherited from:
TraversableOnce
final def assertSorted[B >: StringBuilder](implicit ord: Ordering[B]): LazySeq[B]

Assert that this reader is in sorted order

Assert that this reader is in sorted order

Attributes

Inherited from:
LazySeq
final def assertSortedAndUnique[B >: StringBuilder](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

Attributes

Inherited from:
LazySeq
final def assertSortedAndUniqueBy[K](key: StringBuilder => K)(implicit ord: Ordering[K]): LazySeq[A]

Attributes

Inherited from:
LazySeq
final def assertSortedBy[K](key: StringBuilder => K)(implicit ord: Ordering[K]): LazySeq[A]

Attributes

Inherited from:
LazySeq
final def before[U](f: StringBuilder => 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.

Attributes

Inherited from:
LazySeq
final def beforeWithResource[R, U](resource: Resource[R])(f: (StringBuilder, R) => U): LazySeq[A]

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

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

Attributes

Inherited from:
LazySeq
final def bucketize[B >: StringBuilder](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

Attributes

Inherited from:
LazySeq
final def buffered[B >: StringBuilder](queue: BlockingQueue[B]): BufferedLazySeq[B]

Creates an asynchronous buffer that spins up a producer thread which feeds data into a BlockingQueue that is read using the resulting LazySeq. This overload lets you pass in your own BlockingQueue implementation instead of having one created for you.

Creates an asynchronous buffer that spins up a producer thread which feeds data into a BlockingQueue that is read using the resulting LazySeq. This overload lets you pass in your own BlockingQueue implementation instead of having one created for you.

Attributes

Inherited from:
LazySeq
final def buffered(size: Int): BufferedLazySeq[A]

Creates an asynchronous buffer that spins up a producer thread which feeds data into a BlockingQueue that is read using the resulting LazySeq. The created BlockingQueue will depend on the size passed in. If the size is <= 0 then a SynchronousQueue otherwise an ArrayBlockingQueue is used.

Creates an asynchronous buffer that spins up a producer thread which feeds data into a BlockingQueue that is read using the resulting LazySeq. The created BlockingQueue will depend on the size passed in. If the size is <= 0 then a SynchronousQueue otherwise an ArrayBlockingQueue is used.

Attributes

Inherited from:
LazySeq
final def collapseBy[B >: StringBuilder, K](key: B => K)(op: (B, B) => B)(implicit ord: Ordering[K]): LazySeq[B]

Attributes

Inherited from:
LazySeq
final def collect[B](pf: PartialFunction[StringBuilder, B]): LazySeq[B]

Attributes

Inherited from:
LazySeq
final def copyToArray[B >: StringBuilder](xs: Array[B], start: Int, len: Int): Unit

Attributes

Inherited from:
LazySeq
final def drop(n: Int): LazySeq[A]

Attributes

Inherited from:
LazySeq
final def dropRight(n: Int): LazySeq[A]

Attributes

Inherited from:
LazySeq
final def dropWhile(p: StringBuilder => Boolean): LazySeq[A]

Attributes

Inherited from:
LazySeq
final def exists(p: StringBuilder => Boolean): Boolean

Attributes

Inherited from:
LazySeq
final def filter(p: StringBuilder => Boolean): LazySeq[A]

Attributes

Inherited from:
LazySeq
final def filterNot(p: StringBuilder => Boolean): LazySeq[A]

Attributes

Inherited from:
LazySeq
final def find(p: StringBuilder => Boolean): Option[A]

Attributes

Inherited from:
LazySeq
final def flatMap[B](f: StringBuilder => TraversableOnce[B])(implicit dummyImplicit: DummyImplicit): LazySeq[B]

Attributes

Inherited from:
LazySeq
final def flatMap[B](f: StringBuilder => IterableOnce[B]): LazySeq[B]

Attributes

Inherited from:
LazySeq
final def flatten[B](implicit asTraversable: StringBuilder => IterableOnce[B]): LazySeq[B]

Attributes

Inherited from:
LazySeq
def foldLeft[B](z: B)(op: (B, StringBuilder) => B): B

Attributes

Inherited from:
TraversableOnce
final def forall(p: StringBuilder => Boolean): Boolean

Attributes

Inherited from:
LazySeq
final def groupBy[B >: StringBuilder, K](f: StringBuilder => K)(implicit serializer: Serializer[B]): Map[K, LazySeq[B]]

Attributes

Inherited from:
LazySeq
final def groupBy[B >: StringBuilder, K](serializer: Serializer[B])(f: StringBuilder => 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

Attributes

Inherited from:
LazySeq
final def grouped[B >: StringBuilder](size: Int, additionalIncrement: B => Int): LazySeq[IndexedSeq[B]]

Attributes

Inherited from:
LazySeq
final def grouped[B >: StringBuilder](size: Int): LazySeq[IndexedSeq[B]]

Attributes

Inherited from:
LazySeq
final def groupedBy[K](by: StringBuilder => 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). All elements next to each other with the same key get returned in each group.

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)))

Attributes

Inherited from:
LazySeq
final def hasKnownSize: Boolean

Attributes

Inherited from:
TraversableOnce
final def hasKnownSizeAndIsEmpty: Boolean

Attributes

Inherited from:
TraversableOnce
final def hasKnownSizeAndIsNonEmpty: Boolean

Attributes

Inherited from:
TraversableOnce
def head: A

Attributes

Inherited from:
LazySeq
def headOption: Option[A]

Attributes

Inherited from:
LazySeq
def isEmpty: Boolean

Attributes

Inherited from:
LazySeq
def isTraversableAgain: Boolean

Attributes

Inherited from:
TraversableOnce
override def knownSize: Int

Attributes

Returns:

The number of elements in this collection, if it can be cheaply computed, -1 otherwise. Cheaply usually means: Not requiring a collection traversal.

Definition Classes
LazySeq -> TraversableOnce
Inherited from:
LazySeq
final def map[B](f: StringBuilder => B): LazySeq[B]

Attributes

Inherited from:
LazySeq
def max[B >: StringBuilder](implicit cmp: Ordering[B]): A

Attributes

Inherited from:
TraversableOnce
final def mergeCorresponding[B >: StringBuilder](that: LazySeq[B])(implicit ord: Ordering[B]): LazySeq[EitherOrBoth[B, B]]

Attributes

Inherited from:
LazySeq
final def mergeCorrespondingByKey[R, K](that: LazySeq[R], thisKey: StringBuilder => 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.

Attributes

Inherited from:
LazySeq
def min[B >: StringBuilder](implicit ord: Ordering[B]): A

Attributes

Inherited from:
TraversableOnce
final def onFirst[U](f: StringBuilder => 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

Attributes

Inherited from:
LazySeq
final def onLast[U](f: StringBuilder => 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

Attributes

Inherited from:
LazySeq
final def parFlatMap[B](threads: Int, inputBuffer: Int, resultBuffer: Int)(f: StringBuilder => IterableOnce[B]): LazySeq[B]

Performs a parallel flat map maintaining ordered output

Performs a parallel flat map maintaining ordered output

Attributes

Inherited from:
LazySeq
final def parFlatMap[B](f: StringBuilder => IterableOnce[B]): LazySeq[B]

Performs a parallel flat map maintaining ordered output

Performs a parallel flat map maintaining ordered output

Attributes

Inherited from:
LazySeq
final def parForeach[U](threads: Int, inputBuffer: Int)(f: StringBuilder => U): Unit

A Parallel foreach

A Parallel foreach

Attributes

Inherited from:
LazySeq
final def parForeach[U](f: StringBuilder => U): Unit

A Parallel foreach

A Parallel foreach

Attributes

Inherited from:
LazySeq
final def parMap[B](threads: Int, inputBuffer: Int, resultBuffer: Int)(f: StringBuilder => B): LazySeq[B]

Performs a parallel map maintaining ordered output

Performs a parallel map maintaining ordered output

Attributes

Inherited from:
LazySeq
final def parMap[B](f: StringBuilder => B): LazySeq[B]

Performs a parallel map maintaining ordered output

Performs a parallel map maintaining ordered output

Attributes

Inherited from:
LazySeq
final def partition[B >: StringBuilder](p: StringBuilder => Boolean)(implicit serializer: Serializer[B]): (LazySeq[B], LazySeq[B])

Standard partition implementation using LazySeqs

Standard partition implementation using LazySeqs

Attributes

Inherited from:
LazySeq
def reduceLeft[B >: StringBuilder](op: (B, StringBuilder) => B): B

Attributes

Inherited from:
TraversableOnce
def reduceLeftOption[B >: StringBuilder](op: (B, StringBuilder) => B): Option[B]

Attributes

Inherited from:
TraversableOnce
final def shuffle[B >: StringBuilder](implicit serializer: Serializer[B]): LazySeq[B]

Attributes

Inherited from:
LazySeq
final def shuffle[B >: StringBuilder](seed: Long)(implicit serializer: Serializer[B]): LazySeq[B]

Attributes

Inherited from:
LazySeq
final def shuffle[B >: StringBuilder](random: Random)(implicit serializer: Serializer[B]): LazySeq[B]

Attributes

Inherited from:
LazySeq
final def slice(from: Int, until: Int): LazySeq[A]

Attributes

Inherited from:
LazySeq
final def sortAndCollapseBy[B >: StringBuilder, K](bufferSizeLimitMB: Int, bufferRecordLimit: Int)(key: B => K)(op: (B, B) => B)(implicit serializer: Serializer[B], ord: Ordering[K]): LazySeq[B]

Attributes

Inherited from:
LazySeq
final def sortAndCollapseBy[B >: StringBuilder, K](serializer: Serializer[B], bufferSizeLimitMB: Int, bufferRecordLimit: Int)(key: B => K)(op: (B, B) => B)(implicit ord: Ordering[K]): LazySeq[B]

Attributes

Inherited from:
LazySeq
final def sortAndCollapseBy[B >: StringBuilder, K](key: B => K)(op: (B, B) => B)(implicit serializer: Serializer[B], ord: Ordering[K]): LazySeq[B]

Attributes

Inherited from:
LazySeq
final def sortAndCollapseBy[B >: StringBuilder, 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) }

Attributes

Inherited from:
LazySeq
final def sortBy[B >: StringBuilder, K](bufferSizeLimitMB: Int, bufferRecordLimit: Int)(f: B => K)(implicit serializer: Serializer[B], ord: Ordering[K]): LazySeq[B]

Attributes

Inherited from:
LazySeq
final def sortBy[B >: StringBuilder, K](serializer: Serializer[B], bufferSizeLimitMB: Int, bufferRecordLimit: Int)(f: B => K)(implicit ord: Ordering[K]): LazySeq[B]

Attributes

Inherited from:
LazySeq
final def sortBy[B >: StringBuilder, K](f: B => K)(implicit serializer: Serializer[B], ord: Ordering[K]): LazySeq[B]

Attributes

Inherited from:
LazySeq
final def sortBy[B >: StringBuilder, K](serializer: Serializer[B])(f: B => K)(implicit ord: Ordering[K]): LazySeq[B]

Attributes

Inherited from:
LazySeq
final def sorted[B >: StringBuilder](bufferSizeLimitMB: Int, bufferRecordLimit: Int)(implicit serializer: Serializer[B], ord: Ordering[B]): LazySeq[B]

Attributes

Inherited from:
LazySeq
final def sorted[B >: StringBuilder](implicit serializer: Serializer[B], ord: Ordering[B]): LazySeq[B]

Attributes

Inherited from:
LazySeq
def sum[B >: StringBuilder](implicit num: Numeric[B]): B

Attributes

Inherited from:
TraversableOnce
final def take(n: Int): LazySeq[A]

Attributes

Inherited from:
LazySeq
final def takeWhile(p: StringBuilder => Boolean): LazySeq[A]

Attributes

Inherited from:
LazySeq
def toArray[B >: StringBuilder : ClassTag]: Array[B]

Attributes

Inherited from:
TraversableOnce
def toIndexedSeq: IndexedSeq[A]

Attributes

Inherited from:
TraversableOnce
def toIterator(batchSize: Int, bufferSize: Int): LazySeqIterator[A]

Attributes

Inherited from:
LazySeq
def toIterator: LazySeqIterator[A]

Attributes

Inherited from:
LazySeq
def toList: List[A]

Attributes

Inherited from:
TraversableOnce
def toSeq: Seq[A]

Attributes

Inherited from:
TraversableOnce
def toVector: Vector[A]

Attributes

Inherited from:
TraversableOnce
final def unique: LazySeq[A]

Attributes

Inherited from:
LazySeq
final def uniqueSortBy[B >: StringBuilder, K](f: B => K)(implicit serializer: Serializer[B], ord: Ordering[K]): LazySeq[B]

Attributes

Inherited from:
LazySeq
final def uniqueSortBy[B >: StringBuilder, K](serializer: Serializer[B])(f: B => K)(implicit ord: Ordering[K]): LazySeq[B]

Attributes

Inherited from:
LazySeq
final def uniqueSorted[B >: StringBuilder](implicit serializer: Serializer[B], ord: Ordering[B]): LazySeq[B]

Attributes

Inherited from:
LazySeq
final def uniqueUsing[K](f: StringBuilder => K): LazySeq[A]

Attributes

Inherited from:
LazySeq
final def withFilter(p: StringBuilder => Boolean): LazySeq[A]

Attributes

Inherited from:
LazySeq
final def zipWithIndex: LazySeq[(A, Int)]

Attributes

Inherited from:
LazySeq
Generated with