47     if (Pmin.x > Pmax.x)  in Normalize()
48         ::std::swap(Pmin.x, Pmax.x);  in Normalize()
63         if (arrayPoint[i].x < Pmin.x)  in Set()
64             Pmin.x = arrayPoint[i].x;  in Set()
65         else if (arrayPoint[i].x > Pmax.x)  in Set()
66             Pmax.x = arrayPoint[i].x;  in Set()
90     x0 = M->f._00 * box->Pmin.x + M->f._03;  in Set()
91     x1 = M->f._00 * box->Pmax.x + M->f._03;  in Set()
105     y0 = M->f._10 * box->Pmin.x + M->f._13;  in Set()
106     y1 = M->f._10 * box->Pmax.x + M->f._13;  in Set()
120     z0 = M->f._20 * box->Pmin.x + M->f._23;  in Set()
121     z1 = M->f._20 * box->Pmax.x + M->f._23;  in Set()
134     Pmin.x = x0;  in Set()
138     Pmax.x = x1;  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()
358     xMinusA = vertices[0].x - P->x;  in DistSqPoint3ToPolyline3()
366     xNextMinusA = vertices[1].x - P->x;  in DistSqPoint3ToPolyline3()
415             xNextMinusA = vertices[i + 2].x - P->x;  in DistSqPoint3ToPolyline3()
436     vv = v = P->x;  in DistSqPoint3ToAABB()
437     if (v < B->Pmin.x)  in DistSqPoint3ToAABB()
439         sqDist += (B->Pmin.x - v) * (B->Pmin.x - v);  in DistSqPoint3ToAABB()
440         vv = B->Pmin.x;  in DistSqPoint3ToAABB()
442     else if (v > B->Pmax.x)  in DistSqPoint3ToAABB()
444         sqDist += (B->Pmax.x - v) * (B->Pmax.x - v);  in DistSqPoint3ToAABB()
445         vv = B->Pmax.x;  in DistSqPoint3ToAABB()
448         q->x = vv;  in DistSqPoint3ToAABB()
1249     result = IntersectionRay3AABB_(box->Pmin.x, box->Pmax.x, R->P.x, R->d.x, tNear, tFar);  in IntersectionRay3AABB()
1276     if (a->Pmin.x > b->Pmax.x || b->Pmin.x > a->Pmax.x ||  in IntersectionAABB()
1291     if (sphere->C.x < aabb->Pmin.x)  in IntersectionSphereAABB()
1292         distSq += (sphere->C.x - aabb->Pmin.x) * (sphere->C.x - aabb->Pmin.x);  in IntersectionSphereAABB()
1293     else if (sphere->C.x > aabb->Pmax.x)  in IntersectionSphereAABB()
1294         distSq += (sphere->C.x - aabb->Pmax.x) * (sphere->C.x - aabb->Pmax.x);  in IntersectionSphereAABB()
1335     f32 r = E.x * FAbs(J->N.x) +   in IntersectionPlaneAABB()
1399     viewPos.z = cam.f._20 * S->C.x +  in IntersectSphere()
1413     viewPos.x = cam.f._00 * S->C.x +  in IntersectSphere()
1420     Dist = viewPos.x * leftPlane.N.x +  in IntersectSphere()
1427     Dist = viewPos.x * rightPlane.N.x +  in IntersectSphere()
1433     viewPos.y = cam.f._10 * S->C.x +  in IntersectSphere()
1471         p.x = (planes[i].N.x >= 0) ? B->Pmin.x : B->Pmax.x;  in IntersectAABB()
1496         if (planes[i].N.x >= 0)  in IntersectAABB_Ex()
1498             p.x = B->Pmin.x; n.x = B->Pmax.x;  in IntersectAABB_Ex()
1502             p.x = B->Pmax.x; n.x = B->Pmin.x;  in IntersectAABB_Ex()
1580     a2->Pmin.x = ::std::min(a0->Pmin.x, a1->Pmin.x);  in MergeAABB()
1584     a2->Pmax.x = ::std::max(a0->Pmax.x, a1->Pmax.x);  in MergeAABB()