Searched defs:tIndex (Results 1 - 17 of 17) sorted by relevance

/external/chromium_org/third_party/skia/src/pathops/
H A DSkPathOpsOp.cpp12 static SkOpSegment* findChaseOp(SkTDArray<SkOpSpan*>& chase, int* tIndex, int* endIndex) { argument
18 *tIndex = backPtr.fOtherIndex;
22 if (const SkOpAngle* last = segment->activeAngle(*tIndex, tIndex, endIndex, &done,
27 *tIndex = last->start();
43 const SkOpAngle* angle = segment->spanToAngle(*tIndex, *endIndex);
73 *tIndex = start;
H A DSkIntersections.h187 void set(bool swap, int tIndex, double t) { argument
188 fT[(int) swap][tIndex] = t;
H A DSkOpContour.h67 void addOtherT(int segIndex, int tIndex, double otherT, int otherIndex) { argument
68 fSegments[segIndex].addOtherT(tIndex, otherT, otherIndex);
110 bool swap, int tIndex, SkIntersections* ts, SkPoint* point) const;
327 int alignT(bool swap, int tIndex, SkIntersections* ts) const;
H A DSkOpContour.cpp228 bool swap, int tIndex, SkIntersections* ts, SkPoint* point) const {
230 if ((zeroPt = alignT(swap, tIndex, ts)) >= 0) {
233 if ((zeroPt = other->alignT(!swap, tIndex, ts)) >= 0) {
247 int SkOpContour::alignT(bool swap, int tIndex, SkIntersections* ts) const { argument
248 double tVal = (*ts)[swap][tIndex];
250 ts->set(swap, tIndex, 0);
254 ts->set(swap, tIndex, 1);
227 alignTPt(int segmentIndex, const SkOpContour* other, int otherIndex, bool swap, int tIndex, SkIntersections* ts, SkPoint* point) const argument
H A DSkPathOpsCommon.cpp137 SkOpSegment* FindChase(SkTDArray<SkOpSpan*>* chase, int* tIndex, int* endIndex) { argument
143 *tIndex = backPtr.fOtherIndex;
147 if (const SkOpAngle* last = segment->activeAngle(*tIndex, tIndex, endIndex, &done,
149 *tIndex = last->start();
165 const SkOpAngle* angle = segment->spanToAngle(*tIndex, *endIndex);
200 *tIndex = angle->start();
202 int lesser = SkMin32(*tIndex, *endIndex);
H A DSkOpSegment.cpp214 int tIndex = -1; local
219 ++tIndex;
220 } while (startPt != fTs[tIndex].fPt && tIndex < tCount);
221 int tIndexStart = tIndex;
228 nextPt = &fTs[++tIndex].fPt;
229 SkASSERT(fTs[tIndex].fT < 1 || startPt != *nextPt);
231 double nextT = fTs[tIndex].fT;
239 // fTs[tIndexStart - 1], fTs[tIndexStart], fTs[tIndex]
257 if (nextT < 1 && fTs[tIndex]
295 int tIndex = -1; local
[all...]
/external/chromium_org/third_party/skia/tools/
H A Dbench_pictures_main.cpp111 size_t tIndex; local
112 for (tIndex = 1; tIndex < SkDrawFilter::kTypeCount; ++tIndex) {
113 all &= drawFilters[tIndex];
121 for (tIndex = 0; tIndex < SkDrawFilter::kTypeCount; ++tIndex) {
122 if (drawFilters[tIndex] & (1 << fIndex)) {
123 types += gFilterTypes[tIndex];
[all...]
/external/skia/src/pathops/
H A DSkPathOpsOp.cpp12 static SkOpSegment* findChaseOp(SkTDArray<SkOpSpan*>& chase, int* tIndex, int* endIndex) { argument
18 *tIndex = backPtr.fOtherIndex;
22 if (const SkOpAngle* last = segment->activeAngle(*tIndex, tIndex, endIndex, &done,
27 *tIndex = last->start();
43 const SkOpAngle* angle = segment->spanToAngle(*tIndex, *endIndex);
73 *tIndex = start;
H A DSkIntersections.h187 void set(bool swap, int tIndex, double t) { argument
188 fT[(int) swap][tIndex] = t;
H A DSkOpContour.h67 void addOtherT(int segIndex, int tIndex, double otherT, int otherIndex) { argument
68 fSegments[segIndex].addOtherT(tIndex, otherT, otherIndex);
110 bool swap, int tIndex, SkIntersections* ts, SkPoint* point) const;
327 int alignT(bool swap, int tIndex, SkIntersections* ts) const;
H A DSkOpContour.cpp220 bool swap, int tIndex, SkIntersections* ts, SkPoint* point) const {
222 if ((zeroPt = alignT(swap, tIndex, ts)) >= 0) {
225 if ((zeroPt = other->alignT(!swap, tIndex, ts)) >= 0) {
239 int SkOpContour::alignT(bool swap, int tIndex, SkIntersections* ts) const { argument
240 double tVal = (*ts)[swap][tIndex];
242 ts->set(swap, tIndex, 0);
246 ts->set(swap, tIndex, 1);
219 alignTPt(int segmentIndex, const SkOpContour* other, int otherIndex, bool swap, int tIndex, SkIntersections* ts, SkPoint* point) const argument
H A DSkOpSegment.cpp214 int tIndex = -1; local
219 ++tIndex;
220 } while (startPt != fTs[tIndex].fPt && tIndex < tCount);
221 int tIndexStart = tIndex;
228 nextPt = &fTs[++tIndex].fPt;
229 SkASSERT(fTs[tIndex].fT < 1 || startPt != *nextPt);
231 double nextT = fTs[tIndex].fT;
239 // fTs[tIndexStart - 1], fTs[tIndexStart], fTs[tIndex]
257 if (nextT < 1 && fTs[tIndex]
294 int tIndex = -1; local
[all...]
H A DSkPathOpsCommon.cpp137 SkOpSegment* FindChase(SkTDArray<SkOpSpan*>* chase, int* tIndex, int* endIndex) { argument
143 *tIndex = backPtr.fOtherIndex;
147 if (const SkOpAngle* last = segment->activeAngle(*tIndex, tIndex, endIndex, &done,
149 *tIndex = last->start();
165 const SkOpAngle* angle = segment->spanToAngle(*tIndex, *endIndex);
200 *tIndex = angle->start();
202 int lesser = SkMin32(*tIndex, *endIndex);
/external/skia/tools/
H A Dbench_pictures_main.cpp99 size_t tIndex; local
100 for (tIndex = 1; tIndex < SkDrawFilter::kTypeCount; ++tIndex) {
101 all &= drawFilters[tIndex];
109 for (tIndex = 0; tIndex < SkDrawFilter::kTypeCount; ++tIndex) {
110 if (drawFilters[tIndex] & (1 << fIndex)) {
111 types += gFilterTypes[tIndex];
[all...]
/external/icu/icu4c/source/layout/
H A DHangulLayoutEngine.cpp115 le_int32 tIndex = trail - TJMO_FIRST; local
122 if (tIndex <= 0 || tIndex >= TJMO_COUNT) {
123 tIndex = 0;
127 syllable = (LEUnicode) ((lIndex * VJMO_COUNT + vIndex) * TJMO_COUNT + tIndex + HSYL_FIRST);
/external/chromium_org/third_party/icu/source/i18n/
H A Ducol.cpp7677 int32_t sIndex = 0, tIndex = 0; local
7729 tChar=target[tIndex++];
7742 if(tIndex==tLen) {
7749 tChar=target[tIndex++];
7759 tOrder = ucol_getLatinOneContraction(coll, UCOL_PRIMARY, tOrder, target, &tIndex, tLen);
7797 sLen = sIndex; tLen = tIndex;
7808 sIndex = 0; tIndex = 0;
7823 if(tIndex==tLen) {
7830 tChar=target[tIndex++];
7833 tOrder = ucol_getLatinOneContraction(coll, UCOL_SECONDARY, tOrder, target, &tIndex, tLe
8070 int32_t sIndex = 0, tIndex = 0; local
[all...]
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/
H A Dcom.ibm.icu_4.2.1.v20100412.jarMETA-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ...

Completed in 1063 milliseconds