HomeSort by relevance Sort by last modified time
    Searched refs:arr (Results 101 - 125 of 740) sorted by null

1 2 3 45 6 7 8 91011>>

  /external/clang/test/CXX/basic/basic.scope/basic.scope.local/
p4-0x.cpp 5 int arr[] = {1, 2, 3}; local
18 for (int a : arr) // expected-note {{previous definition}}
36 for (int &a : arr) { // expected-note {{previous definition}}
65 for (int &a : arr) {{
  /external/dexmaker/src/dx/java/com/android/dx/util/
FixedSizeList.java 27 private Object[] arr; field in class:FixedSizeList
38 arr = new Object[size];
59 return Arrays.equals(arr, list.arr);
65 return Arrays.hashCode(arr);
124 return arr.length;
133 int sz = arr.length;
137 if (arr[i] != null) {
152 Object one = arr[i];
159 arr = newa
    [all...]
  /external/eigen/doc/snippets/
TopicAliasing_cwise.cpp 13 ArrayXXf arr = mat; variable
14 arr = arr.square();
15 cout << "After squaring, it becomes\n" << arr << endl << endl;
  /ndk/sources/host-tools/make-3.81/w32/subproc/
proc.h 28 extern bool_t arr2envblk(char **arr, char **envblk_out);
misc.c 39 arr2envblk(char **arr, char **envblk_out)
47 while (arr[arrcnt]) {
58 while (arr[arrcnt]) {
59 tmp[arrcnt] = arr[arrcnt];
60 size_needed += strlen(arr[arrcnt]) + 1;
  /external/clang/test/SemaCXX/
array-bounds.cpp 77 char arr[I]; // expected-note 3 {{declared here}} member in struct:S
81 s.arr[4] = 0; // expected-warning 2 {{array index 4 is past the end of the array (which contains 3 elements)}}
82 s.arr[I] = 0; // expected-warning {{array index 5 is past the end of the array (which contains 3 elements)}}
90 #define ARR_IN_MACRO(flag, arr, idx) flag ? arr[idx] : 1
93 int arr[SIZE]; // expected-note {{array 'arr' declared here}} local
94 return ARR_IN_MACRO(0, arr, SIZE) + // no-warning
95 ARR_IN_MACRO(1, arr, SIZE); // expected-warning{{array index 10 is past the end of the array (which contains 10 elements)}}
108 int arr[3 + (extendArray ? 1 : 0)] local
116 int arr[3 + (extendArray ? 1 : 0)]; \/\/ expected-note {{array 'arr' declared here}} local
135 int arr[2] = { 0, 0 }; \/\/ expected-note {{array 'arr' declared here}} local
144 int arr[2]; local
149 int arr[2]; \/\/ expected-note {{array 'arr' declared here}} local
154 int arr[2]; local
    [all...]
warn-empty-body.cpp 37 int arr[3] = { 1, 2, 3 }; local
38 for (int j : arr); // expected-warning{{range-based for loop has empty body}} expected-note{{put the semicolon on a separate line to silence this warning}}
42 arr); // expected-warning{{range-based for loop has empty body}} expected-note{{put the semicolon on a separate line to silence this warning}}
102 int arr[3] = { 1, 2, 3 }; local
103 for (int j : arr) // no-warning
135 int arr[3] = { 1, 2, 3 }; local
136 for (int j : arr) EMPTY(j); // no-warning
139 arr) EMPTY(j); // no-warning
216 int arr[3] = { 1, 2, 3 }; local
217 for (int j : arr) // no-warnin
250 int arr[3] = { 1, 2, 3 }; local
267 int arr[3] = { 1, 2, 3 }; local
    [all...]
  /external/clang/test/CodeGenCXX/
debug-info-determinism.cpp 7 int arr[M] = {}; local
8 return arr[M/2] + C<M/2>().template f<M-1>();
2009-08-11-VectorRetTy.cpp 11 Func arr[] = { variable
  /external/clang/test/CoverageMapping/
loops.cpp 5 int arr[] = { 1, 2, 3, 4, 5 }; local
7 for(auto i : arr) { // CHECK-NEXT: File 0, [[@LINE]]:21 -> [[@LINE+2]]:4 = #1
  /external/clang/test/Index/
print-type.c 3 int *f(int *p, char *x, FooType z, int arr[5], void (*fn)(int)) {
6 return p + z + arr[3];
21 // CHECK: ParmDecl=arr:3:40 (Definition) [type=int [5]] [typekind=ConstantArray] [isPOD=1]
40 // CHECK: UnexposedExpr=arr:3:40 [type=int [5]] [typekind=ConstantArray] [isPOD=1]
  /external/valgrind/memcheck/tests/
fwrite.c 7 char* arr = malloc(10); local
12 (void)write(fd, arr, 10);
inline.c 6 static int addemup ( int* arr )
10 j += arr[i];
  /libcore/luni/src/test/java/libcore/java/nio/charset/
CharsetDecoderTest.java 42 byte[] arr = encode("UTF-16", "Android");
43 ByteBuffer inBuffer = ByteBuffer.wrap(arr, 0, arr.length).slice();
44 CharBuffer outBuffer = CharBuffer.allocate(arr.length);
56 byte[] arr = encode("UTF-16", "Android");
57 arr = prependByteToByteArray(arr, new Integer(1).byteValue());
59 ByteBuffer inBuffer = ByteBuffer.wrap(arr, offset, arr.length - offset).slice();
60 CharBuffer outBuffer = CharBuffer.allocate(arr.length - offset)
    [all...]
  /cts/tools/vm-tests-tf/src/dot/junit/opcodes/aput_object/
Test_aput_object.java 33 String[] arr = new String[2]; local
34 t.run(arr, 0, "hello");
35 assertEquals("hello", arr[0]);
44 String[] arr = new String[2]; local
46 t.run(arr, 1, value[i]);
47 assertEquals(value[i], arr[1]);
56 Integer[] arr = new Integer[2]; local
58 t.run(arr, 0, value);
59 assertEquals(value, arr[0]);
  /art/test/117-nopatchoat/src/
Main.java 36 String arr[] = {"This", "is", "a", "function", "call"}; local
38 for (int i = 0; i < arr.length; i++) {
39 ret = ret + arr[i] + " ";
  /dalvik/dx/tests/064-dex-array-access/
Blort.java 70 int[][][] arr = (int[][][]) x; local
71 arr[0][0][0] = 123;
72 return arr[1][2][3];
  /external/deqp/framework/common/
tcuArray.hpp 53 std::ostream& operator<< (std::ostream& stream, const Array<T, Size>& arr)
55 return stream << Format::Array<T*>(arr.getPtr(), arr.getPtr() + Size);
  /external/deqp/modules/gles2/functional/
es2fShaderStructTests.cpp     [all...]
  /external/deqp/modules/gles3/functional/
es3fShaderStructTests.cpp     [all...]
  /cts/tools/vm-tests-tf/src/dot/junit/opcodes/move_result_object/
Test_move_result_object.java 38 int[] arr = t.run(); local
39 if(arr.length != 2 || arr[0] != 1 || arr[1] != 2)
  /external/clang/test/Parser/
expressions.c 34 int arr[10]; local
35 (void)sizeof arr[0];
36 (void)sizeof(arr[0]);
37 (void)sizeof(arr)[0];
  /external/v8/test/mjsunit/regress/
regress-crbug-390918.js 8 var arr = {a: 1.1};
11 arr[2 * scale] = 0;
  /external/libvpx/libvpx/vp8/encoder/
rdopt.h 21 static void insertsortmv(int arr[], int len)
29 if ( arr[j] > arr[i] )
33 temp = arr[i];
36 arr[k] = arr[k - 1] ;
38 arr[j] = temp ;
44 static void insertsortsad(int arr[],int idx[], int len)
52 if ( arr[j] > arr[i]
    [all...]
  /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp8/encoder/
rdopt.h 21 static void insertsortmv(int arr[], int len)
29 if ( arr[j] > arr[i] )
33 temp = arr[i];
36 arr[k] = arr[k - 1] ;
38 arr[j] = temp ;
44 static void insertsortsad(int arr[],int idx[], int len)
52 if ( arr[j] > arr[i]
    [all...]

Completed in 1166 milliseconds

1 2 3 45 6 7 8 91011>>