An OrderedHashtable is just like a normal Hashtable except that it remembers the order the keys were added to the table and, whenever keys() or elements() is called, they are returned in that order.
Just overrides all the appropriate methods in Hashtable.
Adds only one method reverseKeys(), which is the same as keys(), but the Enumeration is in the reverse order.
Note:: Because this an ordered collection, its performances maybe not be as good as an ordinary Hashtable. Use it only when the order of entry matters
@aribaapi documented | |