Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Showing content from https://docs.microsoft.com/en-us/dotnet/api/system.collections.generic below:

System.Collections.Generic Namespace | Microsoft Learn

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.

Provides extension methods for generic collections.

Provides a base class for implementations of the IComparer<T> generic interface.

Represents the collection of keys in a Dictionary<TKey,TValue>. This class cannot be inherited.

Represents the collection of values in a Dictionary<TKey,TValue>. This class cannot be inherited.

Represents a collection of keys and values.

Provides a base class for implementations of the IEqualityComparer<T> generic interface.

Represents a set of values.

Provides a collection whose items are types that serve as keys.

The exception that is thrown when the key specified for accessing an element in a collection does not match any key in the collection.

Creates instances of the KeyValuePair<TKey,TValue> struct.

Represents a doubly linked list.

Represents a node in a LinkedList<T>. This class cannot be inherited.

Represents a strongly typed list of objects that can be accessed by index. Provides methods to search, sort, and manipulate lists.

Represents the collection of keys in a OrderedDictionary<TKey,TValue>.

Represents the collection of values in a OrderedDictionary<TKey,TValue>.

Represents a collection of key/value pairs that are accessible by the key or index.

Enumerates the contents of a PriorityQueue<TElement,TPriority>, without any ordering guarantees.

Represents a collection of items that have a value and a priority. On dequeue, the item with the lowest priority value is removed.

Represents a first-in, first-out collection of objects.

An IEqualityComparer<T> that uses reference equality (ReferenceEquals(Object, Object)) instead of value equality (Equals(Object)) when comparing two object instances.

Represents the collection of keys in a SortedDictionary<TKey,TValue>. This class cannot be inherited.

Represents the collection of values in a SortedDictionary<TKey,TValue>. This class cannot be inherited.

Represents a collection of key/value pairs that are sorted on the key.

Represents a collection of key/value pairs that are sorted by key based on the associated IComparer<T> implementation.

Represents a collection of objects that is maintained in sorted order.

Represents a variable size last-in-first-out (LIFO) collection of instances of the same specified type.

Provides a thread-safe collection that contains objects of a type specified by the generic parameter as elements.

Provides a thread-safe collection that contains objects of a type specified by a generic parameter and that are grouped by keys.

Provides a thread-safe, read-only collection that contains objects of a type specified by the generic parameter as elements.

Many of the generic collection types are direct analogs of nongeneric types. Dictionary<TKey,TValue> is a generic version of Hashtable; it uses the generic structure KeyValuePair<TKey,TValue> for enumeration instead of DictionaryEntry. List<T> is a generic version of ArrayList. There are generic Queue<T> and Stack<T> classes that correspond to the nongeneric versions. There are generic and nongeneric versions of SortedList<TKey,TValue>. Both versions are hybrids of a dictionary and a list. The SortedDictionary<TKey,TValue> generic class is a pure dictionary and has no nongeneric counterpart. The LinkedList<T> generic class is a true linked list and has no nongeneric counterpart.

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.3