Android 最大数组列表大小

Question

I am reading from SQLite in android some name of Files , I have like 3000 names that are added to an ArrayList but I discovered that I can't have more than 1000. Is 1000 maximum size of an ArrayList<String> ? Searching over the internet I found that depends.

I found some math operations here ( http://www.coderanch.com/t/524745/java/java/Maximum-capacity-arrayList-String-objects ) with 1000, and I found that the maximum capacity of an ArrayList<String> is given by Java Virtual Machine Memory.

Is there a way how to increase this ?

Answer 1

I have created an arrayList , its unlimited. you can also manipulate it to your desire, its has all the basic features of an arraylist .

here is the code.

public class BetterArray<E> {

private E[] array;
private final int DEFAULT_ARRAY_SIZE = 10;
private int size;

private void copyArray(E[] copyFrom, E[] copyTo) {
    for (int i = 0; i <= copyFrom.length-1; i++) {
        copyTo[i] = copyFrom[i];
    }
}

private void createAnotherArray(){
    int newSize = 2 * array.length;
    E[] newArray = (E[])(new Object[newSize]);
    copyArray(array, newArray);
    array = newArray;
}

public BetterArray() {
    array = (E[]) (new Object[DEFAULT_ARRAY_SIZE]);
    this.size = 0;
}


public E get(int index){
    if(index < 0 || index > size){
        throw new RuntimeException("index not valid");
    }
    else{
        return array[index];
    }

}


public boolean isEmpty() {
    if (size == 0)
        return true;
    else
        return false;
}



public void insert(int position, E element) {
    if(isFull())
        createAnotherArray();

    E previous_temp = get(position);
    array[position]= element;
    for(int k = position+1; k<= size; k++){
        E current_temp = get(k);
        array[k] = previous_temp;
        previous_temp = current_temp;
    }
    size++;
}

public void append(E element) {
    insert(size, element);
 }

public void remove(int index){
    for (int i = index; i <= size-1; i++){
        array[i] = get(i+1);
    }
    size--;
}

public void shift(E element){
    insert(0, element);
}



public boolean isFull() {
    if (size == array.length)
        return true;
    return false;

}

public int size(){
    return size;
}


public String toString(){
    StringBuilder returnString = new StringBuilder();
    for(int i= 0; i <= size-1; i++){
        returnString.append(get(i).toString() + ", ");
    }
    return returnString.toString();
}


//  public int index(E element){
//      return 1;
//  }


public void reverse(){
    E temp_storage;
    int halfSize = (size/2) ;
    for (int k= 0; k<= halfSize; k++ ){
        temp_storage = array[k];
        array[k] = array[size-k-1];
        array[size-k-1]  = temp_storage;
    }

}



  }