public class Genec<T> {
private transient Object[] items;
private int count;
public Genec(int size){
items=new Object[size] ;
count=0;
}
private void Check(int index) {
if (index >= count)
throw new IndexOutOfBoundsException(
"Index: "+index+", Size: "+count);
}
public void Push(T x){
items[count++]=x;
}
public T Pop(int index){
Check(index);
return (T)items[index];
}
public static void main(String[] args) {
Genec<String> ss=new Genec<String>(10);
ss.Push("111");
ss.Push("22");
System.out.println(ss.Pop(0)+ss.Pop(1));
}
}
//模拟 一个进栈出栈的简单的泛型