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


import java.util.*;

public class OPClass<T> {
    public static void main(String argv[]) {
        Set<Integer> opSet = new LinkedHashSet<Integer>();
        // add last
        Integer iamlast = 1;
        opSet.add(iamlast);
        // remove last
        opSet.remove(iamlast);
        System.out.println("Niggers");
    }
}