51     if (Pmin.z > Pmax.z)  in Normalize()
52         ::std::swap(Pmin.z, Pmax.z);  in Normalize()
73         if (arrayPoint[i].z < Pmin.z)  in Set()
74             Pmin.z = arrayPoint[i].z;  in Set()
75         else if (arrayPoint[i].z > Pmax.z)  in Set()
76             Pmax.z = arrayPoint[i].z;  in Set()
94     b0 = M->f._02 * box->Pmin.z;  in Set()
95     b1 = M->f._02 * box->Pmax.z;  in Set()
109     b0 = M->f._12 * box->Pmin.z;  in Set()
110     b1 = M->f._12 * box->Pmax.z;  in Set()
124     b0 = M->f._22 * box->Pmin.z;  in Set()
125     b1 = M->f._22 * box->Pmax.z;  in Set()
136     Pmin.z = z0;  in Set()
140     Pmax.z = z1;  in Set()
178     P[0].x = left; P[0].y = top; P[0].z = -n;  in Set()
181     P[1].x = right; P[1].y = top; P[1].z = -n;  in Set()
184     P[2].x = right; P[2].y = bottom; P[2].z = -n;  in Set()
187     P[3].x = left; P[3].y = bottom; P[3].z = -n;  in Set()
190     P[4].x = f_n * left; P[4].y = f_n * top; P[4].z = -f;  in Set()
193     P[5].x = f_n * right; P[5].y = f_n * top; P[5].z = -f;  in Set()
196     P[6].x = f_n * right; P[6].y = f_n * bottom; P[6].z = -f;  in Set()
199     P[7].x = f_n * left; P[7].y = f_n * bottom; P[7].z = -f;  in Set()
360     zMinusC = vertices[0].z - P->z;  in DistSqPoint3ToPolyline3()
368     zNextMinusC = vertices[1].z - P->z;  in DistSqPoint3ToPolyline3()
417             zNextMinusC = vertices[i + 2].z - P->z;  in DistSqPoint3ToPolyline3()
464     vv = v = P->z;  in DistSqPoint3ToAABB()
465     if (v < B->Pmin.z)  in DistSqPoint3ToAABB()
467         sqDist += (B->Pmin.z - v) * (B->Pmin.z - v);  in DistSqPoint3ToAABB()
468         vv = B->Pmin.z;  in DistSqPoint3ToAABB()
470     else if (v > B->Pmax.z)  in DistSqPoint3ToAABB()
472         sqDist += (B->Pmax.z - v) * (B->Pmax.z - v);  in DistSqPoint3ToAABB()
473         vv = B->Pmax.z;  in DistSqPoint3ToAABB()
476         q->z = vv;  in DistSqPoint3ToAABB()
1257     result = IntersectionRay3AABB_(box->Pmin.z, box->Pmax.z, R->P.z, R->d.z, tNear, tFar);  in IntersectionRay3AABB()
1278         a->Pmin.z > b->Pmax.z || b->Pmin.z > a->Pmax.z)  in IntersectionAABB()
1301     if (sphere->C.z < aabb->Pmin.z)  in IntersectionSphereAABB()
1302         distSq += (sphere->C.z - aabb->Pmin.z) * (sphere->C.z - aabb->Pmin.z);  in IntersectionSphereAABB()
1303     else if (sphere->C.z > aabb->Pmax.z)  in IntersectionSphereAABB()
1304         distSq += (sphere->C.z - aabb->Pmax.z) * (sphere->C.z - aabb->Pmax.z);  in IntersectionSphereAABB()
1337             E.z * FAbs(J->N.z);  in IntersectionPlaneAABB()
1399     viewPos.z = cam.f._20 * S->C.x +  in IntersectSphere()
1401                 cam.f._22 * S->C.z +  in IntersectSphere()
1405     if (viewPos.z - S->r > znear)  in IntersectSphere()
1409     if (viewPos.z + S->r < zfar)  in IntersectSphere()
1415                 cam.f._02 * S->C.z +  in IntersectSphere()
1421            viewPos.z * leftPlane.N.z;  in IntersectSphere()
1428            viewPos.z * rightPlane.N.z;  in IntersectSphere()
1435                 cam.f._12 * S->C.z +  in IntersectSphere()
1441            viewPos.z * topPlane.N.z;  in IntersectSphere()
1448            viewPos.z * bottomPlane.N.z;  in IntersectSphere()
1473         p.z = (planes[i].N.z >= 0) ? B->Pmin.z : B->Pmax.z;  in IntersectAABB()
1514         if (planes[i].N.z >= 0)  in IntersectAABB_Ex()
1516             p.z = B->Pmin.z; n.z = B->Pmax.z;  in IntersectAABB_Ex()
1520             p.z = B->Pmax.z; n.z = B->Pmin.z;  in IntersectAABB_Ex()
1582     a2->Pmin.z = ::std::min(a0->Pmin.z, a1->Pmin.z);  in MergeAABB()
1586     a2->Pmax.z = ::std::max(a0->Pmax.z, a1->Pmax.z);  in MergeAABB()