public class ListComparison {

    public static void main (String[] argv)
    {
        // Use a 10,000-insertions (repeat for 1000 samples).
	testInsert (1000, 10000);

        // Use a list with 100000 elements (repeat for 1000 samples).
	testSearch (1000, 100000);

        // Use a list with 100000 elements (repeat for 1000 samples).
	testGet (1000, 100000);
    }


    static void testInsert (int numTrials, int numElements)
    {
        // Evaluate the "insert" operation in a linked-list.

        // Repeat for given number of trials.
	double total = 0;
	for (int k=0; k<numTrials; k++) {

	    long startTime = System.currentTimeMillis();

	    // Make a list and add numElements to it.
	    OurLinkedList list = new OurLinkedList ();
	    for (int i=0; i<numElements; i++) {
		list.add (i);
	    }

	    long timeTaken = System.currentTimeMillis() - startTime;
	    total += timeTaken;

	}

        // This is the average insert time.
	double avg = total / numTrials;
	System.out.println ("Average insert time for linked list: " + avg);


        // Now repeat for an array list.

	total = 0;
	for (int k=0; k<numTrials; k++) {
	    long startTime = System.currentTimeMillis();
	    // Make a list and add numElements to it.
	    OurArrayList list = new OurArrayList ();
	    for (int i=0; i<numElements; i++) {
		list.add (i);
	    }
	    long timeTaken = System.currentTimeMillis() - startTime;
	    total += timeTaken;
	}

        // Average for the array list.
	avg = total / numTrials;
	System.out.println ("Average insert time for array list: " + avg);
    }



    static void testSearch (int numTrials, int numElements)
    {
	// First, create the data structures and add stuff.
	OurLinkedList linkedList = new OurLinkedList ();
	OurArrayList arrayList = new OurArrayList ();
	for (int i=0; i<numElements; i++) {
	    linkedList.add (i);
	    arrayList.add (i);
	}

	// Next make a list of search terms to use in the repeated sampling.
	int[] searchItems = new int [numTrials];
	for (int i=0; i<numTrials; i++) {
	    searchItems[i] = UniformRandom.uniform (0, numElements-1);
	}
	
	// Now do the linked list.
	double total = 0;
	for (int k=0; k<numTrials; k++) {
	    long startTime = System.currentTimeMillis();
	    // Do the searches.
	    if ( linkedList.contains (searchItems[k]) ) {
	    }
	    long timeTaken = System.currentTimeMillis() - startTime;
	    total += timeTaken;
	}
	double avg = total / numTrials;
	System.out.println ("Average search time for linked list: " + avg);

	// Next, the array list.
	total = 0;
	for (int k=0; k<numTrials; k++) {
	    long startTime = System.currentTimeMillis();
	    // Do the searches.
	    if ( arrayList.contains (searchItems[k]) ) {
	    }
	    long timeTaken = System.currentTimeMillis() - startTime;
	    total += timeTaken;
	}
	avg = total / numTrials;
	System.out.println ("Average search time for array list: " + avg);
    }


    static void testGet (int numTrials, int numElements)
    {
	// First, build data.
	OurLinkedList linkedList = new OurLinkedList ();
	OurArrayList arrayList = new OurArrayList ();
	for (int i=0; i<numElements; i++) {
	    linkedList.add (i);
	    arrayList.add (i);
	}

	// Next make a list of search terms.
	int[] getIndices = new int [numTrials];
	for (int i=0; i<numTrials; i++) {
	    getIndices[i] = UniformRandom.uniform (0, numElements-1);
	}
	
	// Now do the linked list.
	double total = 0;
	for (int k=0; k<numTrials; k++) {
	    long startTime = System.currentTimeMillis();
	    int m = linkedList.get (getIndices[k]);
	    long timeTaken = System.currentTimeMillis() - startTime;
	    total += timeTaken;
	}
	double avg = total / numTrials;
	System.out.println ("Average get time for linked list: " + avg);

	// Next, the array list.
	total = 0;
	for (int k=0; k<numTrials; k++) {
	    long startTime = System.currentTimeMillis();
	    int m = arrayList.get (getIndices[k]);
	    long timeTaken = System.currentTimeMillis() - startTime;
	    total += timeTaken;
	}
	avg = total / numTrials;
	System.out.println ("Average get time for array list: " + avg);
    }

}