SortedList::Contains Method (Object^)
Determines whether a SortedList object contains a specific key.
Assembly: mscorlib (in mscorlib.dll)
Parameters
- key
-
Type:
System::Object^
The key to locate in the SortedList object.
Return Value
Type: System::Booleantrue if the SortedList object contains an element with the specified key; otherwise, false.
Implements
IDictionary::Contains(Object^)| Exception | Condition |
|---|---|
| ArgumentNullException | key is null. |
| InvalidOperationException | The comparer throws an exception. |
The elements of a SortedList object 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.
Contains implements IDictionary::Contains. It behaves exactly as ContainsKey.
This method uses a binary search algorithm; therefore, this method is an O(log n) operation, where n is Count.
Starting with the .NET Framework 2.0, this method uses the collection’s objects’ Equals and CompareTo methods on item to determine whether item exists. In the earlier versions of the .NET Framework, this determination was made by using the Equals and CompareTo methods of the item parameter on the objects in the collection.
The following code example shows how to determine whether a SortedList object contains a specific element.
#using <system.dll> using namespace System; using namespace System::Collections; void PrintIndexAndKeysAndValues( SortedList^ myList ) { Console::WriteLine( "\t-INDEX-\t-KEY-\t-VALUE-" ); for ( int i = 0; i < myList->Count; i++ ) { Console::WriteLine( "\t[{0}]:\t{1}\t{2}", i, myList->GetKey( i ), myList->GetByIndex( i ) ); } Console::WriteLine(); } int main() { // Creates and initializes a new SortedList. SortedList^ mySL = gcnew SortedList; mySL->Add( 2, "two" ); mySL->Add( 4, "four" ); mySL->Add( 1, "one" ); mySL->Add( 3, "three" ); mySL->Add( (int^)0, "zero" ); // Displays the values of the SortedList. Console::WriteLine( "The SortedList contains the following values:" ); PrintIndexAndKeysAndValues( mySL ); // Searches for a specific key. int myKey = 2; Console::WriteLine( "The key \"{0}\" is {1}.", myKey, mySL->ContainsKey( myKey ) ? (String^)"in the SortedList" : "NOT in the SortedList" ); myKey = 6; Console::WriteLine( "The key \"{0}\" is {1}.", myKey, mySL->ContainsKey( myKey ) ? (String^)"in the SortedList" : "NOT in the SortedList" ); // Searches for a specific value. String^ myValue = "three"; Console::WriteLine( "The value \"{0}\" is {1}.", myValue, mySL->ContainsValue( myValue ) ? (String^)"in the SortedList" : "NOT in the SortedList" ); myValue = "nine"; Console::WriteLine( "The value \"{0}\" is {1}.", myValue, mySL->ContainsValue( myValue ) ? (String^)"in the SortedList" : "NOT in the SortedList" ); } /* This code produces the following output. The SortedList contains the following values: -INDEX- -KEY- -VALUE- [0]: 0 zero [1]: 1 one [2]: 2 two [3]: 3 three [4]: 4 four The key "2" is in the SortedList. The key "6" is NOT in the SortedList. The value "three" is in the SortedList. The value "nine" is NOT in the SortedList. */
Available since 10
.NET Framework
Available since 1.1