/external/webkit/Source/JavaScriptCore/runtime/ |
PropertyMapHashTable.h | 144 // Constructor is passed an initial capacity, a PropertyTable to copy, or both. 179 // Copy this PropertyTable, ensuring the copy has at least the capacity provided. 189 // Used to insert a value known not to be in the table, and where we know capacity to be available. 195 // The capacity of the table of values is half of the size of the index. 222 static unsigned sizeForCapacity(unsigned capacity); 224 // Check if capacity is available. 365 // ensure capacity is available. 467 result += (m_deletedOffsets->capacity() * sizeof(unsigned)); 475 // we know capacity to be available. 543 inline unsigned PropertyTable::sizeForCapacity(unsigned capacity) [all...] |
/external/webkit/Source/WebKit/chromium/src/ |
WebCache.cpp | 57 size_t minDeadCapacity, size_t maxDeadCapacity, size_t capacity) 63 static_cast<unsigned int>(capacity)); 83 result->capacity = cache->m_capacity;
|
/external/icu4c/common/unicode/ |
uidna.h | 202 * @param capacity Destination buffer capacity 214 UChar *dest, int32_t capacity, 229 * @param capacity Destination buffer capacity 241 UChar *dest, int32_t capacity, 258 * @param capacity Destination buffer capacity 270 UChar *dest, int32_t capacity, 285 * @param capacity Destination buffer capacit [all...] |
/external/icu4c/common/ |
ustrenum.cpp | 76 StringEnumeration::ensureCharsCapacity(int32_t capacity, UErrorCode &status) { 77 if(U_SUCCESS(status) && capacity>charsCapacity) { 78 if(capacity<(charsCapacity+charsCapacity/2)) { 80 capacity=charsCapacity+charsCapacity/2; 85 chars=(char *)uprv_malloc(capacity); 91 charsCapacity=capacity;
|
/external/tinyxml/ |
tinystr.h | 34 * - added swap(), clear(), size(), capacity(), operator+(). 141 // Return capacity of string 142 size_type capacity () const { return rep_->capacity; } function in class:TiXmlString 212 size_type size, capacity; 222 rep_->capacity = cap;
|
/libcore/luni/src/main/java/java/util/ |
Queue.java | 21 * specifically for use with capacity-restricted <tt>Queue</tt> 66 * rather than exceptional occurrence, for example, in fixed-capacity 117 * immediately without violating capacity restrictions, returning 124 * time due to capacity restrictions 136 * so immediately without violating capacity restrictions. 137 * When using a capacity-restricted queue, this method is generally
|
Vector.java | 64 * Constructs a new vector using the default capacity. 71 * Constructs a new vector using the specified capacity. 73 * @param capacity 74 * the initial capacity of the new vector. 76 * if {@code capacity} is negative. 78 public Vector(int capacity) { 79 this(capacity, 0); 83 * Constructs a new vector using the specified capacity and capacity 86 * @param capacity 235 public synchronized int capacity() { method in class:Vector [all...] |
/libcore/luni/src/main/java/java/util/concurrent/ |
LinkedBlockingDeque.java | 20 * <p> The optional capacity bound constructor argument serves as a 21 * way to prevent excessive expansion. The capacity, if unspecified, 24 * deque above capacity. 123 private final int capacity; field in class:LinkedBlockingDeque 135 * Creates a {@code LinkedBlockingDeque} with a capacity of 143 * Creates a {@code LinkedBlockingDeque} with the given (fixed) capacity. 145 * @param capacity the capacity of this deque 146 * @throws IllegalArgumentException if {@code capacity} is less than 1 148 public LinkedBlockingDeque(int capacity) { [all...] |
/libcore/luni/src/main/java/java/nio/ |
CharBuffer.java | 44 * @param capacity 45 * the capacity of the new buffer. 48 * if {@code capacity} is less than zero. 50 public static CharBuffer allocate(int capacity) { 51 if (capacity < 0) { 54 return new ReadWriteCharArrayBuffer(capacity); 75 * {@code start + charCount}, capacity will be the length of the array. 115 * {@code end}, capacity will be the length of the char sequence. The new 140 CharBuffer(int capacity) { 141 super(1, capacity, null) [all...] |
/cts/apps/CtsVerifier/src/com/android/cts/verifier/audioquality/ |
Utils.java | 354 private int capacity, size; field in class:Utils.ByteArrayBuilder 357 capacity = 100; 359 buf = new byte[capacity]; 364 if (size + nBytes > capacity) expandCapacity(size + nBytes); 376 capacity *= 2; 377 if (capacity < min) capacity = min; 378 byte[] expanded = new byte[capacity];
|
/external/chromium/base/memory/ |
scoped_vector.h | 57 void reserve(size_t capacity) { v.reserve(capacity); }
|
/external/chromium/chrome/browser/resources/net_internals/ |
dnsview.js | 12 * - Shows the parameters used to construct the host cache (capacity, ttl). 69 addTextNode(this.capacitySpan_, hostResolverCache.capacity);
|
/external/guava/src/com/google/common/collect/ |
HashMultiset.java | 39 * capacity. 73 super(new HashMap<E, AtomicInteger>(Maps.capacity(distinctElements)));
|
/external/icu4c/i18n/unicode/ |
fpositer.h | 102 * Otherwise, if capacity is insufficient, returns the negative of the 107 int32_t getData(int32_t *dest, int32_t capacity) const;
|
/external/icu4c/io/ |
ufile.h | 39 int32_t capacity; /* Capacity of buffer */ member in struct:__anon6059
|
/external/icu4c/layoutex/ |
plruns.cpp | 305 virtual void init(le_int32 capacity); 306 virtual void grow(le_int32 capacity); 371 void ULocRuns::init(le_int32 capacity) 373 LocaleRuns::init(capacity); 374 fLocaleNames = LE_NEW_ARRAY(const char *, capacity); 377 void ULocRuns::grow(le_int32 capacity) 379 LocaleRuns::grow(capacity); 380 fLocaleNames = (const char **) LE_GROW_ARRAY(fLocaleNames, capacity);
|
/external/v8/src/ |
ast-inl.h | 45 Block::Block(ZoneStringList* labels, int capacity, bool is_initializer_block) 47 statements_(capacity),
|
/external/webkit/Source/JavaScriptCore/interpreter/ |
RegisterFile.h | 51 | global frame | call frame | call frame | spare capacity | 86 For client simplicity, the RegisterFile measures size and capacity from 114 RegisterFile(JSGlobalData&, size_t capacity = defaultCapacity, size_t maxGlobals = defaultMaxGlobals); 164 inline RegisterFile::RegisterFile(JSGlobalData& globalData, size_t capacity, size_t maxGlobals) 173 ASSERT(capacity && isPageAligned(capacity)); 174 size_t bufferLength = (capacity + maxGlobals) * sizeof(Register); 184 m_max = m_start + capacity;
|
/external/webkit/Source/WebCore/history/ |
BackForwardListImpl.h | 64 int capacity(); 85 virtual bool isActive() { return enabled() && capacity(); }
|
PageCache.h | 50 int capacity() { return m_capacity; } function in class:WebCore::PageCache 52 void add(PassRefPtr<HistoryItem>, Page*); // Prunes if capacity() is exceeded.
|
/external/webkit/Source/WebCore/platform/graphics/win/ |
WKCAImageQueue.cpp | 55 WKCAImageQueue::WKCAImageQueue(uint32_t width, uint32_t height, uint32_t capacity) 58 m_private->m_imageQueue.adoptCF(wkCAImageQueueCreate(width, height, capacity));
|
/external/webkit/Source/WebKit/chromium/public/ |
WebCache.h | 45 size_t capacity; member in struct:WebKit::WebCache::UsageStats 71 size_t capacity);
|
/frameworks/base/core/java/com/google/android/collect/ |
Lists.java | 59 int capacity = (elements.length * 110) / 100 + 5; local 60 ArrayList<E> list = new ArrayList<E>(capacity);
|
/frameworks/base/core/res/res/xml/ |
power_profile.xml | 52 <!-- This is the battery capacity in mAh --> 53 <item name="battery.capacity">1000</item>
|
/libcore/luni/src/main/java/java/net/ |
DatagramPacket.java | 41 int capacity; field in class:DatagramPacket 188 this.capacity = byteCount; 200 capacity = buf.length; 206 * Gets the current capacity value. 208 * @return the current capacity value 211 return capacity; 223 this.capacity = length; 227 * An alternative to {@link #setLength(int)}, that doesn't reset the {@link #capacity}
|