Collections and Data Structures
Similar data can often be handled more efficiently when stored and manipulated as a collection. You can use the System.Array class or the classes in the System.Collections, System.Collections.Generic, System.Collections.Concurrent, System.Collections.Immutable namespaces to add, remove, and modify either individual elements or a range of elements in a collection.
There are two main types of collections; generic collections and non-generic collections. Generic collections were added in the .NET Framework 2.0 and provide collections that are type-safe at compile time. Because of this, generic collections typically offer better performance. Generic collections accept a type parameter when they are constructed and do not require that you cast to and from the Object type when you add or remove items from the collection. In addition, most generic collections are supported in Windows Store apps. Non-generic collections store items as Object, require casting, and most are not supported for Windows Store app development. However, you may see non-generic collections in older code.
Starting with the .NET Framework 4, the collections in the System.Collections.Concurrent namespace provide efficient thread-safe operations for accessing collection items from multiple threads. The immutable collection classes in the System.Collections.Immutable namespace (NuGet package) are inherently thread-safe because operations are performed on a copy of the original collection and the original collection cannot be modified.
Common collection features
All collections provide methods for adding, removing or finding items in the collection. In addition, all collections that directly or indirectly implement the ICollection interface or the ICollection<T> interface share these features:
The ability to enumerate the collection
.NET Framework collections either implement System.Collections.IEnumerable or System.Collections.Generic.IEnumerable<T> to enable the collection to be iterated through. An enumerator can be thought of as a movable pointer to any element in the collection. The foreach, in statement and the For Each...Next Statement use the enumerator exposed by the GetEnumerator method and hide the complexity of manipulating the enumerator. In addition, any collection that implements System.Collections.Generic.IEnumerable<T> is considered a queryable type and can be queried with LINQ. LINQ queries provide a common pattern for accessing data. They are typically more concise and readable than standard
foreachloops, and provide filtering, ordering and grouping capabilities. LINQ queries can also improve performance. For more information, see LINQ to Objects, Parallel LINQ (PLINQ) and Introduction to LINQ Queries (C#).
The ability to copy the collection contents to an array
All collections can be copied to an array using the CopyTo method; however, the order of the elements in the new array is based on the sequence in which the enumerator returns them. The resulting array is always one-dimensional with a lower bound of zero.
In addition, many collection classes contain the following features:
Capacity and Count properties
The capacity of a collection is the number of elements it can contain. The count of a collection is the number of elements it actually contains. Some collections hide the capacity or the count or both.
Most collections automatically expand in capacity when the current capacity is reached. The memory is reallocated, and the elements are copied from the old collection to the new one. This reduces the code required to use the collection; however, the performance of the collection might be negatively affected. For example, for List<T>, If Count is less than Capacity, adding an item is an O(1) operation. If the capacity needs to be increased to accommodate the new element, adding an item becomes an O(n) operation, where n is Count. The best way to avoid poor performance caused by multiple reallocations is to set the initial capacity to be the estimated size of the collection.
A BitArray is a special case; its capacity is the same as its length, which is the same as its count.
A consistent lower bound
The lower bound of a collection is the index of its first element. All indexed collections in the System.Collections namespaces have a lower bound of zero, meaning they are 0-indexed. Array has a lower bound of zero by default, but a different lower bound can be defined when creating an instance of the Array class using Array.CreateInstance.
Synchronization for access from multiple threads (System.Collections classes only).
Non-generic collection types in the System.Collections namespace provide some thread safety with synchronization; typically exposed through the SyncRoot and IsSynchronized members. These collections are not thread-safe by default. If you require scalable and efficient multi-threaded access to a collection, use one of the classes in the System.Collections.Concurrent namespace or consider using an immutable collection. For more information, see Thread-Safe Collections.
Choosing a collection
In general, you should use generic collections. The following table describes some common collection scenarios and the collection classes you can use for those scenarios. If you are new to generic collections, this table will help you choose the generic collection that works the best for your task.
|I want to…||Generic collection option(s)||Non-generic collection option(s)||Thread-safe or immutable collection option(s)|
|Store items as key/value pairs for quick look-up by key||System.Collections.Generic.Dictionary<TKey,TValue>||Hashtable
(A collection of key/value pairs that are organize based on the hash code of the key.)
|Access items by index||System.Collections.Generic.List<T>||System.Array
|Use items first-in-first-out (FIFO)||System.Collections.Generic.Queue<T>||System.Collections.Queue||System.Collections.Concurrent.ConcurrentQueue<T>
|Use data Last-In-First-Out (LIFO)||System.Collections.Generic.Stack<T>||System.Collections.Stack||System.Collections.Concurrent.ConcurrentStack<T>
|Access items sequentially||System.Collections.Generic.LinkedList<T>||No recommendation||No recommendation|
|Receive notifications when items are removed or added to the collection. (implements INotifyPropertyChanged and System.Collections.Specialized.INotifyCollectionChanged)||System.Collections.ObjectModel.ObservableCollection<T>||No recommendation||No recommendation|
|A sorted collection||System.Collections.Generic.SortedList<TKey,TValue>||System.Collections.SortedList||
|A set for mathematical functions||System.Collections.Generic.HashSet<T>
|Selecting a Collection Class||Describes the different collections and helps you select one for your scenario.|
|Commonly Used Collection Types||Describes commonly used generic and nongeneric collection types such as System.Array, System.Collections.Generic.List<T>, and System.Collections.Generic.Dictionary<TKey,TValue>.|
|When to Use Generic Collections||Discusses the use of generic collection types.|
|Comparisons and Sorts Within Collections||Discusses the use of equality comparisons and sorting comparisons in collections.|
|Sorted Collection Types||Describes sorted collections performance and characteristics|
|Hashtable and Dictionary Collection Types||Describes the features of generic and non-generic hash-based dictionary types.|
|Thread-Safe Collections||Describes collection types such as System.Collections.Concurrent.BlockingCollection<T> and System.Collections.Concurrent.ConcurrentBag<T> that support safe and efficient concurrent access from multiple threads.|
|System.Collections.Immutable||Introduces the immutable collections and provides links to the collection types.|