Namespace System.Collections
Classes
- ArrayList
Implements the IList interface using an array whose size is dynamically increased as required.
- DictionaryEntry
Defines a dictionary key/value pair that can be set or retrieved.
- Queue
A circular-array implementation of a queue. Enqueue can be O(n). Dequeue is O(1).
- Stack
An array implementation of a stack. Push can be O(n). Pop is O(1).
Interfaces
- ICollection
Defines size, enumerators, and synchronization methods for all nongeneric collections.
- IComparer
Exposes a method that compares two objects.
- IDictionary
Represents a nongeneric collection of key/value pairs.
- IDictionaryEnumerator
Enumerates the elements of a nongeneric dictionary.
- IEnumerable
Exposes an enumerator, which supports a simple iteration over a non-generic collection.
- IEnumerator
Supports a simple iteration over a non-generic collection.
- IEqualityComparer
Defines methods to support the comparison of objects for equality.
- IList
Represents a non-generic collection of objects that can be individually accessed by index.