Class/Object

fm.lazyseq

SerializerReader

Related Docs: object SerializerReader | package lazyseq

Permalink

final case class SerializerReader[A](resource: Resource[DataInput], serializer: Serializer[A]) extends WithFilterCompat[A, LazySeq] with LazySeq[A] with Logging with Product with Serializable

Linear Supertypes
Serializable, Serializable, Product, Equals, Logging, LazySeq[A], TraversableOnce[A], WithFilterCompat[A, LazySeq], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. SerializerReader
  2. Serializable
  3. Serializable
  4. Product
  5. Equals
  6. Logging
  7. LazySeq
  8. TraversableOnce
  9. WithFilterCompat
  10. AnyRef
  11. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new SerializerReader(resource: Resource[DataInput], serializer: Serializer[A])

    Permalink

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. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  5. 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
  6. 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
  7. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  8. final def asTraversableOnce: TraversableOnce[A]

    Permalink
    Definition Classes
    TraversableOnce
  9. 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
  10. 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
  11. final def assertSortedAndUniqueBy[K](key: (A) ⇒ K)(implicit ord: Ordering[K]): LazySeq[A]

    Permalink
    Definition Classes
    LazySeq
  12. final def assertSortedBy[K](key: (A) ⇒ K)(implicit ord: Ordering[K]): LazySeq[A]

    Permalink
    Definition Classes
    LazySeq
  13. 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
  14. 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
  15. 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
  16. final def buffered[B >: A](queue: BlockingQueue[B]): BufferedLazySeq[B]

    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. This overload lets you pass in your own BlockingQueue implementation instead of having one created for you.

    Definition Classes
    LazySeq
  17. final def buffered(size: Int): BufferedLazySeq[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. The created BlockingQueue will depend on the size passed in. If the size is <= 0 then a SynchronousQueue otherwise an ArrayBlockingQueue is used.

    Definition Classes
    LazySeq
  18. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @HotSpotIntrinsicCandidate() @throws( ... )
  19. final def collapseBy[B >: A, K](key: (B) ⇒ K)(op: (B, B) ⇒ B)(implicit ord: Ordering[K]): LazySeq[B]

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

    Permalink
    Definition Classes
    LazySeq
  21. final def copyToArray[B >: A](xs: Array[B], start: Int, len: Int): Unit

    Permalink
    Definition Classes
    LazySeq
  22. final def drop(n: Int): LazySeq[A]

    Permalink
    Definition Classes
    LazySeq
  23. final def dropRight(n: Int): LazySeq[A]

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

    Permalink
    Definition Classes
    LazySeq
  25. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  26. final def exists(p: (A) ⇒ Boolean): Boolean

    Permalink
    Definition Classes
    LazySeq
  27. final def filter(p: (A) ⇒ Boolean): LazySeq[A]

    Permalink
    Definition Classes
    LazySeq
  28. final def filterNot(p: (A) ⇒ Boolean): LazySeq[A]

    Permalink
    Definition Classes
    LazySeq
  29. final def find(p: (A) ⇒ Boolean): Option[A]

    Permalink
    Definition Classes
    LazySeq
  30. final def flatMap[B](f: (A) ⇒ TraversableOnce[B])(implicit dummyImplicit: DummyImplicit): LazySeq[B]

    Permalink
    Definition Classes
    LazySeq
  31. final def flatMap[B](f: (A) ⇒ TraversableOnceOrIterableOnce[B]): LazySeq[B]

    Permalink
    Definition Classes
    LazySeq → WithFilterCompat
  32. final def flatten[B](implicit asTraversable: (A) ⇒ TraversableOnceOrIterableOnce[B]): LazySeq[B]

    Permalink
    Definition Classes
    LazySeq
  33. def foldLeft[B](z: B)(op: (B, A) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce
  34. final def forall(p: (A) ⇒ Boolean): Boolean

    Permalink
    Definition Classes
    LazySeq
  35. 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
    SerializerReaderLazySeq → TraversableOnce → WithFilterCompat
  36. final def getClass(): Class[_]

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

    Permalink
    Definition Classes
    LazySeq
  38. 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
  39. final def grouped[B >: A](size: Int, additionalIncrement: (B) ⇒ Int): LazySeq[IndexedSeq[B]]

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

    Permalink
    Definition Classes
    LazySeq
  41. 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
  42. final def hasKnownSize: Boolean

    Permalink
    Definition Classes
    TraversableOnce
  43. final def hasKnownSizeAndIsEmpty: Boolean

    Permalink
    Definition Classes
    TraversableOnce
  44. final def hasKnownSizeAndIsNonEmpty: Boolean

    Permalink
    Definition Classes
    TraversableOnce
  45. def head: A

    Permalink
    Definition Classes
    LazySeq
  46. def headOption: Option[A]

    Permalink
    Definition Classes
    LazySeq
  47. def isEmpty: Boolean

    Permalink
    Definition Classes
    LazySeq
  48. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  49. def isTraversableAgain: Boolean

    Permalink
    Definition Classes
    TraversableOnce
  50. def knownSize: Int

    Permalink
    Definition Classes
    LazySeq → TraversableOnce
  51. lazy val logger: Logger

    Permalink
    Attributes
    protected
    Definition Classes
    Logging
  52. final def map[B](f: (A) ⇒ B): LazySeq[B]

    Permalink
    Definition Classes
    LazySeq → WithFilterCompat
  53. def max[B >: A](implicit cmp: Ordering[B]): A

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

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

    Permalink
    Definition Classes
    TraversableOnce
  57. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  58. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @HotSpotIntrinsicCandidate()
  59. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @HotSpotIntrinsicCandidate()
  60. 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
  61. 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
  62. final def parFlatMap[B](threads: Int = LazySeq.defaultThreadCount, inputBuffer: Int = LazySeq.defaultThreadCount, resultBuffer: Int = LazySeq.defaultThreadCount * 4)(f: (A) ⇒ TraversableOnceOrIterableOnce[B]): LazySeq[B]

    Permalink

    Performs a parallel flat map maintaining ordered output

    Performs a parallel flat map maintaining ordered output

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

    Permalink

    Performs a parallel flat map maintaining ordered output

    Performs a parallel flat map maintaining ordered output

    Definition Classes
    LazySeq
  64. 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
  65. final def parForeach[U](f: (A) ⇒ U): Unit

    Permalink

    A Parallel foreach

    A Parallel foreach

    Definition Classes
    LazySeq
  66. 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
  67. 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
  68. 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
  69. def reduceLeft[B >: A](op: (B, A) ⇒ B): B

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

    Permalink
    Definition Classes
    TraversableOnce
  71. val resource: Resource[DataInput]

    Permalink
  72. val serializer: Serializer[A]

    Permalink
  73. final def shuffle[B >: A](implicit serializer: Serializer[B]): LazySeq[B]

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

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

    Permalink
    Definition Classes
    LazySeq
  76. final def slice(from: Int, until: Int): LazySeq[A]

    Permalink
    Definition Classes
    LazySeq
  77. 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
  78. 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
  79. 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
  80. 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
  81. 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
  82. 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
  83. final def sortBy[B >: A, K](f: (B) ⇒ K)(implicit serializer: Serializer[B], ord: Ordering[K]): LazySeq[B]

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

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

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

    Permalink
    Definition Classes
    LazySeq
  87. def sum[B >: A](implicit num: Numeric[B]): B

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

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

    Permalink
    Definition Classes
    LazySeq
  90. final def takeWhile(p: (A) ⇒ Boolean): LazySeq[A]

    Permalink
    Definition Classes
    LazySeq
  91. def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]

    Permalink
    Definition Classes
    TraversableOnce
  92. def toIndexedSeq: IndexedSeq[A]

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

    Permalink
    Definition Classes
    LazySeq
  94. def toIterator: LazySeqIterator[A]

    Permalink
    Definition Classes
    LazySeq
  95. def toList: List[A]

    Permalink
    Definition Classes
    TraversableOnce
  96. def toSeq: Seq[A]

    Permalink
    Definition Classes
    TraversableOnce
  97. def toVector: Vector[A]

    Permalink
    Definition Classes
    TraversableOnce
  98. final def unique: LazySeq[A]

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

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

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

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

    Permalink
    Definition Classes
    LazySeq
  103. final def wait(arg0: Long, arg1: Int): Unit

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  105. final def wait(): Unit

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

    Permalink
    Definition Classes
    LazySeq → WithFilterCompat
  107. final def zipWithIndex: LazySeq[(A, Int)]

    Permalink
    Definition Classes
    LazySeq

Deprecated Value Members

  1. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @Deprecated @deprecated @throws( classOf[java.lang.Throwable] )
    Deprecated

    (Since version ) see corresponding Javadoc for more information.

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from Logging

Inherited from LazySeq[A]

Inherited from TraversableOnce[A]

Inherited from WithFilterCompat[A, LazySeq]

Inherited from AnyRef

Inherited from Any

Ungrouped