Lines Matching +full:- +full:d
9 PetscInt d, n, maxdim = 4;
16 for (d = 0; d <= maxdim; d++) {
17 for (n = 0; n <= d + 2; n++) {
20 PetscCall(PetscDTBinomialInt(d + n, d, &Nk));
24 PetscCall(PetscDTIndexToBary(d + 1, n, k, btup));
25 for (j = 0, sum = 0; j < d + 1; j++) {
26 PetscCheck(btup[j] >= 0, PETSC_COMM_SELF, PETSC_ERR_PLIB, "PetscDTIndexToBary, d = %" PetscInt_FMT ", n = %" PetscInt_FMT ", k = %" PetscInt_FMT " negative entry", d, n, k);
29 PetscCheck(sum == n, PETSC_COMM_SELF, PETSC_ERR_PLIB, "PetscDTIndexToBary, d = %" PetscInt_FMT ", n = %" PetscInt_FMT ", k = %" PetscInt_FMT " incorrect sum", d, n, k);
30 PetscCall(PetscDTBaryToIndex(d + 1, n, btup, &kchk));
31 PetscCheck(kchk == k, PETSC_COMM_SELF, PETSC_ERR_PLIB, "PetscDTBaryToIndex, d = %" PetscInt_FMT ", n = %" PetscInt_FMT ", k = %" PetscInt_FMT " mismatch", d, n, k);
33 j = d;
34 while (j >= 0 && btup[j] == btupprev[j]) j--;
35 PetscCheck(j >= 0, PETSC_COMM_SELF, PETSC_ERR_PLIB, "PetscDTIndexToBary, d = %" PetscInt_FMT ", n = %" PetscInt_FMT ", k = %" PetscInt_FMT " equal to previous", d, n, k);
36 PetscCheck(btup[j] >= btupprev[j], PETSC_COMM_SELF, PETSC_ERR_PLIB, "PetscDTIndexToBary, d = %" PetscInt_FMT ", n = %" PetscInt_FMT ", k = %" PetscInt_FMT " less to previous", d, n, k);
37 } else PetscCall(PetscArraycpy(btupprev, btup, d + 1));
38 PetscCall(PetscDTIndexToGradedOrder(d, Nk - 1 - k, gtup));
39 PetscCall(PetscDTGradedOrderToIndex(d, gtup, &kchk));
40 PetscCheck(kchk == Nk - 1 - k, PETSC_COMM_SELF, PETSC_ERR_PLIB, "PetscDTGradedOrderToIndex, d = %" PetscInt_FMT ", n = %" PetscInt_FMT ", k = %" PetscInt_FMT " mismatch", d, n, Nk - 1 - k);
41 for (j = 0; j < d; j++) PetscCheck(gtup[j] == btup[d - 1 - j], PETSC_COMM_SELF, PETSC_ERR_PLIB, "PetscDTIndexToGradedOrder, d = %" PetscInt_FMT ", n = %" PetscInt_FMT ", k = %" PetscInt_FMT " incorrect", d, n, Nk - 1 - k);