Searched defs:coincidence (Results 1 - 4 of 4) sorted by relevance
/external/chromium_org/third_party/skia/src/pathops/ |
H A D | SkOpContour.cpp | 23 SkCoincidence& coincidence = fCoincidences.push_back(); local 24 coincidence.fOther = other; 25 coincidence.fSegments[0] = index; 26 coincidence.fSegments[1] = otherIndex; 27 coincidence.fTs[swap][0] = ts[0][0]; 28 coincidence.fTs[swap][1] = ts[0][1]; 29 coincidence.fTs[!swap][0] = ts[1][0]; 30 coincidence.fTs[!swap][1] = ts[1][1]; 31 coincidence.fPts[swap][0] = pt0; 32 coincidence 80 SkCoincidence& coincidence = fCoincidences[index]; local 145 const SkCoincidence& coincidence = fCoincidences[index]; local 181 SkCoincidence& coincidence = fPartialCoincidences.push_back(); local 196 align(const SkOpSegment::AlignedSpan& aligned, bool swap, SkCoincidence* coincidence) argument 213 SkCoincidence& coincidence = (*coincidences)[index]; local 278 SkCoincidence& coincidence = fCoincidences[index]; local 294 SkCoincidence& coincidence = fPartialCoincidences[index]; local 300 const SkCoincidence& coincidence = fPartialCoincidences[index]; local [all...] |
H A D | SkOpSegment.cpp | 549 // resolve overlapping ts when considering coincidence later 1064 void SkOpSegment::blindCancel(const SkCoincidence& coincidence, SkOpSegment* other) { argument 1138 void SkOpSegment::blindCoincident(const SkCoincidence& coincidence, SkOpSegment* other) { 1381 // make sure the matching point completes the coincidence span 2165 continue; // if the edge has already been eaten (likely coincidence), ignore it 2611 SkDebugf("%s [%d] add coincidence [%d] [%d]\n", __FUNCTION__, fID, 3410 // if neither is a line, test for coincidence 3991 // coincidence is found when the beginning Ts contain -step and the end
|
/external/skia/src/pathops/ |
H A D | SkOpContour.cpp | 23 SkCoincidence& coincidence = fCoincidences.push_back(); local 24 coincidence.fOther = other; 25 coincidence.fSegments[0] = index; 26 coincidence.fSegments[1] = otherIndex; 27 coincidence.fTs[swap][0] = ts[0][0]; 28 coincidence.fTs[swap][1] = ts[0][1]; 29 coincidence.fTs[!swap][0] = ts[1][0]; 30 coincidence.fTs[!swap][1] = ts[1][1]; 31 coincidence.fPts[swap][0] = pt0; 32 coincidence 65 SkCoincidence& coincidence = fCoincidences[index]; local 137 const SkCoincidence& coincidence = fCoincidences[index]; local 173 SkCoincidence& coincidence = fPartialCoincidences.push_back(); local 188 align(const SkOpSegment::AlignedSpan& aligned, bool swap, SkCoincidence* coincidence) argument 205 SkCoincidence& coincidence = (*coincidences)[index]; local 270 SkCoincidence& coincidence = fCoincidences[index]; local 283 SkCoincidence& coincidence = fPartialCoincidences[index]; local 289 const SkCoincidence& coincidence = fPartialCoincidences[index]; local [all...] |
H A D | SkOpSegment.cpp | 545 // resolve overlapping ts when considering coincidence later 1031 void SkOpSegment::blindCancel(const SkCoincidence& coincidence, SkOpSegment* other) { argument 1105 void SkOpSegment::blindCoincident(const SkCoincidence& coincidence, SkOpSegment* other) { 1344 // make sure the matching point completes the coincidence span 2095 continue; // if the edge has already been eaten (likely coincidence), ignore it 2535 SkDebugf("%s [%d] add coincidence [%d] [%d]\n", __FUNCTION__, fID, 3326 // if neither is a line, test for coincidence 3900 // coincidence is found when the beginning Ts contain -step and the end
|
Completed in 638 milliseconds