System.Collections

Manages a compact array of bit values, which are represented as Booleans, where indicates that the bit is on (1) and indicates the bit is off (0).

Initializes a new instance of the class that contains bit values copied from the specified array of Booleans.

An array of Booleans to copy. is .

Initializes a new instance of the class that contains bit values copied from the specified array of bytes.

An array of bytes containing the values to copy, where each byte represents eight consecutive bits. is . The length of is greater than Int32.MaxValue.

Initializes a new instance of the class that contains bit values copied from the specified .

The to copy. is .

Initializes a new instance of the class that can hold the specified number of bit values, which are initially set to the specified value.

The number of bit values in the new . The Boolean value to assign to each bit. is less than zero.

Initializes a new instance of the class that can hold the specified number of bit values, which are initially set to .

The number of bit values in the new . is less than zero.

Initializes a new instance of the class that contains bit values copied from the specified array of 32-bit integers.

An array of integers containing the values to copy, where each integer represents 32 consecutive bits. is . The length of is greater than Int32.MaxValue

Performs the bitwise AND operation between the elements of the current object and the corresponding elements in the specified array. The current object will be modified to store the result of the bitwise AND operation.

The array with which to perform the bitwise AND operation. is . and the current do not have the same number of elements. An array containing the result of the bitwise AND operation, which is a reference to the current object.

Creates a shallow copy of the .

A shallow copy of the .

Copies the entire to a compatible one-dimensional , starting at the specified index of the target array.

The one-dimensional that is the destination of the elements copied from . The must have zero-based indexing. The zero-based index in at which copying begins. is . is less than zero. is multidimensional. -or- The number of elements in the source is greater than the available space from to the end of the destination . The type of the source cannot be cast automatically to the type of the destination .

Gets the value of the bit at a specific position in the .

The zero-based index of the value to get. is less than zero. -or- is greater than or equal to the number of elements in the . The value of the bit at position .

Returns an enumerator that iterates through the .

An for the entire .

Determines whether all bits in the are set to .

if every bit in the is set to , or if is empty; otherwise, .

Determines whether any bit in the is set to .

if is not empty and at least one of its bit is set to ; otherwise, .

Shifts all the bit values of the current to the left on bits.

The number of shifts to make for each bit. is less than zero. The current .

Inverts all the bit values in the current , so that elements set to are changed to , and elements set to are changed to .

The current instance with inverted bit values.

Performs the bitwise OR operation between the elements of the current object and the corresponding elements in the specified array. The current object will be modified to store the result of the bitwise OR operation.

The array with which to perform the bitwise OR operation. is . and the current do not have the same number of elements. An array containing the result of the bitwise OR operation, which is a reference to the current object.

Shifts all the bit values of the current to the right on bits.

The number of shifts to make for each bit. is less than zero. The current .

Sets the bit at a specific position in the to the specified value.

The zero-based index of the bit to set. The Boolean value to assign to the bit. is less than zero. -or- is greater than or equal to the number of elements in the .

Sets all bits in the to the specified value.

The Boolean value to assign to all bits.

Performs the bitwise exclusive OR operation between the elements of the current object against the corresponding elements in the specified array. The current object will be modified to store the result of the bitwise exclusive OR operation.

The array with which to perform the bitwise exclusive OR operation. is . and the current do not have the same number of elements. An array containing the result of the bitwise exclusive OR operation, which is a reference to the current object.

Gets the number of elements contained in the .

The number of elements contained in the .

Gets a value indicating whether the is read-only.

This property is always .

Gets a value indicating whether access to the is synchronized (thread safe).

This property is always .

Gets or sets the value of the bit at a specific position in the .

The zero-based index of the value to get or set. is less than zero. -or- is equal to or greater than . The value of the bit at position .

Gets or sets the number of elements in the .

The property is set to a value that is less than zero. The number of elements in the .

Gets an object that can be used to synchronize access to the .

An object that can be used to synchronize access to the .

Provides extension methods for generic collections.

Adds the elements of the specified span to the end of the .

The list to which the elements should be added. The span whose elements should be added to the end of the . The type of elements in the list. The is .

Returns a read-only wrapper for the specified list.

The list to wrap. The type of elements in the collection. is . An object that acts as a read-only wrapper around the current .

Returns a read-only wrapper for the specified set.

The set to wrap. The type of elements in the set. is . An object that acts as a read-only wrapper around the current .

Returns a read-only wrapper for the current dictionary.

The dictionary to wrap. The type of keys in the dictionary. The type of values in the dictionary. is . An object that acts as a read-only wrapper around the current .

Copies the entire to a span.

The list from which the elements are copied. The span that is the destination of the elements copied from . The type of elements in the list. The is . The number of elements in the source is greater than the number of elements that the destination span can contain.

Tries to get the value associated with the specified in the .

A dictionary with keys of type and values of type . The key of the value to get. The default value to return when the cannot find a value associated with the specified . The type of the keys in the dictionary. The type of the values in the dictionary. is . A instance. When the method is successful, the returned object is the value associated with the specified . When the method fails, it returns .

Tries to get the value associated with the specified in the .

A dictionary with keys of type and values of type . The key of the value to get. The type of the keys in the dictionary. The type of the values in the dictionary. is . A instance. When the method is successful, the returned object is the value associated with the specified . When the method fails, it returns the value for .

Inserts the elements of a span into the at the specified index.

The list into which the elements should be inserted. The zero-based index at which the new elements should be inserted. The span whose elements should be added to the . The type of elements in the list. The is . is less than 0 or greater than 's .

Tries to remove the value with the specified from the .

A dictionary with keys of type and values of type . The key of the value to remove. When this method returns , the removed value; when this method returns , the value for . The type of the keys in the . The type of the values in the . is . when a value is found in the with the specified ; when the cannot find a value associated with the specified .

Tries to add the specified and to the .

A dictionary with keys of type and values of type . The key of the value to add. The value to add. The type of the keys in the dictionary. The type of the values in the dictionary. is . when the and are successfully added to the ; when the already contains the specified , in which case nothing gets added.

Provides a base class for implementations of the generic interface.

The type of objects to compare.

Initializes a new instance of the class.

When overridden in a derived class, performs a comparison of two objects of the same type and returns a value indicating whether one object is less than, equal to, or greater than the other.

The first object to compare. The second object to compare. Type T does not implement either the generic interface or the interface. A signed integer that indicates the relative values of and , as shown in the following table. Value Meaning Less than zero is less than . Zero equals . Greater than zero is greater than .

Creates a comparer by using the specified comparison.

The comparison to use. The new comparer.

Compares two objects and returns a value indicating whether one is less than, equal to, or greater than the other.

The first object to compare. The second object to compare. or is of a type that cannot be cast to type T. -or- and do not implement either the generic interface or the interface. A signed integer that indicates the relative values of and , as shown in the following table. Value Meaning Less than zero is less than . Zero equals . Greater than zero is greater than .

Returns a default sort-order comparer for the type specified by the generic argument.

An object that inherits and serves as a sort-order comparer for type T.

Represents a collection of keys and values.

The type of the keys in the dictionary. The type of the values in the dictionary.

Initializes a new instance of the class that is empty, has the default initial capacity, and uses the default equality comparer for the key type.

Initializes a new instance of the class that contains elements copied from the specified and uses the specified .

The whose elements are copied to the new . The implementation to use when comparing keys, or to use the default for the type of the key. is . contains one or more duplicate keys.

Initializes a new instance of the class that contains elements copied from the specified and uses the default equality comparer for the key type.

The whose elements are copied to the new . is . contains one or more duplicate keys.

Initializes a new instance of the class that contains elements copied from the specified and uses the specified .

The whose elements are copied to the new . The implementation to use when comparing keys, or to use the default for the type of the key. is . contains one or more duplicated keys.

Initializes a new instance of the class that contains elements copied from the specified .

The whose elements are copied to the new . is . contains one or more duplicated keys.

Initializes a new instance of the class that is empty, has the default initial capacity, and uses the specified .

The implementation to use when comparing keys, or to use the default for the type of the key.

Initializes a new instance of the class that is empty, has the specified initial capacity, and uses the specified .

The initial number of elements that the can contain. The implementation to use when comparing keys, or to use the default for the type of the key. is less than 0.

Initializes a new instance of the class that is empty, has the specified initial capacity, and uses the default equality comparer for the key type.

The initial number of elements that the can contain. is less than 0.

Initializes a new instance of the class with serialized data.

A object containing the information required to serialize the . A structure containing the source and destination of the serialized stream associated with the .

Adds the specified key and value to the dictionary.

The key of the element to add. The value of the element to add. The value can be for reference types. is . An element with the same key already exists in the .

Removes all keys and values from the .

Determines whether the contains the specified key.

The key to locate in the . is . if the contains an element with the specified key; otherwise, .

Determines whether the contains a specific value.

The value to locate in the . The value can be for reference types. if the contains an element with the specified value; otherwise, .

Ensures that the dictionary can hold up to a specified number of entries without any further expansion of its backing storage.

The number of entries. is less than 0. The current capacity of the .

Gets an instance of a type that can be used to perform operations on the current using a as a key instead of a .

The alternate type of a key for performing lookups. The dictionary's comparer is not compatible with . The created lookup instance.

Returns an enumerator that iterates through the .

A structure for the .

Implements the interface and returns the data needed to serialize the instance.

A object that contains the information required to serialize the instance. A structure that contains the source and destination of the serialized stream associated with the instance. is .

Implements the interface and raises the deserialization event when the deserialization is complete.

The source of the deserialization event. The object associated with the current instance is invalid.

Removes the value with the specified key from the , and copies the element to the parameter.

The key of the element to remove. The removed element. is . if the element is successfully found and removed; otherwise, .

Removes the value with the specified key from the .

The key of the element to remove. is . if the element is successfully found and removed; otherwise, . This method returns if is not found in the .

Adds the specified value to the with the specified key.

The structure representing the key and value to add to the . The key of is . An element with the same key already exists in the .

Determines whether the contains a specific key and value.

The structure to locate in the . if is found in the ; otherwise, .

Copies the elements of the to an array of type , starting at the specified array index.

The one-dimensional array of type that is the destination of the elements copied from the . The array must have zero-based indexing. The zero-based index in at which copying begins. is . is less than 0. The number of elements in the source is greater than the available space from to the end of the destination .

Removes a key and value from the dictionary.

The structure representing the key and value to remove from the . if the key and value represented by is successfully found and removed; otherwise, . This method returns if is not found in the .

Returns an enumerator that iterates through the collection.

An enumerator that can be used to iterate through the collection.

Copies the elements of the to an array, starting at the specified array index.

The one-dimensional array that is the destination of the elements copied from . The array must have zero-based indexing. The zero-based index in at which copying begins. is . is less than 0. is multidimensional. -or- does not have zero-based indexing. -or- The number of elements in the source is greater than the available space from to the end of the destination . -or- The type of the source cannot be cast automatically to the type of the destination .

Adds the specified key and value to the dictionary.

The object to use as the key. The object to use as the value. is . is of a type that is not assignable to the key type of the . -or- is of a type that is not assignable to , the type of values in the . -or- A value with the same key already exists in the .

Determines whether the contains an element with the specified key.

The key to locate in the . is . if the contains an element with the specified key; otherwise, .

Returns an for the .

An for the .

Removes the element with the specified key from the .

The key of the element to remove. is .

Returns an enumerator that iterates through the collection.

An that can be used to iterate through the collection.

Sets the capacity of this dictionary to what it would be if it had been originally initialized with all its entries.

Sets the capacity of this dictionary to hold up a specified number of entries without any further expansion of its backing storage.

The new capacity. is less than .

Attempts to add the specified key and value to the dictionary.

The key of the element to add. The value of the element to add. It can be . is . if the key/value pair was added to the dictionary successfully; otherwise, .

Gets an instance of a type that can be used to perform operations on the current using a as a key instead of a .

The created lookup instance when the method returns true, or a default instance that should not be used if the method returns false. The alternate type of a key for performing lookups. if a lookup could be created; otherwise, .

Gets the value associated with the specified key.

The key of the value to get. When this method returns, contains the value associated with the specified key, if the key is found; otherwise, the default value for the type of the parameter. This parameter is passed uninitialized. is . if the contains an element with the specified key; otherwise, .

Gets the total numbers of elements the internal data structure can hold without resizing.

Gets the that is used to determine equality of keys for the dictionary.

The generic interface implementation that is used to determine equality of keys for the current and to provide hash values for the keys.

Gets the number of key/value pairs contained in the .

The number of key/value pairs contained in the .

Gets or sets the value associated with the specified key.

The key of the value to get or set. is . The property is retrieved and does not exist in the collection. The value associated with the specified key. If the specified key is not found, a get operation throws a , and a set operation creates a new element with the specified key.

Gets a collection containing the keys in the .

A containing the keys in the .

Gets a value that indicates whether the dictionary is read-only.

if the is read-only; otherwise, . In the default implementation of , this property always returns .

Gets an containing the keys of the .

An of type containing the keys of the .

Gets an containing the values in the .

An of type containing the values in the .

Gets a collection containing the keys of the .

A collection containing the keys of the .

Gets a collection containing the values of the .

A collection containing the values of the .

Gets a value that indicates whether access to the is synchronized (thread safe).

if access to the is synchronized (thread safe); otherwise, . In the default implementation of , this property always returns .

Gets an object that can be used to synchronize access to the .

An object that can be used to synchronize access to the .

Gets a value that indicates whether the has a fixed size.

if the has a fixed size; otherwise, . In the default implementation of , this property always returns .

Gets a value that indicates whether the is read-only.

if the is read-only; otherwise, . In the default implementation of , this property always returns .

Gets or sets the value with the specified key.

The key of the value to get. is . A value is being assigned, and is of a type that is not assignable to the key type of the . -or- A value is being assigned and is of a type that isn't assignable to the value type of the . The value associated with the specified key, or if is not in the dictionary or is of a type that is not assignable to the key type of the .

Gets an containing the keys of the .

An containing the keys of the .

Gets an containing the values in the .

An containing the values in the .

Gets a collection containing the values in the .

A containing the values in the .

Provides a type that can be used to perform operations on a using a as a key instead of a .

The type of the keys in the dictionary. The type of the values in the dictionary. The alternate type of a key for performing lookups.

Determines whether the contains the specified alternate key.

The alternate key to check. is . if the key is in the dictionary; otherwise, .

Removes the value with the specified alternate key from the , and copies the element to the value parameter.

The alternate key of the element to remove. When this method returns, contains the removed key. When this method returns, contains the removed element. is . if the element is successfully found and removed; otherwise, .

Removes the value with the specified alternate key from the .

The alternate key of the element to remove. is . if the element is successfully found and removed; otherwise, .

Attempts to add the specified key and value to the dictionary.

The alternate key of the element to add. The value of the element to add. is . if the key/value pair was added to the dictionary successfully; otherwise, .

Gets the value associated with the specified alternate key.

The alternate key of the value to get. When this method returns, contains the actual key associated with the alternate key, if the key is found; otherwise, the default value for the type of the key parameter. When this method returns, contains the value associated with the specified key, if the key is found; otherwise, the default value for the type of the value parameter. is . if an entry was found; otherwise, .

Gets the value associated with the specified alternate key.

The alternate key of the value to get. When this method returns, contains the value associated with the specified key, if the key is found; otherwise, the default value for the type of the value parameter. is . if an entry was found; otherwise, .

Gets the against which this instance performs operations.

Gets or sets the value associated with the specified alternate key.

The alternate key of the value to get or set. is . The property is retrieved and alternate key does not exist in the collection. The value associated with the specified alternate key. If the specified alternate key is not found, a get operation throws a , and a set operation creates a new element with the specified key.

Enumerates the elements of a .

Releases all resources used by the .

Advances the enumerator to the next element of the .

The collection was modified after the enumerator was created. if the enumerator was successfully advanced to the next element; if the enumerator has passed the end of the collection.

Sets the enumerator to its initial position, which is before the first element in the collection.

The collection was modified after the enumerator was created.

Gets the element at the current position of the enumerator.

The element in the at the current position of the enumerator.

Gets the element at the current position of the enumerator.

The enumerator is positioned before the first element of the collection or after the last element. The element in the dictionary at the current position of the enumerator, as a .

Gets the key of the element at the current position of the enumerator.

The enumerator is positioned before the first element of the collection or after the last element. The key of the element in the dictionary at the current position of the enumerator.

Gets the value of the element at the current position of the enumerator.

The enumerator is positioned before the first element of the collection or after the last element. The value of the element in the dictionary at the current position of the enumerator.

Gets the element at the current position of the enumerator.

The enumerator is positioned before the first element of the collection or after the last element. The element in the collection at the current position of the enumerator, as an .

Represents the collection of keys in a . This class cannot be inherited.

Initializes a new instance of the class that reflects the keys in the specified .

The whose keys are reflected in the new . is .

Determines whether the contains a specific value.

The object to locate in the . if is found in the ; otherwise, .

Copies the elements to an existing one-dimensional , starting at the specified array index.

The one-dimensional that is the destination of the elements copied from . The must have zero-based indexing. The zero-based index in at which copying begins. is . is less than zero. The number of elements in the source is greater than the available space from to the end of the destination .

Returns an enumerator that iterates through the .

A for the .

Adds an item to the . This implementation always throws .

The object to add to the . Always thrown.

Removes all items from the . This implementation always throws .

Always thrown.

Removes the first occurrence of a specific object from the . This implementation always throws .

The object to remove from the . Always thrown. if was successfully removed from the ; otherwise, . This method also returns if item was not found in the original .

Returns an enumerator that iterates through a collection.

An that can be used to iterate through the collection.

Copies the elements of the to an , starting at a particular index.

The one-dimensional that is the destination of the elements copied from . The must have zero-based indexing. The zero-based index in at which copying begins. is . is less than zero. is multidimensional. -or- does not have zero-based indexing. -or- The number of elements in the source is greater than the available space from to the end of the destination . -or- The type of the source cannot be cast automatically to the type of the destination .

Returns an enumerator that iterates through a collection.

An that can be used to iterate through the collection.

Gets the number of elements contained in the .

The number of elements contained in the . Retrieving the value of this property is an O(1) operation.

Gets a value indicating whether the is read-only.

if the is read-only; otherwise, . In the default implementation of , this property always returns .

Gets a value indicating whether access to the is synchronized (thread safe).

if access to the is synchronized (thread safe); otherwise, . In the default implementation of , this property always returns .

Gets an object that can be used to synchronize access to the .

An object that can be used to synchronize access to the . In the default implementation of , this property always returns the current instance.

Enumerates the elements of a .

Releases all resources used by the .

Advances the enumerator to the next element of the .

The collection was modified after the enumerator was created. if the enumerator was successfully advanced to the next element; if the enumerator has passed the end of the collection.

Sets the enumerator to its initial position, which is before the first element in the collection.

The collection was modified after the enumerator was created.

Gets the element at the current position of the enumerator.

The element in the at the current position of the enumerator.

Gets the element at the current position of the enumerator.

The enumerator is positioned before the first element of the collection or after the last element. The element in the collection at the current position of the enumerator.

Represents the collection of values in a . This class cannot be inherited.

Initializes a new instance of the class that reflects the values in the specified .

The whose values are reflected in the new . is .

Copies the elements to an existing one-dimensional , starting at the specified array index.

The one-dimensional that is the destination of the elements copied from . The must have zero-based indexing. The zero-based index in at which copying begins. is . is less than zero. The number of elements in the source is greater than the available space from to the end of the destination .

Returns an enumerator that iterates through the .

A for the .

Adds an item to the . This implementation always throws .

The object to add to the . Always thrown.

Removes all items from the . This implementation always throws .

Always thrown.

Determines whether the contains a specific value.

The object to locate in the . if is found in the ; otherwise, .

Removes the first occurrence of a specific object from the . This implementation always throws .

The object to remove from the . Always thrown. if was successfully removed from the ; otherwise, . This method also returns if was not found in the original .

Returns an enumerator that iterates through a collection.

An that can be used to iterate through the collection.

Copies the elements of the to an , starting at a particular index.

The one-dimensional that is the destination of the elements copied from . The must have zero-based indexing. The zero-based index in at which copying begins. is . is less than zero. is multidimensional. -or- does not have zero-based indexing. -or- The number of elements in the source is greater than the available space from to the end of the destination . -or- The type of the source cannot be cast automatically to the type of the destination .

Returns an enumerator that iterates through a collection.

An that can be used to iterate through the collection.

Gets the number of elements contained in the .

The number of elements contained in the .

Gets a value indicating whether the is read-only.

if the is read-only; otherwise, . In the default implementation of , this property always returns .

Gets a value indicating whether access to the is synchronized (thread safe).

if access to the is synchronized (thread safe); otherwise, . In the default implementation of , this property always returns .

Gets an object that can be used to synchronize access to the .

An object that can be used to synchronize access to the . In the default implementation of , this property always returns the current instance.

Enumerates the elements of a .

Releases all resources used by the .

Advances the enumerator to the next element of the .

The collection was modified after the enumerator was created. if the enumerator was successfully advanced to the next element; if the enumerator has passed the end of the collection.

Sets the enumerator to its initial position, which is before the first element in the collection.

The collection was modified after the enumerator was created.

Gets the element at the current position of the enumerator.

The element in the at the current position of the enumerator.

Gets the element at the current position of the enumerator.

The enumerator is positioned before the first element of the collection or after the last element. The element in the collection at the current position of the enumerator.

Provides a base class for implementations of the generic interface.

The type of objects to compare.

Initializes a new instance of the class.

Creates an by using the specified delegates as the implementation of the comparer's and methods.

The delegate to use to implement the method. The delegate to use to implement the method. If no delegate is supplied, calls to the resulting comparer's will throw . The delegate was . The new comparer.

When overridden in a derived class, determines whether two objects of type are equal.

The first object to compare. The second object to compare. if the specified objects are equal; otherwise, .

When overridden in a derived class, serves as a hash function for the specified object for hashing algorithms and data structures, such as a hash table.

The object for which to get a hash code. The type of is a reference type and is . A hash code for the specified object.

Determines whether the specified objects are equal.

The first object to compare. The second object to compare. or is of a type that cannot be cast to type . if the specified objects are equal; otherwise, .

Returns a hash code for the specified object.

The for which a hash code is to be returned. The type of is a reference type and is . -or- is of a type that cannot be cast to type . A hash code for the specified object.

Returns a default equality comparer for the type specified by the generic argument.

The default instance of the class for type .

Represents a set of values.

The type of elements in the hash set.

Initializes a new instance of the class that is empty and uses the default equality comparer for the set type.

Initializes a new instance of the class that uses the specified equality comparer for the set type, contains elements copied from the specified collection, and has sufficient capacity to accommodate the number of elements copied.

The collection whose elements are copied to the new set. The implementation to use when comparing values in the set, or to use the default implementation for the set type. is .

Initializes a new instance of the class that uses the default equality comparer for the set type, contains elements copied from the specified collection, and has sufficient capacity to accommodate the number of elements copied.

The collection whose elements are copied to the new set. is .

Initializes a new instance of the class that is empty and uses the specified equality comparer for the set type.

The implementation to use when comparing values in the set, or to use the default implementation for the set type.

Initializes a new instance of the class that uses the specified equality comparer for the set type, and has sufficient capacity to accommodate elements.

The initial size of the . The implementation to use when comparing values in the set, or null (Nothing in Visual Basic) to use the default implementation for the set type.

Initializes a new instance of the class that is empty, but has reserved space for items and uses the default equality comparer for the set type.

The initial size of the .

Initializes a new instance of the class with serialized data.

A object that contains the information required to serialize the object. A structure that contains the source and destination of the serialized stream associated with the object.

Adds the specified element to a set.

The element to add to the set. if the element is added to the object; if the element is already present.

Removes all elements from a object.

Determines whether a object contains the specified element.

The element to locate in the object. if the object contains the specified element; otherwise, .

Copies the specified number of elements of a object to an array, starting at the specified array index.

The one-dimensional array that is the destination of the elements copied from the object. The array must have zero-based indexing. The zero-based index in at which copying begins. The number of elements to copy to . is . is less than 0. -or- is less than 0. is greater than the length of the destination . -or- is greater than the available space from to the end of the destination .

Copies the elements of a object to an array, starting at the specified array index.

The one-dimensional array that is the destination of the elements copied from the object. The array must have zero-based indexing. The zero-based index in at which copying begins. is . is less than 0. is greater than the length of the destination .

Copies the elements of a object to an array.

The one-dimensional array that is the destination of the elements copied from the object. The array must have zero-based indexing. is .

Returns an object that can be used for equality testing of a object.

An object that can be used for deep equality testing of the object.

Ensures that this hash set can hold the specified number of elements without any further expansion of its backing storage.

The minimum capacity to ensure. is less than zero. The new capacity of this instance.

Removes all elements in the specified collection from the current object.

The collection of items to remove from the object. is .

Gets an instance of a type that can be used to perform operations on the current using a instead of a .

The alternate type of instance for performing lookups. The set's comparer is not compatible with . The created lookup instance.

Returns an enumerator that iterates through a object.

A object for the object.

Implements the interface and returns the data needed to serialize a object.

A object that contains the information required to serialize the object. A structure that contains the source and destination of the serialized stream associated with the object. is .

Modifies the current object to contain only elements that are present in that object and in the specified collection.

The collection to compare to the current object. is .

Determines whether a object is a proper subset of the specified collection.

The collection to compare to the current object. is . if the object is a proper subset of ; otherwise, .

Determines whether a object is a proper superset of the specified collection.

The collection to compare to the current object. is . if the object is a proper superset of ; otherwise, .

Determines whether a object is a subset of the specified collection.

The collection to compare to the current object. is . if the object is a subset of ; otherwise, .

Determines whether a object is a superset of the specified collection.

The collection to compare to the current object. is . if the object is a superset of ; otherwise, .

Implements the interface and raises the deserialization event when the deserialization is complete.

The source of the deserialization event. The object associated with the current object is invalid.

Determines whether the current object and a specified collection share common elements.

The collection to compare to the current object. is . if the object and share at least one common element; otherwise, .

Removes the specified element from a object.

The element to remove. if the element is successfully found and removed; otherwise, . This method returns if is not found in the object.

Removes all elements that match the conditions defined by the specified predicate from a collection.

The delegate that defines the conditions of the elements to remove. is . The number of elements that were removed from the collection.

Determines whether a object and the specified collection contain the same elements.

The collection to compare to the current object. is . if the object is equal to ; otherwise, .

Modifies the current object to contain only elements that are present either in that object or in the specified collection, but not both.

The collection to compare to the current object. is .

Adds an item to an object.

The object to add to the object. The is read-only.

Returns an enumerator that iterates through a collection.

An object that can be used to iterate through the collection.

Returns an enumerator that iterates through a collection.

An object that can be used to iterate through the collection.

Sets the capacity of a object to the actual number of elements it contains, rounded up to a nearby, implementation-specific value.

Sets the capacity of a object to the specified number of entries, rounded up to a nearby, implementation-specific value.

The new capacity. The specified capacity is lower than the count of entries.

Gets an instance of a type that can be used to perform operations on the current using a instead of a .

The created lookup instance when the method returns true, or a default instance that should not be used if the method returns false. The alternate type of instance for performing lookups. if a lookup could be created; otherwise, .

Searches the set for a given value and returns the equal value it finds, if any.

The value to search for. The value from the set that the search found, or the default value of T when the search yielded no match. A value indicating whether the search was successful.

Modifies the current object to contain all elements that are present in itself, the specified collection, or both.

The collection to compare to the current object. is .

Gets the total numbers of elements the internal data structure can hold without resizing.

Gets the object that is used to determine equality for the values in the set.

The object that is used to determine equality for the values in the set.

Gets the number of elements that are contained in a set.

The number of elements that are contained in the set.

Gets a value indicating whether a collection is read-only.

if the collection is read-only; otherwise, .

Provides a type that can be used to perform operations on a using a instead of a .

The type of elements in the hash set. The alternate type of instance for performing lookups.

Adds the specified element to a set.

The element to add to the set. if the element is added to the set; if the element is already present.

Determines whether a set contains the specified element.

The element to locate in the set. if the set contains the specified element; otherwise, .

Removes the specified element from a set.

The element to remove. if the element is successfully found and removed; otherwise, .

Searches the set for a given value and returns the equal value it finds, if any.

The value to search for. When this method returns, contains the value from the set that the search found, or the default value of if the search yielded no match. if the search was successful; otherwise, .

Gets the against which this instance performs operations.

Enumerates the elements of a object.

Releases all resources used by a object.

Advances the enumerator to the next element of the collection.

The collection was modified after the enumerator was created. if the enumerator was successfully advanced to the next element; if the enumerator has passed the end of the collection.

Sets the enumerator to its initial position, which is before the first element in the collection.

The collection was modified after the enumerator was created.

Gets the element at the current position of the enumerator.

The element in the collection at the current position of the enumerator.

Gets the element at the current position of the enumerator.

The enumerator is positioned before the first element of the collection or after the last element. The element in the collection at the current position of the enumerator, as an .

Represents a doubly linked list.

Specifies the element type of the linked list.

Initializes a new instance of the class that is empty.

Initializes a new instance of the class that contains elements copied from the specified and has sufficient capacity to accommodate the number of elements copied.

The whose elements are copied to the new . is .

Initializes a new instance of the class that is serializable with the specified and .

A object containing the information required to serialize the . A object containing the source and destination of the serialized stream associated with the .

Adds a new node containing the specified value after the specified existing node in the .

The after which to insert a new containing . The value to add to the . is . is not in the current . The new containing .

Adds the specified new node after the specified existing node in the .

The after which to insert . The new to add to the . is . -or- is . is not in the current . -or- belongs to another .

Adds a new node containing the specified value before the specified existing node in the .

The before which to insert a new containing . The value to add to the . is . is not in the current . The new containing .

Adds the specified new node before the specified existing node in the .

The before which to insert . The new to add to the . is . -or- is . is not in the current . -or- belongs to another .

Adds a new node containing the specified value at the start of the .

The value to add at the start of the . The new containing .

Adds the specified new node at the start of the .

The new to add at the start of the . is . belongs to another .

Adds a new node containing the specified value at the end of the .

The value to add at the end of the . The new containing .

Adds the specified new node at the end of the .

The new to add at the end of the . is . belongs to another .

Removes all nodes from the .

Determines whether a value is in the .

The value to locate in the . The value can be for reference types. if is found in the ; otherwise, .

Copies the entire to a compatible one-dimensional , starting at the specified index of the target array.

The one-dimensional that is the destination of the elements copied from . The must have zero-based indexing. The zero-based index in at which copying begins. is . is less than zero. The number of elements in the source is greater than the available space from to the end of the destination .

Finds the first node that contains the specified value.

The value to locate in the . The first that contains the specified value, if found; otherwise, .

Finds the last node that contains the specified value.

The value to locate in the . The last that contains the specified value, if found; otherwise, .

Returns an enumerator that iterates through the .

An for the .

Implements the interface and returns the data needed to serialize the instance.

A object that contains the information required to serialize the instance. A object that contains the source and destination of the serialized stream associated with the instance. is .

Implements the interface and raises the deserialization event when the deserialization is complete.

The source of the deserialization event. The object associated with the current instance is invalid.

Removes the first occurrence of the specified value from the .

The value to remove from the . if the element containing is successfully removed; otherwise, . This method also returns if was not found in the original .

Removes the specified node from the .

The to remove from the . is . is not in the current .

Removes the node at the start of the .

The is empty.

Removes the node at the end of the .

The is empty.

Adds an item at the end of the .

The value to add at the end of the .

Returns an enumerator that iterates through a collection.

An that can be used to iterate through the collection.

Copies the elements of the to an , starting at a particular index.

The one-dimensional that is the destination of the elements copied from . The must have zero-based indexing. The zero-based index in at which copying begins. is . is less than zero. is multidimensional. -or- does not have zero-based indexing. -or- The number of elements in the source is greater than the available space from to the end of the destination . -or- The type of the source cannot be cast automatically to the type of the destination .

Returns an enumerator that iterates through the linked list as a collection.

An that can be used to iterate through the linked list as a collection.

Gets the number of nodes actually contained in the .

The number of nodes actually contained in the .

Gets the first node of the .

The first of the .

Gets the last node of the .

The last of the .

Gets a value indicating whether the is read-only.

if the is read-only; otherwise, . In the default implementation of , this property always returns .

Gets a value indicating whether access to the is synchronized (thread safe).

if access to the is synchronized (thread safe); otherwise, . In the default implementation of , this property always returns .

Gets an object that can be used to synchronize access to the .

An object that can be used to synchronize access to the . In the default implementation of , this property always returns the current instance.

Enumerates the elements of a .

Releases all resources used by the .

Advances the enumerator to the next element of the .

The collection was modified after the enumerator was created. if the enumerator was successfully advanced to the next element; if the enumerator has passed the end of the collection.

Sets the enumerator to its initial position, which is before the first element in the collection. This class cannot be inherited.

The collection was modified after the enumerator was created.

Implements the interface and raises the deserialization event when the deserialization is complete.

The source of the deserialization event. The object associated with the current instance is invalid.

Implements the interface and returns the data needed to serialize the instance.

A object that contains the information required to serialize the instance. A object that contains the source and destination of the serialized stream associated with the instance. is .

Gets the element at the current position of the enumerator.

The element in the at the current position of the enumerator.

Gets the element at the current position of the enumerator.

The enumerator is positioned before the first element of the collection or after the last element. The element in the collection at the current position of the enumerator.

Represents a node in a . This class cannot be inherited.

Specifies the element type of the linked list.

Initializes a new instance of the class, containing the specified value.

The value to contain in the .

Gets the that the belongs to.

A reference to the that the belongs to, or if the is not linked.

Gets the next node in the .

A reference to the next node in the , or if the current node is the last element () of the .

Gets the previous node in the .

A reference to the previous node in the , or if the current node is the first element () of the .

Gets the value contained in the node.

The value contained in the node.

Gets a reference to the value held by the node.

A reference to the value held by the node.

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

The type of elements in the list.

Initializes a new instance of the class that is empty and has the default initial capacity.

Initializes a new instance of the class that contains elements copied from the specified collection and has sufficient capacity to accommodate the number of elements copied.

The collection whose elements are copied to the new list. is .

Initializes a new instance of the class that is empty and has the specified initial capacity.

The number of elements that the new list can initially store. is less than 0.

Adds an object to the end of the .

The object to be added to the end of the . The value can be for reference types.

Adds the elements of the specified collection to the end of the .

The collection whose elements should be added to the end of the . The collection itself cannot be , but it can contain elements that are , if type is a reference type. is .

Returns a read-only wrapper for the current collection.

An object that acts as a read-only wrapper around the current .

Searches the entire sorted for an element using the specified comparer and returns the zero-based index of the element.

The object to locate. The value can be for reference types. The implementation to use when comparing elements. -or- to use the default comparer . is , and the default comparer cannot find an implementation of the generic interface or the interface for type . The zero-based index of in the sorted , if is found; otherwise, a negative number that is the bitwise complement of the index of the next element that is larger than or, if there is no larger element, the bitwise complement of .

Searches the entire sorted for an element using the default comparer and returns the zero-based index of the element.

The object to locate. The value can be for reference types. The default comparer cannot find an implementation of the generic interface or the interface for type . The zero-based index of in the sorted , if is found; otherwise, a negative number that is the bitwise complement of the index of the next element that is larger than or, if there is no larger element, the bitwise complement of .

Searches a range of elements in the sorted for an element using the specified comparer and returns the zero-based index of the element.

The zero-based starting index of the range to search. The length of the range to search. The object to locate. The value can be for reference types. The implementation to use when comparing elements, or to use the default comparer . is less than 0. -or- is less than 0. and do not denote a valid range in the . is , and the default comparer cannot find an implementation of the generic interface or the interface for type . The zero-based index of in the sorted , if is found; otherwise, a negative number that is the bitwise complement of the index of the next element that is larger than or, if there is no larger element, the bitwise complement of .

Removes all elements from the .

Determines whether an element is in the .

The object to locate in the . The value can be for reference types. if is found in the ; otherwise, .

Converts the elements in the current to another type, and returns a list containing the converted elements.

A delegate that converts each element from one type to another type. The type of the elements of the target array. is . A of the target type containing the converted elements from the current .

Copies the entire to a compatible one-dimensional array, starting at the specified index of the target array.

The one-dimensional that is the destination of the elements copied from . The must have zero-based indexing. The zero-based index in at which copying begins. is . is less than 0. The number of elements in the source is greater than the available space from to the end of the destination .

Copies the entire to a compatible one-dimensional array, starting at the beginning of the target array.

The one-dimensional that is the destination of the elements copied from . The must have zero-based indexing. is . The number of elements in the source is greater than the number of elements that the destination can contain.

Copies a range of elements from the to a compatible one-dimensional array, starting at the specified index of the target array.

The zero-based index in the source at which copying begins. The one-dimensional that is the destination of the elements copied from . The must have zero-based indexing. The zero-based index in at which copying begins. The number of elements to copy. is . is less than 0. -or- is less than 0. -or- is less than 0. is equal to or greater than the of the source . -or- The number of elements from to the end of the source is greater than the available space from to the end of the destination .

Ensures that the capacity of this list is at least the specified . If the current capacity is less than , it is increased to at least the specified .

The minimum capacity to ensure. The new capacity of this list.

Determines whether the contains elements that match the conditions defined by the specified predicate.

The delegate that defines the conditions of the elements to search for. is . if the contains one or more elements that match the conditions defined by the specified predicate; otherwise, .

Searches for an element that matches the conditions defined by the specified predicate, and returns the first occurrence within the entire .

The delegate that defines the conditions of the element to search for. is . The first element that matches the conditions defined by the specified predicate, if found; otherwise, the default value for type .

Retrieves all the elements that match the conditions defined by the specified predicate.

The delegate that defines the conditions of the elements to search for. is . A containing all the elements that match the conditions defined by the specified predicate, if found; otherwise, an empty .

Searches for an element that matches the conditions defined by the specified predicate, and returns the zero-based index of the first occurrence within the range of elements in the that starts at the specified index and contains the specified number of elements.

The zero-based starting index of the search. The number of elements in the section to search. The delegate that defines the conditions of the element to search for. is . is outside the range of valid indexes for the . -or- is less than 0. -or- and do not specify a valid section in the . The zero-based index of the first occurrence of an element that matches the conditions defined by , if found; otherwise, -1.

Searches for an element that matches the conditions defined by the specified predicate, and returns the zero-based index of the first occurrence within the range of elements in the that extends from the specified index to the last element.

The zero-based starting index of the search. The delegate that defines the conditions of the element to search for. is . is outside the range of valid indexes for the . The zero-based index of the first occurrence of an element that matches the conditions defined by , if found; otherwise, -1.

Searches for an element that matches the conditions defined by the specified predicate, and returns the zero-based index of the first occurrence within the entire .

The delegate that defines the conditions of the element to search for. is . The zero-based index of the first occurrence of an element that matches the conditions defined by , if found; otherwise, -1.

Searches for an element that matches the conditions defined by the specified predicate, and returns the last occurrence within the entire .

The delegate that defines the conditions of the element to search for. is . The last element that matches the conditions defined by the specified predicate, if found; otherwise, the default value for type .

Searches for an element that matches the conditions defined by the specified predicate, and returns the zero-based index of the last occurrence within the range of elements in the that contains the specified number of elements and ends at the specified index.

The zero-based starting index of the backward search. The number of elements in the section to search. The delegate that defines the conditions of the element to search for. is . is outside the range of valid indexes for the . -or- is less than 0. -or- and do not specify a valid section in the . The zero-based index of the last occurrence of an element that matches the conditions defined by , if found; otherwise, -1.

Searches for an element that matches the conditions defined by the specified predicate, and returns the zero-based index of the last occurrence within the range of elements in the that extends from the first element to the specified index.

The zero-based starting index of the backward search. The delegate that defines the conditions of the element to search for. is . is outside the range of valid indexes for the . The zero-based index of the last occurrence of an element that matches the conditions defined by , if found; otherwise, -1.

Searches for an element that matches the conditions defined by the specified predicate, and returns the zero-based index of the last occurrence within the entire .

The delegate that defines the conditions of the element to search for. is . The zero-based index of the last occurrence of an element that matches the conditions defined by , if found; otherwise, -1.

Performs the specified action on each element of the .

The delegate to perform on each element of the . is . An element in the collection has been modified.

Returns an enumerator that iterates through the .

A for the .

Creates a shallow copy of a range of elements in the source .

The zero-based index at which the range starts. The number of elements in the range. is less than 0. -or- is less than 0. and do not denote a valid range of elements in the . A shallow copy of a range of elements in the source .

Searches for the specified object and returns the zero-based index of the first occurrence within the range of elements in the that starts at the specified index and contains the specified number of elements.

The object to locate in the . The value can be for reference types. The zero-based starting index of the search. 0 (zero) is valid in an empty list. The number of elements in the section to search. is outside the range of valid indexes for the . -or- is less than 0. -or- and do not specify a valid section in the . The zero-based index of the first occurrence of within the range of elements in the that starts at and contains number of elements, if found; otherwise, -1.

Searches for the specified object and returns the zero-based index of the first occurrence within the range of elements in the that extends from the specified index to the last element.

The object to locate in the . The value can be for reference types. The zero-based starting index of the search. 0 (zero) is valid in an empty list. is outside the range of valid indexes for the . The zero-based index of the first occurrence of within the range of elements in the that extends from to the last element, if found; otherwise, -1.

Searches for the specified object and returns the zero-based index of the first occurrence within the entire .

The object to locate in the . The value can be for reference types. The zero-based index of the first occurrence of within the entire , if found; otherwise, -1.

Inserts an element into the at the specified index.

The zero-based index at which should be inserted. The object to insert. The value can be for reference types. is less than 0. -or- is greater than .

Inserts the elements of a collection into the at the specified index.

The zero-based index at which the new elements should be inserted. The collection whose elements should be inserted into the . The collection itself cannot be , but it can contain elements that are , if type is a reference type. is . is less than 0. -or- is greater than .

Searches for the specified object and returns the zero-based index of the last occurrence within the range of elements in the that contains the specified number of elements and ends at the specified index.

The object to locate in the . The value can be for reference types. The zero-based starting index of the backward search. The number of elements in the section to search. is outside the range of valid indexes for the . -or- is less than 0. -or- and do not specify a valid section in the . The zero-based index of the last occurrence of within the range of elements in the that contains number of elements and ends at , if found; otherwise, -1.

Searches for the specified object and returns the zero-based index of the last occurrence within the range of elements in the that extends from the first element to the specified index.

The object to locate in the . The value can be for reference types. The zero-based starting index of the backward search. is outside the range of valid indexes for the . The zero-based index of the last occurrence of within the range of elements in the that extends from the first element to , if found; otherwise, -1.

Searches for the specified object and returns the zero-based index of the last occurrence within the entire .

The object to locate in the . The value can be for reference types. The zero-based index of the last occurrence of within the entire the , if found; otherwise, -1.

Removes the first occurrence of a specific object from the .

The object to remove from the . The value can be for reference types. if is successfully removed; otherwise, . This method also returns if was not found in the .

Removes all the elements that match the conditions defined by the specified predicate.

The delegate that defines the conditions of the elements to remove. is . The number of elements removed from the .

Removes the element at the specified index of the .

The zero-based index of the element to remove. is less than 0. -or- is equal to or greater than .

Removes a range of elements from the .

The zero-based starting index of the range of elements to remove. The number of elements to remove. is less than 0. -or- is less than 0. and do not denote a valid range of elements in the .

Reverses the order of the elements in the entire .

Reverses the order of the elements in the specified range.

The zero-based starting index of the range to reverse. The number of elements in the range to reverse. is less than 0. -or- is less than 0. and do not denote a valid range of elements in the .

Creates a shallow copy of a range of elements in the source .

The zero-based index at which the range starts. The length of the range. is less than 0. -or- is less than 0. and do not denote a valid range of elements in the . A shallow copy of a range of elements in the source .

Sorts the elements in the entire using the default comparer.

The default comparer cannot find an implementation of the generic interface or the interface for type .

Sorts the elements in the entire using the specified comparer.

The implementation to use when comparing elements, or to use the default comparer . is , and the default comparer cannot find implementation of the generic interface or the interface for type . The implementation of caused an error during the sort. For example, might not return 0 when comparing an item with itself.

Sorts the elements in the entire using the specified .

The to use when comparing elements. is . The implementation of caused an error during the sort. For example, might not return 0 when comparing an item with itself.

Sorts the elements in a range of elements in using the specified comparer.

The zero-based starting index of the range to sort. The length of the range to sort. The implementation to use when comparing elements, or to use the default comparer . is less than 0. -or- is less than 0. and do not specify a valid range in the . -or- The implementation of caused an error during the sort. For example, might not return 0 when comparing an item with itself. is , and the default comparer cannot find implementation of the generic interface or the interface for type .

Returns an enumerator that iterates through a collection.

An that can be used to iterate through the collection.

Copies the elements of the to an , starting at a particular index.

The one-dimensional that is the destination of the elements copied from . The must have zero-based indexing. The zero-based index in at which copying begins. is . is less than 0. is multidimensional. -or- does not have zero-based indexing. -or- The number of elements in the source is greater than the available space from to the end of the destination . -or- The type of the source cannot be cast automatically to the type of the destination .

Returns an enumerator that iterates through a collection.

An that can be used to iterate through the collection.

Adds an item to the .

The to add to the . is of a type that is not assignable to the . The position into which the new element was inserted.

Determines whether the contains a specific value.

The to locate in the . if is found in the ; otherwise, .

Determines the index of a specific item in the .

The object to locate in the . is of a type that is not assignable to the . The index of if found in the list; otherwise, -1.

Inserts an item to the at the specified index.

The zero-based index at which should be inserted. The object to insert into the . is not a valid index in the . is of a type that is not assignable to the .

Removes the first occurrence of a specific object from the .

The object to remove from the . is of a type that is not assignable to the .

Copies the elements of the to a new array.

An array containing copies of the elements of the .

Sets the capacity to the actual number of elements in the , if that number is less than a threshold value.

Determines whether every element in the matches the conditions defined by the specified predicate.

The delegate that defines the conditions to check against the elements. is . if every element in the matches the conditions defined by the specified predicate; otherwise, . If the list has no elements, the return value is .

Gets or sets the total number of elements the internal data structure can hold without resizing.

is set to a value that is less than . There is not enough memory available on the system. The number of elements that the can contain before resizing is required.

Gets the number of elements contained in the .

The number of elements contained in the .

Gets or sets the element at the specified index.

The zero-based index of the element to get or set. is less than 0. -or- is equal to or greater than . The element at the specified index.

Gets a value indicating whether the is read-only.

if the is read-only; otherwise, . In the default implementation of , this property always returns .

Gets a value indicating whether access to the is synchronized (thread safe).

if access to the is synchronized (thread safe); otherwise, . In the default implementation of , this property always returns .

Gets an object that can be used to synchronize access to the .

An object that can be used to synchronize access to the . In the default implementation of , this property always returns the current instance.

Gets a value indicating whether the has a fixed size.

if the has a fixed size; otherwise, . In the default implementation of , this property always returns .

Gets a value indicating whether the is read-only.

if the is read-only; otherwise, . In the default implementation of , this property always returns .

Gets or sets the element at the specified index.

The zero-based index of the element to get or set. is not a valid index in the . The property is set and the value is of a type that isn't assignable to the . The element at the specified index.

Enumerates the elements of a .

Releases all resources used by the .

Advances the enumerator to the next element of the .

The collection was modified after the enumerator was created. if the enumerator was successfully advanced to the next element; if the enumerator has passed the end of the collection.

Sets the enumerator to its initial position, which is before the first element in the collection.

The collection was modified after the enumerator was created.

Gets the element at the current position of the enumerator.

The element in the at the current position of the enumerator.

Gets the element at the current position of the enumerator.

The enumerator is positioned before the first element of the collection or after the last element. The element in the at the current position of the enumerator.

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

The type of the keys in the dictionary. The type of the values in the dictionary.

Initializes a new instance of the class that is empty, has the default initial capacity, and uses the default equality comparer for the key type.

Initializes a new instance of the class that contains elements copied from the specified and uses the specified .

The whose elements are copied to the new . The initial order of the elements in the new collection is the order the elements are enumerated from the supplied dictionary. The implementation to use when comparing keys, or to use the default for the type of the key. is .

Initializes a new instance of the class that contains elements copied from the specified and uses the default equality comparer for the key type.

The whose elements are copied to the new . The initial order of the elements in the new collection is the order the elements are enumerated from the supplied dictionary. is .

Initializes a new instance of the class that contains elements copied from the specified and uses the specified .

The whose elements are copied to the new . The initial order of the elements in the new collection is the order the elements are enumerated from the supplied collection. The implementation to use when comparing keys, or to use the default for the type of the key. is .

Initializes a new instance of the class that contains elements copied from the specified and uses the default equality comparer for the key type.

The whose elements are copied to the new . The initial order of the elements in the new collection is the order the elements are enumerated from the supplied collection. is .

Initializes a new instance of the class that is empty, has the default initial capacity, and uses the specified .

The implementation to use when comparing keys, or to use the default for the type of the key.

Initializes a new instance of the class that is empty, has the specified initial capacity, and uses the specified .

The initial number of elements that the can contain. The implementation to use when comparing keys, or to use the default for the type of the key. capacity is less than 0.

Initializes a new instance of the class that is empty, has the specified initial capacity, and uses the default equality comparer for the key type.

The initial number of elements that the can contain. capacity is less than 0.

Adds an element with the provided key and value to the .

The object to use as the key of the element to add. The object to use as the value of the element to add. key is . An element with the same key already exists in the .

Removes all items from the .

Determines whether the contains an element with the specified key.

The key to locate in the . is . if the contains an element with the key; otherwise, .

Determines whether the contains a specific value.

The value to locate in the . The value can be for reference types. if the contains an element with the specified value; otherwise, .

Ensures that the dictionary can hold up to entries without resizing.

The desired minimum capacity of the dictionary. The actual capacity provided may be larger. is negative. The new capacity of the dictionary.

Gets the key/value pair at the specified index.

The zero-based index of the pair to get. is less than 0 or greater than or equal to . The element at the specified index.

Returns an enumerator that iterates through the .

A structure for the .

Determines the index of a specific key in the .

The key to locate. is . The index of if found; otherwise, -1.

Inserts an item into the collection at the specified index.

The zero-based index at which item should be inserted. The key to insert. The value to insert. key is . An element with the same key already exists in the . is less than 0 or greater than .

Removes the value with the specified key from the and copies the element to the value parameter.

The key of the element to remove. The removed element. is . if the element is successfully found and removed; otherwise, .

Removes the element with the specified key from the .

The key of the element to remove. is . if the element is successfully removed; otherwise, . This method also returns if was not found in the original .

Removes the item at the specified index.

The zero-based index of the item to remove. is less than 0 or greater than or equal to .

Sets the key/value pair at the specified index.

The zero-based index of the element to get or set. The key to store at the specified index. The value to store at the specified index. is . is less than 0 or greater than or equal to .

Sets the value for the key at the specified index.

The zero-based index of the element to get or set. The value to store at the specified index. is less than 0 or greater than or equal to .

Adds an item to the .

The object to add to the .

Determines whether the contains a specific value.

The object to locate in the . if is found in the ; otherwise, .

Copies the elements of the to an , starting at a particular index.

The one-dimensional that is the destination of the elements copied from . The must have zero-based indexing. The zero-based index in at which copying begins.

Removes the first occurrence of a specific object from the .

The object to remove from the . if was successfully removed from the ; otherwise, . This method also returns if is not found in the original .

Returns an enumerator that iterates through the collection.

An enumerator that can be used to iterate through the collection.

Determines the index of a specific item in the .

The object to locate in the . The index of if found in the list; otherwise, -1.

Inserts an item to the at the specified index.

The zero-based index at which should be inserted. The object to insert into the .

Copies the elements of the to an , starting at a particular index.

The one-dimensional that is the destination of the elements copied from . The must have zero-based indexing. The zero-based index in at which copying begins.

Adds an element with the provided key and value to the object.

The to use as the key of the element to add. The to use as the value of the element to add.

Determines whether the object contains an element with the specified key.

The key to locate in the object. if the contains an element with the key; otherwise, .

Returns an object for the object.

An object for the object.

Removes the element with the specified key from the object.

The key of the element to remove.

Returns an enumerator that iterates through a collection.

An object that can be used to iterate through the collection.

Adds an item to the .

The object to add to the . The position into which the new element was inserted, or -1 to indicate that the item was not inserted into the collection.

Determines whether the contains a specific value.

The object to locate in the . if the is found in the ; otherwise, .

Determines the index of a specific item in the .

The object to locate in the . The index of if found in the list; otherwise, -1.

Inserts an item to the at the specified index.

The zero-based index at which should be inserted. The object to insert into the .

Removes the first occurrence of a specific object from the .

The object to remove from the .

Sets the capacity of this dictionary to what it would be if it had been originally initialized with all its entries.

Sets the capacity of this dictionary to hold up a specified number of entries without resizing.

The desired capacity to which to shrink the dictionary. is less than .

Adds the specified key and value to the dictionary if the key doesn't already exist.

The key of the element to add. The value of the element to add. The value can be for reference types. The index of the added or existing . This is always a valid index into the dictionary. is . if the key didn't exist and the key and value were added to the dictionary; otherwise, .

Adds the specified key and value to the dictionary if the key doesn't already exist.

The key of the element to add. The value of the element to add. The value can be for reference types. key is . if the key didn't exist and the key and value were added to the dictionary; otherwise, .

Gets the value associated with the specified key.

The key of the value to get. When this method returns, contains the value associated with the specified key, if the key is found; otherwise, the default value for the type of the value parameter. The index of if found; otherwise, -1. is . if the contains an element with the specified key; otherwise, .

Gets the value associated with the specified key.

The key whose value to get. When this method returns, the value associated with the specified key, if the key is found; otherwise, the default value for the type of the parameter. This parameter is passed uninitialized. is . if the object that implements contains an element with the specified key; otherwise, .

Gets the total number of key/value pairs the internal data structure can hold without resizing.

Gets the that is used to determine equality of keys for the dictionary.

Gets the number of elements contained in the .

The number of elements contained in the .

Gets or sets the element with the specified key.

The key of the element to get or set. is . The property is retrieved and does not exist in the collection. The element with the specified key.

Gets a collection containing the keys in the .

Gets a value indicating whether the is read-only.

if the is read-only; otherwise, .

Gets an containing the keys of the .

An containing the keys of the object that implements .

Gets an containing the values in the .

An containing the values in the object that implements .

Gets or sets the element at the specified index.

The zero-based index of the element to get or set. The element at the specified index.

Gets an enumerable collection that contains the keys in the read-only dictionary.

An enumerable collection that contains the keys in the read-only dictionary.

Gets an enumerable collection that contains the values in the read-only dictionary.

An enumerable collection that contains the values in the read-only dictionary.

Gets the element at the specified index in the read-only list.

The zero-based index of the element to get. The element at the specified index in the read-only list.

Gets a value indicating whether access to the is synchronized (thread safe).

if access to the is synchronized (thread safe); otherwise, .

Gets an object that can be used to synchronize access to the .

An object that can be used to synchronize access to the .

Gets a value indicating whether the object has a fixed size.

if the object has a fixed size; otherwise, .

Gets a value indicating whether the object is read-only.

if the object is read-only; otherwise, .

Gets or sets the element with the specified key.

The key of the element to get or set. The element with the specified key, or if the key does not exist.

Gets an object containing the keys of the object.

An object containing the keys of the object.

Gets an object containing the values in the object.

An object containing the values in the object.

Gets a value indicating whether the has a fixed size.

if the has a fixed size; otherwise, .

Gets a value indicating whether the is read-only.

if the is read-only; otherwise, .

Gets or sets the element at the specified index.

The zero-based index of the element to get or set. The element at the specified index.

Gets a collection containing the values in the .

Enumerates the elements of a .

Advances the enumerator to the next element of the collection.

if the enumerator was successfully advanced to the next element; if the enumerator has passed the end of the collection.

Sets the enumerator to its initial position, which is before the first element in the collection.

Performs application-defined tasks associated with freeing, releasing, or resetting unmanaged resources.

Gets the element in the collection at the current position of the enumerator.

The element in the collection at the current position of the enumerator.

Gets both the key and the value of the current dictionary entry.

A containing both the key and the value of the current dictionary entry.

Gets the key of the current dictionary entry.

The key of the current element of the enumeration.

Gets the value of the current dictionary entry.

The value of the current element of the enumeration.

Gets the element in the collection at the current position of the enumerator.

The element in the collection at the current position of the enumerator.

Represents the collection of keys in a .

Determines whether the contains a specific value.

They key to the location in the collection. if is found in the ; otherwise, .

Copies the elements of the to an , starting at a particular index.

The one-dimensional that is the destination of the elements copied from . The must have zero-based indexing. The zero-based index in at which copying begins.

Returns an enumerator that iterates through the .

A for the .

Adds an item to the .

The object to add to the .

Removes all items from the .

Removes the first occurrence of a specific object from the .

The object to remove from the . if was successfully removed from the ; otherwise, . This method also returns if is not found in the original .

Returns an enumerator that iterates through the collection.

An enumerator that can be used to iterate through the collection.

Determines the index of a specific item in the .

The object to locate in the . The index of if found in the list; otherwise, -1.

Inserts an item to the at the specified index.

The zero-based index at which should be inserted. The object to insert into the .

Removes the item at the specified index.

The zero-based index of the item to remove.

Copies the elements of the to an , starting at a particular index.

The one-dimensional that is the destination of the elements copied from . The must have zero-based indexing. The zero-based index in at which copying begins.

Returns an enumerator that iterates through a collection.

An object that can be used to iterate through the collection.

Adds an item to the .

The object to add to the . The position into which the new element was inserted, or -1 to indicate that the item was not inserted into the collection.

Removes all items from the .

Determines whether the contains a specific value.

The object to locate in the . if the is found in the ; otherwise, .

Determines the index of a specific item in the .

The object to locate in the . The index of if found in the list; otherwise, -1.

Inserts an item into the at the specified index.

The zero-based index at which should be inserted. The object to insert into the .

Removes the first occurrence of a specific object from the .

The object to remove from the .

Removes the item at the specified index.

The zero-based index of the item to remove.

Gets the number of elements contained in the .

The number of elements contained in the .

Gets a value indicating whether the is read-only.

if the is read-only; otherwise, .

Gets or sets the element at the specified index.

The zero-based index of the element to get or set. The element at the specified index.

Gets the element at the specified index in the read-only list.

The zero-based index of the element to get. The element at the specified index in the read-only list.

Gets a value indicating whether access to the is synchronized (thread safe).

if access to the is synchronized (thread safe); otherwise, .

Gets an object that can be used to synchronize access to the .

An object that can be used to synchronize access to the .

Gets a value indicating whether the has a fixed size.

if the has a fixed size; otherwise, .

Gets a value indicating whether the is read-only.

if the is read-only; otherwise, .

Gets or sets the element at the specified index.

The zero-based index of the element to get or set. The element at the specified index.

Enumerates the elements of a .

Advances the enumerator to the next element of the collection.

if the enumerator was successfully advanced to the next element; if the enumerator has passed the end of the collection.

Sets the enumerator to its initial position, which is before the first element in the collection.

Performs application-defined tasks associated with freeing, releasing, or resetting unmanaged resources.

Gets the element in the collection at the current position of the enumerator.

The element in the collection at the current position of the enumerator.

Gets the element in the collection at the current position of the enumerator.

The element in the collection at the current position of the enumerator.

Represents the collection of values in a .

Copies the elements of the to an , starting at a particular index.

The one-dimensional that is the destination of the elements copied from . The must have zero-based indexing. The zero-based index in at which copying begins.

Returns an enumerator that iterates through the .

A for the .

Adds an item to the .

The object to add to the .

Removes all items from the .

Determines whether the contains a specific value.

The object to locate in the . if is found in the ; otherwise, .

Removes the first occurrence of a specific object from the .

The object to remove from the . if was successfully removed from the ; otherwise, . This method also returns if is not found in the original .

Returns an enumerator that iterates through the collection.

An enumerator that can be used to iterate through the collection.

Determines the index of a specific item in the .

The object to locate in the . The index of if found in the list; otherwise, -1.

Inserts an item to the at the specified index.

The zero-based index at which should be inserted. The object to insert into the .

Removes the item at the specified index.

The zero-based index of the item to remove.

Copies the elements of the to an , starting at a particular index.

The one-dimensional that is the destination of the elements copied from . The must have zero-based indexing. The zero-based index in at which copying begins.

Returns an enumerator that iterates through a collection.

An object that can be used to iterate through the collection.

Adds an item to the .

The object to add to the . The position into which the new element was inserted, or -1 to indicate that the item was not inserted into the collection.

Removes all items from the .

Determines whether the contains a specific value.

The object to locate in the . if the is found in the ; otherwise, .

Determines the index of a specific item in the .

The object to locate in the . The index of if found in the list; otherwise, -1.

Inserts an item to the at the specified index.

The zero-based index at which should be inserted. The object to insert into the .

Removes the first occurrence of a specific object from the .

The object to remove from the .

Removes the item at the specified index.

The zero-based index of the item to remove.

Gets the number of elements contained in the .

The number of elements contained in the .

Gets a value indicating whether the is read-only.

if the is read-only; otherwise, .

Gets or sets the element at the specified index.

The zero-based index of the element to get or set. The element at the specified index.

Gets the element at the specified index in the read-only list.

The zero-based index of the element to get. The element at the specified index in the read-only list.

Gets a value indicating whether access to the is synchronized (thread safe).

if access to the is synchronized (thread safe); otherwise, .

Gets an object that can be used to synchronize access to the .

An object that can be used to synchronize access to the .

Gets a value indicating whether the has a fixed size.

if the has a fixed size; otherwise, .

Gets a value indicating whether the is read-only.

if the is read-only; otherwise, .

Gets or sets the element at the specified index.

The zero-based index of the element to get or set. The element at the specified index.

Enumerates the elements of a .

Advances the enumerator to the next element of the collection.

if the enumerator was successfully advanced to the next element; if the enumerator has passed the end of the collection.

Sets the enumerator to its initial position, which is before the first element in the collection.

Performs application-defined tasks associated with freeing, releasing, or resetting unmanaged resources.

Gets the element in the collection at the current position of the enumerator.

The element in the collection at the current position of the enumerator.

Gets the element in the collection at the current position of the enumerator.

The element in the collection at the current position of the enumerator.

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

Specifies the type of elements in the queue. Specifies the type of priority associated with enqueued elements.

Initializes a new instance of the class.

Initializes a new instance of the class with the specified custom priority comparer.

Custom comparer dictating the ordering of elements. Uses if the argument is .

Initializes a new instance of the class that is populated with the specified elements and priorities, and with the specified custom priority comparer.

The pairs of elements and priorities with which to populate the queue. Custom comparer dictating the ordering of elements. Uses if the argument is . The specified argument was .

Initializes a new instance of the class that is populated with the specified elements and priorities.

The pairs of elements and priorities with which to populate the queue. The specified argument was .

Initializes a new instance of the class with the specified initial capacity and custom priority comparer.

Initial capacity to allocate in the underlying heap array. Custom comparer dictating the ordering of elements. Uses if the argument is . The specified was negative.

Initializes a new instance of the class with the specified initial capacity.

Initial capacity to allocate in the underlying heap array. The specified was negative.

Removes all items from the .

Removes and returns the minimal element from the - that is, the element with the lowest priority value.

The queue is empty. The minimal element of the .

Removes the minimal element and then immediately adds the specified element with associated priority to the .

The element to add to the . The priority with which to associate the new element. The queue is empty. The minimal element removed before performing the enqueue operation.

Adds the specified element with associated priority to the .

The element to add to the . The priority with which to associate the new element.

Adds the specified element with associated priority to the , and immediately removes the minimal element, returning the result.

The element to add to the . The priority with which to associate the new element. The minimal element removed after the enqueue operation.

Enqueues a sequence of elements pairs to the , all associated with the specified priority.

The elements to add to the queue. The priority to associate with the new elements. The specified argument was .

Enqueues a sequence of element-priority pairs to the .

The pairs of elements and priorities to add to the queue. The specified argument was .

Ensures that the can hold up to items without further expansion of its backing storage.

The minimum capacity to be used. The specified is negative. The current capacity of the .

Returns the minimal element from the without removing it.

The is empty. The minimal element of the .

Removes the first occurrence that equals the specified parameter.

The element to try to remove. The actual element that got removed from the queue. The priority value associated with the removed element. The equality comparer governing element equality. if matching entry was found and removed, otherwise.

Sets the capacity to the actual number of items in the , if that is less than 90 percent of current capacity.

Removes the minimal element from the , and copies it and its associated priority to the and arguments.

When this method returns, contains the removed element. When this method returns, contains the priority associated with the removed element. if the element is successfully removed; if the is empty.

Returns a value that indicates whether there is a minimal element in the , and if one is present, copies it and its associated priority to the and arguments. The element is not removed from the .

When this method returns, contains the minimal element in the queue. When this method returns, contains the priority associated with the minimal element. if there is a minimal element; if the is empty.

Gets the total numbers of elements the queue's backing storage can hold without resizing.

Gets the priority comparer used by the .

The comparer that determines the priority of items in the queue.

Gets the number of elements contained in the .

The number of elements contained in the queue.

Gets a collection that enumerates the elements of the queue in an unordered manner.

Enumerates the contents of a , without any ordering guarantees.

Returns an enumerator that iterates through the .

An for the .

Returns an enumerator that iterates through the collection.

An enumerator that can be used to iterate through the collection.

Copies the elements of the to an , starting at a particular index.

The one-dimensional that is the destination of the elements copied from . The must have zero-based indexing. The zero-based index in at which copying begins.

Returns an enumerator that iterates through a collection.

An object that can be used to iterate through the collection.

Gets the number of elements in the collection.

The number of elements in the collection.

Gets a value indicating whether access to the is synchronized (thread safe).

if access to the is synchronized (thread safe); otherwise, .

Gets an object that can be used to synchronize access to the .

An object that can be used to synchronize access to the .

Enumerates the element and priority pairs of a , without any ordering guarantees.

Releases all resources used by the .

Advances the enumerator to the next element of the .

if the enumerator was successfully advanced to the next element; if the enumerator has passed the end of the collection.

Sets the enumerator to its initial position, which is before the first element in the collection.

Gets the element at the current position of the enumerator.

The element in the collection at the current position of the enumerator.

Gets the element in the collection at the current position of the enumerator.

The element in the collection at the current position of the enumerator.

Gets the element in the collection at the current position of the enumerator.

The element in the collection at the current position of the enumerator.

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

Specifies the type of elements in the queue.

Initializes a new instance of the class that is empty and has the default initial capacity.

Initializes a new instance of the class that contains elements copied from the specified collection and has sufficient capacity to accommodate the number of elements copied.

The collection whose elements are copied to the new . is .

Initializes a new instance of the class that is empty and has the specified initial capacity.

The initial number of elements that the can contain. is less than zero.

Removes all objects from the .

Determines whether an element is in the .

The object to locate in the . The value can be for reference types. if is found in the ; otherwise, .

Copies the elements to an existing one-dimensional , starting at the specified array index.

The one-dimensional that is the destination of the elements copied from . The must have zero-based indexing. The zero-based index in at which copying begins. is . is less than zero. The number of elements in the source is greater than the available space from to the end of the destination .

Removes and returns the object at the beginning of the .

The is empty. The object that is removed from the beginning of the .

Adds an object to the end of the .

The object to add to the . The value can be for reference types.

Ensures that the capacity of this queue is at least the specified . If the current capacity is less than , it is increased to at least the specified .

The minimum capacity to ensure. The new capacity of this queue.

Returns an enumerator that iterates through the .

An for the .

Returns the object at the beginning of the without removing it.

The is empty. The object at the beginning of the .

Returns an enumerator that iterates through a collection.

An that can be used to iterate through the collection.

Copies the elements of the to an , starting at a particular index.

The one-dimensional that is the destination of the elements copied from . The must have zero-based indexing. The zero-based index in at which copying begins. is . is less than zero. is multidimensional. -or- does not have zero-based indexing. -or- The number of elements in the source is greater than the available space from to the end of the destination . -or- The type of the source cannot be cast automatically to the type of the destination .

Returns an enumerator that iterates through a collection.

An that can be used to iterate through the collection.

Copies the elements to a new array.

A new array containing elements copied from the .

Sets the capacity to the actual number of elements in the , if that number is less than 90 percent of current capacity.

Sets the capacity of a object to the specified number of entries.

The new capacity. Passed capacity is lower than entries count.

Removes the object at the beginning of the , and copies it to the parameter.

The removed object. if the object is successfully removed; if the is empty.

Returns a value that indicates whether there is an object at the beginning of the , and if one is present, copies it to the parameter. The object is not removed from the .

If present, the object at the beginning of the ; otherwise, the default value of . if there is an object at the beginning of the ; if the is empty.

Gets the total numbers of elements the internal data structure can hold without resizing.

Gets the number of elements contained in the .

The number of elements contained in the .

Gets a value indicating whether access to the is synchronized (thread safe).

if access to the is synchronized (thread safe); otherwise, . In the default implementation of , this property always returns .

Gets an object that can be used to synchronize access to the .

An object that can be used to synchronize access to the . In the default implementation of , this property always returns the current instance.

Enumerates the elements of a .

Releases all resources used by the .

Advances the enumerator to the next element of the .

The collection was modified after the enumerator was created. if the enumerator was successfully advanced to the next element; if the enumerator has passed the end of the collection.

Sets the enumerator to its initial position, which is before the first element in the collection.

The collection was modified after the enumerator was created.

Gets the element at the current position of the enumerator.

The enumerator is positioned before the first element of the collection or after the last element. The element in the at the current position of the enumerator.

Gets the element at the current position of the enumerator.

The enumerator is positioned before the first element of the collection or after the last element. The element in the collection at the current position of the enumerator.

An that uses reference equality () instead of value equality () when comparing two object instances.

Determines whether two object references refer to the same object instance.

The first object to compare. The second object to compare. if both and refer to the same object instance or if both are ; otherwise, .

Returns a hash code for the specified object. The returned hash code is based on the object identity, not on the contents of the object.

The object for which to retrieve the hash code. A hash code for the identity of .

Gets the singleton instance.

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

The type of the keys in the dictionary. The type of the values in the dictionary.

Initializes a new instance of the class that is empty and uses the default implementation for the key type.

Initializes a new instance of the class that is empty and uses the specified implementation to compare keys.

The implementation to use when comparing keys, or to use the default for the type of the key.

Initializes a new instance of the class that contains elements copied from the specified and uses the specified implementation to compare keys.

The whose elements are copied to the new . The implementation to use when comparing keys, or to use the default for the type of the key. is . contains one or more duplicate keys.

Initializes a new instance of the class that contains elements copied from the specified and uses the default implementation for the key type.

The whose elements are copied to the new . is . contains one or more duplicate keys.

Adds an element with the specified key and value into the .

The key of the element to add. The value of the element to add. The value can be for reference types. is . An element with the same key already exists in the .

Removes all elements from the .

Determines whether the contains an element with the specified key.

The key to locate in the . is . if the contains an element with the specified key; otherwise, .

Determines whether the contains an element with the specified value.

The value to locate in the . The value can be for reference types. if the contains an element with the specified value; otherwise, .

Copies the elements of the to the specified array of structures, starting at the specified index.

The one-dimensional array of structures that is the destination of the elements copied from the current The array must have zero-based indexing. The zero-based index in at which copying begins. is . is less than 0. The number of elements in the source is greater than the available space from to the end of the destination .

Returns an enumerator that iterates through the .

A for the .

Removes the element with the specified key from the .

The key of the element to remove. is . if the element is successfully removed; otherwise, . This method also returns if is not found in the .

Adds an item to the .

The structure to add to the . is . An element with the same key already exists in the .

Determines whether the contains a specific key and value.

The structure to locate in the . if is found in the ; otherwise, .

Removes the first occurrence of the specified element from the .

The structure to remove from the . if was successfully removed from the ; otherwise, . This method also returns if was not found in the .

Returns an enumerator that iterates through a collection.

An enumerator that can be used to iterate through the collection.

Copies the elements of the to an array, starting at the specified array index.

The one-dimensional array that is the destination of the elements copied from the . The array must have zero-based indexing. The zero-based index in at which copying begins. is . is less than 0. is multidimensional. -or- does not have zero-based indexing. -or- The number of elements in the source is greater than the available space from to the end of the destination . -or- The type of the source cannot be cast automatically to the type of the destination .

Adds an element with the provided key and value to the .

The object to use as the key of the element to add. The object to use as the value of the element to add. is . is of a type that is not assignable to the key type of the . -or- is of a type that is not assignable to the value type of the . -or- An element with the same key already exists in the .

Determines whether the contains an element with the specified key.

The key to locate in the . is . if the contains an element with the key; otherwise, .

Returns an for the .

An for the .

Removes the element with the specified key from the .

The key of the element to remove. is .

Returns an enumerator that iterates through the collection.

An that can be used to iterate through the collection.

Gets the value associated with the specified key.

The key of the value to get. When this method returns, the value associated with the specified key, if the key is found; otherwise, the default value for the type of the parameter. is . if the contains an element with the specified key; otherwise, .

Gets the used to order the elements of the .

The used to order the elements of the

Gets the number of key/value pairs contained in the .

The number of key/value pairs contained in the .

Gets or sets the value associated with the specified key.

The key of the value to get or set. is . The property is retrieved and does not exist in the collection. The value associated with the specified key. If the specified key is not found, a get operation throws a , and a set operation creates a new element with the specified key.

Gets a collection containing the keys in the .

A containing the keys in the .

Gets a value indicating whether the is read-only.

if the is read-only; otherwise, . In the default implementation of , this property always returns .

Gets an containing the keys of the .

An containing the keys of the .

Gets an containing the values in the .

An containing the values in the .

Gets a collection containing the keys in the .

A collection containing the keys in the .

Gets a collection containing the values in the .

A collection containing the values in the .

Gets a value indicating whether access to the is synchronized (thread safe).

if access to the is synchronized (thread safe); otherwise, . In the default implementation of , this property always returns .

Gets an object that can be used to synchronize access to the .

An object that can be used to synchronize access to the .

Gets a value indicating whether the has a fixed size.

if the has a fixed size; otherwise, . In the default implementation of , this property always returns .

Gets a value indicating whether the is read-only.

if the is read-only; otherwise, . In the default implementation of , this property always returns .

Gets or sets the element with the specified key.

The key of the element to get. is . A value is being assigned, and is of a type that is not assignable to the key type of the . -or- A value is being assigned and is of a type that isn't assignable to the value type of the . The element with the specified key, or if is not in the dictionary or is of a type that is not assignable to the key type of the .

Gets an containing the keys of the .

An containing the keys of the .

Gets an containing the values in the .

An containing the values in the .

Gets a collection containing the values in the .

A containing the values in the .

Enumerates the elements of a .

Releases all resources used by the .

Advances the enumerator to the next element of the .

The collection was modified after the enumerator was created. if the enumerator was successfully advanced to the next element; if the enumerator has passed the end of the collection.

Sets the enumerator to its initial position, which is before the first element in the collection.

The collection was modified after the enumerator was created.

Gets the element at the current position of the enumerator.

The element in the at the current position of the enumerator.

Gets the element at the current position of the enumerator as a structure.

The enumerator is positioned before the first element of the collection or after the last element. The element in the collection at the current position of the dictionary, as a structure.

Gets the key of the element at the current position of the enumerator.

The enumerator is positioned before the first element of the collection or after the last element. The key of the element in the collection at the current position of the enumerator.

Gets the value of the element at the current position of the enumerator.

The enumerator is positioned before the first element of the collection or after the last element. The value of the element in the collection at the current position of the enumerator.

Gets the element at the current position of the enumerator.

The enumerator is positioned before the first element of the collection or after the last element. The element in the collection at the current position of the enumerator.

Represents the collection of keys in a . This class cannot be inherited.

Initializes a new instance of the class that reflects the keys in the specified .

The whose keys are reflected in the new . is .

Determines whether the contains a specific value.

The object to locate in the . if is found in the ; otherwise, .

Copies the elements to an existing one-dimensional array, starting at the specified array index.

The one-dimensional array that is the destination of the elements copied from the . The array must have zero-based indexing. The zero-based index in at which copying begins. is . is less than 0. The number of elements in the source is greater than the available space from to the end of the destination .

Returns an enumerator that iterates through the .

A structure for the .

Adds an item to the . This implementation always throws a .

The object to add to the . Always thrown; the collection is read-only.

Removes all items from the . This implementation always throws a .

Always thrown; the collection is read-only.

Removes the first occurrence of a specific object from the . This implementation always throws a .

The object to remove from the . Always thrown; the collection is read-only. if item is successfully removed from the ; otherwise, . This method also returns if item is not found in the .

Returns an enumerator that iterates through the collection.

An that can be used to iterate through the collection.

Copies the elements of the to an array, starting at a particular array index.

The one-dimensional array that is the destination of the elements copied from the . The array must have zero-based indexing. The zero-based index in at which copying begins. is . is less than 0. is multidimensional. -or- does not have zero-based indexing. -or- The number of elements in the source is greater than the available space from to the end of the destination . -or- The type of the source cannot be cast automatically to the type of the destination .

Returns an enumerator that iterates through the collection.

An that can be used to iterate through the collection.

Gets the number of elements contained in the .

The number of elements contained in the .

Gets a value indicating whether the is read-only.

if the is read-only; otherwise, . In the default implementation of , this property always returns .

Gets a value indicating whether access to the is synchronized (thread safe).

if access to the is synchronized (thread safe); otherwise, . In the default implementation of , this property always returns .

Gets an object that can be used to synchronize access to the .

An object that can be used to synchronize access to the . In the default implementation of , this property always returns the current instance.

Enumerates the elements of a .

Releases all resources used by the .

Advances the enumerator to the next element of the .

The collection was modified after the enumerator was created. if the enumerator was successfully advanced to the next element; if the enumerator has passed the end of the collection.

Sets the enumerator to its initial position, which is before the first element in the collection.

The collection was modified after the enumerator was created.

Gets the element at the current position of the enumerator.

The element in the at the current position of the enumerator.

Gets the element at the current position of the enumerator.

The enumerator is positioned before the first element of the collection or after the last element. The element in the collection at the current position of the enumerator.

Represents the collection of values in a . This class cannot be inherited.

Initializes a new instance of the class that reflects the values in the specified .

The whose values are reflected in the new . is .

Copies the elements to an existing one-dimensional array, starting at the specified array index.

The one-dimensional array that is the destination of the elements copied from the . The array must have zero-based indexing. The zero-based index in at which copying begins. is . is less than 0. The number of elements in the source is greater than the available space from to the end of the destination .

Returns an enumerator that iterates through the .

A structure for the .

Adds an item to the . This implementation always throws a .

The object to add to the . Always thrown; the collection is read-only.

Removes all items from the . This implementation always throws a .

Always thrown; the collection is read-only.

Determines whether the contains a specified value.

The object to locate in the . if is found in the ; otherwise, .

Removes the first occurrence of a specific object from the . This implementation always throws a .

The object to remove from the . Always thrown; the collection is read-only. if is successfully removed from the ; otherwise, . This method also returns if is not found in the .

Returns an enumerator that iterates through the collection.

An that can be used to iterate through the collection.

Copies the elements of the to an array, starting at a particular array index.

The one-dimensional array that is the destination of the elements copied from the . The array must have zero-based indexing. The zero-based index in at which copying begins. is . is less than 0. is multidimensional. -or- does not have zero-based indexing. -or- The number of elements in the source is greater than the available space from to the end of the destination . -or- The type of the source cannot be cast automatically to the type of the destination .

Returns an enumerator that iterates through the collection.

An that can be used to iterate through the collection.

Gets the number of elements contained in the .

The number of elements contained in the .

Gets a value indicating whether the is read-only.

if the is read-only; otherwise, . In the default implementation of , this property always returns .

Gets a value indicating whether access to the is synchronized (thread safe).

if access to the is synchronized (thread safe); otherwise, . In the default implementation of , this property always returns .

Gets an object that can be used to synchronize access to the .

An object that can be used to synchronize access to the . In the default implementation of , this property always returns the current instance.

Enumerates the elements of a .

Releases all resources used by the .

Advances the enumerator to the next element of the .

The collection was modified after the enumerator was created. if the enumerator was successfully advanced to the next element; if the enumerator has passed the end of the collection.

Sets the enumerator to its initial position, which is before the first element in the collection.

The collection was modified after the enumerator was created.

Gets the element at the current position of the enumerator.

The element in the at the current position of the enumerator.

Gets the element at the current position of the enumerator.

The enumerator is positioned before the first element of the collection or after the last element. The element in the collection at the current position of the enumerator.

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

The type of keys in the collection. The type of values in the collection.

Initializes a new instance of the class that is empty, has the default initial capacity, and uses the default .

Initializes a new instance of the class that is empty, has the default initial capacity, and uses the specified .

The implementation to use when comparing keys. -or- to use the default for the type of the key.

Initializes a new instance of the class that contains elements copied from the specified , has sufficient capacity to accommodate the number of elements copied, and uses the specified .

The whose elements are copied to the new . The implementation to use when comparing keys. -or- to use the default for the type of the key. is . contains one or more duplicate keys.

Initializes a new instance of the class that contains elements copied from the specified , has sufficient capacity to accommodate the number of elements copied, and uses the default .

The whose elements are copied to the new . is . contains one or more duplicate keys.

Initializes a new instance of the class that is empty, has the specified initial capacity, and uses the specified .

The initial number of elements that the can contain. The implementation to use when comparing keys. -or- to use the default for the type of the key. is less than zero.

Initializes a new instance of the class that is empty, has the specified initial capacity, and uses the default .

The initial number of elements that the can contain. is less than zero.

Adds an element with the specified key and value into the .

The key of the element to add. The value of the element to add. The value can be for reference types. is . An element with the same key already exists in the .

Removes all elements from the .

Determines whether the contains a specific key.

The key to locate in the . is . if the contains an element with the specified key; otherwise, .

Determines whether the contains a specific value.

The value to locate in the . The value can be for reference types. if the contains an element with the specified value; otherwise, .

Returns an enumerator that iterates through the .

An of type for the .

Gets the key corresponding to the specified index.

The zero-based index of the key within the entire . The specified index is out of range. The key corresponding to the specified index.

Gets the value corresponding to the specified index.

The zero-based index of the value within the entire . The specified index was out of range. The value corresponding to the specified index.

Searches for the specified key and returns the zero-based index within the entire .

The key to locate in the . is . The zero-based index of within the entire , if found; otherwise, -1.

Searches for the specified value and returns the zero-based index of the first occurrence within the entire .

The value to locate in the . The value can be for reference types. The zero-based index of the first occurrence of within the entire , if found; otherwise, -1.

Removes the element with the specified key from the .

The key of the element to remove. is . if the element is successfully removed; otherwise, . This method also returns if was not found in the original .

Removes the element at the specified index of the .

The zero-based index of the element to remove. is less than zero. -or- is equal to or greater than .

Updates the value corresponding to the specified index.

The zero-based index of the value within the entire . The value with which to replace the entry at the specified index. The specified index was out of range.

Adds a key/value pair to the .

The to add to the .

Determines whether the contains a specific element.

The to locate in the . if is found in the ; otherwise, .

Copies the elements of the to an , starting at a particular index.

The one-dimensional that is the destination of the elements copied from . The must have zero-based indexing. The zero-based index in at which copying begins. is . is less than zero. The number of elements in the source is greater than the available space from to the end of the destination .

Removes the first occurrence of a specific key/value pair from the .

The to remove from the . if was successfully removed from the ; otherwise, . This method also returns if was not found in the original .

Returns an enumerator that iterates through a collection.

An that can be used to iterate through the collection.

Copies the elements of the to an , starting at a particular index.

The one-dimensional that is the destination of the elements copied from . The must have zero-based indexing. The zero-based index in at which copying begins. is . is less than zero. is multidimensional. -or- does not have zero-based indexing. -or- The number of elements in the source is greater than the available space from to the end of the destination . -or- The type of the source cannot be cast automatically to the type of the destination .

Adds an element with the provided key and value to the .

The to use as the key of the element to add. The to use as the value of the element to add. is . is of a type that is not assignable to the key type of the . -or- is of a type that is not assignable to the value type of the . -or- An element with the same key already exists in the .

Determines whether the contains an element with the specified key.

The key to locate in the . is . if the contains an element with the key; otherwise, .

Returns an for the .

An for the .

Removes the element with the specified key from the .

The key of the element to remove. is .

Returns an enumerator that iterates through a collection.

An that can be used to iterate through the collection.

Sets the capacity to the actual number of elements in the , if that number is less than 90 percent of current capacity.

Gets the value associated with the specified key.

The key whose value to get. When this method returns, the value associated with the specified key, if the key is found; otherwise, the default value for the type of the parameter. This parameter is passed uninitialized. is . if the contains an element with the specified key; otherwise, .

Gets or sets the number of elements that the can contain.

is set to a value that is less than . There is not enough memory available on the system. The number of elements that the can contain.

Gets the for the sorted list.

The for the current .

Gets the number of key/value pairs contained in the .

The number of key/value pairs contained in the .

Gets or sets the value associated with the specified key.

The key whose value to get or set. is . The property is retrieved and does not exist in the collection. The value associated with the specified key. If the specified key is not found, a get operation throws a and a set operation creates a new element using the specified key.

Gets a collection containing the keys in the , in sorted order.

A containing the keys in the .

Gets a value indicating whether the is read-only.

if the is read-only; otherwise, . In the default implementation of , this property always returns .

Gets an containing the keys of the .

An containing the keys of the .

Gets an containing the values in the .

An object containing the values in the .

Gets an enumerable collection that contains the keys in the read-only dictionary.

An enumerable collection that contains the keys in the read-only dictionary.

Gets an enumerable collection that contains the values in the read-only dictionary.

An enumerable collection that contains the values in the read-only dictionary.

Gets a value indicating whether access to the is synchronized (thread safe).

if access to the is synchronized (thread safe); otherwise, . In the default implementation of , this property always returns .

Gets an object that can be used to synchronize access to the .

An object that can be used to synchronize access to the . In the default implementation of , this property always returns the current instance.

Gets a value indicating whether the has a fixed size.

if the has a fixed size; otherwise, . In the default implementation of , this property always returns .

Gets a value indicating whether the is read-only.

if the is read-only; otherwise, . In the default implementation of , this property always returns .

Gets or sets the element with the specified key.

The key of the element to get or set. is . A value is being assigned, and is of a type that is not assignable to the key type of the . -or- A value is being assigned and is of a type that isn't assignable to the value type of the . The element with the specified key, or if is not in the dictionary or is of a type that is not assignable to the key type of the .

Gets an containing the keys of the .

An containing the keys of the .

Gets an containing the values in the .

An containing the values in the .

Gets a collection containing the values in the .

A containing the values in the .

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

The type of elements in the set.

Initializes a new instance of the class.

Initializes a new instance of the class that uses a specified comparer.

The default comparer to use for comparing objects. is .

Initializes a new instance of the class that contains elements copied from a specified enumerable collection and that uses a specified comparer.

The enumerable collection to be copied. The default comparer to use for comparing objects. is .

Initializes a new instance of the class that contains elements copied from a specified enumerable collection.

The enumerable collection to be copied.

Initializes a new instance of the class that contains serialized data.

The object that contains the information that is required to serialize the object. The structure that contains the source and destination of the serialized stream associated with the object.

Adds an element to the set and returns a value that indicates if it was successfully added.

The element to add to the set. if is added to the set; otherwise, .

Removes all elements from the set.

Determines whether the set contains a specific element.

The element to locate in the set. if the set contains ; otherwise, .

Copies a specified number of elements from to a compatible one-dimensional array, starting at the specified array index.

A one-dimensional array that is the destination of the elements copied from the . The array must have zero-based indexing. The zero-based index in at which copying begins. The number of elements to copy. The number of elements in the source array is greater than the available space from to the end of the destination array. is . is less than zero. -or- is less than zero.

Copies the complete to a compatible one-dimensional array, starting at the specified array index.

A one-dimensional array that is the destination of the elements copied from the . The array must have zero-based indexing. The zero-based index in at which copying begins. The number of elements in the source array is greater than the available space from to the end of the destination array. is . is less than zero.

Copies the complete to a compatible one-dimensional array, starting at the beginning of the target array.

A one-dimensional array that is the destination of the elements copied from the . The number of elements in the source exceeds the number of elements that the destination array can contain. is .

Returns an object that can be used to create a collection that contains individual sets.

A comparer for creating a collection of sets.

Returns an object, according to a specified comparer, that can be used to create a collection that contains individual sets.

The comparer to use for creating the returned comparer. A comparer for creating a collection of sets.

Removes all elements that are in a specified collection from the current object.

The collection of items to remove from the object. is .

Returns an enumerator that iterates through the .

An enumerator that iterates through the in sorted order.

Implements the interface and returns the data that you must have to serialize a object.

A object that contains the information that is required to serialize the object. A structure that contains the source and destination of the serialized stream associated with the object. is .

Returns a view of a subset in a .

The lowest desired value in the view. The highest desired value in the view. is more than according to the comparer. A tried operation on the view was outside the range specified by and . A subset view that contains only the values in the specified range.

Modifies the current object so that it contains only elements that are also in a specified collection.

The collection to compare to the current object. is .

Determines whether a object is a proper subset of the specified collection.

The collection to compare to the current object. is . if the object is a proper subset of ; otherwise, .

Determines whether a object is a proper superset of the specified collection.

The collection to compare to the current object. is . if the object is a proper superset of ; otherwise, .

Determines whether a object is a subset of the specified collection.

The collection to compare to the current object. is . if the current object is a subset of ; otherwise, .

Determines whether a object is a superset of the specified collection.

The collection to compare to the current object. is . if the object is a superset of ; otherwise, .

Implements the interface, and raises the deserialization event when the deserialization is completed.

The source of the deserialization event. The object associated with the current object is invalid.

Determines whether the current object and a specified collection share common elements.

The collection to compare to the current object. is . if the object and share at least one common element; otherwise, .

Removes a specified item from the .

The element to remove. if the element is found and successfully removed; otherwise, .

Removes all elements that match the conditions defined by the specified predicate from a .

The delegate that defines the conditions of the elements to remove. is . The number of elements that were removed from the collection.

Returns an that iterates over the in reverse order.

An enumerator that iterates over the in reverse order.

Determines whether the current object and the specified collection contain the same elements.

The collection to compare to the current object. is . if the current object is equal to ; otherwise, .

Modifies the current object so that it contains only elements that are present either in the current object or in the specified collection, but not both.

The collection to compare to the current object. is .

Adds an item to an object.

The object to add to the object. The is read-only.

Returns an enumerator that iterates through a collection.

An enumerator that can be used to iterate through the collection.

Copies the complete to a compatible one-dimensional array, starting at the specified array index.

A one-dimensional array that is the destination of the elements copied from the . The array must have zero-based indexing. The zero-based index in at which copying begins. The number of elements in the source array is greater than the available space from to the end of the destination array. is . is less than zero.

Returns an enumerator that iterates through a collection.

An enumerator that can be used to iterate through the collection.

Implements the interface, and raises the deserialization event when the deserialization is completed.

The source of the deserialization event. The object associated with the current instance is invalid.

Implements the interface, and returns the data that you need to serialize the instance.

A object that contains the information that is required to serialize the instance. A structure that contains the source and destination of the serialized stream associated with the instance. is .

Searches the set for a given value and returns the equal value it finds, if any.

The value to search for. The value from the set that the search found, or the default value of T when the search yielded no match. A value indicating whether the search was successful.

Modifies the current object so that it contains all elements that are present in either the current object or the specified collection.

The collection to compare to the current object. is .

Gets the object that is used to order the values in the .

The comparer that is used to order the values in the .

Gets the number of elements in the .

The number of elements in the .

Gets the maximum value in the , as defined by the comparer.

The maximum value in the set.

Gets the minimum value in the , as defined by the comparer.

The minimum value in the set.

Gets a value that indicates whether a is read-only.

if the collection is read-only; otherwise, .

Gets a value that indicates whether access to the is synchronized (thread safe).

if access to the is synchronized; otherwise, .

Gets an object that can be used to synchronize access to the .

An object that can be used to synchronize access to the . In the default implementation of , this property always returns the current instance.

Enumerates the elements of a object.

Releases all resources used by the .

Advances the enumerator to the next element of the collection.

The collection was modified after the enumerator was created. if the enumerator was successfully advanced to the next element; if the enumerator has passed the end of the collection.

Sets the enumerator to its initial position, which is before the first element in the collection.

The collection was modified after the enumerator was created.

Implements the interface and raises the deserialization event when the deserialization is complete.

The source of the deserialization event. The object associated with the current instance is invalid.

Implements the interface and returns the data needed to serialize the instance.

A object that contains the information required to serialize the instance. A object that contains the source and destination of the serialized stream associated with the instance. is .

Gets the element at the current position of the enumerator.

The element in the collection at the current position of the enumerator.

Gets the element at the current position of the enumerator.

The enumerator is positioned before the first element of the collection or after the last element. The element in the collection at the current position of the enumerator.

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

Specifies the type of elements in the stack.

Initializes a new instance of the class that is empty and has the default initial capacity.

Initializes a new instance of the class that contains elements copied from the specified collection and has sufficient capacity to accommodate the number of elements copied.

The collection to copy elements from. is .

Initializes a new instance of the class that is empty and has the specified initial capacity or the default initial capacity, whichever is greater.

The initial number of elements that the can contain. is less than zero.

Removes all objects from the .

Determines whether an element is in the .

The object to locate in the . The value can be for reference types. if is found in the ; otherwise, .

Copies the to an existing one-dimensional , starting at the specified array index.

The one-dimensional that is the destination of the elements copied from . The must have zero-based indexing. The zero-based index in at which copying begins. is . is less than zero. The number of elements in the source is greater than the available space from to the end of the destination .

Ensures that the capacity of this Stack is at least the specified . If the current capacity is less than , it is increased to at least the specified .

The minimum capacity to ensure. The new capacity of this stack.

Returns an enumerator for the .

An for the .

Returns the object at the top of the without removing it.

The is empty. The object at the top of the .

Removes and returns the object at the top of the .

The is empty. The object removed from the top of the .

Inserts an object at the top of the .

The object to push onto the . The value can be for reference types.

Returns an enumerator that iterates through the collection.

An that can be used to iterate through the collection.

Copies the elements of the to an , starting at a particular index.

The one-dimensional that is the destination of the elements copied from . The must have zero-based indexing. The zero-based index in at which copying begins. is . is less than zero. is multidimensional. -or- does not have zero-based indexing. -or- The number of elements in the source is greater than the available space from to the end of the destination . -or- The type of the source cannot be cast automatically to the type of the destination .

Returns an enumerator that iterates through a collection.

An that can be used to iterate through the collection.

Copies the to a new array.

A new array containing copies of the elements of the .

Sets the capacity to the actual number of elements in the , if that number is less than 90 percent of current capacity.

Sets the capacity of a object to a specified number of entries.

The new capacity. Passed capacity is lower than 0 or entries count.

Returns a value that indicates whether there is an object at the top of the , and if one is present, copies it to the parameter. The object is not removed from the .

If present, the object at the top of the ; otherwise, the default value of . if there is an object at the top of the ; if the is empty.

Returns a value that indicates whether there is an object at the top of the , and if one is present, copies it to the parameter, and removes it from the .

If present, the object at the top of the ; otherwise, the default value of . if there is an object at the top of the ; if the is empty.

Gets the total numbers of elements the internal data structure can hold without resizing.

Gets the number of elements contained in the .

The number of elements contained in the .

Gets a value indicating whether access to the is synchronized (thread safe).

if access to the is synchronized (thread safe); otherwise, . In the default implementation of , this property always returns .

Gets an object that can be used to synchronize access to the .

An object that can be used to synchronize access to the . In the default implementation of , this property always returns the current instance.

Enumerates the elements of a .

Releases all resources used by the .

Advances the enumerator to the next element of the .

The collection was modified after the enumerator was created. if the enumerator was successfully advanced to the next element; if the enumerator has passed the end of the collection.

Sets the enumerator to its initial position, which is before the first element in the collection. This class cannot be inherited.

The collection was modified after the enumerator was created.

Gets the element at the current position of the enumerator.

The enumerator is positioned before the first element of the collection or after the last element. The element in the at the current position of the enumerator.

Gets the element at the current position of the enumerator.

The enumerator is positioned before the first element of the collection or after the last element. The element in the collection at the current position of the enumerator.

Provides objects for performing a structural comparison of two collection objects.

Gets a predefined object that performs a structural comparison of two objects.

A predefined object that is used to perform a structural comparison of two collection objects.

Gets a predefined object that compares two objects for structural equality.

A predefined object that is used to compare two collection objects for structural equality.