VECTORS

// VarArgs.java
// William J. Pervin
// 123-45-6789
// CS 3336
//
/*
	This material comes from "Core Java" by Cornell & Hortsmann, PH 1996
	Vectors are a data structure described on pp. 935ff of Deitel

	Vectors are array-like objects that can grow and shrink.
	They do not have to be homogeneous like arrays but can only hold Objects.
*/

// Vectors are in java.util:
import java.util.Vector;		// Don't forget the ;

// Here is our test program (Daconta p.69):
class VarArgs
{
	static long sum(Vector ints)
	{	
		long total = 0;
		for (int i=0; i < ints.size(); i++)
			{total += ((Integer)ints.elementAt(i)).intValue();}
		return total;
	}	

	public static void main(String[] args)
	{
		Vector intVec = new Vector(3);
		intVec.addElement(new Integer(5));
		intVec.addElement(new Integer(10));
		intVec.addElement(new Integer(20));
		intVec.addElement(new Integer(30));
		long theTot = sum(intVec);
		System.out.println("The total is " + theTot);
	}
}

/*
	Constructors:
		Vector()			Empty Vector with 10 elements capacity; 
						doubles when necessary
		Vector(int iC)  		Initally iC element capacity; 
						doubles when necessary
		Vector(int iC, int cI)		ci is the amount by which capacity grows from iC

	Methods:

		void addElement(Object obj)
		int size()            // How many are in the Vector
		int capacity()        // How many could fit in the Vector
		void trimToSize()

		void setElementAt(Object obj, int index)          0<=index<=size()-1
		Object elementAt(int index)                       0<=index<=size()-1
		void insertElementAt(Object obj, int index)       0<=index<=size()
		void removeElementAt(int index)                   0<=index<=size()-1

		void trimToSize()
		boolean contains(Object obj)
		void copyInto(Object[] anArray)		vector copied into array
		Object firstElement()
		Object lastElement()
		int indexOf(Object obj)			(-1 if not found)
		int indexOf(Object obj, int index)	start at index
		boolean isEmpty()
		String toString()

	Implements:
		Cloneable

*/