/external/clang/test/CodeGen/ |
H A D | 2007-11-29-ArraySizeFromInitializer.c | 3 int array[] = {1, 2, 3, 4, 5}; variable
|
H A D | 2003-07-22-ArrayAccessTypeSafety.c | 4 void test(int* array, long long N) { argument 5 array[N] = N[array] = 33;
|
H A D | 2004-03-09-LargeArrayInitializers.c | 9 const int array[] = { local 31 return array[x];
|
/external/eigen/doc/snippets/ |
H A D | Map_general_stride.cpp | 1 int array[24]; variable 2 for(int i = 0; i < 24; ++i) array[i] = i; 4 (array, 3, 3, Stride<Dynamic,2>(8, 2))
|
H A D | Map_inner_stride.cpp | 1 int array[12]; variable 2 for(int i = 0; i < 12; ++i) array[i] = i; 4 (array, 6) // the inner stride has already been passed as template parameter
|
H A D | Map_outer_stride.cpp | 1 int array[12]; variable 2 for(int i = 0; i < 12; ++i) array[i] = i; 3 cout << Map<MatrixXi, 0, OuterStride<> >(array, 3, 3, OuterStride<>(4)) << endl;
|
H A D | Map_simple.cpp | 1 int array[9]; variable 2 for(int i = 0; i < 9; ++i) array[i] = i; 3 cout << Map<Matrix3i>(array) << endl;
|
H A D | Tutorial_Map_rowmajor.cpp | 1 int array[8]; variable 2 for(int i = 0; i < 8; ++i) array[i] = i; 3 cout << "Column-major:\n" << Map<Matrix<int,2,4> >(array) << endl; 4 cout << "Row-major:\n" << Map<Matrix<int,2,4,RowMajor> >(array) << endl; 6 Map<Matrix<int,2,4>, Unaligned, Stride<1,4> >(array) << endl;
|
/external/v8/test/mjsunit/regress/ |
H A D | regress-1969.js | 34 var array = f(); variable 40 for (var i = 0; i < 5000; i++) assertEquals(0, array[i]);
|
H A D | regress-smi-only-concat.js | 30 // This tests that concatenating a fast smi-only array and a fast object array 31 // results in a fast object array. 34 var array = fast_array.concat(fast_array); variable 37 assertTrue(%HasFastElements(array))
|
/external/clang/test/CodeGenCXX/ |
H A D | 2005-02-13-BadDynamicInit.cpp | 5 unsigned array[1]; member in struct:Data 9 Data shared_null = { shared_null.array };
|
/external/stlport/test/unit/ |
H A D | bnegate_test.cpp | 32 int array [4] = { 4, 9, 7, 1 }; local 34 sort(array, array + 4, binary_negate<greater<int> >(greater<int>())); 35 CPPUNIT_ASSERT(array[0]==1); 36 CPPUNIT_ASSERT(array[1]==4); 37 CPPUNIT_ASSERT(array[2]==7); 38 CPPUNIT_ASSERT(array[3]==9); 42 int array [4] = { 4, 9, 7, 1 }; local 43 sort(array, array [all...] |
H A D | greater_test.cpp | 33 int array[4] = { 3, 1, 4, 2 }; local 34 sort(array, array + 4, greater<int>() ); 36 CPPUNIT_ASSERT(array[0]==4); 37 CPPUNIT_ASSERT(array[1]==3); 38 CPPUNIT_ASSERT(array[2]==2); 39 CPPUNIT_ASSERT(array[3]==1); 43 int array [4] = { 3, 1, 4, 2 }; local 44 sort(array, array [all...] |
H A D | less_test.cpp | 33 int array [4] = { 3, 1, 4, 2 }; local 34 sort(array, array + 4, less<int>()); 36 CPPUNIT_ASSERT(array[0]==1); 37 CPPUNIT_ASSERT(array[1]==2); 38 CPPUNIT_ASSERT(array[2]==3); 39 CPPUNIT_ASSERT(array[3]==4); 43 int array [4] = { 3, 1, 4, 2 }; local 44 sort(array, array [all...] |
H A D | binsert_test.cpp | 32 const char* array [] = { "laurie", "jennifer", "leisa" }; local 35 bit = copy(array, array + 3, bit); 37 CPPUNIT_ASSERT(!strcmp(names[0],array[0])); 38 CPPUNIT_ASSERT(!strcmp(names[1],array[1])); 39 CPPUNIT_ASSERT(!strcmp(names[2],array[2])); 41 copy(array, array + 3, bit); 42 CPPUNIT_ASSERT(!strcmp(names[3],array[0])); 43 CPPUNIT_ASSERT(!strcmp(names[4],array[ 48 const char* array [] = { "laurie", "jennifer", "leisa" }; local [all...] |
H A D | finsert_test.cpp | 33 char const* array [] = { "laurie", "jennifer", "leisa" }; local 36 fit = copy(array, array + 3, front_insert_iterator<deque <char const*> >(names)); 38 CPPUNIT_ASSERT(names[0]==array[2]); 39 CPPUNIT_ASSERT(names[1]==array[1]); 40 CPPUNIT_ASSERT(names[2]==array[0]); 42 copy(array, array + 3, fit); 43 CPPUNIT_ASSERT(names[3]==array[2]); 44 CPPUNIT_ASSERT(names[4]==array[ 50 char const* array [] = { "laurie", "jennifer", "leisa" }; local [all...] |
H A D | ostmit_test.cpp | 34 int array [] = { 1, 5, 2, 4 }; local 47 copy(array, array + 4, iter2);
|
/external/v8/test/mjsunit/ |
H A D | string-split-cache.js | 38 var array = str.split(""); variable 40 assertArrayEquals(expected, array);
|
H A D | function-call.js | 249 // through an array mapping function. 250 var array = [1,2,3,4,5]; variable 255 mapping_functions[j].call(array, 267 mapping_functions[j].call(array, 283 mapping_functions[j].call(array, 294 mapping_functions[j].call(array, 311 reducing_functions[j].call(array, should_throw_on_null_and_undefined[i]); 321 reducing_functions[j].call(array, should_throw_on_null_and_undefined[i]); 335 reducing_functions[j].call(array, non_generic[i]); 344 reducing_functions[j].call(array, non_generi [all...] |
/external/clang/test/CXX/expr/expr.prim/expr.prim.lambda/ |
H A D | p15.cpp | 8 int array[3]; local 11 (void)[&array] () -> void {};
|
/external/clang/test/CXX/temp/temp.spec/temp.expl.spec/ |
H A D | p9.cpp | 13 int array[NumElements]; member in class:N::Y
|
/external/clang/test/Sema/ |
H A D | address-constant.c | 7 int *array[] = {&i, a, &s.i}; variable
|
/external/clang/test/SemaCXX/ |
H A D | static-array-member.cpp | 4 static int array[]; member in struct:X0 10 int X0::array[sizeof(X0) * 2]; member in class:X0 14 static T array[]; member in struct:X1 18 T X1<T, N>::array[N]; member in class:X1
|
/external/compiler-rt/lib/sanitizer_common/tests/ |
H A D | sanitizer_common_test.cc | 18 static bool IsSorted(const uptr *array, uptr n) { argument 20 if (array[i] < array[i - 1]) return false; 26 uptr array[100]; local 30 array[i] = i; 32 SortArray(array, n); 33 EXPECT_TRUE(IsSorted(array, n)); 36 array[i] = n - 1 - i; 38 SortArray(array, n); 39 EXPECT_TRUE(IsSorted(array, [all...] |
/external/quake/tools/ |
H A D | dumpms2.py | 22 import array namespace 26 a = array.array('i') 31 a = array.array('f') 43 vertexOrder = array.array('i')
|