SortedList.Item Property (Object)
Gets and sets the value associated with a specific key in a SortedList object.
Assembly: mscorlib (in mscorlib.dll)
abstract Item : key:Object -> Object with get, set override Item : key:Object -> Object with get, set
The key associated with the value to get or set.
Property ValueType: System.Object
The value associated with the key parameter in the SortedList object, if key is found; otherwise, null.
key is null.
There is not enough available memory to add the element to the SortedList.
The comparer throws an exception.
You can use the myCollection[key].property to access a specific element in a collection by specifying the following syntax:
You can also use this property to add new elements by setting the value of a key that does not exist in the SortedList object (for example, myCollection["myNonexistentKey"] = myValue). However, if the specified key already exists in the SortedList, setting the property overwrites the old value. In contrast, the Add method does not modify existing elements.
A key cannot be null, but a value can be. To distinguish between null that is returned because the specified key is not found and null that is returned because the value of the specified key is null, use the Contains method or the ContainsKey method to determine if the key exists in the list.
The elements of a SortedList are sorted by the keys either according to a specific IComparer implementation specified when the SortedList is created or according to the IComparable implementation provided by the keys themselves.
The C# language uses the keyword to define the indexers instead of implementing the Keysproperty. Visual Basic implements as a default property, which provides the same indexing functionality.
Retrieving the value of this property is an O(log n) operation, where n is Count. Setting the property is an O(log n) operation if the key is already in the SortedList. If the key is not in the list, setting the property is an O(n) operation for unsorted data, or O(log n) if the new element is added at the end of the list. If insertion causes a resize, the operation is O(n).
Available since 10
Available since 1.1