HomeSort by relevance Sort by last modified time
    Searched defs:sum (Results 201 - 225 of 362) sorted by null

1 2 3 4 5 6 7 891011>>

  /gdk/samples/quake/jni/
zone.cpp 318 int count, sum; local
324 sum = 0;
365 sum += h->size;
381 Con_Printf (" :%8i %8s (TOTAL)\n",sum, name);
383 sum = 0;
  /libcore/luni/src/main/native/
cbigint.cpp 824 uint64_t intermediate, carry1, carry2, prod1, prod2, sum; local
840 sum = intermediate + prod1;
841 if ((sum < prod1) || (sum < intermediate))
853 intermediate = carry2 + HIGH_IN_U64 (sum) + prod1 + prod2;
862 LOW_U32_FROM_PTR (pArg1) = LOW_U32_FROM_VAR (sum);
  /libcore/luni/src/test/java/tests/java/sql/
SelectFunctionalityTest.java 395 String selectQuery = "SELECT rating, SUM(snum) AS sum FROM "
406 int sum = result.getInt("sum"); local
409 assertEquals("Wrong value of sum field", values.get(rating),
410 new Integer(sum));
411 assertEquals(new Integer(sum), values.remove(rating));
481 String selectSum = "SELECT sum(onum) as sum FROM "
491 func("sum", selectSum, 30062)
    [all...]
  /packages/apps/Phone/src/com/android/phone/
EditPhoneNumberPreference.java 159 CharSequence sum; local
165 sum = (mSummaryOn == null) ? getSummary() : mSummaryOn;
167 sum = (mSummaryOff == null) ? getSummary() : mSummaryOff;
170 sum = getSummary();
173 if (sum != null) {
174 summaryView.setText(sum);
  /cts/tests/tests/telephony/src/android/telephony/cts/
TelephonyManagerTest.java 199 * Use decimal value (0-9) to index into array to get sum of its digits
209 * finding a number to make the sum divisible by 10.
215 int sum = 0; local
220 sum += digit;
222 sum += DOUBLE_DIGIT_SUM[digit];
225 sum %= 10;
226 return sum == 0 ? 0 : 10 - sum;
  /external/chromium/base/metrics/
histogram.h 340 int64 sum() const { return sum_; } function in class:base::Histogram::SampleSet
357 int64 sum_; // sum of samples.
365 // count to the sum of the counts in all buckets, and detect problems. Note
519 static uint32 Crc32(uint32 sum, Sample range);
  /external/clang/lib/AST/
Stmt.cpp 56 unsigned sum = 0; local
60 sum += StmtClassInfo[i].Counter;
62 llvm::errs() << " " << sum << " stmts/exprs total.\n";
63 sum = 0;
71 sum += StmtClassInfo[i].Counter*StmtClassInfo[i].Size;
74 llvm::errs() << "Total bytes = " << sum << "\n";
  /external/flac/libFLAC/
metadata_object.c 1712 FLAC__uint32 i, length, sum = 0; local
    [all...]
  /external/fsck_msdos/
dir.c 199 u_char sum = 0; local
203 sum = (sum << 7)|(sum >> 1); /* rotate right */
204 sum += p[i];
207 return sum;
  /external/icu4c/tools/makeconv/
genmbcs.c 190 int32_t i, sum, maxCharLength, local
197 sum=mbcsData->ucm->states.countToUCodeUnits;
199 printf("the total number of offsets is 0x%lx=%ld\n", (long)sum, (long)sum);
202 if(sum>0) {
203 mbcsData->unicodeCodeUnits=(uint16_t *)uprv_malloc(sum*sizeof(uint16_t));
206 (long)sum);
209 for(i=0; i<sum; ++i) {
220 sum=0x20000;
223 sum=0x100000*maxCharLength
    [all...]
  /external/jmonkeyengine/engine/src/blender/com/jme3/scene/plugins/blender/modifiers/
ArmatureModifier.java 374 float sum = w0 + w1 + w2 + w3; local
375 if (sum != 1f && sum != 0.0f) {
377 // compute new vals based on sum
378 float sumToB = 1f / sum;
  /external/libvpx/vp8/common/
postproc.c 232 int sum = 0; local
237 sum += s[i];
246 sum += x;
251 if (sumsq * 15 - sum * sum < flimit)
253 d[c&15] = (8 + sum + s[c]) >> 4;
276 int sum = 0; local
283 sum += s[i*pitch];
289 sum += s[7*pitch] - s[-8*pitch];
292 if (sumsq * 15 - sum * sum < flimit
    [all...]
  /external/libvpx/vp8/encoder/
encodeframe.c 428 int sum; local
439 x->src.y_stride, VP8_VAR_OFFS, 0, &sse, &sum); local
441 act = (sse<<8) - sum*sum;
    [all...]
pickinter.c 103 int sum = 0; local
112 sum += diff;
120 pred_error -= sum * sum / 256;
  /external/opencv/cv/src/
cvfloodfill.cpp 382 int sum[] = {0,0,0}, val0[] = {0,0,0}; local
561 sum[0] += img[i];
650 sum[0] += img[i*3];
651 sum[1] += img[i*3+1];
652 sum[2] += img[i*3+2];
670 region->value = cvScalar(sum[0]*iarea, sum[1]*iarea, sum[2]*iarea);
688 double sum[] = {0,0,0}, val0[] = {0,0,0}; local
868 sum[0] += img[i]
    [all...]
cvstereobm.cpp 43 * Very fast SAD-based (Sum-of-Absolute-Diffrences) stereo correspondence algorithm. *
152 int sum = vsum[0]*(wsz2 + 1); local
154 sum += vsum[x];
156 int val = ((curr[0]*5 + curr[1] + prev[0] + next[0])*scale_g - sum*scale_s) >> 10;
161 sum += vsum[x+wsz2] - vsum[x-wsz2-1];
162 val = ((curr[x]*4 + curr[x-1] + curr[x+1] + prev[x] + next[x])*scale_g - sum*scale_s) >> 10;
166 sum += vsum[x+wsz2] - vsum[x-wsz2-1];
167 val = ((curr[x]*5 + curr[x-1] + prev[x] + next[x])*scale_g - sum*scale_s) >> 10;
cvtemplmatch.cpp 326 CvMat* sum = 0; local
425 CV_CALL( sum = cvCreateMat( img->rows + 1, img->cols + 1,
429 CV_CALL( cvIntegral( img, sum, 0, 0 ));
438 CV_CALL( cvIntegral( img, sum, sqsum, 0 ));
470 p0 = (double*)sum->data.ptr;
472 p2 = (double*)(sum->data.ptr + templ->rows*sum->step);
475 sum_step = sum ? sum->step / sizeof(double) : 0;
532 cvReleaseMat( &sum );
    [all...]
  /external/opencv/cvaux/src/
cvlevmarprojbandle.cpp 402 double sum = 0; local
407 sum += cvmGet(pointDeriv[currImage],0,shifts[currImage]*4+i) *
410 sum += cvmGet(pointDeriv[currImage],1,shifts[currImage]*4+i) *
415 cvmSet(matrV[currPoint],i,j,sum);
511 double sum; local
512 sum = cvmGet(projDeriv[currImage],currVis*2+0,currLine) *
515 sum += cvmGet(projDeriv[currImage],currVis*2+1,currLine) *
518 cvmSet(matrW,currImage*12+currLine,currPoint*4+currCol,sum);
596 double sum = 0; local
599 sum += cvmGet(projDeriv[currImage],i,currCol) *
677 double sum = 0; local
1483 double sum = 0; local
1549 double sum = 0; local
    [all...]
  /external/opencv/cxcore/src/
cxsumpixels.cpp 45 * Find sum of pixels in the ROI *
169 sum[0] = (sumtype)tmp##0
172 sum[0] = (sumtype)tmp##0; \
173 sum[1] = (sumtype)tmp##1;
176 sum[0] = (sumtype)tmp##0; \
177 sum[1] = (sumtype)tmp##1; \
178 sum[2] = (sumtype)tmp##2;
181 sum[0] = (sumtype)tmp##0; \
182 sum[1] = (sumtype)tmp##1; \
183 sum[2] = (sumtype)tmp##2;
393 CvScalar sum = {{0,0,0,0}}; local
    [all...]
  /external/opencv/ml/src/
mlem.cpp 958 double* pp = (double*)(probs->data.ptr + probs->step*i), sum = 0; local
960 sum += pp[j];
961 sum = 1./MAX( sum, DBL_EPSILON );
964 double p = pp[j] *= sum;
967 _log_likelihood -= log( sum );
981 double sum = sp_data[k], inv_sum = 1.\/sum; local
    [all...]
  /external/openfst/src/include/fst/
accumulator.h 56 Weight Sum(Weight w, Weight v) {
61 Weight Sum(Weight w, ArcIterator *aiter, ssize_t begin,
63 Weight sum = w; local
66 sum = Plus(sum, aiter->Value().weight);
67 return sum;
95 Weight Sum(Weight w, Weight v) {
100 Weight Sum(Weight w, ArcIterator *aiter, ssize_t begin,
102 Weight sum = w; local
105 sum = LogPlus(sum, aiter->Value().weight)
261 double sum = FloatLimits<double>::kPosInfinity; local
501 Weight sum = w; local
    [all...]
randgen.h 79 double sum = 0.0; local
83 sum += exp(-to_log_weight_(arc.weight).Value());
85 sum += exp(-to_log_weight_(fst.Final(s)).Value());
94 if (p > r * sum) return n;
126 double sum = to_log_weight_(accumulator->Sum(fst.Final(s), &aiter, 0, local
129 return accumulator->LowerBound(r + sum, &aiter);
  /external/qemu/block/
raw-posix.c 318 int size, ret, shift, sum; local
320 sum = 0;
343 sum += size;
346 return sum;
375 sum += size;
378 return sum;
382 return raw_pread_aligned(bs, offset, buf, count) + sum;
406 int size, ret, shift, sum; local
408 sum = 0;
431 sum += size
    [all...]
  /external/smali/dexlib/src/main/java/org/jf/dexlib/
DexFile.java 889 int sum = (int) a32.getValue(); local
    [all...]
  /external/srec/tools/thirdparty/OpenFst/fst/lib/
replace.h 446 int sum = 0; local
448 sum += x.prefix_[i].fst_id + x.prefix_[i].nextstate*kPrime0;
450 return (size_t) sum;

Completed in 692 milliseconds

1 2 3 4 5 6 7 891011>>