temp=CustomerMaker.quickPassQueue.get(0);//獲得首元素
  CustomerMaker.quickPassQueue.remove(0);//刪除首元素

 quickPassQueue.add();在末尾添加元素
----演示程序-----

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

public class test
{
Vector v = new Vector();

public void testMethod(){
  v.add("a");
  v.add("b");
  v.add("c");

  System.out.println("\n原來(lái)的vecotr");
  for(int i=0;i<v.size();i++){
   System.out.println("\n"+" index is: "+ i + " element is: " +v.get(i));
  }

  v.remove(0);

  System.out.println("\n去掉一個(gè)vector中第一個(gè)元素");
  for(int i=0;i<v.size();i++){
   System.out.println("\n"+" index is: "+ i + " element is: " +v.get(i));
  }
}

public static void main(String[] args)
{
  test t = new test();
  t.testMethod();
  System.out.println("Hello World!");
}
}
-----------------排序程序------------------------------
import java.util.*;

class MyCompare implements Comparator //實(shí)現(xiàn)Comparator，定義自己的比較方法
{
public int compare(Object o1, Object o2) {
Elem e1=(Elem)o1;
Elem e2=(Elem)o2;

if(e1.get() > e2.get())//這樣比較是降序,如果把-1改成1就是升序.
{
   return -1;
}
else if(e1.get()<e2.get())
{
   return 1;
}
else
{
   return 0;
}
}
}

class Elem {
private int iVal;

public Elem(int i) {
   this.iVal = i;
}

public int get() {
   return this.iVal;
}
}

public class Vector1 {
public static void main(String[] args) {
   List v = new Vector();
   v.add(new Elem(1));
   v.add(new Elem(22));
   v.add(new Elem(3));
   v.add(new Elem(14));
   Comparator ct = new MyCompare();
   Collections.sort(v, ct);
   for (int i = 0; i < v.size(); i++)
    System.out.println(((Elem) v.get(i)).get());

}

}