fig1-4.java

数据结构与算法Java语言版（美）Adam Drozdek著

import java.io.*;
import java.util.Vector;

class Node {
    Node(String s, int a) {
        name = s;
        age = a;
    }
    Node() {
        this("",0);
    }
    public boolean equals(Object p) {
        return name.equals(((Node)p).name);
    }
    public String toString() {
        return "(" + name + ", " + age + ") ";
    }
    String name;
    int age;
}

class TestVectors {
    static void printVector(Vector v, String s) {
        System.out.print(s + ":  ");
        for (int i = 0; i != v.size(); i++)
            System.out.print(v.elementAt(i) + "  ");
        System.out.println();
    }
    public static void main(String a[]) {
        Vector v1 = new Vector();            // v1 = [], size = 0, capacity = 10
        System.out.println(v1.capacity() +  " " + v1.size());
	for (int j = 1; j <= 5; j++)
            v1.addElement(new Integer(j));   // v1 = [1, 2, 3, 4, 5], size = 5, capacity = 10
        System.out.println("v1 = " + v1);
	printVector(v1,"v1");
        System.out.println(v1.capacity() +  " " + v1.size());
        Integer i = new Integer(3);
        System.out.println(v1.indexOf(i) + " " + v1.indexOf(i,4));    // 2 -1
        System.out.println(v1.contains(i) + " " + v1.lastIndexOf(i)); // true 2
        Vector v2 = new Vector(3,4);         // v2 = [], size = 0, capacity = 3
        for (int j = 4; j <= 8; j++)
            v2.addElement(new Integer(j));   // v2 = [4, 5, 6, 7, 8], size = 5, capacity = 7
        System.out.println(v2.capacity() +  " " + v2.size());
        v2.ensureCapacity(9);                // v2 = [4, 5, 6, 7, 8], size = 5, capacity = 11
        System.out.println(v2.capacity() +  " " + v2.size());
	printVector(v2,"v2");	
        Vector v3 = new Vector(2);           // v3 = [], size = 0, capacity = 2
        System.out.println(v3.capacity() +  " " + v3.size());
        v3.setSize(4);                       // v3 = [null, null, null, null], size = cap = 4
	printVector(v3,"v3");
        System.out.println(v3.capacity() +  " " + v3.size()); // 4 4
        v3.setElementAt(new Integer(9),1);   // v3 = [null, null, null, 9]
        v3.setElementAt(new Integer(5),3);   // v3 = [null, 9, null, 5]
        v3.insertElementAt(v3.elementAt(3),1); // v3 = [null, 5, 9, null, 5]
        System.out.println(v3.indexOf(i) + "|" + v3.contains(i));
        System.out.println(v3.capacity() +  " " + v3.size()); // 8 5
        printVector(v3,"v3");
        v3.ensureCapacity(9);                // v3 = [null, 5, 9, null, 5], size = 5, cap = 16
        System.out.println(v3.capacity() +  " " + v3.size());
	printVector(v3,"v3");
        v3.removeElement(new Integer(9));    // v3 = [null, 5, null, 5]
        v3.removeElementAt(v3.size()-2);     // v3 = [null, 5, 5]
        printVector(v3,"v3");
        java.util.Enumeration ev = v3.elements();
        while (ev.hasMoreElements())
            System.out.print(ev.nextElement() + " ");
        System.out.println();
        printVector(v3,"v3");
        v3.removeElementAt(0);               // v3 = [5, 5]
        v3.addAll(v1);                       // v3 = [5, 5, 1, 2, 3, 4, 5]
        printVector(v3,"v3");
        v3.removeAll(v2);                    // v3 = [1, 2, 3] = v3 - v2
        printVector(v3,"v3");
        v3.addAll(2,v1);                     // v3 = [1, 2, 1, 2, 3, 4, 5, 3]
        printVector(v3,"v3");
        v3.retainAll(v2);                    // v3 = [4, 5] = intersection(v3,v2)
        printVector(v3,"v3");
        v1.subList(1,3).clear();             // v1 = [1, 4, 5]
        printVector(v1,"v1");
        Vector v4 = new Vector(), v5;
        v4.addElement(new Node("Jill",23));
        v5 = (Vector) v4.clone();            // v4 = [(Jill, 23)]
        printVector(v4,"v4");
        ((Node)v5.firstElement()).age = 34;  // v4 = v5 = [(Jill, 34)]
        printVector(v4,"v4");
        printVector(v5,"v5");
    }
}