Lines Matching refs:a
312 private static void CrossOverLoop(int a[], int b[]) { in CrossOverLoop() argument
314 for (int i = 0; i < a.length; i++) { in CrossOverLoop()
315 a[i] = b[20] - 7; in CrossOverLoop()
317 a[i] = b[20] - 7; in CrossOverLoop()
345 private static void CrossOverLoop2(Object a, Object b) { in CrossOverLoop2() argument
347 for (int i = 0; i < ((int[])a).length; i++) { in CrossOverLoop2()
348 ((int[])a)[i] = ((int[])b)[20] - 7; in CrossOverLoop2()
350 ((int[])a)[i] = ((int[])b)[20] - 7; in CrossOverLoop2()
545 int[] a = new int[ARRAY_SIZE]; in testVecReplicateScalar() local
546 for (int i = 0; i < a.length; i++) { in testVecReplicateScalar()
547 a[i] += 1; in testVecReplicateScalar()
549 for (int i = 0; i < a.length; i++) { in testVecReplicateScalar()
550 expectEquals(1, a[i]); in testVecReplicateScalar()
577 int[] a = new int[ARRAY_SIZE]; in testVecSetScalars() local
580 s+=a[i]; in testVecSetScalars()
582 expectEquals(a[0], 0); in testVecSetScalars()
654 int[] a = {1, 2, 3}; in testNoSelfDependantSchedNode() local
655 int[] b = new int[a.length]; in testNoSelfDependantSchedNode()
656 n = Math.min(n, a.length); in testNoSelfDependantSchedNode()
658 int j = a[i]; in testNoSelfDependantSchedNode()
687 int[] a = {1, 2, 3}; in testNonPreventingSchedulingCrossItersDeps() local
688 n = Math.min(n, a.length); in testNonPreventingSchedulingCrossItersDeps()
690 if (a[i] < a[i + 1]) { in testNonPreventingSchedulingCrossItersDeps()
691 int tmp = a[i]; in testNonPreventingSchedulingCrossItersDeps()
692 a[i] = a[i + 1]; in testNonPreventingSchedulingCrossItersDeps()
693 a[i + 1] = tmp; in testNonPreventingSchedulingCrossItersDeps()
696 expectEquals(a[0], 2); in testNonPreventingSchedulingCrossItersDeps()
697 expectEquals(a[1], 3); in testNonPreventingSchedulingCrossItersDeps()
698 expectEquals(a[2], 1); in testNonPreventingSchedulingCrossItersDeps()