Data structure for java

Sup /prog/, I need to an indexed data structure that supports these methods:


void addLast(S stuff);     // insertion's like a queue
void removeLast();         // removes last link
void removeIfHas(S stuff); // removes link if has target stuff
S getStuff(int index);     // retrieves stuff given the index

I can do this with a (Doubly/Double) Linked List, but the search/retrieval is O(n). Is a HashTable a better structure?

Thanks

>>5
What indicies? removeIfHas simply searches in the hashtable for "stuff" - O(1) amortized, and deletes it from the linked list (the hashtable points to the node so this is O(1) also), then deletes the corresponding entry from the hashtable which is again O(1) amortized.