Double List : Auto Growth Array « Collections Data Structure « Java

Double List

/* Copyright (C) 2002 Univ. of Massachusetts Amherst, Computer Science Dept.
   This file is part of "MALLET" (MAchine Learning for LanguagE Toolkit).
   This software is provided under the terms of the Common Public License,
   version 1.0, as published by  For further
   information, see the file `LICENSE' included with this distribution. */

   A dynamically growable list of doubles.
   @author Andrew McCallum <a href=""></a>

//package cc.mallet.util;

import java.util.Arrays;

public class DoubleList implements Serializable
  double[] data;
  int size;

  public DoubleList ()
    this (2);

  // Creates a list of zero size
  public DoubleList (int capacity)
    if (capacity < 2)
      capacity = 2; = new double[capacity];
    this.size = 0;

  public DoubleList (int size, double fillValue)
    int capacity = size;
    if (capacity < 2)
      capacity = 2; = new double[capacity];
    Arrays.fill (, fillValue);
    this.size = size;
  public DoubleList (double[] initialValues, int size)
  { = new double[initialValues.length];
    System.arraycopy (initialValues, 0,, 0, initialValues.length);
    this.size = size;

  public DoubleList (double[] initialValues)
    this (initialValues, initialValues.length);

  public DoubleList cloneDoubleList ()
    return new DoubleList (data, size);

  public Object clone ()
    return cloneDoubleList ();

  private void growIfNecessary (int index)
    int newDataLength = data.length;
    while (index >= newDataLength) {
      if (newDataLength < 100)
        newDataLength *= 2;
        newDataLength = (newDataLength * 3) / 2;
    if (newDataLength != data.length) {
      double[] newData = new double[newDataLength];
      System.arraycopy (data, 0, newData, 0, data.length);
      data = newData;

  public void add (double value)
    growIfNecessary (size);
    data[size++] = value;

  public double get (int index)
    if (index >= size)
      throw new IllegalArgumentException ("Index "+index+" out of bounds; size="+size);
    return data[index];

  public void set (int index, double value)
    growIfNecessary (index);
    data[index] = value;
    if (index >= size)
      size = index+1;

  // Serialization 
  private static final long serialVersionUID = 1;
  private static final int CURRENT_SERIAL_VERSION = 0;
  private void writeObject (ObjectOutputStream out) throws IOException {
    out.writeInt (CURRENT_SERIAL_VERSION);
    int size = data.length;
    for (int i=1; i<size; i++) {
  private void readObject (ObjectInputStream in) throws IOException, ClassNotFoundException {
    int version = in.readInt ();
    int len = in.readInt();
    data = new double[len];
    for (int i = 1; i<len; i++) {
      data[i] = in.readDouble();
    size = in.readInt();



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 Int Array
15.Dynamic Long Array
16.Int Array
17.Int Array List
18.ArrayList of float primitives
19.Fast Array
20.Extensible vector of bytes
21.Int Vector
22.A two dimensional Vector
23.Lazy List creation based on ArrayList
24.Append the given Object to the given array
25.Adds all the elements of the given arrays into a new array.
26.Simple object pool
27.A variable length Double Array: expanding and contracting its internal storage array as elements are added and removed.
28.Append item to array
29.A growable array of bytes
30.Doubles the size of an array
31.Adds the object to the array.
32.Concatenate arrays