| /external/icu4c/common/ |
| uloc_tag.c | 994 _appendLanguageToLanguageTag(const char* localeID, char* appendAt, int32_t capacity, UBool strict, UErrorCode* status) {
1016 if (reslen < capacity) {
1017 uprv_memcpy(appendAt + reslen, LANG_UND, uprv_min(LANG_UND_LEN, capacity - reslen));
1026 if (reslen < capacity) {
1027 uprv_memcpy(appendAt + reslen, LANG_UND, uprv_min(LANG_UND_LEN, capacity - reslen));
1039 if (reslen < capacity) {
1040 uprv_memcpy(appendAt + reslen, buf, uprv_min(len, capacity - reslen));
1044 u_terminateChars(appendAt, capacity, reslen, status);
1049 _appendScriptToLanguageTag(const char* localeID, char* appendAt, int32_t capacity, UBool strict, UErrorCode* status) {
1075 if (reslen < capacity) {
[all...] |
| uts46.cpp | 608 int32_t capacity=dest.getCapacity(); local
620 if(length==capacity) {
627 capacity=dest.getCapacity();
701 UChar *unicodeBuffer=fromPunycode.getBuffer(-1); // capacity==-1: most labels should fit
703 // Should never occur if we used capacity==-1 which uses the internal buffer.
[all...] |
| uvector.cpp | 32 capacity(0),
42 capacity(0),
52 capacity(0),
62 capacity(0),
82 capacity = initialCapacity;
334 if (capacity < minimumCapacity) {
335 if (capacity > (INT32_MAX - 1) / 2) { // integer overflow check
339 int32_t newCap = capacity * 2;
355 capacity = newCap;
|
| /external/webkit/Source/JavaScriptCore/wtf/ |
| Deque.h | 62 size_t size() const { return m_start <= m_end ? m_end - m_start : m_end + m_buffer.capacity() - m_start; }
261 // In this implementation a capacity of 1 would confuse append() and
262 // other places that assume the index after capacity - 1 is 0.
263 ASSERT(m_buffer.capacity() != 1);
265 if (!m_buffer.capacity()) {
269 ASSERT(m_start < m_buffer.capacity());
270 ASSERT(m_end < m_buffer.capacity());
277 ASSERT(index <= m_buffer.capacity());
315 , m_buffer(other.m_buffer.capacity())
325 TypeOperations::uninitializedCopy(otherBuffer + m_start, otherBuffer + m_buffer.capacity(), m_buffer.buffer() + m_start)
[all...] |
| /frameworks/native/libs/utils/tests/ |
| BasicHashtable_test.cpp | 159 ALOGD("hashtable %p, size=%u, capacity=%u, bucketCount=%u",
160 &h, h.size(), h.capacity(), h.bucketCount());
182 EXPECT_EQ(3U, h.capacity());
191 EXPECT_EQ(77U, h.capacity());
200 EXPECT_EQ(46U, h.capacity()); // must be one less than bucketCount because loadFactor == 1.0f
209 EXPECT_EQ(46U, h.capacity()); // must be one less than bucketCount because loadFactor == 1.0f
315 EXPECT_EQ(3U, h.capacity());
327 EXPECT_EQ(3U, h.capacity());
342 EXPECT_EQ(3U, h.capacity());
360 EXPECT_EQ(3U, h.capacity());
[all...] |
| /libcore/luni/src/main/java/java/util/ |
| HashMap.java | 55 * Min capacity (other than zero) for a HashMap. Must be a power of two
61 * Max capacity for a HashMap. Must be a power of two >= MINIMUM_CAPACITY.
66 * An empty table shared by all zero-capacity maps (typically from default
110 * The value of this field is generally .75 * capacity, except when
111 * the capacity is zero, as described in the EMPTY_TABLE declaration
131 * Constructs a new {@code HashMap} instance with the specified capacity.
133 * @param capacity
134 * the initial capacity of this hash map.
136 * when the capacity is less than zero.
138 public HashMap(int capacity) {
1002 int capacity = stream.readInt(); local
[all...] |
| Hashtable.java | 40 * Min capacity (other than zero) for a Hashtable. Must be a power of two
46 * Max capacity for a Hashtable. Must be a power of two >= MINIMUM_CAPACITY.
51 * An empty table shared by all zero-capacity maps (typically from default
89 * The value of this field is generally .75 * capacity, except when
90 * the capacity is zero, as described in the EMPTY_TABLE declaration
101 * Constructs a new {@code Hashtable} using the default capacity and load
111 * Constructs a new {@code Hashtable} using the specified capacity and the
114 * @param capacity
115 * the initial capacity.
117 public Hashtable(int capacity) {
1086 int capacity = stream.readInt(); local
[all...] |
| /external/stlport/stlport/stl/debug/ |
| _vector.h | 132 if (size() + __nb > capacity())
136 if (capacity() > __old_capacity) {
158 size_type capacity() const { return _M_non_dbg_impl.capacity(); } function in class:vector
243 if (capacity() < __n)
295 size_type __old_capacity = capacity();
306 size_type __old_capacity = capacity();
319 size_type __old_capacity = capacity();
329 size_type __old_capacity = capacity();
363 if (__new_size > capacity()) {
[all...] |
| /ndk/sources/cxx-stl/stlport/stlport/stl/debug/ |
| _vector.h | 132 if (size() + __nb > capacity())
136 if (capacity() > __old_capacity) {
158 size_type capacity() const { return _M_non_dbg_impl.capacity(); } function in class:vector
243 if (capacity() < __n)
295 size_type __old_capacity = capacity();
306 size_type __old_capacity = capacity();
319 size_type __old_capacity = capacity();
329 size_type __old_capacity = capacity();
363 if (__new_size > capacity()) {
[all...] |
| /prebuilts/ndk/5/sources/cxx-stl/stlport/stlport/stl/debug/ |
| _vector.h | 132 if (size() + __nb > capacity())
136 if (capacity() > __old_capacity) {
158 size_type capacity() const { return _M_non_dbg_impl.capacity(); } function in class:vector
243 if (capacity() < __n)
295 size_type __old_capacity = capacity();
306 size_type __old_capacity = capacity();
319 size_type __old_capacity = capacity();
329 size_type __old_capacity = capacity();
363 if (__new_size > capacity()) {
[all...] |
| /prebuilts/ndk/6/sources/cxx-stl/stlport/stlport/stl/debug/ |
| _vector.h | 132 if (size() + __nb > capacity())
136 if (capacity() > __old_capacity) {
158 size_type capacity() const { return _M_non_dbg_impl.capacity(); } function in class:vector
243 if (capacity() < __n)
295 size_type __old_capacity = capacity();
306 size_type __old_capacity = capacity();
319 size_type __old_capacity = capacity();
329 size_type __old_capacity = capacity();
363 if (__new_size > capacity()) {
[all...] |
| /prebuilts/ndk/7/sources/cxx-stl/stlport/stlport/stl/debug/ |
| _vector.h | 132 if (size() + __nb > capacity())
136 if (capacity() > __old_capacity) {
158 size_type capacity() const { return _M_non_dbg_impl.capacity(); } function in class:vector
243 if (capacity() < __n)
295 size_type __old_capacity = capacity();
306 size_type __old_capacity = capacity();
319 size_type __old_capacity = capacity();
329 size_type __old_capacity = capacity();
363 if (__new_size > capacity()) {
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/stlport/stlport/stl/debug/ |
| _vector.h | 132 if (size() + __nb > capacity())
136 if (capacity() > __old_capacity) {
158 size_type capacity() const { return _M_non_dbg_impl.capacity(); } function in class:vector
243 if (capacity() < __n)
295 size_type __old_capacity = capacity();
306 size_type __old_capacity = capacity();
319 size_type __old_capacity = capacity();
329 size_type __old_capacity = capacity();
363 if (__new_size > capacity()) {
[all...] |
| /external/webkit/Source/WebCore/loader/cache/ |
| MemoryCache.cpp | 51 static const float cTargetPrunePercentage = .95f; // Percentage of capacity toward which we prune, to avoid immediately pruning again.
151 // Dead resource capacity is whatever space is not occupied by live resources, bounded by an independent minimum and maximum.
152 unsigned capacity = m_capacity - min(m_liveSize, m_capacity); // Start with available capacity. local
153 capacity = max(capacity, m_minDeadCapacity); // Make sure it's above the minimum.
154 capacity = min(capacity, m_maxDeadCapacity); // Make sure it's below the maximum.
155 return capacity;
160 // Live resource capacity is whatever is left over after calculating dead resource capacity
169 unsigned capacity = liveCapacity(); local
213 unsigned capacity = deadCapacity(); local
[all...] |
| /libcore/luni/src/main/java/java/lang/ |
| ThreadLocal.java | 241 * Creates a new, empty table with the given capacity.
243 private void initializeTable(int capacity) {
244 this.table = new Object[capacity * 2];
247 this.maximumLoad = capacity * 2 / 3; // 2/3
306 int capacity = table.length >> 1; local
308 // Default to the same capacity. This will create a table of the
314 int newCapacity = capacity;
316 if (size > (capacity >> 1)) {
319 newCapacity = capacity * 2;
|
| /system/core/libpixelflinger/codeflinger/tinyutils/ |
| VectorImpl.cpp | 93 sb = SharedBuffer::alloc(capacity() * mItemSize);
104 size_t VectorImpl::capacity() const function in class:android::tinyutils::VectorImpl
222 ALOG_ASSERT(index<capacity(),
223 "[%p] itemLocation: index=%d, capacity=%d, count=%d",
224 this, (int)index, (int)capacity(), (int)mCount);
234 ALOG_ASSERT(index<capacity(),
235 "[%p] editItemLocation: index=%d, capacity=%d, count=%d",
236 this, (int)index, (int)capacity(), (int)mCount);
246 size_t current_capacity = capacity();
249 // we can't reduce the capacity
[all...] |
| /external/marisa-trie/lib/marisa/ |
| vector-inline.h | 156 void Vector<T>::reserve(std::size_t capacity) {
158 MARISA_THROW_IF(capacity > max_size(), MARISA_SIZE_ERROR);
159 if (capacity <= capacity_) {
162 std::size_t new_capacity = capacity;
163 if (capacity_ > (capacity / 2)) {
|
| /external/marisa-trie/v0_1_5/lib/marisa_alpha/ |
| vector-inline.h | 156 void Vector<T>::reserve(std::size_t capacity) {
158 MARISA_ALPHA_THROW_IF(capacity > max_size(), MARISA_ALPHA_SIZE_ERROR);
159 if (capacity <= capacity_) {
162 std::size_t new_capacity = capacity;
163 if (capacity_ > (capacity / 2)) {
|
| /external/v8/src/ |
| list-inl.h | 75 // Grow the list capacity by 100%, but make sure to let it grow
76 // even when the capacity is zero (possible initial case).
202 void List<T, P>::Initialize(int capacity) {
203 ASSERT(capacity >= 0);
204 data_ = (capacity > 0) ? NewData(capacity) : NULL;
205 capacity_ = capacity;
|
| /external/apache-http/src/org/apache/http/impl/io/ |
| AbstractSessionOutputBuffer.java | 105 if (len > MAX_CHUNK || len > this.buffer.capacity()) {
113 int freecapacity = this.buffer.capacity() - this.buffer.length();
155 int chunk = this.buffer.capacity() - this.buffer.length();
|
| /external/chromium/googleurl/src/ |
| url_canon_icu.cc | 114 int dest_capacity = output->capacity() - begin_offset;
150 output->capacity(),
160 output->Resize(output->capacity() * 2);
|
| /external/emma/core/java12/com/vladium/jcd/cls/ |
| AttributeCollection.java | 198 AttributeCollection (final int capacity)
200 m_attributes = capacity < 0 ? new ArrayList () : new ArrayList (capacity);
|
| /external/icu4c/common/unicode/ |
| unorm2.h | 274 * @param capacity number of UChars that can be written to dest
285 UChar *dest, int32_t capacity,
345 * @param capacity number of UChars that can be written to decomposition
355 UChar32 c, UChar *decomposition, int32_t capacity,
380 * @param capacity number of UChars that can be written to decomposition
390 UChar32 c, UChar *decomposition, int32_t capacity,
|
| /external/webkit/Source/JavaScriptCore/heap/ |
| MarkedSpace.cpp | 81 m_waterMark += block->capacity();
142 size_t MarkedSpace::capacity() const function in class:JSC::MarkedSpace
147 result += (*it)->capacity();
|
| /libcore/luni/src/test/java/libcore/java/io/ |
| OldFileWriterTest.java | 118 int capacity = 65536; local
119 byte[] bytes = new byte[capacity];
135 char[] outChars = new char[capacity];
|
