| /external/webkit/PerformanceTests/SunSpider/tests/v8-v5/ |
| v8-raytrace.js | 708 var best = new Flog.RayTracer.IntersectionInfo();
709 best.distance = 2000;
716 if(info.isHit && info.distance >= 0 && info.distance < best.distance){
717 best = info;
722 best.hitCount = hits;
723 return best;
|
| /external/webkit/PerformanceTests/SunSpider/tests/v8-v6/ |
| v8-raytrace.js | 677 var best = new Flog.RayTracer.IntersectionInfo();
678 best.distance = 2000;
685 if(info.isHit && info.distance >= 0 && info.distance < best.distance){
686 best = info;
691 best.hitCount = hits;
692 return best;
|
| /packages/apps/Settings/src/com/android/settings/ |
| SecuritySettings.java | 403 int best = 0; local
407 best = i;
410 mLockAfter.setSummary(getString(R.string.lock_after_timeout_summary, entries[best]));
|
| /external/quake/quake/src/QW/client/ |
| gl_draw.c | 123 int best, best2; local
128 best = BLOCK_HEIGHT;
136 if (scrap_allocated[texnum][i+j] >= best)
144 *y = best = best2;
148 if (best + h > BLOCK_HEIGHT)
152 scrap_allocated[texnum][*x + i] = best + h;
[all...] |
| gl_rsurf.c | 1435 int best, best2; local
1440 best = BLOCK_HEIGHT;
1448 if (allocated[texnum][i+j] >= best)
1456 *y = best = best2;
1460 if (best + h > BLOCK_HEIGHT)
1464 allocated[texnum][*x + i] = best + h;
[all...] |
| gl_screen.c | 756 int best = 0; local
774 best = i;
778 lastbest = best;
779 return best;
|
| /external/ceres-solver/docs/ |
| ceres-solver.tex | 106 Despite our best efforts, this manual remains a work in progress and the source code for Ceres Solver remains the ultimate reference.
|
| /external/llvm/test/Bindings/Ocaml/ |
| executionengine.ml | 10 (* Note that this takes a moment to link, so it's best to keep the number of
|
| /packages/inputmethods/OpenWnn/src/jp/co/omronsoft/openwnn/JAJP/ |
| OpenWnnClauseConverterJAJP.java | 179 /* there may be no way to be the best sequence from the 'start' */
184 /* there may be no way to be the best sequence from the 'start' */
215 /* update the best sub-sentence on the cache buffer */
349 /* reserve only the best clause */
350 WnnClause best = (WnnClause)clauseList.get(0); local
351 if (best.frequency < clause.frequency) {
|
| /dalvik/vm/reflect/ |
| Proxy.cpp | 393 bool best, dupe; local
400 * assignable to our return type, then we're not the best.
406 best = true;
426 best = false;
431 * If this is the best of a set of duplicates, copy it over and
438 if (best) {
439 ALOGV("BEST %d %s.%s -> %d", i,
516 ALOGV("BEST not %d", i);
[all...] |