Searched refs:capacity (Results 176 - 200 of 443) sorted by relevance

1234567891011>>

/external/icu4c/common/
H A Dcharstr.h84 * Returns a writable buffer for appending and writes the buffer's capacity to
95 * @param minCapacity required minimum capacity of the returned buffer;
97 * @param desiredCapacityHint desired capacity of the returned buffer;
99 * @param resultCapacity will be set to the capacity of the returned buffer
114 UBool ensureCapacity(int32_t capacity, int32_t desiredCapacityHint, UErrorCode &errorCode);
H A Dnormalizer2.cpp659 UChar *dest, int32_t capacity,
665 (dest==NULL ? capacity!=0 : capacity<0) ||
671 UnicodeString destString(dest, 0, capacity);
687 return destString.extract(dest, capacity, *pErrorCode);
768 UChar32 c, UChar *decomposition, int32_t capacity,
773 if(decomposition==NULL ? capacity!=0 : capacity<0) {
777 UnicodeString destString(decomposition, 0, capacity);
779 return destString.extract(decomposition, capacity, *pErrorCod
657 unorm2_normalize(const UNormalizer2 *norm2, const UChar *src, int32_t length, UChar *dest, int32_t capacity, UErrorCode *pErrorCode) argument
[all...]
H A Duniset.cpp145 len(1), capacity(1 + START_EXTRA), list(0), bmpSet(0), buffer(0),
154 list = (UChar32*) uprv_malloc(sizeof(UChar32) * capacity);
172 len(1), capacity(1 + START_EXTRA), list(0), bmpSet(0), buffer(0),
181 list = (UChar32*) uprv_malloc(sizeof(UChar32) * capacity);
197 len(0), capacity(o.isFrozen() ? o.len : o.len + GROW_EXTRA), list(0),
208 list = (UChar32*) uprv_malloc(sizeof(UChar32) * capacity);
221 len(0), capacity(o.len + GROW_EXTRA), list(0),
232 list = (UChar32*) uprv_malloc(sizeof(UChar32) * capacity);
1455 if (len < capacity) {
1456 // Make the capacity equa
[all...]
/external/icu4c/common/unicode/
H A Dutf8.h354 * @param i string offset, must be i<capacity
355 * @param capacity size of the string buffer
361 #define U8_APPEND(s, i, capacity, c, isError) { \
364 } else if((uint32_t)(c)<=0x7ff && (i)+1<(capacity)) { \
367 } else if((uint32_t)(c)<=0xd7ff && (i)+2<(capacity)) { \
372 (i)=utf8_appendCharSafeBody(s, (int32_t)(i), (int32_t)(capacity), c, &(isError)); \
/external/jmonkeyengine/engine/src/terrain/com/jme3/terrain/geomipmap/lodcalc/util/
H A DEntropyComputeUtil.java50 for (int i = 0; i < positions.capacity() / 3; i++){
/external/kernel-headers/original/linux/mmc/
H A Dcard.h35 unsigned int capacity; member in struct:mmc_csd
/external/v8/src/
H A Delements.h76 // Modifies both the length and capacity of a JSArray, resizing the underlying
83 int capacity,
/external/valgrind/main/drd/
H A Ddrd_vc.h67 unsigned capacity; /**< number of elements allocated for array vc. */ member in struct:__anon13873
/external/webkit/Source/JavaScriptCore/icu/unicode/
H A Ducol.h595 * @param resultCapacity capacity of the fillin buffer
639 * @param capacity capacity of the buffer
650 int32_t capacity,
659 * @param capacity capacity of the buffer
676 int32_t capacity,
1064 * @param capacity buffer capacity
1079 int32_t capacity,
[all...]
/external/webkit/Source/WebCore/icu/unicode/
H A Ducol.h595 * @param resultCapacity capacity of the fillin buffer
639 * @param capacity capacity of the buffer
650 int32_t capacity,
659 * @param capacity capacity of the buffer
676 int32_t capacity,
1064 * @param capacity buffer capacity
1079 int32_t capacity,
[all...]
/external/webkit/Source/WebKit/gtk/webkit/
H A Dwebkitwebbackforwardlist.cpp399 return backForwardList->capacity();
408 * exceeds its capacity, items will be removed everytime a new item has been
461 // Clear the current list by setting capacity to 0
462 int capacity = backForwardList->capacity(); local
464 backForwardList->setCapacity(capacity);
/external/webkit/Source/WebKit/qt/Api/
H A Dqwebhistory.cpp275 int capacity = lst->capacity(); local
278 lst->setCapacity(capacity); //revert capacity
470 return d->lst->capacity();
/external/webkit/Source/WebKit/win/
H A DWebBackForwardList.h84 virtual HRESULT STDMETHODCALLTYPE capacity(
/external/emma/core/java12/com/vladium/jcd/cls/
H A DConstantCollection.java194 ConstantCollection (final int capacity) argument
196 m_constants = capacity < 0 ? new ArrayList () : new ArrayList (capacity);
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/
H A DLinkedHashMultimap.java90 * Constructs an empty {@code LinkedHashMultimap} with enough capacity to hold
133 Maps.capacity(multimap.keySet().size())));
135 = new LinkedHashSet<Map.Entry<K, V>>(Maps.capacity(multimap.size()));
149 return new LinkedHashSet<V>(Maps.capacity(expectedValuesPerKey));
/external/guava/guava-tests/test/com/google/common/collect/
H A DMinMaxPriorityQueueTest.java54 assertEquals(11, queue.capacity());
63 assertEquals(11, queue.capacity());
72 assertEquals(8, queue.capacity());
82 assertEquals(8, queue.capacity());
91 assertEquals(11, queue.capacity());
101 assertEquals(11, queue.capacity());
111 assertEquals(8, queue.capacity());
123 assertEquals(11, queue.capacity());
133 assertEquals(11, queue.capacity());
143 assertEquals(8, queue.capacity());
[all...]
/external/icu4c/io/
H A Dufile.c155 int32_t capacity,
160 if (capacity < 0) {
172 result->str.fLimit = stringBuf+capacity;
154 u_fstropen(UChar *stringBuf, int32_t capacity, const char *locale) argument
/external/jmonkeyengine/engine/src/core/com/jme3/util/
H A DTangentBinormalGenerator.java192 VertexData[] vertices = initVertexData(vertexBuffer.capacity() / 3);
218 VertexData[] vertices = initVertexData(vertexBuffer.capacity() / 3);
266 VertexData[] vertices = initVertexData(vertexBuffer.capacity() / 3);
277 for (int i = 2; i < vertexBuffer.capacity() / 3; i++) {
399 final int size = vertexBuffer.capacity() / 3;
627 FloatBuffer lineVertex = BufferUtils.createFloatBuffer(vertexBuffer.capacity() * 2);
628 FloatBuffer lineColor = BufferUtils.createFloatBuffer(vertexBuffer.capacity() / 3 * 4 * 2);
630 for (int i = 0; i < vertexBuffer.capacity() / 3; i++) {
676 IntBuffer lineIndex = BufferUtils.createIntBuffer(vertexBuffer.capacity() / 3 * 6);
677 FloatBuffer lineVertex = BufferUtils.createFloatBuffer(vertexBuffer.capacity() *
[all...]
H A DBufferUtils.java82 * Creates a clone of the given buffer. The clone's capacity is
116 int allocated = buffer.capacity();
1110 totalHeld += b.capacity();
1111 bBufsM += b.capacity();
1114 totalHeld += b.capacity() * 4;
1115 fBufsM += b.capacity() * 4;
1118 totalHeld += b.capacity() * 4;
1119 iBufsM += b.capacity() * 4;
1122 totalHeld += b.capacity() * 2;
1123 sBufsM += b.capacity() *
[all...]
/external/webkit/Source/JavaScriptCore/wtf/
H A DHashCountedSet.h43 int capacity() const;
85 inline int HashCountedSet<Value, HashFunctions, Traits>::capacity() const function in class:WTF::HashCountedSet
87 return m_impl.capacity();
/external/webkit/Source/WebCore/history/
H A DBackForwardListImpl.cpp179 int BackForwardListImpl::capacity() function in class:BackForwardListImpl
212 int capacity = m_capacity; local
214 setCapacity(capacity);
/external/webkit/Source/WebKit/efl/ewk/
H A Dewk_settings.cpp357 * Sets capacity of memory cache of WebCore.
361 * @param capacity the maximum number of bytes that the cache should consume overall
363 void ewk_settings_cache_capacity_set(unsigned capacity) argument
366 cache->setCapacities(0, capacity, capacity);
/external/webkit/Source/JavaScriptCore/runtime/
H A DPropertyMapHashTable.h144 // 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) argument
[all...]
/external/llvm/include/llvm/ADT/
H A DSmallVector.h50 /// capacity_in_bytes - This returns capacity()*sizeof(T).
129 /// capacity - Return the total number of elements in the currently allocated
131 size_t capacity() const { return capacity_ptr() - begin(); } function in class:llvm::SmallVectorTemplateCommon
264 size_t CurCapacity = this->capacity();
400 if (this->capacity() < N)
412 if (this->capacity() < N)
420 if (this->capacity() < N)
466 if (this->capacity() < NumElts)
688 /// enough capacity for.
692 /// Clients can use this in conjunction with capacity() t
[all...]
/external/jmonkeyengine/engine/src/tools/jme3tools/optimize/
H A DGeometryBatchFactory.java32 for (int i = 0; i < inBuf.capacity() / 3; i++) {
52 for (int i = 0; i < inBuf.capacity() / 3; i++) {
72 for (int i = 0; i < inBuf.capacity() / components; i++) {
239 lodSize[i] += g.getMesh().getLodLevel(i).getData().capacity();
259 //System.out.println("buffer: " + buffer.capacity() + " limit: " + lodSize[i] + " " + index);
260 for (int j = 0; j < buffer.capacity(); j++) {
264 bufferPos[i] += buffer.capacity();

Completed in 965 milliseconds

1234567891011>>