| /external/chromium_org/third_party/skia/src/gpu/ |
| GrTHashCache.h | 95 const T* const* array = fSorted.begin(); local
100 if (Key::LT(*array[index], key)) {
108 if (Key::EQ(*array[high], key)) {
111 GrAssert(0 == high || Key::LT(*array[high - 1], key));
116 if (Key::LT(*array[high], key)) {
140 // bsearch for the key in our sorted array
146 const T* const* array = fSorted.begin(); local
150 GrAssert(0 == index || Key::LT(*array[index - 1], key));
152 for ( ; index < count() && Key::EQ(*array[index], key); ++index) {
171 // add it to our array
[all...] |
| /external/chromium_org/v8/src/ |
| allocation.h | 91 void DeleteArray(T* array) {
92 delete[] array;
|
| /external/chromium_org/v8/src/ia32/ |
| codegen-ia32.h | 63 static Operand FixedArrayElementOperand(Register array,
67 return FieldOperand(array, index_as_smi, times_half_pointer_size, offset);
|
| /external/chromium_org/v8/test/webkit/ |
| array-constructor-host-call.js | 25 "This tests that array construction via a host call works."
33 var array = constructArray(Array);
34 shouldBeTrue("array instanceof Array");
35 shouldBe("array.length", "100");
|
| dfg-dead-redundant-get-array-length.js | 25 "Tests that having a dead, and redundant, use of array.length doesn't cause compiler crashes."
28 function foo(array) {
29 var x = array.length; // This is dead. If it wasn't, it would be redundant with the one below.
30 return array.length;
|
| dfg-holy-put-by-val-interferes-with-get-array-length.js | 28 function foo(array) {
29 var x = array.length;
30 array[1] = 42;
31 return [x, array.length];
|
| dfg-negative-array-index.js | 25 "Tests that storing into a negative array index works right."
33 var array = [];
34 foo(array, -1);
35 shouldBe("array[-1]", "42");
|
| dfg-put-by-val-setter-then-get-by-val.js | 33 var array = []; variable
35 array.__defineSetter__(
38 array.__defineGetter__(
43 shouldBe("foo(array, -1, i)", "42");
|
| function-dot-apply-replace-base.js | 37 var array = [];
38 array.push(1);
39 array.push(2);
41 x = x.apply(void(0), array);
|
| /external/clang/test/Analysis/ |
| ptr-arith.c | 20 // The ElementRegion's type depends on the array region's rvalue type. If it was
55 p = &x + 1; // expected-warning{{Pointer arithmetic done on non-array variables means reliance on memory layout, which is dangerous}}
78 clang_analyzer_eval((&a - 0) != 0); // expected-warning{{TRUE}} expected-warning{{Pointer arithmetic done on non-array variables}}
114 int array[10]; local
115 int *a = &array[2];
116 int *b = &array[5];
126 int array[10]; local
127 int *a = &array[2];
128 char *b = (char*)&array[5];
150 int array[2] local
[all...] |
| /external/clang/test/PCH/ |
| exprs.h | 33 struct X array[5]; member in struct:Y
38 typedef typeof(__builtin_offsetof(struct Z, y.array[1 + 2].member))
|
| /external/clang/test/SemaTemplate/ |
| instantiate-c99.cpp | 46 T array = { local
48 [Subscript2] = val2 // expected-error{{exceeds array bounds}}
62 T array = { local
|
| temp_class_spec_neg.cpp | 27 int array[5]; variable
28 template< int X > class A2<X, &array> { }; // expected-error{{specializes}}
|
| /external/guava/guava/src/com/google/common/collect/ |
| Platform.java | 22 import java.lang.reflect.Array;
32 * Clone the given array using {@link Object#clone()}. It is factored out so
35 static <T> T[] clone(T[] array) {
36 return array.clone();
57 * Returns a new array of the given length with the specified component type.
60 * @param length the length of the new array
62 @GwtIncompatible("Array.newInstance(Class, int)")
65 return (T[]) Array.newInstance(type, length);
69 * Returns a new array of the given length with the same type as a reference
70 * array
[all...] |
| /external/guava/guava-testlib/src/com/google/common/collect/testing/ |
| AbstractMapTester.java | 75 * @return an array of the proper size with {@code null} as the key of the
79 Map.Entry<K, V>[] array = createSamplesArray(); local
81 final Map.Entry<K, V> oldEntry = array[nullKeyLocation];
82 array[nullKeyLocation] = entry(null, oldEntry.getValue());
83 return array;
103 * @return an array of the proper size with {@code null} as the value of the
107 Map.Entry<K, V>[] array = createSamplesArray(); local
109 final Map.Entry<K, V> oldEntry = array[nullValueLocation];
110 array[nullValueLocation] = entry(oldEntry.getKey(), null);
111 return array;
[all...] |
| /external/icu4c/common/unicode/ |
| uobject.h | 116 static void * GrowArray(void * array, int newSize );
117 static void FreeArray(void * array );
|
| /external/icu4c/test/letest/ |
| xmlreader.cpp | 45 le_uint32 *array = NEW_ARRAY(le_uint32, arraySize); local
61 sscanf(number, "%x", &array[count++]);
77 sscanf(number, "%x", &array[count]);
79 return array;
91 float *array = NEW_ARRAY(float, arraySize); local
107 sscanf(number, "%f", &array[count++]);
127 sscanf(number, "%f", &array[count]);
129 return array;
|
| /external/llvm/runtime/libprofile/ |
| PathProfiling.c | 47 void* array; member in struct:__anon24106
54 /* write an array table to file */
63 /* look through each entry in the array to determine whether the function
66 uint32_t pc = ((uint32_t*)ft->array)[arrayIterator];
159 if( ft[functionNumber-1].array == 0)
160 ft[functionNumber-1].array = calloc(sizeof(pathHashTable_t), 1);
162 hashTable = (pathHashTable_t*)((ftEntry_t*)ft)[functionNumber-1].array;
239 if( ft[i].array ) {
240 writeHashTable(i+1,ft[i].array);
242 free(ft[i].array);
[all...] |
| /external/mesa3d/src/gallium/drivers/trace/ |
| tr_dump.c | 504 trace_dump_writes("<array>");
512 trace_dump_writes("</array>");
|
| /external/mesa3d/src/gallium/state_trackers/clover/core/ |
| geometry.hpp | 26 #include <array>
31 /// N-dimensional coordinate array.
68 std::array<T, N> a;
|
| /external/replicaisland/src/com/replica/replicaisland/ |
| QuickSorter.java | 22 public void sort(Type[] array, int count, Comparator<Type> comparator) {
23 quicksort(array, 0, count - 1, comparator);
|
| /external/sfntly/cpp/src/sfntly/data/ |
| byte_array.cc | 95 int32_t ByteArray::CopyTo(ByteArray* array) {
96 return CopyTo(array, 0, Length());
99 int32_t ByteArray::CopyTo(ByteArray* array, int32_t offset, int32_t length) {
100 return CopyTo(0, array, offset, length);
103 int32_t ByteArray::CopyTo(int32_t dst_offset, ByteArray* array,
105 assert(array);
106 if (array->Size() < dst_offset + length) { // insufficient space
117 int bytes_written = array->Put(index + dst_offset, &(b[0]), 0, bytes_read);
|
| /external/sfntly/cpp/src/test/ |
| open_type_data_test.cc | 31 ByteArrayPtr array = new MemoryByteArray(&(bytes[0]), bytes.size()); local
32 ReadableFontDataPtr data = new ReadableFontData(array);
|
| /external/skia/src/gpu/ |
| GrTHashCache.h | 95 const T* const* array = fSorted.begin(); local
100 if (Key::LT(*array[index], key)) {
108 if (Key::EQ(*array[high], key)) {
111 GrAssert(0 == high || Key::LT(*array[high - 1], key));
116 if (Key::LT(*array[high], key)) {
140 // bsearch for the key in our sorted array
146 const T* const* array = fSorted.begin(); local
150 GrAssert(0 == index || Key::LT(*array[index - 1], key));
152 for ( ; index < count() && Key::EQ(*array[index], key); ++index) {
171 // add it to our array
[all...] |
| /external/v8/src/ |
| allocation.h | 91 void DeleteArray(T* array) {
92 delete[] array;
|
