| /external/eigen/bench/ |
| BenchTimer.h | 41 /** Elapsed time timer keeping the best try.
98 /** Return the best elapsed time in seconds
100 inline double best(int TIMER = CPU_TIMER) const function in class:Eigen::BenchTimer
|
| /external/srec/srec/Recognizer/include/ |
| SR_RecognizerResultImpl.h | 45 * N-best list.
49 * Size of n-best list.
64 * N-best list. ArrayList of ArrayLists of SR_SemanticResult.
|
| /frameworks/base/docs/html/training/efficient-downloads/ |
| index.jd | 29 <p>This class demonstrates the best practices for scheduling and executing downloads using techniques such as caching, polling, and prefetching. You will learn how the power-use profile of the wireless radio can affect your choices on when, what, and how to transfer data in order to minimize impact on battery life.</p>
42 <dd>This lesson will examine how your refresh frequency can be varied to best mitigate the effect of background updates on the underlying wireless radio state machine.</dd>
45 <dd>The most fundamental way to reduce your downloads is to download only what you need. This lesson introduces some best practices to eliminate redundant downloads.</dd>
|
| /packages/apps/ContactsCommon/src/com/android/contacts/common/util/ |
| BitmapUtil.java | 39 // test what the best sample size is
55 // Test what the best sample size is. To do that, we find the sample size that gives us
56 // the best trade-off between resulting image size and memory requirement. We allow
|
| /external/llvm/lib/CodeGen/ |
| LatencyPriorityQueue.cpp | 121 std::vector<SUnit *>::iterator Best = Queue.begin();
124 if (Picker(*Best, *I))
125 Best = I;
126 SUnit *V = *Best;
127 if (Best != prior(Queue.end()))
128 std::swap(*Best, Queue.back());
|
| /packages/apps/Contacts/src/com/android/contacts/quickcontact/ |
| ResolveCache.java | 103 * Cached entry holding the best {@link ResolveInfo} for a specific
120 * Get the {@link Entry} best associated with the given {@link Action},
139 // Pick first match, otherwise best found
161 * Best {@link ResolveInfo} when multiple found. Ties are broken by
206 * Find the best description for the given {@link Action}, usually used
224 * Return the best icon for the given {@link Action}, which is usually
|
| /external/apache-http/src/org/apache/http/client/params/ |
| CookiePolicy.java | 58 * The default 'best match' policy.
60 public static final String BEST_MATCH = "best-match";
|
| /external/chromium/base/ |
| utf_string_conversions.h | 18 // do the best it can and put the result in the output buffer. The versions that
19 // return strings ignore this error and just return the best conversion
|
| /external/chromium_org/base/strings/ |
| utf_string_conversions.h | 19 // do the best it can and put the result in the output buffer. The versions that
20 // return strings ignore this error and just return the best conversion
|
| /external/chromium_org/chrome/browser/task_manager/ |
| task_manager_util.cc | 78 // "Yahoo! Mail: The best web-based Email!", without setting it explicitly
79 // as LTR format, the concatenated result will be "!Yahoo! Mail: The best
|
| /external/chromium_org/content/browser/geolocation/ |
| location_arbitrator_impl.h | 28 // providers and resolving them to a single 'best' location fix at any given
92 // The current best estimate of our position.
|
| /external/chromium_org/third_party/openssl/openssl/crypto/des/ |
| README | 16 The best way to build this library is to build it as part of SSLeay.
36 These routines are best compiled with gcc or any other good
|
| /external/dnsmasq/contrib/openvpn/ |
| README | 28 > Anyway, my question: is there a way to have the best of both worlds?
32 > My current best idea on how to solve this problem is modifying the
|
| /external/libvpx/libvpx/vp8/encoder/ |
| encodemb.c | 252 int best; local
325 /* And pick the best. */
326 best = rd_cost1 < rd_cost0;
330 tokens[i][0].rate = base_bits + (best ? rate1 : rate0);
331 tokens[i][0].error = d2 + (best ? error1 : error0);
335 best_mask[0] |= best << i;
391 /* And pick the best. */
392 best = rd_cost1 < rd_cost0;
400 tokens[i][1].rate = base_bits + (best ? rate1 : rate0);
401 tokens[i][1].error = d2 + (best ? error1 : error0)
[all...] |
| /external/libvpx/libvpx/vp9/encoder/ |
| vp9_encodemb.c | 132 int best, band, pt; local
191 /* And pick the best. */
192 best = rd_cost1 < rd_cost0;
196 tokens[i][0].rate = base_bits + (best ? rate1 : rate0);
197 tokens[i][0].error = d2 + (best ? error1 : error0);
201 best_index[i][0] = best;
246 /* And pick the best. */
247 best = rd_cost1 < rd_cost0;
254 tokens[i][1].rate = base_bits + (best ? rate1 : rate0);
255 tokens[i][1].error = d2 + (best ? error1 : error0)
[all...] |
| /external/openssh/ |
| dh.c | 129 int best, bestcount, which; local
141 best = bestcount = 0;
152 if ((dhg.size > wantbits && dhg.size < best) ||
153 (dhg.size > best && best < wantbits)) {
154 best = dhg.size;
157 if (dhg.size == best)
174 dhg.size != best ||
|
| /external/openssl/crypto/des/ |
| README | 16 The best way to build this library is to build it as part of SSLeay.
36 These routines are best compiled with gcc or any other good
|
| /external/chromium_org/third_party/tcmalloc/chromium/src/ |
| page_heap.cc | 111 // find the best span (closest to n in size).
112 // The following loops implements address-ordered best-fit.
113 Span *best = NULL; local
120 if ((best == NULL)
121 || (span->length < best->length)
122 || ((span->length == best->length) && (span->start < best->start))) {
123 best = span;
124 ASSERT(best->location == Span::ON_NORMAL_FREELIST);
134 if ((best == NULL
[all...] |
| /frameworks/native/opengl/tests/hwc/ |
| hwcCommit.cpp | 539 testPrintI(" HScale Best Display Frame: %s",
541 testPrintI(" HScale Best Source Crop: %s",
554 testPrintI(" VScale Best Display Frame: %s",
556 testPrintI(" VScale Best Source Crop: %s",
[all...] |
| /external/qemu/distrib/sdl-1.2.15/src/video/x11/ |
| SDL_x11modes.c | 126 int best = -1; local
133 best = i;
138 if ( best < 0 ||
139 (modes[i]->hdisplay < modes[best]->hdisplay &&
140 modes[i]->vdisplay <= modes[best]->vdisplay) ||
141 (modes[i]->vdisplay < modes[best]->vdisplay &&
142 modes[i]->hdisplay <= modes[best]->hdisplay) ) {
143 best = i;
147 if ( best >= 0 &&
148 ((modes[best]->hdisplay != mode.hdisplay) |
[all...] |
| /build/target/board/vbox_x86/ |
| disk_layout.conf | 0 # Best to align all partion start/ends on a cylinder boundary (fdisk prefers it)
|
| /development/samples/TicTacToeLib/ |
| AndroidManifest.xml | 24 automatically, so it's best to define your activities here like for any
|
| /external/antlr/antlr-3.4/runtime/Perl5/ |
| README | 20 Currently, it's best to check the syntax of the generated code, like so:
|
| /external/chromium/chrome/browser/sync/protocol/ |
| encryption.proto | 23 // that happens, we make a best effort to reencrypt all nodes with the new
|
| /external/chromium_org/base/process/ |
| process_metrics_ios.cc | 52 // Error case: Take a best guess.
|
