Dynamic Int Array : Auto Growth Array « Collections Data Structure « Java

Dynamic Int Array

Copyright (C) 2007  Mobixess Inc. http://www.java-objects-database.com

This file is part of the JODB (Java Objects Database) open source project.

JODB is free software; you can redistribute it and/or modify it under
the terms of version 2 of the GNU General Public License as published
by the Free Software Foundation.

JODB is distributed in the hope that it will be useful, but WITHOUT ANY
WARRANTY; without even the implied warranty of MERCHANTABILITY or
for more details.

You should have received a copy of the GNU General Public License along
with this program; if not, write to the Free Software Foundation, Inc.,
59 Temple Place - Suite 330, Boston, MA  02111-1307, USA. 

public class DynamicIntArray {
    final static int DEFAULT_CHUNK_SIZE = 256;
    final static int DEFAULT_CHUNKS = 16;

    private int _chunkSize;
    private int[][] _data;
    private int _length;

    public DynamicIntArray() {

    public DynamicIntArray(int chunkSize) {
        _chunkSize = chunkSize;
        _data = new int[DEFAULT_CHUNKS][];

    public boolean isEmpty() {
        return (_length == 0);

    private void ensureCapacity(int index) {
        if (index >= _length) {
            int i = index / _chunkSize;
            if (i >= _data.length) {
                // grow by 50%
                int new_size = (i * 3) / 2 + 1;
                int[][] newChunk = new int[new_size][];
                System.arraycopy(_data, 0, newChunk, 0, _data.length);
                _data = newChunk;
            _length = index + 1;

    public int get(int index) {
        if (index >= _length) {
            throw new IndexOutOfBoundsException("Index " + index
                    + " is outside of 0.." + (_length - 1));
        int i = index / _chunkSize;
        int j = index % _chunkSize;
        if (_data[i] == null) {
            return 0;
        } else {
            return _data[i][j];

    public void set(int index, int value) {
        int i = index / _chunkSize;
        int j = index % _chunkSize;
        if (_data[i] == null) {
            _data[i] = new int[_chunkSize];
        _data[i][j] = value;

    public int size() {
        return _length;

    public String toString() {
        int i;
        StringBuffer sb = new StringBuffer(_length * 4);
        int l = _length - 1;
        for (i = 0; i < l; i++) {
        return sb.toString();


Related examples in the same category

1.Growable int[]
2.Your own auto-growth Array
3.Long Vector
4.Int Vector (from java-objects-database)
5.ArrayList of int primitives
6.ArrayList of long primitives
7.ArrayList of short primitives
8.ArrayList of double primitives
9.ArrayList of boolean primitives
10.ArrayList of char primitives
11.ArrayList of byte primitives
12.Growable String array with type specific access methods.
13.Auto Size Array
14.Dynamic Long Array
15.Int Array
16.Int Array List
17.ArrayList of float primitives
18.Fast Array
19.Extensible vector of bytes
20.Int Vector
21.A two dimensional Vector
22.Lazy List creation based on ArrayList
23.Append the given Object to the given array
24.Adds all the elements of the given arrays into a new array.
25.Simple object pool
26.A variable length Double Array: expanding and contracting its internal storage array as elements are added and removed.
27.Append item to array
28.A growable array of bytes
29.Doubles the size of an array
30.Adds the object to the array.
31.Concatenate arrays
32.Double List