HashTable data retrieval in reverse order?

[Tom Landry]

Utilizing a HashTable <Integer, Object> then using Enumeration to retrieve the data to be placed within a Vector.
The data is stored in the required order within the HashTable but retrieval appears to be in reverse order.
Usually with other objects like Arrays and stuff the data in retrieved starting with 0.
Why does HashTable operate in reverse order?
Other than going through some extra steps for reordering what is the method usually used to keep the HashTable order when retrieving?
(I am stuck using the HashTable object.)

[Paweł Baczyński]

What do you mean by reverse order? Can you provide us with some example code?

[Stephan van Hulst]

Hashtable shouldn't have an order. The order in which elements appear depend on the insertion order of the elements, the hash function, the capacity of the table, and maybe some other factors.

It seems you are working with some legacy code. Hashtable, Enumeration and Vector are all obsolete in favor of HashMap, Iterator and List.

If you want to sort the elements in some way, you could do this: Map<Integer, Object> map = new TreeMap<>(table);

You now have a map that contains the same elements as the hash table, sorted by natural order of the keys.

[Tom Landry]

Stephan van Hulst wrote:Hashtable shouldn't have an order. The order in which elements appear depend on the insertion order of the elements, the hash function, the capacity of the table, and maybe some other factors.

It seems you are working with some legacy code. Hashtable, Enumeration and Vector are all obsolete in favor of HashMap, Iterator and List.

If you want to sort the elements in some way, you could do this: Map<Integer, Object> map = new TreeMap<>(table);

You now have a map that contains the same elements as the hash table, sorted by natural order of the keys.

Thanks, that worked great.