public ArrayIntList() 
{
  
      this(10);
}

 public ArrayIntList(int initialCapacity) 
{
      elements = new int[initialCapacity];
}

 public  void add(int elem) 
{
      if (size == elements.length) ensureCapacity(size + 1);
      elements[size++] = elem;
}

 public  void add(int pos,
    int start,
    int end) 
{
      if (size + 3  > elements.length) ensureCapacity(size + 3);
      elements[size] = pos;
      elements[size+1] = start;
      elements[size+2] = end;
      size += 3;
}

 public int get(int index) 
{
      if (index  >= size) throwIndex(index);
      return elements[index];
}

 public int size() 
{
      return size;
}

 public int[] toArray(int stride) 
{
      int[] arr = new int[size() / stride];
      if (stride == 1) {
        System.arraycopy(elements, 0, arr, 0, size); // fast path
      } else { 
        for (int i=0, j=0; j <  size; i++, j += stride) arr[i] = elements[j];
      }
      return arr;
}

 public String toString(int stride) 
{
      int s = size() / stride;
      int len = Math.min(10, s); // avoid printing huge lists
      StringBuffer buf = new StringBuffer(4*len);
      buf.append("[");
      for (int i = 0; i <  len; i++) {
        buf.append(get(i*stride));
        if (i <  len-1) buf.append(", ");
      }
      if (len != s) buf.append(", ..."); // and some more...
      buf.append("]");
      return buf.toString();
}

returns the first few positions (without offsets); debug only