Searched refs:lowestIndex (Results 1 - 6 of 6) sorted by relevance
/external/chromium_org/third_party/skia/src/pathops/ |
H A D | SkDQuadIntersection.cpp | 537 int lowestIndex = -1; local 543 lowestIndex = index; 547 if (lowestIndex < 0) { 550 insert(roots1Copy[lowestIndex], roots2Copy[closest[lowestIndex]], 551 pts1[lowestIndex]); 552 closest[lowestIndex] = -1;
|
/external/skia/src/pathops/ |
H A D | SkDQuadIntersection.cpp | 537 int lowestIndex = -1; local 543 lowestIndex = index; 547 if (lowestIndex < 0) { 550 insert(roots1Copy[lowestIndex], roots2Copy[closest[lowestIndex]], 551 pts1[lowestIndex]); 552 closest[lowestIndex] = -1;
|
/external/chromium_org/third_party/icu/source/samples/cal/ |
H A D | cal.c | 50 int32_t lowestIndex, 278 * lowestIndex is the index of the first symbol to fetch. 290 int32_t lowestIndex, 302 if(count != arrayLength + lowestIndex) { 308 int32_t size = 1 + udat_getSymbols(fmt, type, idx + lowestIndex, NULL, 0, status); 313 udat_getSymbols(fmt, type, idx + lowestIndex, array[idx], size, status); 286 get_symbols(const UDateFormat *fmt, UDateFormatSymbolType type, UChar *array[], int32_t arrayLength, int32_t lowestIndex, int32_t firstIndex, UErrorCode *status) argument
|
/external/icu/icu4c/source/samples/cal/ |
H A D | cal.c | 50 int32_t lowestIndex, 278 * lowestIndex is the index of the first symbol to fetch. 290 int32_t lowestIndex, 302 if(count != arrayLength + lowestIndex) { 308 int32_t size = 1 + udat_getSymbols(fmt, type, idx + lowestIndex, NULL, 0, status); 313 udat_getSymbols(fmt, type, idx + lowestIndex, array[idx], size, status); 286 get_symbols(const UDateFormat *fmt, UDateFormatSymbolType type, UChar *array[], int32_t arrayLength, int32_t lowestIndex, int32_t firstIndex, UErrorCode *status) argument
|
/external/chromium_org/third_party/skia/experimental/Intersection/ |
H A D | QuadraticImplicit.cpp | 553 int lowestIndex = -1; 559 lowestIndex = index; 563 if (lowestIndex < 0) { 566 i.insert(roots1Copy[lowestIndex], roots2Copy[closest[lowestIndex]], 567 pts1[lowestIndex]); 568 closest[lowestIndex] = -1;
|
/external/skia/experimental/Intersection/ |
H A D | QuadraticImplicit.cpp | 553 int lowestIndex = -1; 559 lowestIndex = index; 563 if (lowestIndex < 0) { 566 i.insert(roots1Copy[lowestIndex], roots2Copy[closest[lowestIndex]], 567 pts1[lowestIndex]); 568 closest[lowestIndex] = -1;
|
Completed in 181 milliseconds