| /external/astl/include/ |
| vector | 467 // linear until it reaches max_size().
|
| /external/chromium/chrome/browser/chromeos/status/ |
| network_menu_button.cc | 122 animation_connecting_.SetTweenType(ui::Tween::LINEAR);
|
| /external/chromium/chrome/browser/download/ |
| download_manager_unittest.cc | 173 // Renamed twice (linear path through UI). Crdownload file does not need
|
| /external/chromium/chrome/browser/resources/ |
| new_new_tab.css | 236 background: -webkit-linear-gradient(white, rgb(228, 229, 240));
|
| /external/chromium/chrome/browser/ui/gtk/notifications/ |
| balloon_view_gtk.cc | 186 // Linear interpolation from start to end position.
|
| /external/chromium/chrome/browser/ui/views/notifications/ |
| balloon_view.cc | 224 // Linear interpolation from start to end position.
|
| /external/chromium/net/http/ |
| http_util.h | 89 // Return true if the character is HTTP "linear white space" (SP | HT).
|
| /external/chromium/third_party/libevent/ |
| evrpc.c | 235 /* find the right rpc; linear search might be slow */
|
| /external/clang/lib/Basic/ |
| SourceManager.cpp | 644 // To handle this, we do a linear search for up to 8 steps to catch #1 quickly
733 // First do a linear scan from the last lookup position, if possible.
755 // Linear scan failed. Do the binary search. Note the reverse sorting of the
[all...] |
| /external/clang/lib/Lex/ |
| HeaderMap.cpp | 59 /// linear probing based on this function.
|
| /external/clang/lib/Rewrite/ |
| Rewriter.cpp | 198 // Advance the iterators to the right spot, yay for linear time algorithms.
|
| /external/flac/include/FLAC/ |
| stream_encoder.h | 327 /**< The encoder has an invalid setting for the precision of the quantized linear predictor coefficients. */
[all...] |
| /external/freetype/src/autofit/ |
| afloader.c | 127 /* set linear metrics */
|
| /external/freetype/src/truetype/ |
| ttgload.c | 155 loader->linear = advance_width;
221 loader->linear = advance_width;
[all...] |
| /external/icu4c/i18n/unicode/ |
| utmscale.h | 277 * Similar to Unix time (linear value from 1970) and struct timeval
|
| /external/iptables/include/ |
| xtables.h | 191 * A "linear"/linked-list based name<->id map, for files similar to
|
| xtables.h.in | 191 * A "linear"/linked-list based name<->id map, for files similar to
|
| /external/jpeg/ |
| jdsample.c | 291 * The upsampling algorithm is linear interpolation between pixel centers,
|
| wrbmp.c | 321 /* If no colormap, must be grayscale data. Generate a linear "map". */
|
| /external/libvpx/examples/includes/geshi/geshi/ |
| actionscript3.php | 316 'LINEAR_RGB', 'LINEAR', 'LIGHT_COLOR', 'LIGHTEN', 'LEFT', 'LCD',
|
| /external/llvm/ |
| CREDITS.TXT | 92 D: Linear scan register allocator, many codegen improvements, Java frontend
|
| /external/llvm/include/llvm/ADT/ |
| EquivalenceClasses.h | 179 /// Note that this is a linear time operation.
|
| /external/llvm/include/llvm/Analysis/ |
| DominatorInternals.h | 27 // faster than the almost-linear O(n*alpha(n)) version, even for large CFGs.
|
| /external/llvm/include/llvm/ |
| Value.h | 186 /// is a linear time operation. Use hasOneUse, hasNUses, or hasMoreThanNUses
|
| /external/llvm/lib/Analysis/ |
| PathNumbering.cpp | 155 // TODO: Avoid linear scan by using a set instead
|
