Java容器类分析之List ArrayList Vector.docxVIP

Java容器类分析之List ArrayList VectorList是接口，声明了各个方法，不多说。且看ArrayList类。ArrayList类的成员变量有Object[] elementData，int size;其中elementData数组用来存储加入到ArrayList的对象，size为列表中实际的对象数目。ArrayList类不是线程安全的。Vector与ArrayList的实现基本相同，只是Vector类是线程安全的，其方法都带有synchronized关键字，如果不考虑线程同步的话，ArrayList性能要好一些。当前它们内部实现原理都是用到对象数组来实现，如果元素数目确定，直接用数组效率最高。简单的用法：(后面是数据打印结果)public?class?ListDemo?{ ??????/** ??????*?@param?args ??????*/?????public?static?void?main(String[]?args)?{ ?????????ListString?list?=?new?ArrayListString(); ?????????String[]?strArr?=?new?String[3]; ?????????boolean?ret?=?list.add(haha); ?????????list.add(new?String(aa)); ?????????list.add(null);? ?????????System.out.println(list.size());//3 ?????????System.out.println(ret);//true ?????????System.out.println(list);//[haha,?aa,?null] ?????????System.out.println(strArr);//[Ljava.lang.String;@1fee6fc ?????????System.out.println(strArr.getClass().getName());//[Ljava.lang.String; ?????????System.out.println(list.indexOf(aa));//1 ?????????System.out.println(list.indexOf(null));//2 ?????????String?str?=?list.set(1,?ee); ?????????System.out.println(str);//aa ?????????System.out.println(list);//[haha,?ee,?null] ?????????String?remove?=?list.remove(0); ?????????System.out.println(remove);//haha ?????????System.out.println(list);//[ee,?null] ?????????boolean?result?=?list.remove(ff); ?????????System.out.println(result);//false ?????????result?=?list.remove(ee); ?????????System.out.println(result);//true ?????????System.out.println(list);//[null] ?????} ??}?public?ArrayList()?{ ?????this(10); ?????} ??public?ArrayList(int?initialCapacity)?{ ?????super(); ?????????????if?(initialCapacity??0) ??????????????????throw?new?IllegalArgumentException(Illegal?Capacity:?+?initialCapacity); ?????this.elementData?=?new?Object[initialCapacity]; ?????} ????public?boolean?add(E?e)?{ ?????ensureCapacity(size?+?1);??//?Increments?modCount!! ?????elementData[size++]?=?e; ?????return?true; ?????} ????/*移除指定位置元素，注意每次移除数据都会将数组中后面数据移动来填充数组*/??public?E?remove(int?index)?{ ?????R