Thread: Implementing own generic hash table contains method

Hi Sorry for the confusion,
the contains method is inside a class which is basically a hash table that sorts objects of <T,N> types which are in the twos<T,N> interface.

public class twos<T,N> implements Comparable<Pair<T,N>>{...
public T getT(){}
public N getN(){}
public int compareTo(twos<T,N> something){
 
}
public String toString(){}
}

public someS<T,N> implements twos<T,N>{
Integer cap;
public SomeS(Integer value){cap=value;}
twos[] someTable;
}
twos[] sometable;//reference
public int myfunc(T something){
//returns hash of something of type T}
public boolean isEmpty(){...}
public N get(T something){...}
public int size(){...}
public N remove(T something){...}
public N add(T something,N number){...}
public boolean contains(T param){
return hashTable[function(param)]!=null;
}