/external/webkit/Source/WebKit2/Shared/API/c/ |
H A D | WKMutableArray.cpp | 36 RefPtr<MutableArray> array = MutableArray::create(); local 37 return toAPI(array.release().releaseRef());
|
/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/bouncycastle/src/main/java/org/bouncycastle/util/ |
H A D | Arrays.java | 4 * General array utilities. 107 * @param a first array 108 * @param b second array 171 byte[] array, 174 for (int i = 0; i < array.length; i++) 176 array[i] = value; 181 long[] array, 184 for (int i = 0; i < array.length; i++) 186 array[i] = value; 191 short[] array, 170 fill( byte[] array, byte value) argument 180 fill( long[] array, long value) argument 190 fill( short[] array, short value) argument [all...] |
/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/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
|
/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/guava/src/com/google/common/collect/ |
H A D | ImmutableAsList.java | 33 ImmutableAsList(Object[] array, ImmutableCollection<E> collection) { argument 34 super(array, 0, array.length);
|
/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/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/include/core/ |
H A D | SkEndian.h | 45 low two bytes of each value in the array. 47 static inline void SkEndianSwap16s(uint16_t array[], int count) { argument 48 SkASSERT(count == 0 || array != NULL); 51 *array = SkEndianSwap16(*array); 52 array += 1; 67 bytes of each value in the array. 69 static inline void SkEndianSwap32s(uint32_t array[], int count) { argument 70 SkASSERT(count == 0 || array != NULL); 73 *array [all...] |
/external/skia/src/animator/ |
H A D | SkAnimateField.cpp | 108 SkTypedArray* array = (SkTypedArray*) fFieldInfo->memberData(fTarget); local 109 int count = array->count();
|
/external/skia/tests/ |
H A D | SortTest.cpp | 12 static void rand_array(SkRandom& rand, int array[], int n) { argument 14 array[j] = rand.nextS() & 0xFF; 19 const int array[], int n) { 21 if (array[j-1] > array[j]) { 24 array[j-1], array[j]); 31 int array[500]; local 35 int count = rand.nextRangeU(1, SK_ARRAY_COUNT(array)); 37 rand_array(rand, array, coun 18 check_sort(skiatest::Reporter* reporter, const char label[], const int array[], int n) argument [all...] |
/external/stlport/test/unit/ |
H A D | ptr2_test.cpp | 71 int array [3] = { 1, 2, 3 }; local 73 int* p = find_if((int*)array, (int*)array + 3, pointer_to_unary_function<int, bool>(even)); 74 CPPUNIT_ASSERT(p != array+3); 79 int array [3] = { 1, 2, 3 }; local 81 int* p = find_if((int*)array, (int*)array + 3, ptr_fun(even)); 82 CPPUNIT_ASSERT(p != array+3);
|
H A D | unary_test.cpp | 46 int array [3] = { 1, 2, 3 }; local 48 int* p = find_if((int*)array, (int*)array + 3, unary_negate<odd>(odd())); 49 CPPUNIT_ASSERT((p != array + 3)); 54 int array [3] = { 1, 2, 3 }; local 55 int* p = find_if((int*)array, (int*)array + 3, not1(odd())); 56 CPPUNIT_ASSERT(p != array + 3); 66 int array [3] = { 1, 2, 3 }; local 67 int* p = find_if((int*)array, (in [all...] |
/external/v8/test/mjsunit/ |
H A D | undeletable-functions.js | 34 var array; variable 36 array = [ 40 CheckJSCSemantics(Array.prototype, array, "Array prototype"); 49 array = [ 60 CheckJSCSemantics(Date.prototype, array, "Date prototype"); 62 array = [ 65 CheckJSCSemantics(Math, array, "Math1"); 69 array = [ 71 CheckDontDelete(Math, array, "Math2"); 73 array [all...] |
/external/valgrind/main/drd/tests/ |
H A D | custom_alloc.c | 67 int* array; local 70 array = custom_alloc(sizeof(int) * 10); 71 array[8] = 8; 72 array[9] = 8; 73 array[10] = 10; // invalid write (ok w/o MALLOCLIKE -- in superblock) 75 custom_free(array); // ok 83 return array[0]; // use after free (ok without MALLOCLIKE)
|
H A D | pth_barrier.c | 26 int* array; member in struct:threadinfo 42 /** Single thread, which touches p->iterations elements of array p->array. 43 * Each modification of an element of p->array is a data race. */ 47 int* const array = p->array; local 56 pthread_self(), i + 1, &array[i]); 57 array[i] = i; 69 int* array; local 72 array [all...] |
/external/valgrind/main/memcheck/tests/ |
H A D | custom_alloc.c | 73 int *array, *array3; local 76 array = custom_alloc(sizeof(int) * 10); 77 array[8] = 8; 78 array[9] = 8; 79 array[10] = 10; // invalid write (ok w/o MALLOCLIKE -- in superblock) 81 custom_free(array); // ok 89 x = array[0]; // use after free (ok without MALLOCLIKE/MAKE_MEM_NOACCESS)
|
/external/webkit/Source/JavaScriptCore/icu/unicode/ |
H A D | uset.h | 98 const uint16_t *array; member in struct:USerializedSet 100 * The length of the array that contains BMP characters. 105 * The total length of the array. 110 * A small buffer for the array to reduce memory allocations. 633 * Serializes this set into an array of 16-bit integers. Serialization 637 * The array 654 * The array starts with a header. After the header are n bmp 685 * Given a serialized array, fill in the given serialized set object. 687 * @param src pointer to start of array 688 * @param srcLength length of array [all...] |