I'm trying to create a SortedList that contains SortedLists as keys and I want them to be ordered by the first element on the key.
However, I do not know how to find information about how different sorted lists compare to each other (do they use the pointer/address value? Do they use the first element of the list? Etc.)
I thought about creating a class that inherits SortedList (so the keys of the outer SortedList would be of this new personalized class type) but I'm struggling because I can not find what characteristics the Key and Value must have (to define the generic constraints).
Thanks in advance!
As juharr said, using a SortedList as a key in a SortedList will sort it using the reference values for comparing.
I did not manage it to sort it the way I wanted but I got an answer.