Implements a set based on a sorted tree. This gives good performance for operations on very large data-sets, though not as good - asymptotically - as a HashedSet. However, iteration occurs in order. Elements that you put into this type of collection must implement IComparable, and they must actually be comparable. You can't mix String and Int32 values, for example.

[SerializableAttribute]
public class SortedSet : DictionarySet

<SerializableAttribute> _
Public Class SortedSet _
	Inherits DictionarySet

[SerializableAttribute]
public ref class SortedSet : public DictionarySet