| /external/antlr/src/org/antlr/runtime/tree/ |
| TreeWizard.java | 504 * for node's token type, a linear search of entire stream is used.
|
| /external/bluetooth/glib/docs/reference/glib/tmpl/ |
| unicode.sgml | 511 @G_UNICODE_SCRIPT_LINEAR_B: Linear B
|
| /external/chromium/base/ |
| process_util.h | 585 // It does a linear scan of the address space querying each memory region
|
| string_util.h | 481 // XXX-performance: the call to wide.resize() takes linear time, since it fills
|
| /external/chromium/chrome/browser/autocomplete/ |
| autocomplete_popup_view_gtk.cc | 220 // Walk through the classifications, they are linear, in order, and should
|
| /external/chromium/chrome/browser/ui/cocoa/ |
| status_bubble_mac.mm | 295 // Make the movement non-linear.
|
| /external/chromium/chrome/browser/ui/gtk/download/ |
| download_item_gtk.cc | 337 complete_animation_.SetTweenType(ui::Tween::LINEAR);
[all...] |
| /external/chromium/chrome/browser/ui/views/ |
| status_bubble_views.cc | 731 // Make the movement non-linear.
|
| /external/chromium/chrome/common/extensions/docs/examples/extensions/imageinfo/imageinfo/ |
| exif.js | 236 8 : "Color sequential linear sensor"
|
| /external/chromium/sdch/open-vcdiff/src/ |
| blockhash.h | 323 // with the inverse of kBlockSize, but here a linear scale is used
|
| /external/chromium/testing/gtest/src/ |
| gtest-port.cc | 357 // but usually it's must faster (often close to linear).
|
| /external/clang/lib/Basic/ |
| SourceManager.cpp | 649 // To handle this, we do a linear search for up to 8 steps to catch #1 quickly
742 // First do a linear scan from the last lookup position, if possible.
764 // Linear scan failed. Do the binary search. Note the reverse sorting of the
[all...] |
| /external/esd/include/ |
| audiofile.h | 107 AF_SAMPFMT_TWOSCOMP = 401, /* linear two's complement */
|
| /external/freetype/src/autofit/ |
| afhints.c | 968 /* for a small number of edges, a linear search is better */
|
| /external/gtest/src/ |
| gtest-port.cc | 315 // but usually it's must faster (often close to linear).
|
| /external/icu4c/common/ |
| ucnv_ext.h | 161 * allowing for fast linear or binary searches.
|
| utrie2.cpp | 592 * Only possible for supplementary code points because the linear-BMP index-2
|
| /external/icu4c/tools/genprops/ |
| store.c | 156 - The tries use linear Latin-1 ranges.
|
| /external/jpeg/ |
| jcparam.c | 69 * applications that insist on a linear percentage scaling.
|
| /external/kernel-headers/original/linux/ |
| sysctl.h | 161 VM_UNUSED2=2, /* was; int: Linear or sqrt() swapout for hogs */
|
| /external/libnfc-nxp/src/ |
| phFriNfc_LlcpTransport.h | 335 * used as a linear buffer to store incoming data as a stream. Data will be readable later
[all...] |
| /external/llvm/include/llvm/ADT/ |
| SparseBitVector.h | 291 // This is like std::lower_bound, except we do linear searching from the
|
| /external/llvm/include/llvm/Analysis/ |
| RegionInfo.h | 20 // algorithms described in the papers above are both linear in graph size,
|
| /external/llvm/lib/Analysis/ |
| RegionInfo.cpp | 685 // This improves performance on linear CFGs.
|
| /external/llvm/lib/Transforms/Utils/ |
| SSAUpdater.cpp | 440 // the live out value. We handle this by doing a linear scan of the block.
|
