You can't array lengths are fixed at the time they are instantiated.

Use an ArrayList which internally creates new Array objects and copies the
objects at your array indexes between them as your size requirements change.
So why reinvent the wheel?

--
Mike W

   Use an ArrayList instead of an array.
http://java.sun.com/j2se/1.5.0/docs/api/java/util/ArrayList.html

   If there's a special reason you must use array, post it, and we'll
address actually creating arrays of the desired sizes.

   - Oliver

Here is an example of how you can do it:

    byte[] b;
    int size = 32;

    b = new byte[size];

    for(int c=0; c<size; c++) {
        b[c] = (byte) c;
    }

    System.out.println("Finished 1");
           
    size *= 2;
           
    b = new byte[size];
    for(int c=0; c<size; c++) {
        b[c] = (byte) c;
    }

    System.out.println("Finished 2");

But you should of course consider using ArrayList instead.

/tom

There are two techniques.  When it gets full, pause, allocate a bigger
array and copy over, and replace the original reference.

The second is to use an ArrayList which does this for you
automatically with extra overhead of method calls for every access.

The overhead is quite astounding. I am surprised it is not more of an
issue. People use ArrayList even when they know in advance the size
simply because they are more familiar with that idiom.