// pass an empty instance sclass ListTester { LS l; // parameters int n = 1000; int idLength = 5; // Simple test run { assertEqualsVerbose(0, l.size()); for (int i = -1; i < 2; i++) { int _i = i ; assertException(r { l.get(_i) }); } l.add("hello"); assertEqualsVerbose(1, l.size()); assertException(r { l.get(-1) }); assertEqualsVerbose("hello", l.get(0)); assertException(r { l.get(1) }); Random random = predictableRandom(); // n random insertions, complete check new LS refl; l.clear(); repeat n { int i = random(random, l(refl)+1); S id = randomID(random, idLength); print("add " + i + " " + id); refl.add(i, id); l.add(i, id); assertEquals(l(l), l(refl)); } assertEqualsVerbose(l(l), l(refl)); for i over refl: assertEquals(l.get(i), refl.get(i)); // overwriting repeat n { int i = random(random, l(refl)); S id = randomID(random); print("set " + i + " " + id); assertEquals(l.set(i, id), refl.set(i, id)); assertEquals(l(l), l(refl)); } // n random deletions, check after each turn repeat n { int i = random(random, l(refl)); print("remove " + i); assertEquals(l.remove(i), refl.remove(i)); assertEqualsVerbose(l(l), l(refl)); for j over refl: assertEquals(l.get(j), refl.get(j)); } test2(); } void test2 { assertIndexOfAndContainsVerbose(l, "a", -1); l.add("a"); assertIndexOfAndContainsVerbose(l, "a", 0); assertIndexOfAndContainsVerbose(l, "b", -1); l.add("b"); assertIndexOfAndContainsVerbose(l, "a", 0); assertIndexOfAndContainsVerbose(l, "b", 1); l.add("a"); assertIndexOfAndContainsVerbose(l, "a", 0); l.remove(2); assertIndexOfAndContainsVerbose(l, "a", 0); l.remove("a"); assertIndexOfAndContainsVerbose(l, "a", -1); assertIndexOfAndContainsVerbose(l, "b", 0); l.clear(); addAll(l, "a", "b", "c", "d"); l.subList(1, 3).clear(); assertEquals(ll("a", "d"), cloneList(l)); LS sub = l.subList(1, 2); sub.set(0, "x"); assertEquals(1, sub.size()); // check modCount handling l.clear(); ok(); } void ok { infoBox(className(l) + " works (tested up to size " + n + ")! :)"); } }