/external/guava/guava-testlib/src/com/google/common/collect/testing/features/ |
H A D | CollectionSize.java | 70 private final Integer numElements; field in class:CollectionSize 72 CollectionSize(int numElements) { argument 74 this.numElements = numElements; 81 this.numElements = null; 90 if (numElements == null) { 94 return numElements;
|
/external/deqp/framework/delibs/decpp/ |
H A D | 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) argument 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, argument 267 tryWrite(int numElements, const T* elements) argument 295 write(int numElements, const T* elements) argument 348 tryRead(int numElements, T* elements) argument 374 read(int numElements, T* elements) argument [all...] |
H A D | deArrayBuffer.hpp | 54 ArrayBuffer (size_t numElements); 55 ArrayBuffer (const T* ptr, size_t numElements); 61 void setStorage (size_t numElements); // !< \note after a succesful call buffer contents are undefined 84 ArrayBuffer<T,Alignment,Stride>::ArrayBuffer (size_t numElements) argument 88 if (numElements) 91 const size_t storageSize = (numElements - 1) * Stride + sizeof(T); 98 m_cap = numElements; 103 ArrayBuffer<T,Alignment,Stride>::ArrayBuffer (const T* ptr, size_t numElements) argument 107 if (numElements) 110 ArrayBuffer<T,Alignment,Stride> tmp(numElements); 170 setStorage(size_t numElements) argument [all...] |
H A D | deAppendList.cpp | 58 deUint32 numElements; member in struct:de::__anon3990::SharedState 63 : numElements (numElements_) 81 for (deUint32 elemNdx = 0; elemNdx < m_shared->numElements; elemNdx++) 97 void runAppendListTest (deUint32 numThreads, deUint32 numElements, deUint32 numElementsHint) argument 99 SharedState sharedState (numThreads, numElements, numElementsHint); 111 DE_TEST_ASSERT(sharedState.testList.size() == (size_t)numElements*(size_t)numThreads); 131 DE_TEST_ASSERT(countByThread[threadNdx] == numElements);
|
/external/apache-commons-math/src/main/java/org/apache/commons/math/util/ |
H A D | ResizableDoubleArray.java | 55 * elements (the <code>numElements</code> property) and if the difference 57 * <code>numElements + 1.</code> The determination of when the internal 61 * ratio between storage array length and <code>numElements</code> exceeds 124 protected int numElements = 0; field in class:ResizableDoubleArray 129 * internalArray[startIndex],...,internalArray[startIndex + numElements -1] 165 * initial capacity and numElements corresponding to the size of 187 numElements = initialArray.length; 296 numElements++; 297 if ((startIndex + numElements) > internalArray.length) { 300 internalArray[startIndex + (numElements [all...] |
/external/freetype/src/cff/ |
H A D | cf2arrst.c | 96 size_t numElements ) 104 size_t newSize = numElements * arrstack->sizeItem; 107 if ( numElements > FT_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...] |
H A D | cf2arrst.h | 77 size_t numElements );
|
/external/pdfium/third_party/freetype/src/cff/ |
H A D | cf2arrst.c | 96 size_t numElements ) 104 size_t newSize = numElements * arrstack->sizeItem; 107 if ( numElements > FT_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...] |
H A D | cf2arrst.h | 77 size_t numElements );
|
/external/deqp/framework/opengl/ |
H A D | gluDrawUtil.hpp | 117 int numElements; //!< Number of elements in total. member in struct:glu::VertexArrayPointer 126 , numElements (numElements_) 136 , numElements (0) 162 int numElements; //!< Number of elements to be drawn. member in struct:glu::PrimitiveList 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, cons [all...] |
H A D | gluDrawUtil.cpp | 47 int numElements; member in struct:glu::__anon4019::VertexAttributeDescriptor 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, 479 drawNonIndexed(const glw::Functions& gl, PrimitiveType type, int numElements) argument 485 drawIndexed(const glw::Functions& gl, PrimitiveType type, int numElements, IndexType indexType, const void* indexPtr) argument [all...] |
/external/androidplot/AndroidPlot-Core/src/main/java/com/androidplot/ui/ |
H A D | FixedTableModel.java | 58 private int numElements;
field in class:FixedTableModel.FixedTableModelIterator 60 protected FixedTableModelIterator(FixedTableModel model, RectF tableRect, int numElements) {
argument 63 this.numElements = numElements;
74 return !(lastElement >= numElements || (isColumnFinished() && isRowFinished()));
92 if (lastElement >= numElements) {
|
/external/deqp/framework/delibs/depool/ |
H A D | dePoolArray.h | 43 int numElements; /*!< Number of elements in the array. */ member in struct:dePoolArray_s 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...] |
H A D | 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...] |
H A D | 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 [all...] |
H A D | dePoolHash.c | 117 int numElements = deTestHash_getNumElements(hash); local 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++)
|
H A D | 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++)
|
H A D | 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 [all...] |
H A D | dePoolSet.h | 80 int numElements; \ 112 return set->numElements; \ 239 set->numElements = 0; \ 293 set->numElements--; \ 307 if (set->numElements > 0) \ 336 if ((set->numElements + 1) >= set->slotTableSize * DE_SET_ELEMENTS_PER_SLOT) \ 369 set->numElements++; \ 381 DE_ASSERT(set->numElements > 0); \ 416 set->numElements--; \ 438 int numElements [all...] |
H A D | dePoolHashSet.h | 180 int numElements = hash->numElements; \ 184 if ((keyArray && !KEYARRAYTYPENAME##_setSize(keyArray, numElements)) || \ 185 (valueArray && !VALUEARRAYTYPENAME##_setSize(valueArray, numElements))) \ 205 DE_ASSERT(arrayNdx == numElements); \
|
/external/deqp/external/vulkancts/modules/vulkan/spirv_assembly/ |
H A D | vktSpvAsmInstructionTests.cpp | 177 const int numElements = 100; local 178 vector<float> positiveFloats (numElements, 0); 179 vector<float> negativeFloats (numElements, 0); 181 fillRandomScalars(rnd, 1.f, 100.f, &positiveFloats[0], numElements); 183 for (size_t ndx = 0; ndx < numElements; ++ndx) 218 spec.numWorkGroups = IVec3(numElements, 1, 1); 230 const int numElements = 100; local 231 vector<float> positiveFloats (numElements, 0); 232 vector<float> negativeFloats (numElements, 0); 234 fillRandomScalars(rnd, 1.f, 100.f, &positiveFloats[0], numElements); 294 const int numElements = 100; local 380 const int numElements = 100; local 493 const int numElements = 200; local 570 const int numElements = 100; local 782 const int numElements = 100; local 898 const int numElements = 100; local 1037 const int numElements = 100; local 1210 const int numElements = 100; local 1399 const int numElements = 100; local 1606 const int numElements = 100; local 1743 const int numElements = 100; local 1878 const int numElements = 100; local 1974 const int numElements = 100; local 2038 const int numElements = 100; local 2111 const int numElements = 100; local 2304 const deUint32 numElements = 100; local 2346 const deUint32 numElements = 100; local 2376 const deUint32 numElements = 100; local 2424 const deUint32 numElements = 200; local 2443 const deUint32 numElements = 4; local 2686 const int numElements = 100; local 2791 const int numElements = 100; local 2893 const int numElements = 100; local 2987 const int numElements = 100; local 3065 const int numElements = 100; local 3136 const int numElements = 100; local [all...] |
/external/deqp/framework/randomshaders/ |
H A D | 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) argument 190 , m_numElements (numElements) 196 inline VariableType::VariableType (Type baseType, const VariableType& elementType, int numElements) argument 200 , m_numElements (numElements)
|
H A D | rsgVariableValue.cpp | 48 int numElements = (int)a.getType().getNumElements(); local 49 for (int ndx = 0; ndx < numElements; ndx++) 57 int numElements = (int)a.getType().getNumElements(); local 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(); local 214 for (int ndx = 0; ndx < numElements; ndx++) 219 int numElements = (int)a.getType().getNumElements(); local 223 for (int ndx = 0; ndx < numElements; nd [all...] |
/external/guava/guava/src/com/google/common/collect/ |
H A D | Queues.java | 248 * {@code numElements} elements are not available, it will wait for them up to the specified 253 * @param numElements the number of elements to be waited for 260 public static <E> int drain(BlockingQueue<E> q, Collection<? super E> buffer, int numElements, argument 270 while (added < numElements) { 273 added += q.drainTo(buffer, numElements - added); 274 if (added < numElements) { // not enough elements immediately available; will have to poll 294 * @param numElements the number of elements to be waited for 301 int numElements, long timeout, TimeUnit unit) { 307 while (added < numElements) { 310 added += q.drainTo(buffer, numElements 300 drainUninterruptibly(BlockingQueue<E> q, Collection<? super E> buffer, int numElements, long timeout, TimeUnit unit) argument [all...] |
/external/deqp/external/vulkancts/framework/vulkan/ |
H A D | vkBinaryRegistry.hpp | 132 const size_t numElements = resSize/sizeof(Element); local 133 const size_t numPages = (numElements >> ELEMENTS_PER_PAGE_LOG2) + ((numElements & ((1u<<ELEMENTS_PER_PAGE_LOG2)-1u)) == 0 ? 0 : 1); 135 TCU_CHECK_INTERNAL(numElements*sizeof(Element) == resSize); 137 m_elements.resize(numElements);
|