| /external/skia/tests/ |
| PathOpsCubicQuadIntersectionTest.cpp | 64 for (int idx2 = 0; idx2 < quadCubicTests[index].answerCount; ++idx2) {
65 found |= quadCubicTests[index].answers[idx2].approximatelyEqual(xy1);
|
| PathOpsCubicIntersectionTest.cpp | 530 int idx2; local
533 for (idx2 = 0; idx2 < ts; ++idx2) {
534 SkDebugf("%s max[%d]=%1.9g (%1.9g, %1.9g)\n", __FUNCTION__, idx2,
535 max[idx2], cubic.ptAtT(max[idx2]).fX, cubic.ptAtT(max[idx2]).fY);
540 for (idx2 = 0; idx2 < ts1.count(); ++idx2)
[all...] |
| PathOpsCubicToQuadsTest.cpp | 75 for (int idx2 = 0; idx2 < 2; ++idx2) {
76 const SkDCubic& cubic = cubics[index][idx2];
83 SkDebugf("[%d][%d] unmatched start\n", static_cast<int>(index), idx2);
89 SkDebugf("[%d][%d] unmatched end\n", static_cast<int>(index), idx2);
|
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/asn1/ |
| DERObjectIdentifier.java | 381 int idx2 = enc[enc.length - 1] & 0x7f; local
393 possibleMatch = first[idx2];
396 return first[idx2] = new ASN1ObjectIdentifier(enc);
411 possibleMatch = first[idx2];
414 return first[idx2] = new ASN1ObjectIdentifier(enc);
422 idx2 = (idx2 + 1) & 0x7f;
423 possibleMatch = first[idx2];
426 return first[idx2] = new ASN1ObjectIdentifier(enc);
|
| /external/chromium_org/third_party/icu/source/tools/gencnval/ |
| gencnval.c | 646 uint32_t idx, idx2; local
692 for (idx2 = 0; idx2 < tags[standard].aliasList[idx].aliasCount; idx2++) {
693 uint16_t aliasNum = tags[standard].aliasList[idx].aliases[idx2];
795 uint16_t idx, idx2, idx3; local
798 for (idx2 = 0; idx2 < converterCount; idx2++) {
799 for (idx3 = 0; idx3 < tags[idx].aliasList[idx2].aliasCount; idx3++)
[all...] |
| /external/icu4c/tools/gencnval/ |
| gencnval.c | 656 uint32_t idx, idx2; local
701 for (idx2 = 0; idx2 < tags[standard].aliasList[idx].aliasCount; idx2++) {
702 uint16_t aliasNum = tags[standard].aliasList[idx].aliases[idx2];
803 uint16_t idx, idx2, idx3; local
806 for (idx2 = 0; idx2 < converterCount; idx2++) {
807 for (idx3 = 0; idx3 < tags[idx].aliasList[idx2].aliasCount; idx3++)
[all...] |
| /external/jdiff/src/jdiff/ |
| Comments.java | 113 int idx2 = xsdFileName.lastIndexOf('/'); local
114 if (idx == -1 && idx2 == -1) {
116 } else if (idx == -1 && idx2 != -1) {
117 xsdFileName = xsdFileName.substring(0, idx2+1);
118 } else if (idx != -1 && idx2 == -1) {
120 } else if (idx != -1 && idx2 != -1) {
121 int max = idx2 > idx ? idx2 : idx;
|
| CommentsHandler.java | 71 int idx2 = JDiff.newFileName.lastIndexOf('.'); local
73 "_to_" + JDiff.newFileName.substring(0, idx2);
|
| RootDocToXML.java | 71 int idx2 = xsdFileName.lastIndexOf('/'); local
72 if (idx == -1 && idx2 == -1) {
74 } else if (idx == -1 && idx2 != -1) {
75 xsdFileName = xsdFileName.substring(0, idx2);
76 } else if (idx != -1 && idx2 == -1) {
78 } else if (idx != -1 && idx2 != -1) {
79 int max = idx2 > idx ? idx2 : idx;
[all...] |
| /external/dropbear/libtomcrypt/src/math/fp/ |
| ltc_ecc_fp_mulmod.c | 1114 int idx1, idx2, err; local
[all...] |
| /external/eigen/unsupported/Eigen/src/BVH/ |
| KdBVH.h | 208 int idx2 = (int)boxes.size() - 1; local
209 boxes.push_back(boxes[idx1].merged(boxes[idx2]));
211 children.push_back(idx2);
|
| /external/chromium_org/third_party/skia/src/pathops/ |
| SkDQuadIntersection.cpp | 160 for (int idx2 = 0; idx2 < roots; ++idx2) {
161 double t = rootTs[0][idx2];
164 SkDPoint lPt = testLines[index]->ptAtT(rootTs[1][idx2]);
170 tsFound.push_back(rootTs[0][idx2]);
|
| SkPathOpsQuad.cpp | 79 for (int idx2 = 0; idx2 < foundRoots; ++idx2) {
80 if (approximately_equal(t[idx2], tValue)) {
|
| SkDCubicIntersection.cpp | 304 for (int idx2 = 0; idx2 < local.used(); ++idx2) {
305 double foundT = local[0][idx2];
310 if (local.pt(idx2).approximatelyEqual(line[0])) {
|
| /external/skia/src/pathops/ |
| SkDQuadIntersection.cpp | 160 for (int idx2 = 0; idx2 < roots; ++idx2) {
161 double t = rootTs[0][idx2];
164 SkDPoint lPt = testLines[index]->ptAtT(rootTs[1][idx2]);
170 tsFound.push_back(rootTs[0][idx2]);
|
| SkPathOpsQuad.cpp | 79 for (int idx2 = 0; idx2 < foundRoots; ++idx2) {
80 if (approximately_equal(t[idx2], tValue)) {
|
| SkDCubicIntersection.cpp | 304 for (int idx2 = 0; idx2 < local.used(); ++idx2) {
305 double foundT = local[0][idx2];
310 if (local.pt(idx2).approximatelyEqual(line[0])) {
|
| /external/aac/libAACenc/src/ |
| aacenc_tns.cpp | 626 int i, idx0, idx1, idx2, idx3, idx4, lag; local
642 idx2 = idx0 + i / 2;
652 idx2 = idx1 + i;
653 idx3 = idx2 + i;
659 INT sc2 = FDKaacEnc_ScaleUpSpectrum(pSpectrum, spectrum, idx1, idx2);
660 INT sc3 = FDKaacEnc_ScaleUpSpectrum(pSpectrum, spectrum, idx2, idx3);
666 for (nsc2=1; (1<<nsc2)<(idx2-idx1); nsc2++);
667 for (nsc3=1; (1<<nsc3)<(idx3-idx2); nsc3++);
672 rxx2_0 = FDKaacEnc_CalcAutoCorrValue(pSpectrum, idx1, idx2, 0, nsc2);
673 rxx3_0 = FDKaacEnc_CalcAutoCorrValue(pSpectrum, idx2, idx3, 0, nsc3)
[all...] |
| /external/chromium_org/v8/test/webkit/ |
| date-set-to-nan.js | 360 for (var idx2 in testValues)
361 if (idx0 != 0 || idx1 != 0 || idx2 != 0) {
365 testValues[idx2]);
370 + testValues[idx2] + ") was "
392 for (var idx2 in testValues)
394 if (idx0 != 0 || idx1 != 0 || idx2 != 0 || idx3 != 0) {
398 testValues[idx2],
404 + testValues[idx2] + ", "
|
| /external/opencv/cv/src/ |
| cvtemplmatch.cpp | 342 int idx = 0, idx2 = 0; local
482 idx2 = i * sqsum_step;
484 for( j = 0; j < result->cols; j++, idx += cn, idx2 += cn )
505 t = q0[idx2+k] - q1[idx2+k] - q2[idx2+k] + q3[idx2+k];
|
| cvemd.cpp | 100 int* idx2; member in struct:CvEMDState
309 int cj = state.idx2[j];
361 sizeof( int ) + sizeof(CvNode2D*)) + /* idx1 & idx2 */
388 state->idx2 = (int*) buffer;
421 state->idx2[dsize++] = i;
443 state->idx2[dsize++] = -1;
517 int cj = state->idx2[j];
[all...] |
| /external/chromium_org/third_party/libwebp/enc/ |
| histogram.c | 398 const uint32_t idx2 = (idx1 + diff + 1) % out_size; local
399 if (idx1 == idx2) {
404 out->histograms[idx2],
414 best_idx2 = idx2;
|
| /external/webp/src/enc/ |
| histogram.c | 398 const uint32_t idx2 = (idx1 + diff + 1) % out_size; local
399 if (idx1 == idx2) {
404 out->histograms[idx2],
414 best_idx2 = idx2;
|
| /frameworks/base/graphics/java/android/renderscript/ |
| Mesh.java | 750 * @param idx2 index of the second vertex in the triangle
755 public TriangleMeshBuilder addTriangle(int idx1, int idx2, int idx3) {
757 (idx2 >= mMaxIndex) || (idx2 < 0) ||
767 mIndexData[mIndexCount++] = (short)idx2;
|
| /dalvik/libdex/ |
| DexProto.cpp | 297 u4 idx2 = dexTypeListGetIdx(typeList2, i); local
300 dexStringByTypeIdx(dexFile2, idx2));
|
