/external/clang/test/CXX/expr/expr.unary/expr.sizeof/ |
H A D | p5-0x.cpp | 23 any array[sizeof...(inits)] = { inits... }; local
|
/external/clang/test/CodeGenCXX/ |
H A D | global-llvm-constant.cpp | 27 X1 array[3]; member in struct:X2
|
H A D | microsoft-abi-array-cookies.cpp | 11 ClassWithoutDtor *array = new ClassWithoutDtor[42]; local 14 delete [] array; 26 ClassWithDtor *array = new ClassWithDtor[42]; local 34 delete [] array; 48 ClassWithAlignment *array = new ClassWithAlignment[42]; local 56 delete [] array;
|
/external/clang/test/PCH/ |
H A D | stmts.h | 67 // variable-length array 68 int array[x * 17 + 3]; local
|
/external/clang/test/Sema/ |
H A D | warn-char-subscripts.c | 4 int array[1] = { 0 }; local 6 int val = array[subscript]; // expected-warning{{array subscript is of type 'char'}} 10 int array[1] = { 0 }; local 12 int val = subscript[array]; // expected-warning{{array subscript is of type 'char'}} 16 int *array = 0; local 18 int val = array[subscript]; // expected-warning{{array subscript is of type 'char'}} 22 int *array local 29 int *array = 0; local 34 int array[1] = { 0 }; local 40 int array[1] = { 0 }; local 47 int array[1] = { 0 }; local 54 int array[1] = { 0 }; local 61 int array[1] = { 0 }; local [all...] |
/external/clang/test/SemaCXX/ |
H A D | cast-conversion.cpp | 34 const char array[2] = { 'a', 'b' }; local 35 make_X0(array);
|
/external/clang/test/SemaTemplate/ |
H A D | instantiate-decl-init.cpp | 44 NonTrivial array[N]; local
|
/external/compiler-rt/BlocksRuntime/tests/ |
H A D | byrefcopyint.c | 57 voidVoid array[100]; local 59 array[i] = testRoutine(argv[0]); 60 array[i](); 63 Block_release(array[i]);
|
/external/compiler-rt/lib/asan/ |
H A D | asan_stats.cc | 29 uptr (&array)[kNumberOfSizeClasses]) { 32 if (!array[i]) continue; 33 Printf("%zu:%zu; ", i, array[i]); 28 PrintMallocStatsArray(const char *prefix, uptr (&array)[kNumberOfSizeClasses]) argument
|
/external/dexmaker/src/dx/java/com/android/dx/io/instructions/ |
H A D | ShortArrayCodeInput.java | 26 /** source array to read from */ 27 private final short[] array; field in class:ShortArrayCodeInput 32 public ShortArrayCodeInput(short[] array) { argument 33 if (array == null) { 34 throw new NullPointerException("array == null"); 37 this.array = array; 42 return cursor() < array.length; 48 int value = array[cursor()];
|
/external/eigen/demos/mix_eigen_and_c/ |
H A D | example.c | 34 // this helper function takes a plain C array and prints it in one line 35 void print_array(double *array, int n) argument 37 struct C_Map_MatrixXd *m = Map_MatrixXd_new(array, 1, n); 45 double array[5]; local 49 for(i = 0; i < 5; ++i) array[i] = i; 50 printf("Initially, the array is:\n"); 51 print_array(array, 5); 53 map = Map_MatrixXd_new(array, 5, 1); 57 printf("Now the array is:\n"); 58 print_array(array, [all...] |
/external/eigen/test/ |
H A D | dontalign.cpp | 43 Scalar* array = internal::aligned_new<Scalar>(rows); local 44 v = VectorType::MapAligned(array, rows); 45 internal::aligned_delete(array, rows);
|
H A D | first_aligned.cpp | 13 void test_first_aligned_helper(Scalar *array, int size) argument 16 VERIFY(((size_t(array) + sizeof(Scalar) * internal::first_aligned(array, size)) % packet_size) == 0); 20 void test_none_aligned_helper(Scalar *array, int size) argument 22 EIGEN_UNUSED_VARIABLE(array); 24 VERIFY(internal::packet_traits<Scalar>::size == 1 || internal::first_aligned(array, size) == size);
|
/external/eigen/test/eigen2/ |
H A D | eigen2_first_aligned.cpp | 13 void test_eigen2_first_aligned_helper(Scalar *array, int size) argument 16 VERIFY(((std::size_t(array) + sizeof(Scalar) * ei_alignmentOffset(array, size)) % packet_size) == 0); 20 void test_eigen2_none_aligned_helper(Scalar *array, int size) argument 22 VERIFY(ei_packet_traits<Scalar>::size == 1 || ei_alignmentOffset(array, size) == size);
|
/external/guava/guava/src/com/google/common/collect/ |
H A D | ImmutableAsList.java | 36 ImmutableAsList(Object[] array, ImmutableCollection<E> collection) { argument 37 super(array, 0, array.length);
|
H A D | SortedIterables.java | 93 E[] array = (E[]) Iterables.toArray(elements); 95 Arrays.sort(array, comparator); 97 return uniquifySortedArray(comparator, array); 101 Comparator<? super E> comparator, E[] array) { 102 if (array.length == 0) { 106 for (int i = 1; i < array.length; i++) { 107 int cmp = comparator.compare(array[i], array[length - 1]); 109 array[length++] = array[ 100 uniquifySortedArray( Comparator<? super E> comparator, E[] array) argument [all...] |
/external/guava/guava/src/com/google/common/util/concurrent/ |
H A D | Atomics.java | 59 * @param length the length of the array 68 * and all elements copied from, the given array. 70 * @param array the array to copy elements from 71 * @return a new {@code AtomicReferenceArray} copied from the given array 73 public static <E> AtomicReferenceArray<E> newReferenceArray(E[] array) { argument 74 return new AtomicReferenceArray<E>(array);
|
/external/icu4c/common/unicode/ |
H A D | uset.h | 220 const uint16_t *array; member in struct:USerializedSet 222 * The length of the array that contains BMP characters. 227 * The total length of the array. 232 * A small buffer for the array to reduce memory allocations. 1008 * Serializes this set into an array of 16-bit integers. Serialization 1012 * The array 1029 * The array starts with a header. After the header are n bmp 1060 * Given a serialized array, fill in the given serialized set object. 1062 * @param src pointer to start of array 1063 * @param srcLength length of array [all...] |
/external/icu4c/layoutex/ |
H A D | LXUtilities.cpp | 53 le_int32 LXUtilities::search(le_int32 value, const le_int32 array[], le_int32 count) argument 60 if (value >= array[extra]) { 67 if (value >= array[index + probe]) { 75 void LXUtilities::reverse(le_int32 array[], le_int32 length) argument 80 le_int32 swap = array[front]; 82 array[front] = array[back]; 83 array[back] = swap; 87 void LXUtilities::reverse(float array[], le_int32 length) argument 92 float swap = array[fron [all...] |
/external/jmonkeyengine/engine/src/blender/com/jme3/scene/plugins/blender/file/ |
H A D | DynamicArray.java | 37 * An array that can be dynamically modified/
40 * the type of stored data in the array
44 /** An array object that holds the required data. */
45 private T[] array;
field in class:DynamicArray 54 * Constructor. Builds an empty array of the specified sizes.
70 this.array = (T[]) new Object[totalSize];
74 * Constructor. Builds an empty array of the specified sizes.
92 this.array = data;
108 return array[position];
112 * This method returns a value on the specified position in multidimensional array [all...] |
/external/jmonkeyengine/engine/src/bullet-native/ |
H A D | com_jme3_bullet_util_NativeMeshUtil.cpp | 53 btTriangleIndexVertexArray* array = new btTriangleIndexVertexArray(numTriangles, triangles, triangleIndexStride, numVertices, vertices, vertexStride); local 54 return reinterpret_cast<jlong>(array);
|
/external/replicaisland/src/com/replica/replicaisland/ |
H A D | QuickSorter.java | 22 public void sort(Type[] array, int count, Comparator<Type> comparator) { argument 23 quicksort(array, 0, count - 1, comparator);
|
H A D | ShellSorter.java | 26 * to pass over the array each time. Currently this function uses Robert Cruse's suggestion 30 public void sort(Type[] array, int count, Comparator<Type> comparator) { argument 36 insertionSort(array, count, start, increment, comparator); 44 insertionSort(array, count, 0, 1, comparator ); 58 public void insertionSort(Type[] array, int count, int start, int increment, argument 67 int delta = comparator.compare(array[j], array[k]); 72 temp = array[j]; 74 array[j] = array[ [all...] |
/external/skia/src/animator/ |
H A D | SkAnimateField.cpp | 100 SkTypedArray* array = (SkTypedArray*) fFieldInfo->memberData(fTarget); local 101 int count = array->count();
|
/external/skia/tests/ |
H A D | SortTest.cpp | 19 static void rand_array(SkRandom& rand, int array[], int n) { argument 21 array[j] = rand.nextS() & 0xFF; 26 const int array[], int n) { 28 if (array[j-1] > array[j]) { 31 array[j-1], array[j]); 38 int array[500]; local 42 int count = rand.nextRangeU(1, SK_ARRAY_COUNT(array)); 44 rand_array(rand, array, coun 25 check_sort(skiatest::Reporter* reporter, const char label[], const int array[], int n) argument [all...] |