Home
last modified time | relevance | path

Searched refs:kidx (Results 1 – 4 of 4) sorted by relevance

/external/skia/tests/
DGeometryTest.cpp268 for (int k=0, kidx=0; k < 2; ++k, ++kidx) { in check_cubic_around_rect() local
270 kidx = (kidx == i || kidx == jidx) ? kidx+1 : kidx; in check_cubic_around_rect()
272 bezier[2] = points[kidx]; in check_cubic_around_rect()
274 if (l != i && l != jidx && l != kidx) { in check_cubic_around_rect()
289 for (int k=0, kidx=0; k < 2; ++k, ++kidx) { in check_cubic_around_rect() local
291 kidx = (kidx == i || kidx == jidx) ? kidx+1 : kidx; in check_cubic_around_rect()
293 bezier[3] = points[kidx]; in check_cubic_around_rect()
/external/skqp/tests/
DGeometryTest.cpp268 for (int k=0, kidx=0; k < 2; ++k, ++kidx) { in check_cubic_around_rect() local
270 kidx = (kidx == i || kidx == jidx) ? kidx+1 : kidx; in check_cubic_around_rect()
272 bezier[2] = points[kidx]; in check_cubic_around_rect()
274 if (l != i && l != jidx && l != kidx) { in check_cubic_around_rect()
289 for (int k=0, kidx=0; k < 2; ++k, ++kidx) { in check_cubic_around_rect() local
291 kidx = (kidx == i || kidx == jidx) ? kidx+1 : kidx; in check_cubic_around_rect()
293 bezier[3] = points[kidx]; in check_cubic_around_rect()
/external/antlr/runtime/ObjC/Framework/
DACBTree.h63 NSInteger kidx; variable
79 @property (assign) NSInteger kidx;
DACBTree.m89 @synthesize kidx;