test cases for apply methods

Author: cicirello

src/test/java/org/cicirello/permutations/PermutationTestCases.java

@@ -43,6 +43,35 @@ public class PermutationTestCases {
 	// that use a source of randomness that is seedable.
 	private static final boolean disableChiSquareTests = true;
 
+	@Test
+	public void testUnaryOperator() {
+		Permutation p = new Permutation(10);
+		p.apply(perm -> { for (int i = 0; i < perm.length; i++) { perm[i] = i; }});
+		for (int i = 0; i < 10; i++) {
+			assertEquals(i, p.get(i));
+		}
+		p.apply(perm -> { for (int i = 0; i < perm.length; i++) { perm[perm.length-1-i] = i; }});
+		for (int i = 0; i < 10; i++) {
+			assertEquals(9-i, p.get(i));
+		}
+	}
+	
+	@Test
+	public void testBinaryOperator() {
+		Permutation p1 = new Permutation(10);
+		Permutation p2 = new Permutation(10);
+		p1.apply((perm1, perm2) -> { for (int i = 0; i < perm1.length; i++) { perm1[i] = i; perm2[perm1.length-1-i] = i; }}, p2);
+		for (int i = 0; i < 10; i++) {
+			assertEquals(i, p1.get(i));
+			assertEquals(9-i, p2.get(i));
+		}
+		p1.apply((perm1, perm2) -> { for (int i = 0; i < perm1.length; i++) { perm2[i] = i; perm1[perm1.length-1-i] = i; }}, p2);
+		for (int i = 0; i < 10; i++) {
+			assertEquals(i, p2.get(i));
+			assertEquals(9-i, p1.get(i));
+		}
+	}
+	
 	@Test
 	public void testZeroLengthPermutations() {
 		// different ways of constructing 0 length permutations.