/frameworks/base/core/java/com/android/internal/util/ |
BitwiseInputStream.java | 97 byte[] arr = new byte[bytes]; 100 arr[i] = (byte)(read(increment) << (8 - increment)); 102 return arr;
|
BitwiseOutputStream.java | 110 * @param arr the byte array containing data to be written 112 public void writeByteArray(int bits, byte[] arr) throws AccessException { 113 for (int i = 0; i < arr.length; i++) { 116 write(increment, (byte)(arr[i] >>> (8 - increment)));
|
/external/clang/test/Analysis/inlining/ |
path-notes.cpp | 229 Wrapper *arr; member in struct:Owner 234 if (arr) // expected-note {{Assuming pointer value is null}} 237 arr[1].x = 1; //expected-warning {{Dereference of null pointer}} 242 Owner::Wrapper *arr; // expected-note {{'arr' declared without an initial value}} local 243 arr[2].x = 1; // expected-warning {{Dereference of undefined pointer value}} [all...] |
/external/jmonkeyengine/engine/src/terrain/com/jme3/terrain/noise/filter/ |
PerturbFilter.java | 58 float[] arr = data.array();
local 76 float c00 = arr[this.wrap(y - py, workSize) * workSize + this.wrap(x - px, workSize)];
77 float c01 = arr[this.wrap(y - py, workSize) * workSize + this.wrap(x + px, workSize)];
78 float c10 = arr[this.wrap(y + py, workSize) * workSize + this.wrap(x - px, workSize)];
79 float c11 = arr[this.wrap(y + py, workSize) * workSize + this.wrap(x + px, workSize)];
|
/external/llvm/unittests/Support/ |
IteratorTest.cpp | 20 int arr[4] = { 1, 2, 3, 4 }; local 22 V.push_back(&arr[0]); 23 V.push_back(&arr[1]); 24 V.push_back(&arr[2]); 25 V.push_back(&arr[3]);
|
/external/v8/test/webkit/ |
cached-call-uninitialized-arguments.js | 29 function doForEach(arr) { 54 arr.forEach(callback); 57 function callAfterRecursingForDepth(depth, func, arr) { 59 callAfterRecursingForDepth(depth - 1, func, arr); 61 func(arr); 65 var arr = [1]; variable 66 callAfterRecursingForDepth(20, doForEach, arr);
|
/external/apache-harmony/support/src/test/java/tests/support/ |
Support_Exec.java | 64 Object[] arr = exec(command, args, envp, displayOutput); local 66 Process proc = (Process) arr[0]; 86 ((StringBuilder) arr[1]).toString() 96 Object[] arr = local 99 return getProcessOutput(arr, displayOutput, true); 108 Object[] arr = local 111 return getProcessOutput(arr, displayOutput, true); 114 private static String getProcessOutput(Object[] arr, boolean displayOutput, 117 Process proc = (Process) arr[0]; 133 checkStderr(arr); [all...] |
/external/libcxx/test/std/containers/unord/unord.map/unord.map.cnstr/ |
range.pass.cpp | 108 P arr[] = local 117 C c(input_iterator<P*>(arr), input_iterator<P*>(arr + sizeof(arr)/sizeof(arr[0])), 14); 140 P arr[] = local 151 C c(input_iterator<P*>(arr), input_iterator<P*>(arr + sizeof(arr)/sizeof(arr[0])), 14, hf, a) [all...] |
/external/libcxx/test/std/containers/unord/unord.multiset/unord.multiset.cnstr/ |
range.pass.cpp | 103 T arr[] = local 113 C c(input_iterator<T*>(arr), input_iterator<T*>(arr + sizeof(arr)/sizeof(arr[0])), 12, a); 136 T arr[] = local 147 C c(input_iterator<T*>(arr), input_iterator<T*>(arr + sizeof(arr)/sizeof(arr[0])), 16, hf, a) [all...] |
/external/libcxx/test/std/containers/unord/unord.set/unord.set.cnstr/ |
range.pass.cpp | 103 T arr[] = local 113 C c(input_iterator<T*>(arr), input_iterator<T*>(arr + sizeof(arr)/sizeof(arr[0])), 12, a); 136 T arr[] = local 147 C c(input_iterator<T*>(arr), input_iterator<T*>(arr + sizeof(arr)/sizeof(arr[0])), 16, hf, a) [all...] |
/external/v8/test/mjsunit/ |
elide-double-hole-check-3.js | 34 var arr = [0.0,,]; 35 assertEquals(0.5, f(arr, 0)); 36 assertEquals(0.5, f(arr, 0)); 38 assertEquals(0.5, f(arr, 0)); 39 assertEquals(NaN, f(arr, 1));
|
elide-double-hole-check-4.js | 33 var arr = [0.0,,2.5]; variable 34 assertEquals(0.5, f1(arr, 0)); 35 assertEquals(0.5, f1(arr, 0)); 37 assertEquals(0.5, f1(arr, 0)); 39 assertEquals(2, f1(arr, 1));
|
elide-double-hole-check-6.js | 33 var arr = [0.0,,2.5]; variable 34 assertEquals(0.5, f1(arr, 0)); 35 assertEquals(0.5, f1(arr, 0)); 37 assertEquals(0.5, f1(arr, 0)); 39 assertEquals(2, f1(arr, 1));
|
elide-double-hole-check-8.js | 33 var arr = [0.0,,2.5]; variable 34 assertEquals(0.5, f1(arr, 0)); 35 assertEquals(0.5, f1(arr, 0)); 37 assertEquals(0.5, f1(arr, 0)); 40 assertEquals(2, f1(arr, 1));
|
elide-double-hole-check-9.js | 42 var arr = [0.0,,2.5]; variable 43 assertEquals(0.5, f(arr, 0)); 44 assertEquals(0.5, f(arr, 0)); 46 assertEquals(0.5, f(arr, 0)); 48 assertEquals(2, f(arr, 1));
|
/external/v8/test/mjsunit/regress/ |
regress-1849.js | 33 var arr = new Array(count); 34 assertFalse(%HasFastDoubleElements(arr)); 36 arr[i] = 0; 38 assertFalse(%HasFastDoubleElements(arr)); 39 assertTrue(%HasFastSmiElements(arr));
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.map/unord.map.cnstr/ |
range.pass.cpp | 108 P arr[] = local 117 C c(input_iterator<P*>(arr), input_iterator<P*>(arr + sizeof(arr)/sizeof(arr[0])), 14); 140 P arr[] = local 151 C c(input_iterator<P*>(arr), input_iterator<P*>(arr + sizeof(arr)/sizeof(arr[0])), 14, hf, a) [all...] |
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multiset/unord.multiset.cnstr/ |
range.pass.cpp | 103 T arr[] = local 113 C c(input_iterator<T*>(arr), input_iterator<T*>(arr + sizeof(arr)/sizeof(arr[0])), 12, a); 136 T arr[] = local 147 C c(input_iterator<T*>(arr), input_iterator<T*>(arr + sizeof(arr)/sizeof(arr[0])), 16, hf, a) [all...] |
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.set/unord.set.cnstr/ |
range.pass.cpp | 103 T arr[] = local 113 C c(input_iterator<T*>(arr), input_iterator<T*>(arr + sizeof(arr)/sizeof(arr[0])), 12, a); 136 T arr[] = local 147 C c(input_iterator<T*>(arr), input_iterator<T*>(arr + sizeof(arr)/sizeof(arr[0])), 16, hf, a) [all...] |
/external/clang/test/Sema/ |
designated-initializers.c | 157 int arr[10]; member in struct:foo 161 [1] .arr [1] = 2, 162 [4] .arr [2] = 4 167 float *arr[10]; member in struct:bar 172 .f.arr[3] = 1, 173 .arr = { &f }
|
/external/jmonkeyengine/engine/src/core/com/jme3/animation/ |
CompactArray.java | 171 * @param arr the array
175 protected float[] ensureCapacity(float[] arr, int size) {
176 if (arr == null) {
178 } else if (arr.length >= size) {
179 return arr;
182 System.arraycopy(arr, 0, tmp, 0, arr.length);
184 //return Arrays.copyOf(arr, size);
|
/dalvik/dexgen/src/com/android/dexgen/dex/code/ |
PositionList.java | 76 PositionList.Entry[] arr = new PositionList.Entry[sz]; local 99 arr[at] = new PositionList.Entry(insn.getAddress(), pos); 107 result.set(i, arr[i]);
|
/dalvik/dx/src/com/android/dx/dex/code/ |
PositionList.java | 76 PositionList.Entry[] arr = new PositionList.Entry[sz]; local 99 arr[at] = new PositionList.Entry(insn.getAddress(), pos); 107 result.set(i, arr[i]);
|
/external/clang/test/SemaTemplate/ |
instantiate-self.cpp | 67 typedef int arr[f(T())]; 71 typedef int arr[g(T())]; 83 typedef int arr[g(T())];
|
/external/dexmaker/src/dx/java/com/android/dx/dex/code/ |
PositionList.java | 76 PositionList.Entry[] arr = new PositionList.Entry[sz]; local 99 arr[at] = new PositionList.Entry(insn.getAddress(), pos); 107 result.set(i, arr[i]);
|