| /external/skia/src/core/ |
| D | SkRegionPriv.h | 201 int rite = SK_MinS32; in computeRunBounds() local
228 if (rite < R) { in computeRunBounds()
229 rite = R; in computeRunBounds()
250 bounds->fRight = rite; in computeRunBounds()
|
| D | SkScan_AAAPath.cpp | 1160 SkFixed rite = std::min(riteBound, riteE->fX); in aaa_walk_convex_edges() local
1164 int fullRite = SkFixedFloorToInt(rite); in aaa_walk_convex_edges()
1166 SkFixed partialRite = rite - SkIntToFixed(fullRite); in aaa_walk_convex_edges()
1226 fixed_to_alpha(SkFixedMul(partialTop, rite - left))); in aaa_walk_convex_edges()
1231 fullLeft - 1, fullTop, fullBot - fullTop, fixed_to_alpha(rite - left)); in aaa_walk_convex_edges()
1237 fixed_to_alpha(SkFixedMul(partialBot, rite - left))); in aaa_walk_convex_edges()
1250 rite += kSnapHalf; // For fast rounding in aaa_walk_convex_edges()
1272 SkFixed nextRite = rite + SkFixedMul(dRite, dY); in aaa_walk_convex_edges()
1273 SkASSERT((left & kSnapMask) >= leftBound && (rite & kSnapMask) <= riteBound && in aaa_walk_convex_edges()
1279 rite & kSnapMask, in aaa_walk_convex_edges()
[all …]
|
| D | SkRegion.cpp | 669 static void assert_valid_pair(int left, int rite) in assert_valid_pair() argument
671 SkASSERT(left == SkRegion_kRunTypeSentinel || left < rite); in assert_valid_pair()
674 #define assert_valid_pair(left, rite) argument
705 int inside, left, rite SK_INIT_TO_AVOID_WARNING; in next()
718 rite = a_rite; in next()
721 rite = a_left = b_left; in next()
727 rite = b_rite; in next()
730 rite = b_left = a_left; in next()
736 rite = b_left = a_rite; in next()
740 rite = a_left = b_rite; in next()
[all …]
|
| D | SkScan_Antihair.cpp | 647 int rite = R >> 8; in do_scanline() local
648 int width = rite - left; in do_scanline()
653 blitter->blitV(rite, top, 1, SkAlphaMul(alpha, R & 0xFF)); in do_scanline()
685 int rite = R >> 8; in antifilldot8() local
686 int width = rite - left; in antifilldot8()
691 blitter->blitV(rite, top, height, R & 0xFF); in antifilldot8()
871 int rite = R >> 8; in inner_scanline() local
872 int width = rite - left; in inner_scanline()
878 blitter->blitV(rite, top, 1, InvAlphaMul(alpha, ~R & 0xFF)); in inner_scanline()
|
| D | SkScan_Path.cpp | 244 SkFixed rite = riteE->fX; in walk_simple_edges() local
251 int R = SkFixedRoundToInt(rite); in walk_simple_edges()
263 int R = SkFixedRoundToInt(rite); in walk_simple_edges()
275 rite = Sk32_can_overflow_add(rite, dRite); in walk_simple_edges()
281 riteE->fX = rite; in walk_simple_edges()
|
| D | SkAAClip.cpp | 1439 static void adjust_row(RowIter& iter, int& leftA, int& riteA, int rite) { in adjust_row() argument
1440 if (rite == riteA) { in adjust_row()
1477 int left, rite; in operatorX() local
1483 rite = riteA; in operatorX()
1485 rite = leftA = leftB; in operatorX()
1491 rite = riteB; in operatorX()
1493 rite = leftB = leftA; in operatorX()
1497 rite = leftA = leftB = std::min(riteA, riteB); in operatorX()
1505 if (rite > bounds.fRight) { in operatorX()
1506 rite = bounds.fRight; in operatorX()
[all …]
|
| /external/skqp/src/core/ |
| D | SkRegionPriv.h | 201 int rite = SK_MinS32; in computeRunBounds() local
228 if (rite < R) { in computeRunBounds()
229 rite = R; in computeRunBounds()
250 bounds->fRight = rite; in computeRunBounds()
|
| D | SkScan_AAAPath.cpp | 1062 SkFixed rite = SkTMin(riteBound, riteE->fX); in aaa_walk_convex_edges() local
1066 int fullRite = SkFixedFloorToInt(rite); in aaa_walk_convex_edges()
1068 SkFixed partialRite = rite - SkIntToFixed(fullRite); in aaa_walk_convex_edges()
1117 f2a(SkFixedMul(partialTop, rite - left))); in aaa_walk_convex_edges()
1122 f2a(rite - left)); in aaa_walk_convex_edges()
1126 f2a(SkFixedMul(partialBot, rite - left))); in aaa_walk_convex_edges()
1138 left += kSnapHalf; rite += kSnapHalf; // For fast rounding in aaa_walk_convex_edges()
1167 SkFixed nextRite = rite + SkFixedMul(dRite, dY); in aaa_walk_convex_edges()
1168 SkASSERT((left & kSnapMask) >= leftBound && (rite & kSnapMask) <= riteBound && in aaa_walk_convex_edges()
1171 blit_trapezoid_row(blitter, y >> 16, left & kSnapMask, rite & kSnapMask, in aaa_walk_convex_edges()
[all …]
|
| D | SkRegion.cpp | 670 static void assert_valid_pair(int left, int rite) in assert_valid_pair() argument
672 SkASSERT(left == SkRegion_kRunTypeSentinel || left < rite); in assert_valid_pair()
675 #define assert_valid_pair(left, rite) argument
706 int inside, left, rite SK_INIT_TO_AVOID_WARNING; in next()
719 rite = a_rite; in next()
722 rite = a_left = b_left; in next()
728 rite = b_rite; in next()
731 rite = b_left = a_left; in next()
737 rite = b_left = a_rite; in next()
741 rite = a_left = b_rite; in next()
[all …]
|
| D | SkScan_Antihair.cpp | 642 int rite = R >> 8; in do_scanline() local
643 int width = rite - left; in do_scanline()
648 blitter->blitV(rite, top, 1, SkAlphaMul(alpha, R & 0xFF)); in do_scanline()
680 int rite = R >> 8; in antifilldot8() local
681 int width = rite - left; in antifilldot8()
686 blitter->blitV(rite, top, height, R & 0xFF); in antifilldot8()
866 int rite = R >> 8; in inner_scanline() local
867 int width = rite - left; in inner_scanline()
873 blitter->blitV(rite, top, 1, InvAlphaMul(alpha, ~R & 0xFF)); in inner_scanline()
|
| D | SkScan_Path.cpp | 245 SkFixed rite = riteE->fX; in walk_simple_edges() local
252 int R = SkFixedRoundToInt(rite); in walk_simple_edges()
264 int R = SkFixedRoundToInt(rite); in walk_simple_edges()
276 rite = Sk32_can_overflow_add(rite, dRite); in walk_simple_edges()
282 riteE->fX = rite; in walk_simple_edges()
|
| D | SkAAClip.cpp | 1442 static void adjust_row(RowIter& iter, int& leftA, int& riteA, int rite) { in adjust_row() argument
1443 if (rite == riteA) { in adjust_row()
1480 int left, rite; in operatorX() local
1486 rite = riteA; in operatorX()
1488 rite = leftA = leftB; in operatorX()
1494 rite = riteB; in operatorX()
1496 rite = leftB = leftA; in operatorX()
1500 rite = leftA = leftB = SkMin32(riteA, riteB); in operatorX()
1508 if (rite > bounds.fRight) { in operatorX()
1509 rite = bounds.fRight; in operatorX()
[all …]
|
| /external/hyphenation-patterns/en-US/ |
| D | ushyphex.tex | 705 neph-rite
|
| D | hyph-en-us.hyp.txt | 706 neph-rite
|
| /external/python/google-api-python-client/samples/prediction/ |
| D | language_id.txt | 302 …putaient souvent, en faisant leur partie d'�checs, le soir, au sujet du m�rite de leurs serviteurs…
399 … nous n'en doutons pas, cette premi�re partie obtient le succ�s qu'elle m�rite, de publier incessa…
|
| /external/libtextclassifier/native/annotator/pod_ner/test_data/ |
| D | vocab.txt | 14035 rite
17626 ##rite
|
| /external/icu/icu4j/main/shared/data/ |
| D | Transliterator_Han_Latin_Definition.txt | 832 㻲 < a\-rite\-or\-service\-for\-beginning\-of\-autumn;
6423 䄉 < a\-rite\-or\-service;
18592 䄘 < a\-rite;
36549 㻲 > a\-rite\-or\-service\-for\-beginning\-of\-autumn;
40268 䄉 > a\-rite\-or\-service;
40269 䃿 > a\-rite\-or\-service;
50621 䄘 > a\-rite;
|
| /external/kotlinx.coroutines/benchmarks/src/jmh/resources/ |
| D | words.shakespeare.txt.gz | |
| D | ospd.txt.gz | |
| /external/libwebsockets/minimal-examples/api-tests/api-test-fts/ |
| D | les-mis-utf8.txt | 2448 fausse ressemblance avec le mérite trompe les hommes. Pour la foule, la
2586 s'endormir. Il semblait que ce fût une sorte de rite pour lui de se
3380 locutions vulgaires qui ont le mérite de dire avec un seul mot une idée
|
| /external/jline/src/src/test/resources/jline/example/ |
| D | english.gz | |