Class TreeSeqMap.Builder

final class Builder[K, V](orderedBy: OrderBy) extends Builder[(K, V), TreeSeqMap[K, V]]

Supertypes	trait Builder[(K, V), TreeSeqMap[K, V]] trait Growable[(K, V)] trait Clearable class Object trait Matchable class Any

Concrete methods

Source

override def addOne(elem: (K, V)): Builder.this.type

Adds a single element to this growable collection.

Value parameters	elem the element to add.
Returns	the growable collection itself
Definition Classes	Growable

Source

def addOne(key: K, value: V): Builder.this.type

Source

override def clear(): Unit

Clears the contents of this builder. After execution of this method the builder will contain no elements.

Definition Classes	Builder -> Clearable

Source

override def result(): TreeSeqMap[K, V]

Result collection consisting of all elements appended so far.

Definition Classes	Builder

Inherited methods

Source

final def ++=(xs: IterableOnce[(K, V)]): Growable.this.type

Alias for addAll

Inherited from	Growable

Source

final def +=(elem: (K, V)): Growable.this.type

Alias for addOne

Inherited from	Growable

Source

def addAll(xs: IterableOnce[(K, V)]): Growable.this.type

Adds all elements produced by an IterableOnce to this growable collection.

Value parameters	xs the IterableOnce producing the elements to add.
Returns	the growable collection itself.
Inherited from	Growable

Source

def knownSize: Int

Returns	The number of elements in the collection under construction, if it can be cheaply computed, -1 otherwise. The default implementation always returns -1.
Inherited from	Growable

Source

def mapResult[NewTo](f: TreeSeqMap[K, V] => NewTo): Builder[A, NewTo]

A builder resulting from this builder my mapping the result using f.

Inherited from	Builder

Source

final def sizeHint(coll: IterableOnce[_], delta: Int): Unit

Gives a hint that one expects the result of this builder to have the same size as the given collection, plus some delta. This will provide a hint only if the collection has a known size Some builder classes will optimize their representation based on the hint. However, builder implementations are still required to work correctly even if the hint is wrong, i.e. a different number of elements is added.

Value parameters	coll the collection which serves as a hint for the result's size. delta a correction to add to the coll.size to produce the size hint.
Inherited from	Builder

Source

def sizeHint(size: Int): Unit

Gives a hint how many elements are expected to be added when the next result is called. Some builder classes will optimize their representation based on the hint. However, builder implementations are still required to work correctly even if the hint is wrong, i.e. a different number of elements is added.

Value parameters	size the hint how many elements will be added.
Inherited from	Builder

Source

final def sizeHintBounded(size: Int, boundingColl: Iterable[_]): Unit

Gives a hint how many elements are expected to be added when the next result is called, together with an upper bound given by the size of some other collection. Some builder classes will optimize their representation based on the hint. However, builder implementations are still required to work correctly even if the hint is wrong, i.e. a different number of elements is added.

Value parameters	boundingColl the bounding collection. If it is an IndexedSeqLike, then sizes larger than collection's size are reduced. size the hint how many elements will be added.
Inherited from	Builder