| /external/chromium_org/third_party/brotli/src/brotli/enc/ |
| cluster.h | 38 int idx2; member in struct:brotli::HistogramPair
49 return abs(p1.idx1 - p1.idx2) > abs(p2.idx1 - p2.idx2);
60 // Computes the bit cost reduction by combining out[idx1] and out[idx2] and if
61 // it is below a threshold, stores the pair (idx1, idx2) in the *pairs heap.
65 int idx1, int idx2,
67 if (idx1 == idx2) {
70 if (idx2 < idx1) {
71 int t = idx2;
72 idx2 = idx1
[all...] |
| /external/chromium_org/third_party/skia/tests/ |
| PathOpsTightBoundsTest.cpp | 42 for (int idx2 = 0; idx2 < 10; ++idx2) {
117 for (int idx2 = 0; idx2 < 10; ++idx2) {
|
| PathOpsCubicIntersectionTest.cpp | 562 int idx2; local
565 for (idx2 = 0; idx2 < ts; ++idx2) {
566 SkDebugf("%s max[%d]=%1.9g (%1.9g, %1.9g)\n", __FUNCTION__, idx2,
567 max[idx2], cubic.ptAtT(max[idx2]).fX, cubic.ptAtT(max[idx2]).fY);
572 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);
|
| PathOpsAngleTest.cpp | 252 for (int idx2 = 0; idx2 < data.fPtCount; ++idx2) {
253 data.fShortPts[idx2] = data.fPts.fPts[idx2].asSkPoint();
413 for (int idx2 = 0; idx2 < data.fPtCount; ++idx2) {
414 temp[idx2] = data.fPts.fPts[idx2].asSkPoint()
[all...] |
| PathOpsCubicLineIntersectionIdeas.cpp | 243 for (int idx2 = 0; idx2 <= worstLimit; ++idx2) {
244 SkDebugf("%1.9g ", worstStep[idx2]);
|
| PathOpsCubicQuadIntersectionTest.cpp | 92 for (int idx2 = 0; idx2 < quadCubicTests[index].answerCount; ++idx2) {
93 found |= quadCubicTests[index].answers[idx2].approximatelyEqual(xy1);
|
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/asn1/ |
| DERObjectIdentifier.java | 402 int idx2 = enc[enc.length - 1] & 0x7f; local
414 possibleMatch = first[idx2];
417 return first[idx2] = new ASN1ObjectIdentifier(enc);
432 possibleMatch = first[idx2];
435 return first[idx2] = new ASN1ObjectIdentifier(enc);
443 idx2 = (idx2 + 1) & 0x7f;
444 possibleMatch = first[idx2];
447 return first[idx2] = new ASN1ObjectIdentifier(enc);
|
| /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/chromium_org/third_party/skia/experimental/Intersection/ |
| CubicToQuadratics_Test.cpp | 62 for (int idx2 = 0; idx2 < 2; ++idx2) {
63 const Cubic& cubic = cubics[index][idx2];
72 printf("[%d][%d] unmatched start\n", (int) index, idx2);
77 printf("[%d][%d] unmatched end\n", (int) index, idx2);
|
| CubicIntersection_Test.cpp | 742 int idx2; local
745 for (idx2 = 0; idx2 < ts; ++idx2) {
746 SkDebugf("%s max[%d]=%1.9g (%1.9g, %1.9g)\n", __FUNCTION__, idx2,
747 max[idx2], xy_at_t(cubic, max[idx2]).x, xy_at_t(cubic, max[idx2]).y);
752 for (idx2 = 0; idx2 < ts1.count(); ++idx2)
[all...] |
| QuarticRoot.cpp | 178 for (int idx2 = 0; idx2 < nums[index]; ++idx2) {
179 SkDebugf(" %1.9g", tries[index][idx2]);
|
| QuadraticUtilities.cpp | 87 for (int idx2 = 0; idx2 < foundRoots; ++idx2) {
88 if (approximately_equal(t[idx2], tValue)) {
|
| /external/chromium_org/third_party/icu/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/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 | 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);
|
| /external/chromium_org/third_party/skia/src/pathops/ |
| SkOpContour.cpp | 149 for (int idx2 = 1; idx2 < count; ++idx2) {
150 const SkCoincidence& innerCoin = fCoincidences[idx2];
198 for (int idx2 = 0; idx2 < 2; ++idx2) {
199 if (coincidence->fPts[0][idx2] == aligned.fOldPt
200 && coincidence->fTs[swap][idx2] == aligned.fOldT) {
201 SkASSERT(SkDPoint::RoughlyEqual(coincidence->fPts[0][idx2], aligned.fPt))
[all...] |
| SkOpAngle.cpp | 384 for (int idx2 = idx1 + 1; idx2 <= ptCount; ++idx2) {
385 if (idx1 == idx2) {
389 v.set(pts[idx2] - pts[idx1]);
421 for (int idx2 = 0; idx2 < i.used(); ++idx2) {
422 double testT = i[0][idx2];
498 for (int idx2 = 0; idx2 <= ptCount; ++idx2)
[all...] |
| /external/chromium_org/third_party/skia/third_party/lua/src/ |
| luaconf.h | 297 #define lua_equal(L,idx1,idx2) lua_compare(L,(idx1),(idx2),LUA_OPEQ)
298 #define lua_lessthan(L,idx1,idx2) lua_compare(L,(idx1),(idx2),LUA_OPLT)
|
| /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));
|
