Question

I am trying to implement a data structure which allows me to keep track of an index (so I can blindly access the data points), a key (which needs to be there to identify the data in the rest of the program), and a value.

I’ve looked at a map, but that does not allow me to access the data points without any key. I need some combination of a Queue and a Map. Does this exist and I’m just missing it? Thanks for the help.

Answer 1

I believe what you are looking for is a LinkedHashMap. It will return an ordered collection and you can access values via a key.

LinkedHashMap<Key, Value> myMap = new LinkedHashMap<Key, Value>();

myMap.put(aKey, aValue); //adds to map.
myMap.values(); //returns collection of values
aValue = myMap.get(Key); //returns a value with the given key