92   static int hiddenStride(int[] a) {  in hiddenStride()  argument
96       for (int j = 0; j < a.length; j += i) {  in hiddenStride()
97         result += a[j];  in hiddenStride()
567     int[] a = new int[n];  in linearTriangularOnTwoArrayLengths()  local
568     for (int i = 0; i < a.length; i++) {  in linearTriangularOnTwoArrayLengths()
572         a[j] += 1;  in linearTriangularOnTwoArrayLengths()
576       verifyTriangular(a, b, i, n);  in linearTriangularOnTwoArrayLengths()
588     int[] a = new int[n];  in linearTriangularOnOneArrayLength()  local
589     for (int i = 0; i < a.length; i++) {  in linearTriangularOnOneArrayLength()
593         a[j] += 1;  in linearTriangularOnOneArrayLength()
597       verifyTriangular(a, b, i, n);  in linearTriangularOnOneArrayLength()
609     int[] a = new int[n];  in linearTriangularOnParameter()  local
614         a[j] += 1;  in linearTriangularOnParameter()
618       verifyTriangular(a, b, i, n);  in linearTriangularOnParameter()
632     int[] a = new int[n];  in linearTriangularStrictLower()  local
635         a[j] += 1;  in linearTriangularStrictLower()
638         a[j] += 1;  in linearTriangularStrictLower()
641         a[j] += 1;  in linearTriangularStrictLower()
644         a[j] += 1;  in linearTriangularStrictLower()
647     verifyTriangular(a);  in linearTriangularStrictLower()
660     int[] a = new int[n];  in linearTriangularStrictUpper()  local
663         a[j] += 1;  in linearTriangularStrictUpper()
666         a[j] += 1;  in linearTriangularStrictUpper()
669         a[j] += 1;  in linearTriangularStrictUpper()
672         a[j] += 1;  in linearTriangularStrictUpper()
675     verifyTriangular(a);  in linearTriangularStrictUpper()
679   private static void verifyTriangular(int[] a, int[] b, int m, int n) {  in verifyTriangular()  argument
680     expectEquals(n, a.length);  in verifyTriangular()
682       expectEquals(a[i], k);  in verifyTriangular()
692   private static void verifyTriangular(int[] a) {  in verifyTriangular()  argument
693     int n = a.length;  in verifyTriangular()
695       expectEquals(a[i], n + n);  in verifyTriangular()
708     int[] a = new int[200];  in linearTriangularOOB()  local
714           a[j] += 1;  in linearTriangularOOB()
718       return a;  in linearTriangularOOB()