The System.Collections.Generic namespace contains interfaces and classes that define generic collections, which allow users to create strongly typed collections that provide better type safety and performance than non-generic strongly typed collections.
Remarks
Classes
| Type | Reason |
|---|---|
| Comparer<T> |
Provides a base class for implementations of the IComparer`1 generic interface. |
| Dictionary<TKey,TValue> | Represents a collection of key/value pairs that are organized based on the key. |
| Dictionary<TKey,TValue>+Enumerator |
Represents a collection of keys and values. |
| Dictionary<TKey,TValue>+KeyCollection | Documentation for this section has not yet been entered. |
| Dictionary<TKey,TValue>+KeyCollection+Enumerator | Documentation for this section has not yet been entered. |
| Dictionary<TKey,TValue>+ValueCollection | Documentation for this section has not yet been entered. |
| Dictionary<TKey,TValue>+ValueCollection+Enumerator | Documentation for this section has not yet been entered. |
| EqualityComparer<T> |
Provides a base class for implementations of the IEqualityComparer`1 generic interface. |
| HashSet<T> | Documentation for this section has not yet been entered. |
| HashSet<T>+Enumerator |
Represents a set of values. |
| ICollection<T> |
Defines methods to manipulate generic collections. |
| IComparer<T> |
Defines a method that a type implements to compare two objects. |
| IDictionary<TKey,TValue> |
Represents a generic collection of key/value pairs. |
| IEnumerable<T> |
Exposes the enumerator, which supports a simple iteration over a collection of a specified type. |
| IEnumerator<T> |
Supports a simple iteration over a generic collection. |
| IEqualityComparer<T> |
Defines methods to support the comparison of objects for equality. |
| IList<T> |
Represents a collection of objects that can be individually accessed by index. |
| IReadOnlyCollection<T> |
Represents a strongly-typed, read-only collection of elements. |
| IReadOnlyDictionary<TKey,TValue> |
Represents a generic read-only collection of key/value pairs. |
| IReadOnlyList<T> |
Represents a read-only collection of elements that can be accessed by index. |
| ISet<T> |
Provides the base interface for the abstraction of sets. |
| KeyNotFoundException |
The exception that is thrown when the key specified for accessing an element in a collection does not match any key in the collection. |
| KeyValuePair<TKey,TValue> |
Defines a key/value pair that can be set or retrieved. |
| LinkedList<T> | Documentation for this section has not yet been entered. |
| LinkedList<T>+Enumerator |
Represents a doubly linked list. |
| LinkedListNode<T> |
Represents a node in a LinkedList`1. This class cannot be inherited. |
| List<T> | Implements the IList<T> interface. The size of a List is dynamically increased as required. A List is not guaranteed to be sorted. It is the programmer's responsibility to sort the List prior to performing operations (such as BinarySearch) that require a List to be sorted. Indexing operations are required to perform in constant access time; that is, O(1). |
| List<T>+Enumerator |
Represents a strongly typed list of objects that can be accessed by index. Provides methods to search, sort, and manipulate lists. |
| Queue<T> | Documentation for this section has not yet been entered. |
| Queue<T>+Enumerator |
Represents a first-in, first-out collection of objects. |
| SortedDictionary<TKey,TValue> | Documentation for this section has not yet been entered. |
| SortedDictionary<TKey,TValue>+Enumerator |
Represents a collection of key/value pairs that are sorted on the key. |
| SortedDictionary<TKey,TValue>+KeyCollection | Documentation for this section has not yet been entered. |
| SortedDictionary<TKey,TValue>+KeyCollection+Enumerator | Documentation for this section has not yet been entered. |
| SortedDictionary<TKey,TValue>+ValueCollection | Documentation for this section has not yet been entered. |
| SortedDictionary<TKey,TValue>+ValueCollection+Enumerator | Documentation for this section has not yet been entered. |
| SortedList<TKey,TValue> |
Represents a collection of key/value pairs that are sorted by key based on the associated IComparer`1 implementation. |
| SortedSet<T> | Documentation for this section has not yet been entered. |
| SortedSet<T>+Enumerator |
Represents a collection of objects that is maintained in sorted order. |
| Stack<T> | Documentation for this section has not yet been entered. |
| Stack<T>+Enumerator |
Represents a variable size last-in-first-out (LIFO) collection of instances of the same arbitrary type. |