| Type | Reason |
|---|---|
| Comparer<T> | Documentation for this section has not yet been entered. |
| Dictionary<TKey,TValue> | Represents a collection of key/value pairs that are organized based on the key. |
| Dictionary<TKey,TValue>.KeyCollection | Documentation for this section has not yet been entered. |
| Dictionary<TKey,TValue>.ValueCollection | Documentation for this section has not yet been entered. |
| EqualityComparer<T> | Documentation for this section has not yet been entered. |
| HashSet<T> | Documentation for this section has not yet been entered. |
| 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. |
| LinkedList<T> | Documentation for this section has not yet been entered. |
| LinkedListNode<T> | Documentation for this section has not yet been entered. |
| 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). |
| Queue<T> | Documentation for this section has not yet been entered. |
| SortedDictionary<TKey,TValue> | Documentation for this section has not yet been entered. |
| SortedDictionary<TKey,TValue>.KeyCollection | Documentation for this section has not yet been entered. |
| SortedDictionary<TKey,TValue>.ValueCollection | Documentation for this section has not yet been entered. |
| SortedList<TKey,TValue> | Documentation for this section has not yet been entered. |
| Stack<T> | Documentation for this section has not yet been entered. |
| Type | Reason |
|---|---|
| ICollection<T> | Defines size and copying methods for all generic collections. |
| IComparer<T> | Provides a mechanism to customize comparison in sort ordering of a generic collection. |
| IDictionary<TKey,TValue> | Represents a generic collection of key/value pairs. |
| IEnumerable<T> | Implemented by generic classes that support a simple iteration over instances of the collection. |
| IEnumerator<T> | Implemented by generic classes that support a simple iteration over a collection. |
| IEqualityComparer<T> | Provides a mechanism to customize equality in sort ordering of a generic collection. |
| IList<T> | Represents a collection of objects that can be individually accessed by index. |
| Type | Reason |
|---|---|
| Dictionary<TKey,TValue>.Enumerator | 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.Enumerator | Documentation for this section has not yet been entered. |
| HashSet<T>.Enumerator | Documentation for this section has not yet been entered. |
| KeyCollection<TKey,TValue>.Enumerator | Documentation for this section has not yet been entered. |
| KeyValuePair<TKey,TValue> | Defines a key/value pair that can be set or retrieved. |
| LinkedList<T>.Enumerator | Documentation for this section has not yet been entered. |
| List<T>.Enumerator | Documentation for this section has not yet been entered. |
| Queue<T>.Enumerator | Documentation for this section has not yet been entered. |
| SortedDictionary<TKey,TValue>.Enumerator | Documentation for this section has not yet been entered. |
| Stack<T>.Enumerator | Documentation for this section has not yet been entered. |
| ValueCollection<TKey,TValue>.Enumerator | Documentation for this section has not yet been entered. |