scala.collection.mutable
Members list
Type members
Classlikes
Explicit instantiation of theBuffer trait to reduce class file size in subclasses.
Explicit instantiation of theBuffer trait to reduce class file size in subclasses.
Attributes
- Source
- Buffer.scala
- Supertypes
- traitBuffer[A]traitShrinkable[A]traitGrowable[A]traitClearableclassAbstractSeq[A]traitSeq[A]traitCloneabletraitIterable[A]classAbstractSeq[A]traitSeq[A]traitEqualsclassAbstractIterable[A]traitIterable[A]traitIterableOnce[A]classObjecttraitMatchableclassAnyShow all
- Known subtypes
- classArrayBuffer[A]classArrayDeque[A]classQueue[A]classStack[A]classListBuffer[A]classUnrolledBuffer[T]Show all
Explicit instantiation of theIterable trait to reduce class file size in subclasses.
Explicit instantiation of theIterable trait to reduce class file size in subclasses.
Attributes
- Source
- Iterable.scala
- Supertypes
- traitIterable[A]classAbstractIterable[A]traitIterable[A]traitIterableOnce[A]classObjecttraitMatchableclassAnyShow all
- Known subtypes
- classPriorityQueue[A]
Explicit instantiation of theMap trait to reduce class file size in subclasses.
Explicit instantiation of theMap trait to reduce class file size in subclasses.
Attributes
- Source
- Map.scala
- Supertypes
- Known subtypes
Explicit instantiation of theSeq trait to reduce class file size in subclasses.
Explicit instantiation of theSeq trait to reduce class file size in subclasses.
Attributes
- Source
- Seq.scala
- Supertypes
- traitSeq[A]traitCloneabletraitIterable[A]classAbstractSeq[A]traitSeq[A]traitEqualsclassAbstractIterable[A]traitIterable[A]traitIterableOnce[A]classObjecttraitMatchableclassAnyShow all
- Known subtypes
- classAbstractBuffer[A]classArrayBuffer[A]classArrayDeque[A]classQueue[A]classStack[A]classListBuffer[A]classUnrolledBuffer[T]classArraySeq[T]classofBooleanclassofByteclassofCharclassofDoubleclassofFloatclassofIntclassofLongclassofRef[T]classofShortclassofUnitclassStringBuilderShow all
Explicit instantiation of theSet trait to reduce class file size in subclasses.
Explicit instantiation of theSet trait to reduce class file size in subclasses.
Attributes
- Source
- Set.scala
- Supertypes
- traitSet[A]traitShrinkable[A]traitGrowable[A]traitClearabletraitCloneabletraitIterable[A]classAbstractSet[A]traitSet[A]traitEqualsclassAbstractIterable[A]traitIterable[A]traitIterableOnce[A]classObjecttraitMatchableclassAnyShow all
- Known subtypes
An implementation of theBuffer class using an array to represent the assembled sequence internally.
An implementation of theBuffer class using an array to represent the assembled sequence internally. Append, update and random access take constant time (amortized time). Prepends and removes are linear in the buffer size.
Type parameters
- A
the type of this arraybuffer's elements.
Attributes
- See also
"Scala's Collection Library overview" section on
Array Buffersfor more information.- Companion
- object
- Source
- ArrayBuffer.scala
- Supertypes
- traitDefaultSerializabletraitSerializabletraitIndexedBuffer[A]traitIndexedSeq[A]traitIndexedSeq[A]classAbstractBuffer[A]traitBuffer[A]traitShrinkable[A]traitGrowable[A]traitClearableclassAbstractSeq[A]traitSeq[A]traitCloneabletraitIterable[A]classAbstractSeq[A]traitSeq[A]traitEqualsclassAbstractIterable[A]traitIterable[A]traitIterableOnce[A]classObjecttraitMatchableclassAnyShow all
Factory object for theArrayBuffer class.
Factory object for theArrayBuffer class.
This object provides a set of operations to createIterable values.
Attributes
- Companion
- class
- Source
- ArrayBuffer.scala
- Supertypes
- traitSeqFactory[ArrayBuffer]traitIterableFactory[ArrayBuffer]traitSerializableclassObjecttraitMatchableclassAnyShow all
- Self type
- ArrayBuffer.type
Attributes
- Source
- ArrayBuffer.scala
- Supertypes
- classAbstractIndexedSeqView[A]traitIndexedSeqView[A]classAbstractSeqView[A]traitSeqView[A]classAbstractView[A]traitView[A]traitSerializableclassAbstractIterable[A]traitIterable[A]traitIterableOnce[A]classObjecttraitMatchableclassAnyShow all
A builder class for arrays.
A builder class for arrays.
Type parameters
- T
the type of the elements for the builder.
Attributes
- Companion
- object
- Source
- ArrayBuilder.scala
- Supertypes
- Known subtypes
A companion object for array builders.
A companion object for array builders.
Attributes
- Companion
- class
- Source
- ArrayBuilder.scala
- Supertypes
- Self type
- ArrayBuilder.type
An implementation of a double-ended queue that internally uses a resizable circular buffer.
An implementation of a double-ended queue that internally uses a resizable circular buffer.
Append, prepend, removeHead, removeLast and random-access (indexed-lookup and indexed-replacement) take amortized constant time. In general, removals and insertions at i-th index are O(min(i, n-i)) and thus insertions and removals from end/beginning are fast.
Type parameters
- A
the type of this ArrayDeque's elements.
Attributes
- Note
Subclassesmust override the
ofArrayprotected method to return a more specific type.- Companion
- object
- Source
- ArrayDeque.scala
- Supertypes
- traitDefaultSerializabletraitSerializabletraitIndexedBuffer[A]traitIndexedSeq[A]traitIndexedSeq[A]classAbstractBuffer[A]traitBuffer[A]traitShrinkable[A]traitGrowable[A]traitClearableclassAbstractSeq[A]traitSeq[A]traitCloneabletraitIterable[A]classAbstractSeq[A]traitSeq[A]traitEqualsclassAbstractIterable[A]traitIterable[A]traitIterableOnce[A]classObjecttraitMatchableclassAnyShow all
- Known subtypes
This object provides a set of operations to createIterable values.
This object provides a set of operations to createIterable values.
Attributes
- Companion
- class
- Source
- ArrayDeque.scala
- Supertypes
- traitSeqFactory[ArrayDeque]traitIterableFactory[ArrayDeque]traitSerializableclassObjecttraitMatchableclassAnyShow all
- Self type
- ArrayDeque.type
Attributes
- Source
- ArrayDeque.scala
- Supertypes
- Known subtypes
A collection representingArray[T].
A collection representingArray[T]. UnlikeArrayBuffer it is always backed by the same underlyingArray, therefore it is not growable or shrinkable.
Type parameters
- T
type of the elements in this wrapped array.
Attributes
- Companion
- object
- Source
- ArraySeq.scala
- Supertypes
- traitSerializabletraitIndexedSeq[T]traitIndexedSeq[T]classAbstractSeq[T]traitSeq[T]traitCloneabletraitIterable[T]classAbstractSeq[T]traitSeq[T]traitEqualsclassAbstractIterable[T]traitIterable[T]traitIterableOnce[T]classObjecttraitMatchableclassAnyShow all
- Known subtypes
A companion object used to create instances ofArraySeq.
A companion object used to create instances ofArraySeq.
Attributes
- Companion
- class
- Source
- ArraySeq.scala
- Supertypes
- Self type
- ArraySeq.type
A class for mutable bitsets.
A class for mutable bitsets.
Bitsets are sets of non-negative integers which are represented as variable-size arrays of bits packed into 64-bit words. The lower bound of memory footprint of a bitset is determined by the largest number stored in it.
Attributes
- See also
"Scala's Collection Library overview" section on
Mutable Bitsetsfor more information.- Companion
- object
- Source
- BitSet.scala
- Supertypes
- traitSerializabletraitBitSetclassAbstractSet[Int]traitShrinkable[Int]traitClearabletraitCloneableclassAbstractSet[Int]traitEqualsclassAbstractIterable[Int]traitIterableOnce[Int]classObjecttraitMatchableclassAnyShow all
Attributes
- Companion
- class
- Source
- BitSet.scala
- Supertypes
- Self type
- BitSet.type
ABuffer is a growable and shrinkableSeq.
ABuffer is a growable and shrinkableSeq.
Attributes
- Companion
- object
- Source
- Buffer.scala
- Supertypes
- Known subtypes
- classAbstractBuffer[A]classArrayBuffer[A]classArrayDeque[A]classQueue[A]classStack[A]classListBuffer[A]classUnrolledBuffer[T]traitIndexedBuffer[A]Show all
Attributes
- Companion
- trait
- Source
- Buffer.scala
- Supertypes
- traitSeqFactory[Buffer]traitIterableFactory[Buffer]traitSerializableclassObjecttraitMatchableclassAnyShow all
- Self type
- Buffer.type
Base trait for collection builders.
Base trait for collection builders.
After callingresult() the behavior of a Builder (which is not also ascala.collection.mutable.ReusableBuilder) is undefined. No further methods should be called. It is common for mutable collections to be their own non-reusable Builder, in which caseresult() simply returnsthis.
Attributes
- See also
scala.collection.mutable.ReusableBuilder for Builders which can be reused after calling
result()- Source
- Builder.scala
- Supertypes
- Known subtypes
- classLongMap[V]classSystemPropertiesclassPriorityQueue[A]classVectorBuilder[A]classArrayBuilder[T]classofBooleanclassofByteclassofCharclassofDoubleclassofFloatclassofIntclassofLongclassofRef[T]classofShortclassofUnitclassListBuffer[A]classLongMapBuilder[V]classStringBuilderclassHashSet[A]classLinkedHashSet[A]traitSet[A]classAbstractSet[A]classBitSetclassTreeSet[A]traitSortedSet[A]classUnrolledBuffer[T]classAnyAccumulator[A]classDoubleAccumulatorclassIntAccumulatorclassLongAccumulatorShow all
- Self type
This trait forms part of collections that can be cleared with a clear() call.
This trait forms part of collections that can be cleared with a clear() call.
Attributes
- Source
- Growable.scala
- Supertypes
- Known subtypes
- traitGrowable[A]traitBuffer[A]classAbstractBuffer[A]classArrayBuffer[A]classArrayDeque[A]classQueue[A]classStack[A]classListBuffer[A]classUnrolledBuffer[T]traitIndexedBuffer[A]classLongMap[V]classSystemPropertiesclassPriorityQueue[A]classVectorBuilder[A]classArrayBuilder[T]classofBooleanclassofByteclassofCharclassofDoubleclassofFloatclassofIntclassofLongclassofRef[T]classofShortclassofUnitclassLongMapBuilder[V]classStringBuilderclassHashSet[A]classLinkedHashSet[A]traitSet[A]classAbstractSet[A]classBitSetclassTreeSet[A]traitSortedSet[A]classAnyAccumulator[A]classDoubleAccumulatorclassIntAccumulatorclassLongAccumulatorShow all
A trait for cloneable collections.
A trait for cloneable collections.
Type parameters
- C
Type of the collection, covariant and with reference types as upperbound.
Attributes
- Source
- Cloneable.scala
- Supertypes
- Known subtypes
- classArrayDeque[A]classQueue[A]classStack[A]classLongMap[V]classSystemPropertiesclassPriorityQueue[A]traitBuffer[A]classAbstractBuffer[A]classArrayBuffer[A]classListBuffer[A]classUnrolledBuffer[T]traitIndexedBuffer[A]classArraySeq[T]classofBooleanclassofByteclassofCharclassofDoubleclassofFloatclassofIntclassofLongclassofRef[T]classofShortclassofUnittraitIndexedSeq[T]classStringBuildertraitSeq[A]classAbstractSeq[A]classAnyAccumulator[A]classDoubleAccumulatorclassIntAccumulatorclassLongAccumulatorclassHashSet[A]classLinkedHashSet[A]traitSet[A]classAbstractSet[A]classBitSetclassTreeSet[A]traitSortedSet[A]Show all
This class implements mutable maps using a hashtable with red-black trees in the buckets for good worst-case performance on hash collisions.
This class implements mutable maps using a hashtable with red-black trees in the buckets for good worst-case performance on hash collisions. AnOrdering is required for the element type. Equality as determined by theOrdering has to be consistent withequals andhashCode. Universal equality of numeric types is not supported (similar toAnyRefMap).
Attributes
- See also
"Scala's Collection Library overview" section on
Hash Tablesfor more information.- Companion
- object
- Source
- CollisionProofHashMap.scala
- Supertypes
This object provides a set of operations to createIterable values.
This object provides a set of operations to createIterable values.
Attributes
- Companion
- class
- Source
- CollisionProofHashMap.scala
- Supertypes
- Self type
This trait forms part of collections that can be augmented using a+= operator and that can be cleared of all elements using aclear method.
This trait forms part of collections that can be augmented using a+= operator and that can be cleared of all elements using aclear method.
Attributes
- Companion
- object
- Source
- Growable.scala
- Supertypes
- Known subtypes
- traitBuffer[A]classAbstractBuffer[A]classArrayBuffer[A]classArrayDeque[A]classQueue[A]classStack[A]classListBuffer[A]classUnrolledBuffer[T]traitIndexedBuffer[A]classLongMap[V]classSystemPropertiesclassPriorityQueue[A]classVectorBuilder[A]classArrayBuilder[T]classofBooleanclassofByteclassofCharclassofDoubleclassofFloatclassofIntclassofLongclassofRef[T]classofShortclassofUnitclassLongMapBuilder[V]classStringBuilderclassHashSet[A]classLinkedHashSet[A]traitSet[A]classAbstractSet[A]classBitSetclassTreeSet[A]traitSortedSet[A]classAnyAccumulator[A]classDoubleAccumulatorclassIntAccumulatorclassLongAccumulatorShow all
The canonical builder for collections that are growable, i.e.
The canonical builder for collections that are growable, i.e. that support an efficient+= method which adds an element to the collection.
GrowableBuilders can produce only a single instance of the collection they are growing.
Attributes
- Source
- GrowableBuilder.scala
- Supertypes
This class implements mutable maps using a hashtable.
This class implements mutable maps using a hashtable.
Type parameters
- K
the type of the keys contained in this hash map.
- V
the type of the values assigned to keys in this hash map.
Attributes
- See also
"Scala's Collection Library overview" section on
Hash Tablesfor more information.- Companion
- object
- Source
- HashMap.scala
- Supertypes
- traitSerializabletraitShrinkable[K]traitClearabletraitCloneabletraitEqualstraitK=>VclassObjecttraitMatchableclassAnyShow all
This object provides a set of operations to createIterable values.
This object provides a set of operations to createIterable values.
Attributes
- Companion
- class
- Source
- HashMap.scala
- Supertypes
- Self type
- HashMap.type
This class implements mutable sets using a hashtable.
This class implements mutable sets using a hashtable.
Attributes
- See also
"Scala's Collection Library overview" section on
Hash Tablesfor more information.- Companion
- object
- Source
- HashSet.scala
- Supertypes
- traitSerializableclassAbstractSet[A]traitSet[A]traitShrinkable[A]traitGrowable[A]traitClearabletraitCloneabletraitIterable[A]classAbstractSet[A]traitSet[A]traitEqualsclassAbstractIterable[A]traitIterable[A]traitIterableOnce[A]classObjecttraitMatchableclassAnyShow all
This object provides a set of operations to createIterable values.
This object provides a set of operations to createIterable values.
Attributes
- Companion
- class
- Source
- HashSet.scala
- Supertypes
- Self type
- HashSet.type
Reusable builder for immutable collections
Attributes
- Companion
- object
- Source
- Buffer.scala
- Supertypes
- traitBuffer[A]traitShrinkable[A]traitGrowable[A]traitClearabletraitIndexedSeq[A]traitIndexedSeq[A]traitSeq[A]traitCloneabletraitSeq[A]traitEqualstraitIterable[A]traitIterable[A]traitIterableOnce[A]classObjecttraitMatchableclassAnyShow all
- Known subtypes
Attributes
- Companion
- trait
- Source
- Buffer.scala
- Supertypes
- classDelegate[IndexedBuffer]traitSeqFactory[IndexedBuffer]traitIterableFactory[IndexedBuffer]traitSerializableclassObjecttraitMatchableclassAnyShow all
- Self type
- IndexedBuffer.type
Attributes
- Companion
- object
- Source
- IndexedSeq.scala
- Supertypes
- Known subtypes
- classArraySeq[T]classofBooleanclassofByteclassofCharclassofDoubleclassofFloatclassofIntclassofLongclassofRef[T]classofShortclassofUnittraitIndexedBuffer[A]classArrayBuffer[A]classArrayDeque[A]classQueue[A]classStack[A]classStringBuilderShow all
Attributes
- Companion
- trait
- Source
- IndexedSeq.scala
- Supertypes
- classDelegate[IndexedSeq]traitSeqFactory[IndexedSeq]traitIterableFactory[IndexedSeq]traitSerializableclassObjecttraitMatchableclassAnyShow all
- Self type
- IndexedSeq.type
Attributes
- Source
- IndexedSeq.scala
- Supertypes
- Known subtypes
- classArrayBuffer[A]classArrayDeque[A]classQueue[A]classStack[A]classArraySeq[T]classofBooleanclassofByteclassofCharclassofDoubleclassofFloatclassofIntclassofLongclassofRef[T]classofShortclassofUnittraitIndexedBuffer[A]traitIndexedSeq[T]classStringBuilderShow all
Attributes
- Companion
- object
- Source
- Iterable.scala
- Supertypes
- Known subtypes
- classAbstractIterable[A]classPriorityQueue[A]classLongMap[V]classSystemPropertiestraitSeq[A]classAbstractSeq[A]classAbstractBuffer[A]classArrayBuffer[A]classArrayDeque[A]classQueue[A]classStack[A]classListBuffer[A]classUnrolledBuffer[T]classArraySeq[T]classofBooleanclassofByteclassofCharclassofDoubleclassofFloatclassofIntclassofLongclassofRef[T]classofShortclassofUnitclassStringBuildertraitBuffer[A]traitIndexedBuffer[A]traitIndexedSeq[T]classAnyAccumulator[A]classDoubleAccumulatorclassIntAccumulatorclassLongAccumulatortraitSet[A]classAbstractSet[A]classBitSetclassHashSet[A]classLinkedHashSet[A]classTreeSet[A]traitSortedSet[A]Show all
This object provides a set of operations to createIterable values.
This object provides a set of operations to createIterable values.
Attributes
- Companion
- trait
- Source
- Iterable.scala
- Supertypes
- Self type
- Iterable.type
This class implements mutable maps using a hashtable.
This class implements mutable maps using a hashtable. The iterator and all traversal methods of this class visit elements in the order they were inserted.
Type parameters
- K
the type of the keys contained in this hash map.
- V
the type of the values assigned to keys in this hash map.
Attributes
- Companion
- object
- Source
- LinkedHashMap.scala
- Supertypes
- traitDefaultSerializabletraitSerializabletraitShrinkable[K]traitClearabletraitCloneabletraitEqualstraitK=>VclassObjecttraitMatchableclassAnyShow all
This object provides a set of operations to createIterable values.
This object provides a set of operations to createIterable values.
Attributes
- Companion
- class
- Source
- LinkedHashMap.scala
- Supertypes
- Self type
- LinkedHashMap.type
This class implements mutable sets using a hashtable.
This class implements mutable sets using a hashtable. The iterator and all traversal methods of this class visit elements in the order they were inserted.
Type parameters
- A
the type of the elements contained in this set.
Attributes
- Companion
- object
- Source
- LinkedHashSet.scala
- Supertypes
- traitDefaultSerializabletraitSerializableclassAbstractSet[A]traitSet[A]traitShrinkable[A]traitGrowable[A]traitClearabletraitCloneabletraitIterable[A]classAbstractSet[A]traitSet[A]traitEqualsclassAbstractIterable[A]traitIterable[A]traitIterableOnce[A]classObjecttraitMatchableclassAnyShow all
This object provides a set of operations to createIterable values.
This object provides a set of operations to createIterable values.
Attributes
- Companion
- class
- Source
- LinkedHashSet.scala
- Supertypes
- Self type
- LinkedHashSet.type
ABuffer implementation backed by a list.
ABuffer implementation backed by a list. It provides constant time prepend and append. Most other operations are linear.
Type parameters
- A
the type of this list buffer's elements.
Attributes
- See also
"Scala's Collection Library overview" section on
List Buffersfor more information.- Companion
- object
- Source
- ListBuffer.scala
- Supertypes
- traitDefaultSerializabletraitSerializableclassAbstractBuffer[A]traitBuffer[A]traitShrinkable[A]traitGrowable[A]traitClearableclassAbstractSeq[A]traitSeq[A]traitCloneabletraitIterable[A]classAbstractSeq[A]traitSeq[A]traitEqualsclassAbstractIterable[A]traitIterable[A]traitIterableOnce[A]classObjecttraitMatchableclassAnyShow all
Attributes
- Companion
- class
- Source
- ListBuffer.scala
- Supertypes
- traitSeqFactory[ListBuffer]traitIterableFactory[ListBuffer]traitSerializableclassObjecttraitMatchableclassAnyShow all
- Self type
- ListBuffer.type
This class implements mutable maps withLong keys based on a hash table with open addressing.
This class implements mutable maps withLong keys based on a hash table with open addressing.
Basic map operations on single entries, includingcontains andget, are typically substantially faster withLongMap thanHashMap. Methods that act on the whole map, includingforeach andmap are not in general expected to be faster than with a generic map, save for those that take particular advantage of the internal structure of the map:foreachKey,foreachValue,mapValuesNow, andtransformValues.
Maps with open addressing may become less efficient at lookup after repeated addition/removal of elements. AlthoughLongMap makes a decent attempt to remain efficient regardless, callingrepack on a map that will no longer have elements removed but will be used heavily may save both time and storage space.
This map is not intended to contain more than 229 entries (approximately 500 million). The maximum capacity is 230, but performance will degrade rapidly as 2^30 is approached.
Attributes
- Companion
- object
- Source
- LongMap.scala
- Supertypes
- traitSerializabletraitShrinkable[Long]traitClearabletraitCloneabletraitEqualsclassObjecttraitMatchableclassAnyShow all
Attributes
- Companion
- class
- Source
- LongMap.scala
- Supertypes
- Self type
- LongMap.type
Base type of mutable Maps
Base type of mutable Maps
Attributes
This object provides a set of operations to createIterable values.
Attributes
- Source
- Map.scala
- Supertypes
- Known subtypes
A heap-based priority queue.
A heap-based priority queue.
To prioritize elements of typeA there must be an implicitOrdering[A] available at creation. Elements are retrieved in priority order by usingdequeue ordequeueAll.
If multiple elements have the same priority as determined by the ordering for thisPriorityQueue, no guarantees are made regarding the order in which those elements are returned bydequeue ordequeueAll. In particular, that means this class does not guarantee first-in-first-out behavior, as may be incorrectly inferred from the fact that this data structure is called a "queue".
Only thedequeue anddequeueAll methods will return elements in priority order (while removing elements from the heap). Standard collection methods such asdrop,iterator,toList andtoString use an arbitrary iteration order: they will traverse the heap or remove elements in whichever order seems most convenient.
Therefore, printing aPriorityQueue will not show elements in priority order, though the highest-priority element will be printed first. To print the elements in order, it's necessary todequeue them. To do this non-destructively, duplicate thePriorityQueue first; theclone method is a suitable way to obtain a disposable copy.
Client keys are assumed to be immutable. Mutating keys may violate the invariant of the underlying heap-ordered tree. Note thatclone does not rebuild the underlying tree.
scala> val pq = collection.mutable.PriorityQueue(1, 2, 5, 3, 7)val pq: scala.collection.mutable.PriorityQueue[Int] = PriorityQueue(7, 3, 5, 1, 2)scala> pq.toList // also not in orderval res0: List[Int] = List(7, 3, 5, 1, 2)scala> pq.clone.dequeueAllval res1: Seq[Int] = ArraySeq(7, 5, 3, 2, 1)Type parameters
- A
type of the elements in this priority queue.
Value parameters
- ord
implicit ordering used to compare the elements of type
A.
Attributes
- Companion
- object
- Source
- PriorityQueue.scala
- Supertypes
- traitSerializabletraitCloneabletraitGrowable[A]traitClearableclassAbstractIterable[A]traitIterable[A]classAbstractIterable[A]traitIterable[A]traitIterableOnce[A]classObjecttraitMatchableclassAnyShow all
Attributes
- Companion
- class
- Source
- PriorityQueue.scala
- Supertypes
- Self type
- PriorityQueue.type
Queue objects implement data structures that allow to insert and retrieve elements in a first-in-first-out (FIFO) manner.
Queue objects implement data structures that allow to insert and retrieve elements in a first-in-first-out (FIFO) manner.
Attributes
- Companion
- object
- Source
- Queue.scala
- Supertypes
- classArrayDeque[A]traitDefaultSerializabletraitSerializabletraitIndexedBuffer[A]traitIndexedSeq[A]traitIndexedSeq[A]classAbstractBuffer[A]traitBuffer[A]traitShrinkable[A]traitGrowable[A]traitClearableclassAbstractSeq[A]traitSeq[A]traitCloneabletraitIterable[A]classAbstractSeq[A]traitSeq[A]traitEqualsclassAbstractIterable[A]traitIterable[A]traitIterableOnce[A]classObjecttraitMatchableclassAnyShow all
This object provides a set of operations to createIterable values.
This object provides a set of operations to createIterable values.
Attributes
- Companion
- class
- Source
- Queue.scala
- Supertypes
- traitSeqFactory[Queue]traitIterableFactory[Queue]traitSerializableclassObjecttraitMatchableclassAnyShow all
- Self type
- Queue.type
ReusableBuilder is a marker trait that indicates that aBuilder can be reused to build more than one instance of a collection.
ReusableBuilder is a marker trait that indicates that aBuilder can be reused to build more than one instance of a collection. In particular, callingresult() followed byclear() will produce a collection and reset the builder to begin building a new collection of the same type.
In general no method other thanclear() may be called afterresult(). It is up to subclasses to implement and to document other allowed sequences of operations (e.g. calling other methods afterresult() in order to obtain different snapshots of a collection under construction).
Type parameters
- Elem
the type of elements that get added to the builder.
- To
the type of collection that it produced.
Attributes
- Source
- ReusableBuilder.scala
- Supertypes
- Known subtypes
- classVectorBuilder[A]classArrayBuilder[T]classofBooleanclassofByteclassofCharclassofDoubleclassofFloatclassofIntclassofLongclassofRef[T]classofShortclassofUnitclassListBuffer[A]classLongMapBuilder[V]classStringBuilderShow all
Attributes
- Companion
- object
- Source
- Seq.scala
- Supertypes
- Known subtypes
- classAbstractSeq[A]classAbstractBuffer[A]classArrayBuffer[A]classArrayDeque[A]classQueue[A]classStack[A]classListBuffer[A]classUnrolledBuffer[T]classArraySeq[T]classofBooleanclassofByteclassofCharclassofDoubleclassofFloatclassofIntclassofLongclassofRef[T]classofShortclassofUnitclassStringBuildertraitBuffer[A]traitIndexedBuffer[A]traitIndexedSeq[T]classAnyAccumulator[A]classDoubleAccumulatorclassIntAccumulatorclassLongAccumulatorShow all
This object provides a set of operations to createIterable values.
This object provides a set of operations to createIterable values.
Attributes
- Companion
- trait
- Source
- Seq.scala
- Supertypes
- traitSeqFactory[Seq]traitIterableFactory[Seq]traitSerializableclassObjecttraitMatchableclassAnyShow all
- Self type
- Seq.type
A generic trait for ordered mutable maps.
A generic trait for ordered mutable maps. Concrete classes have to provide functionality for the abstract methods inSeqMap.
Note that when checking for equalitySeqMap does not take into account ordering.
Type parameters
- K
the type of the keys contained in this linked map.
- V
the type of the values associated with the keys in this linked map.
Attributes
- Companion
- object
- Source
- SeqMap.scala
- Supertypes
- Known subtypes
Attributes
- Companion
- trait
- Source
- SeqMap.scala
- Supertypes
- Self type
- SeqMap.type
Attributes
- Source
- Seq.scala
- Supertypes
- Known subtypes
- traitBuffer[A]classAbstractBuffer[A]classArrayBuffer[A]classArrayDeque[A]classQueue[A]classStack[A]classListBuffer[A]classUnrolledBuffer[T]traitIndexedBuffer[A]classArraySeq[T]classofBooleanclassofByteclassofCharclassofDoubleclassofFloatclassofIntclassofLongclassofRef[T]classofShortclassofUnittraitIndexedSeq[T]classStringBuildertraitSeq[A]classAbstractSeq[A]classAnyAccumulator[A]classDoubleAccumulatorclassIntAccumulatorclassLongAccumulatorShow all
Base trait for mutable sets
Base trait for mutable sets
Attributes
- Companion
- object
- Source
- Set.scala
- Supertypes
- Known subtypes
- classAbstractSet[A]classBitSetclassHashSet[A]classLinkedHashSet[A]classTreeSet[A]traitSortedSet[A]Show all
This object provides a set of operations to createIterable values.
Attributes
- Source
- Set.scala
- Supertypes
- traitShrinkable[A]traitGrowable[A]traitClearabletraitCloneable[C]traitCloneabletraitIterableOnce[A]classObjecttraitMatchableclassAnyShow all
- Known subtypes
- classHashSet[A]classLinkedHashSet[A]traitSet[A]classAbstractSet[A]classBitSetclassTreeSet[A]traitSortedSet[A]Show all
This trait forms part of collections that can be reduced using a-= operator.
This trait forms part of collections that can be reduced using a-= operator.
Attributes
- Source
- Shrinkable.scala
- Supertypes
- Known subtypes
- traitBuffer[A]classAbstractBuffer[A]classArrayBuffer[A]classArrayDeque[A]classQueue[A]classStack[A]classListBuffer[A]classUnrolledBuffer[T]traitIndexedBuffer[A]classLongMap[V]classSystemPropertiesclassHashSet[A]classLinkedHashSet[A]traitSet[A]classAbstractSet[A]classBitSetclassTreeSet[A]traitSortedSet[A]Show all
Base type for mutable sorted map collections
Base type for mutable sorted map collections
Attributes
- Companion
- object
- Source
- SortedMap.scala
- Supertypes
- Known subtypes
Attributes
- Companion
- trait
- Source
- SortedMap.scala
- Supertypes
- Self type
- SortedMap.type
Attributes
- Source
- SortedMap.scala
- Supertypes
- Known subtypes
Base type for mutable sorted set collections
Base type for mutable sorted set collections
Attributes
This object provides a set of operations to createIterable values.
This object provides a set of operations to createIterable values.
Attributes
- Companion
- trait
- Source
- SortedSet.scala
- Supertypes
- Self type
- SortedSet.type
Attributes
- Source
- SortedSet.scala
- Supertypes
- traitShrinkable[A]traitGrowable[A]traitClearabletraitCloneable[C]traitCloneabletraitIterableOnce[A]classObjecttraitMatchableclassAnyShow all
- Known subtypes
A stack implements a data structure which allows to store and retrieve objects in a last-in-first-out (LIFO) fashion.
A stack implements a data structure which allows to store and retrieve objects in a last-in-first-out (LIFO) fashion.
Note that operations which consume and produce iterables preserve order, rather than reversing it (as would be expected from building a new stack by pushing an element at a time).
Type parameters
- A
type of the elements contained in this stack.
Attributes
- Companion
- object
- Source
- Stack.scala
- Supertypes
- classArrayDeque[A]traitDefaultSerializabletraitSerializabletraitIndexedBuffer[A]traitIndexedSeq[A]traitIndexedSeq[A]classAbstractBuffer[A]traitBuffer[A]traitShrinkable[A]traitGrowable[A]traitClearableclassAbstractSeq[A]traitSeq[A]traitCloneabletraitIterable[A]classAbstractSeq[A]traitSeq[A]traitEqualsclassAbstractIterable[A]traitIterable[A]traitIterableOnce[A]classObjecttraitMatchableclassAnyShow all
This object provides a set of operations to createIterable values.
This object provides a set of operations to createIterable values.
Attributes
- Companion
- class
- Source
- Stack.scala
- Supertypes
- traitSeqFactory[Stack]traitIterableFactory[Stack]traitSerializableclassObjecttraitMatchableclassAnyShow all
- Self type
- Stack.type
A builder ofString which is also a mutable sequence of characters.
A builder ofString which is also a mutable sequence of characters.
This class provides an API mostly compatible withjava.lang.StringBuilder, except where there are conflicts with the Scala collections API, such as thereverse method:reverse produces a newStringBuilder, andreverseInPlace mutates this builder.
Mutating operations return eitherthis.type, i.e., the current builder, orUnit.
Other methods extract data or information from the builder without mutating it.
The distinction is also reflected in naming conventions used by collections, such asappend, which mutates, andappended, which does not, orreverse, which does not mutate, andreverseInPlace, which does.
TheString result may be obtained using eitherresult() ortoString.
This Builder can be reused after callingresult() without an intermediate call toclear() in order to build multiple related results.
Attributes
- See also
"Scala's Collection Library overview" section on
StringBuildersfor more information.- Companion
- object
- Source
- StringBuilder.scala
- Supertypes
- traitSerializabletraitCharSequencetraitIndexedSeq[Char]traitIndexedSeq[Char]traitClearableclassAbstractSeq[Char]traitCloneable[StringBuilder]traitCloneableclassAbstractSeq[Char]traitEqualsclassAbstractIterable[Char]traitIterableOnce[Char]classObjecttraitMatchableclassAnyShow all
Attributes
- Companion
- class
- Source
- StringBuilder.scala
- Supertypes
- Self type
- StringBuilder.type
A mutable sorted map implemented using a mutable red-black tree as underlying data structure.
A mutable sorted map implemented using a mutable red-black tree as underlying data structure.
Type parameters
- K
the type of the keys contained in this tree map.
- V
the type of the values associated with the keys.
Value parameters
- ordering
the implicit ordering used to compare objects of type
A.
Attributes
- Companion
- object
- Source
- TreeMap.scala
- Supertypes
- traitDefaultSerializabletraitSerializabletraitShrinkable[K]traitClearabletraitCloneabletraitEqualstraitK=>VclassObjecttraitMatchableclassAnyShow all
This object provides a set of operations to createIterable values.
This object provides a set of operations to createIterable values.
Attributes
- Companion
- class
- Source
- TreeMap.scala
- Supertypes
- Self type
- TreeMap.type
A mutable sorted set implemented using a mutable red-black tree as underlying data structure.
A mutable sorted set implemented using a mutable red-black tree as underlying data structure.
Type parameters
- A
the type of the keys contained in this tree set.
Value parameters
- ordering
the implicit ordering used to compare objects of type
A.
Attributes
- Companion
- object
- Source
- TreeSet.scala
- Supertypes
- traitDefaultSerializabletraitSerializabletraitSortedSet[A]traitSortedSet[A]classAbstractSet[A]traitSet[A]traitShrinkable[A]traitGrowable[A]traitClearabletraitCloneabletraitIterable[A]classAbstractSet[A]traitSet[A]traitEqualsclassAbstractIterable[A]traitIterable[A]traitIterableOnce[A]classObjecttraitMatchableclassAnyShow all
This object provides a set of operations to createIterable values.
This object provides a set of operations to createIterable values.
Attributes
- Companion
- class
- Source
- TreeSet.scala
- Supertypes
- Self type
- TreeSet.type
A buffer that stores elements in an unrolled linked list.
A buffer that stores elements in an unrolled linked list.
Unrolled linked lists store elements in linked fixed size arrays.
Unrolled buffers retain locality and low memory overhead properties of array buffers, but offer much more efficient element addition, since they never reallocate and copy the internal array.
However, they provideO(n/m) complexity random access, wheren is the number of elements, andm the size of internal array chunks.
Ideal to use when: - elements are added to the buffer and then all of the elements are traversed sequentially - two unrolled buffers need to be concatenated (seeconcat)
Better than singly linked lists for random access, but should still be avoided for such a purpose.
Attributes
- Companion
- object
- Source
- UnrolledBuffer.scala
- Supertypes
- traitDefaultSerializabletraitSerializableclassAbstractBuffer[T]traitBuffer[T]traitShrinkable[T]traitGrowable[T]traitClearableclassAbstractSeq[T]traitSeq[T]traitCloneabletraitIterable[T]classAbstractSeq[T]traitSeq[T]traitEqualsclassAbstractIterable[T]traitIterable[T]traitIterableOnce[T]classObjecttraitMatchableclassAnyShow all
Attributes
- Companion
- class
- Source
- UnrolledBuffer.scala
- Supertypes
- Self type
- UnrolledBuffer.type
A hash map with references to entries which are weakly reachable.
A hash map with references to entries which are weakly reachable. Entries are removed from this map when the key is no longer (strongly) referenced. This class wrapsjava.util.WeakHashMap.
Type parameters
- K
type of keys contained in this map
- V
type of values associated with the keys
Attributes
- See also
"Scala's Collection Library overview" section on
Weak Hash Mapsfor more information.- Companion
- object
- Source
- WeakHashMap.scala
- Supertypes
- classJMapWrapper[K,V]classAbstractJMapWrapper[K,V]traitSerializabletraitShrinkable[K]traitClearabletraitCloneabletraitEqualstraitK=>VclassObjecttraitMatchableclassAnyShow all
This object provides a set of operations to createIterable values.
This object provides a set of operations to createIterable values.
Attributes
- Companion
- class
- Source
- WeakHashMap.scala
- Supertypes
- Self type
- WeakHashMap.type
Deprecated classlikes
This class implements mutable maps withAnyRef keys based on a hash table with open addressing.
This class implements mutable maps withAnyRef keys based on a hash table with open addressing.
Basic map operations on single entries, includingcontains andget, are typically significantly faster withAnyRefMap thanHashMap. Note that numbers and characters are not handled specially in AnyRefMap; only plainequals andhashCode are used in comparisons.
Methods that traverse or regenerate the map, includingforeach andmap, are not in general faster than withHashMap. The methodsforeachKey,foreachValue,mapValuesNow, andtransformValues are, however, faster than alternative ways to achieve the same functionality.
Maps with open addressing may become less efficient at lookup after repeated addition/removal of elements. AlthoughAnyRefMap makes a decent attempt to remain efficient regardless, callingrepack on a map that will no longer have elements removed but will be used heavily may save both time and storage space.
This map is not intended to contain more than 229 entries (approximately 500 million). The maximum capacity is 230, but performance will degrade rapidly as 230 is approached.
Attributes
- Companion
- object
- Deprecated
[Since version 2.13.16]Use `scala.collection.mutable.HashMap` instead for better performance.- Source
- AnyRefMap.scala
- Supertypes
- traitSerializabletraitShrinkable[K]traitClearabletraitCloneabletraitEqualstraitK=>VclassObjecttraitMatchableclassAnyShow all
Attributes
- Companion
- class
- Deprecated
[Since version 2.13.16]Use `scala.collection.mutable.HashMap` instead for better performance.- Source
- AnyRefMap.scala
- Supertypes
- Self type
- AnyRefMap.type
A simple mutable map backed by a list, so it preserves insertion order.
A simple mutable map backed by a list, so it preserves insertion order.
Type parameters
- K
the type of the keys contained in this list map.
- V
the type of the values assigned to keys in this list map.
Attributes
- Companion
- object
- Deprecated
[Since version 2.13.0]Use an immutable.ListMap assigned to a var instead of mutable.ListMap- Source
- ListMap.scala
- Supertypes
- traitDefaultSerializabletraitSerializabletraitShrinkable[K]traitClearabletraitCloneabletraitEqualstraitK=>VclassObjecttraitMatchableclassAnyShow all
This object provides a set of operations to createIterable values.
This object provides a set of operations to createIterable values.
Attributes
- Companion
- class
- Deprecated
[Since version 2.13.0]Use an immutable.ListMap assigned to a var instead of mutable.ListMap- Source
- ListMap.scala
- Supertypes
- Self type
- ListMap.type
A trait for mutable maps with multiple values assigned to a key.
A trait for mutable maps with multiple values assigned to a key.
This class is typically used as a mixin. It turns maps which mapK toSet[V] objects into multimaps that mapK toV objects.
Attributes
- Example
// first import all necessary types from package `collection.mutable`import collection.mutable.{ HashMap, MultiMap, Set }// to create a `MultiMap` the easiest way is to mixin it into a normal// `Map` instanceval mm = new HashMap[Int, Set[String]] with MultiMap[Int, String]// to add key-value pairs to a multimap it is important to use// the method `addBinding` because standard methods like `+` will// overwrite the complete key-value pair instead of adding the// value to the existing keymm.addBinding(1, "a")mm.addBinding(2, "b")mm.addBinding(1, "c")// mm now contains `Map(2 -> Set(b), 1 -> Set(c, a))`// to check if the multimap contains a value there is method// `entryExists`, which allows to traverse the including setmm.entryExists(1, _ == "a") == truemm.entryExists(1, _ == "b") == falsemm.entryExists(2, _ == "b") == true// to remove a previous added value there is the method `removeBinding`mm.removeBinding(1, "a")mm.entryExists(1, _ == "a") == false- Deprecated
[Since version 2.13.0]Use a scala.collection.mutable.MultiDict in the scala-collection-contrib module- Source
- MultiMap.scala
- Supertypes
Attributes
- Companion
- class
- Deprecated
[Since version 2.13.0]Use HashMap or one of the specialized versions (LongMap, AnyRefMap) instead of OpenHashMap- Source
- OpenHashMap.scala
- Supertypes
- Self type
- OpenHashMap.type
A mutable hash map based on an open addressing method.
A mutable hash map based on an open addressing method. The precise scheme is undefined, but it should make a reasonable effort to ensure that an insert with consecutive hash codes is not unnecessarily penalised. In particular, mappings of consecutive integer keys should work without significant performance loss.
Type parameters
- Key
type of the keys in this map.
- Value
type of the values in this map.
Value parameters
- initialSize
the initial size of the internal hash table.
Attributes
- Companion
- object
- Deprecated
[Since version 2.13.0]Use HashMap or one of the specialized versions (LongMap, AnyRefMap) instead of OpenHashMap- Source
- OpenHashMap.scala
- Supertypes
- traitDefaultSerializabletraitSerializabletraitShrinkable[Key]traitClearabletraitCloneabletraitEqualstraitKey=>ValueclassObjecttraitMatchableclassAnyShow all
Deprecated types
Attributes
- Deprecated
[Since version 2.13.0]Use Stack instead of ArrayStack; it now uses an array-based implementation- Source
- package.scala
Attributes
- Deprecated
[Since version 2.13.0]GrowingBuilder has been renamed to GrowableBuilder- Source
- package.scala
Attributes
- Deprecated
[Since version 2.13.0]IndexedOptimizedBuffer has been renamed to IndexedBuffer- Source
- package.scala
Attributes
- Deprecated
[Since version 2.13.0]IndexedOptimizedSeq has been renamed to IndexedSeq- Source
- package.scala
Attributes
- Deprecated
[Since version 2.13.0]mutable.LinearSeq has been removed; use LinearSeq with mutable.Seq instead- Source
- package.scala
Attributes
- Deprecated
[Since version 2.13.0]Use Iterable instead of Traversable- Source
- package.scala
Attributes
- Deprecated
[Since version 2.13.0]Use ArraySeq instead of WrappedArray; it can represent both, boxed and unboxed arrays- Source
- package.scala
Value members
Deprecated fields
Attributes
- Deprecated
[Since version 2.13.0]Use Stack instead of ArrayStack; it now uses an array-based implementation- Source
- package.scala
Attributes
- Deprecated
[Since version 2.13.0]Use Iterable instead of Traversable- Source
- package.scala
Attributes
- Deprecated
[Since version 2.13.0]Use ArraySeq instead of WrappedArray; it can represent both, boxed and unboxed arrays- Source
- package.scala