| /dalvik/libcore/luni/src/main/java/java/util/ |
| ComparableTimSort.java | 70 * can grow to accommodate demand.
[all...] |
| TimSort.java | 95 * can grow to accommodate demand.
[all...] |
| /external/bison/lib/ |
| hash.c | 490 fail to grow or shrink as they should. The smallest allocation
|
| /external/bison/src/ |
| tables.c | 142 | DESIRED, grow them. Note that TABLE[DESIRED] is to be used, so |
|
| /external/dropbear/libtommath/ |
| changes.txt | 360 numbers which will always correct it since as the numbers grow the padding
|
| /external/freetype/src/psaux/ |
| psobjs.c | 185 /* grow the base block if needed */
[all...] |
| /external/guava/javadoc/com/google/common/primitives/ |
| Bytes.html | 349 <DT><B>Parameters:</B><DD><CODE>array</CODE> - the source array<DD><CODE>minLength</CODE> - the minimum length the returned array must guarantee<DD><CODE>padding</CODE> - an extra amount to "grow" the array by if growth is
|
| /external/opencore/doc/oscl_html/ |
| classOscl__Vector__Base.html | 549 Reallocates memory if necessary to a capacity of n elements. The main reason for reserve is efficiency. If you know the capacity to which your vector must grow, then it is more efficient to allocate the vector all at once rather than rely on the automatic reallocation scheme. This also helps cotrol the invalidation of iterators. <dl compact><dt><b>Parameters: </b></dt><dd>
|
| /external/v8/src/ |
| date.js | 168 // the offset in the cache, we grow the cached time interval
[all...] |
| scanner.cc | 386 // the second buffer won't be used very often and is unlikely to grow much.
[all...] |
| heap.cc | 765 // Grow the size of new space if there is room to grow and enough
767 new_space_.Grow();
[all...] |
| /external/v8/src/ia32/ |
| assembler-ia32.h | 801 // If this is the case, we need to grow the buffer before emitting
|
| /external/v8/src/mips/ |
| assembler-mips.cc | 1126 ASSERT(buffer_space() >= kMaxRelocSize); // too late to grow buffer here
|
| /external/webkit/JavaScriptCore/runtime/ |
| Collector.cpp | 161 // which can dynamically grow up to 8 MB,
[all...] |
| JSArray.cpp | 379 // If newVectorLength is already the maximum - MAX_STORAGE_VECTOR_LENGTH - then do not attempt to grow any further.
[all...] |
| /external/webkit/JavaScriptCore/wtf/ |
| DateMath.cpp | 884 // the offset in the cache, we grow the cached time interval
|
| /external/webkit/WebCore/WebCore.gyp/ |
| WebCore.gyp | [all...] |
| /external/webkit/WebCore/loader/appcache/ |
| ApplicationCacheStorage.cpp | 403 // inside the database file plus the amount we can grow until we hit
[all...] |
| /frameworks/base/docs/html/guide/topics/graphics/ |
| 2d-graphics.jd | 332 the contents of a View object. So, if you have a TextView object, you can move, rotate, grow, or shrink the text.
|
| /frameworks/base/media/libstagefright/ |
| MPEG4Extractor.cpp | 873 // and thus will grow by 2 bytes per fragment.
[all...] |
| /packages/inputmethods/LatinIME/java/src/com/android/inputmethod/latin/ |
| ExpandableDictionary.java | 26 * Base class for an in-memory dictionary that can grow dynamically and can
|
| /external/icu4c/common/ |
| ubidi.c | 187 * We also try to grow memory as needed if we
218 /* we try to grow */
229 /* we failed to grow */
[all...] |
| /external/libpcap/ |
| scanner.c | 198 * and can realloc() it to grow it, and should free() it to
[all...] |
| /external/libxml2/ |
| xpath.c | [all...] |
| /dalvik/libcore/concurrent/src/main/java/java/util/concurrent/ |
| ConcurrentHashMap.java | [all...] |
