Class InsertInOrderSpeedTest

lab07/tests/InsertInOrderSpeedTest.java:14–137

Performs a timing test on three different set implementations. For BSTMap purposes assumes that are pairs. @author Josh Hug @author Brendan Hu

 * @author Brendan Hu
 */
public class InsertInOrderSpeedTest {
    /**
     * 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);

        // borrow waitForPositiveInt(Scanner input) from InsertRandomSpeedTest
        System.out.println("This program inserts lexicographically "
                + "increasing Strings into Maps as <String, Integer> pairs.");

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

            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 strings into a Map61B in increasing order.
     * makes use of StringUtils.nextString(String s)
     */
    public static double insertInOrder(Map61B<String, Integer> map61B, int N) {
        Stopwatch sw = new Stopwatch();
        String s = "cat";
        for (int i = 0; i < N; i++) {
            s = StringUtils.nextString(s);
            map61B.put(s, i);
        }
        return sw.elapsedTime();
    }

    /**
     * Returns time needed to put N strings into TreeMap in increasing order.
     */
    public static double insertInOrder(TreeMap<String, Integer> ts, int N) {
        Stopwatch sw = new Stopwatch();
        String s = "cat";
        for (int i = 0; i < N; i++) {
            s = StringUtils.nextString(s);
            ts.put(s, i);
        }
        return sw.elapsedTime();
    }

    public static double insertInOrder(HashMap<String, Integer> ts, int N) {
        Stopwatch sw = new Stopwatch();
        String s = "cat";
        for (int i = 0; i < N; i++) {