/external/clang/test/SemaCXX/ |
H A D | dependent-noexcept-unevaluated.cpp | 22 struct array struct 26 void swap(array& a) noexcept(noexcept(swap(declval<T&>(), declval<T&>()))); 39 array<DefaultOnly, 1> a, b;
|
/external/eigen/doc/examples/ |
H A D | Tutorial_ArrayClass_interop_matrix.cpp | 20 result = m.array() * n.array(); 24 result = m.array() + 4;
|
/external/guava/guava-tests/test/com/google/common/collect/ |
H A D | UnmodifiableIteratorTest.java | 35 final String[] array = {"a", "b", "c"}; 41 return i < array.length; 48 return array[i++];
|
/external/icu/icu4c/source/common/ |
H A D | unistr_props.cpp | 33 UChar *array = getArrayStart(); local 44 U16_PREV(array, 0, i, c); 61 U16_NEXT(array, i, length, c);
|
H A D | uarrsort.c | 64 uprv_stableBinarySearch(char *array, int32_t limit, void *item, int32_t itemSize, argument 69 /* Binary search until we get down to a tiny sub-array. */ 72 int32_t diff=cmp(context, item, array+i*itemSize); 94 /* Linear search over the remaining tiny sub-array. */ 96 int32_t diff=cmp(context, item, array+start*itemSize); 108 doInsertionSort(char *array, int32_t length, int32_t itemSize, argument 113 char *item=array+j*itemSize; 114 int32_t insertionPoint=uprv_stableBinarySearch(array, j, item, itemSize, cmp, context); 121 char *dest=array+insertionPoint*itemSize; 122 uprv_memcpy(pv, item, itemSize); /* v=array[ 130 insertionSort(char *array, int32_t length, int32_t itemSize, UComparator *cmp, const void *context, UErrorCode *pErrorCode) argument 168 subQuickSort(char *array, int32_t start, int32_t limit, int32_t itemSize, UComparator *cmp, const void *context, void *px, void *pw) argument 234 quickSort(char *array, int32_t length, int32_t itemSize, UComparator *cmp, const void *context, UErrorCode *pErrorCode) argument 265 uprv_sortArray(void *array, int32_t length, int32_t itemSize, UComparator *cmp, const void *context, UBool sortStable, UErrorCode *pErrorCode) argument [all...] |
/external/libcxx/test/containers/sequences/array/array.special/ |
H A D | swap.pass.cpp | 10 // <array> 12 // template <class T, size_t N> void swap(array<T,N>& x, array<T,N>& y); 14 #include <array> 21 typedef std::array<T, 3> C; 36 typedef std::array<T, 0> C;
|
/external/libcxx/test/containers/sequences/array/array.swap/ |
H A D | swap.pass.cpp | 10 // <array> 12 // void swap(array& a); 14 #include <array> 21 typedef std::array<T, 3> C; 36 typedef std::array<T, 0> C;
|
/external/libcxx/test/containers/sequences/array/array.tuple/ |
H A D | get_const.pass.cpp | 10 // <array> 12 // template <size_t I, class T, size_t N> const T& get(const array<T, N>& a); 14 #include <array> 21 typedef std::array<T, 3> C; 30 typedef std::array<T, 3> C;
|
/external/mesa3d/src/gallium/drivers/r300/compiler/ |
H A D | memory_pool.h | 51 * Generic helper for growing an array that has separate size/count 66 #define memory_pool_array_reserve(pool, type, array, size, reserved, num) do { \ 74 memcpy(newarray, (array), (size) * sizeof(type)); \ 75 (array) = newarray; \
|
/external/stlport/test/unit/ |
H A D | ostmit_test.cpp | 34 int array [] = { 1, 5, 2, 4 }; local 47 copy(array, array + 4, iter2);
|
/external/valgrind/main/drd/tests/ |
H A D | annotate_barrier.c | 45 int* array; member in struct:threadinfo 102 * Single thread, which touches p->iterations elements of array p->array. 103 * Each modification of an element of p->array is a data race. 108 int* const array = p->array; local 117 p->thread_num, i + 1, &array[i]); 118 array[i] = i; 131 int* array; local 134 array [all...] |
/external/chromium_org/v8/test/mjsunit/ |
H A D | array-functions-prototype-misc.js | 64 push_function = function(array, elt) { 65 return array.push(elt); 67 concat_function = function(array, other) { 68 return array.concat(other); 70 slice_function = function(array, start, len) { 71 return array.slice(start, len); 73 splice_function = function(array, start, len) { 74 return array.splice(start, len); 76 splice_function_2 = function(array, start, len, elt) { 77 return array [all...] |
/external/fio/ |
H A D | json.c | 19 struct json_array *array = malloc(sizeof(struct json_array)); local 20 if (array) 21 memset(array, 0, sizeof(struct json_array)); 22 return array; 116 static struct json_value *json_create_value_array(struct json_array *array) argument 122 value->array = array; 123 array->parent = value; 141 static void json_free_array(struct json_array *array) argument 145 for (i = 0; i < array 174 json_array_add_value(struct json_array *array, struct json_value *value) argument 241 json_array_add_value_type(struct json_array *array, int type, ...) argument 286 json_array_level(struct json_array *array) argument 330 json_print_array(struct json_array *array) argument [all...] |
/external/chromium_org/third_party/icu/source/common/ |
H A D | uarrsort.c | 64 uprv_stableBinarySearch(char *array, int32_t limit, void *item, int32_t itemSize, argument 69 /* Binary search until we get down to a tiny sub-array. */ 72 int32_t diff=cmp(context, item, array+i*itemSize); 94 /* Linear search over the remaining tiny sub-array. */ 96 int32_t diff=cmp(context, item, array+start*itemSize); 108 doInsertionSort(char *array, int32_t length, int32_t itemSize, argument 113 char *item=array+j*itemSize; 114 int32_t insertionPoint=uprv_stableBinarySearch(array, j, item, itemSize, cmp, context); 121 char *dest=array+insertionPoint*itemSize; 122 uprv_memcpy(pv, item, itemSize); /* v=array[ 130 insertionSort(char *array, int32_t length, int32_t itemSize, UComparator *cmp, const void *context, UErrorCode *pErrorCode) argument 168 subQuickSort(char *array, int32_t start, int32_t limit, int32_t itemSize, UComparator *cmp, const void *context, void *px, void *pw) argument 234 quickSort(char *array, int32_t length, int32_t itemSize, UComparator *cmp, const void *context, UErrorCode *pErrorCode) argument 265 uprv_sortArray(void *array, int32_t length, int32_t itemSize, UComparator *cmp, const void *context, UBool sortStable, UErrorCode *pErrorCode) argument [all...] |
/external/compiler-rt/lib/asan/tests/ |
H A D | asan_interface_test.cc | 30 char *array = Ident((char*)malloc(kArraySize)); local 35 EXPECT_EQ(true, __sanitizer_get_ownership(array)); 36 EXPECT_EQ(kArraySize, __sanitizer_get_allocated_size(array)); 46 EXPECT_FALSE(__sanitizer_get_ownership(array + kArraySize / 2)); 47 EXPECT_DEATH(__sanitizer_get_allocated_size(array + kArraySize / 2), 57 free(array); 58 EXPECT_FALSE(__sanitizer_get_ownership(array)); 59 EXPECT_DEATH(__sanitizer_get_allocated_size(array), 76 char *array; local 80 array 173 char *array = Ident((char*)malloc(120)); local 191 char *array = Ident((char*)malloc(120)); local 381 char *array = Ident((char*)malloc(120)); local [all...] |
/external/apache-harmony/support/src/test/java/tests/support/ |
H A D | Support_Proxy_I1.java | 23 int[] array(long[] f); method in interface:Support_Proxy_I1
|
/external/ceres-solver/include/ceres/internal/ |
H A D | macros.h | 66 // The arraysize(arr) macro returns the # of elements in an array arr. 71 // One caveat is that arraysize() doesn't accept any array of an 81 char (&ArraySizeHelper(T (&array)[N]))[N]; 88 char (&ArraySizeHelper(const T (&array)[N]))[N]; 91 #define arraysize(array) (sizeof(ArraySizeHelper(array))) 113 // the array) and sizeof(*(arr)) (the # of bytes in one array 115 // indeed an array, in which case the division result is the # of 116 // elements in the array [all...] |
/external/chromium_org/mojo/public/cpp/system/ |
H A D | macros.h | 29 // Used to calculate the number of elements in an array. 33 char (&ArraySizeHelper(T (&array)[N]))[N]; 36 char (&ArraySizeHelper(const T (&array)[N]))[N]; 39 #define MOJO_ARRAYSIZE(array) (sizeof(::mojo::ArraySizeHelper(array)))
|
/external/chromium_org/third_party/skia/src/core/ |
H A D | SkTSort.h | 28 /* Sifts a broken heap. The input array is a heap from root to bottom 31 * Sinks a hole from array[root] to leaf and then sifts the original array[root] element 39 * @param root the one based index into array of the out-of-place root of the heap. 40 * @param bottom the one based index in the array of the last entry in the heap. 43 void SkTHeapSort_SiftUp(T array[], size_t root, size_t bottom, C lessThan) { argument 44 T x = array[root-1]; 48 if (j < bottom && lessThan(array[j-1], array[j])) { 51 array[roo 77 SkTHeapSort_SiftDown(T array[], size_t root, size_t bottom, C lessThan) argument 102 SkTHeapSort(T array[], size_t count, C lessThan) argument 114 SkTHeapSort(T array[], size_t count) argument [all...] |
/external/chromium_org/v8/test/mjsunit/regress/ |
H A D | regress-crbug-351787.js | 10 var array = new Uint8Array(ab2); 11 for (var i = 0; i < array.length; i++) { 12 assertEquals(0, array[i]); 14 assertEquals(0, array.length);
|
/external/chromium_org/v8/test/webkit/ |
H A D | dfg-uint8clampedarray-out-of-bounds-put-by-val-alias.js | 36 var array = new Uint8ClampedArray(1); 37 shouldBe("foo(array, 100000000, 42)", "" + (void 0));
|
/external/clang/test/Analysis/ |
H A D | misc-ps-cxx0x.cpp | 52 int array[2] = { 1, 2 }; local 54 for ( int i : array ) 61 int array[2] = { 1, 2 }; local 63 for (int i : array)
|
/external/clang/test/CodeGen/ |
H A D | 2009-03-08-ZeroEltStructCrash.c | 10 int *array = u->contents.zero_arr; local
|
/external/eigen/doc/snippets/ |
H A D | PartialRedux_count.cpp | 3 cout << "Here is the count of elements larger or equal than 0.5 of each row:" << endl << (m.array() >= 0.5).rowwise().count() << endl;
|
/external/eigen/test/ |
H A D | nesting_ops.cpp | 22 VERIFY_IS_APPROX( (m.transpose() * m).diagonal().array().abs().sum(), (m.transpose() * m).diagonal().array().abs().sum() ); 24 VERIFY_IS_APPROX( (m.transpose() * m).array().abs().sum(), (m.transpose() * m).array().abs().sum() );
|