Lines Matching refs:n
153 #define QuickSort1(FuncName, X, n, pivot, t1) \ argument
155 PetscCount i, j, p, l, r, hi = n - 1; \
156 if (n < 8) { \
157 for (i = 0; i < n; i++) { \
159 for (j = i + 1; j < n; j++) { \
176 #define QuickSortReverse1(FuncName, X, n, pivot, t1) \ argument
178 PetscCount i, j, p, l, r, hi = n - 1; \
179 if (n < 8) { \
180 for (i = 0; i < n; i++) { \
182 for (j = i + 1; j < n; j++) { \
198 #define QuickSort2(FuncName, X, Y, n, pivot, t1, t2) \ argument
200 PetscCount i, j, p, l, r, hi = n - 1; \
201 if (n < 8) { \
202 for (i = 0; i < n; i++) { \
204 for (j = i + 1; j < n; j++) { \
220 #define QuickSort3(FuncName, X, Y, Z, n, pivot, t1, t2, t3) \ argument
222 PetscCount i, j, p, l, r, hi = n - 1; \
223 if (n < 8) { \
224 for (i = 0; i < n; i++) { \
226 for (j = i + 1; j < n; j++) { \
258 PetscErrorCode PetscSortedInt(PetscCount n, const PetscInt X[], PetscBool *sorted) in PetscSortedInt() argument
261 if (n) PetscAssertPointer(X, 2); in PetscSortedInt()
263 PetscSorted(n, X, *sorted); in PetscSortedInt()
283 PetscErrorCode PetscSortedInt64(PetscCount n, const PetscInt64 X[], PetscBool *sorted) in PetscSortedInt64() argument
286 if (n) PetscAssertPointer(X, 2); in PetscSortedInt64()
288 PetscSorted(n, X, *sorted); in PetscSortedInt64()
310 PetscErrorCode PetscSortInt(PetscCount n, PetscInt X[]) in PetscSortInt() argument
315 if (n) PetscAssertPointer(X, 2); in PetscSortInt()
316 PetscCall(PetscIntCast(n, &N)); in PetscSortInt()
337 PetscErrorCode PetscSortInt64(PetscCount n, PetscInt64 X[]) in PetscSortInt64() argument
342 if (n) PetscAssertPointer(X, 2); in PetscSortInt64()
343 QuickSort1(PetscSortInt64, X, n, pivot, t1); in PetscSortInt64()
363 PetscErrorCode PetscSortCount(PetscCount n, PetscCount X[]) in PetscSortCount() argument
368 if (n) PetscAssertPointer(X, 2); in PetscSortCount()
369 QuickSort1(PetscSortCount, X, n, pivot, t1); in PetscSortCount()
386 PetscErrorCode PetscSortReverseInt(PetscCount n, PetscInt X[]) in PetscSortReverseInt() argument
391 if (n) PetscAssertPointer(X, 2); in PetscSortReverseInt()
392 QuickSortReverse1(PetscSortReverseInt, X, n, pivot, t1); in PetscSortReverseInt()
412 PetscErrorCode PetscSortedRemoveDupsInt(PetscInt *n, PetscInt X[]) in PetscSortedRemoveDupsInt() argument
414 PetscInt i, s = 0, N = *n, b = 0; in PetscSortedRemoveDupsInt()
417 PetscAssertPointer(n, 1); in PetscSortedRemoveDupsInt()
418 PetscCheckSorted(*n, X); in PetscSortedRemoveDupsInt()
425 *n = N - s; in PetscSortedRemoveDupsInt()
445 PetscErrorCode PetscSortedCheckDupsInt(PetscCount n, const PetscInt X[], PetscBool *flg) in PetscSortedCheckDupsInt() argument
450 PetscCheckSorted(n, X); in PetscSortedCheckDupsInt()
452 for (i = 0; i < n - 1; i++) { in PetscSortedCheckDupsInt()
477 PetscErrorCode PetscSortedCheckDupsCount(PetscCount n, const PetscCount X[], PetscBool *flg) in PetscSortedCheckDupsCount() argument
482 PetscCheckSorted(n, X); in PetscSortedCheckDupsCount()
484 for (i = 0; i < n - 1; i++) { in PetscSortedCheckDupsCount()
509 PetscErrorCode PetscSortRemoveDupsInt(PetscInt *n, PetscInt X[]) in PetscSortRemoveDupsInt() argument
512 PetscAssertPointer(n, 1); in PetscSortRemoveDupsInt()
513 PetscCall(PetscSortInt(*n, X)); in PetscSortRemoveDupsInt()
514 PetscCall(PetscSortedRemoveDupsInt(n, X)); in PetscSortRemoveDupsInt()
535 PetscErrorCode PetscFindInt(PetscInt key, PetscCount n, const PetscInt X[], PetscInt *loc) in PetscFindInt() argument
541 if (!n) { in PetscFindInt()
546 PetscCall(PetscIntCast(n, &hi)); in PetscFindInt()
574 PetscErrorCode PetscFindCount(PetscCount key, PetscCount n, const PetscCount X[], PetscCount *loc) in PetscFindCount() argument
580 if (!n) { in PetscFindCount()
585 hi = n; in PetscFindCount()
612 PetscErrorCode PetscCheckDupsInt(PetscInt n, const PetscInt X[], PetscBool *dups) in PetscCheckDupsInt() argument
619 if (n) PetscAssertPointer(X, 2); in PetscCheckDupsInt()
622 if (n > 1) { in PetscCheckDupsInt()
624 PetscCall(PetscHSetIResize(ht, n)); in PetscCheckDupsInt()
625 for (i = 0; i < n; i++) { in PetscCheckDupsInt()
654 PetscErrorCode PetscFindMPIInt(PetscMPIInt key, PetscCount n, const PetscMPIInt X[], PetscInt *loc) in PetscFindMPIInt() argument
656 PetscCount lo = 0, hi = n; in PetscFindMPIInt()
660 if (!n) { in PetscFindMPIInt()
690 PetscErrorCode PetscSortIntWithArray(PetscCount n, PetscInt X[], PetscInt Y[]) in PetscSortIntWithArray() argument
695 QuickSort2(PetscSortIntWithArray, X, Y, n, pivot, t1, t2); in PetscSortIntWithArray()
715 PetscErrorCode PetscSortIntWithArrayPair(PetscCount n, PetscInt X[], PetscInt Y[], PetscInt Z[]) in PetscSortIntWithArrayPair() argument
720 QuickSort3(PetscSortIntWithArrayPair, X, Y, Z, n, pivot, t1, t2, t3); in PetscSortIntWithArrayPair()
739 PetscErrorCode PetscSortIntWithMPIIntArray(PetscCount n, PetscInt X[], PetscMPIInt Y[]) in PetscSortIntWithMPIIntArray() argument
745 QuickSort2(PetscSortIntWithMPIIntArray, X, Y, n, pivot, t1, t2); in PetscSortIntWithMPIIntArray()
764 PetscErrorCode PetscSortIntWithCountArray(PetscCount n, PetscInt X[], PetscCount Y[]) in PetscSortIntWithCountArray() argument
770 QuickSort2(PetscSortIntWithCountArray, X, Y, n, pivot, t1, t2); in PetscSortIntWithCountArray()
793 PetscErrorCode PetscSortIntWithIntCountArrayPair(PetscCount n, PetscInt X[], PetscInt Y[], PetscCou… in PetscSortIntWithIntCountArrayPair() argument
799 QuickSort3(PetscSortIntWithIntCountArrayPair, X, Y, Z, n, pivot, t1, t2, t3); in PetscSortIntWithIntCountArrayPair()
819 PetscErrorCode PetscSortedMPIInt(PetscCount n, const PetscMPIInt X[], PetscBool *sorted) in PetscSortedMPIInt() argument
822 PetscSorted(n, X, *sorted); in PetscSortedMPIInt()
844 PetscErrorCode PetscSortMPIInt(PetscCount n, PetscMPIInt X[]) in PetscSortMPIInt() argument
849 QuickSort1(PetscSortMPIInt, X, n, pivot, t1); in PetscSortMPIInt()
869 PetscErrorCode PetscSortRemoveDupsMPIInt(PetscInt *n, PetscMPIInt X[]) in PetscSortRemoveDupsMPIInt() argument
871 PetscInt s = 0, N = *n, b = 0; in PetscSortRemoveDupsMPIInt()
881 *n = N - s; in PetscSortRemoveDupsMPIInt()
900 PetscErrorCode PetscSortMPIIntWithArray(PetscCount n, PetscMPIInt X[], PetscMPIInt Y[]) in PetscSortMPIIntWithArray() argument
905 QuickSort2(PetscSortMPIIntWithArray, X, Y, n, pivot, t1, t2); in PetscSortMPIIntWithArray()
927 PetscErrorCode PetscSortMPIIntWithIntArray(PetscCount n, PetscMPIInt X[], PetscInt Y[]) in PetscSortMPIIntWithIntArray() argument
933 QuickSort2(PetscSortMPIIntWithIntArray, X, Y, n, pivot, t1, t2); in PetscSortMPIIntWithIntArray()
952 PetscErrorCode PetscSortIntWithScalarArray(PetscCount n, PetscInt X[], PetscScalar Y[]) in PetscSortIntWithScalarArray() argument
958 QuickSort2(PetscSortIntWithScalarArray, X, Y, n, pivot, t1, t2); in PetscSortIntWithScalarArray()
980 PetscErrorCode PetscSortIntWithDataArray(PetscCount n, PetscInt X[], void *Y, size_t size, void *t2) in PetscSortIntWithDataArray() argument
983 PetscCount hi = n - 1; in PetscSortIntWithDataArray()
987 if (n < 8) { in PetscSortIntWithDataArray()
988 for (PetscCount i = 0; i < n; i++) { in PetscSortIntWithDataArray()
990 for (PetscCount j = i + 1; j < n; j++) { in PetscSortIntWithDataArray()
1038 …rray(PetscInt an, const PetscInt aI[], PetscInt bn, const PetscInt bI[], PetscInt *n, PetscInt **L) in PetscMergeIntArray() argument
1072 *n = k; in PetscMergeIntArray()
1103 …cInt aJ[], PetscInt bn, const PetscInt bI[], const PetscInt bJ[], PetscInt *n, PetscInt *L[], Pets… in PetscMergeIntArrayPair() argument
1111 *n = n_; in PetscMergeIntArrayPair()
1161 …cInt an, const PetscMPIInt aI[], PetscInt bn, const PetscMPIInt bI[], PetscInt *n, PetscMPIInt **L) in PetscMergeMPIIntArray() argument
1174 *n = k; in PetscMergeMPIIntArray()
1202 PetscErrorCode PetscProcessTree(PetscInt n, const PetscBool mask[], const PetscInt parentid[], Pets… in PetscProcessTree() argument
1209 for (i = 0; i < n; i++) { in PetscProcessTree()
1215 for (i = 0; i < n; i++) { in PetscProcessTree()
1220 PetscCall(PetscCalloc1(n, &level)); in PetscProcessTree()
1225 for (i = 0; i < n; i++) { in PetscProcessTree()
1231 for (i = 0; i < n; i++) { in PetscProcessTree()
1238 for (i = 0; i < n; i++) { in PetscProcessTree()
1249 for (i = 0; i < n; i++) { in PetscProcessTree()
1267 PetscCall(PetscMalloc1(n, &column)); in PetscProcessTree()
1298 PetscErrorCode PetscParallelSortedInt(MPI_Comm comm, PetscInt n, const PetscInt keys[], PetscBool *… in PetscParallelSortedInt() argument
1308 if (n) { in PetscParallelSortedInt()
1312 for (i = 1; i < n; i++) { in PetscParallelSortedInt()
1317 if (i < n) sorted = PETSC_FALSE; in PetscParallelSortedInt()