简单模拟ArrayList集合

MyArrayList类：因为是简单模拟，所以没有实现List接口，接口需要重写的方法太多，这里只是模拟了几个主要的方法。

import java.util.Iterator;
@SuppressWarnings("unchecked")
public class MyArrayList<E>{
private int size;
private Object[] elements;
public MyArrayList(){
elements = new Object[0];
}
public int size() {
return size;
}
public boolean isEmpty() {
return (size == 0);
}
public boolean contains(Object o) {
int i = getIndex((E)o);
if(i!=-1){
return true;
}
return false;
}
public Iterator<E> iterator() {
return new MyIterator<E>();
}
@SuppressWarnings("hiding")
private class MyIterator<E> implements Iterator<E>{
private int course;
private int expectedSize = size;
@Override
public boolean hasNext() {
checkSizeChange();
if(course<size){
return true;
}
return false;
}
@Override
public E next() {
checkSizeChange();
E e = (E)elements[course];
course++;
return e;
}
@Override
public void remove() {
for(int i=--course;i<size;i++){
elements[i]=elements[i+1];
}
elements[size-1]=null;
size--;
expectedSize--;
}
public void checkSizeChange(){
if(expectedSize!=size){
throw new ModiWhenIteratorHadBeenCreatedException();
}
}
}
public Object[] toArray() {
return elements;
}
public <T> T[] toArray(T[] a) {
for(int i=0;i<size;i++){
a[i]=(T) elements[i];
}
return a;
}
private void checkCapacity(int minCapacity){
if(elements.length==0){
elements = new Object[10];
}else{
if((elements.length-minCapacity)<=0){
int oldLength = elements.length;
if(oldLength==Integer.MAX_VALUE){
throw new ListAlradyMaxLengthException("List集合已到最大长度");
}
int newLength = oldLength+(oldLength >> 1);
if(newLength<0){
newLength=Integer.MAX_VALUE;
}
Object[] newArray = new Object[newLength];
System.arraycopy(elements, 0, newArray, 0, elements.length);
elements = newArray;
}
}
}
//---------------------------------添加的方法----------------------------------------
public boolean add(E e) {
checkCapacity(size);
elements[size]=e;
size++;
return true;
}
public void add(int index, E element) {
checkCapacity(size);
for(int i=size-1;i>index-1;i--){
elements[i+1]=elements[i];
}
elements[index]=element;
}
//-------------------------------删除元素的方法--------------------------------
public boolean remove(Object o) {
int index = getIndex((E)o);
if(index==-1){
return false;
}
remove(index);
return true;
}
public E remove(int index) {
judgeIndex(index);
E e= (E)elements[index];
for(int i =index;i<size;i++){
elements[i]=elements[i+1];
}
elements[size]=null;
size--;
return e;
}
public void clear() {
elements = new Object[0];
System.gc();
}
//---------------------------------查询的方法-----------------------------------------
public int getIndex(E e){
for(int i = 0;i<size;i++){
if(elements[i]==e){
return i;
}
}
return -1;
}
public E get(int index) {
judgeIndex(index);
return (E)elements[index];
}
//---------------------------------修改的方法---------------------------------------------
public E set(int index, E element) {
judgeIndex(index);
E e = (E)elements[index];
elements[index] =element;
return e;
}
//----------------------判断角标越界分私有方法-----------------------------------
private void judgeIndex(int index){
if(index<0||index>size-1){
throw new outOfBoundsException("角标越界！");
}
}
public int lastIndexOf(Object o) {
for(int i = size;i>=0;i--){
if(elements[i]==o){
return i;
}
}
return -1;
}
}

三个异常类：

public class ListAlradyMaxLengthException extends RuntimeException {
private static final long serialVersionUID = 1L;
public ListAlradyMaxLengthException() {
}
public ListAlradyMaxLengthException(String message) {
super(message);
}
}

public class ModiWhenIteratorHadBeenCreatedException extends RuntimeException {
private static final long serialVersionUID = 1L;
public ModiWhenIteratorHadBeenCreatedException() {
}
public ModiWhenIteratorHadBeenCreatedException(String message) {
super(message);
}
}

public class outOfBoundsException extends RuntimeException {
private static final long serialVersionUID = 1L;
public outOfBoundsException(String message) {
super(message);
}
public outOfBoundsException() {
}
}