test.java

来自「Practical Java也是一本和J2ME手机游戏开发相关的书」· Java 代码 · 共 83 行

class Stack
{
  private int[] intArr;
  private int index;

  Stack(int v)
  {
    intArr = new int[v];
  }

  public int top()
  {
    return intArr[0];
  }

  public void push(int val)
  {
    intArr[index] = val;
    index++;
  }

  public int pop()
  {
    index--;
    return intArr[index];
  }

  public boolean contains(int val)
  {
    int size = intArr.length;
    boolean found = false;
    for (int i=0;i<size;i++)
    {
      if (intArr[i] == val)
      {
        found = true;
        break;
      }
    }
    return found;
  }
}

class Test extends Thread
{
  private Stack stack;

  Test(int v)
  {
    stack = new Stack(v);
  }

  public static void main(String args[])
  {
    int val=Integer.parseInt(args[0]);
    Test t = new Test(val);

    long start = System.currentTimeMillis();
    for (int i=0;i<val;i++)
      t.stack.push(i);
    long end = System.currentTimeMillis();
    System.out.println("non-syncpush " + (end-start));

    start = System.currentTimeMillis();
    for (int i=0;i<val;i++)
      t.stack.top();
    end = System.currentTimeMillis();
    System.out.println("non-synctop " + (end-start));

    start = System.currentTimeMillis();
    for (int i=0;i<val;i++)
      t.stack.pop();
    end = System.currentTimeMillis();
    System.out.println("non-syncpop " + (end-start));

    start = System.currentTimeMillis();
    for (int i=0;i<val;i++)
      t.stack.contains(i);
    end = System.currentTimeMillis();
    System.out.println("non-synccontains " + (end-start));
  }
}