/ndk/sources/host-tools/sed-4.2.1/lib/ |
stdio.in.h | 277 /* Grow an obstack with formatted output. Return the number of
|
/packages/apps/UnifiedEmail/src/com/android/bitmap/ |
ContiguousFIFOAggregator.java | 68 * The nature of the prioritization means that the number of stored keys and tasks may grow
|
/packages/apps/UnifiedEmail/src/com/android/mail/lib/base/ |
UnicodeEscaper.java | 419 * Helper method to grow the character buffer as needed, this only happens
|
/packages/apps/UnifiedEmail/src/com/google/android/mail/common/base/ |
UnicodeEscaper.java | 419 * Helper method to grow the character buffer as needed, this only happens
|
/prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/ext/pb_ds/ |
hash_policy.hpp | 383 /// Queries whether a grow is needed. This method is called only
|
/prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/ext/pb_ds/ |
hash_policy.hpp | 383 /// Queries whether a grow is needed. This method is called only
|
/prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/ext/pb_ds/ |
hash_policy.hpp | 383 /// Queries whether a grow is needed. This method is called only
|
/sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/layout/gle2/ |
AccordionControl.java | 193 * @param greedy if true, grow vertically as much as possible
|
/system/core/libpixelflinger/codeflinger/tinyutils/ |
VectorImpl.cpp | 286 // ALOGV("grow vector %p, new_capacity=%d", this, (int)new_capacity);
|
/system/core/libutils/ |
VectorImpl.cpp | 379 // ALOGV("grow vector %p, new_capacity=%d", this, (int)new_capacity);
|
/external/v8/src/arm/ |
stub-cache-arm.cc | 4167 Label miss_force_generic, transition_elements_kind, grow, slow; local 4333 Label miss_force_generic, transition_elements_kind, grow, slow; local [all...] |
/external/v8/src/mips/ |
stub-cache-mips.cc | 4222 Label miss_force_generic, transition_elements_kind, grow, slow; local 4388 Label miss_force_generic, transition_elements_kind, grow, slow; local [all...] |
/art/runtime/arch/x86/ |
quick_entrypoints_x86.S | 27 subl MACRO_LITERAL(16), %esp // Grow stack by 4 words, bottom word will hold Method* 39 subl MACRO_LITERAL(16), %esp // Grow stack by 4 words, bottom word will hold Method* [all...] |
/external/chromium/chrome/browser/visitedlink/ |
visitedlink_master.cc | 739 const float max_table_load = 0.5f; // Grow when we're > this full. 748 // Table needs to grow or shrink. [all...] |
/external/chromium_org/chrome/browser/ui/views/panels/ |
panel_view.cc | 408 // Change the window style back to overlappped when the panel height grow 905 // height cannot grow more than what the panel below it could offer. This is [all...] |
/external/chromium_org/components/visitedlink/browser/ |
visitedlink_master.cc | 742 const float max_table_load = 0.5f; // Grow when we're > this full. 751 // Table needs to grow or shrink. [all...] |
/external/chromium_org/third_party/WebKit/Source/wtf/ |
Vector.h | 572 void grow(size_t size); 848 void Vector<T, inlineCapacity>::grow(size_t size) function in class:WTF::Vector::Vector [all...] |
/external/chromium_org/third_party/icu/source/i18n/unicode/ |
msgfmt.h | [all...] |
/external/chromium_org/ui/gfx/ |
skbitmap_operations.cc | 777 // Shadow margin insets are negative values because they grow outside. 778 // Negate them here as grow direction is not important and only pixel value
|
/external/flac/libFLAC/ |
bitwriter.c | 132 * leads to this call) that we don't actually need to grow 575 /* burying the capacity check down here means we have to grow the buffer a little if there are more vals to do */
|
/external/qemu/block/ |
qcow2-refcount.c | 294 * If we come here, we need to grow the refcount table. Again, a new 330 fprintf(stderr, "qcow2: Grow refcount table %" PRId32 " => %" PRId64 "\n", [all...] |
/external/tremolo/Tremolo/ |
framing.c | 110 /* if the unused buffer is too small, grow it */ 159 /* if the unused buffer is too small, grow it */
|
/libcore/luni/src/main/java/java/util/ |
HashMap.java | 527 * specified number of mappings, with room to grow. If not, it increases the 530 * can grow the table by factors of 2^n for n > 1. Hopefully, a single call [all...] |
Hashtable.java | 431 * specified number of mappings, with room to grow. If not, it increases the 434 * can grow the table by factors of 2^n for n > 1. Hopefully, a single call [all...] |
/libcore/luni/src/main/java/java/util/concurrent/ |
PriorityBlockingQueue.java | 241 * Tries to grow array to accommodate at least one more element 257 (oldCap + 2) : // grow faster if small
|