/external/guava/guava-testlib/src/com/google/common/collect/testing/features/ |
CollectionSize.java | 70 private final Integer numElements; 72 CollectionSize(int numElements) { 74 this.numElements = numElements; 81 this.numElements = null; 90 if (numElements == null) { 94 return numElements;
|
/external/deqp/framework/delibs/decpp/ |
deBlockBuffer.hpp | 57 void write (int numElements, const T* elements); 58 int tryWrite (int numElements, const T* elements); 62 void read (int numElements, T* elements); 63 int tryRead (int numElements, T* elements); 72 int writeToCurrentBlock (int numElements, const T* elements, bool blocking); 73 int readFromCurrentBlock(int numElements, T* elements, bool blocking); 175 int BlockBuffer<T>::writeToCurrentBlock (int numElements, const T* elements, bool blocking) 177 DE_ASSERT(numElements > 0 && elements != DE_NULL); 202 int numToWrite = de::min(numElements, m_blockSize-m_writePos); 218 int BlockBuffer<T>::readFromCurrentBlock (int numElements, T* elements, bool blocking [all...] |
deArrayBuffer.hpp | 52 ArrayBuffer (size_t numElements); 58 void setStorage (size_t numElements); // !< \note after a succesful call buffer contents are undefined 81 ArrayBuffer<T,Alignment,Stride>::ArrayBuffer (size_t numElements) 85 if (numElements) 88 const size_t storageSize = (numElements - 1) * Stride + sizeof(T); 95 m_cap = numElements; 140 void ArrayBuffer<T,Alignment,Stride>::setStorage (size_t numElements) 143 ArrayBuffer<T,Alignment,Stride> newBuffer(numElements);
|
/external/chromium_org/third_party/freetype/src/cff/ |
cf2arrst.c | 96 size_t numElements ) 104 FT_Long newSize = (FT_Long)( numElements * arrstack->sizeItem ); 107 if ( numElements > LONG_MAX / arrstack->sizeItem ) 115 arrstack->allocated = numElements; 118 if ( arrstack->count > numElements ) 122 arrstack->count = numElements; 141 size_t numElements ) 145 if ( numElements > arrstack->allocated ) 148 if ( !cf2_arrstack_setNumElements( arrstack, numElements ) ) 152 arrstack->count = numElements; [all...] |
cf2arrst.h | 77 size_t numElements );
|
/external/freetype/src/cff/ |
cf2arrst.c | 96 size_t numElements ) 104 FT_Long newSize = (FT_Long)( numElements * arrstack->sizeItem ); 107 if ( numElements > LONG_MAX / arrstack->sizeItem ) 115 arrstack->allocated = numElements; 118 if ( arrstack->count > numElements ) 122 arrstack->count = numElements; 141 size_t numElements ) 145 if ( numElements > arrstack->allocated ) 148 if ( !cf2_arrstack_setNumElements( arrstack, numElements ) ) 152 arrstack->count = numElements; [all...] |
/external/pdfium/core/src/fxge/fx_freetype/fxft2.5.01/src/cff/ |
cf2arrst.c | 96 size_t numElements ) 104 FT_Long newSize = (FT_Long)( numElements * arrstack->sizeItem ); 107 if ( numElements > LONG_MAX / arrstack->sizeItem ) 115 arrstack->allocated = numElements; 118 if ( arrstack->count > numElements ) 122 arrstack->count = numElements; 141 size_t numElements ) 145 if ( numElements > arrstack->allocated ) 148 if ( !cf2_arrstack_setNumElements( arrstack, numElements ) ) 152 arrstack->count = numElements; [all...] |
/external/deqp/framework/opengl/ |
gluDrawUtil.hpp | 117 int numElements; //!< Number of elements in total. 126 , numElements (numElements_) 136 , numElements (0) 162 int numElements; //!< Number of elements to be drawn. 168 , numElements (numElements_) 176 , numElements (numElements_) 184 , numElements (0) 209 inline PrimitiveList NAME (int numElements) \ 211 return PrimitiveList(TYPE, numElements); \ 213 inline PrimitiveList NAME (int numElements, const deUint8* indices) [all...] |
gluDrawUtil.cpp | 47 int numElements; 62 , numElements (numElements_) 73 , numElements (0) 279 const int size = elementSize*va.pointer.numElements; 288 va.pointer.numElements, 305 dstVA.numElements == srcPtr.numElements); 316 for (int ndx = 0; ndx < dstVA.numElements; ndx++) 320 deMemcpy((deUint8*)dstBasePtr + (deUintptr)dstVA.pointer, srcPtr.data, elementSize*dstVA.numElements); 397 vertexArray.pointer.numElements, [all...] |
/external/chromium_org/third_party/WebKit/Source/wtf/ |
ArrayBufferContents.cpp | 42 ArrayBufferContents::ArrayBufferContents(unsigned numElements, unsigned elementByteSize, ArrayBufferContents::InitializationPolicy policy) 48 if (numElements) { 49 unsigned totalSize = numElements * elementByteSize; 50 if (totalSize / numElements != elementByteSize) { 55 allocateMemory(numElements * elementByteSize, policy, m_data); 56 m_sizeInBytes = numElements * elementByteSize;
|
ArrayBuffer.h | 43 static inline PassRefPtr<ArrayBuffer> create(unsigned numElements, unsigned elementByteSize); 49 static inline PassRefPtr<ArrayBuffer> createUninitialized(unsigned numElements, unsigned elementByteSize); 71 static inline PassRefPtr<ArrayBuffer> create(unsigned numElements, unsigned elementByteSize, ArrayBufferContents::InitializationPolicy); 93 PassRefPtr<ArrayBuffer> ArrayBuffer::create(unsigned numElements, unsigned elementByteSize) 95 return create(numElements, elementByteSize, ArrayBufferContents::ZeroInitialize); 118 PassRefPtr<ArrayBuffer> ArrayBuffer::createUninitialized(unsigned numElements, unsigned elementByteSize) 120 return create(numElements, elementByteSize, ArrayBufferContents::DontInitialize); 123 PassRefPtr<ArrayBuffer> ArrayBuffer::create(unsigned numElements, unsigned elementByteSize, ArrayBufferContents::InitializationPolicy policy) 125 ArrayBufferContents contents(numElements, elementByteSize, policy);
|
ArrayBufferView.h | 96 unsigned numElements) 105 if (numElements > remainingElements) 116 unsigned *numElements) 121 *numElements = 0; 127 *numElements = std::min(remainingElements, *numElements);
|
ArrayBufferContents.h | 45 ArrayBufferContents(unsigned numElements, unsigned elementByteSize, ArrayBufferContents::InitializationPolicy);
|
/external/chromium_org/third_party/WebKit/Source/platform/exported/ |
WebArrayBuffer.cpp | 39 WebArrayBuffer WebArrayBuffer::create(unsigned numElements, unsigned elementByteSize) 41 RefPtr<ArrayBuffer> buffer = ArrayBuffer::create(numElements, elementByteSize);
|
/external/deqp/framework/delibs/depool/ |
dePoolArray.h | 43 int numElements; /*!< Number of elements in the array. */ 99 int numElements; \ 125 return arr->numElements; \ 140 arr->numElements = size; \ 146 arr->numElements = 0; \ 151 DE_ASSERT(ndx >= 0 && ndx < arr->numElements); \ 161 DE_ASSERT(ndx >= 0 && ndx < arr->numElements); \ 171 if ((arr->numElements + 1 >= arr->capacity) && !TYPENAME##_reserve(arr, arr->numElements + 1)) \ 173 arr->numElements++; [all...] |
dePoolHashArray.h | 91 DE_ASSERT(ndx >= 0 && ndx < hashArray->array->numElements); \ 140 int numElements = TYPENAME##Array_getNumElements(hashArray->array); \ 141 DE_ASSERT(TYPENAME##Hash_getNumElements(hashArray->hash) == numElements); \ 143 if (!TYPENAME##Array_setSize(hashArray->array, numElements+1) || \ 144 !TYPENAME##Hash_insert(hashArray->hash, key, numElements)) \ 146 TYPENAME##Array_set(hashArray->array, numElements, value); \ 152 int numElements = TYPENAME##Array_getNumElements(hashArray->array); \ 155 DE_ASSERT(TYPENAME##Hash_getNumElements(hashArray->hash) == numElements); \ 156 if ((keys && !KEYARRAYTYPE##_setSize(keys, numElements)) || \ 157 (values && !VALUEARRAYTYPE##_setSize(values, numElements))) \ [all...] |
dePoolHeap.h | 104 int numElements = TYPENAME##Array_getNumElements(array); \ 108 if (childNdx0 < numElements) \ 110 int childNdx1 = deMin32(childNdx0 + 1, numElements - 1); \ 147 int numElements = TYPENAME##Array_getNumElements(array); \ 148 if (!TYPENAME##Array_setSize(array, numElements + 1)) \ 150 TYPENAME##Array_set(array, numElements, elem); \ 151 TYPENAME##_moveUp(heap, numElements); \ 159 int numElements = TYPENAME##Array_getNumElements(array); \ 160 TYPENAME##Array_set(array, 0, TYPENAME##Array_get(array, numElements-1)); \ 161 TYPENAME##Array_setSize(array, numElements-1); [all...] |
dePoolHash.c | 117 int numElements = deTestHash_getNumElements(hash); 121 DE_TEST_ASSERT(deTestInt16Array_getNumElements(keyArray) == numElements); 124 DE_TEST_ASSERT(deTestIntArray_getNumElements(valueArray) == numElements); 129 DE_TEST_ASSERT(deTestInt16Array_getNumElements(keyArray) == numElements); 130 DE_TEST_ASSERT(deTestIntArray_getNumElements(valueArray) == numElements); 132 for (ndx = 0; ndx < numElements; ndx++)
|
dePoolHashSet.c | 127 int numElements = deTestHash_getNumElements(hash); 131 DE_TEST_ASSERT(deTestInt16Array_getNumElements(keyArray) == numElements); 134 DE_TEST_ASSERT(deTestIntArray_getNumElements(valueArray) == numElements); 139 DE_TEST_ASSERT(deTestInt16Array_getNumElements(keyArray) == numElements); 140 DE_TEST_ASSERT(deTestIntArray_getNumElements(valueArray) == numElements); 142 for (ndx = 0; ndx < numElements; ndx++)
|
dePoolHash.h | 82 int numElements; \ 113 return hash->numElements; \ 231 hash->numElements = 0; \ 285 hash->numElements--; \ 299 if (hash->numElements > 0) \ 327 if ((hash->numElements + 1) >= hash->slotTableSize * DE_HASH_ELEMENTS_PER_SLOT) \ 361 hash->numElements++; \ 373 DE_ASSERT(hash->numElements > 0); \ 409 hash->numElements--; \ 430 int numElements = hash->numElements; [all...] |
/external/guava/guava/src/com/google/common/collect/ |
Queues.java | 192 * {@code numElements} elements are not available, it will wait for them up to the specified 197 * @param numElements the number of elements to be waited for 203 public static <E> int drain(BlockingQueue<E> q, Collection<? super E> buffer, int numElements, 213 while (added < numElements) { 216 added += q.drainTo(buffer, numElements - added); 217 if (added < numElements) { // not enough elements immediately available; will have to poll 237 * @param numElements the number of elements to be waited for 243 int numElements, long timeout, TimeUnit unit) { 249 while (added < numElements) { 252 added += q.drainTo(buffer, numElements - added) [all...] |
/external/deqp/framework/randomshaders/ |
rsgVariableType.hpp | 132 VariableType (Type baseType, int numElements = 0); 133 VariableType (Type baseType, const VariableType& elementType, int numElements); 186 inline VariableType::VariableType (Type baseType, int numElements) 190 , m_numElements (numElements) 196 inline VariableType::VariableType (Type baseType, const VariableType& elementType, int numElements) 200 , m_numElements (numElements)
|
rsgVariableValue.cpp | 48 int numElements = (int)a.getType().getNumElements(); 49 for (int ndx = 0; ndx < numElements; ndx++) 57 int numElements = (int)a.getType().getNumElements(); 61 for (int ndx = 0; ndx < numElements; ndx++) 76 for (int ndx = 0; ndx < numElements; ndx++) 89 for (int ndx = 0; ndx < numElements; ndx++) 213 int numElements = (int)a.getType().getNumElements(); 214 for (int ndx = 0; ndx < numElements; ndx++) 219 int numElements = (int)a.getType().getNumElements(); 223 for (int ndx = 0; ndx < numElements; ndx++ [all...] |
/frameworks/base/tests/RenderScriptTests/ModelViewer/src/com/android/modelviewer/ |
SgTransform.java | 71 int numElements = mTransformData.transforms.length; 72 mTransformData.transformTypes = new int[numElements]; 73 for (int i = 0; i < numElements; i ++) {
|
/external/chromium_org/third_party/WebKit/public/platform/ |
WebArrayBuffer.h | 62 BLINK_PLATFORM_EXPORT static WebArrayBuffer create(unsigned numElements, unsigned elementByteSize);
|