/external/skia/tests/ |
PathOpsTightBoundsTest.cpp | 41 for (int idx2 = 0; idx2 < 10; ++idx2) { 116 for (int idx2 = 0; idx2 < 10; ++idx2) {
|
PathOpsAngleTest.cpp | 242 for (int idx2 = 0; idx2 < data.fPtCount; ++idx2) { 243 data.fShortPts[idx2] = data.fPts.fPts[idx2].asSkPoint(); 441 for (int idx2 = 0; idx2 < data.fPtCount; ++idx2) { 442 temp[idx2] = data.fPts.fPts[idx2].asSkPoint() [all...] |
PathOpsCubicLineIntersectionIdeas.cpp | 243 for (int idx2 = 0; idx2 <= worstLimit; ++idx2) { 244 SkDebugf("%1.9g ", worstStep[idx2]);
|
/external/lldb/source/Core/ |
RegularExpression.cpp | 204 RegularExpression::Match::GetMatchSpanningIndices (const char* s, uint32_t idx1, uint32_t idx2, llvm::StringRef& match_str) const 206 if (idx1 < m_matches.size() && idx2 < m_matches.size()) 208 if (m_matches[idx1].rm_so == m_matches[idx2].rm_eo) 214 else if (m_matches[idx1].rm_so < m_matches[idx2].rm_eo) 216 match_str = llvm::StringRef (s + m_matches[idx1].rm_so, m_matches[idx2].rm_eo - m_matches[idx1].rm_so);
|
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/asn1/ |
ASN1ObjectIdentifier.java | 428 int idx2 = enc[enc.length - 1] & 0x7f; local 440 possibleMatch = first[idx2]; 443 return first[idx2] = new ASN1ObjectIdentifier(enc); 458 possibleMatch = first[idx2]; 461 return first[idx2] = new ASN1ObjectIdentifier(enc); 469 idx2 = (idx2 + 1) & 0x7f; 470 possibleMatch = first[idx2]; 473 return first[idx2] = new ASN1ObjectIdentifier(enc);
|
/external/jetty/src/java/org/eclipse/jetty/webapp/ |
Ordering.java | 277 int idx2 = getIndexOf(list, b); local 280 if (idx2 < 0) 299 insert(list, idx2, f.getName()); 317 int idx2 = getIndexOf(list, a); local 320 if (idx2 < 0) 336 list.remove(idx2);
|
/external/icu/icu4c/source/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 | 111 int idx2 = xsdFileName.lastIndexOf('/'); local 112 if (idx == -1 && idx2 == -1) { 114 } else if (idx == -1 && idx2 != -1) { 115 xsdFileName = xsdFileName.substring(0, idx2+1); 116 } else if (idx != -1 && idx2 == -1) { 118 } else if (idx != -1 && idx2 != -1) { 119 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/skia/src/pathops/ |
SkOpAngle.cpp | 429 for (int idx2 = idx1 + 1; idx2 <= ptCount; ++idx2) { 430 if (idx1 == idx2) { 434 v.set(pts[idx2] - pts[idx1]); 467 for (int idx2 = 0; idx2 < i.used(); ++idx2) { 468 double testT = i[0][idx2]; 521 for (int idx2 = 0; idx2 <= ptCount; ++idx2) [all...] |
SkPathOpsQuad.cpp | 86 for (int idx2 = 0; idx2 < foundRoots; ++idx2) { 87 if (approximately_equal(t[idx2], tValue)) {
|
SkPathOpsCubic.cpp | 344 for (int idx2 = 0; idx2 < foundRoots; ++idx2) { 345 if (approximately_equal(t[idx2], 1)) { 352 for (int idx2 = 0; idx2 < foundRoots; ++idx2) { 353 if (approximately_equal(t[idx2], 0)) {
|
/external/lldb/include/lldb/Core/ |
RegularExpression.h | 78 GetMatchSpanningIndices (const char* s, uint32_t idx1, uint32_t idx2, llvm::StringRef& match_str) const;
|
/external/ceres-solver/internal/ceres/ |
compressed_row_sparse_matrix.cc | 497 for (int idx2 = m.rows()[r]; idx2 <= idx1; ++idx2) { 498 product.push_back(ProductTerm(m.cols()[idx1], m.cols()[idx2], product.size())); 531 for (int idx2 = row_begin; idx2 <= idx1; ++idx2, ++cursor) { 532 values[program[cursor]] += v1 * m_values[idx2];
|
/external/compiler-rt/lib/sanitizer_common/ |
sanitizer_bvgraph.h | 154 void check(uptr idx1, uptr idx2) const { 156 CHECK_LT(idx2, size());
|
sanitizer_bitvector.h | 148 uptr i2 = idx2(idx); 163 uptr i2 = idx2(idx); 177 uptr i2 = idx2(idx); 339 uptr idx2(uptr idx) const { function in class:__sanitizer::TwoLevelBitVector
|
/external/eigen/test/ |
visitor.cpp | 103 Index idx2 = eigen_maxidx; local 106 v2(idx0) = v2(idx2); 110 VERIFY(eigen_maxidx == (std::min)(idx0,idx2));
|
/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/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/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/webp/src/enc/ |
histogram.c | 538 const int idx2 = bin_map[bin_offset + n]; local 539 const double bit_cost_idx2 = histograms[idx2]->bit_cost_; 543 HistogramAddEval(histograms[idx1], histograms[idx2], 547 histograms[idx2]->bit_cost_ = 0.; 595 const uint32_t idx2 = (idx1 + diff + 1) % image_histo_size; local 596 if (idx1 == idx2) { 601 curr_cost_diff = HistogramAddEval(histograms[idx1], histograms[idx2], 611 best_idx2 = 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];
|
/external/libvncserver/x11vnc/ |
userinput.c | 7056 int xc, yc, wc, hc, idx2; local 7097 int ic, idx2; local 7915 int i, idx2, n = 0, found = 0, found_above = 0; local 8462 int i, idx, idx2, n = 0; local 9894 int idx2, ik2 = Ev_order[i2]; local [all...] |
/frameworks/base/rs/java/android/renderscript/ |
Mesh.java | 754 * @param idx2 index of the second vertex in the triangle 759 public TriangleMeshBuilder addTriangle(int idx1, int idx2, int idx3) { 761 (idx2 >= mMaxIndex) || (idx2 < 0) || 771 mIndexData[mIndexCount++] = (short)idx2;
|