Lines Matching refs:in2
966 static void Merge3SortedArrays(PetscInt size1, PetscInt *in1, PetscInt size2, PetscInt *in2, PetscI… in Merge3SortedArrays() argument
972 if (in1[i] < in2[j] && in1[i] < in3[k]) { in Merge3SortedArrays()
974 } else if (in2[j] < in1[i] && in2[j] < in3[k]) { in Merge3SortedArrays()
975 out[l++] = in2[j++]; in Merge3SortedArrays()
976 } else if (in3[k] < in1[i] && in3[k] < in2[j]) { in Merge3SortedArrays()
978 } else if (in1[i] == in2[j] && in1[i] < in3[k]) { in Merge3SortedArrays()
981 } else if (in1[i] == in3[k] && in1[i] < in2[j]) { in Merge3SortedArrays()
984 } else if (in3[k] == in2[j] && in2[j] < in1[i]) { in Merge3SortedArrays()
985 out[l++] = in2[j]; in Merge3SortedArrays()
987 } else if (in1[i] == in2[j] && in1[i] == in3[k]) { in Merge3SortedArrays()
995 if (in1[i] < in2[j]) { in Merge3SortedArrays()
997 } else if (in1[i] > in2[j]) { in Merge3SortedArrays()
998 out[l++] = in2[j++]; in Merge3SortedArrays()
1017 if (in3[k] < in2[j]) { in Merge3SortedArrays()
1019 } else if (in3[k] > in2[j]) { in Merge3SortedArrays()
1020 out[l++] = in2[j++]; in Merge3SortedArrays()
1029 while (j < size2) out[l++] = in2[j++]; in Merge3SortedArrays()