-
IListMap
using a hash map for fast lookup.
IListMap
implementation that allows keys to be traversed in the same order as they
were inserted into the collection.
IListMap
implementation that allows keys to be traversed in sorted order using a Comparator
of the natural ordering of the keys if they implement Comparable.
-
IListMap
using a hash map for fast lookup.
IListMap
implementation that allows keys to be traversed in the same order as they
were inserted into the collection.
IListMap
implementation that allows keys to be traversed in sorted order using a Comparator
of the natural ordering of the keys if they implement Comparable.