/external/clang/test/SemaTemplate/ |
H A D | address-spaces.cpp | 58 static __attribute__((address_space(3))) int array[17]; local 60 accept_any_pointer(array); // expected-note{{in instantiation of}}
|
H A D | current-instantiation.cpp | 159 static int array[value]; member in struct:ConstantInCurrentInstantiation::X 165 int X<T>::array[X<T>::value] = { 1, 2 }; member in class:ConstantInCurrentInstantiation::X
|
/external/easymock/src/org/easymock/internal/ |
H A D | Invocation.java | 65 private static Object[] createObjectArray(Object array) {
argument 66 if (array instanceof Object[]) {
67 return (Object[]) array;
69 Object[] result = new Object[Array.getLength(array)];
70 for (int i = 0; i < Array.getLength(array); i++) {
71 result[i] = Array.get(array, i);
|
/external/guava/src/com/google/common/collect/ |
H A D | ConcurrentHashMultiset.java | 150 @Override public <T> T[] toArray(T[] array) { argument 151 return snapshot().toArray(array); 422 @Override public <T> T[] toArray(T[] array) { argument 423 return snapshot().toArray(array);
|
H A D | ConstrainedMap.java | 118 @Override public <T> T[] toArray(T[] array) { argument 119 return ObjectArrays.toArrayImpl(this, array);
|
H A D | ImmutableCollection.java | 211 @Override public <T> T[] toArray(T[] array) { argument 212 if (array.length > 0) { 213 array[0] = null; 215 return array;
|
H A D | RegularImmutableSortedSet.java | 150 Object[] array = new Object[size()]; 151 Platform.unsafeArrayCopy(elements, fromIndex, array, 0, size()); 152 return array; 156 @Override public <T> T[] toArray(T[] array) { argument 158 if (array.length < size) { 159 array = ObjectArrays.newArray(array, size); 160 } else if (array.length > size) { 161 array[size] = null; 163 Platform.unsafeArrayCopy(elements, fromIndex, array, [all...] |
/external/icu4c/common/ |
H A D | uarrsort.c | 57 doInsertionSort(char *array, int32_t start, int32_t limit, int32_t itemSize, argument 62 /* v=array[j] */ 63 uprv_memcpy(pv, array+j*itemSize, itemSize); 66 if(/* v>=array[i-1] */ cmp(context, pv, array+(i-1)*itemSize)>=0) { 70 /* array[i]=array[i-1]; */ 71 uprv_memcpy(array+i*itemSize, array+(i-1)*itemSize, itemSize); 75 /* array[ 82 insertionSort(char *array, int32_t length, int32_t itemSize, UComparator *cmp, const void *context, UErrorCode *pErrorCode) argument 120 subQuickSort(char *array, int32_t start, int32_t limit, int32_t itemSize, UComparator *cmp, const void *context, void *px, void *pw) argument 186 quickSort(char *array, int32_t length, int32_t itemSize, UComparator *cmp, const void *context, UErrorCode *pErrorCode) argument 217 uprv_sortArray(void *array, int32_t length, int32_t itemSize, UComparator *cmp, const void *context, UBool sortStable, UErrorCode *pErrorCode) argument [all...] |
H A D | unistr_cnv.cpp | 377 UChar *array, *myTarget; local 398 array = getArrayStart(); 399 myTarget = array + length(); 400 ucnv_toUnicode(converter, &myTarget, array + getCapacity(), 404 setLength((int32_t)(myTarget - array));
|
/external/mesa3d/src/glsl/ |
H A D | ir_constant_expression.cpp | 92 /* Handle array operations here, rather than below. */ 879 ir_constant *array = this->array->constant_expression_value(); local 882 if ((array != NULL) && (idx != NULL)) { 884 if (array->type->is_matrix()) { 889 const glsl_type *const column_type = array->type->column_type(); 902 data.u[i] = array->value.u[mat_idx + i]; 908 data.f[i] = array->value.f[mat_idx + i]; 918 } else if (array->type->is_vector()) { 921 return new(ctx) ir_constant(array, componen [all...] |
/external/skia/gpu/include/ |
H A D | GrTArray.h | 72 explicit GrTArray(const GrTArray& array) { argument 73 fCount = array.count(); 80 memcpy(fMemArray, array.fMemArray, sizeof(T) * fCount); 83 new (fItemArray + i) T(array[i]); 88 GrTArray(const T* array, int count) { argument 96 memcpy(fMemArray, array, sizeof(T) * fCount); 99 new (fItemArray + i) T(array[i]); 104 GrTArray(const GrTArray& array, argument 112 fCount = array.count(); 126 memcpy(fMemArray, array 134 GrTArray(const T* array, int count, void* preAllocStorage, int preAllocCount) argument 165 operator =(const GrTArray& array) argument [all...] |
/external/skia/include/core/ |
H A D | SkFlattenable.h | 94 void setRefCntArray(SkRefCnt* array[], int count) { argument 95 fRCArray = array; 99 void setTypefaceArray(SkTypeface* array[], int count) { argument 100 fTFArray = array; 104 void setFactoryPlayback(SkFlattenable::Factory array[], int count) { argument 105 fFactoryArray = array;
|
/external/skia/samplecode/ |
H A D | SampleCull.cpp | 50 SkIPoint* array; local 67 array = new SkIPoint[n]; 75 array[n++].set(SkScalarRound(pts[0].fX), SkScalarRound(pts[0].fY)); 78 array[n++].set(SkScalarRound(pts[1].fX), SkScalarRound(pts[1].fY)); 89 return array;
|
/external/skia/src/animator/ |
H A D | SkAnimateBase.cpp | 174 void SkAnimateBase::packARGB(SkScalar array[], int count, SkTDOperandArray* converted) argument 178 SkColor color = SkColorSetARGB(SkScalarRound(array[0]), SkScalarRound(array[1]), 179 SkScalarRound(array[2]), SkScalarRound(array[3]));
|
H A D | SkOperandIterpolator.cpp | 107 static SkOperand* iset(SkOperand array[3], int a, int b, int c) argument 109 array[0].fScalar = SkIntToScalar(a); 110 array[1].fScalar = SkIntToScalar(b); 111 array[2].fScalar = SkIntToScalar(c); 112 return array;
|
/external/skia/src/xml/ |
H A D | SkBML_XMLParser.cpp | 46 static void set(char* array[256], int index, SkStream& s, int data) argument 52 if (array[index] == NULL) 53 array[index] = (char*)sk_malloc_throw(size + 1); 56 if (strlen(array[index]) < size) 57 array[index] = (char*)sk_realloc_throw(array[index], size + 1); 60 s.read(array[index], size); 61 array[index][size] = 0; 64 static void freeAll(char* array[256]) argument 67 sk_free(array[ [all...] |
/external/skia/tests/ |
H A D | PDFPrimitivesTest.cpp | 157 SkRefPtr<SkPDFArray> array = new SkPDFArray; local 158 array->unref(); // SkRefPtr and new both took a reference. 159 CheckObjectOutput(reporter, array.get(), "[]", true); 160 array->append(int42.get()); 161 CheckObjectOutput(reporter, array.get(), "[42]", true); 162 array->append(realHalf.get()); 163 CheckObjectOutput(reporter, array.get(), "[42 0.5]", true); 166 array->append(int0.get()); 167 CheckObjectOutput(reporter, array.get(), "[42 0.5 0]", true); 170 array [all...] |
H A D | PathCoverageTest.cpp | 79 static bool one_d_pe(const int* array, const unsigned int count, argument 82 path[1] = SkPoint::Make(SkIntToScalar(array[0]), SkIntToScalar(array[1])); 83 path[2] = SkPoint::Make(SkIntToScalar(array[2]), SkIntToScalar(array[3])); 88 path[2] = SkPoint::Make(SkIntToScalar(array[i]), 89 SkIntToScalar(array[i+1]));
|
H A D | UtilsTest.cpp | 72 int i, array[kSEARCH_COUNT]; local 76 array[i] = rand.nextS(); 79 SkTHeapSort<int>(array, kSEARCH_COUNT); 82 REPORTER_ASSERT(reporter, array[i-1] <= array[i]); 87 int index = SkTSearch<int>(array, kSEARCH_COUNT, array[i], sizeof(int)); 95 int index = SkTSearch<int>(array, kSEARCH_COUNT, value, sizeof(int)); 99 index < kSEARCH_COUNT && array[index] == value); 104 REPORTER_ASSERT(reporter, value < array[inde [all...] |
/external/stlport/test/unit/ |
H A D | alg_test.cpp | 193 int array[] = {0, 0, 1, 0, 1, 1}; local 194 int* array_end = array + sizeof(array) / sizeof(*array); 195 CPPUNIT_ASSERT(search_n(array, array_end, 3, 1) == array_end); 200 int array[] = {0, 1, 2, 3, 4, 5}; local 201 int* array_end = array + sizeof(array) / sizeof(*array); 202 CPPUNIT_ASSERT( search_n(array, array_en [all...] |
H A D | list_test.cpp | 114 char array [] = { 'x', 'l', 'x', 't', 's', 's' }; local 116 list<char> str(array, array + 6); 181 int array[] = { 0, 1, 2, 3 }; local 182 l.assign(array, array + 4);
|
/external/v8/test/mjsunit/ |
H A D | array-indexing.js | 28 var array = [1,2,3,1,2,3,1,2,3,1,2,3]; variable 54 assertEquals(-1, array.indexOf(4)); 55 assertEquals(-1, array.indexOf(3, array.length)); 57 assertEquals(2, array.indexOf(3)); 59 assertEquals(0, array.indexOf(1, -17)); 61 assertEquals(3, array.indexOf(1, -11)); 63 assertEquals(3, array.indexOf(1, 1)); 64 assertEquals(3, array.indexOf(1, 3)); 65 assertEquals(6, array [all...] |
/external/webkit/Source/JavaScriptCore/qt/api/ |
H A D | qscriptengine_p.cpp | 133 JSObjectRef array = JSObjectMakeArray(m_context, /* argumentCount */ 0, /* arguments */ 0, &exception); local 138 // array is an Array instance, so an exception should not occure here. 139 JSObjectSetProperty(m_context, array, lengthRef.get(), JSValueMakeNumber(m_context, length), kJSPropertyAttributeNone, /* exception */ 0); 146 return new QScriptValuePrivate(this, array);
|
/external/webkit/Source/JavaScriptCore/qt/tests/qscriptvalueiterator/ |
H A D | tst_qscriptvalueiterator.cpp | 216 QScriptValue array = engine.newArray(); local 218 array.setProperty(inputPropertyNames.at(i), inputPropertyValues.at(i)); 220 int length = array.property("length").toInt32(); 222 QScriptValueIterator it(array); 227 QCOMPARE(it.flags(), array.propertyFlags(propertyNames.at(i))); 228 QVERIFY(it.value().strictlyEquals(array.property(propertyNames.at(i)))); 243 QCOMPARE(it.flags(), array.propertyFlags(propertyNames.at(i))); 244 QVERIFY(it.value().strictlyEquals(array.property(propertyNames.at(i)))); 271 QScriptValue array = originalArray.toObject(); local 272 int length = array [all...] |
/external/webkit/Source/ThirdParty/ANGLE/src/libGLESv2/ |
H A D | Shader.h | 27 Varying(GLenum type, const std::string &name, int size, bool array) argument 28 : type(type), name(name), size(size), array(array), reg(-1), col(-1) 35 bool array; member in struct:gl::Varying
|