I don't get that one...
like I said in my msg: SortedList ?
not good enough?
<reference guide quote>
A SortedList is a hybrid between a Hashtable and an Array. When an element
is accessed by its key using the Item indexer property, it behaves like a
Hashtable. When an element is accessed by its index using GetByIndex or
SetByIndex, it behaves like an Array.
A SortedList internally maintains two arrays to store the elements of the
list; that is, one array for the keys and another array for the associated
values. Each element is a key-and-value pair that can be accessed as a
DictionaryEntry object.
The capacity of a SortedList is the number of elements that the list can
hold. As elements are added to a SortedList, the capacity is automatically
increased as required through reallocation. The capacity can be decreased by
calling TrimToSize or by setting the Capacity property explicitly.
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. In either case, a SortedList does not allow duplicate keys.
The index sequence is based on the sort sequence. When an element is added,
it is inserted into SortedList in the correct sort order, and the indexing
adjusts accordingly. When an element removed, the indexing also adjusts
accordingly. Therefore, the index of a specific key-and-value pair might
change as elements are added or removed from the SortedList.
Operations on a SortedList tend to be slower than operations on a Hashtable
because of the sorting. However, the SortedList offers more flexibility by
allowing access to the values either through the associated keys or through
the indexes.
A key cannot be a null reference (Nothing in Visual Basic), but a value can
be a null reference (Nothing).
Indexes in this collection are zero-based.
[C#] The foreach statement of the C# language requires the type of each
element in the collection. Since each element of the Hashtable is a
key-and-value pair, the element type is not the type of the key or the type
of the value. Instead, the element type is DictionaryEntry. For example:
foreach (DictionaryEntry myEntry in myHashtable) {...}
</reference guide quote>
"Herfried K. Wagner [MVP]" <hi***************@gmx.at> wrote in message
news:bv************@ID-208219.news.uni-berlin.de...
* "Fred Morrison" <fm*******@erols.com> scripsit: I need key/value pairs. I'll take another look at ArrayList, but it
didn't seem to provide both the random access I need and the ability to
traverse the list in "sorted key" order (vs. "unsorted key" order). I think
Microsoft needs to add a Sort method to HashTable to fix this
deficiency.
You will have to maintain both, a hashtable and an arraylist.
--
Herfried K. Wagner [MVP]
<http://www.mvps.org/dotnet>
