Searched refs:nonIntersectingFace (Results 1 – 1 of 1) sorted by relevance
1190 PetscInt nonIntersectingFace = -1; in DMPlexComputeGridHash_Internal() local1191 if (faces[0] == faces[1]) nonIntersectingFace = 2; in DMPlexComputeGridHash_Internal()1192 if (faces[0] == faces[2]) nonIntersectingFace = 1; in DMPlexComputeGridHash_Internal()1193 if (faces[1] == faces[2]) nonIntersectingFace = 0; in DMPlexComputeGridHash_Internal()1194 if (nonIntersectingFace >= 0) { in DMPlexComputeGridHash_Internal()1196 if (!lowerInt[nonIntersectingFace] && !upperInt[nonIntersectingFace]) continue; in DMPlexComputeGridHash_Internal()1198 for (PetscInt ip = 0; ip < lowerInt[nonIntersectingFace]; ++ip) { in DMPlexComputeGridHash_Internal()1199 …im + nonIntersectingFace] > lp[nonIntersectingFace] - PETSC_SMALL || lowerIntPoints[plane][ip * cd… in DMPlexComputeGridHash_Internal()1201 for (PetscInt ip = 0; ip < upperInt[nonIntersectingFace]; ++ip) { in DMPlexComputeGridHash_Internal()1202 …im + nonIntersectingFace] > lp[nonIntersectingFace] - PETSC_SMALL || upperIntPoints[plane][ip * cd… in DMPlexComputeGridHash_Internal()