27     int32_t den = static_cast<int32_t>(aA.x_ - aB.x_) * (bA.y_ - bB.y_) -  in Intersect()
28         static_cast<int32_t>(aA.y_ - aB.y_) * (bA.x_ - bB.x_);  in Intersect()
32 …int32_t xNum = (static_cast<int32_t>(aA.x_) * aB.y_ - static_cast<int32_t>(aA.y_) * aB.x_) * (bA.x…  in Intersect()
33 …     (aA.x_ - aB.x_) * (static_cast<int32_t>(bA.x_) * bB.y_ - static_cast<int32_t>(bA.y_) * bB.x_);  in Intersect()
34 …t32_t yNum = (static_cast<int32_t>(aA.x_) * aB.y_ - static_cast<int32_t>(aA.y_) * aB.x_) * (bA.y_ …  in Intersect()
35 …     (aA.y_ - aB.y_) * (static_cast<int32_t>(bA.x_) * bB.y_ - static_cast<int32_t>(bA.y_) * bB.x_);  in Intersect()
37     out.y_ = yNum / den;  in Intersect()
49     int32_t iPos = static_cast<int32_t>(aB.x_ - aA.x_) * (bA.y_ - aA.y_) -  in IsIntersect()
50         static_cast<int32_t>(aB.y_ - aA.y_) * (bA.x_ - aA.x_);  in IsIntersect()
51     int32_t kPos = static_cast<int32_t>(aB.x_ - aA.x_) * (bB.y_ - aA.y_) -  in IsIntersect()
52         static_cast<int32_t>(aB.y_ - aA.y_) * (bB.x_ - aA.x_);  in IsIntersect()
71         int16_t iY = poly[i].y_;  in Clip()
73         int16_t kY = poly[k].y_;  in Clip()
76         int16_t y1 = line[0].y_;  in Clip()
78         int16_t y2 = line[1].y_;  in Clip()
91             newPoly[newVertexNum].y_ = kY;  in Clip()
103             newPoly[newVertexNum].y_ = intersectPoint.y_;  in Clip()
107             newPoly[newVertexNum].y_ = kY;  in Clip()
118             newPoly[newVertexNum].y_ = intersectPoint.y_;  in Clip()
153         int16_t iY = poly[i].y_;  in Clip()
155         int16_t kY = poly[k].y_;  in Clip()
158         int16_t y1 = line[0].y_;  in Clip()
160         int16_t y2 = line[1].y_;  in Clip()
191     int16_t minY = vertexes_[0].y_;  in MakeAABB()
192     int16_t maxY = vertexes_[0].y_;  in MakeAABB()
200         if (minY > vertexes_[i].y_) {  in MakeAABB()
201             minY = vertexes_[i].y_;  in MakeAABB()
203         if (maxY < vertexes_[i].y_) {  in MakeAABB()
204             maxY = vertexes_[i].y_;  in MakeAABB()