Class InsertRandomSpeedTest

lab07/tests/InsertRandomSpeedTest.java:10–156

Performs a timing test on three different set implementations. @author Josh Hug @author Brendan Hu

 *  @author Brendan Hu
 */
public class InsertRandomSpeedTest {
    /**
     Requests user input and performs tests of three different set
     implementations. ARGS is unused.
     */
    public static void main(String[] args) {
        Scanner input = new Scanner(System.in);

        System.out.println("This program inserts random "
                + "Strings of length L "
                + "into different types of maps "
                + "as <String, Integer> pairs.");
        System.out.print("Please enter desired length of each string: ");
        int L = waitForPositiveInt(input);

        String repeat;
        do {
            System.out.print("\nEnter # strings to insert into the maps: ");
            int N = waitForPositiveInt(input);
            timeRandomMap61B(new ULLMap<>(), N, L);
            timeRandomMap61B(new BSTMap<>(), N, L);
            timeRandomTreeMap(new TreeMap<>(), N, L);
            timeRandomHashMap(new HashMap<>(), N, L);

            System.out.print("Would you like to try more timed-tests? (y/n)");
            repeat = input.nextLine();
        } while (!repeat.equalsIgnoreCase("n") && !repeat.equalsIgnoreCase("no"));
        input.close();
    }

    /** Returns time needed to put N random strings of length L into the
     * Map61B 61bMap. */
    public static double insertRandom(Map61B<String, Integer> map61B, int N, int L) {
        Stopwatch sw = new Stopwatch();
        String s;
        for (int i = 0; i < N; i++) {
            s = StringUtils.randomString(L);
            map61B.put(s, i);
        }
        return sw.elapsedTime();
    }

    /** Returns time needed to put N random strings of length L into the
     * given TreeMap. */
    public static double insertRandom(TreeMap<String, Integer> treeMap, int N, int L) {
        Stopwatch sw = new Stopwatch();
        String s;
        for (int i = 0; i < N; i++) {
            s = StringUtils.randomString(L);
            treeMap.put(s, i);
        }
        return sw.elapsedTime();
    }

    /** Returns time needed to put N random strings of length L into the
     * HashMap treeMap. */
    public static double insertRandom(HashMap<String, Integer> treeMap, int N, int L) {
        Stopwatch sw = new Stopwatch();