/prebuilts/go/darwin-x86/test/fixedbugs/ |
issue7525d.go | 7 // Issue 7525: self-referential array types. 14 b [unsafe.Offsetof(x.b)]int // ERROR "array bound|typechecking loop|invalid array"
|
issue7525e.go | 7 // Issue 7525: self-referential array types. 14 c [unsafe.Alignof(x.c)]int // ERROR "array bound|typechecking loop|invalid array"
|
issue13365.go | 7 // issue 13365: confusing error message (array vs slice) 19 _ = [10]int{100: 0} // ERROR "array index 100 out of bounds" 22 _ = []int{t} // ERROR "cannot use .* as type int in array or slice literal" 23 _ = [10]int{t} // ERROR "cannot use .* as type int in array or slice literal" 24 _ = [...]int{t} // ERROR "cannot use .* as type int in array or slice literal"
|
/prebuilts/go/linux-x86/test/fixedbugs/ |
issue5609.go | 7 // issue 5609: overflow when calculating array size 13 var foo [Large]uint64 // ERROR "array bound is too large|array bound overflows"
|
issue7525b.go | 7 // Issue 7525: self-referential array types. 12 d [len(y.d)]int // ERROR "array bound|typechecking loop|invalid array"
|
issue7525c.go | 7 // Issue 7525: self-referential array types. 12 e [cap(z.e)]int // ERROR "array bound|typechecking loop|invalid array"
|
issue7525d.go | 7 // Issue 7525: self-referential array types. 14 b [unsafe.Offsetof(x.b)]int // ERROR "array bound|typechecking loop|invalid array"
|
issue7525e.go | 7 // Issue 7525: self-referential array types. 14 c [unsafe.Alignof(x.c)]int // ERROR "array bound|typechecking loop|invalid array"
|
issue13365.go | 7 // issue 13365: confusing error message (array vs slice) 19 _ = [10]int{100: 0} // ERROR "array index 100 out of bounds" 22 _ = []int{t} // ERROR "cannot use .* as type int in array or slice literal" 23 _ = [10]int{t} // ERROR "cannot use .* as type int in array or slice literal" 24 _ = [...]int{t} // ERROR "cannot use .* as type int in array or slice literal"
|
/prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/array/array.swap/ |
swap.pass.cpp | 10 // <array> 12 // void swap(array& a); 13 // namespace std { void swap(array<T, N> &x, array<T, N> &y); 16 #include <array> 20 // std::array is explicitly allowed to be initialized with A a = { init-list };. 35 typedef std::array<T, 3> C; 50 typedef std::array<T, 3> C; 66 typedef std::array<T, 0> C; 75 typedef std::array<T, 0> C [all...] |
/prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/array/ |
front_back.pass.cpp | 10 // <array> 17 #include <array> 22 // std::array is explicitly allowed to be initialized with A a = { init-list };. 29 std::array<double, 3> arr = {1, 2, 3.5}; 35 std::array<double, 3> arr = {1, 2, 3.5}; 44 typedef std::array<T, 3> C; 59 typedef std::array<T, 3> C; 71 typedef std::array<T, 3> C;
|
/external/skia/src/core/ |
SkEndian.h | 39 low two bytes of each value in the array. 41 static inline void SkEndianSwap16s(uint16_t array[], int count) { 42 SkASSERT(count == 0 || array != nullptr); 45 *array = SkEndianSwap16(*array); 46 array += 1; 68 bytes of each value in the array. 70 static inline void SkEndianSwap32s(uint32_t array[], int count) { 71 SkASSERT(count == 0 || array != nullptr); 74 *array = SkEndianSwap32(*array) [all...] |
/external/skqp/src/core/ |
SkEndian.h | 39 low two bytes of each value in the array. 41 static inline void SkEndianSwap16s(uint16_t array[], int count) { 42 SkASSERT(count == 0 || array != nullptr); 45 *array = SkEndianSwap16(*array); 46 array += 1; 68 bytes of each value in the array. 70 static inline void SkEndianSwap32s(uint32_t array[], int count) { 71 SkASSERT(count == 0 || array != nullptr); 74 *array = SkEndianSwap32(*array) [all...] |
/packages/apps/DeskClock/src/com/android/deskclock/settings/ |
SimpleMenuPreference.java | 62 private static void restoreOriginalOrder(CharSequence[] array, 64 final CharSequence item = array[0]; 65 System.arraycopy(array, 1, array, 0, lastSelectedOriginalPosition); 66 array[lastSelectedOriginalPosition] = item; 69 private static void swapSelectedToFront(CharSequence[] array, int position) { 70 final CharSequence item = array[position]; 71 System.arraycopy(array, 0, array, 1, position); 72 array[0] = item [all...] |
/frameworks/native/opengl/tools/glgen/stubs/gles11/ |
common.cpp | 77 getPointer(JNIEnv *_env, jobject buffer, jarray *array, jint *remaining, jint *offset) 91 *array = NULL; 95 *array = (jarray) _env->CallStaticObjectMethod(nioAccessClass, 105 static void* Get(JNIEnv* _env, jbyteArray array, jboolean* is_copy) { 106 return _env->GetByteArrayElements(array, is_copy); 111 static void* Get(JNIEnv* _env, jbooleanArray array, jboolean* is_copy) { 112 return _env->GetBooleanArrayElements(array, is_copy); 117 static void* Get(JNIEnv* _env, jcharArray array, jboolean* is_copy) { 118 return _env->GetCharArrayElements(array, is_copy); 123 static void* Get(JNIEnv* _env, jshortArray array, jboolean* is_copy) [all...] |
/art/compiler/optimizing/ |
load_store_analysis_test.cc | 38 // array ParameterValue 43 // array_get1 ArrayGet [array, c1] 44 // array_get2 ArrayGet [array, c2] 45 // array_set1 ArraySet [array, c1, c3] 46 // array_set2 ArraySet [array, index, c3] 47 HInstruction* array = new (GetAllocator()) HParameterValue( local 54 HInstruction* array_get1 = new (GetAllocator()) HArrayGet(array, c1, DataType::Type::kInt32, 0); 55 HInstruction* array_get2 = new (GetAllocator()) HArrayGet(array, c2, DataType::Type::kInt32, 0); 57 new (GetAllocator()) HArraySet(array, c1, c3, DataType::Type::kInt32, 0); 59 new (GetAllocator()) HArraySet(array, index, c3, DataType::Type::kInt32, 0) 190 HInstruction* array = new (GetAllocator()) HParameterValue( local 280 HInstruction* array = new (GetAllocator()) HParameterValue( local 485 HInstruction* array = new (GetAllocator()) HParameterValue( local 607 HInstruction* array = new (GetAllocator()) HParameterValue(graph_->GetDexFile(), local [all...] |
/external/eigen/unsupported/Eigen/CXX11/src/util/ |
EmulateArray.h | 15 // The array class is only available starting with cxx11. Emulate our own here 21 template <typename T, size_t n> class array { class in namespace:Eigen 44 EIGEN_STRONG_INLINE array() { } function in class:Eigen::array 46 EIGEN_STRONG_INLINE array(const T& v) { function in class:Eigen::array 51 EIGEN_STRONG_INLINE array(const T& v1, const T& v2) { function in class:Eigen::array 57 EIGEN_STRONG_INLINE array(const T& v1, const T& v2, const T& v3) { function in class:Eigen::array 64 EIGEN_STRONG_INLINE array(const T& v1, const T& v2, const T& v3, function in class:Eigen::array 73 EIGEN_STRONG_INLINE array(const T& v1, const T& v2, const T& v3, const T& v4, function in class:Eigen::array 83 EIGEN_STRONG_INLINE array(const T& v1, const T& v2, const T& v3, const T& v4, function in class:Eigen::array 94 EIGEN_STRONG_INLINE array(const T& v1, const T& v2, const T& v3, const T& v4 function in class:Eigen::array 106 EIGEN_STRONG_INLINE array( function in class:Eigen::array 122 EIGEN_STRONG_INLINE array(std::initializer_list<T> l) { function in class:Eigen::array 131 template <typename T> class array<T, 0> { class in namespace:Eigen 168 EIGEN_STRONG_INLINE array() : dummy() { } function in class:Eigen::array 171 EIGEN_DEVICE_FUNC array(std::initializer_list<T> l) : dummy() { function in class:Eigen::array [all...] |
/external/fio/ |
json.c | 110 static struct json_value *json_create_value_array(struct json_array *array) 116 value->array = array; 117 array->parent = value; 135 static void json_free_array(struct json_array *array) 139 for (i = 0; i < array->value_cnt; i++) 140 json_free_value(array->values[i]); 141 free(array->values); 142 free(array); 162 json_free_array(value->array); [all...] |
/external/bart/tests/ |
test_common_utils.py | 44 array = [1, 1, 0, 0] 45 series = pd.Series(array) 51 array = [0, 0, 1, 1] 52 series = pd.Series(array) 57 array = [False, False, True, True, True, True, False, False] 58 series = pd.Series(array) 64 array = [0, 0, 2, 2, 2, 1, 1, 1] 65 series = pd.Series(array) 83 array = [1] 84 series = pd.Series(array) [all...] |
/external/tensorflow/tensorflow/compiler/tests/ |
argminmax_test.py | 37 inp: numpy input array to use as input to 'op'. 38 expected: numpy array representing the expected output of 'op'. 54 np.array([1, 10, 27, 3, 3, 4], dtype=dtype), 58 np.array([[4, 1, 7], [3, 2, 4]], dtype=dtype), 59 expected=np.array([0, 1, 0], dtype=np.int32)) 62 np.array([[4, 1], [3, 2]], dtype=dtype), 63 expected=np.array([0, 0], dtype=np.int32)) 67 np.array([3, 10, 27, 3, 2, 4], dtype=dtype), 71 np.array([[4, 1, 7], [3, 2, 4]], dtype=dtype), 72 expected=np.array([1, 0, 1], dtype=np.int32) [all...] |
/external/strace/ |
mpers.awk | 33 array_return = array[array_idx, array_member] 47 if ((array_idx, "seq") in array) 48 return array[array_idx, "seq"] 50 array[array_idx, "seq"] = index_seq 73 count = array[idx, "count"] 76 array[idx, "count"] = count * val 77 array[idx, "upper_bound"] = array[idx, "upper_bound"] "[" val "]" 106 to_return = array[what_idx, "upper_bound"] 109 returned_size = array[what_idx, "count"] * returned_siz [all...] |
/external/tensorflow/tensorflow/contrib/lite/toco/ |
dump_graphviz.cc | 109 void AppendArrayVal(string* string, Array const& array, int index) { 110 if (array.buffer->type == ArrayDataType::kFloat) { 111 const auto& data = array.GetBuffer<ArrayDataType::kFloat>().data; 116 } else if (array.buffer->type == ArrayDataType::kUint8) { 117 const auto& data = array.GetBuffer<ArrayDataType::kUint8>().data; 122 } else if (array.buffer->type == ArrayDataType::kInt32) { 123 const auto& data = array.GetBuffer<ArrayDataType::kInt32>().data; 128 } else if (array.buffer->type == ArrayDataType::kInt64) { 129 const auto& data = array.GetBuffer<ArrayDataType::kInt64>().data 144 auto& array = model.GetArray(array_name); local 168 const auto& array = model.GetArray(array_name); local 287 const string array = arrays_to_produce.back(); local [all...] |
/libcore/ojluni/src/main/java/java/beans/ |
ChangeListenerMap.java | 51 * Creates an array of listeners. 53 * the same instance of the empty array 56 * @param length the array length 57 * @return an array with specified length 81 L[] array = this.map.get(name); local 82 int size = (array != null) 83 ? array.length 88 if (array != null) { 89 System.arraycopy(array, 0, clone, 0, size); 104 L[] array = this.map.get(name) local 217 L[] array = this.map.get(null); local [all...] |
/libcore/ojluni/src/main/java/java/util/concurrent/atomic/ |
AtomicIntegerArray.java | 42 * An {@code int} array in which elements may be updated atomically. 55 private final int[] array; field in class:AtomicIntegerArray 61 throw new Error("array index scale not a power of two"); 66 if (i < 0 || i >= array.length) 80 * @param length the length of the array 83 array = new int[length]; 88 * all elements copied from, the given array. 90 * @param array the array to copy elements from 91 * @throws NullPointerException if array is nul [all...] |
AtomicLongArray.java | 42 * A {@code long} array in which elements may be updated atomically. 54 private final long[] array; field in class:AtomicLongArray 60 throw new Error("array index scale not a power of two"); 65 if (i < 0 || i >= array.length) 79 * @param length the length of the array 82 array = new long[length]; 87 * all elements copied from, the given array. 89 * @param array the array to copy elements from 90 * @throws NullPointerException if array is nul [all...] |