/external/qemu/distrib/sdl-1.2.15/docs/man3/ |
SDL_MapRGBA.3 | 18 A pixel value best approximating the given RGBA color value for a given pixel format\&. If the pixel format bpp (color depth) is less than 32-bpp then the unused upper bits of the return value can safely be ignored (e\&.g\&., with a 16-bpp format the return value can be assigned to a \fBUint16\fP, and similarly a \fBUint8\fP for an 8-bpp format)\&.
|
SDL_VideoInfo.3 | 58 This (read-only) structure is returned by \fI\fBSDL_GetVideoInfo\fP\fR\&. It contains information on either the \&'best\&' available mode (if called before \fI\fBSDL_SetVideoMode\fP\fR) or the current video mode\&.
|
/external/skia/src/gpu/gl/unix/ |
SkNativeGLContext_unix.cpp | 139 int best = -1, best_num_samp = -1; local 148 if (best < 0 || (samp_buf && samples > best_num_samp)) 149 best = i, best_num_samp = samples; 152 XVisualInfo temp = visReturn[best];
|
/external/srec/config/en.us/grammars/ |
digits.grxml | 5 digits. For best accuracy, is is always better to apply constraints
|
/external/valgrind/main/memcheck/tests/ |
dw4.c | 17 its best guess as to what "a" actually is. a must be
|
varinfo1.c | 18 its best guess as to what "a" actually is. a must be
|
varinfo2.c | 18 its best guess as to what "a" actually is. a must be
|
varinfo4.c | 18 its best guess as to what "a" actually is. a must be
|
/external/webrtc/src/system_wrappers/source/ |
critical_section_posix.cc | 14 // no equivalent to DCHECK_EQ in WebRTC code so this is the best we can do here.
|
/frameworks/av/media/libstagefright/codecs/on2/h264dec/omxdl/reference/vc/m4p10/src/ |
omxVCM4P10_BlockMatch_Half.c | 30 * Returns the best MV and associated cost. This function estimates the 57 * pSrcDstBestMV - The best MV resulting from a prior integer search, 62 * pSrcDstBestMV - Best MV resulting from the half-pel search, expressed in 64 * pBestCost - Motion cost associated with the best MV; computed as
|
omxVCM4P10_BlockMatch_Quarter.c | 30 * search. Returns the best MV and associated cost. This function estimates 57 * pSrcDstBestMV - The best MV resulting from a prior half-pel search, 62 * pSrcDstBestMV - Best MV resulting from the quarter-pel search, expressed 64 * pBestCost - Motion cost associated with the best MV; computed as
|
/ndk/sources/host-tools/make-3.81/tests/scripts/variables/ |
negative | 7 # reported using the best filename/lineno info
|
/packages/apps/Dialer/src/com/android/dialer/dialpad/ |
SmartDialMap.java | 39 * Converts uppercase characters to lower case ones, and on a best effort basis, strips accents
|
/packages/apps/Exchange/src/com/android/exchange/service/ |
AbstractSyncAdapterService.java | 49 * Subclasses should override this to supply an instance of its sync adapter. Best practice is
|
/frameworks/base/services/java/com/android/server/ |
ServiceWatcher.java | 45 * Find the best Service, and bind to it. 72 private String mPackageName; // current best package 73 private int mVersion = Integer.MIN_VALUE; // current best version 157 * Searches and binds to the best package, or do nothing 158 * if the best package is already bound. 211 (bestPackage == null ? "no new best package" 212 : "new best package: " + bestPackage)));
|
/external/chromium_org/base/strings/ |
string_number_conversions.h | 50 // Perform a best-effort conversion of the input string to a numeric type, 97 // Best effort conversion, see StringToInt above for restrictions. 102 // Best effort conversion, see StringToInt above for restrictions. 108 // Best effort conversion, see StringToInt above for restrictions. 113 // Best effort conversion, see StringToInt above for restrictions.
|
/external/chromium_org/third_party/libjingle/source/talk/p2p/base/ |
p2ptransportchannel.cc | 604 // Now we have selected the best connection, time to prune other existing 790 // Send data to the other side, using our best connection. 870 // Prepare for best candidate sorting. 878 // Sort the available connections to find the best one. We also monitor [all...] |
/external/chromium/third_party/libjingle/source/talk/p2p/base/ |
p2ptransportchannel.cc | 483 // Send data to the other side, using our best connection 522 // Prepare for best candidate sorting 530 // Sort the available connections to find the best one. We also monitor 548 // Find the best alternative connection by sorting. It is important to note 566 // we would prune out the current best connection). We leave connections on 622 // Track the best connection, and let listeners know 631 LOG_J(LS_INFO, this) << "Previous best connection: " 634 LOG_J(LS_INFO, this) << "New best connection: " 638 LOG_J(LS_INFO, this) << "No best connection"; 722 // If we have a best connection, return it, otherwise return top one in th [all...] |
/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/ |
timeit.py | 39 timing. The best thing to do when accurate timing is necessary is to 40 repeat the timing a few times and use the best time. The -r option is 71 # On Windows, the best timer is time.clock() 74 # On most other platforms the best timer is time.time() 313 best = min(r) 317 usec = best * 1e6 / number 319 print "best of %d: %.*g usec per loop" % (repeat, precision, usec) 323 print "best of %d: %.*g msec per loop" % (repeat, precision, msec) 326 print "best of %d: %.*g sec per loop" % (repeat, precision, sec)
|
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/ |
timeit.py | 39 timing. The best thing to do when accurate timing is necessary is to 40 repeat the timing a few times and use the best time. The -r option is 71 # On Windows, the best timer is time.clock() 74 # On most other platforms the best timer is time.time() 313 best = min(r) 317 usec = best * 1e6 / number 319 print "best of %d: %.*g usec per loop" % (repeat, precision, usec) 323 print "best of %d: %.*g msec per loop" % (repeat, precision, msec) 326 print "best of %d: %.*g sec per loop" % (repeat, precision, sec)
|
/external/libvpx/libvpx/vp8/encoder/ |
picklpf.c | 193 /* Update the best case record or exit loop. */ 224 /* Update the best case record or exit loop. */ 352 /* If value is close to the best so far then bias towards a 357 /* Was it actually better than the previous best? */ 380 /* Was it better than the previous best? */ 388 /* Half the step distance if the best filter value was the same
|
/external/chromium_org/chrome/browser/ui/passwords/ |
manage_passwords_bubble_ui_controller.h | 36 // TODO(npentrel) This ought to be changed. Best matches should be newly 38 // changes to the best matches via the settings page. At the moment this also
|
/external/chromium_org/net/cert/ |
x509_util.h | 43 // The signature algorithm may be updated periodically to match best practices. 67 // signature algorithm may be updated periodically to match best practices.
|
/external/chromium_org/third_party/icu/source/i18n/unicode/ |
dtitvinf.h | 75 * the field pattern length is ignored and the best match, which is defined 401 /**given an input skeleton, get the best match skeleton 404 * and the best match skeleton. 410 * and best match skeleton. 413 * the best match and the input skeleton 416 * the best match and the input skeleton 417 * @return best match skeleton 426 * It is used for looking for best match skeleton,
|
dtptngen.h | 39 * includes the desired fields and lengths. The generator will return the "best fit" 241 * Return the best pattern matching the input skeleton. It is guaranteed to 250 * The best pattern found from the given skeleton. 257 * Return the best pattern matching the input skeleton. It is guaranteed to 272 * The best pattern found from the given skeleton. 284 * "dd-MMMM hh:mm". This is used internally to get the best match for the 304 * "dd-MMMM hh:mm". This is used internally to get the best match for the 377 * "hhmmssSSSS", and the best matching pattern internally is "H:mm:ss", and
|