Lines Matching defs:sort
84 int a, b, tmp, sort[4];
88 sort[a] = a;
93 if (points[2 * sort[a] + 1] > points[2 * sort[b] + 1])
95 tmp = sort[a];
96 sort[a] = sort[b];
97 sort[b] = tmp;
101 npnts[0] = points[2 * sort[1]];
102 npnts[1] = points[2 * sort[1] + 1];
103 npnts[2] = points[2 * sort[2]];
104 npnts[3] = points[2 * sort[2] + 1];
106 /* now, intersect a horizontal ray from sort[1] with the quad */
111 pnt[0] = points[2 * sort[b + 1]] + 10;
112 pnt[1] = points[2 * sort[b + 1] + 1];
114 retval = _segment_segment_intersection(points + 2 * sort[b + 1], pnt,
119 pnt[0] = points[2 * sort[b + 1]] - 10;
120 retval = _segment_segment_intersection(points + 2 * sort[b + 1], pnt,
127 d[0] = pnt[0] - points[2 * sort[b + 1]];
128 d[1] = pnt[1] - points[2 * sort[b + 1] + 1];
129 npnts[2 * b + 4] = points[2 * sort[b + 1]] + retval * d[0];
130 npnts[2 * b + 5] = points[2 * sort[b + 1] + 1] + retval * d[1];
135 min[1] = points[2 * sort[1] + 1];
136 max[1] = points[2 * sort[2] + 1];
138 /* finally, sort npnts by x */
140 sort[a] = a;
145 if (npnts[2 * sort[a]] > npnts[2 * sort[b]])
147 tmp = sort[a];
148 sort[a] = sort[b];
149 sort[b] = tmp;
154 min[0] = npnts[2 * sort[1]];
155 max[0] = npnts[2 * sort[2]];