FileDocCategorySizeDatePackage
Test.javaAPI DocExample7335Thu Jul 11 14:13:18 BST 2002tuning.list

Test

public class Test extends Object

Fields Summary
Constructors Summary
Methods Summary
public static voidforceGC()

/*testmemory(64);*/
public static longinsert0(java.util.List l, int repeat, java.lang.Object o, int nestedRepeat)

    long time = 0;
    for (int i = nestedRepeat; i > 0; i--)
    {
      try{l = (List) (l.getClass().newInstance());}catch(Exception e){e.printStackTrace();}
      time += insert0(l, repeat, o);
    }
    return time;
public static longinsert0(java.util.List l, int repeat, java.lang.Object o)

    long time = System.currentTimeMillis();
    for (int i = 0; i < repeat; i++)
      l.add(0, o);
    return System.currentTimeMillis() - time;
public static longinsert_last(java.util.List l, int repeat, java.lang.Object o, int nestedRepeat)

    long time = 0;
    for (int i = nestedRepeat; i > 0; i--)
    {
      try{l = (List) (l.getClass().newInstance());}catch(Exception e){e.printStackTrace();}
      time += insert_last(l, repeat, o);
    }
    return time;
public static longinsert_last(java.util.List l, int repeat, java.lang.Object o)

    long time = System.currentTimeMillis();
    for (int i = 0; i < repeat; i++)
      l.add(o);
    return System.currentTimeMillis() - time;
public static longinsert_mid(java.util.List l, int repeat, java.lang.Object o)

    long time = System.currentTimeMillis();
    for (int i = 0; i < repeat; i++)
      l.add(i/2, o);
    return System.currentTimeMillis() - time;
public static longinsert_mid(java.util.List l, int repeat, java.lang.Object o, int nestedRepeat)

    long time = 0;
    for (int i = nestedRepeat; i > 0; i--)
    {
      try{l = (List) (l.getClass().newInstance());}catch(Exception e){e.printStackTrace();}
      time += insert_mid(l, repeat, o);
    }
    return time;
public static voidmain(java.lang.String[] args)

    int multiple = args.length == 0 ? 1 : Integer.parseInt(args[0]);
    test1(multiple);
    System.out.println();
    test1(multiple);
public static voidtest1(int multiple)

    //Compare arraylist vs linkedlist insertion at 0, end, middle.
    Object element = new Object();
    int repeat_short = 100 * multiple;
    int repeat_medium = 10000 * multiple;
    int repeat_long = 1000000 * multiple;

    forceGC();
//    traversal(repeat_long, element); 

//    forceGC(); System.out.println("First Short ArrayList " + insert0(new ArrayList(), repeat_short, element, 10000));
    forceGC(); System.out.println("First Medium ArrayList " + insert0(new ArrayList(), repeat_medium, element, 100));
//    forceGC(); System.out.println("First Long ArrayList/10 " + insert0(new ArrayList(), repeat_long/10, element, 1));
//    forceGC(); System.out.println("First Short LinkedList " + insert0(new LinkedList (), repeat_short, element, 10000));
    forceGC(); System.out.println("First Medium LinkedList " + insert0(new LinkedList (), repeat_medium, element, 100));
//    forceGC(); System.out.println("First Long LinkedList " + insert0(new LinkedList (), repeat_long, element, 1));

//    forceGC(); System.out.println("Last Short ArrayList " + insert_last(new ArrayList(), repeat_short, element, 10000));
    forceGC(); System.out.println("Last Medium ArrayList " + insert_last(new ArrayList(), repeat_medium, element, 100));
//    forceGC(); System.out.println("Last Long ArrayList " + insert_last(new ArrayList(), repeat_long, element, 1));
//    forceGC(); System.out.println("Last Short LinkedList " + insert_last(new LinkedList (), repeat_short, element, 10000));
    forceGC(); System.out.println("Last Medium LinkedList " + insert_last(new LinkedList (), repeat_medium, element, 100));
//    forceGC(); System.out.println("Last Long LinkedList " + insert_last(new LinkedList (), repeat_long, element, 1));

//    forceGC(); System.out.println("Middle Short ArrayList " + insert_mid(new ArrayList(), repeat_short, element, 10000));
    forceGC(); System.out.println("Middle Medium ArrayList " + insert_mid(new ArrayList(), repeat_medium, element, 100));
//    forceGC(); System.out.println("Middle Long ArrayList/10 " + insert_mid(new ArrayList(), repeat_long/10, element, 1));
//    forceGC(); System.out.println("Middle Short LinkedList " + insert_mid(new LinkedList (), repeat_short, element, 10000));
    forceGC(); System.out.println("Middle Medium LinkedList " + insert_mid(new LinkedList (), repeat_medium, element, 100));
//    forceGC(); System.out.println("Middle Long LinkedList/100 " + insert_mid(new LinkedList (), repeat_long/100, element, 1));
public static inttestmemory(int megabytes)

                        if (megabytes > 1000)
                        {
                          System.out.println("forget it");
                          return -1;
                        }
                        Object[] memoryHolder = new Object[megabytes];
                        int count = 0;
                        try
                        {
                          for (; count < memoryHolder.length; count++)
                          {
                            memoryHolder[count] = new byte[1048576];
                          }
                        }
                        catch(OutOfMemoryError bounded){}
                        long highWater = Runtime.getRuntime().totalMemory();
                    //  System.out.println("High water in bytes: " + highWater);
                    //  System.out.println("Megabytes allocatable in megabytes: " + count);
                        memoryHolder = null; //release for GC
                        //might be a good idea to call System.gc() and Thread.sleep(2000)
                        //to give the GC time to happen. 
                        //We know we could allocate "count" megabytes and have a
                        //high water mark of "highWater". Return whichever you prefer.
                        return count;
public static voidtraversal(int size, java.lang.Object o)

    //init elementData
    Object[] elementData = new Object[size];
    for (int i = 0; i < size; i++)
      elementData[i] = o;

    long time = System.currentTimeMillis();
    int count = 0;
    for (int i = 0; i < size; i++)
      if(elementData[i] == null)
        count++;
    time = System.currentTimeMillis() - time;
    System.out.println("ArrayList internal traversal " + time);
    elementData = null;

    forceGC();

    //init nodes
    Node root = new Node(null, null, null);
    Node node = new Node(o, root, root);
    root.next = node;
    root.previous = node;
    for (int i = 1; i < size; i++)
    {
      node = new Node(o, root.next, root);
      root.next = node;
      node.next.previous = node;
    }


    node = root.next;
    count = 0;
    time = System.currentTimeMillis();
    for (int i = 0; i < size; i++, node = node.next)
      if (node.element == null)
        count++;
    time = System.currentTimeMillis() - time;
    System.out.println("LinkedList internal traversal " + time);
    root = node = null;