Type Members

1.  abstract class AbstractBuffer[A] extends AbstractSeq[A] with Buffer[A]

   Explicit instantiation of the Buffer trait to reduce class file size in subclasses.

2.  abstract class AbstractIterable[A] extends collection.AbstractIterable[A] with Iterable[A]

   Explicit instantiation of the Iterable trait to reduce class file size in subclasses.

3.  abstract class AbstractMap[A, B] extends collection.AbstractMap[A, B] with Map[A, B]

   Explicit instantiation of the Map trait to reduce class file size in subclasses.

4.  abstract class AbstractSeq[A] extends collection.AbstractSeq[A] with Seq[A]

   Explicit instantiation of the Seq trait to reduce class file size in subclasses.

5.  abstract class AbstractSet[A] extends AbstractIterable[A] with Set[A]

   Explicit instantiation of the Set trait to reduce class file size in subclasses.

6.  class ArrayBuffer[A] extends Buffer[A] with IndexedSeq[A] with IndexedSeqOps[A, ArrayBuffer, ArrayBuffer[A]] with IndexedOptimizedSeq[A] with StrictOptimizedSeqOps[A, ArrayBuffer, ArrayBuffer[A]] with Serializable

   An implementation of the Buffer class using an array to represent the assembled sequence internally.

   An implementation of the Buffer 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.

   A

   the type of this arraybuffer's elements.

   Annotations

   @SerialVersionUID()

   Version

   2.8

   Since

   1

   See also

   "Scala's Collection Library overview" section on Array Buffers for more information.

7.  class ArrayBufferView[A] extends IndexedView[A]
8.  class BitSet extends SortedSet[Int] with collection.BitSet with SortedSetOps[Int, SortedSet, BitSet] with BitSetOps[BitSet] with StrictOptimizedIterableOps[Int, Set, BitSet] with Serializable

   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 memory footprint of a bitset is determined by the largest number stored in it.

   Annotations

   @SerialVersionUID()

   See also

   "Scala's Collection Library overview" section on Mutable Bitsets for more information.

9.  trait Buffer[A] extends Seq[A] with Shrinkable[A]
10.  trait Builder[-A, +To] extends Growable[A]

    Base trait for collection builders

11.  trait Clearable extends AnyRef

    This trait forms part of collections that can be cleared with a clear() call.

12.  final class DefaultEntry[A, B] extends HashEntry[A, DefaultEntry[A, B]] with Serializable

    Class used internally for default map model.

    Class used internally for default map model.

    Since

    2.3

13.  trait Growable[-A] extends Clearable

    This trait forms part of collections that can be augmented using a += operator and that can be cleared of all elements using a clear method.

14.  class GrowableBuilder[Elem, To <: Growable[Elem]] extends Builder[Elem, To]

    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.

    Version

    2.8

    Since

    2.8

15.  trait HashEntry[A, E <: HashEntry[A, E]] extends AnyRef

    Class used internally.

    Class used internally.

    Since

    2.8

16.  class HashMap[K, V] extends AbstractMap[K, V] with MapOps[K, V, HashMap, HashMap[K, V]] with StrictOptimizedIterableOps[(K, V), Iterable, HashMap[K, V]] with Serializable

    This class implements mutable maps using a hashtable.

    This class implements mutable maps using a hashtable.

    K

    the type of the keys contained in this hash map.

    V

    the type of the values assigned to keys in this hash map.

    Annotations

    @SerialVersionUID()

    Since

    1

    See also

    "Scala's Collection Library overview" section on Hash Tables for more information.

17.  final class HashSet[A] extends Set[A] with SetOps[A, HashSet, HashSet[A]] with StrictOptimizedIterableOps[A, HashSet, HashSet[A]] with Serializable

    This class implements mutable sets using a hashtable.

    This class implements mutable sets using a hashtable.

    Annotations

    @SerialVersionUID()

    Version

    2.0, 31/12/2006

    Since

    1

    See also

    "Scala's Collection Library overview" section on Hash Tables for more information.

18.  abstract class ImmutableBuilder[-A, C] extends ReusableBuilder[A, C]

    Reusable builder for immutable collections

19.  trait IndexedOptimizedSeq[A] extends Seq[A]
20.  trait Iterable[A] extends collection.Iterable[A] with IterableOps[A, Iterable, Iterable[A]]
21.  trait IterableOps[A, +CC[X], +C] extends collection.IterableOps[A, CC, C] with Growable[A]

22.  class LinkedHashMap[K, V] extends Map[K, V] with MapOps[K, V, LinkedHashMap, LinkedHashMap[K, V]] with StrictOptimizedIterableOps[(K, V), Iterable, LinkedHashMap[K, V]] with Serializable

    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.

    K

    the type of the keys contained in this hash map.

    V

    the type of the values assigned to keys in this hash map.

    Annotations

    @SerialVersionUID()

23.  class LinkedHashSet[A] extends Set[A] with SetOps[A, LinkedHashSet, LinkedHashSet[A]] with Serializable

    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.

    A

    the type of the elements contained in this set.

    Annotations

    @SerialVersionUID()

    Version

    2.0, 31/12/2006

    Since

    1

24.  class ListBuffer[A] extends Buffer[A] with SeqOps[A, ListBuffer, ListBuffer[A]] with StrictOptimizedSeqOps[A, ListBuffer, ListBuffer[A]] with ReusableBuilder[A, List[A]] with Serializable

    A Buffer implementation backed by a list.

    A Buffer implementation backed by a list. It provides constant time prepend and append. Most other operations are linear.

    A

    the type of this list buffer's elements.

    Annotations

    @SerialVersionUID()

    Version

    2.8

    Since

    1

    See also

    "Scala's Collection Library overview" section on List Buffers for more information.

25.  trait Map[K, V] extends Iterable[(K, V)] with collection.Map[K, V] with MapOps[K, V, Map, Map[K, V]] with Shrinkable[K]

    Base type of mutable Maps

26.  trait MapOps[K, V, +CC[X, Y] <: MapOps[X, Y, CC, _], +C <: MapOps[K, V, CC, C]] extends IterableOps[(K, V), Iterable, C] with collection.MapOps[K, V, CC, C] with Shrinkable[K]

27.  trait ReusableBuilder[-Elem, +To] extends Builder[Elem, To]

    ReusableBuilder is a marker trait that indicates that a Builder can be reused to build more than one instance of a collection.

    ReusableBuilder is a marker trait that indicates that a Builder can be reused to build more than one instance of a collection. In particular, calling result followed by clear will produce a collection and reset the builder to begin building a new collection of the same type.

    It is up to subclasses to implement this behavior, and to document any other behavior that varies from standard ReusableBuilder usage (e.g. operations being well-defined after a call to result, or allowing multiple calls to result to obtain different snapshots of a collection under construction).

    Elem

    the type of elements that get added to the builder.

    To

    the type of collection that it produced.

    Since

    2.12

28.  trait Seq[A] extends Iterable[A] with collection.Seq[A] with SeqOps[A, Seq, Seq[A]]
29.  trait SeqOps[A, +CC[X] <: Seq[X], +C <: Seq[A]] extends IterableOps[A, CC, C] with collection.SeqOps[A, CC, C] with Shrinkable[A]

30.  trait Set[A] extends Iterable[A] with collection.Set[A] with SetOps[A, Set, Set[A]]

    Base trait for mutable sets

31.  trait SetOps[A, +CC[X], +C <: SetOps[A, CC, C]] extends IterableOps[A, CC, C] with collection.SetOps[A, CC, C] with Shrinkable[A]

32.  trait Shrinkable[-A] extends AnyRef

    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.

    Version

    2.8

    Since

    2.8

33.  trait SortedMap[K, V] extends collection.SortedMap[K, V] with Map[K, V] with SortedMapOps[K, V, SortedMap, SortedMap[K, V]]

    Base type for mutable sorted map collections

34.  trait SortedMapOps[K, V, +CC[X, Y] <: Map[X, Y] with SortedMapOps[X, Y, CC, _], +C <: SortedMapOps[K, V, CC, C]] extends collection.SortedMapOps[K, V, CC, C] with MapOps[K, V, Map, C]
35.  trait SortedSet[A] extends Set[A] with collection.SortedSet[A] with SortedSetOps[A, SortedSet, SortedSet[A]]

    Base type for mutable sorted set collections

36.  trait SortedSetOps[A, +CC[X] <: SortedSet[X], +C <: SortedSetOps[A, CC, C]] extends SetOps[A, Set, C] with collection.SortedSetOps[A, CC, C]

37.  class StringBuilder extends Builder[Char, String]
38.  sealed class TreeMap[K, V] extends SortedMap[K, V] with SortedMapOps[K, V, TreeMap, TreeMap[K, V]] with StrictOptimizedIterableOps[(K, V), Iterable, TreeMap[K, V]] with Serializable

    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.

    K

    the type of the keys contained in this tree map.

    V

    the type of the values associated with the keys.

    Annotations

    @SerialVersionUID()

    Version

    2.12

    Since

    2.12

39.  sealed class TreeSet[A] extends SortedSet[A] with SortedSetOps[A, TreeSet, TreeSet[A]] with StrictOptimizedIterableOps[A, Set, TreeSet[A]] with StrictOptimizedSortedSetOps[A, TreeSet, TreeSet[A]] with Serializable

    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.

    A

    the type of the keys contained in this tree set.

    Annotations

    @SerialVersionUID()

    Version

    2.12

    Since

    2.10