| /external/chromium_org/third_party/brotli/src/brotli/enc/ |
| cluster.h | 37 int idx1; 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) {
72 idx2 = idx1;
73 idx1 = t
[all...] |
| /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/ |
| DERObjectIdentifier.java | 400 int idx1 = enc[enc.length - 2] & 0xff; local
408 ASN1ObjectIdentifier[] first = cache[idx1];
411 first = cache[idx1] = new ASN1ObjectIdentifier[128];
425 idx1 = (idx1 + 1) & 0xff;
426 first = cache[idx1];
429 first = cache[idx1] = new ASN1ObjectIdentifier[128];
|
| /external/eigen/unsupported/Eigen/src/BVH/ |
| KdBVH.h | 196 int idx1 = (int)boxes.size() - 1; local
197 boxes.push_back(boxes[idx1].merged(objBoxes[objCenters[mid].second]));
198 children.push_back(idx1);
206 int idx1 = (int)boxes.size() - 1; local
209 boxes.push_back(boxes[idx1].merged(boxes[idx2]));
210 children.push_back(idx1);
|
| /external/chromium_org/third_party/skia/experimental/StrokePathRenderer/ |
| GrStrokePathRenderer.cpp | 150 int idx0(-1), idx1(-1);
164 idx1 = vCount+offset;
225 ++idx1;
229 *idxs++ = idx1;
244 if (useMiterPoint && (idx0 >= 0) && (idx1 >= 0)) {
246 firstPt[idx1] = miterPt[1];
|
| /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)
|
| lua.h | 198 LUA_API int (lua_rawequal) (lua_State *L, int idx1, int idx2);
199 LUA_API int (lua_compare) (lua_State *L, int idx1, int idx2, int op);
|
| /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 | 496 for (int idx1 = m.rows()[r]; idx1 < m.rows()[r + 1]; ++idx1) {
497 for (int idx2 = m.rows()[r]; idx2 <= idx1; ++idx2) {
498 product.push_back(ProductTerm(m.cols()[idx1], m.cols()[idx2], product.size()));
529 for (int idx1 = row_begin; idx1 < row_end; ++idx1) {
530 const double v1 = m_values[idx1];
531 for (int idx2 = row_begin; idx2 <= idx1; ++idx2, ++cursor)
[all...] |
| /external/chromium_org/v8/test/webkit/ |
| date-set-to-nan.js | 329 for (var idx1 in testValues)
330 if (idx0 != 0 || idx1 != 0) {
333 testValues[idx1]);
338 + testValues[idx1] + ") was "
359 for (var idx1 in testValues)
361 if (idx0 != 0 || idx1 != 0 || idx2 != 0) {
364 testValues[idx1],
369 + testValues[idx1] + ", "
391 for (var idx1 in testValues)
394 if (idx0 != 0 || idx1 != 0 || idx2 != 0 || idx3 != 0)
[all...] |
| /external/compiler-rt/lib/sanitizer_common/ |
| sanitizer_bvgraph.h | 154 void check(uptr idx1, uptr idx2) const {
155 CHECK_LT(idx1, size());
|
| sanitizer_bitvector.h | 147 uptr i1 = idx1(idx);
162 uptr i1 = idx1(idx);
176 uptr i1 = idx1(idx);
333 uptr idx1(uptr idx) const { function in class:__sanitizer::TwoLevelBitVector
|
| sanitizer_deadlock_detector.h | 352 // idx1 and idx2 are raw indices to g_, not lock IDs.
353 bool testOnlyHasEdgeRaw(uptr idx1, uptr idx2) {
354 return g_.hasEdge(idx1, idx2);
|
| /external/jdiff/src/jdiff/ |
| CommentsHandler.java | 70 int idx1 = JDiff.oldFileName.lastIndexOf('.'); local
72 String filename2 = JDiff.oldFileName.substring(0, idx1) +
|
| /external/eigen/test/ |
| visitor.cpp | 102 Index idx1 = eigen_minidx; local
105 v1(idx0) = v1(idx1);
109 VERIFY(eigen_minidx == (std::min)(idx0,idx1));
|
| /external/aac/libAACenc/src/ |
| aacenc_tns.cpp | 626 int i, idx0, idx1, idx2, idx3, idx4, lag; local
641 idx1 = idx0 + i / 4;
651 idx1 = lpcStartLine[HIFILT];
652 idx2 = idx1 + i;
658 INT sc1 = FDKaacEnc_ScaleUpSpectrum(pSpectrum, spectrum, idx0, idx1);
659 INT sc2 = FDKaacEnc_ScaleUpSpectrum(pSpectrum, spectrum, idx1, idx2);
665 for (nsc1=1; (1<<nsc1)<(idx1-idx0); nsc1++);
666 for (nsc2=1; (1<<nsc2)<(idx2-idx1); nsc2++);
671 rxx1_0 = FDKaacEnc_CalcAutoCorrValue(pSpectrum, idx0, idx1, 0, nsc1);
672 rxx2_0 = FDKaacEnc_CalcAutoCorrValue(pSpectrum, idx1, idx2, 0, nsc2)
[all...] |
| /external/chromium_org/third_party/libwebp/enc/ |
| histogram.c | 535 const int idx1 = bin_map[bin_offset + 1]; local
543 HistogramAddEval(histograms[idx1], histograms[idx2],
546 HistogramCopy(cur_combo, histograms[idx1]);
591 const uint32_t idx1 = MyRand(&seed) % image_histo_size; local
595 const uint32_t idx2 = (idx1 + diff + 1) % image_histo_size;
596 if (idx1 == idx2) {
601 curr_cost_diff = HistogramAddEval(histograms[idx1], histograms[idx2],
610 best_idx1 = idx1;
|
| /external/chromium_org/ui/events/gesture_detection/ |
| gesture_detector.cc | 372 const int idx1 = secondary_pointer_down_event_->GetActionIndex(); local
373 dx = secondary_pointer_down_event_->GetX(idx1) - ev.GetX(ev_idx1);
374 dy = secondary_pointer_down_event_->GetY(idx1) - ev.GetY(ev_idx1);
|
| /dalvik/libdex/ |
| DexProto.cpp | 296 u4 idx1 = dexTypeListGetIdx(typeList1, i); local
299 strcmp(dexStringByTypeIdx(dexFile1, idx1),
|
| DexSwapVerify.cpp | 734 u4 idx1 = dexParameterIteratorNextIndex(&iterator); local
736 if (idx1 == kDexNoIndex) {
745 if (idx0 < idx1) {
747 } else if (idx0 > idx1) {
1038 u4 idx1 = dexTypeListGetIdx(interfaces, i); local
[all...] |
| /external/opencv/cv/include/ |
| cvcompat.h | 481 #define cvQueryHistValue_2D( hist, idx0, idx1 ) \
482 ((float)cvGetReal2D( (hist)->bins, (idx0), (idx1)))
483 #define cvQueryHistValue_3D( hist, idx0, idx1, idx2 ) \
484 ((float)cvGetReal3D( (hist)->bins, (idx0), (idx1), (idx2)))
492 #define cvGetHistValue_2D( hist, idx0, idx1 ) \
493 ((float*)cvPtr2D( (hist)->bins, (idx0), (idx1), 0))
494 #define cvGetHistValue_3D( hist, idx0, idx1, idx2 ) \
495 ((float*)cvPtr3D( (hist)->bins, (idx0), (idx1), (idx2), 0))
[all...] |
| /external/opencv/cv/src/ |
| cvemd.cpp | 99 int* idx1; member in struct:CvEMDState
308 int ci = state.idx1[i];
361 sizeof( int ) + sizeof(CvNode2D*)) + /* idx1 & idx2 */
385 state->idx1 = (int*) buffer;
406 state->idx1[ssize++] = i;
438 state->idx1[ssize++] = -1;
508 int ci = state->idx1[i];
[all...] |
| /external/opencv/cxcore/include/ |
| cxcore.h | 336 /* ptr = &arr(idx0,idx1,...). All indexes are zero-based,
339 CVAPI(uchar*) cvPtr2D( const CvArr* arr, int idx0, int idx1, int* type CV_DEFAULT(NULL) );
340 CVAPI(uchar*) cvPtr3D( const CvArr* arr, int idx0, int idx1, int idx2,
351 /* value = arr(idx0,idx1,...) */
353 CVAPI(CvScalar) cvGet2D( const CvArr* arr, int idx0, int idx1 );
354 CVAPI(CvScalar) cvGet3D( const CvArr* arr, int idx0, int idx1, int idx2 );
359 CVAPI(double) cvGetReal2D( const CvArr* arr, int idx0, int idx1 );
360 CVAPI(double) cvGetReal3D( const CvArr* arr, int idx0, int idx1, int idx2 );
363 /* arr(idx0,idx1,...) = value */
365 CVAPI(void) cvSet2D( CvArr* arr, int idx0, int idx1, CvScalar value )
[all...] |
| /external/chromium_org/third_party/skia/src/pathops/ |
| SkOpAngle.cpp | 383 for (int idx1 = 0; idx1 <= ptCount - 1; ++idx1) {
384 for (int idx2 = idx1 + 1; idx2 <= ptCount; ++idx2) {
385 if (idx1 == idx2) {
389 v.set(pts[idx2] - pts[idx1]);
[all...] |
| /external/opencv/cxcore/src/ |
| cxutils.cpp | 876 int idx1 = pair_buf[j], idx2 = pair_buf[j+1], row1, row2; local
878 row1 = idx1/step; row2 = idx2/step;
879 p = idata + row1*step + (idx1 - row1*cols)*elem_size;
888 int idx1 = pair_buf[j], idx2 = pair_buf[j+1], row1, row2; local
890 row1 = idx1/step; row2 = idx2/step;
891 p = data + row1*step + (idx1 - row1*cols)*elem_size;
[all...] |
