49     if (Pmin.y > Pmax.y)  in Normalize()
50         ::std::swap(Pmin.y, Pmax.y);  in Normalize()
68         if (arrayPoint[i].y < Pmin.y)  in Set()
69             Pmin.y = arrayPoint[i].y;  in Set()
70         else if (arrayPoint[i].y > Pmax.y)  in Set()
71             Pmax.y = arrayPoint[i].y;  in Set()
92     a0 = M->f._01 * box->Pmin.y;  in Set()
93     a1 = M->f._01 * box->Pmax.y;  in Set()
107     a0 = M->f._11 * box->Pmin.y;  in Set()
108     a1 = M->f._11 * box->Pmax.y;  in Set()
122     a0 = M->f._21 * box->Pmin.y;  in Set()
123     a1 = M->f._21 * box->Pmax.y;  in Set()
135     Pmin.y = y0;  in Set()
139     Pmax.y = y1;  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()
359     yMinusB = vertices[0].y - P->y;  in DistSqPoint3ToPolyline3()
367     yNextMinusB = vertices[1].y - P->y;  in DistSqPoint3ToPolyline3()
416             yNextMinusB = vertices[i + 2].y - P->y;  in DistSqPoint3ToPolyline3()
450     vv = v = P->y;  in DistSqPoint3ToAABB()
451     if (v < B->Pmin.y)  in DistSqPoint3ToAABB()
453         sqDist += (B->Pmin.y - v) * (B->Pmin.y - v);  in DistSqPoint3ToAABB()
454         vv = B->Pmin.y;  in DistSqPoint3ToAABB()
456     else if (v > B->Pmax.y)  in DistSqPoint3ToAABB()
458         sqDist += (B->Pmax.y - v) * (B->Pmax.y - v);  in DistSqPoint3ToAABB()
459         vv = B->Pmax.y;  in DistSqPoint3ToAABB()
462         q->y = vv;  in DistSqPoint3ToAABB()
1253     result = IntersectionRay3AABB_(box->Pmin.y, box->Pmax.y, R->P.y, R->d.y, tNear, tFar);  in IntersectionRay3AABB()
1277         a->Pmin.y > b->Pmax.y || b->Pmin.y > a->Pmax.y ||  in IntersectionAABB()
1296     if (sphere->C.y < aabb->Pmin.y)  in IntersectionSphereAABB()
1297         distSq += (sphere->C.y - aabb->Pmin.y) * (sphere->C.y - aabb->Pmin.y);  in IntersectionSphereAABB()
1298     else if (sphere->C.y > aabb->Pmax.y)  in IntersectionSphereAABB()
1299         distSq += (sphere->C.y - aabb->Pmax.y) * (sphere->C.y - aabb->Pmax.y);  in IntersectionSphereAABB()
1336             E.y * FAbs(J->N.y) +  in IntersectionPlaneAABB()
1400                 cam.f._21 * S->C.y +  in IntersectSphere()
1414                 cam.f._01 * S->C.y +  in IntersectSphere()
1433     viewPos.y = cam.f._10 * S->C.x +  in IntersectSphere()
1434                 cam.f._11 * S->C.y +  in IntersectSphere()
1440     Dist = viewPos.y * topPlane.N.y +  in IntersectSphere()
1447     Dist = viewPos.y * bottomPlane.N.y +  in IntersectSphere()
1472         p.y = (planes[i].N.y >= 0) ? B->Pmin.y : B->Pmax.y;  in IntersectAABB()
1505         if (planes[i].N.y >= 0)  in IntersectAABB_Ex()
1507             p.y = B->Pmin.y; n.y = B->Pmax.y;  in IntersectAABB_Ex()
1511             p.y = B->Pmax.y; n.y = B->Pmin.y;  in IntersectAABB_Ex()
1581     a2->Pmin.y = ::std::min(a0->Pmin.y, a1->Pmin.y);  in MergeAABB()
1585     a2->Pmax.y = ::std::max(a0->Pmax.y, a1->Pmax.y);  in MergeAABB()