A standard phase template
Classes extending this trait are cloneable across platforms (Java, .NET). │ │ │ │
An interface containing operations for equality.
│ │ │ │ The only method not already present in class AnyRef is canEqual.
│ │ │ │
A marker trait for all immutable datastructures such as immutable │ │ │ │ collections. │ │ │ │
2.8
A marker trait for mutable data structures such as mutable collections │ │ │ │
2.8
1.0, 16/07/2003
Note: forwarding methods in this way will most likely create │ │ │ │ an asymmetric equals method, which is not generally recommended. │ │ │ │
1.0, 26/04/2004
Classes extending this trait are serializable across platforms (Java, .NET). │ │ │ │
Explicit instantiation of the Iterable trait to reduce class file size in subclasses.
Explicit instantiation of the Map trait to reduce class file size in subclasses.
Explicit instantiation of the Seq trait to reduce class file size in subclasses.
Explicit instantiation of the Set trait to reduce class file size in subclasses.
Explicit instantiation of the Traversable trait to reduce class file size in subclasses.
This trait provides most of the operations of a BitSet independently of its representation.
│ │ │ │ It is inherited by all concrete implementations of bitsets.
│ │ │ │
the type of the bitset itself.
A trait for all iterable collections which may possibly │ │ │ │ have their operations implemented in parallel. │ │ │ │
2.9
A template trait for all iterable collections which may possibly │ │ │ │ have their operations implemented in parallel.
This trait contains abstract methods and methods that can be implemented │ │ │ │ directly in terms of other methods.
A trait for all traversable collections which may possibly │ │ │ │ have their operations implemented in parallel. │ │ │ │
2.9
A trait for all maps upon which operations may be │ │ │ │ implemented in parallel.
A trait for all sequences which may possibly │ │ │ │ have their operations implemented in parallel. │ │ │ │
2.9
A template trait for all sequences which may be traversed │ │ │ │ in parallel.
A trait for sets which may possibly │ │ │ │ have their operations implemented in parallel. │ │ │ │
2.9
A template trait for sets which may possibly │ │ │ │ have their operations implemented in parallel.
A trait for all traversable collections which may possibly │ │ │ │ have their operations implemented in parallel. │ │ │ │
2.9
A template trait for all traversable collections upon which operations │ │ │ │ may be implemented in parallel.
A template trait for all traversable-once objects which may be │ │ │ │ traversed in parallel.
Methods in this trait are either abstract or can be implemented in terms │ │ │ │ of other methods.
apply for indexing and length. Indexed sequences do not add any new methods to Seq, but promise
│ │ │ │ efficient implementations of random access patterns.
This trait just implements iterator in terms of apply and length.
│ │ │ │ However, see IndexedSeqOptimized for an implementation trait that overrides operations
│ │ │ │ to make them run faster under the assumption of fast random access with apply.
apply for indexing and length. Indexed sequences do not add any new methods to Seq, but promise
│ │ │ │ efficient implementations of random access patterns.
Note: This trait replaces every method that uses break in
│ │ │ │ TraversableLike by an iterator version.
Note: This trait replaces every method that uses break in
│ │ │ │ TraversableLike by an iterator version.
(Since version 2.11.0) Proxying is deprecated due to lack of use and compiler-level support.
2.8
2.8
force method is called on a view.
│ │ │ │ All views for iterable collections are defined by re-interpreting the iterator method.force method is called on a view.
│ │ │ │ All views for iterable collections are defined by re-interpreting the iterator method.2.8
1
Coll that extends this trait should also extend
│ │ │ │ LinearSeqOptimized[A, Coll[A]].LinearSeqOptimized for an implementation trait that overrides many more operations
│ │ │ │ to make them run faster under the assumption of fast linear access with head and tail. Linear sequences do not add any new methods to Seq, but promise efficient implementations
│ │ │ │ of linear access patterns.
the element type of the sequence
the type of the actual sequence containing the elements.
2.8
2.8
An abstract shell used by { mutable, immutable }.Map but not by collection.Map │ │ │ │ because of variance issues. │ │ │ │
DefaultMap instead. Note: If your additions and mutations return the same kind of map as the map
│ │ │ │ you are defining, you should inherit from MapLike as well.
│ │ │ │
the type of the keys in this map.
the type of the values associated with keys.
1.0
The implementation class of the set returned by keySet.
│ │ │ │
If you wish that methods like take, drop, filter also return the same kind of map
│ │ │ │ you should also override:
def empty: This It is also good idea to override methods foreach and
│ │ │ │ size for efficiency.
2.8
(Since version 2.11.0) Proxying is deprecated due to lack of use and compiler-level support.
2.8
2.8
A marker trait for collections which have their operations parallelised. │ │ │ │
2.9
par. Parallelizable collections may be parametrized with
│ │ │ │ a target type different than their own.
│ │ │ │ the type of the elements in the collection
the actual type of the collection, which has to be parallel
IndexedSeq provides fast random-access of elements and a fast length operation.
│ │ │ │ A LinearSeq provides fast access only to the first element via head, but also
│ │ │ │ has a fast tail operation.IndexedSeq provides fast random-access of elements and a fast length operation.
│ │ │ │ A LinearSeq provides fast access only to the first element via head, but also
│ │ │ │ has a fast tail operation.force method is called on a view.
│ │ │ │ All views for sequences are defined by re-interpreting the length and
│ │ │ │ apply methods.force method is called on a view.
│ │ │ │ All views for sequences are defined by re-interpreting the length and
│ │ │ │ apply methods.filter return the same kind of set, you should also override:def empty: This It is also good idea to override methods foreach and
│ │ │ │ size for efficiency.
Implementation note: If your additions and mutations return the same kind of set as the set
│ │ │ │ you are defining, you should inherit from SetLike as well.
1.0
Set independently of its representation.
│ │ │ │ It is typically inherited by concrete implementations of sets.
│ │ │ │ 2.8
(Since version 2.11.0) Proxying is deprecated due to lack of use and compiler-level support.
2.8
A sorted set. │ │ │ │
2.8
2.4
A template for sets which are sorted. │ │ │ │
2.8
2.8
LinkedHashMap
│ │ │ │ is ordered because its foreach method visits elements in the
│ │ │ │ order they were inserted into the HashMap.LinkedHashMap
│ │ │ │ is ordered because its foreach method visits elements in the
│ │ │ │ order they were inserted into the HashMap.Iterator with one of the methods on the Iterator object.
│ │ │ │ Consider declaring a subclass of Traversable instead if the elements
│ │ │ │ can be traversed repeatedly.2.8
2.8
(Since version 2.11.0) Proxying is deprecated due to lack of use and compiler-level support.
2.8
2.8
force method is called on a view. All views for traversable collections are defined by creating a new foreach method.
CanBuildFrom
│ │ │ │ that takes a View as its From type parameter must yield the same view (or a generic
│ │ │ │ superclass of it) as its result parameter. If that assumption is broken, cast errors might result.2.8
This trait forms part of collections that can be cleared │ │ │ │ with a clear() call. │ │ │ │
2.10
2.10
An implementation of the signalling interface using delegates. │ │ │ │
A template trait that contains just the map, flatMap, foreach and withFilter methods
│ │ │ │ of trait TraversableLike.
│ │ │ │
A template for companion objects of Map and subclasses thereof.
A template for companion objects of Seq and subclasses thereof. │ │ │ │
2.8
A template for companion objects of Set and subclasses thereof.
TraversableTraversable.
│ │ │ │ 2.8
A template class for companion objects of "regular" collection classes
│ │ │ │ represent an unconstrained higher-kinded type. Typically
│ │ │ │ such classes inherit from trait GenericTraversableTemplate.
The type constructor representing the collection class.
2.8
A template class for companion objects of parallel collection classes.
│ │ │ │ They should be mixed in together with GenericCompanion type.
A template trait for collections having a companion. │ │ │ │
the element type of the collection
the type constructor representing the collection class
2.8
2.8
A template class for companion objects of regular
The type of the collection elements.
The type constructor representing the collection class.
2.8
+= operator and that can be cleared of all elements using
│ │ │ │ a clear method.
│ │ │ │ 2.8
2.8
2.8
A template for companion objects of IndexedSeq and subclasses thereof. │ │ │ │
2.11
A template for companion objects of Map and subclasses thereof.
A template class for companion objects of ParIterable and subclasses
│ │ │ │ thereof. This class extends TraversableFactory and provides a set of
│ │ │ │ operations to create ParIterable
A template class for companion objects of ParMap and subclasses thereof.
│ │ │ │ This class extends TraversableFactory and provides a set of operations
│ │ │ │ to create ParMap
2.8
A template for companion objects of Seq and subclasses thereof. │ │ │ │
2.8
This trait forms part of collections that can be reduced
│ │ │ │ using a -= operator.
│ │ │ │
2.8
2.8
Any collection (including maps) whose keys (or elements) are ordered. │ │ │ │
2.8
A template for companion objects of Set and subclasses thereof. │ │ │ │
2.8
This trait represents collection-like objects that can be reduced
│ │ │ │ using a '+' operator. It defines variants of - and --
│ │ │ │ as convenience methods in terms of single-element removal -.
the type of the elements of the collection.
the type of the collection itself
2.8
2.8
Traversable objects.
│ │ │ │ It is typically inherited by companion objects of subclasses of Traversable.
│ │ │ │ 2.8
Note: This trait replaces every method that uses break in
│ │ │ │ TraversableLike by an iterator version.
IndexedSeq provides fast random-access of elements and a fast length operation.
│ │ │ │ A LinearSeq provides fast access only to the first element via head, but also
│ │ │ │ has a fast tail operation.LinkedHashMap
│ │ │ │ is ordered because its foreach method visits elements in the
│ │ │ │ order they were inserted into the HashMap.deep method for arrays and wrapped arrays and serves as a marker trait
│ │ │ │ for array wrappers.
│ │ │ │ type of the elements contained in the array like object.
the type of the actual collection containing the elements.
+= and then converting to the required
│ │ │ │ collection type with result.
│ │ │ │ the type of elements that get added to the builder.
the type of collection that it produced.
2.8
A trait for cloneable collections. │ │ │ │
Type of the elements contained in the collection, covariant and with reference types as upperbound.
2.8
This trait just implements iterator in terms of apply and length.
│ │ │ │ However, see IndexedSeqOptimized for an implementation trait that overrides operations
│ │ │ │ to make them run faster under the assumption of fast random access with apply.
the element type of the mutable indexed sequence
the type of the actual mutable indexed sequence containing the elements.
A subtrait of scala.collection.IndexedSeq which represents sequences │ │ │ │ that can be mutated. │ │ │ │
2.8
Note: This trait replaces every method that uses break in
│ │ │ │ TraversableLike by an iterator version.
LinkedHashMap
│ │ │ │ is ordered because its foreach method visits elements in the
│ │ │ │ order they were inserted into the HashMap.Parallel iterators allow splitting and provide a remaining method to
│ │ │ │ obtain the number of elements remaining in the iterator.
│ │ │ │
type of the elements iterated.
Standard accessor task that iterates over the elements of the collection. │ │ │ │
type of the result of this method (R for result).
the representation type of the task at hand.
the element type of the set
2.9
the element type of the set
A splitter (or a split iterator) can be split into more splitters that traverse over │ │ │ │ disjoint subsets of elements. │ │ │ │
type of the elements this splitter traverses
2.9
equiv method of the Equiv trait. The relation must be:equiv(x, x) == true for any x of type T.equiv(x, y) == equiv(y, x) for any x and y of type T.equiv(x, y) == true and equiv(y, z) == true, then
│ │ │ │ equiv(x, z) == true for any x, y, and z of type T.
│ │ │ │ 1.0, 2008-04-03
2.7
2.8
2.8
0.9.5, 2008-04-15
2.7
equiv method, inherited from the
│ │ │ │ Equiv trait.
│ │ │ │ 1.0, 2008-04-0-3
2.7
annotation.tree.children.tail. For more information about Annotations, see the Reflection Guide: Annotations, Names, Scopes, and More
│ │ │ │
Expr is typically
│ │ │ │ scala.reflect.runtime#universe, the default mirror is typically scala.reflect.runtime#currentMirror.
│ │ │ │ For more details about FlagSets and other aspects of Scala reflection, see the
│ │ │ │ Reflection Guide
│ │ │ │
EXPERIMENTAL
This trait assembles APIs occasionally necessary for performing low-level operations on reflection artifacts. │ │ │ │ See Internals#InternalApi for more information about nature, usefulness and compatibility guarantees of these APIs. │ │ │ │
For more information about Mirrorss, see the
│ │ │ │ Reflection Guide: Mirrors
│ │ │ │
To search for the map method (which is a term) declared in the List class, one can do:
scala> typeOf[List[_]].member(TermName("map")) │ │ │ │ res0: reflect.runtime.universe.Symbol = method map
To search for a type member, one can follow the same procedure, using TypeName instead.
For more information about creating and using Names, see the Reflection Guide: Annotations, Names, Scopes, and More
│ │ │ │
EXPERIMENTAL
This trait defines the concept of positions and operations on them. │ │ │ │
For more details about Printers and other aspects of Scala reflection, see the
│ │ │ │ Reflection Guide
│ │ │ │
members and decls defined in scala.reflect.api.Types#TypeApi.
│ │ │ │ Such scopes support the sorted method, which sorts members in declaration order.
│ │ │ │ import definitions._, and are
│ │ │ │ listed in scala.reflect.api.StandardDefinitions#DefinitionsApi.
│ │ │ │ CONSTRUCTOR (aka <init> on JVM) is necessary to create and invoke constructors. These standard names can be referred to using nme for term names and tpnme for type names
│ │ │ │
Names │ │ │ │ The API for names in Scala reflection.
symbol field of tree nodes. For more information about Symbol usage and attached intricacies, see the Reflection Guide: Symbols
│ │ │ │
For more information about TypeTags, see the
│ │ │ │ Reflection Guide: TypeTags
│ │ │ │
scala.reflect.ClassTag, scala.reflect.api.TypeTags#TypeTag, scala.reflect.api.TypeTags#WeakTypeTag