final
class
SortedLazySeqBuilder[V, K] extends BuilderBase[V]
Instance Constructors
-
new
SortedLazySeqBuilder(key: (V) ⇒ K, unique: Boolean = false, bufferSizeLimitMB: Int = ..., bufferRecordLimit: Int = ..., sortAndSaveThreads: Int = ..., sortAndSaveQueueSize: Int = ...)(implicit serializer: Serializer[V], ord: Ordering[K])
Type Members
-
Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
def
++=(xs: TraversableOnce[V]): SortedLazySeqBuilder.this.type
-
-
def
+=(elem1: V, elem2: V, elems: V*): SortedLazySeqBuilder.this.type
-
final
def
==(arg0: Any): Boolean
-
-
final
def
asInstanceOf[T0]: T0
-
def
clear(): Unit
-
def
clone(): AnyRef
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
def
finalize(): Unit
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
final
def
isInstanceOf[T0]: Boolean
-
lazy val
logger: Logger
-
def
mapResult[NewTo](f: (LazySeq[V]) ⇒ NewTo): Builder[V, NewTo]
-
final
def
ne(arg0: AnyRef): Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
result(): LazySeq[V]
-
-
-
def
sizeHint(size: Int): Unit
-
def
sizeHintBounded(size: Int, boundingColl: TraversableLike[_, _]): Unit
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toString(): String
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
Inherited from Logging
Inherited from AnyRef
Inherited from Any
Keeps an in-memory buffer gets sorted once a size threshold is passed and written to a temp file. This is repeated until result() is called. Data is then read back from the temp files in sorted order.
This should be thread-safe