Searched refs:tIdx (Results 1 – 4 of 4) sorted by relevance
127 for (int tIdx = 0; tIdx < tCount; ++tIdx) { in intersect3() local128 double to1 = t1Start + (t1 - t1Start) * locals.fT[0][tIdx]; in intersect3()129 double to2 = t2Start + (t2 - t2Start) * locals.fT[1][tIdx]; in intersect3()134 if (locals.fIsCoincident[0] & 1 << tIdx) { in intersect3()155 double c1Bottom = tIdx == 0 ? 0 : in intersect3()156 (t1Start + (t1 - t1Start) * locals.fT[0][tIdx - 1] + to1) / 2; in intersect3()158 double c1Top = tIdx == tCount - 1 ? 1 : in intersect3()159 (t1Start + (t1 - t1Start) * locals.fT[0][tIdx + 1] + to1) / 2; in intersect3()188 double c2Bottom = tIdx == 0 ? to2 : in intersect3()189 (t2Start + (t2 - t2Start) * locals.fT[1][tIdx - 1] + to2) / 2; in intersect3()[all …]
120 for (int tIdx = 0; tIdx < tCount; ++tIdx) { in intersect() local121 double to1 = t1Start + (t1 - t1Start) * locals[0][tIdx]; in intersect()122 double to2 = t2Start + (t2 - t2Start) * locals[1][tIdx]; in intersect()141 double c1Bottom = tIdx == 0 ? 0 : in intersect()142 (t1Start + (t1 - t1Start) * locals[0][tIdx - 1] + to1) / 2; in intersect()144 double c1Top = tIdx == tCount - 1 ? 1 : in intersect()145 (t1Start + (t1 - t1Start) * locals[0][tIdx + 1] + to1) / 2; in intersect()176 double c2Bottom = tIdx == 0 ? to2 : in intersect()177 (t2Start + (t2 - t2Start) * locals[1][tIdx - 1] + to2) / 2; in intersect()178 double c2Top = tIdx == tCount - 1 ? to2 : in intersect()[all …]