public static boolean equal(Links[] l1, Links[] l2) { if (l1.length != l2.length) { return false; } for (int i = 0; i < l1.length; i++) { if (!equal(l1[i], l2[i])) { return false; } } return true; }
public static boolean equal(Links[] l1, Links[] l2) { if (l1.length != l2.length) { return false; } for (int i = 0; i < l1.length; i++) { if (!equal(l1[i], l2[i])) { return false; } } return true; }
public static boolean equal(Links[] l1, Links[] l2) { if (l1.length != l2.length) { return false; } for (int i = 0; i < l1.length; i++) { if (!equal(l1[i], l2[i])) { return false; } } return true; }
protected void linky(Links[] links, Links[] links2) { System.out.println("=== REZ === " + Arrays.toString(links)); System.out.println("=== EXP === " + Arrays.toString(links2)); isTrue(UTILS.equal(links, links2)); }
protected void neq(Links paths, Links notExpected) { if (verbose) { System.out.println("NOT EXPECTED: " + UTILS.toString(notExpected)); System.out.println(" - FOUND: " + UTILS.toString(paths)); } Assert.assertFalse(UTILS.equal(paths, notExpected)); }
protected void eqlinks(Links paths, Links expected) { if (verbose) { System.out.println("EXPECTED: " + UTILS.toString(expected)); System.out.println(" - FOUND: " + UTILS.toString(paths)); } Assert.assertTrue(UTILS.equal(paths, expected)); }
protected void linksEQ(Links[] links, Links[] expected) { if (verbose) { System.out.println("EXPECTED: " + U.text(expected)); System.out.println(" - FOUND: " + U.text(links)); } isTrue(UTILS.equal(links, expected)); }