| /external/chromium_org/third_party/skia/src/animator/ |
| SkHitClear.cpp | 23 for (int tIndex = 0; tIndex < targets.count(); tIndex++) {
24 SkDisplayable* target = targets[tIndex];
|
| SkHitTest.cpp | 40 for (int tIndex = 0; tIndex < targetCount; tIndex++) {
41 SkDisplayable* target = targets[tIndex];
45 hits[bIndex] = tIndex;
59 for (int tIndex = 0; tIndex < targets.count(); tIndex++) {
60 SkDisplayable* target = targets[tIndex];
|
| /external/skia/src/animator/ |
| SkHitClear.cpp | 23 for (int tIndex = 0; tIndex < targets.count(); tIndex++) {
24 SkDisplayable* target = targets[tIndex];
|
| SkHitTest.cpp | 40 for (int tIndex = 0; tIndex < targetCount; tIndex++) {
41 SkDisplayable* target = targets[tIndex];
45 hits[bIndex] = tIndex;
59 for (int tIndex = 0; tIndex < targets.count(); tIndex++) {
60 SkDisplayable* target = targets[tIndex];
|
| /external/skia/tools/ |
| bench_pictures_main.cpp | 89 size_t tIndex;
90 for (tIndex = 1; tIndex < SkDrawFilter::kTypeCount; ++tIndex) {
91 all &= drawFilters[tIndex];
99 for (tIndex = 0; tIndex < SkDrawFilter::kTypeCount; ++tIndex) {
100 if (drawFilters[tIndex] & (1 << fIndex)) {
101 types += gFilterTypes[tIndex];
[all...] |
| /external/chromium_org/third_party/skia/src/pathops/ |
| SkOpSegment.h | 79 bool isCanceled(int tIndex) const {
80 return fTs[tIndex].fWindValue == 0 && fTs[tIndex].fOppValue == 0;
116 int oppSum(int tIndex) const {
117 return fTs[tIndex].fOppSum;
125 int oppValue(int tIndex) const {
126 return fTs[tIndex].fOppValue;
164 const SkOpSpan& span(int tIndex) const {
165 return fTs[tIndex];
186 double t(int tIndex) const
[all...] |
| SkPathOpsCommon.h | 18 SkOpSegment* FindChase(SkTDArray<SkOpSpan*>& chase, int& tIndex, int& endIndex);
|
| SkOpSegment.cpp | 217 int tIndex = -1;
222 ++tIndex;
223 } while (startPt != fTs[tIndex].fPt && tIndex < tCount);
224 int tIndexStart = tIndex;
231 nextPt = &fTs[++tIndex].fPt;
232 SkASSERT(fTs[tIndex].fT < 1 || startPt != *nextPt);
234 double nextT = fTs[tIndex].fT;
242 // fTs[tIndexStart - 1], fTs[tIndexStart], fTs[tIndex]
260 if (nextT < 1 && fTs[tIndex].fWindValue)
[all...] |
| SkOpContour.h | 62 void addOtherT(int segIndex, int tIndex, double otherT, int otherIndex) {
63 fSegments[segIndex].addOtherT(tIndex, otherT, otherIndex);
|
| SkPathOpsCommon.cpp | 114 SkOpSegment* FindChase(SkTDArray<SkOpSpan*>& chase, int& tIndex, int& endIndex) {
120 tIndex = backPtr.fOtherIndex;
123 if (segment->activeAngle(tIndex, &done, &angles)) {
125 tIndex = last->start();
190 tIndex = angle->start();
192 int lesser = SkMin32(tIndex, endIndex);
|
| /external/skia/src/pathops/ |
| SkOpSegment.h | 79 bool isCanceled(int tIndex) const {
80 return fTs[tIndex].fWindValue == 0 && fTs[tIndex].fOppValue == 0;
116 int oppSum(int tIndex) const {
117 return fTs[tIndex].fOppSum;
125 int oppValue(int tIndex) const {
126 return fTs[tIndex].fOppValue;
164 const SkOpSpan& span(int tIndex) const {
165 return fTs[tIndex];
186 double t(int tIndex) const
[all...] |
| SkPathOpsCommon.h | 18 SkOpSegment* FindChase(SkTDArray<SkOpSpan*>& chase, int& tIndex, int& endIndex);
|
| SkOpSegment.cpp | 217 int tIndex = -1;
222 ++tIndex;
223 } while (startPt != fTs[tIndex].fPt && tIndex < tCount);
224 int tIndexStart = tIndex;
231 nextPt = &fTs[++tIndex].fPt;
232 SkASSERT(fTs[tIndex].fT < 1 || startPt != *nextPt);
234 double nextT = fTs[tIndex].fT;
242 // fTs[tIndexStart - 1], fTs[tIndexStart], fTs[tIndex]
260 if (nextT < 1 && fTs[tIndex].fWindValue)
[all...] |
| SkOpContour.h | 62 void addOtherT(int segIndex, int tIndex, double otherT, int otherIndex) {
63 fSegments[segIndex].addOtherT(tIndex, otherT, otherIndex);
|
| SkPathOpsCommon.cpp | 114 SkOpSegment* FindChase(SkTDArray<SkOpSpan*>& chase, int& tIndex, int& endIndex) {
120 tIndex = backPtr.fOtherIndex;
123 if (segment->activeAngle(tIndex, &done, &angles)) {
125 tIndex = last->start();
190 tIndex = angle->start();
192 int lesser = SkMin32(tIndex, endIndex);
|
| /external/skia/tests/ |
| PathOpsQuadLineIntersectionThreadedTest.cpp | 91 for (int tIndex = 0; tIndex <= 4; ++tIndex) {
92 SkDPoint xy = quad.ptAtT(tIndex / 4.0);
|
| PathOpsAngleTest.cpp | 298 int tIndex = 0;
302 if (seg->t(tIndex) == set[idx].tStart) {
303 ts[0] = tIndex;
305 if (seg->t(tIndex) == set[idx].tEnd) {
306 ts[1] = tIndex;
308 if (seg->t(tIndex) >= 1) {
311 } while (++tIndex);
|
| /external/icu4c/layout/ |
| HangulLayoutEngine.cpp | 115 le_int32 tIndex = trail - TJMO_FIRST;
122 if (tIndex <= 0 || tIndex >= TJMO_COUNT) {
123 tIndex = 0;
127 syllable = (LEUnicode) ((lIndex * VJMO_COUNT + vIndex) * TJMO_COUNT + tIndex + HSYL_FIRST);
|
| /cts/suite/cts/deviceTests/opengl/jni/graphics/ |
| GLUtils.cpp | 120 int tIndex = i * 2;
121 texCoords[tIndex + 0] = readFloat(buffer + index);
123 texCoords[tIndex + 1] = readFloat(buffer + index);
|
| /external/chromium_org/third_party/icu/source/i18n/ |
| bmsearch.cpp | 674 int32_t tIndex = 0;
709 tIndex = ++lIndex;
714 const CEI *tcei = target->prevCE(tIndex++);
748 const CEI firstCEI = *target->prevCE(tIndex - 1);
|
| ucol.cpp | [all...] |
| /external/icu4c/i18n/ |
| ucol.cpp | [all...] |
| /dalvik/vm/compiler/codegen/x86/ |
| AnalysisO1.cpp | [all...] |
| /prebuilts/tools/common/m2/internal/com/ibm/icu/icu4j/2.6.1/ |
| icu4j-2.6.1.jar | |
| /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/ |
| com.ibm.icu_4.2.1.v20100412.jar | |
